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
;
52 extern struct obstack
* saveable_obstack
;
54 extern int current_class_depth
;
56 extern tree static_ctors
, static_dtors
;
58 extern tree global_namespace
;
60 extern int (*valid_lang_attribute
) PROTO ((tree
, tree
, tree
, tree
));
62 /* Use garbage collection. */
66 /* Obstack used for remembering local class declarations (like
67 enums and static (const) members. */
69 struct obstack decl_obstack
;
70 static struct stack_level
*decl_stack
;
72 #ifndef WCHAR_UNSIGNED
73 #define WCHAR_UNSIGNED 0
76 #ifndef CHAR_TYPE_SIZE
77 #define CHAR_TYPE_SIZE BITS_PER_UNIT
80 #ifndef BOOL_TYPE_SIZE
81 #ifdef SLOW_BYTE_ACCESS
82 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
84 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
88 /* We let tm.h override the types used here, to handle trivial differences
89 such as the choice of unsigned int or long unsigned int for size_t.
90 When machines start needing nontrivial differences in the size type,
91 it would be best to do something here to figure out automatically
92 from other information what type to use. */
95 #define SIZE_TYPE "long unsigned int"
99 #define PTRDIFF_TYPE "long int"
103 #define WCHAR_TYPE "int"
106 static tree grokparms
PROTO((tree
, int));
107 static const char *redeclaration_error_message
PROTO((tree
, tree
));
109 static struct stack_level
*push_decl_level
PROTO((struct stack_level
*,
111 static void push_binding_level
PROTO((struct binding_level
*, int,
113 static void pop_binding_level
PROTO((void));
114 static void suspend_binding_level
PROTO((void));
115 static void resume_binding_level
PROTO((struct binding_level
*));
116 static struct binding_level
*make_binding_level
PROTO((void));
117 static void declare_namespace_level
PROTO((void));
118 static void signal_catch
PROTO((int)) ATTRIBUTE_NORETURN
;
119 static void storedecls
PROTO((tree
));
120 static void require_complete_types_for_parms
PROTO((tree
));
121 static void push_overloaded_decl_1
PROTO((tree
));
122 static int ambi_op_p
PROTO((tree
));
123 static int unary_op_p
PROTO((tree
));
124 static tree store_bindings
PROTO((tree
, tree
));
125 static tree lookup_tag_reverse
PROTO((tree
, tree
));
126 static tree obscure_complex_init
PROTO((tree
, tree
));
127 static tree maybe_build_cleanup_1
PROTO((tree
, tree
));
128 static tree lookup_name_real
PROTO((tree
, int, int, int));
129 static void warn_extern_redeclared_static
PROTO((tree
, tree
));
130 static void grok_reference_init
PROTO((tree
, tree
, tree
));
131 static tree grokfndecl
PROTO((tree
, tree
, tree
, tree
, int,
132 enum overload_flags
, tree
,
133 tree
, int, int, int, int, int, int, tree
));
134 static tree grokvardecl
PROTO((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
135 static tree lookup_tag
PROTO((enum tree_code
, tree
,
136 struct binding_level
*, int));
137 static void set_identifier_type_value_with_scope
138 PROTO((tree
, tree
, struct binding_level
*));
139 static void record_builtin_type
PROTO((enum rid
, const char *, tree
));
140 static void record_unknown_type
PROTO((tree
, const char *));
141 static int member_function_or_else
PROTO((tree
, tree
, const char *));
142 static void bad_specifiers
PROTO((tree
, const char *, int, int, int, int,
144 static void lang_print_error_function
PROTO((const char *));
145 static tree maybe_process_template_type_declaration
PROTO((tree
, int, struct binding_level
*));
146 static void check_for_uninitialized_const_var
PROTO((tree
));
147 static unsigned long typename_hash
PROTO((hash_table_key
));
148 static boolean typename_compare
PROTO((hash_table_key
, hash_table_key
));
149 static void push_binding
PROTO((tree
, tree
, struct binding_level
*));
150 static int add_binding
PROTO((tree
, tree
));
151 static void pop_binding
PROTO((tree
, tree
));
152 static tree local_variable_p
PROTO((tree
));
153 static tree find_binding
PROTO((tree
, tree
));
154 static tree select_decl
PROTO((tree
, int));
155 static int lookup_flags
PROTO((int, int));
156 static tree qualify_lookup
PROTO((tree
, int));
157 static tree record_builtin_java_type
PROTO((const char *, int));
158 static const char *tag_name
PROTO((enum tag_types code
));
159 static void find_class_binding_level
PROTO((void));
160 static struct binding_level
*innermost_nonclass_level
PROTO((void));
161 static tree poplevel_class
PROTO((void));
162 static void warn_about_implicit_typename_lookup
PROTO((tree
, tree
));
163 static int walk_namespaces_r
PROTO((tree
, walk_namespaces_fn
, void *));
164 static int walk_globals_r
PROTO((tree
, void *));
165 static void add_decl_to_level
PROTO((tree
, struct binding_level
*));
166 static tree make_label_decl
PROTO((tree
, int));
167 static void pop_label
PROTO((tree
));
168 static void pop_labels
PROTO((tree
));
169 static void maybe_deduce_size_from_array_init
PROTO((tree
, tree
));
170 static tree layout_var_decl
PROTO((tree
, tree
));
171 static void maybe_commonize_var
PROTO((tree
));
172 static tree build_cleanup_on_safe_obstack
PROTO((tree
));
173 static tree check_initializer
PROTO((tree
, tree
));
174 static void make_rtl_for_nonlocal_decl
PROTO((tree
, tree
, const char *));
175 static void push_cp_function_context
PROTO((struct function
*));
176 static void pop_cp_function_context
PROTO((struct function
*));
177 static void mark_binding_level
PROTO((void *));
178 static void mark_cp_function_context
PROTO((struct function
*));
179 static void mark_saved_scope
PROTO((void *));
180 static void check_function_type
PROTO((tree
));
181 static void destroy_local_static
PROTO((tree
));
183 #if defined (DEBUG_CP_BINDING_LEVELS)
184 static void indent
PROTO((void));
187 /* Erroneous argument lists can use this *IFF* they do not modify it. */
188 tree error_mark_list
;
190 /* The following symbols are subsumed in the cp_global_trees array, and
191 listed here individually for documentation purposes.
194 tree wchar_decl_node;
197 tree vtable_entry_type;
198 tree delta_type_node;
201 tree __baselist_desc_type_node;
202 tree __i_desc_type_node, __m_desc_type_node;
203 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
205 tree __t_desc_type_node;
207 tree __tp_desc_type_node;
209 tree __access_mode_type_node;
210 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
211 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
212 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
214 Not needed yet? May be needed one day?
215 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
216 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
217 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
220 tree class_star_type_node;
221 tree class_type_node, record_type_node, union_type_node, enum_type_node;
222 tree unknown_type_node;
224 Array type `vtable_entry_type[]'
227 tree vtbl_ptr_type_node;
233 A FUNCTION_DECL which can call `abort'. Not necessarily the
234 one that the user will declare, but sufficient to be called
235 by routines that want to abort the program.
239 The FUNCTION_DECL for the default `::operator delete'.
241 tree global_delete_fndecl;
244 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
248 tree cp_global_trees
[CPTI_MAX
];
250 /* Indicates that there is a type value in some namespace, although
251 that is not necessarily in scope at the moment. */
253 static tree global_type_node
;
258 /* Expect only namespace names now. */
259 static int only_namespace_names
;
261 /* In a destructor, the last insn emitted after the start of the
262 function and the parms. */
264 #define last_dtor_insn cp_function_chain->x_last_dtor_insn
266 /* In a constructor, the last insn emitted after the start of the
267 function and the parms, the exception specification and any
268 function-try-block. The constructor initializers are emitted after
271 #define last_parm_cleanup_insn cp_function_chain->x_last_parm_cleanup_insn
273 /* If original DECL_RESULT of current function was a register,
274 but due to being an addressable named return value, would up
275 on the stack, this variable holds the named return value's
276 original location. */
278 #define original_result_rtx cp_function_chain->x_result_rtx
280 struct named_label_list
282 struct binding_level
*binding_level
;
285 const char *filename_o_goto
;
287 struct named_label_list
*next
;
290 /* Used only for jumps to as-yet undefined labels, since jumps to
291 defined labels can have their validity checked by stmt.c. */
293 #define named_label_uses cp_function_chain->x_named_label_uses
295 /* A list of objects which have constructors or destructors
296 which reside in the global scope. The decl is stored in
297 the TREE_VALUE slot and the initializer is stored
298 in the TREE_PURPOSE slot. */
299 tree static_aggregates
;
303 /* A node for the integer constants 2, and 3. */
305 tree integer_two_node
, integer_three_node
;
307 /* While defining an enum type, this is 1 plus the last enumerator
310 static tree enum_next_value
;
312 /* Nonzero means that there was overflow computing enum_next_value. */
314 static int enum_overflow
;
316 /* Parsing a function declarator leaves here a chain of structure
317 and enum types declared in the parmlist. */
319 static tree last_function_parm_tags
;
321 /* Similar, for last_function_parm_tags. */
322 tree last_function_parms
;
323 static tree current_function_parm_tags
;
325 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
326 that have names. Here so we can clear out their names' definitions
327 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
328 TREE_PURPOSE is the previous binding of the label. */
330 #define named_labels cp_function_chain->x_named_labels
332 /* The FUNCTION_DECL for the function currently being compiled,
333 or 0 if between functions. */
334 tree current_function_decl
;
336 /* Set to 0 at beginning of a function definition, and whenever
337 a label (case or named) is defined. Set to value of expression
338 returned from function when that value can be transformed into
339 a named return value. */
341 tree current_function_return_value
;
343 /* Nonzero means give `double' the same size as `float'. */
345 extern int flag_short_double
;
347 /* Nonzero means don't recognize any builtin functions. */
349 extern int flag_no_builtin
;
351 /* Nonzero means don't recognize the non-ANSI builtin functions.
354 extern int flag_no_nonansi_builtin
;
356 /* Nonzero means enable obscure ANSI features and disable GNU extensions
357 that might cause ANSI-compliant code to be miscompiled. */
359 extern int flag_ansi
;
361 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
363 extern int flag_huge_objects
;
365 /* Nonzero if we want to conserve space in the .o files. We do this
366 by putting uninitialized data and runtime initialized data into
367 .common instead of .data at the expense of not flagging multiple
369 extern int flag_conserve_space
;
371 /* C and C++ flags are in decl2.c. */
373 /* Set to 0 at beginning of a constructor, set to 1
374 if that function does an allocation before referencing its
375 instance variable. */
376 #define current_function_assigns_this cp_function_chain->assigns_this
377 #define current_function_just_assigned_this \
378 cp_function_chain->just_assigned_this
380 /* Flag used when debugging spew.c */
382 extern int spew_debug
;
384 /* A expression of value 0 with the same precision as a sizetype
386 tree signed_size_zero_node
;
388 /* The name of the anonymous namespace, throughout this translation
390 tree anonymous_namespace_name
;
393 /* Allocate a level of searching. */
397 push_decl_level (stack
, obstack
)
398 struct stack_level
*stack
;
399 struct obstack
*obstack
;
401 struct stack_level tem
;
404 return push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
407 /* For each binding contour we allocate a binding_level structure
408 which records the names defined in that contour.
411 1) one for each function definition,
412 where internal declarations of the parameters appear.
413 2) one for each compound statement,
414 to record its declarations.
416 The current meaning of a name can be found by searching the levels
417 from the current one out to the global one.
419 Off to the side, may be the class_binding_level. This exists only
420 to catch class-local declarations. It is otherwise nonexistent.
422 Also there may be binding levels that catch cleanups that must be
423 run when exceptions occur. Thus, to see whether a name is bound in
424 the current scope, it is not enough to look in the
425 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
428 /* Note that the information in the `names' component of the global contour
429 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
433 /* A chain of _DECL nodes for all variables, constants, functions,
434 and typedef types. These are in the reverse of the order
435 supplied. There may be OVERLOADs on this list, too, but they
436 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
439 /* A list of structure, union and enum definitions, for looking up
441 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
442 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
443 or ENUMERAL_TYPE node.
445 C++: the TREE_VALUE nodes can be simple types for
446 component_bindings. */
449 /* A list of USING_DECL nodes. */
452 /* A list of used namespaces. PURPOSE is the namespace,
453 VALUE the common ancestor with this binding_level's namespace. */
454 tree using_directives
;
456 /* If this binding level is the binding level for a class, then
457 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
458 is the name of an entity bound in the class; the TREE_VALUE is
459 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
460 when leaving class scope, we can restore the
461 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
462 the DECL bound by this name in the class. */
465 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
466 is used for all binding levels. */
469 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
470 label in this scope. The TREE_PURPOSE is the previous value of
471 the IDENTIFIER_LABEL VALUE. */
472 tree shadowed_labels
;
474 /* For each level (except not the global one),
475 a chain of BLOCK nodes for all the levels
476 that were entered and exited one level down. */
479 /* The BLOCK node for this level, if one has been preallocated.
480 If 0, the BLOCK is allocated (if needed) when the level is popped. */
483 /* The binding level which this one is contained in (inherits from). */
484 struct binding_level
*level_chain
;
486 /* List of decls in `names' that have incomplete
487 structure or union types. */
490 /* List of VAR_DECLS saved from a previous for statement.
491 These would be dead in ANSI-conforming code, but might
492 be referenced in ARM-era code. These are stored in a
493 TREE_LIST; the TREE_VALUE is the actual declaration. */
494 tree dead_vars_from_for
;
496 /* 1 for the level that holds the parameters of a function.
497 2 for the level that holds a class declaration.
498 3 for levels that hold parameter declarations. */
499 unsigned parm_flag
: 4;
501 /* 1 means make a BLOCK for this level regardless of all else.
502 2 for temporary binding contours created by the compiler. */
505 /* Nonzero if this level "doesn't exist" for tags. */
506 unsigned tag_transparent
: 1;
508 /* Nonzero if this level can safely have additional
509 cleanup-needing variables added to it. */
510 unsigned more_cleanups_ok
: 1;
511 unsigned have_cleanups
: 1;
513 /* Nonzero if this level is for storing the decls for template
514 parameters and generic decls; these decls will be discarded and
515 replaced with a TEMPLATE_DECL. */
516 unsigned pseudo_global
: 1;
518 /* This is set for a namespace binding level. */
519 unsigned namespace_p
: 1;
521 /* True if this level is that of a for-statement where we need to
522 worry about ambiguous (ARM or ANSI) scope rules. */
523 unsigned is_for_scope
: 1;
525 /* True if this level corresponds to an EH region, as for a try block. */
526 unsigned eh_region
: 1;
528 /* One bit left for this word. */
530 #if defined(DEBUG_CP_BINDING_LEVELS)
531 /* Binding depth at which this level began. */
532 unsigned binding_depth
;
533 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
536 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
538 /* The binding level currently in effect. */
540 #define current_binding_level \
542 ? cp_function_chain->bindings \
543 : scope_chain->bindings)
545 /* The binding level of the current class, if any. */
547 #define class_binding_level scope_chain->class_bindings
549 /* A chain of binding_level structures awaiting reuse. */
551 static struct binding_level
*free_binding_level
;
553 /* The outermost binding level, for names of file scope.
554 This is created when the compiler is started and exists
555 through the entire run. */
557 static struct binding_level
*global_binding_level
;
559 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
561 static int keep_next_level_flag
;
563 #if defined(DEBUG_CP_BINDING_LEVELS)
564 static int binding_depth
= 0;
565 static int is_class_level
= 0;
572 for (i
= 0; i
< binding_depth
*2; i
++)
575 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
577 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
580 push_binding_level (newlevel
, tag_transparent
, keep
)
581 struct binding_level
*newlevel
;
582 int tag_transparent
, keep
;
584 /* Add this level to the front of the chain (stack) of levels that
586 bzero ((char*) newlevel
, sizeof (struct binding_level
));
587 newlevel
->level_chain
= current_binding_level
;
588 current_binding_level
= newlevel
;
589 newlevel
->tag_transparent
= tag_transparent
;
590 newlevel
->more_cleanups_ok
= 1;
592 /* We are called before expand_start_bindings, but after
593 expand_eh_region_start for a try block; so we check this now,
594 before the EH block is covered up. */
595 newlevel
->eh_region
= is_eh_region ();
597 newlevel
->keep
= keep
;
598 #if defined(DEBUG_CP_BINDING_LEVELS)
599 newlevel
->binding_depth
= binding_depth
;
601 fprintf (stderr
, "push %s level 0x%08x line %d\n",
602 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
605 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
608 /* Find the innermost enclosing class scope, and reset
609 CLASS_BINDING_LEVEL appropriately. */
612 find_class_binding_level ()
614 struct binding_level
*level
= current_binding_level
;
616 while (level
&& level
->parm_flag
!= 2)
617 level
= level
->level_chain
;
618 if (level
&& level
->parm_flag
== 2)
619 class_binding_level
= level
;
621 class_binding_level
= 0;
627 if (global_binding_level
)
629 /* Cannot pop a level, if there are none left to pop. */
630 if (current_binding_level
== global_binding_level
)
631 my_friendly_abort (123);
633 /* Pop the current level, and free the structure for reuse. */
634 #if defined(DEBUG_CP_BINDING_LEVELS)
637 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
638 (is_class_level
) ? "class" : "block",
639 current_binding_level
, lineno
);
640 if (is_class_level
!= (current_binding_level
== class_binding_level
))
643 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
646 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
648 register struct binding_level
*level
= current_binding_level
;
649 current_binding_level
= current_binding_level
->level_chain
;
650 level
->level_chain
= free_binding_level
;
651 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
652 if (level
->binding_depth
!= binding_depth
)
654 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
655 free_binding_level
= level
;
656 find_class_binding_level ();
661 suspend_binding_level ()
663 if (class_binding_level
)
664 current_binding_level
= class_binding_level
;
666 if (global_binding_level
)
668 /* Cannot suspend a level, if there are none left to suspend. */
669 if (current_binding_level
== global_binding_level
)
670 my_friendly_abort (123);
672 /* Suspend the current level. */
673 #if defined(DEBUG_CP_BINDING_LEVELS)
676 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
677 (is_class_level
) ? "class" : "block",
678 current_binding_level
, lineno
);
679 if (is_class_level
!= (current_binding_level
== class_binding_level
))
682 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
685 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
686 current_binding_level
= current_binding_level
->level_chain
;
687 find_class_binding_level ();
691 resume_binding_level (b
)
692 struct binding_level
*b
;
694 /* Resuming binding levels is meant only for namespaces,
695 and those cannot nest into classes. */
696 my_friendly_assert(!class_binding_level
, 386);
697 /* Also, resuming a non-directly nested namespace is a no-no. */
698 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
699 current_binding_level
= b
;
700 #if defined(DEBUG_CP_BINDING_LEVELS)
701 b
->binding_depth
= binding_depth
;
703 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
704 (is_class_level
) ? "class" : "block", b
, lineno
);
707 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
710 /* Create a new `struct binding_level'. */
713 struct binding_level
*
714 make_binding_level ()
717 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
720 /* Nonzero if we are currently in the global binding level. */
725 return current_binding_level
== global_binding_level
;
728 /* Return the innermost binding level that is not for a class scope. */
730 static struct binding_level
*
731 innermost_nonclass_level ()
733 struct binding_level
*b
;
735 b
= current_binding_level
;
736 while (b
->parm_flag
== 2)
742 /* Nonzero if we are currently in a toplevel binding level. This
743 means either the global binding level or a namespace in a toplevel
744 binding level. Since there are no non-toplevel namespace levels,
745 this really means any namespace or pseudo-global level. We also
746 include a class whose context is toplevel. */
749 toplevel_bindings_p ()
751 struct binding_level
*b
= innermost_nonclass_level ();
753 return b
->namespace_p
|| b
->pseudo_global
;
756 /* Nonzero if this is a namespace scope, or if we are defining a class
757 which is itself at namespace scope, or whose enclosing class is
758 such a class, etc. */
761 namespace_bindings_p ()
763 struct binding_level
*b
= innermost_nonclass_level ();
765 return b
->namespace_p
;
768 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
769 unconditionally. Otherwise, use the normal logic to decide whether
770 or not to create a BLOCK. */
773 keep_next_level (keep
)
776 keep_next_level_flag
= keep
;
779 /* Nonzero if the current level needs to have a BLOCK made. */
784 return (current_binding_level
->blocks
!= NULL_TREE
785 || current_binding_level
->keep
786 || current_binding_level
->names
!= NULL_TREE
787 || (current_binding_level
->tags
!= NULL_TREE
788 && !current_binding_level
->tag_transparent
));
791 /* Identify this binding level as a level of parameters. */
794 declare_parm_level ()
796 current_binding_level
->parm_flag
= 1;
800 declare_pseudo_global_level ()
802 current_binding_level
->pseudo_global
= 1;
806 declare_namespace_level ()
808 current_binding_level
->namespace_p
= 1;
812 pseudo_global_level_p ()
814 return current_binding_level
->pseudo_global
;
818 set_class_shadows (shadows
)
821 class_binding_level
->class_shadowed
= shadows
;
824 /* Enter a new binding level.
825 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
826 not for that of tags. */
829 pushlevel (tag_transparent
)
832 register struct binding_level
*newlevel
= NULL_BINDING_LEVEL
;
834 /* Reuse or create a struct for this binding level. */
836 #if defined(DEBUG_CP_BINDING_LEVELS)
838 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
839 if (free_binding_level
)
840 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
842 newlevel
= free_binding_level
;
843 free_binding_level
= free_binding_level
->level_chain
;
846 newlevel
= make_binding_level ();
848 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
849 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
850 keep_next_level_flag
= 0;
854 note_level_for_for ()
856 current_binding_level
->is_for_scope
= 1;
860 pushlevel_temporary (tag_transparent
)
863 pushlevel (tag_transparent
);
864 current_binding_level
->keep
= 2;
867 /* Note we don't call push_momentary() here. Otherwise, it would cause
868 cleanups to be allocated on the momentary obstack, and they will be
869 overwritten by the next statement. */
871 expand_start_bindings (0);
874 /* For a binding between a name and an entity at a block scope,
875 this is the `struct binding_level' for the block. */
876 #define BINDING_LEVEL(NODE) \
877 (((struct tree_binding*)NODE)->scope.level)
879 /* Make DECL the innermost binding for ID. The LEVEL is the binding
880 level at which this declaration is being bound. */
883 push_binding (id
, decl
, level
)
886 struct binding_level
* level
;
890 binding
= make_node (CPLUS_BINDING
);
892 /* Now, fill in the binding information. */
893 BINDING_VALUE (binding
) = decl
;
894 BINDING_TYPE (binding
) = NULL_TREE
;
895 BINDING_LEVEL (binding
) = level
;
896 INHERITED_VALUE_BINDING_P (binding
) = 0;
897 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
898 BINDING_HAS_LEVEL_P (binding
) = 1;
900 /* And put it on the front of the list of bindings for ID. */
901 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
902 IDENTIFIER_BINDING (id
) = binding
;
905 /* ID is already bound in the current scope. But, DECL is an
906 additional binding for ID in the same scope. This is the `struct
907 stat' hack whereby a non-typedef class-name or enum-name can be
908 bound at the same level as some other kind of entity. It's the
909 responsibility of the caller to check that inserting this name is
910 legal here. Returns nonzero if the new binding was successful. */
912 add_binding (id
, decl
)
916 tree binding
= IDENTIFIER_BINDING (id
);
919 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
920 /* The new name is the type name. */
921 BINDING_TYPE (binding
) = decl
;
922 else if (!BINDING_VALUE (binding
))
923 /* This situation arises when push_class_level_binding moves an
924 inherited type-binding out of the way to make room for a new
926 BINDING_VALUE (binding
) = decl
;
927 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
928 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
930 /* The old binding was a type name. It was placed in
931 BINDING_VALUE because it was thought, at the point it was
932 declared, to be the only entity with such a name. Move the
933 type name into the type slot; it is now hidden by the new
935 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
936 BINDING_VALUE (binding
) = decl
;
937 INHERITED_VALUE_BINDING_P (binding
) = 0;
939 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
940 && TREE_CODE (decl
) == TYPE_DECL
941 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
942 && same_type_p (TREE_TYPE (decl
),
943 TREE_TYPE (BINDING_VALUE (binding
))))
944 /* We have two typedef-names, both naming the same type to have
945 the same name. This is OK because of:
949 In a given scope, a typedef specifier can be used to redefine
950 the name of any type declared in that scope to refer to the
951 type to which it already refers. */
955 cp_error ("declaration of `%#D'", decl
);
956 cp_error_at ("conflicts with previous declaration `%#D'",
957 BINDING_VALUE (binding
));
964 /* Add DECL to the list of things declared in B. */
967 add_decl_to_level (decl
, b
)
969 struct binding_level
*b
;
971 /* Only things that will live forever should go in the global
973 my_friendly_assert (!(b
== global_binding_level
974 && !TREE_PERMANENT (decl
)),
977 /* We build up the list in reverse order, and reverse it later if
979 TREE_CHAIN (decl
) = b
->names
;
983 /* Bind DECL to ID in the current_binding_level, assumed to be a local
984 binding level. If PUSH_USING is set in FLAGS, we know that DECL
985 doesn't really belong to this binding level, that it got here
986 through a using-declaration. */
989 push_local_binding (id
, decl
, flags
)
994 struct binding_level
*b
;
996 /* Skip over any local classes. This makes sense if we call
997 push_local_binding with a friend decl of a local class. */
998 b
= current_binding_level
;
999 while (b
->parm_flag
== 2)
1002 if (lookup_name_current_level (id
))
1004 /* Supplement the existing binding. */
1005 if (!add_binding (id
, decl
))
1006 /* It didn't work. Something else must be bound at this
1007 level. Do not add DECL to the list of things to pop
1012 /* Create a new binding. */
1013 push_binding (id
, decl
, b
);
1015 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1016 /* We must put the OVERLOAD into a TREE_LIST since the
1017 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1018 decls that got here through a using-declaration. */
1019 decl
= build_tree_list (NULL_TREE
, decl
);
1021 /* And put DECL on the list of things declared by the current
1023 add_decl_to_level (decl
, b
);
1026 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1027 binding was successful. */
1030 push_class_binding (id
, decl
)
1035 tree binding
= IDENTIFIER_BINDING (id
);
1038 /* Note that we declared this value so that we can issue an error if
1039 this an illegal redeclaration of a name already used for some
1041 note_name_declared_in_class (id
, decl
);
1043 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1044 /* Supplement the existing binding. */
1045 result
= add_binding (id
, decl
);
1047 /* Create a new binding. */
1048 push_binding (id
, decl
, class_binding_level
);
1050 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1051 class-level declaration. Note that we do not use DECL here
1052 because of the possibility of the `struct stat' hack; if DECL is
1053 a class-name or enum-name we might prefer a field-name, or some
1055 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1057 /* If this is a binding from a base class, mark it as such. */
1058 binding
= IDENTIFIER_BINDING (id
);
1059 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1061 /* Any implicit typename must be from a base-class. The
1062 context for an implicit typename declaration is always
1063 the derived class in which the lookup was done, so the checks
1064 based on the context of DECL below will not trigger. */
1065 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1066 INHERITED_VALUE_BINDING_P (binding
) = 1;
1069 if (TREE_CODE (decl
) == OVERLOAD
)
1070 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
1073 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1075 context
= DECL_REAL_CONTEXT (decl
);
1078 if (is_properly_derived_from (current_class_type
, context
))
1079 INHERITED_VALUE_BINDING_P (binding
) = 1;
1081 INHERITED_VALUE_BINDING_P (binding
) = 0;
1084 else if (BINDING_VALUE (binding
) == decl
)
1085 /* We only encounter a TREE_LIST when push_class_decls detects an
1086 ambiguity. Such an ambiguity can be overridden by a definition
1088 INHERITED_VALUE_BINDING_P (binding
) = 1;
1093 /* Remove the binding for DECL which should be the innermost binding
1097 pop_binding (id
, decl
)
1103 if (id
== NULL_TREE
)
1104 /* It's easiest to write the loops that call this function without
1105 checking whether or not the entities involved have names. We
1106 get here for such an entity. */
1109 /* Get the innermost binding for ID. */
1110 binding
= IDENTIFIER_BINDING (id
);
1112 /* The name should be bound. */
1113 my_friendly_assert (binding
!= NULL_TREE
, 0);
1115 /* The DECL will be either the ordinary binding or the type
1116 binding for this identifier. Remove that binding. */
1117 if (BINDING_VALUE (binding
) == decl
)
1118 BINDING_VALUE (binding
) = NULL_TREE
;
1119 else if (BINDING_TYPE (binding
) == decl
)
1120 BINDING_TYPE (binding
) = NULL_TREE
;
1122 my_friendly_abort (0);
1124 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1125 /* We're completely done with the innermost binding for this
1126 identifier. Unhook it from the list of bindings. */
1127 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1130 /* When a label goes out of scope, check to see if that label was used
1131 in a valid manner, and issue any appropriate warnings or errors. */
1137 tree label
= TREE_VALUE (link
);
1139 if (DECL_INITIAL (label
) == NULL_TREE
)
1141 cp_error_at ("label `%D' used but not defined", label
);
1142 /* Avoid crashing later. */
1143 define_label (input_filename
, 1, DECL_NAME (label
));
1145 else if (warn_unused
&& !TREE_USED (label
))
1146 cp_warning_at ("label `%D' defined but not used", label
);
1148 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1151 /* At the end of a function, all labels declared within the fucntion
1152 go out of scope. BLOCK is the top-level block for the
1161 /* Clear out the definitions of all label names, since their scopes
1163 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1166 /* Put the labels into the "variables" of the top-level block,
1167 so debugger can see them. */
1168 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1169 BLOCK_VARS (block
) = TREE_VALUE (link
);
1172 named_labels
= NULL_TREE
;
1175 /* Exit a binding level.
1176 Pop the level off, and restore the state of the identifier-decl mappings
1177 that were in effect when this level was entered.
1179 If KEEP == 1, this level had explicit declarations, so
1180 and create a "block" (a BLOCK node) for the level
1181 to record its declarations and subblocks for symbol table output.
1183 If FUNCTIONBODY is nonzero, this level is the body of a function,
1184 so create a block as if KEEP were set and also clear out all
1187 If REVERSE is nonzero, reverse the order of decls before putting
1188 them into the BLOCK. */
1191 poplevel (keep
, reverse
, functionbody
)
1197 /* The chain of decls was accumulated in reverse order.
1198 Put it into forward order, just for cleanliness. */
1200 int tmp
= functionbody
;
1201 int real_functionbody
= current_binding_level
->keep
== 2
1202 ? ((functionbody
= 0), tmp
) : functionbody
;
1203 tree tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1204 tree subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1205 tree block
= NULL_TREE
;
1207 int block_previously_created
;
1208 int leaving_for_scope
;
1210 if (current_binding_level
->parm_flag
== 2)
1211 return poplevel_class ();
1213 my_friendly_assert (!current_binding_level
->class_shadowed
,
1216 /* We used to use KEEP == 2 to indicate that the new block should go
1217 at the beginning of the list of blocks at this binding level,
1218 rather than the end. This hack is no longer used. */
1219 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1221 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1222 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1223 current_binding_level
->parm_flag
,
1224 current_binding_level
->keep
);
1226 if (current_binding_level
->keep
== 1)
1229 /* Get the decls in the order they were written.
1230 Usually current_binding_level->names is in reverse order.
1231 But parameter decls were previously put in forward order. */
1234 current_binding_level
->names
1235 = decls
= nreverse (current_binding_level
->names
);
1237 decls
= current_binding_level
->names
;
1239 /* Output any nested inline functions within this block
1240 if they weren't already output. */
1242 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1243 if (TREE_CODE (decl
) == FUNCTION_DECL
1244 && ! TREE_ASM_WRITTEN (decl
)
1245 && DECL_INITIAL (decl
) != NULL_TREE
1246 && TREE_ADDRESSABLE (decl
)
1247 && decl_function_context (decl
) == current_function_decl
)
1249 /* If this decl was copied from a file-scope decl
1250 on account of a block-scope extern decl,
1251 propagate TREE_ADDRESSABLE to the file-scope decl. */
1252 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1253 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1256 push_function_context ();
1257 output_inline_function (decl
);
1258 pop_function_context ();
1262 /* If there were any declarations or structure tags in that level,
1263 or if this level is a function body,
1264 create a BLOCK to record them for the life of this function. */
1267 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1268 if (block_previously_created
)
1269 block
= current_binding_level
->this_block
;
1270 else if (keep
== 1 || functionbody
)
1271 block
= make_node (BLOCK
);
1272 if (block
!= NULL_TREE
)
1274 if (block_previously_created
)
1276 if (decls
|| tags
|| subblocks
)
1278 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1279 warning ("internal compiler error: debugging info corrupted");
1281 BLOCK_VARS (block
) = decls
;
1282 BLOCK_TYPE_TAGS (block
) = tags
;
1284 /* We can have previous subblocks and new subblocks when
1285 doing fixup_gotos with complex cleanups. We chain the new
1286 subblocks onto the end of any pre-existing subblocks. */
1287 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1290 /* If we created the block earlier on, and we are just
1291 diddling it now, then it already should have a proper
1292 BLOCK_END_NOTE value associated with it. */
1296 BLOCK_VARS (block
) = decls
;
1297 BLOCK_TYPE_TAGS (block
) = tags
;
1298 BLOCK_SUBBLOCKS (block
) = subblocks
;
1299 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1301 remember_end_note (block
);
1305 /* In each subblock, record that this is its superior. */
1308 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1309 BLOCK_SUPERCONTEXT (link
) = block
;
1311 /* We still support the old for-scope rules, whereby the variables
1312 in a for-init statement were in scope after the for-statement
1313 ended. We only use the new rules in flag_new_for_scope is
1316 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1318 /* Remove declarations for all the DECLs in this level. */
1319 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1321 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1324 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1328 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1330 ns_binding
= NULL_TREE
;
1333 && (BINDING_LEVEL (outer_binding
)
1334 == current_binding_level
->level_chain
))
1335 /* We have something like:
1340 and we are leaving the `for' scope. There's no reason to
1341 keep the binding of the inner `i' in this case. */
1342 pop_binding (DECL_NAME (link
), link
);
1343 else if ((outer_binding
1344 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1347 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1348 /* Here, we have something like:
1356 We must pop the for-scope binding so we know what's a
1357 type and what isn't. */
1358 pop_binding (DECL_NAME (link
), link
);
1361 /* Mark this VAR_DECL as dead so that we can tell we left it
1362 there only for backward compatibility. */
1363 DECL_DEAD_FOR_LOCAL (link
) = 1;
1365 /* Keep track of what should of have happenned when we
1366 popped the binding. */
1367 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1368 DECL_SHADOWED_FOR_VAR (link
)
1369 = BINDING_VALUE (outer_binding
);
1371 /* Add it to the list of dead variables in the next
1372 outermost binding to that we can remove these when we
1373 leave that binding. */
1374 current_binding_level
->level_chain
->dead_vars_from_for
1375 = tree_cons (NULL_TREE
, link
,
1376 current_binding_level
->level_chain
->
1377 dead_vars_from_for
);
1379 /* Although we don't pop the CPLUS_BINDING, we do clear
1380 its BINDING_LEVEL since the level is going away now. */
1381 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1387 /* Remove the binding. */
1389 if (TREE_CODE (decl
) == TREE_LIST
)
1390 decl
= TREE_VALUE (decl
);
1391 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1392 pop_binding (DECL_NAME (decl
), decl
);
1393 else if (TREE_CODE (decl
) == OVERLOAD
)
1394 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1396 my_friendly_abort (0);
1400 /* Remove declarations for any `for' variables from inner scopes
1401 that we kept around. */
1402 for (link
= current_binding_level
->dead_vars_from_for
;
1403 link
; link
= TREE_CHAIN (link
))
1404 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1406 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1407 for (link
= current_binding_level
->type_shadowed
;
1408 link
; link
= TREE_CHAIN (link
))
1409 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1411 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1412 for (link
= current_binding_level
->shadowed_labels
;
1414 link
= TREE_CHAIN (link
))
1417 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1418 list if a `using' declaration put them there. The debugging
1419 back-ends won't understand OVERLOAD, so we remove them here.
1420 Because the BLOCK_VARS are (temporarily) shared with
1421 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1422 popped all the bindings. */
1427 for (d
= &BLOCK_VARS (block
); *d
; )
1429 if (TREE_CODE (*d
) == TREE_LIST
)
1430 *d
= TREE_CHAIN (*d
);
1432 d
= &TREE_CHAIN (*d
);
1436 /* If the level being exited is the top level of a function,
1437 check over all the labels. */
1440 /* Since this is the top level block of a function, the vars are
1441 the function's parameters. Don't leave them in the BLOCK
1442 because they are found in the FUNCTION_DECL instead. */
1443 BLOCK_VARS (block
) = 0;
1447 /* Any uses of undefined labels now operate under constraints
1448 of next binding contour. */
1449 if (current_function
)
1451 struct binding_level
*level_chain
;
1452 level_chain
= current_binding_level
->level_chain
;
1455 struct named_label_list
*labels
;
1456 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1457 if (labels
->binding_level
== current_binding_level
)
1459 labels
->binding_level
= level_chain
;
1460 labels
->names_in_scope
= level_chain
->names
;
1465 tmp
= current_binding_level
->keep
;
1467 pop_binding_level ();
1469 DECL_INITIAL (current_function_decl
) = block
;
1472 if (!block_previously_created
)
1473 current_binding_level
->blocks
1474 = chainon (current_binding_level
->blocks
, block
);
1476 /* If we did not make a block for the level just exited,
1477 any blocks made for inner levels
1478 (since they cannot be recorded as subblocks in that level)
1479 must be carried forward so they will later become subblocks
1480 of something else. */
1482 current_binding_level
->blocks
1483 = chainon (current_binding_level
->blocks
, subblocks
);
1485 /* Take care of compiler's internal binding structures. */
1488 expand_end_bindings (getdecls (), keep
, 1);
1489 /* Each and every BLOCK node created here in `poplevel' is important
1490 (e.g. for proper debugging information) so if we created one
1491 earlier, mark it as "used". */
1493 TREE_USED (block
) = 1;
1494 block
= poplevel (keep
, reverse
, real_functionbody
);
1497 /* Each and every BLOCK node created here in `poplevel' is important
1498 (e.g. for proper debugging information) so if we created one
1499 earlier, mark it as "used". */
1501 TREE_USED (block
) = 1;
1505 /* Delete the node BLOCK from the current binding level.
1506 This is used for the block inside a stmt expr ({...})
1507 so that the block can be reinserted where appropriate. */
1510 delete_block (block
)
1514 if (current_binding_level
->blocks
== block
)
1515 current_binding_level
->blocks
= TREE_CHAIN (block
);
1516 for (t
= current_binding_level
->blocks
; t
;)
1518 if (TREE_CHAIN (t
) == block
)
1519 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1523 TREE_CHAIN (block
) = NULL_TREE
;
1524 /* Clear TREE_USED which is always set by poplevel.
1525 The flag is set again if insert_block is called. */
1526 TREE_USED (block
) = 0;
1529 /* Insert BLOCK at the end of the list of subblocks of the
1530 current binding level. This is used when a BIND_EXPR is expanded,
1531 to handle the BLOCK node inside the BIND_EXPR. */
1534 insert_block (block
)
1537 TREE_USED (block
) = 1;
1538 current_binding_level
->blocks
1539 = chainon (current_binding_level
->blocks
, block
);
1542 /* Set the BLOCK node for the innermost scope
1543 (the one we are currently in). */
1547 register tree block
;
1549 current_binding_level
->this_block
= block
;
1552 /* Do a pushlevel for class declarations. */
1557 register struct binding_level
*newlevel
;
1559 /* Reuse or create a struct for this binding level. */
1560 #if defined(DEBUG_CP_BINDING_LEVELS)
1562 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1563 if (free_binding_level
)
1564 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1566 newlevel
= free_binding_level
;
1567 free_binding_level
= free_binding_level
->level_chain
;
1570 newlevel
= make_binding_level ();
1572 #if defined(DEBUG_CP_BINDING_LEVELS)
1574 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1576 push_binding_level (newlevel
, 0, 0);
1578 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1579 class_binding_level
= current_binding_level
;
1580 class_binding_level
->parm_flag
= 2;
1583 /* ...and a poplevel for class declarations. */
1588 register struct binding_level
*level
= class_binding_level
;
1591 my_friendly_assert (level
!= 0, 354);
1593 decl_stack
= pop_stack_level (decl_stack
);
1594 /* If we're leaving a toplevel class, don't bother to do the setting
1595 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1596 shouldn't even be used when current_class_type isn't set, and second,
1597 if we don't touch it here, we're able to use the cache effect if the
1598 next time we're entering a class scope, it is the same class. */
1599 if (current_class_depth
!= 1)
1601 struct binding_level
* b
;
1603 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1604 for (shadowed
= level
->class_shadowed
;
1606 shadowed
= TREE_CHAIN (shadowed
))
1607 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1609 /* Find the next enclosing class, and recreate
1610 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1611 b
= level
->level_chain
;
1612 while (b
&& b
->parm_flag
!= 2)
1616 for (shadowed
= b
->class_shadowed
;
1618 shadowed
= TREE_CHAIN (shadowed
))
1622 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1623 while (t
&& BINDING_LEVEL (t
) != b
)
1627 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1628 = BINDING_VALUE (t
);
1632 /* Remember to save what IDENTIFIER's were bound in this scope so we
1633 can recover from cache misses. */
1635 previous_class_type
= current_class_type
;
1636 previous_class_values
= class_binding_level
->class_shadowed
;
1638 for (shadowed
= level
->type_shadowed
;
1640 shadowed
= TREE_CHAIN (shadowed
))
1641 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1643 /* Remove the bindings for all of the class-level declarations. */
1644 for (shadowed
= level
->class_shadowed
;
1646 shadowed
= TREE_CHAIN (shadowed
))
1647 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1649 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1650 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1651 class_binding_level
->parm_flag
,
1652 class_binding_level
->keep
);
1654 /* Now, pop out of the binding level which we created up in the
1655 `pushlevel_class' routine. */
1656 #if defined(DEBUG_CP_BINDING_LEVELS)
1658 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1660 pop_binding_level ();
1665 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1666 for any names in enclosing classes. */
1669 clear_identifier_class_values ()
1673 if (!class_binding_level
)
1676 for (t
= class_binding_level
->class_shadowed
;
1679 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1682 /* Returns non-zero if T is a virtual function table. */
1685 vtable_decl_p (t
, data
)
1687 void *data ATTRIBUTE_UNUSED
;
1689 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1692 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1696 vtype_decl_p (t
, data
)
1698 void *data ATTRIBUTE_UNUSED
;
1700 return (TREE_CODE (t
) == TYPE_DECL
1701 && TREE_TYPE (t
) != error_mark_node
1702 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1703 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1706 /* Return the declarations that are members of the namespace NS. */
1709 cp_namespace_decls (ns
)
1712 return NAMESPACE_LEVEL (ns
)->names
;
1715 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1716 itself, calling F for each. The DATA is passed to F as well. */
1719 walk_namespaces_r (namespace, f
, data
)
1721 walk_namespaces_fn f
;
1727 result
|= (*f
) (namespace, data
);
1729 for (current
= cp_namespace_decls (namespace);
1731 current
= TREE_CHAIN (current
))
1733 if (TREE_CODE (current
) != NAMESPACE_DECL
1734 || DECL_NAMESPACE_ALIAS (current
))
1736 if (!DECL_LANG_SPECIFIC (current
))
1739 my_friendly_assert (current
== std_node
, 393);
1743 /* We found a namespace. */
1744 result
|= walk_namespaces_r (current
, f
, data
);
1750 /* Walk all the namespaces, calling F for each. The DATA is passed to
1754 walk_namespaces (f
, data
)
1755 walk_namespaces_fn f
;
1758 return walk_namespaces_r (global_namespace
, f
, data
);
1761 struct walk_globals_data
{
1762 walk_globals_pred p
;
1767 /* Walk the global declarations in NAMESPACE. Whenever one is found
1768 for which P returns non-zero, call F with its address. If any call
1769 to F returns a non-zero value, return a non-zero value. */
1772 walk_globals_r (namespace, data
)
1776 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1777 walk_globals_pred p
= wgd
->p
;
1778 walk_globals_fn f
= wgd
->f
;
1779 void *d
= wgd
->data
;
1783 t
= &NAMESPACE_LEVEL (namespace)->names
;
1790 result
|= (*f
) (t
, d
);
1792 /* If F changed *T, then *T still points at the next item to
1795 t
= &TREE_CHAIN (*t
);
1801 /* Walk the global declarations. Whenever one is found for which P
1802 returns non-zero, call F with its address. If any call to F
1803 returns a non-zero value, return a non-zero value. */
1806 walk_globals (p
, f
, data
)
1807 walk_globals_pred p
;
1811 struct walk_globals_data wgd
;
1816 return walk_namespaces (walk_globals_r
, &wgd
);
1819 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1820 DATA is non-NULL, this is the last time we will call
1821 wrapup_global_declarations for this NAMESPACE. */
1824 wrapup_globals_for_namespace (namespace, data
)
1828 tree globals
= cp_namespace_decls (namespace);
1829 int len
= list_length (globals
);
1830 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1834 int last_time
= (data
!= 0);
1836 if (last_time
&& namespace == global_namespace
)
1837 /* Let compile_file handle the global namespace. */
1840 /* Process the decls in reverse order--earliest first.
1841 Put them into VEC from back to front, then take out from front. */
1843 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1844 vec
[len
- i
- 1] = decl
;
1848 check_global_declarations (vec
, len
);
1852 /* Temporarily mark vtables as external. That prevents
1853 wrapup_global_declarations from writing them out; we must process
1854 them ourselves in finish_vtable_vardecl. */
1855 for (i
= 0; i
< len
; ++i
)
1856 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1858 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1859 DECL_EXTERNAL (vec
[i
]) = 1;
1862 /* Write out any globals that need to be output. */
1863 result
= wrapup_global_declarations (vec
, len
);
1865 /* Undo the hack to DECL_EXTERNAL above. */
1866 for (i
= 0; i
< len
; ++i
)
1867 if (vtable_decl_p (vec
[i
], /*data=*/0)
1868 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1870 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1871 DECL_EXTERNAL (vec
[i
]) = 0;
1878 /* Mark ARG (which is really a struct binding_level **) for GC. */
1881 mark_binding_level (arg
)
1884 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1888 ggc_mark_tree (lvl
->names
);
1889 ggc_mark_tree (lvl
->tags
);
1890 ggc_mark_tree (lvl
->usings
);
1891 ggc_mark_tree (lvl
->using_directives
);
1892 ggc_mark_tree (lvl
->class_shadowed
);
1893 ggc_mark_tree (lvl
->type_shadowed
);
1894 ggc_mark_tree (lvl
->shadowed_labels
);
1895 ggc_mark_tree (lvl
->blocks
);
1896 ggc_mark_tree (lvl
->this_block
);
1897 ggc_mark_tree (lvl
->incomplete
);
1898 ggc_mark_tree (lvl
->dead_vars_from_for
);
1900 lvl
= lvl
->level_chain
;
1904 /* For debugging. */
1905 static int no_print_functions
= 0;
1906 static int no_print_builtins
= 0;
1909 print_binding_level (lvl
)
1910 struct binding_level
*lvl
;
1914 fprintf (stderr
, " blocks=");
1915 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1916 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1917 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1918 if (lvl
->tag_transparent
)
1919 fprintf (stderr
, " tag-transparent");
1920 if (lvl
->more_cleanups_ok
)
1921 fprintf (stderr
, " more-cleanups-ok");
1922 if (lvl
->have_cleanups
)
1923 fprintf (stderr
, " have-cleanups");
1924 fprintf (stderr
, "\n");
1927 fprintf (stderr
, " names:\t");
1928 /* We can probably fit 3 names to a line? */
1929 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1931 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1933 if (no_print_builtins
1934 && (TREE_CODE (t
) == TYPE_DECL
)
1935 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1938 /* Function decls tend to have longer names. */
1939 if (TREE_CODE (t
) == FUNCTION_DECL
)
1946 fprintf (stderr
, "\n\t");
1949 print_node_brief (stderr
, "", t
, 0);
1950 if (t
== error_mark_node
)
1954 fprintf (stderr
, "\n");
1958 fprintf (stderr
, " tags:\t");
1960 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1962 if (TREE_PURPOSE (t
) == NULL_TREE
)
1964 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1971 fprintf (stderr
, "\n\t");
1974 if (TREE_PURPOSE (t
) == NULL_TREE
)
1976 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1977 fprintf (stderr
, ">");
1979 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1980 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1983 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1984 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1985 fprintf (stderr
, ">");
1989 fprintf (stderr
, "\n");
1991 if (lvl
->class_shadowed
)
1993 fprintf (stderr
, " class-shadowed:");
1994 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1996 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1998 fprintf (stderr
, "\n");
2000 if (lvl
->type_shadowed
)
2002 fprintf (stderr
, " type-shadowed:");
2003 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2005 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2007 fprintf (stderr
, "\n");
2012 print_other_binding_stack (stack
)
2013 struct binding_level
*stack
;
2015 struct binding_level
*level
;
2016 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2018 fprintf (stderr
, "binding level ");
2019 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2020 fprintf (stderr
, "\n");
2021 print_binding_level (level
);
2026 print_binding_stack ()
2028 struct binding_level
*b
;
2029 fprintf (stderr
, "current_binding_level=");
2030 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2031 fprintf (stderr
, "\nclass_binding_level=");
2032 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2033 fprintf (stderr
, "\nglobal_binding_level=");
2034 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2035 fprintf (stderr
, "\n");
2036 if (class_binding_level
)
2038 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2039 if (b
== current_binding_level
)
2042 b
= class_binding_level
;
2044 b
= current_binding_level
;
2047 b
= current_binding_level
;
2048 print_other_binding_stack (b
);
2049 fprintf (stderr
, "global:\n");
2050 print_binding_level (global_binding_level
);
2053 /* Namespace binding access routines: The namespace_bindings field of
2054 the identifier is polymorphic, with three possible values:
2055 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2056 indicating the BINDING_VALUE of global_namespace. */
2058 /* Check whether the a binding for the name to scope is known.
2059 Assumes that the bindings of the name are already a list
2060 of bindings. Returns the binding found, or NULL_TREE. */
2063 find_binding (name
, scope
)
2067 tree iter
, prev
= NULL_TREE
;
2069 scope
= ORIGINAL_NAMESPACE (scope
);
2071 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2072 iter
= TREE_CHAIN (iter
))
2074 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2075 if (BINDING_SCOPE (iter
) == scope
)
2077 /* Move binding found to the front of the list, so
2078 subsequent lookups will find it faster. */
2081 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2082 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2083 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2092 /* Always returns a binding for name in scope. If the
2093 namespace_bindings is not a list, convert it to one first.
2094 If no binding is found, make a new one. */
2097 binding_for_name (name
, scope
)
2101 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2104 scope
= ORIGINAL_NAMESPACE (scope
);
2106 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2108 /* Get rid of optimization for global scope. */
2109 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2110 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2111 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2113 if (b
&& (result
= find_binding (name
, scope
)))
2115 /* Not found, make a new permanent one. */
2116 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2117 result
= make_node (CPLUS_BINDING
);
2118 TREE_CHAIN (result
) = b
;
2119 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2120 BINDING_SCOPE (result
) = scope
;
2121 BINDING_TYPE (result
) = NULL_TREE
;
2122 BINDING_VALUE (result
) = NULL_TREE
;
2127 /* Return the binding value for name in scope, considering that
2128 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2131 namespace_binding (name
, scope
)
2135 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2138 if (scope
== NULL_TREE
)
2139 scope
= global_namespace
;
2140 if (TREE_CODE (b
) != CPLUS_BINDING
)
2141 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2142 name
= find_binding (name
,scope
);
2143 if (name
== NULL_TREE
)
2145 return BINDING_VALUE (name
);
2148 /* Set the binding value for name in scope. If modifying the binding
2149 of global_namespace is attempted, try to optimize it. */
2152 set_namespace_binding (name
, scope
, val
)
2159 if (scope
== NULL_TREE
)
2160 scope
= global_namespace
;
2162 if (scope
== global_namespace
)
2164 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2165 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2167 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2171 b
= binding_for_name (name
, scope
);
2172 BINDING_VALUE (b
) = val
;
2175 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2176 select a name that is unique to this compilation unit. */
2179 push_namespace (name
)
2184 int implicit_use
= 0;
2186 if (!global_namespace
)
2188 /* This must be ::. */
2189 my_friendly_assert (name
== get_identifier ("::"), 377);
2194 /* The name of anonymous namespace is unique for the translation
2196 if (!anonymous_namespace_name
)
2197 anonymous_namespace_name
= get_file_function_name ('N');
2198 name
= anonymous_namespace_name
;
2199 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2201 /* Reopening anonymous namespace. */
2205 else if (current_namespace
== global_namespace
2206 && name
== DECL_NAME (std_node
))
2213 /* Check whether this is an extended namespace definition. */
2214 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2215 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2218 if (DECL_NAMESPACE_ALIAS (d
))
2220 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2221 d
, DECL_NAMESPACE_ALIAS (d
));
2222 d
= DECL_NAMESPACE_ALIAS (d
);
2229 /* Make a new namespace, binding the name to it. */
2230 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2231 /* The global namespace is not pushed, and the global binding
2232 level is set elsewhere. */
2237 declare_namespace_level ();
2238 NAMESPACE_LEVEL (d
) = current_binding_level
;
2242 resume_binding_level (NAMESPACE_LEVEL (d
));
2245 do_using_directive (d
);
2246 /* Enter the name space. */
2247 current_namespace
= d
;
2250 /* Pop from the scope of the current namespace. */
2255 if (current_namespace
== global_namespace
)
2257 my_friendly_assert (in_std
>0, 980421);
2261 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2262 /* The binding level is not popped, as it might be re-opened later. */
2263 suspend_binding_level ();
2266 /* Push into the scope of the namespace NS, even if it is deeply
2267 nested within another namespace. */
2270 push_nested_namespace (ns
)
2273 if (ns
== global_namespace
)
2274 push_to_top_level ();
2277 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2278 push_namespace (DECL_NAME (ns
));
2282 /* Pop back from the scope of the namespace NS, which was previously
2283 entered with push_nested_namespace. */
2286 pop_nested_namespace (ns
)
2289 while (ns
!= global_namespace
)
2292 ns
= CP_DECL_CONTEXT (ns
);
2295 pop_from_top_level ();
2299 /* Subroutines for reverting temporarily to top-level for instantiation
2300 of templates and such. We actually need to clear out the class- and
2301 local-value slots of all identifiers, so that only the global values
2302 are at all visible. Simply setting current_binding_level to the global
2303 scope isn't enough, because more binding levels may be pushed. */
2304 struct saved_scope
*scope_chain
;
2306 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2309 mark_saved_scope (arg
)
2312 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2315 mark_binding_level (&t
->class_bindings
);
2316 ggc_mark_tree (t
->old_bindings
);
2317 ggc_mark_tree (t
->old_namespace
);
2318 ggc_mark_tree (t
->class_name
);
2319 ggc_mark_tree (t
->class_type
);
2320 ggc_mark_tree (t
->access_specifier
);
2321 ggc_mark_tree (t
->function_decl
);
2323 ggc_mark_tree_varray (t
->lang_base
);
2324 ggc_mark_tree (t
->lang_name
);
2325 ggc_mark_tree (t
->x_function_parms
);
2326 ggc_mark_tree (t
->template_parms
);
2327 ggc_mark_tree (t
->x_previous_class_type
);
2328 ggc_mark_tree (t
->x_previous_class_values
);
2329 mark_binding_level (&t
->bindings
);
2335 store_bindings (names
, old_bindings
)
2336 tree names
, old_bindings
;
2339 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2341 tree binding
, t1
, id
;
2343 if (TREE_CODE (t
) == TREE_LIST
)
2344 id
= TREE_PURPOSE (t
);
2349 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2350 we have no IDENTIFIER_BINDING if we have left the class
2351 scope, but cached the class-level declarations. */
2352 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2355 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2356 if (TREE_VEC_ELT (t1
, 0) == id
)
2359 binding
= make_tree_vec (4);
2363 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2364 TREE_VEC_ELT (binding
, 0) = id
;
2365 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2366 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2367 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2368 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2369 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2371 TREE_CHAIN (binding
) = old_bindings
;
2372 old_bindings
= binding
;
2376 return old_bindings
;
2380 maybe_push_to_top_level (pseudo
)
2383 struct saved_scope
*s
;
2384 struct binding_level
*b
;
2388 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2390 b
= scope_chain
? current_binding_level
: 0;
2392 /* If we're in the middle of some function, save our state. */
2393 if (current_function
)
2396 push_function_context_to (NULL_TREE
);
2401 old_bindings
= NULL_TREE
;
2402 if (scope_chain
&& previous_class_type
)
2403 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2405 /* Have to include global_binding_level, because class-level decls
2406 aren't listed anywhere useful. */
2407 for (; b
; b
= b
->level_chain
)
2411 /* Template IDs are inserted into the global level. If they were
2412 inserted into namespace level, finish_file wouldn't find them
2413 when doing pending instantiations. Therefore, don't stop at
2414 namespace level, but continue until :: . */
2415 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2418 old_bindings
= store_bindings (b
->names
, old_bindings
);
2419 /* We also need to check class_shadowed to save class-level type
2420 bindings, since pushclass doesn't fill in b->names. */
2421 if (b
->parm_flag
== 2)
2422 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2424 /* Unwind type-value slots back to top level. */
2425 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2426 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2428 s
->prev
= scope_chain
;
2429 s
->old_bindings
= old_bindings
;
2431 s
->need_pop_function_context
= need_pop
;
2432 s
->function_decl
= current_function_decl
;
2435 current_function_decl
= NULL_TREE
;
2436 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2437 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2438 current_lang_name
= lang_name_cplusplus
;
2439 strict_prototype
= strict_prototypes_lang_cplusplus
;
2440 current_namespace
= global_namespace
;
2442 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2446 push_to_top_level ()
2448 maybe_push_to_top_level (0);
2452 pop_from_top_level ()
2454 struct saved_scope
*s
= scope_chain
;
2457 /* Clear out class-level bindings cache. */
2458 if (previous_class_type
)
2459 invalidate_class_lookup_cache ();
2463 VARRAY_FREE (current_lang_base
);
2465 scope_chain
= s
->prev
;
2466 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2468 tree id
= TREE_VEC_ELT (t
, 0);
2471 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2472 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2473 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2477 if (current_lang_name
== lang_name_cplusplus
)
2478 strict_prototype
= strict_prototypes_lang_cplusplus
;
2479 else if (current_lang_name
== lang_name_c
)
2480 strict_prototype
= strict_prototypes_lang_c
;
2482 /* If we were in the middle of compiling a function, restore our
2484 if (s
->need_pop_function_context
)
2485 pop_function_context_from (NULL_TREE
);
2486 current_function_decl
= s
->function_decl
;
2491 /* Push a definition of struct, union or enum tag "name".
2492 into binding_level "b". "type" should be the type node,
2493 We assume that the tag "name" is not already defined.
2495 Note that the definition may really be just a forward reference.
2496 In that case, the TYPE_SIZE will be a NULL_TREE.
2498 C++ gratuitously puts all these tags in the name space. */
2500 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2501 record the shadowed value for this binding contour. TYPE is
2502 the type that ID maps to. */
2505 set_identifier_type_value_with_scope (id
, type
, b
)
2508 struct binding_level
*b
;
2510 if (!b
->namespace_p
)
2512 /* Shadow the marker, not the real thing, so that the marker
2513 gets restored later. */
2514 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2516 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2520 tree binding
= binding_for_name (id
, current_namespace
);
2521 BINDING_TYPE (binding
) = type
;
2522 /* Store marker instead of real type. */
2523 type
= global_type_node
;
2525 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2528 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2531 set_identifier_type_value (id
, type
)
2535 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2538 /* Return the type associated with id. */
2541 identifier_type_value (id
)
2544 /* There is no type with that name, anywhere. */
2545 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2547 /* This is not the type marker, but the real thing. */
2548 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2549 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2550 /* Have to search for it. It must be on the global level, now.
2551 Ask lookup_name not to return non-types. */
2552 id
= lookup_name_real (id
, 2, 1, 0);
2554 return TREE_TYPE (id
);
2558 /* Pop off extraneous binding levels left over due to syntax errors.
2560 We don't pop past namespaces, as they might be valid. */
2565 #ifdef DEBUG_CP_BINDING_LEVELS
2566 fprintf (stderr
, "XXX entering pop_everything ()\n");
2568 while (!toplevel_bindings_p ())
2570 if (current_binding_level
->parm_flag
== 2)
2571 pop_nested_class ();
2575 #ifdef DEBUG_CP_BINDING_LEVELS
2576 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2580 /* The type TYPE is being declared. If it is a class template, or a
2581 specialization of a class template, do any processing required and
2582 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2583 being declared a friend. B is the binding level at which this TYPE
2586 Returns the TYPE_DECL for TYPE, which may have been altered by this
2590 maybe_process_template_type_declaration (type
, globalize
, b
)
2593 struct binding_level
* b
;
2595 tree decl
= TYPE_NAME (type
);
2597 if (processing_template_parmlist
)
2598 /* You can't declare a new template type in a template parameter
2599 list. But, you can declare a non-template type:
2601 template <class A*> struct S;
2603 is a forward-declaration of `A'. */
2607 maybe_check_template_type (type
);
2609 my_friendly_assert (IS_AGGR_TYPE (type
)
2610 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2613 if (processing_template_decl
)
2615 /* This may change after the call to
2616 push_template_decl_real, but we want the original value. */
2617 tree name
= DECL_NAME (decl
);
2619 decl
= push_template_decl_real (decl
, globalize
);
2620 /* If the current binding level is the binding level for the
2621 template parameters (see the comment in
2622 begin_template_parm_list) and the enclosing level is a class
2623 scope, and we're not looking at a friend, push the
2624 declaration of the member class into the class scope. In the
2625 friend case, push_template_decl will already have put the
2626 friend into global scope, if appropriate. */
2627 if (TREE_CODE (type
) != ENUMERAL_TYPE
2628 && !globalize
&& b
->pseudo_global
2629 && b
->level_chain
->parm_flag
== 2)
2631 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2632 /* Put this tag on the list of tags for the class, since
2633 that won't happen below because B is not the class
2634 binding level, but is instead the pseudo-global level. */
2635 b
->level_chain
->tags
=
2636 tree_cons (name
, type
, b
->level_chain
->tags
);
2637 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2638 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2646 /* In C++, you don't have to write `struct S' to refer to `S'; you
2647 can just use `S'. We accomplish this by creating a TYPE_DECL as
2648 if the user had written `typedef struct S S'. Create and return
2649 the TYPE_DECL for TYPE. */
2652 create_implicit_typedef (name
, type
)
2658 decl
= build_decl (TYPE_DECL
, name
, type
);
2659 SET_DECL_ARTIFICIAL (decl
);
2660 /* There are other implicit type declarations, like the one *within*
2661 a class that allows you to write `S::S'. We must distinguish
2663 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2664 TYPE_NAME (type
) = decl
;
2669 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2670 Normally put it into the inner-most non-tag-transparent scope,
2671 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2672 The latter is needed for implicit declarations. */
2675 pushtag (name
, type
, globalize
)
2679 register struct binding_level
*b
;
2681 b
= current_binding_level
;
2682 while (b
->tag_transparent
2683 || (globalize
&& b
->parm_flag
== 2))
2686 b
->tags
= tree_cons (name
, type
, b
->tags
);
2690 /* Do C++ gratuitous typedefing. */
2691 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2693 register tree d
= NULL_TREE
;
2695 tree context
= TYPE_CONTEXT (type
);
2699 tree cs
= current_scope ();
2703 else if (cs
!= NULL_TREE
2704 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2705 /* When declaring a friend class of a local class, we want
2706 to inject the newly named class into the scope
2707 containing the local class, not the namespace scope. */
2708 context
= hack_decl_function_context (get_type_decl (cs
));
2711 context
= current_namespace
;
2713 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2714 || b
->parm_flag
== 2)
2717 if (current_lang_name
== lang_name_java
)
2718 TYPE_FOR_JAVA (type
) = 1;
2720 d
= create_implicit_typedef (name
, type
);
2721 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2723 set_identifier_type_value_with_scope (name
, type
, b
);
2725 d
= maybe_process_template_type_declaration (type
,
2728 if (b
->parm_flag
== 2)
2730 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2731 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2732 class. But if it's a member template class, we
2733 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2735 finish_member_declaration (d
);
2737 pushdecl_class_level (d
);
2740 d
= pushdecl_with_scope (d
, b
);
2742 if (ANON_AGGRNAME_P (name
))
2743 DECL_IGNORED_P (d
) = 1;
2745 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2746 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2747 if (!uses_template_parms (type
))
2748 DECL_ASSEMBLER_NAME (d
)
2749 = get_identifier (build_overload_name (type
, 1, 1));
2751 if (b
->parm_flag
== 2)
2753 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2754 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2758 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2759 /* Use the canonical TYPE_DECL for this node. */
2760 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2763 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2764 will be the tagged type we just added to the current
2765 binding level. This fake NULL-named TYPE_DECL node helps
2766 dwarfout.c to know when it needs to output a
2767 representation of a tagged type, and it also gives us a
2768 convenient place to record the "scope start" address for
2771 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2772 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2776 /* Counter used to create anonymous type names. */
2778 static int anon_cnt
= 0;
2780 /* Return an IDENTIFIER which can be used as a name for
2781 anonymous structs and unions. */
2788 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2789 return get_identifier (buf
);
2792 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2793 This keeps dbxout from getting confused. */
2798 register struct binding_level
*b
;
2800 static int last_cnt
= 0;
2802 /* Fast out if no new anon names were declared. */
2803 if (last_cnt
== anon_cnt
)
2806 b
= current_binding_level
;
2807 while (b
->tag_transparent
)
2812 /* A NULL purpose means we have already processed all tags
2813 from here to the end of the list. */
2814 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2816 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2817 TREE_PURPOSE (tags
) = NULL_TREE
;
2818 tags
= TREE_CHAIN (tags
);
2820 last_cnt
= anon_cnt
;
2823 /* Subroutine of duplicate_decls: return truthvalue of whether
2824 or not types of these decls match.
2826 For C++, we must compare the parameter list so that `int' can match
2827 `int&' in a parameter position, but `int&' is not confused with
2831 decls_match (newdecl
, olddecl
)
2832 tree newdecl
, olddecl
;
2836 if (newdecl
== olddecl
)
2839 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2840 /* If the two DECLs are not even the same kind of thing, we're not
2841 interested in their types. */
2844 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2846 tree f1
= TREE_TYPE (newdecl
);
2847 tree f2
= TREE_TYPE (olddecl
);
2848 tree p1
= TYPE_ARG_TYPES (f1
);
2849 tree p2
= TYPE_ARG_TYPES (f2
);
2851 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2852 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2853 && DECL_LANGUAGE (olddecl
) == lang_c
))
2856 /* When we parse a static member function definition,
2857 we put together a FUNCTION_DECL which thinks its type
2858 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2860 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2861 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2862 else if (TREE_CODE (f2
) == METHOD_TYPE
2863 && DECL_STATIC_FUNCTION_P (newdecl
))
2864 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2866 /* Here we must take care of the case where new default
2867 parameters are specified. Also, warn if an old
2868 declaration becomes ambiguous because default
2869 parameters may cause the two to be ambiguous. */
2870 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2872 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2873 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2875 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2879 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2881 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2884 types_match
= self_promoting_args_p (p1
);
2885 if (p1
== void_list_node
)
2886 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2888 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2889 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2891 types_match
= self_promoting_args_p (p2
);
2892 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2895 types_match
= compparms (p1
, p2
);
2900 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2902 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2903 DECL_TEMPLATE_PARMS (olddecl
)))
2906 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2909 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2910 DECL_TEMPLATE_RESULT (newdecl
));
2914 if (TREE_TYPE (newdecl
) == error_mark_node
)
2915 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2916 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2917 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2918 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2921 types_match
= comptypes (TREE_TYPE (newdecl
),
2922 TREE_TYPE (olddecl
),
2923 COMPARE_REDECLARATION
);
2929 /* If NEWDECL is `static' and an `extern' was seen previously,
2930 warn about it. (OLDDECL may be NULL_TREE; NAME contains
2931 information about previous usage as an `extern'.)
2933 Note that this does not apply to the C++ case of declaring
2934 a variable `extern const' and then later `const'.
2936 Don't complain about built-in functions, since they are beyond
2937 the user's control. */
2940 warn_extern_redeclared_static (newdecl
, olddecl
)
2941 tree newdecl
, olddecl
;
2945 static const char *explicit_extern_static_warning
2946 = "`%D' was declared `extern' and later `static'";
2947 static const char *implicit_extern_static_warning
2948 = "`%D' was declared implicitly `extern' and later `static'";
2950 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2953 name
= DECL_ASSEMBLER_NAME (newdecl
);
2954 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
2956 /* It's okay to redeclare an ANSI built-in function as static,
2957 or to declare a non-ANSI built-in function as anything. */
2958 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
2959 && olddecl
!= NULL_TREE
2960 && TREE_CODE (olddecl
) == FUNCTION_DECL
2961 && DECL_ARTIFICIAL (olddecl
)))
2963 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2964 ? implicit_extern_static_warning
2965 : explicit_extern_static_warning
, newdecl
);
2966 if (olddecl
!= NULL_TREE
)
2967 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2972 /* Handle when a new declaration NEWDECL has the same name as an old
2973 one OLDDECL in the same binding contour. Prints an error message
2976 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2977 Otherwise, return 0. */
2980 duplicate_decls (newdecl
, olddecl
)
2981 tree newdecl
, olddecl
;
2983 unsigned olddecl_uid
= DECL_UID (olddecl
);
2984 int olddecl_friend
= 0, types_match
= 0;
2985 int new_defines_function
= 0;
2987 if (newdecl
== olddecl
)
2990 types_match
= decls_match (newdecl
, olddecl
);
2992 /* If either the type of the new decl or the type of the old decl is an
2993 error_mark_node, then that implies that we have already issued an
2994 error (earlier) for some bogus type specification, and in that case,
2995 it is rather pointless to harass the user with yet more error message
2996 about the same declaration, so just pretend the types match here. */
2997 if (TREE_TYPE (newdecl
) == error_mark_node
2998 || TREE_TYPE (olddecl
) == error_mark_node
)
3001 /* Check for redeclaration and other discrepancies. */
3002 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3003 && DECL_ARTIFICIAL (olddecl
))
3005 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3007 /* If you declare a built-in or predefined function name as static,
3008 the old definition is overridden, but optionally warn this was a
3009 bad choice of name. */
3010 if (! TREE_PUBLIC (newdecl
))
3013 cp_warning ("shadowing %s function `%#D'",
3014 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3016 /* Discard the old built-in function. */
3019 /* If the built-in is not ansi, then programs can override
3020 it even globally without an error. */
3021 else if (! DECL_BUILT_IN (olddecl
))
3022 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3026 cp_error ("declaration of `%#D'", newdecl
);
3027 cp_error ("conflicts with built-in declaration `%#D'",
3032 else if (!types_match
)
3034 if ((DECL_LANGUAGE (newdecl
) == lang_c
3035 && DECL_LANGUAGE (olddecl
) == lang_c
)
3036 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3037 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3039 /* A near match; override the builtin. */
3041 if (TREE_PUBLIC (newdecl
))
3043 cp_warning ("new declaration `%#D'", newdecl
);
3044 cp_warning ("ambiguates built-in declaration `%#D'",
3047 else if (warn_shadow
)
3048 cp_warning ("shadowing %s function `%#D'",
3049 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3053 /* Discard the old built-in function. */
3057 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3059 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3060 && TREE_CODE (newdecl
) != TYPE_DECL
3061 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3062 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3063 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3064 && TREE_CODE (olddecl
) != TYPE_DECL
3065 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3066 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3069 /* We do nothing special here, because C++ does such nasty
3070 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3071 get shadowed, and know that if we need to find a TYPE_DECL
3072 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3073 slot of the identifier. */
3077 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3078 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3079 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3080 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3083 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3084 if (TREE_CODE (olddecl
) == TREE_LIST
)
3085 olddecl
= TREE_VALUE (olddecl
);
3086 cp_error_at ("previous declaration of `%#D'", olddecl
);
3088 /* New decl is completely inconsistent with the old one =>
3089 tell caller to replace the old one. */
3093 else if (!types_match
)
3095 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3096 /* These are certainly not duplicate declarations; they're
3097 from different scopes. */
3100 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3102 /* The name of a class template may not be declared to refer to
3103 any other template, class, function, object, namespace, value,
3104 or type in the same scope. */
3105 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3106 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3108 cp_error ("declaration of template `%#D'", newdecl
);
3109 cp_error_at ("conflicts with previous declaration `%#D'",
3112 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3113 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3114 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3115 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3116 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3117 DECL_TEMPLATE_PARMS (olddecl
)))
3119 cp_error ("new declaration `%#D'", newdecl
);
3120 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3124 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3126 if (DECL_LANGUAGE (newdecl
) == lang_c
3127 && DECL_LANGUAGE (olddecl
) == lang_c
)
3129 cp_error ("declaration of C function `%#D' conflicts with",
3131 cp_error_at ("previous declaration `%#D' here", olddecl
);
3133 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3134 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3136 cp_error ("new declaration `%#D'", newdecl
);
3137 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3143 /* Already complained about this, so don't do so again. */
3144 else if (current_class_type
== NULL_TREE
3145 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3147 cp_error ("conflicting types for `%#D'", newdecl
);
3148 cp_error_at ("previous declaration as `%#D'", olddecl
);
3151 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3152 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3153 && (!DECL_TEMPLATE_INFO (newdecl
)
3154 || (DECL_TI_TEMPLATE (newdecl
)
3155 != DECL_TI_TEMPLATE (olddecl
))))
3156 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3157 && (!DECL_TEMPLATE_INFO (olddecl
)
3158 || (DECL_TI_TEMPLATE (olddecl
)
3159 != DECL_TI_TEMPLATE (newdecl
))))))
3160 /* It's OK to have a template specialization and a non-template
3161 with the same type, or to have specializations of two
3162 different templates with the same type. Note that if one is a
3163 specialization, and the other is an instantiation of the same
3164 template, that we do not exit at this point. That situation
3165 can occur if we instantiate a template class, and then
3166 specialize one of its methods. This situation is legal, but
3167 the declarations must be merged in the usual way. */
3169 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3170 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3171 && !DECL_USE_TEMPLATE (newdecl
))
3172 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3173 && !DECL_USE_TEMPLATE (olddecl
))))
3174 /* One of the declarations is a template instantiation, and the
3175 other is not a template at all. That's OK. */
3177 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3178 && DECL_NAMESPACE_ALIAS (newdecl
)
3179 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3180 /* Redeclaration of namespace alias, ignore it. */
3184 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3187 cp_error (errmsg
, newdecl
);
3188 if (DECL_NAME (olddecl
) != NULL_TREE
)
3189 cp_error_at ((DECL_INITIAL (olddecl
)
3190 && namespace_bindings_p ())
3191 ? "`%#D' previously defined here"
3192 : "`%#D' previously declared here", olddecl
);
3194 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3195 && DECL_INITIAL (olddecl
) != NULL_TREE
3196 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3197 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3199 /* Prototype decl follows defn w/o prototype. */
3200 cp_warning_at ("prototype for `%#D'", newdecl
);
3201 cp_warning_at ("follows non-prototype definition here", olddecl
);
3203 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3204 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3206 /* extern "C" int foo ();
3207 int foo () { bar (); }
3209 if (current_lang_stack
3210 == &VARRAY_TREE (current_lang_base
, 0))
3211 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3214 cp_error_at ("previous declaration of `%#D' with %L linkage",
3215 olddecl
, DECL_LANGUAGE (olddecl
));
3216 cp_error ("conflicts with new declaration with %L linkage",
3217 DECL_LANGUAGE (newdecl
));
3221 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3223 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3225 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3226 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3229 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3230 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3232 for (; t1
&& t1
!= void_list_node
;
3233 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3234 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3236 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3241 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3243 cp_pedwarn_at ("after previous specification in `%#D'",
3249 cp_error ("default argument given for parameter %d of `%#D'",
3251 cp_error_at ("after previous specification in `%#D'",
3256 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3257 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3259 cp_warning ("`%#D' was used before it was declared inline",
3261 cp_warning_at ("previous non-inline declaration here",
3267 /* If new decl is `static' and an `extern' was seen previously,
3269 warn_extern_redeclared_static (newdecl
, olddecl
);
3271 /* We have committed to returning 1 at this point. */
3272 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3274 /* Now that functions must hold information normally held
3275 by field decls, there is extra work to do so that
3276 declaration information does not get destroyed during
3278 if (DECL_VINDEX (olddecl
))
3279 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3280 if (DECL_CONTEXT (olddecl
))
3281 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3282 if (DECL_CLASS_CONTEXT (olddecl
))
3283 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3284 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3285 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3286 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3287 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3288 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3289 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3290 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3291 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3293 /* Optionally warn about more than one declaration for the same
3294 name, but don't warn about a function declaration followed by a
3296 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3297 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3298 /* Don't warn about extern decl followed by definition. */
3299 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3300 /* Don't warn about friends, let add_friend take care of it. */
3301 && ! DECL_FRIEND_P (newdecl
))
3303 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3304 cp_warning_at ("previous declaration of `%D'", olddecl
);
3308 /* Deal with C++: must preserve virtual function table size. */
3309 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3311 register tree newtype
= TREE_TYPE (newdecl
);
3312 register tree oldtype
= TREE_TYPE (olddecl
);
3314 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3315 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3317 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3318 CLASSTYPE_FRIEND_CLASSES (newtype
)
3319 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3323 /* Copy all the DECL_... slots specified in the new decl
3324 except for any that we copy here from the old type. */
3325 DECL_MACHINE_ATTRIBUTES (newdecl
)
3326 = merge_machine_decl_attributes (olddecl
, newdecl
);
3328 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3330 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3331 DECL_TEMPLATE_RESULT (olddecl
)))
3332 cp_error ("invalid redeclaration of %D", newdecl
);
3333 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3334 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3335 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3336 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3343 /* Automatically handles default parameters. */
3344 tree oldtype
= TREE_TYPE (olddecl
);
3347 /* Make sure we put the new type in the same obstack as the old one. */
3349 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3351 push_permanent_obstack ();
3353 /* Merge the data types specified in the two decls. */
3354 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3356 if (TREE_CODE (newdecl
) == VAR_DECL
)
3357 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3358 /* Do this after calling `common_type' so that default
3359 parameters don't confuse us. */
3360 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3361 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3362 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3364 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3365 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3366 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3367 TYPE_RAISES_EXCEPTIONS (oldtype
));
3369 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3370 && DECL_SOURCE_LINE (olddecl
) != 0
3372 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3373 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3375 cp_error ("declaration of `%F' throws different exceptions",
3377 cp_error_at ("to previous declaration `%F'", olddecl
);
3380 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3382 /* Lay the type out, unless already done. */
3383 if (! same_type_p (newtype
, oldtype
)
3384 && TREE_TYPE (newdecl
) != error_mark_node
3385 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3386 layout_type (TREE_TYPE (newdecl
));
3388 if ((TREE_CODE (newdecl
) == VAR_DECL
3389 || TREE_CODE (newdecl
) == PARM_DECL
3390 || TREE_CODE (newdecl
) == RESULT_DECL
3391 || TREE_CODE (newdecl
) == FIELD_DECL
3392 || TREE_CODE (newdecl
) == TYPE_DECL
)
3393 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3394 layout_decl (newdecl
, 0);
3396 /* Merge the type qualifiers. */
3397 if (TREE_READONLY (newdecl
))
3398 TREE_READONLY (olddecl
) = 1;
3399 if (TREE_THIS_VOLATILE (newdecl
))
3400 TREE_THIS_VOLATILE (olddecl
) = 1;
3402 /* Merge the initialization information. */
3403 if (DECL_INITIAL (newdecl
) == NULL_TREE
3404 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3406 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3407 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3408 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3409 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3410 && DECL_LANG_SPECIFIC (newdecl
)
3411 && DECL_LANG_SPECIFIC (olddecl
))
3412 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3415 /* Merge the section attribute.
3416 We want to issue an error if the sections conflict but that must be
3417 done later in decl_attributes since we are called before attributes
3419 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3420 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3422 /* Keep the old rtl since we can safely use it, unless it's the
3423 call to abort() used for abstract virtuals. */
3424 if ((DECL_LANG_SPECIFIC (olddecl
)
3425 && !DECL_ABSTRACT_VIRTUAL_P (olddecl
))
3426 || DECL_RTL (olddecl
) != DECL_RTL (abort_fndecl
))
3427 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3431 /* If cannot merge, then use the new type and qualifiers,
3432 and don't preserve the old rtl. */
3435 /* Clean out any memory we had of the old declaration. */
3436 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3438 TREE_VALUE (oldstatic
) = error_mark_node
;
3440 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3441 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3442 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3443 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3446 /* Merge the storage class information. */
3447 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3448 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3449 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3450 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3451 if (! DECL_EXTERNAL (olddecl
))
3452 DECL_EXTERNAL (newdecl
) = 0;
3454 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3456 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3457 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3458 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3459 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3460 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3461 /* Don't really know how much of the language-specific
3462 values we should copy from old to new. */
3463 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3464 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3465 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3466 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3467 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3469 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3470 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3471 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3472 DECL_BEFRIENDING_CLASSES (newdecl
)
3473 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3474 DECL_BEFRIENDING_CLASSES (olddecl
));
3477 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3479 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3480 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3482 /* If newdecl is not a specialization, then it is not a
3483 template-related function at all. And that means that we
3484 shoud have exited above, returning 0. */
3485 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3488 if (TREE_USED (olddecl
))
3489 /* From [temp.expl.spec]:
3491 If a template, a member template or the member of a class
3492 template is explicitly specialized then that
3493 specialization shall be declared before the first use of
3494 that specialization that would cause an implicit
3495 instantiation to take place, in every translation unit in
3496 which such a use occurs. */
3497 cp_error ("explicit specialization of %D after first use",
3500 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3502 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3504 /* If either decl says `inline', this fn is inline, unless its
3505 definition was passed already. */
3506 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3507 DECL_INLINE (olddecl
) = 1;
3508 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3512 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3513 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3514 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3516 if (! types_match
|| new_defines_function
)
3518 /* These need to be copied so that the names are available.
3519 Note that if the types do match, we'll preserve inline
3520 info and other bits, but if not, we won't. */
3521 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3522 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3524 if (new_defines_function
)
3525 /* If defining a function declared with other language
3526 linkage, use the previously declared language linkage. */
3527 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3528 else if (types_match
)
3530 /* If redeclaring a builtin function, and not a definition,
3531 it stays built in. */
3532 if (DECL_BUILT_IN (olddecl
))
3534 DECL_BUILT_IN (newdecl
) = 1;
3535 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3536 /* If we're keeping the built-in definition, keep the rtl,
3537 regardless of declaration matches. */
3538 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3541 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3543 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3544 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3545 /* Previously saved insns go together with
3546 the function's previous definition. */
3547 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3548 /* Don't clear out the arguments if we're redefining a function. */
3549 if (DECL_ARGUMENTS (olddecl
))
3550 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3552 if (DECL_LANG_SPECIFIC (olddecl
))
3553 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3556 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3558 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3561 /* Now preserve various other info from the definition. */
3562 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3563 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3564 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3565 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3567 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3571 function_size
= sizeof (struct tree_decl
);
3573 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3574 (char *) olddecl
+ sizeof (struct tree_common
),
3575 function_size
- sizeof (struct tree_common
));
3577 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3579 /* If newdecl is a template instantiation, it is possible that
3580 the following sequence of events has occurred:
3582 o A friend function was declared in a class template. The
3583 class template was instantiated.
3585 o The instantiation of the friend declaration was
3586 recorded on the instantiation list, and is newdecl.
3588 o Later, however, instantiate_class_template called pushdecl
3589 on the newdecl to perform name injection. But, pushdecl in
3590 turn called duplicate_decls when it discovered that another
3591 declaration of a global function with the same name already
3594 o Here, in duplicate_decls, we decided to clobber newdecl.
3596 If we're going to do that, we'd better make sure that
3597 olddecl, and not newdecl, is on the list of
3598 instantiations so that if we try to do the instantiation
3599 again we won't get the clobbered declaration. */
3601 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3602 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3604 for (; decls
; decls
= TREE_CHAIN (decls
))
3605 if (TREE_VALUE (decls
) == newdecl
)
3606 TREE_VALUE (decls
) = olddecl
;
3611 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3612 (char *) olddecl
+ sizeof (struct tree_common
),
3613 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3614 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3617 DECL_UID (olddecl
) = olddecl_uid
;
3619 DECL_FRIEND_P (olddecl
) = 1;
3621 /* NEWDECL contains the merged attribute lists.
3622 Update OLDDECL to be the same. */
3623 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3628 /* Record a decl-node X as belonging to the current lexical scope.
3629 Check for errors (such as an incompatible declaration for the same
3630 name already seen in the same scope).
3632 Returns either X or an old decl for the same name.
3633 If an old decl is returned, it may have been smashed
3634 to agree with what X says. */
3641 register tree name
= DECL_ASSEMBLER_NAME (x
);
3642 int need_new_binding
= 1;
3644 if (DECL_TEMPLATE_PARM_P (x
))
3645 /* Template parameters have no context; they are not X::T even
3646 when declared within a class or namespace. */
3650 if (current_function_decl
&& x
!= current_function_decl
3651 /* A local declaration for a function doesn't constitute
3653 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3654 /* Don't change DECL_CONTEXT of virtual methods. */
3655 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3656 && !DECL_CONTEXT (x
))
3657 DECL_CONTEXT (x
) = current_function_decl
;
3658 if (!DECL_CONTEXT (x
))
3659 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3662 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3663 compiler wants to use. */
3664 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3665 || TREE_CODE (x
) == NAMESPACE_DECL
)
3666 name
= DECL_NAME (x
);
3671 /* Not needed...see below. */
3675 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3676 name
= TREE_OPERAND (name
, 0);
3678 /* Namespace-scoped variables are not found in the current level. */
3679 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3680 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3682 t
= lookup_name_current_level (name
);
3683 if (t
== error_mark_node
)
3685 /* error_mark_node is 0 for a while during initialization! */
3687 cp_error_at ("`%#D' used prior to declaration", x
);
3690 else if (t
!= NULL_TREE
)
3693 /* This is turned off until I have time to do it right (bpk). */
3694 /* With the code below that uses it... */
3695 file
= DECL_SOURCE_FILE (t
);
3696 line
= DECL_SOURCE_LINE (t
);
3698 if (TREE_CODE (t
) == PARM_DECL
)
3700 if (DECL_CONTEXT (t
) == NULL_TREE
)
3701 fatal ("parse errors have confused me too much");
3703 /* Check for duplicate params. */
3704 if (duplicate_decls (x
, t
))
3707 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3708 || DECL_FUNCTION_TEMPLATE_P (x
))
3709 && is_overloaded_fn (t
))
3710 /* Don't do anything just yet. */;
3711 else if (t
== wchar_decl_node
)
3713 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3714 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3716 /* Throw away the redeclaration. */
3719 else if (TREE_CODE (t
) != TREE_CODE (x
))
3721 if (duplicate_decls (x
, t
))
3724 else if (duplicate_decls (x
, t
))
3727 /* This is turned off until I have time to do it right (bpk). */
3729 /* Also warn if they did a prototype with `static' on it, but
3730 then later left the `static' off. */
3731 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3733 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3738 cp_warning ("`static' missing from declaration of `%D'",
3740 warning_with_file_and_line (file
, line
,
3741 "previous declaration of `%s'",
3742 decl_as_string (t
, 0));
3745 /* Now fix things so it'll do what they expect. */
3746 if (current_function_decl
)
3747 TREE_PUBLIC (current_function_decl
) = 0;
3749 /* Due to interference in memory reclamation (X may be
3750 obstack-deallocated at this point), we must guard against
3751 one really special case. [jason: This should be handled
3752 by start_function] */
3753 if (current_function_decl
== x
)
3754 current_function_decl
= t
;
3756 if (TREE_CODE (t
) == TYPE_DECL
)
3757 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3758 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3759 check_default_args (t
);
3763 else if (DECL_MAIN_P (x
))
3765 /* A redeclaration of main, but not a duplicate of the
3770 This function shall not be overloaded. */
3771 cp_error_at ("invalid redeclaration of `%D'", t
);
3772 cp_error ("as `%D'", x
);
3773 /* We don't try to push this declaration since that
3779 check_template_shadow (x
);
3781 /* If this is a function conjured up by the backend, massage it
3782 so it looks friendly. */
3783 if (TREE_CODE (x
) == FUNCTION_DECL
3784 && ! DECL_LANG_SPECIFIC (x
))
3786 retrofit_lang_decl (x
);
3787 DECL_LANGUAGE (x
) = lang_c
;
3790 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3792 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3793 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3795 if (!namespace_bindings_p ())
3796 /* We do not need to create a binding for this name;
3797 push_overloaded_decl will have already done so if
3799 need_new_binding
= 0;
3801 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3803 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3805 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3809 /* If declaring a type as a typedef, copy the type (unless we're
3810 at line 0), and install this TYPE_DECL as the new type's typedef
3811 name. See the extensive comment in ../c-decl.c (pushdecl). */
3812 if (TREE_CODE (x
) == TYPE_DECL
)
3814 tree type
= TREE_TYPE (x
);
3815 if (DECL_SOURCE_LINE (x
) == 0)
3817 if (TYPE_NAME (type
) == 0)
3818 TYPE_NAME (type
) = x
;
3820 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3821 /* We don't want to copy the type when all we're
3822 doing is making a TYPE_DECL for the purposes of
3824 && (!TYPE_NAME (type
)
3825 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3827 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3829 DECL_ORIGINAL_TYPE (x
) = type
;
3830 type
= build_type_copy (type
);
3831 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3832 TYPE_NAME (type
) = x
;
3833 TREE_TYPE (x
) = type
;
3838 if (type
!= error_mark_node
3840 && TYPE_IDENTIFIER (type
))
3841 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3842 current_binding_level
);
3846 /* Multiple external decls of the same identifier ought to match.
3848 We get warnings about inline functions where they are defined.
3849 We get warnings about other functions from push_overloaded_decl.
3851 Avoid duplicate warnings where they are used. */
3852 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3856 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3857 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3858 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3859 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3864 /* If different sort of thing, we already gave an error. */
3865 && TREE_CODE (decl
) == TREE_CODE (x
)
3866 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3868 cp_pedwarn ("type mismatch with previous external decl", x
);
3869 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3873 /* This name is new in its binding level.
3874 Install the new declaration and return it. */
3875 if (namespace_bindings_p ())
3877 /* Install a global value. */
3879 /* If the first global decl has external linkage,
3880 warn if we later see static one. */
3881 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3882 TREE_PUBLIC (name
) = 1;
3884 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3887 if (TREE_CODE (x
) == FUNCTION_DECL
)
3889 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3890 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3891 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3894 /* Don't forget if the function was used via an implicit decl. */
3895 if (IDENTIFIER_IMPLICIT_DECL (name
)
3896 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3899 /* Don't forget if its address was taken in that way. */
3900 if (IDENTIFIER_IMPLICIT_DECL (name
)
3901 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3902 TREE_ADDRESSABLE (x
) = 1;
3904 /* Warn about mismatches against previous implicit decl. */
3905 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3906 /* If this real decl matches the implicit, don't complain. */
3907 && ! (TREE_CODE (x
) == FUNCTION_DECL
3908 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3910 ("`%D' was previously implicitly declared to return `int'", x
);
3912 /* If new decl is `static' and an `extern' was seen previously,
3914 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3915 warn_extern_redeclared_static (x
, t
);
3919 /* Here to install a non-global value. */
3920 tree oldlocal
= IDENTIFIER_VALUE (name
);
3921 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3923 if (need_new_binding
)
3925 push_local_binding (name
, x
, 0);
3926 /* Because push_local_binding will hook X on to the
3927 current_binding_level's name list, we don't want to
3928 do that again below. */
3929 need_new_binding
= 0;
3932 /* If this is a TYPE_DECL, push it into the type value slot. */
3933 if (TREE_CODE (x
) == TYPE_DECL
)
3934 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3935 current_binding_level
);
3937 /* Clear out any TYPE_DECL shadowed by a namespace so that
3938 we won't think this is a type. The C struct hack doesn't
3939 go through namespaces. */
3940 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3941 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3942 current_binding_level
);
3944 /* If this is an extern function declaration, see if we
3945 have a global definition or declaration for the function. */
3946 if (oldlocal
== NULL_TREE
3947 && DECL_EXTERNAL (x
)
3948 && oldglobal
!= NULL_TREE
3949 && TREE_CODE (x
) == FUNCTION_DECL
3950 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3952 /* We have one. Their types must agree. */
3953 if (decls_match (x
, oldglobal
))
3957 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3958 cp_warning_at ("global declaration `%#D'", oldglobal
);
3961 /* If we have a local external declaration,
3962 and no file-scope declaration has yet been seen,
3963 then if we later have a file-scope decl it must not be static. */
3964 if (oldlocal
== NULL_TREE
3965 && oldglobal
== NULL_TREE
3966 && DECL_EXTERNAL (x
)
3968 TREE_PUBLIC (name
) = 1;
3970 if (DECL_FROM_INLINE (x
))
3971 /* Inline decls shadow nothing. */;
3973 /* Warn if shadowing an argument at the top level of the body. */
3974 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3975 && TREE_CODE (oldlocal
) == PARM_DECL
3976 /* Don't complain if it's from an enclosing function. */
3977 && DECL_CONTEXT (oldlocal
) == current_function_decl
3978 && TREE_CODE (x
) != PARM_DECL
)
3980 /* Go to where the parms should be and see if we
3982 struct binding_level
*b
= current_binding_level
->level_chain
;
3988 if (b
->parm_flag
== 1)
3989 cp_error ("declaration of `%#D' shadows a parameter", name
);
3991 else if (warn_shadow
&& oldlocal
!= NULL_TREE
3992 && current_binding_level
->is_for_scope
3993 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3995 warning ("variable `%s' shadows local",
3996 IDENTIFIER_POINTER (name
));
3997 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3999 /* Maybe warn if shadowing something else. */
4000 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4001 /* No shadow warnings for internally generated vars. */
4002 && ! DECL_ARTIFICIAL (x
)
4003 /* No shadow warnings for vars made for inlining. */
4004 && ! DECL_FROM_INLINE (x
))
4006 const char *warnstring
= NULL
;
4008 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4009 warnstring
= "declaration of `%s' shadows a parameter";
4010 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4011 && current_class_ptr
4012 && !TREE_STATIC (name
))
4013 warnstring
= "declaration of `%s' shadows a member of `this'";
4014 else if (oldlocal
!= NULL_TREE
)
4015 warnstring
= "declaration of `%s' shadows previous local";
4016 else if (oldglobal
!= NULL_TREE
)
4017 /* XXX shadow warnings in outer-more namespaces */
4018 warnstring
= "declaration of `%s' shadows global declaration";
4021 warning (warnstring
, IDENTIFIER_POINTER (name
));
4025 if (TREE_CODE (x
) == FUNCTION_DECL
)
4026 check_default_args (x
);
4028 /* Keep count of variables in this level with incomplete type. */
4029 if (TREE_CODE (x
) == VAR_DECL
4030 && TREE_TYPE (x
) != error_mark_node
4031 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4032 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4033 /* RTTI TD entries are created while defining the type_info. */
4034 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4035 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4036 current_binding_level
->incomplete
4037 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4040 if (need_new_binding
)
4041 add_decl_to_level (x
, current_binding_level
);
4046 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4047 caller to set DECL_CONTEXT properly. */
4050 pushdecl_with_scope (x
, level
)
4052 struct binding_level
*level
;
4054 register struct binding_level
*b
;
4055 tree function_decl
= current_function_decl
;
4057 current_function_decl
= NULL_TREE
;
4058 if (level
->parm_flag
== 2)
4060 b
= class_binding_level
;
4061 class_binding_level
= level
;
4062 pushdecl_class_level (x
);
4063 class_binding_level
= b
;
4067 b
= current_binding_level
;
4068 current_binding_level
= level
;
4070 current_binding_level
= b
;
4072 current_function_decl
= function_decl
;
4076 /* Like pushdecl, only it places X in the current namespace,
4080 pushdecl_namespace_level (x
)
4083 register struct binding_level
*b
= current_binding_level
;
4086 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4088 /* Now, the type_shadowed stack may screw us. Munge it so it does
4090 if (TREE_CODE (x
) == TYPE_DECL
)
4092 tree name
= DECL_NAME (x
);
4094 tree
*ptr
= (tree
*)0;
4095 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4097 tree shadowed
= b
->type_shadowed
;
4098 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4099 if (TREE_PURPOSE (shadowed
) == name
)
4101 ptr
= &TREE_VALUE (shadowed
);
4102 /* Can't break out of the loop here because sometimes
4103 a binding level will have duplicate bindings for
4104 PT names. It's gross, but I haven't time to fix it. */
4107 newval
= TREE_TYPE (x
);
4108 if (ptr
== (tree
*)0)
4110 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4111 up here if this is changed to an assertion. --KR */
4112 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4122 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4126 pushdecl_top_level (x
)
4129 tree cur_namespace
= current_namespace
;
4130 current_namespace
= global_namespace
;
4131 x
= pushdecl_namespace_level (x
);
4132 current_namespace
= cur_namespace
;
4136 /* Make the declaration of X appear in CLASS scope. */
4139 pushdecl_class_level (x
)
4142 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4143 scope looks for the pre-mangled name. */
4146 if (TREE_CODE (x
) == OVERLOAD
)
4147 x
= OVL_CURRENT (x
);
4148 name
= DECL_NAME (x
);
4152 push_class_level_binding (name
, x
);
4153 if (TREE_CODE (x
) == TYPE_DECL
)
4154 set_identifier_type_value (name
, TREE_TYPE (x
));
4156 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4160 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4163 pushdecl_class_level (f
);
4167 /* Enter DECL into the symbol table, if that's appropriate. Returns
4168 DECL, or a modified version thereof. */
4171 maybe_push_decl (decl
)
4174 tree type
= TREE_TYPE (decl
);
4176 /* Add this decl to the current binding level, but not if it comes
4177 from another scope, e.g. a static member variable. TEM may equal
4178 DECL or it may be a previous decl of the same name. */
4179 if ((TREE_CODE (decl
) != PARM_DECL
4180 && DECL_CONTEXT (decl
) != NULL_TREE
4181 /* Definitions of namespace members outside their namespace are
4183 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4184 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4185 || TREE_CODE (type
) == UNKNOWN_TYPE
4186 /* The declaration of a template specialization does not affect
4187 the functions available for overload resolution, so we do not
4189 || (TREE_CODE (decl
) == FUNCTION_DECL
4190 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4193 return pushdecl (decl
);
4197 /* This function is used to push the mangled decls for nested types into
4198 the appropriate scope. Previously pushdecl_top_level was used, but that
4199 is incorrect for members of local classes. */
4202 pushdecl_nonclass_level (x
)
4205 struct binding_level
*b
= current_binding_level
;
4207 my_friendly_assert (b
->parm_flag
!= 2, 180);
4210 /* Get out of template binding levels */
4211 while (b
->pseudo_global
)
4215 pushdecl_with_scope (x
, b
);
4219 /* Make the declaration(s) of X appear in CLASS scope
4220 under the name NAME. */
4223 push_class_level_binding (name
, x
)
4228 /* The class_binding_level will be NULL if x is a template
4229 parameter name in a member template. */
4230 if (!class_binding_level
)
4233 /* Make sure that this new member does not have the same name
4234 as a template parameter. */
4235 if (TYPE_BEING_DEFINED (current_class_type
))
4236 check_template_shadow (x
);
4238 /* If this declaration shadows a declaration from an enclosing
4239 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4240 we leave this class. Record the shadowed declaration here. */
4241 binding
= IDENTIFIER_BINDING (name
);
4243 && ((TREE_CODE (x
) == OVERLOAD
4244 && BINDING_VALUE (binding
)
4245 && is_overloaded_fn (BINDING_VALUE (binding
)))
4246 || INHERITED_VALUE_BINDING_P (binding
)))
4251 /* If the old binding was from a base class, and was for a tag
4252 name, slide it over to make room for the new binding. The
4253 old binding is still visible if explicitly qualified with a
4255 if (INHERITED_VALUE_BINDING_P (binding
)
4256 && BINDING_VALUE (binding
)
4257 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4258 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4259 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4261 old_decl
= BINDING_TYPE (binding
);
4262 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4263 BINDING_VALUE (binding
) = NULL_TREE
;
4264 INHERITED_VALUE_BINDING_P (binding
) = 0;
4267 old_decl
= BINDING_VALUE (binding
);
4269 /* There was already a binding for X containing fewer
4270 functions than are named in X. Find the previous
4271 declaration of X on the class-shadowed list, and update it. */
4272 for (shadow
= class_binding_level
->class_shadowed
;
4274 shadow
= TREE_CHAIN (shadow
))
4275 if (TREE_PURPOSE (shadow
) == name
4276 && TREE_TYPE (shadow
) == old_decl
)
4278 BINDING_VALUE (binding
) = x
;
4279 INHERITED_VALUE_BINDING_P (binding
) = 0;
4280 TREE_TYPE (shadow
) = x
;
4285 /* If we didn't replace an existing binding, put the binding on the
4286 stack of bindings for the identifier, and update
4287 IDENTIFIER_CLASS_VALUE. */
4288 if (push_class_binding (name
, x
))
4290 push_cache_obstack ();
4291 class_binding_level
->class_shadowed
4292 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4293 class_binding_level
->class_shadowed
);
4295 /* Record the value we are binding NAME to so that we can know
4296 what to pop later. */
4297 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4301 /* Insert another USING_DECL into the current binding level,
4302 returning this declaration. If this is a redeclaration,
4303 do nothing and return NULL_TREE. */
4306 push_using_decl (scope
, name
)
4312 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4313 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4314 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4315 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4319 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4320 DECL_INITIAL (decl
) = scope
;
4321 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4322 current_binding_level
->usings
= decl
;
4326 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4327 changed (i.e. there was already a directive), or the fresh
4328 TREE_LIST otherwise. */
4331 push_using_directive (used
)
4334 tree ud
= current_binding_level
->using_directives
;
4335 tree iter
, ancestor
;
4337 /* Check if we already have this. */
4338 if (purpose_member (used
, ud
) != NULL_TREE
)
4341 /* Recursively add all namespaces used. */
4342 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4343 push_using_directive (TREE_PURPOSE (iter
));
4345 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4346 ud
= current_binding_level
->using_directives
;
4347 ud
= tree_cons (used
, ancestor
, ud
);
4348 current_binding_level
->using_directives
= ud
;
4352 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4353 other definitions already in place. We get around this by making
4354 the value of the identifier point to a list of all the things that
4355 want to be referenced by that name. It is then up to the users of
4356 that name to decide what to do with that list.
4358 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4359 slot. It is dealt with the same way.
4361 FLAGS is a bitwise-or of the following values:
4362 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4364 PUSH_USING: DECL is being pushed as the result of a using
4367 The value returned may be a previous declaration if we guessed wrong
4368 about what language DECL should belong to (C or C++). Otherwise,
4369 it's always DECL (and never something that's not a _DECL). */
4372 push_overloaded_decl (decl
, flags
)
4376 tree name
= DECL_NAME (decl
);
4379 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4382 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4384 old
= lookup_name_current_level (name
);
4388 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4390 tree t
= TREE_TYPE (old
);
4391 if (IS_AGGR_TYPE (t
) && warn_shadow
4392 && (! DECL_IN_SYSTEM_HEADER (decl
)
4393 || ! DECL_IN_SYSTEM_HEADER (old
)))
4394 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4397 else if (is_overloaded_fn (old
))
4401 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4403 tree fn
= OVL_CURRENT (tmp
);
4405 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4406 && !(flags
& PUSH_USING
)
4407 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4408 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4409 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4412 if (duplicate_decls (decl
, fn
))
4418 cp_error_at ("previous non-function declaration `%#D'", old
);
4419 cp_error ("conflicts with function declaration `%#D'", decl
);
4424 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4426 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4427 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4429 new_binding
= ovl_cons (decl
, old
);
4430 if (flags
& PUSH_USING
)
4431 OVL_USED (new_binding
) = 1;
4434 /* NAME is not ambiguous. */
4438 set_namespace_binding (name
, current_namespace
, new_binding
);
4441 /* We only create an OVERLOAD if there was a previous binding at
4442 this level, or if decl is a template. In the former case, we
4443 need to remove the old binding and replace it with the new
4444 binding. We must also run through the NAMES on the binding
4445 level where the name was bound to update the chain. */
4447 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4451 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4453 d
= &TREE_CHAIN (*d
))
4455 || (TREE_CODE (*d
) == TREE_LIST
4456 && TREE_VALUE (*d
) == old
))
4458 if (TREE_CODE (*d
) == TREE_LIST
)
4459 /* Just replace the old binding with the new. */
4460 TREE_VALUE (*d
) = new_binding
;
4462 /* Build a TREE_LIST to wrap the OVERLOAD. */
4463 *d
= tree_cons (NULL_TREE
, new_binding
,
4466 /* And update the CPLUS_BINDING node. */
4467 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4472 /* We should always find a previous binding in this case. */
4473 my_friendly_abort (0);
4476 /* Install the new binding. */
4477 push_local_binding (name
, new_binding
, flags
);
4483 /* Generate an implicit declaration for identifier FUNCTIONID
4484 as a function of type int (). Print a warning if appropriate. */
4487 implicitly_declare (functionid
)
4491 int temp
= allocation_temporary_p ();
4493 push_obstacks_nochange ();
4495 /* Save the decl permanently so we can warn if definition follows.
4496 In ANSI C, warn_implicit is usually false, so the saves little space.
4497 But in C++, it's usually true, hence the extra code. */
4498 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4499 end_temporary_allocation ();
4501 /* We used to reuse an old implicit decl here,
4502 but this loses with inline functions because it can clobber
4503 the saved decl chains. */
4504 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4506 DECL_EXTERNAL (decl
) = 1;
4507 TREE_PUBLIC (decl
) = 1;
4509 /* ANSI standard says implicit declarations are in the innermost block.
4510 So we record the decl in the standard fashion. */
4512 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4515 /* Only one warning per identifier. */
4516 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4518 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4521 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4528 /* Return zero if the declaration NEWDECL is valid
4529 when the declaration OLDDECL (assumed to be for the same name)
4530 has already been seen.
4531 Otherwise return an error message format string with a %s
4532 where the identifier should go. */
4535 redeclaration_error_message (newdecl
, olddecl
)
4536 tree newdecl
, olddecl
;
4538 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4540 /* Because C++ can put things into name space for free,
4541 constructs like "typedef struct foo { ... } foo"
4542 would look like an erroneous redeclaration. */
4543 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4546 return "redefinition of `%#D'";
4548 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4550 /* If this is a pure function, its olddecl will actually be
4551 the original initialization to `0' (which we force to call
4552 abort()). Don't complain about redefinition in this case. */
4553 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4556 /* If both functions come from different namespaces, this is not
4557 a redeclaration - this is a conflict with a used function. */
4558 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4559 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4560 return "`%D' conflicts with used function";
4562 /* We'll complain about linkage mismatches in
4563 warn_extern_redeclared_static. */
4565 /* Defining the same name twice is no good. */
4566 if (DECL_INITIAL (olddecl
) != NULL_TREE
4567 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4569 if (DECL_NAME (olddecl
) == NULL_TREE
)
4570 return "`%#D' not declared in class";
4572 return "redefinition of `%#D'";
4576 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4578 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4579 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4580 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4581 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4582 && TYPE_SIZE (TREE_TYPE (newdecl
))
4583 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4584 return "redefinition of `%#D'";
4587 else if (toplevel_bindings_p ())
4589 /* Objects declared at top level: */
4590 /* If at least one is a reference, it's ok. */
4591 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4593 /* Reject two definitions. */
4594 return "redefinition of `%#D'";
4598 /* Objects declared with block scope: */
4599 /* Reject two definitions, and reject a definition
4600 together with an external reference. */
4601 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4602 return "redeclaration of `%#D'";
4607 /* Create a new label, named ID. */
4610 make_label_decl (id
, local_p
)
4616 if (building_stmt_tree ())
4617 push_permanent_obstack ();
4618 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4619 if (building_stmt_tree ())
4622 /* Make sure every label has an rtx. */
4625 DECL_CONTEXT (decl
) = current_function_decl
;
4626 DECL_MODE (decl
) = VOIDmode
;
4627 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4629 /* Say where one reference is to the label, for the sake of the
4630 error if it is not defined. */
4631 DECL_SOURCE_LINE (decl
) = lineno
;
4632 DECL_SOURCE_FILE (decl
) = input_filename
;
4634 /* Record the fact that this identifier is bound to this label. */
4635 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4637 /* Record this label on the list of used labels so that we can check
4638 at the end of the function to see whether or not the label was
4639 actually defined. */
4640 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4641 && (named_label_uses
== NULL
4642 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4643 || named_label_uses
->label_decl
!= decl
))
4645 struct named_label_list
*new_ent
;
4647 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4648 new_ent
->label_decl
= decl
;
4649 new_ent
->names_in_scope
= current_binding_level
->names
;
4650 new_ent
->binding_level
= current_binding_level
;
4651 new_ent
->lineno_o_goto
= lineno
;
4652 new_ent
->filename_o_goto
= input_filename
;
4653 new_ent
->next
= named_label_uses
;
4654 named_label_uses
= new_ent
;
4660 /* Look for a label named ID in the current function. If one cannot
4661 be found, create one. (We keep track of used, but undefined,
4662 labels, and complain about them at the end of a function.) */
4670 /* You can't use labels at global scope. */
4671 if (current_function_decl
== NULL_TREE
)
4673 error ("label `%s' referenced outside of any function",
4674 IDENTIFIER_POINTER (id
));
4678 /* See if we've already got this label. */
4679 decl
= IDENTIFIER_LABEL_VALUE (id
);
4680 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4683 /* Record this label on the list of labels used in this function.
4684 We do this before calling make_label_decl so that we get the
4685 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4686 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4688 /* We need a new label. */
4689 decl
= make_label_decl (id
, /*local_p=*/0);
4690 /* Now fill in the information we didn't have before. */
4691 TREE_VALUE (named_labels
) = decl
;
4696 /* Declare a local label named ID. */
4699 declare_local_label (id
)
4704 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4705 this scope we can restore the old value of
4706 IDENTIFIER_TYPE_VALUE. */
4707 current_binding_level
->shadowed_labels
4708 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4709 current_binding_level
->shadowed_labels
);
4710 /* Look for the label. */
4711 decl
= make_label_decl (id
, /*local_p=*/1);
4712 /* Now fill in the information we didn't have before. */
4713 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4718 /* Define a label, specifying the location in the source file.
4719 Return the LABEL_DECL node for the label, if the definition is valid.
4720 Otherwise return 0. */
4723 define_label (filename
, line
, name
)
4728 tree decl
= lookup_label (name
);
4730 /* After labels, make any new cleanups go into their
4731 own new (temporary) binding contour. */
4732 current_binding_level
->more_cleanups_ok
= 0;
4734 if (name
== get_identifier ("wchar_t"))
4735 cp_pedwarn ("label named wchar_t");
4737 if (DECL_INITIAL (decl
) != NULL_TREE
)
4739 cp_error ("duplicate label `%D'", decl
);
4744 struct named_label_list
*uses
, *prev
;
4748 /* Mark label as having been defined. */
4749 DECL_INITIAL (decl
) = error_mark_node
;
4750 /* Say where in the source. */
4751 DECL_SOURCE_FILE (decl
) = filename
;
4752 DECL_SOURCE_LINE (decl
) = line
;
4755 uses
= named_label_uses
;
4756 while (uses
!= NULL
)
4757 if (uses
->label_decl
== decl
)
4759 struct binding_level
*b
= current_binding_level
;
4762 tree new_decls
= b
->names
;
4763 tree old_decls
= (b
== uses
->binding_level
)
4764 ? uses
->names_in_scope
: NULL_TREE
;
4765 while (new_decls
!= old_decls
)
4767 if (TREE_CODE (new_decls
) == VAR_DECL
4768 /* Don't complain about crossing initialization
4769 of internal entities. They can't be accessed,
4770 and they should be cleaned up
4771 by the time we get to the label. */
4772 && ! DECL_ARTIFICIAL (new_decls
)
4773 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4774 && pod_type_p (TREE_TYPE (new_decls
))))
4776 /* This is really only important if we're crossing
4777 an initialization. The POD stuff is just
4778 pedantry; why should it matter if the class
4779 contains a field of pointer to member type? */
4780 int problem
= (DECL_INITIAL (new_decls
)
4781 || (TYPE_NEEDS_CONSTRUCTING
4782 (TREE_TYPE (new_decls
))));
4788 cp_error ("jump to label `%D'", decl
);
4789 error_with_file_and_line
4790 (uses
->filename_o_goto
,
4791 uses
->lineno_o_goto
, " from here");
4795 cp_pedwarn ("jump to label `%D'", decl
);
4796 pedwarn_with_file_and_line
4797 (uses
->filename_o_goto
,
4798 uses
->lineno_o_goto
, " from here");
4804 cp_error_at (" crosses initialization of `%#D'",
4807 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4810 new_decls
= TREE_CHAIN (new_decls
);
4812 if (b
== uses
->binding_level
)
4814 if (b
->eh_region
&& ! saw_eh
)
4818 cp_error ("jump to label `%D'", decl
);
4819 error_with_file_and_line
4820 (uses
->filename_o_goto
,
4821 uses
->lineno_o_goto
, " from here");
4824 error (" enters exception handling block");
4831 prev
->next
= uses
->next
;
4833 named_label_uses
= uses
->next
;
4842 current_function_return_value
= NULL_TREE
;
4849 struct binding_level
*level
;
4850 struct cp_switch
*next
;
4853 static struct cp_switch
*switch_stack
;
4859 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4860 p
->level
= current_binding_level
;
4861 p
->next
= switch_stack
;
4868 switch_stack
= switch_stack
->next
;
4871 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4872 /* XXX Note decl is never actually used. (bpk) */
4875 define_case_label ()
4877 tree cleanup
= last_cleanup_this_contour ();
4878 struct binding_level
*b
= current_binding_level
;
4883 static int explained
= 0;
4884 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4885 warning ("where case label appears here");
4888 warning ("(enclose actions of previous case statements requiring");
4889 warning ("destructors in their own binding contours.)");
4894 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4896 tree new_decls
= b
->names
;
4897 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4899 if (TREE_CODE (new_decls
) == VAR_DECL
4900 /* Don't complain about crossing initialization
4901 of internal entities. They can't be accessed,
4902 and they should be cleaned up
4903 by the time we get to the label. */
4904 && ! DECL_ARTIFICIAL (new_decls
)
4905 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4906 && DECL_INITIAL (new_decls
) != error_mark_node
)
4907 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4910 error ("jump to case label");
4912 cp_error_at (" crosses initialization of `%#D'",
4918 /* After labels, make any new cleanups go into their
4919 own new (temporary) binding contour. */
4921 current_binding_level
->more_cleanups_ok
= 0;
4922 current_function_return_value
= NULL_TREE
;
4925 /* Return the list of declarations of the current level.
4926 Note that this list is in reverse order unless/until
4927 you nreverse it; and when you do nreverse it, you must
4928 store the result back using `storedecls' or you will lose. */
4933 return current_binding_level
->names
;
4936 /* Return the list of type-tags (for structs, etc) of the current level. */
4941 return current_binding_level
->tags
;
4944 /* Store the list of declarations of the current level.
4945 This is done for the parameter declarations of a function being defined,
4946 after they are modified in the light of any missing parameters. */
4952 current_binding_level
->names
= decls
;
4955 /* Similarly, store the list of tags of the current level. */
4961 current_binding_level
->tags
= tags
;
4964 /* Given NAME, an IDENTIFIER_NODE,
4965 return the structure (or union or enum) definition for that name.
4966 Searches binding levels from BINDING_LEVEL up to the global level.
4967 If THISLEVEL_ONLY is nonzero, searches only the specified context
4968 (but skips any tag-transparent contexts to find one that is
4969 meaningful for tags).
4970 FORM says which kind of type the caller wants;
4971 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4972 If the wrong kind of type is found, and it's not a template, an error is
4976 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4977 enum tree_code form
;
4979 struct binding_level
*binding_level
;
4982 register struct binding_level
*level
;
4983 /* Non-zero if, we should look past a pseudo-global level, even if
4985 int allow_pseudo_global
= 1;
4987 for (level
= binding_level
; level
; level
= level
->level_chain
)
4990 if (ANON_AGGRNAME_P (name
))
4991 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4993 /* There's no need for error checking here, because
4994 anon names are unique throughout the compilation. */
4995 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4996 return TREE_VALUE (tail
);
4998 else if (level
->namespace_p
)
4999 /* Do namespace lookup. */
5000 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5002 tree old
= binding_for_name (name
, tail
);
5004 /* If we just skipped past a pseudo global level, even
5005 though THISLEVEL_ONLY, and we find a template class
5006 declaration, then we use the _TYPE node for the
5007 template. See the example below. */
5008 if (thislevel_only
&& !allow_pseudo_global
5009 && old
&& BINDING_VALUE (old
)
5010 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5011 old
= TREE_TYPE (BINDING_VALUE (old
));
5013 old
= BINDING_TYPE (old
);
5015 /* If it has an original type, it is a typedef, and we
5016 should not return it. */
5017 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5019 if (old
&& TREE_CODE (old
) != form
5020 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5022 cp_error ("`%#D' redeclared as %C", old
, form
);
5027 if (thislevel_only
|| tail
== global_namespace
)
5031 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5033 if (TREE_PURPOSE (tail
) == name
)
5035 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5036 /* Should tighten this up; it'll probably permit
5037 UNION_TYPE and a struct template, for example. */
5039 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5041 /* Definition isn't the kind we were looking for. */
5042 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5046 return TREE_VALUE (tail
);
5049 if (thislevel_only
&& ! level
->tag_transparent
)
5051 if (level
->pseudo_global
&& allow_pseudo_global
)
5053 /* We must deal with cases like this:
5055 template <class T> struct S;
5056 template <class T> struct S {};
5058 When looking up `S', for the second declaration, we
5059 would like to find the first declaration. But, we
5060 are in the pseudo-global level created for the
5061 template parameters, rather than the (surrounding)
5062 namespace level. Thus, we keep going one more level,
5063 even though THISLEVEL_ONLY is non-zero. */
5064 allow_pseudo_global
= 0;
5076 set_current_level_tags_transparency (tags_transparent
)
5077 int tags_transparent
;
5079 current_binding_level
->tag_transparent
= tags_transparent
;
5083 /* Given a type, find the tag that was defined for it and return the tag name.
5084 Otherwise return 0. However, the value can never be 0
5085 in the cases in which this is used.
5087 C++: If NAME is non-zero, this is the new name to install. This is
5088 done when replacing anonymous tags with real tag names. */
5091 lookup_tag_reverse (type
, name
)
5095 register struct binding_level
*level
;
5097 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5100 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5102 if (TREE_VALUE (tail
) == type
)
5105 TREE_PURPOSE (tail
) = name
;
5106 return TREE_PURPOSE (tail
);
5113 /* Look up NAME in the NAMESPACE. */
5116 lookup_namespace_name (namespace, name
)
5117 tree
namespace, name
;
5120 tree template_id
= NULL_TREE
;
5122 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5124 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5125 /* This happens for A::B<int> when B is a namespace. */
5127 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5129 /* This happens for A::B where B is a template, and there are no
5130 template arguments. */
5131 cp_error ("invalid use of `%D'", name
);
5132 return error_mark_node
;
5135 namespace = ORIGINAL_NAMESPACE (namespace);
5137 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5140 name
= TREE_OPERAND (name
, 0);
5141 if (TREE_CODE (name
) == OVERLOAD
)
5142 name
= DECL_NAME (OVL_CURRENT (name
));
5143 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5144 name
= DECL_NAME (name
);
5147 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5149 val
= make_node (CPLUS_BINDING
);
5150 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5151 return error_mark_node
;
5153 if (BINDING_VALUE (val
))
5155 val
= BINDING_VALUE (val
);
5159 if (DECL_CLASS_TEMPLATE_P (val
))
5160 val
= lookup_template_class (val
,
5161 TREE_OPERAND (template_id
, 1),
5162 /*in_decl=*/NULL_TREE
,
5163 /*context=*/NULL_TREE
,
5164 /*entering_scope=*/0);
5165 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5166 || TREE_CODE (val
) == OVERLOAD
)
5167 val
= lookup_template_function (val
,
5168 TREE_OPERAND (template_id
, 1));
5171 cp_error ("`%D::%D' is not a template",
5173 return error_mark_node
;
5177 /* If we have a single function from a using decl, pull it out. */
5178 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5179 val
= OVL_FUNCTION (val
);
5183 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5184 return error_mark_node
;
5187 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5189 static unsigned long
5197 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5198 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5203 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5206 typename_compare (k1
, k2
)
5217 d1
= TYPE_NAME (t1
);
5218 d2
= TYPE_NAME (t2
);
5220 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5221 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5222 && ((TREE_TYPE (t1
) != NULL_TREE
)
5223 == (TREE_TYPE (t2
) != NULL_TREE
))
5224 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5225 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5228 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5229 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5230 is non-NULL, this type is being created by the implicit typename
5231 extension, and BASE_TYPE is a type named `t' in some base class of
5232 `T' which depends on template parameters.
5234 Returns the new TYPENAME_TYPE. */
5237 build_typename_type (context
, name
, fullname
, base_type
)
5245 struct hash_entry
* e
;
5247 static struct hash_table ht
;
5249 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5253 static struct hash_table
*h
= &ht
;
5254 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5256 fatal ("virtual memory exhausted");
5257 ggc_add_tree_hash_table_root (&h
, 1);
5260 /* Build the TYPENAME_TYPE. */
5261 t
= make_lang_type (TYPENAME_TYPE
);
5262 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5263 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5264 TREE_TYPE (t
) = base_type
;
5266 /* Build the corresponding TYPE_DECL. */
5267 d
= build_decl (TYPE_DECL
, name
, t
);
5268 TYPE_NAME (TREE_TYPE (d
)) = d
;
5269 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5270 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5271 DECL_ARTIFICIAL (d
) = 1;
5273 /* See if we already have this type. */
5274 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5278 /* Insert the type into the table. */
5279 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5287 make_typename_type (context
, name
)
5292 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5294 if (!(TYPE_LANG_SPECIFIC (name
)
5295 && (CLASSTYPE_IS_TEMPLATE (name
)
5296 || CLASSTYPE_USE_TEMPLATE (name
))))
5297 name
= TYPE_IDENTIFIER (name
);
5299 /* Create a TEMPLATE_ID_EXPR for the type. */
5300 name
= build_nt (TEMPLATE_ID_EXPR
,
5301 CLASSTYPE_TI_TEMPLATE (name
),
5302 CLASSTYPE_TI_ARGS (name
));
5304 else if (TREE_CODE (name
) == TYPE_DECL
)
5305 name
= DECL_NAME (name
);
5309 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5311 name
= TREE_OPERAND (name
, 0);
5312 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5313 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5315 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5316 my_friendly_abort (2000);
5318 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5320 /* We can get here from typename_sub0 in the explicit_template_type
5321 expansion. Just fail. */
5322 cp_error ("no class template named `%#T' in `%#T'",
5324 return error_mark_node
;
5327 if (! uses_template_parms (context
)
5328 || currently_open_class (context
))
5330 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5332 tree tmpl
= NULL_TREE
;
5333 if (IS_AGGR_TYPE (context
))
5334 tmpl
= lookup_field (context
, name
, 0, 0);
5335 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5337 cp_error ("no class template named `%#T' in `%#T'",
5339 return error_mark_node
;
5342 return lookup_template_class (tmpl
,
5343 TREE_OPERAND (fullname
, 1),
5345 /*entering_scope=*/0);
5351 if (!IS_AGGR_TYPE (context
))
5353 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5354 return error_mark_node
;
5357 t
= lookup_field (context
, name
, 0, 1);
5359 return TREE_TYPE (t
);
5363 /* If the CONTEXT is not a template type, then either the field is
5364 there now or its never going to be. */
5365 if (!uses_template_parms (context
))
5367 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5368 return error_mark_node
;
5372 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5375 /* Select the right _DECL from multiple choices. */
5378 select_decl (binding
, flags
)
5383 val
= BINDING_VALUE (binding
);
5384 if (LOOKUP_NAMESPACES_ONLY (flags
))
5386 /* We are not interested in types. */
5387 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5392 /* If we could have a type and
5393 we have nothing or we need a type and have none. */
5394 if (BINDING_TYPE (binding
)
5395 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5396 && TREE_CODE (val
) != TYPE_DECL
)))
5397 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5398 /* Don't return non-types if we really prefer types. */
5399 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5400 && (TREE_CODE (val
) != TEMPLATE_DECL
5401 || !DECL_CLASS_TEMPLATE_P (val
)))
5407 /* Unscoped lookup of a global: iterate over current namespaces,
5408 considering using-directives. If SPACESP is non-NULL, store a list
5409 of the namespaces we've considered in it. */
5412 unqualified_namespace_lookup (name
, flags
, spacesp
)
5417 tree b
= make_node (CPLUS_BINDING
);
5418 tree initial
= current_decl_namespace();
5419 tree scope
= initial
;
5421 struct binding_level
*level
;
5422 tree val
= NULL_TREE
;
5425 *spacesp
= NULL_TREE
;
5427 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5430 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5431 val
= binding_for_name (name
, scope
);
5433 /* Initialize binding for this context. */
5434 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5435 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5437 /* Add all _DECLs seen through local using-directives. */
5438 for (level
= current_binding_level
;
5439 !level
->namespace_p
;
5440 level
= level
->level_chain
)
5441 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5442 scope
, flags
, spacesp
))
5443 /* Give up because of error. */
5444 return error_mark_node
;
5446 /* Add all _DECLs seen through global using-directives. */
5447 /* XXX local and global using lists should work equally. */
5451 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5452 scope
, flags
, spacesp
))
5453 /* Give up because of error. */
5454 return error_mark_node
;
5455 if (siter
== scope
) break;
5456 siter
= CP_DECL_CONTEXT (siter
);
5459 val
= select_decl (b
, flags
);
5460 if (scope
== global_namespace
)
5466 /* Combine prefer_type and namespaces_only into flags. */
5469 lookup_flags (prefer_type
, namespaces_only
)
5470 int prefer_type
, namespaces_only
;
5472 if (namespaces_only
)
5473 return LOOKUP_PREFER_NAMESPACES
;
5474 if (prefer_type
> 1)
5475 return LOOKUP_PREFER_TYPES
;
5476 if (prefer_type
> 0)
5477 return LOOKUP_PREFER_BOTH
;
5481 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5482 ignore it or not. Subroutine of lookup_name_real. */
5485 qualify_lookup (val
, flags
)
5489 if (val
== NULL_TREE
)
5491 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5493 if ((flags
& LOOKUP_PREFER_TYPES
)
5494 && (TREE_CODE (val
) == TYPE_DECL
5495 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5496 && DECL_CLASS_TEMPLATE_P (val
))))
5498 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5503 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5507 warn_about_implicit_typename_lookup (typename
, binding
)
5511 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5512 tree name
= DECL_NAME (typename
);
5514 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5515 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5516 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5517 && ! (TREE_CODE (binding
) == TYPE_DECL
5518 && same_type_p (TREE_TYPE (binding
), subtype
)))
5520 cp_warning ("lookup of `%D' finds `%#D'",
5522 cp_warning (" instead of `%D' from dependent base class",
5524 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5525 constructor_name (current_class_type
), name
);
5529 /* Look up NAME in the current binding level and its superiors in the
5530 namespace of variables, functions and typedefs. Return a ..._DECL
5531 node of some kind representing its definition if there is only one
5532 such declaration, or return a TREE_LIST with all the overloaded
5533 definitions if there are many, or return 0 if it is undefined.
5535 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5536 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5537 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5538 Otherwise we prefer non-TYPE_DECLs.
5540 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5541 using IDENTIFIER_CLASS_VALUE. */
5544 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5546 int prefer_type
, nonclass
, namespaces_only
;
5549 tree val
= NULL_TREE
;
5551 tree from_obj
= NULL_TREE
;
5553 int val_is_implicit_typename
= 0;
5555 /* Hack: copy flag set by parser, if set. */
5556 if (only_namespace_names
)
5557 namespaces_only
= 1;
5559 if (prefer_type
== -2)
5561 extern int looking_for_typename
;
5562 tree type
= NULL_TREE
;
5565 prefer_type
= looking_for_typename
;
5567 flags
= lookup_flags (prefer_type
, namespaces_only
);
5568 /* If the next thing is '<', class templates are types. */
5569 if (looking_for_template
)
5570 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5572 /* std:: becomes :: for now. */
5573 if (got_scope
== std_node
)
5574 got_scope
= void_type_node
;
5578 else if (got_object
!= error_mark_node
)
5583 if (type
== error_mark_node
)
5584 return error_mark_node
;
5585 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5586 type
= TREE_TYPE (type
);
5589 type
= complete_type (type
);
5591 if (TREE_CODE (type
) == VOID_TYPE
)
5592 type
= global_namespace
;
5593 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5595 val
= make_node (CPLUS_BINDING
);
5596 flags
|= LOOKUP_COMPLAIN
;
5597 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5599 val
= select_decl (val
, flags
);
5601 else if (! IS_AGGR_TYPE (type
)
5602 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5603 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5604 || TREE_CODE (type
) == TYPENAME_TYPE
)
5605 /* Someone else will give an error about this if needed. */
5607 else if (type
== current_class_type
)
5608 val
= IDENTIFIER_CLASS_VALUE (name
);
5610 val
= lookup_member (type
, name
, 0, prefer_type
);
5617 else if (got_object
&& val
)
5622 flags
= lookup_flags (prefer_type
, namespaces_only
);
5623 /* If we're not parsing, we need to complain. */
5624 flags
|= LOOKUP_COMPLAIN
;
5627 /* First, look in non-namespace scopes. */
5629 if (current_class_type
== NULL_TREE
)
5632 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5636 if (!LOCAL_BINDING_P (t
) && nonclass
)
5637 /* We're not looking for class-scoped bindings, so keep going. */
5640 /* If this is the kind of thing we're looking for, we're done. */
5641 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5642 binding
= BINDING_VALUE (t
);
5643 else if ((flags
& LOOKUP_PREFER_TYPES
)
5644 && qualify_lookup (BINDING_TYPE (t
), flags
))
5645 binding
= BINDING_TYPE (t
);
5647 binding
= NULL_TREE
;
5650 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5652 if (val_is_implicit_typename
&& !yylex
)
5653 warn_about_implicit_typename_lookup (val
, binding
);
5655 val_is_implicit_typename
5656 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5657 if (!val_is_implicit_typename
)
5662 /* Now lookup in namespace scopes. */
5663 if (!val
|| val_is_implicit_typename
)
5665 t
= unqualified_namespace_lookup (name
, flags
, 0);
5668 if (val_is_implicit_typename
&& !yylex
)
5669 warn_about_implicit_typename_lookup (val
, t
);
5677 /* This should only warn about types used in qualified-ids. */
5678 if (from_obj
&& from_obj
!= val
)
5680 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5681 && TREE_CODE (val
) == TYPE_DECL
5682 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5684 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5685 name
, got_object
, TREE_TYPE (from_obj
));
5686 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5690 /* We don't change val to from_obj if got_object depends on
5691 template parms because that breaks implicit typename for
5692 destructor calls. */
5693 if (! uses_template_parms (got_object
))
5697 /* If we have a single function from a using decl, pull it out. */
5698 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5699 val
= OVL_FUNCTION (val
);
5708 lookup_name_nonclass (name
)
5711 return lookup_name_real (name
, 0, 1, 0);
5715 lookup_function_nonclass (name
, args
)
5719 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5723 lookup_name_namespace_only (name
)
5726 /* type-or-namespace, nonclass, namespace_only */
5727 return lookup_name_real (name
, 1, 1, 1);
5731 lookup_name (name
, prefer_type
)
5735 return lookup_name_real (name
, prefer_type
, 0, 0);
5738 /* Similar to `lookup_name' but look only in the innermost non-class
5742 lookup_name_current_level (name
)
5745 struct binding_level
*b
;
5748 b
= current_binding_level
;
5749 while (b
->parm_flag
== 2)
5754 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5756 /* extern "C" function() */
5757 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5760 else if (IDENTIFIER_BINDING (name
)
5761 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5765 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5766 return IDENTIFIER_VALUE (name
);
5778 /* Like lookup_name_current_level, but for types. */
5781 lookup_type_current_level (name
)
5784 register tree t
= NULL_TREE
;
5786 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5788 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5789 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5791 struct binding_level
*b
= current_binding_level
;
5794 if (purpose_member (name
, b
->type_shadowed
))
5795 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5807 begin_only_namespace_names ()
5809 only_namespace_names
= 1;
5813 end_only_namespace_names ()
5815 only_namespace_names
= 0;
5818 /* Arrange for the user to get a source line number, even when the
5819 compiler is going down in flames, so that she at least has a
5820 chance of working around problems in the compiler. We used to
5821 call error(), but that let the segmentation fault continue
5822 through; now, it's much more passive by asking them to send the
5823 maintainers mail about the problem. */
5827 int sig ATTRIBUTE_UNUSED
;
5829 signal (SIGSEGV
, SIG_DFL
);
5831 signal (SIGIOT
, SIG_DFL
);
5834 signal (SIGILL
, SIG_DFL
);
5837 signal (SIGABRT
, SIG_DFL
);
5840 signal (SIGBUS
, SIG_DFL
);
5842 my_friendly_abort (0);
5845 /* Push the declarations of builtin types into the namespace.
5846 RID_INDEX, if < RID_MAX is the index of the builtin type
5847 in the array RID_POINTERS. NAME is the name used when looking
5848 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5851 record_builtin_type (rid_index
, name
, type
)
5856 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5857 tree tdecl
= NULL_TREE
;
5859 if ((int) rid_index
< (int) RID_MAX
)
5860 rname
= ridpointers
[(int) rid_index
];
5862 tname
= get_identifier (name
);
5864 TYPE_BUILT_IN (type
) = 1;
5868 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5869 set_identifier_type_value (tname
, NULL_TREE
);
5870 if ((int) rid_index
< (int) RID_MAX
)
5871 /* Built-in types live in the global namespace. */
5872 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5874 if (rname
!= NULL_TREE
)
5876 if (tname
!= NULL_TREE
)
5878 set_identifier_type_value (rname
, NULL_TREE
);
5879 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5883 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5884 set_identifier_type_value (rname
, NULL_TREE
);
5889 /* Record one of the standard Java types.
5890 * Declare it as having the given NAME.
5891 * If SIZE > 0, it is the size of one of the integral types;
5892 * otherwise it is the negative of the size of one of the other types. */
5895 record_builtin_java_type (name
, size
)
5901 type
= make_signed_type (size
);
5902 else if (size
> -32)
5903 { /* "__java_char" or ""__java_boolean". */
5904 type
= make_unsigned_type (-size
);
5905 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5908 { /* "__java_float" or ""__java_double". */
5909 type
= make_node (REAL_TYPE
);
5910 TYPE_PRECISION (type
) = - size
;
5913 record_builtin_type (RID_MAX
, name
, type
);
5914 decl
= TYPE_NAME (type
);
5916 /* Suppress generate debug symbol entries for these types,
5917 since for normal C++ they are just clutter.
5918 However, push_lang_context undoes this if extern "Java" is seen. */
5919 DECL_IGNORED_P (decl
) = 1;
5921 TYPE_FOR_JAVA (type
) = 1;
5925 /* Push a type into the namespace so that the back-ends ignore it. */
5928 record_unknown_type (type
, name
)
5932 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5933 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5934 DECL_IGNORED_P (decl
) = 1;
5935 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5936 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5937 TYPE_ALIGN (type
) = 1;
5938 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5941 /* Push overloaded decl, in global scope, with one argument so it
5942 can be used as a callback from define_function. */
5945 push_overloaded_decl_1 (x
)
5948 push_overloaded_decl (x
, PUSH_GLOBAL
);
5955 auto_function (name
, type
, code
)
5957 enum built_in_function code
;
5959 return define_function
5960 (IDENTIFIER_POINTER (name
), type
, code
, push_overloaded_decl_1
,
5961 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5965 /* Create the predefined scalar types of C,
5966 and some nodes representing standard constants (0, 1, (void *)0).
5967 Initialize the global binding level.
5968 Make definitions for built-in primitive functions. */
5971 init_decl_processing ()
5974 int wchar_type_size
;
5975 tree array_domain_type
;
5977 /* Have to make these distinct before we try using them. */
5978 lang_name_cplusplus
= get_identifier ("C++");
5979 lang_name_c
= get_identifier ("C");
5980 lang_name_java
= get_identifier ("Java");
5982 /* Let the back-end now how to save and restore language-specific
5983 per-function globals. */
5984 init_lang_status
= &push_cp_function_context
;
5985 free_lang_status
= &pop_cp_function_context
;
5986 mark_lang_status
= &mark_cp_function_context
;
5992 /* Create the global variables. */
5993 push_to_top_level ();
5995 /* Enter the global namespace. */
5996 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5997 push_namespace (get_identifier ("::"));
5998 global_namespace
= current_namespace
;
5999 current_lang_name
= NULL_TREE
;
6001 if (flag_strict_prototype
== 2)
6002 flag_strict_prototype
= pedantic
;
6003 if (! flag_permissive
&& ! pedantic
)
6004 flag_pedantic_errors
= 1;
6006 strict_prototypes_lang_c
= flag_strict_prototype
;
6009 current_lang_name
= lang_name_c
;
6011 current_function_decl
= NULL_TREE
;
6012 current_binding_level
= NULL_BINDING_LEVEL
;
6013 free_binding_level
= NULL_BINDING_LEVEL
;
6015 /* Because most segmentation signals can be traced back into user
6016 code, catch them and at least give the user a chance of working
6017 around compiler bugs. */
6018 signal (SIGSEGV
, signal_catch
);
6020 /* We will also catch aborts in the back-end through signal_catch and
6021 give the user a chance to see where the error might be, and to defeat
6022 aborts in the back-end when there have been errors previously in their
6025 signal (SIGIOT
, signal_catch
);
6028 signal (SIGILL
, signal_catch
);
6031 signal (SIGABRT
, signal_catch
);
6034 signal (SIGBUS
, signal_catch
);
6037 gcc_obstack_init (&decl_obstack
);
6039 build_common_tree_nodes (flag_signed_char
);
6041 TREE_PERMANENT (error_mark_node
) = 1;
6042 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6043 TREE_TYPE (error_mark_list
) = error_mark_node
;
6045 /* Make the binding_level structure for global names. */
6047 global_binding_level
= current_binding_level
;
6048 /* The global level is the namespace level of ::. */
6049 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6050 declare_namespace_level ();
6052 this_identifier
= get_identifier (THIS_NAME
);
6053 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6054 ctor_identifier
= get_identifier (CTOR_NAME
);
6055 dtor_identifier
= get_identifier (DTOR_NAME
);
6056 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6057 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6058 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6059 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6060 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6062 /* Define `int' and `char' first so that dbx will output them first. */
6063 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6064 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6066 /* `signed' is the same as `int' */
6067 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6068 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6069 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6070 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6071 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6072 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6073 record_builtin_type (RID_MAX
, "long long unsigned int",
6074 long_long_unsigned_type_node
);
6075 record_builtin_type (RID_MAX
, "long long unsigned",
6076 long_long_unsigned_type_node
);
6077 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6078 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6079 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6082 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6084 /* Define both `signed char' and `unsigned char'. */
6085 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6086 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6088 /* `unsigned long' is the standard type for sizeof.
6089 Note that stddef.h uses `unsigned long',
6090 and this must agree, even if long and int are the same size. */
6092 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6094 /* Create the widest literal types. */
6095 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6096 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6097 widest_integer_literal_type_node
));
6099 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6100 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6101 widest_unsigned_literal_type_node
));
6103 /* These are types that type_for_size and type_for_mode use. */
6104 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6105 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6106 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6107 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6108 #if HOST_BITS_PER_WIDE_INT >= 64
6109 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6111 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6112 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6113 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6114 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6115 #if HOST_BITS_PER_WIDE_INT >= 64
6116 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6119 build_common_tree_nodes_2 (flag_short_double
);
6121 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6122 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6123 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6124 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6125 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6126 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6127 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6128 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6130 integer_two_node
= build_int_2 (2, 0);
6131 TREE_TYPE (integer_two_node
) = integer_type_node
;
6132 integer_three_node
= build_int_2 (3, 0);
6133 TREE_TYPE (integer_three_node
) = integer_type_node
;
6135 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6136 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6137 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6138 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6139 TYPE_PRECISION (boolean_type_node
) = 1;
6140 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6141 boolean_false_node
= build_int_2 (0, 0);
6142 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6143 boolean_true_node
= build_int_2 (1, 0);
6144 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6146 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6147 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6148 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6150 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6151 complex_integer_type_node
));
6152 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6153 complex_float_type_node
));
6154 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6155 complex_double_type_node
));
6156 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6157 complex_long_double_type_node
));
6159 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6161 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6162 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6163 TREE_PARMLIST (void_list_node
) = 1;
6165 /* Used for expressions that do nothing, but are not errors. */
6166 void_zero_node
= build_int_2 (0, 0);
6167 TREE_TYPE (void_zero_node
) = void_type_node
;
6169 string_type_node
= build_pointer_type (char_type_node
);
6170 const_string_type_node
6171 = build_pointer_type (build_qualified_type (char_type_node
,
6173 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6175 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6178 /* Make a type to be the domain of a few array types
6179 whose domains don't really matter.
6180 200 is small enough that it always fits in size_t
6181 and large enough that it can hold most function names for the
6182 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6183 array_domain_type
= build_index_type (build_int_2 (200, 0));
6185 /* Make a type for arrays of characters.
6186 With luck nothing will ever really depend on the length of this
6188 char_array_type_node
6189 = build_array_type (char_type_node
, array_domain_type
);
6190 /* Likewise for arrays of ints. */
6192 = build_array_type (integer_type_node
, array_domain_type
);
6194 /* This is just some anonymous class type. Nobody should ever
6195 need to look inside this envelope. */
6196 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6198 if (flag_huge_objects
)
6199 delta_type_node
= long_integer_type_node
;
6201 delta_type_node
= short_integer_type_node
;
6203 default_function_type
6204 = build_function_type (integer_type_node
, NULL_TREE
);
6206 ptr_type_node
= build_pointer_type (void_type_node
);
6208 = build_pointer_type (build_qualified_type (void_type_node
,
6210 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6213 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6215 /* C++ extensions */
6217 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6218 record_unknown_type (unknown_type_node
, "unknown type");
6220 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6221 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6223 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6225 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6227 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6228 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6230 /* This is special for C++ so functions can be overloaded. */
6232 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6233 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6234 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6235 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6237 = TREE_UNSIGNED (wchar_type_node
)
6238 ? unsigned_wchar_type_node
6239 : signed_wchar_type_node
;
6240 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6242 /* Artificial declaration of wchar_t -- can be bashed */
6243 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6245 pushdecl (wchar_decl_node
);
6247 /* This is for wide string constants. */
6248 wchar_array_type_node
6249 = build_array_type (wchar_type_node
, array_domain_type
);
6251 if (flag_vtable_thunks
)
6253 /* Make sure we get a unique function type, so we can give
6254 its pointer type a name. (This wins for gdb.) */
6255 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6256 TREE_TYPE (vfunc_type
) = integer_type_node
;
6257 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6258 layout_type (vfunc_type
);
6260 vtable_entry_type
= build_pointer_type (vfunc_type
);
6264 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6265 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6267 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6269 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6271 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6274 /* Make this part of an invisible union. */
6275 fields
[3] = copy_node (fields
[2]);
6276 TREE_TYPE (fields
[3]) = delta_type_node
;
6277 DECL_NAME (fields
[3]) = delta2_identifier
;
6278 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6279 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6280 TREE_UNSIGNED (fields
[3]) = 0;
6281 TREE_CHAIN (fields
[2]) = fields
[3];
6282 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6285 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6288 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6289 layout_type (vtbl_type_node
);
6290 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6291 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6292 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6293 layout_type (vtbl_ptr_type_node
);
6294 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6296 std_node
= build_decl (NAMESPACE_DECL
,
6297 get_identifier (flag_honor_std
? "fake std":"std"),
6299 pushdecl (std_node
);
6301 global_type_node
= make_node (LANG_TYPE
);
6302 record_unknown_type (global_type_node
, "global type");
6305 current_lang_name
= lang_name_cplusplus
;
6308 tree bad_alloc_type_node
, newtype
, deltype
;
6310 push_namespace (get_identifier ("std"));
6311 bad_alloc_type_node
= xref_tag
6312 (class_type_node
, get_identifier ("bad_alloc"), 1);
6315 newtype
= build_exception_variant
6316 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6317 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6318 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6319 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6320 global_delete_fndecl
6321 = auto_function (ansi_opname
[(int) DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6322 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6326 = define_function ("__pure_virtual", void_ftype
,
6327 NOT_BUILT_IN
, 0, 0);
6329 /* Perform other language dependent initializations. */
6330 init_class_processing ();
6331 init_init_processing ();
6332 init_search_processing ();
6334 init_rtti_processing ();
6336 if (flag_exceptions
)
6337 init_exception_processing ();
6340 flag_inline_functions
= 0;
6343 if (! supports_one_only ())
6346 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6347 declare_function_name ();
6349 /* Prepare to check format strings against argument lists. */
6350 init_function_format_info ();
6352 /* Show we use EH for cleanups. */
6353 using_eh_for_cleanups ();
6355 print_error_function
= lang_print_error_function
;
6356 lang_get_alias_set
= &c_get_alias_set
;
6357 valid_lang_attribute
= cp_valid_lang_attribute
;
6359 /* Maintain consistency. Perhaps we should just complain if they
6360 say -fwritable-strings? */
6361 if (flag_writable_strings
)
6362 flag_const_strings
= 0;
6364 /* Add GC roots for all of our global variables. */
6365 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6366 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6367 ggc_add_tree_root (&integer_three_node
, 1);
6368 ggc_add_tree_root (&integer_two_node
, 1);
6369 ggc_add_tree_root (&signed_size_zero_node
, 1);
6370 ggc_add_tree_root (&size_one_node
, 1);
6371 ggc_add_tree_root (&size_zero_node
, 1);
6372 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6373 mark_binding_level
);
6374 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6375 ggc_add_tree_root (&static_ctors
, 1);
6376 ggc_add_tree_root (&static_dtors
, 1);
6377 ggc_add_tree_root (&lastiddecl
, 1);
6379 ggc_add_tree_root (&enum_next_value
, 1);
6380 ggc_add_tree_root (&last_function_parm_tags
, 1);
6381 ggc_add_tree_root (¤t_function_return_value
, 1);
6382 ggc_add_tree_root (¤t_function_parms
, 1);
6383 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6384 ggc_add_tree_root (&last_function_parms
, 1);
6385 ggc_add_tree_root (&error_mark_list
, 1);
6387 ggc_add_tree_root (&global_namespace
, 1);
6388 ggc_add_tree_root (&global_type_node
, 1);
6389 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6391 ggc_add_tree_root (&got_object
, 1);
6392 ggc_add_tree_root (&got_scope
, 1);
6394 ggc_add_tree_root (¤t_lang_name
, 1);
6395 ggc_add_tree_root (&static_aggregates
, 1);
6398 /* Function to print any language-specific context for an error message. */
6401 lang_print_error_function (file
)
6404 default_print_error_function (file
);
6405 maybe_print_template_context ();
6408 /* Make a definition for a builtin function named NAME and whose data type
6409 is TYPE. TYPE should be a function type with argument types.
6410 FUNCTION_CODE tells later passes how to compile calls to this function.
6411 See tree.h for its possible values.
6413 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6414 the name to be called if we can't opencode the function. */
6417 define_function (name
, type
, function_code
, pfn
, library_name
)
6420 enum built_in_function function_code
;
6421 void (*pfn
) PROTO((tree
));
6422 const char *library_name
;
6424 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6425 DECL_EXTERNAL (decl
) = 1;
6426 TREE_PUBLIC (decl
) = 1;
6427 DECL_ARTIFICIAL (decl
) = 1;
6429 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6430 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6432 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6433 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6434 function in the namespace. */
6435 if (pfn
) (*pfn
) (decl
);
6437 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6438 make_function_rtl (decl
);
6439 if (function_code
!= NOT_BUILT_IN
)
6441 DECL_BUILT_IN (decl
) = 1;
6442 DECL_FUNCTION_CODE (decl
) = function_code
;
6448 builtin_function (name
, type
, code
, libname
)
6451 enum built_in_function code
;
6452 const char *libname
;
6454 return define_function (name
, type
, code
, (void (*) PROTO((tree
)))pushdecl
, libname
);
6457 /* When we call finish_struct for an anonymous union, we create
6458 default copy constructors and such. But, an anonymous union
6459 shouldn't have such things; this function undoes the damage to the
6460 anonymous union type T.
6462 (The reason that we create the synthesized methods is that we don't
6463 distinguish `union { int i; }' from `typedef union { int i; } U'.
6464 The first is an anonymous union; the second is just an ordinary
6468 fixup_anonymous_aggr (t
)
6473 /* Wipe out memory of synthesized methods */
6474 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6475 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6476 TYPE_HAS_INIT_REF (t
) = 0;
6477 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6478 TYPE_HAS_ASSIGN_REF (t
) = 0;
6479 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6481 /* Splice the implicitly generated functions out of the TYPE_METHODS
6483 q
= &TYPE_METHODS (t
);
6486 if (DECL_ARTIFICIAL (*q
))
6487 *q
= TREE_CHAIN (*q
);
6489 q
= &TREE_CHAIN (*q
);
6492 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6493 function members. */
6494 if (TYPE_METHODS (t
))
6495 error ("an anonymous union cannot have function members");
6498 /* Make sure that a declaration with no declarator is well-formed, i.e.
6499 just defines a tagged type or anonymous union.
6501 Returns the type defined, if any. */
6504 check_tag_decl (declspecs
)
6508 tree ob_modifier
= NULL_TREE
;
6510 register tree t
= NULL_TREE
;
6512 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6514 register tree value
= TREE_VALUE (link
);
6520 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6522 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6526 else if (value
== ridpointers
[(int) RID_FRIEND
])
6528 if (current_class_type
== NULL_TREE
6529 || current_scope () != current_class_type
)
6530 ob_modifier
= value
;
6532 else if (value
== ridpointers
[(int) RID_STATIC
]
6533 || value
== ridpointers
[(int) RID_EXTERN
]
6534 || value
== ridpointers
[(int) RID_AUTO
]
6535 || value
== ridpointers
[(int) RID_REGISTER
]
6536 || value
== ridpointers
[(int) RID_INLINE
]
6537 || value
== ridpointers
[(int) RID_VIRTUAL
]
6538 || value
== ridpointers
[(int) RID_CONST
]
6539 || value
== ridpointers
[(int) RID_VOLATILE
]
6540 || value
== ridpointers
[(int) RID_EXPLICIT
])
6541 ob_modifier
= value
;
6545 error ("multiple types in one declaration");
6547 /* Inside a class, we might be in a friend or access declaration.
6548 Until we have a good way of detecting the latter, don't warn. */
6549 if (t
== NULL_TREE
&& ! current_class_type
)
6550 pedwarn ("declaration does not declare anything");
6552 /* Check for an anonymous union. We're careful
6553 accessing TYPE_IDENTIFIER because some built-in types, like
6554 pointer-to-member types, do not have TYPE_NAME. */
6555 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6557 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6559 /* Anonymous unions are objects, so they can have specifiers. */;
6560 SET_ANON_AGGR_TYPE_P (t
);
6562 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6563 pedwarn ("ISO C++ prohibits anonymous structs");
6566 else if (ob_modifier
)
6568 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6569 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6570 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6571 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6572 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6573 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6574 cp_error ("`%D' can only be specified for constructors",
6577 cp_error ("`%D' can only be specified for objects and functions",
6584 /* Called when a declaration is seen that contains no names to declare.
6585 If its type is a reference to a structure, union or enum inherited
6586 from a containing scope, shadow that tag name for the current scope
6587 with a forward reference.
6588 If its type defines a new named structure or union
6589 or defines an enum, it is valid but we need not do anything here.
6590 Otherwise, it is an error.
6592 C++: may have to grok the declspecs to learn about static,
6593 complain for anonymous unions. */
6596 shadow_tag (declspecs
)
6599 tree t
= check_tag_decl (declspecs
);
6602 maybe_process_partial_specialization (t
);
6604 /* This is where the variables in an anonymous union are
6605 declared. An anonymous union declaration looks like:
6607 because there is no declarator after the union, the parser
6608 sends that declaration here. */
6609 if (t
&& ANON_AGGR_TYPE_P (t
))
6611 fixup_anonymous_aggr (t
);
6613 if (TYPE_FIELDS (t
))
6615 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6617 finish_anon_union (decl
);
6622 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6625 groktypename (typename
)
6628 if (TREE_CODE (typename
) != TREE_LIST
)
6630 return grokdeclarator (TREE_VALUE (typename
),
6631 TREE_PURPOSE (typename
),
6632 TYPENAME
, 0, NULL_TREE
);
6635 /* Decode a declarator in an ordinary declaration or data definition.
6636 This is called as soon as the type information and variable name
6637 have been parsed, before parsing the initializer if any.
6638 Here we create the ..._DECL node, fill in its type,
6639 and put it on the list of decls for the current context.
6640 The ..._DECL node is returned as the value.
6642 Exception: for arrays where the length is not specified,
6643 the type is left null, to be filled in by `cp_finish_decl'.
6645 Function definitions do not come here; they go to start_function
6646 instead. However, external and forward declarations of functions
6647 do go through here. Structure field declarations are done by
6648 grokfield and not through here. */
6650 /* Set this to zero to debug not using the temporary obstack
6651 to parse initializers. */
6652 int debug_temp_inits
= 1;
6655 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6656 tree declarator
, declspecs
;
6658 tree attributes
, prefix_attributes
;
6661 register tree type
, tem
;
6663 extern int have_extern_spec
;
6664 extern int used_extern_spec
;
6668 /* See code below that used this. */
6669 int init_written
= initialized
;
6672 /* This should only be done once on the top most decl. */
6673 if (have_extern_spec
&& !used_extern_spec
)
6675 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6677 used_extern_spec
= 1;
6680 if (attributes
|| prefix_attributes
)
6681 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6683 attrlist
= NULL_TREE
;
6685 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6688 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6691 type
= TREE_TYPE (decl
);
6693 if (type
== error_mark_node
)
6696 /* Don't lose if destructors must be executed at file-level. */
6697 if (! processing_template_decl
&& TREE_STATIC (decl
)
6698 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
6699 && !TREE_PERMANENT (decl
))
6701 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6702 decl
= copy_node (decl
);
6703 if (TREE_CODE (type
) == ARRAY_TYPE
)
6705 tree itype
= TYPE_DOMAIN (type
);
6706 if (itype
&& ! TREE_PERMANENT (itype
))
6708 itype
= build_index_type (TYPE_MAX_VALUE (itype
));
6709 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
6710 TREE_TYPE (decl
) = type
;
6717 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6718 ? DECL_CLASS_CONTEXT (decl
)
6719 : DECL_CONTEXT (decl
);
6721 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6722 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6724 /* When parsing the initializer, lookup should use the object's
6726 push_decl_namespace (context
);
6729 /* We are only interested in class contexts, later. */
6730 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6731 context
= NULL_TREE
;
6734 /* Is it valid for this decl to have an initializer at all?
6735 If not, set INITIALIZED to zero, which will indirectly
6736 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6737 switch (TREE_CODE (decl
))
6740 /* typedef foo = bar means give foo the same type as bar.
6741 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6742 Any other case of an initialization in a TYPE_DECL is an error. */
6743 if (pedantic
|| list_length (declspecs
) > 1)
6745 cp_error ("typedef `%D' is initialized", decl
);
6751 cp_error ("function `%#D' is initialized like a variable", decl
);
6761 if (! toplevel_bindings_p ()
6762 && DECL_EXTERNAL (decl
))
6763 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6765 DECL_EXTERNAL (decl
) = 0;
6766 if (toplevel_bindings_p ())
6767 TREE_STATIC (decl
) = 1;
6769 /* Tell `pushdecl' this is an initialized decl
6770 even though we don't yet have the initializer expression.
6771 Also tell `cp_finish_decl' it may store the real initializer. */
6772 DECL_INITIAL (decl
) = error_mark_node
;
6775 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6776 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6779 /* Set attributes here so if duplicate decl, will have proper attributes. */
6780 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6782 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6784 push_nested_class (context
, 2);
6786 if (TREE_CODE (decl
) == VAR_DECL
)
6788 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6789 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6790 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6793 if (DECL_CONTEXT (field
) != context
)
6795 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6796 DECL_CONTEXT (field
), DECL_NAME (decl
),
6797 context
, DECL_NAME (decl
));
6798 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6800 /* Static data member are tricky; an in-class initialization
6801 still doesn't provide a definition, so the in-class
6802 declaration will have DECL_EXTERNAL set, but will have an
6803 initialization. Thus, duplicate_decls won't warn
6804 about this situation, and so we check here. */
6805 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6806 cp_error ("duplicate initialization of %D", decl
);
6807 if (duplicate_decls (decl
, field
))
6813 tree field
= check_classfn (context
, decl
);
6814 if (field
&& duplicate_decls (decl
, field
))
6818 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6819 DECL_IN_AGGR_P (decl
) = 0;
6820 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6821 || CLASSTYPE_USE_TEMPLATE (context
))
6823 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6824 /* [temp.expl.spec] An explicit specialization of a static data
6825 member of a template is a definition if the declaration
6826 includes an initializer; otherwise, it is a declaration.
6828 We check for processing_specialization so this only applies
6829 to the new specialization syntax. */
6830 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6831 DECL_EXTERNAL (decl
) = 1;
6834 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6835 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6839 /* Enter this declaration into the symbol table. */
6840 tem
= maybe_push_decl (decl
);
6842 if (processing_template_decl
)
6844 if (at_function_scope_p ())
6845 push_permanent_obstack ();
6847 tem
= push_template_decl (tem
);
6848 /* In a a local scope, add a representation of this declaration
6849 to the statement tree. */
6850 if (at_function_scope_p ())
6852 add_decl_stmt (decl
);
6858 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6859 /* Tell the back-end to use or not use .common as appropriate. If we say
6860 -fconserve-space, we want this to save .data space, at the expense of
6861 wrong semantics. If we say -fno-conserve-space, we want this to
6862 produce errors about redefs; to do this we force variables into the
6864 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6867 if (! processing_template_decl
)
6870 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6871 push_obstacks_nochange ();
6880 tree type
= TREE_TYPE (decl
);
6881 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6883 if (type
== error_mark_node
)
6886 /* If this type of object needs a cleanup, and control may
6887 jump past it, make a new binding level so that it is cleaned
6888 up only when it is initialized first. */
6889 if (TYPE_NEEDS_DESTRUCTOR (type
)
6890 && current_binding_level
->more_cleanups_ok
== 0)
6891 pushlevel_temporary (1);
6894 /* Is it valid for this decl to have an initializer at all?
6895 If not, set INITIALIZED to zero, which will indirectly
6896 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6898 /* Don't allow initializations for incomplete types except for
6899 arrays which might be completed by the initialization. */
6900 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6901 ; /* A complete type is ok. */
6902 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6904 cp_error ("variable `%#D' has initializer but incomplete type",
6907 type
= TREE_TYPE (decl
) = error_mark_node
;
6909 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6911 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6912 cp_error ("elements of array `%#D' have incomplete type", decl
);
6913 /* else we already gave an error in start_decl. */
6919 && TREE_CODE (decl
) != TYPE_DECL
6920 && TREE_CODE (decl
) != TEMPLATE_DECL
6921 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6923 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6924 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6926 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6928 /* Change the type so that assemble_variable will give
6929 DECL an rtl we can live with: (mem (const_int 0)). */
6930 type
= TREE_TYPE (decl
) = error_mark_node
;
6934 /* If any base type in the hierarchy of TYPE needs a constructor,
6935 then we set initialized to 1. This way any nodes which are
6936 created for the purposes of initializing this aggregate
6937 will live as long as it does. This is necessary for global
6938 aggregates which do not have their initializers processed until
6939 the end of the file. */
6940 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6945 DECL_INITIAL (decl
) = NULL_TREE
;
6948 /* Handle initialization of references.
6949 These three arguments are from `cp_finish_decl', and have the
6950 same meaning here that they do there.
6952 Quotes on semantics can be found in ARM 8.4.3. */
6955 grok_reference_init (decl
, type
, init
)
6956 tree decl
, type
, init
;
6960 if (init
== NULL_TREE
)
6962 if ((DECL_LANG_SPECIFIC (decl
) == 0
6963 || DECL_IN_AGGR_P (decl
) == 0)
6964 && ! DECL_THIS_EXTERN (decl
))
6965 cp_error ("`%D' declared as reference but not initialized", decl
);
6969 if (init
== error_mark_node
)
6972 if (TREE_CODE (init
) == CONSTRUCTOR
)
6974 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6978 if (TREE_CODE (init
) == TREE_LIST
)
6979 init
= build_compound_expr (init
);
6981 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6982 init
= convert_from_reference (init
);
6984 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6985 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6987 /* Note: default conversion is only called in very special cases. */
6988 init
= default_conversion (init
);
6991 tmp
= convert_to_reference
6992 (type
, init
, CONV_IMPLICIT
,
6993 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6995 if (tmp
== error_mark_node
)
6997 else if (tmp
!= NULL_TREE
)
7000 DECL_INITIAL (decl
) = save_expr (init
);
7004 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7008 /* ?? Can this be optimized in some cases to
7009 hand back the DECL_INITIAL slot?? */
7010 if (TYPE_SIZE (TREE_TYPE (type
)))
7011 init
= convert_from_reference (decl
);
7013 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7015 expand_static_init (decl
, DECL_INITIAL (decl
));
7016 DECL_INITIAL (decl
) = NULL_TREE
;
7021 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7022 mucking with forces it does not comprehend (i.e. initialization with a
7023 constructor). If we are at global scope and won't go into COMMON, fill
7024 it in with a dummy CONSTRUCTOR to force the variable into .data;
7025 otherwise we can use error_mark_node. */
7028 obscure_complex_init (decl
, init
)
7031 if (! flag_no_inline
&& TREE_STATIC (decl
))
7033 if (extract_init (decl
, init
))
7037 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7038 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7039 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7043 DECL_INITIAL (decl
) = error_mark_node
;
7048 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7049 array until we finish parsing the initializer. If that's the
7050 situation we're in, update DECL accordingly. */
7053 maybe_deduce_size_from_array_init (decl
, init
)
7057 tree type
= TREE_TYPE (decl
);
7059 if (TREE_CODE (type
) == ARRAY_TYPE
7060 && TYPE_DOMAIN (type
) == NULL_TREE
7061 && TREE_CODE (decl
) != TYPE_DECL
)
7064 = (TREE_STATIC (decl
)
7065 /* Even if pedantic, an external linkage array
7066 may have incomplete type at first. */
7067 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7068 : !DECL_EXTERNAL (decl
));
7069 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7070 int failure
= complete_array_type (type
, initializer
, do_default
);
7073 cp_error ("initializer fails to determine size of `%D'", decl
);
7078 cp_error ("array size missing in `%D'", decl
);
7079 /* If a `static' var's size isn't known, make it extern as
7080 well as static, so it does not get allocated. If it's not
7081 `static', then don't mark it extern; finish_incomplete_decl
7082 will give it a default size and it will get allocated. */
7083 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7084 DECL_EXTERNAL (decl
) = 1;
7087 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7088 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7090 cp_error ("zero-size array `%D'", decl
);
7092 layout_decl (decl
, 0);
7096 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7097 any appropriate error messages regarding the layout. INIT is a
7098 the initializer for DECL; returns a modified version. */
7101 layout_var_decl (decl
, init
)
7105 tree ttype
= target_type (TREE_TYPE (decl
));
7107 /* If we haven't already layed out this declaration, and we know its
7108 type, do so now. Note that we must not call complete type for an
7109 external object because it's type might involve templates that we
7110 are not supposed to isntantiate yet. */
7111 if (!DECL_EXTERNAL (decl
)
7112 && DECL_SIZE (decl
) == NULL_TREE
7113 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7114 layout_decl (decl
, 0);
7116 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7118 /* An automatic variable with an incomplete type: that is an error.
7119 Don't talk about array types here, since we took care of that
7120 message in grokdeclarator. */
7121 cp_error ("storage size of `%D' isn't known", decl
);
7122 TREE_TYPE (decl
) = error_mark_node
;
7124 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7125 /* Let debugger know it should output info for this type. */
7126 note_debug_info_needed (ttype
);
7128 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7129 note_debug_info_needed (DECL_CONTEXT (decl
));
7131 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7132 && DECL_SIZE (decl
) != NULL_TREE
7133 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7135 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7136 constant_expression_warning (DECL_SIZE (decl
));
7138 cp_error ("storage size of `%D' isn't constant", decl
);
7144 /* Return a cleanup for DECL, created on whatever obstack is
7148 build_cleanup_on_safe_obstack (decl
)
7155 type
= TREE_TYPE (decl
);
7157 /* Only variables get cleaned up. */
7158 if (TREE_CODE (decl
) != VAR_DECL
)
7161 /* And only things with destructors need cleaning up. */
7162 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7165 if (TREE_CODE (decl
) == VAR_DECL
&&
7166 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7167 /* We don't clean up things that aren't defined in this
7168 translation unit, or that need a static cleanup. The latter
7169 are handled by finish_file. */
7172 /* Switch to an obstack that will live until the point where the
7173 cleanup code is actually expanded. */
7174 need_pop
= suspend_momentary ();
7176 /* Compute the cleanup. */
7177 cleanup
= maybe_build_cleanup (decl
);
7179 /* Pop back to the obstack we were on before. */
7180 resume_momentary (need_pop
);
7185 /* If a local static variable is declared in an inline function, or if
7186 we have a weak definition, we must endeavor to create only one
7187 instance of the variable at link-time. */
7190 maybe_commonize_var (decl
)
7193 /* Static data in a function with comdat linkage also has comdat
7195 if (TREE_STATIC (decl
)
7196 /* Don't mess with __FUNCTION__. */
7197 && ! TREE_ASM_WRITTEN (decl
)
7198 && current_function_decl
7199 && DECL_CONTEXT (decl
) == current_function_decl
7200 && (DECL_THIS_INLINE (current_function_decl
)
7201 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7202 && TREE_PUBLIC (current_function_decl
))
7204 /* Rather than try to get this right with inlining, we suppress
7205 inlining of such functions. */
7206 current_function_cannot_inline
7207 = "function with static variable cannot be inline";
7209 /* If flag_weak, we don't need to mess with this, as we can just
7210 make the function weak, and let it refer to its unique local
7211 copy. This works because we don't allow the function to be
7215 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7217 TREE_PUBLIC (decl
) = 1;
7218 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7220 else if (DECL_INITIAL (decl
) == NULL_TREE
7221 || DECL_INITIAL (decl
) == error_mark_node
)
7223 TREE_PUBLIC (decl
) = 1;
7224 DECL_COMMON (decl
) = 1;
7226 /* else we lose. We can only do this if we can use common,
7227 which we can't if it has been initialized. */
7229 if (TREE_PUBLIC (decl
))
7230 DECL_ASSEMBLER_NAME (decl
)
7231 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7232 else if (! DECL_ARTIFICIAL (decl
))
7234 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7235 cp_warning_at (" you can work around this by removing the initializer", decl
);
7239 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7240 /* Set it up again; we might have set DECL_INITIAL since the last
7242 comdat_linkage (decl
);
7245 /* Issue an error message if DECL is an uninitialized const variable. */
7248 check_for_uninitialized_const_var (decl
)
7251 tree type
= TREE_TYPE (decl
);
7253 /* ``Unless explicitly declared extern, a const object does not have
7254 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7256 if (TREE_CODE (decl
) == VAR_DECL
7257 && TREE_CODE (type
) != REFERENCE_TYPE
7258 && CP_TYPE_CONST_P (type
)
7259 && !TYPE_NEEDS_CONSTRUCTING (type
)
7260 && !DECL_INITIAL (decl
))
7261 cp_error ("uninitialized const `%D'", decl
);
7264 /* Verify INIT (the initializer for DECL), and record the
7265 initialization in DECL_INITIAL, if appropriate. Returns a new
7269 check_initializer (decl
, init
)
7275 if (TREE_CODE (decl
) == FIELD_DECL
)
7278 type
= TREE_TYPE (decl
);
7280 /* If `start_decl' didn't like having an initialization, ignore it now. */
7281 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7284 /* Check the initializer. */
7287 /* Things that are going to be initialized need to have complete
7289 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7291 if (type
== error_mark_node
)
7292 /* We will have already complained. */
7294 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7296 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7299 else if (TREE_CODE (type
) == ARRAY_TYPE
7300 && !TYPE_SIZE (TREE_TYPE (type
)))
7302 cp_error ("elements of array `%#D' have incomplete type", decl
);
7305 else if (!TYPE_SIZE (type
))
7307 cp_error ("`%D' has incomplete type", decl
);
7308 TREE_TYPE (decl
) = error_mark_node
;
7313 if (TREE_CODE (decl
) == CONST_DECL
)
7315 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7317 DECL_INITIAL (decl
) = init
;
7319 /* This will keep us from needing to worry about our obstacks. */
7320 my_friendly_assert (init
!= NULL_TREE
, 149);
7323 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7325 if (TREE_STATIC (decl
))
7326 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7327 grok_reference_init (decl
, type
, init
);
7332 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7334 if (TREE_CODE (type
) == ARRAY_TYPE
)
7335 init
= digest_init (type
, init
, (tree
*) 0);
7336 else if (TREE_CODE (init
) == CONSTRUCTOR
7337 && TREE_HAS_CONSTRUCTOR (init
))
7339 if (TYPE_NON_AGGREGATE_CLASS (type
))
7341 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7343 init
= error_mark_node
;
7346 goto dont_use_constructor
;
7351 dont_use_constructor
:
7352 if (TREE_CODE (init
) != TREE_VEC
)
7353 init
= store_init_value (decl
, init
);
7357 /* We must hide the initializer so that expand_decl
7358 won't try to do something it does not understand. */
7359 init
= obscure_complex_init (decl
, init
);
7361 else if (DECL_EXTERNAL (decl
))
7363 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7364 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7366 tree core_type
= strip_array_types (type
);
7368 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7370 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7371 cp_error ("structure `%D' with uninitialized const members", decl
);
7372 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7373 cp_error ("structure `%D' with uninitialized reference members",
7377 check_for_uninitialized_const_var (decl
);
7379 if (TYPE_SIZE (type
) != NULL_TREE
7380 && TYPE_NEEDS_CONSTRUCTING (type
))
7381 init
= obscure_complex_init (decl
, NULL_TREE
);
7385 check_for_uninitialized_const_var (decl
);
7390 /* If DECL is not a local variable, give it RTL. */
7393 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7396 const char *asmspec
;
7401 type
= TREE_TYPE (decl
);
7402 toplev
= toplevel_bindings_p ();
7403 push_obstacks_nochange ();
7404 if (TREE_STATIC (decl
)
7405 && TYPE_NEEDS_DESTRUCTOR (type
)
7406 && allocation_temporary_p ())
7407 end_temporary_allocation ();
7409 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7410 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7411 else if (TREE_CODE (decl
) == VAR_DECL
7412 && TREE_READONLY (decl
)
7413 && DECL_INITIAL (decl
) != NULL_TREE
7414 && DECL_INITIAL (decl
) != error_mark_node
7415 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7417 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7420 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7423 && TREE_STATIC (decl
)
7424 && ! TREE_SIDE_EFFECTS (decl
)
7425 && ! TREE_PUBLIC (decl
)
7426 && ! DECL_EXTERNAL (decl
)
7427 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7428 && DECL_MODE (decl
) != BLKmode
)
7430 /* If this variable is really a constant, then fill its DECL_RTL
7431 slot with something which won't take up storage.
7432 If something later should take its address, we can always give
7433 it legitimate RTL at that time. */
7434 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7435 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7436 TREE_ASM_WRITTEN (decl
) = 1;
7438 else if (toplev
&& ! TREE_PUBLIC (decl
))
7440 /* If this is a static const, change its apparent linkage
7441 if it belongs to a #pragma interface. */
7442 if (!interface_unknown
)
7444 TREE_PUBLIC (decl
) = 1;
7445 DECL_EXTERNAL (decl
) = interface_only
;
7447 make_decl_rtl (decl
, asmspec
, toplev
);
7450 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7452 else if (TREE_CODE (decl
) == VAR_DECL
7453 && DECL_LANG_SPECIFIC (decl
)
7454 && DECL_IN_AGGR_P (decl
))
7456 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7458 if (init
== NULL_TREE
7459 #ifdef DEFAULT_STATIC_DEFS
7460 /* If this code is dead, then users must
7461 explicitly declare static member variables
7462 outside the class def'n as well. */
7463 && TYPE_NEEDS_CONSTRUCTING (type
)
7467 DECL_EXTERNAL (decl
) = 1;
7468 make_decl_rtl (decl
, asmspec
, 1);
7471 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7474 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7479 /* The old ARM scoping rules injected variables declared in the
7480 initialization statement of a for-statement into the surrounding
7481 scope. We support this usage, in order to be backward-compatible.
7482 DECL is a just-declared VAR_DECL; if necessary inject its
7483 declaration into the surrounding scope. */
7486 maybe_inject_for_scope_var (decl
)
7489 if (current_binding_level
->is_for_scope
)
7491 struct binding_level
*outer
7492 = current_binding_level
->level_chain
;
7494 /* Check to see if the same name is already bound at the outer
7495 level, either because it was directly declared, or because a
7496 dead for-decl got preserved. In either case, the code would
7497 not have been valid under the ARM scope rules, so clear
7498 is_for_scope for the current_binding_level.
7500 Otherwise, we need to preserve the temp slot for decl to last
7501 into the outer binding level. */
7504 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7506 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7507 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7509 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7511 BINDING_VALUE (outer_binding
)
7512 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7513 current_binding_level
->is_for_scope
= 0;
7515 else if (DECL_IN_MEMORY_P (decl
))
7516 preserve_temp_slots (DECL_RTL (decl
));
7520 /* Generate code to initialize DECL (a local variable). */
7523 initialize_local_var (decl
, init
, flags
)
7531 type
= complete_type (TREE_TYPE (decl
));
7533 cleanup
= build_cleanup_on_safe_obstack (decl
);
7535 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7537 /* If we used it already as memory, it must stay in memory. */
7538 DECL_INITIAL (decl
) = NULL_TREE
;
7539 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7542 if (DECL_RTL (decl
))
7543 /* Only a RESULT_DECL should have non-NULL RTL when arriving here.
7544 All other local variables are assigned RTL in this function. */
7545 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
, 19990828);
7547 /* Create RTL for this variable. */
7550 expand_start_target_temps ();
7552 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7556 /* Compute and store the initial value. */
7557 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7559 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7561 emit_line_note (DECL_SOURCE_FILE (decl
),
7562 DECL_SOURCE_LINE (decl
));
7563 /* We call push_momentary here so that when
7564 finish_expr_stmt clears the momentary obstack it
7565 doesn't destory any momentary expressions we may
7566 have lying around. Although cp_finish_decl is
7567 usually called at the end of a declaration
7568 statement, it may also be called for a temporary
7569 object in the middle of an expression. */
7571 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7575 expand_decl_init (decl
);
7577 /* Set this to 0 so we can tell whether an aggregate which was
7578 initialized was ever used. Don't do this if it has a
7579 destructor, so we don't complain about the 'resource
7580 allocation is initialization' idiom. Now set
7581 attribute((unused)) on types so decls of that type will be
7582 marked used. (see TREE_USED, above.) */
7583 if (TYPE_NEEDS_CONSTRUCTING (type
)
7585 && cleanup
== NULL_TREE
7586 && DECL_NAME (decl
))
7587 TREE_USED (decl
) = 0;
7588 else if (already_used
)
7589 TREE_USED (decl
) = 1;
7592 /* Cleanup any temporaries needed for the initial value. */
7593 expand_end_target_temps ();
7595 /* Record the cleanup required for this declaration. */
7596 if (DECL_SIZE (decl
)
7597 && type
!= error_mark_node
7599 && !expand_decl_cleanup (decl
, cleanup
))
7600 cp_error ("parser lost in parsing declaration of `%D'", decl
);
7603 /* Finish processing of a declaration;
7604 install its line number and initial value.
7605 If the length of an array type is not known before,
7606 it must be determined now, from the initial value, or it is an error.
7608 Call `pop_obstacks' iff NEED_POP is nonzero.
7610 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7611 for aggregates that have constructors alive on the permanent obstack,
7612 so that the global initializing functions can be written at the end.
7614 INIT0 holds the value of an initializer that should be allowed to escape
7617 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7618 if the (init) syntax was used.
7620 For functions that take default parameters, DECL points to its
7621 "maximal" instantiation. `cp_finish_decl' must then also declared its
7622 subsequently lower and lower forms of instantiation, checking for
7623 ambiguity as it goes. This can be sped up later. */
7626 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7633 tree ttype
= NULL_TREE
;
7634 int temporary
= allocation_temporary_p ();
7635 const char *asmspec
= NULL
;
7636 int was_readonly
= 0;
7638 /* If this is 0, then we did not change obstacks. */
7642 error ("assignment (not initialization) in declaration");
7646 /* If a name was specified, get the string. */
7648 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7650 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7652 cp_error ("Cannot initialize `%D' to namespace `%D'",
7657 if (current_class_type
7658 && DECL_REAL_CONTEXT (decl
) == current_class_type
7659 && TYPE_BEING_DEFINED (current_class_type
)
7660 && (DECL_INITIAL (decl
) || init
))
7661 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7663 if (TREE_CODE (decl
) == VAR_DECL
7664 && DECL_CONTEXT (decl
)
7665 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7666 && DECL_CONTEXT (decl
) != current_namespace
7669 /* Leave the namespace of the object. */
7670 pop_decl_namespace ();
7673 type
= TREE_TYPE (decl
);
7675 if (type
== error_mark_node
)
7677 if (toplevel_bindings_p () && temporary
)
7678 end_temporary_allocation ();
7683 if (TYPE_HAS_MUTABLE_P (type
))
7684 TREE_READONLY (decl
) = 0;
7686 if (processing_template_decl
)
7688 if (init
&& DECL_INITIAL (decl
))
7689 DECL_INITIAL (decl
) = init
;
7693 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7694 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7696 /* Take care of TYPE_DECLs up front. */
7697 if (TREE_CODE (decl
) == TYPE_DECL
)
7699 if (init
&& DECL_INITIAL (decl
))
7701 /* typedef foo = bar; store the type of bar as the type of foo. */
7702 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7703 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7705 if (type
!= error_mark_node
7706 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7708 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7709 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7710 set_identifier_type_value (DECL_NAME (decl
), type
);
7711 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7713 GNU_xref_decl (current_function_decl
, decl
);
7715 /* If we have installed this as the canonical typedef for this
7716 type, and that type has not been defined yet, delay emitting
7717 the debug information for it, as we will emit it later. */
7718 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7719 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7720 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7722 rest_of_decl_compilation (decl
, NULL_PTR
,
7723 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7727 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7728 ttype
= target_type (type
);
7730 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7731 && TYPE_NEEDS_CONSTRUCTING (type
))
7733 /* Currently, GNU C++ puts constants in text space, making them
7734 impossible to initialize. In the future, one would hope for
7735 an operating system which understood the difference between
7736 initialization and the running of a program. */
7738 TREE_READONLY (decl
) = 0;
7741 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7743 /* This must override the asm specifier which was placed by
7744 grokclassfn. Lay this out fresh. */
7745 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7746 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7747 make_decl_rtl (decl
, asmspec
, 0);
7750 /* Deduce size of array from initialization, if not already known. */
7751 maybe_deduce_size_from_array_init (decl
, init
);
7752 init
= check_initializer (decl
, init
);
7754 GNU_xref_decl (current_function_decl
, decl
);
7756 /* For top-level declaration, the initial value was read in
7757 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7758 must go in the permanent obstack; but don't discard the
7759 temporary data yet. */
7761 if (toplevel_bindings_p () && temporary
)
7762 end_temporary_allocation ();
7764 if (TREE_CODE (decl
) == VAR_DECL
)
7765 init
= layout_var_decl (decl
, init
);
7767 /* Output the assembler code and/or RTL code for variables and functions,
7768 unless the type is an undefined structure or union.
7769 If not, it will get done when the type is completed. */
7770 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7771 || TREE_CODE (decl
) == RESULT_DECL
)
7773 /* ??? FIXME: What about nested classes? */
7774 int toplev
= toplevel_bindings_p ();
7776 if (TREE_CODE (decl
) == VAR_DECL
)
7777 maybe_commonize_var (decl
);
7779 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7781 if (TREE_CODE (type
) == FUNCTION_TYPE
7782 || TREE_CODE (type
) == METHOD_TYPE
)
7783 abstract_virtuals_error (decl
,
7784 strip_array_types (TREE_TYPE (type
)));
7786 abstract_virtuals_error (decl
, strip_array_types (type
));
7788 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7790 else if (DECL_EXTERNAL (decl
)
7791 && ! (DECL_LANG_SPECIFIC (decl
)
7792 && DECL_NOT_REALLY_EXTERN (decl
)))
7795 DECL_INITIAL (decl
) = init
;
7797 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7799 /* Cleanups for static variables are handled by `finish_file'. */
7800 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7801 || TYPE_NEEDS_DESTRUCTOR (type
))
7802 expand_static_init (decl
, init
);
7806 /* This is a local declaration. */
7807 maybe_inject_for_scope_var (decl
);
7808 /* Initialize the local variable. But, if we're building a
7809 statement-tree, we'll do the initialization when we
7811 if (!building_stmt_tree ())
7812 initialize_local_var (decl
, init
, flags
);
7813 else if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7814 DECL_INITIAL (decl
) = init
;
7818 /* Undo call to `pushclass' that was done in `start_decl'
7819 due to initialization of qualified member variable.
7820 I.e., Foo::x = 10; */
7822 tree context
= DECL_REAL_CONTEXT (decl
);
7824 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7825 && (TREE_CODE (decl
) == VAR_DECL
7826 /* We also have a pushclass done that we need to undo here
7827 if we're at top level and declare a method. */
7828 || TREE_CODE (decl
) == FUNCTION_DECL
)
7829 /* If size hasn't been set, we're still defining it,
7830 and therefore inside the class body; don't pop
7831 the binding level.. */
7832 && TYPE_SIZE (context
) != NULL_TREE
7833 && context
== current_class_type
)
7834 pop_nested_class ();
7840 /* If requested, warn about definitions of large data objects. */
7842 if (warn_larger_than
7843 && ! processing_template_decl
7844 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7845 && !DECL_EXTERNAL (decl
))
7847 register tree decl_size
= DECL_SIZE (decl
);
7849 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7851 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7853 if (units
> larger_than_size
)
7854 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7859 /* Resume permanent allocation, if not within a function. The
7860 corresponding push_obstacks_nochange is in start_decl,
7861 start_method, groktypename, and in grokfield. */
7865 TREE_READONLY (decl
) = 1;
7868 /* This is here for a midend callback from c-common.c */
7871 finish_decl (decl
, init
, asmspec_tree
)
7875 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7878 /* Generate code to handle the destruction of the function-scoped
7879 static variable DECL. */
7882 destroy_local_static (decl
)
7885 tree cleanup
, fcall
;
7887 int saved_flag_access_control
;
7889 if (atexit_node
== 0)
7891 tree atexit_fndecl
, PFV
, pfvlist
;
7892 /* Remember this information until end of file. */
7893 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7894 PFV
= build_pointer_type (build_function_type
7895 (void_type_node
, void_list_node
));
7897 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7899 push_lang_context (lang_name_c
);
7900 /* Note that we do not call pushdecl for this function;
7901 there's no reason that this declaration should be
7902 accessible to anyone. */
7904 = define_function ("atexit",
7905 build_function_type (void_type_node
,
7910 mark_used (atexit_fndecl
);
7911 atexit_node
= default_conversion (atexit_fndecl
);
7912 pop_lang_context ();
7916 /* Call build_cleanup before we enter the anonymous function so that
7917 any access checks will be done relative to the current scope,
7918 rather than the scope of the anonymous function. */
7919 build_cleanup (decl
);
7921 /* Now start the function. */
7922 cleanup
= start_anon_func ();
7924 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7925 to the original function, rather than the anonymous one. That
7926 will make the back-end think that nested functions are in use,
7927 which causes confusion. */
7928 saved_flag_access_control
= flag_access_control
;
7929 flag_access_control
= 0;
7930 fcall
= build_cleanup (decl
);
7931 flag_access_control
= saved_flag_access_control
;
7933 /* Create the body of the anonymous function. */
7934 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7935 finish_expr_stmt (fcall
);
7936 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7939 /* Call atexit with the cleanup function. */
7940 mark_addressable (cleanup
);
7941 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7942 fcall
= build_function_call (atexit_node
,
7943 tree_cons (NULL_TREE
,
7946 finish_expr_stmt (fcall
);
7950 expand_static_init (decl
, init
)
7954 tree oldstatic
= value_member (decl
, static_aggregates
);
7958 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7959 cp_error ("multiple initializations given for `%D'", decl
);
7961 else if (! toplevel_bindings_p ())
7963 /* Emit code to perform this initialization but once. */
7970 /* Remember this information until end of file. */
7971 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7973 /* Emit code to perform this initialization but once. This code
7976 static int temp = 0;
7978 // Do initialization.
7980 // Register variable for destruction at end of program.
7983 Note that the `temp' variable is only set to 1 *after* the
7984 initialization is complete. This ensures that an exception,
7985 thrown during the construction, will cause the variable to
7986 reinitialized when we pass through this code again, as per:
7990 If the initialization exits by throwing an exception, the
7991 initialization is not complete, so it will be tried again
7992 the next time control enters the declaration.
7994 In theory, this process should be thread-safe, too; multiple
7995 threads should not be able to initialize the variable more
7996 than once. We don't yet attempt to ensure thread-safety. */
7997 temp
= get_temp_name (integer_type_node
, 1);
7998 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8000 /* Begin the conditional initialization. */
8001 if_stmt
= begin_if_stmt ();
8002 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
8005 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8007 /* Do the initialization itself. */
8008 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8009 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8010 assignment
= build_aggr_init (decl
, init
, 0);
8012 /* The initialization we're doing here is just a bitwise
8014 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8016 assignment
= NULL_TREE
;
8018 /* Once the assignment is complete, set TEMP to 1. Since the
8019 construction of the static object is complete at this point,
8020 we want to make sure TEMP is set to 1 even if a temporary
8021 constructed during the initialization throws an exception
8022 when it is destroyed. So, we combine the initialization and
8023 the assignment to TEMP into a single expression, ensuring
8024 that when we call finish_expr_stmt the cleanups will not be
8025 run until after TEMP is set to 1. */
8026 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8029 assignment
= tree_cons (NULL_TREE
, assignment
,
8030 build_tree_list (NULL_TREE
,
8032 assignment
= build_compound_expr (assignment
);
8035 assignment
= temp_init
;
8036 finish_expr_stmt (assignment
);
8038 /* Use atexit to register a function for destroying this static
8040 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8041 destroy_local_static (decl
);
8043 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8044 finish_then_clause (if_stmt
);
8047 /* Resume old (possibly temporary) allocation. */
8052 /* This code takes into account memory allocation policy of
8053 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8054 hold for this object, then we must make permanent the storage
8055 currently in the temporary obstack. */
8056 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8057 preserve_initializer ();
8058 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8062 /* Finish the declaration of a catch-parameter. */
8065 start_handler_parms (declspecs
, declarator
)
8072 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8074 if (decl
== NULL_TREE
)
8075 error ("invalid catch parameter");
8079 expand_start_catch_block (decl
);
8083 /* Make TYPE a complete type based on INITIAL_VALUE.
8084 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8085 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8088 complete_array_type (type
, initial_value
, do_default
)
8089 tree type
, initial_value
;
8092 register tree maxindex
= NULL_TREE
;
8095 /* Allocate on the same obstack as TYPE. */
8096 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8100 /* Note MAXINDEX is really the maximum index,
8101 one less than the size. */
8102 if (TREE_CODE (initial_value
) == STRING_CST
)
8105 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8106 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8109 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8111 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8112 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8113 for (; elts
; elts
= TREE_CHAIN (elts
))
8115 if (TREE_PURPOSE (elts
))
8116 maxindex
= TREE_PURPOSE (elts
);
8118 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8120 maxindex
= copy_node (maxindex
);
8124 /* Make an error message unless that happened already. */
8125 if (initial_value
!= error_mark_node
)
8128 initial_value
= NULL_TREE
;
8130 /* Prevent further error messages. */
8131 maxindex
= build_int_2 (0, 0);
8138 maxindex
= build_int_2 (0, 0);
8147 domain
= build_index_type (maxindex
);
8148 TYPE_DOMAIN (type
) = domain
;
8150 if (! TREE_TYPE (maxindex
))
8151 TREE_TYPE (maxindex
) = domain
;
8153 itype
= TREE_TYPE (initial_value
);
8156 if (itype
&& !TYPE_DOMAIN (itype
))
8157 TYPE_DOMAIN (itype
) = domain
;
8158 /* The type of the main variant should never be used for arrays
8159 of different sizes. It should only ever be completed with the
8160 size of the array. */
8161 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8162 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8167 /* Lay out the type now that we can get the real answer. */
8174 /* Return zero if something is declared to be a member of type
8175 CTYPE when in the context of CUR_TYPE. STRING is the error
8176 message to print in that case. Otherwise, quietly return 1. */
8179 member_function_or_else (ctype
, cur_type
, string
)
8180 tree ctype
, cur_type
;
8183 if (ctype
&& ctype
!= cur_type
)
8185 error (string
, TYPE_NAME_STRING (ctype
));
8191 /* Subroutine of `grokdeclarator'. */
8193 /* Generate errors possibly applicable for a given set of specifiers.
8194 This is for ARM $7.1.2. */
8197 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8200 int virtualp
, quals
, friendp
, raises
, inlinep
;
8203 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8205 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8207 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8210 cp_error_at ("`%D' declared as a friend", object
);
8212 cp_error_at ("`%D' declared with an exception specification", object
);
8215 /* CTYPE is class type, or null if non-class.
8216 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8218 DECLARATOR is the function's name.
8219 VIRTUALP is truthvalue of whether the function is virtual or not.
8220 FLAGS are to be passed through to `grokclassfn'.
8221 QUALS are qualifiers indicating whether the function is `const'
8223 RAISES is a list of exceptions that this function can raise.
8224 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8225 not look, and -1 if we should not call `grokclassfn' at all.
8227 Returns `NULL_TREE' if something goes wrong, after issuing
8228 applicable error messages. */
8231 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8232 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8233 template_count
, in_namespace
)
8236 tree orig_declarator
;
8238 enum overload_flags flags
;
8240 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8244 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8245 int has_default_arg
= 0;
8249 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8250 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8256 type
= build_exception_variant (type
, raises
);
8259 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8260 /* Propagate volatile out from type to decl. */
8261 if (TYPE_VOLATILE (type
))
8262 TREE_THIS_VOLATILE (decl
) = 1;
8264 /* If this decl has namespace scope, set that up. */
8266 set_decl_namespace (decl
, in_namespace
, friendp
);
8267 else if (publicp
&& ! ctype
)
8268 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8270 /* `main' and builtins have implicit 'C' linkage. */
8271 if ((MAIN_NAME_P (declarator
)
8272 || (IDENTIFIER_LENGTH (declarator
) > 10
8273 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8274 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8275 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8276 && current_lang_name
== lang_name_cplusplus
8277 && ctype
== NULL_TREE
8278 /* NULL_TREE means global namespace. */
8279 && DECL_CONTEXT (decl
) == NULL_TREE
)
8280 DECL_LANGUAGE (decl
) = lang_c
;
8282 /* Should probably propagate const out from type to decl I bet (mrs). */
8285 DECL_STATIC_FUNCTION_P (decl
) = 1;
8286 DECL_CONTEXT (decl
) = ctype
;
8290 DECL_CLASS_CONTEXT (decl
) = ctype
;
8292 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8294 if (processing_template_decl
)
8295 error ("cannot declare `main' to be a template");
8297 error ("cannot declare `main' to be inline");
8299 error ("cannot declare `main' to be static");
8304 /* Members of anonymous types and local classes have no linkage; make
8306 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8307 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8312 /* [basic.link]: A name with no linkage (notably, the name of a class
8313 or enumeration declared in a local scope) shall not be used to
8314 declare an entity with linkage.
8316 Only check this for public decls for now. */
8317 t
= no_linkage_check (TREE_TYPE (decl
));
8320 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8322 if (DECL_LANGUAGE (decl
) == lang_c
)
8323 /* Allow this; it's pretty common in C. */;
8325 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8329 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8334 TREE_PUBLIC (decl
) = publicp
;
8337 DECL_INTERFACE_KNOWN (decl
) = 1;
8338 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8342 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8344 DECL_EXTERNAL (decl
) = 1;
8345 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8347 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8348 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8352 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8353 grok_op_properties (decl
, virtualp
, check
< 0);
8355 if (ctype
&& hack_decl_function_context (decl
))
8356 DECL_NO_STATIC_CHAIN (decl
) = 1;
8358 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8359 if (TREE_PURPOSE (t
)
8360 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8362 has_default_arg
= 1;
8367 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8371 ("defining explicit specialization `%D' in friend declaration",
8375 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8377 /* Something like `template <class T> friend void f<T>()'. */
8378 cp_error ("template-id `%D' in declaration of primary template",
8384 /* A friend declaration of the form friend void f<>(). Record
8385 the information in the TEMPLATE_ID_EXPR. */
8386 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8387 DECL_TEMPLATE_INFO (decl
)
8388 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8389 TREE_OPERAND (orig_declarator
, 1),
8392 if (has_default_arg
)
8394 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8401 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8408 if (has_default_arg
)
8409 add_defarg_fn (decl
);
8411 /* Plain overloading: will not be grok'd by grokclassfn. */
8412 if (! ctype
&& ! processing_template_decl
8413 && DECL_LANGUAGE (decl
) != lang_c
8414 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8415 set_mangled_name_for_decl (decl
);
8418 /* Make the init_value nonzero so pushdecl knows this is not
8419 tentative. error_mark_node is replaced later with the BLOCK. */
8420 DECL_INITIAL (decl
) = error_mark_node
;
8422 /* Caller will do the rest of this. */
8426 if (check
&& funcdef_flag
)
8427 DECL_INITIAL (decl
) = error_mark_node
;
8429 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8432 /* Just handle constructors here. We could do this
8433 inside the following if stmt, but I think
8434 that the code is more legible by breaking this
8435 case out. See comments below for what each of
8436 the following calls is supposed to do. */
8437 DECL_CONSTRUCTOR_P (decl
) = 1;
8439 grokclassfn (ctype
, decl
, flags
, quals
);
8441 decl
= check_explicit_specialization (orig_declarator
, decl
,
8443 2 * (funcdef_flag
!= 0) +
8444 4 * (friendp
!= 0));
8445 if (decl
== error_mark_node
)
8448 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8451 tmp
= check_classfn (ctype
, decl
);
8453 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8454 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8456 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8457 cp_error ("definition of implicitly-declared `%D'", tmp
);
8458 if (tmp
&& duplicate_decls (decl
, tmp
))
8461 if (! grok_ctor_properties (ctype
, decl
))
8468 /* Function gets the ugly name, field gets the nice one.
8469 This call may change the type of the function (because
8470 of default parameters)! */
8471 if (ctype
!= NULL_TREE
)
8472 grokclassfn (ctype
, decl
, flags
, quals
);
8474 decl
= check_explicit_specialization (orig_declarator
, decl
,
8476 2 * (funcdef_flag
!= 0) +
8477 4 * (friendp
!= 0));
8478 if (decl
== error_mark_node
)
8481 if (ctype
!= NULL_TREE
8482 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8485 tmp
= check_classfn (ctype
, decl
);
8487 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8488 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8490 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8491 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8493 /* Remove the `this' parm added by grokclassfn.
8494 XXX Isn't this done in start_function, too? */
8495 revert_static_member_fn (&decl
, NULL
, NULL
);
8496 last_function_parms
= TREE_CHAIN (last_function_parms
);
8498 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8499 cp_error ("definition of implicitly-declared `%D'", tmp
);
8502 /* Attempt to merge the declarations. This can fail, in
8503 the case of some illegal specialization declarations. */
8504 if (!duplicate_decls (decl
, tmp
))
8505 cp_error ("no `%#D' member function declared in class `%T'",
8511 if (ctype
== NULL_TREE
|| check
)
8516 DECL_VIRTUAL_P (decl
) = 1;
8517 if (DECL_VINDEX (decl
) == NULL_TREE
)
8518 DECL_VINDEX (decl
) = error_mark_node
;
8519 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8526 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8529 RID_BIT_TYPE
*specbits_in
;
8535 RID_BIT_TYPE specbits
;
8537 specbits
= *specbits_in
;
8539 if (TREE_CODE (type
) == OFFSET_TYPE
)
8541 /* If you declare a static member so that it
8542 can be initialized, the code will reach here. */
8543 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8544 type
= TREE_TYPE (type
);
8545 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8546 DECL_CONTEXT (decl
) = basetype
;
8547 DECL_CLASS_CONTEXT (decl
) = basetype
;
8548 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8555 context
= in_namespace
;
8556 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8557 context
= current_namespace
;
8559 context
= NULL_TREE
;
8561 if (processing_template_decl
)
8563 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8564 we can call push_template_decl. */
8565 push_permanent_obstack ();
8566 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8570 decl
= build_decl (VAR_DECL
, declarator
, type
);
8573 set_decl_namespace (decl
, context
, 0);
8575 context
= DECL_CONTEXT (decl
);
8576 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8577 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8581 set_decl_namespace (decl
, in_namespace
, 0);
8583 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8585 DECL_THIS_EXTERN (decl
) = 1;
8586 DECL_EXTERNAL (decl
) = !initialized
;
8589 /* In class context, static means one per class,
8590 public access, and static storage. */
8591 if (DECL_CLASS_SCOPE_P (decl
))
8593 TREE_PUBLIC (decl
) = 1;
8594 TREE_STATIC (decl
) = 1;
8595 DECL_EXTERNAL (decl
) = 0;
8597 /* At top level, either `static' or no s.c. makes a definition
8598 (perhaps tentative), and absence of `static' makes it public. */
8599 else if (toplevel_bindings_p ())
8601 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8602 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8603 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8605 /* Not at top level, only `static' makes a static definition. */
8608 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8609 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8612 if (TREE_PUBLIC (decl
))
8614 /* [basic.link]: A name with no linkage (notably, the name of a class
8615 or enumeration declared in a local scope) shall not be used to
8616 declare an entity with linkage.
8618 Only check this for public decls for now. */
8619 tree t
= no_linkage_check (TREE_TYPE (decl
));
8622 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8623 /* Ignore for now; `enum { foo } e' is pretty common. */;
8625 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8633 /* Create and return a canonical pointer to member function type, for
8634 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8637 build_ptrmemfunc_type (type
)
8643 tree unqualified_variant
= NULL_TREE
;
8645 /* If a canonical type already exists for this type, use it. We use
8646 this method instead of type_hash_canon, because it only does a
8647 simple equality check on the list of field members. */
8649 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8652 /* Make sure that we always have the unqualified pointer-to-member
8654 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8656 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8658 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8660 u
= make_lang_type (UNION_TYPE
);
8661 SET_IS_AGGR_TYPE (u
, 0);
8662 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8663 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8665 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8666 TYPE_NAME (u
) = NULL_TREE
;
8668 t
= make_lang_type (RECORD_TYPE
);
8670 /* Let the front-end know this is a pointer to member function... */
8671 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8672 /* ... and not really an aggregate. */
8673 SET_IS_AGGR_TYPE (t
, 0);
8675 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8677 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8679 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8680 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8684 /* Zap out the name so that the back-end will give us the debugging
8685 information for this anonymous RECORD_TYPE. */
8686 TYPE_NAME (t
) = NULL_TREE
;
8688 /* If this is not the unqualified form of this pointer-to-member
8689 type, set the TYPE_MAIN_VARIANT for this type to be the
8690 unqualified type. Since they are actually RECORD_TYPEs that are
8691 not variants of each other, we must do this manually. */
8692 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8694 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8695 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8696 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8697 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8700 /* Cache this pointer-to-member type so that we can find it again
8702 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8704 /* Seems to be wanted. */
8705 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8710 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8711 Check to see that the definition is valid. Issue appropriate error
8712 messages. Return 1 if the definition is particularly bad, or 0
8716 check_static_variable_definition (decl
, type
)
8720 /* Motion 10 at San Diego: If a static const integral data member is
8721 initialized with an integral constant expression, the initializer
8722 may appear either in the declaration (within the class), or in
8723 the definition, but not both. If it appears in the class, the
8724 member is a member constant. The file-scope definition is always
8726 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8728 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8730 /* If we just return the declaration, crashes will sometimes
8731 occur. We therefore return void_type_node, as if this was a
8732 friend declaration, to cause callers to completely ignore
8733 this declaration. */
8736 else if (!CP_TYPE_CONST_P (type
))
8737 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8739 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8740 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8745 /* Given declspecs and a declarator,
8746 determine the name and type of the object declared
8747 and construct a ..._DECL node for it.
8748 (In one case we can return a ..._TYPE node instead.
8749 For invalid input we sometimes return 0.)
8751 DECLSPECS is a chain of tree_list nodes whose value fields
8752 are the storage classes and type specifiers.
8754 DECL_CONTEXT says which syntactic context this declaration is in:
8755 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8756 FUNCDEF for a function definition. Like NORMAL but a few different
8757 error messages in each case. Return value may be zero meaning
8758 this definition is too screwy to try to parse.
8759 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8760 handle member functions (which have FIELD context).
8761 Return value may be zero meaning this definition is too screwy to
8763 PARM for a parameter declaration (either within a function prototype
8764 or before a function body). Make a PARM_DECL, or return void_type_node.
8765 CATCHPARM for a parameter declaration before a catch clause.
8766 TYPENAME if for a typename (in a cast or sizeof).
8767 Don't make a DECL node; just return the ..._TYPE node.
8768 FIELD for a struct or union field; make a FIELD_DECL.
8769 BITFIELD for a field with specified width.
8770 INITIALIZED is 1 if the decl has an initializer.
8772 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8773 normal attributes in TREE_PURPOSE, or NULL_TREE.
8775 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8776 It may also be so in the PARM case, for a prototype where the
8777 argument type is specified but not the name.
8779 This function is where the complicated C meanings of `static'
8780 and `extern' are interpreted.
8782 For C++, if there is any monkey business to do, the function which
8783 calls this one must do it, i.e., prepending instance variables,
8784 renaming overloaded function names, etc.
8786 Note that for this C++, it is an error to define a method within a class
8787 which does not belong to that class.
8789 Except in the case where SCOPE_REFs are implicitly known (such as
8790 methods within a class being redundantly qualified),
8791 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8792 (class_name::decl_name). The caller must also deal with this.
8794 If a constructor or destructor is seen, and the context is FIELD,
8795 then the type gains the attribute TREE_HAS_x. If such a declaration
8796 is erroneous, NULL_TREE is returned.
8798 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8799 function, these are the qualifiers to give to the `this' pointer.
8801 May return void_type_node if the declarator turned out to be a friend.
8802 See grokfield for details. */
8804 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8807 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8810 enum decl_context decl_context
;
8814 RID_BIT_TYPE specbits
;
8817 tree type
= NULL_TREE
;
8823 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8824 int explicit_int
= 0;
8825 int explicit_char
= 0;
8826 int defaulted_int
= 0;
8827 tree typedef_decl
= NULL_TREE
;
8829 tree typedef_type
= NULL_TREE
;
8830 int funcdef_flag
= 0;
8831 enum tree_code innermost_code
= ERROR_MARK
;
8834 /* See the code below that used this. */
8835 tree decl_machine_attr
= NULL_TREE
;
8837 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8838 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8839 tree init
= NULL_TREE
;
8841 /* Keep track of what sort of function is being processed
8842 so that we can warn about default return values, or explicit
8843 return values which do not match prescribed defaults. */
8844 enum return_types return_type
= return_normal
;
8846 tree dname
= NULL_TREE
;
8847 tree ctype
= current_class_type
;
8848 tree ctor_return_type
= NULL_TREE
;
8849 enum overload_flags flags
= NO_SPECIAL
;
8850 tree quals
= NULL_TREE
;
8851 tree raises
= NULL_TREE
;
8852 int template_count
= 0;
8853 tree in_namespace
= NULL_TREE
;
8857 RIDBIT_RESET_ALL (specbits
);
8858 if (decl_context
== FUNCDEF
)
8859 funcdef_flag
= 1, decl_context
= NORMAL
;
8860 else if (decl_context
== MEMFUNCDEF
)
8861 funcdef_flag
= -1, decl_context
= FIELD
;
8862 else if (decl_context
== BITFIELD
)
8863 bitfield
= 1, decl_context
= FIELD
;
8865 /* Look inside a declarator for the name being declared
8866 and get it as a string, for an error message. */
8868 tree
*next
= &declarator
;
8872 while (next
&& *next
)
8875 switch (TREE_CODE (decl
))
8878 /* For attributes. */
8879 next
= &TREE_VALUE (decl
);
8884 next
= &TREE_OPERAND (decl
, 0);
8887 case BIT_NOT_EXPR
: /* For C++ destructors! */
8889 tree name
= TREE_OPERAND (decl
, 0);
8890 tree rename
= NULL_TREE
;
8892 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8894 return_type
= return_dtor
;
8895 if (TREE_CODE (name
) == TYPE_DECL
)
8896 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8897 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8898 if (ctype
== NULL_TREE
)
8900 if (current_class_type
== NULL_TREE
)
8902 error ("destructors must be member functions");
8907 tree t
= constructor_name (current_class_name
);
8914 tree t
= constructor_name (ctype
);
8921 cp_error ("destructor `%T' must match class name `%T'",
8923 TREE_OPERAND (decl
, 0) = rename
;
8929 case ADDR_EXPR
: /* C++ reference declaration */
8934 innermost_code
= TREE_CODE (decl
);
8935 next
= &TREE_OPERAND (decl
, 0);
8939 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
8941 /* This is actually a variable declaration using
8942 constructor syntax. We need to call start_decl and
8943 cp_finish_decl so we can get the variable
8946 tree attributes
, prefix_attributes
;
8948 *next
= TREE_OPERAND (decl
, 0);
8949 init
= CALL_DECLARATOR_PARMS (decl
);
8953 attributes
= TREE_PURPOSE (attrlist
);
8954 prefix_attributes
= TREE_VALUE (attrlist
);
8958 attributes
= NULL_TREE
;
8959 prefix_attributes
= NULL_TREE
;
8962 decl
= start_decl (declarator
, declspecs
, 1,
8963 attributes
, prefix_attributes
);
8966 /* Look for __unused__ attribute */
8967 if (TREE_USED (TREE_TYPE (decl
)))
8968 TREE_USED (decl
) = 1;
8969 finish_decl (decl
, init
, NULL_TREE
);
8972 cp_error ("invalid declarator");
8975 innermost_code
= TREE_CODE (decl
);
8976 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8977 ctype
= current_class_type
;
8979 && TREE_OPERAND (decl
, 0)
8980 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
8981 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
8982 == constructor_name_full (ctype
))
8983 || (DECL_NAME (TREE_OPERAND (decl
, 0))
8984 == constructor_name (ctype
)))))
8985 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8986 next
= &TREE_OPERAND (decl
, 0);
8988 if (ctype
!= NULL_TREE
8989 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
8990 && decl
== constructor_name (ctype
))
8992 return_type
= return_ctor
;
8993 ctor_return_type
= ctype
;
8998 case TEMPLATE_ID_EXPR
:
9000 tree fns
= TREE_OPERAND (decl
, 0);
9002 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9003 fns
= TREE_OPERAND (fns
, 0);
9006 if (TREE_CODE (dname
) == COMPONENT_REF
)
9007 dname
= TREE_OPERAND (dname
, 1);
9008 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9010 my_friendly_assert (is_overloaded_fn (dname
),
9012 dname
= DECL_NAME (get_first_fn (dname
));
9017 case IDENTIFIER_NODE
:
9018 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9025 cp_error ("declarator-id missing; using reserved word `%D'",
9027 name
= IDENTIFIER_POINTER (dname
);
9029 if (! IDENTIFIER_OPNAME_P (dname
)
9030 /* GNU/Linux headers use '__op'. Arrgh. */
9031 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9032 name
= IDENTIFIER_POINTER (dname
);
9035 if (IDENTIFIER_TYPENAME_P (dname
))
9037 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9038 flags
= TYPENAME_FLAG
;
9039 ctor_return_type
= TREE_TYPE (dname
);
9040 return_type
= return_conversion
;
9042 name
= operator_name_string (dname
);
9049 /* Perform error checking, and decide on a ctype. */
9050 tree cname
= TREE_OPERAND (decl
, 0);
9051 if (cname
== NULL_TREE
)
9053 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9056 in_namespace
= TREE_OPERAND (decl
, 0);
9057 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9059 else if (! is_aggr_type (cname
, 1))
9060 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9061 /* Must test TREE_OPERAND (decl, 1), in case user gives
9062 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9063 else if (TREE_OPERAND (decl
, 1)
9064 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9066 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9067 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9069 cp_error ("`%T::%D' is not a valid declarator", cname
,
9070 TREE_OPERAND (decl
, 1));
9071 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9072 cname
, TREE_OPERAND (decl
, 1));
9073 return void_type_node
;
9075 else if (ctype
== NULL_TREE
)
9077 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9078 TREE_OPERAND (decl
, 0) = ctype
;
9081 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9083 cp_error ("type `%T' is not derived from type `%T'",
9085 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9091 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9092 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9093 == constructor_name_full (ctype
))
9094 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9095 == constructor_name (ctype
))))
9096 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9097 next
= &TREE_OPERAND (decl
, 1);
9101 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9102 && constructor_name (ctype
) == decl
)
9104 return_type
= return_ctor
;
9105 ctor_return_type
= ctype
;
9107 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9108 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9109 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9110 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9112 return_type
= return_dtor
;
9113 ctor_return_type
= ctype
;
9115 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9116 next
= &TREE_OPERAND (decl
, 0);
9127 /* Parse error puts this typespec where
9128 a declarator should go. */
9129 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9130 if (TREE_TYPE (decl
) == current_class_type
)
9131 cp_error (" perhaps you want `%T' for a constructor",
9132 current_class_name
);
9133 dname
= DECL_NAME (decl
);
9134 name
= IDENTIFIER_POINTER (dname
);
9136 /* Avoid giving two errors for this. */
9137 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9139 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9146 cp_compiler_error ("`%D' as declarator", decl
);
9147 return 0; /* We used to do a 155 abort here. */
9154 /* A function definition's declarator must have the form of
9155 a function declarator. */
9157 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9160 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9161 && innermost_code
!= CALL_EXPR
9162 && ! (ctype
&& declspecs
== NULL_TREE
))
9164 cp_error ("declaration of `%D' as non-function", dname
);
9165 return void_type_node
;
9168 /* Anything declared one level down from the top level
9169 must be one of the parameters of a function
9170 (because the body is at least two levels down). */
9172 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9173 by not allowing C++ class definitions to specify their parameters
9174 with xdecls (must be spec.d in the parmlist).
9176 Since we now wait to push a class scope until we are sure that
9177 we are in a legitimate method context, we must set oldcname
9178 explicitly (since current_class_name is not yet alive).
9180 We also want to avoid calling this a PARM if it is in a namespace. */
9182 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9184 struct binding_level
*b
= current_binding_level
;
9185 current_binding_level
= b
->level_chain
;
9186 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9187 decl_context
= PARM
;
9188 current_binding_level
= b
;
9191 /* Look through the decl specs and record which ones appear.
9192 Some typespecs are defined as built-in typenames.
9193 Others, the ones that are modifiers of other types,
9194 are represented by bits in SPECBITS: set the bits for
9195 the modifiers that appear. Storage class keywords are also in SPECBITS.
9197 If there is a typedef name or a type, store the type in TYPE.
9198 This includes builtin typedefs such as `int'.
9200 Set EXPLICIT_INT if the type is `int' or `char' and did not
9201 come from a user typedef.
9203 Set LONGLONG if `long' is mentioned twice.
9205 For C++, constructors and destructors have their own fast treatment. */
9207 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9212 /* Certain parse errors slip through. For example,
9213 `int class;' is not caught by the parser. Try
9214 weakly to recover here. */
9215 if (TREE_CODE (spec
) != TREE_LIST
)
9218 id
= TREE_VALUE (spec
);
9220 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9222 if (id
== ridpointers
[(int) RID_INT
]
9223 || id
== ridpointers
[(int) RID_CHAR
]
9224 || id
== ridpointers
[(int) RID_BOOL
]
9225 || id
== ridpointers
[(int) RID_WCHAR
])
9229 if (id
== ridpointers
[(int) RID_BOOL
])
9230 error ("`bool' is now a keyword");
9232 cp_error ("extraneous `%T' ignored", id
);
9236 if (id
== ridpointers
[(int) RID_INT
])
9238 else if (id
== ridpointers
[(int) RID_CHAR
])
9240 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9244 /* C++ aggregate types. */
9245 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9248 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9250 type
= IDENTIFIER_TYPE_VALUE (id
);
9254 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9256 if (ridpointers
[i
] == id
)
9258 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9260 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9261 pedwarn ("ANSI C++ does not support `long long'");
9263 error ("`long long long' is too long for GCC");
9267 else if (RIDBIT_SETP (i
, specbits
))
9268 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9269 RIDBIT_SET (i
, specbits
);
9274 /* C++ aggregate types. */
9275 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9278 cp_error ("multiple declarations `%T' and `%T'", type
,
9282 type
= TREE_TYPE (id
);
9283 TREE_VALUE (spec
) = type
;
9288 error ("two or more data types in declaration of `%s'", name
);
9289 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9291 register tree t
= lookup_name (id
, 1);
9292 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9293 error ("`%s' fails to be a typedef or built in type",
9294 IDENTIFIER_POINTER (id
));
9297 type
= TREE_TYPE (t
);
9299 /* See the code below that used this. */
9300 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9305 else if (id
!= error_mark_node
)
9306 /* Can't change CLASS nodes into RECORD nodes here! */
9312 typedef_type
= type
;
9314 /* No type at all: default to `int', and set DEFAULTED_INT
9315 because it was not a user-defined typedef. */
9317 if (type
== NULL_TREE
9318 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9319 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9320 || RIDBIT_SETP (RID_LONG
, specbits
)
9321 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9323 /* These imply 'int'. */
9324 type
= integer_type_node
;
9328 if (type
== NULL_TREE
)
9331 if (return_type
== return_dtor
)
9332 type
= void_type_node
;
9333 else if (return_type
== return_ctor
)
9334 type
= build_pointer_type (ctor_return_type
);
9335 else if (return_type
== return_conversion
)
9336 type
= ctor_return_type
;
9339 /* We handle `main' specially here, because 'main () { }' is so
9340 common. With no options, it is allowed. With -Wreturn-type,
9341 it is a warning. It is only an error with -pedantic-errors. */
9342 int is_main
= (funcdef_flag
9343 && MAIN_NAME_P (dname
)
9344 && ctype
== NULL_TREE
9345 && in_namespace
== NULL_TREE
9346 && current_namespace
== global_namespace
);
9348 if (in_system_header
|| flag_ms_extensions
)
9349 /* Allow it, sigh. */;
9350 else if (pedantic
|| ! is_main
)
9351 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9353 else if (warn_return_type
)
9354 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9357 type
= integer_type_node
;
9360 else if (return_type
== return_dtor
)
9362 error ("return type specification for destructor invalid");
9363 type
= void_type_node
;
9365 else if (return_type
== return_ctor
)
9367 error ("return type specification for constructor invalid");
9368 type
= build_pointer_type (ctor_return_type
);
9370 else if (return_type
== return_conversion
)
9372 if (!same_type_p (type
, ctor_return_type
))
9373 cp_error ("operator `%T' declared to return `%T'",
9374 ctor_return_type
, type
);
9376 cp_pedwarn ("return type specified for `operator %T'",
9379 type
= ctor_return_type
;
9384 /* Now process the modifiers that were specified
9385 and check for invalid combinations. */
9387 /* Long double is a special combination. */
9389 if (RIDBIT_SETP (RID_LONG
, specbits
)
9390 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9392 RIDBIT_RESET (RID_LONG
, specbits
);
9393 type
= build_qualified_type (long_double_type_node
,
9394 CP_TYPE_QUALS (type
));
9397 /* Check all other uses of type modifiers. */
9399 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9400 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9401 || RIDBIT_SETP (RID_LONG
, specbits
)
9402 || RIDBIT_SETP (RID_SHORT
, specbits
))
9406 if (TREE_CODE (type
) == REAL_TYPE
)
9407 error ("short, signed or unsigned invalid for `%s'", name
);
9408 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9409 error ("long, short, signed or unsigned invalid for `%s'", name
);
9410 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9411 && RIDBIT_SETP (RID_SHORT
, specbits
))
9412 error ("long and short specified together for `%s'", name
);
9413 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9414 || RIDBIT_SETP (RID_SHORT
, specbits
))
9416 error ("long or short specified with char for `%s'", name
);
9417 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9418 || RIDBIT_SETP (RID_SHORT
, specbits
))
9419 && TREE_CODE (type
) == REAL_TYPE
)
9420 error ("long or short specified with floating type for `%s'", name
);
9421 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9422 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9423 error ("signed and unsigned given together for `%s'", name
);
9427 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9429 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9431 if (flag_pedantic_errors
)
9436 /* Discard the type modifiers if they are invalid. */
9439 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9440 RIDBIT_RESET (RID_SIGNED
, specbits
);
9441 RIDBIT_RESET (RID_LONG
, specbits
);
9442 RIDBIT_RESET (RID_SHORT
, specbits
);
9447 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9448 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9450 error ("complex invalid for `%s'", name
);
9451 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9454 /* Decide whether an integer type is signed or not.
9455 Optionally treat bitfields as signed by default. */
9456 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9459 It is implementation-defined whether a plain (neither
9460 explicitly signed or unsigned) char, short, int, or long
9461 bit-field is signed or unsigned.
9463 Naturally, we extend this to long long as well. Note that
9464 this does not include wchar_t. */
9465 || (bitfield
&& !flag_signed_bitfields
9466 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9467 /* A typedef for plain `int' without `signed' can be
9468 controlled just like plain `int', but a typedef for
9469 `signed int' cannot be so controlled. */
9471 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9472 && (TREE_CODE (type
) == INTEGER_TYPE
9473 || TREE_CODE (type
) == CHAR_TYPE
)
9474 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9477 type
= long_long_unsigned_type_node
;
9478 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9479 type
= long_unsigned_type_node
;
9480 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9481 type
= short_unsigned_type_node
;
9482 else if (type
== char_type_node
)
9483 type
= unsigned_char_type_node
;
9484 else if (typedef_decl
)
9485 type
= unsigned_type (type
);
9487 type
= unsigned_type_node
;
9489 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9490 && type
== char_type_node
)
9491 type
= signed_char_type_node
;
9493 type
= long_long_integer_type_node
;
9494 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9495 type
= long_integer_type_node
;
9496 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9497 type
= short_integer_type_node
;
9499 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9501 /* If we just have "complex", it is equivalent to
9502 "complex double", but if any modifiers at all are specified it is
9503 the complex form of TYPE. E.g, "complex short" is
9504 "complex short int". */
9506 if (defaulted_int
&& ! longlong
9507 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9508 || RIDBIT_SETP (RID_SHORT
, specbits
)
9509 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9510 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9511 type
= complex_double_type_node
;
9512 else if (type
== integer_type_node
)
9513 type
= complex_integer_type_node
;
9514 else if (type
== float_type_node
)
9515 type
= complex_float_type_node
;
9516 else if (type
== double_type_node
)
9517 type
= complex_double_type_node
;
9518 else if (type
== long_double_type_node
)
9519 type
= complex_long_double_type_node
;
9521 type
= build_complex_type (type
);
9524 if (return_type
== return_conversion
9525 && (RIDBIT_SETP (RID_CONST
, specbits
)
9526 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9527 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9528 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9531 /* Set CONSTP if this declaration is `const', whether by
9532 explicit specification or via a typedef.
9533 Likewise for VOLATILEP. */
9535 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9537 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9539 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9540 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9541 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9542 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9543 type
= cp_build_qualified_type (type
, type_quals
);
9545 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9546 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9547 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9548 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9549 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9551 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9552 staticp
= 1 + (decl_context
== FIELD
);
9554 if (virtualp
&& staticp
== 2)
9556 cp_error ("member `%D' cannot be declared both virtual and static",
9560 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9561 RIDBIT_RESET (RID_FRIEND
, specbits
);
9563 /* $7.1.2, Function specifiers */
9564 if (friendp
&& explicitp
)
9565 error ("only declarations of constructors can be `explicit'");
9567 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9569 if (decl_context
== PARM
)
9571 error ("non-member `%s' cannot be declared `mutable'", name
);
9572 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9574 else if (friendp
|| decl_context
== TYPENAME
)
9576 error ("non-object member `%s' cannot be declared `mutable'", name
);
9577 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9581 /* Warn if two storage classes are given. Default to `auto'. */
9583 if (RIDBIT_ANY_SET (specbits
))
9585 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9586 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9587 if (decl_context
== PARM
&& nclasses
> 0)
9588 error ("storage class specifiers invalid in parameter declarations");
9589 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9591 if (decl_context
== PARM
)
9592 error ("typedef declaration invalid in parameter declaration");
9595 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9596 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9599 /* Give error if `virtual' is used outside of class declaration. */
9601 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9603 error ("virtual outside class declaration");
9606 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9608 error ("only members can be declared mutable");
9609 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9612 /* Static anonymous unions are dealt with here. */
9613 if (staticp
&& decl_context
== TYPENAME
9614 && TREE_CODE (declspecs
) == TREE_LIST
9615 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9616 decl_context
= FIELD
;
9618 /* Warn about storage classes that are invalid for certain
9619 kinds of declarations (parameters, typenames, etc.). */
9622 error ("multiple storage classes in declaration of `%s'", name
);
9623 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9625 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9626 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9627 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9629 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9631 else if (decl_context
== FIELD
9632 /* C++ allows static class elements */
9633 && RIDBIT_SETP (RID_STATIC
, specbits
))
9634 /* C++ also allows inlines and signed and unsigned elements,
9635 but in those cases we don't come in here. */
9639 if (decl_context
== FIELD
)
9641 tree tmp
= NULL_TREE
;
9642 register int op
= 0;
9646 /* Avoid trying to get an operand off an identifier node. */
9647 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9650 tmp
= TREE_OPERAND (declarator
, 0);
9651 op
= IDENTIFIER_OPNAME_P (tmp
);
9653 error ("storage class specified for %s `%s'",
9654 op
? "member operator" : "field",
9655 op
? operator_name_string (tmp
) : name
);
9658 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9659 ? "storage class specified for parameter `%s'"
9660 : "storage class specified for typename"), name
);
9661 RIDBIT_RESET (RID_REGISTER
, specbits
);
9662 RIDBIT_RESET (RID_AUTO
, specbits
);
9663 RIDBIT_RESET (RID_EXTERN
, specbits
);
9666 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9668 if (toplevel_bindings_p ())
9670 /* It's common practice (and completely valid) to have a const
9671 be initialized and declared extern. */
9672 if (!(type_quals
& TYPE_QUAL_CONST
))
9673 warning ("`%s' initialized and declared `extern'", name
);
9676 error ("`%s' has both `extern' and initializer", name
);
9678 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9679 && ! toplevel_bindings_p ())
9680 error ("nested function `%s' declared `extern'", name
);
9681 else if (toplevel_bindings_p ())
9683 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9684 error ("top-level declaration of `%s' specifies `auto'", name
);
9687 if (nclasses
> 0 && friendp
)
9688 error ("storage class specifiers invalid in friend function declarations");
9690 /* Now figure out the structure of the declarator proper.
9691 Descend through it, creating more complex types, until we reach
9692 the declared identifier (or NULL_TREE, in an absolute declarator). */
9694 inner_attrs
= NULL_TREE
;
9697 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9698 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9700 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9701 an INDIRECT_REF (for *...),
9702 a CALL_EXPR (for ...(...)),
9703 an identifier (for the name being declared)
9704 or a null pointer (for the place in an absolute declarator
9705 where the name was omitted).
9706 For the last two cases, we have just exited the loop.
9708 For C++ it could also be
9709 a SCOPE_REF (for class :: ...). In this case, we have converted
9710 sensible names to types, and those are the values we use to
9711 qualify the member name.
9712 an ADDR_EXPR (for &...),
9713 a BIT_NOT_EXPR (for destructors)
9715 At this point, TYPE is the type of elements of an array,
9716 or for a function to return, or for a pointer to point to.
9717 After this sequence of ifs, TYPE is the type of the
9718 array or function or pointer, and DECLARATOR has had its
9719 outermost layer removed. */
9721 if (type
== error_mark_node
)
9723 if (TREE_CODE (declarator
) == SCOPE_REF
)
9724 declarator
= TREE_OPERAND (declarator
, 1);
9726 declarator
= TREE_OPERAND (declarator
, 0);
9729 if (quals
!= NULL_TREE
9730 && (declarator
== NULL_TREE
9731 || TREE_CODE (declarator
) != SCOPE_REF
))
9733 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9734 ctype
= TYPE_METHOD_BASETYPE (type
);
9735 if (ctype
!= NULL_TREE
)
9737 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9738 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9739 type
= TREE_TYPE (dummy
);
9744 /* See the comment for the TREE_LIST case, below. */
9747 else if (inner_attrs
)
9749 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9750 inner_attrs
= NULL_TREE
;
9753 switch (TREE_CODE (declarator
))
9757 /* We encode a declarator with embedded attributes using
9758 a TREE_LIST. The attributes apply to the declarator
9759 directly inside them, so we have to skip an iteration
9760 before applying them to the type. If the declarator just
9761 inside is the declarator-id, we apply the attrs to the
9763 inner_attrs
= TREE_PURPOSE (declarator
);
9765 declarator
= TREE_VALUE (declarator
);
9771 register tree itype
= NULL_TREE
;
9772 register tree size
= TREE_OPERAND (declarator
, 1);
9773 /* The index is a signed object `sizetype' bits wide. */
9774 tree index_type
= signed_type (sizetype
);
9776 declarator
= TREE_OPERAND (declarator
, 0);
9778 /* Check for some types that there cannot be arrays of. */
9780 if (TREE_CODE (type
) == VOID_TYPE
)
9782 cp_error ("declaration of `%D' as array of voids", dname
);
9783 type
= error_mark_node
;
9786 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9788 cp_error ("declaration of `%D' as array of functions", dname
);
9789 type
= error_mark_node
;
9792 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9793 you can't have arrays of references. If we allowed them,
9794 then we'd be saying x[i] is valid for an array x, but
9795 then you'd have to ask: what does `*(x + i)' mean? */
9796 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9798 if (decl_context
== TYPENAME
)
9799 cp_error ("cannot make arrays of references");
9801 cp_error ("declaration of `%D' as array of references",
9803 type
= error_mark_node
;
9806 if (TREE_CODE (type
) == OFFSET_TYPE
)
9808 cp_error ("declaration of `%D' as array of data members",
9810 type
= error_mark_node
;
9813 if (TREE_CODE (type
) == METHOD_TYPE
)
9815 cp_error ("declaration of `%D' as array of function members",
9817 type
= error_mark_node
;
9820 if (size
== error_mark_node
)
9821 type
= error_mark_node
;
9822 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9826 the constant expressions that specify the bounds of
9827 the arrays can be omitted only for the first member
9829 cp_error ("declaration of `%D' as multidimensional array",
9831 cp_error ("must have bounds for all dimensions except the first");
9832 type
= error_mark_node
;
9835 if (type
== error_mark_node
)
9838 /* VC++ spells a zero-sized array with []. */
9839 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9840 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9841 size
= integer_zero_node
;
9845 /* Must suspend_momentary here because the index
9846 type may need to live until the end of the function.
9847 For example, it is used in the declaration of a
9848 variable which requires destructing at the end of
9849 the function; then build_vec_delete will need this
9851 int yes
= suspend_momentary ();
9852 /* Might be a cast. */
9853 if (TREE_CODE (size
) == NOP_EXPR
9854 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9855 size
= TREE_OPERAND (size
, 0);
9856 if (TREE_READONLY_DECL_P (size
))
9857 size
= decl_constant_value (size
);
9859 /* If this involves a template parameter, it will be a
9860 constant at instantiation time, but we don't know
9861 what the value is yet. Even if no template
9862 parameters are involved, we may an expression that
9863 is not a constant; we don't even simplify `1 + 2'
9864 when processing a template. */
9865 if (processing_template_decl
)
9867 /* Resolve a qualified reference to an enumerator or
9868 static const data member of ours. */
9869 if (TREE_CODE (size
) == SCOPE_REF
9870 && TREE_OPERAND (size
, 0) == current_class_type
)
9872 tree t
= lookup_field (current_class_type
,
9873 TREE_OPERAND (size
, 1), 0, 0);
9878 itype
= build_index_type (build_min
9879 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
9880 goto dont_grok_size
;
9883 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9884 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9885 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9887 cp_error ("size of array `%D' has non-integer type",
9889 size
= integer_one_node
;
9891 if (pedantic
&& integer_zerop (size
))
9892 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9893 if (TREE_CONSTANT (size
))
9895 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9896 int old_pedantic
= pedantic
;
9897 pedantic
= flag_pedantic_errors
= 1;
9898 /* Always give overflow errors on array subscripts. */
9899 constant_expression_warning (size
);
9900 pedantic
= old_pedantic
;
9901 flag_pedantic_errors
= old_flag_pedantic_errors
;
9902 if (INT_CST_LT (size
, integer_zero_node
))
9904 cp_error ("size of array `%D' is negative", dname
);
9905 size
= integer_one_node
;
9913 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9916 cp_pedwarn ("ANSI C++ forbids variable-size array");
9921 = fold (build_binary_op (MINUS_EXPR
,
9922 cp_convert (index_type
, size
),
9923 cp_convert (index_type
,
9924 integer_one_node
)));
9925 if (! TREE_CONSTANT (itype
))
9926 itype
= variable_size (itype
);
9927 else if (TREE_OVERFLOW (itype
))
9929 error ("overflow in array dimension");
9930 TREE_OVERFLOW (itype
) = 0;
9933 /* If we're a parm, we need to have a permanent type so
9934 mangling checks for re-use will work right. If both the
9935 element and index types are permanent, the array type
9937 if (decl_context
== PARM
9938 && allocation_temporary_p () && TREE_PERMANENT (type
))
9940 push_obstacks (&permanent_obstack
, &permanent_obstack
);
9941 itype
= build_index_type (itype
);
9945 itype
= build_index_type (itype
);
9948 resume_momentary (yes
);
9951 type
= build_cplus_array_type (type
, itype
);
9960 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9961 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9963 /* Declaring a function type.
9964 Make sure we have a valid type for the function to return. */
9966 /* We now know that the TYPE_QUALS don't apply to the
9967 decl, but to its return type. */
9968 type_quals
= TYPE_UNQUALIFIED
;
9970 /* Warn about some types functions can't return. */
9972 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9974 error ("`%s' declared as function returning a function", name
);
9975 type
= integer_type_node
;
9977 if (TREE_CODE (type
) == ARRAY_TYPE
)
9979 error ("`%s' declared as function returning an array", name
);
9980 type
= integer_type_node
;
9983 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9984 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9986 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9989 /* Pick up type qualifiers which should be applied to `this'. */
9990 quals
= CALL_DECLARATOR_QUALS (declarator
);
9992 /* Pick up the exception specifications. */
9993 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
9995 /* Say it's a definition only for the CALL_EXPR
9996 closest to the identifier. */
9999 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10000 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10001 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10003 if (ctype
== NULL_TREE
10004 && decl_context
== FIELD
10006 && (friendp
== 0 || dname
== current_class_name
))
10007 ctype
= current_class_type
;
10009 if (ctype
&& return_type
== return_conversion
)
10010 TYPE_HAS_CONVERSION (ctype
) = 1;
10011 if (ctype
&& constructor_name (ctype
) == dname
)
10013 /* We are within a class's scope. If our declarator name
10014 is the same as the class name, and we are defining
10015 a function, then it is a constructor/destructor, and
10016 therefore returns a void type. */
10018 if (flags
== DTOR_FLAG
)
10020 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10021 not be declared const or volatile. A destructor
10022 may not be static. */
10024 error ("destructor cannot be static member function");
10027 cp_error ("destructors may not be `%s'",
10028 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10031 if (decl_context
== FIELD
)
10033 if (! member_function_or_else (ctype
, current_class_type
,
10034 "destructor for alien class `%s' cannot be a member"))
10035 return void_type_node
;
10038 else /* It's a constructor. */
10040 if (explicitp
== 1)
10042 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10043 not be declared const or volatile. A constructor may
10044 not be virtual. A constructor may not be static. */
10046 error ("constructor cannot be static member function");
10049 pedwarn ("constructors cannot be declared virtual");
10054 cp_error ("constructors may not be `%s'",
10055 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10059 RID_BIT_TYPE tmp_bits
;
10060 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10061 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10062 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10063 if (RIDBIT_ANY_SET (tmp_bits
))
10064 error ("return value type specifier for constructor ignored");
10066 type
= build_pointer_type (ctype
);
10067 if (decl_context
== FIELD
)
10069 if (! member_function_or_else (ctype
, current_class_type
,
10070 "constructor for alien class `%s' cannot be member"))
10071 return void_type_node
;
10072 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10073 if (return_type
!= return_ctor
)
10077 if (decl_context
== FIELD
)
10083 error ("can't initialize friend function `%s'", name
);
10086 /* Cannot be both friend and virtual. */
10087 error ("virtual functions cannot be friends");
10088 RIDBIT_RESET (RID_FRIEND
, specbits
);
10091 if (decl_context
== NORMAL
)
10092 error ("friend declaration not in class definition");
10093 if (current_function_decl
&& funcdef_flag
)
10094 cp_error ("can't define friend function `%s' in a local class definition",
10098 /* Construct the function type and go to the next
10099 inner layer of declarator. */
10101 declarator
= TREE_OPERAND (declarator
, 0);
10103 /* FIXME: This is where default args should be fully
10106 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10108 if (declarator
&& flags
== DTOR_FLAG
)
10110 /* A destructor declared in the body of a class will
10111 be represented as a BIT_NOT_EXPR. But, we just
10112 want the underlying IDENTIFIER. */
10113 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10114 declarator
= TREE_OPERAND (declarator
, 0);
10116 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10117 arg_types
= void_list_node
;
10118 else if (arg_types
== NULL_TREE
10119 || arg_types
!= void_list_node
)
10121 cp_error ("destructors may not have parameters");
10122 arg_types
= void_list_node
;
10123 last_function_parms
= NULL_TREE
;
10127 /* ANSI says that `const int foo ();'
10128 does not make the function foo const. */
10129 type
= build_function_type (type
, arg_types
);
10133 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10134 if (TREE_PURPOSE (t
)
10135 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10137 add_defarg_fn (type
);
10146 /* Filter out pointers-to-references and references-to-references.
10147 We can get these if a TYPE_DECL is used. */
10149 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10151 error ("cannot declare %s to references",
10152 TREE_CODE (declarator
) == ADDR_EXPR
10153 ? "references" : "pointers");
10154 declarator
= TREE_OPERAND (declarator
, 0);
10158 if (TREE_CODE (type
) == OFFSET_TYPE
10159 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10160 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10162 cp_error ("cannot declare pointer to `%#T' member",
10164 type
= TREE_TYPE (type
);
10167 /* Merge any constancy or volatility into the target type
10168 for the pointer. */
10170 /* We now know that the TYPE_QUALS don't apply to the decl,
10171 but to the target of the pointer. */
10172 type_quals
= TYPE_UNQUALIFIED
;
10174 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10176 if (TREE_CODE (type
) == VOID_TYPE
)
10177 error ("invalid type: `void &'");
10179 type
= build_reference_type (type
);
10181 else if (TREE_CODE (type
) == METHOD_TYPE
)
10182 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10184 type
= build_pointer_type (type
);
10186 /* Process a list of type modifier keywords (such as
10187 const or volatile) that were given inside the `*' or `&'. */
10189 if (TREE_TYPE (declarator
))
10191 register tree typemodlist
;
10197 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10198 typemodlist
= TREE_CHAIN (typemodlist
))
10200 tree qualifier
= TREE_VALUE (typemodlist
);
10202 if (qualifier
== ridpointers
[(int) RID_CONST
])
10204 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10206 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10211 error ("invalid type modifier within pointer declarator");
10215 pedwarn ("duplicate `const'");
10217 pedwarn ("duplicate `volatile'");
10219 pedwarn ("duplicate `restrict'");
10221 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10222 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10223 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10224 if (TREE_CODE (declarator
) == ADDR_EXPR
10225 && (constp
|| volatilep
))
10228 pedwarn ("discarding `const' applied to a reference");
10230 pedwarn ("discarding `volatile' applied to a reference");
10231 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10233 type
= cp_build_qualified_type (type
, type_quals
);
10235 declarator
= TREE_OPERAND (declarator
, 0);
10241 /* We have converted type names to NULL_TREE if the
10242 name was bogus, or to a _TYPE node, if not.
10244 The variable CTYPE holds the type we will ultimately
10245 resolve to. The code here just needs to build
10246 up appropriate member types. */
10247 tree sname
= TREE_OPERAND (declarator
, 1);
10250 /* Destructors can have their visibilities changed as well. */
10251 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10252 sname
= TREE_OPERAND (sname
, 0);
10254 if (TREE_COMPLEXITY (declarator
) == 0)
10255 /* This needs to be here, in case we are called
10256 multiple times. */ ;
10257 else if (TREE_COMPLEXITY (declarator
) == -1)
10258 /* Namespace member. */
10259 pop_decl_namespace ();
10260 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10261 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10262 else if (! IS_AGGR_TYPE_CODE
10263 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10265 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10267 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10268 that refer to ctype. They couldn't be resolved earlier
10269 because we hadn't pushed into the class yet.
10270 Example: resolve 'B<T>::type' in
10271 'B<typename B<T>::type> B<T>::f () { }'. */
10272 if (current_template_parms
10273 && uses_template_parms (type
)
10274 && uses_template_parms (current_class_type
))
10276 tree args
= current_template_args ();
10277 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10280 /* This pop_nested_class corresponds to the
10281 push_nested_class used to push into class scope for
10282 parsing the argument list of a function decl, in
10284 pop_nested_class ();
10285 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10288 my_friendly_abort (16);
10290 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10292 /* We had a reference to a global decl, or
10293 perhaps we were given a non-aggregate typedef,
10294 in which case we cleared this out, and should just
10295 keep going as though it wasn't there. */
10296 declarator
= sname
;
10299 ctype
= TREE_OPERAND (declarator
, 0);
10302 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10304 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10305 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10306 template_count
+= 1;
10307 t
= TYPE_MAIN_DECL (t
);
10308 if (DECL_LANG_SPECIFIC (t
))
10309 t
= DECL_CLASS_CONTEXT (t
);
10314 if (sname
== NULL_TREE
)
10317 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10319 /* This is the `standard' use of the scoping operator:
10320 basetype :: member . */
10322 if (ctype
== current_class_type
)
10328 Is this ill-formed? */
10331 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10334 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10336 if (current_class_type
== NULL_TREE
10338 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10339 TYPE_ARG_TYPES (type
));
10342 cp_error ("cannot declare member function `%T::%s' within `%T'",
10343 ctype
, name
, current_class_type
);
10344 return void_type_node
;
10347 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10348 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10350 /* Have to move this code elsewhere in this function.
10351 this code is used for i.e., typedef int A::M; M *pm;
10353 It is? How? jason 10/2/94 */
10355 if (current_class_type
)
10357 cp_error ("cannot declare member `%T::%s' within `%T'",
10358 ctype
, name
, current_class_type
);
10359 return void_type_node
;
10361 type
= build_offset_type (ctype
, type
);
10363 else if (uses_template_parms (ctype
))
10365 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10367 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10368 TYPE_ARG_TYPES (type
));
10372 cp_error ("structure `%T' not yet defined", ctype
);
10373 return error_mark_node
;
10376 declarator
= sname
;
10378 else if (TREE_CODE (sname
) == SCOPE_REF
)
10379 my_friendly_abort (17);
10383 declarator
= TREE_OPERAND (declarator
, 1);
10384 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10385 /* In this case, we will deal with it later. */
10389 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10390 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10391 TYPE_ARG_TYPES (type
));
10393 type
= build_offset_type (ctype
, type
);
10400 declarator
= TREE_OPERAND (declarator
, 0);
10405 case ENUMERAL_TYPE
:
10406 declarator
= NULL_TREE
;
10410 declarator
= NULL_TREE
;
10414 my_friendly_abort (158);
10418 /* See the comment for the TREE_LIST case, above. */
10421 if (! ignore_attrs
)
10422 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10424 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10426 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10429 /* Now TYPE has the actual type. */
10431 if (explicitp
== 1)
10433 error ("only constructors can be declared `explicit'");
10437 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10439 if (type_quals
& TYPE_QUAL_CONST
)
10441 error ("const `%s' cannot be declared `mutable'", name
);
10442 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10446 error ("static `%s' cannot be declared `mutable'", name
);
10447 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10451 if (declarator
== NULL_TREE
10452 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10453 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10454 && (TREE_CODE (type
) == FUNCTION_TYPE
10455 || TREE_CODE (type
) == METHOD_TYPE
)))
10457 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10459 cp_error ("template-id `%D' used as a declarator", declarator
);
10460 declarator
= dname
;
10463 /* Unexpected declarator format. */
10464 my_friendly_abort (990210);
10466 /* If this is declaring a typedef name, return a TYPE_DECL. */
10468 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10472 /* Note that the grammar rejects storage classes
10473 in typenames, fields or parameters. */
10474 if (current_lang_name
== lang_name_java
)
10475 TYPE_FOR_JAVA (type
) = 1;
10477 if (decl_context
== FIELD
)
10479 if (declarator
== constructor_name (current_class_type
))
10480 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10482 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10486 /* Make sure this typedef lives as long as its type,
10487 since it might be used as a template parameter. */
10488 if (type
!= error_mark_node
)
10489 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10490 if (processing_template_decl
)
10491 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10493 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10494 if (type
!= error_mark_node
)
10498 /* If the user declares "typedef struct {...} foo" then the
10499 struct will have an anonymous name. Fill that name in now.
10500 Nothing can refer to it, so nothing needs know about the name
10502 if (type
!= error_mark_node
10503 && TYPE_NAME (type
)
10504 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10505 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10506 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10508 tree oldname
= TYPE_NAME (type
);
10511 /* Replace the anonymous name with the real name everywhere. */
10512 lookup_tag_reverse (type
, declarator
);
10513 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10514 if (TYPE_NAME (t
) == oldname
)
10515 TYPE_NAME (t
) = decl
;
10517 if (TYPE_LANG_SPECIFIC (type
))
10518 TYPE_WAS_ANONYMOUS (type
) = 1;
10520 /* If this is a typedef within a template class, the nested
10521 type is a (non-primary) template. The name for the
10522 template needs updating as well. */
10523 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10524 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10525 = TYPE_IDENTIFIER (type
);
10527 /* XXX Temporarily set the scope.
10528 When returning, start_decl expects it as NULL_TREE,
10529 and will then then set it using pushdecl. */
10530 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10531 if (current_class_type
)
10532 DECL_CONTEXT (decl
) = current_class_type
;
10534 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10536 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10537 DECL_ASSEMBLER_NAME (decl
)
10538 = get_identifier (build_overload_name (type
, 1, 1));
10539 DECL_CONTEXT (decl
) = NULL_TREE
;
10541 /* FIXME remangle member functions; member functions of a
10542 type with external linkage have external linkage. */
10545 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10547 cp_error_at ("typedef name may not be class-qualified", decl
);
10552 if (ctype
== NULL_TREE
)
10554 if (TREE_CODE (type
) != METHOD_TYPE
)
10555 cp_error_at ("invalid type qualifier for non-method type", decl
);
10557 ctype
= TYPE_METHOD_BASETYPE (type
);
10559 if (ctype
!= NULL_TREE
)
10560 grok_method_quals (ctype
, decl
, quals
);
10563 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10564 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10565 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10567 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10568 error ("non-object member `%s' cannot be declared mutable", name
);
10570 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10571 inlinep
, friendp
, raises
!= NULL_TREE
);
10574 error ("typedef declaration includes an initializer");
10579 /* Detect the case of an array type of unspecified size
10580 which came, as such, direct from a typedef name.
10581 We must copy the type, so that each identifier gets
10582 a distinct type, so that each identifier's size can be
10583 controlled separately by its own initializer. */
10585 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10586 && TYPE_DOMAIN (type
) == NULL_TREE
)
10588 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10591 /* If this is a type name (such as, in a cast or sizeof),
10592 compute the type and return it now. */
10594 if (decl_context
== TYPENAME
)
10596 /* Note that the grammar rejects storage classes
10597 in typenames, fields or parameters. */
10598 if (type_quals
!= TYPE_UNQUALIFIED
)
10599 type_quals
= TYPE_UNQUALIFIED
;
10601 /* Special case: "friend class foo" looks like a TYPENAME context. */
10604 if (type_quals
!= TYPE_UNQUALIFIED
)
10606 cp_error ("type qualifiers specified for friend class declaration");
10607 type_quals
= TYPE_UNQUALIFIED
;
10611 cp_error ("`inline' specified for friend class declaration");
10615 /* Only try to do this stuff if we didn't already give up. */
10616 if (type
!= integer_type_node
)
10618 /* A friendly class? */
10619 if (current_class_type
)
10620 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10622 error ("trying to make class `%s' a friend of global scope",
10623 TYPE_NAME_STRING (type
));
10624 type
= void_type_node
;
10629 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10630 if (ctype
== NULL_TREE
)
10632 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10633 ctype
= TYPE_METHOD_BASETYPE (type
);
10635 grok_method_quals (ctype
, dummy
, quals
);
10636 type
= TREE_TYPE (dummy
);
10641 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10642 && decl_context
!= CATCHPARM
10643 && TREE_CODE (type
) != UNION_TYPE
10646 cp_error ("abstract declarator `%T' used as declaration", type
);
10647 declarator
= make_anon_name ();
10650 /* `void' at top level (not within pointer)
10651 is allowed only in typedefs or type names.
10652 We don't complain about parms either, but that is because
10653 a better error message can be made later. */
10655 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10658 error ("unnamed variable or field declared void");
10659 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10661 if (IDENTIFIER_OPNAME_P (declarator
))
10662 my_friendly_abort (356);
10664 error ("variable or field `%s' declared void", name
);
10667 error ("variable or field declared void");
10668 type
= integer_type_node
;
10671 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10672 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10674 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10676 if (ctype
|| in_namespace
)
10677 error ("cannot use `::' in parameter declaration");
10679 /* A parameter declared as an array of T is really a pointer to T.
10680 One declared as a function is really a pointer to a function.
10681 One declared as a member is really a pointer to member. */
10683 if (TREE_CODE (type
) == ARRAY_TYPE
)
10685 /* Transfer const-ness of array into that of type pointed to. */
10686 type
= build_pointer_type (TREE_TYPE (type
));
10687 type_quals
= TYPE_UNQUALIFIED
;
10689 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10690 type
= build_pointer_type (type
);
10691 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10692 type
= build_pointer_type (type
);
10693 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10695 error ("declaration of `%s' as void", name
);
10701 register tree decl
;
10703 if (decl_context
== PARM
)
10705 decl
= build_decl (PARM_DECL
, declarator
, type
);
10707 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10708 inlinep
, friendp
, raises
!= NULL_TREE
);
10710 /* Compute the type actually passed in the parmlist,
10711 for the case where there is no prototype.
10712 (For example, shorts and chars are passed as ints.)
10713 When there is a prototype, this is overridden later. */
10715 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10717 else if (decl_context
== FIELD
)
10719 if (type
== error_mark_node
)
10721 /* Happens when declaring arrays of sizes which
10722 are error_mark_node, for example. */
10725 else if (in_namespace
&& !friendp
)
10727 /* Something like struct S { int N::j; }; */
10728 cp_error ("invalid use of `::'");
10731 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10734 tree function_context
;
10736 /* We catch the others as conflicts with the builtin
10738 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10740 cp_error ("function `%D' cannot be declared friend",
10747 if (ctype
== NULL_TREE
)
10748 ctype
= current_class_type
;
10750 if (ctype
== NULL_TREE
)
10752 cp_error ("can't make `%D' into a method -- not in a class",
10754 return void_type_node
;
10757 /* ``A union may [ ... ] not [ have ] virtual functions.''
10759 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10761 cp_error ("function `%D' declared virtual inside a union",
10763 return void_type_node
;
10766 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10767 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10768 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10769 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10773 cp_error ("`%D' cannot be declared virtual, since it is always static",
10778 else if (staticp
< 2)
10779 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10780 TYPE_ARG_TYPES (type
));
10783 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10784 function_context
= (ctype
!= NULL_TREE
) ?
10785 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10786 publicp
= (! friendp
|| ! staticp
)
10787 && function_context
== NULL_TREE
;
10788 decl
= grokfndecl (ctype
, type
,
10789 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10790 ? declarator
: dname
,
10792 virtualp
, flags
, quals
, raises
,
10793 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10794 funcdef_flag
, template_count
, in_namespace
);
10795 if (decl
== NULL_TREE
)
10798 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10799 /* The decl and setting of decl_machine_attr is also turned off. */
10800 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10803 /* [class.conv.ctor]
10805 A constructor declared without the function-specifier
10806 explicit that can be called with a single parameter
10807 specifies a conversion from the type of its first
10808 parameter to the type of its class. Such a constructor
10809 is called a converting constructor. */
10810 if (explicitp
== 2)
10811 DECL_NONCONVERTING_P (decl
) = 1;
10812 else if (DECL_CONSTRUCTOR_P (decl
))
10814 /* The constructor can be called with exactly one
10815 parameter if there is at least one parameter, and
10816 any subsequent parameters have default arguments.
10817 We don't look at the first parameter, which is
10818 really just the `this' parameter for the new
10821 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10823 /* Skip the `in_chrg' argument too, if present. */
10824 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10825 arg_types
= TREE_CHAIN (arg_types
);
10827 if (arg_types
== void_list_node
10829 && TREE_CHAIN (arg_types
)
10830 && TREE_CHAIN (arg_types
) != void_list_node
10831 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10832 DECL_NONCONVERTING_P (decl
) = 1;
10835 else if (TREE_CODE (type
) == METHOD_TYPE
)
10837 /* We only get here for friend declarations of
10838 members of other classes. */
10839 /* All method decls are public, so tell grokfndecl to set
10840 TREE_PUBLIC, also. */
10841 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10842 virtualp
, flags
, quals
, raises
,
10843 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10844 template_count
, in_namespace
);
10845 if (decl
== NULL_TREE
)
10848 else if (!staticp
&& ! processing_template_decl
10849 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10850 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10853 cp_error ("field `%D' has incomplete type", declarator
);
10855 cp_error ("name `%T' has incomplete type", type
);
10857 /* If we're instantiating a template, tell them which
10858 instantiation made the field's type be incomplete. */
10859 if (current_class_type
10860 && TYPE_NAME (current_class_type
)
10861 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10862 && declspecs
&& TREE_VALUE (declspecs
)
10863 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10864 cp_error (" in instantiation of template `%T'",
10865 current_class_type
);
10867 type
= error_mark_node
;
10874 error ("`%s' is neither function nor method; cannot be declared friend",
10875 IDENTIFIER_POINTER (declarator
));
10883 /* Friends are treated specially. */
10884 if (ctype
== current_class_type
)
10885 warning ("member functions are implicitly friends of their class");
10888 tree t
= NULL_TREE
;
10889 if (decl
&& DECL_NAME (decl
))
10891 if (template_class_depth (current_class_type
) == 0)
10894 = check_explicit_specialization
10896 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10897 if (decl
== error_mark_node
)
10898 return error_mark_node
;
10901 t
= do_friend (ctype
, declarator
, decl
,
10902 last_function_parms
, attrlist
, flags
, quals
,
10905 if (t
&& funcdef_flag
)
10908 return void_type_node
;
10912 /* Structure field. It may not be a function, except for C++ */
10914 if (decl
== NULL_TREE
)
10920 /* An attempt is being made to initialize a non-static
10921 member. But, from [class.mem]:
10923 4 A member-declarator can contain a
10924 constant-initializer only if it declares a static
10925 member (_class.static_) of integral or enumeration
10926 type, see _class.static.data_.
10928 This used to be relatively common practice, but
10929 the rest of the compiler does not correctly
10930 handle the initialization unless the member is
10931 static so we make it static below. */
10932 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10934 cp_pedwarn ("making `%D' static", declarator
);
10938 if (uses_template_parms (type
))
10939 /* We'll check at instantiation time. */
10941 else if (check_static_variable_definition (declarator
,
10943 /* If we just return the declaration, crashes
10944 will sometimes occur. We therefore return
10945 void_type_node, as if this was a friend
10946 declaration, to cause callers to completely
10947 ignore this declaration. */
10948 return void_type_node
;
10951 /* 9.2p13 [class.mem] */
10952 if (declarator
== constructor_name (current_class_type
)
10953 /* Divergence from the standard: In extern "C", we
10954 allow non-static data members here, because C does
10955 and /usr/include/netinet/in.h uses that. */
10956 && (staticp
|| ! in_system_header
))
10957 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10962 /* C++ allows static class members. All other work
10963 for this is done by grokfield. */
10964 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10965 TREE_STATIC (decl
) = 1;
10966 /* In class context, 'static' means public access. */
10967 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10971 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10972 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10974 DECL_MUTABLE_P (decl
) = 1;
10975 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10979 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10980 inlinep
, friendp
, raises
!= NULL_TREE
);
10983 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10985 tree original_name
;
10991 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10992 original_name
= dname
;
10994 original_name
= declarator
;
10996 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10997 error ("storage class `auto' invalid for function `%s'", name
);
10998 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10999 error ("storage class `register' invalid for function `%s'", name
);
11001 /* Function declaration not at top level.
11002 Storage classes other than `extern' are not allowed
11003 and `extern' makes no difference. */
11004 if (! toplevel_bindings_p ()
11005 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11006 || RIDBIT_SETP (RID_INLINE
, specbits
))
11009 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11010 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11012 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11015 if (ctype
== NULL_TREE
)
11019 error ("virtual non-class function `%s'", name
);
11023 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11024 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11025 TYPE_ARG_TYPES (type
));
11027 /* Record presence of `static'. */
11028 publicp
= (ctype
!= NULL_TREE
11029 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11030 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11032 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11033 virtualp
, flags
, quals
, raises
,
11035 publicp
, inlinep
, funcdef_flag
,
11036 template_count
, in_namespace
);
11037 if (decl
== NULL_TREE
)
11042 int illegal_static
= 0;
11044 /* Don't allow a static member function in a class, and forbid
11045 declaring main to be static. */
11046 if (TREE_CODE (type
) == METHOD_TYPE
)
11048 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11049 illegal_static
= 1;
11051 else if (current_function_decl
)
11053 /* FIXME need arm citation */
11054 error ("cannot declare static function inside another function");
11055 illegal_static
= 1;
11058 if (illegal_static
)
11061 RIDBIT_RESET (RID_STATIC
, specbits
);
11067 /* It's a variable. */
11069 /* An uninitialized decl with `extern' is a reference. */
11070 decl
= grokvardecl (type
, declarator
, &specbits
,
11072 (type_quals
& TYPE_QUAL_CONST
) != 0,
11074 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11075 inlinep
, friendp
, raises
!= NULL_TREE
);
11079 DECL_CONTEXT (decl
) = ctype
;
11082 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11084 RIDBIT_RESET (RID_STATIC
, specbits
);
11086 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11088 cp_error ("static member `%D' declared `register'", decl
);
11089 RIDBIT_RESET (RID_REGISTER
, specbits
);
11091 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11093 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11095 RIDBIT_RESET (RID_EXTERN
, specbits
);
11100 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11102 error ("`%s' cannot be declared mutable", name
);
11105 /* Record `register' declaration for warnings on &
11106 and in case doing stupid register allocation. */
11108 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11109 DECL_REGISTER (decl
) = 1;
11111 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11112 DECL_THIS_EXTERN (decl
) = 1;
11114 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11115 DECL_THIS_STATIC (decl
) = 1;
11117 /* Record constancy and volatility. There's no need to do this
11118 when processing a template; we'll do this for the instantiated
11119 declaration based on the type of DECL. */
11120 if (!processing_template_decl
)
11121 c_apply_type_quals_to_decl (type_quals
, decl
);
11127 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11128 An empty exprlist is a parmlist. An exprlist which
11129 contains only identifiers at the global level
11130 is a parmlist. Otherwise, it is an exprlist. */
11133 parmlist_is_exprlist (exprs
)
11136 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11139 if (toplevel_bindings_p ())
11141 /* At the global level, if these are all identifiers,
11142 then it is a parmlist. */
11145 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11147 exprs
= TREE_CHAIN (exprs
);
11154 /* Subroutine of start_function. Ensure that each of the parameter
11155 types (as listed in PARMS) is complete, as is required for a
11156 function definition. */
11159 require_complete_types_for_parms (parms
)
11164 tree type
= TREE_TYPE (parms
);
11165 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11167 if (DECL_NAME (parms
))
11168 error ("parameter `%s' has incomplete type",
11169 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11171 error ("parameter has incomplete type");
11172 TREE_TYPE (parms
) = error_mark_node
;
11175 layout_decl (parms
, 0);
11177 parms
= TREE_CHAIN (parms
);
11181 /* Returns DECL if DECL is a local variable (or parameter). Returns
11182 NULL_TREE otherwise. */
11185 local_variable_p (t
)
11188 if ((TREE_CODE (t
) == VAR_DECL
11189 /* A VAR_DECL with a context that is a _TYPE is a static data
11191 && !TYPE_P (CP_DECL_CONTEXT (t
))
11192 /* Any other non-local variable must be at namespace scope. */
11193 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11194 || (TREE_CODE (t
) == PARM_DECL
))
11200 /* Check that ARG, which is a default-argument expression for a
11201 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11202 something goes wrong. DECL may also be a _TYPE node, rather than a
11203 DECL, if there is no DECL available. */
11206 check_default_argument (decl
, arg
)
11213 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11214 /* We get a DEFAULT_ARG when looking at an in-class declaration
11215 with a default argument. Ignore the argument for now; we'll
11216 deal with it after the class is complete. */
11219 if (processing_template_decl
|| uses_template_parms (arg
))
11220 /* We don't do anything checking until instantiation-time. Note
11221 that there may be uninstantiated arguments even for an
11222 instantiated function, since default arguments are not
11223 instantiated until they are needed. */
11232 decl_type
= TREE_TYPE (decl
);
11234 if (arg
== error_mark_node
11235 || decl
== error_mark_node
11236 || TREE_TYPE (arg
) == error_mark_node
11237 || decl_type
== error_mark_node
)
11238 /* Something already went wrong. There's no need to check
11240 return error_mark_node
;
11242 /* [dcl.fct.default]
11244 A default argument expression is implicitly converted to the
11246 if (!TREE_TYPE (arg
)
11247 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11250 cp_error ("default argument for `%#D' has type `%T'",
11251 decl
, TREE_TYPE (arg
));
11253 cp_error ("default argument for parameter of type `%T' has type `%T'",
11254 decl_type
, TREE_TYPE (arg
));
11256 return error_mark_node
;
11259 /* [dcl.fct.default]
11261 Local variables shall not be used in default argument
11264 The keyword `this' shall not be used in a default argument of a
11265 member function. */
11266 var
= search_tree (arg
, local_variable_p
);
11269 cp_error ("default argument `%E' uses local variable `%D'",
11271 return error_mark_node
;
11278 /* Decode the list of parameter types for a function type.
11279 Given the list of things declared inside the parens,
11280 return a list of types.
11282 The list we receive can have three kinds of elements:
11283 an IDENTIFIER_NODE for names given without types,
11284 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11285 or void_type_node, to mark the end of an argument list
11286 when additional arguments are not permitted (... was not used).
11288 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11289 a mere declaration. A nonempty identifier-list gets an error message
11290 when FUNCDEF_FLAG is zero.
11291 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11292 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11294 If all elements of the input list contain types,
11295 we return a list of the types.
11296 If all elements contain no type (except perhaps a void_type_node
11297 at the end), we return a null list.
11298 If some have types and some do not, it is an error, and we
11299 return a null list.
11301 Also set last_function_parms to either
11302 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11303 A list of names is converted to a chain of PARM_DECLs
11304 by store_parm_decls so that ultimately it is always a chain of decls.
11306 Note that in C++, parameters can take default values. These default
11307 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11308 an error to specify default values which are followed by parameters
11309 that have no default values, or an ELLIPSES. For simplicities sake,
11310 only parameters which are specified with their types can take on
11314 grokparms (first_parm
, funcdef_flag
)
11318 tree result
= NULL_TREE
;
11319 tree decls
= NULL_TREE
;
11321 if (first_parm
!= NULL_TREE
11322 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11324 if (! funcdef_flag
)
11325 pedwarn ("parameter names (without types) in function declaration");
11326 last_function_parms
= first_parm
;
11329 else if (first_parm
!= NULL_TREE
11330 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11331 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11332 my_friendly_abort (145);
11335 /* Types were specified. This is a list of declarators
11336 each represented as a TREE_LIST node. */
11337 register tree parm
, chain
;
11338 int any_init
= 0, any_error
= 0;
11340 if (first_parm
!= NULL_TREE
)
11342 tree last_result
= NULL_TREE
;
11343 tree last_decl
= NULL_TREE
;
11345 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11347 tree type
= NULL_TREE
, list_node
= parm
;
11348 register tree decl
= TREE_VALUE (parm
);
11349 tree init
= TREE_PURPOSE (parm
);
11351 chain
= TREE_CHAIN (parm
);
11352 /* @@ weak defense against parse errors. */
11353 if (TREE_CODE (decl
) != VOID_TYPE
11354 && TREE_CODE (decl
) != TREE_LIST
)
11356 /* Give various messages as the need arises. */
11357 if (TREE_CODE (decl
) == STRING_CST
)
11358 cp_error ("invalid string constant `%E'", decl
);
11359 else if (TREE_CODE (decl
) == INTEGER_CST
)
11360 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11364 if (TREE_CODE (decl
) != VOID_TYPE
)
11366 decl
= grokdeclarator (TREE_VALUE (decl
),
11367 TREE_PURPOSE (decl
),
11368 PARM
, init
!= NULL_TREE
,
11370 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11373 /* Top-level qualifiers on the parameters are
11374 ignored for function types. */
11375 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11377 if (TREE_CODE (type
) == VOID_TYPE
)
11378 decl
= void_type_node
;
11379 else if (TREE_CODE (type
) == METHOD_TYPE
)
11381 if (DECL_NAME (decl
))
11382 /* Cannot use the decl here because
11383 we don't have DECL_CONTEXT set up yet. */
11384 cp_error ("parameter `%D' invalidly declared method type",
11387 error ("parameter invalidly declared method type");
11388 type
= build_pointer_type (type
);
11389 TREE_TYPE (decl
) = type
;
11391 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11393 if (DECL_NAME (decl
))
11394 cp_error ("parameter `%D' invalidly declared offset type",
11397 error ("parameter invalidly declared offset type");
11398 type
= build_pointer_type (type
);
11399 TREE_TYPE (decl
) = type
;
11401 else if (abstract_virtuals_error (decl
, type
))
11402 any_error
= 1; /* Seems like a good idea. */
11403 else if (POINTER_TYPE_P (type
))
11406 while (POINTER_TYPE_P (t
)
11407 || (TREE_CODE (t
) == ARRAY_TYPE
11408 && TYPE_DOMAIN (t
) != NULL_TREE
))
11410 if (TREE_CODE (t
) == ARRAY_TYPE
)
11411 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11413 TYPE_PTR_P (type
) ? "pointer" : "reference");
11417 if (TREE_CODE (decl
) == VOID_TYPE
)
11419 if (result
== NULL_TREE
)
11421 result
= void_list_node
;
11422 last_result
= result
;
11426 TREE_CHAIN (last_result
) = void_list_node
;
11427 last_result
= void_list_node
;
11430 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11431 error ("`void' in parameter list must be entire list");
11435 /* Since there is a prototype, args are passed in their own types. */
11436 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11437 if (PROMOTE_PROTOTYPES
11438 && (TREE_CODE (type
) == INTEGER_TYPE
11439 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11440 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11441 DECL_ARG_TYPE (decl
) = integer_type_node
;
11442 if (!any_error
&& init
)
11445 init
= check_default_argument (decl
, init
);
11450 if (decls
== NULL_TREE
)
11457 TREE_CHAIN (last_decl
) = decl
;
11460 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11462 TREE_PURPOSE (list_node
) = init
;
11463 TREE_VALUE (list_node
) = type
;
11464 TREE_CHAIN (list_node
) = NULL_TREE
;
11467 list_node
= tree_cons (init
, type
, NULL_TREE
);
11468 if (result
== NULL_TREE
)
11470 result
= list_node
;
11471 last_result
= result
;
11475 TREE_CHAIN (last_result
) = list_node
;
11476 last_result
= list_node
;
11480 TREE_CHAIN (last_result
) = NULL_TREE
;
11481 /* If there are no parameters, and the function does not end
11482 with `...', then last_decl will be NULL_TREE. */
11483 if (last_decl
!= NULL_TREE
)
11484 TREE_CHAIN (last_decl
) = NULL_TREE
;
11488 last_function_parms
= decls
;
11493 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11494 FUNCTION_TYPE with the newly parsed version of its default argument, which
11495 was previously digested as text. See snarf_defarg et al in lex.c. */
11498 replace_defarg (arg
, init
)
11501 if (! processing_template_decl
11502 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11503 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11504 TREE_TYPE (init
), TREE_VALUE (arg
));
11505 TREE_PURPOSE (arg
) = init
;
11512 tree t
= FUNCTION_ARG_CHAIN (d
);
11513 if (DECL_CONSTRUCTOR_P (d
)
11514 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11515 t
= TREE_CHAIN (t
);
11516 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11517 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11518 == DECL_CLASS_CONTEXT (d
))
11519 && (TREE_CHAIN (t
) == NULL_TREE
11520 || TREE_CHAIN (t
) == void_list_node
11521 || TREE_PURPOSE (TREE_CHAIN (t
))))
11526 /* These memoizing functions keep track of special properties which
11527 a class may have. `grok_ctor_properties' notices whether a class
11528 has a constructor of the form X(X&), and also complains
11529 if the class has a constructor of the form X(X).
11530 `grok_op_properties' takes notice of the various forms of
11531 operator= which are defined, as well as what sorts of type conversion
11532 may apply. Both functions take a FUNCTION_DECL as an argument. */
11535 grok_ctor_properties (ctype
, decl
)
11538 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11539 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11541 /* When a type has virtual baseclasses, a magical first int argument is
11542 added to any ctor so we can tell if the class has been initialized
11543 yet. This could screw things up in this function, so we deliberately
11544 ignore the leading int if we're in that situation. */
11545 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11547 my_friendly_assert (parmtypes
11548 && TREE_VALUE (parmtypes
) == integer_type_node
,
11550 parmtypes
= TREE_CHAIN (parmtypes
);
11551 parmtype
= TREE_VALUE (parmtypes
);
11556 A non-template constructor for class X is a copy constructor if
11557 its first parameter is of type X&, const X&, volatile X& or const
11558 volatile X&, and either there are no other parameters or else all
11559 other parameters have default arguments. */
11560 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11561 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11562 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11563 || TREE_CHAIN (parmtypes
) == void_list_node
11564 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11565 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11566 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11568 TYPE_HAS_INIT_REF (ctype
) = 1;
11569 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11570 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11574 A declaration of a constructor for a class X is ill-formed if its
11575 first parameter is of type (optionally cv-qualified) X and either
11576 there are no other parameters or else all other parameters have
11579 We *don't* complain about member template instantiations that
11580 have this form, though; they can occur as we try to decide what
11581 constructor to use during overload resolution. Since overload
11582 resolution will never prefer such a constructor to the
11583 non-template copy constructor (which is either explicitly or
11584 implicitly defined), there's no need to worry about their
11585 existence. Theoretically, they should never even be
11586 instantiated, but that's hard to forestall. */
11587 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11588 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11589 || TREE_CHAIN (parmtypes
) == void_list_node
11590 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11591 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11592 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11594 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11596 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11599 else if (TREE_CODE (parmtype
) == VOID_TYPE
11600 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11601 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11606 /* An operator with this name can be either unary or binary. */
11612 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11613 || name
== ansi_opname
[(int) ADDR_EXPR
]
11614 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11615 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11616 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11617 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11620 /* An operator with this name can only be unary. */
11626 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11627 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11628 || name
== ansi_opname
[(int) COMPONENT_REF
]
11629 || IDENTIFIER_TYPENAME_P (name
));
11632 /* Do a little sanity-checking on how they declared their operator. */
11635 grok_op_properties (decl
, virtualp
, friendp
)
11637 int virtualp
, friendp
;
11639 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11640 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11641 tree name
= DECL_NAME (decl
);
11643 if (current_class_type
== NULL_TREE
)
11650 A user-declared copy assignment operator X::operator= is a
11651 non-static non-template member function of class X with
11652 exactly one parameter of type X, X&, const X&, volatile X& or
11653 const volatile X&. */
11654 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11655 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11656 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11658 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11659 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11660 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11661 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11662 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11663 || name
== ansi_opname
[(int) MEMBER_REF
])
11664 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11665 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11666 TYPE_GETS_NEW (current_class_type
) |= 1;
11667 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11668 TYPE_GETS_DELETE (current_class_type
) |= 1;
11669 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11670 TYPE_GETS_NEW (current_class_type
) |= 2;
11671 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11672 TYPE_GETS_DELETE (current_class_type
) |= 2;
11675 if (name
== ansi_opname
[(int) NEW_EXPR
]
11676 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11678 /* When the compiler encounters the definition of A::operator new, it
11679 doesn't look at the class declaration to find out if it's static. */
11681 revert_static_member_fn (&decl
, NULL
, NULL
);
11683 /* Take care of function decl if we had syntax errors. */
11684 if (argtypes
== NULL_TREE
)
11686 = build_function_type (ptr_type_node
,
11687 hash_tree_chain (integer_type_node
,
11690 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11692 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11693 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11696 revert_static_member_fn (&decl
, NULL
, NULL
);
11698 if (argtypes
== NULL_TREE
)
11700 = build_function_type (void_type_node
,
11701 hash_tree_chain (ptr_type_node
,
11705 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11707 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11708 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11709 != void_list_node
))
11710 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11715 /* An operator function must either be a non-static member function
11716 or have at least one parameter of a class, a reference to a class,
11717 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11718 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11720 if (IDENTIFIER_TYPENAME_P (name
)
11721 || name
== ansi_opname
[(int) CALL_EXPR
]
11722 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11723 || name
== ansi_opname
[(int) COMPONENT_REF
]
11724 || name
== ansi_opname
[(int) ARRAY_REF
])
11725 cp_error ("`%D' must be a nonstatic member function", decl
);
11730 if (DECL_STATIC_FUNCTION_P (decl
))
11731 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11734 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11736 tree arg
= TREE_VALUE (p
);
11737 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11738 arg
= TREE_TYPE (arg
);
11740 /* This lets bad template code slip through. */
11741 if (IS_AGGR_TYPE (arg
)
11742 || TREE_CODE (arg
) == ENUMERAL_TYPE
11743 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11744 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11748 ("`%D' must have an argument of class or enumerated type",
11755 if (name
== ansi_opname
[(int) CALL_EXPR
])
11756 return; /* No restrictions on args. */
11758 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11760 tree t
= TREE_TYPE (name
);
11761 if (TREE_CODE (t
) == VOID_TYPE
)
11762 pedwarn ("void is not a valid type conversion operator");
11763 else if (! friendp
)
11765 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11766 const char *what
= 0;
11768 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11770 if (t
== current_class_type
)
11771 what
= "the same type";
11772 /* Don't force t to be complete here. */
11773 else if (IS_AGGR_TYPE (t
)
11775 && DERIVED_FROM_P (t
, current_class_type
))
11776 what
= "a base class";
11779 warning ("conversion to %s%s will never use a type conversion operator",
11780 ref
? "a reference to " : "", what
);
11784 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11788 if (list_length (argtypes
) != 3 && methodp
)
11790 cp_error ("`%D' must take exactly one argument", decl
);
11793 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11795 if (copy_assignment_arg_p (parmtype
, virtualp
)
11798 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11799 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11800 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11801 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11804 else if (name
== ansi_opname
[(int) COND_EXPR
])
11807 cp_error ("ANSI C++ prohibits overloading operator ?:");
11809 else if (ambi_op_p (name
))
11811 if (list_length (argtypes
) == 2)
11813 else if (list_length (argtypes
) == 3)
11815 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11816 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11817 && ! processing_template_decl
11818 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11821 cp_error ("postfix `%D' must take `int' as its argument",
11825 ("postfix `%D' must take `int' as its second argument",
11832 cp_error ("`%D' must take either zero or one argument", decl
);
11834 cp_error ("`%D' must take either one or two arguments", decl
);
11837 /* More Effective C++ rule 6. */
11839 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11840 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11842 tree arg
= TREE_VALUE (argtypes
);
11843 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11844 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11845 arg
= TREE_TYPE (arg
);
11846 arg
= TYPE_MAIN_VARIANT (arg
);
11847 if (list_length (argtypes
) == 2)
11849 if (TREE_CODE (ret
) != REFERENCE_TYPE
11850 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11852 cp_warning ("prefix `%D' should return `%T'", decl
,
11853 build_reference_type (arg
));
11857 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11858 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11862 else if (unary_op_p (name
))
11864 if (list_length (argtypes
) != 2)
11867 cp_error ("`%D' must take `void'", decl
);
11869 cp_error ("`%D' must take exactly one argument", decl
);
11872 else /* if (binary_op_p (name)) */
11874 if (list_length (argtypes
) != 3)
11877 cp_error ("`%D' must take exactly one argument", decl
);
11879 cp_error ("`%D' must take exactly two arguments", decl
);
11882 /* More Effective C++ rule 7. */
11884 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11885 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11886 || name
== ansi_opname
[COMPOUND_EXPR
]))
11887 cp_warning ("user-defined `%D' always evaluates both arguments",
11891 /* Effective C++ rule 23. */
11893 && list_length (argtypes
) == 3
11894 && (name
== ansi_opname
[PLUS_EXPR
]
11895 || name
== ansi_opname
[MINUS_EXPR
]
11896 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11897 || name
== ansi_opname
[MULT_EXPR
])
11898 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11899 cp_warning ("`%D' should return by value", decl
);
11903 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11904 if (TREE_PURPOSE (argtypes
))
11906 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11907 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11908 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11911 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11914 cp_error ("`%D' cannot have default arguments", decl
);
11919 static const char *
11921 enum tag_types code
;
11934 my_friendly_abort (981122);
11938 /* Get the struct, enum or union (CODE says which) with tag NAME.
11939 Define the tag as a forward-reference if it is not defined.
11941 C++: If a class derivation is given, process it here, and report
11942 an error if multiple derivation declarations are not identical.
11944 If this is a definition, come in through xref_tag and only look in
11945 the current frame for the name (since C++ allows new names in any
11949 xref_tag (code_type_node
, name
, globalize
)
11950 tree code_type_node
;
11954 enum tag_types tag_code
;
11955 enum tree_code code
;
11957 register tree ref
, t
;
11958 struct binding_level
*b
= current_binding_level
;
11960 tree attributes
= NULL_TREE
;
11961 tree context
= NULL_TREE
;
11963 /* If we are called from the parser, code_type_node will sometimes be a
11964 TREE_LIST. This indicates that the user wrote
11965 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11967 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11969 attributes
= TREE_PURPOSE (code_type_node
);
11970 code_type_node
= TREE_VALUE (code_type_node
);
11973 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11978 code
= RECORD_TYPE
;
11984 code
= ENUMERAL_TYPE
;
11987 my_friendly_abort (18);
11990 /* If a cross reference is requested, look up the type
11991 already defined for this tag and return it. */
11992 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11995 name
= TYPE_IDENTIFIER (t
);
11999 t
= IDENTIFIER_TYPE_VALUE (name
);
12001 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12002 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12007 /* If we know we are defining this tag, only look it up in
12008 this scope and don't try to find it as a type. */
12009 ref
= lookup_tag (code
, name
, b
, 1);
12015 /* [dcl.type.elab] If the identifier resolves to a
12016 typedef-name or a template type-parameter, the
12017 elaborated-type-specifier is ill-formed. */
12018 if (t
!= TYPE_MAIN_VARIANT (t
)
12019 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12020 cp_pedwarn ("using typedef-name `%D' after `%s'",
12021 TYPE_NAME (t
), tag_name (tag_code
));
12022 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12023 cp_error ("using template type parameter `%T' after `%s'",
12024 t
, tag_name (tag_code
));
12029 ref
= lookup_tag (code
, name
, b
, 0);
12033 /* Try finding it as a type declaration. If that wins,
12035 ref
= lookup_name (name
, 1);
12037 if (ref
!= NULL_TREE
12038 && processing_template_decl
12039 && DECL_CLASS_TEMPLATE_P (ref
)
12040 && template_class_depth (current_class_type
) == 0)
12041 /* Since GLOBALIZE is true, we're declaring a global
12042 template, so we want this type. */
12043 ref
= DECL_RESULT (ref
);
12045 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12046 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12047 ref
= TREE_TYPE (ref
);
12052 if (ref
&& current_class_type
12053 && template_class_depth (current_class_type
)
12054 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12056 /* Since GLOBALIZE is non-zero, we are not looking at a
12057 definition of this tag. Since, in addition, we are currently
12058 processing a (member) template declaration of a template
12059 class, we must be very careful; consider:
12066 { template <class V>
12067 friend struct S1; };
12069 Here, the S2::S1 declaration should not be confused with the
12070 outer declaration. In particular, the inner version should
12071 have a template parameter of level 2, not level 1. This
12072 would be particularly important if the member declaration
12075 template <class V = U> friend struct S1;
12077 say, when we should tsubst into `U' when instantiating
12078 S2. On the other hand, when presented with:
12088 we must find the inner binding eventually. We
12089 accomplish this by making sure that the new type we
12090 create to represent this declaration has the right
12092 context
= TYPE_CONTEXT (ref
);
12097 push_obstacks_nochange ();
12101 /* If no such tag is yet defined, create a forward-reference node
12102 and record it as the "definition".
12103 When a real declaration of this type is found,
12104 the forward-reference will be altered into a real type. */
12106 /* In C++, since these migrate into the global scope, we must
12107 build them on the permanent obstack. */
12109 temp
= allocation_temporary_p ();
12111 end_temporary_allocation ();
12113 if (code
== ENUMERAL_TYPE
)
12115 cp_error ("use of enum `%#D' without previous declaration", name
);
12117 ref
= make_node (ENUMERAL_TYPE
);
12119 /* Give the type a default layout like unsigned int
12120 to avoid crashing if it does not get defined. */
12121 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12122 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12123 TREE_UNSIGNED (ref
) = 1;
12124 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12125 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12126 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12128 /* Enable us to recognize when a type is created in class context.
12129 To do nested classes correctly, this should probably be cleared
12130 out when we leave this classes scope. Currently this in only
12131 done in `start_enum'. */
12133 pushtag (name
, ref
, globalize
);
12137 struct binding_level
*old_b
= class_binding_level
;
12139 ref
= make_lang_type (code
);
12140 TYPE_CONTEXT (ref
) = context
;
12142 #ifdef NONNESTED_CLASSES
12143 /* Class types don't nest the way enums do. */
12144 class_binding_level
= (struct binding_level
*)0;
12146 pushtag (name
, ref
, globalize
);
12147 class_binding_level
= old_b
;
12152 /* If it no longer looks like a nested type, make sure it's
12154 If it is not an IDENTIFIER, this is not a declaration */
12155 if (b
->namespace_p
&& !class_binding_level
12156 && TREE_CODE (name
) == IDENTIFIER_NODE
)
12158 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12159 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12162 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12163 redeclare_class_template (ref
, current_template_parms
);
12166 /* Until the type is defined, tentatively accept whatever
12167 structure tag the user hands us. */
12168 if (TYPE_SIZE (ref
) == NULL_TREE
12169 && ref
!= current_class_type
12170 /* Have to check this, in case we have contradictory tag info. */
12171 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12173 if (tag_code
== class_type
)
12174 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12175 else if (tag_code
== record_type
)
12176 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12181 TREE_TYPE (ref
) = attributes
;
12187 xref_tag_from_type (old
, id
, globalize
)
12191 tree code_type_node
;
12193 if (TREE_CODE (old
) == RECORD_TYPE
)
12194 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12195 ? class_type_node
: record_type_node
);
12197 code_type_node
= union_type_node
;
12199 if (id
== NULL_TREE
)
12200 id
= TYPE_IDENTIFIER (old
);
12202 return xref_tag (code_type_node
, id
, globalize
);
12205 /* REF is a type (named NAME), for which we have just seen some
12206 baseclasses. BINFO is a list of those baseclasses; the
12207 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12208 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12209 struct, or union. */
12212 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12213 tree code_type_node
;
12217 /* In the declaration `A : X, Y, ... Z' we mark all the types
12218 (A, X, Y, ..., Z) so we can check for duplicates. */
12223 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12225 if (tag_code
== union_type
)
12227 cp_error ("derived union `%T' invalid", ref
);
12231 len
= list_length (binfo
);
12232 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12234 /* First, make sure that any templates in base-classes are
12235 instantiated. This ensures that if we call ourselves recursively
12236 we do not get confused about which classes are marked and which
12238 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12239 complete_type (TREE_VALUE (base
));
12241 SET_CLASSTYPE_MARKED (ref
);
12242 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12244 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12246 /* The base of a derived struct is public by default. */
12248 = (TREE_PURPOSE (binfo
) == access_public_node
12249 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12250 || (tag_code
!= class_type
12251 && (TREE_PURPOSE (binfo
) == access_default_node
12252 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12254 = (TREE_PURPOSE (binfo
) == access_protected_node
12255 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12257 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12258 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12259 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12260 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12261 tree basetype
= TREE_VALUE (binfo
);
12264 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12265 basetype
= TREE_TYPE (basetype
);
12267 || (TREE_CODE (basetype
) != RECORD_TYPE
12268 && TREE_CODE (basetype
) != TYPENAME_TYPE
12269 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12270 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12272 cp_error ("base type `%T' fails to be a struct or class type",
12273 TREE_VALUE (binfo
));
12277 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12279 /* This code replaces similar code in layout_basetypes.
12280 We put the complete_type first for implicit `typename'. */
12281 if (TYPE_SIZE (basetype
) == NULL_TREE
12282 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12284 cp_error ("base class `%T' has incomplete type", basetype
);
12289 if (CLASSTYPE_MARKED (basetype
))
12291 if (basetype
== ref
)
12292 cp_error ("recursive type `%T' undefined", basetype
);
12294 cp_error ("duplicate base type `%T' invalid", basetype
);
12298 if (TYPE_FOR_JAVA (basetype
)
12299 && (current_lang_stack
12300 == &VARRAY_TREE (current_lang_base
, 0)))
12301 TYPE_FOR_JAVA (ref
) = 1;
12303 /* Note that the BINFO records which describe individual
12304 inheritances are *not* shared in the lattice! They
12305 cannot be shared because a given baseclass may be
12306 inherited with different `accessibility' by different
12307 derived classes. (Each BINFO record describing an
12308 individual inheritance contains flags which say what
12309 the `accessibility' of that particular inheritance is.) */
12312 = make_binfo (integer_zero_node
, basetype
,
12313 CLASS_TYPE_P (basetype
)
12314 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12315 CLASS_TYPE_P (basetype
)
12316 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12318 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12319 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12320 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12321 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12322 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12324 /* We need to unshare the binfos now so that lookups during class
12325 definition work. */
12326 unshare_base_binfos (base_binfo
);
12328 SET_CLASSTYPE_MARKED (basetype
);
12330 /* We are free to modify these bits because they are meaningless
12331 at top level, and BASETYPE is a top-level type. */
12332 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12334 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12335 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12338 if (CLASS_TYPE_P (basetype
))
12340 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12341 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12348 TREE_VEC_LENGTH (binfos
) = i
;
12350 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12353 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12356 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12358 if (CLASS_TYPE_P (basetype
))
12359 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12360 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12363 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12364 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12366 /* Unmark all the types. */
12368 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12369 CLEAR_CLASSTYPE_MARKED (ref
);
12371 /* Now that we know all the base-classes, set up the list of virtual
12373 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12379 /* Begin compiling the definition of an enumeration type.
12380 NAME is its name (or null if anonymous).
12381 Returns the type object, as yet incomplete.
12382 Also records info about it so that build_enumerator
12383 may be used to declare the individual values as they are read. */
12389 register tree enumtype
= NULL_TREE
;
12390 struct binding_level
*b
= current_binding_level
;
12392 /* We are wasting space here and putting these on the permanent_obstack so
12393 that typeid(local enum) will work correctly. */
12394 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12396 /* If this is the real definition for a previous forward reference,
12397 fill in the contents in the same object that used to be the
12398 forward reference. */
12400 if (name
!= NULL_TREE
)
12401 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12403 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12405 cp_error ("multiple definition of `%#T'", enumtype
);
12406 cp_error_at ("previous definition here", enumtype
);
12410 enumtype
= make_node (ENUMERAL_TYPE
);
12411 pushtag (name
, enumtype
, 0);
12414 if (current_class_type
)
12415 TREE_ADDRESSABLE (b
->tags
) = 1;
12417 /* We don't copy this value because build_enumerator needs to do it. */
12418 enum_next_value
= integer_zero_node
;
12421 GNU_xref_decl (current_function_decl
, enumtype
);
12425 /* After processing and defining all the values of an enumeration type,
12426 install their decls in the enumeration type and finish it off.
12427 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12428 Returns ENUMTYPE. */
12431 finish_enum (enumtype
)
12434 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12435 /* Calculate the maximum value of any enumerator in this type. */
12437 tree values
= TYPE_VALUES (enumtype
);
12442 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12447 /* The TREE_VALUE is a CONST_DECL for this enumeration
12449 decl
= TREE_VALUE (pair
);
12451 /* The DECL_INITIAL will be NULL if we are processing a
12452 template declaration and this enumeration constant had no
12453 explicit initializer. */
12454 value
= DECL_INITIAL (decl
);
12455 if (value
&& !processing_template_decl
)
12457 /* Set the TREE_TYPE for the VALUE as well. That's so
12458 that when we call decl_constant_value we get an
12459 entity of the right type (but with the constant
12460 value). Since we shouldn't ever call
12461 decl_constant_value on a template type, there's no
12462 reason to do that when processing_template_decl.
12463 And, if the expression is something like a
12464 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12465 wreak havoc on the intended type of the expression.
12467 Of course, there's also no point in trying to compute
12468 minimum or maximum values if we're in a template. */
12469 TREE_TYPE (value
) = enumtype
;
12472 minnode
= maxnode
= value
;
12473 else if (tree_int_cst_lt (maxnode
, value
))
12475 else if (tree_int_cst_lt (value
, minnode
))
12479 if (processing_template_decl
)
12480 /* If this is just a template, leave the CONST_DECL
12481 alone. That way tsubst_copy will find CONST_DECLs for
12482 CONST_DECLs, and not INTEGER_CSTs. */
12485 /* In the list we're building up, we want the enumeration
12486 values, not the CONST_DECLs. */
12487 TREE_VALUE (pair
) = value
;
12491 maxnode
= minnode
= integer_zero_node
;
12493 TYPE_VALUES (enumtype
) = nreverse (values
);
12495 if (processing_template_decl
)
12497 tree scope
= current_scope ();
12498 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12499 add_tree (build_min (TAG_DEFN
, enumtype
));
12503 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12504 int lowprec
= min_precision (minnode
, unsignedp
);
12505 int highprec
= min_precision (maxnode
, unsignedp
);
12506 int precision
= MAX (lowprec
, highprec
);
12509 TYPE_SIZE (enumtype
) = NULL_TREE
;
12511 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12513 TYPE_PRECISION (enumtype
) = precision
;
12515 fixup_unsigned_type (enumtype
);
12517 fixup_signed_type (enumtype
);
12519 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12520 /* Use the width of the narrowest normal C type which is wide
12522 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12525 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12527 TYPE_SIZE (enumtype
) = 0;
12528 layout_type (enumtype
);
12530 /* Fix up all variant types of this enum type. */
12531 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12532 tem
= TYPE_NEXT_VARIANT (tem
))
12534 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12535 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12536 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12537 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12538 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12539 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12540 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12541 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12542 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12545 /* Finish debugging output for this type. */
12546 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12549 /* In start_enum we pushed obstacks. Here, we must pop them. */
12555 /* Build and install a CONST_DECL for an enumeration constant of the
12556 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12557 Assignment of sequential values by default is handled here. */
12560 build_enumerator (name
, value
, type
)
12568 /* Remove no-op casts from the value. */
12570 STRIP_TYPE_NOPS (value
);
12572 if (! processing_template_decl
)
12574 /* Validate and default VALUE. */
12575 if (value
!= NULL_TREE
)
12577 if (TREE_READONLY_DECL_P (value
))
12578 value
= decl_constant_value (value
);
12580 if (TREE_CODE (value
) == INTEGER_CST
)
12582 value
= default_conversion (value
);
12583 constant_expression_warning (value
);
12587 cp_error ("enumerator value for `%D' not integer constant", name
);
12592 /* Default based on previous value. */
12593 if (value
== NULL_TREE
&& ! processing_template_decl
)
12595 value
= enum_next_value
;
12597 cp_error ("overflow in enumeration values at `%D'", name
);
12600 /* Remove no-op casts from the value. */
12602 STRIP_TYPE_NOPS (value
);
12604 /* To fix MAX_VAL enum consts. (bkoz) */
12605 TREE_TYPE (value
) = integer_type_node
;
12609 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12610 Even in other cases, we will later (in finish_enum) be setting the
12612 if (value
!= NULL_TREE
)
12613 value
= copy_node (value
);
12615 /* C++ associates enums with global, function, or class declarations. */
12617 context
= current_scope ();
12618 if (context
&& context
== current_class_type
)
12619 /* This enum declaration is local to the class. */
12620 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12622 /* It's a global enum, or it's local to a function. (Note local to
12623 a function could mean local to a class method. */
12624 decl
= build_decl (CONST_DECL
, name
, type
);
12626 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12627 DECL_INITIAL (decl
) = value
;
12628 TREE_READONLY (decl
) = 1;
12630 if (context
&& context
== current_class_type
)
12631 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12632 on the TYPE_FIELDS list for `S'. (That's so that you can say
12633 things like `S::i' later.) */
12634 finish_member_declaration (decl
);
12638 GNU_xref_decl (current_function_decl
, decl
);
12641 if (! processing_template_decl
)
12643 /* Set basis for default for next value. */
12644 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12645 integer_one_node
, PLUS_EXPR
);
12646 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12649 result
= tree_cons (name
, decl
, NULL_TREE
);
12654 static int function_depth
;
12656 /* We're defining DECL. Make sure that it's type is OK. */
12659 check_function_type (decl
)
12662 tree fntype
= TREE_TYPE (decl
);
12664 /* In a function definition, arg types must be complete. */
12665 require_complete_types_for_parms (current_function_parms
);
12667 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12669 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12671 /* Make it return void instead, but don't change the
12672 type of the DECL_RESULT, in case we have a named return value. */
12673 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12675 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12677 = build_cplus_method_type (ctype
,
12679 FUNCTION_ARG_CHAIN (decl
));
12683 = build_function_type (void_type_node
,
12684 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12686 = build_exception_variant (fntype
,
12687 TYPE_RAISES_EXCEPTIONS (fntype
));
12690 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12693 /* Create the FUNCTION_DECL for a function definition.
12694 DECLSPECS and DECLARATOR are the parts of the declaration;
12695 they describe the function's name and the type it returns,
12696 but twisted together in a fashion that parallels the syntax of C.
12698 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12699 DECLARATOR is really the DECL for the function we are about to
12700 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12701 indicating that the function is an inline defined in-class, and
12702 SF_EXPAND indicating that we should generate RTL for this
12705 This function creates a binding context for the function body
12706 as well as setting up the FUNCTION_DECL in current_function_decl.
12708 Returns 1 on success. If the DECLARATOR is not suitable for a function
12709 (it defines a datum instead), we return 0, which tells
12710 yyparse to report a parse error.
12712 For C++, we must first check whether that datum makes any sense.
12713 For example, "class A local_a(1,2);" means that variable local_a
12714 is an aggregate of type A, which should have a constructor
12715 applied to it with the argument list [1, 2]. */
12718 start_function (declspecs
, declarator
, attrs
, flags
)
12719 tree declspecs
, declarator
, attrs
;
12723 tree ctype
= NULL_TREE
;
12726 extern int have_extern_spec
;
12727 extern int used_extern_spec
;
12728 int doing_friend
= 0;
12729 struct binding_level
*bl
;
12731 /* Sanity check. */
12732 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12733 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12735 /* This should only be done once on the top most decl. */
12736 if (have_extern_spec
&& !used_extern_spec
)
12738 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12739 used_extern_spec
= 1;
12742 if (flags
& SF_PRE_PARSED
)
12744 decl1
= declarator
;
12746 fntype
= TREE_TYPE (decl1
);
12747 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12748 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12750 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12751 class is in the (lexical) scope of the class in which it is
12753 if (!ctype
&& DECL_FRIEND_P (decl1
))
12755 ctype
= DECL_CLASS_CONTEXT (decl1
);
12757 /* CTYPE could be null here if we're dealing with a template;
12758 for example, `inline friend float foo()' inside a template
12759 will have no CTYPE set. */
12760 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12766 last_function_parms
= DECL_ARGUMENTS (decl1
);
12767 last_function_parm_tags
= NULL_TREE
;
12771 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12772 /* If the declarator is not suitable for a function definition,
12773 cause a syntax error. */
12774 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12776 fntype
= TREE_TYPE (decl1
);
12778 restype
= TREE_TYPE (fntype
);
12779 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12781 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12782 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12783 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12784 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12785 fntype
= build_function_type (integer_type_node
,
12786 TYPE_ARG_TYPES (fntype
));
12788 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12790 TYPE_ARG_TYPES (fntype
));
12791 TREE_TYPE (decl1
) = fntype
;
12794 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12795 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12796 else if (DECL_MAIN_P (decl1
))
12798 /* If this doesn't return integer_type, complain. */
12799 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12801 if (pedantic
|| warn_return_type
)
12802 pedwarn ("return type for `main' changed to `int'");
12803 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12808 /* Warn if function was previously implicitly declared
12809 (but not if we warned then). */
12810 if (! warn_implicit
12811 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12812 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12814 /* Set up current_class_type, and enter the scope of the class, if
12817 push_nested_class (ctype
, 1);
12818 else if (DECL_STATIC_FUNCTION_P (decl1
))
12819 push_nested_class (DECL_CONTEXT (decl1
), 2);
12821 /* Now that we have entered the scope of the class, we must restore
12822 the bindings for any template parameters surrounding DECL1, if it
12823 is an inline member template. (Order is important; consider the
12824 case where a template parameter has the same name as a field of
12825 the class.) It is not until after this point that
12826 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12827 if (flags
& SF_INCLASS_INLINE
)
12828 maybe_begin_member_template_processing (decl1
);
12830 /* Effective C++ rule 15. See also c_expand_return. */
12832 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12833 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12834 cp_warning ("`operator=' should return a reference to `*this'");
12836 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12837 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12838 DECL_INITIAL (decl1
) = error_mark_node
;
12840 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12841 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12844 /* This function exists in static storage.
12845 (This does not mean `static' in the C sense!) */
12846 TREE_STATIC (decl1
) = 1;
12848 /* We must call push_template_decl after current_class_type is set
12849 up. (If we are processing inline definitions after exiting a
12850 class scope, current_class_type will be NULL_TREE until set above
12851 by push_nested_class.) */
12852 if (processing_template_decl
)
12853 decl1
= push_template_decl (decl1
);
12855 /* We are now in the scope of the function being defined. */
12856 current_function_decl
= decl1
;
12858 /* Save the parm names or decls from this function's declarator
12859 where store_parm_decls will find them. */
12860 current_function_parms
= last_function_parms
;
12861 current_function_parm_tags
= last_function_parm_tags
;
12863 /* Make sure the parameter and return types are reasonable. When
12864 you declare a function, these types can be incomplete, but they
12865 must be complete when you define the function. */
12866 if (! processing_template_decl
)
12867 check_function_type (decl1
);
12869 /* Build the return declaration for the function. */
12870 restype
= TREE_TYPE (fntype
);
12871 if (!processing_template_decl
)
12873 if (!DECL_RESULT (decl1
))
12875 DECL_RESULT (decl1
)
12876 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12877 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12878 DECL_RESULT (decl1
));
12882 /* Just use `void'. Nobody will ever look at this anyhow. */
12883 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12885 /* Initialize RTL machinery. We cannot do this until
12886 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12887 even when processing a template; this is how we get
12888 CURRENT_FUNCTION set up, and our per-function variables
12890 bl
= current_binding_level
;
12891 init_function_start (decl1
, input_filename
, lineno
);
12892 current_binding_level
= bl
;
12893 expanding_p
= (flags
& SF_EXPAND
) != 0;
12895 /* Even though we're inside a function body, we still don't want to
12896 call expand_expr to calculate the size of a variable-sized array.
12897 We haven't necessarily assigned RTL to all variables yet, so it's
12898 not safe to try to expand expressions involving them. */
12899 immediate_size_expand
= 0;
12900 get_pending_sizes ();
12902 /* Let the user know we're compiling this function. */
12903 if (!building_stmt_tree ())
12904 announce_function (decl1
);
12906 /* Record the decl so that the function name is defined.
12907 If we already have a decl for this name, and it is a FUNCTION_DECL,
12908 use the old decl. */
12909 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12911 /* A specialization is not used to guide overload resolution. */
12912 if ((flag_guiding_decls
12913 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12914 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12915 decl1
= pushdecl (decl1
);
12918 /* We need to set the DECL_CONTEXT. */
12919 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12920 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12921 /* And make sure we have enough default args. */
12922 check_default_args (decl1
);
12924 DECL_MAIN_VARIANT (decl1
) = decl1
;
12925 fntype
= TREE_TYPE (decl1
);
12928 /* Reset these in case the call to pushdecl changed them. */
12929 current_function_decl
= decl1
;
12930 current_function
->decl
= decl1
;
12932 if (DECL_INTERFACE_KNOWN (decl1
))
12934 tree ctx
= hack_decl_function_context (decl1
);
12936 if (DECL_NOT_REALLY_EXTERN (decl1
))
12937 DECL_EXTERNAL (decl1
) = 0;
12939 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12940 && TREE_PUBLIC (ctx
))
12941 /* This is a function in a local class in an extern inline
12943 comdat_linkage (decl1
);
12945 /* If this function belongs to an interface, it is public.
12946 If it belongs to someone else's interface, it is also external.
12947 This only affects inlines and template instantiations. */
12948 else if (interface_unknown
== 0
12949 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12950 || flag_alt_external_templates
))
12952 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12953 || processing_template_decl
)
12955 DECL_EXTERNAL (decl1
)
12957 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
12958 && !DECL_VINDEX (decl1
)));
12960 /* For WIN32 we also want to put these in linkonce sections. */
12961 maybe_make_one_only (decl1
);
12964 DECL_EXTERNAL (decl1
) = 0;
12965 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
12966 DECL_INTERFACE_KNOWN (decl1
) = 1;
12968 else if (interface_unknown
&& interface_only
12969 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12970 || flag_alt_external_templates
))
12972 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
12973 interface, we will have interface_only set but not
12974 interface_known. In that case, we don't want to use the normal
12975 heuristics because someone will supply a #pragma implementation
12976 elsewhere, and deducing it here would produce a conflict. */
12977 comdat_linkage (decl1
);
12978 DECL_EXTERNAL (decl1
) = 0;
12979 DECL_INTERFACE_KNOWN (decl1
) = 1;
12980 DECL_DEFER_OUTPUT (decl1
) = 1;
12984 /* This is a definition, not a reference.
12985 So clear DECL_EXTERNAL. */
12986 DECL_EXTERNAL (decl1
) = 0;
12988 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
12989 && ! DECL_INTERFACE_KNOWN (decl1
)
12990 /* Don't try to defer nested functions for now. */
12991 && ! hack_decl_function_context (decl1
))
12992 DECL_DEFER_OUTPUT (decl1
) = 1;
12994 DECL_INTERFACE_KNOWN (decl1
) = 1;
12997 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
12999 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13000 TREE_TYPE (decl1
) = fntype
13001 = build_function_type (TREE_TYPE (fntype
),
13002 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
13003 current_function_parms
= TREE_CHAIN (current_function_parms
);
13004 DECL_ARGUMENTS (decl1
) = current_function_parms
;
13008 my_friendly_assert (current_class_ptr
== NULL_TREE
, 19990908);
13009 my_friendly_assert (current_class_ref
== NULL_TREE
, 19990908);
13012 /* If we're compiling a friend function, neither of the variables
13013 current_class_ptr nor current_class_type will have values. */
13014 if (! doing_friend
)
13016 /* We know that this was set up by `grokclassfn'.
13017 We do not wait until `store_parm_decls', since evil
13018 parse errors may never get us to that point. Here
13019 we keep the consistency between `current_class_type'
13020 and `current_class_ptr'. */
13021 tree t
= current_function_parms
;
13024 my_friendly_assert (t
!= NULL_TREE
13025 && TREE_CODE (t
) == PARM_DECL
, 162);
13026 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13029 if (! hack_decl_function_context (decl1
))
13030 temporary_allocation ();
13031 i
= suspend_momentary ();
13033 /* Normally, build_indirect_ref returns current_class_ref
13034 whenever current_class_ptr is dereferenced. This time,
13035 however, we want it to *create* current_class_ref, so we
13036 temporarily clear current_class_ptr to fool it. */
13037 cp_function_chain
->x_current_class_ref
13038 = build_indirect_ref (t
, NULL_PTR
);
13039 cp_function_chain
->x_current_class_ptr
= t
;
13041 resume_momentary (i
);
13042 if (! hack_decl_function_context (decl1
))
13043 end_temporary_allocation ();
13048 current_binding_level
->parm_flag
= 1;
13051 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13053 if (!building_stmt_tree ())
13055 GNU_xref_function (decl1
, current_function_parms
);
13056 make_function_rtl (decl1
);
13059 /* Promote the value to int before returning it. */
13060 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13061 restype
= type_promotes_to (restype
);
13063 /* If this fcn was already referenced via a block-scope `extern' decl
13064 (or an implicit decl), propagate certain information about the usage. */
13065 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13066 TREE_ADDRESSABLE (decl1
) = 1;
13068 if (DECL_RESULT (decl1
) == NULL_TREE
)
13070 DECL_RESULT (decl1
)
13071 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13072 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13073 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13076 /* Allocate further tree nodes temporarily during compilation
13077 of this function only. Tiemann moved up here from bottom of fn. */
13078 /* If this is a nested function, then we must continue to allocate RTL
13079 on the permanent obstack in case we need to inline it later. */
13080 if (! hack_decl_function_context (decl1
))
13081 temporary_allocation ();
13083 /* Make sure that we always have a momntary obstack while we're in a
13087 if (building_stmt_tree ())
13088 begin_stmt_tree (decl1
);
13092 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13093 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13095 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13096 ctor_label
= NULL_TREE
;
13100 dtor_label
= NULL_TREE
;
13101 if (DECL_CONSTRUCTOR_P (decl1
))
13102 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13108 /* Called after store_parm_decls for a function-try-block. We need to update
13109 last_parm_cleanup_insn so that the base initializers for a constructor
13110 are run within this block, not before it. */
13113 expand_start_early_try_stmts ()
13115 expand_start_try_stmts ();
13116 last_parm_cleanup_insn
= get_last_insn ();
13119 /* Store the parameter declarations into the current function declaration.
13120 This is called after parsing the parameter declarations, before
13121 digesting the body of the function.
13123 Also install to binding contour return value identifier, if any. */
13126 store_parm_decls ()
13128 register tree fndecl
= current_function_decl
;
13129 register tree parm
;
13130 int parms_have_cleanups
= 0;
13131 tree cleanups
= NULL_TREE
;
13133 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13134 tree specparms
= current_function_parms
;
13136 /* This is a list of types declared among parms in a prototype. */
13137 tree parmtags
= current_function_parm_tags
;
13139 /* This is a chain of any other decls that came in among the parm
13140 declarations. If a parm is declared with enum {foo, bar} x;
13141 then CONST_DECLs for foo and bar are put here. */
13142 tree nonparms
= NULL_TREE
;
13144 if (toplevel_bindings_p ())
13145 fatal ("parse errors have confused me too much");
13147 /* Create a binding level for the parms. */
13148 expand_start_bindings (0);
13150 if (specparms
!= NULL_TREE
)
13152 /* This case is when the function was defined with an ANSI prototype.
13153 The parms already have decls, so we need not do anything here
13154 except record them as in effect
13155 and complain if any redundant old-style parm decls were written. */
13157 register tree next
;
13159 /* Must clear this because it might contain TYPE_DECLs declared
13161 storedecls (NULL_TREE
);
13163 for (parm
= nreverse (specparms
); parm
; parm
= next
)
13165 next
= TREE_CHAIN (parm
);
13166 if (TREE_CODE (parm
) == PARM_DECL
)
13169 if (DECL_NAME (parm
) == NULL_TREE
)
13173 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
13174 cp_error ("parameter `%D' declared void", parm
);
13177 if (! building_stmt_tree ()
13178 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13180 expand_decl (parm
);
13181 parms_have_cleanups
= 1;
13183 /* Keep track of the cleanups. */
13184 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13189 /* If we find an enum constant or a type tag,
13190 put it aside for the moment. */
13191 TREE_CHAIN (parm
) = NULL_TREE
;
13192 nonparms
= chainon (nonparms
, parm
);
13196 /* Get the decls in their original chain order
13197 and record in the function. This is all and only the
13198 PARM_DECLs that were pushed into scope by the loop above. */
13199 DECL_ARGUMENTS (fndecl
) = getdecls ();
13201 storetags (chainon (parmtags
, gettags ()));
13204 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13206 /* Now store the final chain of decls for the arguments
13207 as the decl-chain of the current lexical scope.
13208 Put the enumerators in as well, at the front so that
13209 DECL_ARGUMENTS is not modified. */
13211 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13213 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
13214 declare_function_name ();
13216 /* Initialize the RTL code for the function. */
13217 DECL_SAVED_INSNS (fndecl
) = 0;
13218 if (! building_stmt_tree ())
13219 expand_function_start (fndecl
, parms_have_cleanups
);
13221 current_function_parms_stored
= 1;
13223 /* If this function is `main', emit a call to `__main'
13224 to run global initializers, etc. */
13225 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13226 expand_main_function ();
13228 /* Now that we have initialized the parms, we can start their
13229 cleanups. We cannot do this before, since expand_decl_cleanup
13230 should not be called before the parm can be used. */
13231 if (cleanups
&& !building_stmt_tree ())
13233 for (cleanups
= nreverse (cleanups
);
13235 cleanups
= TREE_CHAIN (cleanups
))
13237 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
),
13238 TREE_VALUE (cleanups
)))
13239 cp_error ("parser lost in parsing declaration of `%D'",
13240 TREE_PURPOSE (cleanups
));
13244 /* Create a binding contour which can be used to catch
13245 cleanup-generated temporaries. Also, if the return value needs or
13246 has initialization, deal with that now. */
13247 if (parms_have_cleanups
)
13250 if (!building_stmt_tree ())
13251 expand_start_bindings (0);
13254 if (! building_stmt_tree () && flag_exceptions
)
13256 /* Do the starting of the exception specifications, if we have any. */
13257 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13258 expand_start_eh_spec ();
13261 last_parm_cleanup_insn
= get_last_insn ();
13262 last_dtor_insn
= get_last_insn ();
13265 /* Bind a name and initialization to the return value of
13266 the current function. */
13269 store_return_init (decl
)
13272 /* If this named return value comes in a register, put it in a
13273 pseudo-register. */
13274 if (DECL_REGISTER (decl
))
13276 original_result_rtx
= DECL_RTL (decl
);
13277 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13282 /* Finish up a function declaration and compile that function
13283 all the way to assembler language output. The free the storage
13284 for the function definition.
13286 This is called after parsing the body of the function definition.
13287 LINENO is the current line number.
13289 FLAGS is a bitwise or of the following values:
13291 An extra call to poplevel (and expand_end_bindings) must be
13292 made to take care of the binding contour for the base
13293 initializers. This is only relevant for constructors.
13295 We just finished processing the body of an in-class inline
13296 function definition. (This processing will have taken place
13297 after the class definition is complete.) */
13300 finish_function (lineno
, flags
)
13304 register tree fndecl
= current_function_decl
;
13305 tree fntype
, ctype
= NULL_TREE
;
13306 rtx fn_last_parm_insn
, insns
;
13307 /* Label to use if this function is supposed to return a value. */
13308 tree no_return_label
= NULL_TREE
;
13309 tree decls
= NULL_TREE
;
13310 int call_poplevel
= (flags
& 1) != 0;
13311 int inclass_inline
= (flags
& 2) != 0;
13315 /* When we get some parse errors, we can end up without a
13316 current_function_decl, so cope. */
13317 if (fndecl
== NULL_TREE
)
13318 return error_mark_node
;
13320 nested
= function_depth
> 1;
13321 fntype
= TREE_TYPE (fndecl
);
13323 /* TREE_READONLY (fndecl) = 1;
13324 This caused &foo to be of type ptr-to-const-function
13325 which then got a warning when stored in a ptr-to-function variable. */
13327 /* This happens on strange parse errors. */
13328 if (! current_function_parms_stored
)
13331 store_parm_decls ();
13334 if (building_stmt_tree ())
13336 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13338 decls
= getdecls ();
13339 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13340 poplevel (decls
!= NULL_TREE
, 0, 0);
13343 /* Because we do not call expand_function_end, we won't call
13344 expand_end_bindings to match the call to
13345 expand_start_bindings we did in store_parm_decls. Therefore,
13346 we explicitly call expand_end_bindings here. However, we
13347 really shouldn't be calling expand_start_bindings at all when
13348 building_stmt_tree; it's conceptually an RTL-generation
13349 function, rather than a front-end function. */
13350 expand_end_bindings (0, 0, 0);
13354 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13356 tree ttype
= target_type (fntype
);
13359 if (IS_AGGR_TYPE (ttype
))
13360 /* Let debugger know it should output info for this type. */
13361 note_debug_info_needed (ttype
);
13363 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13365 ttype
= target_type (TREE_TYPE (parmdecl
));
13366 if (IS_AGGR_TYPE (ttype
))
13367 /* Let debugger know it should output info for this type. */
13368 note_debug_info_needed (ttype
);
13372 /* Clean house because we will need to reorder insns here. */
13373 do_pending_stack_adjust ();
13377 tree binfo
= TYPE_BINFO (current_class_type
);
13378 tree cond
= integer_one_node
;
13380 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13382 int ok_to_optimize_dtor
= 0;
13383 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13385 if (current_function_assigns_this
)
13386 cond
= build (NE_EXPR
, boolean_type_node
,
13387 current_class_ptr
, integer_zero_node
);
13390 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13392 /* If this destructor is empty, then we don't need to check
13393 whether `this' is NULL in some cases. */
13394 if ((flag_this_is_variable
& 1) == 0)
13395 ok_to_optimize_dtor
= 1;
13396 else if (empty_dtor
)
13397 ok_to_optimize_dtor
13398 = (n_baseclasses
== 0
13399 || (n_baseclasses
== 1
13400 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13403 /* These initializations might go inline. Protect
13404 the binding level of the parms. */
13406 expand_start_bindings (0);
13408 if (current_function_assigns_this
)
13410 current_function_assigns_this
= 0;
13411 current_function_just_assigned_this
= 0;
13414 /* Generate the code to call destructor on base class.
13415 If this destructor belongs to a class with virtual
13416 functions, then set the virtual function table
13417 pointer to represent the type of our base class. */
13419 /* This side-effect makes call to `build_delete' generate the
13420 code we have to have at the end of this destructor.
13421 `build_delete' will set the flag again. */
13422 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13424 /* These are two cases where we cannot delegate deletion. */
13425 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13426 || TYPE_GETS_REG_DELETE (current_class_type
))
13427 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
13428 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13430 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
13431 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13433 /* If we did not assign to this, then `this' is non-zero at
13434 the end of a destructor. As a special optimization, don't
13435 emit test if this is an empty destructor. If it does nothing,
13436 it does nothing. If it calls a base destructor, the base
13437 destructor will perform the test. */
13439 if (exprstmt
!= error_mark_node
13440 && (TREE_CODE (exprstmt
) != NOP_EXPR
13441 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13442 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13444 expand_label (dtor_label
);
13445 if (cond
!= integer_one_node
)
13446 expand_start_cond (cond
, 0);
13447 if (exprstmt
!= void_zero_node
)
13448 /* Don't call `expand_expr_stmt' if we're not going to do
13449 anything, since -Wall will give a diagnostic. */
13450 expand_expr_stmt (exprstmt
);
13452 /* Run destructor on all virtual baseclasses. */
13453 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13455 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13456 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13457 in_charge_node
, integer_two_node
), 0);
13460 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13462 tree vb
= get_vbase
13463 (BINFO_TYPE (vbases
),
13464 TYPE_BINFO (current_class_type
));
13466 (build_scoped_method_call
13467 (current_class_ref
, vb
, dtor_identifier
,
13468 build_expr_list (NULL_TREE
, integer_zero_node
)));
13470 vbases
= TREE_CHAIN (vbases
);
13472 expand_end_cond ();
13475 do_pending_stack_adjust ();
13476 if (cond
!= integer_one_node
)
13477 expand_end_cond ();
13480 virtual_size
= c_sizeof (current_class_type
);
13482 /* At the end, call delete if that's what's requested. */
13484 /* FDIS sez: At the point of definition of a virtual destructor
13485 (including an implicit definition), non-placement operator
13486 delete shall be looked up in the scope of the destructor's
13487 class and if found shall be accessible and unambiguous.
13489 This is somewhat unclear, but I take it to mean that if the
13490 class only defines placement deletes we don't do anything here.
13491 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13492 for us if they ever try to delete one of these. */
13494 if (TYPE_GETS_REG_DELETE (current_class_type
)
13495 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13496 exprstmt
= build_op_delete_call
13497 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13498 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13500 exprstmt
= NULL_TREE
;
13504 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13505 in_charge_node
, integer_one_node
);
13506 expand_start_cond (cond
, 0);
13507 expand_expr_stmt (exprstmt
);
13508 expand_end_cond ();
13511 /* End of destructor. */
13512 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13513 poplevel (getdecls () != NULL_TREE
, 0, 0);
13515 /* Back to the top of destructor. */
13516 /* Don't execute destructor code if `this' is NULL. */
13520 /* If the dtor is empty, and we know there is not possible way we
13521 could use any vtable entries, before they are possibly set by
13522 a base class dtor, we don't have to setup the vtables, as we
13523 know that any base class dtoring will set up any vtables it
13524 needs. We avoid MI, because one base class dtor can do a
13525 virtual dispatch to an overridden function that would need to
13526 have a non-related vtable set up, we cannot avoid setting up
13527 vtables in that case. We could change this to see if there is
13528 just one vtable. */
13529 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13531 /* Make all virtual function table pointers in non-virtual base
13532 classes point to CURRENT_CLASS_TYPE's virtual function
13534 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13536 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13537 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13540 if (! ok_to_optimize_dtor
)
13542 cond
= build_binary_op (NE_EXPR
,
13543 current_class_ptr
, integer_zero_node
);
13544 expand_start_cond (cond
, 0);
13547 insns
= get_insns ();
13550 fn_last_parm_insn
= get_first_nonparm_insn ();
13551 if (fn_last_parm_insn
== NULL_RTX
)
13552 fn_last_parm_insn
= get_last_insn ();
13554 fn_last_parm_insn
= previous_insn (fn_last_parm_insn
);
13556 emit_insns_after (insns
, fn_last_parm_insn
);
13558 if (! ok_to_optimize_dtor
)
13559 expand_end_cond ();
13561 else if (current_function_assigns_this
)
13563 /* Does not need to call emit_base_init, because
13564 that is done (if needed) just after assignment to this
13567 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13569 end_protect_partials ();
13570 expand_label (ctor_label
);
13571 ctor_label
= NULL_TREE
;
13575 decls
= getdecls ();
13576 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13577 poplevel (decls
!= NULL_TREE
, 0, 0);
13579 /* c_expand_return knows to return 'this' from a constructor. */
13580 c_expand_return (NULL_TREE
);
13582 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13583 && return_label
!= NULL_RTX
)
13584 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13586 current_function_assigns_this
= 0;
13587 current_function_just_assigned_this
= 0;
13588 base_init_expr
= NULL_TREE
;
13590 else if (DECL_CONSTRUCTOR_P (fndecl
))
13592 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13593 /* Allow constructor for a type to get a new instance of the object
13594 using `build_new'. */
13595 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13596 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13598 if (flag_this_is_variable
> 0)
13600 cond
= build_binary_op (EQ_EXPR
,
13601 current_class_ptr
, integer_zero_node
);
13602 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13603 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13606 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13610 if (flag_this_is_variable
> 0)
13612 expand_start_cond (cond
, 0);
13613 expand_expr_stmt (thenclause
);
13614 expand_end_cond ();
13617 /* Emit insns from `emit_base_init' which sets up virtual
13618 function table pointer(s). */
13619 if (base_init_expr
)
13621 expand_expr_stmt (base_init_expr
);
13622 base_init_expr
= NULL_TREE
;
13625 insns
= get_insns ();
13628 /* This is where the body of the constructor begins. */
13630 emit_insns_after (insns
, last_parm_cleanup_insn
);
13632 end_protect_partials ();
13634 /* This is where the body of the constructor ends. */
13635 expand_label (ctor_label
);
13636 ctor_label
= NULL_TREE
;
13640 decls
= getdecls ();
13641 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13642 poplevel (decls
!= NULL_TREE
, 1, 0);
13645 /* c_expand_return knows to return 'this' from a constructor. */
13646 c_expand_return (NULL_TREE
);
13648 current_function_assigns_this
= 0;
13649 current_function_just_assigned_this
= 0;
13651 else if (DECL_MAIN_P (fndecl
))
13653 /* Make it so that `main' always returns 0 by default. */
13655 c_expand_return (integer_one_node
);
13657 c_expand_return (integer_zero_node
);
13660 else if (return_label
!= NULL_RTX
13661 && current_function_return_value
== NULL_TREE
13662 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13663 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13665 if (flag_exceptions
)
13666 expand_exception_blocks ();
13668 /* If this function is supposed to return a value, ensure that
13669 we do not fall into the cleanups by mistake. The end of our
13670 function will look like this:
13672 user code (may have return stmt somewhere)
13673 goto no_return_label
13678 NOTE_INSN_FUNCTION_END
13682 If the user omits a return stmt in the USER CODE section, we
13683 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13684 Otherwise, we won't. */
13685 if (no_return_label
)
13687 DECL_CONTEXT (no_return_label
) = fndecl
;
13688 DECL_INITIAL (no_return_label
) = error_mark_node
;
13689 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13690 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13691 expand_goto (no_return_label
);
13696 /* Remove the binding contour which is used
13697 to catch cleanup-generated temporaries. */
13698 expand_end_bindings (0, 0, 0);
13699 poplevel (0, 0, 0);
13701 /* Emit label at beginning of cleanup code for parameters. */
13702 emit_label (cleanup_label
);
13705 /* Get return value into register if that's where it's supposed
13707 if (original_result_rtx
)
13708 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13710 /* Finish building code that will trigger warnings if users forget
13711 to make their functions return values. */
13712 if (no_return_label
|| cleanup_label
)
13713 emit_jump (return_label
);
13714 if (no_return_label
)
13716 /* We don't need to call `expand_*_return' here because we
13717 don't need any cleanups here--this path of code is only
13718 for error checking purposes. */
13719 expand_label (no_return_label
);
13722 /* We hard-wired immediate_size_expand to zero in
13723 start_function. Expand_function_end will decrement this
13724 variable. So, we set the variable to one here, so that after
13725 the decrement it will remain zero. */
13726 immediate_size_expand
= 1;
13728 /* Generate rtl for function exit. */
13729 expand_function_end (input_filename
, lineno
, 1);
13732 /* We have to save this value here in case
13733 maybe_end_member_template_processing decides to pop all the
13734 template parameters. */
13735 expand_p
= !building_stmt_tree ();
13737 /* If we're saving up tree structure, tie off the function now. */
13739 finish_stmt_tree (fndecl
);
13741 /* This must come after expand_function_end because cleanups might
13742 have declarations (from inline functions) that need to go into
13743 this function's blocks. */
13744 if (current_binding_level
->parm_flag
!= 1)
13745 my_friendly_abort (122);
13746 poplevel (1, 0, 1);
13748 /* Remember that we were in class scope. */
13749 if (current_class_name
)
13750 ctype
= current_class_type
;
13752 /* Must mark the RESULT_DECL as being in this function. */
13753 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13755 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13756 to the FUNCTION_DECL node itself. */
13757 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13759 /* Undo the call to push_momentary in start_function. */
13766 int saved_flag_keep_inline_functions
=
13767 flag_keep_inline_functions
;
13769 /* So we can tell if jump_optimize sets it to 1. */
13772 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13773 && hack_decl_function_context (fndecl
))
13774 /* Trick rest_of_compilation into not deferring output of this
13775 function, even if it is inline, since the rtl_obstack for
13776 this function is the function_obstack of the enclosing
13777 function and will be deallocated when the enclosing
13778 function is gone. See save_tree_status. */
13779 flag_keep_inline_functions
= 1;
13781 /* Before we call rest_of_compilation (which will pop the
13782 CURRENT_FUNCTION), we must save these values. */
13783 returns_null
= current_function_returns_null
;
13784 returns_value
= current_function_returns_value
;
13786 /* If this is a nested function (like a template instantiation
13787 that we're compiling in the midst of compiling something
13788 else), push a new GC context. That will keep local variables
13789 on the stack from being collected while we're doing the
13790 compilation of this function. */
13791 if (function_depth
> 1)
13792 ggc_push_context ();
13794 /* Run the optimizers and output the assembler code for this
13796 if (DECL_ARTIFICIAL (fndecl
))
13798 /* Do we really *want* to inline this synthesized method? */
13800 int save_fif
= flag_inline_functions
;
13801 flag_inline_functions
= 1;
13803 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13804 will check our size. */
13805 DECL_INLINE (fndecl
) = 0;
13807 rest_of_compilation (fndecl
);
13808 flag_inline_functions
= save_fif
;
13811 rest_of_compilation (fndecl
);
13813 /* Undo the call to ggc_push_context above. */
13814 if (function_depth
> 1)
13815 ggc_pop_context ();
13817 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13819 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13821 /* Set DECL_EXTERNAL so that assemble_external will be called as
13822 necessary. We'll clear it again in finish_file. */
13823 if (! DECL_EXTERNAL (fndecl
))
13824 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13825 DECL_EXTERNAL (fndecl
) = 1;
13826 mark_inline_for_output (fndecl
);
13829 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13830 note_debug_info_needed (ctype
);
13832 returns_null
|= can_reach_end
;
13834 /* Since we don't normally go through c_expand_return for constructors,
13835 this normally gets the wrong value.
13836 Also, named return values have their return codes emitted after
13837 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13838 if (DECL_CONSTRUCTOR_P (fndecl
)
13839 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13842 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13843 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13844 else if ((warn_return_type
|| pedantic
)
13846 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13848 /* If this function returns non-void and control can drop through,
13850 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13852 /* With just -W, complain only if function returns both with
13853 and without a value. */
13854 else if (extra_warnings
&& returns_value
&& returns_null
)
13855 warning ("this function may return with or without a value");
13859 /* Since we never call rest_of_compilation, we never clear
13860 CURRENT_FUNCTION. Do so explicitly. */
13861 free_after_compilation (current_function
);
13862 current_function
= NULL
;
13865 /* If this is a in-class inline definition, we may have to pop the
13866 bindings for the template parameters that we added in
13867 maybe_begin_member_template_processing when start_function was
13869 if (inclass_inline
)
13870 maybe_end_member_template_processing ();
13872 /* Leave the scope of the class. */
13874 pop_nested_class ();
13878 /* Free all the tree nodes making up this function. */
13879 /* Switch back to allocating nodes permanently
13880 until we start another function. */
13882 permanent_allocation (1);
13884 if (DECL_SAVED_INSNS (fndecl
) == 0)
13888 /* Stop pointing to the local nodes about to be freed. */
13889 /* But DECL_INITIAL must remain nonzero so we know this
13890 was an actual function definition. */
13891 DECL_INITIAL (fndecl
) = error_mark_node
;
13892 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13893 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13896 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13897 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13898 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13899 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13904 /* Let the error reporting routines know that we're outside a
13905 function. For a nested function, this value is used in
13906 pop_cp_function_context and then reset via pop_function_context. */
13907 current_function_decl
= NULL_TREE
;
13913 /* Create the FUNCTION_DECL for a function definition.
13914 DECLSPECS and DECLARATOR are the parts of the declaration;
13915 they describe the return type and the name of the function,
13916 but twisted together in a fashion that parallels the syntax of C.
13918 This function creates a binding context for the function body
13919 as well as setting up the FUNCTION_DECL in current_function_decl.
13921 Returns a FUNCTION_DECL on success.
13923 If the DECLARATOR is not suitable for a function (it defines a datum
13924 instead), we return 0, which tells yyparse to report a parse error.
13926 May return void_type_node indicating that this method is actually
13927 a friend. See grokfield for more details.
13929 Came here with a `.pushlevel' .
13931 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13932 CHANGES TO CODE IN `grokfield'. */
13935 start_method (declspecs
, declarator
, attrlist
)
13936 tree declarator
, declspecs
, attrlist
;
13938 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13941 /* Something too ugly to handle. */
13942 if (fndecl
== NULL_TREE
)
13945 /* Pass friends other than inline friend functions back. */
13946 if (fndecl
== void_type_node
)
13949 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13950 /* Not a function, tell parser to report parse error. */
13953 if (DECL_IN_AGGR_P (fndecl
))
13955 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13957 if (DECL_CONTEXT (fndecl
)
13958 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13959 cp_error ("`%D' is already defined in class %s", fndecl
,
13960 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13962 return void_type_node
;
13965 check_template_shadow (fndecl
);
13967 DECL_THIS_INLINE (fndecl
) = 1;
13969 if (flag_default_inline
)
13970 DECL_INLINE (fndecl
) = 1;
13972 /* We process method specializations in finish_struct_1. */
13973 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13974 fndecl
= push_template_decl (fndecl
);
13976 /* We read in the parameters on the maybepermanent_obstack,
13977 but we won't be getting back to them until after we
13978 may have clobbered them. So the call to preserve_data
13979 will keep them safe. */
13982 if (! DECL_FRIEND_P (fndecl
))
13984 if (TREE_CHAIN (fndecl
))
13986 fndecl
= copy_node (fndecl
);
13987 TREE_CHAIN (fndecl
) = NULL_TREE
;
13990 if (DECL_CONSTRUCTOR_P (fndecl
))
13992 if (! grok_ctor_properties (current_class_type
, fndecl
))
13993 return void_type_node
;
13995 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13996 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13999 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
14001 /* Make a place for the parms */
14003 current_binding_level
->parm_flag
= 1;
14005 DECL_IN_AGGR_P (fndecl
) = 1;
14009 /* Go through the motions of finishing a function definition.
14010 We don't compile this method until after the whole class has
14013 FINISH_METHOD must return something that looks as though it
14014 came from GROKFIELD (since we are defining a method, after all).
14016 This is called after parsing the body of the function definition.
14017 STMTS is the chain of statements that makes up the function body.
14019 DECL is the ..._DECL that `start_method' provided. */
14022 finish_method (decl
)
14025 register tree fndecl
= decl
;
14028 register tree link
;
14030 if (decl
== void_type_node
)
14033 old_initial
= DECL_INITIAL (fndecl
);
14035 /* Undo the level for the parms (from start_method).
14036 This is like poplevel, but it causes nothing to be
14037 saved. Saving information here confuses symbol-table
14038 output routines. Besides, this information will
14039 be correctly output when this method is actually
14042 /* Clear out the meanings of the local variables of this level;
14043 also record in each decl which block it belongs to. */
14045 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14047 if (DECL_NAME (link
) != NULL_TREE
)
14048 pop_binding (DECL_NAME (link
), link
);
14049 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14050 DECL_CONTEXT (link
) = NULL_TREE
;
14053 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14054 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14055 current_binding_level
->parm_flag
,
14056 current_binding_level
->keep
);
14058 poplevel (0, 0, 0);
14060 DECL_INITIAL (fndecl
) = old_initial
;
14062 /* We used to check if the context of FNDECL was different from
14063 current_class_type as another way to get inside here. This didn't work
14064 for String.cc in libg++. */
14065 if (DECL_FRIEND_P (fndecl
))
14067 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14068 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14069 decl
= void_type_node
;
14075 /* Called when a new struct TYPE is defined.
14076 If this structure or union completes the type of any previous
14077 variable declaration, lay it out and output its rtl. */
14080 hack_incomplete_structures (type
)
14085 if (current_binding_level
->incomplete
== NULL_TREE
)
14088 if (!type
) /* Don't do this for class templates. */
14091 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14093 tree decl
= TREE_VALUE (*list
);
14094 if ((decl
&& TREE_TYPE (decl
) == type
)
14095 || (TREE_TYPE (decl
)
14096 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14097 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14099 int toplevel
= toplevel_bindings_p ();
14100 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14101 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14102 layout_type (TREE_TYPE (decl
));
14103 layout_decl (decl
, 0);
14104 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14108 expand_decl (decl
);
14109 cleanup
= maybe_build_cleanup (decl
);
14110 expand_decl_init (decl
);
14111 if (! expand_decl_cleanup (decl
, cleanup
))
14112 cp_error ("parser lost in parsing declaration of `%D'",
14115 *list
= TREE_CHAIN (*list
);
14118 list
= &TREE_CHAIN (*list
);
14122 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14123 See build_delete for information about AUTO_DELETE.
14125 Don't build these on the momentary obstack; they must live
14126 the life of the binding contour. */
14129 maybe_build_cleanup_1 (decl
, auto_delete
)
14130 tree decl
, auto_delete
;
14132 tree type
= TREE_TYPE (decl
);
14133 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14135 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14138 if (TREE_CODE (decl
) != PARM_DECL
)
14139 temp
= suspend_momentary ();
14141 if (TREE_CODE (type
) == ARRAY_TYPE
)
14145 mark_addressable (decl
);
14146 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14149 /* Optimize for space over speed here. */
14150 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14151 || flag_expensive_optimizations
)
14152 flags
|= LOOKUP_NONVIRTUAL
;
14154 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14156 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14157 && ! TYPE_HAS_DESTRUCTOR (type
))
14158 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14159 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14161 if (TREE_CODE (decl
) != PARM_DECL
)
14162 resume_momentary (temp
);
14169 /* If DECL is of a type which needs a cleanup, build that cleanup
14170 here. The cleanup does free the storage with a call to delete. */
14173 maybe_build_cleanup_and_delete (decl
)
14176 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14179 /* If DECL is of a type which needs a cleanup, build that cleanup
14180 here. The cleanup does not free the storage with a call a delete. */
14183 maybe_build_cleanup (decl
)
14186 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14189 /* Expand a C++ expression at the statement level.
14190 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14191 The C++ type checker should get all of these out when
14192 expressions are combined with other, type-providing, expressions,
14193 leaving only orphan expressions, such as:
14195 &class::bar; / / takes its address, but does nothing with it. */
14198 cplus_expand_expr_stmt (exp
)
14201 if (stmts_are_full_exprs_p
)
14202 exp
= convert_to_void (exp
, "statement");
14205 /* We should do this eventually, but right now this causes regex.o from
14206 libg++ to miscompile, and tString to core dump. */
14207 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14210 /* If we don't do this, we end up down inside expand_expr
14211 trying to do TYPE_MODE on the ERROR_MARK, and really
14212 go outside the bounds of the type. */
14213 if (exp
!= error_mark_node
)
14214 expand_expr_stmt (break_out_cleanups (exp
));
14217 /* When a stmt has been parsed, this function is called. */
14222 if (!current_function_assigns_this
14223 && current_function_just_assigned_this
)
14225 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14227 /* Constructors must wait until we are out of control
14228 zones before calling base constructors. */
14229 if (in_control_zone_p ())
14231 expand_expr_stmt (base_init_expr
);
14232 check_base_init (current_class_type
);
14234 current_function_assigns_this
= 1;
14237 /* Always assume this statement was not an expression statement. If
14238 it actually was an expression statement, its our callers
14239 responsibility to fix this up. */
14240 last_expr_type
= NULL_TREE
;
14243 /* Change a static member function definition into a FUNCTION_TYPE, instead
14244 of the METHOD_TYPE that we create when it's originally parsed.
14246 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14247 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14248 other decls. Either pass the addresses of local variables or NULL. */
14251 revert_static_member_fn (decl
, fn
, argtypes
)
14252 tree
*decl
, *fn
, *argtypes
;
14255 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14256 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14258 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14259 != TYPE_UNQUALIFIED
)
14260 cp_error ("static member function `%#D' declared with type qualifiers",
14263 args
= TREE_CHAIN (args
);
14264 tmp
= build_function_type (TREE_TYPE (function
), args
);
14265 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14266 tmp
= build_exception_variant (tmp
,
14267 TYPE_RAISES_EXCEPTIONS (function
));
14268 TREE_TYPE (*decl
) = tmp
;
14269 if (DECL_ARGUMENTS (*decl
))
14270 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14271 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14278 /* Initialize the variables used during compilation of a C++
14282 push_cp_function_context (f
)
14283 struct function
*f
;
14285 struct language_function
*p
14286 = ((struct language_function
*)
14287 xcalloc (1, sizeof (struct language_function
)));
14290 /* For now, we always assume we're expanding all the way to RTL
14291 unless we're explicitly doing otherwise. */
14294 /* Whenever we start a new function, we destroy temporaries in the
14296 stmts_are_full_exprs_p
= 1;
14299 /* Free the language-specific parts of F, now that we've finished
14300 compiling the function. */
14303 pop_cp_function_context (f
)
14304 struct function
*f
;
14306 free (f
->language
);
14311 mark_cp_function_context (f
)
14312 struct function
*f
;
14314 struct language_function
*p
= f
->language
;
14319 ggc_mark_tree (p
->x_named_labels
);
14320 ggc_mark_tree (p
->x_ctor_label
);
14321 ggc_mark_tree (p
->x_dtor_label
);
14322 ggc_mark_tree (p
->x_base_init_list
);
14323 ggc_mark_tree (p
->x_member_init_list
);
14324 ggc_mark_tree (p
->x_base_init_expr
);
14325 ggc_mark_tree (p
->x_current_class_ptr
);
14326 ggc_mark_tree (p
->x_current_class_ref
);
14327 ggc_mark_tree (p
->x_last_tree
);
14328 ggc_mark_tree (p
->x_last_expr_type
);
14330 ggc_mark_rtx (p
->x_last_dtor_insn
);
14331 ggc_mark_rtx (p
->x_last_parm_cleanup_insn
);
14332 ggc_mark_rtx (p
->x_result_rtx
);
14334 mark_binding_level (&p
->bindings
);
14341 return function_depth
!= 0;
14346 lang_mark_false_label_stack (l
)
14347 struct label_node
*l
;
14349 /* C++ doesn't use false_label_stack. It better be NULL. */
14350 my_friendly_assert (l
== NULL
, 19990904);
14357 enum tree_code code
= TREE_CODE (t
);
14358 if (code
== IDENTIFIER_NODE
)
14360 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14361 struct lang_id2
*li2
= li
->x
;
14362 ggc_mark_tree (li
->namespace_bindings
);
14363 ggc_mark_tree (li
->bindings
);
14364 ggc_mark_tree (li
->class_value
);
14365 ggc_mark_tree (li
->class_template_info
);
14369 ggc_mark_tree (li2
->label_value
);
14370 ggc_mark_tree (li2
->implicit_decl
);
14371 ggc_mark_tree (li2
->error_locus
);
14374 else if (code
== CPLUS_BINDING
)
14376 if (BINDING_HAS_LEVEL_P (t
))
14377 mark_binding_level (&BINDING_LEVEL (t
));
14379 ggc_mark_tree (BINDING_SCOPE (t
));
14380 ggc_mark_tree (BINDING_VALUE (t
));
14382 else if (code
== OVERLOAD
)
14383 ggc_mark_tree (OVL_FUNCTION (t
));
14384 else if (code
== TEMPLATE_PARM_INDEX
)
14385 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14386 else if (TREE_CODE_CLASS (code
) == 'd')
14388 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14393 ggc_mark_tree (ld
->decl_flags
.access
);
14394 ggc_mark_tree (ld
->decl_flags
.context
);
14395 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14396 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14397 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14399 ggc_mark_tree (ld
->main_decl_variant
);
14400 ggc_mark_tree (ld
->befriending_classes
);
14401 ggc_mark_tree (ld
->saved_tree
);
14402 if (TREE_CODE (t
) == TYPE_DECL
)
14403 ggc_mark_tree (ld
->u
.sorted_fields
);
14407 else if (TREE_CODE_CLASS (code
) == 't')
14409 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14411 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14412 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14415 ggc_mark_tree (lt
->vfields
);
14416 ggc_mark_tree (lt
->vbases
);
14417 ggc_mark_tree (lt
->tags
);
14418 ggc_mark_tree (lt
->search_slot
);
14419 ggc_mark_tree (lt
->size
);
14420 ggc_mark_tree (lt
->abstract_virtuals
);
14421 ggc_mark_tree (lt
->friend_classes
);
14422 ggc_mark_tree (lt
->rtti
);
14423 ggc_mark_tree (lt
->methods
);
14424 ggc_mark_tree (lt
->template_info
);
14425 ggc_mark_tree (lt
->befriending_classes
);
14428 /* In the case of pointer-to-member function types, the
14429 TYPE_LANG_SPECIFIC is really just a tree. */
14430 ggc_mark_tree ((tree
) lt
);