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 is the previous declaration.
2926 Note that this does not apply to the C++ case of declaring
2927 a variable `extern const' and then later `const'.
2929 Don't complain about built-in functions, since they are beyond
2930 the user's control. */
2933 warn_extern_redeclared_static (newdecl
, olddecl
)
2934 tree newdecl
, olddecl
;
2936 static const char *explicit_extern_static_warning
2937 = "`%D' was declared `extern' and later `static'";
2938 static const char *implicit_extern_static_warning
2939 = "`%D' was declared implicitly `extern' and later `static'";
2943 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2946 /* If the old declaration was `static', or the new one isn't, then
2947 then everything is OK. */
2948 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
2951 /* It's OK to declare a builtin function as `static'. */
2952 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2953 && DECL_ARTIFICIAL (olddecl
))
2956 name
= DECL_ASSEMBLER_NAME (newdecl
);
2957 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2958 ? implicit_extern_static_warning
2959 : explicit_extern_static_warning
, newdecl
);
2960 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2963 /* Handle when a new declaration NEWDECL has the same name as an old
2964 one OLDDECL in the same binding contour. Prints an error message
2967 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2968 Otherwise, return 0. */
2971 duplicate_decls (newdecl
, olddecl
)
2972 tree newdecl
, olddecl
;
2974 unsigned olddecl_uid
= DECL_UID (olddecl
);
2975 int olddecl_friend
= 0, types_match
= 0;
2976 int new_defines_function
= 0;
2978 if (newdecl
== olddecl
)
2981 types_match
= decls_match (newdecl
, olddecl
);
2983 /* If either the type of the new decl or the type of the old decl is an
2984 error_mark_node, then that implies that we have already issued an
2985 error (earlier) for some bogus type specification, and in that case,
2986 it is rather pointless to harass the user with yet more error message
2987 about the same declaration, so just pretend the types match here. */
2988 if (TREE_TYPE (newdecl
) == error_mark_node
2989 || TREE_TYPE (olddecl
) == error_mark_node
)
2992 /* Check for redeclaration and other discrepancies. */
2993 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2994 && DECL_ARTIFICIAL (olddecl
))
2996 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2998 /* If you declare a built-in or predefined function name as static,
2999 the old definition is overridden, but optionally warn this was a
3000 bad choice of name. */
3001 if (! TREE_PUBLIC (newdecl
))
3004 cp_warning ("shadowing %s function `%#D'",
3005 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3007 /* Discard the old built-in function. */
3010 /* If the built-in is not ansi, then programs can override
3011 it even globally without an error. */
3012 else if (! DECL_BUILT_IN (olddecl
))
3013 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3017 cp_error ("declaration of `%#D'", newdecl
);
3018 cp_error ("conflicts with built-in declaration `%#D'",
3023 else if (!types_match
)
3025 if ((DECL_LANGUAGE (newdecl
) == lang_c
3026 && DECL_LANGUAGE (olddecl
) == lang_c
)
3027 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3028 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3030 /* A near match; override the builtin. */
3032 if (TREE_PUBLIC (newdecl
))
3034 cp_warning ("new declaration `%#D'", newdecl
);
3035 cp_warning ("ambiguates built-in declaration `%#D'",
3038 else if (warn_shadow
)
3039 cp_warning ("shadowing %s function `%#D'",
3040 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3044 /* Discard the old built-in function. */
3048 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3050 /* If a builtin function is redeclared as `static', merge
3051 the declarations, but make the original one static. */
3052 DECL_THIS_STATIC (olddecl
) = 1;
3053 TREE_PUBLIC (olddecl
) = 0;
3056 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3058 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3059 && TREE_CODE (newdecl
) != TYPE_DECL
3060 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3061 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3062 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3063 && TREE_CODE (olddecl
) != TYPE_DECL
3064 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3065 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3068 /* We do nothing special here, because C++ does such nasty
3069 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3070 get shadowed, and know that if we need to find a TYPE_DECL
3071 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3072 slot of the identifier. */
3076 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3077 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3078 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3079 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3082 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3083 if (TREE_CODE (olddecl
) == TREE_LIST
)
3084 olddecl
= TREE_VALUE (olddecl
);
3085 cp_error_at ("previous declaration of `%#D'", olddecl
);
3087 /* New decl is completely inconsistent with the old one =>
3088 tell caller to replace the old one. */
3092 else if (!types_match
)
3094 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3095 /* These are certainly not duplicate declarations; they're
3096 from different scopes. */
3099 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3101 /* The name of a class template may not be declared to refer to
3102 any other template, class, function, object, namespace, value,
3103 or type in the same scope. */
3104 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3105 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3107 cp_error ("declaration of template `%#D'", newdecl
);
3108 cp_error_at ("conflicts with previous declaration `%#D'",
3111 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3112 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3113 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3114 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3115 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3116 DECL_TEMPLATE_PARMS (olddecl
)))
3118 cp_error ("new declaration `%#D'", newdecl
);
3119 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3123 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3125 if (DECL_LANGUAGE (newdecl
) == lang_c
3126 && DECL_LANGUAGE (olddecl
) == lang_c
)
3128 cp_error ("declaration of C function `%#D' conflicts with",
3130 cp_error_at ("previous declaration `%#D' here", olddecl
);
3132 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3133 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3135 cp_error ("new declaration `%#D'", newdecl
);
3136 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3142 /* Already complained about this, so don't do so again. */
3143 else if (current_class_type
== NULL_TREE
3144 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3146 cp_error ("conflicting types for `%#D'", newdecl
);
3147 cp_error_at ("previous declaration as `%#D'", olddecl
);
3150 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3151 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3152 && (!DECL_TEMPLATE_INFO (newdecl
)
3153 || (DECL_TI_TEMPLATE (newdecl
)
3154 != DECL_TI_TEMPLATE (olddecl
))))
3155 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3156 && (!DECL_TEMPLATE_INFO (olddecl
)
3157 || (DECL_TI_TEMPLATE (olddecl
)
3158 != DECL_TI_TEMPLATE (newdecl
))))))
3159 /* It's OK to have a template specialization and a non-template
3160 with the same type, or to have specializations of two
3161 different templates with the same type. Note that if one is a
3162 specialization, and the other is an instantiation of the same
3163 template, that we do not exit at this point. That situation
3164 can occur if we instantiate a template class, and then
3165 specialize one of its methods. This situation is legal, but
3166 the declarations must be merged in the usual way. */
3168 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3169 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3170 && !DECL_USE_TEMPLATE (newdecl
))
3171 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3172 && !DECL_USE_TEMPLATE (olddecl
))))
3173 /* One of the declarations is a template instantiation, and the
3174 other is not a template at all. That's OK. */
3176 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3177 && DECL_NAMESPACE_ALIAS (newdecl
)
3178 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3179 /* Redeclaration of namespace alias, ignore it. */
3183 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3186 cp_error (errmsg
, newdecl
);
3187 if (DECL_NAME (olddecl
) != NULL_TREE
)
3188 cp_error_at ((DECL_INITIAL (olddecl
)
3189 && namespace_bindings_p ())
3190 ? "`%#D' previously defined here"
3191 : "`%#D' previously declared here", olddecl
);
3193 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3194 && DECL_INITIAL (olddecl
) != NULL_TREE
3195 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3196 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3198 /* Prototype decl follows defn w/o prototype. */
3199 cp_warning_at ("prototype for `%#D'", newdecl
);
3200 cp_warning_at ("follows non-prototype definition here", olddecl
);
3202 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3203 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3205 /* extern "C" int foo ();
3206 int foo () { bar (); }
3208 if (current_lang_stack
3209 == &VARRAY_TREE (current_lang_base
, 0))
3210 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3213 cp_error_at ("previous declaration of `%#D' with %L linkage",
3214 olddecl
, DECL_LANGUAGE (olddecl
));
3215 cp_error ("conflicts with new declaration with %L linkage",
3216 DECL_LANGUAGE (newdecl
));
3220 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3222 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3224 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3225 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3228 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3229 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3231 for (; t1
&& t1
!= void_list_node
;
3232 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3233 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3235 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3240 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3242 cp_pedwarn_at ("after previous specification in `%#D'",
3248 cp_error ("default argument given for parameter %d of `%#D'",
3250 cp_error_at ("after previous specification in `%#D'",
3255 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3256 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3258 cp_warning ("`%#D' was used before it was declared inline",
3260 cp_warning_at ("previous non-inline declaration here",
3266 /* If new decl is `static' and an `extern' was seen previously,
3268 warn_extern_redeclared_static (newdecl
, olddecl
);
3270 /* We have committed to returning 1 at this point. */
3271 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3273 /* Now that functions must hold information normally held
3274 by field decls, there is extra work to do so that
3275 declaration information does not get destroyed during
3277 if (DECL_VINDEX (olddecl
))
3278 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3279 if (DECL_CONTEXT (olddecl
))
3280 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3281 if (DECL_CLASS_CONTEXT (olddecl
))
3282 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3283 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3284 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3285 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3286 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3287 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3288 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3289 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3290 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3292 /* Optionally warn about more than one declaration for the same
3293 name, but don't warn about a function declaration followed by a
3295 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3296 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3297 /* Don't warn about extern decl followed by definition. */
3298 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3299 /* Don't warn about friends, let add_friend take care of it. */
3300 && ! DECL_FRIEND_P (newdecl
))
3302 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3303 cp_warning_at ("previous declaration of `%D'", olddecl
);
3307 /* Deal with C++: must preserve virtual function table size. */
3308 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3310 register tree newtype
= TREE_TYPE (newdecl
);
3311 register tree oldtype
= TREE_TYPE (olddecl
);
3313 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3314 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3316 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3317 CLASSTYPE_FRIEND_CLASSES (newtype
)
3318 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3322 /* Copy all the DECL_... slots specified in the new decl
3323 except for any that we copy here from the old type. */
3324 DECL_MACHINE_ATTRIBUTES (newdecl
)
3325 = merge_machine_decl_attributes (olddecl
, newdecl
);
3327 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3329 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3330 DECL_TEMPLATE_RESULT (olddecl
)))
3331 cp_error ("invalid redeclaration of %D", newdecl
);
3332 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3333 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3334 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3335 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3342 /* Automatically handles default parameters. */
3343 tree oldtype
= TREE_TYPE (olddecl
);
3346 /* Make sure we put the new type in the same obstack as the old one. */
3348 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3350 push_permanent_obstack ();
3352 /* Merge the data types specified in the two decls. */
3353 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3355 if (TREE_CODE (newdecl
) == VAR_DECL
)
3356 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3357 /* Do this after calling `common_type' so that default
3358 parameters don't confuse us. */
3359 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3360 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3361 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3363 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3364 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3365 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3366 TYPE_RAISES_EXCEPTIONS (oldtype
));
3368 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3369 && DECL_SOURCE_LINE (olddecl
) != 0
3371 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3372 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3374 cp_error ("declaration of `%F' throws different exceptions",
3376 cp_error_at ("to previous declaration `%F'", olddecl
);
3379 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3381 /* Lay the type out, unless already done. */
3382 if (! same_type_p (newtype
, oldtype
)
3383 && TREE_TYPE (newdecl
) != error_mark_node
3384 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3385 layout_type (TREE_TYPE (newdecl
));
3387 if ((TREE_CODE (newdecl
) == VAR_DECL
3388 || TREE_CODE (newdecl
) == PARM_DECL
3389 || TREE_CODE (newdecl
) == RESULT_DECL
3390 || TREE_CODE (newdecl
) == FIELD_DECL
3391 || TREE_CODE (newdecl
) == TYPE_DECL
)
3392 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3393 layout_decl (newdecl
, 0);
3395 /* Merge the type qualifiers. */
3396 if (TREE_READONLY (newdecl
))
3397 TREE_READONLY (olddecl
) = 1;
3398 if (TREE_THIS_VOLATILE (newdecl
))
3399 TREE_THIS_VOLATILE (olddecl
) = 1;
3401 /* Merge the initialization information. */
3402 if (DECL_INITIAL (newdecl
) == NULL_TREE
3403 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3405 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3406 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3407 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3408 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3409 && DECL_LANG_SPECIFIC (newdecl
)
3410 && DECL_LANG_SPECIFIC (olddecl
))
3411 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3414 /* Merge the section attribute.
3415 We want to issue an error if the sections conflict but that must be
3416 done later in decl_attributes since we are called before attributes
3418 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3419 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3421 /* Keep the old rtl since we can safely use it. */
3422 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3426 /* If cannot merge, then use the new type and qualifiers,
3427 and don't preserve the old rtl. */
3430 /* Clean out any memory we had of the old declaration. */
3431 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3433 TREE_VALUE (oldstatic
) = error_mark_node
;
3435 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3436 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3437 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3438 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3441 /* Merge the storage class information. */
3442 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3443 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3444 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3445 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3446 if (! DECL_EXTERNAL (olddecl
))
3447 DECL_EXTERNAL (newdecl
) = 0;
3449 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3451 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3452 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3453 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3454 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3455 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3456 /* Don't really know how much of the language-specific
3457 values we should copy from old to new. */
3458 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3459 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3460 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3461 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3462 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3464 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3465 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3466 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3467 DECL_BEFRIENDING_CLASSES (newdecl
)
3468 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3469 DECL_BEFRIENDING_CLASSES (olddecl
));
3472 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3474 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3475 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3477 /* If newdecl is not a specialization, then it is not a
3478 template-related function at all. And that means that we
3479 shoud have exited above, returning 0. */
3480 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3483 if (TREE_USED (olddecl
))
3484 /* From [temp.expl.spec]:
3486 If a template, a member template or the member of a class
3487 template is explicitly specialized then that
3488 specialization shall be declared before the first use of
3489 that specialization that would cause an implicit
3490 instantiation to take place, in every translation unit in
3491 which such a use occurs. */
3492 cp_error ("explicit specialization of %D after first use",
3495 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3497 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3499 /* If either decl says `inline', this fn is inline, unless its
3500 definition was passed already. */
3501 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3502 DECL_INLINE (olddecl
) = 1;
3503 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3507 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3508 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3509 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3511 if (! types_match
|| new_defines_function
)
3513 /* These need to be copied so that the names are available.
3514 Note that if the types do match, we'll preserve inline
3515 info and other bits, but if not, we won't. */
3516 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3517 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3519 if (new_defines_function
)
3520 /* If defining a function declared with other language
3521 linkage, use the previously declared language linkage. */
3522 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3523 else if (types_match
)
3525 /* If redeclaring a builtin function, and not a definition,
3526 it stays built in. */
3527 if (DECL_BUILT_IN (olddecl
))
3529 DECL_BUILT_IN (newdecl
) = 1;
3530 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3531 /* If we're keeping the built-in definition, keep the rtl,
3532 regardless of declaration matches. */
3533 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3536 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3538 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3539 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3540 /* Previously saved insns go together with
3541 the function's previous definition. */
3542 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3543 /* Don't clear out the arguments if we're redefining a function. */
3544 if (DECL_ARGUMENTS (olddecl
))
3545 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3547 if (DECL_LANG_SPECIFIC (olddecl
))
3548 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3551 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3553 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3556 /* Now preserve various other info from the definition. */
3557 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3558 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3559 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3560 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3562 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3566 function_size
= sizeof (struct tree_decl
);
3568 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3569 (char *) olddecl
+ sizeof (struct tree_common
),
3570 function_size
- sizeof (struct tree_common
));
3572 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3574 /* If newdecl is a template instantiation, it is possible that
3575 the following sequence of events has occurred:
3577 o A friend function was declared in a class template. The
3578 class template was instantiated.
3580 o The instantiation of the friend declaration was
3581 recorded on the instantiation list, and is newdecl.
3583 o Later, however, instantiate_class_template called pushdecl
3584 on the newdecl to perform name injection. But, pushdecl in
3585 turn called duplicate_decls when it discovered that another
3586 declaration of a global function with the same name already
3589 o Here, in duplicate_decls, we decided to clobber newdecl.
3591 If we're going to do that, we'd better make sure that
3592 olddecl, and not newdecl, is on the list of
3593 instantiations so that if we try to do the instantiation
3594 again we won't get the clobbered declaration. */
3596 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3597 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3599 for (; decls
; decls
= TREE_CHAIN (decls
))
3600 if (TREE_VALUE (decls
) == newdecl
)
3601 TREE_VALUE (decls
) = olddecl
;
3606 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3607 (char *) olddecl
+ sizeof (struct tree_common
),
3608 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3609 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3612 DECL_UID (olddecl
) = olddecl_uid
;
3614 DECL_FRIEND_P (olddecl
) = 1;
3616 /* NEWDECL contains the merged attribute lists.
3617 Update OLDDECL to be the same. */
3618 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3623 /* Record a decl-node X as belonging to the current lexical scope.
3624 Check for errors (such as an incompatible declaration for the same
3625 name already seen in the same scope).
3627 Returns either X or an old decl for the same name.
3628 If an old decl is returned, it may have been smashed
3629 to agree with what X says. */
3636 register tree name
= DECL_ASSEMBLER_NAME (x
);
3637 int need_new_binding
= 1;
3639 if (DECL_TEMPLATE_PARM_P (x
))
3640 /* Template parameters have no context; they are not X::T even
3641 when declared within a class or namespace. */
3645 if (current_function_decl
&& x
!= current_function_decl
3646 /* A local declaration for a function doesn't constitute
3648 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3649 /* Don't change DECL_CONTEXT of virtual methods. */
3650 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3651 && !DECL_CONTEXT (x
))
3652 DECL_CONTEXT (x
) = current_function_decl
;
3653 if (!DECL_CONTEXT (x
))
3654 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3657 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3658 compiler wants to use. */
3659 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3660 || TREE_CODE (x
) == NAMESPACE_DECL
)
3661 name
= DECL_NAME (x
);
3666 /* Not needed...see below. */
3670 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3671 name
= TREE_OPERAND (name
, 0);
3673 /* Namespace-scoped variables are not found in the current level. */
3674 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3675 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3677 t
= lookup_name_current_level (name
);
3678 if (t
== error_mark_node
)
3680 /* error_mark_node is 0 for a while during initialization! */
3682 cp_error_at ("`%#D' used prior to declaration", x
);
3685 else if (t
!= NULL_TREE
)
3688 /* This is turned off until I have time to do it right (bpk). */
3689 /* With the code below that uses it... */
3690 file
= DECL_SOURCE_FILE (t
);
3691 line
= DECL_SOURCE_LINE (t
);
3693 if (TREE_CODE (t
) == PARM_DECL
)
3695 if (DECL_CONTEXT (t
) == NULL_TREE
)
3696 fatal ("parse errors have confused me too much");
3698 /* Check for duplicate params. */
3699 if (duplicate_decls (x
, t
))
3702 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3703 || DECL_FUNCTION_TEMPLATE_P (x
))
3704 && is_overloaded_fn (t
))
3705 /* Don't do anything just yet. */;
3706 else if (t
== wchar_decl_node
)
3708 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3709 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3711 /* Throw away the redeclaration. */
3714 else if (TREE_CODE (t
) != TREE_CODE (x
))
3716 if (duplicate_decls (x
, t
))
3719 else if (duplicate_decls (x
, t
))
3722 /* This is turned off until I have time to do it right (bpk). */
3724 /* Also warn if they did a prototype with `static' on it, but
3725 then later left the `static' off. */
3726 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3728 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3733 cp_warning ("`static' missing from declaration of `%D'",
3735 warning_with_file_and_line (file
, line
,
3736 "previous declaration of `%s'",
3737 decl_as_string (t
, 0));
3740 /* Now fix things so it'll do what they expect. */
3741 if (current_function_decl
)
3742 TREE_PUBLIC (current_function_decl
) = 0;
3744 /* Due to interference in memory reclamation (X may be
3745 obstack-deallocated at this point), we must guard against
3746 one really special case. [jason: This should be handled
3747 by start_function] */
3748 if (current_function_decl
== x
)
3749 current_function_decl
= t
;
3751 if (TREE_CODE (t
) == TYPE_DECL
)
3752 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3753 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3754 check_default_args (t
);
3758 else if (DECL_MAIN_P (x
))
3760 /* A redeclaration of main, but not a duplicate of the
3765 This function shall not be overloaded. */
3766 cp_error_at ("invalid redeclaration of `%D'", t
);
3767 cp_error ("as `%D'", x
);
3768 /* We don't try to push this declaration since that
3774 check_template_shadow (x
);
3776 /* If this is a function conjured up by the backend, massage it
3777 so it looks friendly. */
3778 if (TREE_CODE (x
) == FUNCTION_DECL
3779 && ! DECL_LANG_SPECIFIC (x
))
3781 retrofit_lang_decl (x
);
3782 DECL_LANGUAGE (x
) = lang_c
;
3785 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3787 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3788 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3790 if (!namespace_bindings_p ())
3791 /* We do not need to create a binding for this name;
3792 push_overloaded_decl will have already done so if
3794 need_new_binding
= 0;
3796 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3798 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3800 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3804 /* If declaring a type as a typedef, copy the type (unless we're
3805 at line 0), and install this TYPE_DECL as the new type's typedef
3806 name. See the extensive comment in ../c-decl.c (pushdecl). */
3807 if (TREE_CODE (x
) == TYPE_DECL
)
3809 tree type
= TREE_TYPE (x
);
3810 if (DECL_SOURCE_LINE (x
) == 0)
3812 if (TYPE_NAME (type
) == 0)
3813 TYPE_NAME (type
) = x
;
3815 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3816 /* We don't want to copy the type when all we're
3817 doing is making a TYPE_DECL for the purposes of
3819 && (!TYPE_NAME (type
)
3820 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3822 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3824 DECL_ORIGINAL_TYPE (x
) = type
;
3825 type
= build_type_copy (type
);
3826 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3827 TYPE_NAME (type
) = x
;
3828 TREE_TYPE (x
) = type
;
3833 if (type
!= error_mark_node
3835 && TYPE_IDENTIFIER (type
))
3836 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3837 current_binding_level
);
3841 /* Multiple external decls of the same identifier ought to match.
3843 We get warnings about inline functions where they are defined.
3844 We get warnings about other functions from push_overloaded_decl.
3846 Avoid duplicate warnings where they are used. */
3847 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3851 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3852 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3853 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3854 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3859 /* If different sort of thing, we already gave an error. */
3860 && TREE_CODE (decl
) == TREE_CODE (x
)
3861 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3863 cp_pedwarn ("type mismatch with previous external decl", x
);
3864 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3868 /* This name is new in its binding level.
3869 Install the new declaration and return it. */
3870 if (namespace_bindings_p ())
3872 /* Install a global value. */
3874 /* If the first global decl has external linkage,
3875 warn if we later see static one. */
3876 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3877 TREE_PUBLIC (name
) = 1;
3879 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3882 if (TREE_CODE (x
) == FUNCTION_DECL
)
3884 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3885 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3886 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3889 /* Don't forget if the function was used via an implicit decl. */
3890 if (IDENTIFIER_IMPLICIT_DECL (name
)
3891 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3894 /* Don't forget if its address was taken in that way. */
3895 if (IDENTIFIER_IMPLICIT_DECL (name
)
3896 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3897 TREE_ADDRESSABLE (x
) = 1;
3899 /* Warn about mismatches against previous implicit decl. */
3900 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3901 /* If this real decl matches the implicit, don't complain. */
3902 && ! (TREE_CODE (x
) == FUNCTION_DECL
3903 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3905 ("`%D' was previously implicitly declared to return `int'", x
);
3907 /* If new decl is `static' and an `extern' was seen previously,
3909 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3910 warn_extern_redeclared_static (x
, t
);
3914 /* Here to install a non-global value. */
3915 tree oldlocal
= IDENTIFIER_VALUE (name
);
3916 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3918 if (need_new_binding
)
3920 push_local_binding (name
, x
, 0);
3921 /* Because push_local_binding will hook X on to the
3922 current_binding_level's name list, we don't want to
3923 do that again below. */
3924 need_new_binding
= 0;
3927 /* If this is a TYPE_DECL, push it into the type value slot. */
3928 if (TREE_CODE (x
) == TYPE_DECL
)
3929 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3930 current_binding_level
);
3932 /* Clear out any TYPE_DECL shadowed by a namespace so that
3933 we won't think this is a type. The C struct hack doesn't
3934 go through namespaces. */
3935 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3936 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3937 current_binding_level
);
3939 /* If this is an extern function declaration, see if we
3940 have a global definition or declaration for the function. */
3941 if (oldlocal
== NULL_TREE
3942 && DECL_EXTERNAL (x
)
3943 && oldglobal
!= NULL_TREE
3944 && TREE_CODE (x
) == FUNCTION_DECL
3945 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3947 /* We have one. Their types must agree. */
3948 if (decls_match (x
, oldglobal
))
3952 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3953 cp_warning_at ("global declaration `%#D'", oldglobal
);
3956 /* If we have a local external declaration,
3957 and no file-scope declaration has yet been seen,
3958 then if we later have a file-scope decl it must not be static. */
3959 if (oldlocal
== NULL_TREE
3960 && oldglobal
== NULL_TREE
3961 && DECL_EXTERNAL (x
)
3963 TREE_PUBLIC (name
) = 1;
3965 if (DECL_FROM_INLINE (x
))
3966 /* Inline decls shadow nothing. */;
3968 /* Warn if shadowing an argument at the top level of the body. */
3969 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3970 && TREE_CODE (oldlocal
) == PARM_DECL
3971 /* Don't complain if it's from an enclosing function. */
3972 && DECL_CONTEXT (oldlocal
) == current_function_decl
3973 && TREE_CODE (x
) != PARM_DECL
)
3975 /* Go to where the parms should be and see if we
3977 struct binding_level
*b
= current_binding_level
->level_chain
;
3983 if (b
->parm_flag
== 1)
3984 cp_error ("declaration of `%#D' shadows a parameter", name
);
3986 else if (warn_shadow
&& oldlocal
!= NULL_TREE
3987 && current_binding_level
->is_for_scope
3988 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3990 warning ("variable `%s' shadows local",
3991 IDENTIFIER_POINTER (name
));
3992 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3994 /* Maybe warn if shadowing something else. */
3995 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
3996 /* No shadow warnings for internally generated vars. */
3997 && ! DECL_ARTIFICIAL (x
)
3998 /* No shadow warnings for vars made for inlining. */
3999 && ! DECL_FROM_INLINE (x
))
4001 const char *warnstring
= NULL
;
4003 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4004 warnstring
= "declaration of `%s' shadows a parameter";
4005 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4006 && current_class_ptr
4007 && !TREE_STATIC (name
))
4008 warnstring
= "declaration of `%s' shadows a member of `this'";
4009 else if (oldlocal
!= NULL_TREE
)
4010 warnstring
= "declaration of `%s' shadows previous local";
4011 else if (oldglobal
!= NULL_TREE
)
4012 /* XXX shadow warnings in outer-more namespaces */
4013 warnstring
= "declaration of `%s' shadows global declaration";
4016 warning (warnstring
, IDENTIFIER_POINTER (name
));
4020 if (TREE_CODE (x
) == FUNCTION_DECL
)
4021 check_default_args (x
);
4023 /* Keep count of variables in this level with incomplete type. */
4024 if (TREE_CODE (x
) == VAR_DECL
4025 && TREE_TYPE (x
) != error_mark_node
4026 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4027 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4028 /* RTTI TD entries are created while defining the type_info. */
4029 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4030 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4031 current_binding_level
->incomplete
4032 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4035 if (need_new_binding
)
4036 add_decl_to_level (x
, current_binding_level
);
4041 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4042 caller to set DECL_CONTEXT properly. */
4045 pushdecl_with_scope (x
, level
)
4047 struct binding_level
*level
;
4049 register struct binding_level
*b
;
4050 tree function_decl
= current_function_decl
;
4052 current_function_decl
= NULL_TREE
;
4053 if (level
->parm_flag
== 2)
4055 b
= class_binding_level
;
4056 class_binding_level
= level
;
4057 pushdecl_class_level (x
);
4058 class_binding_level
= b
;
4062 b
= current_binding_level
;
4063 current_binding_level
= level
;
4065 current_binding_level
= b
;
4067 current_function_decl
= function_decl
;
4071 /* Like pushdecl, only it places X in the current namespace,
4075 pushdecl_namespace_level (x
)
4078 register struct binding_level
*b
= current_binding_level
;
4081 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4083 /* Now, the type_shadowed stack may screw us. Munge it so it does
4085 if (TREE_CODE (x
) == TYPE_DECL
)
4087 tree name
= DECL_NAME (x
);
4089 tree
*ptr
= (tree
*)0;
4090 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4092 tree shadowed
= b
->type_shadowed
;
4093 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4094 if (TREE_PURPOSE (shadowed
) == name
)
4096 ptr
= &TREE_VALUE (shadowed
);
4097 /* Can't break out of the loop here because sometimes
4098 a binding level will have duplicate bindings for
4099 PT names. It's gross, but I haven't time to fix it. */
4102 newval
= TREE_TYPE (x
);
4103 if (ptr
== (tree
*)0)
4105 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4106 up here if this is changed to an assertion. --KR */
4107 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4117 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4121 pushdecl_top_level (x
)
4124 tree cur_namespace
= current_namespace
;
4125 current_namespace
= global_namespace
;
4126 x
= pushdecl_namespace_level (x
);
4127 current_namespace
= cur_namespace
;
4131 /* Make the declaration of X appear in CLASS scope. */
4134 pushdecl_class_level (x
)
4137 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4138 scope looks for the pre-mangled name. */
4141 if (TREE_CODE (x
) == OVERLOAD
)
4142 x
= OVL_CURRENT (x
);
4143 name
= DECL_NAME (x
);
4147 push_class_level_binding (name
, x
);
4148 if (TREE_CODE (x
) == TYPE_DECL
)
4149 set_identifier_type_value (name
, TREE_TYPE (x
));
4151 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4155 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4158 pushdecl_class_level (f
);
4162 /* Enter DECL into the symbol table, if that's appropriate. Returns
4163 DECL, or a modified version thereof. */
4166 maybe_push_decl (decl
)
4169 tree type
= TREE_TYPE (decl
);
4171 /* Add this decl to the current binding level, but not if it comes
4172 from another scope, e.g. a static member variable. TEM may equal
4173 DECL or it may be a previous decl of the same name. */
4174 if ((TREE_CODE (decl
) != PARM_DECL
4175 && DECL_CONTEXT (decl
) != NULL_TREE
4176 /* Definitions of namespace members outside their namespace are
4178 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4179 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4180 || TREE_CODE (type
) == UNKNOWN_TYPE
4181 /* The declaration of a template specialization does not affect
4182 the functions available for overload resolution, so we do not
4184 || (TREE_CODE (decl
) == FUNCTION_DECL
4185 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4188 return pushdecl (decl
);
4192 /* This function is used to push the mangled decls for nested types into
4193 the appropriate scope. Previously pushdecl_top_level was used, but that
4194 is incorrect for members of local classes. */
4197 pushdecl_nonclass_level (x
)
4200 struct binding_level
*b
= current_binding_level
;
4202 my_friendly_assert (b
->parm_flag
!= 2, 180);
4205 /* Get out of template binding levels */
4206 while (b
->pseudo_global
)
4210 pushdecl_with_scope (x
, b
);
4214 /* Make the declaration(s) of X appear in CLASS scope
4215 under the name NAME. */
4218 push_class_level_binding (name
, x
)
4223 /* The class_binding_level will be NULL if x is a template
4224 parameter name in a member template. */
4225 if (!class_binding_level
)
4228 /* Make sure that this new member does not have the same name
4229 as a template parameter. */
4230 if (TYPE_BEING_DEFINED (current_class_type
))
4231 check_template_shadow (x
);
4233 /* If this declaration shadows a declaration from an enclosing
4234 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4235 we leave this class. Record the shadowed declaration here. */
4236 binding
= IDENTIFIER_BINDING (name
);
4238 && ((TREE_CODE (x
) == OVERLOAD
4239 && BINDING_VALUE (binding
)
4240 && is_overloaded_fn (BINDING_VALUE (binding
)))
4241 || INHERITED_VALUE_BINDING_P (binding
)))
4246 /* If the old binding was from a base class, and was for a tag
4247 name, slide it over to make room for the new binding. The
4248 old binding is still visible if explicitly qualified with a
4250 if (INHERITED_VALUE_BINDING_P (binding
)
4251 && BINDING_VALUE (binding
)
4252 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4253 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4254 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4256 old_decl
= BINDING_TYPE (binding
);
4257 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4258 BINDING_VALUE (binding
) = NULL_TREE
;
4259 INHERITED_VALUE_BINDING_P (binding
) = 0;
4262 old_decl
= BINDING_VALUE (binding
);
4264 /* There was already a binding for X containing fewer
4265 functions than are named in X. Find the previous
4266 declaration of X on the class-shadowed list, and update it. */
4267 for (shadow
= class_binding_level
->class_shadowed
;
4269 shadow
= TREE_CHAIN (shadow
))
4270 if (TREE_PURPOSE (shadow
) == name
4271 && TREE_TYPE (shadow
) == old_decl
)
4273 BINDING_VALUE (binding
) = x
;
4274 INHERITED_VALUE_BINDING_P (binding
) = 0;
4275 TREE_TYPE (shadow
) = x
;
4280 /* If we didn't replace an existing binding, put the binding on the
4281 stack of bindings for the identifier, and update
4282 IDENTIFIER_CLASS_VALUE. */
4283 if (push_class_binding (name
, x
))
4285 push_cache_obstack ();
4286 class_binding_level
->class_shadowed
4287 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4288 class_binding_level
->class_shadowed
);
4290 /* Record the value we are binding NAME to so that we can know
4291 what to pop later. */
4292 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4296 /* Insert another USING_DECL into the current binding level,
4297 returning this declaration. If this is a redeclaration,
4298 do nothing and return NULL_TREE. */
4301 push_using_decl (scope
, name
)
4307 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4308 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4309 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4310 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4314 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4315 DECL_INITIAL (decl
) = scope
;
4316 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4317 current_binding_level
->usings
= decl
;
4321 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4322 changed (i.e. there was already a directive), or the fresh
4323 TREE_LIST otherwise. */
4326 push_using_directive (used
)
4329 tree ud
= current_binding_level
->using_directives
;
4330 tree iter
, ancestor
;
4332 /* Check if we already have this. */
4333 if (purpose_member (used
, ud
) != NULL_TREE
)
4336 /* Recursively add all namespaces used. */
4337 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4338 push_using_directive (TREE_PURPOSE (iter
));
4340 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4341 ud
= current_binding_level
->using_directives
;
4342 ud
= tree_cons (used
, ancestor
, ud
);
4343 current_binding_level
->using_directives
= ud
;
4347 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4348 other definitions already in place. We get around this by making
4349 the value of the identifier point to a list of all the things that
4350 want to be referenced by that name. It is then up to the users of
4351 that name to decide what to do with that list.
4353 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4354 slot. It is dealt with the same way.
4356 FLAGS is a bitwise-or of the following values:
4357 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4359 PUSH_USING: DECL is being pushed as the result of a using
4362 The value returned may be a previous declaration if we guessed wrong
4363 about what language DECL should belong to (C or C++). Otherwise,
4364 it's always DECL (and never something that's not a _DECL). */
4367 push_overloaded_decl (decl
, flags
)
4371 tree name
= DECL_NAME (decl
);
4374 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4377 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4379 old
= lookup_name_current_level (name
);
4383 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4385 tree t
= TREE_TYPE (old
);
4386 if (IS_AGGR_TYPE (t
) && warn_shadow
4387 && (! DECL_IN_SYSTEM_HEADER (decl
)
4388 || ! DECL_IN_SYSTEM_HEADER (old
)))
4389 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4392 else if (is_overloaded_fn (old
))
4396 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4398 tree fn
= OVL_CURRENT (tmp
);
4400 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4401 && !(flags
& PUSH_USING
)
4402 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4403 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4404 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4407 if (duplicate_decls (decl
, fn
))
4413 cp_error_at ("previous non-function declaration `%#D'", old
);
4414 cp_error ("conflicts with function declaration `%#D'", decl
);
4419 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4421 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4422 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4424 new_binding
= ovl_cons (decl
, old
);
4425 if (flags
& PUSH_USING
)
4426 OVL_USED (new_binding
) = 1;
4429 /* NAME is not ambiguous. */
4433 set_namespace_binding (name
, current_namespace
, new_binding
);
4436 /* We only create an OVERLOAD if there was a previous binding at
4437 this level, or if decl is a template. In the former case, we
4438 need to remove the old binding and replace it with the new
4439 binding. We must also run through the NAMES on the binding
4440 level where the name was bound to update the chain. */
4442 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4446 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4448 d
= &TREE_CHAIN (*d
))
4450 || (TREE_CODE (*d
) == TREE_LIST
4451 && TREE_VALUE (*d
) == old
))
4453 if (TREE_CODE (*d
) == TREE_LIST
)
4454 /* Just replace the old binding with the new. */
4455 TREE_VALUE (*d
) = new_binding
;
4457 /* Build a TREE_LIST to wrap the OVERLOAD. */
4458 *d
= tree_cons (NULL_TREE
, new_binding
,
4461 /* And update the CPLUS_BINDING node. */
4462 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4467 /* We should always find a previous binding in this case. */
4468 my_friendly_abort (0);
4471 /* Install the new binding. */
4472 push_local_binding (name
, new_binding
, flags
);
4478 /* Generate an implicit declaration for identifier FUNCTIONID
4479 as a function of type int (). Print a warning if appropriate. */
4482 implicitly_declare (functionid
)
4486 int temp
= allocation_temporary_p ();
4488 push_obstacks_nochange ();
4490 /* Save the decl permanently so we can warn if definition follows.
4491 In ANSI C, warn_implicit is usually false, so the saves little space.
4492 But in C++, it's usually true, hence the extra code. */
4493 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4494 end_temporary_allocation ();
4496 /* We used to reuse an old implicit decl here,
4497 but this loses with inline functions because it can clobber
4498 the saved decl chains. */
4499 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4501 DECL_EXTERNAL (decl
) = 1;
4502 TREE_PUBLIC (decl
) = 1;
4504 /* ANSI standard says implicit declarations are in the innermost block.
4505 So we record the decl in the standard fashion. */
4507 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4510 /* Only one warning per identifier. */
4511 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4513 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4516 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4523 /* Return zero if the declaration NEWDECL is valid
4524 when the declaration OLDDECL (assumed to be for the same name)
4525 has already been seen.
4526 Otherwise return an error message format string with a %s
4527 where the identifier should go. */
4530 redeclaration_error_message (newdecl
, olddecl
)
4531 tree newdecl
, olddecl
;
4533 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4535 /* Because C++ can put things into name space for free,
4536 constructs like "typedef struct foo { ... } foo"
4537 would look like an erroneous redeclaration. */
4538 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4541 return "redefinition of `%#D'";
4543 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4545 /* If this is a pure function, its olddecl will actually be
4546 the original initialization to `0' (which we force to call
4547 abort()). Don't complain about redefinition in this case. */
4548 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4551 /* If both functions come from different namespaces, this is not
4552 a redeclaration - this is a conflict with a used function. */
4553 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4554 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4555 return "`%D' conflicts with used function";
4557 /* We'll complain about linkage mismatches in
4558 warn_extern_redeclared_static. */
4560 /* Defining the same name twice is no good. */
4561 if (DECL_INITIAL (olddecl
) != NULL_TREE
4562 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4564 if (DECL_NAME (olddecl
) == NULL_TREE
)
4565 return "`%#D' not declared in class";
4567 return "redefinition of `%#D'";
4571 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4573 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4574 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4575 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4576 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4577 && TYPE_SIZE (TREE_TYPE (newdecl
))
4578 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4579 return "redefinition of `%#D'";
4582 else if (toplevel_bindings_p ())
4584 /* Objects declared at top level: */
4585 /* If at least one is a reference, it's ok. */
4586 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4588 /* Reject two definitions. */
4589 return "redefinition of `%#D'";
4593 /* Objects declared with block scope: */
4594 /* Reject two definitions, and reject a definition
4595 together with an external reference. */
4596 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4597 return "redeclaration of `%#D'";
4602 /* Create a new label, named ID. */
4605 make_label_decl (id
, local_p
)
4611 if (building_stmt_tree ())
4612 push_permanent_obstack ();
4613 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4614 if (building_stmt_tree ())
4617 /* Make sure every label has an rtx. */
4620 DECL_CONTEXT (decl
) = current_function_decl
;
4621 DECL_MODE (decl
) = VOIDmode
;
4622 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4624 /* Say where one reference is to the label, for the sake of the
4625 error if it is not defined. */
4626 DECL_SOURCE_LINE (decl
) = lineno
;
4627 DECL_SOURCE_FILE (decl
) = input_filename
;
4629 /* Record the fact that this identifier is bound to this label. */
4630 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4632 /* Record this label on the list of used labels so that we can check
4633 at the end of the function to see whether or not the label was
4634 actually defined. */
4635 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4636 && (named_label_uses
== NULL
4637 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4638 || named_label_uses
->label_decl
!= decl
))
4640 struct named_label_list
*new_ent
;
4642 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4643 new_ent
->label_decl
= decl
;
4644 new_ent
->names_in_scope
= current_binding_level
->names
;
4645 new_ent
->binding_level
= current_binding_level
;
4646 new_ent
->lineno_o_goto
= lineno
;
4647 new_ent
->filename_o_goto
= input_filename
;
4648 new_ent
->next
= named_label_uses
;
4649 named_label_uses
= new_ent
;
4655 /* Look for a label named ID in the current function. If one cannot
4656 be found, create one. (We keep track of used, but undefined,
4657 labels, and complain about them at the end of a function.) */
4665 /* You can't use labels at global scope. */
4666 if (current_function_decl
== NULL_TREE
)
4668 error ("label `%s' referenced outside of any function",
4669 IDENTIFIER_POINTER (id
));
4673 /* See if we've already got this label. */
4674 decl
= IDENTIFIER_LABEL_VALUE (id
);
4675 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4678 /* Record this label on the list of labels used in this function.
4679 We do this before calling make_label_decl so that we get the
4680 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4681 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4683 /* We need a new label. */
4684 decl
= make_label_decl (id
, /*local_p=*/0);
4685 /* Now fill in the information we didn't have before. */
4686 TREE_VALUE (named_labels
) = decl
;
4691 /* Declare a local label named ID. */
4694 declare_local_label (id
)
4699 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4700 this scope we can restore the old value of
4701 IDENTIFIER_TYPE_VALUE. */
4702 current_binding_level
->shadowed_labels
4703 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4704 current_binding_level
->shadowed_labels
);
4705 /* Look for the label. */
4706 decl
= make_label_decl (id
, /*local_p=*/1);
4707 /* Now fill in the information we didn't have before. */
4708 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4713 /* Define a label, specifying the location in the source file.
4714 Return the LABEL_DECL node for the label, if the definition is valid.
4715 Otherwise return 0. */
4718 define_label (filename
, line
, name
)
4723 tree decl
= lookup_label (name
);
4725 /* After labels, make any new cleanups go into their
4726 own new (temporary) binding contour. */
4727 current_binding_level
->more_cleanups_ok
= 0;
4729 if (name
== get_identifier ("wchar_t"))
4730 cp_pedwarn ("label named wchar_t");
4732 if (DECL_INITIAL (decl
) != NULL_TREE
)
4734 cp_error ("duplicate label `%D'", decl
);
4739 struct named_label_list
*uses
, *prev
;
4743 /* Mark label as having been defined. */
4744 DECL_INITIAL (decl
) = error_mark_node
;
4745 /* Say where in the source. */
4746 DECL_SOURCE_FILE (decl
) = filename
;
4747 DECL_SOURCE_LINE (decl
) = line
;
4750 uses
= named_label_uses
;
4751 while (uses
!= NULL
)
4752 if (uses
->label_decl
== decl
)
4754 struct binding_level
*b
= current_binding_level
;
4757 tree new_decls
= b
->names
;
4758 tree old_decls
= (b
== uses
->binding_level
)
4759 ? uses
->names_in_scope
: NULL_TREE
;
4760 while (new_decls
!= old_decls
)
4762 if (TREE_CODE (new_decls
) == VAR_DECL
4763 /* Don't complain about crossing initialization
4764 of internal entities. They can't be accessed,
4765 and they should be cleaned up
4766 by the time we get to the label. */
4767 && ! DECL_ARTIFICIAL (new_decls
)
4768 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4769 && pod_type_p (TREE_TYPE (new_decls
))))
4771 /* This is really only important if we're crossing
4772 an initialization. The POD stuff is just
4773 pedantry; why should it matter if the class
4774 contains a field of pointer to member type? */
4775 int problem
= (DECL_INITIAL (new_decls
)
4776 || (TYPE_NEEDS_CONSTRUCTING
4777 (TREE_TYPE (new_decls
))));
4783 cp_error ("jump to label `%D'", decl
);
4784 error_with_file_and_line
4785 (uses
->filename_o_goto
,
4786 uses
->lineno_o_goto
, " from here");
4790 cp_pedwarn ("jump to label `%D'", decl
);
4791 pedwarn_with_file_and_line
4792 (uses
->filename_o_goto
,
4793 uses
->lineno_o_goto
, " from here");
4799 cp_error_at (" crosses initialization of `%#D'",
4802 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4805 new_decls
= TREE_CHAIN (new_decls
);
4807 if (b
== uses
->binding_level
)
4809 if (b
->eh_region
&& ! saw_eh
)
4813 cp_error ("jump to label `%D'", decl
);
4814 error_with_file_and_line
4815 (uses
->filename_o_goto
,
4816 uses
->lineno_o_goto
, " from here");
4819 error (" enters exception handling block");
4826 prev
->next
= uses
->next
;
4828 named_label_uses
= uses
->next
;
4837 current_function_return_value
= NULL_TREE
;
4844 struct binding_level
*level
;
4845 struct cp_switch
*next
;
4848 static struct cp_switch
*switch_stack
;
4854 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4855 p
->level
= current_binding_level
;
4856 p
->next
= switch_stack
;
4863 switch_stack
= switch_stack
->next
;
4866 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4867 /* XXX Note decl is never actually used. (bpk) */
4870 define_case_label ()
4872 tree cleanup
= last_cleanup_this_contour ();
4873 struct binding_level
*b
= current_binding_level
;
4878 static int explained
= 0;
4879 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4880 warning ("where case label appears here");
4883 warning ("(enclose actions of previous case statements requiring");
4884 warning ("destructors in their own binding contours.)");
4889 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4891 tree new_decls
= b
->names
;
4892 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4894 if (TREE_CODE (new_decls
) == VAR_DECL
4895 /* Don't complain about crossing initialization
4896 of internal entities. They can't be accessed,
4897 and they should be cleaned up
4898 by the time we get to the label. */
4899 && ! DECL_ARTIFICIAL (new_decls
)
4900 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4901 && DECL_INITIAL (new_decls
) != error_mark_node
)
4902 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4905 error ("jump to case label");
4907 cp_error_at (" crosses initialization of `%#D'",
4913 /* After labels, make any new cleanups go into their
4914 own new (temporary) binding contour. */
4916 current_binding_level
->more_cleanups_ok
= 0;
4917 current_function_return_value
= NULL_TREE
;
4920 /* Return the list of declarations of the current level.
4921 Note that this list is in reverse order unless/until
4922 you nreverse it; and when you do nreverse it, you must
4923 store the result back using `storedecls' or you will lose. */
4928 return current_binding_level
->names
;
4931 /* Return the list of type-tags (for structs, etc) of the current level. */
4936 return current_binding_level
->tags
;
4939 /* Store the list of declarations of the current level.
4940 This is done for the parameter declarations of a function being defined,
4941 after they are modified in the light of any missing parameters. */
4947 current_binding_level
->names
= decls
;
4950 /* Similarly, store the list of tags of the current level. */
4956 current_binding_level
->tags
= tags
;
4959 /* Given NAME, an IDENTIFIER_NODE,
4960 return the structure (or union or enum) definition for that name.
4961 Searches binding levels from BINDING_LEVEL up to the global level.
4962 If THISLEVEL_ONLY is nonzero, searches only the specified context
4963 (but skips any tag-transparent contexts to find one that is
4964 meaningful for tags).
4965 FORM says which kind of type the caller wants;
4966 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4967 If the wrong kind of type is found, and it's not a template, an error is
4971 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4972 enum tree_code form
;
4974 struct binding_level
*binding_level
;
4977 register struct binding_level
*level
;
4978 /* Non-zero if, we should look past a pseudo-global level, even if
4980 int allow_pseudo_global
= 1;
4982 for (level
= binding_level
; level
; level
= level
->level_chain
)
4985 if (ANON_AGGRNAME_P (name
))
4986 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4988 /* There's no need for error checking here, because
4989 anon names are unique throughout the compilation. */
4990 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4991 return TREE_VALUE (tail
);
4993 else if (level
->namespace_p
)
4994 /* Do namespace lookup. */
4995 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
4997 tree old
= binding_for_name (name
, tail
);
4999 /* If we just skipped past a pseudo global level, even
5000 though THISLEVEL_ONLY, and we find a template class
5001 declaration, then we use the _TYPE node for the
5002 template. See the example below. */
5003 if (thislevel_only
&& !allow_pseudo_global
5004 && old
&& BINDING_VALUE (old
)
5005 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5006 old
= TREE_TYPE (BINDING_VALUE (old
));
5008 old
= BINDING_TYPE (old
);
5010 /* If it has an original type, it is a typedef, and we
5011 should not return it. */
5012 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5014 if (old
&& TREE_CODE (old
) != form
5015 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5017 cp_error ("`%#D' redeclared as %C", old
, form
);
5022 if (thislevel_only
|| tail
== global_namespace
)
5026 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5028 if (TREE_PURPOSE (tail
) == name
)
5030 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5031 /* Should tighten this up; it'll probably permit
5032 UNION_TYPE and a struct template, for example. */
5034 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5036 /* Definition isn't the kind we were looking for. */
5037 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5041 return TREE_VALUE (tail
);
5044 if (thislevel_only
&& ! level
->tag_transparent
)
5046 if (level
->pseudo_global
&& allow_pseudo_global
)
5048 /* We must deal with cases like this:
5050 template <class T> struct S;
5051 template <class T> struct S {};
5053 When looking up `S', for the second declaration, we
5054 would like to find the first declaration. But, we
5055 are in the pseudo-global level created for the
5056 template parameters, rather than the (surrounding)
5057 namespace level. Thus, we keep going one more level,
5058 even though THISLEVEL_ONLY is non-zero. */
5059 allow_pseudo_global
= 0;
5071 set_current_level_tags_transparency (tags_transparent
)
5072 int tags_transparent
;
5074 current_binding_level
->tag_transparent
= tags_transparent
;
5078 /* Given a type, find the tag that was defined for it and return the tag name.
5079 Otherwise return 0. However, the value can never be 0
5080 in the cases in which this is used.
5082 C++: If NAME is non-zero, this is the new name to install. This is
5083 done when replacing anonymous tags with real tag names. */
5086 lookup_tag_reverse (type
, name
)
5090 register struct binding_level
*level
;
5092 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5095 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5097 if (TREE_VALUE (tail
) == type
)
5100 TREE_PURPOSE (tail
) = name
;
5101 return TREE_PURPOSE (tail
);
5108 /* Look up NAME in the NAMESPACE. */
5111 lookup_namespace_name (namespace, name
)
5112 tree
namespace, name
;
5115 tree template_id
= NULL_TREE
;
5117 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5119 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5120 /* This happens for A::B<int> when B is a namespace. */
5122 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5124 /* This happens for A::B where B is a template, and there are no
5125 template arguments. */
5126 cp_error ("invalid use of `%D'", name
);
5127 return error_mark_node
;
5130 namespace = ORIGINAL_NAMESPACE (namespace);
5132 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5135 name
= TREE_OPERAND (name
, 0);
5136 if (TREE_CODE (name
) == OVERLOAD
)
5137 name
= DECL_NAME (OVL_CURRENT (name
));
5138 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5139 name
= DECL_NAME (name
);
5142 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5144 val
= make_node (CPLUS_BINDING
);
5145 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5146 return error_mark_node
;
5148 if (BINDING_VALUE (val
))
5150 val
= BINDING_VALUE (val
);
5154 if (DECL_CLASS_TEMPLATE_P (val
))
5155 val
= lookup_template_class (val
,
5156 TREE_OPERAND (template_id
, 1),
5157 /*in_decl=*/NULL_TREE
,
5158 /*context=*/NULL_TREE
,
5159 /*entering_scope=*/0);
5160 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5161 || TREE_CODE (val
) == OVERLOAD
)
5162 val
= lookup_template_function (val
,
5163 TREE_OPERAND (template_id
, 1));
5166 cp_error ("`%D::%D' is not a template",
5168 return error_mark_node
;
5172 /* If we have a single function from a using decl, pull it out. */
5173 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5174 val
= OVL_FUNCTION (val
);
5178 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5179 return error_mark_node
;
5182 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5184 static unsigned long
5192 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5193 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5198 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5201 typename_compare (k1
, k2
)
5212 d1
= TYPE_NAME (t1
);
5213 d2
= TYPE_NAME (t2
);
5215 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5216 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5217 && ((TREE_TYPE (t1
) != NULL_TREE
)
5218 == (TREE_TYPE (t2
) != NULL_TREE
))
5219 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5220 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5223 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5224 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5225 is non-NULL, this type is being created by the implicit typename
5226 extension, and BASE_TYPE is a type named `t' in some base class of
5227 `T' which depends on template parameters.
5229 Returns the new TYPENAME_TYPE. */
5232 build_typename_type (context
, name
, fullname
, base_type
)
5240 struct hash_entry
* e
;
5242 static struct hash_table ht
;
5244 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5248 static struct hash_table
*h
= &ht
;
5249 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5251 fatal ("virtual memory exhausted");
5252 ggc_add_tree_hash_table_root (&h
, 1);
5255 /* Build the TYPENAME_TYPE. */
5256 t
= make_lang_type (TYPENAME_TYPE
);
5257 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5258 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5259 TREE_TYPE (t
) = base_type
;
5261 /* Build the corresponding TYPE_DECL. */
5262 d
= build_decl (TYPE_DECL
, name
, t
);
5263 TYPE_NAME (TREE_TYPE (d
)) = d
;
5264 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5265 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5266 DECL_ARTIFICIAL (d
) = 1;
5268 /* See if we already have this type. */
5269 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5273 /* Insert the type into the table. */
5274 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5282 make_typename_type (context
, name
)
5287 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5289 if (!(TYPE_LANG_SPECIFIC (name
)
5290 && (CLASSTYPE_IS_TEMPLATE (name
)
5291 || CLASSTYPE_USE_TEMPLATE (name
))))
5292 name
= TYPE_IDENTIFIER (name
);
5294 /* Create a TEMPLATE_ID_EXPR for the type. */
5295 name
= build_nt (TEMPLATE_ID_EXPR
,
5296 CLASSTYPE_TI_TEMPLATE (name
),
5297 CLASSTYPE_TI_ARGS (name
));
5299 else if (TREE_CODE (name
) == TYPE_DECL
)
5300 name
= DECL_NAME (name
);
5304 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5306 name
= TREE_OPERAND (name
, 0);
5307 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5308 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5310 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5311 my_friendly_abort (2000);
5313 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5315 /* We can get here from typename_sub0 in the explicit_template_type
5316 expansion. Just fail. */
5317 cp_error ("no class template named `%#T' in `%#T'",
5319 return error_mark_node
;
5322 if (! uses_template_parms (context
)
5323 || currently_open_class (context
))
5325 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5327 tree tmpl
= NULL_TREE
;
5328 if (IS_AGGR_TYPE (context
))
5329 tmpl
= lookup_field (context
, name
, 0, 0);
5330 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5332 cp_error ("no class template named `%#T' in `%#T'",
5334 return error_mark_node
;
5337 return lookup_template_class (tmpl
,
5338 TREE_OPERAND (fullname
, 1),
5340 /*entering_scope=*/0);
5346 if (!IS_AGGR_TYPE (context
))
5348 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5349 return error_mark_node
;
5352 t
= lookup_field (context
, name
, 0, 1);
5354 return TREE_TYPE (t
);
5358 /* If the CONTEXT is not a template type, then either the field is
5359 there now or its never going to be. */
5360 if (!uses_template_parms (context
))
5362 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5363 return error_mark_node
;
5367 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5370 /* Select the right _DECL from multiple choices. */
5373 select_decl (binding
, flags
)
5378 val
= BINDING_VALUE (binding
);
5379 if (LOOKUP_NAMESPACES_ONLY (flags
))
5381 /* We are not interested in types. */
5382 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5387 /* If we could have a type and
5388 we have nothing or we need a type and have none. */
5389 if (BINDING_TYPE (binding
)
5390 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5391 && TREE_CODE (val
) != TYPE_DECL
)))
5392 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5393 /* Don't return non-types if we really prefer types. */
5394 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5395 && (TREE_CODE (val
) != TEMPLATE_DECL
5396 || !DECL_CLASS_TEMPLATE_P (val
)))
5402 /* Unscoped lookup of a global: iterate over current namespaces,
5403 considering using-directives. If SPACESP is non-NULL, store a list
5404 of the namespaces we've considered in it. */
5407 unqualified_namespace_lookup (name
, flags
, spacesp
)
5412 tree b
= make_node (CPLUS_BINDING
);
5413 tree initial
= current_decl_namespace();
5414 tree scope
= initial
;
5416 struct binding_level
*level
;
5417 tree val
= NULL_TREE
;
5420 *spacesp
= NULL_TREE
;
5422 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5425 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5426 val
= binding_for_name (name
, scope
);
5428 /* Initialize binding for this context. */
5429 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5430 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5432 /* Add all _DECLs seen through local using-directives. */
5433 for (level
= current_binding_level
;
5434 !level
->namespace_p
;
5435 level
= level
->level_chain
)
5436 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5437 scope
, flags
, spacesp
))
5438 /* Give up because of error. */
5439 return error_mark_node
;
5441 /* Add all _DECLs seen through global using-directives. */
5442 /* XXX local and global using lists should work equally. */
5446 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5447 scope
, flags
, spacesp
))
5448 /* Give up because of error. */
5449 return error_mark_node
;
5450 if (siter
== scope
) break;
5451 siter
= CP_DECL_CONTEXT (siter
);
5454 val
= select_decl (b
, flags
);
5455 if (scope
== global_namespace
)
5461 /* Combine prefer_type and namespaces_only into flags. */
5464 lookup_flags (prefer_type
, namespaces_only
)
5465 int prefer_type
, namespaces_only
;
5467 if (namespaces_only
)
5468 return LOOKUP_PREFER_NAMESPACES
;
5469 if (prefer_type
> 1)
5470 return LOOKUP_PREFER_TYPES
;
5471 if (prefer_type
> 0)
5472 return LOOKUP_PREFER_BOTH
;
5476 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5477 ignore it or not. Subroutine of lookup_name_real. */
5480 qualify_lookup (val
, flags
)
5484 if (val
== NULL_TREE
)
5486 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5488 if ((flags
& LOOKUP_PREFER_TYPES
)
5489 && (TREE_CODE (val
) == TYPE_DECL
5490 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5491 && DECL_CLASS_TEMPLATE_P (val
))))
5493 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5498 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5502 warn_about_implicit_typename_lookup (typename
, binding
)
5506 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5507 tree name
= DECL_NAME (typename
);
5509 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5510 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5511 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5512 && ! (TREE_CODE (binding
) == TYPE_DECL
5513 && same_type_p (TREE_TYPE (binding
), subtype
)))
5515 cp_warning ("lookup of `%D' finds `%#D'",
5517 cp_warning (" instead of `%D' from dependent base class",
5519 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5520 constructor_name (current_class_type
), name
);
5524 /* Look up NAME in the current binding level and its superiors in the
5525 namespace of variables, functions and typedefs. Return a ..._DECL
5526 node of some kind representing its definition if there is only one
5527 such declaration, or return a TREE_LIST with all the overloaded
5528 definitions if there are many, or return 0 if it is undefined.
5530 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5531 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5532 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5533 Otherwise we prefer non-TYPE_DECLs.
5535 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5536 using IDENTIFIER_CLASS_VALUE. */
5539 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5541 int prefer_type
, nonclass
, namespaces_only
;
5544 tree val
= NULL_TREE
;
5546 tree from_obj
= NULL_TREE
;
5548 int val_is_implicit_typename
= 0;
5550 /* Hack: copy flag set by parser, if set. */
5551 if (only_namespace_names
)
5552 namespaces_only
= 1;
5554 if (prefer_type
== -2)
5556 extern int looking_for_typename
;
5557 tree type
= NULL_TREE
;
5560 prefer_type
= looking_for_typename
;
5562 flags
= lookup_flags (prefer_type
, namespaces_only
);
5563 /* If the next thing is '<', class templates are types. */
5564 if (looking_for_template
)
5565 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5567 /* std:: becomes :: for now. */
5568 if (got_scope
== std_node
)
5569 got_scope
= void_type_node
;
5573 else if (got_object
!= error_mark_node
)
5578 if (type
== error_mark_node
)
5579 return error_mark_node
;
5580 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5581 type
= TREE_TYPE (type
);
5584 type
= complete_type (type
);
5586 if (TREE_CODE (type
) == VOID_TYPE
)
5587 type
= global_namespace
;
5588 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5590 val
= make_node (CPLUS_BINDING
);
5591 flags
|= LOOKUP_COMPLAIN
;
5592 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5594 val
= select_decl (val
, flags
);
5596 else if (! IS_AGGR_TYPE (type
)
5597 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5598 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5599 || TREE_CODE (type
) == TYPENAME_TYPE
)
5600 /* Someone else will give an error about this if needed. */
5602 else if (type
== current_class_type
)
5603 val
= IDENTIFIER_CLASS_VALUE (name
);
5605 val
= lookup_member (type
, name
, 0, prefer_type
);
5612 else if (got_object
&& val
)
5617 flags
= lookup_flags (prefer_type
, namespaces_only
);
5618 /* If we're not parsing, we need to complain. */
5619 flags
|= LOOKUP_COMPLAIN
;
5622 /* First, look in non-namespace scopes. */
5624 if (current_class_type
== NULL_TREE
)
5627 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5631 if (!LOCAL_BINDING_P (t
) && nonclass
)
5632 /* We're not looking for class-scoped bindings, so keep going. */
5635 /* If this is the kind of thing we're looking for, we're done. */
5636 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5637 binding
= BINDING_VALUE (t
);
5638 else if ((flags
& LOOKUP_PREFER_TYPES
)
5639 && qualify_lookup (BINDING_TYPE (t
), flags
))
5640 binding
= BINDING_TYPE (t
);
5642 binding
= NULL_TREE
;
5645 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5647 if (val_is_implicit_typename
&& !yylex
)
5648 warn_about_implicit_typename_lookup (val
, binding
);
5650 val_is_implicit_typename
5651 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5652 if (!val_is_implicit_typename
)
5657 /* Now lookup in namespace scopes. */
5658 if (!val
|| val_is_implicit_typename
)
5660 t
= unqualified_namespace_lookup (name
, flags
, 0);
5663 if (val_is_implicit_typename
&& !yylex
)
5664 warn_about_implicit_typename_lookup (val
, t
);
5672 /* This should only warn about types used in qualified-ids. */
5673 if (from_obj
&& from_obj
!= val
)
5675 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5676 && TREE_CODE (val
) == TYPE_DECL
5677 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5679 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5680 name
, got_object
, TREE_TYPE (from_obj
));
5681 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5685 /* We don't change val to from_obj if got_object depends on
5686 template parms because that breaks implicit typename for
5687 destructor calls. */
5688 if (! uses_template_parms (got_object
))
5692 /* If we have a single function from a using decl, pull it out. */
5693 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5694 val
= OVL_FUNCTION (val
);
5703 lookup_name_nonclass (name
)
5706 return lookup_name_real (name
, 0, 1, 0);
5710 lookup_function_nonclass (name
, args
)
5714 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5718 lookup_name_namespace_only (name
)
5721 /* type-or-namespace, nonclass, namespace_only */
5722 return lookup_name_real (name
, 1, 1, 1);
5726 lookup_name (name
, prefer_type
)
5730 return lookup_name_real (name
, prefer_type
, 0, 0);
5733 /* Similar to `lookup_name' but look only in the innermost non-class
5737 lookup_name_current_level (name
)
5740 struct binding_level
*b
;
5743 b
= current_binding_level
;
5744 while (b
->parm_flag
== 2)
5749 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5751 /* extern "C" function() */
5752 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5755 else if (IDENTIFIER_BINDING (name
)
5756 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5760 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5761 return IDENTIFIER_VALUE (name
);
5773 /* Like lookup_name_current_level, but for types. */
5776 lookup_type_current_level (name
)
5779 register tree t
= NULL_TREE
;
5781 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5783 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5784 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5786 struct binding_level
*b
= current_binding_level
;
5789 if (purpose_member (name
, b
->type_shadowed
))
5790 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5802 begin_only_namespace_names ()
5804 only_namespace_names
= 1;
5808 end_only_namespace_names ()
5810 only_namespace_names
= 0;
5813 /* Arrange for the user to get a source line number, even when the
5814 compiler is going down in flames, so that she at least has a
5815 chance of working around problems in the compiler. We used to
5816 call error(), but that let the segmentation fault continue
5817 through; now, it's much more passive by asking them to send the
5818 maintainers mail about the problem. */
5822 int sig ATTRIBUTE_UNUSED
;
5824 signal (SIGSEGV
, SIG_DFL
);
5826 signal (SIGIOT
, SIG_DFL
);
5829 signal (SIGILL
, SIG_DFL
);
5832 signal (SIGABRT
, SIG_DFL
);
5835 signal (SIGBUS
, SIG_DFL
);
5837 my_friendly_abort (0);
5840 /* Push the declarations of builtin types into the namespace.
5841 RID_INDEX, if < RID_MAX is the index of the builtin type
5842 in the array RID_POINTERS. NAME is the name used when looking
5843 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5846 record_builtin_type (rid_index
, name
, type
)
5851 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5852 tree tdecl
= NULL_TREE
;
5854 if ((int) rid_index
< (int) RID_MAX
)
5855 rname
= ridpointers
[(int) rid_index
];
5857 tname
= get_identifier (name
);
5859 TYPE_BUILT_IN (type
) = 1;
5863 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5864 set_identifier_type_value (tname
, NULL_TREE
);
5865 if ((int) rid_index
< (int) RID_MAX
)
5866 /* Built-in types live in the global namespace. */
5867 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5869 if (rname
!= NULL_TREE
)
5871 if (tname
!= NULL_TREE
)
5873 set_identifier_type_value (rname
, NULL_TREE
);
5874 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5878 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5879 set_identifier_type_value (rname
, NULL_TREE
);
5884 /* Record one of the standard Java types.
5885 * Declare it as having the given NAME.
5886 * If SIZE > 0, it is the size of one of the integral types;
5887 * otherwise it is the negative of the size of one of the other types. */
5890 record_builtin_java_type (name
, size
)
5896 type
= make_signed_type (size
);
5897 else if (size
> -32)
5898 { /* "__java_char" or ""__java_boolean". */
5899 type
= make_unsigned_type (-size
);
5900 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5903 { /* "__java_float" or ""__java_double". */
5904 type
= make_node (REAL_TYPE
);
5905 TYPE_PRECISION (type
) = - size
;
5908 record_builtin_type (RID_MAX
, name
, type
);
5909 decl
= TYPE_NAME (type
);
5911 /* Suppress generate debug symbol entries for these types,
5912 since for normal C++ they are just clutter.
5913 However, push_lang_context undoes this if extern "Java" is seen. */
5914 DECL_IGNORED_P (decl
) = 1;
5916 TYPE_FOR_JAVA (type
) = 1;
5920 /* Push a type into the namespace so that the back-ends ignore it. */
5923 record_unknown_type (type
, name
)
5927 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5928 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5929 DECL_IGNORED_P (decl
) = 1;
5930 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5931 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5932 TYPE_ALIGN (type
) = 1;
5933 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5936 /* Push overloaded decl, in global scope, with one argument so it
5937 can be used as a callback from define_function. */
5940 push_overloaded_decl_1 (x
)
5943 push_overloaded_decl (x
, PUSH_GLOBAL
);
5950 auto_function (name
, type
)
5953 return define_function
5954 (IDENTIFIER_POINTER (name
), type
, push_overloaded_decl_1
,
5955 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5959 /* Create the predefined scalar types of C,
5960 and some nodes representing standard constants (0, 1, (void *)0).
5961 Initialize the global binding level.
5962 Make definitions for built-in primitive functions. */
5965 init_decl_processing ()
5968 int wchar_type_size
;
5969 tree array_domain_type
;
5971 /* Have to make these distinct before we try using them. */
5972 lang_name_cplusplus
= get_identifier ("C++");
5973 lang_name_c
= get_identifier ("C");
5974 lang_name_java
= get_identifier ("Java");
5976 /* Let the back-end now how to save and restore language-specific
5977 per-function globals. */
5978 init_lang_status
= &push_cp_function_context
;
5979 free_lang_status
= &pop_cp_function_context
;
5980 mark_lang_status
= &mark_cp_function_context
;
5986 /* Create the global variables. */
5987 push_to_top_level ();
5989 /* Enter the global namespace. */
5990 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5991 push_namespace (get_identifier ("::"));
5992 global_namespace
= current_namespace
;
5993 current_lang_name
= NULL_TREE
;
5995 if (flag_strict_prototype
== 2)
5996 flag_strict_prototype
= pedantic
;
5997 if (! flag_permissive
&& ! pedantic
)
5998 flag_pedantic_errors
= 1;
6000 strict_prototypes_lang_c
= flag_strict_prototype
;
6003 current_lang_name
= lang_name_c
;
6005 current_function_decl
= NULL_TREE
;
6006 current_binding_level
= NULL_BINDING_LEVEL
;
6007 free_binding_level
= NULL_BINDING_LEVEL
;
6009 /* Because most segmentation signals can be traced back into user
6010 code, catch them and at least give the user a chance of working
6011 around compiler bugs. */
6012 signal (SIGSEGV
, signal_catch
);
6014 /* We will also catch aborts in the back-end through signal_catch and
6015 give the user a chance to see where the error might be, and to defeat
6016 aborts in the back-end when there have been errors previously in their
6019 signal (SIGIOT
, signal_catch
);
6022 signal (SIGILL
, signal_catch
);
6025 signal (SIGABRT
, signal_catch
);
6028 signal (SIGBUS
, signal_catch
);
6031 gcc_obstack_init (&decl_obstack
);
6033 build_common_tree_nodes (flag_signed_char
);
6035 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6036 TREE_TYPE (error_mark_list
) = error_mark_node
;
6038 /* Make the binding_level structure for global names. */
6040 global_binding_level
= current_binding_level
;
6041 /* The global level is the namespace level of ::. */
6042 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6043 declare_namespace_level ();
6045 this_identifier
= get_identifier (THIS_NAME
);
6046 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6047 ctor_identifier
= get_identifier (CTOR_NAME
);
6048 dtor_identifier
= get_identifier (DTOR_NAME
);
6049 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6050 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6051 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6052 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6053 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6055 /* Define `int' and `char' first so that dbx will output them first. */
6056 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6057 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6059 /* `signed' is the same as `int' */
6060 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6061 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6062 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6063 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6064 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6065 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6066 record_builtin_type (RID_MAX
, "long long unsigned int",
6067 long_long_unsigned_type_node
);
6068 record_builtin_type (RID_MAX
, "long long unsigned",
6069 long_long_unsigned_type_node
);
6070 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6071 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6072 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6075 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6077 /* Define both `signed char' and `unsigned char'. */
6078 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6079 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6081 /* `unsigned long' is the standard type for sizeof.
6082 Note that stddef.h uses `unsigned long',
6083 and this must agree, even if long and int are the same size. */
6085 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6087 /* Create the widest literal types. */
6088 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6089 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6090 widest_integer_literal_type_node
));
6092 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6093 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6094 widest_unsigned_literal_type_node
));
6096 /* These are types that type_for_size and type_for_mode use. */
6097 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6098 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6099 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6100 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6101 #if HOST_BITS_PER_WIDE_INT >= 64
6102 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6104 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6105 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6106 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6107 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6108 #if HOST_BITS_PER_WIDE_INT >= 64
6109 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6112 build_common_tree_nodes_2 (flag_short_double
);
6114 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6115 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6116 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6117 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6118 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6119 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6120 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6121 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6123 integer_two_node
= build_int_2 (2, 0);
6124 TREE_TYPE (integer_two_node
) = integer_type_node
;
6125 integer_three_node
= build_int_2 (3, 0);
6126 TREE_TYPE (integer_three_node
) = integer_type_node
;
6128 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6129 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6130 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6131 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6132 TYPE_PRECISION (boolean_type_node
) = 1;
6133 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6134 boolean_false_node
= build_int_2 (0, 0);
6135 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6136 boolean_true_node
= build_int_2 (1, 0);
6137 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6139 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6140 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6141 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6143 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6144 complex_integer_type_node
));
6145 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6146 complex_float_type_node
));
6147 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6148 complex_double_type_node
));
6149 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6150 complex_long_double_type_node
));
6152 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6154 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6155 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6156 TREE_PARMLIST (void_list_node
) = 1;
6158 /* Used for expressions that do nothing, but are not errors. */
6159 void_zero_node
= build_int_2 (0, 0);
6160 TREE_TYPE (void_zero_node
) = void_type_node
;
6162 string_type_node
= build_pointer_type (char_type_node
);
6163 const_string_type_node
6164 = build_pointer_type (build_qualified_type (char_type_node
,
6166 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6168 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6171 /* Make a type to be the domain of a few array types
6172 whose domains don't really matter.
6173 200 is small enough that it always fits in size_t
6174 and large enough that it can hold most function names for the
6175 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6176 array_domain_type
= build_index_type (build_int_2 (200, 0));
6178 /* Make a type for arrays of characters.
6179 With luck nothing will ever really depend on the length of this
6181 char_array_type_node
6182 = build_array_type (char_type_node
, array_domain_type
);
6183 /* Likewise for arrays of ints. */
6185 = build_array_type (integer_type_node
, array_domain_type
);
6187 /* This is just some anonymous class type. Nobody should ever
6188 need to look inside this envelope. */
6189 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6191 if (flag_huge_objects
)
6192 delta_type_node
= long_integer_type_node
;
6194 delta_type_node
= short_integer_type_node
;
6196 default_function_type
6197 = build_function_type (integer_type_node
, NULL_TREE
);
6199 ptr_type_node
= build_pointer_type (void_type_node
);
6201 = build_pointer_type (build_qualified_type (void_type_node
,
6203 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6206 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6208 /* C++ extensions */
6210 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6211 record_unknown_type (unknown_type_node
, "unknown type");
6213 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6214 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6216 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6218 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6220 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6221 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6223 /* This is special for C++ so functions can be overloaded. */
6225 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6226 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6227 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6228 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6230 = TREE_UNSIGNED (wchar_type_node
)
6231 ? unsigned_wchar_type_node
6232 : signed_wchar_type_node
;
6233 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6235 /* Artificial declaration of wchar_t -- can be bashed */
6236 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6238 pushdecl (wchar_decl_node
);
6240 /* This is for wide string constants. */
6241 wchar_array_type_node
6242 = build_array_type (wchar_type_node
, array_domain_type
);
6244 if (flag_vtable_thunks
)
6246 /* Make sure we get a unique function type, so we can give
6247 its pointer type a name. (This wins for gdb.) */
6248 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6249 TREE_TYPE (vfunc_type
) = integer_type_node
;
6250 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6251 layout_type (vfunc_type
);
6253 vtable_entry_type
= build_pointer_type (vfunc_type
);
6257 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6258 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6260 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6262 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6264 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6267 /* Make this part of an invisible union. */
6268 fields
[3] = copy_node (fields
[2]);
6269 TREE_TYPE (fields
[3]) = delta_type_node
;
6270 DECL_NAME (fields
[3]) = delta2_identifier
;
6271 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6272 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6273 TREE_UNSIGNED (fields
[3]) = 0;
6274 TREE_CHAIN (fields
[2]) = fields
[3];
6275 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6278 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6281 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6282 layout_type (vtbl_type_node
);
6283 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6284 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6285 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6286 layout_type (vtbl_ptr_type_node
);
6287 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6289 std_node
= build_decl (NAMESPACE_DECL
,
6290 get_identifier (flag_honor_std
? "fake std":"std"),
6292 pushdecl (std_node
);
6294 global_type_node
= make_node (LANG_TYPE
);
6295 record_unknown_type (global_type_node
, "global type");
6298 current_lang_name
= lang_name_cplusplus
;
6301 tree bad_alloc_type_node
, newtype
, deltype
;
6303 push_namespace (get_identifier ("std"));
6304 bad_alloc_type_node
= xref_tag
6305 (class_type_node
, get_identifier ("bad_alloc"), 1);
6308 newtype
= build_exception_variant
6309 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6310 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6311 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
);
6312 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6313 global_delete_fndecl
= auto_function (ansi_opname
[(int) DELETE_EXPR
],
6315 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6319 = define_function ("__pure_virtual", void_ftype
, 0, 0);
6321 /* Perform other language dependent initializations. */
6322 init_class_processing ();
6323 init_init_processing ();
6324 init_search_processing ();
6326 init_rtti_processing ();
6328 if (flag_exceptions
)
6329 init_exception_processing ();
6332 flag_inline_functions
= 0;
6335 if (! supports_one_only ())
6338 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6339 declare_function_name ();
6341 /* Prepare to check format strings against argument lists. */
6342 init_function_format_info ();
6344 /* Show we use EH for cleanups. */
6345 using_eh_for_cleanups ();
6347 print_error_function
= lang_print_error_function
;
6348 lang_get_alias_set
= &c_get_alias_set
;
6349 valid_lang_attribute
= cp_valid_lang_attribute
;
6351 /* Maintain consistency. Perhaps we should just complain if they
6352 say -fwritable-strings? */
6353 if (flag_writable_strings
)
6354 flag_const_strings
= 0;
6356 /* Add GC roots for all of our global variables. */
6357 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6358 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6359 ggc_add_tree_root (&integer_three_node
, 1);
6360 ggc_add_tree_root (&integer_two_node
, 1);
6361 ggc_add_tree_root (&signed_size_zero_node
, 1);
6362 ggc_add_tree_root (&size_one_node
, 1);
6363 ggc_add_tree_root (&size_zero_node
, 1);
6364 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6365 mark_binding_level
);
6366 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6367 ggc_add_tree_root (&static_ctors
, 1);
6368 ggc_add_tree_root (&static_dtors
, 1);
6369 ggc_add_tree_root (&lastiddecl
, 1);
6371 ggc_add_tree_root (&enum_next_value
, 1);
6372 ggc_add_tree_root (&last_function_parm_tags
, 1);
6373 ggc_add_tree_root (¤t_function_return_value
, 1);
6374 ggc_add_tree_root (¤t_function_parms
, 1);
6375 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6376 ggc_add_tree_root (&last_function_parms
, 1);
6377 ggc_add_tree_root (&error_mark_list
, 1);
6379 ggc_add_tree_root (&global_namespace
, 1);
6380 ggc_add_tree_root (&global_type_node
, 1);
6381 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6383 ggc_add_tree_root (&got_object
, 1);
6384 ggc_add_tree_root (&got_scope
, 1);
6386 ggc_add_tree_root (¤t_lang_name
, 1);
6387 ggc_add_tree_root (&static_aggregates
, 1);
6390 /* Function to print any language-specific context for an error message. */
6393 lang_print_error_function (file
)
6396 default_print_error_function (file
);
6397 maybe_print_template_context ();
6400 /* Make a definition for a builtin function named NAME and whose data type
6401 is TYPE. TYPE should be a function type with argument types.
6403 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6404 the name to be called if we can't opencode the function. */
6407 define_function (name
, type
, pfn
, library_name
)
6410 void (*pfn
) PROTO((tree
));
6411 const char *library_name
;
6413 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6414 DECL_EXTERNAL (decl
) = 1;
6415 TREE_PUBLIC (decl
) = 1;
6416 DECL_ARTIFICIAL (decl
) = 1;
6418 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6419 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6421 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6422 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6423 function in the namespace. */
6424 if (pfn
) (*pfn
) (decl
);
6426 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6427 make_function_rtl (decl
);
6432 /* Wrapper around define_function, for the benefit of
6433 c_common_nodes_and_builtins.
6434 FUNCTION_CODE tells later passes how to compile calls to this function.
6435 See tree.h for its possible values. */
6438 builtin_function (name
, type
, code
, libname
)
6441 enum built_in_function code
;
6442 const char *libname
;
6444 tree decl
= define_function (name
, type
, (void (*) PROTO((tree
)))pushdecl
,
6446 if (code
!= NOT_BUILT_IN
)
6448 DECL_BUILT_IN (decl
) = 1;
6449 DECL_FUNCTION_CODE (decl
) = code
;
6454 /* When we call finish_struct for an anonymous union, we create
6455 default copy constructors and such. But, an anonymous union
6456 shouldn't have such things; this function undoes the damage to the
6457 anonymous union type T.
6459 (The reason that we create the synthesized methods is that we don't
6460 distinguish `union { int i; }' from `typedef union { int i; } U'.
6461 The first is an anonymous union; the second is just an ordinary
6465 fixup_anonymous_aggr (t
)
6470 /* Wipe out memory of synthesized methods */
6471 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6472 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6473 TYPE_HAS_INIT_REF (t
) = 0;
6474 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6475 TYPE_HAS_ASSIGN_REF (t
) = 0;
6476 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6478 /* Splice the implicitly generated functions out of the TYPE_METHODS
6480 q
= &TYPE_METHODS (t
);
6483 if (DECL_ARTIFICIAL (*q
))
6484 *q
= TREE_CHAIN (*q
);
6486 q
= &TREE_CHAIN (*q
);
6489 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6490 function members. */
6491 if (TYPE_METHODS (t
))
6492 error ("an anonymous union cannot have function members");
6495 /* Make sure that a declaration with no declarator is well-formed, i.e.
6496 just defines a tagged type or anonymous union.
6498 Returns the type defined, if any. */
6501 check_tag_decl (declspecs
)
6505 tree ob_modifier
= NULL_TREE
;
6507 register tree t
= NULL_TREE
;
6509 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6511 register tree value
= TREE_VALUE (link
);
6517 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6519 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6523 else if (value
== ridpointers
[(int) RID_FRIEND
])
6525 if (current_class_type
== NULL_TREE
6526 || current_scope () != current_class_type
)
6527 ob_modifier
= value
;
6529 else if (value
== ridpointers
[(int) RID_STATIC
]
6530 || value
== ridpointers
[(int) RID_EXTERN
]
6531 || value
== ridpointers
[(int) RID_AUTO
]
6532 || value
== ridpointers
[(int) RID_REGISTER
]
6533 || value
== ridpointers
[(int) RID_INLINE
]
6534 || value
== ridpointers
[(int) RID_VIRTUAL
]
6535 || value
== ridpointers
[(int) RID_CONST
]
6536 || value
== ridpointers
[(int) RID_VOLATILE
]
6537 || value
== ridpointers
[(int) RID_EXPLICIT
])
6538 ob_modifier
= value
;
6542 error ("multiple types in one declaration");
6544 /* Inside a class, we might be in a friend or access declaration.
6545 Until we have a good way of detecting the latter, don't warn. */
6546 if (t
== NULL_TREE
&& ! current_class_type
)
6547 pedwarn ("declaration does not declare anything");
6549 /* Check for an anonymous union. We're careful
6550 accessing TYPE_IDENTIFIER because some built-in types, like
6551 pointer-to-member types, do not have TYPE_NAME. */
6552 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6554 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6556 /* Anonymous unions are objects, so they can have specifiers. */;
6557 SET_ANON_AGGR_TYPE_P (t
);
6559 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6560 pedwarn ("ISO C++ prohibits anonymous structs");
6563 else if (ob_modifier
)
6565 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6566 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6567 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6568 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6569 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6570 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6571 cp_error ("`%D' can only be specified for constructors",
6574 cp_error ("`%D' can only be specified for objects and functions",
6581 /* Called when a declaration is seen that contains no names to declare.
6582 If its type is a reference to a structure, union or enum inherited
6583 from a containing scope, shadow that tag name for the current scope
6584 with a forward reference.
6585 If its type defines a new named structure or union
6586 or defines an enum, it is valid but we need not do anything here.
6587 Otherwise, it is an error.
6589 C++: may have to grok the declspecs to learn about static,
6590 complain for anonymous unions. */
6593 shadow_tag (declspecs
)
6596 tree t
= check_tag_decl (declspecs
);
6599 maybe_process_partial_specialization (t
);
6601 /* This is where the variables in an anonymous union are
6602 declared. An anonymous union declaration looks like:
6604 because there is no declarator after the union, the parser
6605 sends that declaration here. */
6606 if (t
&& ANON_AGGR_TYPE_P (t
))
6608 fixup_anonymous_aggr (t
);
6610 if (TYPE_FIELDS (t
))
6612 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6614 finish_anon_union (decl
);
6619 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6622 groktypename (typename
)
6625 if (TREE_CODE (typename
) != TREE_LIST
)
6627 return grokdeclarator (TREE_VALUE (typename
),
6628 TREE_PURPOSE (typename
),
6629 TYPENAME
, 0, NULL_TREE
);
6632 /* Decode a declarator in an ordinary declaration or data definition.
6633 This is called as soon as the type information and variable name
6634 have been parsed, before parsing the initializer if any.
6635 Here we create the ..._DECL node, fill in its type,
6636 and put it on the list of decls for the current context.
6637 The ..._DECL node is returned as the value.
6639 Exception: for arrays where the length is not specified,
6640 the type is left null, to be filled in by `cp_finish_decl'.
6642 Function definitions do not come here; they go to start_function
6643 instead. However, external and forward declarations of functions
6644 do go through here. Structure field declarations are done by
6645 grokfield and not through here. */
6647 /* Set this to zero to debug not using the temporary obstack
6648 to parse initializers. */
6649 int debug_temp_inits
= 1;
6652 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6653 tree declarator
, declspecs
;
6655 tree attributes
, prefix_attributes
;
6658 register tree type
, tem
;
6660 extern int have_extern_spec
;
6661 extern int used_extern_spec
;
6665 /* See code below that used this. */
6666 int init_written
= initialized
;
6669 /* This should only be done once on the top most decl. */
6670 if (have_extern_spec
&& !used_extern_spec
)
6672 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6674 used_extern_spec
= 1;
6677 if (attributes
|| prefix_attributes
)
6678 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6680 attrlist
= NULL_TREE
;
6682 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6685 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6688 type
= TREE_TYPE (decl
);
6690 if (type
== error_mark_node
)
6694 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6695 ? DECL_CLASS_CONTEXT (decl
)
6696 : DECL_CONTEXT (decl
);
6698 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6699 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6701 /* When parsing the initializer, lookup should use the object's
6703 push_decl_namespace (context
);
6706 /* We are only interested in class contexts, later. */
6707 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6708 context
= NULL_TREE
;
6711 /* Is it valid for this decl to have an initializer at all?
6712 If not, set INITIALIZED to zero, which will indirectly
6713 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6714 switch (TREE_CODE (decl
))
6717 /* typedef foo = bar means give foo the same type as bar.
6718 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6719 Any other case of an initialization in a TYPE_DECL is an error. */
6720 if (pedantic
|| list_length (declspecs
) > 1)
6722 cp_error ("typedef `%D' is initialized", decl
);
6728 cp_error ("function `%#D' is initialized like a variable", decl
);
6738 if (! toplevel_bindings_p ()
6739 && DECL_EXTERNAL (decl
))
6740 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6742 DECL_EXTERNAL (decl
) = 0;
6743 if (toplevel_bindings_p ())
6744 TREE_STATIC (decl
) = 1;
6746 /* Tell `pushdecl' this is an initialized decl
6747 even though we don't yet have the initializer expression.
6748 Also tell `cp_finish_decl' it may store the real initializer. */
6749 DECL_INITIAL (decl
) = error_mark_node
;
6752 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6753 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6756 /* Set attributes here so if duplicate decl, will have proper attributes. */
6757 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6759 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6761 push_nested_class (context
, 2);
6763 if (TREE_CODE (decl
) == VAR_DECL
)
6765 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6766 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6767 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6770 if (DECL_CONTEXT (field
) != context
)
6772 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6773 DECL_CONTEXT (field
), DECL_NAME (decl
),
6774 context
, DECL_NAME (decl
));
6775 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6777 /* Static data member are tricky; an in-class initialization
6778 still doesn't provide a definition, so the in-class
6779 declaration will have DECL_EXTERNAL set, but will have an
6780 initialization. Thus, duplicate_decls won't warn
6781 about this situation, and so we check here. */
6782 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6783 cp_error ("duplicate initialization of %D", decl
);
6784 if (duplicate_decls (decl
, field
))
6790 tree field
= check_classfn (context
, decl
);
6791 if (field
&& duplicate_decls (decl
, field
))
6795 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6796 DECL_IN_AGGR_P (decl
) = 0;
6797 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6798 || CLASSTYPE_USE_TEMPLATE (context
))
6800 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6801 /* [temp.expl.spec] An explicit specialization of a static data
6802 member of a template is a definition if the declaration
6803 includes an initializer; otherwise, it is a declaration.
6805 We check for processing_specialization so this only applies
6806 to the new specialization syntax. */
6807 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6808 DECL_EXTERNAL (decl
) = 1;
6811 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6812 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6816 /* Enter this declaration into the symbol table. */
6817 tem
= maybe_push_decl (decl
);
6819 if (processing_template_decl
)
6821 if (at_function_scope_p ())
6822 push_permanent_obstack ();
6823 tem
= push_template_decl (tem
);
6824 if (at_function_scope_p ())
6829 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6830 /* Tell the back-end to use or not use .common as appropriate. If we say
6831 -fconserve-space, we want this to save .data space, at the expense of
6832 wrong semantics. If we say -fno-conserve-space, we want this to
6833 produce errors about redefs; to do this we force variables into the
6835 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6838 if (! processing_template_decl
)
6841 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6842 push_obstacks_nochange ();
6851 tree type
= TREE_TYPE (decl
);
6852 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6854 if (type
== error_mark_node
)
6857 /* If this type of object needs a cleanup, and control may
6858 jump past it, make a new binding level so that it is cleaned
6859 up only when it is initialized first. */
6860 if (TYPE_NEEDS_DESTRUCTOR (type
)
6861 && current_binding_level
->more_cleanups_ok
== 0)
6862 pushlevel_temporary (1);
6865 /* Is it valid for this decl to have an initializer at all?
6866 If not, set INITIALIZED to zero, which will indirectly
6867 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6869 /* Don't allow initializations for incomplete types except for
6870 arrays which might be completed by the initialization. */
6871 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6872 ; /* A complete type is ok. */
6873 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6875 cp_error ("variable `%#D' has initializer but incomplete type",
6878 type
= TREE_TYPE (decl
) = error_mark_node
;
6880 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6882 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6883 cp_error ("elements of array `%#D' have incomplete type", decl
);
6884 /* else we already gave an error in start_decl. */
6890 && TREE_CODE (decl
) != TYPE_DECL
6891 && TREE_CODE (decl
) != TEMPLATE_DECL
6892 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6894 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6895 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6897 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6899 /* Change the type so that assemble_variable will give
6900 DECL an rtl we can live with: (mem (const_int 0)). */
6901 type
= TREE_TYPE (decl
) = error_mark_node
;
6905 /* If any base type in the hierarchy of TYPE needs a constructor,
6906 then we set initialized to 1. This way any nodes which are
6907 created for the purposes of initializing this aggregate
6908 will live as long as it does. This is necessary for global
6909 aggregates which do not have their initializers processed until
6910 the end of the file. */
6911 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6916 DECL_INITIAL (decl
) = NULL_TREE
;
6919 /* Handle initialization of references.
6920 These three arguments are from `cp_finish_decl', and have the
6921 same meaning here that they do there.
6923 Quotes on semantics can be found in ARM 8.4.3. */
6926 grok_reference_init (decl
, type
, init
)
6927 tree decl
, type
, init
;
6931 if (init
== NULL_TREE
)
6933 if ((DECL_LANG_SPECIFIC (decl
) == 0
6934 || DECL_IN_AGGR_P (decl
) == 0)
6935 && ! DECL_THIS_EXTERN (decl
))
6936 cp_error ("`%D' declared as reference but not initialized", decl
);
6940 if (init
== error_mark_node
)
6943 if (TREE_CODE (init
) == CONSTRUCTOR
)
6945 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6949 if (TREE_CODE (init
) == TREE_LIST
)
6950 init
= build_compound_expr (init
);
6952 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6953 init
= convert_from_reference (init
);
6955 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6956 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6958 /* Note: default conversion is only called in very special cases. */
6959 init
= default_conversion (init
);
6962 /* Convert INIT to the reference type TYPE. This may involve the
6963 creation of a temporary, whose lifetime must be the same as that
6964 of the reference. If so, a DECL_STMT for the temporary will be
6965 added just after the DECL_STMT for DECL. That's why we don't set
6966 DECL_INITIAL for local references (instead assigning to them
6967 explicitly); we need to allow the temporary to be initialized
6969 tmp
= convert_to_reference
6970 (type
, init
, CONV_IMPLICIT
,
6971 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6973 if (tmp
== error_mark_node
)
6975 else if (tmp
!= NULL_TREE
)
6978 tmp
= save_expr (tmp
);
6979 if (building_stmt_tree ())
6981 /* Initialize the declaration. */
6982 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
6983 /* Setting TREE_SIDE_EFFECTS prevents expand_expr from
6984 omitting this expression entirely. */
6985 TREE_SIDE_EFFECTS (tmp
) = 1;
6986 finish_expr_stmt (tmp
);
6989 DECL_INITIAL (decl
) = tmp
;
6993 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
6997 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
6999 expand_static_init (decl
, DECL_INITIAL (decl
));
7000 DECL_INITIAL (decl
) = NULL_TREE
;
7005 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7006 mucking with forces it does not comprehend (i.e. initialization with a
7007 constructor). If we are at global scope and won't go into COMMON, fill
7008 it in with a dummy CONSTRUCTOR to force the variable into .data;
7009 otherwise we can use error_mark_node. */
7012 obscure_complex_init (decl
, init
)
7015 if (! flag_no_inline
&& TREE_STATIC (decl
))
7017 if (extract_init (decl
, init
))
7021 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7022 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7023 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7027 DECL_INITIAL (decl
) = error_mark_node
;
7032 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7033 array until we finish parsing the initializer. If that's the
7034 situation we're in, update DECL accordingly. */
7037 maybe_deduce_size_from_array_init (decl
, init
)
7041 tree type
= TREE_TYPE (decl
);
7043 if (TREE_CODE (type
) == ARRAY_TYPE
7044 && TYPE_DOMAIN (type
) == NULL_TREE
7045 && TREE_CODE (decl
) != TYPE_DECL
)
7048 = (TREE_STATIC (decl
)
7049 /* Even if pedantic, an external linkage array
7050 may have incomplete type at first. */
7051 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7052 : !DECL_EXTERNAL (decl
));
7053 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7054 int failure
= complete_array_type (type
, initializer
, do_default
);
7057 cp_error ("initializer fails to determine size of `%D'", decl
);
7062 cp_error ("array size missing in `%D'", decl
);
7063 /* If a `static' var's size isn't known, make it extern as
7064 well as static, so it does not get allocated. If it's not
7065 `static', then don't mark it extern; finish_incomplete_decl
7066 will give it a default size and it will get allocated. */
7067 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7068 DECL_EXTERNAL (decl
) = 1;
7071 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7072 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7074 cp_error ("zero-size array `%D'", decl
);
7076 layout_decl (decl
, 0);
7080 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7081 any appropriate error messages regarding the layout. INIT is a
7082 the initializer for DECL; returns a modified version. */
7085 layout_var_decl (decl
, init
)
7089 tree ttype
= target_type (TREE_TYPE (decl
));
7091 /* If we haven't already layed out this declaration, and we know its
7092 type, do so now. Note that we must not call complete type for an
7093 external object because it's type might involve templates that we
7094 are not supposed to isntantiate yet. */
7095 if (!DECL_EXTERNAL (decl
)
7096 && DECL_SIZE (decl
) == NULL_TREE
7097 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7098 layout_decl (decl
, 0);
7100 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7102 /* An automatic variable with an incomplete type: that is an error.
7103 Don't talk about array types here, since we took care of that
7104 message in grokdeclarator. */
7105 cp_error ("storage size of `%D' isn't known", decl
);
7106 TREE_TYPE (decl
) = error_mark_node
;
7108 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7109 /* Let debugger know it should output info for this type. */
7110 note_debug_info_needed (ttype
);
7112 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7113 note_debug_info_needed (DECL_CONTEXT (decl
));
7115 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7116 && DECL_SIZE (decl
) != NULL_TREE
7117 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7119 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7120 constant_expression_warning (DECL_SIZE (decl
));
7122 cp_error ("storage size of `%D' isn't constant", decl
);
7128 /* If a local static variable is declared in an inline function, or if
7129 we have a weak definition, we must endeavor to create only one
7130 instance of the variable at link-time. */
7133 maybe_commonize_var (decl
)
7136 /* Static data in a function with comdat linkage also has comdat
7138 if (TREE_STATIC (decl
)
7139 /* Don't mess with __FUNCTION__. */
7140 && ! TREE_ASM_WRITTEN (decl
)
7141 && current_function_decl
7142 && DECL_CONTEXT (decl
) == current_function_decl
7143 && (DECL_THIS_INLINE (current_function_decl
)
7144 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7145 && TREE_PUBLIC (current_function_decl
))
7147 /* Rather than try to get this right with inlining, we suppress
7148 inlining of such functions. */
7149 current_function_cannot_inline
7150 = "function with static variable cannot be inline";
7152 /* If flag_weak, we don't need to mess with this, as we can just
7153 make the function weak, and let it refer to its unique local
7154 copy. This works because we don't allow the function to be
7158 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7160 TREE_PUBLIC (decl
) = 1;
7161 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7163 else if (DECL_INITIAL (decl
) == NULL_TREE
7164 || DECL_INITIAL (decl
) == error_mark_node
)
7166 TREE_PUBLIC (decl
) = 1;
7167 DECL_COMMON (decl
) = 1;
7169 /* else we lose. We can only do this if we can use common,
7170 which we can't if it has been initialized. */
7172 if (TREE_PUBLIC (decl
))
7173 DECL_ASSEMBLER_NAME (decl
)
7174 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7175 else if (! DECL_ARTIFICIAL (decl
))
7177 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7178 cp_warning_at (" you can work around this by removing the initializer", decl
);
7182 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7183 /* Set it up again; we might have set DECL_INITIAL since the last
7185 comdat_linkage (decl
);
7188 /* Issue an error message if DECL is an uninitialized const variable. */
7191 check_for_uninitialized_const_var (decl
)
7194 tree type
= TREE_TYPE (decl
);
7196 /* ``Unless explicitly declared extern, a const object does not have
7197 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7199 if (TREE_CODE (decl
) == VAR_DECL
7200 && TREE_CODE (type
) != REFERENCE_TYPE
7201 && CP_TYPE_CONST_P (type
)
7202 && !TYPE_NEEDS_CONSTRUCTING (type
)
7203 && !DECL_INITIAL (decl
))
7204 cp_error ("uninitialized const `%D'", decl
);
7207 /* Verify INIT (the initializer for DECL), and record the
7208 initialization in DECL_INITIAL, if appropriate. Returns a new
7212 check_initializer (decl
, init
)
7218 if (TREE_CODE (decl
) == FIELD_DECL
)
7221 type
= TREE_TYPE (decl
);
7223 /* If `start_decl' didn't like having an initialization, ignore it now. */
7224 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7227 /* Check the initializer. */
7230 /* Things that are going to be initialized need to have complete
7232 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7234 if (type
== error_mark_node
)
7235 /* We will have already complained. */
7237 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7239 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7242 else if (TREE_CODE (type
) == ARRAY_TYPE
7243 && !TYPE_SIZE (TREE_TYPE (type
)))
7245 cp_error ("elements of array `%#D' have incomplete type", decl
);
7248 else if (!TYPE_SIZE (type
))
7250 cp_error ("`%D' has incomplete type", decl
);
7251 TREE_TYPE (decl
) = error_mark_node
;
7256 if (TREE_CODE (decl
) == CONST_DECL
)
7258 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7260 DECL_INITIAL (decl
) = init
;
7262 /* This will keep us from needing to worry about our obstacks. */
7263 my_friendly_assert (init
!= NULL_TREE
, 149);
7266 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7268 if (TREE_STATIC (decl
))
7269 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7270 grok_reference_init (decl
, type
, init
);
7275 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7277 if (TREE_CODE (type
) == ARRAY_TYPE
)
7278 init
= digest_init (type
, init
, (tree
*) 0);
7279 else if (TREE_CODE (init
) == CONSTRUCTOR
7280 && TREE_HAS_CONSTRUCTOR (init
))
7282 if (TYPE_NON_AGGREGATE_CLASS (type
))
7284 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7286 init
= error_mark_node
;
7289 goto dont_use_constructor
;
7294 dont_use_constructor
:
7295 if (TREE_CODE (init
) != TREE_VEC
)
7296 init
= store_init_value (decl
, init
);
7300 /* We must hide the initializer so that expand_decl
7301 won't try to do something it does not understand. */
7302 init
= obscure_complex_init (decl
, init
);
7304 else if (DECL_EXTERNAL (decl
))
7306 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7307 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7309 tree core_type
= strip_array_types (type
);
7311 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7313 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7314 cp_error ("structure `%D' with uninitialized const members", decl
);
7315 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7316 cp_error ("structure `%D' with uninitialized reference members",
7320 check_for_uninitialized_const_var (decl
);
7322 if (TYPE_SIZE (type
) != NULL_TREE
7323 && TYPE_NEEDS_CONSTRUCTING (type
))
7324 init
= obscure_complex_init (decl
, NULL_TREE
);
7328 check_for_uninitialized_const_var (decl
);
7333 /* If DECL is not a local variable, give it RTL. */
7336 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7339 const char *asmspec
;
7344 type
= TREE_TYPE (decl
);
7345 toplev
= toplevel_bindings_p ();
7346 push_obstacks_nochange ();
7347 if (TREE_STATIC (decl
)
7348 && TYPE_NEEDS_DESTRUCTOR (type
)
7349 && allocation_temporary_p ())
7350 end_temporary_allocation ();
7352 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7353 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7354 else if (TREE_CODE (decl
) == VAR_DECL
7355 && TREE_READONLY (decl
)
7356 && DECL_INITIAL (decl
) != NULL_TREE
7357 && DECL_INITIAL (decl
) != error_mark_node
7358 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7360 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7363 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7366 && TREE_STATIC (decl
)
7367 && ! TREE_SIDE_EFFECTS (decl
)
7368 && ! TREE_PUBLIC (decl
)
7369 && ! DECL_EXTERNAL (decl
)
7370 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7371 && DECL_MODE (decl
) != BLKmode
)
7373 /* If this variable is really a constant, then fill its DECL_RTL
7374 slot with something which won't take up storage.
7375 If something later should take its address, we can always give
7376 it legitimate RTL at that time. */
7377 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7378 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7379 TREE_ASM_WRITTEN (decl
) = 1;
7381 else if (toplev
&& ! TREE_PUBLIC (decl
))
7383 /* If this is a static const, change its apparent linkage
7384 if it belongs to a #pragma interface. */
7385 if (!interface_unknown
)
7387 TREE_PUBLIC (decl
) = 1;
7388 DECL_EXTERNAL (decl
) = interface_only
;
7390 make_decl_rtl (decl
, asmspec
, toplev
);
7393 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7395 else if (TREE_CODE (decl
) == VAR_DECL
7396 && DECL_LANG_SPECIFIC (decl
)
7397 && DECL_IN_AGGR_P (decl
))
7399 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7401 if (init
== NULL_TREE
7402 #ifdef DEFAULT_STATIC_DEFS
7403 /* If this code is dead, then users must
7404 explicitly declare static member variables
7405 outside the class def'n as well. */
7406 && TYPE_NEEDS_CONSTRUCTING (type
)
7410 DECL_EXTERNAL (decl
) = 1;
7411 make_decl_rtl (decl
, asmspec
, 1);
7414 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7417 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7422 /* The old ARM scoping rules injected variables declared in the
7423 initialization statement of a for-statement into the surrounding
7424 scope. We support this usage, in order to be backward-compatible.
7425 DECL is a just-declared VAR_DECL; if necessary inject its
7426 declaration into the surrounding scope. */
7429 maybe_inject_for_scope_var (decl
)
7432 if (current_binding_level
->is_for_scope
)
7434 struct binding_level
*outer
7435 = current_binding_level
->level_chain
;
7437 /* Check to see if the same name is already bound at the outer
7438 level, either because it was directly declared, or because a
7439 dead for-decl got preserved. In either case, the code would
7440 not have been valid under the ARM scope rules, so clear
7441 is_for_scope for the current_binding_level.
7443 Otherwise, we need to preserve the temp slot for decl to last
7444 into the outer binding level. */
7447 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7449 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7450 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7452 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7454 BINDING_VALUE (outer_binding
)
7455 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7456 current_binding_level
->is_for_scope
= 0;
7458 else if (DECL_IN_MEMORY_P (decl
))
7459 preserve_temp_slots (DECL_RTL (decl
));
7463 /* Generate code to initialize DECL (a local variable). */
7466 initialize_local_var (decl
, init
, flags
)
7473 type
= complete_type (TREE_TYPE (decl
));
7475 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7477 /* If we used it already as memory, it must stay in memory. */
7478 DECL_INITIAL (decl
) = NULL_TREE
;
7479 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7482 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7486 /* Compute and store the initial value. */
7487 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7489 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7491 int saved_stmts_are_full_exprs_p
;
7493 emit_line_note (DECL_SOURCE_FILE (decl
),
7494 DECL_SOURCE_LINE (decl
));
7495 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7496 stmts_are_full_exprs_p
= 1;
7497 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7498 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7501 /* Set this to 0 so we can tell whether an aggregate which was
7502 initialized was ever used. Don't do this if it has a
7503 destructor, so we don't complain about the 'resource
7504 allocation is initialization' idiom. Now set
7505 attribute((unused)) on types so decls of that type will be
7506 marked used. (see TREE_USED, above.) */
7507 if (TYPE_NEEDS_CONSTRUCTING (type
)
7509 && !TYPE_NEEDS_DESTRUCTOR (type
)
7510 && DECL_NAME (decl
))
7511 TREE_USED (decl
) = 0;
7512 else if (already_used
)
7513 TREE_USED (decl
) = 1;
7517 /* Generate code to destroy DECL (a local variable). */
7520 destroy_local_var (decl
)
7523 tree type
= TREE_TYPE (decl
);
7526 /* Only variables get cleaned up. */
7527 if (TREE_CODE (decl
) != VAR_DECL
)
7530 /* And only things with destructors need cleaning up. */
7531 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7534 if (TREE_CODE (decl
) == VAR_DECL
&&
7535 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7536 /* We don't clean up things that aren't defined in this
7537 translation unit, or that need a static cleanup. The latter
7538 are handled by finish_file. */
7541 /* Compute the cleanup. */
7542 cleanup
= maybe_build_cleanup (decl
);
7544 /* Record the cleanup required for this declaration. */
7545 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7547 finish_decl_cleanup (decl
, cleanup
);
7550 /* Let the back-end know about DECL. */
7553 emit_local_var (decl
)
7556 /* Create RTL for this variable. */
7557 if (DECL_RTL (decl
))
7558 /* Only a RESULT_DECL should have non-NULL RTL when
7559 arriving here. All other local variables are
7560 assigned RTL in this function. */
7561 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7566 /* Actually do the initialization. */
7567 expand_start_target_temps ();
7568 expand_decl_init (decl
);
7569 expand_end_target_temps ();
7572 /* Finish processing of a declaration;
7573 install its line number and initial value.
7574 If the length of an array type is not known before,
7575 it must be determined now, from the initial value, or it is an error.
7577 Call `pop_obstacks' iff NEED_POP is nonzero.
7579 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7580 for aggregates that have constructors alive on the permanent obstack,
7581 so that the global initializing functions can be written at the end.
7583 INIT0 holds the value of an initializer that should be allowed to escape
7586 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7587 if the (init) syntax was used.
7589 For functions that take default parameters, DECL points to its
7590 "maximal" instantiation. `cp_finish_decl' must then also declared its
7591 subsequently lower and lower forms of instantiation, checking for
7592 ambiguity as it goes. This can be sped up later. */
7595 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7602 tree ttype
= NULL_TREE
;
7603 int temporary
= allocation_temporary_p ();
7604 const char *asmspec
= NULL
;
7605 int was_readonly
= 0;
7607 /* If this is 0, then we did not change obstacks. */
7611 error ("assignment (not initialization) in declaration");
7615 /* If a name was specified, get the string. */
7617 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7619 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7621 cp_error ("Cannot initialize `%D' to namespace `%D'",
7626 if (current_class_type
7627 && DECL_REAL_CONTEXT (decl
) == current_class_type
7628 && TYPE_BEING_DEFINED (current_class_type
)
7629 && (DECL_INITIAL (decl
) || init
))
7630 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7632 if (TREE_CODE (decl
) == VAR_DECL
7633 && DECL_CONTEXT (decl
)
7634 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7635 && DECL_CONTEXT (decl
) != current_namespace
7638 /* Leave the namespace of the object. */
7639 pop_decl_namespace ();
7642 type
= TREE_TYPE (decl
);
7644 if (type
== error_mark_node
)
7646 if (toplevel_bindings_p () && temporary
)
7647 end_temporary_allocation ();
7652 /* Add this declaration to the statement-tree. */
7653 if (building_stmt_tree ()
7654 && TREE_CODE (current_scope ()) == FUNCTION_DECL
)
7655 add_decl_stmt (decl
);
7657 if (TYPE_HAS_MUTABLE_P (type
))
7658 TREE_READONLY (decl
) = 0;
7660 if (processing_template_decl
)
7662 if (init
&& DECL_INITIAL (decl
))
7663 DECL_INITIAL (decl
) = init
;
7667 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7668 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7670 /* Take care of TYPE_DECLs up front. */
7671 if (TREE_CODE (decl
) == TYPE_DECL
)
7673 if (init
&& DECL_INITIAL (decl
))
7675 /* typedef foo = bar; store the type of bar as the type of foo. */
7676 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7677 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7679 if (type
!= error_mark_node
7680 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7682 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7683 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7684 set_identifier_type_value (DECL_NAME (decl
), type
);
7685 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7687 GNU_xref_decl (current_function_decl
, decl
);
7689 /* If we have installed this as the canonical typedef for this
7690 type, and that type has not been defined yet, delay emitting
7691 the debug information for it, as we will emit it later. */
7692 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7693 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7694 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7696 rest_of_decl_compilation (decl
, NULL_PTR
,
7697 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7701 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7702 ttype
= target_type (type
);
7704 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7705 && TYPE_NEEDS_CONSTRUCTING (type
))
7707 /* Currently, GNU C++ puts constants in text space, making them
7708 impossible to initialize. In the future, one would hope for
7709 an operating system which understood the difference between
7710 initialization and the running of a program. */
7712 TREE_READONLY (decl
) = 0;
7715 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7717 /* This must override the asm specifier which was placed by
7718 grokclassfn. Lay this out fresh. */
7719 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7720 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7721 make_decl_rtl (decl
, asmspec
, 0);
7724 /* Deduce size of array from initialization, if not already known. */
7725 maybe_deduce_size_from_array_init (decl
, init
);
7726 init
= check_initializer (decl
, init
);
7728 GNU_xref_decl (current_function_decl
, decl
);
7730 /* For top-level declaration, the initial value was read in
7731 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7732 must go in the permanent obstack; but don't discard the
7733 temporary data yet. */
7735 if (toplevel_bindings_p () && temporary
)
7736 end_temporary_allocation ();
7738 if (TREE_CODE (decl
) == VAR_DECL
)
7739 init
= layout_var_decl (decl
, init
);
7741 /* Output the assembler code and/or RTL code for variables and functions,
7742 unless the type is an undefined structure or union.
7743 If not, it will get done when the type is completed. */
7744 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7745 || TREE_CODE (decl
) == RESULT_DECL
)
7747 /* ??? FIXME: What about nested classes? */
7748 int toplev
= toplevel_bindings_p ();
7750 if (TREE_CODE (decl
) == VAR_DECL
)
7751 maybe_commonize_var (decl
);
7753 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7755 if (TREE_CODE (type
) == FUNCTION_TYPE
7756 || TREE_CODE (type
) == METHOD_TYPE
)
7757 abstract_virtuals_error (decl
,
7758 strip_array_types (TREE_TYPE (type
)));
7760 abstract_virtuals_error (decl
, strip_array_types (type
));
7762 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7764 else if (DECL_EXTERNAL (decl
)
7765 && ! (DECL_LANG_SPECIFIC (decl
)
7766 && DECL_NOT_REALLY_EXTERN (decl
)))
7769 DECL_INITIAL (decl
) = init
;
7771 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7773 /* Cleanups for static variables are handled by `finish_file'. */
7774 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7775 || TYPE_NEEDS_DESTRUCTOR (type
))
7776 expand_static_init (decl
, init
);
7780 /* This is a local declaration. */
7781 maybe_inject_for_scope_var (decl
);
7782 /* Initialize the local variable. But, if we're building a
7783 statement-tree, we'll do the initialization when we
7785 if (processing_template_decl
)
7787 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7788 DECL_INITIAL (decl
) = init
;
7792 if (!building_stmt_tree ())
7793 emit_local_var (decl
);
7794 initialize_local_var (decl
, init
, flags
);
7795 /* Clean up the variable. */
7796 destroy_local_var (decl
);
7801 /* Undo call to `pushclass' that was done in `start_decl'
7802 due to initialization of qualified member variable.
7803 I.e., Foo::x = 10; */
7805 tree context
= DECL_REAL_CONTEXT (decl
);
7807 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7808 && (TREE_CODE (decl
) == VAR_DECL
7809 /* We also have a pushclass done that we need to undo here
7810 if we're at top level and declare a method. */
7811 || TREE_CODE (decl
) == FUNCTION_DECL
)
7812 /* If size hasn't been set, we're still defining it,
7813 and therefore inside the class body; don't pop
7814 the binding level.. */
7815 && TYPE_SIZE (context
) != NULL_TREE
7816 && context
== current_class_type
)
7817 pop_nested_class ();
7823 /* If requested, warn about definitions of large data objects. */
7825 if (warn_larger_than
7826 && ! processing_template_decl
7827 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7828 && !DECL_EXTERNAL (decl
))
7830 register tree decl_size
= DECL_SIZE (decl
);
7832 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7834 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7836 if (units
> larger_than_size
)
7837 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7842 /* Resume permanent allocation, if not within a function. The
7843 corresponding push_obstacks_nochange is in start_decl,
7844 start_method, groktypename, and in grokfield. */
7848 TREE_READONLY (decl
) = 1;
7851 /* This is here for a midend callback from c-common.c */
7854 finish_decl (decl
, init
, asmspec_tree
)
7858 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7861 /* Generate code to handle the destruction of the function-scoped
7862 static variable DECL. */
7865 destroy_local_static (decl
)
7868 tree cleanup
, fcall
;
7870 int saved_flag_access_control
;
7872 if (atexit_node
== 0)
7874 tree atexit_fndecl
, PFV
, pfvlist
;
7875 /* Remember this information until end of file. */
7876 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7877 PFV
= build_pointer_type (build_function_type
7878 (void_type_node
, void_list_node
));
7880 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7882 push_lang_context (lang_name_c
);
7883 /* Note that we do not call pushdecl for this function;
7884 there's no reason that this declaration should be
7885 accessible to anyone. */
7887 = define_function ("atexit",
7888 build_function_type (void_type_node
,
7890 /*pfn=*/0, NULL_PTR
);
7891 mark_used (atexit_fndecl
);
7892 atexit_node
= default_conversion (atexit_fndecl
);
7893 pop_lang_context ();
7897 /* Call build_cleanup before we enter the anonymous function so that
7898 any access checks will be done relative to the current scope,
7899 rather than the scope of the anonymous function. */
7900 build_cleanup (decl
);
7902 /* Now start the function. */
7903 cleanup
= start_anon_func ();
7905 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7906 to the original function, rather than the anonymous one. That
7907 will make the back-end think that nested functions are in use,
7908 which causes confusion. */
7909 saved_flag_access_control
= flag_access_control
;
7910 flag_access_control
= 0;
7911 fcall
= build_cleanup (decl
);
7912 flag_access_control
= saved_flag_access_control
;
7914 /* Create the body of the anonymous function. */
7915 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7916 finish_expr_stmt (fcall
);
7917 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7920 /* Call atexit with the cleanup function. */
7921 mark_addressable (cleanup
);
7922 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7923 fcall
= build_function_call (atexit_node
,
7924 tree_cons (NULL_TREE
,
7927 finish_expr_stmt (fcall
);
7931 expand_static_init (decl
, init
)
7935 tree oldstatic
= value_member (decl
, static_aggregates
);
7939 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7940 cp_error ("multiple initializations given for `%D'", decl
);
7942 else if (! toplevel_bindings_p ())
7944 /* Emit code to perform this initialization but once. */
7951 /* Remember this information until end of file. */
7952 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7954 /* Emit code to perform this initialization but once. This code
7957 static int temp = 0;
7959 // Do initialization.
7961 // Register variable for destruction at end of program.
7964 Note that the `temp' variable is only set to 1 *after* the
7965 initialization is complete. This ensures that an exception,
7966 thrown during the construction, will cause the variable to
7967 reinitialized when we pass through this code again, as per:
7971 If the initialization exits by throwing an exception, the
7972 initialization is not complete, so it will be tried again
7973 the next time control enters the declaration.
7975 In theory, this process should be thread-safe, too; multiple
7976 threads should not be able to initialize the variable more
7977 than once. We don't yet attempt to ensure thread-safety. */
7978 temp
= get_temp_name (integer_type_node
, 1);
7979 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
7981 /* Begin the conditional initialization. */
7982 if_stmt
= begin_if_stmt ();
7983 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
7986 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
7988 /* Do the initialization itself. */
7989 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
7990 || (init
&& TREE_CODE (init
) == TREE_LIST
))
7991 assignment
= build_aggr_init (decl
, init
, 0);
7993 /* The initialization we're doing here is just a bitwise
7995 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
7997 assignment
= NULL_TREE
;
7999 /* Once the assignment is complete, set TEMP to 1. Since the
8000 construction of the static object is complete at this point,
8001 we want to make sure TEMP is set to 1 even if a temporary
8002 constructed during the initialization throws an exception
8003 when it is destroyed. So, we combine the initialization and
8004 the assignment to TEMP into a single expression, ensuring
8005 that when we call finish_expr_stmt the cleanups will not be
8006 run until after TEMP is set to 1. */
8007 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8010 assignment
= tree_cons (NULL_TREE
, assignment
,
8011 build_tree_list (NULL_TREE
,
8013 assignment
= build_compound_expr (assignment
);
8016 assignment
= temp_init
;
8017 finish_expr_stmt (assignment
);
8019 /* Use atexit to register a function for destroying this static
8021 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8022 destroy_local_static (decl
);
8024 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8025 finish_then_clause (if_stmt
);
8028 /* Resume old (possibly temporary) allocation. */
8033 /* This code takes into account memory allocation policy of
8034 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8035 hold for this object, then we must make permanent the storage
8036 currently in the temporary obstack. */
8037 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8038 preserve_initializer ();
8039 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8043 /* Finish the declaration of a catch-parameter. */
8046 start_handler_parms (declspecs
, declarator
)
8053 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8055 if (decl
== NULL_TREE
)
8056 error ("invalid catch parameter");
8060 expand_start_catch_block (decl
);
8064 /* Make TYPE a complete type based on INITIAL_VALUE.
8065 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8066 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8069 complete_array_type (type
, initial_value
, do_default
)
8070 tree type
, initial_value
;
8073 register tree maxindex
= NULL_TREE
;
8076 /* Allocate on the same obstack as TYPE. */
8077 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8081 /* Note MAXINDEX is really the maximum index,
8082 one less than the size. */
8083 if (TREE_CODE (initial_value
) == STRING_CST
)
8086 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8087 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8090 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8092 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8093 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8094 for (; elts
; elts
= TREE_CHAIN (elts
))
8096 if (TREE_PURPOSE (elts
))
8097 maxindex
= TREE_PURPOSE (elts
);
8099 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8101 maxindex
= copy_node (maxindex
);
8105 /* Make an error message unless that happened already. */
8106 if (initial_value
!= error_mark_node
)
8109 initial_value
= NULL_TREE
;
8111 /* Prevent further error messages. */
8112 maxindex
= build_int_2 (0, 0);
8119 maxindex
= build_int_2 (0, 0);
8128 domain
= build_index_type (maxindex
);
8129 TYPE_DOMAIN (type
) = domain
;
8131 if (! TREE_TYPE (maxindex
))
8132 TREE_TYPE (maxindex
) = domain
;
8134 itype
= TREE_TYPE (initial_value
);
8137 if (itype
&& !TYPE_DOMAIN (itype
))
8138 TYPE_DOMAIN (itype
) = domain
;
8139 /* The type of the main variant should never be used for arrays
8140 of different sizes. It should only ever be completed with the
8141 size of the array. */
8142 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8143 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8148 /* Lay out the type now that we can get the real answer. */
8155 /* Return zero if something is declared to be a member of type
8156 CTYPE when in the context of CUR_TYPE. STRING is the error
8157 message to print in that case. Otherwise, quietly return 1. */
8160 member_function_or_else (ctype
, cur_type
, string
)
8161 tree ctype
, cur_type
;
8164 if (ctype
&& ctype
!= cur_type
)
8166 error (string
, TYPE_NAME_STRING (ctype
));
8172 /* Subroutine of `grokdeclarator'. */
8174 /* Generate errors possibly applicable for a given set of specifiers.
8175 This is for ARM $7.1.2. */
8178 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8181 int virtualp
, quals
, friendp
, raises
, inlinep
;
8184 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8186 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8188 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8191 cp_error_at ("`%D' declared as a friend", object
);
8193 cp_error_at ("`%D' declared with an exception specification", object
);
8196 /* CTYPE is class type, or null if non-class.
8197 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8199 DECLARATOR is the function's name.
8200 VIRTUALP is truthvalue of whether the function is virtual or not.
8201 FLAGS are to be passed through to `grokclassfn'.
8202 QUALS are qualifiers indicating whether the function is `const'
8204 RAISES is a list of exceptions that this function can raise.
8205 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8206 not look, and -1 if we should not call `grokclassfn' at all.
8208 Returns `NULL_TREE' if something goes wrong, after issuing
8209 applicable error messages. */
8212 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8213 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8214 template_count
, in_namespace
)
8217 tree orig_declarator
;
8219 enum overload_flags flags
;
8221 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8225 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8226 int has_default_arg
= 0;
8230 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8231 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8237 type
= build_exception_variant (type
, raises
);
8240 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8241 /* Propagate volatile out from type to decl. */
8242 if (TYPE_VOLATILE (type
))
8243 TREE_THIS_VOLATILE (decl
) = 1;
8245 /* If this decl has namespace scope, set that up. */
8247 set_decl_namespace (decl
, in_namespace
, friendp
);
8248 else if (publicp
&& ! ctype
)
8249 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8251 /* `main' and builtins have implicit 'C' linkage. */
8252 if ((MAIN_NAME_P (declarator
)
8253 || (IDENTIFIER_LENGTH (declarator
) > 10
8254 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8255 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8256 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8257 && current_lang_name
== lang_name_cplusplus
8258 && ctype
== NULL_TREE
8259 /* NULL_TREE means global namespace. */
8260 && DECL_CONTEXT (decl
) == NULL_TREE
)
8261 DECL_LANGUAGE (decl
) = lang_c
;
8263 /* Should probably propagate const out from type to decl I bet (mrs). */
8266 DECL_STATIC_FUNCTION_P (decl
) = 1;
8267 DECL_CONTEXT (decl
) = ctype
;
8271 DECL_CLASS_CONTEXT (decl
) = ctype
;
8273 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8275 if (processing_template_decl
)
8276 error ("cannot declare `main' to be a template");
8278 error ("cannot declare `main' to be inline");
8280 error ("cannot declare `main' to be static");
8285 /* Members of anonymous types and local classes have no linkage; make
8287 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8288 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8293 /* [basic.link]: A name with no linkage (notably, the name of a class
8294 or enumeration declared in a local scope) shall not be used to
8295 declare an entity with linkage.
8297 Only check this for public decls for now. */
8298 t
= no_linkage_check (TREE_TYPE (decl
));
8301 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8303 if (DECL_LANGUAGE (decl
) == lang_c
)
8304 /* Allow this; it's pretty common in C. */;
8306 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8310 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8315 TREE_PUBLIC (decl
) = publicp
;
8318 DECL_INTERFACE_KNOWN (decl
) = 1;
8319 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8323 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8325 DECL_EXTERNAL (decl
) = 1;
8326 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8328 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8329 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8333 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8334 grok_op_properties (decl
, virtualp
, check
< 0);
8336 if (ctype
&& hack_decl_function_context (decl
))
8337 DECL_NO_STATIC_CHAIN (decl
) = 1;
8339 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8340 if (TREE_PURPOSE (t
)
8341 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8343 has_default_arg
= 1;
8348 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8352 ("defining explicit specialization `%D' in friend declaration",
8356 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8358 /* Something like `template <class T> friend void f<T>()'. */
8359 cp_error ("template-id `%D' in declaration of primary template",
8365 /* A friend declaration of the form friend void f<>(). Record
8366 the information in the TEMPLATE_ID_EXPR. */
8367 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8368 DECL_TEMPLATE_INFO (decl
)
8369 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8370 TREE_OPERAND (orig_declarator
, 1),
8373 if (has_default_arg
)
8375 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8382 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8389 if (has_default_arg
)
8390 add_defarg_fn (decl
);
8392 /* Plain overloading: will not be grok'd by grokclassfn. */
8393 if (! ctype
&& ! processing_template_decl
8394 && DECL_LANGUAGE (decl
) != lang_c
8395 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8396 set_mangled_name_for_decl (decl
);
8399 /* Make the init_value nonzero so pushdecl knows this is not
8400 tentative. error_mark_node is replaced later with the BLOCK. */
8401 DECL_INITIAL (decl
) = error_mark_node
;
8403 /* Caller will do the rest of this. */
8407 if (check
&& funcdef_flag
)
8408 DECL_INITIAL (decl
) = error_mark_node
;
8410 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8413 /* Just handle constructors here. We could do this
8414 inside the following if stmt, but I think
8415 that the code is more legible by breaking this
8416 case out. See comments below for what each of
8417 the following calls is supposed to do. */
8418 DECL_CONSTRUCTOR_P (decl
) = 1;
8420 grokclassfn (ctype
, decl
, flags
, quals
);
8422 decl
= check_explicit_specialization (orig_declarator
, decl
,
8424 2 * (funcdef_flag
!= 0) +
8425 4 * (friendp
!= 0));
8426 if (decl
== error_mark_node
)
8429 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8432 tmp
= check_classfn (ctype
, decl
);
8434 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8435 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8437 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8438 cp_error ("definition of implicitly-declared `%D'", tmp
);
8439 if (tmp
&& duplicate_decls (decl
, tmp
))
8442 if (! grok_ctor_properties (ctype
, decl
))
8449 /* Function gets the ugly name, field gets the nice one.
8450 This call may change the type of the function (because
8451 of default parameters)! */
8452 if (ctype
!= NULL_TREE
)
8453 grokclassfn (ctype
, decl
, flags
, quals
);
8455 decl
= check_explicit_specialization (orig_declarator
, decl
,
8457 2 * (funcdef_flag
!= 0) +
8458 4 * (friendp
!= 0));
8459 if (decl
== error_mark_node
)
8462 if (ctype
!= NULL_TREE
8463 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8466 tmp
= check_classfn (ctype
, decl
);
8468 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8469 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8471 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8472 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8474 /* Remove the `this' parm added by grokclassfn.
8475 XXX Isn't this done in start_function, too? */
8476 revert_static_member_fn (&decl
, NULL
, NULL
);
8477 last_function_parms
= TREE_CHAIN (last_function_parms
);
8479 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8480 cp_error ("definition of implicitly-declared `%D'", tmp
);
8483 /* Attempt to merge the declarations. This can fail, in
8484 the case of some illegal specialization declarations. */
8485 if (!duplicate_decls (decl
, tmp
))
8486 cp_error ("no `%#D' member function declared in class `%T'",
8492 if (ctype
== NULL_TREE
|| check
)
8497 DECL_VIRTUAL_P (decl
) = 1;
8498 if (DECL_VINDEX (decl
) == NULL_TREE
)
8499 DECL_VINDEX (decl
) = error_mark_node
;
8500 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8507 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8510 RID_BIT_TYPE
*specbits_in
;
8516 RID_BIT_TYPE specbits
;
8518 specbits
= *specbits_in
;
8520 if (TREE_CODE (type
) == OFFSET_TYPE
)
8522 /* If you declare a static member so that it
8523 can be initialized, the code will reach here. */
8524 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8525 type
= TREE_TYPE (type
);
8526 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8527 DECL_CONTEXT (decl
) = basetype
;
8528 DECL_CLASS_CONTEXT (decl
) = basetype
;
8529 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8536 context
= in_namespace
;
8537 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8538 context
= current_namespace
;
8540 context
= NULL_TREE
;
8542 if (processing_template_decl
)
8544 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8545 we can call push_template_decl. */
8546 push_permanent_obstack ();
8547 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8551 decl
= build_decl (VAR_DECL
, declarator
, type
);
8554 set_decl_namespace (decl
, context
, 0);
8556 context
= DECL_CONTEXT (decl
);
8557 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8558 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8562 set_decl_namespace (decl
, in_namespace
, 0);
8564 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8566 DECL_THIS_EXTERN (decl
) = 1;
8567 DECL_EXTERNAL (decl
) = !initialized
;
8570 /* In class context, static means one per class,
8571 public access, and static storage. */
8572 if (DECL_CLASS_SCOPE_P (decl
))
8574 TREE_PUBLIC (decl
) = 1;
8575 TREE_STATIC (decl
) = 1;
8576 DECL_EXTERNAL (decl
) = 0;
8578 /* At top level, either `static' or no s.c. makes a definition
8579 (perhaps tentative), and absence of `static' makes it public. */
8580 else if (toplevel_bindings_p ())
8582 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8583 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8584 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8586 /* Not at top level, only `static' makes a static definition. */
8589 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8590 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8593 if (TREE_PUBLIC (decl
))
8595 /* [basic.link]: A name with no linkage (notably, the name of a class
8596 or enumeration declared in a local scope) shall not be used to
8597 declare an entity with linkage.
8599 Only check this for public decls for now. */
8600 tree t
= no_linkage_check (TREE_TYPE (decl
));
8603 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8604 /* Ignore for now; `enum { foo } e' is pretty common. */;
8606 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8614 /* Create and return a canonical pointer to member function type, for
8615 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8618 build_ptrmemfunc_type (type
)
8624 tree unqualified_variant
= NULL_TREE
;
8626 /* If a canonical type already exists for this type, use it. We use
8627 this method instead of type_hash_canon, because it only does a
8628 simple equality check on the list of field members. */
8630 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8633 /* Make sure that we always have the unqualified pointer-to-member
8635 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8637 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8639 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8641 u
= make_lang_type (UNION_TYPE
);
8642 SET_IS_AGGR_TYPE (u
, 0);
8643 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8644 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8646 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8647 TYPE_NAME (u
) = NULL_TREE
;
8649 t
= make_lang_type (RECORD_TYPE
);
8651 /* Let the front-end know this is a pointer to member function... */
8652 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8653 /* ... and not really an aggregate. */
8654 SET_IS_AGGR_TYPE (t
, 0);
8656 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8658 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8660 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8661 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8665 /* Zap out the name so that the back-end will give us the debugging
8666 information for this anonymous RECORD_TYPE. */
8667 TYPE_NAME (t
) = NULL_TREE
;
8669 /* If this is not the unqualified form of this pointer-to-member
8670 type, set the TYPE_MAIN_VARIANT for this type to be the
8671 unqualified type. Since they are actually RECORD_TYPEs that are
8672 not variants of each other, we must do this manually. */
8673 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8675 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8676 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8677 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8678 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8681 /* Cache this pointer-to-member type so that we can find it again
8683 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8685 /* Seems to be wanted. */
8686 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8691 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8692 Check to see that the definition is valid. Issue appropriate error
8693 messages. Return 1 if the definition is particularly bad, or 0
8697 check_static_variable_definition (decl
, type
)
8701 /* Motion 10 at San Diego: If a static const integral data member is
8702 initialized with an integral constant expression, the initializer
8703 may appear either in the declaration (within the class), or in
8704 the definition, but not both. If it appears in the class, the
8705 member is a member constant. The file-scope definition is always
8707 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8709 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8711 /* If we just return the declaration, crashes will sometimes
8712 occur. We therefore return void_type_node, as if this was a
8713 friend declaration, to cause callers to completely ignore
8714 this declaration. */
8717 else if (!CP_TYPE_CONST_P (type
))
8718 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8720 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8721 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8726 /* Given declspecs and a declarator,
8727 determine the name and type of the object declared
8728 and construct a ..._DECL node for it.
8729 (In one case we can return a ..._TYPE node instead.
8730 For invalid input we sometimes return 0.)
8732 DECLSPECS is a chain of tree_list nodes whose value fields
8733 are the storage classes and type specifiers.
8735 DECL_CONTEXT says which syntactic context this declaration is in:
8736 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8737 FUNCDEF for a function definition. Like NORMAL but a few different
8738 error messages in each case. Return value may be zero meaning
8739 this definition is too screwy to try to parse.
8740 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8741 handle member functions (which have FIELD context).
8742 Return value may be zero meaning this definition is too screwy to
8744 PARM for a parameter declaration (either within a function prototype
8745 or before a function body). Make a PARM_DECL, or return void_type_node.
8746 CATCHPARM for a parameter declaration before a catch clause.
8747 TYPENAME if for a typename (in a cast or sizeof).
8748 Don't make a DECL node; just return the ..._TYPE node.
8749 FIELD for a struct or union field; make a FIELD_DECL.
8750 BITFIELD for a field with specified width.
8751 INITIALIZED is 1 if the decl has an initializer.
8753 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8754 normal attributes in TREE_PURPOSE, or NULL_TREE.
8756 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8757 It may also be so in the PARM case, for a prototype where the
8758 argument type is specified but not the name.
8760 This function is where the complicated C meanings of `static'
8761 and `extern' are interpreted.
8763 For C++, if there is any monkey business to do, the function which
8764 calls this one must do it, i.e., prepending instance variables,
8765 renaming overloaded function names, etc.
8767 Note that for this C++, it is an error to define a method within a class
8768 which does not belong to that class.
8770 Except in the case where SCOPE_REFs are implicitly known (such as
8771 methods within a class being redundantly qualified),
8772 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8773 (class_name::decl_name). The caller must also deal with this.
8775 If a constructor or destructor is seen, and the context is FIELD,
8776 then the type gains the attribute TREE_HAS_x. If such a declaration
8777 is erroneous, NULL_TREE is returned.
8779 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8780 function, these are the qualifiers to give to the `this' pointer.
8782 May return void_type_node if the declarator turned out to be a friend.
8783 See grokfield for details. */
8785 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8788 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8791 enum decl_context decl_context
;
8795 RID_BIT_TYPE specbits
;
8798 tree type
= NULL_TREE
;
8804 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8805 int explicit_int
= 0;
8806 int explicit_char
= 0;
8807 int defaulted_int
= 0;
8808 tree typedef_decl
= NULL_TREE
;
8810 tree typedef_type
= NULL_TREE
;
8811 int funcdef_flag
= 0;
8812 enum tree_code innermost_code
= ERROR_MARK
;
8815 /* See the code below that used this. */
8816 tree decl_machine_attr
= NULL_TREE
;
8818 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8819 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8820 tree init
= NULL_TREE
;
8822 /* Keep track of what sort of function is being processed
8823 so that we can warn about default return values, or explicit
8824 return values which do not match prescribed defaults. */
8825 enum return_types return_type
= return_normal
;
8827 tree dname
= NULL_TREE
;
8828 tree ctype
= current_class_type
;
8829 tree ctor_return_type
= NULL_TREE
;
8830 enum overload_flags flags
= NO_SPECIAL
;
8831 tree quals
= NULL_TREE
;
8832 tree raises
= NULL_TREE
;
8833 int template_count
= 0;
8834 tree in_namespace
= NULL_TREE
;
8838 RIDBIT_RESET_ALL (specbits
);
8839 if (decl_context
== FUNCDEF
)
8840 funcdef_flag
= 1, decl_context
= NORMAL
;
8841 else if (decl_context
== MEMFUNCDEF
)
8842 funcdef_flag
= -1, decl_context
= FIELD
;
8843 else if (decl_context
== BITFIELD
)
8844 bitfield
= 1, decl_context
= FIELD
;
8846 /* Look inside a declarator for the name being declared
8847 and get it as a string, for an error message. */
8849 tree
*next
= &declarator
;
8853 while (next
&& *next
)
8856 switch (TREE_CODE (decl
))
8859 /* For attributes. */
8860 next
= &TREE_VALUE (decl
);
8865 next
= &TREE_OPERAND (decl
, 0);
8868 case BIT_NOT_EXPR
: /* For C++ destructors! */
8870 tree name
= TREE_OPERAND (decl
, 0);
8871 tree rename
= NULL_TREE
;
8873 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8875 return_type
= return_dtor
;
8876 if (TREE_CODE (name
) == TYPE_DECL
)
8877 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8878 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8879 if (ctype
== NULL_TREE
)
8881 if (current_class_type
== NULL_TREE
)
8883 error ("destructors must be member functions");
8888 tree t
= constructor_name (current_class_name
);
8895 tree t
= constructor_name (ctype
);
8902 cp_error ("destructor `%T' must match class name `%T'",
8904 TREE_OPERAND (decl
, 0) = rename
;
8910 case ADDR_EXPR
: /* C++ reference declaration */
8915 innermost_code
= TREE_CODE (decl
);
8916 next
= &TREE_OPERAND (decl
, 0);
8920 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
8922 /* This is actually a variable declaration using
8923 constructor syntax. We need to call start_decl and
8924 cp_finish_decl so we can get the variable
8927 tree attributes
, prefix_attributes
;
8929 *next
= TREE_OPERAND (decl
, 0);
8930 init
= CALL_DECLARATOR_PARMS (decl
);
8934 attributes
= TREE_PURPOSE (attrlist
);
8935 prefix_attributes
= TREE_VALUE (attrlist
);
8939 attributes
= NULL_TREE
;
8940 prefix_attributes
= NULL_TREE
;
8943 decl
= start_decl (declarator
, declspecs
, 1,
8944 attributes
, prefix_attributes
);
8947 /* Look for __unused__ attribute */
8948 if (TREE_USED (TREE_TYPE (decl
)))
8949 TREE_USED (decl
) = 1;
8950 finish_decl (decl
, init
, NULL_TREE
);
8953 cp_error ("invalid declarator");
8956 innermost_code
= TREE_CODE (decl
);
8957 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8958 ctype
= current_class_type
;
8960 && TREE_OPERAND (decl
, 0)
8961 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
8962 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
8963 == constructor_name_full (ctype
))
8964 || (DECL_NAME (TREE_OPERAND (decl
, 0))
8965 == constructor_name (ctype
)))))
8966 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8967 next
= &TREE_OPERAND (decl
, 0);
8969 if (ctype
!= NULL_TREE
8970 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
8971 && decl
== constructor_name (ctype
))
8973 return_type
= return_ctor
;
8974 ctor_return_type
= ctype
;
8979 case TEMPLATE_ID_EXPR
:
8981 tree fns
= TREE_OPERAND (decl
, 0);
8983 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
8984 fns
= TREE_OPERAND (fns
, 0);
8987 if (TREE_CODE (dname
) == COMPONENT_REF
)
8988 dname
= TREE_OPERAND (dname
, 1);
8989 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
8991 my_friendly_assert (is_overloaded_fn (dname
),
8993 dname
= DECL_NAME (get_first_fn (dname
));
8998 case IDENTIFIER_NODE
:
8999 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9006 cp_error ("declarator-id missing; using reserved word `%D'",
9008 name
= IDENTIFIER_POINTER (dname
);
9010 if (! IDENTIFIER_OPNAME_P (dname
)
9011 /* GNU/Linux headers use '__op'. Arrgh. */
9012 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9013 name
= IDENTIFIER_POINTER (dname
);
9016 if (IDENTIFIER_TYPENAME_P (dname
))
9018 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9019 flags
= TYPENAME_FLAG
;
9020 ctor_return_type
= TREE_TYPE (dname
);
9021 return_type
= return_conversion
;
9023 name
= operator_name_string (dname
);
9030 /* Perform error checking, and decide on a ctype. */
9031 tree cname
= TREE_OPERAND (decl
, 0);
9032 if (cname
== NULL_TREE
)
9034 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9037 in_namespace
= TREE_OPERAND (decl
, 0);
9038 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9040 else if (! is_aggr_type (cname
, 1))
9041 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9042 /* Must test TREE_OPERAND (decl, 1), in case user gives
9043 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9044 else if (TREE_OPERAND (decl
, 1)
9045 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9047 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9048 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9050 cp_error ("`%T::%D' is not a valid declarator", cname
,
9051 TREE_OPERAND (decl
, 1));
9052 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9053 cname
, TREE_OPERAND (decl
, 1));
9054 return void_type_node
;
9056 else if (ctype
== NULL_TREE
)
9058 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9059 TREE_OPERAND (decl
, 0) = ctype
;
9062 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9064 cp_error ("type `%T' is not derived from type `%T'",
9066 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9072 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9073 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9074 == constructor_name_full (ctype
))
9075 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9076 == constructor_name (ctype
))))
9077 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9078 next
= &TREE_OPERAND (decl
, 1);
9082 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9083 && constructor_name (ctype
) == decl
)
9085 return_type
= return_ctor
;
9086 ctor_return_type
= ctype
;
9088 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9089 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9090 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9091 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9093 return_type
= return_dtor
;
9094 ctor_return_type
= ctype
;
9096 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9097 next
= &TREE_OPERAND (decl
, 0);
9108 /* Parse error puts this typespec where
9109 a declarator should go. */
9110 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9111 if (TREE_TYPE (decl
) == current_class_type
)
9112 cp_error (" perhaps you want `%T' for a constructor",
9113 current_class_name
);
9114 dname
= DECL_NAME (decl
);
9115 name
= IDENTIFIER_POINTER (dname
);
9117 /* Avoid giving two errors for this. */
9118 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9120 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9127 cp_compiler_error ("`%D' as declarator", decl
);
9128 return 0; /* We used to do a 155 abort here. */
9135 /* A function definition's declarator must have the form of
9136 a function declarator. */
9138 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9141 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9142 && innermost_code
!= CALL_EXPR
9143 && ! (ctype
&& declspecs
== NULL_TREE
))
9145 cp_error ("declaration of `%D' as non-function", dname
);
9146 return void_type_node
;
9149 /* Anything declared one level down from the top level
9150 must be one of the parameters of a function
9151 (because the body is at least two levels down). */
9153 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9154 by not allowing C++ class definitions to specify their parameters
9155 with xdecls (must be spec.d in the parmlist).
9157 Since we now wait to push a class scope until we are sure that
9158 we are in a legitimate method context, we must set oldcname
9159 explicitly (since current_class_name is not yet alive).
9161 We also want to avoid calling this a PARM if it is in a namespace. */
9163 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9165 struct binding_level
*b
= current_binding_level
;
9166 current_binding_level
= b
->level_chain
;
9167 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9168 decl_context
= PARM
;
9169 current_binding_level
= b
;
9172 /* Look through the decl specs and record which ones appear.
9173 Some typespecs are defined as built-in typenames.
9174 Others, the ones that are modifiers of other types,
9175 are represented by bits in SPECBITS: set the bits for
9176 the modifiers that appear. Storage class keywords are also in SPECBITS.
9178 If there is a typedef name or a type, store the type in TYPE.
9179 This includes builtin typedefs such as `int'.
9181 Set EXPLICIT_INT if the type is `int' or `char' and did not
9182 come from a user typedef.
9184 Set LONGLONG if `long' is mentioned twice.
9186 For C++, constructors and destructors have their own fast treatment. */
9188 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9193 /* Certain parse errors slip through. For example,
9194 `int class;' is not caught by the parser. Try
9195 weakly to recover here. */
9196 if (TREE_CODE (spec
) != TREE_LIST
)
9199 id
= TREE_VALUE (spec
);
9201 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9203 if (id
== ridpointers
[(int) RID_INT
]
9204 || id
== ridpointers
[(int) RID_CHAR
]
9205 || id
== ridpointers
[(int) RID_BOOL
]
9206 || id
== ridpointers
[(int) RID_WCHAR
])
9210 if (id
== ridpointers
[(int) RID_BOOL
])
9211 error ("`bool' is now a keyword");
9213 cp_error ("extraneous `%T' ignored", id
);
9217 if (id
== ridpointers
[(int) RID_INT
])
9219 else if (id
== ridpointers
[(int) RID_CHAR
])
9221 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9225 /* C++ aggregate types. */
9226 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9229 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9231 type
= IDENTIFIER_TYPE_VALUE (id
);
9235 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9237 if (ridpointers
[i
] == id
)
9239 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9241 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9242 pedwarn ("ANSI C++ does not support `long long'");
9244 error ("`long long long' is too long for GCC");
9248 else if (RIDBIT_SETP (i
, specbits
))
9249 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9250 RIDBIT_SET (i
, specbits
);
9255 /* C++ aggregate types. */
9256 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9259 cp_error ("multiple declarations `%T' and `%T'", type
,
9263 type
= TREE_TYPE (id
);
9264 TREE_VALUE (spec
) = type
;
9269 error ("two or more data types in declaration of `%s'", name
);
9270 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9272 register tree t
= lookup_name (id
, 1);
9273 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9274 error ("`%s' fails to be a typedef or built in type",
9275 IDENTIFIER_POINTER (id
));
9278 type
= TREE_TYPE (t
);
9280 /* See the code below that used this. */
9281 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9286 else if (id
!= error_mark_node
)
9287 /* Can't change CLASS nodes into RECORD nodes here! */
9293 typedef_type
= type
;
9295 /* No type at all: default to `int', and set DEFAULTED_INT
9296 because it was not a user-defined typedef. */
9298 if (type
== NULL_TREE
9299 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9300 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9301 || RIDBIT_SETP (RID_LONG
, specbits
)
9302 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9304 /* These imply 'int'. */
9305 type
= integer_type_node
;
9309 if (type
== NULL_TREE
)
9312 if (return_type
== return_dtor
)
9313 type
= void_type_node
;
9314 else if (return_type
== return_ctor
)
9315 type
= build_pointer_type (ctor_return_type
);
9316 else if (return_type
== return_conversion
)
9317 type
= ctor_return_type
;
9320 /* We handle `main' specially here, because 'main () { }' is so
9321 common. With no options, it is allowed. With -Wreturn-type,
9322 it is a warning. It is only an error with -pedantic-errors. */
9323 int is_main
= (funcdef_flag
9324 && MAIN_NAME_P (dname
)
9325 && ctype
== NULL_TREE
9326 && in_namespace
== NULL_TREE
9327 && current_namespace
== global_namespace
);
9329 if (in_system_header
|| flag_ms_extensions
)
9330 /* Allow it, sigh. */;
9331 else if (pedantic
|| ! is_main
)
9332 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9334 else if (warn_return_type
)
9335 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9338 type
= integer_type_node
;
9341 else if (return_type
== return_dtor
)
9343 error ("return type specification for destructor invalid");
9344 type
= void_type_node
;
9346 else if (return_type
== return_ctor
)
9348 error ("return type specification for constructor invalid");
9349 type
= build_pointer_type (ctor_return_type
);
9351 else if (return_type
== return_conversion
)
9353 if (!same_type_p (type
, ctor_return_type
))
9354 cp_error ("operator `%T' declared to return `%T'",
9355 ctor_return_type
, type
);
9357 cp_pedwarn ("return type specified for `operator %T'",
9360 type
= ctor_return_type
;
9365 /* Now process the modifiers that were specified
9366 and check for invalid combinations. */
9368 /* Long double is a special combination. */
9370 if (RIDBIT_SETP (RID_LONG
, specbits
)
9371 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9373 RIDBIT_RESET (RID_LONG
, specbits
);
9374 type
= build_qualified_type (long_double_type_node
,
9375 CP_TYPE_QUALS (type
));
9378 /* Check all other uses of type modifiers. */
9380 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9381 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9382 || RIDBIT_SETP (RID_LONG
, specbits
)
9383 || RIDBIT_SETP (RID_SHORT
, specbits
))
9387 if (TREE_CODE (type
) == REAL_TYPE
)
9388 error ("short, signed or unsigned invalid for `%s'", name
);
9389 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9390 error ("long, short, signed or unsigned invalid for `%s'", name
);
9391 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9392 && RIDBIT_SETP (RID_SHORT
, specbits
))
9393 error ("long and short specified together for `%s'", name
);
9394 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9395 || RIDBIT_SETP (RID_SHORT
, specbits
))
9397 error ("long or short specified with char for `%s'", name
);
9398 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9399 || RIDBIT_SETP (RID_SHORT
, specbits
))
9400 && TREE_CODE (type
) == REAL_TYPE
)
9401 error ("long or short specified with floating type for `%s'", name
);
9402 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9403 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9404 error ("signed and unsigned given together for `%s'", name
);
9408 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9410 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9412 if (flag_pedantic_errors
)
9417 /* Discard the type modifiers if they are invalid. */
9420 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9421 RIDBIT_RESET (RID_SIGNED
, specbits
);
9422 RIDBIT_RESET (RID_LONG
, specbits
);
9423 RIDBIT_RESET (RID_SHORT
, specbits
);
9428 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9429 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9431 error ("complex invalid for `%s'", name
);
9432 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9435 /* Decide whether an integer type is signed or not.
9436 Optionally treat bitfields as signed by default. */
9437 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9440 It is implementation-defined whether a plain (neither
9441 explicitly signed or unsigned) char, short, int, or long
9442 bit-field is signed or unsigned.
9444 Naturally, we extend this to long long as well. Note that
9445 this does not include wchar_t. */
9446 || (bitfield
&& !flag_signed_bitfields
9447 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9448 /* A typedef for plain `int' without `signed' can be
9449 controlled just like plain `int', but a typedef for
9450 `signed int' cannot be so controlled. */
9452 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9453 && (TREE_CODE (type
) == INTEGER_TYPE
9454 || TREE_CODE (type
) == CHAR_TYPE
)
9455 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9458 type
= long_long_unsigned_type_node
;
9459 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9460 type
= long_unsigned_type_node
;
9461 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9462 type
= short_unsigned_type_node
;
9463 else if (type
== char_type_node
)
9464 type
= unsigned_char_type_node
;
9465 else if (typedef_decl
)
9466 type
= unsigned_type (type
);
9468 type
= unsigned_type_node
;
9470 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9471 && type
== char_type_node
)
9472 type
= signed_char_type_node
;
9474 type
= long_long_integer_type_node
;
9475 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9476 type
= long_integer_type_node
;
9477 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9478 type
= short_integer_type_node
;
9480 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9482 /* If we just have "complex", it is equivalent to
9483 "complex double", but if any modifiers at all are specified it is
9484 the complex form of TYPE. E.g, "complex short" is
9485 "complex short int". */
9487 if (defaulted_int
&& ! longlong
9488 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9489 || RIDBIT_SETP (RID_SHORT
, specbits
)
9490 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9491 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9492 type
= complex_double_type_node
;
9493 else if (type
== integer_type_node
)
9494 type
= complex_integer_type_node
;
9495 else if (type
== float_type_node
)
9496 type
= complex_float_type_node
;
9497 else if (type
== double_type_node
)
9498 type
= complex_double_type_node
;
9499 else if (type
== long_double_type_node
)
9500 type
= complex_long_double_type_node
;
9502 type
= build_complex_type (type
);
9505 if (return_type
== return_conversion
9506 && (RIDBIT_SETP (RID_CONST
, specbits
)
9507 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9508 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9509 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9512 /* Set CONSTP if this declaration is `const', whether by
9513 explicit specification or via a typedef.
9514 Likewise for VOLATILEP. */
9516 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9518 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9520 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9521 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9522 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9523 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9524 type
= cp_build_qualified_type (type
, type_quals
);
9526 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9527 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9528 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9529 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9530 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9532 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9533 staticp
= 1 + (decl_context
== FIELD
);
9535 if (virtualp
&& staticp
== 2)
9537 cp_error ("member `%D' cannot be declared both virtual and static",
9541 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9542 RIDBIT_RESET (RID_FRIEND
, specbits
);
9544 /* $7.1.2, Function specifiers */
9545 if (friendp
&& explicitp
)
9546 error ("only declarations of constructors can be `explicit'");
9548 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9550 if (decl_context
== PARM
)
9552 error ("non-member `%s' cannot be declared `mutable'", name
);
9553 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9555 else if (friendp
|| decl_context
== TYPENAME
)
9557 error ("non-object member `%s' cannot be declared `mutable'", name
);
9558 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9562 /* Warn if two storage classes are given. Default to `auto'. */
9564 if (RIDBIT_ANY_SET (specbits
))
9566 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9567 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9568 if (decl_context
== PARM
&& nclasses
> 0)
9569 error ("storage class specifiers invalid in parameter declarations");
9570 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9572 if (decl_context
== PARM
)
9573 error ("typedef declaration invalid in parameter declaration");
9576 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9577 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9580 /* Give error if `virtual' is used outside of class declaration. */
9582 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9584 error ("virtual outside class declaration");
9587 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9589 error ("only members can be declared mutable");
9590 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9593 /* Static anonymous unions are dealt with here. */
9594 if (staticp
&& decl_context
== TYPENAME
9595 && TREE_CODE (declspecs
) == TREE_LIST
9596 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9597 decl_context
= FIELD
;
9599 /* Warn about storage classes that are invalid for certain
9600 kinds of declarations (parameters, typenames, etc.). */
9603 error ("multiple storage classes in declaration of `%s'", name
);
9604 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9606 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9607 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9608 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9610 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9612 else if (decl_context
== FIELD
9613 /* C++ allows static class elements */
9614 && RIDBIT_SETP (RID_STATIC
, specbits
))
9615 /* C++ also allows inlines and signed and unsigned elements,
9616 but in those cases we don't come in here. */
9620 if (decl_context
== FIELD
)
9622 tree tmp
= NULL_TREE
;
9623 register int op
= 0;
9627 /* Avoid trying to get an operand off an identifier node. */
9628 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9631 tmp
= TREE_OPERAND (declarator
, 0);
9632 op
= IDENTIFIER_OPNAME_P (tmp
);
9634 error ("storage class specified for %s `%s'",
9635 op
? "member operator" : "field",
9636 op
? operator_name_string (tmp
) : name
);
9639 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9640 ? "storage class specified for parameter `%s'"
9641 : "storage class specified for typename"), name
);
9642 RIDBIT_RESET (RID_REGISTER
, specbits
);
9643 RIDBIT_RESET (RID_AUTO
, specbits
);
9644 RIDBIT_RESET (RID_EXTERN
, specbits
);
9647 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9649 if (toplevel_bindings_p ())
9651 /* It's common practice (and completely valid) to have a const
9652 be initialized and declared extern. */
9653 if (!(type_quals
& TYPE_QUAL_CONST
))
9654 warning ("`%s' initialized and declared `extern'", name
);
9657 error ("`%s' has both `extern' and initializer", name
);
9659 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9660 && ! toplevel_bindings_p ())
9661 error ("nested function `%s' declared `extern'", name
);
9662 else if (toplevel_bindings_p ())
9664 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9665 error ("top-level declaration of `%s' specifies `auto'", name
);
9668 if (nclasses
> 0 && friendp
)
9669 error ("storage class specifiers invalid in friend function declarations");
9671 /* Now figure out the structure of the declarator proper.
9672 Descend through it, creating more complex types, until we reach
9673 the declared identifier (or NULL_TREE, in an absolute declarator). */
9675 inner_attrs
= NULL_TREE
;
9678 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9679 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9681 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9682 an INDIRECT_REF (for *...),
9683 a CALL_EXPR (for ...(...)),
9684 an identifier (for the name being declared)
9685 or a null pointer (for the place in an absolute declarator
9686 where the name was omitted).
9687 For the last two cases, we have just exited the loop.
9689 For C++ it could also be
9690 a SCOPE_REF (for class :: ...). In this case, we have converted
9691 sensible names to types, and those are the values we use to
9692 qualify the member name.
9693 an ADDR_EXPR (for &...),
9694 a BIT_NOT_EXPR (for destructors)
9696 At this point, TYPE is the type of elements of an array,
9697 or for a function to return, or for a pointer to point to.
9698 After this sequence of ifs, TYPE is the type of the
9699 array or function or pointer, and DECLARATOR has had its
9700 outermost layer removed. */
9702 if (type
== error_mark_node
)
9704 if (TREE_CODE (declarator
) == SCOPE_REF
)
9705 declarator
= TREE_OPERAND (declarator
, 1);
9707 declarator
= TREE_OPERAND (declarator
, 0);
9710 if (quals
!= NULL_TREE
9711 && (declarator
== NULL_TREE
9712 || TREE_CODE (declarator
) != SCOPE_REF
))
9714 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9715 ctype
= TYPE_METHOD_BASETYPE (type
);
9716 if (ctype
!= NULL_TREE
)
9718 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9719 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9720 type
= TREE_TYPE (dummy
);
9725 /* See the comment for the TREE_LIST case, below. */
9728 else if (inner_attrs
)
9730 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9731 inner_attrs
= NULL_TREE
;
9734 switch (TREE_CODE (declarator
))
9738 /* We encode a declarator with embedded attributes using
9739 a TREE_LIST. The attributes apply to the declarator
9740 directly inside them, so we have to skip an iteration
9741 before applying them to the type. If the declarator just
9742 inside is the declarator-id, we apply the attrs to the
9744 inner_attrs
= TREE_PURPOSE (declarator
);
9746 declarator
= TREE_VALUE (declarator
);
9752 register tree itype
= NULL_TREE
;
9753 register tree size
= TREE_OPERAND (declarator
, 1);
9754 /* The index is a signed object `sizetype' bits wide. */
9755 tree index_type
= signed_type (sizetype
);
9757 declarator
= TREE_OPERAND (declarator
, 0);
9759 /* Check for some types that there cannot be arrays of. */
9761 if (TREE_CODE (type
) == VOID_TYPE
)
9763 cp_error ("declaration of `%D' as array of voids", dname
);
9764 type
= error_mark_node
;
9767 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9769 cp_error ("declaration of `%D' as array of functions", dname
);
9770 type
= error_mark_node
;
9773 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9774 you can't have arrays of references. If we allowed them,
9775 then we'd be saying x[i] is valid for an array x, but
9776 then you'd have to ask: what does `*(x + i)' mean? */
9777 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9779 if (decl_context
== TYPENAME
)
9780 cp_error ("cannot make arrays of references");
9782 cp_error ("declaration of `%D' as array of references",
9784 type
= error_mark_node
;
9787 if (TREE_CODE (type
) == OFFSET_TYPE
)
9789 cp_error ("declaration of `%D' as array of data members",
9791 type
= error_mark_node
;
9794 if (TREE_CODE (type
) == METHOD_TYPE
)
9796 cp_error ("declaration of `%D' as array of function members",
9798 type
= error_mark_node
;
9801 if (size
== error_mark_node
)
9802 type
= error_mark_node
;
9803 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9807 the constant expressions that specify the bounds of
9808 the arrays can be omitted only for the first member
9810 cp_error ("declaration of `%D' as multidimensional array",
9812 cp_error ("must have bounds for all dimensions except the first");
9813 type
= error_mark_node
;
9816 if (type
== error_mark_node
)
9819 /* VC++ spells a zero-sized array with []. */
9820 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9821 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9822 size
= integer_zero_node
;
9826 /* Must suspend_momentary here because the index
9827 type may need to live until the end of the function.
9828 For example, it is used in the declaration of a
9829 variable which requires destructing at the end of
9830 the function; then build_vec_delete will need this
9832 int yes
= suspend_momentary ();
9833 /* Might be a cast. */
9834 if (TREE_CODE (size
) == NOP_EXPR
9835 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9836 size
= TREE_OPERAND (size
, 0);
9837 if (TREE_READONLY_DECL_P (size
))
9838 size
= decl_constant_value (size
);
9840 /* If this involves a template parameter, it will be a
9841 constant at instantiation time, but we don't know
9842 what the value is yet. Even if no template
9843 parameters are involved, we may an expression that
9844 is not a constant; we don't even simplify `1 + 2'
9845 when processing a template. */
9846 if (processing_template_decl
)
9848 /* Resolve a qualified reference to an enumerator or
9849 static const data member of ours. */
9850 if (TREE_CODE (size
) == SCOPE_REF
9851 && TREE_OPERAND (size
, 0) == current_class_type
)
9853 tree t
= lookup_field (current_class_type
,
9854 TREE_OPERAND (size
, 1), 0, 0);
9859 itype
= build_index_type (build_min
9860 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
9861 goto dont_grok_size
;
9864 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9865 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9866 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9868 cp_error ("size of array `%D' has non-integer type",
9870 size
= integer_one_node
;
9872 if (pedantic
&& integer_zerop (size
))
9873 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9874 if (TREE_CONSTANT (size
))
9876 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9877 int old_pedantic
= pedantic
;
9878 pedantic
= flag_pedantic_errors
= 1;
9879 /* Always give overflow errors on array subscripts. */
9880 constant_expression_warning (size
);
9881 pedantic
= old_pedantic
;
9882 flag_pedantic_errors
= old_flag_pedantic_errors
;
9883 if (INT_CST_LT (size
, integer_zero_node
))
9885 cp_error ("size of array `%D' is negative", dname
);
9886 size
= integer_one_node
;
9894 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9897 cp_pedwarn ("ANSI C++ forbids variable-size array");
9902 = fold (build_binary_op (MINUS_EXPR
,
9903 cp_convert (index_type
, size
),
9904 cp_convert (index_type
,
9905 integer_one_node
)));
9906 if (! TREE_CONSTANT (itype
))
9907 itype
= variable_size (itype
);
9908 else if (TREE_OVERFLOW (itype
))
9910 error ("overflow in array dimension");
9911 TREE_OVERFLOW (itype
) = 0;
9914 itype
= build_index_type (itype
);
9917 resume_momentary (yes
);
9920 type
= build_cplus_array_type (type
, itype
);
9929 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9930 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9932 /* Declaring a function type.
9933 Make sure we have a valid type for the function to return. */
9935 /* We now know that the TYPE_QUALS don't apply to the
9936 decl, but to its return type. */
9937 type_quals
= TYPE_UNQUALIFIED
;
9939 /* Warn about some types functions can't return. */
9941 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9943 error ("`%s' declared as function returning a function", name
);
9944 type
= integer_type_node
;
9946 if (TREE_CODE (type
) == ARRAY_TYPE
)
9948 error ("`%s' declared as function returning an array", name
);
9949 type
= integer_type_node
;
9952 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9953 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9955 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9958 /* Pick up type qualifiers which should be applied to `this'. */
9959 quals
= CALL_DECLARATOR_QUALS (declarator
);
9961 /* Pick up the exception specifications. */
9962 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
9964 /* Say it's a definition only for the CALL_EXPR
9965 closest to the identifier. */
9968 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9969 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9970 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9972 if (ctype
== NULL_TREE
9973 && decl_context
== FIELD
9975 && (friendp
== 0 || dname
== current_class_name
))
9976 ctype
= current_class_type
;
9978 if (ctype
&& return_type
== return_conversion
)
9979 TYPE_HAS_CONVERSION (ctype
) = 1;
9980 if (ctype
&& constructor_name (ctype
) == dname
)
9982 /* We are within a class's scope. If our declarator name
9983 is the same as the class name, and we are defining
9984 a function, then it is a constructor/destructor, and
9985 therefore returns a void type. */
9987 if (flags
== DTOR_FLAG
)
9989 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9990 not be declared const or volatile. A destructor
9991 may not be static. */
9993 error ("destructor cannot be static member function");
9996 cp_error ("destructors may not be `%s'",
9997 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10000 if (decl_context
== FIELD
)
10002 if (! member_function_or_else (ctype
, current_class_type
,
10003 "destructor for alien class `%s' cannot be a member"))
10004 return void_type_node
;
10007 else /* It's a constructor. */
10009 if (explicitp
== 1)
10011 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10012 not be declared const or volatile. A constructor may
10013 not be virtual. A constructor may not be static. */
10015 error ("constructor cannot be static member function");
10018 pedwarn ("constructors cannot be declared virtual");
10023 cp_error ("constructors may not be `%s'",
10024 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10028 RID_BIT_TYPE tmp_bits
;
10029 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10030 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10031 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10032 if (RIDBIT_ANY_SET (tmp_bits
))
10033 error ("return value type specifier for constructor ignored");
10035 type
= build_pointer_type (ctype
);
10036 if (decl_context
== FIELD
)
10038 if (! member_function_or_else (ctype
, current_class_type
,
10039 "constructor for alien class `%s' cannot be member"))
10040 return void_type_node
;
10041 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10042 if (return_type
!= return_ctor
)
10046 if (decl_context
== FIELD
)
10052 error ("can't initialize friend function `%s'", name
);
10055 /* Cannot be both friend and virtual. */
10056 error ("virtual functions cannot be friends");
10057 RIDBIT_RESET (RID_FRIEND
, specbits
);
10060 if (decl_context
== NORMAL
)
10061 error ("friend declaration not in class definition");
10062 if (current_function_decl
&& funcdef_flag
)
10063 cp_error ("can't define friend function `%s' in a local class definition",
10067 /* Construct the function type and go to the next
10068 inner layer of declarator. */
10070 declarator
= TREE_OPERAND (declarator
, 0);
10072 /* FIXME: This is where default args should be fully
10075 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10077 if (declarator
&& flags
== DTOR_FLAG
)
10079 /* A destructor declared in the body of a class will
10080 be represented as a BIT_NOT_EXPR. But, we just
10081 want the underlying IDENTIFIER. */
10082 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10083 declarator
= TREE_OPERAND (declarator
, 0);
10085 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10086 arg_types
= void_list_node
;
10087 else if (arg_types
== NULL_TREE
10088 || arg_types
!= void_list_node
)
10090 cp_error ("destructors may not have parameters");
10091 arg_types
= void_list_node
;
10092 last_function_parms
= NULL_TREE
;
10096 /* ANSI says that `const int foo ();'
10097 does not make the function foo const. */
10098 type
= build_function_type (type
, arg_types
);
10102 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10103 if (TREE_PURPOSE (t
)
10104 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10106 add_defarg_fn (type
);
10115 /* Filter out pointers-to-references and references-to-references.
10116 We can get these if a TYPE_DECL is used. */
10118 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10120 error ("cannot declare %s to references",
10121 TREE_CODE (declarator
) == ADDR_EXPR
10122 ? "references" : "pointers");
10123 declarator
= TREE_OPERAND (declarator
, 0);
10127 if (TREE_CODE (type
) == OFFSET_TYPE
10128 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10129 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10131 cp_error ("cannot declare pointer to `%#T' member",
10133 type
= TREE_TYPE (type
);
10136 /* Merge any constancy or volatility into the target type
10137 for the pointer. */
10139 /* We now know that the TYPE_QUALS don't apply to the decl,
10140 but to the target of the pointer. */
10141 type_quals
= TYPE_UNQUALIFIED
;
10143 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10145 if (TREE_CODE (type
) == VOID_TYPE
)
10146 error ("invalid type: `void &'");
10148 type
= build_reference_type (type
);
10150 else if (TREE_CODE (type
) == METHOD_TYPE
)
10151 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10153 type
= build_pointer_type (type
);
10155 /* Process a list of type modifier keywords (such as
10156 const or volatile) that were given inside the `*' or `&'. */
10158 if (TREE_TYPE (declarator
))
10160 register tree typemodlist
;
10166 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10167 typemodlist
= TREE_CHAIN (typemodlist
))
10169 tree qualifier
= TREE_VALUE (typemodlist
);
10171 if (qualifier
== ridpointers
[(int) RID_CONST
])
10173 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10175 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10180 error ("invalid type modifier within pointer declarator");
10184 pedwarn ("duplicate `const'");
10186 pedwarn ("duplicate `volatile'");
10188 pedwarn ("duplicate `restrict'");
10190 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10191 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10192 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10193 if (TREE_CODE (declarator
) == ADDR_EXPR
10194 && (constp
|| volatilep
))
10197 pedwarn ("discarding `const' applied to a reference");
10199 pedwarn ("discarding `volatile' applied to a reference");
10200 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10202 type
= cp_build_qualified_type (type
, type_quals
);
10204 declarator
= TREE_OPERAND (declarator
, 0);
10210 /* We have converted type names to NULL_TREE if the
10211 name was bogus, or to a _TYPE node, if not.
10213 The variable CTYPE holds the type we will ultimately
10214 resolve to. The code here just needs to build
10215 up appropriate member types. */
10216 tree sname
= TREE_OPERAND (declarator
, 1);
10219 /* Destructors can have their visibilities changed as well. */
10220 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10221 sname
= TREE_OPERAND (sname
, 0);
10223 if (TREE_COMPLEXITY (declarator
) == 0)
10224 /* This needs to be here, in case we are called
10225 multiple times. */ ;
10226 else if (TREE_COMPLEXITY (declarator
) == -1)
10227 /* Namespace member. */
10228 pop_decl_namespace ();
10229 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10230 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10231 else if (! IS_AGGR_TYPE_CODE
10232 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10234 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10236 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10237 that refer to ctype. They couldn't be resolved earlier
10238 because we hadn't pushed into the class yet.
10239 Example: resolve 'B<T>::type' in
10240 'B<typename B<T>::type> B<T>::f () { }'. */
10241 if (current_template_parms
10242 && uses_template_parms (type
)
10243 && uses_template_parms (current_class_type
))
10245 tree args
= current_template_args ();
10246 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10249 /* This pop_nested_class corresponds to the
10250 push_nested_class used to push into class scope for
10251 parsing the argument list of a function decl, in
10253 pop_nested_class ();
10254 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10257 my_friendly_abort (16);
10259 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10261 /* We had a reference to a global decl, or
10262 perhaps we were given a non-aggregate typedef,
10263 in which case we cleared this out, and should just
10264 keep going as though it wasn't there. */
10265 declarator
= sname
;
10268 ctype
= TREE_OPERAND (declarator
, 0);
10271 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10273 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10274 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10275 template_count
+= 1;
10276 t
= TYPE_MAIN_DECL (t
);
10277 if (DECL_LANG_SPECIFIC (t
))
10278 t
= DECL_CLASS_CONTEXT (t
);
10283 if (sname
== NULL_TREE
)
10286 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10288 /* This is the `standard' use of the scoping operator:
10289 basetype :: member . */
10291 if (ctype
== current_class_type
)
10297 Is this ill-formed? */
10300 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10303 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10305 if (current_class_type
== NULL_TREE
10307 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10308 TYPE_ARG_TYPES (type
));
10311 cp_error ("cannot declare member function `%T::%s' within `%T'",
10312 ctype
, name
, current_class_type
);
10313 return void_type_node
;
10316 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10317 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10319 /* Have to move this code elsewhere in this function.
10320 this code is used for i.e., typedef int A::M; M *pm;
10322 It is? How? jason 10/2/94 */
10324 if (current_class_type
)
10326 cp_error ("cannot declare member `%T::%s' within `%T'",
10327 ctype
, name
, current_class_type
);
10328 return void_type_node
;
10330 type
= build_offset_type (ctype
, type
);
10332 else if (uses_template_parms (ctype
))
10334 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10336 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10337 TYPE_ARG_TYPES (type
));
10341 cp_error ("structure `%T' not yet defined", ctype
);
10342 return error_mark_node
;
10345 declarator
= sname
;
10347 else if (TREE_CODE (sname
) == SCOPE_REF
)
10348 my_friendly_abort (17);
10352 declarator
= TREE_OPERAND (declarator
, 1);
10353 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10354 /* In this case, we will deal with it later. */
10358 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10359 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10360 TYPE_ARG_TYPES (type
));
10362 type
= build_offset_type (ctype
, type
);
10369 declarator
= TREE_OPERAND (declarator
, 0);
10374 case ENUMERAL_TYPE
:
10375 declarator
= NULL_TREE
;
10379 declarator
= NULL_TREE
;
10383 my_friendly_abort (158);
10387 /* See the comment for the TREE_LIST case, above. */
10390 if (! ignore_attrs
)
10391 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10393 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10395 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10398 /* Now TYPE has the actual type. */
10400 if (explicitp
== 1)
10402 error ("only constructors can be declared `explicit'");
10406 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10408 if (type_quals
& TYPE_QUAL_CONST
)
10410 error ("const `%s' cannot be declared `mutable'", name
);
10411 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10415 error ("static `%s' cannot be declared `mutable'", name
);
10416 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10420 if (declarator
== NULL_TREE
10421 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10422 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10423 && (TREE_CODE (type
) == FUNCTION_TYPE
10424 || TREE_CODE (type
) == METHOD_TYPE
)))
10426 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10428 cp_error ("template-id `%D' used as a declarator", declarator
);
10429 declarator
= dname
;
10432 /* Unexpected declarator format. */
10433 my_friendly_abort (990210);
10435 /* If this is declaring a typedef name, return a TYPE_DECL. */
10437 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10441 /* Note that the grammar rejects storage classes
10442 in typenames, fields or parameters. */
10443 if (current_lang_name
== lang_name_java
)
10444 TYPE_FOR_JAVA (type
) = 1;
10446 if (decl_context
== FIELD
)
10448 if (declarator
== constructor_name (current_class_type
))
10449 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10451 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10455 /* Make sure this typedef lives as long as its type,
10456 since it might be used as a template parameter. */
10457 if (type
!= error_mark_node
)
10458 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10459 if (processing_template_decl
)
10460 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10462 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10463 if (type
!= error_mark_node
)
10467 /* If the user declares "typedef struct {...} foo" then the
10468 struct will have an anonymous name. Fill that name in now.
10469 Nothing can refer to it, so nothing needs know about the name
10471 if (type
!= error_mark_node
10472 && TYPE_NAME (type
)
10473 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10474 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10475 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10477 tree oldname
= TYPE_NAME (type
);
10480 /* Replace the anonymous name with the real name everywhere. */
10481 lookup_tag_reverse (type
, declarator
);
10482 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10483 if (TYPE_NAME (t
) == oldname
)
10484 TYPE_NAME (t
) = decl
;
10486 if (TYPE_LANG_SPECIFIC (type
))
10487 TYPE_WAS_ANONYMOUS (type
) = 1;
10489 /* If this is a typedef within a template class, the nested
10490 type is a (non-primary) template. The name for the
10491 template needs updating as well. */
10492 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10493 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10494 = TYPE_IDENTIFIER (type
);
10496 /* XXX Temporarily set the scope.
10497 When returning, start_decl expects it as NULL_TREE,
10498 and will then then set it using pushdecl. */
10499 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10500 if (current_class_type
)
10501 DECL_CONTEXT (decl
) = current_class_type
;
10503 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10505 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10506 DECL_ASSEMBLER_NAME (decl
)
10507 = get_identifier (build_overload_name (type
, 1, 1));
10508 DECL_CONTEXT (decl
) = NULL_TREE
;
10510 /* FIXME remangle member functions; member functions of a
10511 type with external linkage have external linkage. */
10514 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10516 cp_error_at ("typedef name may not be class-qualified", decl
);
10521 if (ctype
== NULL_TREE
)
10523 if (TREE_CODE (type
) != METHOD_TYPE
)
10524 cp_error_at ("invalid type qualifier for non-method type", decl
);
10526 ctype
= TYPE_METHOD_BASETYPE (type
);
10528 if (ctype
!= NULL_TREE
)
10529 grok_method_quals (ctype
, decl
, quals
);
10532 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10533 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10534 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10536 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10537 error ("non-object member `%s' cannot be declared mutable", name
);
10539 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10540 inlinep
, friendp
, raises
!= NULL_TREE
);
10543 error ("typedef declaration includes an initializer");
10548 /* Detect the case of an array type of unspecified size
10549 which came, as such, direct from a typedef name.
10550 We must copy the type, so that each identifier gets
10551 a distinct type, so that each identifier's size can be
10552 controlled separately by its own initializer. */
10554 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10555 && TYPE_DOMAIN (type
) == NULL_TREE
)
10557 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10560 /* If this is a type name (such as, in a cast or sizeof),
10561 compute the type and return it now. */
10563 if (decl_context
== TYPENAME
)
10565 /* Note that the grammar rejects storage classes
10566 in typenames, fields or parameters. */
10567 if (type_quals
!= TYPE_UNQUALIFIED
)
10568 type_quals
= TYPE_UNQUALIFIED
;
10570 /* Special case: "friend class foo" looks like a TYPENAME context. */
10573 if (type_quals
!= TYPE_UNQUALIFIED
)
10575 cp_error ("type qualifiers specified for friend class declaration");
10576 type_quals
= TYPE_UNQUALIFIED
;
10580 cp_error ("`inline' specified for friend class declaration");
10584 /* Only try to do this stuff if we didn't already give up. */
10585 if (type
!= integer_type_node
)
10587 /* A friendly class? */
10588 if (current_class_type
)
10589 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10591 error ("trying to make class `%s' a friend of global scope",
10592 TYPE_NAME_STRING (type
));
10593 type
= void_type_node
;
10598 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10599 if (ctype
== NULL_TREE
)
10601 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10602 ctype
= TYPE_METHOD_BASETYPE (type
);
10604 grok_method_quals (ctype
, dummy
, quals
);
10605 type
= TREE_TYPE (dummy
);
10610 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10611 && decl_context
!= CATCHPARM
10612 && TREE_CODE (type
) != UNION_TYPE
10615 cp_error ("abstract declarator `%T' used as declaration", type
);
10616 declarator
= make_anon_name ();
10619 /* `void' at top level (not within pointer)
10620 is allowed only in typedefs or type names.
10621 We don't complain about parms either, but that is because
10622 a better error message can be made later. */
10624 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10627 error ("unnamed variable or field declared void");
10628 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10630 if (IDENTIFIER_OPNAME_P (declarator
))
10631 my_friendly_abort (356);
10633 error ("variable or field `%s' declared void", name
);
10636 error ("variable or field declared void");
10637 type
= integer_type_node
;
10640 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10641 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10643 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10645 if (ctype
|| in_namespace
)
10646 error ("cannot use `::' in parameter declaration");
10648 /* A parameter declared as an array of T is really a pointer to T.
10649 One declared as a function is really a pointer to a function.
10650 One declared as a member is really a pointer to member. */
10652 if (TREE_CODE (type
) == ARRAY_TYPE
)
10654 /* Transfer const-ness of array into that of type pointed to. */
10655 type
= build_pointer_type (TREE_TYPE (type
));
10656 type_quals
= TYPE_UNQUALIFIED
;
10658 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10659 type
= build_pointer_type (type
);
10660 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10661 type
= build_pointer_type (type
);
10662 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10664 error ("declaration of `%s' as void", name
);
10670 register tree decl
;
10672 if (decl_context
== PARM
)
10674 decl
= build_decl (PARM_DECL
, declarator
, type
);
10676 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10677 inlinep
, friendp
, raises
!= NULL_TREE
);
10679 /* Compute the type actually passed in the parmlist,
10680 for the case where there is no prototype.
10681 (For example, shorts and chars are passed as ints.)
10682 When there is a prototype, this is overridden later. */
10684 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10686 else if (decl_context
== FIELD
)
10688 if (type
== error_mark_node
)
10690 /* Happens when declaring arrays of sizes which
10691 are error_mark_node, for example. */
10694 else if (in_namespace
&& !friendp
)
10696 /* Something like struct S { int N::j; }; */
10697 cp_error ("invalid use of `::'");
10700 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10703 tree function_context
;
10705 /* We catch the others as conflicts with the builtin
10707 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10709 cp_error ("function `%D' cannot be declared friend",
10716 if (ctype
== NULL_TREE
)
10717 ctype
= current_class_type
;
10719 if (ctype
== NULL_TREE
)
10721 cp_error ("can't make `%D' into a method -- not in a class",
10723 return void_type_node
;
10726 /* ``A union may [ ... ] not [ have ] virtual functions.''
10728 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10730 cp_error ("function `%D' declared virtual inside a union",
10732 return void_type_node
;
10735 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10736 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10737 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10738 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10742 cp_error ("`%D' cannot be declared virtual, since it is always static",
10747 else if (staticp
< 2)
10748 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10749 TYPE_ARG_TYPES (type
));
10752 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10753 function_context
= (ctype
!= NULL_TREE
) ?
10754 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10755 publicp
= (! friendp
|| ! staticp
)
10756 && function_context
== NULL_TREE
;
10757 decl
= grokfndecl (ctype
, type
,
10758 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10759 ? declarator
: dname
,
10761 virtualp
, flags
, quals
, raises
,
10762 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10763 funcdef_flag
, template_count
, in_namespace
);
10764 if (decl
== NULL_TREE
)
10767 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10768 /* The decl and setting of decl_machine_attr is also turned off. */
10769 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10772 /* [class.conv.ctor]
10774 A constructor declared without the function-specifier
10775 explicit that can be called with a single parameter
10776 specifies a conversion from the type of its first
10777 parameter to the type of its class. Such a constructor
10778 is called a converting constructor. */
10779 if (explicitp
== 2)
10780 DECL_NONCONVERTING_P (decl
) = 1;
10781 else if (DECL_CONSTRUCTOR_P (decl
))
10783 /* The constructor can be called with exactly one
10784 parameter if there is at least one parameter, and
10785 any subsequent parameters have default arguments.
10786 We don't look at the first parameter, which is
10787 really just the `this' parameter for the new
10790 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10792 /* Skip the `in_chrg' argument too, if present. */
10793 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10794 arg_types
= TREE_CHAIN (arg_types
);
10796 if (arg_types
== void_list_node
10798 && TREE_CHAIN (arg_types
)
10799 && TREE_CHAIN (arg_types
) != void_list_node
10800 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10801 DECL_NONCONVERTING_P (decl
) = 1;
10804 else if (TREE_CODE (type
) == METHOD_TYPE
)
10806 /* We only get here for friend declarations of
10807 members of other classes. */
10808 /* All method decls are public, so tell grokfndecl to set
10809 TREE_PUBLIC, also. */
10810 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10811 virtualp
, flags
, quals
, raises
,
10812 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10813 template_count
, in_namespace
);
10814 if (decl
== NULL_TREE
)
10817 else if (!staticp
&& ! processing_template_decl
10818 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10819 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10822 cp_error ("field `%D' has incomplete type", declarator
);
10824 cp_error ("name `%T' has incomplete type", type
);
10826 /* If we're instantiating a template, tell them which
10827 instantiation made the field's type be incomplete. */
10828 if (current_class_type
10829 && TYPE_NAME (current_class_type
)
10830 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10831 && declspecs
&& TREE_VALUE (declspecs
)
10832 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10833 cp_error (" in instantiation of template `%T'",
10834 current_class_type
);
10836 type
= error_mark_node
;
10843 error ("`%s' is neither function nor method; cannot be declared friend",
10844 IDENTIFIER_POINTER (declarator
));
10852 /* Friends are treated specially. */
10853 if (ctype
== current_class_type
)
10854 warning ("member functions are implicitly friends of their class");
10857 tree t
= NULL_TREE
;
10858 if (decl
&& DECL_NAME (decl
))
10860 if (template_class_depth (current_class_type
) == 0)
10863 = check_explicit_specialization
10865 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10866 if (decl
== error_mark_node
)
10867 return error_mark_node
;
10870 t
= do_friend (ctype
, declarator
, decl
,
10871 last_function_parms
, attrlist
, flags
, quals
,
10874 if (t
&& funcdef_flag
)
10877 return void_type_node
;
10881 /* Structure field. It may not be a function, except for C++ */
10883 if (decl
== NULL_TREE
)
10889 /* An attempt is being made to initialize a non-static
10890 member. But, from [class.mem]:
10892 4 A member-declarator can contain a
10893 constant-initializer only if it declares a static
10894 member (_class.static_) of integral or enumeration
10895 type, see _class.static.data_.
10897 This used to be relatively common practice, but
10898 the rest of the compiler does not correctly
10899 handle the initialization unless the member is
10900 static so we make it static below. */
10901 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10903 cp_pedwarn ("making `%D' static", declarator
);
10907 if (uses_template_parms (type
))
10908 /* We'll check at instantiation time. */
10910 else if (check_static_variable_definition (declarator
,
10912 /* If we just return the declaration, crashes
10913 will sometimes occur. We therefore return
10914 void_type_node, as if this was a friend
10915 declaration, to cause callers to completely
10916 ignore this declaration. */
10917 return void_type_node
;
10920 /* 9.2p13 [class.mem] */
10921 if (declarator
== constructor_name (current_class_type
)
10922 /* Divergence from the standard: In extern "C", we
10923 allow non-static data members here, because C does
10924 and /usr/include/netinet/in.h uses that. */
10925 && (staticp
|| ! in_system_header
))
10926 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10931 /* C++ allows static class members. All other work
10932 for this is done by grokfield. */
10933 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10934 TREE_STATIC (decl
) = 1;
10935 /* In class context, 'static' means public access. */
10936 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10940 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10941 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10943 DECL_MUTABLE_P (decl
) = 1;
10944 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10948 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10949 inlinep
, friendp
, raises
!= NULL_TREE
);
10952 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10954 tree original_name
;
10960 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10961 original_name
= dname
;
10963 original_name
= declarator
;
10965 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10966 error ("storage class `auto' invalid for function `%s'", name
);
10967 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10968 error ("storage class `register' invalid for function `%s'", name
);
10970 /* Function declaration not at top level.
10971 Storage classes other than `extern' are not allowed
10972 and `extern' makes no difference. */
10973 if (! toplevel_bindings_p ()
10974 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10975 || RIDBIT_SETP (RID_INLINE
, specbits
))
10978 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10979 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
10981 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
10984 if (ctype
== NULL_TREE
)
10988 error ("virtual non-class function `%s'", name
);
10992 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
10993 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10994 TYPE_ARG_TYPES (type
));
10996 /* Record presence of `static'. */
10997 publicp
= (ctype
!= NULL_TREE
10998 || RIDBIT_SETP (RID_EXTERN
, specbits
)
10999 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11001 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11002 virtualp
, flags
, quals
, raises
,
11004 publicp
, inlinep
, funcdef_flag
,
11005 template_count
, in_namespace
);
11006 if (decl
== NULL_TREE
)
11011 int illegal_static
= 0;
11013 /* Don't allow a static member function in a class, and forbid
11014 declaring main to be static. */
11015 if (TREE_CODE (type
) == METHOD_TYPE
)
11017 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11018 illegal_static
= 1;
11020 else if (current_function_decl
)
11022 /* FIXME need arm citation */
11023 error ("cannot declare static function inside another function");
11024 illegal_static
= 1;
11027 if (illegal_static
)
11030 RIDBIT_RESET (RID_STATIC
, specbits
);
11036 /* It's a variable. */
11038 /* An uninitialized decl with `extern' is a reference. */
11039 decl
= grokvardecl (type
, declarator
, &specbits
,
11041 (type_quals
& TYPE_QUAL_CONST
) != 0,
11043 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11044 inlinep
, friendp
, raises
!= NULL_TREE
);
11048 DECL_CONTEXT (decl
) = ctype
;
11051 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11053 RIDBIT_RESET (RID_STATIC
, specbits
);
11055 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11057 cp_error ("static member `%D' declared `register'", decl
);
11058 RIDBIT_RESET (RID_REGISTER
, specbits
);
11060 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11062 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11064 RIDBIT_RESET (RID_EXTERN
, specbits
);
11069 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11071 error ("`%s' cannot be declared mutable", name
);
11074 /* Record `register' declaration for warnings on &
11075 and in case doing stupid register allocation. */
11077 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11078 DECL_REGISTER (decl
) = 1;
11080 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11081 DECL_THIS_EXTERN (decl
) = 1;
11083 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11084 DECL_THIS_STATIC (decl
) = 1;
11086 /* Record constancy and volatility. There's no need to do this
11087 when processing a template; we'll do this for the instantiated
11088 declaration based on the type of DECL. */
11089 if (!processing_template_decl
)
11090 c_apply_type_quals_to_decl (type_quals
, decl
);
11096 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11097 An empty exprlist is a parmlist. An exprlist which
11098 contains only identifiers at the global level
11099 is a parmlist. Otherwise, it is an exprlist. */
11102 parmlist_is_exprlist (exprs
)
11105 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11108 if (toplevel_bindings_p ())
11110 /* At the global level, if these are all identifiers,
11111 then it is a parmlist. */
11114 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11116 exprs
= TREE_CHAIN (exprs
);
11123 /* Subroutine of start_function. Ensure that each of the parameter
11124 types (as listed in PARMS) is complete, as is required for a
11125 function definition. */
11128 require_complete_types_for_parms (parms
)
11133 tree type
= TREE_TYPE (parms
);
11134 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11136 if (DECL_NAME (parms
))
11137 error ("parameter `%s' has incomplete type",
11138 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11140 error ("parameter has incomplete type");
11141 TREE_TYPE (parms
) = error_mark_node
;
11144 layout_decl (parms
, 0);
11146 parms
= TREE_CHAIN (parms
);
11150 /* Returns DECL if DECL is a local variable (or parameter). Returns
11151 NULL_TREE otherwise. */
11154 local_variable_p (t
)
11157 if ((TREE_CODE (t
) == VAR_DECL
11158 /* A VAR_DECL with a context that is a _TYPE is a static data
11160 && !TYPE_P (CP_DECL_CONTEXT (t
))
11161 /* Any other non-local variable must be at namespace scope. */
11162 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11163 || (TREE_CODE (t
) == PARM_DECL
))
11169 /* Check that ARG, which is a default-argument expression for a
11170 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11171 something goes wrong. DECL may also be a _TYPE node, rather than a
11172 DECL, if there is no DECL available. */
11175 check_default_argument (decl
, arg
)
11182 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11183 /* We get a DEFAULT_ARG when looking at an in-class declaration
11184 with a default argument. Ignore the argument for now; we'll
11185 deal with it after the class is complete. */
11188 if (processing_template_decl
|| uses_template_parms (arg
))
11189 /* We don't do anything checking until instantiation-time. Note
11190 that there may be uninstantiated arguments even for an
11191 instantiated function, since default arguments are not
11192 instantiated until they are needed. */
11201 decl_type
= TREE_TYPE (decl
);
11203 if (arg
== error_mark_node
11204 || decl
== error_mark_node
11205 || TREE_TYPE (arg
) == error_mark_node
11206 || decl_type
== error_mark_node
)
11207 /* Something already went wrong. There's no need to check
11209 return error_mark_node
;
11211 /* [dcl.fct.default]
11213 A default argument expression is implicitly converted to the
11215 if (!TREE_TYPE (arg
)
11216 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11219 cp_error ("default argument for `%#D' has type `%T'",
11220 decl
, TREE_TYPE (arg
));
11222 cp_error ("default argument for parameter of type `%T' has type `%T'",
11223 decl_type
, TREE_TYPE (arg
));
11225 return error_mark_node
;
11228 /* [dcl.fct.default]
11230 Local variables shall not be used in default argument
11233 The keyword `this' shall not be used in a default argument of a
11234 member function. */
11235 var
= search_tree (arg
, local_variable_p
);
11238 cp_error ("default argument `%E' uses local variable `%D'",
11240 return error_mark_node
;
11247 /* Decode the list of parameter types for a function type.
11248 Given the list of things declared inside the parens,
11249 return a list of types.
11251 The list we receive can have three kinds of elements:
11252 an IDENTIFIER_NODE for names given without types,
11253 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11254 or void_type_node, to mark the end of an argument list
11255 when additional arguments are not permitted (... was not used).
11257 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11258 a mere declaration. A nonempty identifier-list gets an error message
11259 when FUNCDEF_FLAG is zero.
11260 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11261 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11263 If all elements of the input list contain types,
11264 we return a list of the types.
11265 If all elements contain no type (except perhaps a void_type_node
11266 at the end), we return a null list.
11267 If some have types and some do not, it is an error, and we
11268 return a null list.
11270 Also set last_function_parms to either
11271 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11272 A list of names is converted to a chain of PARM_DECLs
11273 by store_parm_decls so that ultimately it is always a chain of decls.
11275 Note that in C++, parameters can take default values. These default
11276 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11277 an error to specify default values which are followed by parameters
11278 that have no default values, or an ELLIPSES. For simplicities sake,
11279 only parameters which are specified with their types can take on
11283 grokparms (first_parm
, funcdef_flag
)
11287 tree result
= NULL_TREE
;
11288 tree decls
= NULL_TREE
;
11290 if (first_parm
!= NULL_TREE
11291 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11293 if (! funcdef_flag
)
11294 pedwarn ("parameter names (without types) in function declaration");
11295 last_function_parms
= first_parm
;
11298 else if (first_parm
!= NULL_TREE
11299 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11300 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11301 my_friendly_abort (145);
11304 /* Types were specified. This is a list of declarators
11305 each represented as a TREE_LIST node. */
11306 register tree parm
, chain
;
11307 int any_init
= 0, any_error
= 0;
11309 if (first_parm
!= NULL_TREE
)
11311 tree last_result
= NULL_TREE
;
11312 tree last_decl
= NULL_TREE
;
11314 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11316 tree type
= NULL_TREE
, list_node
= parm
;
11317 register tree decl
= TREE_VALUE (parm
);
11318 tree init
= TREE_PURPOSE (parm
);
11320 chain
= TREE_CHAIN (parm
);
11321 /* @@ weak defense against parse errors. */
11322 if (TREE_CODE (decl
) != VOID_TYPE
11323 && TREE_CODE (decl
) != TREE_LIST
)
11325 /* Give various messages as the need arises. */
11326 if (TREE_CODE (decl
) == STRING_CST
)
11327 cp_error ("invalid string constant `%E'", decl
);
11328 else if (TREE_CODE (decl
) == INTEGER_CST
)
11329 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11333 if (TREE_CODE (decl
) != VOID_TYPE
)
11335 decl
= grokdeclarator (TREE_VALUE (decl
),
11336 TREE_PURPOSE (decl
),
11337 PARM
, init
!= NULL_TREE
,
11339 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11342 /* Top-level qualifiers on the parameters are
11343 ignored for function types. */
11344 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11346 if (TREE_CODE (type
) == VOID_TYPE
)
11347 decl
= void_type_node
;
11348 else if (TREE_CODE (type
) == METHOD_TYPE
)
11350 if (DECL_NAME (decl
))
11351 /* Cannot use the decl here because
11352 we don't have DECL_CONTEXT set up yet. */
11353 cp_error ("parameter `%D' invalidly declared method type",
11356 error ("parameter invalidly declared method type");
11357 type
= build_pointer_type (type
);
11358 TREE_TYPE (decl
) = type
;
11360 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11362 if (DECL_NAME (decl
))
11363 cp_error ("parameter `%D' invalidly declared offset type",
11366 error ("parameter invalidly declared offset type");
11367 type
= build_pointer_type (type
);
11368 TREE_TYPE (decl
) = type
;
11370 else if (abstract_virtuals_error (decl
, type
))
11371 any_error
= 1; /* Seems like a good idea. */
11372 else if (POINTER_TYPE_P (type
))
11375 while (POINTER_TYPE_P (t
)
11376 || (TREE_CODE (t
) == ARRAY_TYPE
11377 && TYPE_DOMAIN (t
) != NULL_TREE
))
11379 if (TREE_CODE (t
) == ARRAY_TYPE
)
11380 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11382 TYPE_PTR_P (type
) ? "pointer" : "reference");
11386 if (TREE_CODE (decl
) == VOID_TYPE
)
11388 if (result
== NULL_TREE
)
11390 result
= void_list_node
;
11391 last_result
= result
;
11395 TREE_CHAIN (last_result
) = void_list_node
;
11396 last_result
= void_list_node
;
11399 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11400 error ("`void' in parameter list must be entire list");
11404 /* Since there is a prototype, args are passed in their own types. */
11405 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11406 if (PROMOTE_PROTOTYPES
11407 && (TREE_CODE (type
) == INTEGER_TYPE
11408 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11409 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11410 DECL_ARG_TYPE (decl
) = integer_type_node
;
11411 if (!any_error
&& init
)
11414 init
= check_default_argument (decl
, init
);
11419 if (decls
== NULL_TREE
)
11426 TREE_CHAIN (last_decl
) = decl
;
11429 list_node
= tree_cons (init
, type
, NULL_TREE
);
11430 if (result
== NULL_TREE
)
11432 result
= list_node
;
11433 last_result
= result
;
11437 TREE_CHAIN (last_result
) = list_node
;
11438 last_result
= list_node
;
11442 TREE_CHAIN (last_result
) = NULL_TREE
;
11443 /* If there are no parameters, and the function does not end
11444 with `...', then last_decl will be NULL_TREE. */
11445 if (last_decl
!= NULL_TREE
)
11446 TREE_CHAIN (last_decl
) = NULL_TREE
;
11450 last_function_parms
= decls
;
11455 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11456 FUNCTION_TYPE with the newly parsed version of its default argument, which
11457 was previously digested as text. See snarf_defarg et al in lex.c. */
11460 replace_defarg (arg
, init
)
11463 if (! processing_template_decl
11464 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11465 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11466 TREE_TYPE (init
), TREE_VALUE (arg
));
11467 TREE_PURPOSE (arg
) = init
;
11474 tree t
= FUNCTION_ARG_CHAIN (d
);
11475 if (DECL_CONSTRUCTOR_P (d
)
11476 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11477 t
= TREE_CHAIN (t
);
11478 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11479 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11480 == DECL_CLASS_CONTEXT (d
))
11481 && (TREE_CHAIN (t
) == NULL_TREE
11482 || TREE_CHAIN (t
) == void_list_node
11483 || TREE_PURPOSE (TREE_CHAIN (t
))))
11488 /* These memoizing functions keep track of special properties which
11489 a class may have. `grok_ctor_properties' notices whether a class
11490 has a constructor of the form X(X&), and also complains
11491 if the class has a constructor of the form X(X).
11492 `grok_op_properties' takes notice of the various forms of
11493 operator= which are defined, as well as what sorts of type conversion
11494 may apply. Both functions take a FUNCTION_DECL as an argument. */
11497 grok_ctor_properties (ctype
, decl
)
11500 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11501 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11503 /* When a type has virtual baseclasses, a magical first int argument is
11504 added to any ctor so we can tell if the class has been initialized
11505 yet. This could screw things up in this function, so we deliberately
11506 ignore the leading int if we're in that situation. */
11507 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11509 my_friendly_assert (parmtypes
11510 && TREE_VALUE (parmtypes
) == integer_type_node
,
11512 parmtypes
= TREE_CHAIN (parmtypes
);
11513 parmtype
= TREE_VALUE (parmtypes
);
11518 A non-template constructor for class X is a copy constructor if
11519 its first parameter is of type X&, const X&, volatile X& or const
11520 volatile X&, and either there are no other parameters or else all
11521 other parameters have default arguments. */
11522 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11523 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11524 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11525 || TREE_CHAIN (parmtypes
) == void_list_node
11526 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11527 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11528 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11530 TYPE_HAS_INIT_REF (ctype
) = 1;
11531 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11532 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11536 A declaration of a constructor for a class X is ill-formed if its
11537 first parameter is of type (optionally cv-qualified) X and either
11538 there are no other parameters or else all other parameters have
11541 We *don't* complain about member template instantiations that
11542 have this form, though; they can occur as we try to decide what
11543 constructor to use during overload resolution. Since overload
11544 resolution will never prefer such a constructor to the
11545 non-template copy constructor (which is either explicitly or
11546 implicitly defined), there's no need to worry about their
11547 existence. Theoretically, they should never even be
11548 instantiated, but that's hard to forestall. */
11549 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11550 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11551 || TREE_CHAIN (parmtypes
) == void_list_node
11552 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11553 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11554 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11556 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11558 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11561 else if (TREE_CODE (parmtype
) == VOID_TYPE
11562 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11563 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11568 /* An operator with this name can be either unary or binary. */
11574 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11575 || name
== ansi_opname
[(int) ADDR_EXPR
]
11576 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11577 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11578 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11579 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11582 /* An operator with this name can only be unary. */
11588 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11589 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11590 || name
== ansi_opname
[(int) COMPONENT_REF
]
11591 || IDENTIFIER_TYPENAME_P (name
));
11594 /* Do a little sanity-checking on how they declared their operator. */
11597 grok_op_properties (decl
, virtualp
, friendp
)
11599 int virtualp
, friendp
;
11601 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11602 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11603 tree name
= DECL_NAME (decl
);
11605 if (current_class_type
== NULL_TREE
)
11612 A user-declared copy assignment operator X::operator= is a
11613 non-static non-template member function of class X with
11614 exactly one parameter of type X, X&, const X&, volatile X& or
11615 const volatile X&. */
11616 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11617 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11618 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11620 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11621 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11622 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11623 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11624 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11625 || name
== ansi_opname
[(int) MEMBER_REF
])
11626 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11627 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11628 TYPE_GETS_NEW (current_class_type
) |= 1;
11629 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11630 TYPE_GETS_DELETE (current_class_type
) |= 1;
11631 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11632 TYPE_GETS_NEW (current_class_type
) |= 2;
11633 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11634 TYPE_GETS_DELETE (current_class_type
) |= 2;
11637 if (name
== ansi_opname
[(int) NEW_EXPR
]
11638 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11640 /* When the compiler encounters the definition of A::operator new, it
11641 doesn't look at the class declaration to find out if it's static. */
11643 revert_static_member_fn (&decl
, NULL
, NULL
);
11645 /* Take care of function decl if we had syntax errors. */
11646 if (argtypes
== NULL_TREE
)
11648 = build_function_type (ptr_type_node
,
11649 hash_tree_chain (integer_type_node
,
11652 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11654 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11655 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11658 revert_static_member_fn (&decl
, NULL
, NULL
);
11660 if (argtypes
== NULL_TREE
)
11662 = build_function_type (void_type_node
,
11663 hash_tree_chain (ptr_type_node
,
11667 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11669 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11670 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11671 != void_list_node
))
11672 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11677 /* An operator function must either be a non-static member function
11678 or have at least one parameter of a class, a reference to a class,
11679 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11680 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11682 if (IDENTIFIER_TYPENAME_P (name
)
11683 || name
== ansi_opname
[(int) CALL_EXPR
]
11684 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11685 || name
== ansi_opname
[(int) COMPONENT_REF
]
11686 || name
== ansi_opname
[(int) ARRAY_REF
])
11687 cp_error ("`%D' must be a nonstatic member function", decl
);
11692 if (DECL_STATIC_FUNCTION_P (decl
))
11693 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11696 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11698 tree arg
= TREE_VALUE (p
);
11699 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11700 arg
= TREE_TYPE (arg
);
11702 /* This lets bad template code slip through. */
11703 if (IS_AGGR_TYPE (arg
)
11704 || TREE_CODE (arg
) == ENUMERAL_TYPE
11705 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11706 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11710 ("`%D' must have an argument of class or enumerated type",
11717 if (name
== ansi_opname
[(int) CALL_EXPR
])
11718 return; /* No restrictions on args. */
11720 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11722 tree t
= TREE_TYPE (name
);
11723 if (TREE_CODE (t
) == VOID_TYPE
)
11724 pedwarn ("void is not a valid type conversion operator");
11725 else if (! friendp
)
11727 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11728 const char *what
= 0;
11730 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11732 if (t
== current_class_type
)
11733 what
= "the same type";
11734 /* Don't force t to be complete here. */
11735 else if (IS_AGGR_TYPE (t
)
11737 && DERIVED_FROM_P (t
, current_class_type
))
11738 what
= "a base class";
11741 warning ("conversion to %s%s will never use a type conversion operator",
11742 ref
? "a reference to " : "", what
);
11746 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11750 if (list_length (argtypes
) != 3 && methodp
)
11752 cp_error ("`%D' must take exactly one argument", decl
);
11755 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11757 if (copy_assignment_arg_p (parmtype
, virtualp
)
11760 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11761 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11762 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11763 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11766 else if (name
== ansi_opname
[(int) COND_EXPR
])
11769 cp_error ("ANSI C++ prohibits overloading operator ?:");
11771 else if (ambi_op_p (name
))
11773 if (list_length (argtypes
) == 2)
11775 else if (list_length (argtypes
) == 3)
11777 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11778 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11779 && ! processing_template_decl
11780 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11783 cp_error ("postfix `%D' must take `int' as its argument",
11787 ("postfix `%D' must take `int' as its second argument",
11794 cp_error ("`%D' must take either zero or one argument", decl
);
11796 cp_error ("`%D' must take either one or two arguments", decl
);
11799 /* More Effective C++ rule 6. */
11801 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11802 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11804 tree arg
= TREE_VALUE (argtypes
);
11805 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11806 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11807 arg
= TREE_TYPE (arg
);
11808 arg
= TYPE_MAIN_VARIANT (arg
);
11809 if (list_length (argtypes
) == 2)
11811 if (TREE_CODE (ret
) != REFERENCE_TYPE
11812 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11814 cp_warning ("prefix `%D' should return `%T'", decl
,
11815 build_reference_type (arg
));
11819 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11820 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11824 else if (unary_op_p (name
))
11826 if (list_length (argtypes
) != 2)
11829 cp_error ("`%D' must take `void'", decl
);
11831 cp_error ("`%D' must take exactly one argument", decl
);
11834 else /* if (binary_op_p (name)) */
11836 if (list_length (argtypes
) != 3)
11839 cp_error ("`%D' must take exactly one argument", decl
);
11841 cp_error ("`%D' must take exactly two arguments", decl
);
11844 /* More Effective C++ rule 7. */
11846 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11847 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11848 || name
== ansi_opname
[COMPOUND_EXPR
]))
11849 cp_warning ("user-defined `%D' always evaluates both arguments",
11853 /* Effective C++ rule 23. */
11855 && list_length (argtypes
) == 3
11856 && (name
== ansi_opname
[PLUS_EXPR
]
11857 || name
== ansi_opname
[MINUS_EXPR
]
11858 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11859 || name
== ansi_opname
[MULT_EXPR
])
11860 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11861 cp_warning ("`%D' should return by value", decl
);
11865 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11866 if (TREE_PURPOSE (argtypes
))
11868 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11869 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11870 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11873 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11876 cp_error ("`%D' cannot have default arguments", decl
);
11881 static const char *
11883 enum tag_types code
;
11896 my_friendly_abort (981122);
11900 /* Get the struct, enum or union (CODE says which) with tag NAME.
11901 Define the tag as a forward-reference if it is not defined.
11903 C++: If a class derivation is given, process it here, and report
11904 an error if multiple derivation declarations are not identical.
11906 If this is a definition, come in through xref_tag and only look in
11907 the current frame for the name (since C++ allows new names in any
11911 xref_tag (code_type_node
, name
, globalize
)
11912 tree code_type_node
;
11916 enum tag_types tag_code
;
11917 enum tree_code code
;
11919 register tree ref
, t
;
11920 struct binding_level
*b
= current_binding_level
;
11922 tree attributes
= NULL_TREE
;
11923 tree context
= NULL_TREE
;
11925 /* If we are called from the parser, code_type_node will sometimes be a
11926 TREE_LIST. This indicates that the user wrote
11927 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11929 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11931 attributes
= TREE_PURPOSE (code_type_node
);
11932 code_type_node
= TREE_VALUE (code_type_node
);
11935 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11940 code
= RECORD_TYPE
;
11946 code
= ENUMERAL_TYPE
;
11949 my_friendly_abort (18);
11952 /* If a cross reference is requested, look up the type
11953 already defined for this tag and return it. */
11954 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11957 name
= TYPE_IDENTIFIER (t
);
11961 t
= IDENTIFIER_TYPE_VALUE (name
);
11963 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11964 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11969 /* If we know we are defining this tag, only look it up in
11970 this scope and don't try to find it as a type. */
11971 ref
= lookup_tag (code
, name
, b
, 1);
11977 /* [dcl.type.elab] If the identifier resolves to a
11978 typedef-name or a template type-parameter, the
11979 elaborated-type-specifier is ill-formed. */
11980 if (t
!= TYPE_MAIN_VARIANT (t
)
11981 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
11982 cp_pedwarn ("using typedef-name `%D' after `%s'",
11983 TYPE_NAME (t
), tag_name (tag_code
));
11984 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
11985 cp_error ("using template type parameter `%T' after `%s'",
11986 t
, tag_name (tag_code
));
11991 ref
= lookup_tag (code
, name
, b
, 0);
11995 /* Try finding it as a type declaration. If that wins,
11997 ref
= lookup_name (name
, 1);
11999 if (ref
!= NULL_TREE
12000 && processing_template_decl
12001 && DECL_CLASS_TEMPLATE_P (ref
)
12002 && template_class_depth (current_class_type
) == 0)
12003 /* Since GLOBALIZE is true, we're declaring a global
12004 template, so we want this type. */
12005 ref
= DECL_RESULT (ref
);
12007 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12008 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12009 ref
= TREE_TYPE (ref
);
12014 if (ref
&& current_class_type
12015 && template_class_depth (current_class_type
)
12016 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12018 /* Since GLOBALIZE is non-zero, we are not looking at a
12019 definition of this tag. Since, in addition, we are currently
12020 processing a (member) template declaration of a template
12021 class, we must be very careful; consider:
12028 { template <class V>
12029 friend struct S1; };
12031 Here, the S2::S1 declaration should not be confused with the
12032 outer declaration. In particular, the inner version should
12033 have a template parameter of level 2, not level 1. This
12034 would be particularly important if the member declaration
12037 template <class V = U> friend struct S1;
12039 say, when we should tsubst into `U' when instantiating
12040 S2. On the other hand, when presented with:
12050 we must find the inner binding eventually. We
12051 accomplish this by making sure that the new type we
12052 create to represent this declaration has the right
12054 context
= TYPE_CONTEXT (ref
);
12059 push_obstacks_nochange ();
12063 /* If no such tag is yet defined, create a forward-reference node
12064 and record it as the "definition".
12065 When a real declaration of this type is found,
12066 the forward-reference will be altered into a real type. */
12068 /* In C++, since these migrate into the global scope, we must
12069 build them on the permanent obstack. */
12071 temp
= allocation_temporary_p ();
12073 end_temporary_allocation ();
12075 if (code
== ENUMERAL_TYPE
)
12077 cp_error ("use of enum `%#D' without previous declaration", name
);
12079 ref
= make_node (ENUMERAL_TYPE
);
12081 /* Give the type a default layout like unsigned int
12082 to avoid crashing if it does not get defined. */
12083 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12084 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12085 TREE_UNSIGNED (ref
) = 1;
12086 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12087 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12088 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12090 /* Enable us to recognize when a type is created in class context.
12091 To do nested classes correctly, this should probably be cleared
12092 out when we leave this classes scope. Currently this in only
12093 done in `start_enum'. */
12095 pushtag (name
, ref
, globalize
);
12099 struct binding_level
*old_b
= class_binding_level
;
12101 ref
= make_lang_type (code
);
12102 TYPE_CONTEXT (ref
) = context
;
12104 #ifdef NONNESTED_CLASSES
12105 /* Class types don't nest the way enums do. */
12106 class_binding_level
= (struct binding_level
*)0;
12108 pushtag (name
, ref
, globalize
);
12109 class_binding_level
= old_b
;
12114 /* If it no longer looks like a nested type, make sure it's
12116 If it is not an IDENTIFIER, this is not a declaration */
12117 if (b
->namespace_p
&& !class_binding_level
12118 && TREE_CODE (name
) == IDENTIFIER_NODE
)
12120 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12121 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12124 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12125 redeclare_class_template (ref
, current_template_parms
);
12128 /* Until the type is defined, tentatively accept whatever
12129 structure tag the user hands us. */
12130 if (TYPE_SIZE (ref
) == NULL_TREE
12131 && ref
!= current_class_type
12132 /* Have to check this, in case we have contradictory tag info. */
12133 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12135 if (tag_code
== class_type
)
12136 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12137 else if (tag_code
== record_type
)
12138 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12143 TREE_TYPE (ref
) = attributes
;
12149 xref_tag_from_type (old
, id
, globalize
)
12153 tree code_type_node
;
12155 if (TREE_CODE (old
) == RECORD_TYPE
)
12156 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12157 ? class_type_node
: record_type_node
);
12159 code_type_node
= union_type_node
;
12161 if (id
== NULL_TREE
)
12162 id
= TYPE_IDENTIFIER (old
);
12164 return xref_tag (code_type_node
, id
, globalize
);
12167 /* REF is a type (named NAME), for which we have just seen some
12168 baseclasses. BINFO is a list of those baseclasses; the
12169 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12170 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12171 struct, or union. */
12174 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12175 tree code_type_node
;
12179 /* In the declaration `A : X, Y, ... Z' we mark all the types
12180 (A, X, Y, ..., Z) so we can check for duplicates. */
12185 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12187 if (tag_code
== union_type
)
12189 cp_error ("derived union `%T' invalid", ref
);
12193 len
= list_length (binfo
);
12194 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12196 /* First, make sure that any templates in base-classes are
12197 instantiated. This ensures that if we call ourselves recursively
12198 we do not get confused about which classes are marked and which
12200 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12201 complete_type (TREE_VALUE (base
));
12203 SET_CLASSTYPE_MARKED (ref
);
12204 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12206 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12208 /* The base of a derived struct is public by default. */
12210 = (TREE_PURPOSE (binfo
) == access_public_node
12211 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12212 || (tag_code
!= class_type
12213 && (TREE_PURPOSE (binfo
) == access_default_node
12214 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12216 = (TREE_PURPOSE (binfo
) == access_protected_node
12217 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12219 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12220 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12221 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12222 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12223 tree basetype
= TREE_VALUE (binfo
);
12226 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12227 basetype
= TREE_TYPE (basetype
);
12229 || (TREE_CODE (basetype
) != RECORD_TYPE
12230 && TREE_CODE (basetype
) != TYPENAME_TYPE
12231 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12232 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12234 cp_error ("base type `%T' fails to be a struct or class type",
12235 TREE_VALUE (binfo
));
12239 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12241 /* This code replaces similar code in layout_basetypes.
12242 We put the complete_type first for implicit `typename'. */
12243 if (TYPE_SIZE (basetype
) == NULL_TREE
12244 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12246 cp_error ("base class `%T' has incomplete type", basetype
);
12251 if (CLASSTYPE_MARKED (basetype
))
12253 if (basetype
== ref
)
12254 cp_error ("recursive type `%T' undefined", basetype
);
12256 cp_error ("duplicate base type `%T' invalid", basetype
);
12260 if (TYPE_FOR_JAVA (basetype
)
12261 && (current_lang_stack
12262 == &VARRAY_TREE (current_lang_base
, 0)))
12263 TYPE_FOR_JAVA (ref
) = 1;
12265 /* Note that the BINFO records which describe individual
12266 inheritances are *not* shared in the lattice! They
12267 cannot be shared because a given baseclass may be
12268 inherited with different `accessibility' by different
12269 derived classes. (Each BINFO record describing an
12270 individual inheritance contains flags which say what
12271 the `accessibility' of that particular inheritance is.) */
12274 = make_binfo (integer_zero_node
, basetype
,
12275 CLASS_TYPE_P (basetype
)
12276 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12277 CLASS_TYPE_P (basetype
)
12278 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12280 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12281 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12282 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12283 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12284 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12286 /* We need to unshare the binfos now so that lookups during class
12287 definition work. */
12288 unshare_base_binfos (base_binfo
);
12290 SET_CLASSTYPE_MARKED (basetype
);
12292 /* We are free to modify these bits because they are meaningless
12293 at top level, and BASETYPE is a top-level type. */
12294 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12296 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12297 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12300 if (CLASS_TYPE_P (basetype
))
12302 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12303 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12310 TREE_VEC_LENGTH (binfos
) = i
;
12312 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12315 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12318 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12320 if (CLASS_TYPE_P (basetype
))
12321 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12322 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12325 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12326 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12328 /* Unmark all the types. */
12330 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12331 CLEAR_CLASSTYPE_MARKED (ref
);
12333 /* Now that we know all the base-classes, set up the list of virtual
12335 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12341 /* Begin compiling the definition of an enumeration type.
12342 NAME is its name (or null if anonymous).
12343 Returns the type object, as yet incomplete.
12344 Also records info about it so that build_enumerator
12345 may be used to declare the individual values as they are read. */
12351 register tree enumtype
= NULL_TREE
;
12352 struct binding_level
*b
= current_binding_level
;
12354 /* We are wasting space here and putting these on the permanent_obstack so
12355 that typeid(local enum) will work correctly. */
12356 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12358 /* If this is the real definition for a previous forward reference,
12359 fill in the contents in the same object that used to be the
12360 forward reference. */
12362 if (name
!= NULL_TREE
)
12363 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12365 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12367 cp_error ("multiple definition of `%#T'", enumtype
);
12368 cp_error_at ("previous definition here", enumtype
);
12372 enumtype
= make_node (ENUMERAL_TYPE
);
12373 pushtag (name
, enumtype
, 0);
12376 if (current_class_type
)
12377 TREE_ADDRESSABLE (b
->tags
) = 1;
12379 /* We don't copy this value because build_enumerator needs to do it. */
12380 enum_next_value
= integer_zero_node
;
12383 GNU_xref_decl (current_function_decl
, enumtype
);
12387 /* After processing and defining all the values of an enumeration type,
12388 install their decls in the enumeration type and finish it off.
12389 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12390 Returns ENUMTYPE. */
12393 finish_enum (enumtype
)
12396 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12397 /* Calculate the maximum value of any enumerator in this type. */
12399 tree values
= TYPE_VALUES (enumtype
);
12404 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12409 /* The TREE_VALUE is a CONST_DECL for this enumeration
12411 decl
= TREE_VALUE (pair
);
12413 /* The DECL_INITIAL will be NULL if we are processing a
12414 template declaration and this enumeration constant had no
12415 explicit initializer. */
12416 value
= DECL_INITIAL (decl
);
12417 if (value
&& !processing_template_decl
)
12419 /* Set the TREE_TYPE for the VALUE as well. That's so
12420 that when we call decl_constant_value we get an
12421 entity of the right type (but with the constant
12422 value). Since we shouldn't ever call
12423 decl_constant_value on a template type, there's no
12424 reason to do that when processing_template_decl.
12425 And, if the expression is something like a
12426 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12427 wreak havoc on the intended type of the expression.
12429 Of course, there's also no point in trying to compute
12430 minimum or maximum values if we're in a template. */
12431 TREE_TYPE (value
) = enumtype
;
12434 minnode
= maxnode
= value
;
12435 else if (tree_int_cst_lt (maxnode
, value
))
12437 else if (tree_int_cst_lt (value
, minnode
))
12441 if (processing_template_decl
)
12442 /* If this is just a template, leave the CONST_DECL
12443 alone. That way tsubst_copy will find CONST_DECLs for
12444 CONST_DECLs, and not INTEGER_CSTs. */
12447 /* In the list we're building up, we want the enumeration
12448 values, not the CONST_DECLs. */
12449 TREE_VALUE (pair
) = value
;
12453 maxnode
= minnode
= integer_zero_node
;
12455 TYPE_VALUES (enumtype
) = nreverse (values
);
12457 if (processing_template_decl
)
12459 tree scope
= current_scope ();
12460 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12461 add_tree (build_min (TAG_DEFN
, enumtype
));
12465 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12466 int lowprec
= min_precision (minnode
, unsignedp
);
12467 int highprec
= min_precision (maxnode
, unsignedp
);
12468 int precision
= MAX (lowprec
, highprec
);
12471 TYPE_SIZE (enumtype
) = NULL_TREE
;
12473 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12475 TYPE_PRECISION (enumtype
) = precision
;
12477 fixup_unsigned_type (enumtype
);
12479 fixup_signed_type (enumtype
);
12481 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12482 /* Use the width of the narrowest normal C type which is wide
12484 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12487 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12489 TYPE_SIZE (enumtype
) = 0;
12490 layout_type (enumtype
);
12492 /* Fix up all variant types of this enum type. */
12493 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12494 tem
= TYPE_NEXT_VARIANT (tem
))
12496 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12497 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12498 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12499 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12500 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12501 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12502 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12503 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12504 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12507 /* Finish debugging output for this type. */
12508 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12511 /* In start_enum we pushed obstacks. Here, we must pop them. */
12517 /* Build and install a CONST_DECL for an enumeration constant of the
12518 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12519 Assignment of sequential values by default is handled here. */
12522 build_enumerator (name
, value
, type
)
12530 /* Remove no-op casts from the value. */
12532 STRIP_TYPE_NOPS (value
);
12534 if (! processing_template_decl
)
12536 /* Validate and default VALUE. */
12537 if (value
!= NULL_TREE
)
12539 if (TREE_READONLY_DECL_P (value
))
12540 value
= decl_constant_value (value
);
12542 if (TREE_CODE (value
) == INTEGER_CST
)
12544 value
= default_conversion (value
);
12545 constant_expression_warning (value
);
12549 cp_error ("enumerator value for `%D' not integer constant", name
);
12554 /* Default based on previous value. */
12555 if (value
== NULL_TREE
&& ! processing_template_decl
)
12557 value
= enum_next_value
;
12559 cp_error ("overflow in enumeration values at `%D'", name
);
12562 /* Remove no-op casts from the value. */
12564 STRIP_TYPE_NOPS (value
);
12566 /* To fix MAX_VAL enum consts. (bkoz) */
12567 TREE_TYPE (value
) = integer_type_node
;
12571 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12572 Even in other cases, we will later (in finish_enum) be setting the
12574 if (value
!= NULL_TREE
)
12575 value
= copy_node (value
);
12577 /* C++ associates enums with global, function, or class declarations. */
12579 context
= current_scope ();
12580 if (context
&& context
== current_class_type
)
12581 /* This enum declaration is local to the class. */
12582 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12584 /* It's a global enum, or it's local to a function. (Note local to
12585 a function could mean local to a class method. */
12586 decl
= build_decl (CONST_DECL
, name
, type
);
12588 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12589 DECL_INITIAL (decl
) = value
;
12590 TREE_READONLY (decl
) = 1;
12592 if (context
&& context
== current_class_type
)
12593 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12594 on the TYPE_FIELDS list for `S'. (That's so that you can say
12595 things like `S::i' later.) */
12596 finish_member_declaration (decl
);
12600 GNU_xref_decl (current_function_decl
, decl
);
12603 if (! processing_template_decl
)
12605 /* Set basis for default for next value. */
12606 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12607 integer_one_node
, PLUS_EXPR
);
12608 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12611 result
= tree_cons (name
, decl
, NULL_TREE
);
12616 static int function_depth
;
12618 /* We're defining DECL. Make sure that it's type is OK. */
12621 check_function_type (decl
)
12624 tree fntype
= TREE_TYPE (decl
);
12626 /* In a function definition, arg types must be complete. */
12627 require_complete_types_for_parms (current_function_parms
);
12629 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12631 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12633 /* Make it return void instead, but don't change the
12634 type of the DECL_RESULT, in case we have a named return value. */
12635 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12637 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12639 = build_cplus_method_type (ctype
,
12641 FUNCTION_ARG_CHAIN (decl
));
12645 = build_function_type (void_type_node
,
12646 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12648 = build_exception_variant (fntype
,
12649 TYPE_RAISES_EXCEPTIONS (fntype
));
12652 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12655 /* Create the FUNCTION_DECL for a function definition.
12656 DECLSPECS and DECLARATOR are the parts of the declaration;
12657 they describe the function's name and the type it returns,
12658 but twisted together in a fashion that parallels the syntax of C.
12660 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12661 DECLARATOR is really the DECL for the function we are about to
12662 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12663 indicating that the function is an inline defined in-class, and
12664 SF_EXPAND indicating that we should generate RTL for this
12667 This function creates a binding context for the function body
12668 as well as setting up the FUNCTION_DECL in current_function_decl.
12670 Returns 1 on success. If the DECLARATOR is not suitable for a function
12671 (it defines a datum instead), we return 0, which tells
12672 yyparse to report a parse error.
12674 For C++, we must first check whether that datum makes any sense.
12675 For example, "class A local_a(1,2);" means that variable local_a
12676 is an aggregate of type A, which should have a constructor
12677 applied to it with the argument list [1, 2]. */
12680 start_function (declspecs
, declarator
, attrs
, flags
)
12681 tree declspecs
, declarator
, attrs
;
12685 tree ctype
= NULL_TREE
;
12688 extern int have_extern_spec
;
12689 extern int used_extern_spec
;
12690 int doing_friend
= 0;
12691 struct binding_level
*bl
;
12693 /* Sanity check. */
12694 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12695 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12697 /* This should only be done once on the top most decl. */
12698 if (have_extern_spec
&& !used_extern_spec
)
12700 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12701 used_extern_spec
= 1;
12704 if (flags
& SF_PRE_PARSED
)
12706 decl1
= declarator
;
12708 fntype
= TREE_TYPE (decl1
);
12709 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12710 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12712 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12713 class is in the (lexical) scope of the class in which it is
12715 if (!ctype
&& DECL_FRIEND_P (decl1
))
12717 ctype
= DECL_CLASS_CONTEXT (decl1
);
12719 /* CTYPE could be null here if we're dealing with a template;
12720 for example, `inline friend float foo()' inside a template
12721 will have no CTYPE set. */
12722 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12728 last_function_parms
= DECL_ARGUMENTS (decl1
);
12729 last_function_parm_tags
= NULL_TREE
;
12733 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12734 /* If the declarator is not suitable for a function definition,
12735 cause a syntax error. */
12736 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12738 fntype
= TREE_TYPE (decl1
);
12740 restype
= TREE_TYPE (fntype
);
12741 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12743 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12744 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12745 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12746 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12747 fntype
= build_function_type (integer_type_node
,
12748 TYPE_ARG_TYPES (fntype
));
12750 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12752 TYPE_ARG_TYPES (fntype
));
12753 TREE_TYPE (decl1
) = fntype
;
12756 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12757 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12758 else if (DECL_MAIN_P (decl1
))
12760 /* If this doesn't return integer_type, complain. */
12761 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12763 if (pedantic
|| warn_return_type
)
12764 pedwarn ("return type for `main' changed to `int'");
12765 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12770 /* Warn if function was previously implicitly declared
12771 (but not if we warned then). */
12772 if (! warn_implicit
12773 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12774 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12776 /* Set up current_class_type, and enter the scope of the class, if
12779 push_nested_class (ctype
, 1);
12780 else if (DECL_STATIC_FUNCTION_P (decl1
))
12781 push_nested_class (DECL_CONTEXT (decl1
), 2);
12783 /* Now that we have entered the scope of the class, we must restore
12784 the bindings for any template parameters surrounding DECL1, if it
12785 is an inline member template. (Order is important; consider the
12786 case where a template parameter has the same name as a field of
12787 the class.) It is not until after this point that
12788 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12789 if (flags
& SF_INCLASS_INLINE
)
12790 maybe_begin_member_template_processing (decl1
);
12792 /* Effective C++ rule 15. See also c_expand_return. */
12794 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12795 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12796 cp_warning ("`operator=' should return a reference to `*this'");
12798 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12799 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12800 DECL_INITIAL (decl1
) = error_mark_node
;
12802 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12803 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12806 /* This function exists in static storage.
12807 (This does not mean `static' in the C sense!) */
12808 TREE_STATIC (decl1
) = 1;
12810 /* We must call push_template_decl after current_class_type is set
12811 up. (If we are processing inline definitions after exiting a
12812 class scope, current_class_type will be NULL_TREE until set above
12813 by push_nested_class.) */
12814 if (processing_template_decl
)
12815 decl1
= push_template_decl (decl1
);
12817 /* We are now in the scope of the function being defined. */
12818 current_function_decl
= decl1
;
12820 /* Save the parm names or decls from this function's declarator
12821 where store_parm_decls will find them. */
12822 current_function_parms
= last_function_parms
;
12823 current_function_parm_tags
= last_function_parm_tags
;
12825 /* Make sure the parameter and return types are reasonable. When
12826 you declare a function, these types can be incomplete, but they
12827 must be complete when you define the function. */
12828 if (! processing_template_decl
)
12829 check_function_type (decl1
);
12831 /* Build the return declaration for the function. */
12832 restype
= TREE_TYPE (fntype
);
12833 if (!processing_template_decl
)
12835 if (!DECL_RESULT (decl1
))
12837 DECL_RESULT (decl1
)
12838 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12839 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12840 DECL_RESULT (decl1
));
12844 /* Just use `void'. Nobody will ever look at this anyhow. */
12845 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12847 /* Initialize RTL machinery. We cannot do this until
12848 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12849 even when processing a template; this is how we get
12850 CURRENT_FUNCTION set up, and our per-function variables
12852 bl
= current_binding_level
;
12853 init_function_start (decl1
, input_filename
, lineno
);
12854 current_binding_level
= bl
;
12855 expanding_p
= (flags
& SF_EXPAND
) != 0;
12857 /* Even though we're inside a function body, we still don't want to
12858 call expand_expr to calculate the size of a variable-sized array.
12859 We haven't necessarily assigned RTL to all variables yet, so it's
12860 not safe to try to expand expressions involving them. */
12861 immediate_size_expand
= 0;
12862 get_pending_sizes ();
12864 /* Let the user know we're compiling this function. */
12865 if (processing_template_decl
|| !building_stmt_tree ())
12866 announce_function (decl1
);
12868 /* Record the decl so that the function name is defined.
12869 If we already have a decl for this name, and it is a FUNCTION_DECL,
12870 use the old decl. */
12871 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12873 /* A specialization is not used to guide overload resolution. */
12874 if ((flag_guiding_decls
12875 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12876 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12877 decl1
= pushdecl (decl1
);
12880 /* We need to set the DECL_CONTEXT. */
12881 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12882 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12883 /* And make sure we have enough default args. */
12884 check_default_args (decl1
);
12886 DECL_MAIN_VARIANT (decl1
) = decl1
;
12887 fntype
= TREE_TYPE (decl1
);
12890 /* Reset these in case the call to pushdecl changed them. */
12891 current_function_decl
= decl1
;
12892 current_function
->decl
= decl1
;
12894 if (DECL_INTERFACE_KNOWN (decl1
))
12896 tree ctx
= hack_decl_function_context (decl1
);
12898 if (DECL_NOT_REALLY_EXTERN (decl1
))
12899 DECL_EXTERNAL (decl1
) = 0;
12901 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12902 && TREE_PUBLIC (ctx
))
12903 /* This is a function in a local class in an extern inline
12905 comdat_linkage (decl1
);
12907 /* If this function belongs to an interface, it is public.
12908 If it belongs to someone else's interface, it is also external.
12909 This only affects inlines and template instantiations. */
12910 else if (interface_unknown
== 0
12911 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12912 || flag_alt_external_templates
))
12914 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12915 || processing_template_decl
)
12917 DECL_EXTERNAL (decl1
)
12919 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
12920 && !DECL_VINDEX (decl1
)));
12922 /* For WIN32 we also want to put these in linkonce sections. */
12923 maybe_make_one_only (decl1
);
12926 DECL_EXTERNAL (decl1
) = 0;
12927 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
12928 DECL_INTERFACE_KNOWN (decl1
) = 1;
12930 else if (interface_unknown
&& interface_only
12931 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12932 || flag_alt_external_templates
))
12934 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
12935 interface, we will have interface_only set but not
12936 interface_known. In that case, we don't want to use the normal
12937 heuristics because someone will supply a #pragma implementation
12938 elsewhere, and deducing it here would produce a conflict. */
12939 comdat_linkage (decl1
);
12940 DECL_EXTERNAL (decl1
) = 0;
12941 DECL_INTERFACE_KNOWN (decl1
) = 1;
12942 DECL_DEFER_OUTPUT (decl1
) = 1;
12946 /* This is a definition, not a reference.
12947 So clear DECL_EXTERNAL. */
12948 DECL_EXTERNAL (decl1
) = 0;
12950 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
12951 && ! DECL_INTERFACE_KNOWN (decl1
)
12952 /* Don't try to defer nested functions for now. */
12953 && ! hack_decl_function_context (decl1
))
12954 DECL_DEFER_OUTPUT (decl1
) = 1;
12956 DECL_INTERFACE_KNOWN (decl1
) = 1;
12959 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
12961 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12962 TREE_TYPE (decl1
) = fntype
12963 = build_function_type (TREE_TYPE (fntype
),
12964 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
12965 current_function_parms
= TREE_CHAIN (current_function_parms
);
12966 DECL_ARGUMENTS (decl1
) = current_function_parms
;
12970 my_friendly_assert (current_class_ptr
== NULL_TREE
, 19990908);
12971 my_friendly_assert (current_class_ref
== NULL_TREE
, 19990908);
12974 /* If we're compiling a friend function, neither of the variables
12975 current_class_ptr nor current_class_type will have values. */
12976 if (! doing_friend
)
12978 /* We know that this was set up by `grokclassfn'.
12979 We do not wait until `store_parm_decls', since evil
12980 parse errors may never get us to that point. Here
12981 we keep the consistency between `current_class_type'
12982 and `current_class_ptr'. */
12983 tree t
= current_function_parms
;
12986 my_friendly_assert (t
!= NULL_TREE
12987 && TREE_CODE (t
) == PARM_DECL
, 162);
12988 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
12991 if (! hack_decl_function_context (decl1
))
12992 temporary_allocation ();
12993 i
= suspend_momentary ();
12995 /* Normally, build_indirect_ref returns current_class_ref
12996 whenever current_class_ptr is dereferenced. This time,
12997 however, we want it to *create* current_class_ref, so we
12998 temporarily clear current_class_ptr to fool it. */
12999 cp_function_chain
->x_current_class_ref
13000 = build_indirect_ref (t
, NULL_PTR
);
13001 cp_function_chain
->x_current_class_ptr
= t
;
13003 resume_momentary (i
);
13004 if (! hack_decl_function_context (decl1
))
13005 end_temporary_allocation ();
13010 current_binding_level
->parm_flag
= 1;
13013 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13015 if (!building_stmt_tree ())
13017 GNU_xref_function (decl1
, current_function_parms
);
13018 make_function_rtl (decl1
);
13021 /* Promote the value to int before returning it. */
13022 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13023 restype
= type_promotes_to (restype
);
13025 /* If this fcn was already referenced via a block-scope `extern' decl
13026 (or an implicit decl), propagate certain information about the usage. */
13027 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13028 TREE_ADDRESSABLE (decl1
) = 1;
13030 if (DECL_RESULT (decl1
) == NULL_TREE
)
13032 DECL_RESULT (decl1
)
13033 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13034 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13035 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13038 /* Allocate further tree nodes temporarily during compilation
13039 of this function only. Tiemann moved up here from bottom of fn. */
13040 /* If this is a nested function, then we must continue to allocate RTL
13041 on the permanent obstack in case we need to inline it later. */
13042 if (! hack_decl_function_context (decl1
))
13043 temporary_allocation ();
13045 /* Make sure that we always have a momntary obstack while we're in a
13049 if (building_stmt_tree ())
13050 begin_stmt_tree (decl1
);
13054 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13055 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13057 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13058 ctor_label
= NULL_TREE
;
13062 dtor_label
= NULL_TREE
;
13063 if (DECL_CONSTRUCTOR_P (decl1
))
13064 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13070 /* Called after store_parm_decls for a function-try-block. We need to update
13071 last_parm_cleanup_insn so that the base initializers for a constructor
13072 are run within this block, not before it. */
13075 expand_start_early_try_stmts ()
13077 expand_start_try_stmts ();
13078 last_parm_cleanup_insn
= get_last_insn ();
13081 /* Store the parameter declarations into the current function declaration.
13082 This is called after parsing the parameter declarations, before
13083 digesting the body of the function.
13085 Also install to binding contour return value identifier, if any. */
13088 store_parm_decls ()
13090 register tree fndecl
= current_function_decl
;
13091 register tree parm
;
13092 int parms_have_cleanups
= 0;
13093 tree cleanups
= NULL_TREE
;
13095 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13096 tree specparms
= current_function_parms
;
13098 /* This is a list of types declared among parms in a prototype. */
13099 tree parmtags
= current_function_parm_tags
;
13101 /* This is a chain of any other decls that came in among the parm
13102 declarations. If a parm is declared with enum {foo, bar} x;
13103 then CONST_DECLs for foo and bar are put here. */
13104 tree nonparms
= NULL_TREE
;
13106 if (toplevel_bindings_p ())
13107 fatal ("parse errors have confused me too much");
13109 /* Create a binding level for the parms. */
13110 expand_start_bindings (0);
13112 if (specparms
!= NULL_TREE
)
13114 /* This case is when the function was defined with an ANSI prototype.
13115 The parms already have decls, so we need not do anything here
13116 except record them as in effect
13117 and complain if any redundant old-style parm decls were written. */
13119 register tree next
;
13121 /* Must clear this because it might contain TYPE_DECLs declared
13123 storedecls (NULL_TREE
);
13125 for (parm
= nreverse (specparms
); parm
; parm
= next
)
13127 next
= TREE_CHAIN (parm
);
13128 if (TREE_CODE (parm
) == PARM_DECL
)
13131 if (DECL_NAME (parm
) == NULL_TREE
)
13135 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
13136 cp_error ("parameter `%D' declared void", parm
);
13139 if (! building_stmt_tree ()
13140 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13142 expand_decl (parm
);
13143 parms_have_cleanups
= 1;
13145 /* Keep track of the cleanups. */
13146 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13151 /* If we find an enum constant or a type tag,
13152 put it aside for the moment. */
13153 TREE_CHAIN (parm
) = NULL_TREE
;
13154 nonparms
= chainon (nonparms
, parm
);
13158 /* Get the decls in their original chain order
13159 and record in the function. This is all and only the
13160 PARM_DECLs that were pushed into scope by the loop above. */
13161 DECL_ARGUMENTS (fndecl
) = getdecls ();
13163 storetags (chainon (parmtags
, gettags ()));
13166 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13168 /* Now store the final chain of decls for the arguments
13169 as the decl-chain of the current lexical scope.
13170 Put the enumerators in as well, at the front so that
13171 DECL_ARGUMENTS is not modified. */
13173 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13175 /* Initialize the RTL code for the function. */
13176 DECL_SAVED_INSNS (fndecl
) = 0;
13177 if (! building_stmt_tree ())
13178 expand_function_start (fndecl
, parms_have_cleanups
);
13180 current_function_parms_stored
= 1;
13182 /* If this function is `main', emit a call to `__main'
13183 to run global initializers, etc. */
13184 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13185 expand_main_function ();
13187 /* Now that we have initialized the parms, we can start their
13188 cleanups. We cannot do this before, since expand_decl_cleanup
13189 should not be called before the parm can be used. */
13190 if (cleanups
&& !building_stmt_tree ())
13192 for (cleanups
= nreverse (cleanups
);
13194 cleanups
= TREE_CHAIN (cleanups
))
13196 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
),
13197 TREE_VALUE (cleanups
)))
13198 cp_error ("parser lost in parsing declaration of `%D'",
13199 TREE_PURPOSE (cleanups
));
13203 /* Create a binding contour which can be used to catch
13204 cleanup-generated temporaries. Also, if the return value needs or
13205 has initialization, deal with that now. */
13206 if (parms_have_cleanups
)
13209 if (!building_stmt_tree ())
13210 expand_start_bindings (0);
13213 if (! building_stmt_tree () && flag_exceptions
)
13215 /* Do the starting of the exception specifications, if we have any. */
13216 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13217 expand_start_eh_spec ();
13220 last_parm_cleanup_insn
= get_last_insn ();
13221 last_dtor_insn
= get_last_insn ();
13224 /* Bind a name and initialization to the return value of
13225 the current function. */
13228 store_return_init (decl
)
13231 /* If this named return value comes in a register, put it in a
13232 pseudo-register. */
13233 if (DECL_REGISTER (decl
))
13235 original_result_rtx
= DECL_RTL (decl
);
13236 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13241 /* Finish up a function declaration and compile that function
13242 all the way to assembler language output. The free the storage
13243 for the function definition.
13245 This is called after parsing the body of the function definition.
13246 LINENO is the current line number.
13248 FLAGS is a bitwise or of the following values:
13250 An extra call to poplevel (and expand_end_bindings) must be
13251 made to take care of the binding contour for the base
13252 initializers. This is only relevant for constructors.
13254 We just finished processing the body of an in-class inline
13255 function definition. (This processing will have taken place
13256 after the class definition is complete.) */
13259 finish_function (lineno
, flags
)
13263 register tree fndecl
= current_function_decl
;
13264 tree fntype
, ctype
= NULL_TREE
;
13265 rtx fn_last_parm_insn
, insns
;
13266 /* Label to use if this function is supposed to return a value. */
13267 tree no_return_label
= NULL_TREE
;
13268 tree decls
= NULL_TREE
;
13269 int call_poplevel
= (flags
& 1) != 0;
13270 int inclass_inline
= (flags
& 2) != 0;
13274 /* When we get some parse errors, we can end up without a
13275 current_function_decl, so cope. */
13276 if (fndecl
== NULL_TREE
)
13277 return error_mark_node
;
13279 nested
= function_depth
> 1;
13280 fntype
= TREE_TYPE (fndecl
);
13282 /* TREE_READONLY (fndecl) = 1;
13283 This caused &foo to be of type ptr-to-const-function
13284 which then got a warning when stored in a ptr-to-function variable. */
13286 /* This happens on strange parse errors. */
13287 if (! current_function_parms_stored
)
13290 store_parm_decls ();
13293 if (building_stmt_tree ())
13295 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13297 decls
= getdecls ();
13298 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13299 poplevel (decls
!= NULL_TREE
, 0, 0);
13302 /* Because we do not call expand_function_end, we won't call
13303 expand_end_bindings to match the call to
13304 expand_start_bindings we did in store_parm_decls. Therefore,
13305 we explicitly call expand_end_bindings here. However, we
13306 really shouldn't be calling expand_start_bindings at all when
13307 building_stmt_tree; it's conceptually an RTL-generation
13308 function, rather than a front-end function. */
13309 expand_end_bindings (0, 0, 0);
13313 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13315 tree ttype
= target_type (fntype
);
13318 if (IS_AGGR_TYPE (ttype
))
13319 /* Let debugger know it should output info for this type. */
13320 note_debug_info_needed (ttype
);
13322 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13324 ttype
= target_type (TREE_TYPE (parmdecl
));
13325 if (IS_AGGR_TYPE (ttype
))
13326 /* Let debugger know it should output info for this type. */
13327 note_debug_info_needed (ttype
);
13331 /* Clean house because we will need to reorder insns here. */
13332 do_pending_stack_adjust ();
13336 tree binfo
= TYPE_BINFO (current_class_type
);
13337 tree cond
= integer_one_node
;
13339 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13341 int ok_to_optimize_dtor
= 0;
13342 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13344 if (current_function_assigns_this
)
13345 cond
= build (NE_EXPR
, boolean_type_node
,
13346 current_class_ptr
, integer_zero_node
);
13349 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13351 /* If this destructor is empty, then we don't need to check
13352 whether `this' is NULL in some cases. */
13353 if ((flag_this_is_variable
& 1) == 0)
13354 ok_to_optimize_dtor
= 1;
13355 else if (empty_dtor
)
13356 ok_to_optimize_dtor
13357 = (n_baseclasses
== 0
13358 || (n_baseclasses
== 1
13359 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13362 /* These initializations might go inline. Protect
13363 the binding level of the parms. */
13365 expand_start_bindings (0);
13367 if (current_function_assigns_this
)
13369 current_function_assigns_this
= 0;
13370 current_function_just_assigned_this
= 0;
13373 /* Generate the code to call destructor on base class.
13374 If this destructor belongs to a class with virtual
13375 functions, then set the virtual function table
13376 pointer to represent the type of our base class. */
13378 /* This side-effect makes call to `build_delete' generate the
13379 code we have to have at the end of this destructor.
13380 `build_delete' will set the flag again. */
13381 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13383 /* These are two cases where we cannot delegate deletion. */
13384 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13385 || TYPE_GETS_REG_DELETE (current_class_type
))
13386 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
13387 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13389 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
13390 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13392 /* If we did not assign to this, then `this' is non-zero at
13393 the end of a destructor. As a special optimization, don't
13394 emit test if this is an empty destructor. If it does nothing,
13395 it does nothing. If it calls a base destructor, the base
13396 destructor will perform the test. */
13398 if (exprstmt
!= error_mark_node
13399 && (TREE_CODE (exprstmt
) != NOP_EXPR
13400 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13401 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13403 expand_label (dtor_label
);
13404 if (cond
!= integer_one_node
)
13405 expand_start_cond (cond
, 0);
13406 if (exprstmt
!= void_zero_node
)
13407 /* Don't call `expand_expr_stmt' if we're not going to do
13408 anything, since -Wall will give a diagnostic. */
13409 expand_expr_stmt (exprstmt
);
13411 /* Run destructor on all virtual baseclasses. */
13412 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13414 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13415 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13416 in_charge_node
, integer_two_node
), 0);
13419 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13421 tree vb
= get_vbase
13422 (BINFO_TYPE (vbases
),
13423 TYPE_BINFO (current_class_type
));
13425 (build_scoped_method_call
13426 (current_class_ref
, vb
, dtor_identifier
,
13427 build_expr_list (NULL_TREE
, integer_zero_node
)));
13429 vbases
= TREE_CHAIN (vbases
);
13431 expand_end_cond ();
13434 do_pending_stack_adjust ();
13435 if (cond
!= integer_one_node
)
13436 expand_end_cond ();
13439 virtual_size
= c_sizeof (current_class_type
);
13441 /* At the end, call delete if that's what's requested. */
13443 /* FDIS sez: At the point of definition of a virtual destructor
13444 (including an implicit definition), non-placement operator
13445 delete shall be looked up in the scope of the destructor's
13446 class and if found shall be accessible and unambiguous.
13448 This is somewhat unclear, but I take it to mean that if the
13449 class only defines placement deletes we don't do anything here.
13450 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13451 for us if they ever try to delete one of these. */
13453 if (TYPE_GETS_REG_DELETE (current_class_type
)
13454 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13455 exprstmt
= build_op_delete_call
13456 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13457 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13459 exprstmt
= NULL_TREE
;
13463 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13464 in_charge_node
, integer_one_node
);
13465 expand_start_cond (cond
, 0);
13466 expand_expr_stmt (exprstmt
);
13467 expand_end_cond ();
13470 /* End of destructor. */
13471 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13472 poplevel (getdecls () != NULL_TREE
, 0, 0);
13474 /* Back to the top of destructor. */
13475 /* Don't execute destructor code if `this' is NULL. */
13479 /* If the dtor is empty, and we know there is not possible way we
13480 could use any vtable entries, before they are possibly set by
13481 a base class dtor, we don't have to setup the vtables, as we
13482 know that any base class dtoring will set up any vtables it
13483 needs. We avoid MI, because one base class dtor can do a
13484 virtual dispatch to an overridden function that would need to
13485 have a non-related vtable set up, we cannot avoid setting up
13486 vtables in that case. We could change this to see if there is
13487 just one vtable. */
13488 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13490 /* Make all virtual function table pointers in non-virtual base
13491 classes point to CURRENT_CLASS_TYPE's virtual function
13493 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13495 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13496 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13499 if (! ok_to_optimize_dtor
)
13501 cond
= build_binary_op (NE_EXPR
,
13502 current_class_ptr
, integer_zero_node
);
13503 expand_start_cond (cond
, 0);
13506 insns
= get_insns ();
13509 fn_last_parm_insn
= get_first_nonparm_insn ();
13510 if (fn_last_parm_insn
== NULL_RTX
)
13511 fn_last_parm_insn
= get_last_insn ();
13513 fn_last_parm_insn
= previous_insn (fn_last_parm_insn
);
13515 emit_insns_after (insns
, fn_last_parm_insn
);
13517 if (! ok_to_optimize_dtor
)
13518 expand_end_cond ();
13520 else if (current_function_assigns_this
)
13522 /* Does not need to call emit_base_init, because
13523 that is done (if needed) just after assignment to this
13526 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13528 end_protect_partials ();
13529 expand_label (ctor_label
);
13530 ctor_label
= NULL_TREE
;
13534 decls
= getdecls ();
13535 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13536 poplevel (decls
!= NULL_TREE
, 0, 0);
13538 /* c_expand_return knows to return 'this' from a constructor. */
13539 c_expand_return (NULL_TREE
);
13541 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13542 && return_label
!= NULL_RTX
)
13543 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13545 current_function_assigns_this
= 0;
13546 current_function_just_assigned_this
= 0;
13547 base_init_expr
= NULL_TREE
;
13549 else if (DECL_CONSTRUCTOR_P (fndecl
))
13551 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13552 /* Allow constructor for a type to get a new instance of the object
13553 using `build_new'. */
13554 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13555 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13557 if (flag_this_is_variable
> 0)
13559 cond
= build_binary_op (EQ_EXPR
,
13560 current_class_ptr
, integer_zero_node
);
13561 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13562 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13565 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13569 if (flag_this_is_variable
> 0)
13571 expand_start_cond (cond
, 0);
13572 expand_expr_stmt (thenclause
);
13573 expand_end_cond ();
13576 /* Emit insns from `emit_base_init' which sets up virtual
13577 function table pointer(s). */
13578 if (base_init_expr
)
13580 expand_expr_stmt (base_init_expr
);
13581 base_init_expr
= NULL_TREE
;
13584 insns
= get_insns ();
13587 /* This is where the body of the constructor begins. */
13589 emit_insns_after (insns
, last_parm_cleanup_insn
);
13591 end_protect_partials ();
13593 /* This is where the body of the constructor ends. */
13594 expand_label (ctor_label
);
13595 ctor_label
= NULL_TREE
;
13599 decls
= getdecls ();
13600 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13601 poplevel (decls
!= NULL_TREE
, 1, 0);
13604 /* c_expand_return knows to return 'this' from a constructor. */
13605 c_expand_return (NULL_TREE
);
13607 current_function_assigns_this
= 0;
13608 current_function_just_assigned_this
= 0;
13610 else if (DECL_MAIN_P (fndecl
))
13612 /* Make it so that `main' always returns 0 by default. */
13614 c_expand_return (integer_one_node
);
13616 c_expand_return (integer_zero_node
);
13619 else if (return_label
!= NULL_RTX
13620 && current_function_return_value
== NULL_TREE
13621 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13622 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13624 if (flag_exceptions
)
13625 expand_exception_blocks ();
13627 /* If this function is supposed to return a value, ensure that
13628 we do not fall into the cleanups by mistake. The end of our
13629 function will look like this:
13631 user code (may have return stmt somewhere)
13632 goto no_return_label
13637 NOTE_INSN_FUNCTION_END
13641 If the user omits a return stmt in the USER CODE section, we
13642 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13643 Otherwise, we won't. */
13644 if (no_return_label
)
13646 DECL_CONTEXT (no_return_label
) = fndecl
;
13647 DECL_INITIAL (no_return_label
) = error_mark_node
;
13648 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13649 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13650 expand_goto (no_return_label
);
13655 /* Remove the binding contour which is used
13656 to catch cleanup-generated temporaries. */
13657 expand_end_bindings (0, 0, 0);
13658 poplevel (0, 0, 0);
13660 /* Emit label at beginning of cleanup code for parameters. */
13661 emit_label (cleanup_label
);
13664 /* Get return value into register if that's where it's supposed
13666 if (original_result_rtx
)
13667 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13669 /* Finish building code that will trigger warnings if users forget
13670 to make their functions return values. */
13671 if (no_return_label
|| cleanup_label
)
13672 emit_jump (return_label
);
13673 if (no_return_label
)
13675 /* We don't need to call `expand_*_return' here because we
13676 don't need any cleanups here--this path of code is only
13677 for error checking purposes. */
13678 expand_label (no_return_label
);
13681 /* We hard-wired immediate_size_expand to zero in
13682 start_function. Expand_function_end will decrement this
13683 variable. So, we set the variable to one here, so that after
13684 the decrement it will remain zero. */
13685 immediate_size_expand
= 1;
13687 /* Generate rtl for function exit. */
13688 expand_function_end (input_filename
, lineno
, 1);
13691 /* We have to save this value here in case
13692 maybe_end_member_template_processing decides to pop all the
13693 template parameters. */
13694 expand_p
= !building_stmt_tree ();
13696 /* If we're saving up tree structure, tie off the function now. */
13698 finish_stmt_tree (fndecl
);
13700 /* This must come after expand_function_end because cleanups might
13701 have declarations (from inline functions) that need to go into
13702 this function's blocks. */
13703 if (current_binding_level
->parm_flag
!= 1)
13704 my_friendly_abort (122);
13705 poplevel (1, 0, 1);
13707 /* Remember that we were in class scope. */
13708 if (current_class_name
)
13709 ctype
= current_class_type
;
13711 /* Must mark the RESULT_DECL as being in this function. */
13712 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13714 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13715 to the FUNCTION_DECL node itself. */
13716 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13718 /* Undo the call to push_momentary in start_function. */
13725 int saved_flag_keep_inline_functions
=
13726 flag_keep_inline_functions
;
13728 /* So we can tell if jump_optimize sets it to 1. */
13731 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13732 && hack_decl_function_context (fndecl
))
13733 /* Trick rest_of_compilation into not deferring output of this
13734 function, even if it is inline, since the rtl_obstack for
13735 this function is the function_obstack of the enclosing
13736 function and will be deallocated when the enclosing
13737 function is gone. See save_tree_status. */
13738 flag_keep_inline_functions
= 1;
13740 /* Before we call rest_of_compilation (which will pop the
13741 CURRENT_FUNCTION), we must save these values. */
13742 returns_null
= current_function_returns_null
;
13743 returns_value
= current_function_returns_value
;
13745 /* If this is a nested function (like a template instantiation
13746 that we're compiling in the midst of compiling something
13747 else), push a new GC context. That will keep local variables
13748 on the stack from being collected while we're doing the
13749 compilation of this function. */
13750 if (function_depth
> 1)
13751 ggc_push_context ();
13753 /* Run the optimizers and output the assembler code for this
13755 if (DECL_ARTIFICIAL (fndecl
))
13757 /* Do we really *want* to inline this synthesized method? */
13759 int save_fif
= flag_inline_functions
;
13760 flag_inline_functions
= 1;
13762 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13763 will check our size. */
13764 DECL_INLINE (fndecl
) = 0;
13766 rest_of_compilation (fndecl
);
13767 flag_inline_functions
= save_fif
;
13770 rest_of_compilation (fndecl
);
13772 /* Undo the call to ggc_push_context above. */
13773 if (function_depth
> 1)
13774 ggc_pop_context ();
13776 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13778 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13780 /* Set DECL_EXTERNAL so that assemble_external will be called as
13781 necessary. We'll clear it again in finish_file. */
13782 if (! DECL_EXTERNAL (fndecl
))
13783 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13784 DECL_EXTERNAL (fndecl
) = 1;
13785 mark_inline_for_output (fndecl
);
13788 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13789 note_debug_info_needed (ctype
);
13791 returns_null
|= can_reach_end
;
13793 /* Since we don't normally go through c_expand_return for constructors,
13794 this normally gets the wrong value.
13795 Also, named return values have their return codes emitted after
13796 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13797 if (DECL_CONSTRUCTOR_P (fndecl
)
13798 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13801 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13802 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13803 else if ((warn_return_type
|| pedantic
)
13805 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13807 /* If this function returns non-void and control can drop through,
13809 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13811 /* With just -W, complain only if function returns both with
13812 and without a value. */
13813 else if (extra_warnings
&& returns_value
&& returns_null
)
13814 warning ("this function may return with or without a value");
13818 /* Since we never call rest_of_compilation, we never clear
13819 CURRENT_FUNCTION. Do so explicitly. */
13820 free_after_compilation (current_function
);
13821 current_function
= NULL
;
13824 /* If this is a in-class inline definition, we may have to pop the
13825 bindings for the template parameters that we added in
13826 maybe_begin_member_template_processing when start_function was
13828 if (inclass_inline
)
13829 maybe_end_member_template_processing ();
13831 /* Leave the scope of the class. */
13833 pop_nested_class ();
13837 /* Free all the tree nodes making up this function. */
13838 /* Switch back to allocating nodes permanently
13839 until we start another function. */
13841 permanent_allocation (1);
13843 if (DECL_SAVED_INSNS (fndecl
) == 0)
13847 /* Stop pointing to the local nodes about to be freed. */
13848 /* But DECL_INITIAL must remain nonzero so we know this
13849 was an actual function definition. */
13850 DECL_INITIAL (fndecl
) = error_mark_node
;
13851 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13852 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13855 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13856 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13857 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13858 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13863 /* Let the error reporting routines know that we're outside a
13864 function. For a nested function, this value is used in
13865 pop_cp_function_context and then reset via pop_function_context. */
13866 current_function_decl
= NULL_TREE
;
13872 /* Create the FUNCTION_DECL for a function definition.
13873 DECLSPECS and DECLARATOR are the parts of the declaration;
13874 they describe the return type and the name of the function,
13875 but twisted together in a fashion that parallels the syntax of C.
13877 This function creates a binding context for the function body
13878 as well as setting up the FUNCTION_DECL in current_function_decl.
13880 Returns a FUNCTION_DECL on success.
13882 If the DECLARATOR is not suitable for a function (it defines a datum
13883 instead), we return 0, which tells yyparse to report a parse error.
13885 May return void_type_node indicating that this method is actually
13886 a friend. See grokfield for more details.
13888 Came here with a `.pushlevel' .
13890 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13891 CHANGES TO CODE IN `grokfield'. */
13894 start_method (declspecs
, declarator
, attrlist
)
13895 tree declarator
, declspecs
, attrlist
;
13897 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13900 /* Something too ugly to handle. */
13901 if (fndecl
== NULL_TREE
)
13904 /* Pass friends other than inline friend functions back. */
13905 if (fndecl
== void_type_node
)
13908 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13909 /* Not a function, tell parser to report parse error. */
13912 if (DECL_IN_AGGR_P (fndecl
))
13914 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13916 if (DECL_CONTEXT (fndecl
)
13917 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13918 cp_error ("`%D' is already defined in class %s", fndecl
,
13919 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13921 return void_type_node
;
13924 check_template_shadow (fndecl
);
13926 DECL_THIS_INLINE (fndecl
) = 1;
13928 if (flag_default_inline
)
13929 DECL_INLINE (fndecl
) = 1;
13931 /* We process method specializations in finish_struct_1. */
13932 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13933 fndecl
= push_template_decl (fndecl
);
13935 /* We read in the parameters on the maybepermanent_obstack,
13936 but we won't be getting back to them until after we
13937 may have clobbered them. So the call to preserve_data
13938 will keep them safe. */
13941 if (! DECL_FRIEND_P (fndecl
))
13943 if (TREE_CHAIN (fndecl
))
13945 fndecl
= copy_node (fndecl
);
13946 TREE_CHAIN (fndecl
) = NULL_TREE
;
13949 if (DECL_CONSTRUCTOR_P (fndecl
))
13951 if (! grok_ctor_properties (current_class_type
, fndecl
))
13952 return void_type_node
;
13954 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13955 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13958 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13960 /* Make a place for the parms */
13962 current_binding_level
->parm_flag
= 1;
13964 DECL_IN_AGGR_P (fndecl
) = 1;
13968 /* Go through the motions of finishing a function definition.
13969 We don't compile this method until after the whole class has
13972 FINISH_METHOD must return something that looks as though it
13973 came from GROKFIELD (since we are defining a method, after all).
13975 This is called after parsing the body of the function definition.
13976 STMTS is the chain of statements that makes up the function body.
13978 DECL is the ..._DECL that `start_method' provided. */
13981 finish_method (decl
)
13984 register tree fndecl
= decl
;
13987 register tree link
;
13989 if (decl
== void_type_node
)
13992 old_initial
= DECL_INITIAL (fndecl
);
13994 /* Undo the level for the parms (from start_method).
13995 This is like poplevel, but it causes nothing to be
13996 saved. Saving information here confuses symbol-table
13997 output routines. Besides, this information will
13998 be correctly output when this method is actually
14001 /* Clear out the meanings of the local variables of this level;
14002 also record in each decl which block it belongs to. */
14004 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14006 if (DECL_NAME (link
) != NULL_TREE
)
14007 pop_binding (DECL_NAME (link
), link
);
14008 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14009 DECL_CONTEXT (link
) = NULL_TREE
;
14012 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14013 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14014 current_binding_level
->parm_flag
,
14015 current_binding_level
->keep
);
14017 poplevel (0, 0, 0);
14019 DECL_INITIAL (fndecl
) = old_initial
;
14021 /* We used to check if the context of FNDECL was different from
14022 current_class_type as another way to get inside here. This didn't work
14023 for String.cc in libg++. */
14024 if (DECL_FRIEND_P (fndecl
))
14026 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14027 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14028 decl
= void_type_node
;
14034 /* Called when a new struct TYPE is defined.
14035 If this structure or union completes the type of any previous
14036 variable declaration, lay it out and output its rtl. */
14039 hack_incomplete_structures (type
)
14044 if (current_binding_level
->incomplete
== NULL_TREE
)
14047 if (!type
) /* Don't do this for class templates. */
14050 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14052 tree decl
= TREE_VALUE (*list
);
14053 if ((decl
&& TREE_TYPE (decl
) == type
)
14054 || (TREE_TYPE (decl
)
14055 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14056 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14058 int toplevel
= toplevel_bindings_p ();
14059 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14060 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14061 layout_type (TREE_TYPE (decl
));
14062 layout_decl (decl
, 0);
14063 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14067 expand_decl (decl
);
14068 cleanup
= maybe_build_cleanup (decl
);
14069 expand_decl_init (decl
);
14070 if (! expand_decl_cleanup (decl
, cleanup
))
14071 cp_error ("parser lost in parsing declaration of `%D'",
14074 *list
= TREE_CHAIN (*list
);
14077 list
= &TREE_CHAIN (*list
);
14081 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14082 See build_delete for information about AUTO_DELETE.
14084 Don't build these on the momentary obstack; they must live
14085 the life of the binding contour. */
14088 maybe_build_cleanup_1 (decl
, auto_delete
)
14089 tree decl
, auto_delete
;
14091 tree type
= TREE_TYPE (decl
);
14092 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14094 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14097 if (TREE_CODE (decl
) != PARM_DECL
)
14098 temp
= suspend_momentary ();
14100 if (TREE_CODE (type
) == ARRAY_TYPE
)
14104 mark_addressable (decl
);
14105 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14108 /* Optimize for space over speed here. */
14109 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14110 || flag_expensive_optimizations
)
14111 flags
|= LOOKUP_NONVIRTUAL
;
14113 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14115 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14116 && ! TYPE_HAS_DESTRUCTOR (type
))
14117 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14118 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14120 if (TREE_CODE (decl
) != PARM_DECL
)
14121 resume_momentary (temp
);
14128 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
14131 build_target_expr (decl
, value
)
14137 t
= build (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
14138 maybe_build_cleanup (decl
), NULL_TREE
);
14139 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
14140 ignore the TARGET_EXPR. If there really turn out to be no
14141 side-effects, then the optimizer should be able to get rid of
14142 whatever code is generated anyhow. */
14143 TREE_SIDE_EFFECTS (t
) = 1;
14148 /* If DECL is of a type which needs a cleanup, build that cleanup
14149 here. The cleanup does free the storage with a call to delete. */
14152 maybe_build_cleanup_and_delete (decl
)
14155 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14158 /* If DECL is of a type which needs a cleanup, build that cleanup
14159 here. The cleanup does not free the storage with a call a delete. */
14162 maybe_build_cleanup (decl
)
14165 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14168 /* Expand a C++ expression at the statement level.
14169 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14170 The C++ type checker should get all of these out when
14171 expressions are combined with other, type-providing, expressions,
14172 leaving only orphan expressions, such as:
14174 &class::bar; / / takes its address, but does nothing with it. */
14177 cplus_expand_expr_stmt (exp
)
14180 if (stmts_are_full_exprs_p
)
14181 exp
= convert_to_void (exp
, "statement");
14184 /* We should do this eventually, but right now this causes regex.o from
14185 libg++ to miscompile, and tString to core dump. */
14186 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14189 /* If we don't do this, we end up down inside expand_expr
14190 trying to do TYPE_MODE on the ERROR_MARK, and really
14191 go outside the bounds of the type. */
14192 if (exp
!= error_mark_node
)
14193 expand_expr_stmt (break_out_cleanups (exp
));
14196 /* When a stmt has been parsed, this function is called. */
14201 if (!current_function_assigns_this
14202 && current_function_just_assigned_this
)
14204 if (DECL_CONSTRUCTOR_P (current_function_decl
)
14205 && !building_stmt_tree ())
14207 /* Constructors must wait until we are out of control
14208 zones before calling base constructors. */
14209 if (in_control_zone_p ())
14211 expand_expr_stmt (base_init_expr
);
14212 check_base_init (current_class_type
);
14214 current_function_assigns_this
= 1;
14217 /* Always assume this statement was not an expression statement. If
14218 it actually was an expression statement, its our callers
14219 responsibility to fix this up. */
14220 last_expr_type
= NULL_TREE
;
14223 /* Change a static member function definition into a FUNCTION_TYPE, instead
14224 of the METHOD_TYPE that we create when it's originally parsed.
14226 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14227 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14228 other decls. Either pass the addresses of local variables or NULL. */
14231 revert_static_member_fn (decl
, fn
, argtypes
)
14232 tree
*decl
, *fn
, *argtypes
;
14235 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14236 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14238 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14239 != TYPE_UNQUALIFIED
)
14240 cp_error ("static member function `%#D' declared with type qualifiers",
14243 args
= TREE_CHAIN (args
);
14244 tmp
= build_function_type (TREE_TYPE (function
), args
);
14245 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14246 tmp
= build_exception_variant (tmp
,
14247 TYPE_RAISES_EXCEPTIONS (function
));
14248 TREE_TYPE (*decl
) = tmp
;
14249 if (DECL_ARGUMENTS (*decl
))
14250 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14251 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14258 /* Initialize the variables used during compilation of a C++
14262 push_cp_function_context (f
)
14263 struct function
*f
;
14265 struct language_function
*p
14266 = ((struct language_function
*)
14267 xcalloc (1, sizeof (struct language_function
)));
14270 /* For now, we always assume we're expanding all the way to RTL
14271 unless we're explicitly doing otherwise. */
14274 /* Whenever we start a new function, we destroy temporaries in the
14276 stmts_are_full_exprs_p
= 1;
14279 /* Free the language-specific parts of F, now that we've finished
14280 compiling the function. */
14283 pop_cp_function_context (f
)
14284 struct function
*f
;
14286 free (f
->language
);
14291 mark_cp_function_context (f
)
14292 struct function
*f
;
14294 struct language_function
*p
= f
->language
;
14299 ggc_mark_tree (p
->x_named_labels
);
14300 ggc_mark_tree (p
->x_ctor_label
);
14301 ggc_mark_tree (p
->x_dtor_label
);
14302 ggc_mark_tree (p
->x_base_init_list
);
14303 ggc_mark_tree (p
->x_member_init_list
);
14304 ggc_mark_tree (p
->x_base_init_expr
);
14305 ggc_mark_tree (p
->x_current_class_ptr
);
14306 ggc_mark_tree (p
->x_current_class_ref
);
14307 ggc_mark_tree (p
->x_last_tree
);
14308 ggc_mark_tree (p
->x_last_expr_type
);
14310 ggc_mark_rtx (p
->x_last_dtor_insn
);
14311 ggc_mark_rtx (p
->x_last_parm_cleanup_insn
);
14312 ggc_mark_rtx (p
->x_result_rtx
);
14314 mark_binding_level (&p
->bindings
);
14321 return function_depth
!= 0;
14326 lang_mark_false_label_stack (l
)
14327 struct label_node
*l
;
14329 /* C++ doesn't use false_label_stack. It better be NULL. */
14330 my_friendly_assert (l
== NULL
, 19990904);
14337 enum tree_code code
= TREE_CODE (t
);
14338 if (code
== IDENTIFIER_NODE
)
14340 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14341 struct lang_id2
*li2
= li
->x
;
14342 ggc_mark_tree (li
->namespace_bindings
);
14343 ggc_mark_tree (li
->bindings
);
14344 ggc_mark_tree (li
->class_value
);
14345 ggc_mark_tree (li
->class_template_info
);
14349 ggc_mark_tree (li2
->label_value
);
14350 ggc_mark_tree (li2
->implicit_decl
);
14351 ggc_mark_tree (li2
->error_locus
);
14354 else if (code
== CPLUS_BINDING
)
14356 if (BINDING_HAS_LEVEL_P (t
))
14357 mark_binding_level (&BINDING_LEVEL (t
));
14359 ggc_mark_tree (BINDING_SCOPE (t
));
14360 ggc_mark_tree (BINDING_VALUE (t
));
14362 else if (code
== OVERLOAD
)
14363 ggc_mark_tree (OVL_FUNCTION (t
));
14364 else if (code
== TEMPLATE_PARM_INDEX
)
14365 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14366 else if (TREE_CODE_CLASS (code
) == 'd')
14368 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14373 ggc_mark_tree (ld
->decl_flags
.access
);
14374 ggc_mark_tree (ld
->decl_flags
.context
);
14375 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14376 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14377 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14379 ggc_mark_tree (ld
->main_decl_variant
);
14380 ggc_mark_tree (ld
->befriending_classes
);
14381 ggc_mark_tree (ld
->saved_tree
);
14382 if (TREE_CODE (t
) == TYPE_DECL
)
14383 ggc_mark_tree (ld
->u
.sorted_fields
);
14387 else if (TREE_CODE_CLASS (code
) == 't')
14389 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14391 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14392 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14395 ggc_mark_tree (lt
->vfields
);
14396 ggc_mark_tree (lt
->vbases
);
14397 ggc_mark_tree (lt
->tags
);
14398 ggc_mark_tree (lt
->search_slot
);
14399 ggc_mark_tree (lt
->size
);
14400 ggc_mark_tree (lt
->abstract_virtuals
);
14401 ggc_mark_tree (lt
->friend_classes
);
14402 ggc_mark_tree (lt
->rtti
);
14403 ggc_mark_tree (lt
->methods
);
14404 ggc_mark_tree (lt
->template_info
);
14405 ggc_mark_tree (lt
->befriending_classes
);
14408 /* In the case of pointer-to-member function types, the
14409 TYPE_LANG_SPECIFIC is really just a tree. */
14410 ggc_mark_tree ((tree
) lt
);