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 check_initializer
PROTO((tree
, tree
));
173 static void make_rtl_for_nonlocal_decl
PROTO((tree
, tree
, const char *));
174 static void push_cp_function_context
PROTO((struct function
*));
175 static void pop_cp_function_context
PROTO((struct function
*));
176 static void mark_binding_level
PROTO((void *));
177 static void mark_cp_function_context
PROTO((struct function
*));
178 static void mark_saved_scope
PROTO((void *));
179 static void check_function_type
PROTO((tree
));
180 static void destroy_local_static
PROTO((tree
));
181 static void destroy_local_var
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 /* We build up the list in reverse order, and reverse it later if
973 TREE_CHAIN (decl
) = b
->names
;
977 /* Bind DECL to ID in the current_binding_level, assumed to be a local
978 binding level. If PUSH_USING is set in FLAGS, we know that DECL
979 doesn't really belong to this binding level, that it got here
980 through a using-declaration. */
983 push_local_binding (id
, decl
, flags
)
988 struct binding_level
*b
;
990 /* Skip over any local classes. This makes sense if we call
991 push_local_binding with a friend decl of a local class. */
992 b
= current_binding_level
;
993 while (b
->parm_flag
== 2)
996 if (lookup_name_current_level (id
))
998 /* Supplement the existing binding. */
999 if (!add_binding (id
, decl
))
1000 /* It didn't work. Something else must be bound at this
1001 level. Do not add DECL to the list of things to pop
1006 /* Create a new binding. */
1007 push_binding (id
, decl
, b
);
1009 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1010 /* We must put the OVERLOAD into a TREE_LIST since the
1011 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1012 decls that got here through a using-declaration. */
1013 decl
= build_tree_list (NULL_TREE
, decl
);
1015 /* And put DECL on the list of things declared by the current
1017 add_decl_to_level (decl
, b
);
1020 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1021 binding was successful. */
1024 push_class_binding (id
, decl
)
1029 tree binding
= IDENTIFIER_BINDING (id
);
1032 /* Note that we declared this value so that we can issue an error if
1033 this an illegal redeclaration of a name already used for some
1035 note_name_declared_in_class (id
, decl
);
1037 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1038 /* Supplement the existing binding. */
1039 result
= add_binding (id
, decl
);
1041 /* Create a new binding. */
1042 push_binding (id
, decl
, class_binding_level
);
1044 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1045 class-level declaration. Note that we do not use DECL here
1046 because of the possibility of the `struct stat' hack; if DECL is
1047 a class-name or enum-name we might prefer a field-name, or some
1049 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1051 /* If this is a binding from a base class, mark it as such. */
1052 binding
= IDENTIFIER_BINDING (id
);
1053 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1055 /* Any implicit typename must be from a base-class. The
1056 context for an implicit typename declaration is always
1057 the derived class in which the lookup was done, so the checks
1058 based on the context of DECL below will not trigger. */
1059 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1060 INHERITED_VALUE_BINDING_P (binding
) = 1;
1063 if (TREE_CODE (decl
) == OVERLOAD
)
1064 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
1067 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1069 context
= DECL_REAL_CONTEXT (decl
);
1072 if (is_properly_derived_from (current_class_type
, context
))
1073 INHERITED_VALUE_BINDING_P (binding
) = 1;
1075 INHERITED_VALUE_BINDING_P (binding
) = 0;
1078 else if (BINDING_VALUE (binding
) == decl
)
1079 /* We only encounter a TREE_LIST when push_class_decls detects an
1080 ambiguity. Such an ambiguity can be overridden by a definition
1082 INHERITED_VALUE_BINDING_P (binding
) = 1;
1087 /* Remove the binding for DECL which should be the innermost binding
1091 pop_binding (id
, decl
)
1097 if (id
== NULL_TREE
)
1098 /* It's easiest to write the loops that call this function without
1099 checking whether or not the entities involved have names. We
1100 get here for such an entity. */
1103 /* Get the innermost binding for ID. */
1104 binding
= IDENTIFIER_BINDING (id
);
1106 /* The name should be bound. */
1107 my_friendly_assert (binding
!= NULL_TREE
, 0);
1109 /* The DECL will be either the ordinary binding or the type
1110 binding for this identifier. Remove that binding. */
1111 if (BINDING_VALUE (binding
) == decl
)
1112 BINDING_VALUE (binding
) = NULL_TREE
;
1113 else if (BINDING_TYPE (binding
) == decl
)
1114 BINDING_TYPE (binding
) = NULL_TREE
;
1116 my_friendly_abort (0);
1118 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1119 /* We're completely done with the innermost binding for this
1120 identifier. Unhook it from the list of bindings. */
1121 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1124 /* When a label goes out of scope, check to see if that label was used
1125 in a valid manner, and issue any appropriate warnings or errors. */
1131 tree label
= TREE_VALUE (link
);
1133 if (DECL_INITIAL (label
) == NULL_TREE
)
1135 cp_error_at ("label `%D' used but not defined", label
);
1136 /* Avoid crashing later. */
1137 define_label (input_filename
, 1, DECL_NAME (label
));
1139 else if (warn_unused
&& !TREE_USED (label
))
1140 cp_warning_at ("label `%D' defined but not used", label
);
1142 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1145 /* At the end of a function, all labels declared within the fucntion
1146 go out of scope. BLOCK is the top-level block for the
1155 /* Clear out the definitions of all label names, since their scopes
1157 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1160 /* Put the labels into the "variables" of the top-level block,
1161 so debugger can see them. */
1162 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1163 BLOCK_VARS (block
) = TREE_VALUE (link
);
1166 named_labels
= NULL_TREE
;
1169 /* Exit a binding level.
1170 Pop the level off, and restore the state of the identifier-decl mappings
1171 that were in effect when this level was entered.
1173 If KEEP == 1, this level had explicit declarations, so
1174 and create a "block" (a BLOCK node) for the level
1175 to record its declarations and subblocks for symbol table output.
1177 If FUNCTIONBODY is nonzero, this level is the body of a function,
1178 so create a block as if KEEP were set and also clear out all
1181 If REVERSE is nonzero, reverse the order of decls before putting
1182 them into the BLOCK. */
1185 poplevel (keep
, reverse
, functionbody
)
1191 /* The chain of decls was accumulated in reverse order.
1192 Put it into forward order, just for cleanliness. */
1194 int tmp
= functionbody
;
1195 int real_functionbody
= current_binding_level
->keep
== 2
1196 ? ((functionbody
= 0), tmp
) : functionbody
;
1197 tree tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1198 tree subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1199 tree block
= NULL_TREE
;
1201 int block_previously_created
;
1202 int leaving_for_scope
;
1204 if (current_binding_level
->parm_flag
== 2)
1205 return poplevel_class ();
1207 my_friendly_assert (!current_binding_level
->class_shadowed
,
1210 /* We used to use KEEP == 2 to indicate that the new block should go
1211 at the beginning of the list of blocks at this binding level,
1212 rather than the end. This hack is no longer used. */
1213 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1215 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1216 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1217 current_binding_level
->parm_flag
,
1218 current_binding_level
->keep
);
1220 if (current_binding_level
->keep
== 1)
1223 /* Get the decls in the order they were written.
1224 Usually current_binding_level->names is in reverse order.
1225 But parameter decls were previously put in forward order. */
1228 current_binding_level
->names
1229 = decls
= nreverse (current_binding_level
->names
);
1231 decls
= current_binding_level
->names
;
1233 /* Output any nested inline functions within this block
1234 if they weren't already output. */
1236 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1237 if (TREE_CODE (decl
) == FUNCTION_DECL
1238 && ! TREE_ASM_WRITTEN (decl
)
1239 && DECL_INITIAL (decl
) != NULL_TREE
1240 && TREE_ADDRESSABLE (decl
)
1241 && decl_function_context (decl
) == current_function_decl
)
1243 /* If this decl was copied from a file-scope decl
1244 on account of a block-scope extern decl,
1245 propagate TREE_ADDRESSABLE to the file-scope decl. */
1246 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1247 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1250 push_function_context ();
1251 output_inline_function (decl
);
1252 pop_function_context ();
1256 /* If there were any declarations or structure tags in that level,
1257 or if this level is a function body,
1258 create a BLOCK to record them for the life of this function. */
1261 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1262 if (block_previously_created
)
1263 block
= current_binding_level
->this_block
;
1264 else if (keep
== 1 || functionbody
)
1265 block
= make_node (BLOCK
);
1266 if (block
!= NULL_TREE
)
1268 if (block_previously_created
)
1270 if (decls
|| tags
|| subblocks
)
1272 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1273 warning ("internal compiler error: debugging info corrupted");
1275 BLOCK_VARS (block
) = decls
;
1276 BLOCK_TYPE_TAGS (block
) = tags
;
1278 /* We can have previous subblocks and new subblocks when
1279 doing fixup_gotos with complex cleanups. We chain the new
1280 subblocks onto the end of any pre-existing subblocks. */
1281 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1284 /* If we created the block earlier on, and we are just
1285 diddling it now, then it already should have a proper
1286 BLOCK_END_NOTE value associated with it. */
1290 BLOCK_VARS (block
) = decls
;
1291 BLOCK_TYPE_TAGS (block
) = tags
;
1292 BLOCK_SUBBLOCKS (block
) = subblocks
;
1293 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1295 remember_end_note (block
);
1299 /* In each subblock, record that this is its superior. */
1302 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1303 BLOCK_SUPERCONTEXT (link
) = block
;
1305 /* We still support the old for-scope rules, whereby the variables
1306 in a for-init statement were in scope after the for-statement
1307 ended. We only use the new rules in flag_new_for_scope is
1310 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1312 /* Remove declarations for all the DECLs in this level. */
1313 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1315 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1318 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1322 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1324 ns_binding
= NULL_TREE
;
1327 && (BINDING_LEVEL (outer_binding
)
1328 == current_binding_level
->level_chain
))
1329 /* We have something like:
1334 and we are leaving the `for' scope. There's no reason to
1335 keep the binding of the inner `i' in this case. */
1336 pop_binding (DECL_NAME (link
), link
);
1337 else if ((outer_binding
1338 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1341 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1342 /* Here, we have something like:
1350 We must pop the for-scope binding so we know what's a
1351 type and what isn't. */
1352 pop_binding (DECL_NAME (link
), link
);
1355 /* Mark this VAR_DECL as dead so that we can tell we left it
1356 there only for backward compatibility. */
1357 DECL_DEAD_FOR_LOCAL (link
) = 1;
1359 /* Keep track of what should of have happenned when we
1360 popped the binding. */
1361 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1362 DECL_SHADOWED_FOR_VAR (link
)
1363 = BINDING_VALUE (outer_binding
);
1365 /* Add it to the list of dead variables in the next
1366 outermost binding to that we can remove these when we
1367 leave that binding. */
1368 current_binding_level
->level_chain
->dead_vars_from_for
1369 = tree_cons (NULL_TREE
, link
,
1370 current_binding_level
->level_chain
->
1371 dead_vars_from_for
);
1373 /* Although we don't pop the CPLUS_BINDING, we do clear
1374 its BINDING_LEVEL since the level is going away now. */
1375 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1381 /* Remove the binding. */
1383 if (TREE_CODE (decl
) == TREE_LIST
)
1384 decl
= TREE_VALUE (decl
);
1385 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1386 pop_binding (DECL_NAME (decl
), decl
);
1387 else if (TREE_CODE (decl
) == OVERLOAD
)
1388 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1390 my_friendly_abort (0);
1394 /* Remove declarations for any `for' variables from inner scopes
1395 that we kept around. */
1396 for (link
= current_binding_level
->dead_vars_from_for
;
1397 link
; link
= TREE_CHAIN (link
))
1398 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1400 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1401 for (link
= current_binding_level
->type_shadowed
;
1402 link
; link
= TREE_CHAIN (link
))
1403 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1405 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1406 for (link
= current_binding_level
->shadowed_labels
;
1408 link
= TREE_CHAIN (link
))
1411 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1412 list if a `using' declaration put them there. The debugging
1413 back-ends won't understand OVERLOAD, so we remove them here.
1414 Because the BLOCK_VARS are (temporarily) shared with
1415 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1416 popped all the bindings. */
1421 for (d
= &BLOCK_VARS (block
); *d
; )
1423 if (TREE_CODE (*d
) == TREE_LIST
)
1424 *d
= TREE_CHAIN (*d
);
1426 d
= &TREE_CHAIN (*d
);
1430 /* If the level being exited is the top level of a function,
1431 check over all the labels. */
1434 /* Since this is the top level block of a function, the vars are
1435 the function's parameters. Don't leave them in the BLOCK
1436 because they are found in the FUNCTION_DECL instead. */
1437 BLOCK_VARS (block
) = 0;
1441 /* Any uses of undefined labels now operate under constraints
1442 of next binding contour. */
1443 if (current_function
)
1445 struct binding_level
*level_chain
;
1446 level_chain
= current_binding_level
->level_chain
;
1449 struct named_label_list
*labels
;
1450 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1451 if (labels
->binding_level
== current_binding_level
)
1453 labels
->binding_level
= level_chain
;
1454 labels
->names_in_scope
= level_chain
->names
;
1459 tmp
= current_binding_level
->keep
;
1461 pop_binding_level ();
1463 DECL_INITIAL (current_function_decl
) = block
;
1466 if (!block_previously_created
)
1467 current_binding_level
->blocks
1468 = chainon (current_binding_level
->blocks
, block
);
1470 /* If we did not make a block for the level just exited,
1471 any blocks made for inner levels
1472 (since they cannot be recorded as subblocks in that level)
1473 must be carried forward so they will later become subblocks
1474 of something else. */
1476 current_binding_level
->blocks
1477 = chainon (current_binding_level
->blocks
, subblocks
);
1479 /* Take care of compiler's internal binding structures. */
1482 expand_end_bindings (getdecls (), keep
, 1);
1483 /* Each and every BLOCK node created here in `poplevel' is important
1484 (e.g. for proper debugging information) so if we created one
1485 earlier, mark it as "used". */
1487 TREE_USED (block
) = 1;
1488 block
= poplevel (keep
, reverse
, real_functionbody
);
1491 /* Each and every BLOCK node created here in `poplevel' is important
1492 (e.g. for proper debugging information) so if we created one
1493 earlier, mark it as "used". */
1495 TREE_USED (block
) = 1;
1499 /* Delete the node BLOCK from the current binding level.
1500 This is used for the block inside a stmt expr ({...})
1501 so that the block can be reinserted where appropriate. */
1504 delete_block (block
)
1508 if (current_binding_level
->blocks
== block
)
1509 current_binding_level
->blocks
= TREE_CHAIN (block
);
1510 for (t
= current_binding_level
->blocks
; t
;)
1512 if (TREE_CHAIN (t
) == block
)
1513 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1517 TREE_CHAIN (block
) = NULL_TREE
;
1518 /* Clear TREE_USED which is always set by poplevel.
1519 The flag is set again if insert_block is called. */
1520 TREE_USED (block
) = 0;
1523 /* Insert BLOCK at the end of the list of subblocks of the
1524 current binding level. This is used when a BIND_EXPR is expanded,
1525 to handle the BLOCK node inside the BIND_EXPR. */
1528 insert_block (block
)
1531 TREE_USED (block
) = 1;
1532 current_binding_level
->blocks
1533 = chainon (current_binding_level
->blocks
, block
);
1536 /* Set the BLOCK node for the innermost scope
1537 (the one we are currently in). */
1541 register tree block
;
1543 current_binding_level
->this_block
= block
;
1546 /* Do a pushlevel for class declarations. */
1551 register struct binding_level
*newlevel
;
1553 /* Reuse or create a struct for this binding level. */
1554 #if defined(DEBUG_CP_BINDING_LEVELS)
1556 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1557 if (free_binding_level
)
1558 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1560 newlevel
= free_binding_level
;
1561 free_binding_level
= free_binding_level
->level_chain
;
1564 newlevel
= make_binding_level ();
1566 #if defined(DEBUG_CP_BINDING_LEVELS)
1568 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1570 push_binding_level (newlevel
, 0, 0);
1572 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1573 class_binding_level
= current_binding_level
;
1574 class_binding_level
->parm_flag
= 2;
1577 /* ...and a poplevel for class declarations. */
1582 register struct binding_level
*level
= class_binding_level
;
1585 my_friendly_assert (level
!= 0, 354);
1587 decl_stack
= pop_stack_level (decl_stack
);
1588 /* If we're leaving a toplevel class, don't bother to do the setting
1589 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1590 shouldn't even be used when current_class_type isn't set, and second,
1591 if we don't touch it here, we're able to use the cache effect if the
1592 next time we're entering a class scope, it is the same class. */
1593 if (current_class_depth
!= 1)
1595 struct binding_level
* b
;
1597 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1598 for (shadowed
= level
->class_shadowed
;
1600 shadowed
= TREE_CHAIN (shadowed
))
1601 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1603 /* Find the next enclosing class, and recreate
1604 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1605 b
= level
->level_chain
;
1606 while (b
&& b
->parm_flag
!= 2)
1610 for (shadowed
= b
->class_shadowed
;
1612 shadowed
= TREE_CHAIN (shadowed
))
1616 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1617 while (t
&& BINDING_LEVEL (t
) != b
)
1621 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1622 = BINDING_VALUE (t
);
1626 /* Remember to save what IDENTIFIER's were bound in this scope so we
1627 can recover from cache misses. */
1629 previous_class_type
= current_class_type
;
1630 previous_class_values
= class_binding_level
->class_shadowed
;
1632 for (shadowed
= level
->type_shadowed
;
1634 shadowed
= TREE_CHAIN (shadowed
))
1635 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1637 /* Remove the bindings for all of the class-level declarations. */
1638 for (shadowed
= level
->class_shadowed
;
1640 shadowed
= TREE_CHAIN (shadowed
))
1641 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1643 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1644 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1645 class_binding_level
->parm_flag
,
1646 class_binding_level
->keep
);
1648 /* Now, pop out of the binding level which we created up in the
1649 `pushlevel_class' routine. */
1650 #if defined(DEBUG_CP_BINDING_LEVELS)
1652 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1654 pop_binding_level ();
1659 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1660 for any names in enclosing classes. */
1663 clear_identifier_class_values ()
1667 if (!class_binding_level
)
1670 for (t
= class_binding_level
->class_shadowed
;
1673 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1676 /* Returns non-zero if T is a virtual function table. */
1679 vtable_decl_p (t
, data
)
1681 void *data ATTRIBUTE_UNUSED
;
1683 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1686 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1690 vtype_decl_p (t
, data
)
1692 void *data ATTRIBUTE_UNUSED
;
1694 return (TREE_CODE (t
) == TYPE_DECL
1695 && TREE_TYPE (t
) != error_mark_node
1696 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1697 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1700 /* Return the declarations that are members of the namespace NS. */
1703 cp_namespace_decls (ns
)
1706 return NAMESPACE_LEVEL (ns
)->names
;
1709 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1710 itself, calling F for each. The DATA is passed to F as well. */
1713 walk_namespaces_r (namespace, f
, data
)
1715 walk_namespaces_fn f
;
1721 result
|= (*f
) (namespace, data
);
1723 for (current
= cp_namespace_decls (namespace);
1725 current
= TREE_CHAIN (current
))
1727 if (TREE_CODE (current
) != NAMESPACE_DECL
1728 || DECL_NAMESPACE_ALIAS (current
))
1730 if (!DECL_LANG_SPECIFIC (current
))
1733 my_friendly_assert (current
== std_node
, 393);
1737 /* We found a namespace. */
1738 result
|= walk_namespaces_r (current
, f
, data
);
1744 /* Walk all the namespaces, calling F for each. The DATA is passed to
1748 walk_namespaces (f
, data
)
1749 walk_namespaces_fn f
;
1752 return walk_namespaces_r (global_namespace
, f
, data
);
1755 struct walk_globals_data
{
1756 walk_globals_pred p
;
1761 /* Walk the global declarations in NAMESPACE. Whenever one is found
1762 for which P returns non-zero, call F with its address. If any call
1763 to F returns a non-zero value, return a non-zero value. */
1766 walk_globals_r (namespace, data
)
1770 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1771 walk_globals_pred p
= wgd
->p
;
1772 walk_globals_fn f
= wgd
->f
;
1773 void *d
= wgd
->data
;
1777 t
= &NAMESPACE_LEVEL (namespace)->names
;
1784 result
|= (*f
) (t
, d
);
1786 /* If F changed *T, then *T still points at the next item to
1789 t
= &TREE_CHAIN (*t
);
1795 /* Walk the global declarations. Whenever one is found for which P
1796 returns non-zero, call F with its address. If any call to F
1797 returns a non-zero value, return a non-zero value. */
1800 walk_globals (p
, f
, data
)
1801 walk_globals_pred p
;
1805 struct walk_globals_data wgd
;
1810 return walk_namespaces (walk_globals_r
, &wgd
);
1813 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1814 DATA is non-NULL, this is the last time we will call
1815 wrapup_global_declarations for this NAMESPACE. */
1818 wrapup_globals_for_namespace (namespace, data
)
1822 tree globals
= cp_namespace_decls (namespace);
1823 int len
= list_length (globals
);
1824 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1828 int last_time
= (data
!= 0);
1830 if (last_time
&& namespace == global_namespace
)
1831 /* Let compile_file handle the global namespace. */
1834 /* Process the decls in reverse order--earliest first.
1835 Put them into VEC from back to front, then take out from front. */
1837 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1838 vec
[len
- i
- 1] = decl
;
1842 check_global_declarations (vec
, len
);
1846 /* Temporarily mark vtables as external. That prevents
1847 wrapup_global_declarations from writing them out; we must process
1848 them ourselves in finish_vtable_vardecl. */
1849 for (i
= 0; i
< len
; ++i
)
1850 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1852 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1853 DECL_EXTERNAL (vec
[i
]) = 1;
1856 /* Write out any globals that need to be output. */
1857 result
= wrapup_global_declarations (vec
, len
);
1859 /* Undo the hack to DECL_EXTERNAL above. */
1860 for (i
= 0; i
< len
; ++i
)
1861 if (vtable_decl_p (vec
[i
], /*data=*/0)
1862 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1864 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1865 DECL_EXTERNAL (vec
[i
]) = 0;
1872 /* Mark ARG (which is really a struct binding_level **) for GC. */
1875 mark_binding_level (arg
)
1878 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1882 ggc_mark_tree (lvl
->names
);
1883 ggc_mark_tree (lvl
->tags
);
1884 ggc_mark_tree (lvl
->usings
);
1885 ggc_mark_tree (lvl
->using_directives
);
1886 ggc_mark_tree (lvl
->class_shadowed
);
1887 ggc_mark_tree (lvl
->type_shadowed
);
1888 ggc_mark_tree (lvl
->shadowed_labels
);
1889 ggc_mark_tree (lvl
->blocks
);
1890 ggc_mark_tree (lvl
->this_block
);
1891 ggc_mark_tree (lvl
->incomplete
);
1892 ggc_mark_tree (lvl
->dead_vars_from_for
);
1894 lvl
= lvl
->level_chain
;
1898 /* For debugging. */
1899 static int no_print_functions
= 0;
1900 static int no_print_builtins
= 0;
1903 print_binding_level (lvl
)
1904 struct binding_level
*lvl
;
1908 fprintf (stderr
, " blocks=");
1909 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1910 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1911 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1912 if (lvl
->tag_transparent
)
1913 fprintf (stderr
, " tag-transparent");
1914 if (lvl
->more_cleanups_ok
)
1915 fprintf (stderr
, " more-cleanups-ok");
1916 if (lvl
->have_cleanups
)
1917 fprintf (stderr
, " have-cleanups");
1918 fprintf (stderr
, "\n");
1921 fprintf (stderr
, " names:\t");
1922 /* We can probably fit 3 names to a line? */
1923 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1925 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1927 if (no_print_builtins
1928 && (TREE_CODE (t
) == TYPE_DECL
)
1929 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1932 /* Function decls tend to have longer names. */
1933 if (TREE_CODE (t
) == FUNCTION_DECL
)
1940 fprintf (stderr
, "\n\t");
1943 print_node_brief (stderr
, "", t
, 0);
1944 if (t
== error_mark_node
)
1948 fprintf (stderr
, "\n");
1952 fprintf (stderr
, " tags:\t");
1954 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1956 if (TREE_PURPOSE (t
) == NULL_TREE
)
1958 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1965 fprintf (stderr
, "\n\t");
1968 if (TREE_PURPOSE (t
) == NULL_TREE
)
1970 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1971 fprintf (stderr
, ">");
1973 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1974 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1977 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1978 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1979 fprintf (stderr
, ">");
1983 fprintf (stderr
, "\n");
1985 if (lvl
->class_shadowed
)
1987 fprintf (stderr
, " class-shadowed:");
1988 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1990 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1992 fprintf (stderr
, "\n");
1994 if (lvl
->type_shadowed
)
1996 fprintf (stderr
, " type-shadowed:");
1997 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1999 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2001 fprintf (stderr
, "\n");
2006 print_other_binding_stack (stack
)
2007 struct binding_level
*stack
;
2009 struct binding_level
*level
;
2010 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2012 fprintf (stderr
, "binding level ");
2013 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2014 fprintf (stderr
, "\n");
2015 print_binding_level (level
);
2020 print_binding_stack ()
2022 struct binding_level
*b
;
2023 fprintf (stderr
, "current_binding_level=");
2024 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2025 fprintf (stderr
, "\nclass_binding_level=");
2026 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2027 fprintf (stderr
, "\nglobal_binding_level=");
2028 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2029 fprintf (stderr
, "\n");
2030 if (class_binding_level
)
2032 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2033 if (b
== current_binding_level
)
2036 b
= class_binding_level
;
2038 b
= current_binding_level
;
2041 b
= current_binding_level
;
2042 print_other_binding_stack (b
);
2043 fprintf (stderr
, "global:\n");
2044 print_binding_level (global_binding_level
);
2047 /* Namespace binding access routines: The namespace_bindings field of
2048 the identifier is polymorphic, with three possible values:
2049 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2050 indicating the BINDING_VALUE of global_namespace. */
2052 /* Check whether the a binding for the name to scope is known.
2053 Assumes that the bindings of the name are already a list
2054 of bindings. Returns the binding found, or NULL_TREE. */
2057 find_binding (name
, scope
)
2061 tree iter
, prev
= NULL_TREE
;
2063 scope
= ORIGINAL_NAMESPACE (scope
);
2065 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2066 iter
= TREE_CHAIN (iter
))
2068 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2069 if (BINDING_SCOPE (iter
) == scope
)
2071 /* Move binding found to the front of the list, so
2072 subsequent lookups will find it faster. */
2075 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2076 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2077 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2086 /* Always returns a binding for name in scope. If the
2087 namespace_bindings is not a list, convert it to one first.
2088 If no binding is found, make a new one. */
2091 binding_for_name (name
, scope
)
2095 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2098 scope
= ORIGINAL_NAMESPACE (scope
);
2100 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2102 /* Get rid of optimization for global scope. */
2103 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2104 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2105 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2107 if (b
&& (result
= find_binding (name
, scope
)))
2109 /* Not found, make a new permanent one. */
2110 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2111 result
= make_node (CPLUS_BINDING
);
2112 TREE_CHAIN (result
) = b
;
2113 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2114 BINDING_SCOPE (result
) = scope
;
2115 BINDING_TYPE (result
) = NULL_TREE
;
2116 BINDING_VALUE (result
) = NULL_TREE
;
2121 /* Return the binding value for name in scope, considering that
2122 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2125 namespace_binding (name
, scope
)
2129 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2132 if (scope
== NULL_TREE
)
2133 scope
= global_namespace
;
2134 if (TREE_CODE (b
) != CPLUS_BINDING
)
2135 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2136 name
= find_binding (name
,scope
);
2137 if (name
== NULL_TREE
)
2139 return BINDING_VALUE (name
);
2142 /* Set the binding value for name in scope. If modifying the binding
2143 of global_namespace is attempted, try to optimize it. */
2146 set_namespace_binding (name
, scope
, val
)
2153 if (scope
== NULL_TREE
)
2154 scope
= global_namespace
;
2156 if (scope
== global_namespace
)
2158 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2159 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2161 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2165 b
= binding_for_name (name
, scope
);
2166 BINDING_VALUE (b
) = val
;
2169 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2170 select a name that is unique to this compilation unit. */
2173 push_namespace (name
)
2178 int implicit_use
= 0;
2180 if (!global_namespace
)
2182 /* This must be ::. */
2183 my_friendly_assert (name
== get_identifier ("::"), 377);
2188 /* The name of anonymous namespace is unique for the translation
2190 if (!anonymous_namespace_name
)
2191 anonymous_namespace_name
= get_file_function_name ('N');
2192 name
= anonymous_namespace_name
;
2193 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2195 /* Reopening anonymous namespace. */
2199 else if (current_namespace
== global_namespace
2200 && name
== DECL_NAME (std_node
))
2207 /* Check whether this is an extended namespace definition. */
2208 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2209 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2212 if (DECL_NAMESPACE_ALIAS (d
))
2214 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2215 d
, DECL_NAMESPACE_ALIAS (d
));
2216 d
= DECL_NAMESPACE_ALIAS (d
);
2223 /* Make a new namespace, binding the name to it. */
2224 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2225 /* The global namespace is not pushed, and the global binding
2226 level is set elsewhere. */
2231 declare_namespace_level ();
2232 NAMESPACE_LEVEL (d
) = current_binding_level
;
2236 resume_binding_level (NAMESPACE_LEVEL (d
));
2239 do_using_directive (d
);
2240 /* Enter the name space. */
2241 current_namespace
= d
;
2244 /* Pop from the scope of the current namespace. */
2249 if (current_namespace
== global_namespace
)
2251 my_friendly_assert (in_std
>0, 980421);
2255 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2256 /* The binding level is not popped, as it might be re-opened later. */
2257 suspend_binding_level ();
2260 /* Push into the scope of the namespace NS, even if it is deeply
2261 nested within another namespace. */
2264 push_nested_namespace (ns
)
2267 if (ns
== global_namespace
)
2268 push_to_top_level ();
2271 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2272 push_namespace (DECL_NAME (ns
));
2276 /* Pop back from the scope of the namespace NS, which was previously
2277 entered with push_nested_namespace. */
2280 pop_nested_namespace (ns
)
2283 while (ns
!= global_namespace
)
2286 ns
= CP_DECL_CONTEXT (ns
);
2289 pop_from_top_level ();
2293 /* Subroutines for reverting temporarily to top-level for instantiation
2294 of templates and such. We actually need to clear out the class- and
2295 local-value slots of all identifiers, so that only the global values
2296 are at all visible. Simply setting current_binding_level to the global
2297 scope isn't enough, because more binding levels may be pushed. */
2298 struct saved_scope
*scope_chain
;
2300 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2303 mark_saved_scope (arg
)
2306 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2309 mark_binding_level (&t
->class_bindings
);
2310 ggc_mark_tree (t
->old_bindings
);
2311 ggc_mark_tree (t
->old_namespace
);
2312 ggc_mark_tree (t
->class_name
);
2313 ggc_mark_tree (t
->class_type
);
2314 ggc_mark_tree (t
->access_specifier
);
2315 ggc_mark_tree (t
->function_decl
);
2317 ggc_mark_tree_varray (t
->lang_base
);
2318 ggc_mark_tree (t
->lang_name
);
2319 ggc_mark_tree (t
->x_function_parms
);
2320 ggc_mark_tree (t
->template_parms
);
2321 ggc_mark_tree (t
->x_previous_class_type
);
2322 ggc_mark_tree (t
->x_previous_class_values
);
2323 mark_binding_level (&t
->bindings
);
2329 store_bindings (names
, old_bindings
)
2330 tree names
, old_bindings
;
2333 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2335 tree binding
, t1
, id
;
2337 if (TREE_CODE (t
) == TREE_LIST
)
2338 id
= TREE_PURPOSE (t
);
2343 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2344 we have no IDENTIFIER_BINDING if we have left the class
2345 scope, but cached the class-level declarations. */
2346 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2349 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2350 if (TREE_VEC_ELT (t1
, 0) == id
)
2353 binding
= make_tree_vec (4);
2357 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2358 TREE_VEC_ELT (binding
, 0) = id
;
2359 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2360 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2361 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2362 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2363 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2365 TREE_CHAIN (binding
) = old_bindings
;
2366 old_bindings
= binding
;
2370 return old_bindings
;
2374 maybe_push_to_top_level (pseudo
)
2377 struct saved_scope
*s
;
2378 struct binding_level
*b
;
2382 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2384 b
= scope_chain
? current_binding_level
: 0;
2386 /* If we're in the middle of some function, save our state. */
2387 if (current_function
)
2390 push_function_context_to (NULL_TREE
);
2395 old_bindings
= NULL_TREE
;
2396 if (scope_chain
&& previous_class_type
)
2397 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2399 /* Have to include global_binding_level, because class-level decls
2400 aren't listed anywhere useful. */
2401 for (; b
; b
= b
->level_chain
)
2405 /* Template IDs are inserted into the global level. If they were
2406 inserted into namespace level, finish_file wouldn't find them
2407 when doing pending instantiations. Therefore, don't stop at
2408 namespace level, but continue until :: . */
2409 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2412 old_bindings
= store_bindings (b
->names
, old_bindings
);
2413 /* We also need to check class_shadowed to save class-level type
2414 bindings, since pushclass doesn't fill in b->names. */
2415 if (b
->parm_flag
== 2)
2416 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2418 /* Unwind type-value slots back to top level. */
2419 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2420 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2422 s
->prev
= scope_chain
;
2423 s
->old_bindings
= old_bindings
;
2425 s
->need_pop_function_context
= need_pop
;
2426 s
->function_decl
= current_function_decl
;
2429 current_function_decl
= NULL_TREE
;
2430 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2431 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2432 current_lang_name
= lang_name_cplusplus
;
2433 strict_prototype
= strict_prototypes_lang_cplusplus
;
2434 current_namespace
= global_namespace
;
2436 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2440 push_to_top_level ()
2442 maybe_push_to_top_level (0);
2446 pop_from_top_level ()
2448 struct saved_scope
*s
= scope_chain
;
2451 /* Clear out class-level bindings cache. */
2452 if (previous_class_type
)
2453 invalidate_class_lookup_cache ();
2457 VARRAY_FREE (current_lang_base
);
2459 scope_chain
= s
->prev
;
2460 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2462 tree id
= TREE_VEC_ELT (t
, 0);
2465 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2466 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2467 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2471 if (current_lang_name
== lang_name_cplusplus
)
2472 strict_prototype
= strict_prototypes_lang_cplusplus
;
2473 else if (current_lang_name
== lang_name_c
)
2474 strict_prototype
= strict_prototypes_lang_c
;
2476 /* If we were in the middle of compiling a function, restore our
2478 if (s
->need_pop_function_context
)
2479 pop_function_context_from (NULL_TREE
);
2480 current_function_decl
= s
->function_decl
;
2485 /* Push a definition of struct, union or enum tag "name".
2486 into binding_level "b". "type" should be the type node,
2487 We assume that the tag "name" is not already defined.
2489 Note that the definition may really be just a forward reference.
2490 In that case, the TYPE_SIZE will be a NULL_TREE.
2492 C++ gratuitously puts all these tags in the name space. */
2494 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2495 record the shadowed value for this binding contour. TYPE is
2496 the type that ID maps to. */
2499 set_identifier_type_value_with_scope (id
, type
, b
)
2502 struct binding_level
*b
;
2504 if (!b
->namespace_p
)
2506 /* Shadow the marker, not the real thing, so that the marker
2507 gets restored later. */
2508 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2510 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2514 tree binding
= binding_for_name (id
, current_namespace
);
2515 BINDING_TYPE (binding
) = type
;
2516 /* Store marker instead of real type. */
2517 type
= global_type_node
;
2519 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2522 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2525 set_identifier_type_value (id
, type
)
2529 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2532 /* Return the type associated with id. */
2535 identifier_type_value (id
)
2538 /* There is no type with that name, anywhere. */
2539 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2541 /* This is not the type marker, but the real thing. */
2542 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2543 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2544 /* Have to search for it. It must be on the global level, now.
2545 Ask lookup_name not to return non-types. */
2546 id
= lookup_name_real (id
, 2, 1, 0);
2548 return TREE_TYPE (id
);
2552 /* Pop off extraneous binding levels left over due to syntax errors.
2554 We don't pop past namespaces, as they might be valid. */
2559 #ifdef DEBUG_CP_BINDING_LEVELS
2560 fprintf (stderr
, "XXX entering pop_everything ()\n");
2562 while (!toplevel_bindings_p ())
2564 if (current_binding_level
->parm_flag
== 2)
2565 pop_nested_class ();
2569 #ifdef DEBUG_CP_BINDING_LEVELS
2570 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2574 /* The type TYPE is being declared. If it is a class template, or a
2575 specialization of a class template, do any processing required and
2576 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2577 being declared a friend. B is the binding level at which this TYPE
2580 Returns the TYPE_DECL for TYPE, which may have been altered by this
2584 maybe_process_template_type_declaration (type
, globalize
, b
)
2587 struct binding_level
* b
;
2589 tree decl
= TYPE_NAME (type
);
2591 if (processing_template_parmlist
)
2592 /* You can't declare a new template type in a template parameter
2593 list. But, you can declare a non-template type:
2595 template <class A*> struct S;
2597 is a forward-declaration of `A'. */
2601 maybe_check_template_type (type
);
2603 my_friendly_assert (IS_AGGR_TYPE (type
)
2604 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2607 if (processing_template_decl
)
2609 /* This may change after the call to
2610 push_template_decl_real, but we want the original value. */
2611 tree name
= DECL_NAME (decl
);
2613 decl
= push_template_decl_real (decl
, globalize
);
2614 /* If the current binding level is the binding level for the
2615 template parameters (see the comment in
2616 begin_template_parm_list) and the enclosing level is a class
2617 scope, and we're not looking at a friend, push the
2618 declaration of the member class into the class scope. In the
2619 friend case, push_template_decl will already have put the
2620 friend into global scope, if appropriate. */
2621 if (TREE_CODE (type
) != ENUMERAL_TYPE
2622 && !globalize
&& b
->pseudo_global
2623 && b
->level_chain
->parm_flag
== 2)
2625 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2626 /* Put this tag on the list of tags for the class, since
2627 that won't happen below because B is not the class
2628 binding level, but is instead the pseudo-global level. */
2629 b
->level_chain
->tags
=
2630 tree_cons (name
, type
, b
->level_chain
->tags
);
2631 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2632 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2640 /* In C++, you don't have to write `struct S' to refer to `S'; you
2641 can just use `S'. We accomplish this by creating a TYPE_DECL as
2642 if the user had written `typedef struct S S'. Create and return
2643 the TYPE_DECL for TYPE. */
2646 create_implicit_typedef (name
, type
)
2652 decl
= build_decl (TYPE_DECL
, name
, type
);
2653 SET_DECL_ARTIFICIAL (decl
);
2654 /* There are other implicit type declarations, like the one *within*
2655 a class that allows you to write `S::S'. We must distinguish
2657 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2658 TYPE_NAME (type
) = decl
;
2663 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2664 Normally put it into the inner-most non-tag-transparent scope,
2665 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2666 The latter is needed for implicit declarations. */
2669 pushtag (name
, type
, globalize
)
2673 register struct binding_level
*b
;
2675 b
= current_binding_level
;
2676 while (b
->tag_transparent
2677 || (globalize
&& b
->parm_flag
== 2))
2680 b
->tags
= tree_cons (name
, type
, b
->tags
);
2684 /* Do C++ gratuitous typedefing. */
2685 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2687 register tree d
= NULL_TREE
;
2689 tree context
= TYPE_CONTEXT (type
);
2693 tree cs
= current_scope ();
2697 else if (cs
!= NULL_TREE
2698 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2699 /* When declaring a friend class of a local class, we want
2700 to inject the newly named class into the scope
2701 containing the local class, not the namespace scope. */
2702 context
= hack_decl_function_context (get_type_decl (cs
));
2705 context
= current_namespace
;
2707 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2708 || b
->parm_flag
== 2)
2711 if (current_lang_name
== lang_name_java
)
2712 TYPE_FOR_JAVA (type
) = 1;
2714 d
= create_implicit_typedef (name
, type
);
2715 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2717 set_identifier_type_value_with_scope (name
, type
, b
);
2719 d
= maybe_process_template_type_declaration (type
,
2722 if (b
->parm_flag
== 2)
2724 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2725 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2726 class. But if it's a member template class, we
2727 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2729 finish_member_declaration (d
);
2731 pushdecl_class_level (d
);
2734 d
= pushdecl_with_scope (d
, b
);
2736 if (ANON_AGGRNAME_P (name
))
2737 DECL_IGNORED_P (d
) = 1;
2739 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2740 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2741 if (!uses_template_parms (type
))
2742 DECL_ASSEMBLER_NAME (d
)
2743 = get_identifier (build_overload_name (type
, 1, 1));
2745 if (b
->parm_flag
== 2)
2747 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2748 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2752 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2753 /* Use the canonical TYPE_DECL for this node. */
2754 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2757 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2758 will be the tagged type we just added to the current
2759 binding level. This fake NULL-named TYPE_DECL node helps
2760 dwarfout.c to know when it needs to output a
2761 representation of a tagged type, and it also gives us a
2762 convenient place to record the "scope start" address for
2765 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2766 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2770 /* Counter used to create anonymous type names. */
2772 static int anon_cnt
= 0;
2774 /* Return an IDENTIFIER which can be used as a name for
2775 anonymous structs and unions. */
2782 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2783 return get_identifier (buf
);
2786 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2787 This keeps dbxout from getting confused. */
2792 register struct binding_level
*b
;
2794 static int last_cnt
= 0;
2796 /* Fast out if no new anon names were declared. */
2797 if (last_cnt
== anon_cnt
)
2800 b
= current_binding_level
;
2801 while (b
->tag_transparent
)
2806 /* A NULL purpose means we have already processed all tags
2807 from here to the end of the list. */
2808 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2810 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2811 TREE_PURPOSE (tags
) = NULL_TREE
;
2812 tags
= TREE_CHAIN (tags
);
2814 last_cnt
= anon_cnt
;
2817 /* Subroutine of duplicate_decls: return truthvalue of whether
2818 or not types of these decls match.
2820 For C++, we must compare the parameter list so that `int' can match
2821 `int&' in a parameter position, but `int&' is not confused with
2825 decls_match (newdecl
, olddecl
)
2826 tree newdecl
, olddecl
;
2830 if (newdecl
== olddecl
)
2833 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2834 /* If the two DECLs are not even the same kind of thing, we're not
2835 interested in their types. */
2838 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2840 tree f1
= TREE_TYPE (newdecl
);
2841 tree f2
= TREE_TYPE (olddecl
);
2842 tree p1
= TYPE_ARG_TYPES (f1
);
2843 tree p2
= TYPE_ARG_TYPES (f2
);
2845 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2846 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2847 && DECL_LANGUAGE (olddecl
) == lang_c
))
2850 /* When we parse a static member function definition,
2851 we put together a FUNCTION_DECL which thinks its type
2852 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2854 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2855 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2856 else if (TREE_CODE (f2
) == METHOD_TYPE
2857 && DECL_STATIC_FUNCTION_P (newdecl
))
2858 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2860 /* Here we must take care of the case where new default
2861 parameters are specified. Also, warn if an old
2862 declaration becomes ambiguous because default
2863 parameters may cause the two to be ambiguous. */
2864 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2866 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2867 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2869 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2873 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2875 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2878 types_match
= self_promoting_args_p (p1
);
2879 if (p1
== void_list_node
)
2880 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2882 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2883 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2885 types_match
= self_promoting_args_p (p2
);
2886 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2889 types_match
= compparms (p1
, p2
);
2894 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2896 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2897 DECL_TEMPLATE_PARMS (olddecl
)))
2900 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2903 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2904 DECL_TEMPLATE_RESULT (newdecl
));
2908 if (TREE_TYPE (newdecl
) == error_mark_node
)
2909 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2910 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2911 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2912 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2915 types_match
= comptypes (TREE_TYPE (newdecl
),
2916 TREE_TYPE (olddecl
),
2917 COMPARE_REDECLARATION
);
2923 /* If NEWDECL is `static' and an `extern' was seen previously,
2924 warn about it. (OLDDECL may be NULL_TREE; NAME contains
2925 information about previous usage as an `extern'.)
2927 Note that this does not apply to the C++ case of declaring
2928 a variable `extern const' and then later `const'.
2930 Don't complain about built-in functions, since they are beyond
2931 the user's control. */
2934 warn_extern_redeclared_static (newdecl
, olddecl
)
2935 tree newdecl
, olddecl
;
2939 static const char *explicit_extern_static_warning
2940 = "`%D' was declared `extern' and later `static'";
2941 static const char *implicit_extern_static_warning
2942 = "`%D' was declared implicitly `extern' and later `static'";
2944 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2947 name
= DECL_ASSEMBLER_NAME (newdecl
);
2948 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
2950 /* It's okay to redeclare an ANSI built-in function as static,
2951 or to declare a non-ANSI built-in function as anything. */
2952 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
2953 && olddecl
!= NULL_TREE
2954 && TREE_CODE (olddecl
) == FUNCTION_DECL
2955 && DECL_ARTIFICIAL (olddecl
)))
2957 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2958 ? implicit_extern_static_warning
2959 : explicit_extern_static_warning
, newdecl
);
2960 if (olddecl
!= NULL_TREE
)
2961 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2966 /* Handle when a new declaration NEWDECL has the same name as an old
2967 one OLDDECL in the same binding contour. Prints an error message
2970 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2971 Otherwise, return 0. */
2974 duplicate_decls (newdecl
, olddecl
)
2975 tree newdecl
, olddecl
;
2977 unsigned olddecl_uid
= DECL_UID (olddecl
);
2978 int olddecl_friend
= 0, types_match
= 0;
2979 int new_defines_function
= 0;
2981 if (newdecl
== olddecl
)
2984 types_match
= decls_match (newdecl
, olddecl
);
2986 /* If either the type of the new decl or the type of the old decl is an
2987 error_mark_node, then that implies that we have already issued an
2988 error (earlier) for some bogus type specification, and in that case,
2989 it is rather pointless to harass the user with yet more error message
2990 about the same declaration, so just pretend the types match here. */
2991 if (TREE_TYPE (newdecl
) == error_mark_node
2992 || TREE_TYPE (olddecl
) == error_mark_node
)
2995 /* Check for redeclaration and other discrepancies. */
2996 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2997 && DECL_ARTIFICIAL (olddecl
))
2999 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3001 /* If you declare a built-in or predefined function name as static,
3002 the old definition is overridden, but optionally warn this was a
3003 bad choice of name. */
3004 if (! TREE_PUBLIC (newdecl
))
3007 cp_warning ("shadowing %s function `%#D'",
3008 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3010 /* Discard the old built-in function. */
3013 /* If the built-in is not ansi, then programs can override
3014 it even globally without an error. */
3015 else if (! DECL_BUILT_IN (olddecl
))
3016 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3020 cp_error ("declaration of `%#D'", newdecl
);
3021 cp_error ("conflicts with built-in declaration `%#D'",
3026 else if (!types_match
)
3028 if ((DECL_LANGUAGE (newdecl
) == lang_c
3029 && DECL_LANGUAGE (olddecl
) == lang_c
)
3030 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3031 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3033 /* A near match; override the builtin. */
3035 if (TREE_PUBLIC (newdecl
))
3037 cp_warning ("new declaration `%#D'", newdecl
);
3038 cp_warning ("ambiguates built-in declaration `%#D'",
3041 else if (warn_shadow
)
3042 cp_warning ("shadowing %s function `%#D'",
3043 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3047 /* Discard the old built-in function. */
3051 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3053 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3054 && TREE_CODE (newdecl
) != TYPE_DECL
3055 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3056 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3057 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3058 && TREE_CODE (olddecl
) != TYPE_DECL
3059 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3060 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3063 /* We do nothing special here, because C++ does such nasty
3064 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3065 get shadowed, and know that if we need to find a TYPE_DECL
3066 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3067 slot of the identifier. */
3071 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3072 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3073 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3074 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3077 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3078 if (TREE_CODE (olddecl
) == TREE_LIST
)
3079 olddecl
= TREE_VALUE (olddecl
);
3080 cp_error_at ("previous declaration of `%#D'", olddecl
);
3082 /* New decl is completely inconsistent with the old one =>
3083 tell caller to replace the old one. */
3087 else if (!types_match
)
3089 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3090 /* These are certainly not duplicate declarations; they're
3091 from different scopes. */
3094 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3096 /* The name of a class template may not be declared to refer to
3097 any other template, class, function, object, namespace, value,
3098 or type in the same scope. */
3099 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3100 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3102 cp_error ("declaration of template `%#D'", newdecl
);
3103 cp_error_at ("conflicts with previous declaration `%#D'",
3106 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3107 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3108 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3109 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3110 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3111 DECL_TEMPLATE_PARMS (olddecl
)))
3113 cp_error ("new declaration `%#D'", newdecl
);
3114 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3118 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3120 if (DECL_LANGUAGE (newdecl
) == lang_c
3121 && DECL_LANGUAGE (olddecl
) == lang_c
)
3123 cp_error ("declaration of C function `%#D' conflicts with",
3125 cp_error_at ("previous declaration `%#D' here", olddecl
);
3127 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3128 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3130 cp_error ("new declaration `%#D'", newdecl
);
3131 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3137 /* Already complained about this, so don't do so again. */
3138 else if (current_class_type
== NULL_TREE
3139 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3141 cp_error ("conflicting types for `%#D'", newdecl
);
3142 cp_error_at ("previous declaration as `%#D'", olddecl
);
3145 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3146 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3147 && (!DECL_TEMPLATE_INFO (newdecl
)
3148 || (DECL_TI_TEMPLATE (newdecl
)
3149 != DECL_TI_TEMPLATE (olddecl
))))
3150 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3151 && (!DECL_TEMPLATE_INFO (olddecl
)
3152 || (DECL_TI_TEMPLATE (olddecl
)
3153 != DECL_TI_TEMPLATE (newdecl
))))))
3154 /* It's OK to have a template specialization and a non-template
3155 with the same type, or to have specializations of two
3156 different templates with the same type. Note that if one is a
3157 specialization, and the other is an instantiation of the same
3158 template, that we do not exit at this point. That situation
3159 can occur if we instantiate a template class, and then
3160 specialize one of its methods. This situation is legal, but
3161 the declarations must be merged in the usual way. */
3163 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3164 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3165 && !DECL_USE_TEMPLATE (newdecl
))
3166 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3167 && !DECL_USE_TEMPLATE (olddecl
))))
3168 /* One of the declarations is a template instantiation, and the
3169 other is not a template at all. That's OK. */
3171 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3172 && DECL_NAMESPACE_ALIAS (newdecl
)
3173 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3174 /* Redeclaration of namespace alias, ignore it. */
3178 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3181 cp_error (errmsg
, newdecl
);
3182 if (DECL_NAME (olddecl
) != NULL_TREE
)
3183 cp_error_at ((DECL_INITIAL (olddecl
)
3184 && namespace_bindings_p ())
3185 ? "`%#D' previously defined here"
3186 : "`%#D' previously declared here", olddecl
);
3188 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3189 && DECL_INITIAL (olddecl
) != NULL_TREE
3190 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3191 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3193 /* Prototype decl follows defn w/o prototype. */
3194 cp_warning_at ("prototype for `%#D'", newdecl
);
3195 cp_warning_at ("follows non-prototype definition here", olddecl
);
3197 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3198 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3200 /* extern "C" int foo ();
3201 int foo () { bar (); }
3203 if (current_lang_stack
3204 == &VARRAY_TREE (current_lang_base
, 0))
3205 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3208 cp_error_at ("previous declaration of `%#D' with %L linkage",
3209 olddecl
, DECL_LANGUAGE (olddecl
));
3210 cp_error ("conflicts with new declaration with %L linkage",
3211 DECL_LANGUAGE (newdecl
));
3215 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3217 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3219 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3220 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3223 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3224 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3226 for (; t1
&& t1
!= void_list_node
;
3227 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3228 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3230 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3235 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3237 cp_pedwarn_at ("after previous specification in `%#D'",
3243 cp_error ("default argument given for parameter %d of `%#D'",
3245 cp_error_at ("after previous specification in `%#D'",
3250 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3251 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3253 cp_warning ("`%#D' was used before it was declared inline",
3255 cp_warning_at ("previous non-inline declaration here",
3261 /* If new decl is `static' and an `extern' was seen previously,
3263 warn_extern_redeclared_static (newdecl
, olddecl
);
3265 /* We have committed to returning 1 at this point. */
3266 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3268 /* Now that functions must hold information normally held
3269 by field decls, there is extra work to do so that
3270 declaration information does not get destroyed during
3272 if (DECL_VINDEX (olddecl
))
3273 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3274 if (DECL_CONTEXT (olddecl
))
3275 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3276 if (DECL_CLASS_CONTEXT (olddecl
))
3277 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3278 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3279 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3280 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3281 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3282 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3283 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3284 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3285 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3287 /* Optionally warn about more than one declaration for the same
3288 name, but don't warn about a function declaration followed by a
3290 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3291 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3292 /* Don't warn about extern decl followed by definition. */
3293 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3294 /* Don't warn about friends, let add_friend take care of it. */
3295 && ! DECL_FRIEND_P (newdecl
))
3297 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3298 cp_warning_at ("previous declaration of `%D'", olddecl
);
3302 /* Deal with C++: must preserve virtual function table size. */
3303 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3305 register tree newtype
= TREE_TYPE (newdecl
);
3306 register tree oldtype
= TREE_TYPE (olddecl
);
3308 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3309 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3311 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3312 CLASSTYPE_FRIEND_CLASSES (newtype
)
3313 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3317 /* Copy all the DECL_... slots specified in the new decl
3318 except for any that we copy here from the old type. */
3319 DECL_MACHINE_ATTRIBUTES (newdecl
)
3320 = merge_machine_decl_attributes (olddecl
, newdecl
);
3322 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3324 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3325 DECL_TEMPLATE_RESULT (olddecl
)))
3326 cp_error ("invalid redeclaration of %D", newdecl
);
3327 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3328 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3329 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3330 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3337 /* Automatically handles default parameters. */
3338 tree oldtype
= TREE_TYPE (olddecl
);
3341 /* Make sure we put the new type in the same obstack as the old one. */
3343 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3345 push_permanent_obstack ();
3347 /* Merge the data types specified in the two decls. */
3348 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3350 if (TREE_CODE (newdecl
) == VAR_DECL
)
3351 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3352 /* Do this after calling `common_type' so that default
3353 parameters don't confuse us. */
3354 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3355 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3356 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3358 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3359 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3360 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3361 TYPE_RAISES_EXCEPTIONS (oldtype
));
3363 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3364 && DECL_SOURCE_LINE (olddecl
) != 0
3366 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3367 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3369 cp_error ("declaration of `%F' throws different exceptions",
3371 cp_error_at ("to previous declaration `%F'", olddecl
);
3374 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3376 /* Lay the type out, unless already done. */
3377 if (! same_type_p (newtype
, oldtype
)
3378 && TREE_TYPE (newdecl
) != error_mark_node
3379 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3380 layout_type (TREE_TYPE (newdecl
));
3382 if ((TREE_CODE (newdecl
) == VAR_DECL
3383 || TREE_CODE (newdecl
) == PARM_DECL
3384 || TREE_CODE (newdecl
) == RESULT_DECL
3385 || TREE_CODE (newdecl
) == FIELD_DECL
3386 || TREE_CODE (newdecl
) == TYPE_DECL
)
3387 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3388 layout_decl (newdecl
, 0);
3390 /* Merge the type qualifiers. */
3391 if (TREE_READONLY (newdecl
))
3392 TREE_READONLY (olddecl
) = 1;
3393 if (TREE_THIS_VOLATILE (newdecl
))
3394 TREE_THIS_VOLATILE (olddecl
) = 1;
3396 /* Merge the initialization information. */
3397 if (DECL_INITIAL (newdecl
) == NULL_TREE
3398 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3400 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3401 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3402 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3403 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3404 && DECL_LANG_SPECIFIC (newdecl
)
3405 && DECL_LANG_SPECIFIC (olddecl
))
3406 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3409 /* Merge the section attribute.
3410 We want to issue an error if the sections conflict but that must be
3411 done later in decl_attributes since we are called before attributes
3413 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3414 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3416 /* Keep the old rtl since we can safely use it. */
3417 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3421 /* If cannot merge, then use the new type and qualifiers,
3422 and don't preserve the old rtl. */
3425 /* Clean out any memory we had of the old declaration. */
3426 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3428 TREE_VALUE (oldstatic
) = error_mark_node
;
3430 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3431 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3432 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3433 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3436 /* Merge the storage class information. */
3437 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3438 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3439 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3440 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3441 if (! DECL_EXTERNAL (olddecl
))
3442 DECL_EXTERNAL (newdecl
) = 0;
3444 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3446 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3447 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3448 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3449 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3450 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3451 /* Don't really know how much of the language-specific
3452 values we should copy from old to new. */
3453 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3454 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3455 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3456 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3457 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3459 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3460 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3461 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3462 DECL_BEFRIENDING_CLASSES (newdecl
)
3463 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3464 DECL_BEFRIENDING_CLASSES (olddecl
));
3467 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3469 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3470 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3472 /* If newdecl is not a specialization, then it is not a
3473 template-related function at all. And that means that we
3474 shoud have exited above, returning 0. */
3475 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3478 if (TREE_USED (olddecl
))
3479 /* From [temp.expl.spec]:
3481 If a template, a member template or the member of a class
3482 template is explicitly specialized then that
3483 specialization shall be declared before the first use of
3484 that specialization that would cause an implicit
3485 instantiation to take place, in every translation unit in
3486 which such a use occurs. */
3487 cp_error ("explicit specialization of %D after first use",
3490 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3492 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3494 /* If either decl says `inline', this fn is inline, unless its
3495 definition was passed already. */
3496 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3497 DECL_INLINE (olddecl
) = 1;
3498 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3502 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3503 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3504 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3506 if (! types_match
|| new_defines_function
)
3508 /* These need to be copied so that the names are available.
3509 Note that if the types do match, we'll preserve inline
3510 info and other bits, but if not, we won't. */
3511 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3512 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3514 if (new_defines_function
)
3515 /* If defining a function declared with other language
3516 linkage, use the previously declared language linkage. */
3517 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3518 else if (types_match
)
3520 /* If redeclaring a builtin function, and not a definition,
3521 it stays built in. */
3522 if (DECL_BUILT_IN (olddecl
))
3524 DECL_BUILT_IN (newdecl
) = 1;
3525 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3526 /* If we're keeping the built-in definition, keep the rtl,
3527 regardless of declaration matches. */
3528 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3531 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3533 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3534 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3535 /* Previously saved insns go together with
3536 the function's previous definition. */
3537 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3538 /* Don't clear out the arguments if we're redefining a function. */
3539 if (DECL_ARGUMENTS (olddecl
))
3540 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3542 if (DECL_LANG_SPECIFIC (olddecl
))
3543 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3546 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3548 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3551 /* Now preserve various other info from the definition. */
3552 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3553 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3554 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3555 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3557 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3561 function_size
= sizeof (struct tree_decl
);
3563 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3564 (char *) olddecl
+ sizeof (struct tree_common
),
3565 function_size
- sizeof (struct tree_common
));
3567 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3569 /* If newdecl is a template instantiation, it is possible that
3570 the following sequence of events has occurred:
3572 o A friend function was declared in a class template. The
3573 class template was instantiated.
3575 o The instantiation of the friend declaration was
3576 recorded on the instantiation list, and is newdecl.
3578 o Later, however, instantiate_class_template called pushdecl
3579 on the newdecl to perform name injection. But, pushdecl in
3580 turn called duplicate_decls when it discovered that another
3581 declaration of a global function with the same name already
3584 o Here, in duplicate_decls, we decided to clobber newdecl.
3586 If we're going to do that, we'd better make sure that
3587 olddecl, and not newdecl, is on the list of
3588 instantiations so that if we try to do the instantiation
3589 again we won't get the clobbered declaration. */
3591 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3592 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3594 for (; decls
; decls
= TREE_CHAIN (decls
))
3595 if (TREE_VALUE (decls
) == newdecl
)
3596 TREE_VALUE (decls
) = olddecl
;
3601 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3602 (char *) olddecl
+ sizeof (struct tree_common
),
3603 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3604 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3607 DECL_UID (olddecl
) = olddecl_uid
;
3609 DECL_FRIEND_P (olddecl
) = 1;
3611 /* NEWDECL contains the merged attribute lists.
3612 Update OLDDECL to be the same. */
3613 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3618 /* Record a decl-node X as belonging to the current lexical scope.
3619 Check for errors (such as an incompatible declaration for the same
3620 name already seen in the same scope).
3622 Returns either X or an old decl for the same name.
3623 If an old decl is returned, it may have been smashed
3624 to agree with what X says. */
3631 register tree name
= DECL_ASSEMBLER_NAME (x
);
3632 int need_new_binding
= 1;
3634 if (DECL_TEMPLATE_PARM_P (x
))
3635 /* Template parameters have no context; they are not X::T even
3636 when declared within a class or namespace. */
3640 if (current_function_decl
&& x
!= current_function_decl
3641 /* A local declaration for a function doesn't constitute
3643 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3644 /* Don't change DECL_CONTEXT of virtual methods. */
3645 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3646 && !DECL_CONTEXT (x
))
3647 DECL_CONTEXT (x
) = current_function_decl
;
3648 if (!DECL_CONTEXT (x
))
3649 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3652 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3653 compiler wants to use. */
3654 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3655 || TREE_CODE (x
) == NAMESPACE_DECL
)
3656 name
= DECL_NAME (x
);
3661 /* Not needed...see below. */
3665 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3666 name
= TREE_OPERAND (name
, 0);
3668 /* Namespace-scoped variables are not found in the current level. */
3669 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3670 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3672 t
= lookup_name_current_level (name
);
3673 if (t
== error_mark_node
)
3675 /* error_mark_node is 0 for a while during initialization! */
3677 cp_error_at ("`%#D' used prior to declaration", x
);
3680 else if (t
!= NULL_TREE
)
3683 /* This is turned off until I have time to do it right (bpk). */
3684 /* With the code below that uses it... */
3685 file
= DECL_SOURCE_FILE (t
);
3686 line
= DECL_SOURCE_LINE (t
);
3688 if (TREE_CODE (t
) == PARM_DECL
)
3690 if (DECL_CONTEXT (t
) == NULL_TREE
)
3691 fatal ("parse errors have confused me too much");
3693 /* Check for duplicate params. */
3694 if (duplicate_decls (x
, t
))
3697 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3698 || DECL_FUNCTION_TEMPLATE_P (x
))
3699 && is_overloaded_fn (t
))
3700 /* Don't do anything just yet. */;
3701 else if (t
== wchar_decl_node
)
3703 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3704 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3706 /* Throw away the redeclaration. */
3709 else if (TREE_CODE (t
) != TREE_CODE (x
))
3711 if (duplicate_decls (x
, t
))
3714 else if (duplicate_decls (x
, t
))
3717 /* This is turned off until I have time to do it right (bpk). */
3719 /* Also warn if they did a prototype with `static' on it, but
3720 then later left the `static' off. */
3721 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3723 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3728 cp_warning ("`static' missing from declaration of `%D'",
3730 warning_with_file_and_line (file
, line
,
3731 "previous declaration of `%s'",
3732 decl_as_string (t
, 0));
3735 /* Now fix things so it'll do what they expect. */
3736 if (current_function_decl
)
3737 TREE_PUBLIC (current_function_decl
) = 0;
3739 /* Due to interference in memory reclamation (X may be
3740 obstack-deallocated at this point), we must guard against
3741 one really special case. [jason: This should be handled
3742 by start_function] */
3743 if (current_function_decl
== x
)
3744 current_function_decl
= t
;
3746 if (TREE_CODE (t
) == TYPE_DECL
)
3747 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3748 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3749 check_default_args (t
);
3753 else if (DECL_MAIN_P (x
))
3755 /* A redeclaration of main, but not a duplicate of the
3760 This function shall not be overloaded. */
3761 cp_error_at ("invalid redeclaration of `%D'", t
);
3762 cp_error ("as `%D'", x
);
3763 /* We don't try to push this declaration since that
3769 check_template_shadow (x
);
3771 /* If this is a function conjured up by the backend, massage it
3772 so it looks friendly. */
3773 if (TREE_CODE (x
) == FUNCTION_DECL
3774 && ! DECL_LANG_SPECIFIC (x
))
3776 retrofit_lang_decl (x
);
3777 DECL_LANGUAGE (x
) = lang_c
;
3780 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3782 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3783 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3785 if (!namespace_bindings_p ())
3786 /* We do not need to create a binding for this name;
3787 push_overloaded_decl will have already done so if
3789 need_new_binding
= 0;
3791 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3793 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3795 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3799 /* If declaring a type as a typedef, copy the type (unless we're
3800 at line 0), and install this TYPE_DECL as the new type's typedef
3801 name. See the extensive comment in ../c-decl.c (pushdecl). */
3802 if (TREE_CODE (x
) == TYPE_DECL
)
3804 tree type
= TREE_TYPE (x
);
3805 if (DECL_SOURCE_LINE (x
) == 0)
3807 if (TYPE_NAME (type
) == 0)
3808 TYPE_NAME (type
) = x
;
3810 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3811 /* We don't want to copy the type when all we're
3812 doing is making a TYPE_DECL for the purposes of
3814 && (!TYPE_NAME (type
)
3815 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3817 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3819 DECL_ORIGINAL_TYPE (x
) = type
;
3820 type
= build_type_copy (type
);
3821 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3822 TYPE_NAME (type
) = x
;
3823 TREE_TYPE (x
) = type
;
3828 if (type
!= error_mark_node
3830 && TYPE_IDENTIFIER (type
))
3831 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3832 current_binding_level
);
3836 /* Multiple external decls of the same identifier ought to match.
3838 We get warnings about inline functions where they are defined.
3839 We get warnings about other functions from push_overloaded_decl.
3841 Avoid duplicate warnings where they are used. */
3842 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3846 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3847 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3848 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3849 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3854 /* If different sort of thing, we already gave an error. */
3855 && TREE_CODE (decl
) == TREE_CODE (x
)
3856 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3858 cp_pedwarn ("type mismatch with previous external decl", x
);
3859 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3863 /* This name is new in its binding level.
3864 Install the new declaration and return it. */
3865 if (namespace_bindings_p ())
3867 /* Install a global value. */
3869 /* If the first global decl has external linkage,
3870 warn if we later see static one. */
3871 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3872 TREE_PUBLIC (name
) = 1;
3874 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3877 if (TREE_CODE (x
) == FUNCTION_DECL
)
3879 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3880 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3881 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3884 /* Don't forget if the function was used via an implicit decl. */
3885 if (IDENTIFIER_IMPLICIT_DECL (name
)
3886 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3889 /* Don't forget if its address was taken in that way. */
3890 if (IDENTIFIER_IMPLICIT_DECL (name
)
3891 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3892 TREE_ADDRESSABLE (x
) = 1;
3894 /* Warn about mismatches against previous implicit decl. */
3895 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3896 /* If this real decl matches the implicit, don't complain. */
3897 && ! (TREE_CODE (x
) == FUNCTION_DECL
3898 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3900 ("`%D' was previously implicitly declared to return `int'", x
);
3902 /* If new decl is `static' and an `extern' was seen previously,
3904 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3905 warn_extern_redeclared_static (x
, t
);
3909 /* Here to install a non-global value. */
3910 tree oldlocal
= IDENTIFIER_VALUE (name
);
3911 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3913 if (need_new_binding
)
3915 push_local_binding (name
, x
, 0);
3916 /* Because push_local_binding will hook X on to the
3917 current_binding_level's name list, we don't want to
3918 do that again below. */
3919 need_new_binding
= 0;
3922 /* If this is a TYPE_DECL, push it into the type value slot. */
3923 if (TREE_CODE (x
) == TYPE_DECL
)
3924 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3925 current_binding_level
);
3927 /* Clear out any TYPE_DECL shadowed by a namespace so that
3928 we won't think this is a type. The C struct hack doesn't
3929 go through namespaces. */
3930 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3931 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3932 current_binding_level
);
3934 /* If this is an extern function declaration, see if we
3935 have a global definition or declaration for the function. */
3936 if (oldlocal
== NULL_TREE
3937 && DECL_EXTERNAL (x
)
3938 && oldglobal
!= NULL_TREE
3939 && TREE_CODE (x
) == FUNCTION_DECL
3940 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3942 /* We have one. Their types must agree. */
3943 if (decls_match (x
, oldglobal
))
3947 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3948 cp_warning_at ("global declaration `%#D'", oldglobal
);
3951 /* If we have a local external declaration,
3952 and no file-scope declaration has yet been seen,
3953 then if we later have a file-scope decl it must not be static. */
3954 if (oldlocal
== NULL_TREE
3955 && oldglobal
== NULL_TREE
3956 && DECL_EXTERNAL (x
)
3958 TREE_PUBLIC (name
) = 1;
3960 if (DECL_FROM_INLINE (x
))
3961 /* Inline decls shadow nothing. */;
3963 /* Warn if shadowing an argument at the top level of the body. */
3964 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3965 && TREE_CODE (oldlocal
) == PARM_DECL
3966 /* Don't complain if it's from an enclosing function. */
3967 && DECL_CONTEXT (oldlocal
) == current_function_decl
3968 && TREE_CODE (x
) != PARM_DECL
)
3970 /* Go to where the parms should be and see if we
3972 struct binding_level
*b
= current_binding_level
->level_chain
;
3978 if (b
->parm_flag
== 1)
3979 cp_error ("declaration of `%#D' shadows a parameter", name
);
3981 else if (warn_shadow
&& oldlocal
!= NULL_TREE
3982 && current_binding_level
->is_for_scope
3983 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3985 warning ("variable `%s' shadows local",
3986 IDENTIFIER_POINTER (name
));
3987 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3989 /* Maybe warn if shadowing something else. */
3990 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
3991 /* No shadow warnings for internally generated vars. */
3992 && ! DECL_ARTIFICIAL (x
)
3993 /* No shadow warnings for vars made for inlining. */
3994 && ! DECL_FROM_INLINE (x
))
3996 const char *warnstring
= NULL
;
3998 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
3999 warnstring
= "declaration of `%s' shadows a parameter";
4000 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4001 && current_class_ptr
4002 && !TREE_STATIC (name
))
4003 warnstring
= "declaration of `%s' shadows a member of `this'";
4004 else if (oldlocal
!= NULL_TREE
)
4005 warnstring
= "declaration of `%s' shadows previous local";
4006 else if (oldglobal
!= NULL_TREE
)
4007 /* XXX shadow warnings in outer-more namespaces */
4008 warnstring
= "declaration of `%s' shadows global declaration";
4011 warning (warnstring
, IDENTIFIER_POINTER (name
));
4015 if (TREE_CODE (x
) == FUNCTION_DECL
)
4016 check_default_args (x
);
4018 /* Keep count of variables in this level with incomplete type. */
4019 if (TREE_CODE (x
) == VAR_DECL
4020 && TREE_TYPE (x
) != error_mark_node
4021 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4022 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4023 /* RTTI TD entries are created while defining the type_info. */
4024 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4025 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4026 current_binding_level
->incomplete
4027 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4030 if (need_new_binding
)
4031 add_decl_to_level (x
, current_binding_level
);
4036 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4037 caller to set DECL_CONTEXT properly. */
4040 pushdecl_with_scope (x
, level
)
4042 struct binding_level
*level
;
4044 register struct binding_level
*b
;
4045 tree function_decl
= current_function_decl
;
4047 current_function_decl
= NULL_TREE
;
4048 if (level
->parm_flag
== 2)
4050 b
= class_binding_level
;
4051 class_binding_level
= level
;
4052 pushdecl_class_level (x
);
4053 class_binding_level
= b
;
4057 b
= current_binding_level
;
4058 current_binding_level
= level
;
4060 current_binding_level
= b
;
4062 current_function_decl
= function_decl
;
4066 /* Like pushdecl, only it places X in the current namespace,
4070 pushdecl_namespace_level (x
)
4073 register struct binding_level
*b
= current_binding_level
;
4076 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4078 /* Now, the type_shadowed stack may screw us. Munge it so it does
4080 if (TREE_CODE (x
) == TYPE_DECL
)
4082 tree name
= DECL_NAME (x
);
4084 tree
*ptr
= (tree
*)0;
4085 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4087 tree shadowed
= b
->type_shadowed
;
4088 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4089 if (TREE_PURPOSE (shadowed
) == name
)
4091 ptr
= &TREE_VALUE (shadowed
);
4092 /* Can't break out of the loop here because sometimes
4093 a binding level will have duplicate bindings for
4094 PT names. It's gross, but I haven't time to fix it. */
4097 newval
= TREE_TYPE (x
);
4098 if (ptr
== (tree
*)0)
4100 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4101 up here if this is changed to an assertion. --KR */
4102 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4112 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4116 pushdecl_top_level (x
)
4119 tree cur_namespace
= current_namespace
;
4120 current_namespace
= global_namespace
;
4121 x
= pushdecl_namespace_level (x
);
4122 current_namespace
= cur_namespace
;
4126 /* Make the declaration of X appear in CLASS scope. */
4129 pushdecl_class_level (x
)
4132 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4133 scope looks for the pre-mangled name. */
4136 if (TREE_CODE (x
) == OVERLOAD
)
4137 x
= OVL_CURRENT (x
);
4138 name
= DECL_NAME (x
);
4142 push_class_level_binding (name
, x
);
4143 if (TREE_CODE (x
) == TYPE_DECL
)
4144 set_identifier_type_value (name
, TREE_TYPE (x
));
4146 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4150 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4153 pushdecl_class_level (f
);
4157 /* Enter DECL into the symbol table, if that's appropriate. Returns
4158 DECL, or a modified version thereof. */
4161 maybe_push_decl (decl
)
4164 tree type
= TREE_TYPE (decl
);
4166 /* Add this decl to the current binding level, but not if it comes
4167 from another scope, e.g. a static member variable. TEM may equal
4168 DECL or it may be a previous decl of the same name. */
4169 if ((TREE_CODE (decl
) != PARM_DECL
4170 && DECL_CONTEXT (decl
) != NULL_TREE
4171 /* Definitions of namespace members outside their namespace are
4173 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4174 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4175 || TREE_CODE (type
) == UNKNOWN_TYPE
4176 /* The declaration of a template specialization does not affect
4177 the functions available for overload resolution, so we do not
4179 || (TREE_CODE (decl
) == FUNCTION_DECL
4180 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4183 return pushdecl (decl
);
4187 /* This function is used to push the mangled decls for nested types into
4188 the appropriate scope. Previously pushdecl_top_level was used, but that
4189 is incorrect for members of local classes. */
4192 pushdecl_nonclass_level (x
)
4195 struct binding_level
*b
= current_binding_level
;
4197 my_friendly_assert (b
->parm_flag
!= 2, 180);
4200 /* Get out of template binding levels */
4201 while (b
->pseudo_global
)
4205 pushdecl_with_scope (x
, b
);
4209 /* Make the declaration(s) of X appear in CLASS scope
4210 under the name NAME. */
4213 push_class_level_binding (name
, x
)
4218 /* The class_binding_level will be NULL if x is a template
4219 parameter name in a member template. */
4220 if (!class_binding_level
)
4223 /* Make sure that this new member does not have the same name
4224 as a template parameter. */
4225 if (TYPE_BEING_DEFINED (current_class_type
))
4226 check_template_shadow (x
);
4228 /* If this declaration shadows a declaration from an enclosing
4229 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4230 we leave this class. Record the shadowed declaration here. */
4231 binding
= IDENTIFIER_BINDING (name
);
4233 && ((TREE_CODE (x
) == OVERLOAD
4234 && BINDING_VALUE (binding
)
4235 && is_overloaded_fn (BINDING_VALUE (binding
)))
4236 || INHERITED_VALUE_BINDING_P (binding
)))
4241 /* If the old binding was from a base class, and was for a tag
4242 name, slide it over to make room for the new binding. The
4243 old binding is still visible if explicitly qualified with a
4245 if (INHERITED_VALUE_BINDING_P (binding
)
4246 && BINDING_VALUE (binding
)
4247 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4248 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4249 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4251 old_decl
= BINDING_TYPE (binding
);
4252 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4253 BINDING_VALUE (binding
) = NULL_TREE
;
4254 INHERITED_VALUE_BINDING_P (binding
) = 0;
4257 old_decl
= BINDING_VALUE (binding
);
4259 /* There was already a binding for X containing fewer
4260 functions than are named in X. Find the previous
4261 declaration of X on the class-shadowed list, and update it. */
4262 for (shadow
= class_binding_level
->class_shadowed
;
4264 shadow
= TREE_CHAIN (shadow
))
4265 if (TREE_PURPOSE (shadow
) == name
4266 && TREE_TYPE (shadow
) == old_decl
)
4268 BINDING_VALUE (binding
) = x
;
4269 INHERITED_VALUE_BINDING_P (binding
) = 0;
4270 TREE_TYPE (shadow
) = x
;
4275 /* If we didn't replace an existing binding, put the binding on the
4276 stack of bindings for the identifier, and update
4277 IDENTIFIER_CLASS_VALUE. */
4278 if (push_class_binding (name
, x
))
4280 push_cache_obstack ();
4281 class_binding_level
->class_shadowed
4282 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4283 class_binding_level
->class_shadowed
);
4285 /* Record the value we are binding NAME to so that we can know
4286 what to pop later. */
4287 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4291 /* Insert another USING_DECL into the current binding level,
4292 returning this declaration. If this is a redeclaration,
4293 do nothing and return NULL_TREE. */
4296 push_using_decl (scope
, name
)
4302 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4303 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4304 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4305 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4309 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4310 DECL_INITIAL (decl
) = scope
;
4311 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4312 current_binding_level
->usings
= decl
;
4316 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4317 changed (i.e. there was already a directive), or the fresh
4318 TREE_LIST otherwise. */
4321 push_using_directive (used
)
4324 tree ud
= current_binding_level
->using_directives
;
4325 tree iter
, ancestor
;
4327 /* Check if we already have this. */
4328 if (purpose_member (used
, ud
) != NULL_TREE
)
4331 /* Recursively add all namespaces used. */
4332 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4333 push_using_directive (TREE_PURPOSE (iter
));
4335 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4336 ud
= current_binding_level
->using_directives
;
4337 ud
= tree_cons (used
, ancestor
, ud
);
4338 current_binding_level
->using_directives
= ud
;
4342 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4343 other definitions already in place. We get around this by making
4344 the value of the identifier point to a list of all the things that
4345 want to be referenced by that name. It is then up to the users of
4346 that name to decide what to do with that list.
4348 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4349 slot. It is dealt with the same way.
4351 FLAGS is a bitwise-or of the following values:
4352 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4354 PUSH_USING: DECL is being pushed as the result of a using
4357 The value returned may be a previous declaration if we guessed wrong
4358 about what language DECL should belong to (C or C++). Otherwise,
4359 it's always DECL (and never something that's not a _DECL). */
4362 push_overloaded_decl (decl
, flags
)
4366 tree name
= DECL_NAME (decl
);
4369 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4372 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4374 old
= lookup_name_current_level (name
);
4378 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4380 tree t
= TREE_TYPE (old
);
4381 if (IS_AGGR_TYPE (t
) && warn_shadow
4382 && (! DECL_IN_SYSTEM_HEADER (decl
)
4383 || ! DECL_IN_SYSTEM_HEADER (old
)))
4384 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4387 else if (is_overloaded_fn (old
))
4391 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4393 tree fn
= OVL_CURRENT (tmp
);
4395 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4396 && !(flags
& PUSH_USING
)
4397 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4398 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4399 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4402 if (duplicate_decls (decl
, fn
))
4408 cp_error_at ("previous non-function declaration `%#D'", old
);
4409 cp_error ("conflicts with function declaration `%#D'", decl
);
4414 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4416 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4417 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4419 new_binding
= ovl_cons (decl
, old
);
4420 if (flags
& PUSH_USING
)
4421 OVL_USED (new_binding
) = 1;
4424 /* NAME is not ambiguous. */
4428 set_namespace_binding (name
, current_namespace
, new_binding
);
4431 /* We only create an OVERLOAD if there was a previous binding at
4432 this level, or if decl is a template. In the former case, we
4433 need to remove the old binding and replace it with the new
4434 binding. We must also run through the NAMES on the binding
4435 level where the name was bound to update the chain. */
4437 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4441 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4443 d
= &TREE_CHAIN (*d
))
4445 || (TREE_CODE (*d
) == TREE_LIST
4446 && TREE_VALUE (*d
) == old
))
4448 if (TREE_CODE (*d
) == TREE_LIST
)
4449 /* Just replace the old binding with the new. */
4450 TREE_VALUE (*d
) = new_binding
;
4452 /* Build a TREE_LIST to wrap the OVERLOAD. */
4453 *d
= tree_cons (NULL_TREE
, new_binding
,
4456 /* And update the CPLUS_BINDING node. */
4457 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4462 /* We should always find a previous binding in this case. */
4463 my_friendly_abort (0);
4466 /* Install the new binding. */
4467 push_local_binding (name
, new_binding
, flags
);
4473 /* Generate an implicit declaration for identifier FUNCTIONID
4474 as a function of type int (). Print a warning if appropriate. */
4477 implicitly_declare (functionid
)
4481 int temp
= allocation_temporary_p ();
4483 push_obstacks_nochange ();
4485 /* Save the decl permanently so we can warn if definition follows.
4486 In ANSI C, warn_implicit is usually false, so the saves little space.
4487 But in C++, it's usually true, hence the extra code. */
4488 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4489 end_temporary_allocation ();
4491 /* We used to reuse an old implicit decl here,
4492 but this loses with inline functions because it can clobber
4493 the saved decl chains. */
4494 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4496 DECL_EXTERNAL (decl
) = 1;
4497 TREE_PUBLIC (decl
) = 1;
4499 /* ANSI standard says implicit declarations are in the innermost block.
4500 So we record the decl in the standard fashion. */
4502 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4505 /* Only one warning per identifier. */
4506 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4508 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4511 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4518 /* Return zero if the declaration NEWDECL is valid
4519 when the declaration OLDDECL (assumed to be for the same name)
4520 has already been seen.
4521 Otherwise return an error message format string with a %s
4522 where the identifier should go. */
4525 redeclaration_error_message (newdecl
, olddecl
)
4526 tree newdecl
, olddecl
;
4528 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4530 /* Because C++ can put things into name space for free,
4531 constructs like "typedef struct foo { ... } foo"
4532 would look like an erroneous redeclaration. */
4533 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4536 return "redefinition of `%#D'";
4538 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4540 /* If this is a pure function, its olddecl will actually be
4541 the original initialization to `0' (which we force to call
4542 abort()). Don't complain about redefinition in this case. */
4543 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4546 /* If both functions come from different namespaces, this is not
4547 a redeclaration - this is a conflict with a used function. */
4548 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4549 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4550 return "`%D' conflicts with used function";
4552 /* We'll complain about linkage mismatches in
4553 warn_extern_redeclared_static. */
4555 /* Defining the same name twice is no good. */
4556 if (DECL_INITIAL (olddecl
) != NULL_TREE
4557 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4559 if (DECL_NAME (olddecl
) == NULL_TREE
)
4560 return "`%#D' not declared in class";
4562 return "redefinition of `%#D'";
4566 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4568 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4569 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4570 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4571 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4572 && TYPE_SIZE (TREE_TYPE (newdecl
))
4573 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4574 return "redefinition of `%#D'";
4577 else if (toplevel_bindings_p ())
4579 /* Objects declared at top level: */
4580 /* If at least one is a reference, it's ok. */
4581 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4583 /* Reject two definitions. */
4584 return "redefinition of `%#D'";
4588 /* Objects declared with block scope: */
4589 /* Reject two definitions, and reject a definition
4590 together with an external reference. */
4591 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4592 return "redeclaration of `%#D'";
4597 /* Create a new label, named ID. */
4600 make_label_decl (id
, local_p
)
4606 if (building_stmt_tree ())
4607 push_permanent_obstack ();
4608 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4609 if (building_stmt_tree ())
4612 /* Make sure every label has an rtx. */
4615 DECL_CONTEXT (decl
) = current_function_decl
;
4616 DECL_MODE (decl
) = VOIDmode
;
4617 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4619 /* Say where one reference is to the label, for the sake of the
4620 error if it is not defined. */
4621 DECL_SOURCE_LINE (decl
) = lineno
;
4622 DECL_SOURCE_FILE (decl
) = input_filename
;
4624 /* Record the fact that this identifier is bound to this label. */
4625 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4627 /* Record this label on the list of used labels so that we can check
4628 at the end of the function to see whether or not the label was
4629 actually defined. */
4630 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4631 && (named_label_uses
== NULL
4632 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4633 || named_label_uses
->label_decl
!= decl
))
4635 struct named_label_list
*new_ent
;
4637 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4638 new_ent
->label_decl
= decl
;
4639 new_ent
->names_in_scope
= current_binding_level
->names
;
4640 new_ent
->binding_level
= current_binding_level
;
4641 new_ent
->lineno_o_goto
= lineno
;
4642 new_ent
->filename_o_goto
= input_filename
;
4643 new_ent
->next
= named_label_uses
;
4644 named_label_uses
= new_ent
;
4650 /* Look for a label named ID in the current function. If one cannot
4651 be found, create one. (We keep track of used, but undefined,
4652 labels, and complain about them at the end of a function.) */
4660 /* You can't use labels at global scope. */
4661 if (current_function_decl
== NULL_TREE
)
4663 error ("label `%s' referenced outside of any function",
4664 IDENTIFIER_POINTER (id
));
4668 /* See if we've already got this label. */
4669 decl
= IDENTIFIER_LABEL_VALUE (id
);
4670 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4673 /* Record this label on the list of labels used in this function.
4674 We do this before calling make_label_decl so that we get the
4675 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4676 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4678 /* We need a new label. */
4679 decl
= make_label_decl (id
, /*local_p=*/0);
4680 /* Now fill in the information we didn't have before. */
4681 TREE_VALUE (named_labels
) = decl
;
4686 /* Declare a local label named ID. */
4689 declare_local_label (id
)
4694 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4695 this scope we can restore the old value of
4696 IDENTIFIER_TYPE_VALUE. */
4697 current_binding_level
->shadowed_labels
4698 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4699 current_binding_level
->shadowed_labels
);
4700 /* Look for the label. */
4701 decl
= make_label_decl (id
, /*local_p=*/1);
4702 /* Now fill in the information we didn't have before. */
4703 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4708 /* Define a label, specifying the location in the source file.
4709 Return the LABEL_DECL node for the label, if the definition is valid.
4710 Otherwise return 0. */
4713 define_label (filename
, line
, name
)
4718 tree decl
= lookup_label (name
);
4720 /* After labels, make any new cleanups go into their
4721 own new (temporary) binding contour. */
4722 current_binding_level
->more_cleanups_ok
= 0;
4724 if (name
== get_identifier ("wchar_t"))
4725 cp_pedwarn ("label named wchar_t");
4727 if (DECL_INITIAL (decl
) != NULL_TREE
)
4729 cp_error ("duplicate label `%D'", decl
);
4734 struct named_label_list
*uses
, *prev
;
4738 /* Mark label as having been defined. */
4739 DECL_INITIAL (decl
) = error_mark_node
;
4740 /* Say where in the source. */
4741 DECL_SOURCE_FILE (decl
) = filename
;
4742 DECL_SOURCE_LINE (decl
) = line
;
4745 uses
= named_label_uses
;
4746 while (uses
!= NULL
)
4747 if (uses
->label_decl
== decl
)
4749 struct binding_level
*b
= current_binding_level
;
4752 tree new_decls
= b
->names
;
4753 tree old_decls
= (b
== uses
->binding_level
)
4754 ? uses
->names_in_scope
: NULL_TREE
;
4755 while (new_decls
!= old_decls
)
4757 if (TREE_CODE (new_decls
) == VAR_DECL
4758 /* Don't complain about crossing initialization
4759 of internal entities. They can't be accessed,
4760 and they should be cleaned up
4761 by the time we get to the label. */
4762 && ! DECL_ARTIFICIAL (new_decls
)
4763 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4764 && pod_type_p (TREE_TYPE (new_decls
))))
4766 /* This is really only important if we're crossing
4767 an initialization. The POD stuff is just
4768 pedantry; why should it matter if the class
4769 contains a field of pointer to member type? */
4770 int problem
= (DECL_INITIAL (new_decls
)
4771 || (TYPE_NEEDS_CONSTRUCTING
4772 (TREE_TYPE (new_decls
))));
4778 cp_error ("jump to label `%D'", decl
);
4779 error_with_file_and_line
4780 (uses
->filename_o_goto
,
4781 uses
->lineno_o_goto
, " from here");
4785 cp_pedwarn ("jump to label `%D'", decl
);
4786 pedwarn_with_file_and_line
4787 (uses
->filename_o_goto
,
4788 uses
->lineno_o_goto
, " from here");
4794 cp_error_at (" crosses initialization of `%#D'",
4797 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4800 new_decls
= TREE_CHAIN (new_decls
);
4802 if (b
== uses
->binding_level
)
4804 if (b
->eh_region
&& ! saw_eh
)
4808 cp_error ("jump to label `%D'", decl
);
4809 error_with_file_and_line
4810 (uses
->filename_o_goto
,
4811 uses
->lineno_o_goto
, " from here");
4814 error (" enters exception handling block");
4821 prev
->next
= uses
->next
;
4823 named_label_uses
= uses
->next
;
4832 current_function_return_value
= NULL_TREE
;
4839 struct binding_level
*level
;
4840 struct cp_switch
*next
;
4843 static struct cp_switch
*switch_stack
;
4849 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4850 p
->level
= current_binding_level
;
4851 p
->next
= switch_stack
;
4858 switch_stack
= switch_stack
->next
;
4861 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4862 /* XXX Note decl is never actually used. (bpk) */
4865 define_case_label ()
4867 tree cleanup
= last_cleanup_this_contour ();
4868 struct binding_level
*b
= current_binding_level
;
4873 static int explained
= 0;
4874 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4875 warning ("where case label appears here");
4878 warning ("(enclose actions of previous case statements requiring");
4879 warning ("destructors in their own binding contours.)");
4884 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4886 tree new_decls
= b
->names
;
4887 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4889 if (TREE_CODE (new_decls
) == VAR_DECL
4890 /* Don't complain about crossing initialization
4891 of internal entities. They can't be accessed,
4892 and they should be cleaned up
4893 by the time we get to the label. */
4894 && ! DECL_ARTIFICIAL (new_decls
)
4895 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4896 && DECL_INITIAL (new_decls
) != error_mark_node
)
4897 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4900 error ("jump to case label");
4902 cp_error_at (" crosses initialization of `%#D'",
4908 /* After labels, make any new cleanups go into their
4909 own new (temporary) binding contour. */
4911 current_binding_level
->more_cleanups_ok
= 0;
4912 current_function_return_value
= NULL_TREE
;
4915 /* Return the list of declarations of the current level.
4916 Note that this list is in reverse order unless/until
4917 you nreverse it; and when you do nreverse it, you must
4918 store the result back using `storedecls' or you will lose. */
4923 return current_binding_level
->names
;
4926 /* Return the list of type-tags (for structs, etc) of the current level. */
4931 return current_binding_level
->tags
;
4934 /* Store the list of declarations of the current level.
4935 This is done for the parameter declarations of a function being defined,
4936 after they are modified in the light of any missing parameters. */
4942 current_binding_level
->names
= decls
;
4945 /* Similarly, store the list of tags of the current level. */
4951 current_binding_level
->tags
= tags
;
4954 /* Given NAME, an IDENTIFIER_NODE,
4955 return the structure (or union or enum) definition for that name.
4956 Searches binding levels from BINDING_LEVEL up to the global level.
4957 If THISLEVEL_ONLY is nonzero, searches only the specified context
4958 (but skips any tag-transparent contexts to find one that is
4959 meaningful for tags).
4960 FORM says which kind of type the caller wants;
4961 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4962 If the wrong kind of type is found, and it's not a template, an error is
4966 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4967 enum tree_code form
;
4969 struct binding_level
*binding_level
;
4972 register struct binding_level
*level
;
4973 /* Non-zero if, we should look past a pseudo-global level, even if
4975 int allow_pseudo_global
= 1;
4977 for (level
= binding_level
; level
; level
= level
->level_chain
)
4980 if (ANON_AGGRNAME_P (name
))
4981 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4983 /* There's no need for error checking here, because
4984 anon names are unique throughout the compilation. */
4985 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4986 return TREE_VALUE (tail
);
4988 else if (level
->namespace_p
)
4989 /* Do namespace lookup. */
4990 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
4992 tree old
= binding_for_name (name
, tail
);
4994 /* If we just skipped past a pseudo global level, even
4995 though THISLEVEL_ONLY, and we find a template class
4996 declaration, then we use the _TYPE node for the
4997 template. See the example below. */
4998 if (thislevel_only
&& !allow_pseudo_global
4999 && old
&& BINDING_VALUE (old
)
5000 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5001 old
= TREE_TYPE (BINDING_VALUE (old
));
5003 old
= BINDING_TYPE (old
);
5005 /* If it has an original type, it is a typedef, and we
5006 should not return it. */
5007 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5009 if (old
&& TREE_CODE (old
) != form
5010 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5012 cp_error ("`%#D' redeclared as %C", old
, form
);
5017 if (thislevel_only
|| tail
== global_namespace
)
5021 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5023 if (TREE_PURPOSE (tail
) == name
)
5025 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5026 /* Should tighten this up; it'll probably permit
5027 UNION_TYPE and a struct template, for example. */
5029 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5031 /* Definition isn't the kind we were looking for. */
5032 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5036 return TREE_VALUE (tail
);
5039 if (thislevel_only
&& ! level
->tag_transparent
)
5041 if (level
->pseudo_global
&& allow_pseudo_global
)
5043 /* We must deal with cases like this:
5045 template <class T> struct S;
5046 template <class T> struct S {};
5048 When looking up `S', for the second declaration, we
5049 would like to find the first declaration. But, we
5050 are in the pseudo-global level created for the
5051 template parameters, rather than the (surrounding)
5052 namespace level. Thus, we keep going one more level,
5053 even though THISLEVEL_ONLY is non-zero. */
5054 allow_pseudo_global
= 0;
5066 set_current_level_tags_transparency (tags_transparent
)
5067 int tags_transparent
;
5069 current_binding_level
->tag_transparent
= tags_transparent
;
5073 /* Given a type, find the tag that was defined for it and return the tag name.
5074 Otherwise return 0. However, the value can never be 0
5075 in the cases in which this is used.
5077 C++: If NAME is non-zero, this is the new name to install. This is
5078 done when replacing anonymous tags with real tag names. */
5081 lookup_tag_reverse (type
, name
)
5085 register struct binding_level
*level
;
5087 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5090 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5092 if (TREE_VALUE (tail
) == type
)
5095 TREE_PURPOSE (tail
) = name
;
5096 return TREE_PURPOSE (tail
);
5103 /* Look up NAME in the NAMESPACE. */
5106 lookup_namespace_name (namespace, name
)
5107 tree
namespace, name
;
5110 tree template_id
= NULL_TREE
;
5112 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5114 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5115 /* This happens for A::B<int> when B is a namespace. */
5117 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5119 /* This happens for A::B where B is a template, and there are no
5120 template arguments. */
5121 cp_error ("invalid use of `%D'", name
);
5122 return error_mark_node
;
5125 namespace = ORIGINAL_NAMESPACE (namespace);
5127 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5130 name
= TREE_OPERAND (name
, 0);
5131 if (TREE_CODE (name
) == OVERLOAD
)
5132 name
= DECL_NAME (OVL_CURRENT (name
));
5133 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5134 name
= DECL_NAME (name
);
5137 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5139 val
= make_node (CPLUS_BINDING
);
5140 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5141 return error_mark_node
;
5143 if (BINDING_VALUE (val
))
5145 val
= BINDING_VALUE (val
);
5149 if (DECL_CLASS_TEMPLATE_P (val
))
5150 val
= lookup_template_class (val
,
5151 TREE_OPERAND (template_id
, 1),
5152 /*in_decl=*/NULL_TREE
,
5153 /*context=*/NULL_TREE
,
5154 /*entering_scope=*/0);
5155 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5156 || TREE_CODE (val
) == OVERLOAD
)
5157 val
= lookup_template_function (val
,
5158 TREE_OPERAND (template_id
, 1));
5161 cp_error ("`%D::%D' is not a template",
5163 return error_mark_node
;
5167 /* If we have a single function from a using decl, pull it out. */
5168 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5169 val
= OVL_FUNCTION (val
);
5173 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5174 return error_mark_node
;
5177 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5179 static unsigned long
5187 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5188 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5193 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5196 typename_compare (k1
, k2
)
5207 d1
= TYPE_NAME (t1
);
5208 d2
= TYPE_NAME (t2
);
5210 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5211 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5212 && ((TREE_TYPE (t1
) != NULL_TREE
)
5213 == (TREE_TYPE (t2
) != NULL_TREE
))
5214 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5215 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5218 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5219 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5220 is non-NULL, this type is being created by the implicit typename
5221 extension, and BASE_TYPE is a type named `t' in some base class of
5222 `T' which depends on template parameters.
5224 Returns the new TYPENAME_TYPE. */
5227 build_typename_type (context
, name
, fullname
, base_type
)
5235 struct hash_entry
* e
;
5237 static struct hash_table ht
;
5239 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5243 static struct hash_table
*h
= &ht
;
5244 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5246 fatal ("virtual memory exhausted");
5247 ggc_add_tree_hash_table_root (&h
, 1);
5250 /* Build the TYPENAME_TYPE. */
5251 t
= make_lang_type (TYPENAME_TYPE
);
5252 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5253 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5254 TREE_TYPE (t
) = base_type
;
5256 /* Build the corresponding TYPE_DECL. */
5257 d
= build_decl (TYPE_DECL
, name
, t
);
5258 TYPE_NAME (TREE_TYPE (d
)) = d
;
5259 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5260 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5261 DECL_ARTIFICIAL (d
) = 1;
5263 /* See if we already have this type. */
5264 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5268 /* Insert the type into the table. */
5269 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5277 make_typename_type (context
, name
)
5282 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5284 if (!(TYPE_LANG_SPECIFIC (name
)
5285 && (CLASSTYPE_IS_TEMPLATE (name
)
5286 || CLASSTYPE_USE_TEMPLATE (name
))))
5287 name
= TYPE_IDENTIFIER (name
);
5289 /* Create a TEMPLATE_ID_EXPR for the type. */
5290 name
= build_nt (TEMPLATE_ID_EXPR
,
5291 CLASSTYPE_TI_TEMPLATE (name
),
5292 CLASSTYPE_TI_ARGS (name
));
5294 else if (TREE_CODE (name
) == TYPE_DECL
)
5295 name
= DECL_NAME (name
);
5299 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5301 name
= TREE_OPERAND (name
, 0);
5302 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5303 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5305 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5306 my_friendly_abort (2000);
5308 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5310 /* We can get here from typename_sub0 in the explicit_template_type
5311 expansion. Just fail. */
5312 cp_error ("no class template named `%#T' in `%#T'",
5314 return error_mark_node
;
5317 if (! uses_template_parms (context
)
5318 || currently_open_class (context
))
5320 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5322 tree tmpl
= NULL_TREE
;
5323 if (IS_AGGR_TYPE (context
))
5324 tmpl
= lookup_field (context
, name
, 0, 0);
5325 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5327 cp_error ("no class template named `%#T' in `%#T'",
5329 return error_mark_node
;
5332 return lookup_template_class (tmpl
,
5333 TREE_OPERAND (fullname
, 1),
5335 /*entering_scope=*/0);
5341 if (!IS_AGGR_TYPE (context
))
5343 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5344 return error_mark_node
;
5347 t
= lookup_field (context
, name
, 0, 1);
5349 return TREE_TYPE (t
);
5353 /* If the CONTEXT is not a template type, then either the field is
5354 there now or its never going to be. */
5355 if (!uses_template_parms (context
))
5357 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5358 return error_mark_node
;
5362 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5365 /* Select the right _DECL from multiple choices. */
5368 select_decl (binding
, flags
)
5373 val
= BINDING_VALUE (binding
);
5374 if (LOOKUP_NAMESPACES_ONLY (flags
))
5376 /* We are not interested in types. */
5377 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5382 /* If we could have a type and
5383 we have nothing or we need a type and have none. */
5384 if (BINDING_TYPE (binding
)
5385 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5386 && TREE_CODE (val
) != TYPE_DECL
)))
5387 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5388 /* Don't return non-types if we really prefer types. */
5389 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5390 && (TREE_CODE (val
) != TEMPLATE_DECL
5391 || !DECL_CLASS_TEMPLATE_P (val
)))
5397 /* Unscoped lookup of a global: iterate over current namespaces,
5398 considering using-directives. If SPACESP is non-NULL, store a list
5399 of the namespaces we've considered in it. */
5402 unqualified_namespace_lookup (name
, flags
, spacesp
)
5407 tree b
= make_node (CPLUS_BINDING
);
5408 tree initial
= current_decl_namespace();
5409 tree scope
= initial
;
5411 struct binding_level
*level
;
5412 tree val
= NULL_TREE
;
5415 *spacesp
= NULL_TREE
;
5417 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5420 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5421 val
= binding_for_name (name
, scope
);
5423 /* Initialize binding for this context. */
5424 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5425 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5427 /* Add all _DECLs seen through local using-directives. */
5428 for (level
= current_binding_level
;
5429 !level
->namespace_p
;
5430 level
= level
->level_chain
)
5431 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5432 scope
, flags
, spacesp
))
5433 /* Give up because of error. */
5434 return error_mark_node
;
5436 /* Add all _DECLs seen through global using-directives. */
5437 /* XXX local and global using lists should work equally. */
5441 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5442 scope
, flags
, spacesp
))
5443 /* Give up because of error. */
5444 return error_mark_node
;
5445 if (siter
== scope
) break;
5446 siter
= CP_DECL_CONTEXT (siter
);
5449 val
= select_decl (b
, flags
);
5450 if (scope
== global_namespace
)
5456 /* Combine prefer_type and namespaces_only into flags. */
5459 lookup_flags (prefer_type
, namespaces_only
)
5460 int prefer_type
, namespaces_only
;
5462 if (namespaces_only
)
5463 return LOOKUP_PREFER_NAMESPACES
;
5464 if (prefer_type
> 1)
5465 return LOOKUP_PREFER_TYPES
;
5466 if (prefer_type
> 0)
5467 return LOOKUP_PREFER_BOTH
;
5471 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5472 ignore it or not. Subroutine of lookup_name_real. */
5475 qualify_lookup (val
, flags
)
5479 if (val
== NULL_TREE
)
5481 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5483 if ((flags
& LOOKUP_PREFER_TYPES
)
5484 && (TREE_CODE (val
) == TYPE_DECL
5485 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5486 && DECL_CLASS_TEMPLATE_P (val
))))
5488 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5493 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5497 warn_about_implicit_typename_lookup (typename
, binding
)
5501 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5502 tree name
= DECL_NAME (typename
);
5504 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5505 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5506 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5507 && ! (TREE_CODE (binding
) == TYPE_DECL
5508 && same_type_p (TREE_TYPE (binding
), subtype
)))
5510 cp_warning ("lookup of `%D' finds `%#D'",
5512 cp_warning (" instead of `%D' from dependent base class",
5514 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5515 constructor_name (current_class_type
), name
);
5519 /* Look up NAME in the current binding level and its superiors in the
5520 namespace of variables, functions and typedefs. Return a ..._DECL
5521 node of some kind representing its definition if there is only one
5522 such declaration, or return a TREE_LIST with all the overloaded
5523 definitions if there are many, or return 0 if it is undefined.
5525 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5526 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5527 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5528 Otherwise we prefer non-TYPE_DECLs.
5530 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5531 using IDENTIFIER_CLASS_VALUE. */
5534 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5536 int prefer_type
, nonclass
, namespaces_only
;
5539 tree val
= NULL_TREE
;
5541 tree from_obj
= NULL_TREE
;
5543 int val_is_implicit_typename
= 0;
5545 /* Hack: copy flag set by parser, if set. */
5546 if (only_namespace_names
)
5547 namespaces_only
= 1;
5549 if (prefer_type
== -2)
5551 extern int looking_for_typename
;
5552 tree type
= NULL_TREE
;
5555 prefer_type
= looking_for_typename
;
5557 flags
= lookup_flags (prefer_type
, namespaces_only
);
5558 /* If the next thing is '<', class templates are types. */
5559 if (looking_for_template
)
5560 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5562 /* std:: becomes :: for now. */
5563 if (got_scope
== std_node
)
5564 got_scope
= void_type_node
;
5568 else if (got_object
!= error_mark_node
)
5573 if (type
== error_mark_node
)
5574 return error_mark_node
;
5575 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5576 type
= TREE_TYPE (type
);
5579 type
= complete_type (type
);
5581 if (TREE_CODE (type
) == VOID_TYPE
)
5582 type
= global_namespace
;
5583 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5585 val
= make_node (CPLUS_BINDING
);
5586 flags
|= LOOKUP_COMPLAIN
;
5587 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5589 val
= select_decl (val
, flags
);
5591 else if (! IS_AGGR_TYPE (type
)
5592 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5593 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5594 || TREE_CODE (type
) == TYPENAME_TYPE
)
5595 /* Someone else will give an error about this if needed. */
5597 else if (type
== current_class_type
)
5598 val
= IDENTIFIER_CLASS_VALUE (name
);
5600 val
= lookup_member (type
, name
, 0, prefer_type
);
5607 else if (got_object
&& val
)
5612 flags
= lookup_flags (prefer_type
, namespaces_only
);
5613 /* If we're not parsing, we need to complain. */
5614 flags
|= LOOKUP_COMPLAIN
;
5617 /* First, look in non-namespace scopes. */
5619 if (current_class_type
== NULL_TREE
)
5622 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5626 if (!LOCAL_BINDING_P (t
) && nonclass
)
5627 /* We're not looking for class-scoped bindings, so keep going. */
5630 /* If this is the kind of thing we're looking for, we're done. */
5631 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5632 binding
= BINDING_VALUE (t
);
5633 else if ((flags
& LOOKUP_PREFER_TYPES
)
5634 && qualify_lookup (BINDING_TYPE (t
), flags
))
5635 binding
= BINDING_TYPE (t
);
5637 binding
= NULL_TREE
;
5640 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5642 if (val_is_implicit_typename
&& !yylex
)
5643 warn_about_implicit_typename_lookup (val
, binding
);
5645 val_is_implicit_typename
5646 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5647 if (!val_is_implicit_typename
)
5652 /* Now lookup in namespace scopes. */
5653 if (!val
|| val_is_implicit_typename
)
5655 t
= unqualified_namespace_lookup (name
, flags
, 0);
5658 if (val_is_implicit_typename
&& !yylex
)
5659 warn_about_implicit_typename_lookup (val
, t
);
5667 /* This should only warn about types used in qualified-ids. */
5668 if (from_obj
&& from_obj
!= val
)
5670 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5671 && TREE_CODE (val
) == TYPE_DECL
5672 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5674 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5675 name
, got_object
, TREE_TYPE (from_obj
));
5676 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5680 /* We don't change val to from_obj if got_object depends on
5681 template parms because that breaks implicit typename for
5682 destructor calls. */
5683 if (! uses_template_parms (got_object
))
5687 /* If we have a single function from a using decl, pull it out. */
5688 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5689 val
= OVL_FUNCTION (val
);
5698 lookup_name_nonclass (name
)
5701 return lookup_name_real (name
, 0, 1, 0);
5705 lookup_function_nonclass (name
, args
)
5709 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5713 lookup_name_namespace_only (name
)
5716 /* type-or-namespace, nonclass, namespace_only */
5717 return lookup_name_real (name
, 1, 1, 1);
5721 lookup_name (name
, prefer_type
)
5725 return lookup_name_real (name
, prefer_type
, 0, 0);
5728 /* Similar to `lookup_name' but look only in the innermost non-class
5732 lookup_name_current_level (name
)
5735 struct binding_level
*b
;
5738 b
= current_binding_level
;
5739 while (b
->parm_flag
== 2)
5744 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5746 /* extern "C" function() */
5747 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5750 else if (IDENTIFIER_BINDING (name
)
5751 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5755 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5756 return IDENTIFIER_VALUE (name
);
5768 /* Like lookup_name_current_level, but for types. */
5771 lookup_type_current_level (name
)
5774 register tree t
= NULL_TREE
;
5776 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5778 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5779 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5781 struct binding_level
*b
= current_binding_level
;
5784 if (purpose_member (name
, b
->type_shadowed
))
5785 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5797 begin_only_namespace_names ()
5799 only_namespace_names
= 1;
5803 end_only_namespace_names ()
5805 only_namespace_names
= 0;
5808 /* Arrange for the user to get a source line number, even when the
5809 compiler is going down in flames, so that she at least has a
5810 chance of working around problems in the compiler. We used to
5811 call error(), but that let the segmentation fault continue
5812 through; now, it's much more passive by asking them to send the
5813 maintainers mail about the problem. */
5817 int sig ATTRIBUTE_UNUSED
;
5819 signal (SIGSEGV
, SIG_DFL
);
5821 signal (SIGIOT
, SIG_DFL
);
5824 signal (SIGILL
, SIG_DFL
);
5827 signal (SIGABRT
, SIG_DFL
);
5830 signal (SIGBUS
, SIG_DFL
);
5832 my_friendly_abort (0);
5835 /* Push the declarations of builtin types into the namespace.
5836 RID_INDEX, if < RID_MAX is the index of the builtin type
5837 in the array RID_POINTERS. NAME is the name used when looking
5838 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5841 record_builtin_type (rid_index
, name
, type
)
5846 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5847 tree tdecl
= NULL_TREE
;
5849 if ((int) rid_index
< (int) RID_MAX
)
5850 rname
= ridpointers
[(int) rid_index
];
5852 tname
= get_identifier (name
);
5854 TYPE_BUILT_IN (type
) = 1;
5858 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5859 set_identifier_type_value (tname
, NULL_TREE
);
5860 if ((int) rid_index
< (int) RID_MAX
)
5861 /* Built-in types live in the global namespace. */
5862 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5864 if (rname
!= NULL_TREE
)
5866 if (tname
!= NULL_TREE
)
5868 set_identifier_type_value (rname
, NULL_TREE
);
5869 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5873 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5874 set_identifier_type_value (rname
, NULL_TREE
);
5879 /* Record one of the standard Java types.
5880 * Declare it as having the given NAME.
5881 * If SIZE > 0, it is the size of one of the integral types;
5882 * otherwise it is the negative of the size of one of the other types. */
5885 record_builtin_java_type (name
, size
)
5891 type
= make_signed_type (size
);
5892 else if (size
> -32)
5893 { /* "__java_char" or ""__java_boolean". */
5894 type
= make_unsigned_type (-size
);
5895 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5898 { /* "__java_float" or ""__java_double". */
5899 type
= make_node (REAL_TYPE
);
5900 TYPE_PRECISION (type
) = - size
;
5903 record_builtin_type (RID_MAX
, name
, type
);
5904 decl
= TYPE_NAME (type
);
5906 /* Suppress generate debug symbol entries for these types,
5907 since for normal C++ they are just clutter.
5908 However, push_lang_context undoes this if extern "Java" is seen. */
5909 DECL_IGNORED_P (decl
) = 1;
5911 TYPE_FOR_JAVA (type
) = 1;
5915 /* Push a type into the namespace so that the back-ends ignore it. */
5918 record_unknown_type (type
, name
)
5922 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5923 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5924 DECL_IGNORED_P (decl
) = 1;
5925 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5926 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5927 TYPE_ALIGN (type
) = 1;
5928 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5931 /* Push overloaded decl, in global scope, with one argument so it
5932 can be used as a callback from define_function. */
5935 push_overloaded_decl_1 (x
)
5938 push_overloaded_decl (x
, PUSH_GLOBAL
);
5945 auto_function (name
, type
)
5948 return define_function
5949 (IDENTIFIER_POINTER (name
), type
, push_overloaded_decl_1
,
5950 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5954 /* Create the predefined scalar types of C,
5955 and some nodes representing standard constants (0, 1, (void *)0).
5956 Initialize the global binding level.
5957 Make definitions for built-in primitive functions. */
5960 init_decl_processing ()
5963 int wchar_type_size
;
5964 tree array_domain_type
;
5966 /* Have to make these distinct before we try using them. */
5967 lang_name_cplusplus
= get_identifier ("C++");
5968 lang_name_c
= get_identifier ("C");
5969 lang_name_java
= get_identifier ("Java");
5971 /* Let the back-end now how to save and restore language-specific
5972 per-function globals. */
5973 init_lang_status
= &push_cp_function_context
;
5974 free_lang_status
= &pop_cp_function_context
;
5975 mark_lang_status
= &mark_cp_function_context
;
5981 /* Create the global variables. */
5982 push_to_top_level ();
5984 /* Enter the global namespace. */
5985 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5986 push_namespace (get_identifier ("::"));
5987 global_namespace
= current_namespace
;
5988 current_lang_name
= NULL_TREE
;
5990 if (flag_strict_prototype
== 2)
5991 flag_strict_prototype
= pedantic
;
5992 if (! flag_permissive
&& ! pedantic
)
5993 flag_pedantic_errors
= 1;
5995 strict_prototypes_lang_c
= flag_strict_prototype
;
5998 current_lang_name
= lang_name_c
;
6000 current_function_decl
= NULL_TREE
;
6001 current_binding_level
= NULL_BINDING_LEVEL
;
6002 free_binding_level
= NULL_BINDING_LEVEL
;
6004 /* Because most segmentation signals can be traced back into user
6005 code, catch them and at least give the user a chance of working
6006 around compiler bugs. */
6007 signal (SIGSEGV
, signal_catch
);
6009 /* We will also catch aborts in the back-end through signal_catch and
6010 give the user a chance to see where the error might be, and to defeat
6011 aborts in the back-end when there have been errors previously in their
6014 signal (SIGIOT
, signal_catch
);
6017 signal (SIGILL
, signal_catch
);
6020 signal (SIGABRT
, signal_catch
);
6023 signal (SIGBUS
, signal_catch
);
6026 gcc_obstack_init (&decl_obstack
);
6028 build_common_tree_nodes (flag_signed_char
);
6030 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6031 TREE_TYPE (error_mark_list
) = error_mark_node
;
6033 /* Make the binding_level structure for global names. */
6035 global_binding_level
= current_binding_level
;
6036 /* The global level is the namespace level of ::. */
6037 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6038 declare_namespace_level ();
6040 this_identifier
= get_identifier (THIS_NAME
);
6041 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6042 ctor_identifier
= get_identifier (CTOR_NAME
);
6043 dtor_identifier
= get_identifier (DTOR_NAME
);
6044 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6045 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6046 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6047 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6048 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6050 /* Define `int' and `char' first so that dbx will output them first. */
6051 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6052 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6054 /* `signed' is the same as `int' */
6055 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6056 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6057 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6058 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6059 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6060 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6061 record_builtin_type (RID_MAX
, "long long unsigned int",
6062 long_long_unsigned_type_node
);
6063 record_builtin_type (RID_MAX
, "long long unsigned",
6064 long_long_unsigned_type_node
);
6065 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6066 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6067 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6070 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6072 /* Define both `signed char' and `unsigned char'. */
6073 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6074 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6076 /* `unsigned long' is the standard type for sizeof.
6077 Note that stddef.h uses `unsigned long',
6078 and this must agree, even if long and int are the same size. */
6080 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6082 /* Create the widest literal types. */
6083 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6084 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6085 widest_integer_literal_type_node
));
6087 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6088 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6089 widest_unsigned_literal_type_node
));
6091 /* These are types that type_for_size and type_for_mode use. */
6092 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6093 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6094 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6095 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6096 #if HOST_BITS_PER_WIDE_INT >= 64
6097 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6099 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6100 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6101 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6102 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6103 #if HOST_BITS_PER_WIDE_INT >= 64
6104 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6107 build_common_tree_nodes_2 (flag_short_double
);
6109 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6110 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6111 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6112 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6113 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6114 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6115 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6116 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6118 integer_two_node
= build_int_2 (2, 0);
6119 TREE_TYPE (integer_two_node
) = integer_type_node
;
6120 integer_three_node
= build_int_2 (3, 0);
6121 TREE_TYPE (integer_three_node
) = integer_type_node
;
6123 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6124 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6125 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6126 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6127 TYPE_PRECISION (boolean_type_node
) = 1;
6128 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6129 boolean_false_node
= build_int_2 (0, 0);
6130 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6131 boolean_true_node
= build_int_2 (1, 0);
6132 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6134 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6135 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6136 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6138 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6139 complex_integer_type_node
));
6140 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6141 complex_float_type_node
));
6142 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6143 complex_double_type_node
));
6144 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6145 complex_long_double_type_node
));
6147 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6149 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6150 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6151 TREE_PARMLIST (void_list_node
) = 1;
6153 /* Used for expressions that do nothing, but are not errors. */
6154 void_zero_node
= build_int_2 (0, 0);
6155 TREE_TYPE (void_zero_node
) = void_type_node
;
6157 string_type_node
= build_pointer_type (char_type_node
);
6158 const_string_type_node
6159 = build_pointer_type (build_qualified_type (char_type_node
,
6161 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6163 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6166 /* Make a type to be the domain of a few array types
6167 whose domains don't really matter.
6168 200 is small enough that it always fits in size_t
6169 and large enough that it can hold most function names for the
6170 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6171 array_domain_type
= build_index_type (build_int_2 (200, 0));
6173 /* Make a type for arrays of characters.
6174 With luck nothing will ever really depend on the length of this
6176 char_array_type_node
6177 = build_array_type (char_type_node
, array_domain_type
);
6178 /* Likewise for arrays of ints. */
6180 = build_array_type (integer_type_node
, array_domain_type
);
6182 /* This is just some anonymous class type. Nobody should ever
6183 need to look inside this envelope. */
6184 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6186 if (flag_huge_objects
)
6187 delta_type_node
= long_integer_type_node
;
6189 delta_type_node
= short_integer_type_node
;
6191 default_function_type
6192 = build_function_type (integer_type_node
, NULL_TREE
);
6194 ptr_type_node
= build_pointer_type (void_type_node
);
6196 = build_pointer_type (build_qualified_type (void_type_node
,
6198 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6201 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6203 /* C++ extensions */
6205 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6206 record_unknown_type (unknown_type_node
, "unknown type");
6208 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6209 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6211 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6213 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6215 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6216 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6218 /* This is special for C++ so functions can be overloaded. */
6220 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6221 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6222 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6223 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6225 = TREE_UNSIGNED (wchar_type_node
)
6226 ? unsigned_wchar_type_node
6227 : signed_wchar_type_node
;
6228 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6230 /* Artificial declaration of wchar_t -- can be bashed */
6231 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6233 pushdecl (wchar_decl_node
);
6235 /* This is for wide string constants. */
6236 wchar_array_type_node
6237 = build_array_type (wchar_type_node
, array_domain_type
);
6239 if (flag_vtable_thunks
)
6241 /* Make sure we get a unique function type, so we can give
6242 its pointer type a name. (This wins for gdb.) */
6243 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6244 TREE_TYPE (vfunc_type
) = integer_type_node
;
6245 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6246 layout_type (vfunc_type
);
6248 vtable_entry_type
= build_pointer_type (vfunc_type
);
6252 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6253 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6255 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6257 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6259 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6262 /* Make this part of an invisible union. */
6263 fields
[3] = copy_node (fields
[2]);
6264 TREE_TYPE (fields
[3]) = delta_type_node
;
6265 DECL_NAME (fields
[3]) = delta2_identifier
;
6266 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6267 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6268 TREE_UNSIGNED (fields
[3]) = 0;
6269 TREE_CHAIN (fields
[2]) = fields
[3];
6270 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6273 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6276 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6277 layout_type (vtbl_type_node
);
6278 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6279 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6280 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6281 layout_type (vtbl_ptr_type_node
);
6282 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6284 std_node
= build_decl (NAMESPACE_DECL
,
6285 get_identifier (flag_honor_std
? "fake std":"std"),
6287 pushdecl (std_node
);
6289 global_type_node
= make_node (LANG_TYPE
);
6290 record_unknown_type (global_type_node
, "global type");
6293 current_lang_name
= lang_name_cplusplus
;
6296 tree bad_alloc_type_node
, newtype
, deltype
;
6298 push_namespace (get_identifier ("std"));
6299 bad_alloc_type_node
= xref_tag
6300 (class_type_node
, get_identifier ("bad_alloc"), 1);
6303 newtype
= build_exception_variant
6304 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6305 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6306 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
);
6307 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6308 global_delete_fndecl
= auto_function (ansi_opname
[(int) DELETE_EXPR
],
6310 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6314 = define_function ("__pure_virtual", void_ftype
, 0, 0);
6316 /* Perform other language dependent initializations. */
6317 init_class_processing ();
6318 init_init_processing ();
6319 init_search_processing ();
6321 init_rtti_processing ();
6323 if (flag_exceptions
)
6324 init_exception_processing ();
6327 flag_inline_functions
= 0;
6330 if (! supports_one_only ())
6333 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6334 declare_function_name ();
6336 /* Prepare to check format strings against argument lists. */
6337 init_function_format_info ();
6339 /* Show we use EH for cleanups. */
6340 using_eh_for_cleanups ();
6342 print_error_function
= lang_print_error_function
;
6343 lang_get_alias_set
= &c_get_alias_set
;
6344 valid_lang_attribute
= cp_valid_lang_attribute
;
6346 /* Maintain consistency. Perhaps we should just complain if they
6347 say -fwritable-strings? */
6348 if (flag_writable_strings
)
6349 flag_const_strings
= 0;
6351 /* Add GC roots for all of our global variables. */
6352 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6353 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6354 ggc_add_tree_root (&integer_three_node
, 1);
6355 ggc_add_tree_root (&integer_two_node
, 1);
6356 ggc_add_tree_root (&signed_size_zero_node
, 1);
6357 ggc_add_tree_root (&size_one_node
, 1);
6358 ggc_add_tree_root (&size_zero_node
, 1);
6359 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6360 mark_binding_level
);
6361 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6362 ggc_add_tree_root (&static_ctors
, 1);
6363 ggc_add_tree_root (&static_dtors
, 1);
6364 ggc_add_tree_root (&lastiddecl
, 1);
6366 ggc_add_tree_root (&enum_next_value
, 1);
6367 ggc_add_tree_root (&last_function_parm_tags
, 1);
6368 ggc_add_tree_root (¤t_function_return_value
, 1);
6369 ggc_add_tree_root (¤t_function_parms
, 1);
6370 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6371 ggc_add_tree_root (&last_function_parms
, 1);
6372 ggc_add_tree_root (&error_mark_list
, 1);
6374 ggc_add_tree_root (&global_namespace
, 1);
6375 ggc_add_tree_root (&global_type_node
, 1);
6376 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6378 ggc_add_tree_root (&got_object
, 1);
6379 ggc_add_tree_root (&got_scope
, 1);
6381 ggc_add_tree_root (¤t_lang_name
, 1);
6382 ggc_add_tree_root (&static_aggregates
, 1);
6385 /* Function to print any language-specific context for an error message. */
6388 lang_print_error_function (file
)
6391 default_print_error_function (file
);
6392 maybe_print_template_context ();
6395 /* Make a definition for a builtin function named NAME and whose data type
6396 is TYPE. TYPE should be a function type with argument types.
6398 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6399 the name to be called if we can't opencode the function. */
6402 define_function (name
, type
, pfn
, library_name
)
6405 void (*pfn
) PROTO((tree
));
6406 const char *library_name
;
6408 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6409 DECL_EXTERNAL (decl
) = 1;
6410 TREE_PUBLIC (decl
) = 1;
6411 DECL_ARTIFICIAL (decl
) = 1;
6413 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6414 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6416 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6417 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6418 function in the namespace. */
6419 if (pfn
) (*pfn
) (decl
);
6421 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6422 make_function_rtl (decl
);
6427 /* Wrapper around define_function, for the benefit of
6428 c_common_nodes_and_builtins.
6429 FUNCTION_CODE tells later passes how to compile calls to this function.
6430 See tree.h for its possible values. */
6433 builtin_function (name
, type
, code
, libname
)
6436 enum built_in_function code
;
6437 const char *libname
;
6439 tree decl
= define_function (name
, type
, (void (*) PROTO((tree
)))pushdecl
,
6441 if (code
!= NOT_BUILT_IN
)
6443 DECL_BUILT_IN (decl
) = 1;
6444 DECL_FUNCTION_CODE (decl
) = code
;
6449 /* When we call finish_struct for an anonymous union, we create
6450 default copy constructors and such. But, an anonymous union
6451 shouldn't have such things; this function undoes the damage to the
6452 anonymous union type T.
6454 (The reason that we create the synthesized methods is that we don't
6455 distinguish `union { int i; }' from `typedef union { int i; } U'.
6456 The first is an anonymous union; the second is just an ordinary
6460 fixup_anonymous_aggr (t
)
6465 /* Wipe out memory of synthesized methods */
6466 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6467 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6468 TYPE_HAS_INIT_REF (t
) = 0;
6469 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6470 TYPE_HAS_ASSIGN_REF (t
) = 0;
6471 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6473 /* Splice the implicitly generated functions out of the TYPE_METHODS
6475 q
= &TYPE_METHODS (t
);
6478 if (DECL_ARTIFICIAL (*q
))
6479 *q
= TREE_CHAIN (*q
);
6481 q
= &TREE_CHAIN (*q
);
6484 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6485 function members. */
6486 if (TYPE_METHODS (t
))
6487 error ("an anonymous union cannot have function members");
6490 /* Make sure that a declaration with no declarator is well-formed, i.e.
6491 just defines a tagged type or anonymous union.
6493 Returns the type defined, if any. */
6496 check_tag_decl (declspecs
)
6500 tree ob_modifier
= NULL_TREE
;
6502 register tree t
= NULL_TREE
;
6504 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6506 register tree value
= TREE_VALUE (link
);
6512 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6514 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6518 else if (value
== ridpointers
[(int) RID_FRIEND
])
6520 if (current_class_type
== NULL_TREE
6521 || current_scope () != current_class_type
)
6522 ob_modifier
= value
;
6524 else if (value
== ridpointers
[(int) RID_STATIC
]
6525 || value
== ridpointers
[(int) RID_EXTERN
]
6526 || value
== ridpointers
[(int) RID_AUTO
]
6527 || value
== ridpointers
[(int) RID_REGISTER
]
6528 || value
== ridpointers
[(int) RID_INLINE
]
6529 || value
== ridpointers
[(int) RID_VIRTUAL
]
6530 || value
== ridpointers
[(int) RID_CONST
]
6531 || value
== ridpointers
[(int) RID_VOLATILE
]
6532 || value
== ridpointers
[(int) RID_EXPLICIT
])
6533 ob_modifier
= value
;
6537 error ("multiple types in one declaration");
6539 /* Inside a class, we might be in a friend or access declaration.
6540 Until we have a good way of detecting the latter, don't warn. */
6541 if (t
== NULL_TREE
&& ! current_class_type
)
6542 pedwarn ("declaration does not declare anything");
6544 /* Check for an anonymous union. We're careful
6545 accessing TYPE_IDENTIFIER because some built-in types, like
6546 pointer-to-member types, do not have TYPE_NAME. */
6547 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6549 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6551 /* Anonymous unions are objects, so they can have specifiers. */;
6552 SET_ANON_AGGR_TYPE_P (t
);
6554 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6555 pedwarn ("ISO C++ prohibits anonymous structs");
6558 else if (ob_modifier
)
6560 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6561 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6562 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6563 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6564 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6565 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6566 cp_error ("`%D' can only be specified for constructors",
6569 cp_error ("`%D' can only be specified for objects and functions",
6576 /* Called when a declaration is seen that contains no names to declare.
6577 If its type is a reference to a structure, union or enum inherited
6578 from a containing scope, shadow that tag name for the current scope
6579 with a forward reference.
6580 If its type defines a new named structure or union
6581 or defines an enum, it is valid but we need not do anything here.
6582 Otherwise, it is an error.
6584 C++: may have to grok the declspecs to learn about static,
6585 complain for anonymous unions. */
6588 shadow_tag (declspecs
)
6591 tree t
= check_tag_decl (declspecs
);
6594 maybe_process_partial_specialization (t
);
6596 /* This is where the variables in an anonymous union are
6597 declared. An anonymous union declaration looks like:
6599 because there is no declarator after the union, the parser
6600 sends that declaration here. */
6601 if (t
&& ANON_AGGR_TYPE_P (t
))
6603 fixup_anonymous_aggr (t
);
6605 if (TYPE_FIELDS (t
))
6607 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6609 finish_anon_union (decl
);
6614 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6617 groktypename (typename
)
6620 if (TREE_CODE (typename
) != TREE_LIST
)
6622 return grokdeclarator (TREE_VALUE (typename
),
6623 TREE_PURPOSE (typename
),
6624 TYPENAME
, 0, NULL_TREE
);
6627 /* Decode a declarator in an ordinary declaration or data definition.
6628 This is called as soon as the type information and variable name
6629 have been parsed, before parsing the initializer if any.
6630 Here we create the ..._DECL node, fill in its type,
6631 and put it on the list of decls for the current context.
6632 The ..._DECL node is returned as the value.
6634 Exception: for arrays where the length is not specified,
6635 the type is left null, to be filled in by `cp_finish_decl'.
6637 Function definitions do not come here; they go to start_function
6638 instead. However, external and forward declarations of functions
6639 do go through here. Structure field declarations are done by
6640 grokfield and not through here. */
6642 /* Set this to zero to debug not using the temporary obstack
6643 to parse initializers. */
6644 int debug_temp_inits
= 1;
6647 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6648 tree declarator
, declspecs
;
6650 tree attributes
, prefix_attributes
;
6653 register tree type
, tem
;
6655 extern int have_extern_spec
;
6656 extern int used_extern_spec
;
6660 /* See code below that used this. */
6661 int init_written
= initialized
;
6664 /* This should only be done once on the top most decl. */
6665 if (have_extern_spec
&& !used_extern_spec
)
6667 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6669 used_extern_spec
= 1;
6672 if (attributes
|| prefix_attributes
)
6673 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6675 attrlist
= NULL_TREE
;
6677 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6680 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6683 type
= TREE_TYPE (decl
);
6685 if (type
== error_mark_node
)
6689 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6690 ? DECL_CLASS_CONTEXT (decl
)
6691 : DECL_CONTEXT (decl
);
6693 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6694 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6696 /* When parsing the initializer, lookup should use the object's
6698 push_decl_namespace (context
);
6701 /* We are only interested in class contexts, later. */
6702 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6703 context
= NULL_TREE
;
6706 /* Is it valid for this decl to have an initializer at all?
6707 If not, set INITIALIZED to zero, which will indirectly
6708 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6709 switch (TREE_CODE (decl
))
6712 /* typedef foo = bar means give foo the same type as bar.
6713 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6714 Any other case of an initialization in a TYPE_DECL is an error. */
6715 if (pedantic
|| list_length (declspecs
) > 1)
6717 cp_error ("typedef `%D' is initialized", decl
);
6723 cp_error ("function `%#D' is initialized like a variable", decl
);
6733 if (! toplevel_bindings_p ()
6734 && DECL_EXTERNAL (decl
))
6735 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6737 DECL_EXTERNAL (decl
) = 0;
6738 if (toplevel_bindings_p ())
6739 TREE_STATIC (decl
) = 1;
6741 /* Tell `pushdecl' this is an initialized decl
6742 even though we don't yet have the initializer expression.
6743 Also tell `cp_finish_decl' it may store the real initializer. */
6744 DECL_INITIAL (decl
) = error_mark_node
;
6747 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6748 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6751 /* Set attributes here so if duplicate decl, will have proper attributes. */
6752 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6754 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6756 push_nested_class (context
, 2);
6758 if (TREE_CODE (decl
) == VAR_DECL
)
6760 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6761 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6762 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6765 if (DECL_CONTEXT (field
) != context
)
6767 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6768 DECL_CONTEXT (field
), DECL_NAME (decl
),
6769 context
, DECL_NAME (decl
));
6770 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6772 /* Static data member are tricky; an in-class initialization
6773 still doesn't provide a definition, so the in-class
6774 declaration will have DECL_EXTERNAL set, but will have an
6775 initialization. Thus, duplicate_decls won't warn
6776 about this situation, and so we check here. */
6777 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6778 cp_error ("duplicate initialization of %D", decl
);
6779 if (duplicate_decls (decl
, field
))
6785 tree field
= check_classfn (context
, decl
);
6786 if (field
&& duplicate_decls (decl
, field
))
6790 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6791 DECL_IN_AGGR_P (decl
) = 0;
6792 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6793 || CLASSTYPE_USE_TEMPLATE (context
))
6795 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6796 /* [temp.expl.spec] An explicit specialization of a static data
6797 member of a template is a definition if the declaration
6798 includes an initializer; otherwise, it is a declaration.
6800 We check for processing_specialization so this only applies
6801 to the new specialization syntax. */
6802 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6803 DECL_EXTERNAL (decl
) = 1;
6806 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6807 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6811 /* Enter this declaration into the symbol table. */
6812 tem
= maybe_push_decl (decl
);
6814 if (processing_template_decl
)
6816 if (at_function_scope_p ())
6817 push_permanent_obstack ();
6818 tem
= push_template_decl (tem
);
6819 if (at_function_scope_p ())
6824 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6825 /* Tell the back-end to use or not use .common as appropriate. If we say
6826 -fconserve-space, we want this to save .data space, at the expense of
6827 wrong semantics. If we say -fno-conserve-space, we want this to
6828 produce errors about redefs; to do this we force variables into the
6830 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6833 if (! processing_template_decl
)
6836 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6837 push_obstacks_nochange ();
6846 tree type
= TREE_TYPE (decl
);
6847 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6849 if (type
== error_mark_node
)
6852 /* If this type of object needs a cleanup, and control may
6853 jump past it, make a new binding level so that it is cleaned
6854 up only when it is initialized first. */
6855 if (TYPE_NEEDS_DESTRUCTOR (type
)
6856 && current_binding_level
->more_cleanups_ok
== 0)
6857 pushlevel_temporary (1);
6860 /* Is it valid for this decl to have an initializer at all?
6861 If not, set INITIALIZED to zero, which will indirectly
6862 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6864 /* Don't allow initializations for incomplete types except for
6865 arrays which might be completed by the initialization. */
6866 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6867 ; /* A complete type is ok. */
6868 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6870 cp_error ("variable `%#D' has initializer but incomplete type",
6873 type
= TREE_TYPE (decl
) = error_mark_node
;
6875 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6877 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6878 cp_error ("elements of array `%#D' have incomplete type", decl
);
6879 /* else we already gave an error in start_decl. */
6885 && TREE_CODE (decl
) != TYPE_DECL
6886 && TREE_CODE (decl
) != TEMPLATE_DECL
6887 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6889 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6890 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6892 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6894 /* Change the type so that assemble_variable will give
6895 DECL an rtl we can live with: (mem (const_int 0)). */
6896 type
= TREE_TYPE (decl
) = error_mark_node
;
6900 /* If any base type in the hierarchy of TYPE needs a constructor,
6901 then we set initialized to 1. This way any nodes which are
6902 created for the purposes of initializing this aggregate
6903 will live as long as it does. This is necessary for global
6904 aggregates which do not have their initializers processed until
6905 the end of the file. */
6906 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6911 DECL_INITIAL (decl
) = NULL_TREE
;
6914 /* Handle initialization of references.
6915 These three arguments are from `cp_finish_decl', and have the
6916 same meaning here that they do there.
6918 Quotes on semantics can be found in ARM 8.4.3. */
6921 grok_reference_init (decl
, type
, init
)
6922 tree decl
, type
, init
;
6926 if (init
== NULL_TREE
)
6928 if ((DECL_LANG_SPECIFIC (decl
) == 0
6929 || DECL_IN_AGGR_P (decl
) == 0)
6930 && ! DECL_THIS_EXTERN (decl
))
6931 cp_error ("`%D' declared as reference but not initialized", decl
);
6935 if (init
== error_mark_node
)
6938 if (TREE_CODE (init
) == CONSTRUCTOR
)
6940 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6944 if (TREE_CODE (init
) == TREE_LIST
)
6945 init
= build_compound_expr (init
);
6947 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6948 init
= convert_from_reference (init
);
6950 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6951 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6953 /* Note: default conversion is only called in very special cases. */
6954 init
= default_conversion (init
);
6957 /* Convert INIT to the reference type TYPE. This may involve the
6958 creation of a temporary, whose lifetime must be the same as that
6959 of the reference. If so, a DECL_STMT for the temporary will be
6960 added just after the DECL_STMT for DECL. That's why we don't set
6961 DECL_INITIAL for local references (instead assigning to them
6962 explicitly); we need to allow the temporary to be initialized
6964 tmp
= convert_to_reference
6965 (type
, init
, CONV_IMPLICIT
,
6966 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6968 if (tmp
== error_mark_node
)
6970 else if (tmp
!= NULL_TREE
)
6973 tmp
= save_expr (tmp
);
6974 if (building_stmt_tree ())
6976 /* Initialize the declaration. */
6977 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
6978 /* Setting TREE_SIDE_EFFECTS prevents expand_expr from
6979 omitting this expression entirely. */
6980 TREE_SIDE_EFFECTS (tmp
) = 1;
6981 finish_expr_stmt (tmp
);
6984 DECL_INITIAL (decl
) = tmp
;
6988 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
6992 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
6994 expand_static_init (decl
, DECL_INITIAL (decl
));
6995 DECL_INITIAL (decl
) = NULL_TREE
;
7000 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7001 mucking with forces it does not comprehend (i.e. initialization with a
7002 constructor). If we are at global scope and won't go into COMMON, fill
7003 it in with a dummy CONSTRUCTOR to force the variable into .data;
7004 otherwise we can use error_mark_node. */
7007 obscure_complex_init (decl
, init
)
7010 if (! flag_no_inline
&& TREE_STATIC (decl
))
7012 if (extract_init (decl
, init
))
7016 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7017 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7018 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7022 DECL_INITIAL (decl
) = error_mark_node
;
7027 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7028 array until we finish parsing the initializer. If that's the
7029 situation we're in, update DECL accordingly. */
7032 maybe_deduce_size_from_array_init (decl
, init
)
7036 tree type
= TREE_TYPE (decl
);
7038 if (TREE_CODE (type
) == ARRAY_TYPE
7039 && TYPE_DOMAIN (type
) == NULL_TREE
7040 && TREE_CODE (decl
) != TYPE_DECL
)
7043 = (TREE_STATIC (decl
)
7044 /* Even if pedantic, an external linkage array
7045 may have incomplete type at first. */
7046 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7047 : !DECL_EXTERNAL (decl
));
7048 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7049 int failure
= complete_array_type (type
, initializer
, do_default
);
7052 cp_error ("initializer fails to determine size of `%D'", decl
);
7057 cp_error ("array size missing in `%D'", decl
);
7058 /* If a `static' var's size isn't known, make it extern as
7059 well as static, so it does not get allocated. If it's not
7060 `static', then don't mark it extern; finish_incomplete_decl
7061 will give it a default size and it will get allocated. */
7062 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7063 DECL_EXTERNAL (decl
) = 1;
7066 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7067 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7069 cp_error ("zero-size array `%D'", decl
);
7071 layout_decl (decl
, 0);
7075 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7076 any appropriate error messages regarding the layout. INIT is a
7077 the initializer for DECL; returns a modified version. */
7080 layout_var_decl (decl
, init
)
7084 tree ttype
= target_type (TREE_TYPE (decl
));
7086 /* If we haven't already layed out this declaration, and we know its
7087 type, do so now. Note that we must not call complete type for an
7088 external object because it's type might involve templates that we
7089 are not supposed to isntantiate yet. */
7090 if (!DECL_EXTERNAL (decl
)
7091 && DECL_SIZE (decl
) == NULL_TREE
7092 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7093 layout_decl (decl
, 0);
7095 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7097 /* An automatic variable with an incomplete type: that is an error.
7098 Don't talk about array types here, since we took care of that
7099 message in grokdeclarator. */
7100 cp_error ("storage size of `%D' isn't known", decl
);
7101 TREE_TYPE (decl
) = error_mark_node
;
7103 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7104 /* Let debugger know it should output info for this type. */
7105 note_debug_info_needed (ttype
);
7107 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7108 note_debug_info_needed (DECL_CONTEXT (decl
));
7110 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7111 && DECL_SIZE (decl
) != NULL_TREE
7112 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7114 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7115 constant_expression_warning (DECL_SIZE (decl
));
7117 cp_error ("storage size of `%D' isn't constant", decl
);
7123 /* If a local static variable is declared in an inline function, or if
7124 we have a weak definition, we must endeavor to create only one
7125 instance of the variable at link-time. */
7128 maybe_commonize_var (decl
)
7131 /* Static data in a function with comdat linkage also has comdat
7133 if (TREE_STATIC (decl
)
7134 /* Don't mess with __FUNCTION__. */
7135 && ! TREE_ASM_WRITTEN (decl
)
7136 && current_function_decl
7137 && DECL_CONTEXT (decl
) == current_function_decl
7138 && (DECL_THIS_INLINE (current_function_decl
)
7139 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7140 && TREE_PUBLIC (current_function_decl
))
7142 /* Rather than try to get this right with inlining, we suppress
7143 inlining of such functions. */
7144 current_function_cannot_inline
7145 = "function with static variable cannot be inline";
7147 /* If flag_weak, we don't need to mess with this, as we can just
7148 make the function weak, and let it refer to its unique local
7149 copy. This works because we don't allow the function to be
7153 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7155 TREE_PUBLIC (decl
) = 1;
7156 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7158 else if (DECL_INITIAL (decl
) == NULL_TREE
7159 || DECL_INITIAL (decl
) == error_mark_node
)
7161 TREE_PUBLIC (decl
) = 1;
7162 DECL_COMMON (decl
) = 1;
7164 /* else we lose. We can only do this if we can use common,
7165 which we can't if it has been initialized. */
7167 if (TREE_PUBLIC (decl
))
7168 DECL_ASSEMBLER_NAME (decl
)
7169 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7170 else if (! DECL_ARTIFICIAL (decl
))
7172 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7173 cp_warning_at (" you can work around this by removing the initializer", decl
);
7177 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7178 /* Set it up again; we might have set DECL_INITIAL since the last
7180 comdat_linkage (decl
);
7183 /* Issue an error message if DECL is an uninitialized const variable. */
7186 check_for_uninitialized_const_var (decl
)
7189 tree type
= TREE_TYPE (decl
);
7191 /* ``Unless explicitly declared extern, a const object does not have
7192 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7194 if (TREE_CODE (decl
) == VAR_DECL
7195 && TREE_CODE (type
) != REFERENCE_TYPE
7196 && CP_TYPE_CONST_P (type
)
7197 && !TYPE_NEEDS_CONSTRUCTING (type
)
7198 && !DECL_INITIAL (decl
))
7199 cp_error ("uninitialized const `%D'", decl
);
7202 /* Verify INIT (the initializer for DECL), and record the
7203 initialization in DECL_INITIAL, if appropriate. Returns a new
7207 check_initializer (decl
, init
)
7213 if (TREE_CODE (decl
) == FIELD_DECL
)
7216 type
= TREE_TYPE (decl
);
7218 /* If `start_decl' didn't like having an initialization, ignore it now. */
7219 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7222 /* Check the initializer. */
7225 /* Things that are going to be initialized need to have complete
7227 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7229 if (type
== error_mark_node
)
7230 /* We will have already complained. */
7232 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7234 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7237 else if (TREE_CODE (type
) == ARRAY_TYPE
7238 && !TYPE_SIZE (TREE_TYPE (type
)))
7240 cp_error ("elements of array `%#D' have incomplete type", decl
);
7243 else if (!TYPE_SIZE (type
))
7245 cp_error ("`%D' has incomplete type", decl
);
7246 TREE_TYPE (decl
) = error_mark_node
;
7251 if (TREE_CODE (decl
) == CONST_DECL
)
7253 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7255 DECL_INITIAL (decl
) = init
;
7257 /* This will keep us from needing to worry about our obstacks. */
7258 my_friendly_assert (init
!= NULL_TREE
, 149);
7261 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7263 if (TREE_STATIC (decl
))
7264 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7265 grok_reference_init (decl
, type
, init
);
7270 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7272 if (TREE_CODE (type
) == ARRAY_TYPE
)
7273 init
= digest_init (type
, init
, (tree
*) 0);
7274 else if (TREE_CODE (init
) == CONSTRUCTOR
7275 && TREE_HAS_CONSTRUCTOR (init
))
7277 if (TYPE_NON_AGGREGATE_CLASS (type
))
7279 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7281 init
= error_mark_node
;
7284 goto dont_use_constructor
;
7289 dont_use_constructor
:
7290 if (TREE_CODE (init
) != TREE_VEC
)
7291 init
= store_init_value (decl
, init
);
7295 /* We must hide the initializer so that expand_decl
7296 won't try to do something it does not understand. */
7297 init
= obscure_complex_init (decl
, init
);
7299 else if (DECL_EXTERNAL (decl
))
7301 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7302 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7304 tree core_type
= strip_array_types (type
);
7306 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7308 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7309 cp_error ("structure `%D' with uninitialized const members", decl
);
7310 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7311 cp_error ("structure `%D' with uninitialized reference members",
7315 check_for_uninitialized_const_var (decl
);
7317 if (TYPE_SIZE (type
) != NULL_TREE
7318 && TYPE_NEEDS_CONSTRUCTING (type
))
7319 init
= obscure_complex_init (decl
, NULL_TREE
);
7323 check_for_uninitialized_const_var (decl
);
7328 /* If DECL is not a local variable, give it RTL. */
7331 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7334 const char *asmspec
;
7339 type
= TREE_TYPE (decl
);
7340 toplev
= toplevel_bindings_p ();
7341 push_obstacks_nochange ();
7342 if (TREE_STATIC (decl
)
7343 && TYPE_NEEDS_DESTRUCTOR (type
)
7344 && allocation_temporary_p ())
7345 end_temporary_allocation ();
7347 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7348 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7349 else if (TREE_CODE (decl
) == VAR_DECL
7350 && TREE_READONLY (decl
)
7351 && DECL_INITIAL (decl
) != NULL_TREE
7352 && DECL_INITIAL (decl
) != error_mark_node
7353 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7355 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7358 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7361 && TREE_STATIC (decl
)
7362 && ! TREE_SIDE_EFFECTS (decl
)
7363 && ! TREE_PUBLIC (decl
)
7364 && ! DECL_EXTERNAL (decl
)
7365 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7366 && DECL_MODE (decl
) != BLKmode
)
7368 /* If this variable is really a constant, then fill its DECL_RTL
7369 slot with something which won't take up storage.
7370 If something later should take its address, we can always give
7371 it legitimate RTL at that time. */
7372 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7373 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7374 TREE_ASM_WRITTEN (decl
) = 1;
7376 else if (toplev
&& ! TREE_PUBLIC (decl
))
7378 /* If this is a static const, change its apparent linkage
7379 if it belongs to a #pragma interface. */
7380 if (!interface_unknown
)
7382 TREE_PUBLIC (decl
) = 1;
7383 DECL_EXTERNAL (decl
) = interface_only
;
7385 make_decl_rtl (decl
, asmspec
, toplev
);
7388 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7390 else if (TREE_CODE (decl
) == VAR_DECL
7391 && DECL_LANG_SPECIFIC (decl
)
7392 && DECL_IN_AGGR_P (decl
))
7394 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7396 if (init
== NULL_TREE
7397 #ifdef DEFAULT_STATIC_DEFS
7398 /* If this code is dead, then users must
7399 explicitly declare static member variables
7400 outside the class def'n as well. */
7401 && TYPE_NEEDS_CONSTRUCTING (type
)
7405 DECL_EXTERNAL (decl
) = 1;
7406 make_decl_rtl (decl
, asmspec
, 1);
7409 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7412 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7417 /* The old ARM scoping rules injected variables declared in the
7418 initialization statement of a for-statement into the surrounding
7419 scope. We support this usage, in order to be backward-compatible.
7420 DECL is a just-declared VAR_DECL; if necessary inject its
7421 declaration into the surrounding scope. */
7424 maybe_inject_for_scope_var (decl
)
7427 if (current_binding_level
->is_for_scope
)
7429 struct binding_level
*outer
7430 = current_binding_level
->level_chain
;
7432 /* Check to see if the same name is already bound at the outer
7433 level, either because it was directly declared, or because a
7434 dead for-decl got preserved. In either case, the code would
7435 not have been valid under the ARM scope rules, so clear
7436 is_for_scope for the current_binding_level.
7438 Otherwise, we need to preserve the temp slot for decl to last
7439 into the outer binding level. */
7442 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7444 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7445 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7447 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7449 BINDING_VALUE (outer_binding
)
7450 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7451 current_binding_level
->is_for_scope
= 0;
7453 else if (DECL_IN_MEMORY_P (decl
))
7454 preserve_temp_slots (DECL_RTL (decl
));
7458 /* Generate code to initialize DECL (a local variable). */
7461 initialize_local_var (decl
, init
, flags
)
7468 type
= complete_type (TREE_TYPE (decl
));
7470 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7472 /* If we used it already as memory, it must stay in memory. */
7473 DECL_INITIAL (decl
) = NULL_TREE
;
7474 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7477 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7481 /* Compute and store the initial value. */
7482 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7484 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7486 int saved_stmts_are_full_exprs_p
;
7488 emit_line_note (DECL_SOURCE_FILE (decl
),
7489 DECL_SOURCE_LINE (decl
));
7490 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7491 stmts_are_full_exprs_p
= 1;
7492 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7493 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7496 /* Set this to 0 so we can tell whether an aggregate which was
7497 initialized was ever used. Don't do this if it has a
7498 destructor, so we don't complain about the 'resource
7499 allocation is initialization' idiom. Now set
7500 attribute((unused)) on types so decls of that type will be
7501 marked used. (see TREE_USED, above.) */
7502 if (TYPE_NEEDS_CONSTRUCTING (type
)
7504 && !TYPE_NEEDS_DESTRUCTOR (type
)
7505 && DECL_NAME (decl
))
7506 TREE_USED (decl
) = 0;
7507 else if (already_used
)
7508 TREE_USED (decl
) = 1;
7512 /* Generate code to destroy DECL (a local variable). */
7515 destroy_local_var (decl
)
7518 tree type
= TREE_TYPE (decl
);
7521 /* Only variables get cleaned up. */
7522 if (TREE_CODE (decl
) != VAR_DECL
)
7525 /* And only things with destructors need cleaning up. */
7526 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7529 if (TREE_CODE (decl
) == VAR_DECL
&&
7530 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7531 /* We don't clean up things that aren't defined in this
7532 translation unit, or that need a static cleanup. The latter
7533 are handled by finish_file. */
7536 /* Compute the cleanup. */
7537 cleanup
= maybe_build_cleanup (decl
);
7539 /* Record the cleanup required for this declaration. */
7540 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7542 finish_decl_cleanup (decl
, cleanup
);
7545 /* Let the back-end know about DECL. */
7548 emit_local_var (decl
)
7551 /* Create RTL for this variable. */
7552 if (DECL_RTL (decl
))
7553 /* Only a RESULT_DECL should have non-NULL RTL when
7554 arriving here. All other local variables are
7555 assigned RTL in this function. */
7556 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7561 /* Actually do the initialization. */
7562 expand_start_target_temps ();
7563 expand_decl_init (decl
);
7564 expand_end_target_temps ();
7567 /* Finish processing of a declaration;
7568 install its line number and initial value.
7569 If the length of an array type is not known before,
7570 it must be determined now, from the initial value, or it is an error.
7572 Call `pop_obstacks' iff NEED_POP is nonzero.
7574 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7575 for aggregates that have constructors alive on the permanent obstack,
7576 so that the global initializing functions can be written at the end.
7578 INIT0 holds the value of an initializer that should be allowed to escape
7581 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7582 if the (init) syntax was used.
7584 For functions that take default parameters, DECL points to its
7585 "maximal" instantiation. `cp_finish_decl' must then also declared its
7586 subsequently lower and lower forms of instantiation, checking for
7587 ambiguity as it goes. This can be sped up later. */
7590 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7597 tree ttype
= NULL_TREE
;
7598 int temporary
= allocation_temporary_p ();
7599 const char *asmspec
= NULL
;
7600 int was_readonly
= 0;
7602 /* If this is 0, then we did not change obstacks. */
7606 error ("assignment (not initialization) in declaration");
7610 /* If a name was specified, get the string. */
7612 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7614 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7616 cp_error ("Cannot initialize `%D' to namespace `%D'",
7621 if (current_class_type
7622 && DECL_REAL_CONTEXT (decl
) == current_class_type
7623 && TYPE_BEING_DEFINED (current_class_type
)
7624 && (DECL_INITIAL (decl
) || init
))
7625 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7627 if (TREE_CODE (decl
) == VAR_DECL
7628 && DECL_CONTEXT (decl
)
7629 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7630 && DECL_CONTEXT (decl
) != current_namespace
7633 /* Leave the namespace of the object. */
7634 pop_decl_namespace ();
7637 type
= TREE_TYPE (decl
);
7639 if (type
== error_mark_node
)
7641 if (toplevel_bindings_p () && temporary
)
7642 end_temporary_allocation ();
7647 /* Add this declaration to the statement-tree. */
7648 if (building_stmt_tree ()
7649 && TREE_CODE (current_scope ()) == FUNCTION_DECL
)
7650 add_decl_stmt (decl
);
7652 if (TYPE_HAS_MUTABLE_P (type
))
7653 TREE_READONLY (decl
) = 0;
7655 if (processing_template_decl
)
7657 if (init
&& DECL_INITIAL (decl
))
7658 DECL_INITIAL (decl
) = init
;
7662 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7663 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7665 /* Take care of TYPE_DECLs up front. */
7666 if (TREE_CODE (decl
) == TYPE_DECL
)
7668 if (init
&& DECL_INITIAL (decl
))
7670 /* typedef foo = bar; store the type of bar as the type of foo. */
7671 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7672 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7674 if (type
!= error_mark_node
7675 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7677 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7678 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7679 set_identifier_type_value (DECL_NAME (decl
), type
);
7680 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7682 GNU_xref_decl (current_function_decl
, decl
);
7684 /* If we have installed this as the canonical typedef for this
7685 type, and that type has not been defined yet, delay emitting
7686 the debug information for it, as we will emit it later. */
7687 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7688 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7689 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7691 rest_of_decl_compilation (decl
, NULL_PTR
,
7692 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7696 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7697 ttype
= target_type (type
);
7699 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7700 && TYPE_NEEDS_CONSTRUCTING (type
))
7702 /* Currently, GNU C++ puts constants in text space, making them
7703 impossible to initialize. In the future, one would hope for
7704 an operating system which understood the difference between
7705 initialization and the running of a program. */
7707 TREE_READONLY (decl
) = 0;
7710 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7712 /* This must override the asm specifier which was placed by
7713 grokclassfn. Lay this out fresh. */
7714 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7715 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7716 make_decl_rtl (decl
, asmspec
, 0);
7719 /* Deduce size of array from initialization, if not already known. */
7720 maybe_deduce_size_from_array_init (decl
, init
);
7721 init
= check_initializer (decl
, init
);
7723 GNU_xref_decl (current_function_decl
, decl
);
7725 /* For top-level declaration, the initial value was read in
7726 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7727 must go in the permanent obstack; but don't discard the
7728 temporary data yet. */
7730 if (toplevel_bindings_p () && temporary
)
7731 end_temporary_allocation ();
7733 if (TREE_CODE (decl
) == VAR_DECL
)
7734 init
= layout_var_decl (decl
, init
);
7736 /* Output the assembler code and/or RTL code for variables and functions,
7737 unless the type is an undefined structure or union.
7738 If not, it will get done when the type is completed. */
7739 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7740 || TREE_CODE (decl
) == RESULT_DECL
)
7742 /* ??? FIXME: What about nested classes? */
7743 int toplev
= toplevel_bindings_p ();
7745 if (TREE_CODE (decl
) == VAR_DECL
)
7746 maybe_commonize_var (decl
);
7748 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7750 if (TREE_CODE (type
) == FUNCTION_TYPE
7751 || TREE_CODE (type
) == METHOD_TYPE
)
7752 abstract_virtuals_error (decl
,
7753 strip_array_types (TREE_TYPE (type
)));
7755 abstract_virtuals_error (decl
, strip_array_types (type
));
7757 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7759 else if (DECL_EXTERNAL (decl
)
7760 && ! (DECL_LANG_SPECIFIC (decl
)
7761 && DECL_NOT_REALLY_EXTERN (decl
)))
7764 DECL_INITIAL (decl
) = init
;
7766 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7768 /* Cleanups for static variables are handled by `finish_file'. */
7769 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7770 || TYPE_NEEDS_DESTRUCTOR (type
))
7771 expand_static_init (decl
, init
);
7775 /* This is a local declaration. */
7776 maybe_inject_for_scope_var (decl
);
7777 /* Initialize the local variable. But, if we're building a
7778 statement-tree, we'll do the initialization when we
7780 if (processing_template_decl
)
7782 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7783 DECL_INITIAL (decl
) = init
;
7787 if (!building_stmt_tree ())
7788 emit_local_var (decl
);
7789 initialize_local_var (decl
, init
, flags
);
7790 /* Clean up the variable. */
7791 destroy_local_var (decl
);
7796 /* Undo call to `pushclass' that was done in `start_decl'
7797 due to initialization of qualified member variable.
7798 I.e., Foo::x = 10; */
7800 tree context
= DECL_REAL_CONTEXT (decl
);
7802 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7803 && (TREE_CODE (decl
) == VAR_DECL
7804 /* We also have a pushclass done that we need to undo here
7805 if we're at top level and declare a method. */
7806 || TREE_CODE (decl
) == FUNCTION_DECL
)
7807 /* If size hasn't been set, we're still defining it,
7808 and therefore inside the class body; don't pop
7809 the binding level.. */
7810 && TYPE_SIZE (context
) != NULL_TREE
7811 && context
== current_class_type
)
7812 pop_nested_class ();
7818 /* If requested, warn about definitions of large data objects. */
7820 if (warn_larger_than
7821 && ! processing_template_decl
7822 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7823 && !DECL_EXTERNAL (decl
))
7825 register tree decl_size
= DECL_SIZE (decl
);
7827 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7829 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7831 if (units
> larger_than_size
)
7832 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7837 /* Resume permanent allocation, if not within a function. The
7838 corresponding push_obstacks_nochange is in start_decl,
7839 start_method, groktypename, and in grokfield. */
7843 TREE_READONLY (decl
) = 1;
7846 /* This is here for a midend callback from c-common.c */
7849 finish_decl (decl
, init
, asmspec_tree
)
7853 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7856 /* Generate code to handle the destruction of the function-scoped
7857 static variable DECL. */
7860 destroy_local_static (decl
)
7863 tree cleanup
, fcall
;
7865 int saved_flag_access_control
;
7867 if (atexit_node
== 0)
7869 tree atexit_fndecl
, PFV
, pfvlist
;
7870 /* Remember this information until end of file. */
7871 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7872 PFV
= build_pointer_type (build_function_type
7873 (void_type_node
, void_list_node
));
7875 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7877 push_lang_context (lang_name_c
);
7878 /* Note that we do not call pushdecl for this function;
7879 there's no reason that this declaration should be
7880 accessible to anyone. */
7882 = define_function ("atexit",
7883 build_function_type (void_type_node
,
7885 /*pfn=*/0, NULL_PTR
);
7886 mark_used (atexit_fndecl
);
7887 atexit_node
= default_conversion (atexit_fndecl
);
7888 pop_lang_context ();
7892 /* Call build_cleanup before we enter the anonymous function so that
7893 any access checks will be done relative to the current scope,
7894 rather than the scope of the anonymous function. */
7895 build_cleanup (decl
);
7897 /* Now start the function. */
7898 cleanup
= start_anon_func ();
7900 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7901 to the original function, rather than the anonymous one. That
7902 will make the back-end think that nested functions are in use,
7903 which causes confusion. */
7904 saved_flag_access_control
= flag_access_control
;
7905 flag_access_control
= 0;
7906 fcall
= build_cleanup (decl
);
7907 flag_access_control
= saved_flag_access_control
;
7909 /* Create the body of the anonymous function. */
7910 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7911 finish_expr_stmt (fcall
);
7912 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7915 /* Call atexit with the cleanup function. */
7916 mark_addressable (cleanup
);
7917 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7918 fcall
= build_function_call (atexit_node
,
7919 tree_cons (NULL_TREE
,
7922 finish_expr_stmt (fcall
);
7926 expand_static_init (decl
, init
)
7930 tree oldstatic
= value_member (decl
, static_aggregates
);
7934 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7935 cp_error ("multiple initializations given for `%D'", decl
);
7937 else if (! toplevel_bindings_p ())
7939 /* Emit code to perform this initialization but once. */
7946 /* Remember this information until end of file. */
7947 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7949 /* Emit code to perform this initialization but once. This code
7952 static int temp = 0;
7954 // Do initialization.
7956 // Register variable for destruction at end of program.
7959 Note that the `temp' variable is only set to 1 *after* the
7960 initialization is complete. This ensures that an exception,
7961 thrown during the construction, will cause the variable to
7962 reinitialized when we pass through this code again, as per:
7966 If the initialization exits by throwing an exception, the
7967 initialization is not complete, so it will be tried again
7968 the next time control enters the declaration.
7970 In theory, this process should be thread-safe, too; multiple
7971 threads should not be able to initialize the variable more
7972 than once. We don't yet attempt to ensure thread-safety. */
7973 temp
= get_temp_name (integer_type_node
, 1);
7974 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
7976 /* Begin the conditional initialization. */
7977 if_stmt
= begin_if_stmt ();
7978 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
7981 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
7983 /* Do the initialization itself. */
7984 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
7985 || (init
&& TREE_CODE (init
) == TREE_LIST
))
7986 assignment
= build_aggr_init (decl
, init
, 0);
7988 /* The initialization we're doing here is just a bitwise
7990 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
7992 assignment
= NULL_TREE
;
7994 /* Once the assignment is complete, set TEMP to 1. Since the
7995 construction of the static object is complete at this point,
7996 we want to make sure TEMP is set to 1 even if a temporary
7997 constructed during the initialization throws an exception
7998 when it is destroyed. So, we combine the initialization and
7999 the assignment to TEMP into a single expression, ensuring
8000 that when we call finish_expr_stmt the cleanups will not be
8001 run until after TEMP is set to 1. */
8002 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8005 assignment
= tree_cons (NULL_TREE
, assignment
,
8006 build_tree_list (NULL_TREE
,
8008 assignment
= build_compound_expr (assignment
);
8011 assignment
= temp_init
;
8012 finish_expr_stmt (assignment
);
8014 /* Use atexit to register a function for destroying this static
8016 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8017 destroy_local_static (decl
);
8019 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8020 finish_then_clause (if_stmt
);
8023 /* Resume old (possibly temporary) allocation. */
8028 /* This code takes into account memory allocation policy of
8029 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8030 hold for this object, then we must make permanent the storage
8031 currently in the temporary obstack. */
8032 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8033 preserve_initializer ();
8034 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8038 /* Finish the declaration of a catch-parameter. */
8041 start_handler_parms (declspecs
, declarator
)
8048 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8050 if (decl
== NULL_TREE
)
8051 error ("invalid catch parameter");
8055 expand_start_catch_block (decl
);
8059 /* Make TYPE a complete type based on INITIAL_VALUE.
8060 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8061 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8064 complete_array_type (type
, initial_value
, do_default
)
8065 tree type
, initial_value
;
8068 register tree maxindex
= NULL_TREE
;
8071 /* Allocate on the same obstack as TYPE. */
8072 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8076 /* Note MAXINDEX is really the maximum index,
8077 one less than the size. */
8078 if (TREE_CODE (initial_value
) == STRING_CST
)
8081 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8082 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8085 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8087 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8088 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8089 for (; elts
; elts
= TREE_CHAIN (elts
))
8091 if (TREE_PURPOSE (elts
))
8092 maxindex
= TREE_PURPOSE (elts
);
8094 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8096 maxindex
= copy_node (maxindex
);
8100 /* Make an error message unless that happened already. */
8101 if (initial_value
!= error_mark_node
)
8104 initial_value
= NULL_TREE
;
8106 /* Prevent further error messages. */
8107 maxindex
= build_int_2 (0, 0);
8114 maxindex
= build_int_2 (0, 0);
8123 domain
= build_index_type (maxindex
);
8124 TYPE_DOMAIN (type
) = domain
;
8126 if (! TREE_TYPE (maxindex
))
8127 TREE_TYPE (maxindex
) = domain
;
8129 itype
= TREE_TYPE (initial_value
);
8132 if (itype
&& !TYPE_DOMAIN (itype
))
8133 TYPE_DOMAIN (itype
) = domain
;
8134 /* The type of the main variant should never be used for arrays
8135 of different sizes. It should only ever be completed with the
8136 size of the array. */
8137 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8138 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8143 /* Lay out the type now that we can get the real answer. */
8150 /* Return zero if something is declared to be a member of type
8151 CTYPE when in the context of CUR_TYPE. STRING is the error
8152 message to print in that case. Otherwise, quietly return 1. */
8155 member_function_or_else (ctype
, cur_type
, string
)
8156 tree ctype
, cur_type
;
8159 if (ctype
&& ctype
!= cur_type
)
8161 error (string
, TYPE_NAME_STRING (ctype
));
8167 /* Subroutine of `grokdeclarator'. */
8169 /* Generate errors possibly applicable for a given set of specifiers.
8170 This is for ARM $7.1.2. */
8173 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8176 int virtualp
, quals
, friendp
, raises
, inlinep
;
8179 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8181 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8183 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8186 cp_error_at ("`%D' declared as a friend", object
);
8188 cp_error_at ("`%D' declared with an exception specification", object
);
8191 /* CTYPE is class type, or null if non-class.
8192 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8194 DECLARATOR is the function's name.
8195 VIRTUALP is truthvalue of whether the function is virtual or not.
8196 FLAGS are to be passed through to `grokclassfn'.
8197 QUALS are qualifiers indicating whether the function is `const'
8199 RAISES is a list of exceptions that this function can raise.
8200 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8201 not look, and -1 if we should not call `grokclassfn' at all.
8203 Returns `NULL_TREE' if something goes wrong, after issuing
8204 applicable error messages. */
8207 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8208 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8209 template_count
, in_namespace
)
8212 tree orig_declarator
;
8214 enum overload_flags flags
;
8216 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8220 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8221 int has_default_arg
= 0;
8225 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8226 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8232 type
= build_exception_variant (type
, raises
);
8235 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8236 /* Propagate volatile out from type to decl. */
8237 if (TYPE_VOLATILE (type
))
8238 TREE_THIS_VOLATILE (decl
) = 1;
8240 /* If this decl has namespace scope, set that up. */
8242 set_decl_namespace (decl
, in_namespace
, friendp
);
8243 else if (publicp
&& ! ctype
)
8244 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8246 /* `main' and builtins have implicit 'C' linkage. */
8247 if ((MAIN_NAME_P (declarator
)
8248 || (IDENTIFIER_LENGTH (declarator
) > 10
8249 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8250 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8251 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8252 && current_lang_name
== lang_name_cplusplus
8253 && ctype
== NULL_TREE
8254 /* NULL_TREE means global namespace. */
8255 && DECL_CONTEXT (decl
) == NULL_TREE
)
8256 DECL_LANGUAGE (decl
) = lang_c
;
8258 /* Should probably propagate const out from type to decl I bet (mrs). */
8261 DECL_STATIC_FUNCTION_P (decl
) = 1;
8262 DECL_CONTEXT (decl
) = ctype
;
8266 DECL_CLASS_CONTEXT (decl
) = ctype
;
8268 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8270 if (processing_template_decl
)
8271 error ("cannot declare `main' to be a template");
8273 error ("cannot declare `main' to be inline");
8275 error ("cannot declare `main' to be static");
8280 /* Members of anonymous types and local classes have no linkage; make
8282 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8283 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8288 /* [basic.link]: A name with no linkage (notably, the name of a class
8289 or enumeration declared in a local scope) shall not be used to
8290 declare an entity with linkage.
8292 Only check this for public decls for now. */
8293 t
= no_linkage_check (TREE_TYPE (decl
));
8296 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8298 if (DECL_LANGUAGE (decl
) == lang_c
)
8299 /* Allow this; it's pretty common in C. */;
8301 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8305 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8310 TREE_PUBLIC (decl
) = publicp
;
8313 DECL_INTERFACE_KNOWN (decl
) = 1;
8314 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8318 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8320 DECL_EXTERNAL (decl
) = 1;
8321 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8323 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8324 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8328 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8329 grok_op_properties (decl
, virtualp
, check
< 0);
8331 if (ctype
&& hack_decl_function_context (decl
))
8332 DECL_NO_STATIC_CHAIN (decl
) = 1;
8334 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8335 if (TREE_PURPOSE (t
)
8336 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8338 has_default_arg
= 1;
8343 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8347 ("defining explicit specialization `%D' in friend declaration",
8351 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8353 /* Something like `template <class T> friend void f<T>()'. */
8354 cp_error ("template-id `%D' in declaration of primary template",
8360 /* A friend declaration of the form friend void f<>(). Record
8361 the information in the TEMPLATE_ID_EXPR. */
8362 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8363 DECL_TEMPLATE_INFO (decl
)
8364 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8365 TREE_OPERAND (orig_declarator
, 1),
8368 if (has_default_arg
)
8370 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8377 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8384 if (has_default_arg
)
8385 add_defarg_fn (decl
);
8387 /* Plain overloading: will not be grok'd by grokclassfn. */
8388 if (! ctype
&& ! processing_template_decl
8389 && DECL_LANGUAGE (decl
) != lang_c
8390 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8391 set_mangled_name_for_decl (decl
);
8394 /* Make the init_value nonzero so pushdecl knows this is not
8395 tentative. error_mark_node is replaced later with the BLOCK. */
8396 DECL_INITIAL (decl
) = error_mark_node
;
8398 /* Caller will do the rest of this. */
8402 if (check
&& funcdef_flag
)
8403 DECL_INITIAL (decl
) = error_mark_node
;
8405 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8408 /* Just handle constructors here. We could do this
8409 inside the following if stmt, but I think
8410 that the code is more legible by breaking this
8411 case out. See comments below for what each of
8412 the following calls is supposed to do. */
8413 DECL_CONSTRUCTOR_P (decl
) = 1;
8415 grokclassfn (ctype
, decl
, flags
, quals
);
8417 decl
= check_explicit_specialization (orig_declarator
, decl
,
8419 2 * (funcdef_flag
!= 0) +
8420 4 * (friendp
!= 0));
8421 if (decl
== error_mark_node
)
8424 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8427 tmp
= check_classfn (ctype
, decl
);
8429 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8430 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8432 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8433 cp_error ("definition of implicitly-declared `%D'", tmp
);
8434 if (tmp
&& duplicate_decls (decl
, tmp
))
8437 if (! grok_ctor_properties (ctype
, decl
))
8444 /* Function gets the ugly name, field gets the nice one.
8445 This call may change the type of the function (because
8446 of default parameters)! */
8447 if (ctype
!= NULL_TREE
)
8448 grokclassfn (ctype
, decl
, flags
, quals
);
8450 decl
= check_explicit_specialization (orig_declarator
, decl
,
8452 2 * (funcdef_flag
!= 0) +
8453 4 * (friendp
!= 0));
8454 if (decl
== error_mark_node
)
8457 if (ctype
!= NULL_TREE
8458 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8461 tmp
= check_classfn (ctype
, decl
);
8463 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8464 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8466 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8467 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8469 /* Remove the `this' parm added by grokclassfn.
8470 XXX Isn't this done in start_function, too? */
8471 revert_static_member_fn (&decl
, NULL
, NULL
);
8472 last_function_parms
= TREE_CHAIN (last_function_parms
);
8474 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8475 cp_error ("definition of implicitly-declared `%D'", tmp
);
8478 /* Attempt to merge the declarations. This can fail, in
8479 the case of some illegal specialization declarations. */
8480 if (!duplicate_decls (decl
, tmp
))
8481 cp_error ("no `%#D' member function declared in class `%T'",
8487 if (ctype
== NULL_TREE
|| check
)
8492 DECL_VIRTUAL_P (decl
) = 1;
8493 if (DECL_VINDEX (decl
) == NULL_TREE
)
8494 DECL_VINDEX (decl
) = error_mark_node
;
8495 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8502 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8505 RID_BIT_TYPE
*specbits_in
;
8511 RID_BIT_TYPE specbits
;
8513 specbits
= *specbits_in
;
8515 if (TREE_CODE (type
) == OFFSET_TYPE
)
8517 /* If you declare a static member so that it
8518 can be initialized, the code will reach here. */
8519 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8520 type
= TREE_TYPE (type
);
8521 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8522 DECL_CONTEXT (decl
) = basetype
;
8523 DECL_CLASS_CONTEXT (decl
) = basetype
;
8524 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8531 context
= in_namespace
;
8532 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8533 context
= current_namespace
;
8535 context
= NULL_TREE
;
8537 if (processing_template_decl
)
8539 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8540 we can call push_template_decl. */
8541 push_permanent_obstack ();
8542 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8546 decl
= build_decl (VAR_DECL
, declarator
, type
);
8549 set_decl_namespace (decl
, context
, 0);
8551 context
= DECL_CONTEXT (decl
);
8552 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8553 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8557 set_decl_namespace (decl
, in_namespace
, 0);
8559 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8561 DECL_THIS_EXTERN (decl
) = 1;
8562 DECL_EXTERNAL (decl
) = !initialized
;
8565 /* In class context, static means one per class,
8566 public access, and static storage. */
8567 if (DECL_CLASS_SCOPE_P (decl
))
8569 TREE_PUBLIC (decl
) = 1;
8570 TREE_STATIC (decl
) = 1;
8571 DECL_EXTERNAL (decl
) = 0;
8573 /* At top level, either `static' or no s.c. makes a definition
8574 (perhaps tentative), and absence of `static' makes it public. */
8575 else if (toplevel_bindings_p ())
8577 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8578 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8579 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8581 /* Not at top level, only `static' makes a static definition. */
8584 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8585 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8588 if (TREE_PUBLIC (decl
))
8590 /* [basic.link]: A name with no linkage (notably, the name of a class
8591 or enumeration declared in a local scope) shall not be used to
8592 declare an entity with linkage.
8594 Only check this for public decls for now. */
8595 tree t
= no_linkage_check (TREE_TYPE (decl
));
8598 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8599 /* Ignore for now; `enum { foo } e' is pretty common. */;
8601 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8609 /* Create and return a canonical pointer to member function type, for
8610 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8613 build_ptrmemfunc_type (type
)
8619 tree unqualified_variant
= NULL_TREE
;
8621 /* If a canonical type already exists for this type, use it. We use
8622 this method instead of type_hash_canon, because it only does a
8623 simple equality check on the list of field members. */
8625 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8628 /* Make sure that we always have the unqualified pointer-to-member
8630 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8632 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8634 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8636 u
= make_lang_type (UNION_TYPE
);
8637 SET_IS_AGGR_TYPE (u
, 0);
8638 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8639 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8641 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8642 TYPE_NAME (u
) = NULL_TREE
;
8644 t
= make_lang_type (RECORD_TYPE
);
8646 /* Let the front-end know this is a pointer to member function... */
8647 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8648 /* ... and not really an aggregate. */
8649 SET_IS_AGGR_TYPE (t
, 0);
8651 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8653 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8655 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8656 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8660 /* Zap out the name so that the back-end will give us the debugging
8661 information for this anonymous RECORD_TYPE. */
8662 TYPE_NAME (t
) = NULL_TREE
;
8664 /* If this is not the unqualified form of this pointer-to-member
8665 type, set the TYPE_MAIN_VARIANT for this type to be the
8666 unqualified type. Since they are actually RECORD_TYPEs that are
8667 not variants of each other, we must do this manually. */
8668 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8670 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8671 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8672 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8673 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8676 /* Cache this pointer-to-member type so that we can find it again
8678 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8680 /* Seems to be wanted. */
8681 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8686 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8687 Check to see that the definition is valid. Issue appropriate error
8688 messages. Return 1 if the definition is particularly bad, or 0
8692 check_static_variable_definition (decl
, type
)
8696 /* Motion 10 at San Diego: If a static const integral data member is
8697 initialized with an integral constant expression, the initializer
8698 may appear either in the declaration (within the class), or in
8699 the definition, but not both. If it appears in the class, the
8700 member is a member constant. The file-scope definition is always
8702 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8704 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8706 /* If we just return the declaration, crashes will sometimes
8707 occur. We therefore return void_type_node, as if this was a
8708 friend declaration, to cause callers to completely ignore
8709 this declaration. */
8712 else if (!CP_TYPE_CONST_P (type
))
8713 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8715 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8716 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8721 /* Given declspecs and a declarator,
8722 determine the name and type of the object declared
8723 and construct a ..._DECL node for it.
8724 (In one case we can return a ..._TYPE node instead.
8725 For invalid input we sometimes return 0.)
8727 DECLSPECS is a chain of tree_list nodes whose value fields
8728 are the storage classes and type specifiers.
8730 DECL_CONTEXT says which syntactic context this declaration is in:
8731 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8732 FUNCDEF for a function definition. Like NORMAL but a few different
8733 error messages in each case. Return value may be zero meaning
8734 this definition is too screwy to try to parse.
8735 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8736 handle member functions (which have FIELD context).
8737 Return value may be zero meaning this definition is too screwy to
8739 PARM for a parameter declaration (either within a function prototype
8740 or before a function body). Make a PARM_DECL, or return void_type_node.
8741 CATCHPARM for a parameter declaration before a catch clause.
8742 TYPENAME if for a typename (in a cast or sizeof).
8743 Don't make a DECL node; just return the ..._TYPE node.
8744 FIELD for a struct or union field; make a FIELD_DECL.
8745 BITFIELD for a field with specified width.
8746 INITIALIZED is 1 if the decl has an initializer.
8748 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8749 normal attributes in TREE_PURPOSE, or NULL_TREE.
8751 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8752 It may also be so in the PARM case, for a prototype where the
8753 argument type is specified but not the name.
8755 This function is where the complicated C meanings of `static'
8756 and `extern' are interpreted.
8758 For C++, if there is any monkey business to do, the function which
8759 calls this one must do it, i.e., prepending instance variables,
8760 renaming overloaded function names, etc.
8762 Note that for this C++, it is an error to define a method within a class
8763 which does not belong to that class.
8765 Except in the case where SCOPE_REFs are implicitly known (such as
8766 methods within a class being redundantly qualified),
8767 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8768 (class_name::decl_name). The caller must also deal with this.
8770 If a constructor or destructor is seen, and the context is FIELD,
8771 then the type gains the attribute TREE_HAS_x. If such a declaration
8772 is erroneous, NULL_TREE is returned.
8774 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8775 function, these are the qualifiers to give to the `this' pointer.
8777 May return void_type_node if the declarator turned out to be a friend.
8778 See grokfield for details. */
8780 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8783 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8786 enum decl_context decl_context
;
8790 RID_BIT_TYPE specbits
;
8793 tree type
= NULL_TREE
;
8799 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8800 int explicit_int
= 0;
8801 int explicit_char
= 0;
8802 int defaulted_int
= 0;
8803 tree typedef_decl
= NULL_TREE
;
8805 tree typedef_type
= NULL_TREE
;
8806 int funcdef_flag
= 0;
8807 enum tree_code innermost_code
= ERROR_MARK
;
8810 /* See the code below that used this. */
8811 tree decl_machine_attr
= NULL_TREE
;
8813 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8814 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8815 tree init
= NULL_TREE
;
8817 /* Keep track of what sort of function is being processed
8818 so that we can warn about default return values, or explicit
8819 return values which do not match prescribed defaults. */
8820 enum return_types return_type
= return_normal
;
8822 tree dname
= NULL_TREE
;
8823 tree ctype
= current_class_type
;
8824 tree ctor_return_type
= NULL_TREE
;
8825 enum overload_flags flags
= NO_SPECIAL
;
8826 tree quals
= NULL_TREE
;
8827 tree raises
= NULL_TREE
;
8828 int template_count
= 0;
8829 tree in_namespace
= NULL_TREE
;
8833 RIDBIT_RESET_ALL (specbits
);
8834 if (decl_context
== FUNCDEF
)
8835 funcdef_flag
= 1, decl_context
= NORMAL
;
8836 else if (decl_context
== MEMFUNCDEF
)
8837 funcdef_flag
= -1, decl_context
= FIELD
;
8838 else if (decl_context
== BITFIELD
)
8839 bitfield
= 1, decl_context
= FIELD
;
8841 /* Look inside a declarator for the name being declared
8842 and get it as a string, for an error message. */
8844 tree
*next
= &declarator
;
8848 while (next
&& *next
)
8851 switch (TREE_CODE (decl
))
8854 /* For attributes. */
8855 next
= &TREE_VALUE (decl
);
8860 next
= &TREE_OPERAND (decl
, 0);
8863 case BIT_NOT_EXPR
: /* For C++ destructors! */
8865 tree name
= TREE_OPERAND (decl
, 0);
8866 tree rename
= NULL_TREE
;
8868 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8870 return_type
= return_dtor
;
8871 if (TREE_CODE (name
) == TYPE_DECL
)
8872 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8873 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8874 if (ctype
== NULL_TREE
)
8876 if (current_class_type
== NULL_TREE
)
8878 error ("destructors must be member functions");
8883 tree t
= constructor_name (current_class_name
);
8890 tree t
= constructor_name (ctype
);
8897 cp_error ("destructor `%T' must match class name `%T'",
8899 TREE_OPERAND (decl
, 0) = rename
;
8905 case ADDR_EXPR
: /* C++ reference declaration */
8910 innermost_code
= TREE_CODE (decl
);
8911 next
= &TREE_OPERAND (decl
, 0);
8915 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
8917 /* This is actually a variable declaration using
8918 constructor syntax. We need to call start_decl and
8919 cp_finish_decl so we can get the variable
8922 tree attributes
, prefix_attributes
;
8924 *next
= TREE_OPERAND (decl
, 0);
8925 init
= CALL_DECLARATOR_PARMS (decl
);
8929 attributes
= TREE_PURPOSE (attrlist
);
8930 prefix_attributes
= TREE_VALUE (attrlist
);
8934 attributes
= NULL_TREE
;
8935 prefix_attributes
= NULL_TREE
;
8938 decl
= start_decl (declarator
, declspecs
, 1,
8939 attributes
, prefix_attributes
);
8942 /* Look for __unused__ attribute */
8943 if (TREE_USED (TREE_TYPE (decl
)))
8944 TREE_USED (decl
) = 1;
8945 finish_decl (decl
, init
, NULL_TREE
);
8948 cp_error ("invalid declarator");
8951 innermost_code
= TREE_CODE (decl
);
8952 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8953 ctype
= current_class_type
;
8955 && TREE_OPERAND (decl
, 0)
8956 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
8957 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
8958 == constructor_name_full (ctype
))
8959 || (DECL_NAME (TREE_OPERAND (decl
, 0))
8960 == constructor_name (ctype
)))))
8961 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8962 next
= &TREE_OPERAND (decl
, 0);
8964 if (ctype
!= NULL_TREE
8965 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
8966 && decl
== constructor_name (ctype
))
8968 return_type
= return_ctor
;
8969 ctor_return_type
= ctype
;
8974 case TEMPLATE_ID_EXPR
:
8976 tree fns
= TREE_OPERAND (decl
, 0);
8978 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
8979 fns
= TREE_OPERAND (fns
, 0);
8982 if (TREE_CODE (dname
) == COMPONENT_REF
)
8983 dname
= TREE_OPERAND (dname
, 1);
8984 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
8986 my_friendly_assert (is_overloaded_fn (dname
),
8988 dname
= DECL_NAME (get_first_fn (dname
));
8993 case IDENTIFIER_NODE
:
8994 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9001 cp_error ("declarator-id missing; using reserved word `%D'",
9003 name
= IDENTIFIER_POINTER (dname
);
9005 if (! IDENTIFIER_OPNAME_P (dname
)
9006 /* GNU/Linux headers use '__op'. Arrgh. */
9007 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9008 name
= IDENTIFIER_POINTER (dname
);
9011 if (IDENTIFIER_TYPENAME_P (dname
))
9013 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9014 flags
= TYPENAME_FLAG
;
9015 ctor_return_type
= TREE_TYPE (dname
);
9016 return_type
= return_conversion
;
9018 name
= operator_name_string (dname
);
9025 /* Perform error checking, and decide on a ctype. */
9026 tree cname
= TREE_OPERAND (decl
, 0);
9027 if (cname
== NULL_TREE
)
9029 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9032 in_namespace
= TREE_OPERAND (decl
, 0);
9033 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9035 else if (! is_aggr_type (cname
, 1))
9036 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9037 /* Must test TREE_OPERAND (decl, 1), in case user gives
9038 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9039 else if (TREE_OPERAND (decl
, 1)
9040 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9042 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9043 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9045 cp_error ("`%T::%D' is not a valid declarator", cname
,
9046 TREE_OPERAND (decl
, 1));
9047 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9048 cname
, TREE_OPERAND (decl
, 1));
9049 return void_type_node
;
9051 else if (ctype
== NULL_TREE
)
9053 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9054 TREE_OPERAND (decl
, 0) = ctype
;
9057 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9059 cp_error ("type `%T' is not derived from type `%T'",
9061 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9067 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9068 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9069 == constructor_name_full (ctype
))
9070 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9071 == constructor_name (ctype
))))
9072 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9073 next
= &TREE_OPERAND (decl
, 1);
9077 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9078 && constructor_name (ctype
) == decl
)
9080 return_type
= return_ctor
;
9081 ctor_return_type
= ctype
;
9083 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9084 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9085 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9086 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9088 return_type
= return_dtor
;
9089 ctor_return_type
= ctype
;
9091 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9092 next
= &TREE_OPERAND (decl
, 0);
9103 /* Parse error puts this typespec where
9104 a declarator should go. */
9105 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9106 if (TREE_TYPE (decl
) == current_class_type
)
9107 cp_error (" perhaps you want `%T' for a constructor",
9108 current_class_name
);
9109 dname
= DECL_NAME (decl
);
9110 name
= IDENTIFIER_POINTER (dname
);
9112 /* Avoid giving two errors for this. */
9113 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9115 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9122 cp_compiler_error ("`%D' as declarator", decl
);
9123 return 0; /* We used to do a 155 abort here. */
9130 /* A function definition's declarator must have the form of
9131 a function declarator. */
9133 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9136 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9137 && innermost_code
!= CALL_EXPR
9138 && ! (ctype
&& declspecs
== NULL_TREE
))
9140 cp_error ("declaration of `%D' as non-function", dname
);
9141 return void_type_node
;
9144 /* Anything declared one level down from the top level
9145 must be one of the parameters of a function
9146 (because the body is at least two levels down). */
9148 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9149 by not allowing C++ class definitions to specify their parameters
9150 with xdecls (must be spec.d in the parmlist).
9152 Since we now wait to push a class scope until we are sure that
9153 we are in a legitimate method context, we must set oldcname
9154 explicitly (since current_class_name is not yet alive).
9156 We also want to avoid calling this a PARM if it is in a namespace. */
9158 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9160 struct binding_level
*b
= current_binding_level
;
9161 current_binding_level
= b
->level_chain
;
9162 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9163 decl_context
= PARM
;
9164 current_binding_level
= b
;
9167 /* Look through the decl specs and record which ones appear.
9168 Some typespecs are defined as built-in typenames.
9169 Others, the ones that are modifiers of other types,
9170 are represented by bits in SPECBITS: set the bits for
9171 the modifiers that appear. Storage class keywords are also in SPECBITS.
9173 If there is a typedef name or a type, store the type in TYPE.
9174 This includes builtin typedefs such as `int'.
9176 Set EXPLICIT_INT if the type is `int' or `char' and did not
9177 come from a user typedef.
9179 Set LONGLONG if `long' is mentioned twice.
9181 For C++, constructors and destructors have their own fast treatment. */
9183 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9188 /* Certain parse errors slip through. For example,
9189 `int class;' is not caught by the parser. Try
9190 weakly to recover here. */
9191 if (TREE_CODE (spec
) != TREE_LIST
)
9194 id
= TREE_VALUE (spec
);
9196 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9198 if (id
== ridpointers
[(int) RID_INT
]
9199 || id
== ridpointers
[(int) RID_CHAR
]
9200 || id
== ridpointers
[(int) RID_BOOL
]
9201 || id
== ridpointers
[(int) RID_WCHAR
])
9205 if (id
== ridpointers
[(int) RID_BOOL
])
9206 error ("`bool' is now a keyword");
9208 cp_error ("extraneous `%T' ignored", id
);
9212 if (id
== ridpointers
[(int) RID_INT
])
9214 else if (id
== ridpointers
[(int) RID_CHAR
])
9216 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9220 /* C++ aggregate types. */
9221 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9224 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9226 type
= IDENTIFIER_TYPE_VALUE (id
);
9230 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9232 if (ridpointers
[i
] == id
)
9234 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9236 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9237 pedwarn ("ANSI C++ does not support `long long'");
9239 error ("`long long long' is too long for GCC");
9243 else if (RIDBIT_SETP (i
, specbits
))
9244 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9245 RIDBIT_SET (i
, specbits
);
9250 /* C++ aggregate types. */
9251 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9254 cp_error ("multiple declarations `%T' and `%T'", type
,
9258 type
= TREE_TYPE (id
);
9259 TREE_VALUE (spec
) = type
;
9264 error ("two or more data types in declaration of `%s'", name
);
9265 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9267 register tree t
= lookup_name (id
, 1);
9268 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9269 error ("`%s' fails to be a typedef or built in type",
9270 IDENTIFIER_POINTER (id
));
9273 type
= TREE_TYPE (t
);
9275 /* See the code below that used this. */
9276 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9281 else if (id
!= error_mark_node
)
9282 /* Can't change CLASS nodes into RECORD nodes here! */
9288 typedef_type
= type
;
9290 /* No type at all: default to `int', and set DEFAULTED_INT
9291 because it was not a user-defined typedef. */
9293 if (type
== NULL_TREE
9294 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9295 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9296 || RIDBIT_SETP (RID_LONG
, specbits
)
9297 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9299 /* These imply 'int'. */
9300 type
= integer_type_node
;
9304 if (type
== NULL_TREE
)
9307 if (return_type
== return_dtor
)
9308 type
= void_type_node
;
9309 else if (return_type
== return_ctor
)
9310 type
= build_pointer_type (ctor_return_type
);
9311 else if (return_type
== return_conversion
)
9312 type
= ctor_return_type
;
9315 /* We handle `main' specially here, because 'main () { }' is so
9316 common. With no options, it is allowed. With -Wreturn-type,
9317 it is a warning. It is only an error with -pedantic-errors. */
9318 int is_main
= (funcdef_flag
9319 && MAIN_NAME_P (dname
)
9320 && ctype
== NULL_TREE
9321 && in_namespace
== NULL_TREE
9322 && current_namespace
== global_namespace
);
9324 if (in_system_header
|| flag_ms_extensions
)
9325 /* Allow it, sigh. */;
9326 else if (pedantic
|| ! is_main
)
9327 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9329 else if (warn_return_type
)
9330 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9333 type
= integer_type_node
;
9336 else if (return_type
== return_dtor
)
9338 error ("return type specification for destructor invalid");
9339 type
= void_type_node
;
9341 else if (return_type
== return_ctor
)
9343 error ("return type specification for constructor invalid");
9344 type
= build_pointer_type (ctor_return_type
);
9346 else if (return_type
== return_conversion
)
9348 if (!same_type_p (type
, ctor_return_type
))
9349 cp_error ("operator `%T' declared to return `%T'",
9350 ctor_return_type
, type
);
9352 cp_pedwarn ("return type specified for `operator %T'",
9355 type
= ctor_return_type
;
9360 /* Now process the modifiers that were specified
9361 and check for invalid combinations. */
9363 /* Long double is a special combination. */
9365 if (RIDBIT_SETP (RID_LONG
, specbits
)
9366 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9368 RIDBIT_RESET (RID_LONG
, specbits
);
9369 type
= build_qualified_type (long_double_type_node
,
9370 CP_TYPE_QUALS (type
));
9373 /* Check all other uses of type modifiers. */
9375 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9376 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9377 || RIDBIT_SETP (RID_LONG
, specbits
)
9378 || RIDBIT_SETP (RID_SHORT
, specbits
))
9382 if (TREE_CODE (type
) == REAL_TYPE
)
9383 error ("short, signed or unsigned invalid for `%s'", name
);
9384 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9385 error ("long, short, signed or unsigned invalid for `%s'", name
);
9386 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9387 && RIDBIT_SETP (RID_SHORT
, specbits
))
9388 error ("long and short specified together for `%s'", name
);
9389 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9390 || RIDBIT_SETP (RID_SHORT
, specbits
))
9392 error ("long or short specified with char for `%s'", name
);
9393 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9394 || RIDBIT_SETP (RID_SHORT
, specbits
))
9395 && TREE_CODE (type
) == REAL_TYPE
)
9396 error ("long or short specified with floating type for `%s'", name
);
9397 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9398 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9399 error ("signed and unsigned given together for `%s'", name
);
9403 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9405 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9407 if (flag_pedantic_errors
)
9412 /* Discard the type modifiers if they are invalid. */
9415 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9416 RIDBIT_RESET (RID_SIGNED
, specbits
);
9417 RIDBIT_RESET (RID_LONG
, specbits
);
9418 RIDBIT_RESET (RID_SHORT
, specbits
);
9423 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9424 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9426 error ("complex invalid for `%s'", name
);
9427 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9430 /* Decide whether an integer type is signed or not.
9431 Optionally treat bitfields as signed by default. */
9432 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9435 It is implementation-defined whether a plain (neither
9436 explicitly signed or unsigned) char, short, int, or long
9437 bit-field is signed or unsigned.
9439 Naturally, we extend this to long long as well. Note that
9440 this does not include wchar_t. */
9441 || (bitfield
&& !flag_signed_bitfields
9442 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9443 /* A typedef for plain `int' without `signed' can be
9444 controlled just like plain `int', but a typedef for
9445 `signed int' cannot be so controlled. */
9447 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9448 && (TREE_CODE (type
) == INTEGER_TYPE
9449 || TREE_CODE (type
) == CHAR_TYPE
)
9450 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9453 type
= long_long_unsigned_type_node
;
9454 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9455 type
= long_unsigned_type_node
;
9456 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9457 type
= short_unsigned_type_node
;
9458 else if (type
== char_type_node
)
9459 type
= unsigned_char_type_node
;
9460 else if (typedef_decl
)
9461 type
= unsigned_type (type
);
9463 type
= unsigned_type_node
;
9465 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9466 && type
== char_type_node
)
9467 type
= signed_char_type_node
;
9469 type
= long_long_integer_type_node
;
9470 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9471 type
= long_integer_type_node
;
9472 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9473 type
= short_integer_type_node
;
9475 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9477 /* If we just have "complex", it is equivalent to
9478 "complex double", but if any modifiers at all are specified it is
9479 the complex form of TYPE. E.g, "complex short" is
9480 "complex short int". */
9482 if (defaulted_int
&& ! longlong
9483 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9484 || RIDBIT_SETP (RID_SHORT
, specbits
)
9485 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9486 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9487 type
= complex_double_type_node
;
9488 else if (type
== integer_type_node
)
9489 type
= complex_integer_type_node
;
9490 else if (type
== float_type_node
)
9491 type
= complex_float_type_node
;
9492 else if (type
== double_type_node
)
9493 type
= complex_double_type_node
;
9494 else if (type
== long_double_type_node
)
9495 type
= complex_long_double_type_node
;
9497 type
= build_complex_type (type
);
9500 if (return_type
== return_conversion
9501 && (RIDBIT_SETP (RID_CONST
, specbits
)
9502 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9503 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9504 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9507 /* Set CONSTP if this declaration is `const', whether by
9508 explicit specification or via a typedef.
9509 Likewise for VOLATILEP. */
9511 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9513 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9515 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9516 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9517 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9518 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9519 type
= cp_build_qualified_type (type
, type_quals
);
9521 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9522 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9523 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9524 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9525 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9527 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9528 staticp
= 1 + (decl_context
== FIELD
);
9530 if (virtualp
&& staticp
== 2)
9532 cp_error ("member `%D' cannot be declared both virtual and static",
9536 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9537 RIDBIT_RESET (RID_FRIEND
, specbits
);
9539 /* $7.1.2, Function specifiers */
9540 if (friendp
&& explicitp
)
9541 error ("only declarations of constructors can be `explicit'");
9543 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9545 if (decl_context
== PARM
)
9547 error ("non-member `%s' cannot be declared `mutable'", name
);
9548 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9550 else if (friendp
|| decl_context
== TYPENAME
)
9552 error ("non-object member `%s' cannot be declared `mutable'", name
);
9553 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9557 /* Warn if two storage classes are given. Default to `auto'. */
9559 if (RIDBIT_ANY_SET (specbits
))
9561 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9562 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9563 if (decl_context
== PARM
&& nclasses
> 0)
9564 error ("storage class specifiers invalid in parameter declarations");
9565 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9567 if (decl_context
== PARM
)
9568 error ("typedef declaration invalid in parameter declaration");
9571 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9572 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9575 /* Give error if `virtual' is used outside of class declaration. */
9577 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9579 error ("virtual outside class declaration");
9582 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9584 error ("only members can be declared mutable");
9585 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9588 /* Static anonymous unions are dealt with here. */
9589 if (staticp
&& decl_context
== TYPENAME
9590 && TREE_CODE (declspecs
) == TREE_LIST
9591 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9592 decl_context
= FIELD
;
9594 /* Warn about storage classes that are invalid for certain
9595 kinds of declarations (parameters, typenames, etc.). */
9598 error ("multiple storage classes in declaration of `%s'", name
);
9599 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9601 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9602 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9603 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9605 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9607 else if (decl_context
== FIELD
9608 /* C++ allows static class elements */
9609 && RIDBIT_SETP (RID_STATIC
, specbits
))
9610 /* C++ also allows inlines and signed and unsigned elements,
9611 but in those cases we don't come in here. */
9615 if (decl_context
== FIELD
)
9617 tree tmp
= NULL_TREE
;
9618 register int op
= 0;
9622 /* Avoid trying to get an operand off an identifier node. */
9623 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9626 tmp
= TREE_OPERAND (declarator
, 0);
9627 op
= IDENTIFIER_OPNAME_P (tmp
);
9629 error ("storage class specified for %s `%s'",
9630 op
? "member operator" : "field",
9631 op
? operator_name_string (tmp
) : name
);
9634 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9635 ? "storage class specified for parameter `%s'"
9636 : "storage class specified for typename"), name
);
9637 RIDBIT_RESET (RID_REGISTER
, specbits
);
9638 RIDBIT_RESET (RID_AUTO
, specbits
);
9639 RIDBIT_RESET (RID_EXTERN
, specbits
);
9642 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9644 if (toplevel_bindings_p ())
9646 /* It's common practice (and completely valid) to have a const
9647 be initialized and declared extern. */
9648 if (!(type_quals
& TYPE_QUAL_CONST
))
9649 warning ("`%s' initialized and declared `extern'", name
);
9652 error ("`%s' has both `extern' and initializer", name
);
9654 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9655 && ! toplevel_bindings_p ())
9656 error ("nested function `%s' declared `extern'", name
);
9657 else if (toplevel_bindings_p ())
9659 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9660 error ("top-level declaration of `%s' specifies `auto'", name
);
9663 if (nclasses
> 0 && friendp
)
9664 error ("storage class specifiers invalid in friend function declarations");
9666 /* Now figure out the structure of the declarator proper.
9667 Descend through it, creating more complex types, until we reach
9668 the declared identifier (or NULL_TREE, in an absolute declarator). */
9670 inner_attrs
= NULL_TREE
;
9673 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9674 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9676 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9677 an INDIRECT_REF (for *...),
9678 a CALL_EXPR (for ...(...)),
9679 an identifier (for the name being declared)
9680 or a null pointer (for the place in an absolute declarator
9681 where the name was omitted).
9682 For the last two cases, we have just exited the loop.
9684 For C++ it could also be
9685 a SCOPE_REF (for class :: ...). In this case, we have converted
9686 sensible names to types, and those are the values we use to
9687 qualify the member name.
9688 an ADDR_EXPR (for &...),
9689 a BIT_NOT_EXPR (for destructors)
9691 At this point, TYPE is the type of elements of an array,
9692 or for a function to return, or for a pointer to point to.
9693 After this sequence of ifs, TYPE is the type of the
9694 array or function or pointer, and DECLARATOR has had its
9695 outermost layer removed. */
9697 if (type
== error_mark_node
)
9699 if (TREE_CODE (declarator
) == SCOPE_REF
)
9700 declarator
= TREE_OPERAND (declarator
, 1);
9702 declarator
= TREE_OPERAND (declarator
, 0);
9705 if (quals
!= NULL_TREE
9706 && (declarator
== NULL_TREE
9707 || TREE_CODE (declarator
) != SCOPE_REF
))
9709 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9710 ctype
= TYPE_METHOD_BASETYPE (type
);
9711 if (ctype
!= NULL_TREE
)
9713 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9714 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9715 type
= TREE_TYPE (dummy
);
9720 /* See the comment for the TREE_LIST case, below. */
9723 else if (inner_attrs
)
9725 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9726 inner_attrs
= NULL_TREE
;
9729 switch (TREE_CODE (declarator
))
9733 /* We encode a declarator with embedded attributes using
9734 a TREE_LIST. The attributes apply to the declarator
9735 directly inside them, so we have to skip an iteration
9736 before applying them to the type. If the declarator just
9737 inside is the declarator-id, we apply the attrs to the
9739 inner_attrs
= TREE_PURPOSE (declarator
);
9741 declarator
= TREE_VALUE (declarator
);
9747 register tree itype
= NULL_TREE
;
9748 register tree size
= TREE_OPERAND (declarator
, 1);
9749 /* The index is a signed object `sizetype' bits wide. */
9750 tree index_type
= signed_type (sizetype
);
9752 declarator
= TREE_OPERAND (declarator
, 0);
9754 /* Check for some types that there cannot be arrays of. */
9756 if (TREE_CODE (type
) == VOID_TYPE
)
9758 cp_error ("declaration of `%D' as array of voids", dname
);
9759 type
= error_mark_node
;
9762 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9764 cp_error ("declaration of `%D' as array of functions", dname
);
9765 type
= error_mark_node
;
9768 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9769 you can't have arrays of references. If we allowed them,
9770 then we'd be saying x[i] is valid for an array x, but
9771 then you'd have to ask: what does `*(x + i)' mean? */
9772 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9774 if (decl_context
== TYPENAME
)
9775 cp_error ("cannot make arrays of references");
9777 cp_error ("declaration of `%D' as array of references",
9779 type
= error_mark_node
;
9782 if (TREE_CODE (type
) == OFFSET_TYPE
)
9784 cp_error ("declaration of `%D' as array of data members",
9786 type
= error_mark_node
;
9789 if (TREE_CODE (type
) == METHOD_TYPE
)
9791 cp_error ("declaration of `%D' as array of function members",
9793 type
= error_mark_node
;
9796 if (size
== error_mark_node
)
9797 type
= error_mark_node
;
9798 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9802 the constant expressions that specify the bounds of
9803 the arrays can be omitted only for the first member
9805 cp_error ("declaration of `%D' as multidimensional array",
9807 cp_error ("must have bounds for all dimensions except the first");
9808 type
= error_mark_node
;
9811 if (type
== error_mark_node
)
9814 /* VC++ spells a zero-sized array with []. */
9815 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9816 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9817 size
= integer_zero_node
;
9821 /* Must suspend_momentary here because the index
9822 type may need to live until the end of the function.
9823 For example, it is used in the declaration of a
9824 variable which requires destructing at the end of
9825 the function; then build_vec_delete will need this
9827 int yes
= suspend_momentary ();
9828 /* Might be a cast. */
9829 if (TREE_CODE (size
) == NOP_EXPR
9830 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9831 size
= TREE_OPERAND (size
, 0);
9832 if (TREE_READONLY_DECL_P (size
))
9833 size
= decl_constant_value (size
);
9835 /* If this involves a template parameter, it will be a
9836 constant at instantiation time, but we don't know
9837 what the value is yet. Even if no template
9838 parameters are involved, we may an expression that
9839 is not a constant; we don't even simplify `1 + 2'
9840 when processing a template. */
9841 if (processing_template_decl
)
9843 /* Resolve a qualified reference to an enumerator or
9844 static const data member of ours. */
9845 if (TREE_CODE (size
) == SCOPE_REF
9846 && TREE_OPERAND (size
, 0) == current_class_type
)
9848 tree t
= lookup_field (current_class_type
,
9849 TREE_OPERAND (size
, 1), 0, 0);
9854 itype
= build_index_type (build_min
9855 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
9856 goto dont_grok_size
;
9859 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9860 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9861 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9863 cp_error ("size of array `%D' has non-integer type",
9865 size
= integer_one_node
;
9867 if (pedantic
&& integer_zerop (size
))
9868 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9869 if (TREE_CONSTANT (size
))
9871 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9872 int old_pedantic
= pedantic
;
9873 pedantic
= flag_pedantic_errors
= 1;
9874 /* Always give overflow errors on array subscripts. */
9875 constant_expression_warning (size
);
9876 pedantic
= old_pedantic
;
9877 flag_pedantic_errors
= old_flag_pedantic_errors
;
9878 if (INT_CST_LT (size
, integer_zero_node
))
9880 cp_error ("size of array `%D' is negative", dname
);
9881 size
= integer_one_node
;
9889 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9892 cp_pedwarn ("ANSI C++ forbids variable-size array");
9897 = fold (build_binary_op (MINUS_EXPR
,
9898 cp_convert (index_type
, size
),
9899 cp_convert (index_type
,
9900 integer_one_node
)));
9901 if (! TREE_CONSTANT (itype
))
9902 itype
= variable_size (itype
);
9903 else if (TREE_OVERFLOW (itype
))
9905 error ("overflow in array dimension");
9906 TREE_OVERFLOW (itype
) = 0;
9909 itype
= build_index_type (itype
);
9912 resume_momentary (yes
);
9915 type
= build_cplus_array_type (type
, itype
);
9924 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9925 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9927 /* Declaring a function type.
9928 Make sure we have a valid type for the function to return. */
9930 /* We now know that the TYPE_QUALS don't apply to the
9931 decl, but to its return type. */
9932 type_quals
= TYPE_UNQUALIFIED
;
9934 /* Warn about some types functions can't return. */
9936 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9938 error ("`%s' declared as function returning a function", name
);
9939 type
= integer_type_node
;
9941 if (TREE_CODE (type
) == ARRAY_TYPE
)
9943 error ("`%s' declared as function returning an array", name
);
9944 type
= integer_type_node
;
9947 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9948 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9950 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9953 /* Pick up type qualifiers which should be applied to `this'. */
9954 quals
= CALL_DECLARATOR_QUALS (declarator
);
9956 /* Pick up the exception specifications. */
9957 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
9959 /* Say it's a definition only for the CALL_EXPR
9960 closest to the identifier. */
9963 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9964 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9965 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9967 if (ctype
== NULL_TREE
9968 && decl_context
== FIELD
9970 && (friendp
== 0 || dname
== current_class_name
))
9971 ctype
= current_class_type
;
9973 if (ctype
&& return_type
== return_conversion
)
9974 TYPE_HAS_CONVERSION (ctype
) = 1;
9975 if (ctype
&& constructor_name (ctype
) == dname
)
9977 /* We are within a class's scope. If our declarator name
9978 is the same as the class name, and we are defining
9979 a function, then it is a constructor/destructor, and
9980 therefore returns a void type. */
9982 if (flags
== DTOR_FLAG
)
9984 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9985 not be declared const or volatile. A destructor
9986 may not be static. */
9988 error ("destructor cannot be static member function");
9991 cp_error ("destructors may not be `%s'",
9992 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9995 if (decl_context
== FIELD
)
9997 if (! member_function_or_else (ctype
, current_class_type
,
9998 "destructor for alien class `%s' cannot be a member"))
9999 return void_type_node
;
10002 else /* It's a constructor. */
10004 if (explicitp
== 1)
10006 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10007 not be declared const or volatile. A constructor may
10008 not be virtual. A constructor may not be static. */
10010 error ("constructor cannot be static member function");
10013 pedwarn ("constructors cannot be declared virtual");
10018 cp_error ("constructors may not be `%s'",
10019 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10023 RID_BIT_TYPE tmp_bits
;
10024 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10025 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10026 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10027 if (RIDBIT_ANY_SET (tmp_bits
))
10028 error ("return value type specifier for constructor ignored");
10030 type
= build_pointer_type (ctype
);
10031 if (decl_context
== FIELD
)
10033 if (! member_function_or_else (ctype
, current_class_type
,
10034 "constructor for alien class `%s' cannot be member"))
10035 return void_type_node
;
10036 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10037 if (return_type
!= return_ctor
)
10041 if (decl_context
== FIELD
)
10047 error ("can't initialize friend function `%s'", name
);
10050 /* Cannot be both friend and virtual. */
10051 error ("virtual functions cannot be friends");
10052 RIDBIT_RESET (RID_FRIEND
, specbits
);
10055 if (decl_context
== NORMAL
)
10056 error ("friend declaration not in class definition");
10057 if (current_function_decl
&& funcdef_flag
)
10058 cp_error ("can't define friend function `%s' in a local class definition",
10062 /* Construct the function type and go to the next
10063 inner layer of declarator. */
10065 declarator
= TREE_OPERAND (declarator
, 0);
10067 /* FIXME: This is where default args should be fully
10070 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10072 if (declarator
&& flags
== DTOR_FLAG
)
10074 /* A destructor declared in the body of a class will
10075 be represented as a BIT_NOT_EXPR. But, we just
10076 want the underlying IDENTIFIER. */
10077 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10078 declarator
= TREE_OPERAND (declarator
, 0);
10080 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10081 arg_types
= void_list_node
;
10082 else if (arg_types
== NULL_TREE
10083 || arg_types
!= void_list_node
)
10085 cp_error ("destructors may not have parameters");
10086 arg_types
= void_list_node
;
10087 last_function_parms
= NULL_TREE
;
10091 /* ANSI says that `const int foo ();'
10092 does not make the function foo const. */
10093 type
= build_function_type (type
, arg_types
);
10097 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10098 if (TREE_PURPOSE (t
)
10099 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10101 add_defarg_fn (type
);
10110 /* Filter out pointers-to-references and references-to-references.
10111 We can get these if a TYPE_DECL is used. */
10113 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10115 error ("cannot declare %s to references",
10116 TREE_CODE (declarator
) == ADDR_EXPR
10117 ? "references" : "pointers");
10118 declarator
= TREE_OPERAND (declarator
, 0);
10122 if (TREE_CODE (type
) == OFFSET_TYPE
10123 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10124 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10126 cp_error ("cannot declare pointer to `%#T' member",
10128 type
= TREE_TYPE (type
);
10131 /* Merge any constancy or volatility into the target type
10132 for the pointer. */
10134 /* We now know that the TYPE_QUALS don't apply to the decl,
10135 but to the target of the pointer. */
10136 type_quals
= TYPE_UNQUALIFIED
;
10138 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10140 if (TREE_CODE (type
) == VOID_TYPE
)
10141 error ("invalid type: `void &'");
10143 type
= build_reference_type (type
);
10145 else if (TREE_CODE (type
) == METHOD_TYPE
)
10146 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10148 type
= build_pointer_type (type
);
10150 /* Process a list of type modifier keywords (such as
10151 const or volatile) that were given inside the `*' or `&'. */
10153 if (TREE_TYPE (declarator
))
10155 register tree typemodlist
;
10161 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10162 typemodlist
= TREE_CHAIN (typemodlist
))
10164 tree qualifier
= TREE_VALUE (typemodlist
);
10166 if (qualifier
== ridpointers
[(int) RID_CONST
])
10168 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10170 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10175 error ("invalid type modifier within pointer declarator");
10179 pedwarn ("duplicate `const'");
10181 pedwarn ("duplicate `volatile'");
10183 pedwarn ("duplicate `restrict'");
10185 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10186 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10187 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10188 if (TREE_CODE (declarator
) == ADDR_EXPR
10189 && (constp
|| volatilep
))
10192 pedwarn ("discarding `const' applied to a reference");
10194 pedwarn ("discarding `volatile' applied to a reference");
10195 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10197 type
= cp_build_qualified_type (type
, type_quals
);
10199 declarator
= TREE_OPERAND (declarator
, 0);
10205 /* We have converted type names to NULL_TREE if the
10206 name was bogus, or to a _TYPE node, if not.
10208 The variable CTYPE holds the type we will ultimately
10209 resolve to. The code here just needs to build
10210 up appropriate member types. */
10211 tree sname
= TREE_OPERAND (declarator
, 1);
10214 /* Destructors can have their visibilities changed as well. */
10215 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10216 sname
= TREE_OPERAND (sname
, 0);
10218 if (TREE_COMPLEXITY (declarator
) == 0)
10219 /* This needs to be here, in case we are called
10220 multiple times. */ ;
10221 else if (TREE_COMPLEXITY (declarator
) == -1)
10222 /* Namespace member. */
10223 pop_decl_namespace ();
10224 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10225 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10226 else if (! IS_AGGR_TYPE_CODE
10227 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10229 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10231 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10232 that refer to ctype. They couldn't be resolved earlier
10233 because we hadn't pushed into the class yet.
10234 Example: resolve 'B<T>::type' in
10235 'B<typename B<T>::type> B<T>::f () { }'. */
10236 if (current_template_parms
10237 && uses_template_parms (type
)
10238 && uses_template_parms (current_class_type
))
10240 tree args
= current_template_args ();
10241 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10244 /* This pop_nested_class corresponds to the
10245 push_nested_class used to push into class scope for
10246 parsing the argument list of a function decl, in
10248 pop_nested_class ();
10249 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10252 my_friendly_abort (16);
10254 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10256 /* We had a reference to a global decl, or
10257 perhaps we were given a non-aggregate typedef,
10258 in which case we cleared this out, and should just
10259 keep going as though it wasn't there. */
10260 declarator
= sname
;
10263 ctype
= TREE_OPERAND (declarator
, 0);
10266 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10268 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10269 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10270 template_count
+= 1;
10271 t
= TYPE_MAIN_DECL (t
);
10272 if (DECL_LANG_SPECIFIC (t
))
10273 t
= DECL_CLASS_CONTEXT (t
);
10278 if (sname
== NULL_TREE
)
10281 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10283 /* This is the `standard' use of the scoping operator:
10284 basetype :: member . */
10286 if (ctype
== current_class_type
)
10292 Is this ill-formed? */
10295 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10298 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10300 if (current_class_type
== NULL_TREE
10302 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10303 TYPE_ARG_TYPES (type
));
10306 cp_error ("cannot declare member function `%T::%s' within `%T'",
10307 ctype
, name
, current_class_type
);
10308 return void_type_node
;
10311 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10312 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10314 /* Have to move this code elsewhere in this function.
10315 this code is used for i.e., typedef int A::M; M *pm;
10317 It is? How? jason 10/2/94 */
10319 if (current_class_type
)
10321 cp_error ("cannot declare member `%T::%s' within `%T'",
10322 ctype
, name
, current_class_type
);
10323 return void_type_node
;
10325 type
= build_offset_type (ctype
, type
);
10327 else if (uses_template_parms (ctype
))
10329 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10331 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10332 TYPE_ARG_TYPES (type
));
10336 cp_error ("structure `%T' not yet defined", ctype
);
10337 return error_mark_node
;
10340 declarator
= sname
;
10342 else if (TREE_CODE (sname
) == SCOPE_REF
)
10343 my_friendly_abort (17);
10347 declarator
= TREE_OPERAND (declarator
, 1);
10348 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10349 /* In this case, we will deal with it later. */
10353 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10354 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10355 TYPE_ARG_TYPES (type
));
10357 type
= build_offset_type (ctype
, type
);
10364 declarator
= TREE_OPERAND (declarator
, 0);
10369 case ENUMERAL_TYPE
:
10370 declarator
= NULL_TREE
;
10374 declarator
= NULL_TREE
;
10378 my_friendly_abort (158);
10382 /* See the comment for the TREE_LIST case, above. */
10385 if (! ignore_attrs
)
10386 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10388 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10390 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10393 /* Now TYPE has the actual type. */
10395 if (explicitp
== 1)
10397 error ("only constructors can be declared `explicit'");
10401 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10403 if (type_quals
& TYPE_QUAL_CONST
)
10405 error ("const `%s' cannot be declared `mutable'", name
);
10406 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10410 error ("static `%s' cannot be declared `mutable'", name
);
10411 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10415 if (declarator
== NULL_TREE
10416 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10417 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10418 && (TREE_CODE (type
) == FUNCTION_TYPE
10419 || TREE_CODE (type
) == METHOD_TYPE
)))
10421 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10423 cp_error ("template-id `%D' used as a declarator", declarator
);
10424 declarator
= dname
;
10427 /* Unexpected declarator format. */
10428 my_friendly_abort (990210);
10430 /* If this is declaring a typedef name, return a TYPE_DECL. */
10432 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10436 /* Note that the grammar rejects storage classes
10437 in typenames, fields or parameters. */
10438 if (current_lang_name
== lang_name_java
)
10439 TYPE_FOR_JAVA (type
) = 1;
10441 if (decl_context
== FIELD
)
10443 if (declarator
== constructor_name (current_class_type
))
10444 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10446 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10450 /* Make sure this typedef lives as long as its type,
10451 since it might be used as a template parameter. */
10452 if (type
!= error_mark_node
)
10453 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10454 if (processing_template_decl
)
10455 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10457 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10458 if (type
!= error_mark_node
)
10462 /* If the user declares "typedef struct {...} foo" then the
10463 struct will have an anonymous name. Fill that name in now.
10464 Nothing can refer to it, so nothing needs know about the name
10466 if (type
!= error_mark_node
10467 && TYPE_NAME (type
)
10468 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10469 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10470 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10472 tree oldname
= TYPE_NAME (type
);
10475 /* Replace the anonymous name with the real name everywhere. */
10476 lookup_tag_reverse (type
, declarator
);
10477 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10478 if (TYPE_NAME (t
) == oldname
)
10479 TYPE_NAME (t
) = decl
;
10481 if (TYPE_LANG_SPECIFIC (type
))
10482 TYPE_WAS_ANONYMOUS (type
) = 1;
10484 /* If this is a typedef within a template class, the nested
10485 type is a (non-primary) template. The name for the
10486 template needs updating as well. */
10487 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10488 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10489 = TYPE_IDENTIFIER (type
);
10491 /* XXX Temporarily set the scope.
10492 When returning, start_decl expects it as NULL_TREE,
10493 and will then then set it using pushdecl. */
10494 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10495 if (current_class_type
)
10496 DECL_CONTEXT (decl
) = current_class_type
;
10498 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10500 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10501 DECL_ASSEMBLER_NAME (decl
)
10502 = get_identifier (build_overload_name (type
, 1, 1));
10503 DECL_CONTEXT (decl
) = NULL_TREE
;
10505 /* FIXME remangle member functions; member functions of a
10506 type with external linkage have external linkage. */
10509 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10511 cp_error_at ("typedef name may not be class-qualified", decl
);
10516 if (ctype
== NULL_TREE
)
10518 if (TREE_CODE (type
) != METHOD_TYPE
)
10519 cp_error_at ("invalid type qualifier for non-method type", decl
);
10521 ctype
= TYPE_METHOD_BASETYPE (type
);
10523 if (ctype
!= NULL_TREE
)
10524 grok_method_quals (ctype
, decl
, quals
);
10527 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10528 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10529 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10531 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10532 error ("non-object member `%s' cannot be declared mutable", name
);
10534 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10535 inlinep
, friendp
, raises
!= NULL_TREE
);
10538 error ("typedef declaration includes an initializer");
10543 /* Detect the case of an array type of unspecified size
10544 which came, as such, direct from a typedef name.
10545 We must copy the type, so that each identifier gets
10546 a distinct type, so that each identifier's size can be
10547 controlled separately by its own initializer. */
10549 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10550 && TYPE_DOMAIN (type
) == NULL_TREE
)
10552 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10555 /* If this is a type name (such as, in a cast or sizeof),
10556 compute the type and return it now. */
10558 if (decl_context
== TYPENAME
)
10560 /* Note that the grammar rejects storage classes
10561 in typenames, fields or parameters. */
10562 if (type_quals
!= TYPE_UNQUALIFIED
)
10563 type_quals
= TYPE_UNQUALIFIED
;
10565 /* Special case: "friend class foo" looks like a TYPENAME context. */
10568 if (type_quals
!= TYPE_UNQUALIFIED
)
10570 cp_error ("type qualifiers specified for friend class declaration");
10571 type_quals
= TYPE_UNQUALIFIED
;
10575 cp_error ("`inline' specified for friend class declaration");
10579 /* Only try to do this stuff if we didn't already give up. */
10580 if (type
!= integer_type_node
)
10582 /* A friendly class? */
10583 if (current_class_type
)
10584 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10586 error ("trying to make class `%s' a friend of global scope",
10587 TYPE_NAME_STRING (type
));
10588 type
= void_type_node
;
10593 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10594 if (ctype
== NULL_TREE
)
10596 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10597 ctype
= TYPE_METHOD_BASETYPE (type
);
10599 grok_method_quals (ctype
, dummy
, quals
);
10600 type
= TREE_TYPE (dummy
);
10605 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10606 && decl_context
!= CATCHPARM
10607 && TREE_CODE (type
) != UNION_TYPE
10610 cp_error ("abstract declarator `%T' used as declaration", type
);
10611 declarator
= make_anon_name ();
10614 /* `void' at top level (not within pointer)
10615 is allowed only in typedefs or type names.
10616 We don't complain about parms either, but that is because
10617 a better error message can be made later. */
10619 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10622 error ("unnamed variable or field declared void");
10623 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10625 if (IDENTIFIER_OPNAME_P (declarator
))
10626 my_friendly_abort (356);
10628 error ("variable or field `%s' declared void", name
);
10631 error ("variable or field declared void");
10632 type
= integer_type_node
;
10635 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10636 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10638 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10640 if (ctype
|| in_namespace
)
10641 error ("cannot use `::' in parameter declaration");
10643 /* A parameter declared as an array of T is really a pointer to T.
10644 One declared as a function is really a pointer to a function.
10645 One declared as a member is really a pointer to member. */
10647 if (TREE_CODE (type
) == ARRAY_TYPE
)
10649 /* Transfer const-ness of array into that of type pointed to. */
10650 type
= build_pointer_type (TREE_TYPE (type
));
10651 type_quals
= TYPE_UNQUALIFIED
;
10653 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10654 type
= build_pointer_type (type
);
10655 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10656 type
= build_pointer_type (type
);
10657 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10659 error ("declaration of `%s' as void", name
);
10665 register tree decl
;
10667 if (decl_context
== PARM
)
10669 decl
= build_decl (PARM_DECL
, declarator
, type
);
10671 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10672 inlinep
, friendp
, raises
!= NULL_TREE
);
10674 /* Compute the type actually passed in the parmlist,
10675 for the case where there is no prototype.
10676 (For example, shorts and chars are passed as ints.)
10677 When there is a prototype, this is overridden later. */
10679 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10681 else if (decl_context
== FIELD
)
10683 if (type
== error_mark_node
)
10685 /* Happens when declaring arrays of sizes which
10686 are error_mark_node, for example. */
10689 else if (in_namespace
&& !friendp
)
10691 /* Something like struct S { int N::j; }; */
10692 cp_error ("invalid use of `::'");
10695 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10698 tree function_context
;
10700 /* We catch the others as conflicts with the builtin
10702 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10704 cp_error ("function `%D' cannot be declared friend",
10711 if (ctype
== NULL_TREE
)
10712 ctype
= current_class_type
;
10714 if (ctype
== NULL_TREE
)
10716 cp_error ("can't make `%D' into a method -- not in a class",
10718 return void_type_node
;
10721 /* ``A union may [ ... ] not [ have ] virtual functions.''
10723 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10725 cp_error ("function `%D' declared virtual inside a union",
10727 return void_type_node
;
10730 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10731 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10732 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10733 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10737 cp_error ("`%D' cannot be declared virtual, since it is always static",
10742 else if (staticp
< 2)
10743 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10744 TYPE_ARG_TYPES (type
));
10747 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10748 function_context
= (ctype
!= NULL_TREE
) ?
10749 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10750 publicp
= (! friendp
|| ! staticp
)
10751 && function_context
== NULL_TREE
;
10752 decl
= grokfndecl (ctype
, type
,
10753 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10754 ? declarator
: dname
,
10756 virtualp
, flags
, quals
, raises
,
10757 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10758 funcdef_flag
, template_count
, in_namespace
);
10759 if (decl
== NULL_TREE
)
10762 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10763 /* The decl and setting of decl_machine_attr is also turned off. */
10764 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10767 /* [class.conv.ctor]
10769 A constructor declared without the function-specifier
10770 explicit that can be called with a single parameter
10771 specifies a conversion from the type of its first
10772 parameter to the type of its class. Such a constructor
10773 is called a converting constructor. */
10774 if (explicitp
== 2)
10775 DECL_NONCONVERTING_P (decl
) = 1;
10776 else if (DECL_CONSTRUCTOR_P (decl
))
10778 /* The constructor can be called with exactly one
10779 parameter if there is at least one parameter, and
10780 any subsequent parameters have default arguments.
10781 We don't look at the first parameter, which is
10782 really just the `this' parameter for the new
10785 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10787 /* Skip the `in_chrg' argument too, if present. */
10788 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10789 arg_types
= TREE_CHAIN (arg_types
);
10791 if (arg_types
== void_list_node
10793 && TREE_CHAIN (arg_types
)
10794 && TREE_CHAIN (arg_types
) != void_list_node
10795 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10796 DECL_NONCONVERTING_P (decl
) = 1;
10799 else if (TREE_CODE (type
) == METHOD_TYPE
)
10801 /* We only get here for friend declarations of
10802 members of other classes. */
10803 /* All method decls are public, so tell grokfndecl to set
10804 TREE_PUBLIC, also. */
10805 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10806 virtualp
, flags
, quals
, raises
,
10807 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10808 template_count
, in_namespace
);
10809 if (decl
== NULL_TREE
)
10812 else if (!staticp
&& ! processing_template_decl
10813 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10814 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10817 cp_error ("field `%D' has incomplete type", declarator
);
10819 cp_error ("name `%T' has incomplete type", type
);
10821 /* If we're instantiating a template, tell them which
10822 instantiation made the field's type be incomplete. */
10823 if (current_class_type
10824 && TYPE_NAME (current_class_type
)
10825 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10826 && declspecs
&& TREE_VALUE (declspecs
)
10827 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10828 cp_error (" in instantiation of template `%T'",
10829 current_class_type
);
10831 type
= error_mark_node
;
10838 error ("`%s' is neither function nor method; cannot be declared friend",
10839 IDENTIFIER_POINTER (declarator
));
10847 /* Friends are treated specially. */
10848 if (ctype
== current_class_type
)
10849 warning ("member functions are implicitly friends of their class");
10852 tree t
= NULL_TREE
;
10853 if (decl
&& DECL_NAME (decl
))
10855 if (template_class_depth (current_class_type
) == 0)
10858 = check_explicit_specialization
10860 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10861 if (decl
== error_mark_node
)
10862 return error_mark_node
;
10865 t
= do_friend (ctype
, declarator
, decl
,
10866 last_function_parms
, attrlist
, flags
, quals
,
10869 if (t
&& funcdef_flag
)
10872 return void_type_node
;
10876 /* Structure field. It may not be a function, except for C++ */
10878 if (decl
== NULL_TREE
)
10884 /* An attempt is being made to initialize a non-static
10885 member. But, from [class.mem]:
10887 4 A member-declarator can contain a
10888 constant-initializer only if it declares a static
10889 member (_class.static_) of integral or enumeration
10890 type, see _class.static.data_.
10892 This used to be relatively common practice, but
10893 the rest of the compiler does not correctly
10894 handle the initialization unless the member is
10895 static so we make it static below. */
10896 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10898 cp_pedwarn ("making `%D' static", declarator
);
10902 if (uses_template_parms (type
))
10903 /* We'll check at instantiation time. */
10905 else if (check_static_variable_definition (declarator
,
10907 /* If we just return the declaration, crashes
10908 will sometimes occur. We therefore return
10909 void_type_node, as if this was a friend
10910 declaration, to cause callers to completely
10911 ignore this declaration. */
10912 return void_type_node
;
10915 /* 9.2p13 [class.mem] */
10916 if (declarator
== constructor_name (current_class_type
)
10917 /* Divergence from the standard: In extern "C", we
10918 allow non-static data members here, because C does
10919 and /usr/include/netinet/in.h uses that. */
10920 && (staticp
|| ! in_system_header
))
10921 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10926 /* C++ allows static class members. All other work
10927 for this is done by grokfield. */
10928 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10929 TREE_STATIC (decl
) = 1;
10930 /* In class context, 'static' means public access. */
10931 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10935 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10936 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10938 DECL_MUTABLE_P (decl
) = 1;
10939 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10943 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10944 inlinep
, friendp
, raises
!= NULL_TREE
);
10947 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10949 tree original_name
;
10955 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10956 original_name
= dname
;
10958 original_name
= declarator
;
10960 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10961 error ("storage class `auto' invalid for function `%s'", name
);
10962 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10963 error ("storage class `register' invalid for function `%s'", name
);
10965 /* Function declaration not at top level.
10966 Storage classes other than `extern' are not allowed
10967 and `extern' makes no difference. */
10968 if (! toplevel_bindings_p ()
10969 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10970 || RIDBIT_SETP (RID_INLINE
, specbits
))
10973 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10974 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
10976 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
10979 if (ctype
== NULL_TREE
)
10983 error ("virtual non-class function `%s'", name
);
10987 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
10988 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10989 TYPE_ARG_TYPES (type
));
10991 /* Record presence of `static'. */
10992 publicp
= (ctype
!= NULL_TREE
10993 || RIDBIT_SETP (RID_EXTERN
, specbits
)
10994 || !RIDBIT_SETP (RID_STATIC
, specbits
));
10996 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
10997 virtualp
, flags
, quals
, raises
,
10999 publicp
, inlinep
, funcdef_flag
,
11000 template_count
, in_namespace
);
11001 if (decl
== NULL_TREE
)
11006 int illegal_static
= 0;
11008 /* Don't allow a static member function in a class, and forbid
11009 declaring main to be static. */
11010 if (TREE_CODE (type
) == METHOD_TYPE
)
11012 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11013 illegal_static
= 1;
11015 else if (current_function_decl
)
11017 /* FIXME need arm citation */
11018 error ("cannot declare static function inside another function");
11019 illegal_static
= 1;
11022 if (illegal_static
)
11025 RIDBIT_RESET (RID_STATIC
, specbits
);
11031 /* It's a variable. */
11033 /* An uninitialized decl with `extern' is a reference. */
11034 decl
= grokvardecl (type
, declarator
, &specbits
,
11036 (type_quals
& TYPE_QUAL_CONST
) != 0,
11038 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11039 inlinep
, friendp
, raises
!= NULL_TREE
);
11043 DECL_CONTEXT (decl
) = ctype
;
11046 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11048 RIDBIT_RESET (RID_STATIC
, specbits
);
11050 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11052 cp_error ("static member `%D' declared `register'", decl
);
11053 RIDBIT_RESET (RID_REGISTER
, specbits
);
11055 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11057 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11059 RIDBIT_RESET (RID_EXTERN
, specbits
);
11064 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11066 error ("`%s' cannot be declared mutable", name
);
11069 /* Record `register' declaration for warnings on &
11070 and in case doing stupid register allocation. */
11072 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11073 DECL_REGISTER (decl
) = 1;
11075 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11076 DECL_THIS_EXTERN (decl
) = 1;
11078 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11079 DECL_THIS_STATIC (decl
) = 1;
11081 /* Record constancy and volatility. There's no need to do this
11082 when processing a template; we'll do this for the instantiated
11083 declaration based on the type of DECL. */
11084 if (!processing_template_decl
)
11085 c_apply_type_quals_to_decl (type_quals
, decl
);
11091 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11092 An empty exprlist is a parmlist. An exprlist which
11093 contains only identifiers at the global level
11094 is a parmlist. Otherwise, it is an exprlist. */
11097 parmlist_is_exprlist (exprs
)
11100 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11103 if (toplevel_bindings_p ())
11105 /* At the global level, if these are all identifiers,
11106 then it is a parmlist. */
11109 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11111 exprs
= TREE_CHAIN (exprs
);
11118 /* Subroutine of start_function. Ensure that each of the parameter
11119 types (as listed in PARMS) is complete, as is required for a
11120 function definition. */
11123 require_complete_types_for_parms (parms
)
11128 tree type
= TREE_TYPE (parms
);
11129 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11131 if (DECL_NAME (parms
))
11132 error ("parameter `%s' has incomplete type",
11133 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11135 error ("parameter has incomplete type");
11136 TREE_TYPE (parms
) = error_mark_node
;
11139 layout_decl (parms
, 0);
11141 parms
= TREE_CHAIN (parms
);
11145 /* Returns DECL if DECL is a local variable (or parameter). Returns
11146 NULL_TREE otherwise. */
11149 local_variable_p (t
)
11152 if ((TREE_CODE (t
) == VAR_DECL
11153 /* A VAR_DECL with a context that is a _TYPE is a static data
11155 && !TYPE_P (CP_DECL_CONTEXT (t
))
11156 /* Any other non-local variable must be at namespace scope. */
11157 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11158 || (TREE_CODE (t
) == PARM_DECL
))
11164 /* Check that ARG, which is a default-argument expression for a
11165 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11166 something goes wrong. DECL may also be a _TYPE node, rather than a
11167 DECL, if there is no DECL available. */
11170 check_default_argument (decl
, arg
)
11177 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11178 /* We get a DEFAULT_ARG when looking at an in-class declaration
11179 with a default argument. Ignore the argument for now; we'll
11180 deal with it after the class is complete. */
11183 if (processing_template_decl
|| uses_template_parms (arg
))
11184 /* We don't do anything checking until instantiation-time. Note
11185 that there may be uninstantiated arguments even for an
11186 instantiated function, since default arguments are not
11187 instantiated until they are needed. */
11196 decl_type
= TREE_TYPE (decl
);
11198 if (arg
== error_mark_node
11199 || decl
== error_mark_node
11200 || TREE_TYPE (arg
) == error_mark_node
11201 || decl_type
== error_mark_node
)
11202 /* Something already went wrong. There's no need to check
11204 return error_mark_node
;
11206 /* [dcl.fct.default]
11208 A default argument expression is implicitly converted to the
11210 if (!TREE_TYPE (arg
)
11211 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11214 cp_error ("default argument for `%#D' has type `%T'",
11215 decl
, TREE_TYPE (arg
));
11217 cp_error ("default argument for parameter of type `%T' has type `%T'",
11218 decl_type
, TREE_TYPE (arg
));
11220 return error_mark_node
;
11223 /* [dcl.fct.default]
11225 Local variables shall not be used in default argument
11228 The keyword `this' shall not be used in a default argument of a
11229 member function. */
11230 var
= search_tree (arg
, local_variable_p
);
11233 cp_error ("default argument `%E' uses local variable `%D'",
11235 return error_mark_node
;
11242 /* Decode the list of parameter types for a function type.
11243 Given the list of things declared inside the parens,
11244 return a list of types.
11246 The list we receive can have three kinds of elements:
11247 an IDENTIFIER_NODE for names given without types,
11248 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11249 or void_type_node, to mark the end of an argument list
11250 when additional arguments are not permitted (... was not used).
11252 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11253 a mere declaration. A nonempty identifier-list gets an error message
11254 when FUNCDEF_FLAG is zero.
11255 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11256 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11258 If all elements of the input list contain types,
11259 we return a list of the types.
11260 If all elements contain no type (except perhaps a void_type_node
11261 at the end), we return a null list.
11262 If some have types and some do not, it is an error, and we
11263 return a null list.
11265 Also set last_function_parms to either
11266 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11267 A list of names is converted to a chain of PARM_DECLs
11268 by store_parm_decls so that ultimately it is always a chain of decls.
11270 Note that in C++, parameters can take default values. These default
11271 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11272 an error to specify default values which are followed by parameters
11273 that have no default values, or an ELLIPSES. For simplicities sake,
11274 only parameters which are specified with their types can take on
11278 grokparms (first_parm
, funcdef_flag
)
11282 tree result
= NULL_TREE
;
11283 tree decls
= NULL_TREE
;
11285 if (first_parm
!= NULL_TREE
11286 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11288 if (! funcdef_flag
)
11289 pedwarn ("parameter names (without types) in function declaration");
11290 last_function_parms
= first_parm
;
11293 else if (first_parm
!= NULL_TREE
11294 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11295 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11296 my_friendly_abort (145);
11299 /* Types were specified. This is a list of declarators
11300 each represented as a TREE_LIST node. */
11301 register tree parm
, chain
;
11302 int any_init
= 0, any_error
= 0;
11304 if (first_parm
!= NULL_TREE
)
11306 tree last_result
= NULL_TREE
;
11307 tree last_decl
= NULL_TREE
;
11309 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11311 tree type
= NULL_TREE
, list_node
= parm
;
11312 register tree decl
= TREE_VALUE (parm
);
11313 tree init
= TREE_PURPOSE (parm
);
11315 chain
= TREE_CHAIN (parm
);
11316 /* @@ weak defense against parse errors. */
11317 if (TREE_CODE (decl
) != VOID_TYPE
11318 && TREE_CODE (decl
) != TREE_LIST
)
11320 /* Give various messages as the need arises. */
11321 if (TREE_CODE (decl
) == STRING_CST
)
11322 cp_error ("invalid string constant `%E'", decl
);
11323 else if (TREE_CODE (decl
) == INTEGER_CST
)
11324 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11328 if (TREE_CODE (decl
) != VOID_TYPE
)
11330 decl
= grokdeclarator (TREE_VALUE (decl
),
11331 TREE_PURPOSE (decl
),
11332 PARM
, init
!= NULL_TREE
,
11334 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11337 /* Top-level qualifiers on the parameters are
11338 ignored for function types. */
11339 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11341 if (TREE_CODE (type
) == VOID_TYPE
)
11342 decl
= void_type_node
;
11343 else if (TREE_CODE (type
) == METHOD_TYPE
)
11345 if (DECL_NAME (decl
))
11346 /* Cannot use the decl here because
11347 we don't have DECL_CONTEXT set up yet. */
11348 cp_error ("parameter `%D' invalidly declared method type",
11351 error ("parameter invalidly declared method type");
11352 type
= build_pointer_type (type
);
11353 TREE_TYPE (decl
) = type
;
11355 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11357 if (DECL_NAME (decl
))
11358 cp_error ("parameter `%D' invalidly declared offset type",
11361 error ("parameter invalidly declared offset type");
11362 type
= build_pointer_type (type
);
11363 TREE_TYPE (decl
) = type
;
11365 else if (abstract_virtuals_error (decl
, type
))
11366 any_error
= 1; /* Seems like a good idea. */
11367 else if (POINTER_TYPE_P (type
))
11370 while (POINTER_TYPE_P (t
)
11371 || (TREE_CODE (t
) == ARRAY_TYPE
11372 && TYPE_DOMAIN (t
) != NULL_TREE
))
11374 if (TREE_CODE (t
) == ARRAY_TYPE
)
11375 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11377 TYPE_PTR_P (type
) ? "pointer" : "reference");
11381 if (TREE_CODE (decl
) == VOID_TYPE
)
11383 if (result
== NULL_TREE
)
11385 result
= void_list_node
;
11386 last_result
= result
;
11390 TREE_CHAIN (last_result
) = void_list_node
;
11391 last_result
= void_list_node
;
11394 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11395 error ("`void' in parameter list must be entire list");
11399 /* Since there is a prototype, args are passed in their own types. */
11400 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11401 if (PROMOTE_PROTOTYPES
11402 && (TREE_CODE (type
) == INTEGER_TYPE
11403 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11404 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11405 DECL_ARG_TYPE (decl
) = integer_type_node
;
11406 if (!any_error
&& init
)
11409 init
= check_default_argument (decl
, init
);
11414 if (decls
== NULL_TREE
)
11421 TREE_CHAIN (last_decl
) = decl
;
11424 list_node
= tree_cons (init
, type
, NULL_TREE
);
11425 if (result
== NULL_TREE
)
11427 result
= list_node
;
11428 last_result
= result
;
11432 TREE_CHAIN (last_result
) = list_node
;
11433 last_result
= list_node
;
11437 TREE_CHAIN (last_result
) = NULL_TREE
;
11438 /* If there are no parameters, and the function does not end
11439 with `...', then last_decl will be NULL_TREE. */
11440 if (last_decl
!= NULL_TREE
)
11441 TREE_CHAIN (last_decl
) = NULL_TREE
;
11445 last_function_parms
= decls
;
11450 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11451 FUNCTION_TYPE with the newly parsed version of its default argument, which
11452 was previously digested as text. See snarf_defarg et al in lex.c. */
11455 replace_defarg (arg
, init
)
11458 if (! processing_template_decl
11459 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11460 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11461 TREE_TYPE (init
), TREE_VALUE (arg
));
11462 TREE_PURPOSE (arg
) = init
;
11469 tree t
= FUNCTION_ARG_CHAIN (d
);
11470 if (DECL_CONSTRUCTOR_P (d
)
11471 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11472 t
= TREE_CHAIN (t
);
11473 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11474 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11475 == DECL_CLASS_CONTEXT (d
))
11476 && (TREE_CHAIN (t
) == NULL_TREE
11477 || TREE_CHAIN (t
) == void_list_node
11478 || TREE_PURPOSE (TREE_CHAIN (t
))))
11483 /* These memoizing functions keep track of special properties which
11484 a class may have. `grok_ctor_properties' notices whether a class
11485 has a constructor of the form X(X&), and also complains
11486 if the class has a constructor of the form X(X).
11487 `grok_op_properties' takes notice of the various forms of
11488 operator= which are defined, as well as what sorts of type conversion
11489 may apply. Both functions take a FUNCTION_DECL as an argument. */
11492 grok_ctor_properties (ctype
, decl
)
11495 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11496 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11498 /* When a type has virtual baseclasses, a magical first int argument is
11499 added to any ctor so we can tell if the class has been initialized
11500 yet. This could screw things up in this function, so we deliberately
11501 ignore the leading int if we're in that situation. */
11502 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11504 my_friendly_assert (parmtypes
11505 && TREE_VALUE (parmtypes
) == integer_type_node
,
11507 parmtypes
= TREE_CHAIN (parmtypes
);
11508 parmtype
= TREE_VALUE (parmtypes
);
11513 A non-template constructor for class X is a copy constructor if
11514 its first parameter is of type X&, const X&, volatile X& or const
11515 volatile X&, and either there are no other parameters or else all
11516 other parameters have default arguments. */
11517 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11518 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11519 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11520 || TREE_CHAIN (parmtypes
) == void_list_node
11521 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11522 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11523 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11525 TYPE_HAS_INIT_REF (ctype
) = 1;
11526 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11527 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11531 A declaration of a constructor for a class X is ill-formed if its
11532 first parameter is of type (optionally cv-qualified) X and either
11533 there are no other parameters or else all other parameters have
11536 We *don't* complain about member template instantiations that
11537 have this form, though; they can occur as we try to decide what
11538 constructor to use during overload resolution. Since overload
11539 resolution will never prefer such a constructor to the
11540 non-template copy constructor (which is either explicitly or
11541 implicitly defined), there's no need to worry about their
11542 existence. Theoretically, they should never even be
11543 instantiated, but that's hard to forestall. */
11544 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11545 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11546 || TREE_CHAIN (parmtypes
) == void_list_node
11547 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11548 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11549 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11551 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11553 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11556 else if (TREE_CODE (parmtype
) == VOID_TYPE
11557 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11558 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11563 /* An operator with this name can be either unary or binary. */
11569 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11570 || name
== ansi_opname
[(int) ADDR_EXPR
]
11571 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11572 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11573 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11574 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11577 /* An operator with this name can only be unary. */
11583 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11584 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11585 || name
== ansi_opname
[(int) COMPONENT_REF
]
11586 || IDENTIFIER_TYPENAME_P (name
));
11589 /* Do a little sanity-checking on how they declared their operator. */
11592 grok_op_properties (decl
, virtualp
, friendp
)
11594 int virtualp
, friendp
;
11596 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11597 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11598 tree name
= DECL_NAME (decl
);
11600 if (current_class_type
== NULL_TREE
)
11607 A user-declared copy assignment operator X::operator= is a
11608 non-static non-template member function of class X with
11609 exactly one parameter of type X, X&, const X&, volatile X& or
11610 const volatile X&. */
11611 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11612 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11613 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11615 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11616 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11617 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11618 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11619 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11620 || name
== ansi_opname
[(int) MEMBER_REF
])
11621 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11622 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11623 TYPE_GETS_NEW (current_class_type
) |= 1;
11624 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11625 TYPE_GETS_DELETE (current_class_type
) |= 1;
11626 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11627 TYPE_GETS_NEW (current_class_type
) |= 2;
11628 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11629 TYPE_GETS_DELETE (current_class_type
) |= 2;
11632 if (name
== ansi_opname
[(int) NEW_EXPR
]
11633 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11635 /* When the compiler encounters the definition of A::operator new, it
11636 doesn't look at the class declaration to find out if it's static. */
11638 revert_static_member_fn (&decl
, NULL
, NULL
);
11640 /* Take care of function decl if we had syntax errors. */
11641 if (argtypes
== NULL_TREE
)
11643 = build_function_type (ptr_type_node
,
11644 hash_tree_chain (integer_type_node
,
11647 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11649 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11650 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11653 revert_static_member_fn (&decl
, NULL
, NULL
);
11655 if (argtypes
== NULL_TREE
)
11657 = build_function_type (void_type_node
,
11658 hash_tree_chain (ptr_type_node
,
11662 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11664 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11665 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11666 != void_list_node
))
11667 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11672 /* An operator function must either be a non-static member function
11673 or have at least one parameter of a class, a reference to a class,
11674 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11675 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11677 if (IDENTIFIER_TYPENAME_P (name
)
11678 || name
== ansi_opname
[(int) CALL_EXPR
]
11679 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11680 || name
== ansi_opname
[(int) COMPONENT_REF
]
11681 || name
== ansi_opname
[(int) ARRAY_REF
])
11682 cp_error ("`%D' must be a nonstatic member function", decl
);
11687 if (DECL_STATIC_FUNCTION_P (decl
))
11688 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11691 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11693 tree arg
= TREE_VALUE (p
);
11694 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11695 arg
= TREE_TYPE (arg
);
11697 /* This lets bad template code slip through. */
11698 if (IS_AGGR_TYPE (arg
)
11699 || TREE_CODE (arg
) == ENUMERAL_TYPE
11700 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11701 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11705 ("`%D' must have an argument of class or enumerated type",
11712 if (name
== ansi_opname
[(int) CALL_EXPR
])
11713 return; /* No restrictions on args. */
11715 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11717 tree t
= TREE_TYPE (name
);
11718 if (TREE_CODE (t
) == VOID_TYPE
)
11719 pedwarn ("void is not a valid type conversion operator");
11720 else if (! friendp
)
11722 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11723 const char *what
= 0;
11725 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11727 if (t
== current_class_type
)
11728 what
= "the same type";
11729 /* Don't force t to be complete here. */
11730 else if (IS_AGGR_TYPE (t
)
11732 && DERIVED_FROM_P (t
, current_class_type
))
11733 what
= "a base class";
11736 warning ("conversion to %s%s will never use a type conversion operator",
11737 ref
? "a reference to " : "", what
);
11741 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11745 if (list_length (argtypes
) != 3 && methodp
)
11747 cp_error ("`%D' must take exactly one argument", decl
);
11750 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11752 if (copy_assignment_arg_p (parmtype
, virtualp
)
11755 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11756 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11757 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11758 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11761 else if (name
== ansi_opname
[(int) COND_EXPR
])
11764 cp_error ("ANSI C++ prohibits overloading operator ?:");
11766 else if (ambi_op_p (name
))
11768 if (list_length (argtypes
) == 2)
11770 else if (list_length (argtypes
) == 3)
11772 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11773 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11774 && ! processing_template_decl
11775 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11778 cp_error ("postfix `%D' must take `int' as its argument",
11782 ("postfix `%D' must take `int' as its second argument",
11789 cp_error ("`%D' must take either zero or one argument", decl
);
11791 cp_error ("`%D' must take either one or two arguments", decl
);
11794 /* More Effective C++ rule 6. */
11796 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11797 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11799 tree arg
= TREE_VALUE (argtypes
);
11800 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11801 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11802 arg
= TREE_TYPE (arg
);
11803 arg
= TYPE_MAIN_VARIANT (arg
);
11804 if (list_length (argtypes
) == 2)
11806 if (TREE_CODE (ret
) != REFERENCE_TYPE
11807 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11809 cp_warning ("prefix `%D' should return `%T'", decl
,
11810 build_reference_type (arg
));
11814 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11815 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11819 else if (unary_op_p (name
))
11821 if (list_length (argtypes
) != 2)
11824 cp_error ("`%D' must take `void'", decl
);
11826 cp_error ("`%D' must take exactly one argument", decl
);
11829 else /* if (binary_op_p (name)) */
11831 if (list_length (argtypes
) != 3)
11834 cp_error ("`%D' must take exactly one argument", decl
);
11836 cp_error ("`%D' must take exactly two arguments", decl
);
11839 /* More Effective C++ rule 7. */
11841 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11842 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11843 || name
== ansi_opname
[COMPOUND_EXPR
]))
11844 cp_warning ("user-defined `%D' always evaluates both arguments",
11848 /* Effective C++ rule 23. */
11850 && list_length (argtypes
) == 3
11851 && (name
== ansi_opname
[PLUS_EXPR
]
11852 || name
== ansi_opname
[MINUS_EXPR
]
11853 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11854 || name
== ansi_opname
[MULT_EXPR
])
11855 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11856 cp_warning ("`%D' should return by value", decl
);
11860 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11861 if (TREE_PURPOSE (argtypes
))
11863 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11864 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11865 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11868 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11871 cp_error ("`%D' cannot have default arguments", decl
);
11876 static const char *
11878 enum tag_types code
;
11891 my_friendly_abort (981122);
11895 /* Get the struct, enum or union (CODE says which) with tag NAME.
11896 Define the tag as a forward-reference if it is not defined.
11898 C++: If a class derivation is given, process it here, and report
11899 an error if multiple derivation declarations are not identical.
11901 If this is a definition, come in through xref_tag and only look in
11902 the current frame for the name (since C++ allows new names in any
11906 xref_tag (code_type_node
, name
, globalize
)
11907 tree code_type_node
;
11911 enum tag_types tag_code
;
11912 enum tree_code code
;
11914 register tree ref
, t
;
11915 struct binding_level
*b
= current_binding_level
;
11917 tree attributes
= NULL_TREE
;
11918 tree context
= NULL_TREE
;
11920 /* If we are called from the parser, code_type_node will sometimes be a
11921 TREE_LIST. This indicates that the user wrote
11922 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11924 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11926 attributes
= TREE_PURPOSE (code_type_node
);
11927 code_type_node
= TREE_VALUE (code_type_node
);
11930 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11935 code
= RECORD_TYPE
;
11941 code
= ENUMERAL_TYPE
;
11944 my_friendly_abort (18);
11947 /* If a cross reference is requested, look up the type
11948 already defined for this tag and return it. */
11949 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11952 name
= TYPE_IDENTIFIER (t
);
11956 t
= IDENTIFIER_TYPE_VALUE (name
);
11958 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11959 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11964 /* If we know we are defining this tag, only look it up in
11965 this scope and don't try to find it as a type. */
11966 ref
= lookup_tag (code
, name
, b
, 1);
11972 /* [dcl.type.elab] If the identifier resolves to a
11973 typedef-name or a template type-parameter, the
11974 elaborated-type-specifier is ill-formed. */
11975 if (t
!= TYPE_MAIN_VARIANT (t
)
11976 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
11977 cp_pedwarn ("using typedef-name `%D' after `%s'",
11978 TYPE_NAME (t
), tag_name (tag_code
));
11979 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
11980 cp_error ("using template type parameter `%T' after `%s'",
11981 t
, tag_name (tag_code
));
11986 ref
= lookup_tag (code
, name
, b
, 0);
11990 /* Try finding it as a type declaration. If that wins,
11992 ref
= lookup_name (name
, 1);
11994 if (ref
!= NULL_TREE
11995 && processing_template_decl
11996 && DECL_CLASS_TEMPLATE_P (ref
)
11997 && template_class_depth (current_class_type
) == 0)
11998 /* Since GLOBALIZE is true, we're declaring a global
11999 template, so we want this type. */
12000 ref
= DECL_RESULT (ref
);
12002 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12003 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12004 ref
= TREE_TYPE (ref
);
12009 if (ref
&& current_class_type
12010 && template_class_depth (current_class_type
)
12011 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12013 /* Since GLOBALIZE is non-zero, we are not looking at a
12014 definition of this tag. Since, in addition, we are currently
12015 processing a (member) template declaration of a template
12016 class, we must be very careful; consider:
12023 { template <class V>
12024 friend struct S1; };
12026 Here, the S2::S1 declaration should not be confused with the
12027 outer declaration. In particular, the inner version should
12028 have a template parameter of level 2, not level 1. This
12029 would be particularly important if the member declaration
12032 template <class V = U> friend struct S1;
12034 say, when we should tsubst into `U' when instantiating
12035 S2. On the other hand, when presented with:
12045 we must find the inner binding eventually. We
12046 accomplish this by making sure that the new type we
12047 create to represent this declaration has the right
12049 context
= TYPE_CONTEXT (ref
);
12054 push_obstacks_nochange ();
12058 /* If no such tag is yet defined, create a forward-reference node
12059 and record it as the "definition".
12060 When a real declaration of this type is found,
12061 the forward-reference will be altered into a real type. */
12063 /* In C++, since these migrate into the global scope, we must
12064 build them on the permanent obstack. */
12066 temp
= allocation_temporary_p ();
12068 end_temporary_allocation ();
12070 if (code
== ENUMERAL_TYPE
)
12072 cp_error ("use of enum `%#D' without previous declaration", name
);
12074 ref
= make_node (ENUMERAL_TYPE
);
12076 /* Give the type a default layout like unsigned int
12077 to avoid crashing if it does not get defined. */
12078 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12079 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12080 TREE_UNSIGNED (ref
) = 1;
12081 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12082 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12083 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12085 /* Enable us to recognize when a type is created in class context.
12086 To do nested classes correctly, this should probably be cleared
12087 out when we leave this classes scope. Currently this in only
12088 done in `start_enum'. */
12090 pushtag (name
, ref
, globalize
);
12094 struct binding_level
*old_b
= class_binding_level
;
12096 ref
= make_lang_type (code
);
12097 TYPE_CONTEXT (ref
) = context
;
12099 #ifdef NONNESTED_CLASSES
12100 /* Class types don't nest the way enums do. */
12101 class_binding_level
= (struct binding_level
*)0;
12103 pushtag (name
, ref
, globalize
);
12104 class_binding_level
= old_b
;
12109 /* If it no longer looks like a nested type, make sure it's
12111 If it is not an IDENTIFIER, this is not a declaration */
12112 if (b
->namespace_p
&& !class_binding_level
12113 && TREE_CODE (name
) == IDENTIFIER_NODE
)
12115 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12116 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12119 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12120 redeclare_class_template (ref
, current_template_parms
);
12123 /* Until the type is defined, tentatively accept whatever
12124 structure tag the user hands us. */
12125 if (TYPE_SIZE (ref
) == NULL_TREE
12126 && ref
!= current_class_type
12127 /* Have to check this, in case we have contradictory tag info. */
12128 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12130 if (tag_code
== class_type
)
12131 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12132 else if (tag_code
== record_type
)
12133 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12138 TREE_TYPE (ref
) = attributes
;
12144 xref_tag_from_type (old
, id
, globalize
)
12148 tree code_type_node
;
12150 if (TREE_CODE (old
) == RECORD_TYPE
)
12151 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12152 ? class_type_node
: record_type_node
);
12154 code_type_node
= union_type_node
;
12156 if (id
== NULL_TREE
)
12157 id
= TYPE_IDENTIFIER (old
);
12159 return xref_tag (code_type_node
, id
, globalize
);
12162 /* REF is a type (named NAME), for which we have just seen some
12163 baseclasses. BINFO is a list of those baseclasses; the
12164 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12165 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12166 struct, or union. */
12169 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12170 tree code_type_node
;
12174 /* In the declaration `A : X, Y, ... Z' we mark all the types
12175 (A, X, Y, ..., Z) so we can check for duplicates. */
12180 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12182 if (tag_code
== union_type
)
12184 cp_error ("derived union `%T' invalid", ref
);
12188 len
= list_length (binfo
);
12189 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12191 /* First, make sure that any templates in base-classes are
12192 instantiated. This ensures that if we call ourselves recursively
12193 we do not get confused about which classes are marked and which
12195 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12196 complete_type (TREE_VALUE (base
));
12198 SET_CLASSTYPE_MARKED (ref
);
12199 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12201 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12203 /* The base of a derived struct is public by default. */
12205 = (TREE_PURPOSE (binfo
) == access_public_node
12206 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12207 || (tag_code
!= class_type
12208 && (TREE_PURPOSE (binfo
) == access_default_node
12209 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12211 = (TREE_PURPOSE (binfo
) == access_protected_node
12212 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12214 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12215 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12216 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12217 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12218 tree basetype
= TREE_VALUE (binfo
);
12221 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12222 basetype
= TREE_TYPE (basetype
);
12224 || (TREE_CODE (basetype
) != RECORD_TYPE
12225 && TREE_CODE (basetype
) != TYPENAME_TYPE
12226 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12227 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12229 cp_error ("base type `%T' fails to be a struct or class type",
12230 TREE_VALUE (binfo
));
12234 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12236 /* This code replaces similar code in layout_basetypes.
12237 We put the complete_type first for implicit `typename'. */
12238 if (TYPE_SIZE (basetype
) == NULL_TREE
12239 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12241 cp_error ("base class `%T' has incomplete type", basetype
);
12246 if (CLASSTYPE_MARKED (basetype
))
12248 if (basetype
== ref
)
12249 cp_error ("recursive type `%T' undefined", basetype
);
12251 cp_error ("duplicate base type `%T' invalid", basetype
);
12255 if (TYPE_FOR_JAVA (basetype
)
12256 && (current_lang_stack
12257 == &VARRAY_TREE (current_lang_base
, 0)))
12258 TYPE_FOR_JAVA (ref
) = 1;
12260 /* Note that the BINFO records which describe individual
12261 inheritances are *not* shared in the lattice! They
12262 cannot be shared because a given baseclass may be
12263 inherited with different `accessibility' by different
12264 derived classes. (Each BINFO record describing an
12265 individual inheritance contains flags which say what
12266 the `accessibility' of that particular inheritance is.) */
12269 = make_binfo (integer_zero_node
, basetype
,
12270 CLASS_TYPE_P (basetype
)
12271 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12272 CLASS_TYPE_P (basetype
)
12273 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12275 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12276 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12277 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12278 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12279 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12281 /* We need to unshare the binfos now so that lookups during class
12282 definition work. */
12283 unshare_base_binfos (base_binfo
);
12285 SET_CLASSTYPE_MARKED (basetype
);
12287 /* We are free to modify these bits because they are meaningless
12288 at top level, and BASETYPE is a top-level type. */
12289 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12291 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12292 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12295 if (CLASS_TYPE_P (basetype
))
12297 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12298 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12305 TREE_VEC_LENGTH (binfos
) = i
;
12307 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12310 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12313 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12315 if (CLASS_TYPE_P (basetype
))
12316 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12317 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12320 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12321 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12323 /* Unmark all the types. */
12325 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12326 CLEAR_CLASSTYPE_MARKED (ref
);
12328 /* Now that we know all the base-classes, set up the list of virtual
12330 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12336 /* Begin compiling the definition of an enumeration type.
12337 NAME is its name (or null if anonymous).
12338 Returns the type object, as yet incomplete.
12339 Also records info about it so that build_enumerator
12340 may be used to declare the individual values as they are read. */
12346 register tree enumtype
= NULL_TREE
;
12347 struct binding_level
*b
= current_binding_level
;
12349 /* We are wasting space here and putting these on the permanent_obstack so
12350 that typeid(local enum) will work correctly. */
12351 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12353 /* If this is the real definition for a previous forward reference,
12354 fill in the contents in the same object that used to be the
12355 forward reference. */
12357 if (name
!= NULL_TREE
)
12358 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12360 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12362 cp_error ("multiple definition of `%#T'", enumtype
);
12363 cp_error_at ("previous definition here", enumtype
);
12367 enumtype
= make_node (ENUMERAL_TYPE
);
12368 pushtag (name
, enumtype
, 0);
12371 if (current_class_type
)
12372 TREE_ADDRESSABLE (b
->tags
) = 1;
12374 /* We don't copy this value because build_enumerator needs to do it. */
12375 enum_next_value
= integer_zero_node
;
12378 GNU_xref_decl (current_function_decl
, enumtype
);
12382 /* After processing and defining all the values of an enumeration type,
12383 install their decls in the enumeration type and finish it off.
12384 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12385 Returns ENUMTYPE. */
12388 finish_enum (enumtype
)
12391 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12392 /* Calculate the maximum value of any enumerator in this type. */
12394 tree values
= TYPE_VALUES (enumtype
);
12399 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12404 /* The TREE_VALUE is a CONST_DECL for this enumeration
12406 decl
= TREE_VALUE (pair
);
12408 /* The DECL_INITIAL will be NULL if we are processing a
12409 template declaration and this enumeration constant had no
12410 explicit initializer. */
12411 value
= DECL_INITIAL (decl
);
12412 if (value
&& !processing_template_decl
)
12414 /* Set the TREE_TYPE for the VALUE as well. That's so
12415 that when we call decl_constant_value we get an
12416 entity of the right type (but with the constant
12417 value). Since we shouldn't ever call
12418 decl_constant_value on a template type, there's no
12419 reason to do that when processing_template_decl.
12420 And, if the expression is something like a
12421 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12422 wreak havoc on the intended type of the expression.
12424 Of course, there's also no point in trying to compute
12425 minimum or maximum values if we're in a template. */
12426 TREE_TYPE (value
) = enumtype
;
12429 minnode
= maxnode
= value
;
12430 else if (tree_int_cst_lt (maxnode
, value
))
12432 else if (tree_int_cst_lt (value
, minnode
))
12436 if (processing_template_decl
)
12437 /* If this is just a template, leave the CONST_DECL
12438 alone. That way tsubst_copy will find CONST_DECLs for
12439 CONST_DECLs, and not INTEGER_CSTs. */
12442 /* In the list we're building up, we want the enumeration
12443 values, not the CONST_DECLs. */
12444 TREE_VALUE (pair
) = value
;
12448 maxnode
= minnode
= integer_zero_node
;
12450 TYPE_VALUES (enumtype
) = nreverse (values
);
12452 if (processing_template_decl
)
12454 tree scope
= current_scope ();
12455 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12456 add_tree (build_min (TAG_DEFN
, enumtype
));
12460 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12461 int lowprec
= min_precision (minnode
, unsignedp
);
12462 int highprec
= min_precision (maxnode
, unsignedp
);
12463 int precision
= MAX (lowprec
, highprec
);
12466 TYPE_SIZE (enumtype
) = NULL_TREE
;
12468 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12470 TYPE_PRECISION (enumtype
) = precision
;
12472 fixup_unsigned_type (enumtype
);
12474 fixup_signed_type (enumtype
);
12476 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12477 /* Use the width of the narrowest normal C type which is wide
12479 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12482 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12484 TYPE_SIZE (enumtype
) = 0;
12485 layout_type (enumtype
);
12487 /* Fix up all variant types of this enum type. */
12488 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12489 tem
= TYPE_NEXT_VARIANT (tem
))
12491 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12492 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12493 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12494 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12495 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12496 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12497 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12498 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12499 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12502 /* Finish debugging output for this type. */
12503 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12506 /* In start_enum we pushed obstacks. Here, we must pop them. */
12512 /* Build and install a CONST_DECL for an enumeration constant of the
12513 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12514 Assignment of sequential values by default is handled here. */
12517 build_enumerator (name
, value
, type
)
12525 /* Remove no-op casts from the value. */
12527 STRIP_TYPE_NOPS (value
);
12529 if (! processing_template_decl
)
12531 /* Validate and default VALUE. */
12532 if (value
!= NULL_TREE
)
12534 if (TREE_READONLY_DECL_P (value
))
12535 value
= decl_constant_value (value
);
12537 if (TREE_CODE (value
) == INTEGER_CST
)
12539 value
= default_conversion (value
);
12540 constant_expression_warning (value
);
12544 cp_error ("enumerator value for `%D' not integer constant", name
);
12549 /* Default based on previous value. */
12550 if (value
== NULL_TREE
&& ! processing_template_decl
)
12552 value
= enum_next_value
;
12554 cp_error ("overflow in enumeration values at `%D'", name
);
12557 /* Remove no-op casts from the value. */
12559 STRIP_TYPE_NOPS (value
);
12561 /* To fix MAX_VAL enum consts. (bkoz) */
12562 TREE_TYPE (value
) = integer_type_node
;
12566 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12567 Even in other cases, we will later (in finish_enum) be setting the
12569 if (value
!= NULL_TREE
)
12570 value
= copy_node (value
);
12572 /* C++ associates enums with global, function, or class declarations. */
12574 context
= current_scope ();
12575 if (context
&& context
== current_class_type
)
12576 /* This enum declaration is local to the class. */
12577 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12579 /* It's a global enum, or it's local to a function. (Note local to
12580 a function could mean local to a class method. */
12581 decl
= build_decl (CONST_DECL
, name
, type
);
12583 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12584 DECL_INITIAL (decl
) = value
;
12585 TREE_READONLY (decl
) = 1;
12587 if (context
&& context
== current_class_type
)
12588 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12589 on the TYPE_FIELDS list for `S'. (That's so that you can say
12590 things like `S::i' later.) */
12591 finish_member_declaration (decl
);
12595 GNU_xref_decl (current_function_decl
, decl
);
12598 if (! processing_template_decl
)
12600 /* Set basis for default for next value. */
12601 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12602 integer_one_node
, PLUS_EXPR
);
12603 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12606 result
= tree_cons (name
, decl
, NULL_TREE
);
12611 static int function_depth
;
12613 /* We're defining DECL. Make sure that it's type is OK. */
12616 check_function_type (decl
)
12619 tree fntype
= TREE_TYPE (decl
);
12621 /* In a function definition, arg types must be complete. */
12622 require_complete_types_for_parms (current_function_parms
);
12624 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12626 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12628 /* Make it return void instead, but don't change the
12629 type of the DECL_RESULT, in case we have a named return value. */
12630 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12632 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12634 = build_cplus_method_type (ctype
,
12636 FUNCTION_ARG_CHAIN (decl
));
12640 = build_function_type (void_type_node
,
12641 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12643 = build_exception_variant (fntype
,
12644 TYPE_RAISES_EXCEPTIONS (fntype
));
12647 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12650 /* Create the FUNCTION_DECL for a function definition.
12651 DECLSPECS and DECLARATOR are the parts of the declaration;
12652 they describe the function's name and the type it returns,
12653 but twisted together in a fashion that parallels the syntax of C.
12655 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12656 DECLARATOR is really the DECL for the function we are about to
12657 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12658 indicating that the function is an inline defined in-class, and
12659 SF_EXPAND indicating that we should generate RTL for this
12662 This function creates a binding context for the function body
12663 as well as setting up the FUNCTION_DECL in current_function_decl.
12665 Returns 1 on success. If the DECLARATOR is not suitable for a function
12666 (it defines a datum instead), we return 0, which tells
12667 yyparse to report a parse error.
12669 For C++, we must first check whether that datum makes any sense.
12670 For example, "class A local_a(1,2);" means that variable local_a
12671 is an aggregate of type A, which should have a constructor
12672 applied to it with the argument list [1, 2]. */
12675 start_function (declspecs
, declarator
, attrs
, flags
)
12676 tree declspecs
, declarator
, attrs
;
12680 tree ctype
= NULL_TREE
;
12683 extern int have_extern_spec
;
12684 extern int used_extern_spec
;
12685 int doing_friend
= 0;
12686 struct binding_level
*bl
;
12688 /* Sanity check. */
12689 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12690 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12692 /* This should only be done once on the top most decl. */
12693 if (have_extern_spec
&& !used_extern_spec
)
12695 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12696 used_extern_spec
= 1;
12699 if (flags
& SF_PRE_PARSED
)
12701 decl1
= declarator
;
12703 fntype
= TREE_TYPE (decl1
);
12704 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12705 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12707 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12708 class is in the (lexical) scope of the class in which it is
12710 if (!ctype
&& DECL_FRIEND_P (decl1
))
12712 ctype
= DECL_CLASS_CONTEXT (decl1
);
12714 /* CTYPE could be null here if we're dealing with a template;
12715 for example, `inline friend float foo()' inside a template
12716 will have no CTYPE set. */
12717 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12723 last_function_parms
= DECL_ARGUMENTS (decl1
);
12724 last_function_parm_tags
= NULL_TREE
;
12728 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12729 /* If the declarator is not suitable for a function definition,
12730 cause a syntax error. */
12731 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12733 fntype
= TREE_TYPE (decl1
);
12735 restype
= TREE_TYPE (fntype
);
12736 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12738 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12739 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12740 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12741 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12742 fntype
= build_function_type (integer_type_node
,
12743 TYPE_ARG_TYPES (fntype
));
12745 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12747 TYPE_ARG_TYPES (fntype
));
12748 TREE_TYPE (decl1
) = fntype
;
12751 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12752 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12753 else if (DECL_MAIN_P (decl1
))
12755 /* If this doesn't return integer_type, complain. */
12756 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12758 if (pedantic
|| warn_return_type
)
12759 pedwarn ("return type for `main' changed to `int'");
12760 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12765 /* Warn if function was previously implicitly declared
12766 (but not if we warned then). */
12767 if (! warn_implicit
12768 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12769 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12771 /* Set up current_class_type, and enter the scope of the class, if
12774 push_nested_class (ctype
, 1);
12775 else if (DECL_STATIC_FUNCTION_P (decl1
))
12776 push_nested_class (DECL_CONTEXT (decl1
), 2);
12778 /* Now that we have entered the scope of the class, we must restore
12779 the bindings for any template parameters surrounding DECL1, if it
12780 is an inline member template. (Order is important; consider the
12781 case where a template parameter has the same name as a field of
12782 the class.) It is not until after this point that
12783 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12784 if (flags
& SF_INCLASS_INLINE
)
12785 maybe_begin_member_template_processing (decl1
);
12787 /* Effective C++ rule 15. See also c_expand_return. */
12789 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12790 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12791 cp_warning ("`operator=' should return a reference to `*this'");
12793 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12794 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12795 DECL_INITIAL (decl1
) = error_mark_node
;
12797 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12798 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12801 /* This function exists in static storage.
12802 (This does not mean `static' in the C sense!) */
12803 TREE_STATIC (decl1
) = 1;
12805 /* We must call push_template_decl after current_class_type is set
12806 up. (If we are processing inline definitions after exiting a
12807 class scope, current_class_type will be NULL_TREE until set above
12808 by push_nested_class.) */
12809 if (processing_template_decl
)
12810 decl1
= push_template_decl (decl1
);
12812 /* We are now in the scope of the function being defined. */
12813 current_function_decl
= decl1
;
12815 /* Save the parm names or decls from this function's declarator
12816 where store_parm_decls will find them. */
12817 current_function_parms
= last_function_parms
;
12818 current_function_parm_tags
= last_function_parm_tags
;
12820 /* Make sure the parameter and return types are reasonable. When
12821 you declare a function, these types can be incomplete, but they
12822 must be complete when you define the function. */
12823 if (! processing_template_decl
)
12824 check_function_type (decl1
);
12826 /* Build the return declaration for the function. */
12827 restype
= TREE_TYPE (fntype
);
12828 if (!processing_template_decl
)
12830 if (!DECL_RESULT (decl1
))
12832 DECL_RESULT (decl1
)
12833 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12834 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12835 DECL_RESULT (decl1
));
12839 /* Just use `void'. Nobody will ever look at this anyhow. */
12840 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12842 /* Initialize RTL machinery. We cannot do this until
12843 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12844 even when processing a template; this is how we get
12845 CURRENT_FUNCTION set up, and our per-function variables
12847 bl
= current_binding_level
;
12848 init_function_start (decl1
, input_filename
, lineno
);
12849 current_binding_level
= bl
;
12850 expanding_p
= (flags
& SF_EXPAND
) != 0;
12852 /* Even though we're inside a function body, we still don't want to
12853 call expand_expr to calculate the size of a variable-sized array.
12854 We haven't necessarily assigned RTL to all variables yet, so it's
12855 not safe to try to expand expressions involving them. */
12856 immediate_size_expand
= 0;
12857 get_pending_sizes ();
12859 /* Let the user know we're compiling this function. */
12860 if (processing_template_decl
|| !building_stmt_tree ())
12861 announce_function (decl1
);
12863 /* Record the decl so that the function name is defined.
12864 If we already have a decl for this name, and it is a FUNCTION_DECL,
12865 use the old decl. */
12866 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12868 /* A specialization is not used to guide overload resolution. */
12869 if ((flag_guiding_decls
12870 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12871 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12872 decl1
= pushdecl (decl1
);
12875 /* We need to set the DECL_CONTEXT. */
12876 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12877 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12878 /* And make sure we have enough default args. */
12879 check_default_args (decl1
);
12881 DECL_MAIN_VARIANT (decl1
) = decl1
;
12882 fntype
= TREE_TYPE (decl1
);
12885 /* Reset these in case the call to pushdecl changed them. */
12886 current_function_decl
= decl1
;
12887 current_function
->decl
= decl1
;
12889 if (DECL_INTERFACE_KNOWN (decl1
))
12891 tree ctx
= hack_decl_function_context (decl1
);
12893 if (DECL_NOT_REALLY_EXTERN (decl1
))
12894 DECL_EXTERNAL (decl1
) = 0;
12896 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12897 && TREE_PUBLIC (ctx
))
12898 /* This is a function in a local class in an extern inline
12900 comdat_linkage (decl1
);
12902 /* If this function belongs to an interface, it is public.
12903 If it belongs to someone else's interface, it is also external.
12904 This only affects inlines and template instantiations. */
12905 else if (interface_unknown
== 0
12906 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12907 || flag_alt_external_templates
))
12909 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12910 || processing_template_decl
)
12912 DECL_EXTERNAL (decl1
)
12914 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
12915 && !DECL_VINDEX (decl1
)));
12917 /* For WIN32 we also want to put these in linkonce sections. */
12918 maybe_make_one_only (decl1
);
12921 DECL_EXTERNAL (decl1
) = 0;
12922 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
12923 DECL_INTERFACE_KNOWN (decl1
) = 1;
12925 else if (interface_unknown
&& interface_only
12926 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12927 || flag_alt_external_templates
))
12929 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
12930 interface, we will have interface_only set but not
12931 interface_known. In that case, we don't want to use the normal
12932 heuristics because someone will supply a #pragma implementation
12933 elsewhere, and deducing it here would produce a conflict. */
12934 comdat_linkage (decl1
);
12935 DECL_EXTERNAL (decl1
) = 0;
12936 DECL_INTERFACE_KNOWN (decl1
) = 1;
12937 DECL_DEFER_OUTPUT (decl1
) = 1;
12941 /* This is a definition, not a reference.
12942 So clear DECL_EXTERNAL. */
12943 DECL_EXTERNAL (decl1
) = 0;
12945 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
12946 && ! DECL_INTERFACE_KNOWN (decl1
)
12947 /* Don't try to defer nested functions for now. */
12948 && ! hack_decl_function_context (decl1
))
12949 DECL_DEFER_OUTPUT (decl1
) = 1;
12951 DECL_INTERFACE_KNOWN (decl1
) = 1;
12954 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
12956 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12957 TREE_TYPE (decl1
) = fntype
12958 = build_function_type (TREE_TYPE (fntype
),
12959 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
12960 current_function_parms
= TREE_CHAIN (current_function_parms
);
12961 DECL_ARGUMENTS (decl1
) = current_function_parms
;
12965 my_friendly_assert (current_class_ptr
== NULL_TREE
, 19990908);
12966 my_friendly_assert (current_class_ref
== NULL_TREE
, 19990908);
12969 /* If we're compiling a friend function, neither of the variables
12970 current_class_ptr nor current_class_type will have values. */
12971 if (! doing_friend
)
12973 /* We know that this was set up by `grokclassfn'.
12974 We do not wait until `store_parm_decls', since evil
12975 parse errors may never get us to that point. Here
12976 we keep the consistency between `current_class_type'
12977 and `current_class_ptr'. */
12978 tree t
= current_function_parms
;
12981 my_friendly_assert (t
!= NULL_TREE
12982 && TREE_CODE (t
) == PARM_DECL
, 162);
12983 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
12986 if (! hack_decl_function_context (decl1
))
12987 temporary_allocation ();
12988 i
= suspend_momentary ();
12990 /* Normally, build_indirect_ref returns current_class_ref
12991 whenever current_class_ptr is dereferenced. This time,
12992 however, we want it to *create* current_class_ref, so we
12993 temporarily clear current_class_ptr to fool it. */
12994 cp_function_chain
->x_current_class_ref
12995 = build_indirect_ref (t
, NULL_PTR
);
12996 cp_function_chain
->x_current_class_ptr
= t
;
12998 resume_momentary (i
);
12999 if (! hack_decl_function_context (decl1
))
13000 end_temporary_allocation ();
13005 current_binding_level
->parm_flag
= 1;
13008 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13010 if (!building_stmt_tree ())
13012 GNU_xref_function (decl1
, current_function_parms
);
13013 make_function_rtl (decl1
);
13016 /* Promote the value to int before returning it. */
13017 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13018 restype
= type_promotes_to (restype
);
13020 /* If this fcn was already referenced via a block-scope `extern' decl
13021 (or an implicit decl), propagate certain information about the usage. */
13022 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13023 TREE_ADDRESSABLE (decl1
) = 1;
13025 if (DECL_RESULT (decl1
) == NULL_TREE
)
13027 DECL_RESULT (decl1
)
13028 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13029 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13030 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13033 /* Allocate further tree nodes temporarily during compilation
13034 of this function only. Tiemann moved up here from bottom of fn. */
13035 /* If this is a nested function, then we must continue to allocate RTL
13036 on the permanent obstack in case we need to inline it later. */
13037 if (! hack_decl_function_context (decl1
))
13038 temporary_allocation ();
13040 /* Make sure that we always have a momntary obstack while we're in a
13044 if (building_stmt_tree ())
13045 begin_stmt_tree (decl1
);
13049 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13050 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13052 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13053 ctor_label
= NULL_TREE
;
13057 dtor_label
= NULL_TREE
;
13058 if (DECL_CONSTRUCTOR_P (decl1
))
13059 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13065 /* Called after store_parm_decls for a function-try-block. We need to update
13066 last_parm_cleanup_insn so that the base initializers for a constructor
13067 are run within this block, not before it. */
13070 expand_start_early_try_stmts ()
13072 expand_start_try_stmts ();
13073 last_parm_cleanup_insn
= get_last_insn ();
13076 /* Store the parameter declarations into the current function declaration.
13077 This is called after parsing the parameter declarations, before
13078 digesting the body of the function.
13080 Also install to binding contour return value identifier, if any. */
13083 store_parm_decls ()
13085 register tree fndecl
= current_function_decl
;
13086 register tree parm
;
13087 int parms_have_cleanups
= 0;
13088 tree cleanups
= NULL_TREE
;
13090 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13091 tree specparms
= current_function_parms
;
13093 /* This is a list of types declared among parms in a prototype. */
13094 tree parmtags
= current_function_parm_tags
;
13096 /* This is a chain of any other decls that came in among the parm
13097 declarations. If a parm is declared with enum {foo, bar} x;
13098 then CONST_DECLs for foo and bar are put here. */
13099 tree nonparms
= NULL_TREE
;
13101 if (toplevel_bindings_p ())
13102 fatal ("parse errors have confused me too much");
13104 /* Create a binding level for the parms. */
13105 expand_start_bindings (0);
13107 if (specparms
!= NULL_TREE
)
13109 /* This case is when the function was defined with an ANSI prototype.
13110 The parms already have decls, so we need not do anything here
13111 except record them as in effect
13112 and complain if any redundant old-style parm decls were written. */
13114 register tree next
;
13116 /* Must clear this because it might contain TYPE_DECLs declared
13118 storedecls (NULL_TREE
);
13120 for (parm
= nreverse (specparms
); parm
; parm
= next
)
13122 next
= TREE_CHAIN (parm
);
13123 if (TREE_CODE (parm
) == PARM_DECL
)
13126 if (DECL_NAME (parm
) == NULL_TREE
)
13130 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
13131 cp_error ("parameter `%D' declared void", parm
);
13134 if (! building_stmt_tree ()
13135 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13137 expand_decl (parm
);
13138 parms_have_cleanups
= 1;
13140 /* Keep track of the cleanups. */
13141 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13146 /* If we find an enum constant or a type tag,
13147 put it aside for the moment. */
13148 TREE_CHAIN (parm
) = NULL_TREE
;
13149 nonparms
= chainon (nonparms
, parm
);
13153 /* Get the decls in their original chain order
13154 and record in the function. This is all and only the
13155 PARM_DECLs that were pushed into scope by the loop above. */
13156 DECL_ARGUMENTS (fndecl
) = getdecls ();
13158 storetags (chainon (parmtags
, gettags ()));
13161 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13163 /* Now store the final chain of decls for the arguments
13164 as the decl-chain of the current lexical scope.
13165 Put the enumerators in as well, at the front so that
13166 DECL_ARGUMENTS is not modified. */
13168 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13170 /* Initialize the RTL code for the function. */
13171 DECL_SAVED_INSNS (fndecl
) = 0;
13172 if (! building_stmt_tree ())
13173 expand_function_start (fndecl
, parms_have_cleanups
);
13175 current_function_parms_stored
= 1;
13177 /* If this function is `main', emit a call to `__main'
13178 to run global initializers, etc. */
13179 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13180 expand_main_function ();
13182 /* Now that we have initialized the parms, we can start their
13183 cleanups. We cannot do this before, since expand_decl_cleanup
13184 should not be called before the parm can be used. */
13185 if (cleanups
&& !building_stmt_tree ())
13187 for (cleanups
= nreverse (cleanups
);
13189 cleanups
= TREE_CHAIN (cleanups
))
13191 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
),
13192 TREE_VALUE (cleanups
)))
13193 cp_error ("parser lost in parsing declaration of `%D'",
13194 TREE_PURPOSE (cleanups
));
13198 /* Create a binding contour which can be used to catch
13199 cleanup-generated temporaries. Also, if the return value needs or
13200 has initialization, deal with that now. */
13201 if (parms_have_cleanups
)
13204 if (!building_stmt_tree ())
13205 expand_start_bindings (0);
13208 if (! building_stmt_tree () && flag_exceptions
)
13210 /* Do the starting of the exception specifications, if we have any. */
13211 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13212 expand_start_eh_spec ();
13215 last_parm_cleanup_insn
= get_last_insn ();
13216 last_dtor_insn
= get_last_insn ();
13219 /* Bind a name and initialization to the return value of
13220 the current function. */
13223 store_return_init (decl
)
13226 /* If this named return value comes in a register, put it in a
13227 pseudo-register. */
13228 if (DECL_REGISTER (decl
))
13230 original_result_rtx
= DECL_RTL (decl
);
13231 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13236 /* Finish up a function declaration and compile that function
13237 all the way to assembler language output. The free the storage
13238 for the function definition.
13240 This is called after parsing the body of the function definition.
13241 LINENO is the current line number.
13243 FLAGS is a bitwise or of the following values:
13245 An extra call to poplevel (and expand_end_bindings) must be
13246 made to take care of the binding contour for the base
13247 initializers. This is only relevant for constructors.
13249 We just finished processing the body of an in-class inline
13250 function definition. (This processing will have taken place
13251 after the class definition is complete.) */
13254 finish_function (lineno
, flags
)
13258 register tree fndecl
= current_function_decl
;
13259 tree fntype
, ctype
= NULL_TREE
;
13260 rtx fn_last_parm_insn
, insns
;
13261 /* Label to use if this function is supposed to return a value. */
13262 tree no_return_label
= NULL_TREE
;
13263 tree decls
= NULL_TREE
;
13264 int call_poplevel
= (flags
& 1) != 0;
13265 int inclass_inline
= (flags
& 2) != 0;
13269 /* When we get some parse errors, we can end up without a
13270 current_function_decl, so cope. */
13271 if (fndecl
== NULL_TREE
)
13272 return error_mark_node
;
13274 nested
= function_depth
> 1;
13275 fntype
= TREE_TYPE (fndecl
);
13277 /* TREE_READONLY (fndecl) = 1;
13278 This caused &foo to be of type ptr-to-const-function
13279 which then got a warning when stored in a ptr-to-function variable. */
13281 /* This happens on strange parse errors. */
13282 if (! current_function_parms_stored
)
13285 store_parm_decls ();
13288 if (building_stmt_tree ())
13290 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13292 decls
= getdecls ();
13293 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13294 poplevel (decls
!= NULL_TREE
, 0, 0);
13297 /* Because we do not call expand_function_end, we won't call
13298 expand_end_bindings to match the call to
13299 expand_start_bindings we did in store_parm_decls. Therefore,
13300 we explicitly call expand_end_bindings here. However, we
13301 really shouldn't be calling expand_start_bindings at all when
13302 building_stmt_tree; it's conceptually an RTL-generation
13303 function, rather than a front-end function. */
13304 expand_end_bindings (0, 0, 0);
13308 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13310 tree ttype
= target_type (fntype
);
13313 if (IS_AGGR_TYPE (ttype
))
13314 /* Let debugger know it should output info for this type. */
13315 note_debug_info_needed (ttype
);
13317 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13319 ttype
= target_type (TREE_TYPE (parmdecl
));
13320 if (IS_AGGR_TYPE (ttype
))
13321 /* Let debugger know it should output info for this type. */
13322 note_debug_info_needed (ttype
);
13326 /* Clean house because we will need to reorder insns here. */
13327 do_pending_stack_adjust ();
13331 tree binfo
= TYPE_BINFO (current_class_type
);
13332 tree cond
= integer_one_node
;
13334 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13336 int ok_to_optimize_dtor
= 0;
13337 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13339 if (current_function_assigns_this
)
13340 cond
= build (NE_EXPR
, boolean_type_node
,
13341 current_class_ptr
, integer_zero_node
);
13344 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13346 /* If this destructor is empty, then we don't need to check
13347 whether `this' is NULL in some cases. */
13348 if ((flag_this_is_variable
& 1) == 0)
13349 ok_to_optimize_dtor
= 1;
13350 else if (empty_dtor
)
13351 ok_to_optimize_dtor
13352 = (n_baseclasses
== 0
13353 || (n_baseclasses
== 1
13354 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13357 /* These initializations might go inline. Protect
13358 the binding level of the parms. */
13360 expand_start_bindings (0);
13362 if (current_function_assigns_this
)
13364 current_function_assigns_this
= 0;
13365 current_function_just_assigned_this
= 0;
13368 /* Generate the code to call destructor on base class.
13369 If this destructor belongs to a class with virtual
13370 functions, then set the virtual function table
13371 pointer to represent the type of our base class. */
13373 /* This side-effect makes call to `build_delete' generate the
13374 code we have to have at the end of this destructor.
13375 `build_delete' will set the flag again. */
13376 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13378 /* These are two cases where we cannot delegate deletion. */
13379 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13380 || TYPE_GETS_REG_DELETE (current_class_type
))
13381 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
13382 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13384 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
13385 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13387 /* If we did not assign to this, then `this' is non-zero at
13388 the end of a destructor. As a special optimization, don't
13389 emit test if this is an empty destructor. If it does nothing,
13390 it does nothing. If it calls a base destructor, the base
13391 destructor will perform the test. */
13393 if (exprstmt
!= error_mark_node
13394 && (TREE_CODE (exprstmt
) != NOP_EXPR
13395 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13396 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13398 expand_label (dtor_label
);
13399 if (cond
!= integer_one_node
)
13400 expand_start_cond (cond
, 0);
13401 if (exprstmt
!= void_zero_node
)
13402 /* Don't call `expand_expr_stmt' if we're not going to do
13403 anything, since -Wall will give a diagnostic. */
13404 expand_expr_stmt (exprstmt
);
13406 /* Run destructor on all virtual baseclasses. */
13407 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13409 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13410 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13411 in_charge_node
, integer_two_node
), 0);
13414 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13416 tree vb
= get_vbase
13417 (BINFO_TYPE (vbases
),
13418 TYPE_BINFO (current_class_type
));
13420 (build_scoped_method_call
13421 (current_class_ref
, vb
, dtor_identifier
,
13422 build_expr_list (NULL_TREE
, integer_zero_node
)));
13424 vbases
= TREE_CHAIN (vbases
);
13426 expand_end_cond ();
13429 do_pending_stack_adjust ();
13430 if (cond
!= integer_one_node
)
13431 expand_end_cond ();
13434 virtual_size
= c_sizeof (current_class_type
);
13436 /* At the end, call delete if that's what's requested. */
13438 /* FDIS sez: At the point of definition of a virtual destructor
13439 (including an implicit definition), non-placement operator
13440 delete shall be looked up in the scope of the destructor's
13441 class and if found shall be accessible and unambiguous.
13443 This is somewhat unclear, but I take it to mean that if the
13444 class only defines placement deletes we don't do anything here.
13445 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13446 for us if they ever try to delete one of these. */
13448 if (TYPE_GETS_REG_DELETE (current_class_type
)
13449 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13450 exprstmt
= build_op_delete_call
13451 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13452 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13454 exprstmt
= NULL_TREE
;
13458 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13459 in_charge_node
, integer_one_node
);
13460 expand_start_cond (cond
, 0);
13461 expand_expr_stmt (exprstmt
);
13462 expand_end_cond ();
13465 /* End of destructor. */
13466 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13467 poplevel (getdecls () != NULL_TREE
, 0, 0);
13469 /* Back to the top of destructor. */
13470 /* Don't execute destructor code if `this' is NULL. */
13474 /* If the dtor is empty, and we know there is not possible way we
13475 could use any vtable entries, before they are possibly set by
13476 a base class dtor, we don't have to setup the vtables, as we
13477 know that any base class dtoring will set up any vtables it
13478 needs. We avoid MI, because one base class dtor can do a
13479 virtual dispatch to an overridden function that would need to
13480 have a non-related vtable set up, we cannot avoid setting up
13481 vtables in that case. We could change this to see if there is
13482 just one vtable. */
13483 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13485 /* Make all virtual function table pointers in non-virtual base
13486 classes point to CURRENT_CLASS_TYPE's virtual function
13488 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13490 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13491 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13494 if (! ok_to_optimize_dtor
)
13496 cond
= build_binary_op (NE_EXPR
,
13497 current_class_ptr
, integer_zero_node
);
13498 expand_start_cond (cond
, 0);
13501 insns
= get_insns ();
13504 fn_last_parm_insn
= get_first_nonparm_insn ();
13505 if (fn_last_parm_insn
== NULL_RTX
)
13506 fn_last_parm_insn
= get_last_insn ();
13508 fn_last_parm_insn
= previous_insn (fn_last_parm_insn
);
13510 emit_insns_after (insns
, fn_last_parm_insn
);
13512 if (! ok_to_optimize_dtor
)
13513 expand_end_cond ();
13515 else if (current_function_assigns_this
)
13517 /* Does not need to call emit_base_init, because
13518 that is done (if needed) just after assignment to this
13521 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13523 end_protect_partials ();
13524 expand_label (ctor_label
);
13525 ctor_label
= NULL_TREE
;
13529 decls
= getdecls ();
13530 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13531 poplevel (decls
!= NULL_TREE
, 0, 0);
13533 /* c_expand_return knows to return 'this' from a constructor. */
13534 c_expand_return (NULL_TREE
);
13536 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13537 && return_label
!= NULL_RTX
)
13538 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13540 current_function_assigns_this
= 0;
13541 current_function_just_assigned_this
= 0;
13542 base_init_expr
= NULL_TREE
;
13544 else if (DECL_CONSTRUCTOR_P (fndecl
))
13546 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13547 /* Allow constructor for a type to get a new instance of the object
13548 using `build_new'. */
13549 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13550 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13552 if (flag_this_is_variable
> 0)
13554 cond
= build_binary_op (EQ_EXPR
,
13555 current_class_ptr
, integer_zero_node
);
13556 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13557 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13560 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13564 if (flag_this_is_variable
> 0)
13566 expand_start_cond (cond
, 0);
13567 expand_expr_stmt (thenclause
);
13568 expand_end_cond ();
13571 /* Emit insns from `emit_base_init' which sets up virtual
13572 function table pointer(s). */
13573 if (base_init_expr
)
13575 expand_expr_stmt (base_init_expr
);
13576 base_init_expr
= NULL_TREE
;
13579 insns
= get_insns ();
13582 /* This is where the body of the constructor begins. */
13584 emit_insns_after (insns
, last_parm_cleanup_insn
);
13586 end_protect_partials ();
13588 /* This is where the body of the constructor ends. */
13589 expand_label (ctor_label
);
13590 ctor_label
= NULL_TREE
;
13594 decls
= getdecls ();
13595 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13596 poplevel (decls
!= NULL_TREE
, 1, 0);
13599 /* c_expand_return knows to return 'this' from a constructor. */
13600 c_expand_return (NULL_TREE
);
13602 current_function_assigns_this
= 0;
13603 current_function_just_assigned_this
= 0;
13605 else if (DECL_MAIN_P (fndecl
))
13607 /* Make it so that `main' always returns 0 by default. */
13609 c_expand_return (integer_one_node
);
13611 c_expand_return (integer_zero_node
);
13614 else if (return_label
!= NULL_RTX
13615 && current_function_return_value
== NULL_TREE
13616 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13617 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13619 if (flag_exceptions
)
13620 expand_exception_blocks ();
13622 /* If this function is supposed to return a value, ensure that
13623 we do not fall into the cleanups by mistake. The end of our
13624 function will look like this:
13626 user code (may have return stmt somewhere)
13627 goto no_return_label
13632 NOTE_INSN_FUNCTION_END
13636 If the user omits a return stmt in the USER CODE section, we
13637 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13638 Otherwise, we won't. */
13639 if (no_return_label
)
13641 DECL_CONTEXT (no_return_label
) = fndecl
;
13642 DECL_INITIAL (no_return_label
) = error_mark_node
;
13643 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13644 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13645 expand_goto (no_return_label
);
13650 /* Remove the binding contour which is used
13651 to catch cleanup-generated temporaries. */
13652 expand_end_bindings (0, 0, 0);
13653 poplevel (0, 0, 0);
13655 /* Emit label at beginning of cleanup code for parameters. */
13656 emit_label (cleanup_label
);
13659 /* Get return value into register if that's where it's supposed
13661 if (original_result_rtx
)
13662 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13664 /* Finish building code that will trigger warnings if users forget
13665 to make their functions return values. */
13666 if (no_return_label
|| cleanup_label
)
13667 emit_jump (return_label
);
13668 if (no_return_label
)
13670 /* We don't need to call `expand_*_return' here because we
13671 don't need any cleanups here--this path of code is only
13672 for error checking purposes. */
13673 expand_label (no_return_label
);
13676 /* We hard-wired immediate_size_expand to zero in
13677 start_function. Expand_function_end will decrement this
13678 variable. So, we set the variable to one here, so that after
13679 the decrement it will remain zero. */
13680 immediate_size_expand
= 1;
13682 /* Generate rtl for function exit. */
13683 expand_function_end (input_filename
, lineno
, 1);
13686 /* We have to save this value here in case
13687 maybe_end_member_template_processing decides to pop all the
13688 template parameters. */
13689 expand_p
= !building_stmt_tree ();
13691 /* If we're saving up tree structure, tie off the function now. */
13693 finish_stmt_tree (fndecl
);
13695 /* This must come after expand_function_end because cleanups might
13696 have declarations (from inline functions) that need to go into
13697 this function's blocks. */
13698 if (current_binding_level
->parm_flag
!= 1)
13699 my_friendly_abort (122);
13700 poplevel (1, 0, 1);
13702 /* Remember that we were in class scope. */
13703 if (current_class_name
)
13704 ctype
= current_class_type
;
13706 /* Must mark the RESULT_DECL as being in this function. */
13707 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13709 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13710 to the FUNCTION_DECL node itself. */
13711 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13713 /* Undo the call to push_momentary in start_function. */
13720 int saved_flag_keep_inline_functions
=
13721 flag_keep_inline_functions
;
13723 /* So we can tell if jump_optimize sets it to 1. */
13726 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13727 && hack_decl_function_context (fndecl
))
13728 /* Trick rest_of_compilation into not deferring output of this
13729 function, even if it is inline, since the rtl_obstack for
13730 this function is the function_obstack of the enclosing
13731 function and will be deallocated when the enclosing
13732 function is gone. See save_tree_status. */
13733 flag_keep_inline_functions
= 1;
13735 /* Before we call rest_of_compilation (which will pop the
13736 CURRENT_FUNCTION), we must save these values. */
13737 returns_null
= current_function_returns_null
;
13738 returns_value
= current_function_returns_value
;
13740 /* If this is a nested function (like a template instantiation
13741 that we're compiling in the midst of compiling something
13742 else), push a new GC context. That will keep local variables
13743 on the stack from being collected while we're doing the
13744 compilation of this function. */
13745 if (function_depth
> 1)
13746 ggc_push_context ();
13748 /* Run the optimizers and output the assembler code for this
13750 if (DECL_ARTIFICIAL (fndecl
))
13752 /* Do we really *want* to inline this synthesized method? */
13754 int save_fif
= flag_inline_functions
;
13755 flag_inline_functions
= 1;
13757 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13758 will check our size. */
13759 DECL_INLINE (fndecl
) = 0;
13761 rest_of_compilation (fndecl
);
13762 flag_inline_functions
= save_fif
;
13765 rest_of_compilation (fndecl
);
13767 /* Undo the call to ggc_push_context above. */
13768 if (function_depth
> 1)
13769 ggc_pop_context ();
13771 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13773 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13775 /* Set DECL_EXTERNAL so that assemble_external will be called as
13776 necessary. We'll clear it again in finish_file. */
13777 if (! DECL_EXTERNAL (fndecl
))
13778 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13779 DECL_EXTERNAL (fndecl
) = 1;
13780 mark_inline_for_output (fndecl
);
13783 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13784 note_debug_info_needed (ctype
);
13786 returns_null
|= can_reach_end
;
13788 /* Since we don't normally go through c_expand_return for constructors,
13789 this normally gets the wrong value.
13790 Also, named return values have their return codes emitted after
13791 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13792 if (DECL_CONSTRUCTOR_P (fndecl
)
13793 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13796 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13797 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13798 else if ((warn_return_type
|| pedantic
)
13800 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13802 /* If this function returns non-void and control can drop through,
13804 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13806 /* With just -W, complain only if function returns both with
13807 and without a value. */
13808 else if (extra_warnings
&& returns_value
&& returns_null
)
13809 warning ("this function may return with or without a value");
13813 /* Since we never call rest_of_compilation, we never clear
13814 CURRENT_FUNCTION. Do so explicitly. */
13815 free_after_compilation (current_function
);
13816 current_function
= NULL
;
13819 /* If this is a in-class inline definition, we may have to pop the
13820 bindings for the template parameters that we added in
13821 maybe_begin_member_template_processing when start_function was
13823 if (inclass_inline
)
13824 maybe_end_member_template_processing ();
13826 /* Leave the scope of the class. */
13828 pop_nested_class ();
13832 /* Free all the tree nodes making up this function. */
13833 /* Switch back to allocating nodes permanently
13834 until we start another function. */
13836 permanent_allocation (1);
13838 if (DECL_SAVED_INSNS (fndecl
) == 0)
13842 /* Stop pointing to the local nodes about to be freed. */
13843 /* But DECL_INITIAL must remain nonzero so we know this
13844 was an actual function definition. */
13845 DECL_INITIAL (fndecl
) = error_mark_node
;
13846 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13847 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13850 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13851 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13852 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13853 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13858 /* Let the error reporting routines know that we're outside a
13859 function. For a nested function, this value is used in
13860 pop_cp_function_context and then reset via pop_function_context. */
13861 current_function_decl
= NULL_TREE
;
13867 /* Create the FUNCTION_DECL for a function definition.
13868 DECLSPECS and DECLARATOR are the parts of the declaration;
13869 they describe the return type and the name of the function,
13870 but twisted together in a fashion that parallels the syntax of C.
13872 This function creates a binding context for the function body
13873 as well as setting up the FUNCTION_DECL in current_function_decl.
13875 Returns a FUNCTION_DECL on success.
13877 If the DECLARATOR is not suitable for a function (it defines a datum
13878 instead), we return 0, which tells yyparse to report a parse error.
13880 May return void_type_node indicating that this method is actually
13881 a friend. See grokfield for more details.
13883 Came here with a `.pushlevel' .
13885 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13886 CHANGES TO CODE IN `grokfield'. */
13889 start_method (declspecs
, declarator
, attrlist
)
13890 tree declarator
, declspecs
, attrlist
;
13892 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13895 /* Something too ugly to handle. */
13896 if (fndecl
== NULL_TREE
)
13899 /* Pass friends other than inline friend functions back. */
13900 if (fndecl
== void_type_node
)
13903 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13904 /* Not a function, tell parser to report parse error. */
13907 if (DECL_IN_AGGR_P (fndecl
))
13909 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13911 if (DECL_CONTEXT (fndecl
)
13912 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13913 cp_error ("`%D' is already defined in class %s", fndecl
,
13914 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13916 return void_type_node
;
13919 check_template_shadow (fndecl
);
13921 DECL_THIS_INLINE (fndecl
) = 1;
13923 if (flag_default_inline
)
13924 DECL_INLINE (fndecl
) = 1;
13926 /* We process method specializations in finish_struct_1. */
13927 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13928 fndecl
= push_template_decl (fndecl
);
13930 /* We read in the parameters on the maybepermanent_obstack,
13931 but we won't be getting back to them until after we
13932 may have clobbered them. So the call to preserve_data
13933 will keep them safe. */
13936 if (! DECL_FRIEND_P (fndecl
))
13938 if (TREE_CHAIN (fndecl
))
13940 fndecl
= copy_node (fndecl
);
13941 TREE_CHAIN (fndecl
) = NULL_TREE
;
13944 if (DECL_CONSTRUCTOR_P (fndecl
))
13946 if (! grok_ctor_properties (current_class_type
, fndecl
))
13947 return void_type_node
;
13949 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13950 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13953 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13955 /* Make a place for the parms */
13957 current_binding_level
->parm_flag
= 1;
13959 DECL_IN_AGGR_P (fndecl
) = 1;
13963 /* Go through the motions of finishing a function definition.
13964 We don't compile this method until after the whole class has
13967 FINISH_METHOD must return something that looks as though it
13968 came from GROKFIELD (since we are defining a method, after all).
13970 This is called after parsing the body of the function definition.
13971 STMTS is the chain of statements that makes up the function body.
13973 DECL is the ..._DECL that `start_method' provided. */
13976 finish_method (decl
)
13979 register tree fndecl
= decl
;
13982 register tree link
;
13984 if (decl
== void_type_node
)
13987 old_initial
= DECL_INITIAL (fndecl
);
13989 /* Undo the level for the parms (from start_method).
13990 This is like poplevel, but it causes nothing to be
13991 saved. Saving information here confuses symbol-table
13992 output routines. Besides, this information will
13993 be correctly output when this method is actually
13996 /* Clear out the meanings of the local variables of this level;
13997 also record in each decl which block it belongs to. */
13999 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14001 if (DECL_NAME (link
) != NULL_TREE
)
14002 pop_binding (DECL_NAME (link
), link
);
14003 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14004 DECL_CONTEXT (link
) = NULL_TREE
;
14007 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14008 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14009 current_binding_level
->parm_flag
,
14010 current_binding_level
->keep
);
14012 poplevel (0, 0, 0);
14014 DECL_INITIAL (fndecl
) = old_initial
;
14016 /* We used to check if the context of FNDECL was different from
14017 current_class_type as another way to get inside here. This didn't work
14018 for String.cc in libg++. */
14019 if (DECL_FRIEND_P (fndecl
))
14021 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14022 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14023 decl
= void_type_node
;
14029 /* Called when a new struct TYPE is defined.
14030 If this structure or union completes the type of any previous
14031 variable declaration, lay it out and output its rtl. */
14034 hack_incomplete_structures (type
)
14039 if (current_binding_level
->incomplete
== NULL_TREE
)
14042 if (!type
) /* Don't do this for class templates. */
14045 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14047 tree decl
= TREE_VALUE (*list
);
14048 if ((decl
&& TREE_TYPE (decl
) == type
)
14049 || (TREE_TYPE (decl
)
14050 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14051 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14053 int toplevel
= toplevel_bindings_p ();
14054 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14055 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14056 layout_type (TREE_TYPE (decl
));
14057 layout_decl (decl
, 0);
14058 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14062 expand_decl (decl
);
14063 cleanup
= maybe_build_cleanup (decl
);
14064 expand_decl_init (decl
);
14065 if (! expand_decl_cleanup (decl
, cleanup
))
14066 cp_error ("parser lost in parsing declaration of `%D'",
14069 *list
= TREE_CHAIN (*list
);
14072 list
= &TREE_CHAIN (*list
);
14076 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14077 See build_delete for information about AUTO_DELETE.
14079 Don't build these on the momentary obstack; they must live
14080 the life of the binding contour. */
14083 maybe_build_cleanup_1 (decl
, auto_delete
)
14084 tree decl
, auto_delete
;
14086 tree type
= TREE_TYPE (decl
);
14087 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14089 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14092 if (TREE_CODE (decl
) != PARM_DECL
)
14093 temp
= suspend_momentary ();
14095 if (TREE_CODE (type
) == ARRAY_TYPE
)
14099 mark_addressable (decl
);
14100 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14103 /* Optimize for space over speed here. */
14104 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14105 || flag_expensive_optimizations
)
14106 flags
|= LOOKUP_NONVIRTUAL
;
14108 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14110 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14111 && ! TYPE_HAS_DESTRUCTOR (type
))
14112 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14113 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14115 if (TREE_CODE (decl
) != PARM_DECL
)
14116 resume_momentary (temp
);
14123 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
14126 build_target_expr (decl
, value
)
14130 return build (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
14131 maybe_build_cleanup (decl
), NULL_TREE
);
14134 /* If DECL is of a type which needs a cleanup, build that cleanup
14135 here. The cleanup does free the storage with a call to delete. */
14138 maybe_build_cleanup_and_delete (decl
)
14141 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14144 /* If DECL is of a type which needs a cleanup, build that cleanup
14145 here. The cleanup does not free the storage with a call a delete. */
14148 maybe_build_cleanup (decl
)
14151 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14154 /* Expand a C++ expression at the statement level.
14155 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14156 The C++ type checker should get all of these out when
14157 expressions are combined with other, type-providing, expressions,
14158 leaving only orphan expressions, such as:
14160 &class::bar; / / takes its address, but does nothing with it. */
14163 cplus_expand_expr_stmt (exp
)
14166 if (stmts_are_full_exprs_p
)
14167 exp
= convert_to_void (exp
, "statement");
14170 /* We should do this eventually, but right now this causes regex.o from
14171 libg++ to miscompile, and tString to core dump. */
14172 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14175 /* If we don't do this, we end up down inside expand_expr
14176 trying to do TYPE_MODE on the ERROR_MARK, and really
14177 go outside the bounds of the type. */
14178 if (exp
!= error_mark_node
)
14179 expand_expr_stmt (break_out_cleanups (exp
));
14182 /* When a stmt has been parsed, this function is called. */
14187 if (!current_function_assigns_this
14188 && current_function_just_assigned_this
)
14190 if (DECL_CONSTRUCTOR_P (current_function_decl
)
14191 && !building_stmt_tree ())
14193 /* Constructors must wait until we are out of control
14194 zones before calling base constructors. */
14195 if (in_control_zone_p ())
14197 expand_expr_stmt (base_init_expr
);
14198 check_base_init (current_class_type
);
14200 current_function_assigns_this
= 1;
14203 /* Always assume this statement was not an expression statement. If
14204 it actually was an expression statement, its our callers
14205 responsibility to fix this up. */
14206 last_expr_type
= NULL_TREE
;
14209 /* Change a static member function definition into a FUNCTION_TYPE, instead
14210 of the METHOD_TYPE that we create when it's originally parsed.
14212 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14213 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14214 other decls. Either pass the addresses of local variables or NULL. */
14217 revert_static_member_fn (decl
, fn
, argtypes
)
14218 tree
*decl
, *fn
, *argtypes
;
14221 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14222 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14224 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14225 != TYPE_UNQUALIFIED
)
14226 cp_error ("static member function `%#D' declared with type qualifiers",
14229 args
= TREE_CHAIN (args
);
14230 tmp
= build_function_type (TREE_TYPE (function
), args
);
14231 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14232 tmp
= build_exception_variant (tmp
,
14233 TYPE_RAISES_EXCEPTIONS (function
));
14234 TREE_TYPE (*decl
) = tmp
;
14235 if (DECL_ARGUMENTS (*decl
))
14236 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14237 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14244 /* Initialize the variables used during compilation of a C++
14248 push_cp_function_context (f
)
14249 struct function
*f
;
14251 struct language_function
*p
14252 = ((struct language_function
*)
14253 xcalloc (1, sizeof (struct language_function
)));
14256 /* For now, we always assume we're expanding all the way to RTL
14257 unless we're explicitly doing otherwise. */
14260 /* Whenever we start a new function, we destroy temporaries in the
14262 stmts_are_full_exprs_p
= 1;
14265 /* Free the language-specific parts of F, now that we've finished
14266 compiling the function. */
14269 pop_cp_function_context (f
)
14270 struct function
*f
;
14272 free (f
->language
);
14277 mark_cp_function_context (f
)
14278 struct function
*f
;
14280 struct language_function
*p
= f
->language
;
14285 ggc_mark_tree (p
->x_named_labels
);
14286 ggc_mark_tree (p
->x_ctor_label
);
14287 ggc_mark_tree (p
->x_dtor_label
);
14288 ggc_mark_tree (p
->x_base_init_list
);
14289 ggc_mark_tree (p
->x_member_init_list
);
14290 ggc_mark_tree (p
->x_base_init_expr
);
14291 ggc_mark_tree (p
->x_current_class_ptr
);
14292 ggc_mark_tree (p
->x_current_class_ref
);
14293 ggc_mark_tree (p
->x_last_tree
);
14294 ggc_mark_tree (p
->x_last_expr_type
);
14296 ggc_mark_rtx (p
->x_last_dtor_insn
);
14297 ggc_mark_rtx (p
->x_last_parm_cleanup_insn
);
14298 ggc_mark_rtx (p
->x_result_rtx
);
14300 mark_binding_level (&p
->bindings
);
14307 return function_depth
!= 0;
14312 lang_mark_false_label_stack (l
)
14313 struct label_node
*l
;
14315 /* C++ doesn't use false_label_stack. It better be NULL. */
14316 my_friendly_assert (l
== NULL
, 19990904);
14323 enum tree_code code
= TREE_CODE (t
);
14324 if (code
== IDENTIFIER_NODE
)
14326 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14327 struct lang_id2
*li2
= li
->x
;
14328 ggc_mark_tree (li
->namespace_bindings
);
14329 ggc_mark_tree (li
->bindings
);
14330 ggc_mark_tree (li
->class_value
);
14331 ggc_mark_tree (li
->class_template_info
);
14335 ggc_mark_tree (li2
->label_value
);
14336 ggc_mark_tree (li2
->implicit_decl
);
14337 ggc_mark_tree (li2
->error_locus
);
14340 else if (code
== CPLUS_BINDING
)
14342 if (BINDING_HAS_LEVEL_P (t
))
14343 mark_binding_level (&BINDING_LEVEL (t
));
14345 ggc_mark_tree (BINDING_SCOPE (t
));
14346 ggc_mark_tree (BINDING_VALUE (t
));
14348 else if (code
== OVERLOAD
)
14349 ggc_mark_tree (OVL_FUNCTION (t
));
14350 else if (code
== TEMPLATE_PARM_INDEX
)
14351 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14352 else if (TREE_CODE_CLASS (code
) == 'd')
14354 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14359 ggc_mark_tree (ld
->decl_flags
.access
);
14360 ggc_mark_tree (ld
->decl_flags
.context
);
14361 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14362 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14363 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14365 ggc_mark_tree (ld
->main_decl_variant
);
14366 ggc_mark_tree (ld
->befriending_classes
);
14367 ggc_mark_tree (ld
->saved_tree
);
14368 if (TREE_CODE (t
) == TYPE_DECL
)
14369 ggc_mark_tree (ld
->u
.sorted_fields
);
14373 else if (TREE_CODE_CLASS (code
) == 't')
14375 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14377 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14378 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14381 ggc_mark_tree (lt
->vfields
);
14382 ggc_mark_tree (lt
->vbases
);
14383 ggc_mark_tree (lt
->tags
);
14384 ggc_mark_tree (lt
->search_slot
);
14385 ggc_mark_tree (lt
->size
);
14386 ggc_mark_tree (lt
->abstract_virtuals
);
14387 ggc_mark_tree (lt
->friend_classes
);
14388 ggc_mark_tree (lt
->rtti
);
14389 ggc_mark_tree (lt
->methods
);
14390 ggc_mark_tree (lt
->template_info
);
14391 ggc_mark_tree (lt
->befriending_classes
);
14394 /* In the case of pointer-to-member function types, the
14395 TYPE_LANG_SPECIFIC is really just a tree. */
14396 ggc_mark_tree ((tree
) lt
);