1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-98, 1999 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Process declarations and symbol lookup for C front end.
24 Also constructs types; the standard scalar types at initialization,
25 and structure, union, array and enum types when they are declared. */
27 /* ??? not all decl nodes are given the most useful possible
28 line numbers. For example, the CONST_DECLs for enum values. */
48 #define obstack_chunk_alloc xmalloc
49 #define obstack_chunk_free free
51 extern struct obstack permanent_obstack
;
53 extern int current_class_depth
;
55 extern tree static_ctors
, static_dtors
;
57 extern tree global_namespace
;
59 extern int (*valid_lang_attribute
) PROTO ((tree
, tree
, tree
, tree
));
61 /* Use garbage collection. */
65 #ifndef WCHAR_UNSIGNED
66 #define WCHAR_UNSIGNED 0
69 #ifndef CHAR_TYPE_SIZE
70 #define CHAR_TYPE_SIZE BITS_PER_UNIT
73 #ifndef BOOL_TYPE_SIZE
74 #ifdef SLOW_BYTE_ACCESS
75 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
77 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
81 /* We let tm.h override the types used here, to handle trivial differences
82 such as the choice of unsigned int or long unsigned int for size_t.
83 When machines start needing nontrivial differences in the size type,
84 it would be best to do something here to figure out automatically
85 from other information what type to use. */
88 #define SIZE_TYPE "long unsigned int"
92 #define PTRDIFF_TYPE "long int"
96 #define WCHAR_TYPE "int"
99 static tree grokparms
PROTO((tree
, int));
100 static const char *redeclaration_error_message
PROTO((tree
, tree
));
102 static void push_binding_level
PROTO((struct binding_level
*, int,
104 static void pop_binding_level
PROTO((void));
105 static void suspend_binding_level
PROTO((void));
106 static void resume_binding_level
PROTO((struct binding_level
*));
107 static struct binding_level
*make_binding_level
PROTO((void));
108 static void declare_namespace_level
PROTO((void));
109 static void signal_catch
PROTO((int)) ATTRIBUTE_NORETURN
;
110 static void storedecls
PROTO((tree
));
111 static void require_complete_types_for_parms
PROTO((tree
));
112 static void push_overloaded_decl_1
PROTO((tree
));
113 static int ambi_op_p
PROTO((tree
));
114 static int unary_op_p
PROTO((tree
));
115 static tree store_bindings
PROTO((tree
, tree
));
116 static tree lookup_tag_reverse
PROTO((tree
, tree
));
117 static tree obscure_complex_init
PROTO((tree
, tree
));
118 static tree maybe_build_cleanup_1
PROTO((tree
, tree
));
119 static tree lookup_name_real
PROTO((tree
, int, int, int));
120 static void warn_extern_redeclared_static
PROTO((tree
, tree
));
121 static void grok_reference_init
PROTO((tree
, tree
, tree
));
122 static tree grokfndecl
PROTO((tree
, tree
, tree
, tree
, int,
123 enum overload_flags
, tree
,
124 tree
, int, int, int, int, int, int, tree
));
125 static tree grokvardecl
PROTO((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
126 static tree lookup_tag
PROTO((enum tree_code
, tree
,
127 struct binding_level
*, int));
128 static void set_identifier_type_value_with_scope
129 PROTO((tree
, tree
, struct binding_level
*));
130 static void record_builtin_type
PROTO((enum rid
, const char *, tree
));
131 static void record_unknown_type
PROTO((tree
, const char *));
132 static int member_function_or_else
PROTO((tree
, tree
, const char *));
133 static void bad_specifiers
PROTO((tree
, const char *, int, int, int, int,
135 static void lang_print_error_function
PROTO((const char *));
136 static tree maybe_process_template_type_declaration
PROTO((tree
, int, struct binding_level
*));
137 static void check_for_uninitialized_const_var
PROTO((tree
));
138 static unsigned long typename_hash
PROTO((hash_table_key
));
139 static boolean typename_compare
PROTO((hash_table_key
, hash_table_key
));
140 static void push_binding
PROTO((tree
, tree
, struct binding_level
*));
141 static int add_binding
PROTO((tree
, tree
));
142 static void pop_binding
PROTO((tree
, tree
));
143 static tree local_variable_p_walkfn
PROTO((tree
*, int *, void *));
144 static tree find_binding
PROTO((tree
, tree
));
145 static tree select_decl
PROTO((tree
, int));
146 static int lookup_flags
PROTO((int, int));
147 static tree qualify_lookup
PROTO((tree
, int));
148 static tree record_builtin_java_type
PROTO((const char *, int));
149 static const char *tag_name
PROTO((enum tag_types code
));
150 static void find_class_binding_level
PROTO((void));
151 static struct binding_level
*innermost_nonclass_level
PROTO((void));
152 static void warn_about_implicit_typename_lookup
PROTO((tree
, tree
));
153 static int walk_namespaces_r
PROTO((tree
, walk_namespaces_fn
, void *));
154 static int walk_globals_r
PROTO((tree
, void *));
155 static void add_decl_to_level
PROTO((tree
, struct binding_level
*));
156 static tree make_label_decl
PROTO((tree
, int));
157 static void pop_label
PROTO((tree
));
158 static void pop_labels
PROTO((tree
));
159 static void maybe_deduce_size_from_array_init
PROTO((tree
, tree
));
160 static void layout_var_decl
PROTO((tree
));
161 static void maybe_commonize_var
PROTO((tree
));
162 static tree check_initializer
PROTO((tree
, tree
));
163 static void make_rtl_for_nonlocal_decl
PROTO((tree
, tree
, const char *));
164 static void push_cp_function_context
PROTO((struct function
*));
165 static void pop_cp_function_context
PROTO((struct function
*));
166 static void mark_binding_level
PROTO((void *));
167 static void mark_cp_function_context
PROTO((struct function
*));
168 static void mark_saved_scope
PROTO((void *));
169 static void mark_lang_function
PROTO((struct language_function
*));
170 static void mark_stmt_tree
PROTO((struct stmt_tree
*));
171 static void save_function_data
PROTO((tree
));
172 static void check_function_type
PROTO((tree
));
173 static void destroy_local_static
PROTO((tree
));
174 static void destroy_local_var
PROTO((tree
));
175 static void finish_constructor_body
PROTO((void));
176 static void finish_destructor_body
PROTO((void));
177 static tree create_array_type_for_decl
PROTO((tree
, tree
, tree
));
179 #if defined (DEBUG_CP_BINDING_LEVELS)
180 static void indent
PROTO((void));
183 /* Erroneous argument lists can use this *IFF* they do not modify it. */
184 tree error_mark_list
;
186 /* The following symbols are subsumed in the cp_global_trees array, and
187 listed here individually for documentation purposes.
190 tree wchar_decl_node;
193 tree vtable_entry_type;
194 tree delta_type_node;
197 tree __baselist_desc_type_node;
198 tree __i_desc_type_node, __m_desc_type_node;
199 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
201 tree __t_desc_type_node;
203 tree __tp_desc_type_node;
205 tree __access_mode_type_node;
206 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
207 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
208 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
210 Not needed yet? May be needed one day?
211 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
212 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
213 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
216 tree class_star_type_node;
217 tree class_type_node, record_type_node, union_type_node, enum_type_node;
218 tree unknown_type_node;
220 Array type `vtable_entry_type[]'
223 tree vtbl_ptr_type_node;
229 A FUNCTION_DECL which can call `abort'. Not necessarily the
230 one that the user will declare, but sufficient to be called
231 by routines that want to abort the program.
235 The FUNCTION_DECL for the default `::operator delete'.
237 tree global_delete_fndecl;
240 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
244 tree cp_global_trees
[CPTI_MAX
];
246 /* Indicates that there is a type value in some namespace, although
247 that is not necessarily in scope at the moment. */
249 static tree global_type_node
;
254 /* Expect only namespace names now. */
255 static int only_namespace_names
;
257 /* If original DECL_RESULT of current function was a register,
258 but due to being an addressable named return value, would up
259 on the stack, this variable holds the named return value's
260 original location. */
262 #define original_result_rtx cp_function_chain->x_result_rtx
264 struct named_label_list
266 struct binding_level
*binding_level
;
269 const char *filename_o_goto
;
271 struct named_label_list
*next
;
274 /* Used only for jumps to as-yet undefined labels, since jumps to
275 defined labels can have their validity checked by stmt.c. */
277 #define named_label_uses cp_function_chain->x_named_label_uses
279 /* A list of objects which have constructors or destructors
280 which reside in the global scope. The decl is stored in
281 the TREE_VALUE slot and the initializer is stored
282 in the TREE_PURPOSE slot. */
283 tree static_aggregates
;
287 /* A node for the integer constants 2, and 3. */
289 tree integer_two_node
, integer_three_node
;
291 /* Parsing a function declarator leaves here a chain of structure
292 and enum types declared in the parmlist. */
294 static tree last_function_parm_tags
;
296 /* Similar, for last_function_parm_tags. */
297 tree last_function_parms
;
298 static tree current_function_parm_tags
;
300 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
301 that have names. Here so we can clear out their names' definitions
302 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
303 TREE_PURPOSE is the previous binding of the label. */
305 #define named_labels cp_function_chain->x_named_labels
307 /* The FUNCTION_DECL for the function currently being compiled,
308 or 0 if between functions. */
309 tree current_function_decl
;
311 /* Set to 0 at beginning of a function definition, and whenever
312 a label (case or named) is defined. Set to value of expression
313 returned from function when that value can be transformed into
314 a named return value. */
316 tree current_function_return_value
;
318 /* Nonzero means give `double' the same size as `float'. */
320 extern int flag_short_double
;
322 /* Nonzero means don't recognize any builtin functions. */
324 extern int flag_no_builtin
;
326 /* Nonzero means don't recognize the non-ANSI builtin functions.
329 extern int flag_no_nonansi_builtin
;
331 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
333 extern int flag_huge_objects
;
335 /* Nonzero if we want to conserve space in the .o files. We do this
336 by putting uninitialized data and runtime initialized data into
337 .common instead of .data at the expense of not flagging multiple
339 extern int flag_conserve_space
;
341 /* C and C++ flags are in decl2.c. */
343 /* Flag used when debugging spew.c */
345 extern int spew_debug
;
347 /* A expression of value 0 with the same precision as a sizetype
349 tree signed_size_zero_node
;
351 /* The name of the anonymous namespace, throughout this translation
353 tree anonymous_namespace_name
;
356 /* For each binding contour we allocate a binding_level structure
357 which records the names defined in that contour.
360 1) one for each function definition,
361 where internal declarations of the parameters appear.
362 2) one for each compound statement,
363 to record its declarations.
365 The current meaning of a name can be found by searching the levels
366 from the current one out to the global one.
368 Off to the side, may be the class_binding_level. This exists only
369 to catch class-local declarations. It is otherwise nonexistent.
371 Also there may be binding levels that catch cleanups that must be
372 run when exceptions occur. Thus, to see whether a name is bound in
373 the current scope, it is not enough to look in the
374 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
377 /* Note that the information in the `names' component of the global contour
378 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
382 /* A chain of _DECL nodes for all variables, constants, functions,
383 and typedef types. These are in the reverse of the order
384 supplied. There may be OVERLOADs on this list, too, but they
385 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
388 /* A list of structure, union and enum definitions, for looking up
390 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
391 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
392 or ENUMERAL_TYPE node.
394 C++: the TREE_VALUE nodes can be simple types for
395 component_bindings. */
398 /* A list of USING_DECL nodes. */
401 /* A list of used namespaces. PURPOSE is the namespace,
402 VALUE the common ancestor with this binding_level's namespace. */
403 tree using_directives
;
405 /* If this binding level is the binding level for a class, then
406 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
407 is the name of an entity bound in the class; the TREE_VALUE is
408 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
409 when leaving class scope, we can restore the
410 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
411 the DECL bound by this name in the class. */
414 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
415 is used for all binding levels. */
418 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
419 label in this scope. The TREE_PURPOSE is the previous value of
420 the IDENTIFIER_LABEL VALUE. */
421 tree shadowed_labels
;
423 /* For each level (except not the global one),
424 a chain of BLOCK nodes for all the levels
425 that were entered and exited one level down. */
428 /* The BLOCK node for this level, if one has been preallocated.
429 If 0, the BLOCK is allocated (if needed) when the level is popped. */
432 /* The binding level which this one is contained in (inherits from). */
433 struct binding_level
*level_chain
;
435 /* List of decls in `names' that have incomplete
436 structure or union types. */
439 /* List of VAR_DECLS saved from a previous for statement.
440 These would be dead in ANSI-conforming code, but might
441 be referenced in ARM-era code. These are stored in a
442 TREE_LIST; the TREE_VALUE is the actual declaration. */
443 tree dead_vars_from_for
;
445 /* 1 for the level that holds the parameters of a function.
446 2 for the level that holds a class declaration.
447 3 for levels that hold parameter declarations. */
448 unsigned parm_flag
: 4;
450 /* 1 means make a BLOCK for this level regardless of all else.
451 2 for temporary binding contours created by the compiler. */
454 /* Nonzero if this level "doesn't exist" for tags. */
455 unsigned tag_transparent
: 1;
457 /* Nonzero if this level can safely have additional
458 cleanup-needing variables added to it. */
459 unsigned more_cleanups_ok
: 1;
460 unsigned have_cleanups
: 1;
462 /* Nonzero if this level is for storing the decls for template
463 parameters and generic decls; these decls will be discarded and
464 replaced with a TEMPLATE_DECL. */
465 unsigned pseudo_global
: 1;
467 /* This is set for a namespace binding level. */
468 unsigned namespace_p
: 1;
470 /* True if this level is that of a for-statement where we need to
471 worry about ambiguous (ARM or ANSI) scope rules. */
472 unsigned is_for_scope
: 1;
474 /* True if this level corresponds to an EH region, as for a try block. */
475 unsigned eh_region
: 1;
477 /* One bit left for this word. */
479 #if defined(DEBUG_CP_BINDING_LEVELS)
480 /* Binding depth at which this level began. */
481 unsigned binding_depth
;
482 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
485 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
487 /* The binding level currently in effect. */
489 #define current_binding_level \
491 ? cp_function_chain->bindings \
492 : scope_chain->bindings)
494 /* The binding level of the current class, if any. */
496 #define class_binding_level scope_chain->class_bindings
498 /* A chain of binding_level structures awaiting reuse. */
500 static struct binding_level
*free_binding_level
;
502 /* The outermost binding level, for names of file scope.
503 This is created when the compiler is started and exists
504 through the entire run. */
506 static struct binding_level
*global_binding_level
;
508 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
510 static int keep_next_level_flag
;
512 #if defined(DEBUG_CP_BINDING_LEVELS)
513 static int binding_depth
= 0;
514 static int is_class_level
= 0;
521 for (i
= 0; i
< binding_depth
*2; i
++)
524 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
526 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
529 push_binding_level (newlevel
, tag_transparent
, keep
)
530 struct binding_level
*newlevel
;
531 int tag_transparent
, keep
;
533 /* Add this level to the front of the chain (stack) of levels that
535 bzero ((char*) newlevel
, sizeof (struct binding_level
));
536 newlevel
->level_chain
= current_binding_level
;
537 current_binding_level
= newlevel
;
538 newlevel
->tag_transparent
= tag_transparent
;
539 newlevel
->more_cleanups_ok
= 1;
541 /* We are called before expand_start_bindings, but after
542 expand_eh_region_start for a try block; so we check this now,
543 before the EH block is covered up. */
544 newlevel
->eh_region
= is_eh_region ();
546 newlevel
->keep
= keep
;
547 #if defined(DEBUG_CP_BINDING_LEVELS)
548 newlevel
->binding_depth
= binding_depth
;
550 fprintf (stderr
, "push %s level 0x%08x line %d\n",
551 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
554 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
557 /* Find the innermost enclosing class scope, and reset
558 CLASS_BINDING_LEVEL appropriately. */
561 find_class_binding_level ()
563 struct binding_level
*level
= current_binding_level
;
565 while (level
&& level
->parm_flag
!= 2)
566 level
= level
->level_chain
;
567 if (level
&& level
->parm_flag
== 2)
568 class_binding_level
= level
;
570 class_binding_level
= 0;
576 if (global_binding_level
)
578 /* Cannot pop a level, if there are none left to pop. */
579 if (current_binding_level
== global_binding_level
)
580 my_friendly_abort (123);
582 /* Pop the current level, and free the structure for reuse. */
583 #if defined(DEBUG_CP_BINDING_LEVELS)
586 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
587 (is_class_level
) ? "class" : "block",
588 current_binding_level
, lineno
);
589 if (is_class_level
!= (current_binding_level
== class_binding_level
))
592 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
595 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
597 register struct binding_level
*level
= current_binding_level
;
598 current_binding_level
= current_binding_level
->level_chain
;
599 level
->level_chain
= free_binding_level
;
600 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
601 if (level
->binding_depth
!= binding_depth
)
603 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
604 free_binding_level
= level
;
605 find_class_binding_level ();
610 suspend_binding_level ()
612 if (class_binding_level
)
613 current_binding_level
= class_binding_level
;
615 if (global_binding_level
)
617 /* Cannot suspend a level, if there are none left to suspend. */
618 if (current_binding_level
== global_binding_level
)
619 my_friendly_abort (123);
621 /* Suspend the current level. */
622 #if defined(DEBUG_CP_BINDING_LEVELS)
625 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
626 (is_class_level
) ? "class" : "block",
627 current_binding_level
, lineno
);
628 if (is_class_level
!= (current_binding_level
== class_binding_level
))
631 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
634 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
635 current_binding_level
= current_binding_level
->level_chain
;
636 find_class_binding_level ();
640 resume_binding_level (b
)
641 struct binding_level
*b
;
643 /* Resuming binding levels is meant only for namespaces,
644 and those cannot nest into classes. */
645 my_friendly_assert(!class_binding_level
, 386);
646 /* Also, resuming a non-directly nested namespace is a no-no. */
647 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
648 current_binding_level
= b
;
649 #if defined(DEBUG_CP_BINDING_LEVELS)
650 b
->binding_depth
= binding_depth
;
652 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
653 (is_class_level
) ? "class" : "block", b
, lineno
);
656 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
659 /* Create a new `struct binding_level'. */
662 struct binding_level
*
663 make_binding_level ()
666 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
669 /* Nonzero if we are currently in the global binding level. */
674 return current_binding_level
== global_binding_level
;
677 /* Return the innermost binding level that is not for a class scope. */
679 static struct binding_level
*
680 innermost_nonclass_level ()
682 struct binding_level
*b
;
684 b
= current_binding_level
;
685 while (b
->parm_flag
== 2)
691 /* Nonzero if we are currently in a toplevel binding level. This
692 means either the global binding level or a namespace in a toplevel
693 binding level. Since there are no non-toplevel namespace levels,
694 this really means any namespace or pseudo-global level. We also
695 include a class whose context is toplevel. */
698 toplevel_bindings_p ()
700 struct binding_level
*b
= innermost_nonclass_level ();
702 return b
->namespace_p
|| b
->pseudo_global
;
705 /* Nonzero if this is a namespace scope, or if we are defining a class
706 which is itself at namespace scope, or whose enclosing class is
707 such a class, etc. */
710 namespace_bindings_p ()
712 struct binding_level
*b
= innermost_nonclass_level ();
714 return b
->namespace_p
;
717 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
718 unconditionally. Otherwise, use the normal logic to decide whether
719 or not to create a BLOCK. */
722 keep_next_level (keep
)
725 keep_next_level_flag
= keep
;
728 /* Nonzero if the current level needs to have a BLOCK made. */
733 return (current_binding_level
->blocks
!= NULL_TREE
734 || current_binding_level
->keep
735 || current_binding_level
->names
!= NULL_TREE
736 || (current_binding_level
->tags
!= NULL_TREE
737 && !current_binding_level
->tag_transparent
));
741 declare_pseudo_global_level ()
743 current_binding_level
->pseudo_global
= 1;
747 declare_namespace_level ()
749 current_binding_level
->namespace_p
= 1;
753 pseudo_global_level_p ()
755 return current_binding_level
->pseudo_global
;
759 set_class_shadows (shadows
)
762 class_binding_level
->class_shadowed
= shadows
;
765 /* Enter a new binding level.
766 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
767 not for that of tags. */
770 pushlevel (tag_transparent
)
773 struct binding_level
*newlevel
;
775 if (current_function
&& !doing_semantic_analysis_p ())
778 /* Reuse or create a struct for this binding level. */
779 #if defined(DEBUG_CP_BINDING_LEVELS)
781 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
782 if (free_binding_level
)
783 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
785 newlevel
= free_binding_level
;
786 free_binding_level
= free_binding_level
->level_chain
;
789 newlevel
= make_binding_level ();
791 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
792 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
793 keep_next_level_flag
= 0;
797 note_level_for_for ()
799 current_binding_level
->is_for_scope
= 1;
802 /* For a binding between a name and an entity at a block scope,
803 this is the `struct binding_level' for the block. */
804 #define BINDING_LEVEL(NODE) \
805 (((struct tree_binding*)NODE)->scope.level)
807 /* Make DECL the innermost binding for ID. The LEVEL is the binding
808 level at which this declaration is being bound. */
811 push_binding (id
, decl
, level
)
814 struct binding_level
* level
;
818 binding
= make_node (CPLUS_BINDING
);
820 /* Now, fill in the binding information. */
821 BINDING_VALUE (binding
) = decl
;
822 BINDING_TYPE (binding
) = NULL_TREE
;
823 BINDING_LEVEL (binding
) = level
;
824 INHERITED_VALUE_BINDING_P (binding
) = 0;
825 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
826 BINDING_HAS_LEVEL_P (binding
) = 1;
828 /* And put it on the front of the list of bindings for ID. */
829 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
830 IDENTIFIER_BINDING (id
) = binding
;
833 /* ID is already bound in the current scope. But, DECL is an
834 additional binding for ID in the same scope. This is the `struct
835 stat' hack whereby a non-typedef class-name or enum-name can be
836 bound at the same level as some other kind of entity. It's the
837 responsibility of the caller to check that inserting this name is
838 legal here. Returns nonzero if the new binding was successful. */
840 add_binding (id
, decl
)
844 tree binding
= IDENTIFIER_BINDING (id
);
847 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
848 /* The new name is the type name. */
849 BINDING_TYPE (binding
) = decl
;
850 else if (!BINDING_VALUE (binding
))
851 /* This situation arises when push_class_level_binding moves an
852 inherited type-binding out of the way to make room for a new
854 BINDING_VALUE (binding
) = decl
;
855 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
856 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
858 /* The old binding was a type name. It was placed in
859 BINDING_VALUE because it was thought, at the point it was
860 declared, to be the only entity with such a name. Move the
861 type name into the type slot; it is now hidden by the new
863 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
864 BINDING_VALUE (binding
) = decl
;
865 INHERITED_VALUE_BINDING_P (binding
) = 0;
867 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
868 && TREE_CODE (decl
) == TYPE_DECL
869 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
870 && same_type_p (TREE_TYPE (decl
),
871 TREE_TYPE (BINDING_VALUE (binding
))))
872 /* We have two typedef-names, both naming the same type to have
873 the same name. This is OK because of:
877 In a given scope, a typedef specifier can be used to redefine
878 the name of any type declared in that scope to refer to the
879 type to which it already refers. */
883 cp_error ("declaration of `%#D'", decl
);
884 cp_error_at ("conflicts with previous declaration `%#D'",
885 BINDING_VALUE (binding
));
892 /* Add DECL to the list of things declared in B. */
895 add_decl_to_level (decl
, b
)
897 struct binding_level
*b
;
899 /* We build up the list in reverse order, and reverse it later if
901 TREE_CHAIN (decl
) = b
->names
;
905 /* Bind DECL to ID in the current_binding_level, assumed to be a local
906 binding level. If PUSH_USING is set in FLAGS, we know that DECL
907 doesn't really belong to this binding level, that it got here
908 through a using-declaration. */
911 push_local_binding (id
, decl
, flags
)
916 struct binding_level
*b
;
918 /* Skip over any local classes. This makes sense if we call
919 push_local_binding with a friend decl of a local class. */
920 b
= current_binding_level
;
921 while (b
->parm_flag
== 2)
924 if (lookup_name_current_level (id
))
926 /* Supplement the existing binding. */
927 if (!add_binding (id
, decl
))
928 /* It didn't work. Something else must be bound at this
929 level. Do not add DECL to the list of things to pop
934 /* Create a new binding. */
935 push_binding (id
, decl
, b
);
937 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
938 /* We must put the OVERLOAD into a TREE_LIST since the
939 TREE_CHAIN of an OVERLOAD is already used. Similarly for
940 decls that got here through a using-declaration. */
941 decl
= build_tree_list (NULL_TREE
, decl
);
943 /* And put DECL on the list of things declared by the current
945 add_decl_to_level (decl
, b
);
948 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
949 binding was successful. */
952 push_class_binding (id
, decl
)
957 tree binding
= IDENTIFIER_BINDING (id
);
960 /* Note that we declared this value so that we can issue an error if
961 this an illegal redeclaration of a name already used for some
963 note_name_declared_in_class (id
, decl
);
965 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
966 /* Supplement the existing binding. */
967 result
= add_binding (id
, decl
);
969 /* Create a new binding. */
970 push_binding (id
, decl
, class_binding_level
);
972 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
973 class-level declaration. Note that we do not use DECL here
974 because of the possibility of the `struct stat' hack; if DECL is
975 a class-name or enum-name we might prefer a field-name, or some
977 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
979 /* If this is a binding from a base class, mark it as such. */
980 binding
= IDENTIFIER_BINDING (id
);
981 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
983 /* Any implicit typename must be from a base-class. The
984 context for an implicit typename declaration is always
985 the derived class in which the lookup was done, so the checks
986 based on the context of DECL below will not trigger. */
987 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
988 INHERITED_VALUE_BINDING_P (binding
) = 1;
991 if (TREE_CODE (decl
) == OVERLOAD
)
992 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
995 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
997 context
= DECL_REAL_CONTEXT (decl
);
1000 if (is_properly_derived_from (current_class_type
, context
))
1001 INHERITED_VALUE_BINDING_P (binding
) = 1;
1003 INHERITED_VALUE_BINDING_P (binding
) = 0;
1006 else if (BINDING_VALUE (binding
) == decl
)
1007 /* We only encounter a TREE_LIST when push_class_decls detects an
1008 ambiguity. Such an ambiguity can be overridden by a definition
1010 INHERITED_VALUE_BINDING_P (binding
) = 1;
1015 /* Remove the binding for DECL which should be the innermost binding
1019 pop_binding (id
, decl
)
1025 if (id
== NULL_TREE
)
1026 /* It's easiest to write the loops that call this function without
1027 checking whether or not the entities involved have names. We
1028 get here for such an entity. */
1031 /* Get the innermost binding for ID. */
1032 binding
= IDENTIFIER_BINDING (id
);
1034 /* The name should be bound. */
1035 my_friendly_assert (binding
!= NULL_TREE
, 0);
1037 /* The DECL will be either the ordinary binding or the type
1038 binding for this identifier. Remove that binding. */
1039 if (BINDING_VALUE (binding
) == decl
)
1040 BINDING_VALUE (binding
) = NULL_TREE
;
1041 else if (BINDING_TYPE (binding
) == decl
)
1042 BINDING_TYPE (binding
) = NULL_TREE
;
1044 my_friendly_abort (0);
1046 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1047 /* We're completely done with the innermost binding for this
1048 identifier. Unhook it from the list of bindings. */
1049 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1052 /* When a label goes out of scope, check to see if that label was used
1053 in a valid manner, and issue any appropriate warnings or errors. */
1059 tree label
= TREE_VALUE (link
);
1061 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1063 if (DECL_INITIAL (label
) == NULL_TREE
)
1065 cp_error_at ("label `%D' used but not defined", label
);
1066 /* Avoid crashing later. */
1067 define_label (input_filename
, 1, DECL_NAME (label
));
1069 else if (warn_unused
&& !TREE_USED (label
))
1070 cp_warning_at ("label `%D' defined but not used", label
);
1073 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1076 /* At the end of a function, all labels declared within the fucntion
1077 go out of scope. BLOCK is the top-level block for the
1086 /* Clear out the definitions of all label names, since their scopes
1088 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1091 /* Put the labels into the "variables" of the top-level block,
1092 so debugger can see them. */
1093 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1094 BLOCK_VARS (block
) = TREE_VALUE (link
);
1097 named_labels
= NULL_TREE
;
1100 /* Exit a binding level.
1101 Pop the level off, and restore the state of the identifier-decl mappings
1102 that were in effect when this level was entered.
1104 If KEEP == 1, this level had explicit declarations, so
1105 and create a "block" (a BLOCK node) for the level
1106 to record its declarations and subblocks for symbol table output.
1108 If FUNCTIONBODY is nonzero, this level is the body of a function,
1109 so create a block as if KEEP were set and also clear out all
1112 If REVERSE is nonzero, reverse the order of decls before putting
1113 them into the BLOCK. */
1116 poplevel (keep
, reverse
, functionbody
)
1122 /* The chain of decls was accumulated in reverse order.
1123 Put it into forward order, just for cleanliness. */
1125 int tmp
= functionbody
;
1126 int real_functionbody
;
1129 tree block
= NULL_TREE
;
1131 int block_previously_created
;
1132 int leaving_for_scope
;
1134 if (current_function
&& !doing_semantic_analysis_p ())
1137 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1140 real_functionbody
= (current_binding_level
->keep
== 2
1141 ? ((functionbody
= 0), tmp
) : functionbody
);
1142 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1143 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1145 my_friendly_assert (!current_binding_level
->class_shadowed
,
1148 /* We used to use KEEP == 2 to indicate that the new block should go
1149 at the beginning of the list of blocks at this binding level,
1150 rather than the end. This hack is no longer used. */
1151 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1153 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1154 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1155 current_binding_level
->parm_flag
,
1156 current_binding_level
->keep
);
1158 if (current_binding_level
->keep
== 1)
1161 /* Get the decls in the order they were written.
1162 Usually current_binding_level->names is in reverse order.
1163 But parameter decls were previously put in forward order. */
1166 current_binding_level
->names
1167 = decls
= nreverse (current_binding_level
->names
);
1169 decls
= current_binding_level
->names
;
1171 /* Output any nested inline functions within this block
1172 if they weren't already output. */
1174 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1175 if (TREE_CODE (decl
) == FUNCTION_DECL
1176 && ! TREE_ASM_WRITTEN (decl
)
1177 && DECL_INITIAL (decl
) != NULL_TREE
1178 && TREE_ADDRESSABLE (decl
)
1179 && decl_function_context (decl
) == current_function_decl
)
1181 /* If this decl was copied from a file-scope decl
1182 on account of a block-scope extern decl,
1183 propagate TREE_ADDRESSABLE to the file-scope decl. */
1184 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1185 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1188 push_function_context ();
1189 output_inline_function (decl
);
1190 pop_function_context ();
1194 /* If there were any declarations or structure tags in that level,
1195 or if this level is a function body,
1196 create a BLOCK to record them for the life of this function. */
1199 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1200 if (block_previously_created
)
1201 block
= current_binding_level
->this_block
;
1202 else if (keep
== 1 || functionbody
)
1203 block
= make_node (BLOCK
);
1204 if (block
!= NULL_TREE
)
1206 if (block_previously_created
)
1208 if (decls
|| tags
|| subblocks
)
1210 if (BLOCK_VARS (block
))
1211 warning ("internal compiler error: debugging info corrupted");
1213 BLOCK_VARS (block
) = decls
;
1215 /* We can have previous subblocks and new subblocks when
1216 doing fixup_gotos with complex cleanups. We chain the new
1217 subblocks onto the end of any pre-existing subblocks. */
1218 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1224 BLOCK_VARS (block
) = decls
;
1225 BLOCK_SUBBLOCKS (block
) = subblocks
;
1229 /* In each subblock, record that this is its superior. */
1232 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1233 BLOCK_SUPERCONTEXT (link
) = block
;
1235 /* We still support the old for-scope rules, whereby the variables
1236 in a for-init statement were in scope after the for-statement
1237 ended. We only use the new rules in flag_new_for_scope is
1240 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1242 /* Remove declarations for all the DECLs in this level. */
1243 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1245 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1248 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1252 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1254 ns_binding
= NULL_TREE
;
1257 && (BINDING_LEVEL (outer_binding
)
1258 == current_binding_level
->level_chain
))
1259 /* We have something like:
1264 and we are leaving the `for' scope. There's no reason to
1265 keep the binding of the inner `i' in this case. */
1266 pop_binding (DECL_NAME (link
), link
);
1267 else if ((outer_binding
1268 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1271 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1272 /* Here, we have something like:
1280 We must pop the for-scope binding so we know what's a
1281 type and what isn't. */
1282 pop_binding (DECL_NAME (link
), link
);
1285 /* Mark this VAR_DECL as dead so that we can tell we left it
1286 there only for backward compatibility. */
1287 DECL_DEAD_FOR_LOCAL (link
) = 1;
1289 /* Keep track of what should of have happenned when we
1290 popped the binding. */
1291 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1292 DECL_SHADOWED_FOR_VAR (link
)
1293 = BINDING_VALUE (outer_binding
);
1295 /* Add it to the list of dead variables in the next
1296 outermost binding to that we can remove these when we
1297 leave that binding. */
1298 current_binding_level
->level_chain
->dead_vars_from_for
1299 = tree_cons (NULL_TREE
, link
,
1300 current_binding_level
->level_chain
->
1301 dead_vars_from_for
);
1303 /* Although we don't pop the CPLUS_BINDING, we do clear
1304 its BINDING_LEVEL since the level is going away now. */
1305 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1311 /* Remove the binding. */
1313 if (TREE_CODE (decl
) == TREE_LIST
)
1314 decl
= TREE_VALUE (decl
);
1315 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1316 pop_binding (DECL_NAME (decl
), decl
);
1317 else if (TREE_CODE (decl
) == OVERLOAD
)
1318 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1320 my_friendly_abort (0);
1324 /* Remove declarations for any `for' variables from inner scopes
1325 that we kept around. */
1326 for (link
= current_binding_level
->dead_vars_from_for
;
1327 link
; link
= TREE_CHAIN (link
))
1328 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1330 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1331 for (link
= current_binding_level
->type_shadowed
;
1332 link
; link
= TREE_CHAIN (link
))
1333 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1335 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1336 for (link
= current_binding_level
->shadowed_labels
;
1338 link
= TREE_CHAIN (link
))
1341 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1342 list if a `using' declaration put them there. The debugging
1343 back-ends won't understand OVERLOAD, so we remove them here.
1344 Because the BLOCK_VARS are (temporarily) shared with
1345 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1346 popped all the bindings. */
1351 for (d
= &BLOCK_VARS (block
); *d
; )
1353 if (TREE_CODE (*d
) == TREE_LIST
)
1354 *d
= TREE_CHAIN (*d
);
1356 d
= &TREE_CHAIN (*d
);
1360 /* If the level being exited is the top level of a function,
1361 check over all the labels. */
1364 /* Since this is the top level block of a function, the vars are
1365 the function's parameters. Don't leave them in the BLOCK
1366 because they are found in the FUNCTION_DECL instead. */
1367 BLOCK_VARS (block
) = 0;
1371 /* Any uses of undefined labels now operate under constraints
1372 of next binding contour. */
1373 if (current_function
)
1375 struct binding_level
*level_chain
;
1376 level_chain
= current_binding_level
->level_chain
;
1379 struct named_label_list
*labels
;
1380 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1381 if (labels
->binding_level
== current_binding_level
)
1383 labels
->binding_level
= level_chain
;
1384 labels
->names_in_scope
= level_chain
->names
;
1389 tmp
= current_binding_level
->keep
;
1391 pop_binding_level ();
1393 DECL_INITIAL (current_function_decl
) = block
;
1396 if (!block_previously_created
)
1397 current_binding_level
->blocks
1398 = chainon (current_binding_level
->blocks
, block
);
1400 /* If we did not make a block for the level just exited,
1401 any blocks made for inner levels
1402 (since they cannot be recorded as subblocks in that level)
1403 must be carried forward so they will later become subblocks
1404 of something else. */
1406 current_binding_level
->blocks
1407 = chainon (current_binding_level
->blocks
, subblocks
);
1409 /* Take care of compiler's internal binding structures. */
1412 add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1413 /* Each and every BLOCK node created here in `poplevel' is important
1414 (e.g. for proper debugging information) so if we created one
1415 earlier, mark it as "used". */
1417 TREE_USED (block
) = 1;
1418 block
= poplevel (keep
, reverse
, functionbody
);
1421 /* Each and every BLOCK node created here in `poplevel' is important
1422 (e.g. for proper debugging information) so if we created one
1423 earlier, mark it as "used". */
1425 TREE_USED (block
) = 1;
1429 /* Delete the node BLOCK from the current binding level.
1430 This is used for the block inside a stmt expr ({...})
1431 so that the block can be reinserted where appropriate. */
1434 delete_block (block
)
1438 if (current_binding_level
->blocks
== block
)
1439 current_binding_level
->blocks
= TREE_CHAIN (block
);
1440 for (t
= current_binding_level
->blocks
; t
;)
1442 if (TREE_CHAIN (t
) == block
)
1443 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1447 TREE_CHAIN (block
) = NULL_TREE
;
1448 /* Clear TREE_USED which is always set by poplevel.
1449 The flag is set again if insert_block is called. */
1450 TREE_USED (block
) = 0;
1453 /* Insert BLOCK at the end of the list of subblocks of the
1454 current binding level. This is used when a BIND_EXPR is expanded,
1455 to handle the BLOCK node inside the BIND_EXPR. */
1458 insert_block (block
)
1461 TREE_USED (block
) = 1;
1462 current_binding_level
->blocks
1463 = chainon (current_binding_level
->blocks
, block
);
1466 /* Set the BLOCK node for the innermost scope
1467 (the one we are currently in). */
1471 register tree block
;
1473 current_binding_level
->this_block
= block
;
1476 /* Do a pushlevel for class declarations. */
1481 register struct binding_level
*newlevel
;
1483 /* Reuse or create a struct for this binding level. */
1484 #if defined(DEBUG_CP_BINDING_LEVELS)
1486 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1487 if (free_binding_level
)
1488 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1490 newlevel
= free_binding_level
;
1491 free_binding_level
= free_binding_level
->level_chain
;
1494 newlevel
= make_binding_level ();
1496 #if defined(DEBUG_CP_BINDING_LEVELS)
1498 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1500 push_binding_level (newlevel
, 0, 0);
1502 class_binding_level
= current_binding_level
;
1503 class_binding_level
->parm_flag
= 2;
1506 /* ...and a poplevel for class declarations. */
1511 register struct binding_level
*level
= class_binding_level
;
1514 my_friendly_assert (level
!= 0, 354);
1516 /* If we're leaving a toplevel class, don't bother to do the setting
1517 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1518 shouldn't even be used when current_class_type isn't set, and second,
1519 if we don't touch it here, we're able to use the cache effect if the
1520 next time we're entering a class scope, it is the same class. */
1521 if (current_class_depth
!= 1)
1523 struct binding_level
* b
;
1525 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1526 for (shadowed
= level
->class_shadowed
;
1528 shadowed
= TREE_CHAIN (shadowed
))
1529 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1531 /* Find the next enclosing class, and recreate
1532 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1533 b
= level
->level_chain
;
1534 while (b
&& b
->parm_flag
!= 2)
1538 for (shadowed
= b
->class_shadowed
;
1540 shadowed
= TREE_CHAIN (shadowed
))
1544 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1545 while (t
&& BINDING_LEVEL (t
) != b
)
1549 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1550 = BINDING_VALUE (t
);
1554 /* Remember to save what IDENTIFIER's were bound in this scope so we
1555 can recover from cache misses. */
1557 previous_class_type
= current_class_type
;
1558 previous_class_values
= class_binding_level
->class_shadowed
;
1560 for (shadowed
= level
->type_shadowed
;
1562 shadowed
= TREE_CHAIN (shadowed
))
1563 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1565 /* Remove the bindings for all of the class-level declarations. */
1566 for (shadowed
= level
->class_shadowed
;
1568 shadowed
= TREE_CHAIN (shadowed
))
1569 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1571 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1572 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1573 class_binding_level
->parm_flag
,
1574 class_binding_level
->keep
);
1576 /* Now, pop out of the binding level which we created up in the
1577 `pushlevel_class' routine. */
1578 #if defined(DEBUG_CP_BINDING_LEVELS)
1580 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1582 pop_binding_level ();
1585 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1586 for any names in enclosing classes. */
1589 clear_identifier_class_values ()
1593 if (!class_binding_level
)
1596 for (t
= class_binding_level
->class_shadowed
;
1599 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1602 /* Returns non-zero if T is a virtual function table. */
1605 vtable_decl_p (t
, data
)
1607 void *data ATTRIBUTE_UNUSED
;
1609 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1612 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1616 vtype_decl_p (t
, data
)
1618 void *data ATTRIBUTE_UNUSED
;
1620 return (TREE_CODE (t
) == TYPE_DECL
1621 && TREE_TYPE (t
) != error_mark_node
1622 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1623 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1626 /* Return the declarations that are members of the namespace NS. */
1629 cp_namespace_decls (ns
)
1632 return NAMESPACE_LEVEL (ns
)->names
;
1635 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1636 itself, calling F for each. The DATA is passed to F as well. */
1639 walk_namespaces_r (namespace, f
, data
)
1641 walk_namespaces_fn f
;
1647 result
|= (*f
) (namespace, data
);
1649 for (current
= cp_namespace_decls (namespace);
1651 current
= TREE_CHAIN (current
))
1653 if (TREE_CODE (current
) != NAMESPACE_DECL
1654 || DECL_NAMESPACE_ALIAS (current
))
1656 if (!DECL_LANG_SPECIFIC (current
))
1659 my_friendly_assert (current
== std_node
, 393);
1663 /* We found a namespace. */
1664 result
|= walk_namespaces_r (current
, f
, data
);
1670 /* Walk all the namespaces, calling F for each. The DATA is passed to
1674 walk_namespaces (f
, data
)
1675 walk_namespaces_fn f
;
1678 return walk_namespaces_r (global_namespace
, f
, data
);
1681 struct walk_globals_data
{
1682 walk_globals_pred p
;
1687 /* Walk the global declarations in NAMESPACE. Whenever one is found
1688 for which P returns non-zero, call F with its address. If any call
1689 to F returns a non-zero value, return a non-zero value. */
1692 walk_globals_r (namespace, data
)
1696 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1697 walk_globals_pred p
= wgd
->p
;
1698 walk_globals_fn f
= wgd
->f
;
1699 void *d
= wgd
->data
;
1703 t
= &NAMESPACE_LEVEL (namespace)->names
;
1710 result
|= (*f
) (t
, d
);
1712 /* If F changed *T, then *T still points at the next item to
1715 t
= &TREE_CHAIN (*t
);
1721 /* Walk the global declarations. Whenever one is found for which P
1722 returns non-zero, call F with its address. If any call to F
1723 returns a non-zero value, return a non-zero value. */
1726 walk_globals (p
, f
, data
)
1727 walk_globals_pred p
;
1731 struct walk_globals_data wgd
;
1736 return walk_namespaces (walk_globals_r
, &wgd
);
1739 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1740 DATA is non-NULL, this is the last time we will call
1741 wrapup_global_declarations for this NAMESPACE. */
1744 wrapup_globals_for_namespace (namespace, data
)
1748 tree globals
= cp_namespace_decls (namespace);
1749 int len
= list_length (globals
);
1750 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1754 int last_time
= (data
!= 0);
1756 if (last_time
&& namespace == global_namespace
)
1757 /* Let compile_file handle the global namespace. */
1760 /* Process the decls in reverse order--earliest first.
1761 Put them into VEC from back to front, then take out from front. */
1763 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1764 vec
[len
- i
- 1] = decl
;
1768 check_global_declarations (vec
, len
);
1772 /* Temporarily mark vtables as external. That prevents
1773 wrapup_global_declarations from writing them out; we must process
1774 them ourselves in finish_vtable_vardecl. */
1775 for (i
= 0; i
< len
; ++i
)
1776 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1778 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1779 DECL_EXTERNAL (vec
[i
]) = 1;
1782 /* Write out any globals that need to be output. */
1783 result
= wrapup_global_declarations (vec
, len
);
1785 /* Undo the hack to DECL_EXTERNAL above. */
1786 for (i
= 0; i
< len
; ++i
)
1787 if (vtable_decl_p (vec
[i
], /*data=*/0)
1788 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1790 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1791 DECL_EXTERNAL (vec
[i
]) = 0;
1798 /* Mark ARG (which is really a struct binding_level **) for GC. */
1801 mark_binding_level (arg
)
1804 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1808 ggc_mark_tree (lvl
->names
);
1809 ggc_mark_tree (lvl
->tags
);
1810 ggc_mark_tree (lvl
->usings
);
1811 ggc_mark_tree (lvl
->using_directives
);
1812 ggc_mark_tree (lvl
->class_shadowed
);
1813 ggc_mark_tree (lvl
->type_shadowed
);
1814 ggc_mark_tree (lvl
->shadowed_labels
);
1815 ggc_mark_tree (lvl
->blocks
);
1816 ggc_mark_tree (lvl
->this_block
);
1817 ggc_mark_tree (lvl
->incomplete
);
1818 ggc_mark_tree (lvl
->dead_vars_from_for
);
1820 lvl
= lvl
->level_chain
;
1824 /* For debugging. */
1825 static int no_print_functions
= 0;
1826 static int no_print_builtins
= 0;
1829 print_binding_level (lvl
)
1830 struct binding_level
*lvl
;
1834 fprintf (stderr
, " blocks=");
1835 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1836 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1837 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1838 if (lvl
->tag_transparent
)
1839 fprintf (stderr
, " tag-transparent");
1840 if (lvl
->more_cleanups_ok
)
1841 fprintf (stderr
, " more-cleanups-ok");
1842 if (lvl
->have_cleanups
)
1843 fprintf (stderr
, " have-cleanups");
1844 fprintf (stderr
, "\n");
1847 fprintf (stderr
, " names:\t");
1848 /* We can probably fit 3 names to a line? */
1849 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1851 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1853 if (no_print_builtins
1854 && (TREE_CODE (t
) == TYPE_DECL
)
1855 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1858 /* Function decls tend to have longer names. */
1859 if (TREE_CODE (t
) == FUNCTION_DECL
)
1866 fprintf (stderr
, "\n\t");
1869 print_node_brief (stderr
, "", t
, 0);
1870 if (t
== error_mark_node
)
1874 fprintf (stderr
, "\n");
1878 fprintf (stderr
, " tags:\t");
1880 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1882 if (TREE_PURPOSE (t
) == NULL_TREE
)
1884 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1891 fprintf (stderr
, "\n\t");
1894 if (TREE_PURPOSE (t
) == NULL_TREE
)
1896 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1897 fprintf (stderr
, ">");
1899 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1900 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1903 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1904 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1905 fprintf (stderr
, ">");
1909 fprintf (stderr
, "\n");
1911 if (lvl
->class_shadowed
)
1913 fprintf (stderr
, " class-shadowed:");
1914 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1916 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1918 fprintf (stderr
, "\n");
1920 if (lvl
->type_shadowed
)
1922 fprintf (stderr
, " type-shadowed:");
1923 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1925 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1927 fprintf (stderr
, "\n");
1932 print_other_binding_stack (stack
)
1933 struct binding_level
*stack
;
1935 struct binding_level
*level
;
1936 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1938 fprintf (stderr
, "binding level ");
1939 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1940 fprintf (stderr
, "\n");
1941 print_binding_level (level
);
1946 print_binding_stack ()
1948 struct binding_level
*b
;
1949 fprintf (stderr
, "current_binding_level=");
1950 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
1951 fprintf (stderr
, "\nclass_binding_level=");
1952 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
1953 fprintf (stderr
, "\nglobal_binding_level=");
1954 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
1955 fprintf (stderr
, "\n");
1956 if (class_binding_level
)
1958 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1959 if (b
== current_binding_level
)
1962 b
= class_binding_level
;
1964 b
= current_binding_level
;
1967 b
= current_binding_level
;
1968 print_other_binding_stack (b
);
1969 fprintf (stderr
, "global:\n");
1970 print_binding_level (global_binding_level
);
1973 /* Namespace binding access routines: The namespace_bindings field of
1974 the identifier is polymorphic, with three possible values:
1975 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
1976 indicating the BINDING_VALUE of global_namespace. */
1978 /* Check whether the a binding for the name to scope is known.
1979 Assumes that the bindings of the name are already a list
1980 of bindings. Returns the binding found, or NULL_TREE. */
1983 find_binding (name
, scope
)
1987 tree iter
, prev
= NULL_TREE
;
1989 scope
= ORIGINAL_NAMESPACE (scope
);
1991 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
1992 iter
= TREE_CHAIN (iter
))
1994 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
1995 if (BINDING_SCOPE (iter
) == scope
)
1997 /* Move binding found to the front of the list, so
1998 subsequent lookups will find it faster. */
2001 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2002 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2003 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2012 /* Always returns a binding for name in scope. If the
2013 namespace_bindings is not a list, convert it to one first.
2014 If no binding is found, make a new one. */
2017 binding_for_name (name
, scope
)
2021 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2024 scope
= ORIGINAL_NAMESPACE (scope
);
2026 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2028 /* Get rid of optimization for global scope. */
2029 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2030 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2031 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2033 if (b
&& (result
= find_binding (name
, scope
)))
2035 /* Not found, make a new one. */
2036 result
= make_node (CPLUS_BINDING
);
2037 TREE_CHAIN (result
) = b
;
2038 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2039 BINDING_SCOPE (result
) = scope
;
2040 BINDING_TYPE (result
) = NULL_TREE
;
2041 BINDING_VALUE (result
) = NULL_TREE
;
2045 /* Return the binding value for name in scope, considering that
2046 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2049 namespace_binding (name
, scope
)
2053 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2056 if (scope
== NULL_TREE
)
2057 scope
= global_namespace
;
2058 if (TREE_CODE (b
) != CPLUS_BINDING
)
2059 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2060 name
= find_binding (name
,scope
);
2061 if (name
== NULL_TREE
)
2063 return BINDING_VALUE (name
);
2066 /* Set the binding value for name in scope. If modifying the binding
2067 of global_namespace is attempted, try to optimize it. */
2070 set_namespace_binding (name
, scope
, val
)
2077 if (scope
== NULL_TREE
)
2078 scope
= global_namespace
;
2080 if (scope
== global_namespace
)
2082 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2083 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2085 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2089 b
= binding_for_name (name
, scope
);
2090 BINDING_VALUE (b
) = val
;
2093 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2094 select a name that is unique to this compilation unit. */
2097 push_namespace (name
)
2102 int implicit_use
= 0;
2104 if (!global_namespace
)
2106 /* This must be ::. */
2107 my_friendly_assert (name
== get_identifier ("::"), 377);
2112 /* The name of anonymous namespace is unique for the translation
2114 if (!anonymous_namespace_name
)
2115 anonymous_namespace_name
= get_file_function_name ('N');
2116 name
= anonymous_namespace_name
;
2117 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2119 /* Reopening anonymous namespace. */
2123 else if (current_namespace
== global_namespace
2124 && name
== DECL_NAME (std_node
))
2131 /* Check whether this is an extended namespace definition. */
2132 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2133 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2136 if (DECL_NAMESPACE_ALIAS (d
))
2138 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2139 d
, DECL_NAMESPACE_ALIAS (d
));
2140 d
= DECL_NAMESPACE_ALIAS (d
);
2147 /* Make a new namespace, binding the name to it. */
2148 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2149 /* The global namespace is not pushed, and the global binding
2150 level is set elsewhere. */
2155 declare_namespace_level ();
2156 NAMESPACE_LEVEL (d
) = current_binding_level
;
2160 resume_binding_level (NAMESPACE_LEVEL (d
));
2163 do_using_directive (d
);
2164 /* Enter the name space. */
2165 current_namespace
= d
;
2168 /* Pop from the scope of the current namespace. */
2173 if (current_namespace
== global_namespace
)
2175 my_friendly_assert (in_std
>0, 980421);
2179 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2180 /* The binding level is not popped, as it might be re-opened later. */
2181 suspend_binding_level ();
2184 /* Push into the scope of the namespace NS, even if it is deeply
2185 nested within another namespace. */
2188 push_nested_namespace (ns
)
2191 if (ns
== global_namespace
)
2192 push_to_top_level ();
2195 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2196 push_namespace (DECL_NAME (ns
));
2200 /* Pop back from the scope of the namespace NS, which was previously
2201 entered with push_nested_namespace. */
2204 pop_nested_namespace (ns
)
2207 while (ns
!= global_namespace
)
2210 ns
= CP_DECL_CONTEXT (ns
);
2213 pop_from_top_level ();
2217 /* Subroutines for reverting temporarily to top-level for instantiation
2218 of templates and such. We actually need to clear out the class- and
2219 local-value slots of all identifiers, so that only the global values
2220 are at all visible. Simply setting current_binding_level to the global
2221 scope isn't enough, because more binding levels may be pushed. */
2222 struct saved_scope
*scope_chain
;
2224 /* Mark ST for GC. */
2228 struct stmt_tree
*st
;
2230 ggc_mark_tree (st
->x_last_stmt
);
2231 ggc_mark_tree (st
->x_last_expr_type
);
2234 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2237 mark_saved_scope (arg
)
2240 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2243 mark_binding_level (&t
->class_bindings
);
2244 ggc_mark_tree (t
->old_bindings
);
2245 ggc_mark_tree (t
->old_namespace
);
2246 ggc_mark_tree (t
->class_name
);
2247 ggc_mark_tree (t
->class_type
);
2248 ggc_mark_tree (t
->access_specifier
);
2249 ggc_mark_tree (t
->function_decl
);
2251 ggc_mark_tree_varray (t
->lang_base
);
2252 ggc_mark_tree (t
->lang_name
);
2253 ggc_mark_tree (t
->x_function_parms
);
2254 ggc_mark_tree (t
->template_parms
);
2255 ggc_mark_tree (t
->x_previous_class_type
);
2256 ggc_mark_tree (t
->x_previous_class_values
);
2257 ggc_mark_tree (t
->x_saved_tree
);
2259 mark_stmt_tree (&t
->x_stmt_tree
);
2260 mark_binding_level (&t
->bindings
);
2266 store_bindings (names
, old_bindings
)
2267 tree names
, old_bindings
;
2270 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2272 tree binding
, t1
, id
;
2274 if (TREE_CODE (t
) == TREE_LIST
)
2275 id
= TREE_PURPOSE (t
);
2280 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2281 we have no IDENTIFIER_BINDING if we have left the class
2282 scope, but cached the class-level declarations. */
2283 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2286 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2287 if (TREE_VEC_ELT (t1
, 0) == id
)
2290 binding
= make_tree_vec (4);
2294 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2295 TREE_VEC_ELT (binding
, 0) = id
;
2296 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2297 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2298 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2299 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2300 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2302 TREE_CHAIN (binding
) = old_bindings
;
2303 old_bindings
= binding
;
2307 return old_bindings
;
2311 maybe_push_to_top_level (pseudo
)
2314 struct saved_scope
*s
;
2315 struct binding_level
*b
;
2319 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2321 b
= scope_chain
? current_binding_level
: 0;
2323 /* If we're in the middle of some function, save our state. */
2324 if (current_function
)
2327 push_function_context_to (NULL_TREE
);
2332 old_bindings
= NULL_TREE
;
2333 if (scope_chain
&& previous_class_type
)
2334 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2336 /* Have to include global_binding_level, because class-level decls
2337 aren't listed anywhere useful. */
2338 for (; b
; b
= b
->level_chain
)
2342 /* Template IDs are inserted into the global level. If they were
2343 inserted into namespace level, finish_file wouldn't find them
2344 when doing pending instantiations. Therefore, don't stop at
2345 namespace level, but continue until :: . */
2346 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2349 old_bindings
= store_bindings (b
->names
, old_bindings
);
2350 /* We also need to check class_shadowed to save class-level type
2351 bindings, since pushclass doesn't fill in b->names. */
2352 if (b
->parm_flag
== 2)
2353 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2355 /* Unwind type-value slots back to top level. */
2356 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2357 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2359 s
->prev
= scope_chain
;
2360 s
->old_bindings
= old_bindings
;
2362 s
->need_pop_function_context
= need_pop
;
2363 s
->function_decl
= current_function_decl
;
2366 current_function_decl
= NULL_TREE
;
2367 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2368 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2369 current_lang_name
= lang_name_cplusplus
;
2370 strict_prototype
= strict_prototypes_lang_cplusplus
;
2371 current_namespace
= global_namespace
;
2375 push_to_top_level ()
2377 maybe_push_to_top_level (0);
2381 pop_from_top_level ()
2383 struct saved_scope
*s
= scope_chain
;
2386 /* Clear out class-level bindings cache. */
2387 if (previous_class_type
)
2388 invalidate_class_lookup_cache ();
2390 VARRAY_FREE (current_lang_base
);
2392 scope_chain
= s
->prev
;
2393 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2395 tree id
= TREE_VEC_ELT (t
, 0);
2398 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2399 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2400 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2404 if (current_lang_name
== lang_name_cplusplus
)
2405 strict_prototype
= strict_prototypes_lang_cplusplus
;
2406 else if (current_lang_name
== lang_name_c
)
2407 strict_prototype
= strict_prototypes_lang_c
;
2409 /* If we were in the middle of compiling a function, restore our
2411 if (s
->need_pop_function_context
)
2412 pop_function_context_from (NULL_TREE
);
2413 current_function_decl
= s
->function_decl
;
2418 /* Push a definition of struct, union or enum tag "name".
2419 into binding_level "b". "type" should be the type node,
2420 We assume that the tag "name" is not already defined.
2422 Note that the definition may really be just a forward reference.
2423 In that case, the TYPE_SIZE will be a NULL_TREE.
2425 C++ gratuitously puts all these tags in the name space. */
2427 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2428 record the shadowed value for this binding contour. TYPE is
2429 the type that ID maps to. */
2432 set_identifier_type_value_with_scope (id
, type
, b
)
2435 struct binding_level
*b
;
2437 if (!b
->namespace_p
)
2439 /* Shadow the marker, not the real thing, so that the marker
2440 gets restored later. */
2441 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2443 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2447 tree binding
= binding_for_name (id
, current_namespace
);
2448 BINDING_TYPE (binding
) = type
;
2449 /* Store marker instead of real type. */
2450 type
= global_type_node
;
2452 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2455 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2458 set_identifier_type_value (id
, type
)
2462 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2465 /* Return the type associated with id. */
2468 identifier_type_value (id
)
2471 /* There is no type with that name, anywhere. */
2472 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2474 /* This is not the type marker, but the real thing. */
2475 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2476 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2477 /* Have to search for it. It must be on the global level, now.
2478 Ask lookup_name not to return non-types. */
2479 id
= lookup_name_real (id
, 2, 1, 0);
2481 return TREE_TYPE (id
);
2485 /* Pop off extraneous binding levels left over due to syntax errors.
2487 We don't pop past namespaces, as they might be valid. */
2492 #ifdef DEBUG_CP_BINDING_LEVELS
2493 fprintf (stderr
, "XXX entering pop_everything ()\n");
2495 while (!toplevel_bindings_p ())
2497 if (current_binding_level
->parm_flag
== 2)
2498 pop_nested_class ();
2502 #ifdef DEBUG_CP_BINDING_LEVELS
2503 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2507 /* The type TYPE is being declared. If it is a class template, or a
2508 specialization of a class template, do any processing required and
2509 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2510 being declared a friend. B is the binding level at which this TYPE
2513 Returns the TYPE_DECL for TYPE, which may have been altered by this
2517 maybe_process_template_type_declaration (type
, globalize
, b
)
2520 struct binding_level
* b
;
2522 tree decl
= TYPE_NAME (type
);
2524 if (processing_template_parmlist
)
2525 /* You can't declare a new template type in a template parameter
2526 list. But, you can declare a non-template type:
2528 template <class A*> struct S;
2530 is a forward-declaration of `A'. */
2534 maybe_check_template_type (type
);
2536 my_friendly_assert (IS_AGGR_TYPE (type
)
2537 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2540 if (processing_template_decl
)
2542 /* This may change after the call to
2543 push_template_decl_real, but we want the original value. */
2544 tree name
= DECL_NAME (decl
);
2546 decl
= push_template_decl_real (decl
, globalize
);
2547 /* If the current binding level is the binding level for the
2548 template parameters (see the comment in
2549 begin_template_parm_list) and the enclosing level is a class
2550 scope, and we're not looking at a friend, push the
2551 declaration of the member class into the class scope. In the
2552 friend case, push_template_decl will already have put the
2553 friend into global scope, if appropriate. */
2554 if (TREE_CODE (type
) != ENUMERAL_TYPE
2555 && !globalize
&& b
->pseudo_global
2556 && b
->level_chain
->parm_flag
== 2)
2558 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2559 /* Put this tag on the list of tags for the class, since
2560 that won't happen below because B is not the class
2561 binding level, but is instead the pseudo-global level. */
2562 b
->level_chain
->tags
=
2563 tree_cons (name
, type
, b
->level_chain
->tags
);
2564 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2565 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2573 /* In C++, you don't have to write `struct S' to refer to `S'; you
2574 can just use `S'. We accomplish this by creating a TYPE_DECL as
2575 if the user had written `typedef struct S S'. Create and return
2576 the TYPE_DECL for TYPE. */
2579 create_implicit_typedef (name
, type
)
2585 decl
= build_decl (TYPE_DECL
, name
, type
);
2586 SET_DECL_ARTIFICIAL (decl
);
2587 /* There are other implicit type declarations, like the one *within*
2588 a class that allows you to write `S::S'. We must distinguish
2590 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2591 TYPE_NAME (type
) = decl
;
2596 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2597 Normally put it into the inner-most non-tag-transparent scope,
2598 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2599 The latter is needed for implicit declarations. */
2602 pushtag (name
, type
, globalize
)
2606 register struct binding_level
*b
;
2608 b
= current_binding_level
;
2609 while (b
->tag_transparent
2610 || (globalize
&& b
->parm_flag
== 2))
2613 b
->tags
= tree_cons (name
, type
, b
->tags
);
2617 /* Do C++ gratuitous typedefing. */
2618 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2620 register tree d
= NULL_TREE
;
2622 tree context
= TYPE_CONTEXT (type
);
2626 tree cs
= current_scope ();
2630 else if (cs
!= NULL_TREE
2631 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2632 /* When declaring a friend class of a local class, we want
2633 to inject the newly named class into the scope
2634 containing the local class, not the namespace scope. */
2635 context
= hack_decl_function_context (get_type_decl (cs
));
2638 context
= current_namespace
;
2640 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2641 || b
->parm_flag
== 2)
2644 if (current_lang_name
== lang_name_java
)
2645 TYPE_FOR_JAVA (type
) = 1;
2647 d
= create_implicit_typedef (name
, type
);
2648 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2650 set_identifier_type_value_with_scope (name
, type
, b
);
2652 d
= maybe_process_template_type_declaration (type
,
2655 if (b
->parm_flag
== 2)
2657 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2658 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2659 class. But if it's a member template class, we
2660 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2662 finish_member_declaration (d
);
2664 pushdecl_class_level (d
);
2667 d
= pushdecl_with_scope (d
, b
);
2669 if (ANON_AGGRNAME_P (name
))
2670 DECL_IGNORED_P (d
) = 1;
2672 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2673 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2674 if (!uses_template_parms (type
))
2675 DECL_ASSEMBLER_NAME (d
)
2676 = get_identifier (build_overload_name (type
, 1, 1));
2678 if (b
->parm_flag
== 2)
2680 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2681 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2685 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2686 /* Use the canonical TYPE_DECL for this node. */
2687 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2690 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2691 will be the tagged type we just added to the current
2692 binding level. This fake NULL-named TYPE_DECL node helps
2693 dwarfout.c to know when it needs to output a
2694 representation of a tagged type, and it also gives us a
2695 convenient place to record the "scope start" address for
2698 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2699 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2703 /* Counter used to create anonymous type names. */
2705 static int anon_cnt
= 0;
2707 /* Return an IDENTIFIER which can be used as a name for
2708 anonymous structs and unions. */
2715 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2716 return get_identifier (buf
);
2719 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2720 This keeps dbxout from getting confused. */
2725 register struct binding_level
*b
;
2727 static int last_cnt
= 0;
2729 /* Fast out if no new anon names were declared. */
2730 if (last_cnt
== anon_cnt
)
2733 b
= current_binding_level
;
2734 while (b
->tag_transparent
)
2739 /* A NULL purpose means we have already processed all tags
2740 from here to the end of the list. */
2741 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2743 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2744 TREE_PURPOSE (tags
) = NULL_TREE
;
2745 tags
= TREE_CHAIN (tags
);
2747 last_cnt
= anon_cnt
;
2750 /* Subroutine of duplicate_decls: return truthvalue of whether
2751 or not types of these decls match.
2753 For C++, we must compare the parameter list so that `int' can match
2754 `int&' in a parameter position, but `int&' is not confused with
2758 decls_match (newdecl
, olddecl
)
2759 tree newdecl
, olddecl
;
2763 if (newdecl
== olddecl
)
2766 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2767 /* If the two DECLs are not even the same kind of thing, we're not
2768 interested in their types. */
2771 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2773 tree f1
= TREE_TYPE (newdecl
);
2774 tree f2
= TREE_TYPE (olddecl
);
2775 tree p1
= TYPE_ARG_TYPES (f1
);
2776 tree p2
= TYPE_ARG_TYPES (f2
);
2778 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2779 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2780 && DECL_LANGUAGE (olddecl
) == lang_c
))
2783 /* When we parse a static member function definition,
2784 we put together a FUNCTION_DECL which thinks its type
2785 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2787 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2788 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2789 else if (TREE_CODE (f2
) == METHOD_TYPE
2790 && DECL_STATIC_FUNCTION_P (newdecl
))
2791 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2793 /* Here we must take care of the case where new default
2794 parameters are specified. Also, warn if an old
2795 declaration becomes ambiguous because default
2796 parameters may cause the two to be ambiguous. */
2797 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2799 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2800 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2802 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2806 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2808 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2811 types_match
= self_promoting_args_p (p1
);
2812 if (p1
== void_list_node
)
2813 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2815 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2816 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2818 types_match
= self_promoting_args_p (p2
);
2819 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2822 types_match
= compparms (p1
, p2
);
2827 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2829 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2830 DECL_TEMPLATE_PARMS (olddecl
)))
2833 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2836 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2837 DECL_TEMPLATE_RESULT (newdecl
));
2841 if (TREE_TYPE (newdecl
) == error_mark_node
)
2842 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2843 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2844 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2845 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2848 types_match
= comptypes (TREE_TYPE (newdecl
),
2849 TREE_TYPE (olddecl
),
2850 COMPARE_REDECLARATION
);
2856 /* If NEWDECL is `static' and an `extern' was seen previously,
2857 warn about it. OLDDECL is the previous declaration.
2859 Note that this does not apply to the C++ case of declaring
2860 a variable `extern const' and then later `const'.
2862 Don't complain about built-in functions, since they are beyond
2863 the user's control. */
2866 warn_extern_redeclared_static (newdecl
, olddecl
)
2867 tree newdecl
, olddecl
;
2869 static const char *explicit_extern_static_warning
2870 = "`%D' was declared `extern' and later `static'";
2871 static const char *implicit_extern_static_warning
2872 = "`%D' was declared implicitly `extern' and later `static'";
2876 if (TREE_CODE (newdecl
) == TYPE_DECL
2877 || TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2880 /* Don't get confused by static member functions; that's a different
2882 if (TREE_CODE (newdecl
) == FUNCTION_DECL
2883 && DECL_STATIC_FUNCTION_P (newdecl
))
2886 /* If the old declaration was `static', or the new one isn't, then
2887 then everything is OK. */
2888 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
2891 /* It's OK to declare a builtin function as `static'. */
2892 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2893 && DECL_ARTIFICIAL (olddecl
))
2896 name
= DECL_ASSEMBLER_NAME (newdecl
);
2897 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2898 ? implicit_extern_static_warning
2899 : explicit_extern_static_warning
, newdecl
);
2900 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2903 /* Handle when a new declaration NEWDECL has the same name as an old
2904 one OLDDECL in the same binding contour. Prints an error message
2907 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2908 Otherwise, return 0. */
2911 duplicate_decls (newdecl
, olddecl
)
2912 tree newdecl
, olddecl
;
2914 unsigned olddecl_uid
= DECL_UID (olddecl
);
2915 int olddecl_friend
= 0, types_match
= 0;
2916 int new_defines_function
= 0;
2918 if (newdecl
== olddecl
)
2921 types_match
= decls_match (newdecl
, olddecl
);
2923 /* If either the type of the new decl or the type of the old decl is an
2924 error_mark_node, then that implies that we have already issued an
2925 error (earlier) for some bogus type specification, and in that case,
2926 it is rather pointless to harass the user with yet more error message
2927 about the same declaration, so just pretend the types match here. */
2928 if (TREE_TYPE (newdecl
) == error_mark_node
2929 || TREE_TYPE (olddecl
) == error_mark_node
)
2932 /* Check for redeclaration and other discrepancies. */
2933 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2934 && DECL_ARTIFICIAL (olddecl
))
2936 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2938 /* If you declare a built-in or predefined function name as static,
2939 the old definition is overridden, but optionally warn this was a
2940 bad choice of name. */
2941 if (! TREE_PUBLIC (newdecl
))
2944 cp_warning ("shadowing %s function `%#D'",
2945 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2947 /* Discard the old built-in function. */
2950 /* If the built-in is not ansi, then programs can override
2951 it even globally without an error. */
2952 else if (! DECL_BUILT_IN (olddecl
))
2953 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2957 cp_error ("declaration of `%#D'", newdecl
);
2958 cp_error ("conflicts with built-in declaration `%#D'",
2963 else if (!types_match
)
2965 if ((DECL_LANGUAGE (newdecl
) == lang_c
2966 && DECL_LANGUAGE (olddecl
) == lang_c
)
2967 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
2968 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
2970 /* A near match; override the builtin. */
2972 if (TREE_PUBLIC (newdecl
))
2974 cp_warning ("new declaration `%#D'", newdecl
);
2975 cp_warning ("ambiguates built-in declaration `%#D'",
2978 else if (warn_shadow
)
2979 cp_warning ("shadowing %s function `%#D'",
2980 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2984 /* Discard the old built-in function. */
2988 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
2990 /* If a builtin function is redeclared as `static', merge
2991 the declarations, but make the original one static. */
2992 DECL_THIS_STATIC (olddecl
) = 1;
2993 TREE_PUBLIC (olddecl
) = 0;
2995 /* Make the olddeclaration consistent with the new one so that
2996 all remnants of the builtin-ness of this function will be
2998 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
2999 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3000 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3001 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3005 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3007 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3008 && TREE_CODE (newdecl
) != TYPE_DECL
3009 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3010 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3011 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3012 && TREE_CODE (olddecl
) != TYPE_DECL
3013 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3014 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3017 /* We do nothing special here, because C++ does such nasty
3018 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3019 get shadowed, and know that if we need to find a TYPE_DECL
3020 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3021 slot of the identifier. */
3025 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3026 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3027 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3028 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3031 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3032 if (TREE_CODE (olddecl
) == TREE_LIST
)
3033 olddecl
= TREE_VALUE (olddecl
);
3034 cp_error_at ("previous declaration of `%#D'", olddecl
);
3036 /* New decl is completely inconsistent with the old one =>
3037 tell caller to replace the old one. */
3041 else if (!types_match
)
3043 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3044 /* These are certainly not duplicate declarations; they're
3045 from different scopes. */
3048 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3050 /* The name of a class template may not be declared to refer to
3051 any other template, class, function, object, namespace, value,
3052 or type in the same scope. */
3053 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3054 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3056 cp_error ("declaration of template `%#D'", newdecl
);
3057 cp_error_at ("conflicts with previous declaration `%#D'",
3060 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3061 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3062 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3063 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3064 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3065 DECL_TEMPLATE_PARMS (olddecl
)))
3067 cp_error ("new declaration `%#D'", newdecl
);
3068 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3072 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3074 if (DECL_LANGUAGE (newdecl
) == lang_c
3075 && DECL_LANGUAGE (olddecl
) == lang_c
)
3077 cp_error ("declaration of C function `%#D' conflicts with",
3079 cp_error_at ("previous declaration `%#D' here", olddecl
);
3081 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3082 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3084 cp_error ("new declaration `%#D'", newdecl
);
3085 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3091 /* Already complained about this, so don't do so again. */
3092 else if (current_class_type
== NULL_TREE
3093 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3095 cp_error ("conflicting types for `%#D'", newdecl
);
3096 cp_error_at ("previous declaration as `%#D'", olddecl
);
3099 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3100 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3101 && (!DECL_TEMPLATE_INFO (newdecl
)
3102 || (DECL_TI_TEMPLATE (newdecl
)
3103 != DECL_TI_TEMPLATE (olddecl
))))
3104 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3105 && (!DECL_TEMPLATE_INFO (olddecl
)
3106 || (DECL_TI_TEMPLATE (olddecl
)
3107 != DECL_TI_TEMPLATE (newdecl
))))))
3108 /* It's OK to have a template specialization and a non-template
3109 with the same type, or to have specializations of two
3110 different templates with the same type. Note that if one is a
3111 specialization, and the other is an instantiation of the same
3112 template, that we do not exit at this point. That situation
3113 can occur if we instantiate a template class, and then
3114 specialize one of its methods. This situation is legal, but
3115 the declarations must be merged in the usual way. */
3117 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3118 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3119 && !DECL_USE_TEMPLATE (newdecl
))
3120 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3121 && !DECL_USE_TEMPLATE (olddecl
))))
3122 /* One of the declarations is a template instantiation, and the
3123 other is not a template at all. That's OK. */
3125 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3126 && DECL_NAMESPACE_ALIAS (newdecl
)
3127 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3128 /* Redeclaration of namespace alias, ignore it. */
3132 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3135 cp_error (errmsg
, newdecl
);
3136 if (DECL_NAME (olddecl
) != NULL_TREE
)
3137 cp_error_at ((DECL_INITIAL (olddecl
)
3138 && namespace_bindings_p ())
3139 ? "`%#D' previously defined here"
3140 : "`%#D' previously declared here", olddecl
);
3142 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3143 && DECL_INITIAL (olddecl
) != NULL_TREE
3144 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3145 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3147 /* Prototype decl follows defn w/o prototype. */
3148 cp_warning_at ("prototype for `%#D'", newdecl
);
3149 cp_warning_at ("follows non-prototype definition here", olddecl
);
3151 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3152 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3154 /* extern "C" int foo ();
3155 int foo () { bar (); }
3157 if (current_lang_stack
3158 == &VARRAY_TREE (current_lang_base
, 0))
3159 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3162 cp_error_at ("previous declaration of `%#D' with %L linkage",
3163 olddecl
, DECL_LANGUAGE (olddecl
));
3164 cp_error ("conflicts with new declaration with %L linkage",
3165 DECL_LANGUAGE (newdecl
));
3169 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3171 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3173 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3174 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3177 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3178 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3180 for (; t1
&& t1
!= void_list_node
;
3181 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3182 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3184 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3189 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3191 cp_pedwarn_at ("after previous specification in `%#D'",
3197 cp_error ("default argument given for parameter %d of `%#D'",
3199 cp_error_at ("after previous specification in `%#D'",
3204 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3205 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3207 cp_warning ("`%#D' was used before it was declared inline",
3209 cp_warning_at ("previous non-inline declaration here",
3215 /* If new decl is `static' and an `extern' was seen previously,
3217 warn_extern_redeclared_static (newdecl
, olddecl
);
3219 /* We have committed to returning 1 at this point. */
3220 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3222 /* Now that functions must hold information normally held
3223 by field decls, there is extra work to do so that
3224 declaration information does not get destroyed during
3226 if (DECL_VINDEX (olddecl
))
3227 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3228 if (DECL_CONTEXT (olddecl
))
3229 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3230 if (DECL_CLASS_CONTEXT (olddecl
))
3231 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3232 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3233 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3234 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3235 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3236 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3237 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3238 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3239 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3240 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3242 /* Optionally warn about more than one declaration for the same
3243 name, but don't warn about a function declaration followed by a
3245 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3246 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3247 /* Don't warn about extern decl followed by definition. */
3248 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3249 /* Don't warn about friends, let add_friend take care of it. */
3250 && ! DECL_FRIEND_P (newdecl
))
3252 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3253 cp_warning_at ("previous declaration of `%D'", olddecl
);
3257 /* Deal with C++: must preserve virtual function table size. */
3258 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3260 register tree newtype
= TREE_TYPE (newdecl
);
3261 register tree oldtype
= TREE_TYPE (olddecl
);
3263 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3264 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3266 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3267 CLASSTYPE_FRIEND_CLASSES (newtype
)
3268 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3272 /* Copy all the DECL_... slots specified in the new decl
3273 except for any that we copy here from the old type. */
3274 DECL_MACHINE_ATTRIBUTES (newdecl
)
3275 = merge_machine_decl_attributes (olddecl
, newdecl
);
3277 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3279 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3280 DECL_TEMPLATE_RESULT (olddecl
)))
3281 cp_error ("invalid redeclaration of %D", newdecl
);
3282 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3283 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3284 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3285 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3292 /* Automatically handles default parameters. */
3293 tree oldtype
= TREE_TYPE (olddecl
);
3296 /* Merge the data types specified in the two decls. */
3297 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3299 if (TREE_CODE (newdecl
) == VAR_DECL
)
3300 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3301 /* Do this after calling `common_type' so that default
3302 parameters don't confuse us. */
3303 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3304 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3305 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3307 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3308 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3309 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3310 TYPE_RAISES_EXCEPTIONS (oldtype
));
3312 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3313 && DECL_SOURCE_LINE (olddecl
) != 0
3315 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3316 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3318 cp_error ("declaration of `%F' throws different exceptions",
3320 cp_error_at ("than previous declaration `%F'", olddecl
);
3323 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3325 /* Lay the type out, unless already done. */
3326 if (! same_type_p (newtype
, oldtype
)
3327 && TREE_TYPE (newdecl
) != error_mark_node
3328 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3329 layout_type (TREE_TYPE (newdecl
));
3331 if ((TREE_CODE (newdecl
) == VAR_DECL
3332 || TREE_CODE (newdecl
) == PARM_DECL
3333 || TREE_CODE (newdecl
) == RESULT_DECL
3334 || TREE_CODE (newdecl
) == FIELD_DECL
3335 || TREE_CODE (newdecl
) == TYPE_DECL
)
3336 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3337 layout_decl (newdecl
, 0);
3339 /* Merge the type qualifiers. */
3340 if (TREE_READONLY (newdecl
))
3341 TREE_READONLY (olddecl
) = 1;
3342 if (TREE_THIS_VOLATILE (newdecl
))
3343 TREE_THIS_VOLATILE (olddecl
) = 1;
3345 /* Merge the initialization information. */
3346 if (DECL_INITIAL (newdecl
) == NULL_TREE
3347 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3349 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3350 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3351 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3352 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3353 && DECL_LANG_SPECIFIC (newdecl
)
3354 && DECL_LANG_SPECIFIC (olddecl
))
3355 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3358 /* Merge the section attribute.
3359 We want to issue an error if the sections conflict but that must be
3360 done later in decl_attributes since we are called before attributes
3362 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3363 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3365 /* Keep the old rtl since we can safely use it. */
3366 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3368 /* If cannot merge, then use the new type and qualifiers,
3369 and don't preserve the old rtl. */
3372 /* Clean out any memory we had of the old declaration. */
3373 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3375 TREE_VALUE (oldstatic
) = error_mark_node
;
3377 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3378 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3379 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3380 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3383 /* Merge the storage class information. */
3384 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3385 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3386 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3387 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3388 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3389 if (! DECL_EXTERNAL (olddecl
))
3390 DECL_EXTERNAL (newdecl
) = 0;
3392 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3394 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3395 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3396 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3397 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3398 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3399 /* Don't really know how much of the language-specific
3400 values we should copy from old to new. */
3401 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3402 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3403 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3404 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3405 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3407 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3408 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3409 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3410 DECL_BEFRIENDING_CLASSES (newdecl
)
3411 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3412 DECL_BEFRIENDING_CLASSES (olddecl
));
3415 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3417 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3418 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3420 /* If newdecl is not a specialization, then it is not a
3421 template-related function at all. And that means that we
3422 shoud have exited above, returning 0. */
3423 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3426 if (TREE_USED (olddecl
))
3427 /* From [temp.expl.spec]:
3429 If a template, a member template or the member of a class
3430 template is explicitly specialized then that
3431 specialization shall be declared before the first use of
3432 that specialization that would cause an implicit
3433 instantiation to take place, in every translation unit in
3434 which such a use occurs. */
3435 cp_error ("explicit specialization of %D after first use",
3438 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3440 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3442 /* If either decl says `inline', this fn is inline, unless its
3443 definition was passed already. */
3444 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3445 DECL_INLINE (olddecl
) = 1;
3446 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3450 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3451 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3452 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3454 if (! types_match
|| new_defines_function
)
3456 /* These need to be copied so that the names are available.
3457 Note that if the types do match, we'll preserve inline
3458 info and other bits, but if not, we won't. */
3459 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3460 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3462 if (new_defines_function
)
3463 /* If defining a function declared with other language
3464 linkage, use the previously declared language linkage. */
3465 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3466 else if (types_match
)
3468 /* If redeclaring a builtin function, and not a definition,
3469 it stays built in. */
3470 if (DECL_BUILT_IN (olddecl
))
3472 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3473 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3474 /* If we're keeping the built-in definition, keep the rtl,
3475 regardless of declaration matches. */
3476 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3479 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3481 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3482 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3483 /* Previously saved insns go together with
3484 the function's previous definition. */
3485 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3486 /* Don't clear out the arguments if we're redefining a function. */
3487 if (DECL_ARGUMENTS (olddecl
))
3488 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3490 if (DECL_LANG_SPECIFIC (olddecl
))
3491 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3494 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3496 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3499 /* Now preserve various other info from the definition. */
3500 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3501 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3502 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3503 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3505 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3509 function_size
= sizeof (struct tree_decl
);
3511 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3512 (char *) olddecl
+ sizeof (struct tree_common
),
3513 function_size
- sizeof (struct tree_common
));
3515 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3517 /* If newdecl is a template instantiation, it is possible that
3518 the following sequence of events has occurred:
3520 o A friend function was declared in a class template. The
3521 class template was instantiated.
3523 o The instantiation of the friend declaration was
3524 recorded on the instantiation list, and is newdecl.
3526 o Later, however, instantiate_class_template called pushdecl
3527 on the newdecl to perform name injection. But, pushdecl in
3528 turn called duplicate_decls when it discovered that another
3529 declaration of a global function with the same name already
3532 o Here, in duplicate_decls, we decided to clobber newdecl.
3534 If we're going to do that, we'd better make sure that
3535 olddecl, and not newdecl, is on the list of
3536 instantiations so that if we try to do the instantiation
3537 again we won't get the clobbered declaration. */
3539 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3540 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3542 for (; decls
; decls
= TREE_CHAIN (decls
))
3543 if (TREE_VALUE (decls
) == newdecl
)
3544 TREE_VALUE (decls
) = olddecl
;
3549 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3550 (char *) olddecl
+ sizeof (struct tree_common
),
3551 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3552 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3555 DECL_UID (olddecl
) = olddecl_uid
;
3557 DECL_FRIEND_P (olddecl
) = 1;
3559 /* NEWDECL contains the merged attribute lists.
3560 Update OLDDECL to be the same. */
3561 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3566 /* Record a decl-node X as belonging to the current lexical scope.
3567 Check for errors (such as an incompatible declaration for the same
3568 name already seen in the same scope).
3570 Returns either X or an old decl for the same name.
3571 If an old decl is returned, it may have been smashed
3572 to agree with what X says. */
3580 int need_new_binding
;
3582 /* We shouldn't be calling pushdecl when we're generating RTL for a
3583 function that we already did semantic analysis on previously. */
3584 my_friendly_assert (!current_function
|| doing_semantic_analysis_p (),
3587 name
= DECL_ASSEMBLER_NAME (x
);
3588 need_new_binding
= 1;
3590 if (DECL_TEMPLATE_PARM_P (x
))
3591 /* Template parameters have no context; they are not X::T even
3592 when declared within a class or namespace. */
3596 if (current_function_decl
&& x
!= current_function_decl
3597 /* A local declaration for a function doesn't constitute
3599 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3600 /* A local declaration for an `extern' variable is in the
3601 scoped of the current namespace, not the current
3603 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3604 /* Don't change DECL_CONTEXT of virtual methods. */
3605 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3606 && !DECL_CONTEXT (x
))
3607 DECL_CONTEXT (x
) = current_function_decl
;
3608 if (!DECL_CONTEXT (x
))
3609 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3611 /* If this is the declaration for a namespace-scope function,
3612 but the declaration itself is in a local scope, mark the
3614 if (TREE_CODE (x
) == FUNCTION_DECL
3615 && DECL_NAMESPACE_SCOPE_P (x
)
3616 && current_function_decl
3617 && x
!= current_function_decl
)
3618 DECL_LOCAL_FUNCTION_P (x
) = 1;
3621 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3622 compiler wants to use. */
3623 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3624 || TREE_CODE (x
) == NAMESPACE_DECL
)
3625 name
= DECL_NAME (x
);
3630 /* Not needed...see below. */
3634 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3635 name
= TREE_OPERAND (name
, 0);
3637 /* Namespace-scoped variables are not found in the current level. */
3638 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3639 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3641 t
= lookup_name_current_level (name
);
3642 if (t
== error_mark_node
)
3644 /* error_mark_node is 0 for a while during initialization! */
3646 cp_error_at ("`%#D' used prior to declaration", x
);
3649 else if (t
!= NULL_TREE
)
3652 /* This is turned off until I have time to do it right (bpk). */
3653 /* With the code below that uses it... */
3654 file
= DECL_SOURCE_FILE (t
);
3655 line
= DECL_SOURCE_LINE (t
);
3657 if (TREE_CODE (t
) == PARM_DECL
)
3659 if (DECL_CONTEXT (t
) == NULL_TREE
)
3660 fatal ("parse errors have confused me too much");
3662 /* Check for duplicate params. */
3663 if (duplicate_decls (x
, t
))
3666 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3667 || DECL_FUNCTION_TEMPLATE_P (x
))
3668 && is_overloaded_fn (t
))
3669 /* Don't do anything just yet. */;
3670 else if (t
== wchar_decl_node
)
3672 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3673 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3675 /* Throw away the redeclaration. */
3678 else if (TREE_CODE (t
) != TREE_CODE (x
))
3680 if (duplicate_decls (x
, t
))
3683 else if (duplicate_decls (x
, t
))
3686 /* This is turned off until I have time to do it right (bpk). */
3688 /* Also warn if they did a prototype with `static' on it, but
3689 then later left the `static' off. */
3690 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3692 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3697 cp_warning ("`static' missing from declaration of `%D'",
3699 warning_with_file_and_line (file
, line
,
3700 "previous declaration of `%s'",
3701 decl_as_string (t
, 0));
3704 /* Now fix things so it'll do what they expect. */
3705 if (current_function_decl
)
3706 TREE_PUBLIC (current_function_decl
) = 0;
3708 /* Due to interference in memory reclamation (X may be
3709 obstack-deallocated at this point), we must guard against
3710 one really special case. [jason: This should be handled
3711 by start_function] */
3712 if (current_function_decl
== x
)
3713 current_function_decl
= t
;
3715 if (TREE_CODE (t
) == TYPE_DECL
)
3716 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3717 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3718 check_default_args (t
);
3722 else if (DECL_MAIN_P (x
))
3724 /* A redeclaration of main, but not a duplicate of the
3729 This function shall not be overloaded. */
3730 cp_error_at ("invalid redeclaration of `%D'", t
);
3731 cp_error ("as `%D'", x
);
3732 /* We don't try to push this declaration since that
3738 check_template_shadow (x
);
3740 /* If this is a function conjured up by the backend, massage it
3741 so it looks friendly. */
3742 if (TREE_CODE (x
) == FUNCTION_DECL
3743 && ! DECL_LANG_SPECIFIC (x
))
3745 retrofit_lang_decl (x
);
3746 DECL_LANGUAGE (x
) = lang_c
;
3749 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3751 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3754 if (!namespace_bindings_p ())
3755 /* We do not need to create a binding for this name;
3756 push_overloaded_decl will have already done so if
3758 need_new_binding
= 0;
3760 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3762 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3764 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3768 /* If declaring a type as a typedef, copy the type (unless we're
3769 at line 0), and install this TYPE_DECL as the new type's typedef
3770 name. See the extensive comment in ../c-decl.c (pushdecl). */
3771 if (TREE_CODE (x
) == TYPE_DECL
)
3773 tree type
= TREE_TYPE (x
);
3774 if (DECL_SOURCE_LINE (x
) == 0)
3776 if (TYPE_NAME (type
) == 0)
3777 TYPE_NAME (type
) = x
;
3779 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3780 /* We don't want to copy the type when all we're
3781 doing is making a TYPE_DECL for the purposes of
3783 && (!TYPE_NAME (type
)
3784 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3786 DECL_ORIGINAL_TYPE (x
) = type
;
3787 type
= build_type_copy (type
);
3788 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3789 TYPE_NAME (type
) = x
;
3790 TREE_TYPE (x
) = type
;
3793 if (type
!= error_mark_node
3795 && TYPE_IDENTIFIER (type
))
3796 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3797 current_binding_level
);
3801 /* Multiple external decls of the same identifier ought to match.
3803 We get warnings about inline functions where they are defined.
3804 We get warnings about other functions from push_overloaded_decl.
3806 Avoid duplicate warnings where they are used. */
3807 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3811 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3812 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3813 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3814 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3819 /* If different sort of thing, we already gave an error. */
3820 && TREE_CODE (decl
) == TREE_CODE (x
)
3821 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3823 cp_pedwarn ("type mismatch with previous external decl", x
);
3824 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3828 /* This name is new in its binding level.
3829 Install the new declaration and return it. */
3830 if (namespace_bindings_p ())
3832 /* Install a global value. */
3834 /* If the first global decl has external linkage,
3835 warn if we later see static one. */
3836 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3837 TREE_PUBLIC (name
) = 1;
3839 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3841 /* For an ordinary function, we create a binding from
3842 the mangled name (i.e., NAME) to the DECL. But, for
3843 an `extern "C"' function, the mangled name and the
3844 ordinary name are the same so we need not do this. */
3845 && !(TREE_CODE (x
) == FUNCTION_DECL
&&
3846 DECL_LANGUAGE (x
) == lang_c
))
3848 if (TREE_CODE (x
) == FUNCTION_DECL
)
3850 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3851 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3852 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3855 /* Don't forget if the function was used via an implicit decl. */
3856 if (IDENTIFIER_IMPLICIT_DECL (name
)
3857 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3860 /* Don't forget if its address was taken in that way. */
3861 if (IDENTIFIER_IMPLICIT_DECL (name
)
3862 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3863 TREE_ADDRESSABLE (x
) = 1;
3865 /* Warn about mismatches against previous implicit decl. */
3866 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3867 /* If this real decl matches the implicit, don't complain. */
3868 && ! (TREE_CODE (x
) == FUNCTION_DECL
3869 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3871 ("`%D' was previously implicitly declared to return `int'", x
);
3873 /* If new decl is `static' and an `extern' was seen previously,
3875 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3876 warn_extern_redeclared_static (x
, t
);
3880 /* Here to install a non-global value. */
3881 tree oldlocal
= IDENTIFIER_VALUE (name
);
3882 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3884 if (need_new_binding
)
3886 push_local_binding (name
, x
, 0);
3887 /* Because push_local_binding will hook X on to the
3888 current_binding_level's name list, we don't want to
3889 do that again below. */
3890 need_new_binding
= 0;
3893 /* If this is a TYPE_DECL, push it into the type value slot. */
3894 if (TREE_CODE (x
) == TYPE_DECL
)
3895 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3896 current_binding_level
);
3898 /* Clear out any TYPE_DECL shadowed by a namespace so that
3899 we won't think this is a type. The C struct hack doesn't
3900 go through namespaces. */
3901 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3902 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3903 current_binding_level
);
3905 /* If this is an extern function declaration, see if we
3906 have a global definition or declaration for the function. */
3907 if (oldlocal
== NULL_TREE
3908 && DECL_EXTERNAL (x
)
3909 && oldglobal
!= NULL_TREE
3910 && TREE_CODE (x
) == FUNCTION_DECL
3911 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3913 /* We have one. Their types must agree. */
3914 if (decls_match (x
, oldglobal
))
3918 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3919 cp_warning_at ("global declaration `%#D'", oldglobal
);
3922 /* If we have a local external declaration,
3923 and no file-scope declaration has yet been seen,
3924 then if we later have a file-scope decl it must not be static. */
3925 if (oldlocal
== NULL_TREE
3926 && oldglobal
== NULL_TREE
3927 && DECL_EXTERNAL (x
)
3929 TREE_PUBLIC (name
) = 1;
3931 if (DECL_FROM_INLINE (x
))
3932 /* Inline decls shadow nothing. */;
3934 /* Warn if shadowing an argument at the top level of the body. */
3935 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3936 && TREE_CODE (oldlocal
) == PARM_DECL
3937 /* Don't complain if it's from an enclosing function. */
3938 && DECL_CONTEXT (oldlocal
) == current_function_decl
3939 && TREE_CODE (x
) != PARM_DECL
)
3941 /* Go to where the parms should be and see if we
3943 struct binding_level
*b
= current_binding_level
->level_chain
;
3949 if (b
->parm_flag
== 1)
3950 cp_error ("declaration of `%#D' shadows a parameter", name
);
3952 else if (warn_shadow
&& oldlocal
!= NULL_TREE
3953 && current_binding_level
->is_for_scope
3954 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3956 warning ("variable `%s' shadows local",
3957 IDENTIFIER_POINTER (name
));
3958 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3960 /* Maybe warn if shadowing something else. */
3961 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
3962 /* No shadow warnings for internally generated vars. */
3963 && ! DECL_ARTIFICIAL (x
)
3964 /* No shadow warnings for vars made for inlining. */
3965 && ! DECL_FROM_INLINE (x
))
3967 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
3968 warning ("declaration of `%s' shadows a parameter",
3969 IDENTIFIER_POINTER (name
));
3970 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
3971 && current_class_ptr
3972 && !TREE_STATIC (name
))
3973 warning ("declaration of `%s' shadows a member of `this'",
3974 IDENTIFIER_POINTER (name
));
3975 else if (oldlocal
!= NULL_TREE
)
3976 warning ("declaration of `%s' shadows previous local",
3977 IDENTIFIER_POINTER (name
));
3978 else if (oldglobal
!= NULL_TREE
)
3979 /* XXX shadow warnings in outer-more namespaces */
3980 warning ("declaration of `%s' shadows global declaration",
3981 IDENTIFIER_POINTER (name
));
3985 if (TREE_CODE (x
) == FUNCTION_DECL
)
3986 check_default_args (x
);
3988 /* Keep count of variables in this level with incomplete type. */
3989 if (TREE_CODE (x
) == VAR_DECL
3990 && TREE_TYPE (x
) != error_mark_node
3991 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
3992 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
3993 /* RTTI TD entries are created while defining the type_info. */
3994 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
3995 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
3996 current_binding_level
->incomplete
3997 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4000 if (need_new_binding
)
4001 add_decl_to_level (x
,
4002 DECL_NAMESPACE_SCOPE_P (x
)
4003 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4004 : current_binding_level
);
4009 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4010 caller to set DECL_CONTEXT properly. */
4013 pushdecl_with_scope (x
, level
)
4015 struct binding_level
*level
;
4017 register struct binding_level
*b
;
4018 tree function_decl
= current_function_decl
;
4020 current_function_decl
= NULL_TREE
;
4021 if (level
->parm_flag
== 2)
4023 b
= class_binding_level
;
4024 class_binding_level
= level
;
4025 pushdecl_class_level (x
);
4026 class_binding_level
= b
;
4030 b
= current_binding_level
;
4031 current_binding_level
= level
;
4033 current_binding_level
= b
;
4035 current_function_decl
= function_decl
;
4039 /* Like pushdecl, only it places X in the current namespace,
4043 pushdecl_namespace_level (x
)
4046 register struct binding_level
*b
= current_binding_level
;
4049 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4051 /* Now, the type_shadowed stack may screw us. Munge it so it does
4053 if (TREE_CODE (x
) == TYPE_DECL
)
4055 tree name
= DECL_NAME (x
);
4057 tree
*ptr
= (tree
*)0;
4058 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4060 tree shadowed
= b
->type_shadowed
;
4061 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4062 if (TREE_PURPOSE (shadowed
) == name
)
4064 ptr
= &TREE_VALUE (shadowed
);
4065 /* Can't break out of the loop here because sometimes
4066 a binding level will have duplicate bindings for
4067 PT names. It's gross, but I haven't time to fix it. */
4070 newval
= TREE_TYPE (x
);
4071 if (ptr
== (tree
*)0)
4073 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4074 up here if this is changed to an assertion. --KR */
4075 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4085 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4089 pushdecl_top_level (x
)
4092 push_to_top_level ();
4093 x
= pushdecl_namespace_level (x
);
4094 pop_from_top_level ();
4098 /* Make the declaration of X appear in CLASS scope. */
4101 pushdecl_class_level (x
)
4104 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4105 scope looks for the pre-mangled name. */
4108 if (TREE_CODE (x
) == OVERLOAD
)
4109 x
= OVL_CURRENT (x
);
4110 name
= DECL_NAME (x
);
4114 push_class_level_binding (name
, x
);
4115 if (TREE_CODE (x
) == TYPE_DECL
)
4116 set_identifier_type_value (name
, TREE_TYPE (x
));
4118 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4122 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4125 pushdecl_class_level (f
);
4129 /* Enter DECL into the symbol table, if that's appropriate. Returns
4130 DECL, or a modified version thereof. */
4133 maybe_push_decl (decl
)
4136 tree type
= TREE_TYPE (decl
);
4138 /* Add this decl to the current binding level, but not if it comes
4139 from another scope, e.g. a static member variable. TEM may equal
4140 DECL or it may be a previous decl of the same name. */
4141 if ((TREE_CODE (decl
) != PARM_DECL
4142 && DECL_CONTEXT (decl
) != NULL_TREE
4143 /* Definitions of namespace members outside their namespace are
4145 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4146 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4147 || TREE_CODE (type
) == UNKNOWN_TYPE
4148 /* The declaration of a template specialization does not affect
4149 the functions available for overload resolution, so we do not
4151 || (TREE_CODE (decl
) == FUNCTION_DECL
4152 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4155 return pushdecl (decl
);
4159 /* This function is used to push the mangled decls for nested types into
4160 the appropriate scope. Previously pushdecl_top_level was used, but that
4161 is incorrect for members of local classes. */
4164 pushdecl_nonclass_level (x
)
4167 struct binding_level
*b
= current_binding_level
;
4169 my_friendly_assert (b
->parm_flag
!= 2, 180);
4172 /* Get out of template binding levels */
4173 while (b
->pseudo_global
)
4177 pushdecl_with_scope (x
, b
);
4181 /* Make the declaration(s) of X appear in CLASS scope
4182 under the name NAME. */
4185 push_class_level_binding (name
, x
)
4190 /* The class_binding_level will be NULL if x is a template
4191 parameter name in a member template. */
4192 if (!class_binding_level
)
4195 /* Make sure that this new member does not have the same name
4196 as a template parameter. */
4197 if (TYPE_BEING_DEFINED (current_class_type
))
4198 check_template_shadow (x
);
4200 /* If this declaration shadows a declaration from an enclosing
4201 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4202 we leave this class. Record the shadowed declaration here. */
4203 binding
= IDENTIFIER_BINDING (name
);
4205 && ((TREE_CODE (x
) == OVERLOAD
4206 && BINDING_VALUE (binding
)
4207 && is_overloaded_fn (BINDING_VALUE (binding
)))
4208 || INHERITED_VALUE_BINDING_P (binding
)))
4213 /* If the old binding was from a base class, and was for a tag
4214 name, slide it over to make room for the new binding. The
4215 old binding is still visible if explicitly qualified with a
4217 if (INHERITED_VALUE_BINDING_P (binding
)
4218 && BINDING_VALUE (binding
)
4219 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4220 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4221 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4223 old_decl
= BINDING_TYPE (binding
);
4224 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4225 BINDING_VALUE (binding
) = NULL_TREE
;
4226 INHERITED_VALUE_BINDING_P (binding
) = 0;
4229 old_decl
= BINDING_VALUE (binding
);
4231 /* There was already a binding for X containing fewer
4232 functions than are named in X. Find the previous
4233 declaration of X on the class-shadowed list, and update it. */
4234 for (shadow
= class_binding_level
->class_shadowed
;
4236 shadow
= TREE_CHAIN (shadow
))
4237 if (TREE_PURPOSE (shadow
) == name
4238 && TREE_TYPE (shadow
) == old_decl
)
4240 BINDING_VALUE (binding
) = x
;
4241 INHERITED_VALUE_BINDING_P (binding
) = 0;
4242 TREE_TYPE (shadow
) = x
;
4247 /* If we didn't replace an existing binding, put the binding on the
4248 stack of bindings for the identifier, and update
4249 IDENTIFIER_CLASS_VALUE. */
4250 if (push_class_binding (name
, x
))
4252 class_binding_level
->class_shadowed
4253 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4254 class_binding_level
->class_shadowed
);
4255 /* Record the value we are binding NAME to so that we can know
4256 what to pop later. */
4257 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4261 /* Insert another USING_DECL into the current binding level,
4262 returning this declaration. If this is a redeclaration,
4263 do nothing and return NULL_TREE. */
4266 push_using_decl (scope
, name
)
4272 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4273 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4274 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4275 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4279 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4280 DECL_INITIAL (decl
) = scope
;
4281 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4282 current_binding_level
->usings
= decl
;
4286 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4287 changed (i.e. there was already a directive), or the fresh
4288 TREE_LIST otherwise. */
4291 push_using_directive (used
)
4294 tree ud
= current_binding_level
->using_directives
;
4295 tree iter
, ancestor
;
4297 /* Check if we already have this. */
4298 if (purpose_member (used
, ud
) != NULL_TREE
)
4301 /* Recursively add all namespaces used. */
4302 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4303 push_using_directive (TREE_PURPOSE (iter
));
4305 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4306 ud
= current_binding_level
->using_directives
;
4307 ud
= tree_cons (used
, ancestor
, ud
);
4308 current_binding_level
->using_directives
= ud
;
4312 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4313 other definitions already in place. We get around this by making
4314 the value of the identifier point to a list of all the things that
4315 want to be referenced by that name. It is then up to the users of
4316 that name to decide what to do with that list.
4318 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4319 slot. It is dealt with the same way.
4321 FLAGS is a bitwise-or of the following values:
4322 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4324 PUSH_USING: DECL is being pushed as the result of a using
4327 The value returned may be a previous declaration if we guessed wrong
4328 about what language DECL should belong to (C or C++). Otherwise,
4329 it's always DECL (and never something that's not a _DECL). */
4332 push_overloaded_decl (decl
, flags
)
4336 tree name
= DECL_NAME (decl
);
4339 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4342 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4344 old
= lookup_name_current_level (name
);
4348 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4350 tree t
= TREE_TYPE (old
);
4351 if (IS_AGGR_TYPE (t
) && warn_shadow
4352 && (! DECL_IN_SYSTEM_HEADER (decl
)
4353 || ! DECL_IN_SYSTEM_HEADER (old
)))
4354 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4357 else if (is_overloaded_fn (old
))
4361 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4363 tree fn
= OVL_CURRENT (tmp
);
4365 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4366 && !(flags
& PUSH_USING
)
4367 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4368 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4369 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4372 if (duplicate_decls (decl
, fn
))
4378 cp_error_at ("previous non-function declaration `%#D'", old
);
4379 cp_error ("conflicts with function declaration `%#D'", decl
);
4384 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4386 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4387 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4389 new_binding
= ovl_cons (decl
, old
);
4390 if (flags
& PUSH_USING
)
4391 OVL_USED (new_binding
) = 1;
4394 /* NAME is not ambiguous. */
4398 set_namespace_binding (name
, current_namespace
, new_binding
);
4401 /* We only create an OVERLOAD if there was a previous binding at
4402 this level, or if decl is a template. In the former case, we
4403 need to remove the old binding and replace it with the new
4404 binding. We must also run through the NAMES on the binding
4405 level where the name was bound to update the chain. */
4407 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4411 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4413 d
= &TREE_CHAIN (*d
))
4415 || (TREE_CODE (*d
) == TREE_LIST
4416 && TREE_VALUE (*d
) == old
))
4418 if (TREE_CODE (*d
) == TREE_LIST
)
4419 /* Just replace the old binding with the new. */
4420 TREE_VALUE (*d
) = new_binding
;
4422 /* Build a TREE_LIST to wrap the OVERLOAD. */
4423 *d
= tree_cons (NULL_TREE
, new_binding
,
4426 /* And update the CPLUS_BINDING node. */
4427 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4432 /* We should always find a previous binding in this case. */
4433 my_friendly_abort (0);
4436 /* Install the new binding. */
4437 push_local_binding (name
, new_binding
, flags
);
4443 /* Generate an implicit declaration for identifier FUNCTIONID
4444 as a function of type int (). Print a warning if appropriate. */
4447 implicitly_declare (functionid
)
4452 /* We used to reuse an old implicit decl here,
4453 but this loses with inline functions because it can clobber
4454 the saved decl chains. */
4455 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4457 DECL_EXTERNAL (decl
) = 1;
4458 TREE_PUBLIC (decl
) = 1;
4460 /* ANSI standard says implicit declarations are in the innermost block.
4461 So we record the decl in the standard fashion. */
4463 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4466 /* Only one warning per identifier. */
4467 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4469 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4472 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4477 /* Return zero if the declaration NEWDECL is valid
4478 when the declaration OLDDECL (assumed to be for the same name)
4479 has already been seen.
4480 Otherwise return an error message format string with a %s
4481 where the identifier should go. */
4484 redeclaration_error_message (newdecl
, olddecl
)
4485 tree newdecl
, olddecl
;
4487 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4489 /* Because C++ can put things into name space for free,
4490 constructs like "typedef struct foo { ... } foo"
4491 would look like an erroneous redeclaration. */
4492 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4495 return "redefinition of `%#D'";
4497 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4499 /* If this is a pure function, its olddecl will actually be
4500 the original initialization to `0' (which we force to call
4501 abort()). Don't complain about redefinition in this case. */
4502 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4505 /* If both functions come from different namespaces, this is not
4506 a redeclaration - this is a conflict with a used function. */
4507 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4508 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4509 return "`%D' conflicts with used function";
4511 /* We'll complain about linkage mismatches in
4512 warn_extern_redeclared_static. */
4514 /* Defining the same name twice is no good. */
4515 if (DECL_INITIAL (olddecl
) != NULL_TREE
4516 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4518 if (DECL_NAME (olddecl
) == NULL_TREE
)
4519 return "`%#D' not declared in class";
4521 return "redefinition of `%#D'";
4525 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4527 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4528 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4529 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4530 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4531 && TYPE_SIZE (TREE_TYPE (newdecl
))
4532 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4533 return "redefinition of `%#D'";
4536 else if (toplevel_bindings_p ())
4538 /* Objects declared at top level: */
4539 /* If at least one is a reference, it's ok. */
4540 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4542 /* Reject two definitions. */
4543 return "redefinition of `%#D'";
4547 /* Objects declared with block scope: */
4548 /* Reject two definitions, and reject a definition
4549 together with an external reference. */
4550 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4551 return "redeclaration of `%#D'";
4556 /* Create a new label, named ID. */
4559 make_label_decl (id
, local_p
)
4565 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4567 /* Make sure every label has an rtx. */
4570 DECL_CONTEXT (decl
) = current_function_decl
;
4571 DECL_MODE (decl
) = VOIDmode
;
4572 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4574 /* Say where one reference is to the label, for the sake of the
4575 error if it is not defined. */
4576 DECL_SOURCE_LINE (decl
) = lineno
;
4577 DECL_SOURCE_FILE (decl
) = input_filename
;
4579 /* Record the fact that this identifier is bound to this label. */
4580 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4582 /* Record this label on the list of used labels so that we can check
4583 at the end of the function to see whether or not the label was
4584 actually defined. */
4585 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4586 && (named_label_uses
== NULL
4587 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4588 || named_label_uses
->label_decl
!= decl
))
4590 struct named_label_list
*new_ent
;
4592 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4593 new_ent
->label_decl
= decl
;
4594 new_ent
->names_in_scope
= current_binding_level
->names
;
4595 new_ent
->binding_level
= current_binding_level
;
4596 new_ent
->lineno_o_goto
= lineno
;
4597 new_ent
->filename_o_goto
= input_filename
;
4598 new_ent
->next
= named_label_uses
;
4599 named_label_uses
= new_ent
;
4605 /* Look for a label named ID in the current function. If one cannot
4606 be found, create one. (We keep track of used, but undefined,
4607 labels, and complain about them at the end of a function.) */
4615 /* You can't use labels at global scope. */
4616 if (current_function_decl
== NULL_TREE
)
4618 error ("label `%s' referenced outside of any function",
4619 IDENTIFIER_POINTER (id
));
4623 /* See if we've already got this label. */
4624 decl
= IDENTIFIER_LABEL_VALUE (id
);
4625 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4628 /* Record this label on the list of labels used in this function.
4629 We do this before calling make_label_decl so that we get the
4630 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4631 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4633 /* We need a new label. */
4634 decl
= make_label_decl (id
, /*local_p=*/0);
4635 /* Now fill in the information we didn't have before. */
4636 TREE_VALUE (named_labels
) = decl
;
4641 /* Declare a local label named ID. */
4644 declare_local_label (id
)
4649 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4650 this scope we can restore the old value of
4651 IDENTIFIER_TYPE_VALUE. */
4652 current_binding_level
->shadowed_labels
4653 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4654 current_binding_level
->shadowed_labels
);
4655 /* Look for the label. */
4656 decl
= make_label_decl (id
, /*local_p=*/1);
4657 /* Now fill in the information we didn't have before. */
4658 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4663 /* Define a label, specifying the location in the source file.
4664 Return the LABEL_DECL node for the label, if the definition is valid.
4665 Otherwise return 0. */
4668 define_label (filename
, line
, name
)
4673 tree decl
= lookup_label (name
);
4675 /* After labels, make any new cleanups go into their
4676 own new (temporary) binding contour. */
4677 current_binding_level
->more_cleanups_ok
= 0;
4679 if (name
== get_identifier ("wchar_t"))
4680 cp_pedwarn ("label named wchar_t");
4682 if (DECL_INITIAL (decl
) != NULL_TREE
)
4684 cp_error ("duplicate label `%D'", decl
);
4689 struct named_label_list
*uses
, *prev
;
4693 /* Mark label as having been defined. */
4694 DECL_INITIAL (decl
) = error_mark_node
;
4695 /* Say where in the source. */
4696 DECL_SOURCE_FILE (decl
) = filename
;
4697 DECL_SOURCE_LINE (decl
) = line
;
4700 uses
= named_label_uses
;
4701 while (uses
!= NULL
)
4702 if (uses
->label_decl
== decl
)
4704 struct binding_level
*b
= current_binding_level
;
4707 tree new_decls
= b
->names
;
4708 tree old_decls
= (b
== uses
->binding_level
)
4709 ? uses
->names_in_scope
: NULL_TREE
;
4710 while (new_decls
!= old_decls
)
4712 if (TREE_CODE (new_decls
) == VAR_DECL
4713 /* Don't complain about crossing initialization
4714 of internal entities. They can't be accessed,
4715 and they should be cleaned up
4716 by the time we get to the label. */
4717 && ! DECL_ARTIFICIAL (new_decls
)
4718 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4719 && pod_type_p (TREE_TYPE (new_decls
))))
4721 /* This is really only important if we're crossing
4722 an initialization. The POD stuff is just
4723 pedantry; why should it matter if the class
4724 contains a field of pointer to member type? */
4725 int problem
= (DECL_INITIAL (new_decls
)
4726 || (TYPE_NEEDS_CONSTRUCTING
4727 (TREE_TYPE (new_decls
))));
4733 cp_error ("jump to label `%D'", decl
);
4734 error_with_file_and_line
4735 (uses
->filename_o_goto
,
4736 uses
->lineno_o_goto
, " from here");
4740 cp_pedwarn ("jump to label `%D'", decl
);
4741 pedwarn_with_file_and_line
4742 (uses
->filename_o_goto
,
4743 uses
->lineno_o_goto
, " from here");
4749 cp_error_at (" crosses initialization of `%#D'",
4752 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4755 new_decls
= TREE_CHAIN (new_decls
);
4757 if (b
== uses
->binding_level
)
4759 if (b
->eh_region
&& ! saw_eh
)
4763 cp_error ("jump to label `%D'", decl
);
4764 error_with_file_and_line
4765 (uses
->filename_o_goto
,
4766 uses
->lineno_o_goto
, " from here");
4769 error (" enters exception handling block");
4776 prev
->next
= uses
->next
;
4778 named_label_uses
= uses
->next
;
4787 current_function_return_value
= NULL_TREE
;
4794 struct binding_level
*level
;
4795 struct cp_switch
*next
;
4798 static struct cp_switch
*switch_stack
;
4804 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4805 p
->level
= current_binding_level
;
4806 p
->next
= switch_stack
;
4813 switch_stack
= switch_stack
->next
;
4816 /* Note that we've seen a definition of a case label, and complain if this
4817 is a bad place for one. */
4820 define_case_label ()
4822 tree cleanup
= last_cleanup_this_contour ();
4823 struct binding_level
*b
= current_binding_level
;
4827 /* Don't crash; we'll complain in do_case. */
4832 static int explained
= 0;
4833 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4834 warning ("where case label appears here");
4837 warning ("(enclose actions of previous case statements requiring");
4838 warning ("destructors in their own binding contours.)");
4843 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4845 tree new_decls
= b
->names
;
4846 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4848 if (TREE_CODE (new_decls
) == VAR_DECL
4849 /* Don't complain about crossing initialization
4850 of internal entities. They can't be accessed,
4851 and they should be cleaned up
4852 by the time we get to the label. */
4853 && ! DECL_ARTIFICIAL (new_decls
)
4854 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4855 && DECL_INITIAL (new_decls
) != error_mark_node
)
4856 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4859 error ("jump to case label");
4861 cp_error_at (" crosses initialization of `%#D'",
4867 /* After labels, make any new cleanups go into their
4868 own new (temporary) binding contour. */
4870 current_binding_level
->more_cleanups_ok
= 0;
4871 current_function_return_value
= NULL_TREE
;
4874 /* Return the list of declarations of the current level.
4875 Note that this list is in reverse order unless/until
4876 you nreverse it; and when you do nreverse it, you must
4877 store the result back using `storedecls' or you will lose. */
4882 return current_binding_level
->names
;
4885 /* Return the list of type-tags (for structs, etc) of the current level. */
4890 return current_binding_level
->tags
;
4893 /* Store the list of declarations of the current level.
4894 This is done for the parameter declarations of a function being defined,
4895 after they are modified in the light of any missing parameters. */
4901 current_binding_level
->names
= decls
;
4904 /* Similarly, store the list of tags of the current level. */
4910 current_binding_level
->tags
= tags
;
4913 /* Given NAME, an IDENTIFIER_NODE,
4914 return the structure (or union or enum) definition for that name.
4915 Searches binding levels from BINDING_LEVEL up to the global level.
4916 If THISLEVEL_ONLY is nonzero, searches only the specified context
4917 (but skips any tag-transparent contexts to find one that is
4918 meaningful for tags).
4919 FORM says which kind of type the caller wants;
4920 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4921 If the wrong kind of type is found, and it's not a template, an error is
4925 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4926 enum tree_code form
;
4928 struct binding_level
*binding_level
;
4931 register struct binding_level
*level
;
4932 /* Non-zero if, we should look past a pseudo-global level, even if
4934 int allow_pseudo_global
= 1;
4936 for (level
= binding_level
; level
; level
= level
->level_chain
)
4939 if (ANON_AGGRNAME_P (name
))
4940 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4942 /* There's no need for error checking here, because
4943 anon names are unique throughout the compilation. */
4944 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4945 return TREE_VALUE (tail
);
4947 else if (level
->namespace_p
)
4948 /* Do namespace lookup. */
4949 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
4951 tree old
= binding_for_name (name
, tail
);
4953 /* If we just skipped past a pseudo global level, even
4954 though THISLEVEL_ONLY, and we find a template class
4955 declaration, then we use the _TYPE node for the
4956 template. See the example below. */
4957 if (thislevel_only
&& !allow_pseudo_global
4958 && old
&& BINDING_VALUE (old
)
4959 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
4960 old
= TREE_TYPE (BINDING_VALUE (old
));
4962 old
= BINDING_TYPE (old
);
4964 /* If it has an original type, it is a typedef, and we
4965 should not return it. */
4966 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
4968 if (old
&& TREE_CODE (old
) != form
4969 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
4971 cp_error ("`%#D' redeclared as %C", old
, form
);
4976 if (thislevel_only
|| tail
== global_namespace
)
4980 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4982 if (TREE_PURPOSE (tail
) == name
)
4984 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
4985 /* Should tighten this up; it'll probably permit
4986 UNION_TYPE and a struct template, for example. */
4988 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
4990 /* Definition isn't the kind we were looking for. */
4991 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
4995 return TREE_VALUE (tail
);
4998 if (thislevel_only
&& ! level
->tag_transparent
)
5000 if (level
->pseudo_global
&& allow_pseudo_global
)
5002 /* We must deal with cases like this:
5004 template <class T> struct S;
5005 template <class T> struct S {};
5007 When looking up `S', for the second declaration, we
5008 would like to find the first declaration. But, we
5009 are in the pseudo-global level created for the
5010 template parameters, rather than the (surrounding)
5011 namespace level. Thus, we keep going one more level,
5012 even though THISLEVEL_ONLY is non-zero. */
5013 allow_pseudo_global
= 0;
5025 set_current_level_tags_transparency (tags_transparent
)
5026 int tags_transparent
;
5028 current_binding_level
->tag_transparent
= tags_transparent
;
5032 /* Given a type, find the tag that was defined for it and return the tag name.
5033 Otherwise return 0. However, the value can never be 0
5034 in the cases in which this is used.
5036 C++: If NAME is non-zero, this is the new name to install. This is
5037 done when replacing anonymous tags with real tag names. */
5040 lookup_tag_reverse (type
, name
)
5044 register struct binding_level
*level
;
5046 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5049 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5051 if (TREE_VALUE (tail
) == type
)
5054 TREE_PURPOSE (tail
) = name
;
5055 return TREE_PURPOSE (tail
);
5062 /* Look up NAME in the NAMESPACE. */
5065 lookup_namespace_name (namespace, name
)
5066 tree
namespace, name
;
5069 tree template_id
= NULL_TREE
;
5071 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5073 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5074 /* This happens for A::B<int> when B is a namespace. */
5076 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5078 /* This happens for A::B where B is a template, and there are no
5079 template arguments. */
5080 cp_error ("invalid use of `%D'", name
);
5081 return error_mark_node
;
5084 namespace = ORIGINAL_NAMESPACE (namespace);
5086 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5089 name
= TREE_OPERAND (name
, 0);
5090 if (TREE_CODE (name
) == OVERLOAD
)
5091 name
= DECL_NAME (OVL_CURRENT (name
));
5092 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5093 name
= DECL_NAME (name
);
5096 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5098 val
= make_node (CPLUS_BINDING
);
5099 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5100 return error_mark_node
;
5102 if (BINDING_VALUE (val
))
5104 val
= BINDING_VALUE (val
);
5108 if (DECL_CLASS_TEMPLATE_P (val
))
5109 val
= lookup_template_class (val
,
5110 TREE_OPERAND (template_id
, 1),
5111 /*in_decl=*/NULL_TREE
,
5112 /*context=*/NULL_TREE
,
5113 /*entering_scope=*/0);
5114 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5115 || TREE_CODE (val
) == OVERLOAD
)
5116 val
= lookup_template_function (val
,
5117 TREE_OPERAND (template_id
, 1));
5120 cp_error ("`%D::%D' is not a template",
5122 return error_mark_node
;
5126 /* If we have a single function from a using decl, pull it out. */
5127 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5128 val
= OVL_FUNCTION (val
);
5132 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5133 return error_mark_node
;
5136 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5138 static unsigned long
5146 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5147 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5152 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5155 typename_compare (k1
, k2
)
5166 d1
= TYPE_NAME (t1
);
5167 d2
= TYPE_NAME (t2
);
5169 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5170 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5171 && ((TREE_TYPE (t1
) != NULL_TREE
)
5172 == (TREE_TYPE (t2
) != NULL_TREE
))
5173 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5174 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5177 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5178 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5179 is non-NULL, this type is being created by the implicit typename
5180 extension, and BASE_TYPE is a type named `t' in some base class of
5181 `T' which depends on template parameters.
5183 Returns the new TYPENAME_TYPE. */
5186 build_typename_type (context
, name
, fullname
, base_type
)
5194 struct hash_entry
* e
;
5196 static struct hash_table ht
;
5200 static struct hash_table
*h
= &ht
;
5201 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5203 fatal ("virtual memory exhausted");
5204 ggc_add_tree_hash_table_root (&h
, 1);
5207 /* Build the TYPENAME_TYPE. */
5208 t
= make_lang_type (TYPENAME_TYPE
);
5209 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5210 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5211 TREE_TYPE (t
) = base_type
;
5213 /* Build the corresponding TYPE_DECL. */
5214 d
= build_decl (TYPE_DECL
, name
, t
);
5215 TYPE_NAME (TREE_TYPE (d
)) = d
;
5216 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5217 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5218 DECL_ARTIFICIAL (d
) = 1;
5220 /* See if we already have this type. */
5221 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5225 /* Insert the type into the table. */
5226 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5231 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5232 unless an error occurs, in which case error_mark_node is returned.
5233 If COMPLAIN zero, don't complain about any errors that occur. */
5236 make_typename_type (context
, name
, complain
)
5242 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5244 if (!(TYPE_LANG_SPECIFIC (name
)
5245 && (CLASSTYPE_IS_TEMPLATE (name
)
5246 || CLASSTYPE_USE_TEMPLATE (name
))))
5247 name
= TYPE_IDENTIFIER (name
);
5249 /* Create a TEMPLATE_ID_EXPR for the type. */
5250 name
= build_nt (TEMPLATE_ID_EXPR
,
5251 CLASSTYPE_TI_TEMPLATE (name
),
5252 CLASSTYPE_TI_ARGS (name
));
5254 else if (TREE_CODE (name
) == TYPE_DECL
)
5255 name
= DECL_NAME (name
);
5259 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5261 name
= TREE_OPERAND (name
, 0);
5262 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5263 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5265 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5266 my_friendly_abort (2000);
5268 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5270 /* We can get here from typename_sub0 in the explicit_template_type
5271 expansion. Just fail. */
5273 cp_error ("no class template named `%#T' in `%#T'",
5275 return error_mark_node
;
5278 if (! uses_template_parms (context
)
5279 || currently_open_class (context
))
5281 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5283 tree tmpl
= NULL_TREE
;
5284 if (IS_AGGR_TYPE (context
))
5285 tmpl
= lookup_field (context
, name
, 0, 0);
5286 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5289 cp_error ("no class template named `%#T' in `%#T'",
5291 return error_mark_node
;
5294 return lookup_template_class (tmpl
,
5295 TREE_OPERAND (fullname
, 1),
5297 /*entering_scope=*/0);
5303 if (!IS_AGGR_TYPE (context
))
5306 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5307 return error_mark_node
;
5310 t
= lookup_field (context
, name
, 0, 1);
5312 return TREE_TYPE (t
);
5316 /* If the CONTEXT is not a template type, then either the field is
5317 there now or its never going to be. */
5318 if (!uses_template_parms (context
))
5321 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5322 return error_mark_node
;
5326 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5329 /* Select the right _DECL from multiple choices. */
5332 select_decl (binding
, flags
)
5337 val
= BINDING_VALUE (binding
);
5338 if (LOOKUP_NAMESPACES_ONLY (flags
))
5340 /* We are not interested in types. */
5341 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5346 /* If we could have a type and
5347 we have nothing or we need a type and have none. */
5348 if (BINDING_TYPE (binding
)
5349 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5350 && TREE_CODE (val
) != TYPE_DECL
)))
5351 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5352 /* Don't return non-types if we really prefer types. */
5353 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5354 && (TREE_CODE (val
) != TEMPLATE_DECL
5355 || !DECL_CLASS_TEMPLATE_P (val
)))
5361 /* Unscoped lookup of a global: iterate over current namespaces,
5362 considering using-directives. If SPACESP is non-NULL, store a list
5363 of the namespaces we've considered in it. */
5366 unqualified_namespace_lookup (name
, flags
, spacesp
)
5371 tree b
= make_node (CPLUS_BINDING
);
5372 tree initial
= current_decl_namespace();
5373 tree scope
= initial
;
5375 struct binding_level
*level
;
5376 tree val
= NULL_TREE
;
5379 *spacesp
= NULL_TREE
;
5381 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5384 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5385 val
= binding_for_name (name
, scope
);
5387 /* Initialize binding for this context. */
5388 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5389 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5391 /* Add all _DECLs seen through local using-directives. */
5392 for (level
= current_binding_level
;
5393 !level
->namespace_p
;
5394 level
= level
->level_chain
)
5395 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5396 scope
, flags
, spacesp
))
5397 /* Give up because of error. */
5398 return error_mark_node
;
5400 /* Add all _DECLs seen through global using-directives. */
5401 /* XXX local and global using lists should work equally. */
5405 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5406 scope
, flags
, spacesp
))
5407 /* Give up because of error. */
5408 return error_mark_node
;
5409 if (siter
== scope
) break;
5410 siter
= CP_DECL_CONTEXT (siter
);
5413 val
= select_decl (b
, flags
);
5414 if (scope
== global_namespace
)
5420 /* Combine prefer_type and namespaces_only into flags. */
5423 lookup_flags (prefer_type
, namespaces_only
)
5424 int prefer_type
, namespaces_only
;
5426 if (namespaces_only
)
5427 return LOOKUP_PREFER_NAMESPACES
;
5428 if (prefer_type
> 1)
5429 return LOOKUP_PREFER_TYPES
;
5430 if (prefer_type
> 0)
5431 return LOOKUP_PREFER_BOTH
;
5435 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5436 ignore it or not. Subroutine of lookup_name_real. */
5439 qualify_lookup (val
, flags
)
5443 if (val
== NULL_TREE
)
5445 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5447 if ((flags
& LOOKUP_PREFER_TYPES
)
5448 && (TREE_CODE (val
) == TYPE_DECL
5449 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5450 && DECL_CLASS_TEMPLATE_P (val
))))
5452 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5457 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5461 warn_about_implicit_typename_lookup (typename
, binding
)
5465 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5466 tree name
= DECL_NAME (typename
);
5468 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5469 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5470 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5471 && ! (TREE_CODE (binding
) == TYPE_DECL
5472 && same_type_p (TREE_TYPE (binding
), subtype
)))
5474 cp_warning ("lookup of `%D' finds `%#D'",
5476 cp_warning (" instead of `%D' from dependent base class",
5478 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5479 constructor_name (current_class_type
), name
);
5483 /* Look up NAME in the current binding level and its superiors in the
5484 namespace of variables, functions and typedefs. Return a ..._DECL
5485 node of some kind representing its definition if there is only one
5486 such declaration, or return a TREE_LIST with all the overloaded
5487 definitions if there are many, or return 0 if it is undefined.
5489 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5490 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5491 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5492 Otherwise we prefer non-TYPE_DECLs.
5494 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5495 using IDENTIFIER_CLASS_VALUE. */
5498 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5500 int prefer_type
, nonclass
, namespaces_only
;
5503 tree val
= NULL_TREE
;
5505 tree from_obj
= NULL_TREE
;
5507 int val_is_implicit_typename
= 0;
5509 /* Hack: copy flag set by parser, if set. */
5510 if (only_namespace_names
)
5511 namespaces_only
= 1;
5513 if (prefer_type
== -2)
5515 extern int looking_for_typename
;
5516 tree type
= NULL_TREE
;
5519 prefer_type
= looking_for_typename
;
5521 flags
= lookup_flags (prefer_type
, namespaces_only
);
5522 /* If the next thing is '<', class templates are types. */
5523 if (looking_for_template
)
5524 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5526 /* std:: becomes :: for now. */
5527 if (got_scope
== std_node
)
5528 got_scope
= void_type_node
;
5532 else if (got_object
!= error_mark_node
)
5537 if (type
== error_mark_node
)
5538 return error_mark_node
;
5539 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5540 type
= TREE_TYPE (type
);
5543 type
= complete_type (type
);
5545 if (TREE_CODE (type
) == VOID_TYPE
)
5546 type
= global_namespace
;
5547 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5549 val
= make_node (CPLUS_BINDING
);
5550 flags
|= LOOKUP_COMPLAIN
;
5551 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5553 val
= select_decl (val
, flags
);
5555 else if (! IS_AGGR_TYPE (type
)
5556 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5557 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5558 || TREE_CODE (type
) == TYPENAME_TYPE
)
5559 /* Someone else will give an error about this if needed. */
5561 else if (type
== current_class_type
)
5562 val
= IDENTIFIER_CLASS_VALUE (name
);
5564 val
= lookup_member (type
, name
, 0, prefer_type
);
5571 else if (got_object
&& val
)
5576 flags
= lookup_flags (prefer_type
, namespaces_only
);
5577 /* If we're not parsing, we need to complain. */
5578 flags
|= LOOKUP_COMPLAIN
;
5581 /* First, look in non-namespace scopes. */
5583 if (current_class_type
== NULL_TREE
)
5586 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5590 if (!LOCAL_BINDING_P (t
) && nonclass
)
5591 /* We're not looking for class-scoped bindings, so keep going. */
5594 /* If this is the kind of thing we're looking for, we're done. */
5595 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5596 binding
= BINDING_VALUE (t
);
5597 else if ((flags
& LOOKUP_PREFER_TYPES
)
5598 && qualify_lookup (BINDING_TYPE (t
), flags
))
5599 binding
= BINDING_TYPE (t
);
5601 binding
= NULL_TREE
;
5604 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5606 if (val_is_implicit_typename
&& !yylex
)
5607 warn_about_implicit_typename_lookup (val
, binding
);
5609 val_is_implicit_typename
5610 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5611 if (!val_is_implicit_typename
)
5616 /* Now lookup in namespace scopes. */
5617 if (!val
|| val_is_implicit_typename
)
5619 t
= unqualified_namespace_lookup (name
, flags
, 0);
5622 if (val_is_implicit_typename
&& !yylex
)
5623 warn_about_implicit_typename_lookup (val
, t
);
5631 /* This should only warn about types used in qualified-ids. */
5632 if (from_obj
&& from_obj
!= val
)
5634 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5635 && TREE_CODE (val
) == TYPE_DECL
5636 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5638 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5639 name
, got_object
, TREE_TYPE (from_obj
));
5640 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5644 /* We don't change val to from_obj if got_object depends on
5645 template parms because that breaks implicit typename for
5646 destructor calls. */
5647 if (! uses_template_parms (got_object
))
5651 /* If we have a single function from a using decl, pull it out. */
5652 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5653 val
= OVL_FUNCTION (val
);
5662 lookup_name_nonclass (name
)
5665 return lookup_name_real (name
, 0, 1, 0);
5669 lookup_function_nonclass (name
, args
)
5673 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5677 lookup_name_namespace_only (name
)
5680 /* type-or-namespace, nonclass, namespace_only */
5681 return lookup_name_real (name
, 1, 1, 1);
5685 lookup_name (name
, prefer_type
)
5689 return lookup_name_real (name
, prefer_type
, 0, 0);
5692 /* Similar to `lookup_name' but look only in the innermost non-class
5696 lookup_name_current_level (name
)
5699 struct binding_level
*b
;
5702 b
= current_binding_level
;
5703 while (b
->parm_flag
== 2)
5708 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5710 /* extern "C" function() */
5711 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5714 else if (IDENTIFIER_BINDING (name
)
5715 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5719 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5720 return IDENTIFIER_VALUE (name
);
5732 /* Like lookup_name_current_level, but for types. */
5735 lookup_type_current_level (name
)
5738 register tree t
= NULL_TREE
;
5740 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5742 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5743 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5745 struct binding_level
*b
= current_binding_level
;
5748 if (purpose_member (name
, b
->type_shadowed
))
5749 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5761 begin_only_namespace_names ()
5763 only_namespace_names
= 1;
5767 end_only_namespace_names ()
5769 only_namespace_names
= 0;
5772 /* Arrange for the user to get a source line number, even when the
5773 compiler is going down in flames, so that she at least has a
5774 chance of working around problems in the compiler. We used to
5775 call error(), but that let the segmentation fault continue
5776 through; now, it's much more passive by asking them to send the
5777 maintainers mail about the problem. */
5781 int sig ATTRIBUTE_UNUSED
;
5783 signal (SIGSEGV
, SIG_DFL
);
5785 signal (SIGIOT
, SIG_DFL
);
5788 signal (SIGILL
, SIG_DFL
);
5791 signal (SIGABRT
, SIG_DFL
);
5794 signal (SIGBUS
, SIG_DFL
);
5796 my_friendly_abort (0);
5799 /* Push the declarations of builtin types into the namespace.
5800 RID_INDEX, if < RID_MAX is the index of the builtin type
5801 in the array RID_POINTERS. NAME is the name used when looking
5802 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5805 record_builtin_type (rid_index
, name
, type
)
5810 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5811 tree tdecl
= NULL_TREE
;
5813 if ((int) rid_index
< (int) RID_MAX
)
5814 rname
= ridpointers
[(int) rid_index
];
5816 tname
= get_identifier (name
);
5818 TYPE_BUILT_IN (type
) = 1;
5822 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5823 set_identifier_type_value (tname
, NULL_TREE
);
5824 if ((int) rid_index
< (int) RID_MAX
)
5825 /* Built-in types live in the global namespace. */
5826 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5828 if (rname
!= NULL_TREE
)
5830 if (tname
!= NULL_TREE
)
5832 set_identifier_type_value (rname
, NULL_TREE
);
5833 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5837 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5838 set_identifier_type_value (rname
, NULL_TREE
);
5843 /* Record one of the standard Java types.
5844 * Declare it as having the given NAME.
5845 * If SIZE > 0, it is the size of one of the integral types;
5846 * otherwise it is the negative of the size of one of the other types. */
5849 record_builtin_java_type (name
, size
)
5855 type
= make_signed_type (size
);
5856 else if (size
> -32)
5857 { /* "__java_char" or ""__java_boolean". */
5858 type
= make_unsigned_type (-size
);
5859 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5862 { /* "__java_float" or ""__java_double". */
5863 type
= make_node (REAL_TYPE
);
5864 TYPE_PRECISION (type
) = - size
;
5867 record_builtin_type (RID_MAX
, name
, type
);
5868 decl
= TYPE_NAME (type
);
5870 /* Suppress generate debug symbol entries for these types,
5871 since for normal C++ they are just clutter.
5872 However, push_lang_context undoes this if extern "Java" is seen. */
5873 DECL_IGNORED_P (decl
) = 1;
5875 TYPE_FOR_JAVA (type
) = 1;
5879 /* Push a type into the namespace so that the back-ends ignore it. */
5882 record_unknown_type (type
, name
)
5886 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5887 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5888 DECL_IGNORED_P (decl
) = 1;
5889 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5890 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5891 TYPE_ALIGN (type
) = 1;
5892 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5895 /* Push overloaded decl, in global scope, with one argument so it
5896 can be used as a callback from define_function. */
5899 push_overloaded_decl_1 (x
)
5906 auto_function (name
, type
)
5909 return define_function
5910 (IDENTIFIER_POINTER (name
), type
, push_overloaded_decl_1
,
5911 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5915 /* Create the predefined scalar types of C,
5916 and some nodes representing standard constants (0, 1, (void *)0).
5917 Initialize the global binding level.
5918 Make definitions for built-in primitive functions. */
5921 init_decl_processing ()
5924 int wchar_type_size
;
5925 tree array_domain_type
;
5927 /* Have to make these distinct before we try using them. */
5928 lang_name_cplusplus
= get_identifier ("C++");
5929 lang_name_c
= get_identifier ("C");
5930 lang_name_java
= get_identifier ("Java");
5932 /* Let the back-end now how to save and restore language-specific
5933 per-function globals. */
5934 init_lang_status
= &push_cp_function_context
;
5935 free_lang_status
= &pop_cp_function_context
;
5936 mark_lang_status
= &mark_cp_function_context
;
5942 /* Create the global variables. */
5943 push_to_top_level ();
5945 /* Enter the global namespace. */
5946 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5947 push_namespace (get_identifier ("::"));
5948 global_namespace
= current_namespace
;
5949 current_lang_name
= NULL_TREE
;
5951 if (flag_strict_prototype
== 2)
5952 flag_strict_prototype
= pedantic
;
5953 if (! flag_permissive
&& ! pedantic
)
5954 flag_pedantic_errors
= 1;
5956 strict_prototypes_lang_c
= flag_strict_prototype
;
5959 current_lang_name
= lang_name_c
;
5961 current_function_decl
= NULL_TREE
;
5962 current_binding_level
= NULL_BINDING_LEVEL
;
5963 free_binding_level
= NULL_BINDING_LEVEL
;
5965 /* Because most segmentation signals can be traced back into user
5966 code, catch them and at least give the user a chance of working
5967 around compiler bugs. */
5968 signal (SIGSEGV
, signal_catch
);
5970 /* We will also catch aborts in the back-end through signal_catch and
5971 give the user a chance to see where the error might be, and to defeat
5972 aborts in the back-end when there have been errors previously in their
5975 signal (SIGIOT
, signal_catch
);
5978 signal (SIGILL
, signal_catch
);
5981 signal (SIGABRT
, signal_catch
);
5984 signal (SIGBUS
, signal_catch
);
5987 build_common_tree_nodes (flag_signed_char
);
5989 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
5990 TREE_TYPE (error_mark_list
) = error_mark_node
;
5992 /* Make the binding_level structure for global names. */
5994 global_binding_level
= current_binding_level
;
5995 /* The global level is the namespace level of ::. */
5996 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
5997 declare_namespace_level ();
5999 this_identifier
= get_identifier (THIS_NAME
);
6000 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6001 ctor_identifier
= get_identifier (CTOR_NAME
);
6002 dtor_identifier
= get_identifier (DTOR_NAME
);
6003 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6004 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6005 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6006 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6007 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6009 /* Define `int' and `char' first so that dbx will output them first. */
6010 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6011 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6013 /* `signed' is the same as `int' */
6014 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6015 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6016 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6017 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6018 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6019 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6020 record_builtin_type (RID_MAX
, "long long unsigned int",
6021 long_long_unsigned_type_node
);
6022 record_builtin_type (RID_MAX
, "long long unsigned",
6023 long_long_unsigned_type_node
);
6024 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6025 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6026 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6029 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6031 /* Define both `signed char' and `unsigned char'. */
6032 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6033 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6035 /* `unsigned long' is the standard type for sizeof.
6036 Note that stddef.h uses `unsigned long',
6037 and this must agree, even if long and int are the same size. */
6039 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6041 /* Create the widest literal types. */
6042 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6043 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6044 widest_integer_literal_type_node
));
6046 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6047 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6048 widest_unsigned_literal_type_node
));
6050 /* These are types that type_for_size and type_for_mode use. */
6051 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6052 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6053 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6054 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6055 #if HOST_BITS_PER_WIDE_INT >= 64
6056 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6058 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6059 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6060 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6061 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6062 #if HOST_BITS_PER_WIDE_INT >= 64
6063 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6066 build_common_tree_nodes_2 (flag_short_double
);
6068 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6069 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6070 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6071 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6072 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6073 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6074 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6075 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6077 integer_two_node
= build_int_2 (2, 0);
6078 TREE_TYPE (integer_two_node
) = integer_type_node
;
6079 integer_three_node
= build_int_2 (3, 0);
6080 TREE_TYPE (integer_three_node
) = integer_type_node
;
6082 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6083 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6084 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6085 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6086 TYPE_PRECISION (boolean_type_node
) = 1;
6087 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6088 boolean_false_node
= build_int_2 (0, 0);
6089 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6090 boolean_true_node
= build_int_2 (1, 0);
6091 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6093 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6094 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6095 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6097 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6098 complex_integer_type_node
));
6099 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6100 complex_float_type_node
));
6101 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6102 complex_double_type_node
));
6103 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6104 complex_long_double_type_node
));
6106 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6108 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6109 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6110 TREE_PARMLIST (void_list_node
) = 1;
6112 /* Used for expressions that do nothing, but are not errors. */
6113 void_zero_node
= build_int_2 (0, 0);
6114 TREE_TYPE (void_zero_node
) = void_type_node
;
6116 string_type_node
= build_pointer_type (char_type_node
);
6117 const_string_type_node
6118 = build_pointer_type (build_qualified_type (char_type_node
,
6120 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6122 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6125 /* Make a type to be the domain of a few array types
6126 whose domains don't really matter.
6127 200 is small enough that it always fits in size_t
6128 and large enough that it can hold most function names for the
6129 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6130 array_domain_type
= build_index_type (build_int_2 (200, 0));
6132 /* Make a type for arrays of characters.
6133 With luck nothing will ever really depend on the length of this
6135 char_array_type_node
6136 = build_array_type (char_type_node
, array_domain_type
);
6137 /* Likewise for arrays of ints. */
6139 = build_array_type (integer_type_node
, array_domain_type
);
6141 /* This is just some anonymous class type. Nobody should ever
6142 need to look inside this envelope. */
6143 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6145 if (flag_huge_objects
)
6146 delta_type_node
= long_integer_type_node
;
6148 delta_type_node
= short_integer_type_node
;
6150 default_function_type
6151 = build_function_type (integer_type_node
, NULL_TREE
);
6153 ptr_type_node
= build_pointer_type (void_type_node
);
6155 = build_pointer_type (build_qualified_type (void_type_node
,
6157 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6158 lang_type_promotes_to
= convert_type_from_ellipsis
;
6161 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6163 /* C++ extensions */
6165 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6166 record_unknown_type (unknown_type_node
, "unknown type");
6168 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6169 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6171 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6173 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6175 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6176 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6178 /* This is special for C++ so functions can be overloaded. */
6179 wchar_type_node
= get_identifier (flag_short_wchar
6180 ? "short unsigned int"
6182 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6183 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6184 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6185 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6187 = TREE_UNSIGNED (wchar_type_node
)
6188 ? unsigned_wchar_type_node
6189 : signed_wchar_type_node
;
6190 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6192 /* Artificial declaration of wchar_t -- can be bashed */
6193 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6195 pushdecl (wchar_decl_node
);
6197 /* This is for wide string constants. */
6198 wchar_array_type_node
6199 = build_array_type (wchar_type_node
, array_domain_type
);
6201 if (flag_vtable_thunks
)
6203 /* Make sure we get a unique function type, so we can give
6204 its pointer type a name. (This wins for gdb.) */
6205 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6206 TREE_TYPE (vfunc_type
) = integer_type_node
;
6207 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6208 layout_type (vfunc_type
);
6210 vtable_entry_type
= build_pointer_type (vfunc_type
);
6214 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6215 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6217 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6219 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6221 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6224 /* Make this part of an invisible union. */
6225 fields
[3] = copy_node (fields
[2]);
6226 TREE_TYPE (fields
[3]) = delta_type_node
;
6227 DECL_NAME (fields
[3]) = delta2_identifier
;
6228 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6229 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6230 TREE_UNSIGNED (fields
[3]) = 0;
6231 TREE_CHAIN (fields
[2]) = fields
[3];
6232 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6235 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6238 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6239 layout_type (vtbl_type_node
);
6240 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6241 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6242 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6243 layout_type (vtbl_ptr_type_node
);
6244 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6246 std_node
= build_decl (NAMESPACE_DECL
,
6247 get_identifier (flag_honor_std
? "fake std":"std"),
6249 pushdecl (std_node
);
6251 global_type_node
= make_node (LANG_TYPE
);
6252 record_unknown_type (global_type_node
, "global type");
6255 current_lang_name
= lang_name_cplusplus
;
6258 tree bad_alloc_type_node
, newtype
, deltype
;
6260 push_namespace (get_identifier ("std"));
6261 bad_alloc_type_node
= xref_tag
6262 (class_type_node
, get_identifier ("bad_alloc"), 1);
6265 newtype
= build_exception_variant
6266 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6267 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6268 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
);
6269 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6270 global_delete_fndecl
= auto_function (ansi_opname
[(int) DELETE_EXPR
],
6272 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6276 = define_function ("__pure_virtual", void_ftype
, 0, 0);
6278 /* Perform other language dependent initializations. */
6279 init_class_processing ();
6280 init_init_processing ();
6281 init_search_processing ();
6282 init_rtti_processing ();
6284 if (flag_exceptions
)
6285 init_exception_processing ();
6288 flag_inline_functions
= 0;
6291 if (! supports_one_only ())
6294 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6295 declare_function_name ();
6297 /* Prepare to check format strings against argument lists. */
6298 init_function_format_info ();
6300 /* Show we use EH for cleanups. */
6301 using_eh_for_cleanups ();
6303 print_error_function
= lang_print_error_function
;
6304 lang_get_alias_set
= &c_get_alias_set
;
6305 valid_lang_attribute
= cp_valid_lang_attribute
;
6307 /* Maintain consistency. Perhaps we should just complain if they
6308 say -fwritable-strings? */
6309 if (flag_writable_strings
)
6310 flag_const_strings
= 0;
6312 /* Add GC roots for all of our global variables. */
6313 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6314 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6315 ggc_add_tree_root (&integer_three_node
, 1);
6316 ggc_add_tree_root (&integer_two_node
, 1);
6317 ggc_add_tree_root (&signed_size_zero_node
, 1);
6318 ggc_add_tree_root (&size_one_node
, 1);
6319 ggc_add_tree_root (&size_zero_node
, 1);
6320 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6321 mark_binding_level
);
6322 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6323 ggc_add_tree_root (&static_ctors
, 1);
6324 ggc_add_tree_root (&static_dtors
, 1);
6325 ggc_add_tree_root (&lastiddecl
, 1);
6327 ggc_add_tree_root (&last_function_parm_tags
, 1);
6328 ggc_add_tree_root (¤t_function_return_value
, 1);
6329 ggc_add_tree_root (¤t_function_parms
, 1);
6330 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6331 ggc_add_tree_root (&last_function_parms
, 1);
6332 ggc_add_tree_root (&error_mark_list
, 1);
6334 ggc_add_tree_root (&global_namespace
, 1);
6335 ggc_add_tree_root (&global_type_node
, 1);
6336 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6338 ggc_add_tree_root (&got_object
, 1);
6339 ggc_add_tree_root (&got_scope
, 1);
6341 ggc_add_tree_root (¤t_lang_name
, 1);
6342 ggc_add_tree_root (&static_aggregates
, 1);
6345 /* Function to print any language-specific context for an error message. */
6348 lang_print_error_function (file
)
6351 default_print_error_function (file
);
6352 maybe_print_template_context ();
6355 /* Make a definition for a builtin function named NAME and whose data type
6356 is TYPE. TYPE should be a function type with argument types.
6358 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6359 the name to be called if we can't opencode the function. */
6362 define_function (name
, type
, pfn
, library_name
)
6365 void (*pfn
) PROTO((tree
));
6366 const char *library_name
;
6368 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6369 DECL_EXTERNAL (decl
) = 1;
6370 TREE_PUBLIC (decl
) = 1;
6371 DECL_ARTIFICIAL (decl
) = 1;
6373 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6374 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6376 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6377 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6378 function in the namespace. */
6379 if (pfn
) (*pfn
) (decl
);
6381 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6382 make_function_rtl (decl
);
6387 /* Wrapper around define_function, for the benefit of
6388 c_common_nodes_and_builtins.
6389 FUNCTION_CODE tells later passes how to compile calls to this function.
6390 See tree.h for its possible values. */
6393 builtin_function (name
, type
, code
, class, libname
)
6397 enum built_in_class
class;
6398 const char *libname
;
6400 tree decl
= define_function (name
, type
, (void (*) PROTO((tree
)))pushdecl
,
6402 DECL_BUILT_IN_CLASS (decl
) = class;
6403 DECL_FUNCTION_CODE (decl
) = code
;
6407 /* When we call finish_struct for an anonymous union, we create
6408 default copy constructors and such. But, an anonymous union
6409 shouldn't have such things; this function undoes the damage to the
6410 anonymous union type T.
6412 (The reason that we create the synthesized methods is that we don't
6413 distinguish `union { int i; }' from `typedef union { int i; } U'.
6414 The first is an anonymous union; the second is just an ordinary
6418 fixup_anonymous_aggr (t
)
6423 /* Wipe out memory of synthesized methods */
6424 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6425 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6426 TYPE_HAS_INIT_REF (t
) = 0;
6427 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6428 TYPE_HAS_ASSIGN_REF (t
) = 0;
6429 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6431 /* Splice the implicitly generated functions out of the TYPE_METHODS
6433 q
= &TYPE_METHODS (t
);
6436 if (DECL_ARTIFICIAL (*q
))
6437 *q
= TREE_CHAIN (*q
);
6439 q
= &TREE_CHAIN (*q
);
6442 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6443 function members. */
6444 if (TYPE_METHODS (t
))
6445 error ("an anonymous union cannot have function members");
6448 /* Make sure that a declaration with no declarator is well-formed, i.e.
6449 just defines a tagged type or anonymous union.
6451 Returns the type defined, if any. */
6454 check_tag_decl (declspecs
)
6458 tree ob_modifier
= NULL_TREE
;
6460 register tree t
= NULL_TREE
;
6462 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6464 register tree value
= TREE_VALUE (link
);
6470 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6472 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6476 else if (value
== ridpointers
[(int) RID_FRIEND
])
6478 if (current_class_type
== NULL_TREE
6479 || current_scope () != current_class_type
)
6480 ob_modifier
= value
;
6482 else if (value
== ridpointers
[(int) RID_STATIC
]
6483 || value
== ridpointers
[(int) RID_EXTERN
]
6484 || value
== ridpointers
[(int) RID_AUTO
]
6485 || value
== ridpointers
[(int) RID_REGISTER
]
6486 || value
== ridpointers
[(int) RID_INLINE
]
6487 || value
== ridpointers
[(int) RID_VIRTUAL
]
6488 || value
== ridpointers
[(int) RID_CONST
]
6489 || value
== ridpointers
[(int) RID_VOLATILE
]
6490 || value
== ridpointers
[(int) RID_EXPLICIT
])
6491 ob_modifier
= value
;
6495 error ("multiple types in one declaration");
6497 /* Inside a class, we might be in a friend or access declaration.
6498 Until we have a good way of detecting the latter, don't warn. */
6499 if (t
== NULL_TREE
&& ! current_class_type
)
6500 pedwarn ("declaration does not declare anything");
6502 /* Check for an anonymous union. We're careful
6503 accessing TYPE_IDENTIFIER because some built-in types, like
6504 pointer-to-member types, do not have TYPE_NAME. */
6505 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6507 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6509 /* Anonymous unions are objects, so they can have specifiers. */;
6510 SET_ANON_AGGR_TYPE_P (t
);
6512 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6513 pedwarn ("ISO C++ prohibits anonymous structs");
6516 else if (ob_modifier
)
6518 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6519 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6520 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6521 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6522 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6523 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6524 cp_error ("`%D' can only be specified for constructors",
6527 cp_error ("`%D' can only be specified for objects and functions",
6534 /* Called when a declaration is seen that contains no names to declare.
6535 If its type is a reference to a structure, union or enum inherited
6536 from a containing scope, shadow that tag name for the current scope
6537 with a forward reference.
6538 If its type defines a new named structure or union
6539 or defines an enum, it is valid but we need not do anything here.
6540 Otherwise, it is an error.
6542 C++: may have to grok the declspecs to learn about static,
6543 complain for anonymous unions. */
6546 shadow_tag (declspecs
)
6549 tree t
= check_tag_decl (declspecs
);
6552 maybe_process_partial_specialization (t
);
6554 /* This is where the variables in an anonymous union are
6555 declared. An anonymous union declaration looks like:
6557 because there is no declarator after the union, the parser
6558 sends that declaration here. */
6559 if (t
&& ANON_AGGR_TYPE_P (t
))
6561 fixup_anonymous_aggr (t
);
6563 if (TYPE_FIELDS (t
))
6565 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6567 finish_anon_union (decl
);
6572 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6575 groktypename (typename
)
6578 if (TREE_CODE (typename
) != TREE_LIST
)
6580 return grokdeclarator (TREE_VALUE (typename
),
6581 TREE_PURPOSE (typename
),
6582 TYPENAME
, 0, NULL_TREE
);
6585 /* Decode a declarator in an ordinary declaration or data definition.
6586 This is called as soon as the type information and variable name
6587 have been parsed, before parsing the initializer if any.
6588 Here we create the ..._DECL node, fill in its type,
6589 and put it on the list of decls for the current context.
6590 The ..._DECL node is returned as the value.
6592 Exception: for arrays where the length is not specified,
6593 the type is left null, to be filled in by `cp_finish_decl'.
6595 Function definitions do not come here; they go to start_function
6596 instead. However, external and forward declarations of functions
6597 do go through here. Structure field declarations are done by
6598 grokfield and not through here. */
6600 /* Set this to zero to debug not using the temporary obstack
6601 to parse initializers. */
6602 int debug_temp_inits
= 1;
6605 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6606 tree declarator
, declspecs
;
6608 tree attributes
, prefix_attributes
;
6611 register tree type
, tem
;
6613 extern int have_extern_spec
;
6614 extern int used_extern_spec
;
6618 /* See code below that used this. */
6619 int init_written
= initialized
;
6622 /* This should only be done once on the top most decl. */
6623 if (have_extern_spec
&& !used_extern_spec
)
6625 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6627 used_extern_spec
= 1;
6630 if (attributes
|| prefix_attributes
)
6631 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6633 attrlist
= NULL_TREE
;
6635 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6638 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6641 type
= TREE_TYPE (decl
);
6643 if (type
== error_mark_node
)
6647 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6648 ? DECL_CLASS_CONTEXT (decl
)
6649 : DECL_CONTEXT (decl
);
6651 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6652 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6654 /* When parsing the initializer, lookup should use the object's
6656 push_decl_namespace (context
);
6659 /* We are only interested in class contexts, later. */
6660 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6661 context
= NULL_TREE
;
6664 /* Is it valid for this decl to have an initializer at all?
6665 If not, set INITIALIZED to zero, which will indirectly
6666 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6667 switch (TREE_CODE (decl
))
6670 /* typedef foo = bar means give foo the same type as bar.
6671 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6672 Any other case of an initialization in a TYPE_DECL is an error. */
6673 if (pedantic
|| list_length (declspecs
) > 1)
6675 cp_error ("typedef `%D' is initialized", decl
);
6681 cp_error ("function `%#D' is initialized like a variable", decl
);
6691 if (! toplevel_bindings_p ()
6692 && DECL_EXTERNAL (decl
))
6693 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6695 DECL_EXTERNAL (decl
) = 0;
6696 if (toplevel_bindings_p ())
6697 TREE_STATIC (decl
) = 1;
6699 /* Tell `pushdecl' this is an initialized decl
6700 even though we don't yet have the initializer expression.
6701 Also tell `cp_finish_decl' it may store the real initializer. */
6702 DECL_INITIAL (decl
) = error_mark_node
;
6705 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6706 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6709 /* Set attributes here so if duplicate decl, will have proper attributes. */
6710 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6712 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6714 push_nested_class (context
, 2);
6716 if (TREE_CODE (decl
) == VAR_DECL
)
6718 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6719 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6720 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6723 if (DECL_CONTEXT (field
) != context
)
6725 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6726 DECL_CONTEXT (field
), DECL_NAME (decl
),
6727 context
, DECL_NAME (decl
));
6728 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6730 /* Static data member are tricky; an in-class initialization
6731 still doesn't provide a definition, so the in-class
6732 declaration will have DECL_EXTERNAL set, but will have an
6733 initialization. Thus, duplicate_decls won't warn
6734 about this situation, and so we check here. */
6735 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6736 cp_error ("duplicate initialization of %D", decl
);
6737 if (duplicate_decls (decl
, field
))
6743 tree field
= check_classfn (context
, decl
);
6744 if (field
&& duplicate_decls (decl
, field
))
6748 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6749 DECL_IN_AGGR_P (decl
) = 0;
6750 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6751 || CLASSTYPE_USE_TEMPLATE (context
))
6753 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6754 /* [temp.expl.spec] An explicit specialization of a static data
6755 member of a template is a definition if the declaration
6756 includes an initializer; otherwise, it is a declaration.
6758 We check for processing_specialization so this only applies
6759 to the new specialization syntax. */
6760 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6761 DECL_EXTERNAL (decl
) = 1;
6764 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6765 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6769 /* Enter this declaration into the symbol table. */
6770 tem
= maybe_push_decl (decl
);
6772 if (processing_template_decl
)
6773 tem
= push_template_decl (tem
);
6775 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6776 /* Tell the back-end to use or not use .common as appropriate. If we say
6777 -fconserve-space, we want this to save .data space, at the expense of
6778 wrong semantics. If we say -fno-conserve-space, we want this to
6779 produce errors about redefs; to do this we force variables into the
6781 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6784 if (! processing_template_decl
)
6794 tree type
= TREE_TYPE (decl
);
6795 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6797 if (type
== error_mark_node
)
6800 /* If this type of object needs a cleanup, but we're not allowed to
6801 add any more objects with cleanups to the current scope, create a
6802 new binding level. */
6803 if (TYPE_NEEDS_DESTRUCTOR (type
)
6804 && current_binding_level
->more_cleanups_ok
== 0)
6806 keep_next_level (2);
6809 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
6813 /* Is it valid for this decl to have an initializer at all?
6814 If not, set INITIALIZED to zero, which will indirectly
6815 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6817 /* Don't allow initializations for incomplete types except for
6818 arrays which might be completed by the initialization. */
6819 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6820 ; /* A complete type is ok. */
6821 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6823 cp_error ("variable `%#D' has initializer but incomplete type",
6826 type
= TREE_TYPE (decl
) = error_mark_node
;
6828 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6830 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6831 cp_error ("elements of array `%#D' have incomplete type", decl
);
6832 /* else we already gave an error in start_decl. */
6838 && TREE_CODE (decl
) != TYPE_DECL
6839 && TREE_CODE (decl
) != TEMPLATE_DECL
6840 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6842 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6843 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6845 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6847 /* Change the type so that assemble_variable will give
6848 DECL an rtl we can live with: (mem (const_int 0)). */
6849 type
= TREE_TYPE (decl
) = error_mark_node
;
6853 /* If any base type in the hierarchy of TYPE needs a constructor,
6854 then we set initialized to 1. This way any nodes which are
6855 created for the purposes of initializing this aggregate
6856 will live as long as it does. This is necessary for global
6857 aggregates which do not have their initializers processed until
6858 the end of the file. */
6859 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6864 DECL_INITIAL (decl
) = NULL_TREE
;
6867 /* Handle initialization of references.
6868 These three arguments are from `cp_finish_decl', and have the
6869 same meaning here that they do there.
6871 Quotes on semantics can be found in ARM 8.4.3. */
6874 grok_reference_init (decl
, type
, init
)
6875 tree decl
, type
, init
;
6879 if (init
== NULL_TREE
)
6881 if ((DECL_LANG_SPECIFIC (decl
) == 0
6882 || DECL_IN_AGGR_P (decl
) == 0)
6883 && ! DECL_THIS_EXTERN (decl
))
6884 cp_error ("`%D' declared as reference but not initialized", decl
);
6888 if (init
== error_mark_node
)
6891 if (TREE_CODE (init
) == CONSTRUCTOR
)
6893 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6897 if (TREE_CODE (init
) == TREE_LIST
)
6898 init
= build_compound_expr (init
);
6900 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6901 init
= convert_from_reference (init
);
6903 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6904 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6906 /* Note: default conversion is only called in very special cases. */
6907 init
= default_conversion (init
);
6910 /* Convert INIT to the reference type TYPE. This may involve the
6911 creation of a temporary, whose lifetime must be the same as that
6912 of the reference. If so, a DECL_STMT for the temporary will be
6913 added just after the DECL_STMT for DECL. That's why we don't set
6914 DECL_INITIAL for local references (instead assigning to them
6915 explicitly); we need to allow the temporary to be initialized
6917 tmp
= convert_to_reference
6918 (type
, init
, CONV_IMPLICIT
,
6919 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6921 if (tmp
== error_mark_node
)
6923 else if (tmp
!= NULL_TREE
)
6926 tmp
= save_expr (tmp
);
6927 if (building_stmt_tree ())
6929 /* Initialize the declaration. */
6930 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
6931 finish_expr_stmt (tmp
);
6934 DECL_INITIAL (decl
) = tmp
;
6938 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
6942 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
6944 expand_static_init (decl
, DECL_INITIAL (decl
));
6945 DECL_INITIAL (decl
) = NULL_TREE
;
6950 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
6951 mucking with forces it does not comprehend (i.e. initialization with a
6952 constructor). If we are at global scope and won't go into COMMON, fill
6953 it in with a dummy CONSTRUCTOR to force the variable into .data;
6954 otherwise we can use error_mark_node. */
6957 obscure_complex_init (decl
, init
)
6960 if (! flag_no_inline
&& TREE_STATIC (decl
))
6962 if (extract_init (decl
, init
))
6966 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6967 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
6968 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
6972 DECL_INITIAL (decl
) = error_mark_node
;
6977 /* When parsing `int a[] = {1, 2};' we don't know the size of the
6978 array until we finish parsing the initializer. If that's the
6979 situation we're in, update DECL accordingly. */
6982 maybe_deduce_size_from_array_init (decl
, init
)
6986 tree type
= TREE_TYPE (decl
);
6988 if (TREE_CODE (type
) == ARRAY_TYPE
6989 && TYPE_DOMAIN (type
) == NULL_TREE
6990 && TREE_CODE (decl
) != TYPE_DECL
)
6993 = (TREE_STATIC (decl
)
6994 /* Even if pedantic, an external linkage array
6995 may have incomplete type at first. */
6996 ? pedantic
&& ! DECL_EXTERNAL (decl
)
6997 : !DECL_EXTERNAL (decl
));
6998 tree initializer
= init
? init
: DECL_INITIAL (decl
);
6999 int failure
= complete_array_type (type
, initializer
, do_default
);
7002 cp_error ("initializer fails to determine size of `%D'", decl
);
7007 cp_error ("array size missing in `%D'", decl
);
7008 /* If a `static' var's size isn't known, make it extern as
7009 well as static, so it does not get allocated. If it's not
7010 `static', then don't mark it extern; finish_incomplete_decl
7011 will give it a default size and it will get allocated. */
7012 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7013 DECL_EXTERNAL (decl
) = 1;
7016 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7017 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7019 cp_error ("zero-size array `%D'", decl
);
7021 layout_decl (decl
, 0);
7025 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7026 any appropriate error messages regarding the layout. */
7029 layout_var_decl (decl
)
7032 tree type
= TREE_TYPE (decl
);
7034 tree ttype
= target_type (type
);
7037 /* If we haven't already layed out this declaration, do so now.
7038 Note that we must not call complete type for an external object
7039 because it's type might involve templates that we are not
7040 supposed to isntantiate yet. (And it's perfectly legal to say
7041 `extern X x' for some incomplete type `X'.) */
7042 if (!DECL_EXTERNAL (decl
))
7043 complete_type (type
);
7044 if (!DECL_SIZE (decl
)&& TYPE_SIZE (type
))
7045 layout_decl (decl
, 0);
7047 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7049 /* An automatic variable with an incomplete type: that is an error.
7050 Don't talk about array types here, since we took care of that
7051 message in grokdeclarator. */
7052 cp_error ("storage size of `%D' isn't known", decl
);
7053 TREE_TYPE (decl
) = error_mark_node
;
7056 /* Keep this code around in case we later want to control debug info
7057 based on whether a type is "used". (jason 1999-11-11) */
7059 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7060 /* Let debugger know it should output info for this type. */
7061 note_debug_info_needed (ttype
);
7063 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7064 note_debug_info_needed (DECL_CONTEXT (decl
));
7067 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7068 && DECL_SIZE (decl
) != NULL_TREE
7069 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7071 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7072 constant_expression_warning (DECL_SIZE (decl
));
7074 cp_error ("storage size of `%D' isn't constant", decl
);
7078 /* If a local static variable is declared in an inline function, or if
7079 we have a weak definition, we must endeavor to create only one
7080 instance of the variable at link-time. */
7083 maybe_commonize_var (decl
)
7086 /* Static data in a function with comdat linkage also has comdat
7088 if (TREE_STATIC (decl
)
7089 /* Don't mess with __FUNCTION__. */
7090 && ! TREE_ASM_WRITTEN (decl
)
7091 && current_function_decl
7092 && DECL_CONTEXT (decl
) == current_function_decl
7093 && (DECL_THIS_INLINE (current_function_decl
)
7094 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7095 && TREE_PUBLIC (current_function_decl
))
7097 /* Rather than try to get this right with inlining, we suppress
7098 inlining of such functions. */
7099 current_function_cannot_inline
7100 = "function with static variable cannot be inline";
7102 /* If flag_weak, we don't need to mess with this, as we can just
7103 make the function weak, and let it refer to its unique local
7104 copy. This works because we don't allow the function to be
7108 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7110 TREE_PUBLIC (decl
) = 1;
7111 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7113 else if (DECL_INITIAL (decl
) == NULL_TREE
7114 || DECL_INITIAL (decl
) == error_mark_node
)
7116 TREE_PUBLIC (decl
) = 1;
7117 DECL_COMMON (decl
) = 1;
7119 /* else we lose. We can only do this if we can use common,
7120 which we can't if it has been initialized. */
7122 if (TREE_PUBLIC (decl
))
7123 DECL_ASSEMBLER_NAME (decl
)
7124 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7125 else if (! DECL_ARTIFICIAL (decl
))
7127 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7128 cp_warning_at (" you can work around this by removing the initializer", decl
);
7132 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7133 /* Set it up again; we might have set DECL_INITIAL since the last
7135 comdat_linkage (decl
);
7138 /* Issue an error message if DECL is an uninitialized const variable. */
7141 check_for_uninitialized_const_var (decl
)
7144 tree type
= TREE_TYPE (decl
);
7146 /* ``Unless explicitly declared extern, a const object does not have
7147 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7149 if (TREE_CODE (decl
) == VAR_DECL
7150 && TREE_CODE (type
) != REFERENCE_TYPE
7151 && CP_TYPE_CONST_P (type
)
7152 && !TYPE_NEEDS_CONSTRUCTING (type
)
7153 && !DECL_INITIAL (decl
))
7154 cp_error ("uninitialized const `%D'", decl
);
7157 /* Verify INIT (the initializer for DECL), and record the
7158 initialization in DECL_INITIAL, if appropriate. Returns a new
7162 check_initializer (decl
, init
)
7168 if (TREE_CODE (decl
) == FIELD_DECL
)
7171 type
= TREE_TYPE (decl
);
7173 /* If `start_decl' didn't like having an initialization, ignore it now. */
7174 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7177 /* Check the initializer. */
7180 /* Things that are going to be initialized need to have complete
7182 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7184 if (type
== error_mark_node
)
7185 /* We will have already complained. */
7187 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7189 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7192 else if (TREE_CODE (type
) == ARRAY_TYPE
7193 && !TYPE_SIZE (TREE_TYPE (type
)))
7195 cp_error ("elements of array `%#D' have incomplete type", decl
);
7198 else if (!TYPE_SIZE (type
))
7200 cp_error ("`%D' has incomplete type", decl
);
7201 TREE_TYPE (decl
) = error_mark_node
;
7206 if (TREE_CODE (decl
) == CONST_DECL
)
7208 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7210 DECL_INITIAL (decl
) = init
;
7212 /* This will keep us from needing to worry about our obstacks. */
7213 my_friendly_assert (init
!= NULL_TREE
, 149);
7216 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7218 if (TREE_STATIC (decl
))
7219 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7220 grok_reference_init (decl
, type
, init
);
7225 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7227 if (TREE_CODE (type
) == ARRAY_TYPE
)
7228 init
= digest_init (type
, init
, (tree
*) 0);
7229 else if (TREE_CODE (init
) == CONSTRUCTOR
7230 && TREE_HAS_CONSTRUCTOR (init
))
7232 if (TYPE_NON_AGGREGATE_CLASS (type
))
7234 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7236 init
= error_mark_node
;
7239 goto dont_use_constructor
;
7244 dont_use_constructor
:
7245 if (TREE_CODE (init
) != TREE_VEC
)
7246 init
= store_init_value (decl
, init
);
7250 /* We must hide the initializer so that expand_decl
7251 won't try to do something it does not understand. */
7252 init
= obscure_complex_init (decl
, init
);
7254 else if (DECL_EXTERNAL (decl
))
7256 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7257 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7259 tree core_type
= strip_array_types (type
);
7261 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7263 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7264 cp_error ("structure `%D' with uninitialized const members", decl
);
7265 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7266 cp_error ("structure `%D' with uninitialized reference members",
7270 check_for_uninitialized_const_var (decl
);
7272 if (TYPE_SIZE (type
) != NULL_TREE
7273 && TYPE_NEEDS_CONSTRUCTING (type
))
7274 init
= obscure_complex_init (decl
, NULL_TREE
);
7278 check_for_uninitialized_const_var (decl
);
7283 /* If DECL is not a local variable, give it RTL. */
7286 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7289 const char *asmspec
;
7294 type
= TREE_TYPE (decl
);
7295 toplev
= toplevel_bindings_p ();
7297 /* Handle non-variables up front. */
7298 if (TREE_CODE (decl
) != VAR_DECL
)
7300 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7304 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7306 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7308 if (DECL_VIRTUAL_P (decl
))
7309 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7310 else if (TREE_READONLY (decl
)
7311 && DECL_INITIAL (decl
) != NULL_TREE
7312 && DECL_INITIAL (decl
) != error_mark_node
7313 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7315 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7317 if (toplev
&& ! TREE_PUBLIC (decl
))
7319 /* If this is a static const, change its apparent linkage
7320 if it belongs to a #pragma interface. */
7321 if (!interface_unknown
)
7323 TREE_PUBLIC (decl
) = 1;
7324 DECL_EXTERNAL (decl
) = interface_only
;
7326 make_decl_rtl (decl
, asmspec
, toplev
);
7329 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7331 else if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7333 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7335 if (init
== NULL_TREE
7336 #ifdef DEFAULT_STATIC_DEFS
7337 /* If this code is dead, then users must
7338 explicitly declare static member variables
7339 outside the class def'n as well. */
7340 && TYPE_NEEDS_CONSTRUCTING (type
)
7344 DECL_EXTERNAL (decl
) = 1;
7345 make_decl_rtl (decl
, asmspec
, 1);
7348 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7350 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7351 || (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
)))
7352 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7355 /* Create RTL for the local static variable DECL. */
7358 make_rtl_for_local_static (decl
)
7361 tree type
= TREE_TYPE (decl
);
7362 const char *asmspec
= NULL
;
7364 /* If we inlined this variable, we could see it's declaration
7366 if (DECL_RTL (decl
))
7369 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7371 /* The only way this situaton can occur is if the
7372 user specified a name for this DECL using the
7373 `attribute' syntax. */
7374 asmspec
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
7375 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
7378 rest_of_decl_compilation (decl
, asmspec
, /*top_level=*/0, /*at_end=*/0);
7381 /* The old ARM scoping rules injected variables declared in the
7382 initialization statement of a for-statement into the surrounding
7383 scope. We support this usage, in order to be backward-compatible.
7384 DECL is a just-declared VAR_DECL; if necessary inject its
7385 declaration into the surrounding scope. */
7388 maybe_inject_for_scope_var (decl
)
7391 if (current_binding_level
->is_for_scope
)
7393 struct binding_level
*outer
7394 = current_binding_level
->level_chain
;
7396 /* Check to see if the same name is already bound at the outer
7397 level, either because it was directly declared, or because a
7398 dead for-decl got preserved. In either case, the code would
7399 not have been valid under the ARM scope rules, so clear
7400 is_for_scope for the current_binding_level.
7402 Otherwise, we need to preserve the temp slot for decl to last
7403 into the outer binding level. */
7406 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7408 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7409 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7411 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7413 BINDING_VALUE (outer_binding
)
7414 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7415 current_binding_level
->is_for_scope
= 0;
7417 else if (DECL_IN_MEMORY_P (decl
))
7418 preserve_temp_slots (DECL_RTL (decl
));
7422 /* Generate code to initialize DECL (a local variable). */
7425 initialize_local_var (decl
, init
, flags
)
7430 tree type
= TREE_TYPE (decl
);
7432 /* If the type is bogus, don't bother initializing the variable. */
7433 if (type
== error_mark_node
)
7436 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7438 /* If we used it already as memory, it must stay in memory. */
7439 DECL_INITIAL (decl
) = NULL_TREE
;
7440 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7443 /* Local statics are handled differently from ordinary automatic
7445 if (TREE_STATIC (decl
))
7447 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7448 || TYPE_NEEDS_DESTRUCTOR (type
))
7449 expand_static_init (decl
, init
);
7453 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7457 /* Compute and store the initial value. */
7458 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7460 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7462 int saved_stmts_are_full_exprs_p
;
7464 emit_line_note (DECL_SOURCE_FILE (decl
),
7465 DECL_SOURCE_LINE (decl
));
7466 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7467 stmts_are_full_exprs_p
= 1;
7468 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7469 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7472 /* Set this to 0 so we can tell whether an aggregate which was
7473 initialized was ever used. Don't do this if it has a
7474 destructor, so we don't complain about the 'resource
7475 allocation is initialization' idiom. Now set
7476 attribute((unused)) on types so decls of that type will be
7477 marked used. (see TREE_USED, above.) */
7478 if (TYPE_NEEDS_CONSTRUCTING (type
)
7480 && !TYPE_NEEDS_DESTRUCTOR (type
)
7481 && DECL_NAME (decl
))
7482 TREE_USED (decl
) = 0;
7483 else if (already_used
)
7484 TREE_USED (decl
) = 1;
7488 /* Generate code to destroy DECL (a local variable). */
7491 destroy_local_var (decl
)
7494 tree type
= TREE_TYPE (decl
);
7497 /* Only variables get cleaned up. */
7498 if (TREE_CODE (decl
) != VAR_DECL
)
7501 /* And only things with destructors need cleaning up. */
7502 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7505 if (TREE_CODE (decl
) == VAR_DECL
&&
7506 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7507 /* We don't clean up things that aren't defined in this
7508 translation unit, or that need a static cleanup. The latter
7509 are handled by finish_file. */
7512 /* Compute the cleanup. */
7513 cleanup
= maybe_build_cleanup (decl
);
7515 /* Record the cleanup required for this declaration. */
7516 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7518 finish_decl_cleanup (decl
, cleanup
);
7521 /* Let the back-end know about DECL. */
7524 emit_local_var (decl
)
7527 /* Create RTL for this variable. */
7528 if (DECL_RTL (decl
))
7529 /* Only a RESULT_DECL should have non-NULL RTL when arriving here.
7530 All other local variables are assigned RTL in this function. */
7531 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7535 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7536 /* The user must have specified an assembler name for this
7537 variable. Set that up now. */
7538 rest_of_decl_compilation
7539 (decl
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
7540 /*top_level=*/0, /*at_end=*/0);
7545 /* Actually do the initialization. */
7546 expand_start_target_temps ();
7547 expand_decl_init (decl
);
7548 expand_end_target_temps ();
7551 /* Finish processing of a declaration;
7552 install its line number and initial value.
7553 If the length of an array type is not known before,
7554 it must be determined now, from the initial value, or it is an error.
7556 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7557 for aggregates that have constructors alive on the permanent obstack,
7558 so that the global initializing functions can be written at the end.
7560 INIT0 holds the value of an initializer that should be allowed to escape
7563 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7564 if the (init) syntax was used.
7566 For functions that take default parameters, DECL points to its
7567 "maximal" instantiation. `cp_finish_decl' must then also declared its
7568 subsequently lower and lower forms of instantiation, checking for
7569 ambiguity as it goes. This can be sped up later. */
7572 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7578 tree ttype
= NULL_TREE
;
7579 const char *asmspec
= NULL
;
7580 int was_readonly
= 0;
7582 /* If this is 0, then we did not change obstacks. */
7586 error ("assignment (not initialization) in declaration");
7590 /* Handling __FUNCTION__ and its ilk in a template-function requires
7591 some special processing because we are called from
7592 language-independent code. */
7593 if (current_function
&& processing_template_decl
7594 && current_function_name_declared
== 2)
7596 /* Since we're in a template function, we need to
7597 push_template_decl. The language-independent code in
7598 declare_hidden_char_array doesn't know to do this. */
7599 retrofit_lang_decl (decl
);
7600 decl
= push_template_decl (decl
);
7602 if (strcmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
7603 "__PRETTY_FUNCTION__") == 0)
7605 init
= build (FUNCTION_NAME
, const_string_type_node
);
7606 DECL_PRETTY_FUNCTION_P (decl
) = 1;
7610 /* If a name was specified, get the string. */
7612 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7614 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7616 cp_error ("Cannot initialize `%D' to namespace `%D'",
7621 if (current_class_type
7622 && DECL_REAL_CONTEXT (decl
) == current_class_type
7623 && TYPE_BEING_DEFINED (current_class_type
)
7624 && (DECL_INITIAL (decl
) || init
))
7625 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7627 if (TREE_CODE (decl
) == VAR_DECL
7628 && DECL_CONTEXT (decl
)
7629 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7630 && DECL_CONTEXT (decl
) != current_namespace
7633 /* Leave the namespace of the object. */
7634 pop_decl_namespace ();
7637 type
= TREE_TYPE (decl
);
7639 if (type
== error_mark_node
)
7642 /* Add this declaration to the statement-tree. */
7643 if (building_stmt_tree () && at_function_scope_p ())
7644 add_decl_stmt (decl
);
7646 if (TYPE_HAS_MUTABLE_P (type
))
7647 TREE_READONLY (decl
) = 0;
7649 if (processing_template_decl
)
7651 if (init
&& DECL_INITIAL (decl
))
7652 DECL_INITIAL (decl
) = init
;
7656 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7657 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7659 /* Take care of TYPE_DECLs up front. */
7660 if (TREE_CODE (decl
) == TYPE_DECL
)
7662 if (init
&& DECL_INITIAL (decl
))
7664 /* typedef foo = bar; store the type of bar as the type of foo. */
7665 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7666 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7668 if (type
!= error_mark_node
7669 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7671 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7672 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7673 set_identifier_type_value (DECL_NAME (decl
), type
);
7674 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7676 GNU_xref_decl (current_function_decl
, decl
);
7678 /* If we have installed this as the canonical typedef for this
7679 type, and that type has not been defined yet, delay emitting
7680 the debug information for it, as we will emit it later. */
7681 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7682 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7683 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7685 rest_of_decl_compilation (decl
, NULL_PTR
,
7686 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7690 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7691 ttype
= target_type (type
);
7693 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7694 && TYPE_NEEDS_CONSTRUCTING (type
))
7696 /* Currently, GNU C++ puts constants in text space, making them
7697 impossible to initialize. In the future, one would hope for
7698 an operating system which understood the difference between
7699 initialization and the running of a program. */
7701 TREE_READONLY (decl
) = 0;
7704 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7706 /* This must override the asm specifier which was placed by
7707 grokclassfn. Lay this out fresh. */
7708 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7709 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7710 make_decl_rtl (decl
, asmspec
, 0);
7713 /* Deduce size of array from initialization, if not already known. */
7714 maybe_deduce_size_from_array_init (decl
, init
);
7715 init
= check_initializer (decl
, init
);
7717 GNU_xref_decl (current_function_decl
, decl
);
7719 if (TREE_CODE (decl
) == VAR_DECL
)
7720 layout_var_decl (decl
);
7722 /* Output the assembler code and/or RTL code for variables and functions,
7723 unless the type is an undefined structure or union.
7724 If not, it will get done when the type is completed. */
7725 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7726 || TREE_CODE (decl
) == RESULT_DECL
)
7728 if (TREE_CODE (decl
) == VAR_DECL
)
7729 maybe_commonize_var (decl
);
7731 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7733 if (TREE_CODE (type
) == FUNCTION_TYPE
7734 || TREE_CODE (type
) == METHOD_TYPE
)
7735 abstract_virtuals_error (decl
,
7736 strip_array_types (TREE_TYPE (type
)));
7738 abstract_virtuals_error (decl
, strip_array_types (type
));
7740 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7742 else if (DECL_EXTERNAL (decl
)
7743 && ! (DECL_LANG_SPECIFIC (decl
)
7744 && DECL_NOT_REALLY_EXTERN (decl
)))
7747 DECL_INITIAL (decl
) = init
;
7749 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
7751 /* This is a local declaration. */
7752 if (doing_semantic_analysis_p ())
7753 maybe_inject_for_scope_var (decl
);
7754 /* Initialize the local variable. But, if we're building a
7755 statement-tree, we'll do the initialization when we
7757 if (processing_template_decl
)
7759 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7760 DECL_INITIAL (decl
) = init
;
7764 /* If we're not building RTL, then we need to do so
7766 if (!building_stmt_tree ())
7767 emit_local_var (decl
);
7768 /* Initialize the variable. */
7769 initialize_local_var (decl
, init
, flags
);
7770 /* Clean up the variable. */
7771 destroy_local_var (decl
);
7774 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7776 /* Cleanups for static variables are handled by `finish_file'. */
7777 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7778 || TYPE_NEEDS_DESTRUCTOR (type
))
7779 expand_static_init (decl
, init
);
7783 /* Undo call to `pushclass' that was done in `start_decl'
7784 due to initialization of qualified member variable.
7785 I.e., Foo::x = 10; */
7787 tree context
= DECL_REAL_CONTEXT (decl
);
7789 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7790 && (TREE_CODE (decl
) == VAR_DECL
7791 /* We also have a pushclass done that we need to undo here
7792 if we're at top level and declare a method. */
7793 || TREE_CODE (decl
) == FUNCTION_DECL
)
7794 /* If size hasn't been set, we're still defining it,
7795 and therefore inside the class body; don't pop
7796 the binding level.. */
7797 && TYPE_SIZE (context
) != NULL_TREE
7798 && context
== current_class_type
)
7799 pop_nested_class ();
7805 /* If requested, warn about definitions of large data objects. */
7807 if (warn_larger_than
7808 && ! processing_template_decl
7809 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7810 && !DECL_EXTERNAL (decl
))
7812 register tree decl_size
= DECL_SIZE (decl
);
7814 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7816 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7818 if (units
> larger_than_size
)
7819 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7824 TREE_READONLY (decl
) = 1;
7827 /* This is here for a midend callback from c-common.c */
7830 finish_decl (decl
, init
, asmspec_tree
)
7834 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
7837 /* Generate code to handle the destruction of the function-scoped
7838 static variable DECL. */
7841 destroy_local_static (decl
)
7844 tree cleanup
, fcall
;
7846 int saved_flag_access_control
;
7848 if (atexit_node
== 0)
7850 tree atexit_fndecl
, PFV
, pfvlist
;
7852 PFV
= build_pointer_type (build_function_type
7853 (void_type_node
, void_list_node
));
7855 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7857 push_lang_context (lang_name_c
);
7858 /* Note that we do not call pushdecl for this function;
7859 there's no reason that this declaration should be
7860 accessible to anyone. */
7862 = define_function ("atexit",
7863 build_function_type (void_type_node
,
7865 /*pfn=*/0, NULL_PTR
);
7866 mark_used (atexit_fndecl
);
7867 atexit_node
= default_conversion (atexit_fndecl
);
7868 pop_lang_context ();
7871 /* Call build_cleanup before we enter the anonymous function so that
7872 any access checks will be done relative to the current scope,
7873 rather than the scope of the anonymous function. */
7874 build_cleanup (decl
);
7876 /* Now start the function. */
7877 cleanup
= start_anon_func ();
7879 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7880 to the original function, rather than the anonymous one. That
7881 will make the back-end think that nested functions are in use,
7882 which causes confusion. */
7883 saved_flag_access_control
= flag_access_control
;
7884 flag_access_control
= 0;
7885 fcall
= build_cleanup (decl
);
7886 flag_access_control
= saved_flag_access_control
;
7888 /* Create the body of the anonymous function. */
7889 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7890 finish_expr_stmt (fcall
);
7891 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7894 /* Call atexit with the cleanup function. */
7895 mark_addressable (cleanup
);
7896 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7897 fcall
= build_function_call (atexit_node
,
7898 tree_cons (NULL_TREE
,
7901 finish_expr_stmt (fcall
);
7905 expand_static_init (decl
, init
)
7909 tree oldstatic
= value_member (decl
, static_aggregates
);
7913 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7914 cp_error ("multiple initializations given for `%D'", decl
);
7916 else if (! toplevel_bindings_p ())
7918 /* Emit code to perform this initialization but once. */
7925 /* Emit code to perform this initialization but once. This code
7928 static int temp = 0;
7930 // Do initialization.
7932 // Register variable for destruction at end of program.
7935 Note that the `temp' variable is only set to 1 *after* the
7936 initialization is complete. This ensures that an exception,
7937 thrown during the construction, will cause the variable to
7938 reinitialized when we pass through this code again, as per:
7942 If the initialization exits by throwing an exception, the
7943 initialization is not complete, so it will be tried again
7944 the next time control enters the declaration.
7946 In theory, this process should be thread-safe, too; multiple
7947 threads should not be able to initialize the variable more
7948 than once. We don't yet attempt to ensure thread-safety. */
7949 temp
= get_temp_name (integer_type_node
, 1);
7950 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
7952 /* Begin the conditional initialization. */
7953 if_stmt
= begin_if_stmt ();
7954 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
7957 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
7959 /* Do the initialization itself. */
7960 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
7961 || (init
&& TREE_CODE (init
) == TREE_LIST
))
7962 assignment
= build_aggr_init (decl
, init
, 0);
7964 /* The initialization we're doing here is just a bitwise
7966 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
7968 assignment
= NULL_TREE
;
7970 /* Once the assignment is complete, set TEMP to 1. Since the
7971 construction of the static object is complete at this point,
7972 we want to make sure TEMP is set to 1 even if a temporary
7973 constructed during the initialization throws an exception
7974 when it is destroyed. So, we combine the initialization and
7975 the assignment to TEMP into a single expression, ensuring
7976 that when we call finish_expr_stmt the cleanups will not be
7977 run until after TEMP is set to 1. */
7978 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
7981 assignment
= tree_cons (NULL_TREE
, assignment
,
7982 build_tree_list (NULL_TREE
,
7984 assignment
= build_compound_expr (assignment
);
7987 assignment
= temp_init
;
7988 finish_expr_stmt (assignment
);
7990 /* Use atexit to register a function for destroying this static
7992 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7993 destroy_local_static (decl
);
7995 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
7996 finish_then_clause (if_stmt
);
8001 /* This code takes into account memory allocation policy of
8002 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8003 hold for this object, then we must make permanent the storage
8004 currently in the temporary obstack. */
8005 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8006 preserve_initializer ();
8007 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8011 /* Finish the declaration of a catch-parameter. */
8014 start_handler_parms (declspecs
, declarator
)
8021 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8023 if (decl
== NULL_TREE
)
8024 error ("invalid catch parameter");
8033 /* Make TYPE a complete type based on INITIAL_VALUE.
8034 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8035 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8038 complete_array_type (type
, initial_value
, do_default
)
8039 tree type
, initial_value
;
8042 register tree maxindex
= NULL_TREE
;
8047 /* Note MAXINDEX is really the maximum index,
8048 one less than the size. */
8049 if (TREE_CODE (initial_value
) == STRING_CST
)
8052 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8053 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8056 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8058 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8059 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8060 for (; elts
; elts
= TREE_CHAIN (elts
))
8062 if (TREE_PURPOSE (elts
))
8063 maxindex
= TREE_PURPOSE (elts
);
8065 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8067 maxindex
= copy_node (maxindex
);
8071 /* Make an error message unless that happened already. */
8072 if (initial_value
!= error_mark_node
)
8075 initial_value
= NULL_TREE
;
8077 /* Prevent further error messages. */
8078 maxindex
= build_int_2 (0, 0);
8085 maxindex
= build_int_2 (0, 0);
8094 domain
= build_index_type (maxindex
);
8095 TYPE_DOMAIN (type
) = domain
;
8097 if (! TREE_TYPE (maxindex
))
8098 TREE_TYPE (maxindex
) = domain
;
8100 itype
= TREE_TYPE (initial_value
);
8103 if (itype
&& !TYPE_DOMAIN (itype
))
8104 TYPE_DOMAIN (itype
) = domain
;
8105 /* The type of the main variant should never be used for arrays
8106 of different sizes. It should only ever be completed with the
8107 size of the array. */
8108 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8109 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8112 /* Lay out the type now that we can get the real answer. */
8119 /* Return zero if something is declared to be a member of type
8120 CTYPE when in the context of CUR_TYPE. STRING is the error
8121 message to print in that case. Otherwise, quietly return 1. */
8124 member_function_or_else (ctype
, cur_type
, string
)
8125 tree ctype
, cur_type
;
8128 if (ctype
&& ctype
!= cur_type
)
8130 error (string
, TYPE_NAME_STRING (ctype
));
8136 /* Subroutine of `grokdeclarator'. */
8138 /* Generate errors possibly applicable for a given set of specifiers.
8139 This is for ARM $7.1.2. */
8142 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8145 int virtualp
, quals
, friendp
, raises
, inlinep
;
8148 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8150 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8152 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8155 cp_error_at ("`%D' declared as a friend", object
);
8157 cp_error_at ("`%D' declared with an exception specification", object
);
8160 /* CTYPE is class type, or null if non-class.
8161 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8163 DECLARATOR is the function's name.
8164 VIRTUALP is truthvalue of whether the function is virtual or not.
8165 FLAGS are to be passed through to `grokclassfn'.
8166 QUALS are qualifiers indicating whether the function is `const'
8168 RAISES is a list of exceptions that this function can raise.
8169 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8170 not look, and -1 if we should not call `grokclassfn' at all.
8172 Returns `NULL_TREE' if something goes wrong, after issuing
8173 applicable error messages. */
8176 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8177 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8178 template_count
, in_namespace
)
8181 tree orig_declarator
;
8183 enum overload_flags flags
;
8185 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8189 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8190 int has_default_arg
= 0;
8194 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8195 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8201 type
= build_exception_variant (type
, raises
);
8204 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8205 /* Propagate volatile out from type to decl. */
8206 if (TYPE_VOLATILE (type
))
8207 TREE_THIS_VOLATILE (decl
) = 1;
8209 /* If this decl has namespace scope, set that up. */
8211 set_decl_namespace (decl
, in_namespace
, friendp
);
8212 else if (publicp
&& ! ctype
)
8213 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8215 /* `main' and builtins have implicit 'C' linkage. */
8216 if ((MAIN_NAME_P (declarator
)
8217 || (IDENTIFIER_LENGTH (declarator
) > 10
8218 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8219 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8220 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8221 && current_lang_name
== lang_name_cplusplus
8222 && ctype
== NULL_TREE
8223 /* NULL_TREE means global namespace. */
8224 && DECL_CONTEXT (decl
) == NULL_TREE
)
8225 DECL_LANGUAGE (decl
) = lang_c
;
8227 /* Should probably propagate const out from type to decl I bet (mrs). */
8230 DECL_STATIC_FUNCTION_P (decl
) = 1;
8231 DECL_CONTEXT (decl
) = ctype
;
8235 DECL_CLASS_CONTEXT (decl
) = ctype
;
8237 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8239 if (processing_template_decl
)
8240 error ("cannot declare `main' to be a template");
8242 error ("cannot declare `main' to be inline");
8244 error ("cannot declare `main' to be static");
8249 /* Members of anonymous types and local classes have no linkage; make
8251 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8252 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8257 /* [basic.link]: A name with no linkage (notably, the name of a class
8258 or enumeration declared in a local scope) shall not be used to
8259 declare an entity with linkage.
8261 Only check this for public decls for now. */
8262 t
= no_linkage_check (TREE_TYPE (decl
));
8265 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8267 if (DECL_LANGUAGE (decl
) == lang_c
)
8268 /* Allow this; it's pretty common in C. */;
8270 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8274 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8279 TREE_PUBLIC (decl
) = publicp
;
8282 DECL_INTERFACE_KNOWN (decl
) = 1;
8283 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8287 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8289 DECL_EXTERNAL (decl
) = 1;
8290 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8292 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8293 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8297 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8298 grok_op_properties (decl
, virtualp
, check
< 0);
8300 if (ctype
&& hack_decl_function_context (decl
))
8301 DECL_NO_STATIC_CHAIN (decl
) = 1;
8303 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8304 if (TREE_PURPOSE (t
)
8305 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8307 has_default_arg
= 1;
8312 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8316 ("defining explicit specialization `%D' in friend declaration",
8320 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8322 /* Something like `template <class T> friend void f<T>()'. */
8323 cp_error ("template-id `%D' in declaration of primary template",
8329 /* A friend declaration of the form friend void f<>(). Record
8330 the information in the TEMPLATE_ID_EXPR. */
8331 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8332 DECL_TEMPLATE_INFO (decl
)
8333 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8334 TREE_OPERAND (orig_declarator
, 1),
8337 if (has_default_arg
)
8339 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8346 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8353 if (has_default_arg
)
8354 add_defarg_fn (decl
);
8356 /* Plain overloading: will not be grok'd by grokclassfn. */
8357 if (! ctype
&& ! processing_template_decl
8358 && DECL_LANGUAGE (decl
) != lang_c
8359 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8360 set_mangled_name_for_decl (decl
);
8363 /* Make the init_value nonzero so pushdecl knows this is not
8364 tentative. error_mark_node is replaced later with the BLOCK. */
8365 DECL_INITIAL (decl
) = error_mark_node
;
8367 /* Caller will do the rest of this. */
8371 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8374 /* Just handle constructors here. We could do this
8375 inside the following if stmt, but I think
8376 that the code is more legible by breaking this
8377 case out. See comments below for what each of
8378 the following calls is supposed to do. */
8379 DECL_CONSTRUCTOR_P (decl
) = 1;
8381 grokclassfn (ctype
, decl
, flags
, quals
);
8383 decl
= check_explicit_specialization (orig_declarator
, decl
,
8385 2 * (funcdef_flag
!= 0) +
8386 4 * (friendp
!= 0));
8387 if (decl
== error_mark_node
)
8390 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8393 tmp
= check_classfn (ctype
, decl
);
8395 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8396 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8398 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8399 cp_error ("definition of implicitly-declared `%D'", tmp
);
8400 if (tmp
&& duplicate_decls (decl
, tmp
))
8403 if (! grok_ctor_properties (ctype
, decl
))
8410 /* Function gets the ugly name, field gets the nice one.
8411 This call may change the type of the function (because
8412 of default parameters)! */
8413 if (ctype
!= NULL_TREE
)
8414 grokclassfn (ctype
, decl
, flags
, quals
);
8416 decl
= check_explicit_specialization (orig_declarator
, decl
,
8418 2 * (funcdef_flag
!= 0) +
8419 4 * (friendp
!= 0));
8420 if (decl
== error_mark_node
)
8423 if (ctype
!= NULL_TREE
8424 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8427 tmp
= check_classfn (ctype
, decl
);
8429 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8430 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8432 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8433 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8435 /* Remove the `this' parm added by grokclassfn.
8436 XXX Isn't this done in start_function, too? */
8437 revert_static_member_fn (&decl
, NULL
, NULL
);
8438 last_function_parms
= TREE_CHAIN (last_function_parms
);
8440 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8441 cp_error ("definition of implicitly-declared `%D'", tmp
);
8444 /* Attempt to merge the declarations. This can fail, in
8445 the case of some illegal specialization declarations. */
8446 if (!duplicate_decls (decl
, tmp
))
8447 cp_error ("no `%#D' member function declared in class `%T'",
8453 if (ctype
== NULL_TREE
|| check
)
8458 DECL_VIRTUAL_P (decl
) = 1;
8459 if (DECL_VINDEX (decl
) == NULL_TREE
)
8460 DECL_VINDEX (decl
) = error_mark_node
;
8461 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8468 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8471 RID_BIT_TYPE
*specbits_in
;
8477 RID_BIT_TYPE specbits
;
8479 specbits
= *specbits_in
;
8481 if (TREE_CODE (type
) == OFFSET_TYPE
)
8483 /* If you declare a static member so that it
8484 can be initialized, the code will reach here. */
8485 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8486 type
= TREE_TYPE (type
);
8487 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8488 DECL_CONTEXT (decl
) = basetype
;
8489 DECL_CLASS_CONTEXT (decl
) = basetype
;
8490 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8497 context
= in_namespace
;
8498 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8499 context
= current_namespace
;
8501 context
= NULL_TREE
;
8503 if (processing_template_decl
)
8504 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8505 we can call push_template_decl. */
8506 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8508 decl
= build_decl (VAR_DECL
, declarator
, type
);
8511 set_decl_namespace (decl
, context
, 0);
8513 context
= DECL_CONTEXT (decl
);
8514 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8515 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8519 set_decl_namespace (decl
, in_namespace
, 0);
8521 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8523 DECL_THIS_EXTERN (decl
) = 1;
8524 DECL_EXTERNAL (decl
) = !initialized
;
8527 /* In class context, static means one per class,
8528 public access, and static storage. */
8529 if (DECL_CLASS_SCOPE_P (decl
))
8531 TREE_PUBLIC (decl
) = 1;
8532 TREE_STATIC (decl
) = 1;
8533 DECL_EXTERNAL (decl
) = 0;
8535 /* At top level, either `static' or no s.c. makes a definition
8536 (perhaps tentative), and absence of `static' makes it public. */
8537 else if (toplevel_bindings_p ())
8539 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8540 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8541 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8543 /* Not at top level, only `static' makes a static definition. */
8546 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8547 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8550 if (TREE_PUBLIC (decl
))
8552 /* [basic.link]: A name with no linkage (notably, the name of a class
8553 or enumeration declared in a local scope) shall not be used to
8554 declare an entity with linkage.
8556 Only check this for public decls for now. */
8557 tree t
= no_linkage_check (TREE_TYPE (decl
));
8560 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8561 /* Ignore for now; `enum { foo } e' is pretty common. */;
8563 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8571 /* Create and return a canonical pointer to member function type, for
8572 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8575 build_ptrmemfunc_type (type
)
8581 tree unqualified_variant
= NULL_TREE
;
8583 /* If a canonical type already exists for this type, use it. We use
8584 this method instead of type_hash_canon, because it only does a
8585 simple equality check on the list of field members. */
8587 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8590 /* Make sure that we always have the unqualified pointer-to-member
8592 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8594 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8596 u
= make_lang_type (UNION_TYPE
);
8597 SET_IS_AGGR_TYPE (u
, 0);
8598 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8599 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8601 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8602 TYPE_NAME (u
) = NULL_TREE
;
8604 t
= make_lang_type (RECORD_TYPE
);
8606 /* Let the front-end know this is a pointer to member function... */
8607 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8608 /* ... and not really an aggregate. */
8609 SET_IS_AGGR_TYPE (t
, 0);
8611 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8613 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8615 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8616 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8618 /* Zap out the name so that the back-end will give us the debugging
8619 information for this anonymous RECORD_TYPE. */
8620 TYPE_NAME (t
) = NULL_TREE
;
8622 /* If this is not the unqualified form of this pointer-to-member
8623 type, set the TYPE_MAIN_VARIANT for this type to be the
8624 unqualified type. Since they are actually RECORD_TYPEs that are
8625 not variants of each other, we must do this manually. */
8626 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8628 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8629 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8630 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8631 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8634 /* Cache this pointer-to-member type so that we can find it again
8636 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8638 /* Seems to be wanted. */
8639 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8644 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8645 Check to see that the definition is valid. Issue appropriate error
8646 messages. Return 1 if the definition is particularly bad, or 0
8650 check_static_variable_definition (decl
, type
)
8654 /* Motion 10 at San Diego: If a static const integral data member is
8655 initialized with an integral constant expression, the initializer
8656 may appear either in the declaration (within the class), or in
8657 the definition, but not both. If it appears in the class, the
8658 member is a member constant. The file-scope definition is always
8660 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8662 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8664 /* If we just return the declaration, crashes will sometimes
8665 occur. We therefore return void_type_node, as if this was a
8666 friend declaration, to cause callers to completely ignore
8667 this declaration. */
8670 else if (!CP_TYPE_CONST_P (type
))
8671 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8673 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8674 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8679 /* Given the SIZE (i.e., number of elements) in an array, compute an
8680 appropriate index type for the array. If non-NULL, NAME is the
8681 name of the thing being declared. */
8684 compute_array_index_type (name
, size
)
8690 /* The size might be the result of a cast. */
8691 STRIP_TYPE_NOPS (size
);
8693 /* It might be a const variable or enumeration constant. */
8694 if (TREE_READONLY_DECL_P (size
))
8695 size
= decl_constant_value (size
);
8697 /* If this involves a template parameter, it will be a constant at
8698 instantiation time, but we don't know what the value is yet.
8699 Even if no template parameters are involved, we may an expression
8700 that is not a constant; we don't even simplify `1 + 2' when
8701 processing a template. */
8702 if (processing_template_decl
)
8704 /* Resolve a qualified reference to an enumerator or static
8705 const data member of ours. */
8706 if (TREE_CODE (size
) == SCOPE_REF
8707 && TREE_OPERAND (size
, 0) == current_class_type
)
8709 tree t
= lookup_field (current_class_type
,
8710 TREE_OPERAND (size
, 1), 0, 0);
8715 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
8716 size
, integer_one_node
));
8719 /* The array bound must be an integer type. */
8720 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
8721 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
8722 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
8724 cp_error ("size of array `%D' has non-integer type", name
);
8725 size
= integer_one_node
;
8728 /* Normally, the array-bound will be a constant. */
8729 if (TREE_CONSTANT (size
))
8731 /* Check to see if the array bound overflowed. Make that an
8732 error, no matter how generous we're being. */
8733 int old_flag_pedantic_errors
= flag_pedantic_errors
;
8734 int old_pedantic
= pedantic
;
8735 pedantic
= flag_pedantic_errors
= 1;
8736 constant_expression_warning (size
);
8737 pedantic
= old_pedantic
;
8738 flag_pedantic_errors
= old_flag_pedantic_errors
;
8740 /* An array must have a positive number of elements. */
8741 if (INT_CST_LT (size
, integer_zero_node
))
8743 cp_error ("size of array `%D' is negative", name
);
8744 size
= integer_one_node
;
8746 /* Except that an extension we allow zero-sized arrays. We
8747 always allow them in system headers because glibc uses
8749 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
8750 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", name
);
8753 /* Compute the index of the largest element in the array. It is
8754 one less than the number of elements in the array. */
8756 = fold (build_binary_op (MINUS_EXPR
,
8757 cp_convert (ssizetype
, size
),
8758 cp_convert (ssizetype
,
8759 integer_one_node
)));
8761 /* Check for variable-sized arrays. We allow such things as an
8762 extension, even though they are not allowed in ANSI/ISO C++. */
8763 if (!TREE_CONSTANT (itype
))
8768 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
8771 cp_pedwarn ("ANSI C++ forbids variable-size array");
8774 /* Create a variable-sized array index type. */
8775 itype
= variable_size (itype
);
8777 /* Make sure that there was no overflow when creating to a signed
8778 index type. (For example, on a 32-bit machine, an array with
8779 size 2^32 - 1 is too big.) */
8780 else if (TREE_OVERFLOW (itype
))
8782 error ("overflow in array dimension");
8783 TREE_OVERFLOW (itype
) = 0;
8786 /* Create and return the appropriate index type. */
8787 return build_index_type (itype
);
8790 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
8791 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
8795 create_array_type_for_decl (name
, type
, size
)
8800 tree itype
= NULL_TREE
;
8801 const char* error_msg
;
8803 /* If things have already gone awry, bail now. */
8804 if (type
== error_mark_node
|| size
== error_mark_node
)
8805 return error_mark_node
;
8807 /* Assume that everything will go OK. */
8810 /* There are some types which cannot be array elements. */
8811 switch (TREE_CODE (type
))
8814 error_msg
= "array of void";
8818 error_msg
= "array of functions";
8821 case REFERENCE_TYPE
:
8822 error_msg
= "array of references";
8826 error_msg
= "array of data members";
8830 error_msg
= "array of function members";
8837 /* If something went wrong, issue an error-message and return. */
8841 cp_error ("declaration of `%D' as %s", name
, error_msg
);
8843 cp_error ("creating %s", error_msg
);
8845 return error_mark_node
;
8850 The constant expressions that specify the bounds of the arrays
8851 can be omitted only for the first member of the sequence. */
8852 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
8854 cp_error ("declaration of `%D' as multidimensional array",
8856 cp_error ("must have bounds for all dimensions except the first");
8858 return error_mark_node
;
8861 /* Figure out the index type for the array. */
8863 itype
= compute_array_index_type (name
, size
);
8865 return build_cplus_array_type (type
, itype
);
8868 /* Given declspecs and a declarator,
8869 determine the name and type of the object declared
8870 and construct a ..._DECL node for it.
8871 (In one case we can return a ..._TYPE node instead.
8872 For invalid input we sometimes return 0.)
8874 DECLSPECS is a chain of tree_list nodes whose value fields
8875 are the storage classes and type specifiers.
8877 DECL_CONTEXT says which syntactic context this declaration is in:
8878 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8879 FUNCDEF for a function definition. Like NORMAL but a few different
8880 error messages in each case. Return value may be zero meaning
8881 this definition is too screwy to try to parse.
8882 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8883 handle member functions (which have FIELD context).
8884 Return value may be zero meaning this definition is too screwy to
8886 PARM for a parameter declaration (either within a function prototype
8887 or before a function body). Make a PARM_DECL, or return void_type_node.
8888 CATCHPARM for a parameter declaration before a catch clause.
8889 TYPENAME if for a typename (in a cast or sizeof).
8890 Don't make a DECL node; just return the ..._TYPE node.
8891 FIELD for a struct or union field; make a FIELD_DECL.
8892 BITFIELD for a field with specified width.
8893 INITIALIZED is 1 if the decl has an initializer.
8895 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8896 normal attributes in TREE_PURPOSE, or NULL_TREE.
8898 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8899 It may also be so in the PARM case, for a prototype where the
8900 argument type is specified but not the name.
8902 This function is where the complicated C meanings of `static'
8903 and `extern' are interpreted.
8905 For C++, if there is any monkey business to do, the function which
8906 calls this one must do it, i.e., prepending instance variables,
8907 renaming overloaded function names, etc.
8909 Note that for this C++, it is an error to define a method within a class
8910 which does not belong to that class.
8912 Except in the case where SCOPE_REFs are implicitly known (such as
8913 methods within a class being redundantly qualified),
8914 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8915 (class_name::decl_name). The caller must also deal with this.
8917 If a constructor or destructor is seen, and the context is FIELD,
8918 then the type gains the attribute TREE_HAS_x. If such a declaration
8919 is erroneous, NULL_TREE is returned.
8921 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8922 function, these are the qualifiers to give to the `this' pointer. We
8923 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
8925 May return void_type_node if the declarator turned out to be a friend.
8926 See grokfield for details. */
8928 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8931 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8934 enum decl_context decl_context
;
8938 RID_BIT_TYPE specbits
;
8941 tree type
= NULL_TREE
;
8947 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8948 int explicit_int
= 0;
8949 int explicit_char
= 0;
8950 int defaulted_int
= 0;
8951 tree typedef_decl
= NULL_TREE
;
8953 tree typedef_type
= NULL_TREE
;
8954 int funcdef_flag
= 0;
8955 enum tree_code innermost_code
= ERROR_MARK
;
8958 /* See the code below that used this. */
8959 tree decl_machine_attr
= NULL_TREE
;
8961 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8962 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8963 tree init
= NULL_TREE
;
8965 /* Keep track of what sort of function is being processed
8966 so that we can warn about default return values, or explicit
8967 return values which do not match prescribed defaults. */
8968 enum return_types return_type
= return_normal
;
8970 tree dname
= NULL_TREE
;
8971 tree ctype
= current_class_type
;
8972 tree ctor_return_type
= NULL_TREE
;
8973 enum overload_flags flags
= NO_SPECIAL
;
8974 tree quals
= NULL_TREE
;
8975 tree raises
= NULL_TREE
;
8976 int template_count
= 0;
8977 tree in_namespace
= NULL_TREE
;
8981 RIDBIT_RESET_ALL (specbits
);
8982 if (decl_context
== FUNCDEF
)
8983 funcdef_flag
= 1, decl_context
= NORMAL
;
8984 else if (decl_context
== MEMFUNCDEF
)
8985 funcdef_flag
= -1, decl_context
= FIELD
;
8986 else if (decl_context
== BITFIELD
)
8987 bitfield
= 1, decl_context
= FIELD
;
8989 /* Look inside a declarator for the name being declared
8990 and get it as a string, for an error message. */
8992 tree
*next
= &declarator
;
8996 while (next
&& *next
)
8999 switch (TREE_CODE (decl
))
9002 /* For attributes. */
9003 next
= &TREE_VALUE (decl
);
9008 next
= &TREE_OPERAND (decl
, 0);
9011 case BIT_NOT_EXPR
: /* For C++ destructors! */
9013 tree name
= TREE_OPERAND (decl
, 0);
9014 tree rename
= NULL_TREE
;
9016 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9018 return_type
= return_dtor
;
9019 if (TREE_CODE (name
) == TYPE_DECL
)
9020 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9021 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9022 if (ctype
== NULL_TREE
)
9024 if (current_class_type
== NULL_TREE
)
9026 error ("destructors must be member functions");
9031 tree t
= constructor_name (current_class_name
);
9038 tree t
= constructor_name (ctype
);
9045 cp_error ("destructor `%T' must match class name `%T'",
9047 TREE_OPERAND (decl
, 0) = rename
;
9053 case ADDR_EXPR
: /* C++ reference declaration */
9058 innermost_code
= TREE_CODE (decl
);
9059 next
= &TREE_OPERAND (decl
, 0);
9063 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9065 /* This is actually a variable declaration using
9066 constructor syntax. We need to call start_decl and
9067 cp_finish_decl so we can get the variable
9070 tree attributes
, prefix_attributes
;
9072 *next
= TREE_OPERAND (decl
, 0);
9073 init
= CALL_DECLARATOR_PARMS (decl
);
9077 attributes
= TREE_PURPOSE (attrlist
);
9078 prefix_attributes
= TREE_VALUE (attrlist
);
9082 attributes
= NULL_TREE
;
9083 prefix_attributes
= NULL_TREE
;
9086 decl
= start_decl (declarator
, declspecs
, 1,
9087 attributes
, prefix_attributes
);
9090 /* Look for __unused__ attribute */
9091 if (TREE_USED (TREE_TYPE (decl
)))
9092 TREE_USED (decl
) = 1;
9093 finish_decl (decl
, init
, NULL_TREE
);
9096 cp_error ("invalid declarator");
9099 innermost_code
= TREE_CODE (decl
);
9100 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9101 ctype
= current_class_type
;
9103 && TREE_OPERAND (decl
, 0)
9104 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9105 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9106 == constructor_name_full (ctype
))
9107 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9108 == constructor_name (ctype
)))))
9109 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9110 next
= &TREE_OPERAND (decl
, 0);
9112 if (ctype
!= NULL_TREE
9113 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9114 && decl
== constructor_name (ctype
))
9116 return_type
= return_ctor
;
9117 ctor_return_type
= ctype
;
9122 case TEMPLATE_ID_EXPR
:
9124 tree fns
= TREE_OPERAND (decl
, 0);
9126 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9127 fns
= TREE_OPERAND (fns
, 0);
9130 if (TREE_CODE (dname
) == COMPONENT_REF
)
9131 dname
= TREE_OPERAND (dname
, 1);
9132 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9134 my_friendly_assert (is_overloaded_fn (dname
),
9136 dname
= DECL_NAME (get_first_fn (dname
));
9141 case IDENTIFIER_NODE
:
9142 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9149 cp_error ("declarator-id missing; using reserved word `%D'",
9151 name
= IDENTIFIER_POINTER (dname
);
9153 if (! IDENTIFIER_OPNAME_P (dname
)
9154 /* GNU/Linux headers use '__op'. Arrgh. */
9155 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9156 name
= IDENTIFIER_POINTER (dname
);
9159 if (IDENTIFIER_TYPENAME_P (dname
))
9161 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9162 flags
= TYPENAME_FLAG
;
9163 ctor_return_type
= TREE_TYPE (dname
);
9164 return_type
= return_conversion
;
9166 name
= operator_name_string (dname
);
9173 /* Perform error checking, and decide on a ctype. */
9174 tree cname
= TREE_OPERAND (decl
, 0);
9175 if (cname
== NULL_TREE
)
9177 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9180 in_namespace
= TREE_OPERAND (decl
, 0);
9181 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9183 else if (! is_aggr_type (cname
, 1))
9184 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9185 /* Must test TREE_OPERAND (decl, 1), in case user gives
9186 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9187 else if (TREE_OPERAND (decl
, 1)
9188 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9190 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9191 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9193 cp_error ("`%T::%D' is not a valid declarator", cname
,
9194 TREE_OPERAND (decl
, 1));
9195 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9196 cname
, TREE_OPERAND (decl
, 1));
9197 return void_type_node
;
9199 else if (ctype
== NULL_TREE
)
9201 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9202 TREE_OPERAND (decl
, 0) = ctype
;
9205 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9207 cp_error ("type `%T' is not derived from type `%T'",
9209 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9215 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9216 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9217 == constructor_name_full (ctype
))
9218 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9219 == constructor_name (ctype
))))
9220 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9221 next
= &TREE_OPERAND (decl
, 1);
9225 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9226 && constructor_name (ctype
) == decl
)
9228 return_type
= return_ctor
;
9229 ctor_return_type
= ctype
;
9231 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9232 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9233 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9234 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9236 return_type
= return_dtor
;
9237 ctor_return_type
= ctype
;
9239 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9240 next
= &TREE_OPERAND (decl
, 0);
9251 /* Parse error puts this typespec where
9252 a declarator should go. */
9253 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9254 if (TREE_TYPE (decl
) == current_class_type
)
9255 cp_error (" perhaps you want `%T' for a constructor",
9256 current_class_name
);
9257 dname
= DECL_NAME (decl
);
9258 name
= IDENTIFIER_POINTER (dname
);
9260 /* Avoid giving two errors for this. */
9261 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9263 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9270 cp_compiler_error ("`%D' as declarator", decl
);
9271 return 0; /* We used to do a 155 abort here. */
9276 /* A function definition's declarator must have the form of
9277 a function declarator. */
9279 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9282 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9283 && innermost_code
!= CALL_EXPR
9284 && ! (ctype
&& declspecs
== NULL_TREE
))
9286 cp_error ("declaration of `%D' as non-function", dname
);
9287 return void_type_node
;
9290 /* Anything declared one level down from the top level
9291 must be one of the parameters of a function
9292 (because the body is at least two levels down). */
9294 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9295 by not allowing C++ class definitions to specify their parameters
9296 with xdecls (must be spec.d in the parmlist).
9298 Since we now wait to push a class scope until we are sure that
9299 we are in a legitimate method context, we must set oldcname
9300 explicitly (since current_class_name is not yet alive).
9302 We also want to avoid calling this a PARM if it is in a namespace. */
9304 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9306 struct binding_level
*b
= current_binding_level
;
9307 current_binding_level
= b
->level_chain
;
9308 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9309 decl_context
= PARM
;
9310 current_binding_level
= b
;
9314 name
= decl_context
== PARM
? "parameter" : "type name";
9316 /* Look through the decl specs and record which ones appear.
9317 Some typespecs are defined as built-in typenames.
9318 Others, the ones that are modifiers of other types,
9319 are represented by bits in SPECBITS: set the bits for
9320 the modifiers that appear. Storage class keywords are also in SPECBITS.
9322 If there is a typedef name or a type, store the type in TYPE.
9323 This includes builtin typedefs such as `int'.
9325 Set EXPLICIT_INT if the type is `int' or `char' and did not
9326 come from a user typedef.
9328 Set LONGLONG if `long' is mentioned twice.
9330 For C++, constructors and destructors have their own fast treatment. */
9332 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9337 /* Certain parse errors slip through. For example,
9338 `int class;' is not caught by the parser. Try
9339 weakly to recover here. */
9340 if (TREE_CODE (spec
) != TREE_LIST
)
9343 id
= TREE_VALUE (spec
);
9345 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9347 if (id
== ridpointers
[(int) RID_INT
]
9348 || id
== ridpointers
[(int) RID_CHAR
]
9349 || id
== ridpointers
[(int) RID_BOOL
]
9350 || id
== ridpointers
[(int) RID_WCHAR
])
9354 if (id
== ridpointers
[(int) RID_BOOL
])
9355 error ("`bool' is now a keyword");
9357 cp_error ("extraneous `%T' ignored", id
);
9361 if (id
== ridpointers
[(int) RID_INT
])
9363 else if (id
== ridpointers
[(int) RID_CHAR
])
9365 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9369 /* C++ aggregate types. */
9370 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9373 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9375 type
= IDENTIFIER_TYPE_VALUE (id
);
9379 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9381 if (ridpointers
[i
] == id
)
9383 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9385 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9386 pedwarn ("ANSI C++ does not support `long long'");
9388 error ("`long long long' is too long for GCC");
9392 else if (RIDBIT_SETP (i
, specbits
))
9393 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9394 RIDBIT_SET (i
, specbits
);
9399 /* C++ aggregate types. */
9400 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9403 cp_error ("multiple declarations `%T' and `%T'", type
,
9407 type
= TREE_TYPE (id
);
9408 TREE_VALUE (spec
) = type
;
9413 error ("two or more data types in declaration of `%s'", name
);
9414 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9416 register tree t
= lookup_name (id
, 1);
9417 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9418 error ("`%s' fails to be a typedef or built in type",
9419 IDENTIFIER_POINTER (id
));
9422 type
= TREE_TYPE (t
);
9424 /* See the code below that used this. */
9425 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9430 else if (id
!= error_mark_node
)
9431 /* Can't change CLASS nodes into RECORD nodes here! */
9437 typedef_type
= type
;
9439 /* No type at all: default to `int', and set DEFAULTED_INT
9440 because it was not a user-defined typedef. */
9442 if (type
== NULL_TREE
9443 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9444 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9445 || RIDBIT_SETP (RID_LONG
, specbits
)
9446 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9448 /* These imply 'int'. */
9449 type
= integer_type_node
;
9453 if (type
== NULL_TREE
)
9456 if (return_type
== return_dtor
)
9457 type
= void_type_node
;
9458 else if (return_type
== return_ctor
)
9459 type
= build_pointer_type (ctor_return_type
);
9460 else if (return_type
== return_conversion
)
9461 type
= ctor_return_type
;
9464 /* We handle `main' specially here, because 'main () { }' is so
9465 common. With no options, it is allowed. With -Wreturn-type,
9466 it is a warning. It is only an error with -pedantic-errors. */
9467 int is_main
= (funcdef_flag
9468 && MAIN_NAME_P (dname
)
9469 && ctype
== NULL_TREE
9470 && in_namespace
== NULL_TREE
9471 && current_namespace
== global_namespace
);
9473 if (in_system_header
|| flag_ms_extensions
)
9474 /* Allow it, sigh. */;
9475 else if (pedantic
|| ! is_main
)
9476 cp_pedwarn ("ANSI C++ forbids declaration of `%s' with no type",
9478 else if (warn_return_type
)
9479 cp_warning ("ANSI C++ forbids declaration of `%s' with no type",
9482 type
= integer_type_node
;
9485 else if (return_type
== return_dtor
)
9487 error ("return type specification for destructor invalid");
9488 type
= void_type_node
;
9490 else if (return_type
== return_ctor
)
9492 error ("return type specification for constructor invalid");
9493 type
= build_pointer_type (ctor_return_type
);
9495 else if (return_type
== return_conversion
)
9497 if (!same_type_p (type
, ctor_return_type
))
9498 cp_error ("operator `%T' declared to return `%T'",
9499 ctor_return_type
, type
);
9501 cp_pedwarn ("return type specified for `operator %T'",
9504 type
= ctor_return_type
;
9509 /* Now process the modifiers that were specified
9510 and check for invalid combinations. */
9512 /* Long double is a special combination. */
9514 if (RIDBIT_SETP (RID_LONG
, specbits
)
9515 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9517 RIDBIT_RESET (RID_LONG
, specbits
);
9518 type
= build_qualified_type (long_double_type_node
,
9519 CP_TYPE_QUALS (type
));
9522 /* Check all other uses of type modifiers. */
9524 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9525 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9526 || RIDBIT_SETP (RID_LONG
, specbits
)
9527 || RIDBIT_SETP (RID_SHORT
, specbits
))
9531 if (TREE_CODE (type
) == REAL_TYPE
)
9532 error ("short, signed or unsigned invalid for `%s'", name
);
9533 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9534 error ("long, short, signed or unsigned invalid for `%s'", name
);
9535 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9536 && RIDBIT_SETP (RID_SHORT
, specbits
))
9537 error ("long and short specified together for `%s'", name
);
9538 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9539 || RIDBIT_SETP (RID_SHORT
, specbits
))
9541 error ("long or short specified with char for `%s'", name
);
9542 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9543 || RIDBIT_SETP (RID_SHORT
, specbits
))
9544 && TREE_CODE (type
) == REAL_TYPE
)
9545 error ("long or short specified with floating type for `%s'", name
);
9546 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9547 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9548 error ("signed and unsigned given together for `%s'", name
);
9552 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9554 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9556 if (flag_pedantic_errors
)
9561 /* Discard the type modifiers if they are invalid. */
9564 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9565 RIDBIT_RESET (RID_SIGNED
, specbits
);
9566 RIDBIT_RESET (RID_LONG
, specbits
);
9567 RIDBIT_RESET (RID_SHORT
, specbits
);
9572 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9573 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9575 error ("complex invalid for `%s'", name
);
9576 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9579 /* Decide whether an integer type is signed or not.
9580 Optionally treat bitfields as signed by default. */
9581 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9584 It is implementation-defined whether a plain (neither
9585 explicitly signed or unsigned) char, short, int, or long
9586 bit-field is signed or unsigned.
9588 Naturally, we extend this to long long as well. Note that
9589 this does not include wchar_t. */
9590 || (bitfield
&& !flag_signed_bitfields
9591 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9592 /* A typedef for plain `int' without `signed' can be
9593 controlled just like plain `int', but a typedef for
9594 `signed int' cannot be so controlled. */
9596 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9597 && (TREE_CODE (type
) == INTEGER_TYPE
9598 || TREE_CODE (type
) == CHAR_TYPE
)
9599 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9602 type
= long_long_unsigned_type_node
;
9603 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9604 type
= long_unsigned_type_node
;
9605 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9606 type
= short_unsigned_type_node
;
9607 else if (type
== char_type_node
)
9608 type
= unsigned_char_type_node
;
9609 else if (typedef_decl
)
9610 type
= unsigned_type (type
);
9612 type
= unsigned_type_node
;
9614 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9615 && type
== char_type_node
)
9616 type
= signed_char_type_node
;
9618 type
= long_long_integer_type_node
;
9619 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9620 type
= long_integer_type_node
;
9621 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9622 type
= short_integer_type_node
;
9624 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9626 /* If we just have "complex", it is equivalent to
9627 "complex double", but if any modifiers at all are specified it is
9628 the complex form of TYPE. E.g, "complex short" is
9629 "complex short int". */
9631 if (defaulted_int
&& ! longlong
9632 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9633 || RIDBIT_SETP (RID_SHORT
, specbits
)
9634 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9635 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9636 type
= complex_double_type_node
;
9637 else if (type
== integer_type_node
)
9638 type
= complex_integer_type_node
;
9639 else if (type
== float_type_node
)
9640 type
= complex_float_type_node
;
9641 else if (type
== double_type_node
)
9642 type
= complex_double_type_node
;
9643 else if (type
== long_double_type_node
)
9644 type
= complex_long_double_type_node
;
9646 type
= build_complex_type (type
);
9649 if (return_type
== return_conversion
9650 && (RIDBIT_SETP (RID_CONST
, specbits
)
9651 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9652 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9653 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9656 /* Set CONSTP if this declaration is `const', whether by
9657 explicit specification or via a typedef.
9658 Likewise for VOLATILEP. */
9660 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9662 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9664 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9665 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9666 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9667 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9668 type
= cp_build_qualified_type (type
, type_quals
);
9670 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9671 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9672 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9673 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9674 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9676 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9677 staticp
= 1 + (decl_context
== FIELD
);
9679 if (virtualp
&& staticp
== 2)
9681 cp_error ("member `%D' cannot be declared both virtual and static",
9685 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9686 RIDBIT_RESET (RID_FRIEND
, specbits
);
9688 /* Warn if two storage classes are given. Default to `auto'. */
9690 if (RIDBIT_ANY_SET (specbits
))
9692 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9693 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9694 if (decl_context
== PARM
&& nclasses
> 0)
9695 error ("storage class specifiers invalid in parameter declarations");
9696 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9698 if (decl_context
== PARM
)
9699 error ("typedef declaration invalid in parameter declaration");
9702 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9703 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9706 /* Give error if `virtual' is used outside of class declaration. */
9708 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9710 error ("virtual outside class declaration");
9714 /* Static anonymous unions are dealt with here. */
9715 if (staticp
&& decl_context
== TYPENAME
9716 && TREE_CODE (declspecs
) == TREE_LIST
9717 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9718 decl_context
= FIELD
;
9720 /* Warn about storage classes that are invalid for certain
9721 kinds of declarations (parameters, typenames, etc.). */
9724 error ("multiple storage classes in declaration of `%s'", name
);
9725 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9727 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9728 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9729 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9731 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9733 else if (decl_context
== FIELD
9734 /* C++ allows static class elements */
9735 && RIDBIT_SETP (RID_STATIC
, specbits
))
9736 /* C++ also allows inlines and signed and unsigned elements,
9737 but in those cases we don't come in here. */
9741 if (decl_context
== FIELD
)
9743 tree tmp
= NULL_TREE
;
9744 register int op
= 0;
9748 /* Avoid trying to get an operand off an identifier node. */
9749 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9752 tmp
= TREE_OPERAND (declarator
, 0);
9753 op
= IDENTIFIER_OPNAME_P (tmp
);
9755 error ("storage class specified for %s `%s'",
9756 op
? "member operator" : "field",
9757 op
? operator_name_string (tmp
) : name
);
9761 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
9762 error ("storage class specified for parameter `%s'", name
);
9764 error ("storage class specified for typename");
9766 RIDBIT_RESET (RID_REGISTER
, specbits
);
9767 RIDBIT_RESET (RID_AUTO
, specbits
);
9768 RIDBIT_RESET (RID_EXTERN
, specbits
);
9771 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9773 if (toplevel_bindings_p ())
9775 /* It's common practice (and completely valid) to have a const
9776 be initialized and declared extern. */
9777 if (!(type_quals
& TYPE_QUAL_CONST
))
9778 warning ("`%s' initialized and declared `extern'", name
);
9781 error ("`%s' has both `extern' and initializer", name
);
9783 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9784 && ! toplevel_bindings_p ())
9785 error ("nested function `%s' declared `extern'", name
);
9786 else if (toplevel_bindings_p ())
9788 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9789 error ("top-level declaration of `%s' specifies `auto'", name
);
9792 if (nclasses
> 0 && friendp
)
9793 error ("storage class specifiers invalid in friend function declarations");
9795 /* Now figure out the structure of the declarator proper.
9796 Descend through it, creating more complex types, until we reach
9797 the declared identifier (or NULL_TREE, in an absolute declarator). */
9799 inner_attrs
= NULL_TREE
;
9802 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9803 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9805 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9806 an INDIRECT_REF (for *...),
9807 a CALL_EXPR (for ...(...)),
9808 an identifier (for the name being declared)
9809 or a null pointer (for the place in an absolute declarator
9810 where the name was omitted).
9811 For the last two cases, we have just exited the loop.
9813 For C++ it could also be
9814 a SCOPE_REF (for class :: ...). In this case, we have converted
9815 sensible names to types, and those are the values we use to
9816 qualify the member name.
9817 an ADDR_EXPR (for &...),
9818 a BIT_NOT_EXPR (for destructors)
9820 At this point, TYPE is the type of elements of an array,
9821 or for a function to return, or for a pointer to point to.
9822 After this sequence of ifs, TYPE is the type of the
9823 array or function or pointer, and DECLARATOR has had its
9824 outermost layer removed. */
9826 if (type
== error_mark_node
)
9828 if (TREE_CODE (declarator
) == SCOPE_REF
)
9829 declarator
= TREE_OPERAND (declarator
, 1);
9831 declarator
= TREE_OPERAND (declarator
, 0);
9834 if (quals
!= NULL_TREE
9835 && (declarator
== NULL_TREE
9836 || TREE_CODE (declarator
) != SCOPE_REF
))
9838 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9839 ctype
= TYPE_METHOD_BASETYPE (type
);
9840 if (ctype
!= NULL_TREE
)
9842 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9843 grok_method_quals (ctype
, dummy
, quals
);
9844 type
= TREE_TYPE (dummy
);
9845 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
9850 /* See the comment for the TREE_LIST case, below. */
9853 else if (inner_attrs
)
9855 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9856 inner_attrs
= NULL_TREE
;
9859 switch (TREE_CODE (declarator
))
9863 /* We encode a declarator with embedded attributes using
9864 a TREE_LIST. The attributes apply to the declarator
9865 directly inside them, so we have to skip an iteration
9866 before applying them to the type. If the declarator just
9867 inside is the declarator-id, we apply the attrs to the
9869 inner_attrs
= TREE_PURPOSE (declarator
);
9871 declarator
= TREE_VALUE (declarator
);
9879 size
= TREE_OPERAND (declarator
, 1);
9881 /* VC++ spells a zero-sized array with []. */
9882 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9883 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9884 size
= integer_zero_node
;
9886 declarator
= TREE_OPERAND (declarator
, 0);
9888 type
= create_array_type_for_decl (dname
, type
, size
);
9897 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9898 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9900 /* Declaring a function type.
9901 Make sure we have a valid type for the function to return. */
9903 /* We now know that the TYPE_QUALS don't apply to the
9904 decl, but to its return type. */
9905 type_quals
= TYPE_UNQUALIFIED
;
9907 /* Warn about some types functions can't return. */
9909 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9911 error ("`%s' declared as function returning a function", name
);
9912 type
= integer_type_node
;
9914 if (TREE_CODE (type
) == ARRAY_TYPE
)
9916 error ("`%s' declared as function returning an array", name
);
9917 type
= integer_type_node
;
9920 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9921 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9923 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9926 /* Pick up type qualifiers which should be applied to `this'. */
9927 quals
= CALL_DECLARATOR_QUALS (declarator
);
9929 /* Pick up the exception specifications. */
9930 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
9932 /* Say it's a definition only for the CALL_EXPR
9933 closest to the identifier. */
9936 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9937 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9938 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9940 if (ctype
== NULL_TREE
9941 && decl_context
== FIELD
9943 && (friendp
== 0 || dname
== current_class_name
))
9944 ctype
= current_class_type
;
9946 if (ctype
&& return_type
== return_conversion
)
9947 TYPE_HAS_CONVERSION (ctype
) = 1;
9948 if (ctype
&& constructor_name (ctype
) == dname
)
9950 /* We are within a class's scope. If our declarator name
9951 is the same as the class name, and we are defining
9952 a function, then it is a constructor/destructor, and
9953 therefore returns a void type. */
9955 if (flags
== DTOR_FLAG
)
9957 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9958 not be declared const or volatile. A destructor
9959 may not be static. */
9961 error ("destructor cannot be static member function");
9964 cp_error ("destructors may not be `%s'",
9965 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9968 if (decl_context
== FIELD
)
9970 if (! member_function_or_else (ctype
, current_class_type
,
9971 "destructor for alien class `%s' cannot be a member"))
9972 return void_type_node
;
9975 else /* It's a constructor. */
9979 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
9980 not be declared const or volatile. A constructor may
9981 not be virtual. A constructor may not be static. */
9983 error ("constructor cannot be static member function");
9986 pedwarn ("constructors cannot be declared virtual");
9991 cp_error ("constructors may not be `%s'",
9992 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9996 RID_BIT_TYPE tmp_bits
;
9997 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
9998 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
9999 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10000 if (RIDBIT_ANY_SET (tmp_bits
))
10001 error ("return value type specifier for constructor ignored");
10003 type
= build_pointer_type (ctype
);
10004 if (decl_context
== FIELD
)
10006 if (! member_function_or_else (ctype
, current_class_type
,
10007 "constructor for alien class `%s' cannot be member"))
10008 return void_type_node
;
10009 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10010 if (return_type
!= return_ctor
)
10014 if (decl_context
== FIELD
)
10020 error ("can't initialize friend function `%s'", name
);
10023 /* Cannot be both friend and virtual. */
10024 error ("virtual functions cannot be friends");
10025 RIDBIT_RESET (RID_FRIEND
, specbits
);
10028 if (decl_context
== NORMAL
)
10029 error ("friend declaration not in class definition");
10030 if (current_function_decl
&& funcdef_flag
)
10031 cp_error ("can't define friend function `%s' in a local class definition",
10035 /* Construct the function type and go to the next
10036 inner layer of declarator. */
10038 declarator
= TREE_OPERAND (declarator
, 0);
10040 /* FIXME: This is where default args should be fully
10043 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10045 if (declarator
&& flags
== DTOR_FLAG
)
10047 /* A destructor declared in the body of a class will
10048 be represented as a BIT_NOT_EXPR. But, we just
10049 want the underlying IDENTIFIER. */
10050 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10051 declarator
= TREE_OPERAND (declarator
, 0);
10053 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10054 arg_types
= void_list_node
;
10055 else if (arg_types
== NULL_TREE
10056 || arg_types
!= void_list_node
)
10058 cp_error ("destructors may not have parameters");
10059 arg_types
= void_list_node
;
10060 last_function_parms
= NULL_TREE
;
10064 /* ANSI says that `const int foo ();'
10065 does not make the function foo const. */
10066 type
= build_function_type (type
, arg_types
);
10070 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10071 if (TREE_PURPOSE (t
)
10072 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10074 add_defarg_fn (type
);
10083 /* Filter out pointers-to-references and references-to-references.
10084 We can get these if a TYPE_DECL is used. */
10086 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10088 error ("cannot declare %s to references",
10089 TREE_CODE (declarator
) == ADDR_EXPR
10090 ? "references" : "pointers");
10091 declarator
= TREE_OPERAND (declarator
, 0);
10095 if (TREE_CODE (type
) == OFFSET_TYPE
10096 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10097 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10099 cp_error ("cannot declare pointer to `%#T' member",
10101 type
= TREE_TYPE (type
);
10104 /* Merge any constancy or volatility into the target type
10105 for the pointer. */
10107 /* We now know that the TYPE_QUALS don't apply to the decl,
10108 but to the target of the pointer. */
10109 type_quals
= TYPE_UNQUALIFIED
;
10111 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10113 if (TREE_CODE (type
) == VOID_TYPE
)
10114 error ("invalid type: `void &'");
10116 type
= build_reference_type (type
);
10118 else if (TREE_CODE (type
) == METHOD_TYPE
)
10119 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10121 type
= build_pointer_type (type
);
10123 /* Process a list of type modifier keywords (such as
10124 const or volatile) that were given inside the `*' or `&'. */
10126 if (TREE_TYPE (declarator
))
10128 register tree typemodlist
;
10134 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10135 typemodlist
= TREE_CHAIN (typemodlist
))
10137 tree qualifier
= TREE_VALUE (typemodlist
);
10139 if (qualifier
== ridpointers
[(int) RID_CONST
])
10141 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10143 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10148 error ("invalid type modifier within pointer declarator");
10152 pedwarn ("duplicate `const'");
10154 pedwarn ("duplicate `volatile'");
10156 pedwarn ("duplicate `restrict'");
10158 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10159 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10160 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10161 if (TREE_CODE (declarator
) == ADDR_EXPR
10162 && (constp
|| volatilep
))
10165 pedwarn ("discarding `const' applied to a reference");
10167 pedwarn ("discarding `volatile' applied to a reference");
10168 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10170 type
= cp_build_qualified_type (type
, type_quals
);
10172 declarator
= TREE_OPERAND (declarator
, 0);
10178 /* We have converted type names to NULL_TREE if the
10179 name was bogus, or to a _TYPE node, if not.
10181 The variable CTYPE holds the type we will ultimately
10182 resolve to. The code here just needs to build
10183 up appropriate member types. */
10184 tree sname
= TREE_OPERAND (declarator
, 1);
10187 /* Destructors can have their visibilities changed as well. */
10188 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10189 sname
= TREE_OPERAND (sname
, 0);
10191 if (TREE_COMPLEXITY (declarator
) == 0)
10192 /* This needs to be here, in case we are called
10193 multiple times. */ ;
10194 else if (TREE_COMPLEXITY (declarator
) == -1)
10195 /* Namespace member. */
10196 pop_decl_namespace ();
10197 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10198 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10199 else if (! IS_AGGR_TYPE_CODE
10200 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10202 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10204 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10205 that refer to ctype. They couldn't be resolved earlier
10206 because we hadn't pushed into the class yet.
10207 Example: resolve 'B<T>::type' in
10208 'B<typename B<T>::type> B<T>::f () { }'. */
10209 if (current_template_parms
10210 && uses_template_parms (type
)
10211 && uses_template_parms (current_class_type
))
10213 tree args
= current_template_args ();
10214 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10217 /* This pop_nested_class corresponds to the
10218 push_nested_class used to push into class scope for
10219 parsing the argument list of a function decl, in
10221 pop_nested_class ();
10222 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10225 my_friendly_abort (16);
10227 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10229 /* We had a reference to a global decl, or
10230 perhaps we were given a non-aggregate typedef,
10231 in which case we cleared this out, and should just
10232 keep going as though it wasn't there. */
10233 declarator
= sname
;
10236 ctype
= TREE_OPERAND (declarator
, 0);
10239 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10241 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10242 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10243 template_count
+= 1;
10244 t
= TYPE_MAIN_DECL (t
);
10245 if (DECL_LANG_SPECIFIC (t
))
10246 t
= DECL_CLASS_CONTEXT (t
);
10251 if (sname
== NULL_TREE
)
10254 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10256 /* This is the `standard' use of the scoping operator:
10257 basetype :: member . */
10259 if (ctype
== current_class_type
)
10265 Is this ill-formed? */
10268 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10271 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10273 if (current_class_type
== NULL_TREE
10275 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10276 TYPE_ARG_TYPES (type
));
10279 cp_error ("cannot declare member function `%T::%s' within `%T'",
10280 ctype
, name
, current_class_type
);
10281 return void_type_node
;
10284 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10285 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10287 /* Have to move this code elsewhere in this function.
10288 this code is used for i.e., typedef int A::M; M *pm;
10290 It is? How? jason 10/2/94 */
10292 if (current_class_type
)
10294 cp_error ("cannot declare member `%T::%s' within `%T'",
10295 ctype
, name
, current_class_type
);
10296 return void_type_node
;
10298 type
= build_offset_type (ctype
, type
);
10300 else if (uses_template_parms (ctype
))
10302 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10304 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10305 TYPE_ARG_TYPES (type
));
10309 cp_error ("structure `%T' not yet defined", ctype
);
10310 return error_mark_node
;
10313 declarator
= sname
;
10315 else if (TREE_CODE (sname
) == SCOPE_REF
)
10316 my_friendly_abort (17);
10320 declarator
= TREE_OPERAND (declarator
, 1);
10321 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10322 /* In this case, we will deal with it later. */
10326 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10327 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10328 TYPE_ARG_TYPES (type
));
10330 type
= build_offset_type (ctype
, type
);
10337 declarator
= TREE_OPERAND (declarator
, 0);
10342 case ENUMERAL_TYPE
:
10343 declarator
= NULL_TREE
;
10347 declarator
= NULL_TREE
;
10351 my_friendly_abort (158);
10355 /* See the comment for the TREE_LIST case, above. */
10358 if (! ignore_attrs
)
10359 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10361 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10363 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10366 /* Now TYPE has the actual type. */
10368 if (explicitp
== 1 || (explicitp
&& friendp
))
10370 /* [dcl.fct.spec] The explicit specifier shall only be used in
10371 declarations of constructors within a class definition. */
10372 error ("only declarations of constructors can be `explicit'");
10376 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10378 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10380 error ("non-member `%s' cannot be declared `mutable'", name
);
10381 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10383 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10385 error ("non-object member `%s' cannot be declared `mutable'", name
);
10386 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10388 else if (TREE_CODE (type
) == FUNCTION_TYPE
10389 || TREE_CODE (type
) == METHOD_TYPE
)
10391 error ("function `%s' cannot be declared `mutable'", name
);
10392 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10396 error ("static `%s' cannot be declared `mutable'", name
);
10397 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10399 else if (type_quals
& TYPE_QUAL_CONST
)
10401 error ("const `%s' cannot be declared `mutable'", name
);
10402 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10406 if (declarator
== NULL_TREE
10407 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10408 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10409 && (TREE_CODE (type
) == FUNCTION_TYPE
10410 || TREE_CODE (type
) == METHOD_TYPE
)))
10412 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10414 cp_error ("template-id `%D' used as a declarator", declarator
);
10415 declarator
= dname
;
10418 /* Unexpected declarator format. */
10419 my_friendly_abort (990210);
10421 /* If this is declaring a typedef name, return a TYPE_DECL. */
10423 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10427 /* Note that the grammar rejects storage classes
10428 in typenames, fields or parameters. */
10429 if (current_lang_name
== lang_name_java
)
10430 TYPE_FOR_JAVA (type
) = 1;
10432 if (decl_context
== FIELD
)
10434 if (declarator
== constructor_name (current_class_type
))
10435 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10437 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10441 /* Make sure this typedef lives as long as its type,
10442 since it might be used as a template parameter. */
10443 if (processing_template_decl
)
10444 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10446 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10449 /* If the user declares "typedef struct {...} foo" then the
10450 struct will have an anonymous name. Fill that name in now.
10451 Nothing can refer to it, so nothing needs know about the name
10453 if (type
!= error_mark_node
10454 && TYPE_NAME (type
)
10455 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10456 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10457 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10459 tree oldname
= TYPE_NAME (type
);
10462 /* Replace the anonymous name with the real name everywhere. */
10463 lookup_tag_reverse (type
, declarator
);
10464 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10465 if (TYPE_NAME (t
) == oldname
)
10466 TYPE_NAME (t
) = decl
;
10468 if (TYPE_LANG_SPECIFIC (type
))
10469 TYPE_WAS_ANONYMOUS (type
) = 1;
10471 /* If this is a typedef within a template class, the nested
10472 type is a (non-primary) template. The name for the
10473 template needs updating as well. */
10474 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10475 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10476 = TYPE_IDENTIFIER (type
);
10478 /* XXX Temporarily set the scope.
10479 When returning, start_decl expects it as NULL_TREE,
10480 and will then then set it using pushdecl. */
10481 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10482 if (current_class_type
)
10483 DECL_CONTEXT (decl
) = current_class_type
;
10485 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10487 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10488 DECL_ASSEMBLER_NAME (decl
)
10489 = get_identifier (build_overload_name (type
, 1, 1));
10490 DECL_CONTEXT (decl
) = NULL_TREE
;
10492 /* FIXME remangle member functions; member functions of a
10493 type with external linkage have external linkage. */
10496 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10498 cp_error_at ("typedef name may not be class-qualified", decl
);
10503 if (ctype
== NULL_TREE
)
10505 if (TREE_CODE (type
) != METHOD_TYPE
)
10506 cp_error_at ("invalid type qualifier for non-method type", decl
);
10508 ctype
= TYPE_METHOD_BASETYPE (type
);
10510 if (ctype
!= NULL_TREE
)
10511 grok_method_quals (ctype
, decl
, quals
);
10514 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10515 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10516 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10518 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10519 inlinep
, friendp
, raises
!= NULL_TREE
);
10522 error ("typedef declaration includes an initializer");
10527 /* Detect the case of an array type of unspecified size
10528 which came, as such, direct from a typedef name.
10529 We must copy the type, so that each identifier gets
10530 a distinct type, so that each identifier's size can be
10531 controlled separately by its own initializer. */
10533 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10534 && TYPE_DOMAIN (type
) == NULL_TREE
)
10536 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10539 /* If this is a type name (such as, in a cast or sizeof),
10540 compute the type and return it now. */
10542 if (decl_context
== TYPENAME
)
10544 /* Note that the grammar rejects storage classes
10545 in typenames, fields or parameters. */
10546 if (type_quals
!= TYPE_UNQUALIFIED
)
10547 type_quals
= TYPE_UNQUALIFIED
;
10549 /* Special case: "friend class foo" looks like a TYPENAME context. */
10552 if (type_quals
!= TYPE_UNQUALIFIED
)
10554 cp_error ("type qualifiers specified for friend class declaration");
10555 type_quals
= TYPE_UNQUALIFIED
;
10559 cp_error ("`inline' specified for friend class declaration");
10563 /* Only try to do this stuff if we didn't already give up. */
10564 if (type
!= integer_type_node
)
10566 /* A friendly class? */
10567 if (current_class_type
)
10568 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10570 error ("trying to make class `%s' a friend of global scope",
10571 TYPE_NAME_STRING (type
));
10572 type
= void_type_node
;
10577 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10578 if (ctype
== NULL_TREE
)
10580 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10581 ctype
= TYPE_METHOD_BASETYPE (type
);
10583 grok_method_quals (ctype
, dummy
, quals
);
10584 type
= TREE_TYPE (dummy
);
10589 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10590 && decl_context
!= CATCHPARM
10591 && TREE_CODE (type
) != UNION_TYPE
10594 cp_error ("abstract declarator `%T' used as declaration", type
);
10595 declarator
= make_anon_name ();
10598 /* `void' at top level (not within pointer)
10599 is allowed only in typedefs or type names.
10600 We don't complain about parms either, but that is because
10601 a better error message can be made later. */
10603 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10606 error ("unnamed variable or field declared void");
10607 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10609 if (IDENTIFIER_OPNAME_P (declarator
))
10610 my_friendly_abort (356);
10612 error ("variable or field `%s' declared void", name
);
10615 error ("variable or field declared void");
10616 type
= integer_type_node
;
10619 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10620 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10622 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10624 if (ctype
|| in_namespace
)
10625 error ("cannot use `::' in parameter declaration");
10627 /* A parameter declared as an array of T is really a pointer to T.
10628 One declared as a function is really a pointer to a function.
10629 One declared as a member is really a pointer to member. */
10631 if (TREE_CODE (type
) == ARRAY_TYPE
)
10633 /* Transfer const-ness of array into that of type pointed to. */
10634 type
= build_pointer_type (TREE_TYPE (type
));
10635 type_quals
= TYPE_UNQUALIFIED
;
10637 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10638 type
= build_pointer_type (type
);
10639 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10640 type
= build_pointer_type (type
);
10641 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10643 error ("declaration of `%s' as void", name
);
10649 register tree decl
;
10651 if (decl_context
== PARM
)
10653 decl
= build_decl (PARM_DECL
, declarator
, type
);
10655 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10656 inlinep
, friendp
, raises
!= NULL_TREE
);
10658 /* Compute the type actually passed in the parmlist,
10659 for the case where there is no prototype.
10660 (For example, shorts and chars are passed as ints.)
10661 When there is a prototype, this is overridden later. */
10663 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10665 else if (decl_context
== FIELD
)
10667 if (type
== error_mark_node
)
10669 /* Happens when declaring arrays of sizes which
10670 are error_mark_node, for example. */
10673 else if (in_namespace
&& !friendp
)
10675 /* Something like struct S { int N::j; }; */
10676 cp_error ("invalid use of `::'");
10679 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10682 tree function_context
;
10684 /* We catch the others as conflicts with the builtin
10686 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10688 cp_error ("function `%D' cannot be declared friend",
10695 if (ctype
== NULL_TREE
)
10696 ctype
= current_class_type
;
10698 if (ctype
== NULL_TREE
)
10700 cp_error ("can't make `%D' into a method -- not in a class",
10702 return void_type_node
;
10705 /* ``A union may [ ... ] not [ have ] virtual functions.''
10707 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10709 cp_error ("function `%D' declared virtual inside a union",
10711 return void_type_node
;
10714 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10715 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10716 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10717 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10721 cp_error ("`%D' cannot be declared virtual, since it is always static",
10726 else if (staticp
< 2)
10727 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10728 TYPE_ARG_TYPES (type
));
10731 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10732 function_context
= (ctype
!= NULL_TREE
) ?
10733 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10734 publicp
= (! friendp
|| ! staticp
)
10735 && function_context
== NULL_TREE
;
10736 decl
= grokfndecl (ctype
, type
,
10737 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10738 ? declarator
: dname
,
10740 virtualp
, flags
, quals
, raises
,
10741 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10742 funcdef_flag
, template_count
, in_namespace
);
10743 if (decl
== NULL_TREE
)
10746 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10747 /* The decl and setting of decl_machine_attr is also turned off. */
10748 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10751 /* [class.conv.ctor]
10753 A constructor declared without the function-specifier
10754 explicit that can be called with a single parameter
10755 specifies a conversion from the type of its first
10756 parameter to the type of its class. Such a constructor
10757 is called a converting constructor. */
10758 if (explicitp
== 2)
10759 DECL_NONCONVERTING_P (decl
) = 1;
10760 else if (DECL_CONSTRUCTOR_P (decl
))
10762 /* The constructor can be called with exactly one
10763 parameter if there is at least one parameter, and
10764 any subsequent parameters have default arguments.
10765 We don't look at the first parameter, which is
10766 really just the `this' parameter for the new
10769 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10771 /* Skip the `in_chrg' argument too, if present. */
10772 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10773 arg_types
= TREE_CHAIN (arg_types
);
10775 if (arg_types
== void_list_node
10777 && TREE_CHAIN (arg_types
)
10778 && TREE_CHAIN (arg_types
) != void_list_node
10779 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10780 DECL_NONCONVERTING_P (decl
) = 1;
10783 else if (TREE_CODE (type
) == METHOD_TYPE
)
10785 /* We only get here for friend declarations of
10786 members of other classes. */
10787 /* All method decls are public, so tell grokfndecl to set
10788 TREE_PUBLIC, also. */
10789 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10790 virtualp
, flags
, quals
, raises
,
10791 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10792 template_count
, in_namespace
);
10793 if (decl
== NULL_TREE
)
10796 else if (!staticp
&& ! processing_template_decl
10797 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10798 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10801 cp_error ("field `%D' has incomplete type", declarator
);
10803 cp_error ("name `%T' has incomplete type", type
);
10805 /* If we're instantiating a template, tell them which
10806 instantiation made the field's type be incomplete. */
10807 if (current_class_type
10808 && TYPE_NAME (current_class_type
)
10809 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10810 && declspecs
&& TREE_VALUE (declspecs
)
10811 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10812 cp_error (" in instantiation of template `%T'",
10813 current_class_type
);
10815 type
= error_mark_node
;
10822 error ("`%s' is neither function nor method; cannot be declared friend",
10823 IDENTIFIER_POINTER (declarator
));
10831 /* Friends are treated specially. */
10832 if (ctype
== current_class_type
)
10833 warning ("member functions are implicitly friends of their class");
10836 tree t
= NULL_TREE
;
10837 if (decl
&& DECL_NAME (decl
))
10839 if (template_class_depth (current_class_type
) == 0)
10842 = check_explicit_specialization
10844 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10845 if (decl
== error_mark_node
)
10846 return error_mark_node
;
10849 t
= do_friend (ctype
, declarator
, decl
,
10850 last_function_parms
, attrlist
, flags
, quals
,
10853 if (t
&& funcdef_flag
)
10856 return void_type_node
;
10860 /* Structure field. It may not be a function, except for C++ */
10862 if (decl
== NULL_TREE
)
10868 /* An attempt is being made to initialize a non-static
10869 member. But, from [class.mem]:
10871 4 A member-declarator can contain a
10872 constant-initializer only if it declares a static
10873 member (_class.static_) of integral or enumeration
10874 type, see _class.static.data_.
10876 This used to be relatively common practice, but
10877 the rest of the compiler does not correctly
10878 handle the initialization unless the member is
10879 static so we make it static below. */
10880 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10882 cp_pedwarn ("making `%D' static", declarator
);
10886 if (uses_template_parms (type
))
10887 /* We'll check at instantiation time. */
10889 else if (check_static_variable_definition (declarator
,
10891 /* If we just return the declaration, crashes
10892 will sometimes occur. We therefore return
10893 void_type_node, as if this was a friend
10894 declaration, to cause callers to completely
10895 ignore this declaration. */
10896 return void_type_node
;
10899 /* 9.2p13 [class.mem] */
10900 if (declarator
== constructor_name (current_class_type
)
10901 /* Divergence from the standard: In extern "C", we
10902 allow non-static data members here, because C does
10903 and /usr/include/netinet/in.h uses that. */
10904 && (staticp
|| ! in_system_header
))
10905 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10910 /* C++ allows static class members. All other work
10911 for this is done by grokfield. */
10912 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10913 TREE_STATIC (decl
) = 1;
10914 /* In class context, 'static' means public access. */
10915 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10919 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10920 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10922 DECL_MUTABLE_P (decl
) = 1;
10923 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10927 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10928 inlinep
, friendp
, raises
!= NULL_TREE
);
10931 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10933 tree original_name
;
10939 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10940 original_name
= dname
;
10942 original_name
= declarator
;
10944 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10945 error ("storage class `auto' invalid for function `%s'", name
);
10946 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10947 error ("storage class `register' invalid for function `%s'", name
);
10949 /* Function declaration not at top level.
10950 Storage classes other than `extern' are not allowed
10951 and `extern' makes no difference. */
10952 if (! toplevel_bindings_p ()
10953 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10954 || RIDBIT_SETP (RID_INLINE
, specbits
))
10957 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10958 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
10960 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
10963 if (ctype
== NULL_TREE
)
10967 error ("virtual non-class function `%s'", name
);
10971 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
10972 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10973 TYPE_ARG_TYPES (type
));
10975 /* Record presence of `static'. */
10976 publicp
= (ctype
!= NULL_TREE
10977 || RIDBIT_SETP (RID_EXTERN
, specbits
)
10978 || !RIDBIT_SETP (RID_STATIC
, specbits
));
10980 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
10981 virtualp
, flags
, quals
, raises
,
10983 publicp
, inlinep
, funcdef_flag
,
10984 template_count
, in_namespace
);
10985 if (decl
== NULL_TREE
)
10990 int illegal_static
= 0;
10992 /* Don't allow a static member function in a class, and forbid
10993 declaring main to be static. */
10994 if (TREE_CODE (type
) == METHOD_TYPE
)
10996 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
10997 illegal_static
= 1;
10999 else if (current_function_decl
)
11001 /* FIXME need arm citation */
11002 error ("cannot declare static function inside another function");
11003 illegal_static
= 1;
11006 if (illegal_static
)
11009 RIDBIT_RESET (RID_STATIC
, specbits
);
11015 /* It's a variable. */
11017 /* An uninitialized decl with `extern' is a reference. */
11018 decl
= grokvardecl (type
, declarator
, &specbits
,
11020 (type_quals
& TYPE_QUAL_CONST
) != 0,
11022 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11023 inlinep
, friendp
, raises
!= NULL_TREE
);
11027 DECL_CONTEXT (decl
) = ctype
;
11030 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11032 RIDBIT_RESET (RID_STATIC
, specbits
);
11034 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11036 cp_error ("static member `%D' declared `register'", decl
);
11037 RIDBIT_RESET (RID_REGISTER
, specbits
);
11039 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11041 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11043 RIDBIT_RESET (RID_EXTERN
, specbits
);
11048 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11050 /* Record `register' declaration for warnings on &
11051 and in case doing stupid register allocation. */
11053 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11054 DECL_REGISTER (decl
) = 1;
11056 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11057 DECL_THIS_EXTERN (decl
) = 1;
11059 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11060 DECL_THIS_STATIC (decl
) = 1;
11062 /* Record constancy and volatility. There's no need to do this
11063 when processing a template; we'll do this for the instantiated
11064 declaration based on the type of DECL. */
11065 if (!processing_template_decl
)
11066 c_apply_type_quals_to_decl (type_quals
, decl
);
11072 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11073 An empty exprlist is a parmlist. An exprlist which
11074 contains only identifiers at the global level
11075 is a parmlist. Otherwise, it is an exprlist. */
11078 parmlist_is_exprlist (exprs
)
11081 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11084 if (toplevel_bindings_p ())
11086 /* At the global level, if these are all identifiers,
11087 then it is a parmlist. */
11090 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11092 exprs
= TREE_CHAIN (exprs
);
11099 /* Subroutine of start_function. Ensure that each of the parameter
11100 types (as listed in PARMS) is complete, as is required for a
11101 function definition. */
11104 require_complete_types_for_parms (parms
)
11109 tree type
= TREE_TYPE (parms
);
11110 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11112 if (DECL_NAME (parms
))
11113 error ("parameter `%s' has incomplete type",
11114 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11116 error ("parameter has incomplete type");
11117 TREE_TYPE (parms
) = error_mark_node
;
11120 layout_decl (parms
, 0);
11122 parms
= TREE_CHAIN (parms
);
11126 /* Returns non-zero if T is a local variable. */
11129 local_variable_p (t
)
11132 if ((TREE_CODE (t
) == VAR_DECL
11133 /* A VAR_DECL with a context that is a _TYPE is a static data
11135 && !TYPE_P (CP_DECL_CONTEXT (t
))
11136 /* Any other non-local variable must be at namespace scope. */
11137 && !DECL_NAMESPACE_SCOPE_P (t
))
11138 || (TREE_CODE (t
) == PARM_DECL
))
11144 /* Returns non-zero if T is an automatic local variable or a label.
11145 (These are the declarations that need to be remapped when the code
11146 containing them is duplicated.) */
11149 nonstatic_local_decl_p (t
)
11152 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11153 || TREE_CODE (t
) == LABEL_DECL
11154 || TREE_CODE (t
) == RESULT_DECL
);
11157 /* Like local_variable_p, but suitable for use as a tree-walking
11161 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11163 int *walk_subtrees ATTRIBUTE_UNUSED
;
11164 void *data ATTRIBUTE_UNUSED
;
11166 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11167 ? *tp
: NULL_TREE
);
11170 /* Check that ARG, which is a default-argument expression for a
11171 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11172 something goes wrong. DECL may also be a _TYPE node, rather than a
11173 DECL, if there is no DECL available. */
11176 check_default_argument (decl
, arg
)
11183 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11184 /* We get a DEFAULT_ARG when looking at an in-class declaration
11185 with a default argument. Ignore the argument for now; we'll
11186 deal with it after the class is complete. */
11189 if (processing_template_decl
|| uses_template_parms (arg
))
11190 /* We don't do anything checking until instantiation-time. Note
11191 that there may be uninstantiated arguments even for an
11192 instantiated function, since default arguments are not
11193 instantiated until they are needed. */
11202 decl_type
= TREE_TYPE (decl
);
11204 if (arg
== error_mark_node
11205 || decl
== error_mark_node
11206 || TREE_TYPE (arg
) == error_mark_node
11207 || decl_type
== error_mark_node
)
11208 /* Something already went wrong. There's no need to check
11210 return error_mark_node
;
11212 /* [dcl.fct.default]
11214 A default argument expression is implicitly converted to the
11216 if (!TREE_TYPE (arg
)
11217 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11220 cp_error ("default argument for `%#D' has type `%T'",
11221 decl
, TREE_TYPE (arg
));
11223 cp_error ("default argument for parameter of type `%T' has type `%T'",
11224 decl_type
, TREE_TYPE (arg
));
11226 return error_mark_node
;
11229 /* [dcl.fct.default]
11231 Local variables shall not be used in default argument
11234 The keyword `this' shall not be used in a default argument of a
11235 member function. */
11236 var
= walk_tree (&arg
, local_variable_p_walkfn
, NULL
);
11239 cp_error ("default argument `%E' uses local variable `%D'",
11241 return error_mark_node
;
11248 /* Decode the list of parameter types for a function type.
11249 Given the list of things declared inside the parens,
11250 return a list of types.
11252 The list we receive can have three kinds of elements:
11253 an IDENTIFIER_NODE for names given without types,
11254 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11255 or void_type_node, to mark the end of an argument list
11256 when additional arguments are not permitted (... was not used).
11258 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11259 a mere declaration. A nonempty identifier-list gets an error message
11260 when FUNCDEF_FLAG is zero.
11261 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11262 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11264 If all elements of the input list contain types,
11265 we return a list of the types.
11266 If all elements contain no type (except perhaps a void_type_node
11267 at the end), we return a null list.
11268 If some have types and some do not, it is an error, and we
11269 return a null list.
11271 Also set last_function_parms to either
11272 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11273 A list of names is converted to a chain of PARM_DECLs
11274 by store_parm_decls so that ultimately it is always a chain of decls.
11276 Note that in C++, parameters can take default values. These default
11277 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11278 an error to specify default values which are followed by parameters
11279 that have no default values, or an ELLIPSES. For simplicities sake,
11280 only parameters which are specified with their types can take on
11284 grokparms (first_parm
, funcdef_flag
)
11288 tree result
= NULL_TREE
;
11289 tree decls
= NULL_TREE
;
11291 if (first_parm
!= NULL_TREE
11292 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11294 if (! funcdef_flag
)
11295 pedwarn ("parameter names (without types) in function declaration");
11296 last_function_parms
= first_parm
;
11299 else if (first_parm
!= NULL_TREE
11300 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11301 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11302 my_friendly_abort (145);
11305 /* Types were specified. This is a list of declarators
11306 each represented as a TREE_LIST node. */
11307 register tree parm
, chain
;
11308 int any_init
= 0, any_error
= 0;
11310 if (first_parm
!= NULL_TREE
)
11312 tree last_result
= NULL_TREE
;
11313 tree last_decl
= NULL_TREE
;
11315 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11317 tree type
= NULL_TREE
, list_node
= parm
;
11318 register tree decl
= TREE_VALUE (parm
);
11319 tree init
= TREE_PURPOSE (parm
);
11321 chain
= TREE_CHAIN (parm
);
11322 /* @@ weak defense against parse errors. */
11323 if (TREE_CODE (decl
) != VOID_TYPE
11324 && TREE_CODE (decl
) != TREE_LIST
)
11326 /* Give various messages as the need arises. */
11327 if (TREE_CODE (decl
) == STRING_CST
)
11328 cp_error ("invalid string constant `%E'", decl
);
11329 else if (TREE_CODE (decl
) == INTEGER_CST
)
11330 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11334 if (TREE_CODE (decl
) != VOID_TYPE
)
11336 decl
= grokdeclarator (TREE_VALUE (decl
),
11337 TREE_PURPOSE (decl
),
11338 PARM
, init
!= NULL_TREE
,
11340 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11343 /* Top-level qualifiers on the parameters are
11344 ignored for function types. */
11345 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11347 if (TREE_CODE (type
) == VOID_TYPE
)
11348 decl
= void_type_node
;
11349 else if (TREE_CODE (type
) == METHOD_TYPE
)
11351 if (DECL_NAME (decl
))
11352 /* Cannot use the decl here because
11353 we don't have DECL_CONTEXT set up yet. */
11354 cp_error ("parameter `%D' invalidly declared method type",
11357 error ("parameter invalidly declared method type");
11358 type
= build_pointer_type (type
);
11359 TREE_TYPE (decl
) = type
;
11361 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11363 if (DECL_NAME (decl
))
11364 cp_error ("parameter `%D' invalidly declared offset type",
11367 error ("parameter invalidly declared offset type");
11368 type
= build_pointer_type (type
);
11369 TREE_TYPE (decl
) = type
;
11371 else if (abstract_virtuals_error (decl
, type
))
11372 any_error
= 1; /* Seems like a good idea. */
11373 else if (POINTER_TYPE_P (type
))
11376 while (POINTER_TYPE_P (t
)
11377 || (TREE_CODE (t
) == ARRAY_TYPE
11378 && TYPE_DOMAIN (t
) != NULL_TREE
))
11380 if (TREE_CODE (t
) == ARRAY_TYPE
)
11381 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11383 TYPE_PTR_P (type
) ? "pointer" : "reference");
11387 if (TREE_CODE (decl
) == VOID_TYPE
)
11389 if (result
== NULL_TREE
)
11391 result
= void_list_node
;
11392 last_result
= result
;
11396 TREE_CHAIN (last_result
) = void_list_node
;
11397 last_result
= void_list_node
;
11400 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11401 error ("`void' in parameter list must be entire list");
11405 /* Since there is a prototype, args are passed in their own types. */
11406 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11407 if (PROMOTE_PROTOTYPES
11408 && (TREE_CODE (type
) == INTEGER_TYPE
11409 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11410 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11411 DECL_ARG_TYPE (decl
) = integer_type_node
;
11412 if (!any_error
&& init
)
11415 init
= check_default_argument (decl
, init
);
11420 if (decls
== NULL_TREE
)
11427 TREE_CHAIN (last_decl
) = decl
;
11430 list_node
= tree_cons (init
, type
, NULL_TREE
);
11431 if (result
== NULL_TREE
)
11433 result
= list_node
;
11434 last_result
= result
;
11438 TREE_CHAIN (last_result
) = list_node
;
11439 last_result
= list_node
;
11443 TREE_CHAIN (last_result
) = NULL_TREE
;
11444 /* If there are no parameters, and the function does not end
11445 with `...', then last_decl will be NULL_TREE. */
11446 if (last_decl
!= NULL_TREE
)
11447 TREE_CHAIN (last_decl
) = NULL_TREE
;
11451 last_function_parms
= decls
;
11456 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11457 FUNCTION_TYPE with the newly parsed version of its default argument, which
11458 was previously digested as text. See snarf_defarg et al in lex.c. */
11461 replace_defarg (arg
, init
)
11464 if (! processing_template_decl
11465 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11466 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11467 TREE_TYPE (init
), TREE_VALUE (arg
));
11468 TREE_PURPOSE (arg
) = init
;
11475 tree t
= FUNCTION_ARG_CHAIN (d
);
11476 if (DECL_CONSTRUCTOR_P (d
)
11477 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11478 t
= TREE_CHAIN (t
);
11479 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11480 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11481 == DECL_CLASS_CONTEXT (d
))
11482 && (TREE_CHAIN (t
) == NULL_TREE
11483 || TREE_CHAIN (t
) == void_list_node
11484 || TREE_PURPOSE (TREE_CHAIN (t
))))
11489 /* These memoizing functions keep track of special properties which
11490 a class may have. `grok_ctor_properties' notices whether a class
11491 has a constructor of the form X(X&), and also complains
11492 if the class has a constructor of the form X(X).
11493 `grok_op_properties' takes notice of the various forms of
11494 operator= which are defined, as well as what sorts of type conversion
11495 may apply. Both functions take a FUNCTION_DECL as an argument. */
11498 grok_ctor_properties (ctype
, decl
)
11501 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11502 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11504 /* When a type has virtual baseclasses, a magical first int argument is
11505 added to any ctor so we can tell if the class has been initialized
11506 yet. This could screw things up in this function, so we deliberately
11507 ignore the leading int if we're in that situation. */
11508 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11510 my_friendly_assert (parmtypes
11511 && TREE_VALUE (parmtypes
) == integer_type_node
,
11513 parmtypes
= TREE_CHAIN (parmtypes
);
11514 parmtype
= TREE_VALUE (parmtypes
);
11519 A non-template constructor for class X is a copy constructor if
11520 its first parameter is of type X&, const X&, volatile X& or const
11521 volatile X&, and either there are no other parameters or else all
11522 other parameters have default arguments. */
11523 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11524 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11525 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11526 || TREE_CHAIN (parmtypes
) == void_list_node
11527 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11528 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11529 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11531 TYPE_HAS_INIT_REF (ctype
) = 1;
11532 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11533 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11537 A declaration of a constructor for a class X is ill-formed if its
11538 first parameter is of type (optionally cv-qualified) X and either
11539 there are no other parameters or else all other parameters have
11542 We *don't* complain about member template instantiations that
11543 have this form, though; they can occur as we try to decide what
11544 constructor to use during overload resolution. Since overload
11545 resolution will never prefer such a constructor to the
11546 non-template copy constructor (which is either explicitly or
11547 implicitly defined), there's no need to worry about their
11548 existence. Theoretically, they should never even be
11549 instantiated, but that's hard to forestall. */
11550 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11551 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11552 || TREE_CHAIN (parmtypes
) == void_list_node
11553 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11554 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11555 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11557 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11559 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11562 else if (TREE_CODE (parmtype
) == VOID_TYPE
11563 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11564 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11569 /* An operator with this name can be either unary or binary. */
11575 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11576 || name
== ansi_opname
[(int) ADDR_EXPR
]
11577 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11578 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11579 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11580 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11583 /* An operator with this name can only be unary. */
11589 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11590 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11591 || name
== ansi_opname
[(int) COMPONENT_REF
]
11592 || IDENTIFIER_TYPENAME_P (name
));
11595 /* Do a little sanity-checking on how they declared their operator. */
11598 grok_op_properties (decl
, virtualp
, friendp
)
11600 int virtualp
, friendp
;
11602 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11603 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11604 tree name
= DECL_NAME (decl
);
11606 if (current_class_type
== NULL_TREE
)
11613 A user-declared copy assignment operator X::operator= is a
11614 non-static non-template member function of class X with
11615 exactly one parameter of type X, X&, const X&, volatile X& or
11616 const volatile X&. */
11617 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11618 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11619 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11621 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11622 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11623 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11624 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11625 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11626 || name
== ansi_opname
[(int) MEMBER_REF
])
11627 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11628 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11629 TYPE_GETS_NEW (current_class_type
) |= 1;
11630 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11631 TYPE_GETS_DELETE (current_class_type
) |= 1;
11632 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11633 TYPE_GETS_NEW (current_class_type
) |= 2;
11634 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11635 TYPE_GETS_DELETE (current_class_type
) |= 2;
11638 if (name
== ansi_opname
[(int) NEW_EXPR
]
11639 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11641 /* When the compiler encounters the definition of A::operator new, it
11642 doesn't look at the class declaration to find out if it's static. */
11644 revert_static_member_fn (&decl
, NULL
, NULL
);
11646 /* Take care of function decl if we had syntax errors. */
11647 if (argtypes
== NULL_TREE
)
11649 = build_function_type (ptr_type_node
,
11650 hash_tree_chain (integer_type_node
,
11653 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11655 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11656 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11659 revert_static_member_fn (&decl
, NULL
, NULL
);
11661 if (argtypes
== NULL_TREE
)
11663 = build_function_type (void_type_node
,
11664 hash_tree_chain (ptr_type_node
,
11668 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11670 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11671 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11672 != void_list_node
))
11673 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11678 /* An operator function must either be a non-static member function
11679 or have at least one parameter of a class, a reference to a class,
11680 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11681 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11683 if (IDENTIFIER_TYPENAME_P (name
)
11684 || name
== ansi_opname
[(int) CALL_EXPR
]
11685 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11686 || name
== ansi_opname
[(int) COMPONENT_REF
]
11687 || name
== ansi_opname
[(int) ARRAY_REF
])
11688 cp_error ("`%D' must be a nonstatic member function", decl
);
11693 if (DECL_STATIC_FUNCTION_P (decl
))
11694 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11697 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11699 tree arg
= TREE_VALUE (p
);
11700 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11701 arg
= TREE_TYPE (arg
);
11703 /* This lets bad template code slip through. */
11704 if (IS_AGGR_TYPE (arg
)
11705 || TREE_CODE (arg
) == ENUMERAL_TYPE
11706 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11707 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11711 ("`%D' must have an argument of class or enumerated type",
11718 if (name
== ansi_opname
[(int) CALL_EXPR
])
11719 return; /* No restrictions on args. */
11721 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11723 tree t
= TREE_TYPE (name
);
11724 if (TREE_CODE (t
) == VOID_TYPE
)
11725 pedwarn ("void is not a valid type conversion operator");
11726 else if (! friendp
)
11728 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11729 const char *what
= 0;
11731 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11733 if (t
== current_class_type
)
11734 what
= "the same type";
11735 /* Don't force t to be complete here. */
11736 else if (IS_AGGR_TYPE (t
)
11738 && DERIVED_FROM_P (t
, current_class_type
))
11739 what
= "a base class";
11742 warning ("conversion to %s%s will never use a type conversion operator",
11743 ref
? "a reference to " : "", what
);
11747 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11751 if (list_length (argtypes
) != 3 && methodp
)
11753 cp_error ("`%D' must take exactly one argument", decl
);
11756 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11758 if (copy_assignment_arg_p (parmtype
, virtualp
)
11761 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11762 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11763 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11764 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11767 else if (name
== ansi_opname
[(int) COND_EXPR
])
11770 cp_error ("ANSI C++ prohibits overloading operator ?:");
11772 else if (ambi_op_p (name
))
11774 if (list_length (argtypes
) == 2)
11776 else if (list_length (argtypes
) == 3)
11778 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11779 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11780 && ! processing_template_decl
11781 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11784 cp_error ("postfix `%D' must take `int' as its argument",
11788 ("postfix `%D' must take `int' as its second argument",
11795 cp_error ("`%D' must take either zero or one argument", decl
);
11797 cp_error ("`%D' must take either one or two arguments", decl
);
11800 /* More Effective C++ rule 6. */
11802 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11803 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11805 tree arg
= TREE_VALUE (argtypes
);
11806 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11807 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11808 arg
= TREE_TYPE (arg
);
11809 arg
= TYPE_MAIN_VARIANT (arg
);
11810 if (list_length (argtypes
) == 2)
11812 if (TREE_CODE (ret
) != REFERENCE_TYPE
11813 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11815 cp_warning ("prefix `%D' should return `%T'", decl
,
11816 build_reference_type (arg
));
11820 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11821 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11825 else if (unary_op_p (name
))
11827 if (list_length (argtypes
) != 2)
11830 cp_error ("`%D' must take `void'", decl
);
11832 cp_error ("`%D' must take exactly one argument", decl
);
11835 else /* if (binary_op_p (name)) */
11837 if (list_length (argtypes
) != 3)
11840 cp_error ("`%D' must take exactly one argument", decl
);
11842 cp_error ("`%D' must take exactly two arguments", decl
);
11845 /* More Effective C++ rule 7. */
11847 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11848 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11849 || name
== ansi_opname
[COMPOUND_EXPR
]))
11850 cp_warning ("user-defined `%D' always evaluates both arguments",
11854 /* Effective C++ rule 23. */
11856 && list_length (argtypes
) == 3
11857 && (name
== ansi_opname
[PLUS_EXPR
]
11858 || name
== ansi_opname
[MINUS_EXPR
]
11859 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11860 || name
== ansi_opname
[MULT_EXPR
])
11861 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11862 cp_warning ("`%D' should return by value", decl
);
11866 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11867 if (TREE_PURPOSE (argtypes
))
11869 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11870 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11871 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11874 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11877 cp_error ("`%D' cannot have default arguments", decl
);
11882 static const char *
11884 enum tag_types code
;
11897 my_friendly_abort (981122);
11901 /* Get the struct, enum or union (CODE says which) with tag NAME.
11902 Define the tag as a forward-reference if it is not defined.
11904 C++: If a class derivation is given, process it here, and report
11905 an error if multiple derivation declarations are not identical.
11907 If this is a definition, come in through xref_tag and only look in
11908 the current frame for the name (since C++ allows new names in any
11912 xref_tag (code_type_node
, name
, globalize
)
11913 tree code_type_node
;
11917 enum tag_types tag_code
;
11918 enum tree_code code
;
11919 register tree ref
, t
;
11920 struct binding_level
*b
= current_binding_level
;
11922 tree attributes
= NULL_TREE
;
11923 tree context
= NULL_TREE
;
11925 /* If we are called from the parser, code_type_node will sometimes be a
11926 TREE_LIST. This indicates that the user wrote
11927 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11929 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11931 attributes
= TREE_PURPOSE (code_type_node
);
11932 code_type_node
= TREE_VALUE (code_type_node
);
11935 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11940 code
= RECORD_TYPE
;
11946 code
= ENUMERAL_TYPE
;
11949 my_friendly_abort (18);
11952 /* If a cross reference is requested, look up the type
11953 already defined for this tag and return it. */
11954 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11957 name
= TYPE_IDENTIFIER (t
);
11961 t
= IDENTIFIER_TYPE_VALUE (name
);
11963 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11964 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11969 /* If we know we are defining this tag, only look it up in
11970 this scope and don't try to find it as a type. */
11971 ref
= lookup_tag (code
, name
, b
, 1);
11977 /* [dcl.type.elab] If the identifier resolves to a
11978 typedef-name or a template type-parameter, the
11979 elaborated-type-specifier is ill-formed. */
11980 if (t
!= TYPE_MAIN_VARIANT (t
)
11981 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
11982 cp_pedwarn ("using typedef-name `%D' after `%s'",
11983 TYPE_NAME (t
), tag_name (tag_code
));
11984 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
11985 cp_error ("using template type parameter `%T' after `%s'",
11986 t
, tag_name (tag_code
));
11991 ref
= lookup_tag (code
, name
, b
, 0);
11995 /* Try finding it as a type declaration. If that wins,
11997 ref
= lookup_name (name
, 1);
11999 if (ref
!= NULL_TREE
12000 && processing_template_decl
12001 && DECL_CLASS_TEMPLATE_P (ref
)
12002 && template_class_depth (current_class_type
) == 0)
12003 /* Since GLOBALIZE is true, we're declaring a global
12004 template, so we want this type. */
12005 ref
= DECL_RESULT (ref
);
12007 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12008 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12009 ref
= TREE_TYPE (ref
);
12014 if (ref
&& current_class_type
12015 && template_class_depth (current_class_type
)
12016 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12018 /* Since GLOBALIZE is non-zero, we are not looking at a
12019 definition of this tag. Since, in addition, we are currently
12020 processing a (member) template declaration of a template
12021 class, we must be very careful; consider:
12028 { template <class V>
12029 friend struct S1; };
12031 Here, the S2::S1 declaration should not be confused with the
12032 outer declaration. In particular, the inner version should
12033 have a template parameter of level 2, not level 1. This
12034 would be particularly important if the member declaration
12037 template <class V = U> friend struct S1;
12039 say, when we should tsubst into `U' when instantiating
12040 S2. On the other hand, when presented with:
12050 we must find the inner binding eventually. We
12051 accomplish this by making sure that the new type we
12052 create to represent this declaration has the right
12054 context
= TYPE_CONTEXT (ref
);
12061 /* If no such tag is yet defined, create a forward-reference node
12062 and record it as the "definition".
12063 When a real declaration of this type is found,
12064 the forward-reference will be altered into a real type. */
12065 if (code
== ENUMERAL_TYPE
)
12067 cp_error ("use of enum `%#D' without previous declaration", name
);
12069 ref
= make_node (ENUMERAL_TYPE
);
12071 /* Give the type a default layout like unsigned int
12072 to avoid crashing if it does not get defined. */
12073 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12074 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12075 TREE_UNSIGNED (ref
) = 1;
12076 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12077 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12078 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12080 /* Enable us to recognize when a type is created in class context.
12081 To do nested classes correctly, this should probably be cleared
12082 out when we leave this classes scope. Currently this in only
12083 done in `start_enum'. */
12085 pushtag (name
, ref
, globalize
);
12089 struct binding_level
*old_b
= class_binding_level
;
12091 ref
= make_lang_type (code
);
12092 TYPE_CONTEXT (ref
) = context
;
12094 #ifdef NONNESTED_CLASSES
12095 /* Class types don't nest the way enums do. */
12096 class_binding_level
= (struct binding_level
*)0;
12098 pushtag (name
, ref
, globalize
);
12099 class_binding_level
= old_b
;
12104 /* If it no longer looks like a nested type, make sure it's
12106 If it is not an IDENTIFIER, this is not a declaration */
12107 if (b
->namespace_p
&& !class_binding_level
12108 && TREE_CODE (name
) == IDENTIFIER_NODE
12109 && IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12110 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12112 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12113 redeclare_class_template (ref
, current_template_parms
);
12116 /* Until the type is defined, tentatively accept whatever
12117 structure tag the user hands us. */
12118 if (TYPE_SIZE (ref
) == NULL_TREE
12119 && ref
!= current_class_type
12120 /* Have to check this, in case we have contradictory tag info. */
12121 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12123 if (tag_code
== class_type
)
12124 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12125 else if (tag_code
== record_type
)
12126 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12129 TREE_TYPE (ref
) = attributes
;
12135 xref_tag_from_type (old
, id
, globalize
)
12139 tree code_type_node
;
12141 if (TREE_CODE (old
) == RECORD_TYPE
)
12142 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12143 ? class_type_node
: record_type_node
);
12145 code_type_node
= union_type_node
;
12147 if (id
== NULL_TREE
)
12148 id
= TYPE_IDENTIFIER (old
);
12150 return xref_tag (code_type_node
, id
, globalize
);
12153 /* REF is a type (named NAME), for which we have just seen some
12154 baseclasses. BINFO is a list of those baseclasses; the
12155 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12156 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12157 struct, or union. */
12160 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12161 tree code_type_node
;
12165 /* In the declaration `A : X, Y, ... Z' we mark all the types
12166 (A, X, Y, ..., Z) so we can check for duplicates. */
12171 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12173 if (tag_code
== union_type
)
12175 cp_error ("derived union `%T' invalid", ref
);
12179 len
= list_length (binfo
);
12181 /* First, make sure that any templates in base-classes are
12182 instantiated. This ensures that if we call ourselves recursively
12183 we do not get confused about which classes are marked and which
12185 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12186 complete_type (TREE_VALUE (base
));
12188 SET_CLASSTYPE_MARKED (ref
);
12189 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12191 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12193 /* The base of a derived struct is public by default. */
12195 = (TREE_PURPOSE (binfo
) == access_public_node
12196 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12197 || (tag_code
!= class_type
12198 && (TREE_PURPOSE (binfo
) == access_default_node
12199 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12201 = (TREE_PURPOSE (binfo
) == access_protected_node
12202 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12204 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12205 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12206 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12207 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12208 tree basetype
= TREE_VALUE (binfo
);
12211 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12212 basetype
= TREE_TYPE (basetype
);
12214 || (TREE_CODE (basetype
) != RECORD_TYPE
12215 && TREE_CODE (basetype
) != TYPENAME_TYPE
12216 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12217 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12219 cp_error ("base type `%T' fails to be a struct or class type",
12220 TREE_VALUE (binfo
));
12224 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12226 /* This code replaces similar code in layout_basetypes.
12227 We put the complete_type first for implicit `typename'. */
12228 if (TYPE_SIZE (basetype
) == NULL_TREE
12229 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12231 cp_error ("base class `%T' has incomplete type", basetype
);
12236 if (CLASSTYPE_MARKED (basetype
))
12238 if (basetype
== ref
)
12239 cp_error ("recursive type `%T' undefined", basetype
);
12241 cp_error ("duplicate base type `%T' invalid", basetype
);
12245 if (TYPE_FOR_JAVA (basetype
)
12246 && (current_lang_stack
12247 == &VARRAY_TREE (current_lang_base
, 0)))
12248 TYPE_FOR_JAVA (ref
) = 1;
12250 /* Note that the BINFO records which describe individual
12251 inheritances are *not* shared in the lattice! They
12252 cannot be shared because a given baseclass may be
12253 inherited with different `accessibility' by different
12254 derived classes. (Each BINFO record describing an
12255 individual inheritance contains flags which say what
12256 the `accessibility' of that particular inheritance is.) */
12259 = make_binfo (integer_zero_node
, basetype
,
12260 CLASS_TYPE_P (basetype
)
12261 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12262 CLASS_TYPE_P (basetype
)
12263 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12265 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12266 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12267 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12268 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12269 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12271 /* We need to unshare the binfos now so that lookups during class
12272 definition work. */
12273 unshare_base_binfos (base_binfo
);
12275 SET_CLASSTYPE_MARKED (basetype
);
12277 /* We are free to modify these bits because they are meaningless
12278 at top level, and BASETYPE is a top-level type. */
12279 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12281 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12282 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12285 if (CLASS_TYPE_P (basetype
))
12287 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12288 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12295 TREE_VEC_LENGTH (binfos
) = i
;
12297 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12300 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12303 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12305 if (CLASS_TYPE_P (basetype
))
12306 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12307 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12310 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12311 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12313 /* Unmark all the types. */
12315 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12316 CLEAR_CLASSTYPE_MARKED (ref
);
12318 /* Now that we know all the base-classes, set up the list of virtual
12320 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12324 /* Begin compiling the definition of an enumeration type.
12325 NAME is its name (or null if anonymous).
12326 Returns the type object, as yet incomplete.
12327 Also records info about it so that build_enumerator
12328 may be used to declare the individual values as they are read. */
12334 register tree enumtype
= NULL_TREE
;
12335 struct binding_level
*b
= current_binding_level
;
12337 /* If this is the real definition for a previous forward reference,
12338 fill in the contents in the same object that used to be the
12339 forward reference. */
12341 if (name
!= NULL_TREE
)
12342 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12344 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12346 cp_error ("multiple definition of `%#T'", enumtype
);
12347 cp_error_at ("previous definition here", enumtype
);
12348 /* Clear out TYPE_VALUES, and start again. */
12349 TYPE_VALUES (enumtype
) = NULL_TREE
;
12353 enumtype
= make_node (ENUMERAL_TYPE
);
12354 pushtag (name
, enumtype
, 0);
12357 if (current_class_type
)
12358 TREE_ADDRESSABLE (b
->tags
) = 1;
12360 GNU_xref_decl (current_function_decl
, enumtype
);
12364 /* After processing and defining all the values of an enumeration type,
12365 install their decls in the enumeration type and finish it off.
12366 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12367 Returns ENUMTYPE. */
12370 finish_enum (enumtype
)
12373 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12374 /* Calculate the maximum value of any enumerator in this type. */
12376 tree values
= TYPE_VALUES (enumtype
);
12381 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12386 /* The TREE_VALUE is a CONST_DECL for this enumeration
12388 decl
= TREE_VALUE (pair
);
12392 Following the closing brace of an enum-specifier, each
12393 enumerator has the type of its enumeration. Prior to the
12394 closing brace, the type of each enumerator is the type of
12395 its initializing value. */
12396 TREE_TYPE (decl
) = enumtype
;
12398 /* The DECL_INITIAL will be NULL if we are processing a
12399 template declaration and this enumeration constant had no
12400 explicit initializer. */
12401 value
= DECL_INITIAL (decl
);
12402 if (value
&& !processing_template_decl
)
12404 /* Set the TREE_TYPE for the VALUE as well. That's so
12405 that when we call decl_constant_value we get an
12406 entity of the right type (but with the constant
12407 value). Since we shouldn't ever call
12408 decl_constant_value on a template type, there's no
12409 reason to do that when processing_template_decl.
12410 And, if the expression is something like a
12411 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12412 wreak havoc on the intended type of the expression.
12414 Of course, there's also no point in trying to compute
12415 minimum or maximum values if we're in a template. */
12416 TREE_TYPE (value
) = enumtype
;
12419 minnode
= maxnode
= value
;
12420 else if (tree_int_cst_lt (maxnode
, value
))
12422 else if (tree_int_cst_lt (value
, minnode
))
12426 if (processing_template_decl
)
12427 /* If this is just a template, leave the CONST_DECL
12428 alone. That way tsubst_copy will find CONST_DECLs for
12429 CONST_DECLs, and not INTEGER_CSTs. */
12432 /* In the list we're building up, we want the enumeration
12433 values, not the CONST_DECLs. */
12434 TREE_VALUE (pair
) = value
;
12438 maxnode
= minnode
= integer_zero_node
;
12440 TYPE_VALUES (enumtype
) = nreverse (values
);
12442 if (processing_template_decl
)
12444 tree scope
= current_scope ();
12445 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12446 add_tree (build_min (TAG_DEFN
, enumtype
));
12450 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12451 int lowprec
= min_precision (minnode
, unsignedp
);
12452 int highprec
= min_precision (maxnode
, unsignedp
);
12453 int precision
= MAX (lowprec
, highprec
);
12456 TYPE_SIZE (enumtype
) = NULL_TREE
;
12458 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12460 TYPE_PRECISION (enumtype
) = precision
;
12462 fixup_unsigned_type (enumtype
);
12464 fixup_signed_type (enumtype
);
12466 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12467 /* Use the width of the narrowest normal C type which is wide
12469 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12472 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12474 TYPE_SIZE (enumtype
) = 0;
12475 layout_type (enumtype
);
12477 /* Fix up all variant types of this enum type. */
12478 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12479 tem
= TYPE_NEXT_VARIANT (tem
))
12481 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12482 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12483 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12484 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12485 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12486 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12487 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12488 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12489 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12492 /* Finish debugging output for this type. */
12493 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12499 /* Build and install a CONST_DECL for an enumeration constant of the
12500 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
12501 Assignment of sequential values by default is handled here. */
12504 build_enumerator (name
, value
, enumtype
)
12514 /* Remove no-op casts from the value. */
12516 STRIP_TYPE_NOPS (value
);
12518 if (! processing_template_decl
)
12520 /* Validate and default VALUE. */
12521 if (value
!= NULL_TREE
)
12523 if (TREE_READONLY_DECL_P (value
))
12524 value
= decl_constant_value (value
);
12526 if (TREE_CODE (value
) == INTEGER_CST
)
12528 value
= default_conversion (value
);
12529 constant_expression_warning (value
);
12533 cp_error ("enumerator value for `%D' not integer constant", name
);
12538 /* Default based on previous value. */
12539 if (value
== NULL_TREE
&& ! processing_template_decl
)
12543 if (TYPE_VALUES (enumtype
))
12545 /* The next value is the previous value ... */
12546 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
12547 /* ... plus one. */
12548 value
= build_binary_op_nodefault (PLUS_EXPR
,
12553 if (tree_int_cst_lt (value
, prev_value
))
12554 cp_error ("overflow in enumeration values at `%D'", name
);
12557 value
= integer_zero_node
;
12560 /* Remove no-op casts from the value. */
12562 STRIP_TYPE_NOPS (value
);
12564 /* To fix MAX_VAL enum consts. (bkoz) */
12565 TREE_TYPE (value
) = integer_type_node
;
12569 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12570 Even in other cases, we will later (in finish_enum) be setting
12571 the type of VALUE. But, we don't need to make a copy if this
12572 VALUE is one of the enumeration constants for this same
12573 enumeration type. */
12574 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
12575 if (TREE_VALUE (values
) == value
)
12577 /* If we didn't break out of the loop, then we do need a copy. */
12578 if (!values
&& value
)
12579 value
= copy_node (value
);
12581 /* C++ associates enums with global, function, or class declarations. */
12582 context
= current_scope ();
12584 /* Build the actual enumeration constant. Note that the enumeration
12585 constants have the type of their initializers until the
12586 enumeration is complete:
12590 Following the closing brace of an enum-specifier, each enumer-
12591 ator has the type of its enumeration. Prior to the closing
12592 brace, the type of each enumerator is the type of its
12593 initializing value.
12595 In finish_enum we will reset the type. Of course, if we're
12596 processing a template, there may be no value. */
12597 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
12599 if (context
&& context
== current_class_type
)
12600 /* This enum declaration is local to the class. We need the full
12601 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
12602 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12604 /* It's a global enum, or it's local to a function. (Note local to
12605 a function could mean local to a class method. */
12606 decl
= build_decl (CONST_DECL
, name
, type
);
12608 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12609 DECL_INITIAL (decl
) = value
;
12610 TREE_READONLY (decl
) = 1;
12612 if (context
&& context
== current_class_type
)
12613 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12614 on the TYPE_FIELDS list for `S'. (That's so that you can say
12615 things like `S::i' later.) */
12616 finish_member_declaration (decl
);
12620 GNU_xref_decl (current_function_decl
, decl
);
12623 /* Add this enumeration constant to the list for this type. */
12624 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
12628 static int function_depth
;
12630 /* We're defining DECL. Make sure that it's type is OK. */
12633 check_function_type (decl
)
12636 tree fntype
= TREE_TYPE (decl
);
12638 /* In a function definition, arg types must be complete. */
12639 require_complete_types_for_parms (current_function_parms
);
12641 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12643 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12645 /* Make it return void instead, but don't change the
12646 type of the DECL_RESULT, in case we have a named return value. */
12647 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12649 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12651 = build_cplus_method_type (ctype
,
12653 FUNCTION_ARG_CHAIN (decl
));
12657 = build_function_type (void_type_node
,
12658 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12660 = build_exception_variant (fntype
,
12661 TYPE_RAISES_EXCEPTIONS (fntype
));
12664 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12667 /* Create the FUNCTION_DECL for a function definition.
12668 DECLSPECS and DECLARATOR are the parts of the declaration;
12669 they describe the function's name and the type it returns,
12670 but twisted together in a fashion that parallels the syntax of C.
12672 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12673 DECLARATOR is really the DECL for the function we are about to
12674 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12675 indicating that the function is an inline defined in-class, and
12676 SF_EXPAND indicating that we should generate RTL for this
12679 This function creates a binding context for the function body
12680 as well as setting up the FUNCTION_DECL in current_function_decl.
12682 Returns 1 on success. If the DECLARATOR is not suitable for a function
12683 (it defines a datum instead), we return 0, which tells
12684 yyparse to report a parse error.
12686 For C++, we must first check whether that datum makes any sense.
12687 For example, "class A local_a(1,2);" means that variable local_a
12688 is an aggregate of type A, which should have a constructor
12689 applied to it with the argument list [1, 2]. */
12692 start_function (declspecs
, declarator
, attrs
, flags
)
12693 tree declspecs
, declarator
, attrs
;
12697 tree ctype
= NULL_TREE
;
12700 extern int have_extern_spec
;
12701 extern int used_extern_spec
;
12702 int doing_friend
= 0;
12703 struct binding_level
*bl
;
12705 /* Sanity check. */
12706 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12707 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12709 /* This should only be done once on the top most decl. */
12710 if (have_extern_spec
&& !used_extern_spec
)
12712 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12713 used_extern_spec
= 1;
12716 if (flags
& SF_PRE_PARSED
)
12718 decl1
= declarator
;
12720 fntype
= TREE_TYPE (decl1
);
12721 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12722 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12724 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12725 class is in the (lexical) scope of the class in which it is
12727 if (!ctype
&& DECL_FRIEND_P (decl1
))
12729 ctype
= DECL_CLASS_CONTEXT (decl1
);
12731 /* CTYPE could be null here if we're dealing with a template;
12732 for example, `inline friend float foo()' inside a template
12733 will have no CTYPE set. */
12734 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12740 last_function_parms
= DECL_ARGUMENTS (decl1
);
12741 last_function_parm_tags
= NULL_TREE
;
12745 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12746 /* If the declarator is not suitable for a function definition,
12747 cause a syntax error. */
12748 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12750 fntype
= TREE_TYPE (decl1
);
12752 restype
= TREE_TYPE (fntype
);
12753 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12755 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12756 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12757 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12758 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12759 fntype
= build_function_type (integer_type_node
,
12760 TYPE_ARG_TYPES (fntype
));
12762 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12764 TYPE_ARG_TYPES (fntype
));
12765 TREE_TYPE (decl1
) = fntype
;
12768 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12769 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12770 else if (DECL_MAIN_P (decl1
))
12772 /* If this doesn't return integer_type, complain. */
12773 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12775 if (pedantic
|| warn_return_type
)
12776 pedwarn ("return type for `main' changed to `int'");
12777 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12782 /* Sometimes we don't notice that a function is a static member, and
12783 build a METHOD_TYPE for it. Fix that up now. */
12784 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
12785 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
12787 revert_static_member_fn (&decl1
, NULL
, NULL
);
12788 last_function_parms
= TREE_CHAIN (last_function_parms
);
12792 /* Warn if function was previously implicitly declared
12793 (but not if we warned then). */
12794 if (! warn_implicit
12795 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12796 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12798 /* Set up current_class_type, and enter the scope of the class, if
12801 push_nested_class (ctype
, 1);
12802 else if (DECL_STATIC_FUNCTION_P (decl1
))
12803 push_nested_class (DECL_CONTEXT (decl1
), 2);
12805 /* Now that we have entered the scope of the class, we must restore
12806 the bindings for any template parameters surrounding DECL1, if it
12807 is an inline member template. (Order is important; consider the
12808 case where a template parameter has the same name as a field of
12809 the class.) It is not until after this point that
12810 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12811 if (flags
& SF_INCLASS_INLINE
)
12812 maybe_begin_member_template_processing (decl1
);
12814 /* Effective C++ rule 15. See also c_expand_return. */
12816 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12817 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12818 cp_warning ("`operator=' should return a reference to `*this'");
12820 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12821 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12822 if (!DECL_INITIAL (decl1
))
12823 DECL_INITIAL (decl1
) = error_mark_node
;
12825 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12826 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12829 /* This function exists in static storage.
12830 (This does not mean `static' in the C sense!) */
12831 TREE_STATIC (decl1
) = 1;
12833 /* We must call push_template_decl after current_class_type is set
12834 up. (If we are processing inline definitions after exiting a
12835 class scope, current_class_type will be NULL_TREE until set above
12836 by push_nested_class.) */
12837 if (processing_template_decl
)
12838 decl1
= push_template_decl (decl1
);
12840 /* We are now in the scope of the function being defined. */
12841 current_function_decl
= decl1
;
12843 /* Save the parm names or decls from this function's declarator
12844 where store_parm_decls will find them. */
12845 current_function_parms
= last_function_parms
;
12846 current_function_parm_tags
= last_function_parm_tags
;
12848 /* Make sure the parameter and return types are reasonable. When
12849 you declare a function, these types can be incomplete, but they
12850 must be complete when you define the function. */
12851 if (! processing_template_decl
)
12852 check_function_type (decl1
);
12854 /* Build the return declaration for the function. */
12855 restype
= TREE_TYPE (fntype
);
12856 if (!processing_template_decl
)
12858 if (!DECL_RESULT (decl1
))
12860 DECL_RESULT (decl1
)
12861 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12862 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12863 DECL_RESULT (decl1
));
12867 /* Just use `void'. Nobody will ever look at this anyhow. */
12868 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12870 /* Initialize RTL machinery. We cannot do this until
12871 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12872 even when processing a template; this is how we get
12873 CURRENT_FUNCTION set up, and our per-function variables
12875 bl
= current_binding_level
;
12876 init_function_start (decl1
, input_filename
, lineno
);
12877 current_binding_level
= bl
;
12878 expanding_p
= (flags
& SF_EXPAND
) != 0;
12880 /* Even though we're inside a function body, we still don't want to
12881 call expand_expr to calculate the size of a variable-sized array.
12882 We haven't necessarily assigned RTL to all variables yet, so it's
12883 not safe to try to expand expressions involving them. */
12884 immediate_size_expand
= 0;
12885 current_function
->x_dont_save_pending_sizes_p
= 1;
12887 /* If we're building a statement-tree, start the tree now. */
12888 if (processing_template_decl
|| !expanding_p
)
12889 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
12891 /* Let the user know we're compiling this function. */
12892 if (processing_template_decl
|| !building_stmt_tree ())
12893 announce_function (decl1
);
12895 /* Record the decl so that the function name is defined.
12896 If we already have a decl for this name, and it is a FUNCTION_DECL,
12897 use the old decl. */
12898 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12900 /* A specialization is not used to guide overload resolution. */
12901 if ((flag_guiding_decls
12902 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12903 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12904 decl1
= pushdecl (decl1
);
12907 /* We need to set the DECL_CONTEXT. */
12908 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12909 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12910 /* And make sure we have enough default args. */
12911 check_default_args (decl1
);
12913 DECL_MAIN_VARIANT (decl1
) = decl1
;
12914 fntype
= TREE_TYPE (decl1
);
12917 /* Reset these in case the call to pushdecl changed them. */
12918 current_function_decl
= decl1
;
12919 current_function
->decl
= decl1
;
12921 /* Initialize the per-function data. */
12922 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
12924 /* If we already parsed this function, and we're just expanding it
12925 now, restore saved state. */
12926 struct binding_level
*bl
= current_binding_level
;
12927 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
12928 current_binding_level
= bl
;
12930 /* This function is being processed in whole-function mode; we
12931 already did semantic analysis. */
12932 current_function
->x_whole_function_mode_p
= 1;
12934 /* If we decided that we didn't want to inline this function,
12935 make sure the back-end knows that. */
12936 if (!current_function_cannot_inline
)
12937 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
12939 /* We don't need the saved data anymore. */
12940 free (DECL_SAVED_FUNCTION_DATA (decl1
));
12941 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
12943 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
12945 /* We know that this was set up by `grokclassfn'. We do not
12946 wait until `store_parm_decls', since evil parse errors may
12947 never get us to that point. Here we keep the consistency
12948 between `current_class_type' and `current_class_ptr'. */
12949 tree t
= DECL_ARGUMENTS (decl1
);
12951 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
12953 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
12956 cp_function_chain
->x_current_class_ref
12957 = build_indirect_ref (t
, NULL_PTR
);
12958 cp_function_chain
->x_current_class_ptr
= t
;
12960 /* Constructors and destructors need to know whether they're "in
12961 charge" of initializing virtual base classes. */
12962 if (DECL_DESTRUCTOR_P (decl1
))
12963 current_in_charge_parm
= TREE_CHAIN (t
);
12964 else if (DECL_CONSTRUCTOR_P (decl1
)
12966 && DECL_ARTIFICIAL (TREE_CHAIN (t
))
12967 && (DECL_NAME (TREE_CHAIN (t
))
12968 == in_charge_identifier
))
12969 current_in_charge_parm
= TREE_CHAIN (t
);
12972 if (DECL_INTERFACE_KNOWN (decl1
))
12974 tree ctx
= hack_decl_function_context (decl1
);
12976 if (DECL_NOT_REALLY_EXTERN (decl1
))
12977 DECL_EXTERNAL (decl1
) = 0;
12979 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12980 && TREE_PUBLIC (ctx
))
12981 /* This is a function in a local class in an extern inline
12983 comdat_linkage (decl1
);
12985 /* If this function belongs to an interface, it is public.
12986 If it belongs to someone else's interface, it is also external.
12987 This only affects inlines and template instantiations. */
12988 else if (interface_unknown
== 0
12989 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12990 || flag_alt_external_templates
))
12992 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12993 || processing_template_decl
)
12995 DECL_EXTERNAL (decl1
)
12997 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
12998 && !DECL_VINDEX (decl1
)));
13000 /* For WIN32 we also want to put these in linkonce sections. */
13001 maybe_make_one_only (decl1
);
13004 DECL_EXTERNAL (decl1
) = 0;
13005 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13006 DECL_INTERFACE_KNOWN (decl1
) = 1;
13008 else if (interface_unknown
&& interface_only
13009 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13010 || flag_alt_external_templates
))
13012 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13013 interface, we will have interface_only set but not
13014 interface_known. In that case, we don't want to use the normal
13015 heuristics because someone will supply a #pragma implementation
13016 elsewhere, and deducing it here would produce a conflict. */
13017 comdat_linkage (decl1
);
13018 DECL_EXTERNAL (decl1
) = 0;
13019 DECL_INTERFACE_KNOWN (decl1
) = 1;
13020 DECL_DEFER_OUTPUT (decl1
) = 1;
13024 /* This is a definition, not a reference.
13025 So clear DECL_EXTERNAL. */
13026 DECL_EXTERNAL (decl1
) = 0;
13028 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13029 && ! DECL_INTERFACE_KNOWN (decl1
)
13030 /* Don't try to defer nested functions for now. */
13031 && ! hack_decl_function_context (decl1
))
13032 DECL_DEFER_OUTPUT (decl1
) = 1;
13034 DECL_INTERFACE_KNOWN (decl1
) = 1;
13037 if (doing_semantic_analysis_p ())
13040 current_binding_level
->parm_flag
= 1;
13044 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13046 if (!building_stmt_tree ())
13048 GNU_xref_function (decl1
, current_function_parms
);
13049 make_function_rtl (decl1
);
13052 /* Promote the value to int before returning it. */
13053 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13054 restype
= type_promotes_to (restype
);
13056 /* If this fcn was already referenced via a block-scope `extern' decl
13057 (or an implicit decl), propagate certain information about the usage. */
13058 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13059 TREE_ADDRESSABLE (decl1
) = 1;
13061 if (DECL_RESULT (decl1
) == NULL_TREE
)
13063 DECL_RESULT (decl1
)
13064 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13065 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13066 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13071 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13072 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13074 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13075 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13077 else if (DECL_CONSTRUCTOR_P (decl1
))
13079 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13080 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13086 /* Called after store_parm_decls for a function-try-block. */
13089 expand_start_early_try_stmts ()
13091 expand_start_try_stmts ();
13094 /* Store the parameter declarations into the current function declaration.
13095 This is called after parsing the parameter declarations, before
13096 digesting the body of the function.
13098 Also install to binding contour return value identifier, if any. */
13101 store_parm_decls ()
13103 register tree fndecl
= current_function_decl
;
13104 register tree parm
;
13105 int parms_have_cleanups
= 0;
13106 tree cleanups
= NULL_TREE
;
13108 /* This is a list of types declared among parms in a prototype. */
13109 tree parmtags
= current_function_parm_tags
;
13111 /* This is a chain of any other decls that came in among the parm
13112 declarations. If a parm is declared with enum {foo, bar} x;
13113 then CONST_DECLs for foo and bar are put here. */
13114 tree nonparms
= NULL_TREE
;
13116 /* Create a binding level for the parms. */
13117 if (!building_stmt_tree ())
13118 expand_start_bindings (2);
13120 if (current_function_parms
)
13122 /* This case is when the function was defined with an ANSI prototype.
13123 The parms already have decls, so we need not do anything here
13124 except record them as in effect
13125 and complain if any redundant old-style parm decls were written. */
13127 tree specparms
= current_function_parms
;
13130 if (doing_semantic_analysis_p ())
13132 /* Must clear this because it might contain TYPE_DECLs declared
13134 storedecls (NULL_TREE
);
13136 /* If we're doing semantic analysis, then we'll call pushdecl
13137 for each of these. We must do them in reverse order so that
13138 they end in the correct forward order. */
13139 specparms
= nreverse (specparms
);
13142 for (parm
= specparms
; parm
; parm
= next
)
13144 next
= TREE_CHAIN (parm
);
13145 if (TREE_CODE (parm
) == PARM_DECL
)
13147 tree type
= TREE_TYPE (parm
);
13149 if (doing_semantic_analysis_p ())
13153 if (DECL_NAME (parm
) == NULL_TREE
13154 || TREE_CODE (parm
) != VOID_TYPE
)
13157 cp_error ("parameter `%D' declared void", parm
);
13159 cleanup
= maybe_build_cleanup (parm
);
13162 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13164 else if (type
!= error_mark_node
13165 && TYPE_NEEDS_DESTRUCTOR (type
))
13166 parms_have_cleanups
= 1;
13170 /* If we find an enum constant or a type tag,
13171 put it aside for the moment. */
13172 TREE_CHAIN (parm
) = NULL_TREE
;
13173 nonparms
= chainon (nonparms
, parm
);
13177 if (doing_semantic_analysis_p ())
13179 /* Get the decls in their original chain order
13180 and record in the function. This is all and only the
13181 PARM_DECLs that were pushed into scope by the loop above. */
13182 DECL_ARGUMENTS (fndecl
) = getdecls ();
13183 storetags (chainon (parmtags
, gettags ()));
13187 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13189 /* Now store the final chain of decls for the arguments
13190 as the decl-chain of the current lexical scope.
13191 Put the enumerators in as well, at the front so that
13192 DECL_ARGUMENTS is not modified. */
13193 if (doing_semantic_analysis_p ())
13194 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13196 /* Initialize the RTL code for the function. */
13197 DECL_SAVED_INSNS (fndecl
) = 0;
13198 if (! building_stmt_tree ())
13199 expand_function_start (fndecl
, parms_have_cleanups
);
13201 current_function_parms_stored
= 1;
13203 /* If this function is `main', emit a call to `__main'
13204 to run global initializers, etc. */
13205 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13206 expand_main_function ();
13208 /* Now that we have initialized the parms, we can start their
13209 cleanups. We cannot do this before, since expand_decl_cleanup
13210 should not be called before the parm can be used. */
13213 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13214 TREE_VALUE (cleanups
));
13215 cleanups
= TREE_CHAIN (cleanups
);
13218 /* Create a binding contour which can be used to catch
13219 cleanup-generated temporaries. Also, if the return value needs or
13220 has initialization, deal with that now. */
13221 if (parms_have_cleanups
)
13224 if (!building_stmt_tree ())
13225 expand_start_bindings (2);
13228 /* Do the starting of the exception specifications, if we have any. */
13229 if (flag_exceptions
&& !processing_template_decl
13230 && building_stmt_tree ()
13231 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13232 current_eh_spec_try_block
= expand_start_eh_spec ();
13235 /* Bind a name and initialization to the return value of
13236 the current function. */
13239 store_return_init (decl
)
13242 /* If this named return value comes in a register, put it in a
13243 pseudo-register. */
13244 if (DECL_REGISTER (decl
))
13246 original_result_rtx
= DECL_RTL (decl
);
13247 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13252 /* We have finished doing semantic analysis on DECL, but have not yet
13253 generated RTL for its body. Save away our current state, so that
13254 when we want to generate RTL later we know what to do. */
13257 save_function_data (decl
)
13260 struct language_function
*f
;
13262 /* Save the language-specific per-function data so that we can
13263 get it back when we really expand this function. */
13264 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13268 f
= ((struct language_function
*)
13269 xmalloc (sizeof (struct language_function
)));
13270 bcopy ((char *) cp_function_chain
, (char *) f
,
13271 sizeof (struct language_function
));
13272 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13274 /* Clear out the bits we don't need. */
13275 f
->x_base_init_list
= NULL_TREE
;
13276 f
->x_member_init_list
= NULL_TREE
;
13277 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13278 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13279 f
->x_result_rtx
= NULL_RTX
;
13280 f
->x_named_label_uses
= NULL
;
13281 f
->bindings
= NULL
;
13283 /* When we get back here again, we will be expanding. */
13284 f
->x_expanding_p
= 1;
13286 /* If we've already decided that we cannot inline this function, we
13287 must remember that fact when we actually go to expand the
13289 f
->cannot_inline
= current_function_cannot_inline
;
13292 /* At the end of every constructor we generate to code to return
13293 `this'. Do that now. */
13296 finish_constructor_body ()
13298 /* Any return from a constructor will end up here. */
13299 add_tree (build_min_nt (LABEL_STMT
, ctor_label
));
13301 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13302 generate the return, rather than a goto to CTOR_LABEL. */
13303 ctor_label
= NULL_TREE
;
13304 /* In check_return_expr we translate an empty return from a
13305 constructor to a return of `this'. */
13306 finish_return_stmt (NULL_TREE
);
13307 /* Mark the end of the constructor. */
13308 add_tree (build_min_nt (CTOR_STMT
));
13311 /* At the end of every destructor we generate code to restore virtual
13312 function tables to the values desired by base classes and to call
13313 to base class destructors. Do that now. */
13316 finish_destructor_body ()
13318 tree compound_stmt
;
13323 /* Create a block to contain all the extra code. */
13324 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13326 /* Any return from a destructor will end up here. */
13327 add_tree (build_min_nt (LABEL_STMT
, dtor_label
));
13329 /* Generate the code to call destructor on base class. If this
13330 destructor belongs to a class with virtual functions, then set
13331 the virtual function table pointer to represent the type of our
13334 /* This side-effect makes call to `build_delete' generate the code
13335 we have to have at the end of this destructor. `build_delete'
13336 will set the flag again. */
13337 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13339 /* These are two cases where we cannot delegate deletion. */
13340 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13341 || TYPE_GETS_REG_DELETE (current_class_type
))
13342 in_charge
= integer_zero_node
;
13344 in_charge
= current_in_charge_parm
;
13346 exprstmt
= build_delete (current_class_type
,
13349 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13352 if (exprstmt
!= error_mark_node
13353 && (TREE_CODE (exprstmt
) != NOP_EXPR
13354 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13355 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13357 if (exprstmt
!= void_zero_node
)
13358 /* Don't call `expand_expr_stmt' if we're not going to do
13359 anything, since -Wall will give a diagnostic. */
13360 finish_expr_stmt (exprstmt
);
13362 /* Run destructors for all virtual baseclasses. */
13363 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13365 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13366 tree if_stmt
= begin_if_stmt ();
13367 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13368 current_in_charge_parm
,
13374 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13376 tree vb
= get_vbase
13377 (BINFO_TYPE (vbases
),
13378 TYPE_BINFO (current_class_type
));
13380 (build_scoped_method_call
13381 (current_class_ref
, vb
, dtor_identifier
,
13382 build_expr_list (NULL_TREE
, integer_zero_node
)));
13384 vbases
= TREE_CHAIN (vbases
);
13387 finish_then_clause (if_stmt
);
13392 virtual_size
= c_sizeof (current_class_type
);
13394 /* At the end, call delete if that's what's requested. */
13396 /* FDIS sez: At the point of definition of a virtual destructor
13397 (including an implicit definition), non-placement operator delete
13398 shall be looked up in the scope of the destructor's class and if
13399 found shall be accessible and unambiguous.
13401 This is somewhat unclear, but I take it to mean that if the class
13402 only defines placement deletes we don't do anything here. So we
13403 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13404 they ever try to delete one of these. */
13405 if (TYPE_GETS_REG_DELETE (current_class_type
)
13406 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13410 exprstmt
= build_op_delete_call
13411 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13412 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13414 if_stmt
= begin_if_stmt ();
13415 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13416 current_in_charge_parm
,
13419 finish_expr_stmt (exprstmt
);
13420 finish_then_clause (if_stmt
);
13424 /* Close the block we started above. */
13425 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13428 /* Finish up a function declaration and compile that function
13429 all the way to assembler language output. The free the storage
13430 for the function definition.
13432 This is called after parsing the body of the function definition.
13433 LINENO is the current line number.
13435 FLAGS is a bitwise or of the following values:
13437 An extra call to poplevel (and expand_end_bindings) must be
13438 made to take care of the binding contour for the base
13439 initializers. This is only relevant for constructors.
13441 We just finished processing the body of an in-class inline
13442 function definition. (This processing will have taken place
13443 after the class definition is complete.) */
13446 finish_function (lineno
, flags
)
13450 register tree fndecl
= current_function_decl
;
13451 tree fntype
, ctype
= NULL_TREE
;
13452 /* Label to use if this function is supposed to return a value. */
13453 tree no_return_label
= NULL_TREE
;
13454 int call_poplevel
= (flags
& 1) != 0;
13455 int inclass_inline
= (flags
& 2) != 0;
13459 /* When we get some parse errors, we can end up without a
13460 current_function_decl, so cope. */
13461 if (fndecl
== NULL_TREE
)
13462 return error_mark_node
;
13464 nested
= function_depth
> 1;
13465 fntype
= TREE_TYPE (fndecl
);
13467 /* TREE_READONLY (fndecl) = 1;
13468 This caused &foo to be of type ptr-to-const-function
13469 which then got a warning when stored in a ptr-to-function variable. */
13471 /* This happens on strange parse errors. */
13472 if (! current_function_parms_stored
)
13475 store_parm_decls ();
13478 if (building_stmt_tree ())
13480 if (DECL_CONSTRUCTOR_P (fndecl
))
13482 finish_constructor_body ();
13486 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13487 finish_destructor_body ();
13488 else if (DECL_MAIN_P (fndecl
))
13490 /* Make it so that `main' always returns 0 by default. */
13492 finish_return_stmt (integer_one_node
);
13494 finish_return_stmt (integer_zero_node
);
13498 /* Finish dealing with exception specifiers. */
13499 if (flag_exceptions
&& !processing_template_decl
13500 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13501 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13502 (TREE_TYPE (current_function_decl
)),
13503 current_eh_spec_try_block
);
13508 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13510 /* Keep this code around in case we later want to control debug info
13511 based on whether a type is "used". (jason 1999-11-11) */
13513 tree ttype
= target_type (fntype
);
13516 if (IS_AGGR_TYPE (ttype
))
13517 /* Let debugger know it should output info for this type. */
13518 note_debug_info_needed (ttype
);
13520 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13522 ttype
= target_type (TREE_TYPE (parmdecl
));
13523 if (IS_AGGR_TYPE (ttype
))
13524 /* Let debugger know it should output info for this type. */
13525 note_debug_info_needed (ttype
);
13530 /* Clean house because we will need to reorder insns here. */
13531 do_pending_stack_adjust ();
13535 else if (DECL_CONSTRUCTOR_P (fndecl
))
13540 else if (return_label
!= NULL_RTX
13541 && flag_this_is_variable
<= 0
13542 && current_function_return_value
== NULL_TREE
13543 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13544 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13546 if (flag_exceptions
)
13547 expand_exception_blocks ();
13549 /* If this function is supposed to return a value, ensure that
13550 we do not fall into the cleanups by mistake. The end of our
13551 function will look like this:
13553 user code (may have return stmt somewhere)
13554 goto no_return_label
13559 NOTE_INSN_FUNCTION_END
13563 If the user omits a return stmt in the USER CODE section, we
13564 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13565 Otherwise, we won't. */
13566 if (no_return_label
)
13568 DECL_CONTEXT (no_return_label
) = fndecl
;
13569 DECL_INITIAL (no_return_label
) = error_mark_node
;
13570 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13571 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13572 expand_goto (no_return_label
);
13577 /* Remove the binding contour which is used
13578 to catch cleanup-generated temporaries. */
13579 expand_end_bindings (0, 0, 0);
13580 poplevel (0, 0, 0);
13582 /* Emit label at beginning of cleanup code for parameters. */
13583 emit_label (cleanup_label
);
13586 /* Get return value into register if that's where it's supposed
13588 if (original_result_rtx
)
13589 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13591 /* Finish building code that will trigger warnings if users forget
13592 to make their functions return values. */
13593 if (no_return_label
|| cleanup_label
)
13594 emit_jump (return_label
);
13595 if (no_return_label
)
13597 /* We don't need to call `expand_*_return' here because we
13598 don't need any cleanups here--this path of code is only
13599 for error checking purposes. */
13600 expand_label (no_return_label
);
13603 /* We hard-wired immediate_size_expand to zero in
13604 start_function. Expand_function_end will decrement this
13605 variable. So, we set the variable to one here, so that after
13606 the decrement it will remain zero. */
13607 immediate_size_expand
= 1;
13609 /* Generate rtl for function exit. */
13610 expand_function_end (input_filename
, lineno
, 1);
13613 /* We have to save this value here in case
13614 maybe_end_member_template_processing decides to pop all the
13615 template parameters. */
13616 expand_p
= !building_stmt_tree ();
13618 /* If we're saving up tree structure, tie off the function now. */
13620 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13622 /* This must come after expand_function_end because cleanups might
13623 have declarations (from inline functions) that need to go into
13624 this function's blocks. */
13625 if (doing_semantic_analysis_p ())
13627 if (current_binding_level
->parm_flag
!= 1)
13628 my_friendly_abort (122);
13629 poplevel (1, 0, 1);
13632 /* Remember that we were in class scope. */
13633 if (current_class_name
)
13634 ctype
= current_class_type
;
13636 /* Must mark the RESULT_DECL as being in this function. */
13637 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13639 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13640 to the FUNCTION_DECL node itself. */
13641 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13643 /* Save away current state, if appropriate. */
13644 if (!expanding_p
&& !processing_template_decl
)
13645 save_function_data (fndecl
);
13651 int saved_flag_keep_inline_functions
=
13652 flag_keep_inline_functions
;
13654 /* So we can tell if jump_optimize sets it to 1. */
13657 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13658 && hack_decl_function_context (fndecl
))
13659 /* Trick rest_of_compilation into not deferring output of this
13660 function, even if it is inline, since the rtl_obstack for
13661 this function is the function_obstack of the enclosing
13662 function and will be deallocated when the enclosing
13663 function is gone. See save_tree_status. */
13664 flag_keep_inline_functions
= 1;
13666 /* Before we call rest_of_compilation (which will pop the
13667 CURRENT_FUNCTION), we must save these values. */
13668 returns_null
= current_function_returns_null
;
13669 returns_value
= current_function_returns_value
;
13671 /* If this is a nested function (like a template instantiation
13672 that we're compiling in the midst of compiling something
13673 else), push a new GC context. That will keep local variables
13674 on the stack from being collected while we're doing the
13675 compilation of this function. */
13676 if (function_depth
> 1)
13677 ggc_push_context ();
13679 /* Run the optimizers and output the assembler code for this
13681 if (DECL_ARTIFICIAL (fndecl
))
13683 /* Do we really *want* to inline this synthesized method? */
13685 int save_fif
= flag_inline_functions
;
13686 flag_inline_functions
= 1;
13688 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13689 will check our size. */
13690 DECL_INLINE (fndecl
) = 0;
13692 rest_of_compilation (fndecl
);
13693 flag_inline_functions
= save_fif
;
13696 rest_of_compilation (fndecl
);
13698 /* Undo the call to ggc_push_context above. */
13699 if (function_depth
> 1)
13700 ggc_pop_context ();
13702 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13704 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13706 /* Set DECL_EXTERNAL so that assemble_external will be called as
13707 necessary. We'll clear it again in finish_file. */
13708 if (! DECL_EXTERNAL (fndecl
))
13709 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13710 DECL_EXTERNAL (fndecl
) = 1;
13711 mark_inline_for_output (fndecl
);
13715 /* Keep this code around in case we later want to control debug info
13716 based on whether a type is "used". (jason 1999-11-11) */
13718 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13719 note_debug_info_needed (ctype
);
13722 returns_null
|= can_reach_end
;
13724 /* Since we don't normally go through c_expand_return for constructors,
13725 this normally gets the wrong value.
13726 Also, named return values have their return codes emitted after
13727 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13728 if (DECL_CONSTRUCTOR_P (fndecl
)
13729 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13732 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13733 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13734 else if ((warn_return_type
|| pedantic
)
13736 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13738 /* If this function returns non-void and control can drop through,
13740 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13742 /* With just -W, complain only if function returns both with
13743 and without a value. */
13744 else if (extra_warnings
&& returns_value
&& returns_null
)
13745 warning ("this function may return with or without a value");
13749 /* Clear out memory we no longer need. */
13750 free_after_parsing (current_function
);
13751 /* Since we never call rest_of_compilation, we never clear
13752 CURRENT_FUNCTION. Do so explicitly. */
13753 free_after_compilation (current_function
);
13754 current_function
= NULL
;
13757 /* If this is a in-class inline definition, we may have to pop the
13758 bindings for the template parameters that we added in
13759 maybe_begin_member_template_processing when start_function was
13761 if (inclass_inline
)
13762 maybe_end_member_template_processing ();
13764 /* Leave the scope of the class. */
13766 pop_nested_class ();
13770 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
))
13774 /* Stop pointing to the local nodes about to be freed. */
13775 /* But DECL_INITIAL must remain nonzero so we know this
13776 was an actual function definition. */
13777 DECL_INITIAL (fndecl
) = error_mark_node
;
13778 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13779 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13782 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13783 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13784 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13785 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13790 /* Let the error reporting routines know that we're outside a
13791 function. For a nested function, this value is used in
13792 pop_cp_function_context and then reset via pop_function_context. */
13793 current_function_decl
= NULL_TREE
;
13794 /* We don't really care about obstacks, but the middle-end
13795 sometimes cares on what obstck things are located. */
13796 permanent_allocation (1);
13802 /* Create the FUNCTION_DECL for a function definition.
13803 DECLSPECS and DECLARATOR are the parts of the declaration;
13804 they describe the return type and the name of the function,
13805 but twisted together in a fashion that parallels the syntax of C.
13807 This function creates a binding context for the function body
13808 as well as setting up the FUNCTION_DECL in current_function_decl.
13810 Returns a FUNCTION_DECL on success.
13812 If the DECLARATOR is not suitable for a function (it defines a datum
13813 instead), we return 0, which tells yyparse to report a parse error.
13815 May return void_type_node indicating that this method is actually
13816 a friend. See grokfield for more details.
13818 Came here with a `.pushlevel' .
13820 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13821 CHANGES TO CODE IN `grokfield'. */
13824 start_method (declspecs
, declarator
, attrlist
)
13825 tree declarator
, declspecs
, attrlist
;
13827 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13830 /* Something too ugly to handle. */
13831 if (fndecl
== NULL_TREE
)
13834 /* Pass friends other than inline friend functions back. */
13835 if (fndecl
== void_type_node
)
13838 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13839 /* Not a function, tell parser to report parse error. */
13842 if (DECL_IN_AGGR_P (fndecl
))
13844 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13846 if (DECL_CONTEXT (fndecl
)
13847 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13848 cp_error ("`%D' is already defined in class %s", fndecl
,
13849 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13851 return void_type_node
;
13854 check_template_shadow (fndecl
);
13856 DECL_THIS_INLINE (fndecl
) = 1;
13858 if (flag_default_inline
)
13859 DECL_INLINE (fndecl
) = 1;
13861 /* We process method specializations in finish_struct_1. */
13862 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13863 fndecl
= push_template_decl (fndecl
);
13865 /* We read in the parameters on the maybepermanent_obstack,
13866 but we won't be getting back to them until after we
13867 may have clobbered them. So the call to preserve_data
13868 will keep them safe. */
13871 if (! DECL_FRIEND_P (fndecl
))
13873 if (TREE_CHAIN (fndecl
))
13875 fndecl
= copy_node (fndecl
);
13876 TREE_CHAIN (fndecl
) = NULL_TREE
;
13879 if (DECL_CONSTRUCTOR_P (fndecl
))
13881 if (! grok_ctor_properties (current_class_type
, fndecl
))
13882 return void_type_node
;
13884 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13885 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13888 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
13890 /* Make a place for the parms */
13892 current_binding_level
->parm_flag
= 1;
13894 DECL_IN_AGGR_P (fndecl
) = 1;
13898 /* Go through the motions of finishing a function definition.
13899 We don't compile this method until after the whole class has
13902 FINISH_METHOD must return something that looks as though it
13903 came from GROKFIELD (since we are defining a method, after all).
13905 This is called after parsing the body of the function definition.
13906 STMTS is the chain of statements that makes up the function body.
13908 DECL is the ..._DECL that `start_method' provided. */
13911 finish_method (decl
)
13914 register tree fndecl
= decl
;
13917 register tree link
;
13919 if (decl
== void_type_node
)
13922 old_initial
= DECL_INITIAL (fndecl
);
13924 /* Undo the level for the parms (from start_method).
13925 This is like poplevel, but it causes nothing to be
13926 saved. Saving information here confuses symbol-table
13927 output routines. Besides, this information will
13928 be correctly output when this method is actually
13931 /* Clear out the meanings of the local variables of this level;
13932 also record in each decl which block it belongs to. */
13934 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13936 if (DECL_NAME (link
) != NULL_TREE
)
13937 pop_binding (DECL_NAME (link
), link
);
13938 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13939 DECL_CONTEXT (link
) = NULL_TREE
;
13942 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13943 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13944 current_binding_level
->parm_flag
,
13945 current_binding_level
->keep
);
13947 poplevel (0, 0, 0);
13949 DECL_INITIAL (fndecl
) = old_initial
;
13951 /* We used to check if the context of FNDECL was different from
13952 current_class_type as another way to get inside here. This didn't work
13953 for String.cc in libg++. */
13954 if (DECL_FRIEND_P (fndecl
))
13956 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13957 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13958 decl
= void_type_node
;
13964 /* Called when a new struct TYPE is defined.
13965 If this structure or union completes the type of any previous
13966 variable declaration, lay it out and output its rtl. */
13969 hack_incomplete_structures (type
)
13974 if (current_binding_level
->incomplete
== NULL_TREE
)
13977 if (!type
) /* Don't do this for class templates. */
13980 for (list
= ¤t_binding_level
->incomplete
; *list
; )
13982 tree decl
= TREE_VALUE (*list
);
13983 if ((decl
&& TREE_TYPE (decl
) == type
)
13984 || (TREE_TYPE (decl
)
13985 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13986 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
13988 int toplevel
= toplevel_bindings_p ();
13989 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13990 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
13991 layout_type (TREE_TYPE (decl
));
13992 layout_decl (decl
, 0);
13993 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
13997 expand_decl (decl
);
13998 cleanup
= maybe_build_cleanup (decl
);
13999 expand_decl_init (decl
);
14000 if (! expand_decl_cleanup (decl
, cleanup
))
14001 cp_error ("parser lost in parsing declaration of `%D'",
14004 *list
= TREE_CHAIN (*list
);
14007 list
= &TREE_CHAIN (*list
);
14011 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14012 See build_delete for information about AUTO_DELETE.
14014 Don't build these on the momentary obstack; they must live
14015 the life of the binding contour. */
14018 maybe_build_cleanup_1 (decl
, auto_delete
)
14019 tree decl
, auto_delete
;
14021 tree type
= TREE_TYPE (decl
);
14022 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14024 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14027 if (TREE_CODE (type
) == ARRAY_TYPE
)
14031 mark_addressable (decl
);
14032 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14035 /* Optimize for space over speed here. */
14036 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14037 || flag_expensive_optimizations
)
14038 flags
|= LOOKUP_NONVIRTUAL
;
14040 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14042 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14043 && ! TYPE_HAS_DESTRUCTOR (type
))
14044 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14045 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14052 /* If DECL is of a type which needs a cleanup, build that cleanup
14053 here. The cleanup does free the storage with a call to delete. */
14056 maybe_build_cleanup_and_delete (decl
)
14059 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14062 /* If DECL is of a type which needs a cleanup, build that cleanup
14063 here. The cleanup does not free the storage with a call a delete. */
14066 maybe_build_cleanup (decl
)
14069 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14072 /* Expand a C++ expression at the statement level.
14073 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14074 The C++ type checker should get all of these out when
14075 expressions are combined with other, type-providing, expressions,
14076 leaving only orphan expressions, such as:
14078 &class::bar; / / takes its address, but does nothing with it. */
14081 cplus_expand_expr_stmt (exp
)
14084 if (stmts_are_full_exprs_p
)
14085 exp
= convert_to_void (exp
, "statement");
14088 /* We should do this eventually, but right now this causes regex.o from
14089 libg++ to miscompile, and tString to core dump. */
14090 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14093 /* If we don't do this, we end up down inside expand_expr
14094 trying to do TYPE_MODE on the ERROR_MARK, and really
14095 go outside the bounds of the type. */
14096 if (exp
!= error_mark_node
)
14097 expand_expr_stmt (exp
);
14100 /* When a stmt has been parsed, this function is called. */
14105 /* Always assume this statement was not an expression statement. If
14106 it actually was an expression statement, its our callers
14107 responsibility to fix this up. */
14108 last_expr_type
= NULL_TREE
;
14111 /* Change a static member function definition into a FUNCTION_TYPE, instead
14112 of the METHOD_TYPE that we create when it's originally parsed.
14114 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14115 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14116 other decls. Either pass the addresses of local variables or NULL. */
14119 revert_static_member_fn (decl
, fn
, argtypes
)
14120 tree
*decl
, *fn
, *argtypes
;
14123 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14124 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14126 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14127 != TYPE_UNQUALIFIED
)
14128 cp_error ("static member function `%#D' declared with type qualifiers",
14131 args
= TREE_CHAIN (args
);
14132 tmp
= build_function_type (TREE_TYPE (function
), args
);
14133 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14134 tmp
= build_exception_variant (tmp
,
14135 TYPE_RAISES_EXCEPTIONS (function
));
14136 TREE_TYPE (*decl
) = tmp
;
14137 if (DECL_ARGUMENTS (*decl
))
14138 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14139 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14146 /* Initialize the variables used during compilation of a C++
14150 push_cp_function_context (f
)
14151 struct function
*f
;
14153 struct language_function
*p
14154 = ((struct language_function
*)
14155 xcalloc (1, sizeof (struct language_function
)));
14158 /* It takes an explicit call to expand_body to generate RTL for a
14162 /* Whenever we start a new function, we destroy temporaries in the
14164 stmts_are_full_exprs_p
= 1;
14167 /* Free the language-specific parts of F, now that we've finished
14168 compiling the function. */
14171 pop_cp_function_context (f
)
14172 struct function
*f
;
14175 free (f
->language
);
14179 /* Mark P for GC. */
14182 mark_lang_function (p
)
14183 struct language_function
*p
;
14188 ggc_mark_tree (p
->x_named_labels
);
14189 ggc_mark_tree (p
->x_ctor_label
);
14190 ggc_mark_tree (p
->x_dtor_label
);
14191 ggc_mark_tree (p
->x_base_init_list
);
14192 ggc_mark_tree (p
->x_member_init_list
);
14193 ggc_mark_tree (p
->x_current_class_ptr
);
14194 ggc_mark_tree (p
->x_current_class_ref
);
14195 ggc_mark_tree (p
->x_eh_spec_try_block
);
14196 ggc_mark_tree (p
->x_scope_stmt_stack
);
14198 ggc_mark_rtx (p
->x_result_rtx
);
14200 mark_stmt_tree (&p
->x_stmt_tree
);
14201 mark_binding_level (&p
->bindings
);
14204 /* Mark the language-specific data in F for GC. */
14207 mark_cp_function_context (f
)
14208 struct function
*f
;
14210 mark_lang_function (f
->language
);
14216 return function_depth
!= 0;
14221 lang_mark_false_label_stack (l
)
14222 struct label_node
*l
;
14224 /* C++ doesn't use false_label_stack. It better be NULL. */
14225 my_friendly_assert (l
== NULL
, 19990904);
14232 enum tree_code code
= TREE_CODE (t
);
14233 if (code
== IDENTIFIER_NODE
)
14235 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14236 struct lang_id2
*li2
= li
->x
;
14237 ggc_mark_tree (li
->namespace_bindings
);
14238 ggc_mark_tree (li
->bindings
);
14239 ggc_mark_tree (li
->class_value
);
14240 ggc_mark_tree (li
->class_template_info
);
14244 ggc_mark_tree (li2
->label_value
);
14245 ggc_mark_tree (li2
->implicit_decl
);
14246 ggc_mark_tree (li2
->error_locus
);
14249 else if (code
== CPLUS_BINDING
)
14251 if (BINDING_HAS_LEVEL_P (t
))
14252 mark_binding_level (&BINDING_LEVEL (t
));
14254 ggc_mark_tree (BINDING_SCOPE (t
));
14255 ggc_mark_tree (BINDING_VALUE (t
));
14257 else if (code
== OVERLOAD
)
14258 ggc_mark_tree (OVL_FUNCTION (t
));
14259 else if (code
== TEMPLATE_PARM_INDEX
)
14260 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14261 else if (TREE_CODE_CLASS (code
) == 'd')
14263 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14268 if (!DECL_GLOBAL_CTOR_P (t
) && !DECL_GLOBAL_DTOR_P (t
))
14269 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14270 ggc_mark_tree (ld
->decl_flags
.context
);
14271 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14272 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14274 mark_binding_level (&NAMESPACE_LEVEL (t
));
14275 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14277 ggc_mark_tree (ld
->main_decl_variant
);
14278 ggc_mark_tree (ld
->befriending_classes
);
14279 ggc_mark_tree (ld
->saved_tree
);
14280 if (TREE_CODE (t
) == TYPE_DECL
)
14281 ggc_mark_tree (ld
->u
.sorted_fields
);
14282 else if (TREE_CODE (t
) == FUNCTION_DECL
14283 && !DECL_PENDING_INLINE_P (t
))
14284 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14288 else if (TREE_CODE_CLASS (code
) == 't')
14290 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14292 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14293 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14296 ggc_mark_tree (lt
->vfields
);
14297 ggc_mark_tree (lt
->vbases
);
14298 ggc_mark_tree (lt
->tags
);
14299 ggc_mark_tree (lt
->search_slot
);
14300 ggc_mark_tree (lt
->size
);
14301 ggc_mark_tree (lt
->abstract_virtuals
);
14302 ggc_mark_tree (lt
->friend_classes
);
14303 ggc_mark_tree (lt
->rtti
);
14304 ggc_mark_tree (lt
->methods
);
14305 ggc_mark_tree (lt
->template_info
);
14306 ggc_mark_tree (lt
->befriending_classes
);
14309 /* In the case of pointer-to-member function types, the
14310 TYPE_LANG_SPECIFIC is really just a tree. */
14311 ggc_mark_tree ((tree
) lt
);