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 #ifndef WCHAR_UNSIGNED
67 #define WCHAR_UNSIGNED 0
70 #ifndef CHAR_TYPE_SIZE
71 #define CHAR_TYPE_SIZE BITS_PER_UNIT
74 #ifndef BOOL_TYPE_SIZE
75 #ifdef SLOW_BYTE_ACCESS
76 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
78 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
82 /* We let tm.h override the types used here, to handle trivial differences
83 such as the choice of unsigned int or long unsigned int for size_t.
84 When machines start needing nontrivial differences in the size type,
85 it would be best to do something here to figure out automatically
86 from other information what type to use. */
89 #define SIZE_TYPE "long unsigned int"
93 #define PTRDIFF_TYPE "long int"
97 #define WCHAR_TYPE "int"
100 static tree grokparms
PROTO((tree
, int));
101 static const char *redeclaration_error_message
PROTO((tree
, tree
));
103 static void push_binding_level
PROTO((struct binding_level
*, int,
105 static void pop_binding_level
PROTO((void));
106 static void suspend_binding_level
PROTO((void));
107 static void resume_binding_level
PROTO((struct binding_level
*));
108 static struct binding_level
*make_binding_level
PROTO((void));
109 static void declare_namespace_level
PROTO((void));
110 static void signal_catch
PROTO((int)) ATTRIBUTE_NORETURN
;
111 static void storedecls
PROTO((tree
));
112 static void require_complete_types_for_parms
PROTO((tree
));
113 static void push_overloaded_decl_1
PROTO((tree
));
114 static int ambi_op_p
PROTO((tree
));
115 static int unary_op_p
PROTO((tree
));
116 static tree store_bindings
PROTO((tree
, tree
));
117 static tree lookup_tag_reverse
PROTO((tree
, tree
));
118 static tree obscure_complex_init
PROTO((tree
, tree
));
119 static tree maybe_build_cleanup_1
PROTO((tree
, tree
));
120 static tree lookup_name_real
PROTO((tree
, int, int, int));
121 static void warn_extern_redeclared_static
PROTO((tree
, tree
));
122 static void grok_reference_init
PROTO((tree
, tree
, tree
));
123 static tree grokfndecl
PROTO((tree
, tree
, tree
, tree
, int,
124 enum overload_flags
, tree
,
125 tree
, int, int, int, int, int, int, tree
));
126 static tree grokvardecl
PROTO((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
127 static tree lookup_tag
PROTO((enum tree_code
, tree
,
128 struct binding_level
*, int));
129 static void set_identifier_type_value_with_scope
130 PROTO((tree
, tree
, struct binding_level
*));
131 static void record_builtin_type
PROTO((enum rid
, const char *, tree
));
132 static void record_unknown_type
PROTO((tree
, const char *));
133 static int member_function_or_else
PROTO((tree
, tree
, const char *));
134 static void bad_specifiers
PROTO((tree
, const char *, int, int, int, int,
136 static void lang_print_error_function
PROTO((const char *));
137 static tree maybe_process_template_type_declaration
PROTO((tree
, int, struct binding_level
*));
138 static void check_for_uninitialized_const_var
PROTO((tree
));
139 static unsigned long typename_hash
PROTO((hash_table_key
));
140 static boolean typename_compare
PROTO((hash_table_key
, hash_table_key
));
141 static void push_binding
PROTO((tree
, tree
, struct binding_level
*));
142 static int add_binding
PROTO((tree
, tree
));
143 static void pop_binding
PROTO((tree
, tree
));
144 static tree local_variable_p
PROTO((tree
*));
145 static tree find_binding
PROTO((tree
, tree
));
146 static tree select_decl
PROTO((tree
, int));
147 static int lookup_flags
PROTO((int, int));
148 static tree qualify_lookup
PROTO((tree
, int));
149 static tree record_builtin_java_type
PROTO((const char *, int));
150 static const char *tag_name
PROTO((enum tag_types code
));
151 static void find_class_binding_level
PROTO((void));
152 static struct binding_level
*innermost_nonclass_level
PROTO((void));
153 static void warn_about_implicit_typename_lookup
PROTO((tree
, tree
));
154 static int walk_namespaces_r
PROTO((tree
, walk_namespaces_fn
, void *));
155 static int walk_globals_r
PROTO((tree
, void *));
156 static void add_decl_to_level
PROTO((tree
, struct binding_level
*));
157 static tree make_label_decl
PROTO((tree
, int));
158 static void pop_label
PROTO((tree
));
159 static void pop_labels
PROTO((tree
));
160 static void maybe_deduce_size_from_array_init
PROTO((tree
, tree
));
161 static void layout_var_decl
PROTO((tree
));
162 static void maybe_commonize_var
PROTO((tree
));
163 static tree check_initializer
PROTO((tree
, tree
));
164 static void make_rtl_for_nonlocal_decl
PROTO((tree
, tree
, const char *));
165 static void push_cp_function_context
PROTO((struct function
*));
166 static void pop_cp_function_context
PROTO((struct function
*));
167 static void mark_binding_level
PROTO((void *));
168 static void mark_cp_function_context
PROTO((struct function
*));
169 static void mark_saved_scope
PROTO((void *));
170 static void mark_lang_function
PROTO((struct language_function
*));
171 static void save_function_data
PROTO((tree
));
172 static void check_function_type
PROTO((tree
));
173 static void destroy_local_static
PROTO((tree
));
174 static void destroy_local_var
PROTO((tree
));
175 static void finish_constructor_body
PROTO((void));
176 static void finish_destructor_body
PROTO((void));
178 #if defined (DEBUG_CP_BINDING_LEVELS)
179 static void indent
PROTO((void));
182 /* Erroneous argument lists can use this *IFF* they do not modify it. */
183 tree error_mark_list
;
185 /* The following symbols are subsumed in the cp_global_trees array, and
186 listed here individually for documentation purposes.
189 tree wchar_decl_node;
192 tree vtable_entry_type;
193 tree delta_type_node;
196 tree __baselist_desc_type_node;
197 tree __i_desc_type_node, __m_desc_type_node;
198 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
200 tree __t_desc_type_node;
202 tree __tp_desc_type_node;
204 tree __access_mode_type_node;
205 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
206 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
207 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
209 Not needed yet? May be needed one day?
210 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
211 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
212 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
215 tree class_star_type_node;
216 tree class_type_node, record_type_node, union_type_node, enum_type_node;
217 tree unknown_type_node;
219 Array type `vtable_entry_type[]'
222 tree vtbl_ptr_type_node;
228 A FUNCTION_DECL which can call `abort'. Not necessarily the
229 one that the user will declare, but sufficient to be called
230 by routines that want to abort the program.
234 The FUNCTION_DECL for the default `::operator delete'.
236 tree global_delete_fndecl;
239 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
243 tree cp_global_trees
[CPTI_MAX
];
245 /* Indicates that there is a type value in some namespace, although
246 that is not necessarily in scope at the moment. */
248 static tree global_type_node
;
253 /* Expect only namespace names now. */
254 static int only_namespace_names
;
256 /* In a destructor, the last insn emitted after the start of the
257 function and the parms. */
259 #define last_dtor_insn cp_function_chain->x_last_dtor_insn
261 /* In a constructor, the last insn emitted after the start of the
262 function and the parms, the exception specification and any
263 function-try-block. The constructor initializers are emitted after
266 #define last_parm_cleanup_insn cp_function_chain->x_last_parm_cleanup_insn
268 /* If original DECL_RESULT of current function was a register,
269 but due to being an addressable named return value, would up
270 on the stack, this variable holds the named return value's
271 original location. */
273 #define original_result_rtx cp_function_chain->x_result_rtx
275 struct named_label_list
277 struct binding_level
*binding_level
;
280 const char *filename_o_goto
;
282 struct named_label_list
*next
;
285 /* Used only for jumps to as-yet undefined labels, since jumps to
286 defined labels can have their validity checked by stmt.c. */
288 #define named_label_uses cp_function_chain->x_named_label_uses
290 /* A list of objects which have constructors or destructors
291 which reside in the global scope. The decl is stored in
292 the TREE_VALUE slot and the initializer is stored
293 in the TREE_PURPOSE slot. */
294 tree static_aggregates
;
298 /* A node for the integer constants 2, and 3. */
300 tree integer_two_node
, integer_three_node
;
302 /* While defining an enum type, this is 1 plus the last enumerator
305 static tree enum_next_value
;
307 /* Nonzero means that there was overflow computing enum_next_value. */
309 static int enum_overflow
;
311 /* Parsing a function declarator leaves here a chain of structure
312 and enum types declared in the parmlist. */
314 static tree last_function_parm_tags
;
316 /* Similar, for last_function_parm_tags. */
317 tree last_function_parms
;
318 static tree current_function_parm_tags
;
320 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
321 that have names. Here so we can clear out their names' definitions
322 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
323 TREE_PURPOSE is the previous binding of the label. */
325 #define named_labels cp_function_chain->x_named_labels
327 /* The FUNCTION_DECL for the function currently being compiled,
328 or 0 if between functions. */
329 tree current_function_decl
;
331 /* Set to 0 at beginning of a function definition, and whenever
332 a label (case or named) is defined. Set to value of expression
333 returned from function when that value can be transformed into
334 a named return value. */
336 tree current_function_return_value
;
338 /* Nonzero means give `double' the same size as `float'. */
340 extern int flag_short_double
;
342 /* Nonzero means don't recognize any builtin functions. */
344 extern int flag_no_builtin
;
346 /* Nonzero means don't recognize the non-ANSI builtin functions.
349 extern int flag_no_nonansi_builtin
;
351 /* Nonzero means enable obscure ANSI features and disable GNU extensions
352 that might cause ANSI-compliant code to be miscompiled. */
354 extern int flag_ansi
;
356 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
358 extern int flag_huge_objects
;
360 /* Nonzero if we want to conserve space in the .o files. We do this
361 by putting uninitialized data and runtime initialized data into
362 .common instead of .data at the expense of not flagging multiple
364 extern int flag_conserve_space
;
366 /* C and C++ flags are in decl2.c. */
368 /* Flag used when debugging spew.c */
370 extern int spew_debug
;
372 /* A expression of value 0 with the same precision as a sizetype
374 tree signed_size_zero_node
;
376 /* The name of the anonymous namespace, throughout this translation
378 tree anonymous_namespace_name
;
381 /* For each binding contour we allocate a binding_level structure
382 which records the names defined in that contour.
385 1) one for each function definition,
386 where internal declarations of the parameters appear.
387 2) one for each compound statement,
388 to record its declarations.
390 The current meaning of a name can be found by searching the levels
391 from the current one out to the global one.
393 Off to the side, may be the class_binding_level. This exists only
394 to catch class-local declarations. It is otherwise nonexistent.
396 Also there may be binding levels that catch cleanups that must be
397 run when exceptions occur. Thus, to see whether a name is bound in
398 the current scope, it is not enough to look in the
399 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
402 /* Note that the information in the `names' component of the global contour
403 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
407 /* A chain of _DECL nodes for all variables, constants, functions,
408 and typedef types. These are in the reverse of the order
409 supplied. There may be OVERLOADs on this list, too, but they
410 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
413 /* A list of structure, union and enum definitions, for looking up
415 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
416 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
417 or ENUMERAL_TYPE node.
419 C++: the TREE_VALUE nodes can be simple types for
420 component_bindings. */
423 /* A list of USING_DECL nodes. */
426 /* A list of used namespaces. PURPOSE is the namespace,
427 VALUE the common ancestor with this binding_level's namespace. */
428 tree using_directives
;
430 /* If this binding level is the binding level for a class, then
431 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
432 is the name of an entity bound in the class; the TREE_VALUE is
433 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
434 when leaving class scope, we can restore the
435 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
436 the DECL bound by this name in the class. */
439 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
440 is used for all binding levels. */
443 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
444 label in this scope. The TREE_PURPOSE is the previous value of
445 the IDENTIFIER_LABEL VALUE. */
446 tree shadowed_labels
;
448 /* For each level (except not the global one),
449 a chain of BLOCK nodes for all the levels
450 that were entered and exited one level down. */
453 /* The BLOCK node for this level, if one has been preallocated.
454 If 0, the BLOCK is allocated (if needed) when the level is popped. */
457 /* The binding level which this one is contained in (inherits from). */
458 struct binding_level
*level_chain
;
460 /* List of decls in `names' that have incomplete
461 structure or union types. */
464 /* List of VAR_DECLS saved from a previous for statement.
465 These would be dead in ANSI-conforming code, but might
466 be referenced in ARM-era code. These are stored in a
467 TREE_LIST; the TREE_VALUE is the actual declaration. */
468 tree dead_vars_from_for
;
470 /* 1 for the level that holds the parameters of a function.
471 2 for the level that holds a class declaration.
472 3 for levels that hold parameter declarations. */
473 unsigned parm_flag
: 4;
475 /* 1 means make a BLOCK for this level regardless of all else.
476 2 for temporary binding contours created by the compiler. */
479 /* Nonzero if this level "doesn't exist" for tags. */
480 unsigned tag_transparent
: 1;
482 /* Nonzero if this level can safely have additional
483 cleanup-needing variables added to it. */
484 unsigned more_cleanups_ok
: 1;
485 unsigned have_cleanups
: 1;
487 /* Nonzero if this level is for storing the decls for template
488 parameters and generic decls; these decls will be discarded and
489 replaced with a TEMPLATE_DECL. */
490 unsigned pseudo_global
: 1;
492 /* This is set for a namespace binding level. */
493 unsigned namespace_p
: 1;
495 /* True if this level is that of a for-statement where we need to
496 worry about ambiguous (ARM or ANSI) scope rules. */
497 unsigned is_for_scope
: 1;
499 /* True if this level corresponds to an EH region, as for a try block. */
500 unsigned eh_region
: 1;
502 /* One bit left for this word. */
504 #if defined(DEBUG_CP_BINDING_LEVELS)
505 /* Binding depth at which this level began. */
506 unsigned binding_depth
;
507 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
510 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
512 /* The binding level currently in effect. */
514 #define current_binding_level \
516 ? cp_function_chain->bindings \
517 : scope_chain->bindings)
519 /* The binding level of the current class, if any. */
521 #define class_binding_level scope_chain->class_bindings
523 /* A chain of binding_level structures awaiting reuse. */
525 static struct binding_level
*free_binding_level
;
527 /* The outermost binding level, for names of file scope.
528 This is created when the compiler is started and exists
529 through the entire run. */
531 static struct binding_level
*global_binding_level
;
533 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
535 static int keep_next_level_flag
;
537 #if defined(DEBUG_CP_BINDING_LEVELS)
538 static int binding_depth
= 0;
539 static int is_class_level
= 0;
546 for (i
= 0; i
< binding_depth
*2; i
++)
549 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
551 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
554 push_binding_level (newlevel
, tag_transparent
, keep
)
555 struct binding_level
*newlevel
;
556 int tag_transparent
, keep
;
558 /* Add this level to the front of the chain (stack) of levels that
560 bzero ((char*) newlevel
, sizeof (struct binding_level
));
561 newlevel
->level_chain
= current_binding_level
;
562 current_binding_level
= newlevel
;
563 newlevel
->tag_transparent
= tag_transparent
;
564 newlevel
->more_cleanups_ok
= 1;
566 /* We are called before expand_start_bindings, but after
567 expand_eh_region_start for a try block; so we check this now,
568 before the EH block is covered up. */
569 newlevel
->eh_region
= is_eh_region ();
571 newlevel
->keep
= keep
;
572 #if defined(DEBUG_CP_BINDING_LEVELS)
573 newlevel
->binding_depth
= binding_depth
;
575 fprintf (stderr
, "push %s level 0x%08x line %d\n",
576 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
579 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
582 /* Find the innermost enclosing class scope, and reset
583 CLASS_BINDING_LEVEL appropriately. */
586 find_class_binding_level ()
588 struct binding_level
*level
= current_binding_level
;
590 while (level
&& level
->parm_flag
!= 2)
591 level
= level
->level_chain
;
592 if (level
&& level
->parm_flag
== 2)
593 class_binding_level
= level
;
595 class_binding_level
= 0;
601 if (global_binding_level
)
603 /* Cannot pop a level, if there are none left to pop. */
604 if (current_binding_level
== global_binding_level
)
605 my_friendly_abort (123);
607 /* Pop the current level, and free the structure for reuse. */
608 #if defined(DEBUG_CP_BINDING_LEVELS)
611 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
612 (is_class_level
) ? "class" : "block",
613 current_binding_level
, lineno
);
614 if (is_class_level
!= (current_binding_level
== class_binding_level
))
617 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
620 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
622 register struct binding_level
*level
= current_binding_level
;
623 current_binding_level
= current_binding_level
->level_chain
;
624 level
->level_chain
= free_binding_level
;
625 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
626 if (level
->binding_depth
!= binding_depth
)
628 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
629 free_binding_level
= level
;
630 find_class_binding_level ();
635 suspend_binding_level ()
637 if (class_binding_level
)
638 current_binding_level
= class_binding_level
;
640 if (global_binding_level
)
642 /* Cannot suspend a level, if there are none left to suspend. */
643 if (current_binding_level
== global_binding_level
)
644 my_friendly_abort (123);
646 /* Suspend the current level. */
647 #if defined(DEBUG_CP_BINDING_LEVELS)
650 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
651 (is_class_level
) ? "class" : "block",
652 current_binding_level
, lineno
);
653 if (is_class_level
!= (current_binding_level
== class_binding_level
))
656 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
659 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
660 current_binding_level
= current_binding_level
->level_chain
;
661 find_class_binding_level ();
665 resume_binding_level (b
)
666 struct binding_level
*b
;
668 /* Resuming binding levels is meant only for namespaces,
669 and those cannot nest into classes. */
670 my_friendly_assert(!class_binding_level
, 386);
671 /* Also, resuming a non-directly nested namespace is a no-no. */
672 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
673 current_binding_level
= b
;
674 #if defined(DEBUG_CP_BINDING_LEVELS)
675 b
->binding_depth
= binding_depth
;
677 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
678 (is_class_level
) ? "class" : "block", b
, lineno
);
681 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
684 /* Create a new `struct binding_level'. */
687 struct binding_level
*
688 make_binding_level ()
691 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
694 /* Nonzero if we are currently in the global binding level. */
699 return current_binding_level
== global_binding_level
;
702 /* Return the innermost binding level that is not for a class scope. */
704 static struct binding_level
*
705 innermost_nonclass_level ()
707 struct binding_level
*b
;
709 b
= current_binding_level
;
710 while (b
->parm_flag
== 2)
716 /* Nonzero if we are currently in a toplevel binding level. This
717 means either the global binding level or a namespace in a toplevel
718 binding level. Since there are no non-toplevel namespace levels,
719 this really means any namespace or pseudo-global level. We also
720 include a class whose context is toplevel. */
723 toplevel_bindings_p ()
725 struct binding_level
*b
= innermost_nonclass_level ();
727 return b
->namespace_p
|| b
->pseudo_global
;
730 /* Nonzero if this is a namespace scope, or if we are defining a class
731 which is itself at namespace scope, or whose enclosing class is
732 such a class, etc. */
735 namespace_bindings_p ()
737 struct binding_level
*b
= innermost_nonclass_level ();
739 return b
->namespace_p
;
742 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
743 unconditionally. Otherwise, use the normal logic to decide whether
744 or not to create a BLOCK. */
747 keep_next_level (keep
)
750 keep_next_level_flag
= keep
;
753 /* Nonzero if the current level needs to have a BLOCK made. */
758 return (current_binding_level
->blocks
!= NULL_TREE
759 || current_binding_level
->keep
760 || current_binding_level
->names
!= NULL_TREE
761 || (current_binding_level
->tags
!= NULL_TREE
762 && !current_binding_level
->tag_transparent
));
766 declare_pseudo_global_level ()
768 current_binding_level
->pseudo_global
= 1;
772 declare_namespace_level ()
774 current_binding_level
->namespace_p
= 1;
778 pseudo_global_level_p ()
780 return current_binding_level
->pseudo_global
;
784 set_class_shadows (shadows
)
787 class_binding_level
->class_shadowed
= shadows
;
790 /* Enter a new binding level.
791 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
792 not for that of tags. */
795 pushlevel (tag_transparent
)
798 struct binding_level
*newlevel
;
800 if (current_function
&& !doing_semantic_analysis_p ())
803 /* Reuse or create a struct for this binding level. */
804 #if defined(DEBUG_CP_BINDING_LEVELS)
806 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
807 if (free_binding_level
)
808 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
810 newlevel
= free_binding_level
;
811 free_binding_level
= free_binding_level
->level_chain
;
814 newlevel
= make_binding_level ();
816 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
817 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
818 keep_next_level_flag
= 0;
822 note_level_for_for ()
824 current_binding_level
->is_for_scope
= 1;
828 pushlevel_temporary (tag_transparent
)
831 pushlevel (tag_transparent
);
832 current_binding_level
->keep
= 2;
835 /* Note we don't call push_momentary() here. Otherwise, it would cause
836 cleanups to be allocated on the momentary obstack, and they will be
837 overwritten by the next statement. */
839 expand_start_bindings (0);
842 /* For a binding between a name and an entity at a block scope,
843 this is the `struct binding_level' for the block. */
844 #define BINDING_LEVEL(NODE) \
845 (((struct tree_binding*)NODE)->scope.level)
847 /* Make DECL the innermost binding for ID. The LEVEL is the binding
848 level at which this declaration is being bound. */
851 push_binding (id
, decl
, level
)
854 struct binding_level
* level
;
858 binding
= make_node (CPLUS_BINDING
);
860 /* Now, fill in the binding information. */
861 BINDING_VALUE (binding
) = decl
;
862 BINDING_TYPE (binding
) = NULL_TREE
;
863 BINDING_LEVEL (binding
) = level
;
864 INHERITED_VALUE_BINDING_P (binding
) = 0;
865 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
866 BINDING_HAS_LEVEL_P (binding
) = 1;
868 /* And put it on the front of the list of bindings for ID. */
869 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
870 IDENTIFIER_BINDING (id
) = binding
;
873 /* ID is already bound in the current scope. But, DECL is an
874 additional binding for ID in the same scope. This is the `struct
875 stat' hack whereby a non-typedef class-name or enum-name can be
876 bound at the same level as some other kind of entity. It's the
877 responsibility of the caller to check that inserting this name is
878 legal here. Returns nonzero if the new binding was successful. */
880 add_binding (id
, decl
)
884 tree binding
= IDENTIFIER_BINDING (id
);
887 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
888 /* The new name is the type name. */
889 BINDING_TYPE (binding
) = decl
;
890 else if (!BINDING_VALUE (binding
))
891 /* This situation arises when push_class_level_binding moves an
892 inherited type-binding out of the way to make room for a new
894 BINDING_VALUE (binding
) = decl
;
895 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
896 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
898 /* The old binding was a type name. It was placed in
899 BINDING_VALUE because it was thought, at the point it was
900 declared, to be the only entity with such a name. Move the
901 type name into the type slot; it is now hidden by the new
903 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
904 BINDING_VALUE (binding
) = decl
;
905 INHERITED_VALUE_BINDING_P (binding
) = 0;
907 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
908 && TREE_CODE (decl
) == TYPE_DECL
909 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
910 && same_type_p (TREE_TYPE (decl
),
911 TREE_TYPE (BINDING_VALUE (binding
))))
912 /* We have two typedef-names, both naming the same type to have
913 the same name. This is OK because of:
917 In a given scope, a typedef specifier can be used to redefine
918 the name of any type declared in that scope to refer to the
919 type to which it already refers. */
923 cp_error ("declaration of `%#D'", decl
);
924 cp_error_at ("conflicts with previous declaration `%#D'",
925 BINDING_VALUE (binding
));
932 /* Add DECL to the list of things declared in B. */
935 add_decl_to_level (decl
, b
)
937 struct binding_level
*b
;
939 /* We build up the list in reverse order, and reverse it later if
941 TREE_CHAIN (decl
) = b
->names
;
945 /* Bind DECL to ID in the current_binding_level, assumed to be a local
946 binding level. If PUSH_USING is set in FLAGS, we know that DECL
947 doesn't really belong to this binding level, that it got here
948 through a using-declaration. */
951 push_local_binding (id
, decl
, flags
)
956 struct binding_level
*b
;
958 /* Skip over any local classes. This makes sense if we call
959 push_local_binding with a friend decl of a local class. */
960 b
= current_binding_level
;
961 while (b
->parm_flag
== 2)
964 if (lookup_name_current_level (id
))
966 /* Supplement the existing binding. */
967 if (!add_binding (id
, decl
))
968 /* It didn't work. Something else must be bound at this
969 level. Do not add DECL to the list of things to pop
974 /* Create a new binding. */
975 push_binding (id
, decl
, b
);
977 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
978 /* We must put the OVERLOAD into a TREE_LIST since the
979 TREE_CHAIN of an OVERLOAD is already used. Similarly for
980 decls that got here through a using-declaration. */
981 decl
= build_tree_list (NULL_TREE
, decl
);
983 /* And put DECL on the list of things declared by the current
985 add_decl_to_level (decl
, b
);
988 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
989 binding was successful. */
992 push_class_binding (id
, decl
)
997 tree binding
= IDENTIFIER_BINDING (id
);
1000 /* Note that we declared this value so that we can issue an error if
1001 this an illegal redeclaration of a name already used for some
1003 note_name_declared_in_class (id
, decl
);
1005 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1006 /* Supplement the existing binding. */
1007 result
= add_binding (id
, decl
);
1009 /* Create a new binding. */
1010 push_binding (id
, decl
, class_binding_level
);
1012 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1013 class-level declaration. Note that we do not use DECL here
1014 because of the possibility of the `struct stat' hack; if DECL is
1015 a class-name or enum-name we might prefer a field-name, or some
1017 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1019 /* If this is a binding from a base class, mark it as such. */
1020 binding
= IDENTIFIER_BINDING (id
);
1021 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1023 /* Any implicit typename must be from a base-class. The
1024 context for an implicit typename declaration is always
1025 the derived class in which the lookup was done, so the checks
1026 based on the context of DECL below will not trigger. */
1027 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1028 INHERITED_VALUE_BINDING_P (binding
) = 1;
1031 if (TREE_CODE (decl
) == OVERLOAD
)
1032 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
1035 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1037 context
= DECL_REAL_CONTEXT (decl
);
1040 if (is_properly_derived_from (current_class_type
, context
))
1041 INHERITED_VALUE_BINDING_P (binding
) = 1;
1043 INHERITED_VALUE_BINDING_P (binding
) = 0;
1046 else if (BINDING_VALUE (binding
) == decl
)
1047 /* We only encounter a TREE_LIST when push_class_decls detects an
1048 ambiguity. Such an ambiguity can be overridden by a definition
1050 INHERITED_VALUE_BINDING_P (binding
) = 1;
1055 /* Remove the binding for DECL which should be the innermost binding
1059 pop_binding (id
, decl
)
1065 if (id
== NULL_TREE
)
1066 /* It's easiest to write the loops that call this function without
1067 checking whether or not the entities involved have names. We
1068 get here for such an entity. */
1071 /* Get the innermost binding for ID. */
1072 binding
= IDENTIFIER_BINDING (id
);
1074 /* The name should be bound. */
1075 my_friendly_assert (binding
!= NULL_TREE
, 0);
1077 /* The DECL will be either the ordinary binding or the type
1078 binding for this identifier. Remove that binding. */
1079 if (BINDING_VALUE (binding
) == decl
)
1080 BINDING_VALUE (binding
) = NULL_TREE
;
1081 else if (BINDING_TYPE (binding
) == decl
)
1082 BINDING_TYPE (binding
) = NULL_TREE
;
1084 my_friendly_abort (0);
1086 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1087 /* We're completely done with the innermost binding for this
1088 identifier. Unhook it from the list of bindings. */
1089 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1092 /* When a label goes out of scope, check to see if that label was used
1093 in a valid manner, and issue any appropriate warnings or errors. */
1099 tree label
= TREE_VALUE (link
);
1101 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1103 if (DECL_INITIAL (label
) == NULL_TREE
)
1105 cp_error_at ("label `%D' used but not defined", label
);
1106 /* Avoid crashing later. */
1107 define_label (input_filename
, 1, DECL_NAME (label
));
1109 else if (warn_unused
&& !TREE_USED (label
))
1110 cp_warning_at ("label `%D' defined but not used", label
);
1113 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1116 /* At the end of a function, all labels declared within the fucntion
1117 go out of scope. BLOCK is the top-level block for the
1126 /* Clear out the definitions of all label names, since their scopes
1128 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1131 /* Put the labels into the "variables" of the top-level block,
1132 so debugger can see them. */
1133 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1134 BLOCK_VARS (block
) = TREE_VALUE (link
);
1137 named_labels
= NULL_TREE
;
1140 /* Exit a binding level.
1141 Pop the level off, and restore the state of the identifier-decl mappings
1142 that were in effect when this level was entered.
1144 If KEEP == 1, this level had explicit declarations, so
1145 and create a "block" (a BLOCK node) for the level
1146 to record its declarations and subblocks for symbol table output.
1148 If FUNCTIONBODY is nonzero, this level is the body of a function,
1149 so create a block as if KEEP were set and also clear out all
1152 If REVERSE is nonzero, reverse the order of decls before putting
1153 them into the BLOCK. */
1156 poplevel (keep
, reverse
, functionbody
)
1162 /* The chain of decls was accumulated in reverse order.
1163 Put it into forward order, just for cleanliness. */
1165 int tmp
= functionbody
;
1166 int real_functionbody
;
1169 tree block
= NULL_TREE
;
1171 int block_previously_created
;
1172 int leaving_for_scope
;
1174 if (current_function
&& !doing_semantic_analysis_p ())
1177 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1180 real_functionbody
= (current_binding_level
->keep
== 2
1181 ? ((functionbody
= 0), tmp
) : functionbody
);
1182 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1183 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1185 my_friendly_assert (!current_binding_level
->class_shadowed
,
1188 /* We used to use KEEP == 2 to indicate that the new block should go
1189 at the beginning of the list of blocks at this binding level,
1190 rather than the end. This hack is no longer used. */
1191 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1193 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1194 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1195 current_binding_level
->parm_flag
,
1196 current_binding_level
->keep
);
1198 if (current_binding_level
->keep
== 1)
1201 /* Get the decls in the order they were written.
1202 Usually current_binding_level->names is in reverse order.
1203 But parameter decls were previously put in forward order. */
1206 current_binding_level
->names
1207 = decls
= nreverse (current_binding_level
->names
);
1209 decls
= current_binding_level
->names
;
1211 /* Output any nested inline functions within this block
1212 if they weren't already output. */
1214 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1215 if (TREE_CODE (decl
) == FUNCTION_DECL
1216 && ! TREE_ASM_WRITTEN (decl
)
1217 && DECL_INITIAL (decl
) != NULL_TREE
1218 && TREE_ADDRESSABLE (decl
)
1219 && decl_function_context (decl
) == current_function_decl
)
1221 /* If this decl was copied from a file-scope decl
1222 on account of a block-scope extern decl,
1223 propagate TREE_ADDRESSABLE to the file-scope decl. */
1224 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1225 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1228 push_function_context ();
1229 output_inline_function (decl
);
1230 pop_function_context ();
1234 /* If there were any declarations or structure tags in that level,
1235 or if this level is a function body,
1236 create a BLOCK to record them for the life of this function. */
1239 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1240 if (block_previously_created
)
1241 block
= current_binding_level
->this_block
;
1242 else if (keep
== 1 || functionbody
)
1243 block
= make_node (BLOCK
);
1244 if (block
!= NULL_TREE
)
1246 if (block_previously_created
)
1248 if (decls
|| tags
|| subblocks
)
1250 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1251 warning ("internal compiler error: debugging info corrupted");
1253 BLOCK_VARS (block
) = decls
;
1254 BLOCK_TYPE_TAGS (block
) = tags
;
1256 /* We can have previous subblocks and new subblocks when
1257 doing fixup_gotos with complex cleanups. We chain the new
1258 subblocks onto the end of any pre-existing subblocks. */
1259 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1262 /* If we created the block earlier on, and we are just
1263 diddling it now, then it already should have a proper
1264 BLOCK_END_NOTE value associated with it. */
1268 BLOCK_VARS (block
) = decls
;
1269 BLOCK_TYPE_TAGS (block
) = tags
;
1270 BLOCK_SUBBLOCKS (block
) = subblocks
;
1271 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1273 remember_end_note (block
);
1277 /* In each subblock, record that this is its superior. */
1280 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1281 BLOCK_SUPERCONTEXT (link
) = block
;
1283 /* We still support the old for-scope rules, whereby the variables
1284 in a for-init statement were in scope after the for-statement
1285 ended. We only use the new rules in flag_new_for_scope is
1288 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1290 /* Remove declarations for all the DECLs in this level. */
1291 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1293 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1296 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1300 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1302 ns_binding
= NULL_TREE
;
1305 && (BINDING_LEVEL (outer_binding
)
1306 == current_binding_level
->level_chain
))
1307 /* We have something like:
1312 and we are leaving the `for' scope. There's no reason to
1313 keep the binding of the inner `i' in this case. */
1314 pop_binding (DECL_NAME (link
), link
);
1315 else if ((outer_binding
1316 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1319 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1320 /* Here, we have something like:
1328 We must pop the for-scope binding so we know what's a
1329 type and what isn't. */
1330 pop_binding (DECL_NAME (link
), link
);
1333 /* Mark this VAR_DECL as dead so that we can tell we left it
1334 there only for backward compatibility. */
1335 DECL_DEAD_FOR_LOCAL (link
) = 1;
1337 /* Keep track of what should of have happenned when we
1338 popped the binding. */
1339 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1340 DECL_SHADOWED_FOR_VAR (link
)
1341 = BINDING_VALUE (outer_binding
);
1343 /* Add it to the list of dead variables in the next
1344 outermost binding to that we can remove these when we
1345 leave that binding. */
1346 current_binding_level
->level_chain
->dead_vars_from_for
1347 = tree_cons (NULL_TREE
, link
,
1348 current_binding_level
->level_chain
->
1349 dead_vars_from_for
);
1351 /* Although we don't pop the CPLUS_BINDING, we do clear
1352 its BINDING_LEVEL since the level is going away now. */
1353 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1359 /* Remove the binding. */
1361 if (TREE_CODE (decl
) == TREE_LIST
)
1362 decl
= TREE_VALUE (decl
);
1363 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1364 pop_binding (DECL_NAME (decl
), decl
);
1365 else if (TREE_CODE (decl
) == OVERLOAD
)
1366 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1368 my_friendly_abort (0);
1372 /* Remove declarations for any `for' variables from inner scopes
1373 that we kept around. */
1374 for (link
= current_binding_level
->dead_vars_from_for
;
1375 link
; link
= TREE_CHAIN (link
))
1376 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1378 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1379 for (link
= current_binding_level
->type_shadowed
;
1380 link
; link
= TREE_CHAIN (link
))
1381 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1383 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1384 for (link
= current_binding_level
->shadowed_labels
;
1386 link
= TREE_CHAIN (link
))
1389 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1390 list if a `using' declaration put them there. The debugging
1391 back-ends won't understand OVERLOAD, so we remove them here.
1392 Because the BLOCK_VARS are (temporarily) shared with
1393 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1394 popped all the bindings. */
1399 for (d
= &BLOCK_VARS (block
); *d
; )
1401 if (TREE_CODE (*d
) == TREE_LIST
)
1402 *d
= TREE_CHAIN (*d
);
1404 d
= &TREE_CHAIN (*d
);
1408 /* If the level being exited is the top level of a function,
1409 check over all the labels. */
1412 /* Since this is the top level block of a function, the vars are
1413 the function's parameters. Don't leave them in the BLOCK
1414 because they are found in the FUNCTION_DECL instead. */
1415 BLOCK_VARS (block
) = 0;
1419 /* Any uses of undefined labels now operate under constraints
1420 of next binding contour. */
1421 if (current_function
)
1423 struct binding_level
*level_chain
;
1424 level_chain
= current_binding_level
->level_chain
;
1427 struct named_label_list
*labels
;
1428 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1429 if (labels
->binding_level
== current_binding_level
)
1431 labels
->binding_level
= level_chain
;
1432 labels
->names_in_scope
= level_chain
->names
;
1437 tmp
= current_binding_level
->keep
;
1439 pop_binding_level ();
1441 DECL_INITIAL (current_function_decl
) = block
;
1444 if (!block_previously_created
)
1445 current_binding_level
->blocks
1446 = chainon (current_binding_level
->blocks
, block
);
1448 /* If we did not make a block for the level just exited,
1449 any blocks made for inner levels
1450 (since they cannot be recorded as subblocks in that level)
1451 must be carried forward so they will later become subblocks
1452 of something else. */
1454 current_binding_level
->blocks
1455 = chainon (current_binding_level
->blocks
, subblocks
);
1457 /* Take care of compiler's internal binding structures. */
1460 expand_end_bindings (getdecls (), keep
, 1);
1461 /* Each and every BLOCK node created here in `poplevel' is important
1462 (e.g. for proper debugging information) so if we created one
1463 earlier, mark it as "used". */
1465 TREE_USED (block
) = 1;
1466 block
= poplevel (keep
, reverse
, real_functionbody
);
1469 /* Each and every BLOCK node created here in `poplevel' is important
1470 (e.g. for proper debugging information) so if we created one
1471 earlier, mark it as "used". */
1473 TREE_USED (block
) = 1;
1477 /* Delete the node BLOCK from the current binding level.
1478 This is used for the block inside a stmt expr ({...})
1479 so that the block can be reinserted where appropriate. */
1482 delete_block (block
)
1486 if (current_binding_level
->blocks
== block
)
1487 current_binding_level
->blocks
= TREE_CHAIN (block
);
1488 for (t
= current_binding_level
->blocks
; t
;)
1490 if (TREE_CHAIN (t
) == block
)
1491 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1495 TREE_CHAIN (block
) = NULL_TREE
;
1496 /* Clear TREE_USED which is always set by poplevel.
1497 The flag is set again if insert_block is called. */
1498 TREE_USED (block
) = 0;
1501 /* Insert BLOCK at the end of the list of subblocks of the
1502 current binding level. This is used when a BIND_EXPR is expanded,
1503 to handle the BLOCK node inside the BIND_EXPR. */
1506 insert_block (block
)
1509 TREE_USED (block
) = 1;
1510 current_binding_level
->blocks
1511 = chainon (current_binding_level
->blocks
, block
);
1514 /* Set the BLOCK node for the innermost scope
1515 (the one we are currently in). */
1519 register tree block
;
1521 current_binding_level
->this_block
= block
;
1524 /* Do a pushlevel for class declarations. */
1529 register struct binding_level
*newlevel
;
1531 /* Reuse or create a struct for this binding level. */
1532 #if defined(DEBUG_CP_BINDING_LEVELS)
1534 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1535 if (free_binding_level
)
1536 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1538 newlevel
= free_binding_level
;
1539 free_binding_level
= free_binding_level
->level_chain
;
1542 newlevel
= make_binding_level ();
1544 #if defined(DEBUG_CP_BINDING_LEVELS)
1546 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1548 push_binding_level (newlevel
, 0, 0);
1550 class_binding_level
= current_binding_level
;
1551 class_binding_level
->parm_flag
= 2;
1554 /* ...and a poplevel for class declarations. */
1559 register struct binding_level
*level
= class_binding_level
;
1562 my_friendly_assert (level
!= 0, 354);
1564 /* If we're leaving a toplevel class, don't bother to do the setting
1565 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1566 shouldn't even be used when current_class_type isn't set, and second,
1567 if we don't touch it here, we're able to use the cache effect if the
1568 next time we're entering a class scope, it is the same class. */
1569 if (current_class_depth
!= 1)
1571 struct binding_level
* b
;
1573 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1574 for (shadowed
= level
->class_shadowed
;
1576 shadowed
= TREE_CHAIN (shadowed
))
1577 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1579 /* Find the next enclosing class, and recreate
1580 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1581 b
= level
->level_chain
;
1582 while (b
&& b
->parm_flag
!= 2)
1586 for (shadowed
= b
->class_shadowed
;
1588 shadowed
= TREE_CHAIN (shadowed
))
1592 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1593 while (t
&& BINDING_LEVEL (t
) != b
)
1597 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1598 = BINDING_VALUE (t
);
1602 /* Remember to save what IDENTIFIER's were bound in this scope so we
1603 can recover from cache misses. */
1605 previous_class_type
= current_class_type
;
1606 previous_class_values
= class_binding_level
->class_shadowed
;
1608 for (shadowed
= level
->type_shadowed
;
1610 shadowed
= TREE_CHAIN (shadowed
))
1611 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1613 /* Remove the bindings for all of the class-level declarations. */
1614 for (shadowed
= level
->class_shadowed
;
1616 shadowed
= TREE_CHAIN (shadowed
))
1617 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1619 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1620 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1621 class_binding_level
->parm_flag
,
1622 class_binding_level
->keep
);
1624 /* Now, pop out of the binding level which we created up in the
1625 `pushlevel_class' routine. */
1626 #if defined(DEBUG_CP_BINDING_LEVELS)
1628 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1630 pop_binding_level ();
1633 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1634 for any names in enclosing classes. */
1637 clear_identifier_class_values ()
1641 if (!class_binding_level
)
1644 for (t
= class_binding_level
->class_shadowed
;
1647 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1650 /* Returns non-zero if T is a virtual function table. */
1653 vtable_decl_p (t
, data
)
1655 void *data ATTRIBUTE_UNUSED
;
1657 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1660 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1664 vtype_decl_p (t
, data
)
1666 void *data ATTRIBUTE_UNUSED
;
1668 return (TREE_CODE (t
) == TYPE_DECL
1669 && TREE_TYPE (t
) != error_mark_node
1670 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1671 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1674 /* Return the declarations that are members of the namespace NS. */
1677 cp_namespace_decls (ns
)
1680 return NAMESPACE_LEVEL (ns
)->names
;
1683 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1684 itself, calling F for each. The DATA is passed to F as well. */
1687 walk_namespaces_r (namespace, f
, data
)
1689 walk_namespaces_fn f
;
1695 result
|= (*f
) (namespace, data
);
1697 for (current
= cp_namespace_decls (namespace);
1699 current
= TREE_CHAIN (current
))
1701 if (TREE_CODE (current
) != NAMESPACE_DECL
1702 || DECL_NAMESPACE_ALIAS (current
))
1704 if (!DECL_LANG_SPECIFIC (current
))
1707 my_friendly_assert (current
== std_node
, 393);
1711 /* We found a namespace. */
1712 result
|= walk_namespaces_r (current
, f
, data
);
1718 /* Walk all the namespaces, calling F for each. The DATA is passed to
1722 walk_namespaces (f
, data
)
1723 walk_namespaces_fn f
;
1726 return walk_namespaces_r (global_namespace
, f
, data
);
1729 struct walk_globals_data
{
1730 walk_globals_pred p
;
1735 /* Walk the global declarations in NAMESPACE. Whenever one is found
1736 for which P returns non-zero, call F with its address. If any call
1737 to F returns a non-zero value, return a non-zero value. */
1740 walk_globals_r (namespace, data
)
1744 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1745 walk_globals_pred p
= wgd
->p
;
1746 walk_globals_fn f
= wgd
->f
;
1747 void *d
= wgd
->data
;
1751 t
= &NAMESPACE_LEVEL (namespace)->names
;
1758 result
|= (*f
) (t
, d
);
1760 /* If F changed *T, then *T still points at the next item to
1763 t
= &TREE_CHAIN (*t
);
1769 /* Walk the global declarations. Whenever one is found for which P
1770 returns non-zero, call F with its address. If any call to F
1771 returns a non-zero value, return a non-zero value. */
1774 walk_globals (p
, f
, data
)
1775 walk_globals_pred p
;
1779 struct walk_globals_data wgd
;
1784 return walk_namespaces (walk_globals_r
, &wgd
);
1787 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1788 DATA is non-NULL, this is the last time we will call
1789 wrapup_global_declarations for this NAMESPACE. */
1792 wrapup_globals_for_namespace (namespace, data
)
1796 tree globals
= cp_namespace_decls (namespace);
1797 int len
= list_length (globals
);
1798 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1802 int last_time
= (data
!= 0);
1804 if (last_time
&& namespace == global_namespace
)
1805 /* Let compile_file handle the global namespace. */
1808 /* Process the decls in reverse order--earliest first.
1809 Put them into VEC from back to front, then take out from front. */
1811 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1812 vec
[len
- i
- 1] = decl
;
1816 check_global_declarations (vec
, len
);
1820 /* Temporarily mark vtables as external. That prevents
1821 wrapup_global_declarations from writing them out; we must process
1822 them ourselves in finish_vtable_vardecl. */
1823 for (i
= 0; i
< len
; ++i
)
1824 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1826 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1827 DECL_EXTERNAL (vec
[i
]) = 1;
1830 /* Write out any globals that need to be output. */
1831 result
= wrapup_global_declarations (vec
, len
);
1833 /* Undo the hack to DECL_EXTERNAL above. */
1834 for (i
= 0; i
< len
; ++i
)
1835 if (vtable_decl_p (vec
[i
], /*data=*/0)
1836 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1838 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1839 DECL_EXTERNAL (vec
[i
]) = 0;
1846 /* Mark ARG (which is really a struct binding_level **) for GC. */
1849 mark_binding_level (arg
)
1852 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1856 ggc_mark_tree (lvl
->names
);
1857 ggc_mark_tree (lvl
->tags
);
1858 ggc_mark_tree (lvl
->usings
);
1859 ggc_mark_tree (lvl
->using_directives
);
1860 ggc_mark_tree (lvl
->class_shadowed
);
1861 ggc_mark_tree (lvl
->type_shadowed
);
1862 ggc_mark_tree (lvl
->shadowed_labels
);
1863 ggc_mark_tree (lvl
->blocks
);
1864 ggc_mark_tree (lvl
->this_block
);
1865 ggc_mark_tree (lvl
->incomplete
);
1866 ggc_mark_tree (lvl
->dead_vars_from_for
);
1868 lvl
= lvl
->level_chain
;
1872 /* For debugging. */
1873 static int no_print_functions
= 0;
1874 static int no_print_builtins
= 0;
1877 print_binding_level (lvl
)
1878 struct binding_level
*lvl
;
1882 fprintf (stderr
, " blocks=");
1883 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1884 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1885 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1886 if (lvl
->tag_transparent
)
1887 fprintf (stderr
, " tag-transparent");
1888 if (lvl
->more_cleanups_ok
)
1889 fprintf (stderr
, " more-cleanups-ok");
1890 if (lvl
->have_cleanups
)
1891 fprintf (stderr
, " have-cleanups");
1892 fprintf (stderr
, "\n");
1895 fprintf (stderr
, " names:\t");
1896 /* We can probably fit 3 names to a line? */
1897 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1899 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1901 if (no_print_builtins
1902 && (TREE_CODE (t
) == TYPE_DECL
)
1903 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1906 /* Function decls tend to have longer names. */
1907 if (TREE_CODE (t
) == FUNCTION_DECL
)
1914 fprintf (stderr
, "\n\t");
1917 print_node_brief (stderr
, "", t
, 0);
1918 if (t
== error_mark_node
)
1922 fprintf (stderr
, "\n");
1926 fprintf (stderr
, " tags:\t");
1928 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1930 if (TREE_PURPOSE (t
) == NULL_TREE
)
1932 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1939 fprintf (stderr
, "\n\t");
1942 if (TREE_PURPOSE (t
) == NULL_TREE
)
1944 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1945 fprintf (stderr
, ">");
1947 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1948 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1951 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1952 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1953 fprintf (stderr
, ">");
1957 fprintf (stderr
, "\n");
1959 if (lvl
->class_shadowed
)
1961 fprintf (stderr
, " class-shadowed:");
1962 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1964 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1966 fprintf (stderr
, "\n");
1968 if (lvl
->type_shadowed
)
1970 fprintf (stderr
, " type-shadowed:");
1971 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1973 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1975 fprintf (stderr
, "\n");
1980 print_other_binding_stack (stack
)
1981 struct binding_level
*stack
;
1983 struct binding_level
*level
;
1984 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1986 fprintf (stderr
, "binding level ");
1987 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1988 fprintf (stderr
, "\n");
1989 print_binding_level (level
);
1994 print_binding_stack ()
1996 struct binding_level
*b
;
1997 fprintf (stderr
, "current_binding_level=");
1998 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
1999 fprintf (stderr
, "\nclass_binding_level=");
2000 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2001 fprintf (stderr
, "\nglobal_binding_level=");
2002 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2003 fprintf (stderr
, "\n");
2004 if (class_binding_level
)
2006 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2007 if (b
== current_binding_level
)
2010 b
= class_binding_level
;
2012 b
= current_binding_level
;
2015 b
= current_binding_level
;
2016 print_other_binding_stack (b
);
2017 fprintf (stderr
, "global:\n");
2018 print_binding_level (global_binding_level
);
2021 /* Namespace binding access routines: The namespace_bindings field of
2022 the identifier is polymorphic, with three possible values:
2023 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2024 indicating the BINDING_VALUE of global_namespace. */
2026 /* Check whether the a binding for the name to scope is known.
2027 Assumes that the bindings of the name are already a list
2028 of bindings. Returns the binding found, or NULL_TREE. */
2031 find_binding (name
, scope
)
2035 tree iter
, prev
= NULL_TREE
;
2037 scope
= ORIGINAL_NAMESPACE (scope
);
2039 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2040 iter
= TREE_CHAIN (iter
))
2042 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2043 if (BINDING_SCOPE (iter
) == scope
)
2045 /* Move binding found to the front of the list, so
2046 subsequent lookups will find it faster. */
2049 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2050 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2051 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2060 /* Always returns a binding for name in scope. If the
2061 namespace_bindings is not a list, convert it to one first.
2062 If no binding is found, make a new one. */
2065 binding_for_name (name
, scope
)
2069 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2072 scope
= ORIGINAL_NAMESPACE (scope
);
2074 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2076 /* Get rid of optimization for global scope. */
2077 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2078 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2079 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2081 if (b
&& (result
= find_binding (name
, scope
)))
2083 /* Not found, make a new permanent one. */
2084 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2085 result
= make_node (CPLUS_BINDING
);
2086 TREE_CHAIN (result
) = b
;
2087 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2088 BINDING_SCOPE (result
) = scope
;
2089 BINDING_TYPE (result
) = NULL_TREE
;
2090 BINDING_VALUE (result
) = NULL_TREE
;
2095 /* Return the binding value for name in scope, considering that
2096 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2099 namespace_binding (name
, scope
)
2103 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2106 if (scope
== NULL_TREE
)
2107 scope
= global_namespace
;
2108 if (TREE_CODE (b
) != CPLUS_BINDING
)
2109 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2110 name
= find_binding (name
,scope
);
2111 if (name
== NULL_TREE
)
2113 return BINDING_VALUE (name
);
2116 /* Set the binding value for name in scope. If modifying the binding
2117 of global_namespace is attempted, try to optimize it. */
2120 set_namespace_binding (name
, scope
, val
)
2127 if (scope
== NULL_TREE
)
2128 scope
= global_namespace
;
2130 if (scope
== global_namespace
)
2132 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2133 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2135 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2139 b
= binding_for_name (name
, scope
);
2140 BINDING_VALUE (b
) = val
;
2143 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2144 select a name that is unique to this compilation unit. */
2147 push_namespace (name
)
2152 int implicit_use
= 0;
2154 if (!global_namespace
)
2156 /* This must be ::. */
2157 my_friendly_assert (name
== get_identifier ("::"), 377);
2162 /* The name of anonymous namespace is unique for the translation
2164 if (!anonymous_namespace_name
)
2165 anonymous_namespace_name
= get_file_function_name ('N');
2166 name
= anonymous_namespace_name
;
2167 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2169 /* Reopening anonymous namespace. */
2173 else if (current_namespace
== global_namespace
2174 && name
== DECL_NAME (std_node
))
2181 /* Check whether this is an extended namespace definition. */
2182 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2183 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2186 if (DECL_NAMESPACE_ALIAS (d
))
2188 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2189 d
, DECL_NAMESPACE_ALIAS (d
));
2190 d
= DECL_NAMESPACE_ALIAS (d
);
2197 /* Make a new namespace, binding the name to it. */
2198 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2199 /* The global namespace is not pushed, and the global binding
2200 level is set elsewhere. */
2205 declare_namespace_level ();
2206 NAMESPACE_LEVEL (d
) = current_binding_level
;
2210 resume_binding_level (NAMESPACE_LEVEL (d
));
2213 do_using_directive (d
);
2214 /* Enter the name space. */
2215 current_namespace
= d
;
2218 /* Pop from the scope of the current namespace. */
2223 if (current_namespace
== global_namespace
)
2225 my_friendly_assert (in_std
>0, 980421);
2229 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2230 /* The binding level is not popped, as it might be re-opened later. */
2231 suspend_binding_level ();
2234 /* Push into the scope of the namespace NS, even if it is deeply
2235 nested within another namespace. */
2238 push_nested_namespace (ns
)
2241 if (ns
== global_namespace
)
2242 push_to_top_level ();
2245 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2246 push_namespace (DECL_NAME (ns
));
2250 /* Pop back from the scope of the namespace NS, which was previously
2251 entered with push_nested_namespace. */
2254 pop_nested_namespace (ns
)
2257 while (ns
!= global_namespace
)
2260 ns
= CP_DECL_CONTEXT (ns
);
2263 pop_from_top_level ();
2267 /* Subroutines for reverting temporarily to top-level for instantiation
2268 of templates and such. We actually need to clear out the class- and
2269 local-value slots of all identifiers, so that only the global values
2270 are at all visible. Simply setting current_binding_level to the global
2271 scope isn't enough, because more binding levels may be pushed. */
2272 struct saved_scope
*scope_chain
;
2274 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2277 mark_saved_scope (arg
)
2280 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2283 mark_binding_level (&t
->class_bindings
);
2284 ggc_mark_tree (t
->old_bindings
);
2285 ggc_mark_tree (t
->old_namespace
);
2286 ggc_mark_tree (t
->class_name
);
2287 ggc_mark_tree (t
->class_type
);
2288 ggc_mark_tree (t
->access_specifier
);
2289 ggc_mark_tree (t
->function_decl
);
2291 ggc_mark_tree_varray (t
->lang_base
);
2292 ggc_mark_tree (t
->lang_name
);
2293 ggc_mark_tree (t
->x_function_parms
);
2294 ggc_mark_tree (t
->template_parms
);
2295 ggc_mark_tree (t
->x_previous_class_type
);
2296 ggc_mark_tree (t
->x_previous_class_values
);
2297 mark_binding_level (&t
->bindings
);
2303 store_bindings (names
, old_bindings
)
2304 tree names
, old_bindings
;
2307 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2309 tree binding
, t1
, id
;
2311 if (TREE_CODE (t
) == TREE_LIST
)
2312 id
= TREE_PURPOSE (t
);
2317 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2318 we have no IDENTIFIER_BINDING if we have left the class
2319 scope, but cached the class-level declarations. */
2320 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2323 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2324 if (TREE_VEC_ELT (t1
, 0) == id
)
2327 binding
= make_tree_vec (4);
2331 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2332 TREE_VEC_ELT (binding
, 0) = id
;
2333 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2334 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2335 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2336 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2337 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2339 TREE_CHAIN (binding
) = old_bindings
;
2340 old_bindings
= binding
;
2344 return old_bindings
;
2348 maybe_push_to_top_level (pseudo
)
2351 struct saved_scope
*s
;
2352 struct binding_level
*b
;
2356 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2358 b
= scope_chain
? current_binding_level
: 0;
2360 /* If we're in the middle of some function, save our state. */
2361 if (current_function
)
2364 push_function_context_to (NULL_TREE
);
2369 old_bindings
= NULL_TREE
;
2370 if (scope_chain
&& previous_class_type
)
2371 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2373 /* Have to include global_binding_level, because class-level decls
2374 aren't listed anywhere useful. */
2375 for (; b
; b
= b
->level_chain
)
2379 /* Template IDs are inserted into the global level. If they were
2380 inserted into namespace level, finish_file wouldn't find them
2381 when doing pending instantiations. Therefore, don't stop at
2382 namespace level, but continue until :: . */
2383 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2386 old_bindings
= store_bindings (b
->names
, old_bindings
);
2387 /* We also need to check class_shadowed to save class-level type
2388 bindings, since pushclass doesn't fill in b->names. */
2389 if (b
->parm_flag
== 2)
2390 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2392 /* Unwind type-value slots back to top level. */
2393 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2394 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2396 s
->prev
= scope_chain
;
2397 s
->old_bindings
= old_bindings
;
2399 s
->need_pop_function_context
= need_pop
;
2400 s
->function_decl
= current_function_decl
;
2403 current_function_decl
= NULL_TREE
;
2404 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2405 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2406 current_lang_name
= lang_name_cplusplus
;
2407 strict_prototype
= strict_prototypes_lang_cplusplus
;
2408 current_namespace
= global_namespace
;
2410 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2414 push_to_top_level ()
2416 maybe_push_to_top_level (0);
2420 pop_from_top_level ()
2422 struct saved_scope
*s
= scope_chain
;
2425 /* Clear out class-level bindings cache. */
2426 if (previous_class_type
)
2427 invalidate_class_lookup_cache ();
2431 VARRAY_FREE (current_lang_base
);
2433 scope_chain
= s
->prev
;
2434 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2436 tree id
= TREE_VEC_ELT (t
, 0);
2439 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2440 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2441 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2445 if (current_lang_name
== lang_name_cplusplus
)
2446 strict_prototype
= strict_prototypes_lang_cplusplus
;
2447 else if (current_lang_name
== lang_name_c
)
2448 strict_prototype
= strict_prototypes_lang_c
;
2450 /* If we were in the middle of compiling a function, restore our
2452 if (s
->need_pop_function_context
)
2453 pop_function_context_from (NULL_TREE
);
2454 current_function_decl
= s
->function_decl
;
2459 /* Push a definition of struct, union or enum tag "name".
2460 into binding_level "b". "type" should be the type node,
2461 We assume that the tag "name" is not already defined.
2463 Note that the definition may really be just a forward reference.
2464 In that case, the TYPE_SIZE will be a NULL_TREE.
2466 C++ gratuitously puts all these tags in the name space. */
2468 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2469 record the shadowed value for this binding contour. TYPE is
2470 the type that ID maps to. */
2473 set_identifier_type_value_with_scope (id
, type
, b
)
2476 struct binding_level
*b
;
2478 if (!b
->namespace_p
)
2480 /* Shadow the marker, not the real thing, so that the marker
2481 gets restored later. */
2482 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2484 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2488 tree binding
= binding_for_name (id
, current_namespace
);
2489 BINDING_TYPE (binding
) = type
;
2490 /* Store marker instead of real type. */
2491 type
= global_type_node
;
2493 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2496 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2499 set_identifier_type_value (id
, type
)
2503 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2506 /* Return the type associated with id. */
2509 identifier_type_value (id
)
2512 /* There is no type with that name, anywhere. */
2513 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2515 /* This is not the type marker, but the real thing. */
2516 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2517 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2518 /* Have to search for it. It must be on the global level, now.
2519 Ask lookup_name not to return non-types. */
2520 id
= lookup_name_real (id
, 2, 1, 0);
2522 return TREE_TYPE (id
);
2526 /* Pop off extraneous binding levels left over due to syntax errors.
2528 We don't pop past namespaces, as they might be valid. */
2533 #ifdef DEBUG_CP_BINDING_LEVELS
2534 fprintf (stderr
, "XXX entering pop_everything ()\n");
2536 while (!toplevel_bindings_p ())
2538 if (current_binding_level
->parm_flag
== 2)
2539 pop_nested_class ();
2543 #ifdef DEBUG_CP_BINDING_LEVELS
2544 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2548 /* The type TYPE is being declared. If it is a class template, or a
2549 specialization of a class template, do any processing required and
2550 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2551 being declared a friend. B is the binding level at which this TYPE
2554 Returns the TYPE_DECL for TYPE, which may have been altered by this
2558 maybe_process_template_type_declaration (type
, globalize
, b
)
2561 struct binding_level
* b
;
2563 tree decl
= TYPE_NAME (type
);
2565 if (processing_template_parmlist
)
2566 /* You can't declare a new template type in a template parameter
2567 list. But, you can declare a non-template type:
2569 template <class A*> struct S;
2571 is a forward-declaration of `A'. */
2575 maybe_check_template_type (type
);
2577 my_friendly_assert (IS_AGGR_TYPE (type
)
2578 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2581 if (processing_template_decl
)
2583 /* This may change after the call to
2584 push_template_decl_real, but we want the original value. */
2585 tree name
= DECL_NAME (decl
);
2587 decl
= push_template_decl_real (decl
, globalize
);
2588 /* If the current binding level is the binding level for the
2589 template parameters (see the comment in
2590 begin_template_parm_list) and the enclosing level is a class
2591 scope, and we're not looking at a friend, push the
2592 declaration of the member class into the class scope. In the
2593 friend case, push_template_decl will already have put the
2594 friend into global scope, if appropriate. */
2595 if (TREE_CODE (type
) != ENUMERAL_TYPE
2596 && !globalize
&& b
->pseudo_global
2597 && b
->level_chain
->parm_flag
== 2)
2599 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2600 /* Put this tag on the list of tags for the class, since
2601 that won't happen below because B is not the class
2602 binding level, but is instead the pseudo-global level. */
2603 b
->level_chain
->tags
=
2604 tree_cons (name
, type
, b
->level_chain
->tags
);
2605 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2606 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2614 /* In C++, you don't have to write `struct S' to refer to `S'; you
2615 can just use `S'. We accomplish this by creating a TYPE_DECL as
2616 if the user had written `typedef struct S S'. Create and return
2617 the TYPE_DECL for TYPE. */
2620 create_implicit_typedef (name
, type
)
2626 decl
= build_decl (TYPE_DECL
, name
, type
);
2627 SET_DECL_ARTIFICIAL (decl
);
2628 /* There are other implicit type declarations, like the one *within*
2629 a class that allows you to write `S::S'. We must distinguish
2631 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2632 TYPE_NAME (type
) = decl
;
2637 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2638 Normally put it into the inner-most non-tag-transparent scope,
2639 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2640 The latter is needed for implicit declarations. */
2643 pushtag (name
, type
, globalize
)
2647 register struct binding_level
*b
;
2649 b
= current_binding_level
;
2650 while (b
->tag_transparent
2651 || (globalize
&& b
->parm_flag
== 2))
2654 b
->tags
= tree_cons (name
, type
, b
->tags
);
2658 /* Do C++ gratuitous typedefing. */
2659 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2661 register tree d
= NULL_TREE
;
2663 tree context
= TYPE_CONTEXT (type
);
2667 tree cs
= current_scope ();
2671 else if (cs
!= NULL_TREE
2672 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2673 /* When declaring a friend class of a local class, we want
2674 to inject the newly named class into the scope
2675 containing the local class, not the namespace scope. */
2676 context
= hack_decl_function_context (get_type_decl (cs
));
2679 context
= current_namespace
;
2681 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2682 || b
->parm_flag
== 2)
2685 if (current_lang_name
== lang_name_java
)
2686 TYPE_FOR_JAVA (type
) = 1;
2688 d
= create_implicit_typedef (name
, type
);
2689 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2691 set_identifier_type_value_with_scope (name
, type
, b
);
2693 d
= maybe_process_template_type_declaration (type
,
2696 if (b
->parm_flag
== 2)
2698 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2699 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2700 class. But if it's a member template class, we
2701 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2703 finish_member_declaration (d
);
2705 pushdecl_class_level (d
);
2708 d
= pushdecl_with_scope (d
, b
);
2710 if (ANON_AGGRNAME_P (name
))
2711 DECL_IGNORED_P (d
) = 1;
2713 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2714 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2715 if (!uses_template_parms (type
))
2716 DECL_ASSEMBLER_NAME (d
)
2717 = get_identifier (build_overload_name (type
, 1, 1));
2719 if (b
->parm_flag
== 2)
2721 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2722 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2726 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2727 /* Use the canonical TYPE_DECL for this node. */
2728 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2731 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2732 will be the tagged type we just added to the current
2733 binding level. This fake NULL-named TYPE_DECL node helps
2734 dwarfout.c to know when it needs to output a
2735 representation of a tagged type, and it also gives us a
2736 convenient place to record the "scope start" address for
2739 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2740 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2744 /* Counter used to create anonymous type names. */
2746 static int anon_cnt
= 0;
2748 /* Return an IDENTIFIER which can be used as a name for
2749 anonymous structs and unions. */
2756 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2757 return get_identifier (buf
);
2760 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2761 This keeps dbxout from getting confused. */
2766 register struct binding_level
*b
;
2768 static int last_cnt
= 0;
2770 /* Fast out if no new anon names were declared. */
2771 if (last_cnt
== anon_cnt
)
2774 b
= current_binding_level
;
2775 while (b
->tag_transparent
)
2780 /* A NULL purpose means we have already processed all tags
2781 from here to the end of the list. */
2782 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2784 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2785 TREE_PURPOSE (tags
) = NULL_TREE
;
2786 tags
= TREE_CHAIN (tags
);
2788 last_cnt
= anon_cnt
;
2791 /* Subroutine of duplicate_decls: return truthvalue of whether
2792 or not types of these decls match.
2794 For C++, we must compare the parameter list so that `int' can match
2795 `int&' in a parameter position, but `int&' is not confused with
2799 decls_match (newdecl
, olddecl
)
2800 tree newdecl
, olddecl
;
2804 if (newdecl
== olddecl
)
2807 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2808 /* If the two DECLs are not even the same kind of thing, we're not
2809 interested in their types. */
2812 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2814 tree f1
= TREE_TYPE (newdecl
);
2815 tree f2
= TREE_TYPE (olddecl
);
2816 tree p1
= TYPE_ARG_TYPES (f1
);
2817 tree p2
= TYPE_ARG_TYPES (f2
);
2819 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2820 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2821 && DECL_LANGUAGE (olddecl
) == lang_c
))
2824 /* When we parse a static member function definition,
2825 we put together a FUNCTION_DECL which thinks its type
2826 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2828 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2829 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2830 else if (TREE_CODE (f2
) == METHOD_TYPE
2831 && DECL_STATIC_FUNCTION_P (newdecl
))
2832 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2834 /* Here we must take care of the case where new default
2835 parameters are specified. Also, warn if an old
2836 declaration becomes ambiguous because default
2837 parameters may cause the two to be ambiguous. */
2838 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2840 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2841 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2843 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2847 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2849 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2852 types_match
= self_promoting_args_p (p1
);
2853 if (p1
== void_list_node
)
2854 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2856 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2857 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2859 types_match
= self_promoting_args_p (p2
);
2860 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2863 types_match
= compparms (p1
, p2
);
2868 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2870 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2871 DECL_TEMPLATE_PARMS (olddecl
)))
2874 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2877 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2878 DECL_TEMPLATE_RESULT (newdecl
));
2882 if (TREE_TYPE (newdecl
) == error_mark_node
)
2883 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2884 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2885 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2886 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2889 types_match
= comptypes (TREE_TYPE (newdecl
),
2890 TREE_TYPE (olddecl
),
2891 COMPARE_REDECLARATION
);
2897 /* If NEWDECL is `static' and an `extern' was seen previously,
2898 warn about it. OLDDECL is the previous declaration.
2900 Note that this does not apply to the C++ case of declaring
2901 a variable `extern const' and then later `const'.
2903 Don't complain about built-in functions, since they are beyond
2904 the user's control. */
2907 warn_extern_redeclared_static (newdecl
, olddecl
)
2908 tree newdecl
, olddecl
;
2910 static const char *explicit_extern_static_warning
2911 = "`%D' was declared `extern' and later `static'";
2912 static const char *implicit_extern_static_warning
2913 = "`%D' was declared implicitly `extern' and later `static'";
2917 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2920 /* Don't get confused by static member functions; that's a different
2922 if (TREE_CODE (newdecl
) == FUNCTION_DECL
2923 && DECL_STATIC_FUNCTION_P (newdecl
))
2926 /* If the old declaration was `static', or the new one isn't, then
2927 then everything is OK. */
2928 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
2931 /* It's OK to declare a builtin function as `static'. */
2932 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2933 && DECL_ARTIFICIAL (olddecl
))
2936 name
= DECL_ASSEMBLER_NAME (newdecl
);
2937 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2938 ? implicit_extern_static_warning
2939 : explicit_extern_static_warning
, newdecl
);
2940 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2943 /* Handle when a new declaration NEWDECL has the same name as an old
2944 one OLDDECL in the same binding contour. Prints an error message
2947 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2948 Otherwise, return 0. */
2951 duplicate_decls (newdecl
, olddecl
)
2952 tree newdecl
, olddecl
;
2954 unsigned olddecl_uid
= DECL_UID (olddecl
);
2955 int olddecl_friend
= 0, types_match
= 0;
2956 int new_defines_function
= 0;
2958 if (newdecl
== olddecl
)
2961 types_match
= decls_match (newdecl
, olddecl
);
2963 /* If either the type of the new decl or the type of the old decl is an
2964 error_mark_node, then that implies that we have already issued an
2965 error (earlier) for some bogus type specification, and in that case,
2966 it is rather pointless to harass the user with yet more error message
2967 about the same declaration, so just pretend the types match here. */
2968 if (TREE_TYPE (newdecl
) == error_mark_node
2969 || TREE_TYPE (olddecl
) == error_mark_node
)
2972 /* Check for redeclaration and other discrepancies. */
2973 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2974 && DECL_ARTIFICIAL (olddecl
))
2976 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2978 /* If you declare a built-in or predefined function name as static,
2979 the old definition is overridden, but optionally warn this was a
2980 bad choice of name. */
2981 if (! TREE_PUBLIC (newdecl
))
2984 cp_warning ("shadowing %s function `%#D'",
2985 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2987 /* Discard the old built-in function. */
2990 /* If the built-in is not ansi, then programs can override
2991 it even globally without an error. */
2992 else if (! DECL_BUILT_IN (olddecl
))
2993 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2997 cp_error ("declaration of `%#D'", newdecl
);
2998 cp_error ("conflicts with built-in declaration `%#D'",
3003 else if (!types_match
)
3005 if ((DECL_LANGUAGE (newdecl
) == lang_c
3006 && DECL_LANGUAGE (olddecl
) == lang_c
)
3007 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3008 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3010 /* A near match; override the builtin. */
3012 if (TREE_PUBLIC (newdecl
))
3014 cp_warning ("new declaration `%#D'", newdecl
);
3015 cp_warning ("ambiguates built-in declaration `%#D'",
3018 else if (warn_shadow
)
3019 cp_warning ("shadowing %s function `%#D'",
3020 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3024 /* Discard the old built-in function. */
3028 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3030 /* If a builtin function is redeclared as `static', merge
3031 the declarations, but make the original one static. */
3032 DECL_THIS_STATIC (olddecl
) = 1;
3033 TREE_PUBLIC (olddecl
) = 0;
3035 /* Make the olddeclaration consistent with the new one so that
3036 all remnants of the builtin-ness of this function will be
3038 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3039 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3040 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3041 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3045 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3047 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3048 && TREE_CODE (newdecl
) != TYPE_DECL
3049 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3050 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3051 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3052 && TREE_CODE (olddecl
) != TYPE_DECL
3053 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3054 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3057 /* We do nothing special here, because C++ does such nasty
3058 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3059 get shadowed, and know that if we need to find a TYPE_DECL
3060 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3061 slot of the identifier. */
3065 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3066 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3067 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3068 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3071 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3072 if (TREE_CODE (olddecl
) == TREE_LIST
)
3073 olddecl
= TREE_VALUE (olddecl
);
3074 cp_error_at ("previous declaration of `%#D'", olddecl
);
3076 /* New decl is completely inconsistent with the old one =>
3077 tell caller to replace the old one. */
3081 else if (!types_match
)
3083 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3084 /* These are certainly not duplicate declarations; they're
3085 from different scopes. */
3088 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3090 /* The name of a class template may not be declared to refer to
3091 any other template, class, function, object, namespace, value,
3092 or type in the same scope. */
3093 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3094 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3096 cp_error ("declaration of template `%#D'", newdecl
);
3097 cp_error_at ("conflicts with previous declaration `%#D'",
3100 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3101 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3102 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3103 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3104 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3105 DECL_TEMPLATE_PARMS (olddecl
)))
3107 cp_error ("new declaration `%#D'", newdecl
);
3108 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3112 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3114 if (DECL_LANGUAGE (newdecl
) == lang_c
3115 && DECL_LANGUAGE (olddecl
) == lang_c
)
3117 cp_error ("declaration of C function `%#D' conflicts with",
3119 cp_error_at ("previous declaration `%#D' here", olddecl
);
3121 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3122 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3124 cp_error ("new declaration `%#D'", newdecl
);
3125 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3131 /* Already complained about this, so don't do so again. */
3132 else if (current_class_type
== NULL_TREE
3133 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3135 cp_error ("conflicting types for `%#D'", newdecl
);
3136 cp_error_at ("previous declaration as `%#D'", olddecl
);
3139 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3140 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3141 && (!DECL_TEMPLATE_INFO (newdecl
)
3142 || (DECL_TI_TEMPLATE (newdecl
)
3143 != DECL_TI_TEMPLATE (olddecl
))))
3144 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3145 && (!DECL_TEMPLATE_INFO (olddecl
)
3146 || (DECL_TI_TEMPLATE (olddecl
)
3147 != DECL_TI_TEMPLATE (newdecl
))))))
3148 /* It's OK to have a template specialization and a non-template
3149 with the same type, or to have specializations of two
3150 different templates with the same type. Note that if one is a
3151 specialization, and the other is an instantiation of the same
3152 template, that we do not exit at this point. That situation
3153 can occur if we instantiate a template class, and then
3154 specialize one of its methods. This situation is legal, but
3155 the declarations must be merged in the usual way. */
3157 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3158 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3159 && !DECL_USE_TEMPLATE (newdecl
))
3160 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3161 && !DECL_USE_TEMPLATE (olddecl
))))
3162 /* One of the declarations is a template instantiation, and the
3163 other is not a template at all. That's OK. */
3165 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3166 && DECL_NAMESPACE_ALIAS (newdecl
)
3167 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3168 /* Redeclaration of namespace alias, ignore it. */
3172 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3175 cp_error (errmsg
, newdecl
);
3176 if (DECL_NAME (olddecl
) != NULL_TREE
)
3177 cp_error_at ((DECL_INITIAL (olddecl
)
3178 && namespace_bindings_p ())
3179 ? "`%#D' previously defined here"
3180 : "`%#D' previously declared here", olddecl
);
3182 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3183 && DECL_INITIAL (olddecl
) != NULL_TREE
3184 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3185 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3187 /* Prototype decl follows defn w/o prototype. */
3188 cp_warning_at ("prototype for `%#D'", newdecl
);
3189 cp_warning_at ("follows non-prototype definition here", olddecl
);
3191 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3192 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3194 /* extern "C" int foo ();
3195 int foo () { bar (); }
3197 if (current_lang_stack
3198 == &VARRAY_TREE (current_lang_base
, 0))
3199 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3202 cp_error_at ("previous declaration of `%#D' with %L linkage",
3203 olddecl
, DECL_LANGUAGE (olddecl
));
3204 cp_error ("conflicts with new declaration with %L linkage",
3205 DECL_LANGUAGE (newdecl
));
3209 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3211 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3213 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3214 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3217 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3218 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3220 for (; t1
&& t1
!= void_list_node
;
3221 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3222 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3224 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3229 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3231 cp_pedwarn_at ("after previous specification in `%#D'",
3237 cp_error ("default argument given for parameter %d of `%#D'",
3239 cp_error_at ("after previous specification in `%#D'",
3244 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3245 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3247 cp_warning ("`%#D' was used before it was declared inline",
3249 cp_warning_at ("previous non-inline declaration here",
3255 /* If new decl is `static' and an `extern' was seen previously,
3257 warn_extern_redeclared_static (newdecl
, olddecl
);
3259 /* We have committed to returning 1 at this point. */
3260 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3262 /* Now that functions must hold information normally held
3263 by field decls, there is extra work to do so that
3264 declaration information does not get destroyed during
3266 if (DECL_VINDEX (olddecl
))
3267 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3268 if (DECL_CONTEXT (olddecl
))
3269 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3270 if (DECL_CLASS_CONTEXT (olddecl
))
3271 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3272 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3273 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3274 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3275 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3276 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3277 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3278 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3279 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3280 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3282 /* Optionally warn about more than one declaration for the same
3283 name, but don't warn about a function declaration followed by a
3285 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3286 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3287 /* Don't warn about extern decl followed by definition. */
3288 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3289 /* Don't warn about friends, let add_friend take care of it. */
3290 && ! DECL_FRIEND_P (newdecl
))
3292 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3293 cp_warning_at ("previous declaration of `%D'", olddecl
);
3297 /* Deal with C++: must preserve virtual function table size. */
3298 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3300 register tree newtype
= TREE_TYPE (newdecl
);
3301 register tree oldtype
= TREE_TYPE (olddecl
);
3303 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3304 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3306 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3307 CLASSTYPE_FRIEND_CLASSES (newtype
)
3308 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3312 /* Copy all the DECL_... slots specified in the new decl
3313 except for any that we copy here from the old type. */
3314 DECL_MACHINE_ATTRIBUTES (newdecl
)
3315 = merge_machine_decl_attributes (olddecl
, newdecl
);
3317 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3319 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3320 DECL_TEMPLATE_RESULT (olddecl
)))
3321 cp_error ("invalid redeclaration of %D", newdecl
);
3322 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3323 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3324 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3325 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3332 /* Automatically handles default parameters. */
3333 tree oldtype
= TREE_TYPE (olddecl
);
3336 /* Make sure we put the new type in the same obstack as the old one. */
3338 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3340 push_permanent_obstack ();
3342 /* Merge the data types specified in the two decls. */
3343 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3345 if (TREE_CODE (newdecl
) == VAR_DECL
)
3346 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3347 /* Do this after calling `common_type' so that default
3348 parameters don't confuse us. */
3349 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3350 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3351 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3353 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3354 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3355 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3356 TYPE_RAISES_EXCEPTIONS (oldtype
));
3358 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3359 && DECL_SOURCE_LINE (olddecl
) != 0
3361 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3362 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3364 cp_error ("declaration of `%F' throws different exceptions",
3366 cp_error_at ("to previous declaration `%F'", olddecl
);
3369 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3371 /* Lay the type out, unless already done. */
3372 if (! same_type_p (newtype
, oldtype
)
3373 && TREE_TYPE (newdecl
) != error_mark_node
3374 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3375 layout_type (TREE_TYPE (newdecl
));
3377 if ((TREE_CODE (newdecl
) == VAR_DECL
3378 || TREE_CODE (newdecl
) == PARM_DECL
3379 || TREE_CODE (newdecl
) == RESULT_DECL
3380 || TREE_CODE (newdecl
) == FIELD_DECL
3381 || TREE_CODE (newdecl
) == TYPE_DECL
)
3382 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3383 layout_decl (newdecl
, 0);
3385 /* Merge the type qualifiers. */
3386 if (TREE_READONLY (newdecl
))
3387 TREE_READONLY (olddecl
) = 1;
3388 if (TREE_THIS_VOLATILE (newdecl
))
3389 TREE_THIS_VOLATILE (olddecl
) = 1;
3391 /* Merge the initialization information. */
3392 if (DECL_INITIAL (newdecl
) == NULL_TREE
3393 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3395 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3396 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3397 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3398 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3399 && DECL_LANG_SPECIFIC (newdecl
)
3400 && DECL_LANG_SPECIFIC (olddecl
))
3401 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3404 /* Merge the section attribute.
3405 We want to issue an error if the sections conflict but that must be
3406 done later in decl_attributes since we are called before attributes
3408 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3409 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3411 /* Keep the old rtl since we can safely use it. */
3412 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3416 /* If cannot merge, then use the new type and qualifiers,
3417 and don't preserve the old rtl. */
3420 /* Clean out any memory we had of the old declaration. */
3421 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3423 TREE_VALUE (oldstatic
) = error_mark_node
;
3425 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3426 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3427 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3428 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3431 /* Merge the storage class information. */
3432 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3433 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3434 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3435 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3436 if (! DECL_EXTERNAL (olddecl
))
3437 DECL_EXTERNAL (newdecl
) = 0;
3439 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3441 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3442 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3443 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3444 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3445 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3446 /* Don't really know how much of the language-specific
3447 values we should copy from old to new. */
3448 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3449 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3450 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3451 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3452 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3454 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3455 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3456 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3457 DECL_BEFRIENDING_CLASSES (newdecl
)
3458 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3459 DECL_BEFRIENDING_CLASSES (olddecl
));
3462 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3464 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3465 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3467 /* If newdecl is not a specialization, then it is not a
3468 template-related function at all. And that means that we
3469 shoud have exited above, returning 0. */
3470 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3473 if (TREE_USED (olddecl
))
3474 /* From [temp.expl.spec]:
3476 If a template, a member template or the member of a class
3477 template is explicitly specialized then that
3478 specialization shall be declared before the first use of
3479 that specialization that would cause an implicit
3480 instantiation to take place, in every translation unit in
3481 which such a use occurs. */
3482 cp_error ("explicit specialization of %D after first use",
3485 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3487 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3489 /* If either decl says `inline', this fn is inline, unless its
3490 definition was passed already. */
3491 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3492 DECL_INLINE (olddecl
) = 1;
3493 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3497 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3498 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3499 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3501 if (! types_match
|| new_defines_function
)
3503 /* These need to be copied so that the names are available.
3504 Note that if the types do match, we'll preserve inline
3505 info and other bits, but if not, we won't. */
3506 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3507 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3509 if (new_defines_function
)
3510 /* If defining a function declared with other language
3511 linkage, use the previously declared language linkage. */
3512 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3513 else if (types_match
)
3515 /* If redeclaring a builtin function, and not a definition,
3516 it stays built in. */
3517 if (DECL_BUILT_IN (olddecl
))
3519 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3520 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3521 /* If we're keeping the built-in definition, keep the rtl,
3522 regardless of declaration matches. */
3523 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3526 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3528 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3529 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3530 /* Previously saved insns go together with
3531 the function's previous definition. */
3532 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3533 /* Don't clear out the arguments if we're redefining a function. */
3534 if (DECL_ARGUMENTS (olddecl
))
3535 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3537 if (DECL_LANG_SPECIFIC (olddecl
))
3538 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3541 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3543 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3546 /* Now preserve various other info from the definition. */
3547 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3548 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3549 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3550 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3552 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3556 function_size
= sizeof (struct tree_decl
);
3558 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3559 (char *) olddecl
+ sizeof (struct tree_common
),
3560 function_size
- sizeof (struct tree_common
));
3562 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3564 /* If newdecl is a template instantiation, it is possible that
3565 the following sequence of events has occurred:
3567 o A friend function was declared in a class template. The
3568 class template was instantiated.
3570 o The instantiation of the friend declaration was
3571 recorded on the instantiation list, and is newdecl.
3573 o Later, however, instantiate_class_template called pushdecl
3574 on the newdecl to perform name injection. But, pushdecl in
3575 turn called duplicate_decls when it discovered that another
3576 declaration of a global function with the same name already
3579 o Here, in duplicate_decls, we decided to clobber newdecl.
3581 If we're going to do that, we'd better make sure that
3582 olddecl, and not newdecl, is on the list of
3583 instantiations so that if we try to do the instantiation
3584 again we won't get the clobbered declaration. */
3586 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3587 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3589 for (; decls
; decls
= TREE_CHAIN (decls
))
3590 if (TREE_VALUE (decls
) == newdecl
)
3591 TREE_VALUE (decls
) = olddecl
;
3596 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3597 (char *) olddecl
+ sizeof (struct tree_common
),
3598 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3599 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3602 DECL_UID (olddecl
) = olddecl_uid
;
3604 DECL_FRIEND_P (olddecl
) = 1;
3606 /* NEWDECL contains the merged attribute lists.
3607 Update OLDDECL to be the same. */
3608 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3613 /* Record a decl-node X as belonging to the current lexical scope.
3614 Check for errors (such as an incompatible declaration for the same
3615 name already seen in the same scope).
3617 Returns either X or an old decl for the same name.
3618 If an old decl is returned, it may have been smashed
3619 to agree with what X says. */
3627 int need_new_binding
;
3629 /* We shouldn't be calling pushdecl when we're generating RTL for a
3630 function that we already did semantic analysis on previously. */
3631 my_friendly_assert (!current_function
|| doing_semantic_analysis_p (),
3634 name
= DECL_ASSEMBLER_NAME (x
);
3635 need_new_binding
= 1;
3637 if (DECL_TEMPLATE_PARM_P (x
))
3638 /* Template parameters have no context; they are not X::T even
3639 when declared within a class or namespace. */
3643 if (current_function_decl
&& x
!= current_function_decl
3644 /* A local declaration for a function doesn't constitute
3646 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3647 /* A local declaration for an `extern' variable is in the
3648 scoped of the current namespace, not the current
3650 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3651 /* Don't change DECL_CONTEXT of virtual methods. */
3652 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3653 && !DECL_CONTEXT (x
))
3654 DECL_CONTEXT (x
) = current_function_decl
;
3655 if (!DECL_CONTEXT (x
))
3656 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3659 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3660 compiler wants to use. */
3661 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3662 || TREE_CODE (x
) == NAMESPACE_DECL
)
3663 name
= DECL_NAME (x
);
3668 /* Not needed...see below. */
3672 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3673 name
= TREE_OPERAND (name
, 0);
3675 /* Namespace-scoped variables are not found in the current level. */
3676 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3677 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3679 t
= lookup_name_current_level (name
);
3680 if (t
== error_mark_node
)
3682 /* error_mark_node is 0 for a while during initialization! */
3684 cp_error_at ("`%#D' used prior to declaration", x
);
3687 else if (t
!= NULL_TREE
)
3690 /* This is turned off until I have time to do it right (bpk). */
3691 /* With the code below that uses it... */
3692 file
= DECL_SOURCE_FILE (t
);
3693 line
= DECL_SOURCE_LINE (t
);
3695 if (TREE_CODE (t
) == PARM_DECL
)
3697 if (DECL_CONTEXT (t
) == NULL_TREE
)
3698 fatal ("parse errors have confused me too much");
3700 /* Check for duplicate params. */
3701 if (duplicate_decls (x
, t
))
3704 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3705 || DECL_FUNCTION_TEMPLATE_P (x
))
3706 && is_overloaded_fn (t
))
3707 /* Don't do anything just yet. */;
3708 else if (t
== wchar_decl_node
)
3710 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3711 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3713 /* Throw away the redeclaration. */
3716 else if (TREE_CODE (t
) != TREE_CODE (x
))
3718 if (duplicate_decls (x
, t
))
3721 else if (duplicate_decls (x
, t
))
3724 /* This is turned off until I have time to do it right (bpk). */
3726 /* Also warn if they did a prototype with `static' on it, but
3727 then later left the `static' off. */
3728 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3730 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3735 cp_warning ("`static' missing from declaration of `%D'",
3737 warning_with_file_and_line (file
, line
,
3738 "previous declaration of `%s'",
3739 decl_as_string (t
, 0));
3742 /* Now fix things so it'll do what they expect. */
3743 if (current_function_decl
)
3744 TREE_PUBLIC (current_function_decl
) = 0;
3746 /* Due to interference in memory reclamation (X may be
3747 obstack-deallocated at this point), we must guard against
3748 one really special case. [jason: This should be handled
3749 by start_function] */
3750 if (current_function_decl
== x
)
3751 current_function_decl
= t
;
3753 if (TREE_CODE (t
) == TYPE_DECL
)
3754 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3755 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3756 check_default_args (t
);
3760 else if (DECL_MAIN_P (x
))
3762 /* A redeclaration of main, but not a duplicate of the
3767 This function shall not be overloaded. */
3768 cp_error_at ("invalid redeclaration of `%D'", t
);
3769 cp_error ("as `%D'", x
);
3770 /* We don't try to push this declaration since that
3776 check_template_shadow (x
);
3778 /* If this is a function conjured up by the backend, massage it
3779 so it looks friendly. */
3780 if (TREE_CODE (x
) == FUNCTION_DECL
3781 && ! DECL_LANG_SPECIFIC (x
))
3783 retrofit_lang_decl (x
);
3784 DECL_LANGUAGE (x
) = lang_c
;
3787 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3789 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3792 if (!namespace_bindings_p ())
3793 /* We do not need to create a binding for this name;
3794 push_overloaded_decl will have already done so if
3796 need_new_binding
= 0;
3798 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3800 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3802 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3806 /* If declaring a type as a typedef, copy the type (unless we're
3807 at line 0), and install this TYPE_DECL as the new type's typedef
3808 name. See the extensive comment in ../c-decl.c (pushdecl). */
3809 if (TREE_CODE (x
) == TYPE_DECL
)
3811 tree type
= TREE_TYPE (x
);
3812 if (DECL_SOURCE_LINE (x
) == 0)
3814 if (TYPE_NAME (type
) == 0)
3815 TYPE_NAME (type
) = x
;
3817 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3818 /* We don't want to copy the type when all we're
3819 doing is making a TYPE_DECL for the purposes of
3821 && (!TYPE_NAME (type
)
3822 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3824 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3826 DECL_ORIGINAL_TYPE (x
) = type
;
3827 type
= build_type_copy (type
);
3828 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3829 TYPE_NAME (type
) = x
;
3830 TREE_TYPE (x
) = type
;
3835 if (type
!= error_mark_node
3837 && TYPE_IDENTIFIER (type
))
3838 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3839 current_binding_level
);
3843 /* Multiple external decls of the same identifier ought to match.
3845 We get warnings about inline functions where they are defined.
3846 We get warnings about other functions from push_overloaded_decl.
3848 Avoid duplicate warnings where they are used. */
3849 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3853 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3854 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3855 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3856 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3861 /* If different sort of thing, we already gave an error. */
3862 && TREE_CODE (decl
) == TREE_CODE (x
)
3863 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3865 cp_pedwarn ("type mismatch with previous external decl", x
);
3866 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3870 /* This name is new in its binding level.
3871 Install the new declaration and return it. */
3872 if (namespace_bindings_p ())
3874 /* Install a global value. */
3876 /* If the first global decl has external linkage,
3877 warn if we later see static one. */
3878 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3879 TREE_PUBLIC (name
) = 1;
3881 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3883 /* For an ordinary function, we create a binding from
3884 the mangled name (i.e., NAME) to the DECL. But, for
3885 an `extern "C"' function, the mangled name and the
3886 ordinary name are the same so we need not do this. */
3887 && !(TREE_CODE (x
) == FUNCTION_DECL
&&
3888 DECL_LANGUAGE (x
) == lang_c
))
3890 if (TREE_CODE (x
) == FUNCTION_DECL
)
3892 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3893 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3894 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3897 /* Don't forget if the function was used via an implicit decl. */
3898 if (IDENTIFIER_IMPLICIT_DECL (name
)
3899 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3902 /* Don't forget if its address was taken in that way. */
3903 if (IDENTIFIER_IMPLICIT_DECL (name
)
3904 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3905 TREE_ADDRESSABLE (x
) = 1;
3907 /* Warn about mismatches against previous implicit decl. */
3908 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3909 /* If this real decl matches the implicit, don't complain. */
3910 && ! (TREE_CODE (x
) == FUNCTION_DECL
3911 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3913 ("`%D' was previously implicitly declared to return `int'", x
);
3915 /* If new decl is `static' and an `extern' was seen previously,
3917 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3918 warn_extern_redeclared_static (x
, t
);
3922 /* Here to install a non-global value. */
3923 tree oldlocal
= IDENTIFIER_VALUE (name
);
3924 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3926 if (need_new_binding
)
3928 push_local_binding (name
, x
, 0);
3929 /* Because push_local_binding will hook X on to the
3930 current_binding_level's name list, we don't want to
3931 do that again below. */
3932 need_new_binding
= 0;
3935 /* If this is a TYPE_DECL, push it into the type value slot. */
3936 if (TREE_CODE (x
) == TYPE_DECL
)
3937 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3938 current_binding_level
);
3940 /* Clear out any TYPE_DECL shadowed by a namespace so that
3941 we won't think this is a type. The C struct hack doesn't
3942 go through namespaces. */
3943 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3944 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3945 current_binding_level
);
3947 /* If this is an extern function declaration, see if we
3948 have a global definition or declaration for the function. */
3949 if (oldlocal
== NULL_TREE
3950 && DECL_EXTERNAL (x
)
3951 && oldglobal
!= NULL_TREE
3952 && TREE_CODE (x
) == FUNCTION_DECL
3953 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3955 /* We have one. Their types must agree. */
3956 if (decls_match (x
, oldglobal
))
3960 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3961 cp_warning_at ("global declaration `%#D'", oldglobal
);
3964 /* If we have a local external declaration,
3965 and no file-scope declaration has yet been seen,
3966 then if we later have a file-scope decl it must not be static. */
3967 if (oldlocal
== NULL_TREE
3968 && oldglobal
== NULL_TREE
3969 && DECL_EXTERNAL (x
)
3971 TREE_PUBLIC (name
) = 1;
3973 if (DECL_FROM_INLINE (x
))
3974 /* Inline decls shadow nothing. */;
3976 /* Warn if shadowing an argument at the top level of the body. */
3977 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3978 && TREE_CODE (oldlocal
) == PARM_DECL
3979 /* Don't complain if it's from an enclosing function. */
3980 && DECL_CONTEXT (oldlocal
) == current_function_decl
3981 && TREE_CODE (x
) != PARM_DECL
)
3983 /* Go to where the parms should be and see if we
3985 struct binding_level
*b
= current_binding_level
->level_chain
;
3991 if (b
->parm_flag
== 1)
3992 cp_error ("declaration of `%#D' shadows a parameter", name
);
3994 else if (warn_shadow
&& oldlocal
!= NULL_TREE
3995 && current_binding_level
->is_for_scope
3996 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3998 warning ("variable `%s' shadows local",
3999 IDENTIFIER_POINTER (name
));
4000 cp_warning_at (" this is the shadowed declaration", oldlocal
);
4002 /* Maybe warn if shadowing something else. */
4003 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4004 /* No shadow warnings for internally generated vars. */
4005 && ! DECL_ARTIFICIAL (x
)
4006 /* No shadow warnings for vars made for inlining. */
4007 && ! DECL_FROM_INLINE (x
))
4009 const char *warnstring
= NULL
;
4011 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4012 warnstring
= "declaration of `%s' shadows a parameter";
4013 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4014 && current_class_ptr
4015 && !TREE_STATIC (name
))
4016 warnstring
= "declaration of `%s' shadows a member of `this'";
4017 else if (oldlocal
!= NULL_TREE
)
4018 warnstring
= "declaration of `%s' shadows previous local";
4019 else if (oldglobal
!= NULL_TREE
)
4020 /* XXX shadow warnings in outer-more namespaces */
4021 warnstring
= "declaration of `%s' shadows global declaration";
4024 warning (warnstring
, IDENTIFIER_POINTER (name
));
4028 if (TREE_CODE (x
) == FUNCTION_DECL
)
4029 check_default_args (x
);
4031 /* Keep count of variables in this level with incomplete type. */
4032 if (TREE_CODE (x
) == VAR_DECL
4033 && TREE_TYPE (x
) != error_mark_node
4034 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4035 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4036 /* RTTI TD entries are created while defining the type_info. */
4037 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4038 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4039 current_binding_level
->incomplete
4040 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4043 if (need_new_binding
)
4044 add_decl_to_level (x
,
4045 DECL_NAMESPACE_SCOPE_P (x
)
4046 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4047 : current_binding_level
);
4052 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4053 caller to set DECL_CONTEXT properly. */
4056 pushdecl_with_scope (x
, level
)
4058 struct binding_level
*level
;
4060 register struct binding_level
*b
;
4061 tree function_decl
= current_function_decl
;
4063 current_function_decl
= NULL_TREE
;
4064 if (level
->parm_flag
== 2)
4066 b
= class_binding_level
;
4067 class_binding_level
= level
;
4068 pushdecl_class_level (x
);
4069 class_binding_level
= b
;
4073 b
= current_binding_level
;
4074 current_binding_level
= level
;
4076 current_binding_level
= b
;
4078 current_function_decl
= function_decl
;
4082 /* Like pushdecl, only it places X in the current namespace,
4086 pushdecl_namespace_level (x
)
4089 register struct binding_level
*b
= current_binding_level
;
4092 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4094 /* Now, the type_shadowed stack may screw us. Munge it so it does
4096 if (TREE_CODE (x
) == TYPE_DECL
)
4098 tree name
= DECL_NAME (x
);
4100 tree
*ptr
= (tree
*)0;
4101 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4103 tree shadowed
= b
->type_shadowed
;
4104 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4105 if (TREE_PURPOSE (shadowed
) == name
)
4107 ptr
= &TREE_VALUE (shadowed
);
4108 /* Can't break out of the loop here because sometimes
4109 a binding level will have duplicate bindings for
4110 PT names. It's gross, but I haven't time to fix it. */
4113 newval
= TREE_TYPE (x
);
4114 if (ptr
== (tree
*)0)
4116 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4117 up here if this is changed to an assertion. --KR */
4118 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4128 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4132 pushdecl_top_level (x
)
4135 push_to_top_level ();
4136 x
= pushdecl_namespace_level (x
);
4137 pop_from_top_level ();
4141 /* Make the declaration of X appear in CLASS scope. */
4144 pushdecl_class_level (x
)
4147 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4148 scope looks for the pre-mangled name. */
4151 if (TREE_CODE (x
) == OVERLOAD
)
4152 x
= OVL_CURRENT (x
);
4153 name
= DECL_NAME (x
);
4157 push_class_level_binding (name
, x
);
4158 if (TREE_CODE (x
) == TYPE_DECL
)
4159 set_identifier_type_value (name
, TREE_TYPE (x
));
4161 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4165 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4168 pushdecl_class_level (f
);
4172 /* Enter DECL into the symbol table, if that's appropriate. Returns
4173 DECL, or a modified version thereof. */
4176 maybe_push_decl (decl
)
4179 tree type
= TREE_TYPE (decl
);
4181 /* Add this decl to the current binding level, but not if it comes
4182 from another scope, e.g. a static member variable. TEM may equal
4183 DECL or it may be a previous decl of the same name. */
4184 if ((TREE_CODE (decl
) != PARM_DECL
4185 && DECL_CONTEXT (decl
) != NULL_TREE
4186 /* Definitions of namespace members outside their namespace are
4188 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4189 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4190 || TREE_CODE (type
) == UNKNOWN_TYPE
4191 /* The declaration of a template specialization does not affect
4192 the functions available for overload resolution, so we do not
4194 || (TREE_CODE (decl
) == FUNCTION_DECL
4195 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4198 return pushdecl (decl
);
4202 /* This function is used to push the mangled decls for nested types into
4203 the appropriate scope. Previously pushdecl_top_level was used, but that
4204 is incorrect for members of local classes. */
4207 pushdecl_nonclass_level (x
)
4210 struct binding_level
*b
= current_binding_level
;
4212 my_friendly_assert (b
->parm_flag
!= 2, 180);
4215 /* Get out of template binding levels */
4216 while (b
->pseudo_global
)
4220 pushdecl_with_scope (x
, b
);
4224 /* Make the declaration(s) of X appear in CLASS scope
4225 under the name NAME. */
4228 push_class_level_binding (name
, x
)
4233 /* The class_binding_level will be NULL if x is a template
4234 parameter name in a member template. */
4235 if (!class_binding_level
)
4238 /* Make sure that this new member does not have the same name
4239 as a template parameter. */
4240 if (TYPE_BEING_DEFINED (current_class_type
))
4241 check_template_shadow (x
);
4243 /* If this declaration shadows a declaration from an enclosing
4244 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4245 we leave this class. Record the shadowed declaration here. */
4246 binding
= IDENTIFIER_BINDING (name
);
4248 && ((TREE_CODE (x
) == OVERLOAD
4249 && BINDING_VALUE (binding
)
4250 && is_overloaded_fn (BINDING_VALUE (binding
)))
4251 || INHERITED_VALUE_BINDING_P (binding
)))
4256 /* If the old binding was from a base class, and was for a tag
4257 name, slide it over to make room for the new binding. The
4258 old binding is still visible if explicitly qualified with a
4260 if (INHERITED_VALUE_BINDING_P (binding
)
4261 && BINDING_VALUE (binding
)
4262 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4263 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4264 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4266 old_decl
= BINDING_TYPE (binding
);
4267 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4268 BINDING_VALUE (binding
) = NULL_TREE
;
4269 INHERITED_VALUE_BINDING_P (binding
) = 0;
4272 old_decl
= BINDING_VALUE (binding
);
4274 /* There was already a binding for X containing fewer
4275 functions than are named in X. Find the previous
4276 declaration of X on the class-shadowed list, and update it. */
4277 for (shadow
= class_binding_level
->class_shadowed
;
4279 shadow
= TREE_CHAIN (shadow
))
4280 if (TREE_PURPOSE (shadow
) == name
4281 && TREE_TYPE (shadow
) == old_decl
)
4283 BINDING_VALUE (binding
) = x
;
4284 INHERITED_VALUE_BINDING_P (binding
) = 0;
4285 TREE_TYPE (shadow
) = x
;
4290 /* If we didn't replace an existing binding, put the binding on the
4291 stack of bindings for the identifier, and update
4292 IDENTIFIER_CLASS_VALUE. */
4293 if (push_class_binding (name
, x
))
4295 class_binding_level
->class_shadowed
4296 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4297 class_binding_level
->class_shadowed
);
4298 /* Record the value we are binding NAME to so that we can know
4299 what to pop later. */
4300 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4304 /* Insert another USING_DECL into the current binding level,
4305 returning this declaration. If this is a redeclaration,
4306 do nothing and return NULL_TREE. */
4309 push_using_decl (scope
, name
)
4315 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4316 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4317 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4318 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4322 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4323 DECL_INITIAL (decl
) = scope
;
4324 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4325 current_binding_level
->usings
= decl
;
4329 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4330 changed (i.e. there was already a directive), or the fresh
4331 TREE_LIST otherwise. */
4334 push_using_directive (used
)
4337 tree ud
= current_binding_level
->using_directives
;
4338 tree iter
, ancestor
;
4340 /* Check if we already have this. */
4341 if (purpose_member (used
, ud
) != NULL_TREE
)
4344 /* Recursively add all namespaces used. */
4345 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4346 push_using_directive (TREE_PURPOSE (iter
));
4348 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4349 ud
= current_binding_level
->using_directives
;
4350 ud
= tree_cons (used
, ancestor
, ud
);
4351 current_binding_level
->using_directives
= ud
;
4355 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4356 other definitions already in place. We get around this by making
4357 the value of the identifier point to a list of all the things that
4358 want to be referenced by that name. It is then up to the users of
4359 that name to decide what to do with that list.
4361 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4362 slot. It is dealt with the same way.
4364 FLAGS is a bitwise-or of the following values:
4365 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4367 PUSH_USING: DECL is being pushed as the result of a using
4370 The value returned may be a previous declaration if we guessed wrong
4371 about what language DECL should belong to (C or C++). Otherwise,
4372 it's always DECL (and never something that's not a _DECL). */
4375 push_overloaded_decl (decl
, flags
)
4379 tree name
= DECL_NAME (decl
);
4382 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4385 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4387 old
= lookup_name_current_level (name
);
4391 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4393 tree t
= TREE_TYPE (old
);
4394 if (IS_AGGR_TYPE (t
) && warn_shadow
4395 && (! DECL_IN_SYSTEM_HEADER (decl
)
4396 || ! DECL_IN_SYSTEM_HEADER (old
)))
4397 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4400 else if (is_overloaded_fn (old
))
4404 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4406 tree fn
= OVL_CURRENT (tmp
);
4408 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4409 && !(flags
& PUSH_USING
)
4410 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4411 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4412 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4415 if (duplicate_decls (decl
, fn
))
4421 cp_error_at ("previous non-function declaration `%#D'", old
);
4422 cp_error ("conflicts with function declaration `%#D'", decl
);
4427 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4429 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4430 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4432 new_binding
= ovl_cons (decl
, old
);
4433 if (flags
& PUSH_USING
)
4434 OVL_USED (new_binding
) = 1;
4437 /* NAME is not ambiguous. */
4441 set_namespace_binding (name
, current_namespace
, new_binding
);
4444 /* We only create an OVERLOAD if there was a previous binding at
4445 this level, or if decl is a template. In the former case, we
4446 need to remove the old binding and replace it with the new
4447 binding. We must also run through the NAMES on the binding
4448 level where the name was bound to update the chain. */
4450 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4454 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4456 d
= &TREE_CHAIN (*d
))
4458 || (TREE_CODE (*d
) == TREE_LIST
4459 && TREE_VALUE (*d
) == old
))
4461 if (TREE_CODE (*d
) == TREE_LIST
)
4462 /* Just replace the old binding with the new. */
4463 TREE_VALUE (*d
) = new_binding
;
4465 /* Build a TREE_LIST to wrap the OVERLOAD. */
4466 *d
= tree_cons (NULL_TREE
, new_binding
,
4469 /* And update the CPLUS_BINDING node. */
4470 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4475 /* We should always find a previous binding in this case. */
4476 my_friendly_abort (0);
4479 /* Install the new binding. */
4480 push_local_binding (name
, new_binding
, flags
);
4486 /* Generate an implicit declaration for identifier FUNCTIONID
4487 as a function of type int (). Print a warning if appropriate. */
4490 implicitly_declare (functionid
)
4494 int temp
= allocation_temporary_p ();
4496 push_obstacks_nochange ();
4498 /* Save the decl permanently so we can warn if definition follows.
4499 In ANSI C, warn_implicit is usually false, so the saves little space.
4500 But in C++, it's usually true, hence the extra code. */
4501 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4502 end_temporary_allocation ();
4504 /* We used to reuse an old implicit decl here,
4505 but this loses with inline functions because it can clobber
4506 the saved decl chains. */
4507 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4509 DECL_EXTERNAL (decl
) = 1;
4510 TREE_PUBLIC (decl
) = 1;
4512 /* ANSI standard says implicit declarations are in the innermost block.
4513 So we record the decl in the standard fashion. */
4515 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4518 /* Only one warning per identifier. */
4519 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4521 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4524 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4531 /* Return zero if the declaration NEWDECL is valid
4532 when the declaration OLDDECL (assumed to be for the same name)
4533 has already been seen.
4534 Otherwise return an error message format string with a %s
4535 where the identifier should go. */
4538 redeclaration_error_message (newdecl
, olddecl
)
4539 tree newdecl
, olddecl
;
4541 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4543 /* Because C++ can put things into name space for free,
4544 constructs like "typedef struct foo { ... } foo"
4545 would look like an erroneous redeclaration. */
4546 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4549 return "redefinition of `%#D'";
4551 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4553 /* If this is a pure function, its olddecl will actually be
4554 the original initialization to `0' (which we force to call
4555 abort()). Don't complain about redefinition in this case. */
4556 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4559 /* If both functions come from different namespaces, this is not
4560 a redeclaration - this is a conflict with a used function. */
4561 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4562 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4563 return "`%D' conflicts with used function";
4565 /* We'll complain about linkage mismatches in
4566 warn_extern_redeclared_static. */
4568 /* Defining the same name twice is no good. */
4569 if (DECL_INITIAL (olddecl
) != NULL_TREE
4570 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4572 if (DECL_NAME (olddecl
) == NULL_TREE
)
4573 return "`%#D' not declared in class";
4575 return "redefinition of `%#D'";
4579 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4581 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4582 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4583 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4584 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4585 && TYPE_SIZE (TREE_TYPE (newdecl
))
4586 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4587 return "redefinition of `%#D'";
4590 else if (toplevel_bindings_p ())
4592 /* Objects declared at top level: */
4593 /* If at least one is a reference, it's ok. */
4594 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4596 /* Reject two definitions. */
4597 return "redefinition of `%#D'";
4601 /* Objects declared with block scope: */
4602 /* Reject two definitions, and reject a definition
4603 together with an external reference. */
4604 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4605 return "redeclaration of `%#D'";
4610 /* Create a new label, named ID. */
4613 make_label_decl (id
, local_p
)
4619 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4621 /* Make sure every label has an rtx. */
4624 DECL_CONTEXT (decl
) = current_function_decl
;
4625 DECL_MODE (decl
) = VOIDmode
;
4626 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4628 /* Say where one reference is to the label, for the sake of the
4629 error if it is not defined. */
4630 DECL_SOURCE_LINE (decl
) = lineno
;
4631 DECL_SOURCE_FILE (decl
) = input_filename
;
4633 /* Record the fact that this identifier is bound to this label. */
4634 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4636 /* Record this label on the list of used labels so that we can check
4637 at the end of the function to see whether or not the label was
4638 actually defined. */
4639 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4640 && (named_label_uses
== NULL
4641 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4642 || named_label_uses
->label_decl
!= decl
))
4644 struct named_label_list
*new_ent
;
4646 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4647 new_ent
->label_decl
= decl
;
4648 new_ent
->names_in_scope
= current_binding_level
->names
;
4649 new_ent
->binding_level
= current_binding_level
;
4650 new_ent
->lineno_o_goto
= lineno
;
4651 new_ent
->filename_o_goto
= input_filename
;
4652 new_ent
->next
= named_label_uses
;
4653 named_label_uses
= new_ent
;
4659 /* Look for a label named ID in the current function. If one cannot
4660 be found, create one. (We keep track of used, but undefined,
4661 labels, and complain about them at the end of a function.) */
4669 /* You can't use labels at global scope. */
4670 if (current_function_decl
== NULL_TREE
)
4672 error ("label `%s' referenced outside of any function",
4673 IDENTIFIER_POINTER (id
));
4677 /* See if we've already got this label. */
4678 decl
= IDENTIFIER_LABEL_VALUE (id
);
4679 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4682 /* Record this label on the list of labels used in this function.
4683 We do this before calling make_label_decl so that we get the
4684 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4685 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4687 /* We need a new label. */
4688 decl
= make_label_decl (id
, /*local_p=*/0);
4689 /* Now fill in the information we didn't have before. */
4690 TREE_VALUE (named_labels
) = decl
;
4695 /* Declare a local label named ID. */
4698 declare_local_label (id
)
4703 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4704 this scope we can restore the old value of
4705 IDENTIFIER_TYPE_VALUE. */
4706 current_binding_level
->shadowed_labels
4707 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4708 current_binding_level
->shadowed_labels
);
4709 /* Look for the label. */
4710 decl
= make_label_decl (id
, /*local_p=*/1);
4711 /* Now fill in the information we didn't have before. */
4712 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4717 /* Define a label, specifying the location in the source file.
4718 Return the LABEL_DECL node for the label, if the definition is valid.
4719 Otherwise return 0. */
4722 define_label (filename
, line
, name
)
4727 tree decl
= lookup_label (name
);
4729 /* After labels, make any new cleanups go into their
4730 own new (temporary) binding contour. */
4731 current_binding_level
->more_cleanups_ok
= 0;
4733 if (name
== get_identifier ("wchar_t"))
4734 cp_pedwarn ("label named wchar_t");
4736 if (DECL_INITIAL (decl
) != NULL_TREE
)
4738 cp_error ("duplicate label `%D'", decl
);
4743 struct named_label_list
*uses
, *prev
;
4747 /* Mark label as having been defined. */
4748 DECL_INITIAL (decl
) = error_mark_node
;
4749 /* Say where in the source. */
4750 DECL_SOURCE_FILE (decl
) = filename
;
4751 DECL_SOURCE_LINE (decl
) = line
;
4754 uses
= named_label_uses
;
4755 while (uses
!= NULL
)
4756 if (uses
->label_decl
== decl
)
4758 struct binding_level
*b
= current_binding_level
;
4761 tree new_decls
= b
->names
;
4762 tree old_decls
= (b
== uses
->binding_level
)
4763 ? uses
->names_in_scope
: NULL_TREE
;
4764 while (new_decls
!= old_decls
)
4766 if (TREE_CODE (new_decls
) == VAR_DECL
4767 /* Don't complain about crossing initialization
4768 of internal entities. They can't be accessed,
4769 and they should be cleaned up
4770 by the time we get to the label. */
4771 && ! DECL_ARTIFICIAL (new_decls
)
4772 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4773 && pod_type_p (TREE_TYPE (new_decls
))))
4775 /* This is really only important if we're crossing
4776 an initialization. The POD stuff is just
4777 pedantry; why should it matter if the class
4778 contains a field of pointer to member type? */
4779 int problem
= (DECL_INITIAL (new_decls
)
4780 || (TYPE_NEEDS_CONSTRUCTING
4781 (TREE_TYPE (new_decls
))));
4787 cp_error ("jump to label `%D'", decl
);
4788 error_with_file_and_line
4789 (uses
->filename_o_goto
,
4790 uses
->lineno_o_goto
, " from here");
4794 cp_pedwarn ("jump to label `%D'", decl
);
4795 pedwarn_with_file_and_line
4796 (uses
->filename_o_goto
,
4797 uses
->lineno_o_goto
, " from here");
4803 cp_error_at (" crosses initialization of `%#D'",
4806 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4809 new_decls
= TREE_CHAIN (new_decls
);
4811 if (b
== uses
->binding_level
)
4813 if (b
->eh_region
&& ! saw_eh
)
4817 cp_error ("jump to label `%D'", decl
);
4818 error_with_file_and_line
4819 (uses
->filename_o_goto
,
4820 uses
->lineno_o_goto
, " from here");
4823 error (" enters exception handling block");
4830 prev
->next
= uses
->next
;
4832 named_label_uses
= uses
->next
;
4841 current_function_return_value
= NULL_TREE
;
4848 struct binding_level
*level
;
4849 struct cp_switch
*next
;
4852 static struct cp_switch
*switch_stack
;
4858 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4859 p
->level
= current_binding_level
;
4860 p
->next
= switch_stack
;
4867 switch_stack
= switch_stack
->next
;
4870 /* Note that we've seen a definition of a case label, and complain if this
4871 is a bad place for one. */
4874 define_case_label ()
4876 tree cleanup
= last_cleanup_this_contour ();
4877 struct binding_level
*b
= current_binding_level
;
4881 /* Don't crash; we'll complain in do_case. */
4886 static int explained
= 0;
4887 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4888 warning ("where case label appears here");
4891 warning ("(enclose actions of previous case statements requiring");
4892 warning ("destructors in their own binding contours.)");
4897 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4899 tree new_decls
= b
->names
;
4900 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4902 if (TREE_CODE (new_decls
) == VAR_DECL
4903 /* Don't complain about crossing initialization
4904 of internal entities. They can't be accessed,
4905 and they should be cleaned up
4906 by the time we get to the label. */
4907 && ! DECL_ARTIFICIAL (new_decls
)
4908 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4909 && DECL_INITIAL (new_decls
) != error_mark_node
)
4910 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4913 error ("jump to case label");
4915 cp_error_at (" crosses initialization of `%#D'",
4921 /* After labels, make any new cleanups go into their
4922 own new (temporary) binding contour. */
4924 current_binding_level
->more_cleanups_ok
= 0;
4925 current_function_return_value
= NULL_TREE
;
4928 /* Return the list of declarations of the current level.
4929 Note that this list is in reverse order unless/until
4930 you nreverse it; and when you do nreverse it, you must
4931 store the result back using `storedecls' or you will lose. */
4936 return current_binding_level
->names
;
4939 /* Return the list of type-tags (for structs, etc) of the current level. */
4944 return current_binding_level
->tags
;
4947 /* Store the list of declarations of the current level.
4948 This is done for the parameter declarations of a function being defined,
4949 after they are modified in the light of any missing parameters. */
4955 current_binding_level
->names
= decls
;
4958 /* Similarly, store the list of tags of the current level. */
4964 current_binding_level
->tags
= tags
;
4967 /* Given NAME, an IDENTIFIER_NODE,
4968 return the structure (or union or enum) definition for that name.
4969 Searches binding levels from BINDING_LEVEL up to the global level.
4970 If THISLEVEL_ONLY is nonzero, searches only the specified context
4971 (but skips any tag-transparent contexts to find one that is
4972 meaningful for tags).
4973 FORM says which kind of type the caller wants;
4974 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4975 If the wrong kind of type is found, and it's not a template, an error is
4979 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4980 enum tree_code form
;
4982 struct binding_level
*binding_level
;
4985 register struct binding_level
*level
;
4986 /* Non-zero if, we should look past a pseudo-global level, even if
4988 int allow_pseudo_global
= 1;
4990 for (level
= binding_level
; level
; level
= level
->level_chain
)
4993 if (ANON_AGGRNAME_P (name
))
4994 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4996 /* There's no need for error checking here, because
4997 anon names are unique throughout the compilation. */
4998 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4999 return TREE_VALUE (tail
);
5001 else if (level
->namespace_p
)
5002 /* Do namespace lookup. */
5003 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5005 tree old
= binding_for_name (name
, tail
);
5007 /* If we just skipped past a pseudo global level, even
5008 though THISLEVEL_ONLY, and we find a template class
5009 declaration, then we use the _TYPE node for the
5010 template. See the example below. */
5011 if (thislevel_only
&& !allow_pseudo_global
5012 && old
&& BINDING_VALUE (old
)
5013 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5014 old
= TREE_TYPE (BINDING_VALUE (old
));
5016 old
= BINDING_TYPE (old
);
5018 /* If it has an original type, it is a typedef, and we
5019 should not return it. */
5020 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5022 if (old
&& TREE_CODE (old
) != form
5023 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5025 cp_error ("`%#D' redeclared as %C", old
, form
);
5030 if (thislevel_only
|| tail
== global_namespace
)
5034 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5036 if (TREE_PURPOSE (tail
) == name
)
5038 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5039 /* Should tighten this up; it'll probably permit
5040 UNION_TYPE and a struct template, for example. */
5042 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5044 /* Definition isn't the kind we were looking for. */
5045 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5049 return TREE_VALUE (tail
);
5052 if (thislevel_only
&& ! level
->tag_transparent
)
5054 if (level
->pseudo_global
&& allow_pseudo_global
)
5056 /* We must deal with cases like this:
5058 template <class T> struct S;
5059 template <class T> struct S {};
5061 When looking up `S', for the second declaration, we
5062 would like to find the first declaration. But, we
5063 are in the pseudo-global level created for the
5064 template parameters, rather than the (surrounding)
5065 namespace level. Thus, we keep going one more level,
5066 even though THISLEVEL_ONLY is non-zero. */
5067 allow_pseudo_global
= 0;
5079 set_current_level_tags_transparency (tags_transparent
)
5080 int tags_transparent
;
5082 current_binding_level
->tag_transparent
= tags_transparent
;
5086 /* Given a type, find the tag that was defined for it and return the tag name.
5087 Otherwise return 0. However, the value can never be 0
5088 in the cases in which this is used.
5090 C++: If NAME is non-zero, this is the new name to install. This is
5091 done when replacing anonymous tags with real tag names. */
5094 lookup_tag_reverse (type
, name
)
5098 register struct binding_level
*level
;
5100 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5103 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5105 if (TREE_VALUE (tail
) == type
)
5108 TREE_PURPOSE (tail
) = name
;
5109 return TREE_PURPOSE (tail
);
5116 /* Look up NAME in the NAMESPACE. */
5119 lookup_namespace_name (namespace, name
)
5120 tree
namespace, name
;
5123 tree template_id
= NULL_TREE
;
5125 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5127 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5128 /* This happens for A::B<int> when B is a namespace. */
5130 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5132 /* This happens for A::B where B is a template, and there are no
5133 template arguments. */
5134 cp_error ("invalid use of `%D'", name
);
5135 return error_mark_node
;
5138 namespace = ORIGINAL_NAMESPACE (namespace);
5140 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5143 name
= TREE_OPERAND (name
, 0);
5144 if (TREE_CODE (name
) == OVERLOAD
)
5145 name
= DECL_NAME (OVL_CURRENT (name
));
5146 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5147 name
= DECL_NAME (name
);
5150 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5152 val
= make_node (CPLUS_BINDING
);
5153 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5154 return error_mark_node
;
5156 if (BINDING_VALUE (val
))
5158 val
= BINDING_VALUE (val
);
5162 if (DECL_CLASS_TEMPLATE_P (val
))
5163 val
= lookup_template_class (val
,
5164 TREE_OPERAND (template_id
, 1),
5165 /*in_decl=*/NULL_TREE
,
5166 /*context=*/NULL_TREE
,
5167 /*entering_scope=*/0);
5168 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5169 || TREE_CODE (val
) == OVERLOAD
)
5170 val
= lookup_template_function (val
,
5171 TREE_OPERAND (template_id
, 1));
5174 cp_error ("`%D::%D' is not a template",
5176 return error_mark_node
;
5180 /* If we have a single function from a using decl, pull it out. */
5181 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5182 val
= OVL_FUNCTION (val
);
5186 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5187 return error_mark_node
;
5190 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5192 static unsigned long
5200 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5201 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5206 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5209 typename_compare (k1
, k2
)
5220 d1
= TYPE_NAME (t1
);
5221 d2
= TYPE_NAME (t2
);
5223 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5224 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5225 && ((TREE_TYPE (t1
) != NULL_TREE
)
5226 == (TREE_TYPE (t2
) != NULL_TREE
))
5227 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5228 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5231 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5232 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5233 is non-NULL, this type is being created by the implicit typename
5234 extension, and BASE_TYPE is a type named `t' in some base class of
5235 `T' which depends on template parameters.
5237 Returns the new TYPENAME_TYPE. */
5240 build_typename_type (context
, name
, fullname
, base_type
)
5248 struct hash_entry
* e
;
5250 static struct hash_table ht
;
5252 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5256 static struct hash_table
*h
= &ht
;
5257 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5259 fatal ("virtual memory exhausted");
5260 ggc_add_tree_hash_table_root (&h
, 1);
5263 /* Build the TYPENAME_TYPE. */
5264 t
= make_lang_type (TYPENAME_TYPE
);
5265 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5266 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5267 TREE_TYPE (t
) = base_type
;
5269 /* Build the corresponding TYPE_DECL. */
5270 d
= build_decl (TYPE_DECL
, name
, t
);
5271 TYPE_NAME (TREE_TYPE (d
)) = d
;
5272 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5273 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5274 DECL_ARTIFICIAL (d
) = 1;
5276 /* See if we already have this type. */
5277 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5281 /* Insert the type into the table. */
5282 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5290 make_typename_type (context
, name
)
5295 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5297 if (!(TYPE_LANG_SPECIFIC (name
)
5298 && (CLASSTYPE_IS_TEMPLATE (name
)
5299 || CLASSTYPE_USE_TEMPLATE (name
))))
5300 name
= TYPE_IDENTIFIER (name
);
5302 /* Create a TEMPLATE_ID_EXPR for the type. */
5303 name
= build_nt (TEMPLATE_ID_EXPR
,
5304 CLASSTYPE_TI_TEMPLATE (name
),
5305 CLASSTYPE_TI_ARGS (name
));
5307 else if (TREE_CODE (name
) == TYPE_DECL
)
5308 name
= DECL_NAME (name
);
5312 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5314 name
= TREE_OPERAND (name
, 0);
5315 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5316 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5318 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5319 my_friendly_abort (2000);
5321 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5323 /* We can get here from typename_sub0 in the explicit_template_type
5324 expansion. Just fail. */
5325 cp_error ("no class template named `%#T' in `%#T'",
5327 return error_mark_node
;
5330 if (! uses_template_parms (context
)
5331 || currently_open_class (context
))
5333 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5335 tree tmpl
= NULL_TREE
;
5336 if (IS_AGGR_TYPE (context
))
5337 tmpl
= lookup_field (context
, name
, 0, 0);
5338 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5340 cp_error ("no class template named `%#T' in `%#T'",
5342 return error_mark_node
;
5345 return lookup_template_class (tmpl
,
5346 TREE_OPERAND (fullname
, 1),
5348 /*entering_scope=*/0);
5354 if (!IS_AGGR_TYPE (context
))
5356 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5357 return error_mark_node
;
5360 t
= lookup_field (context
, name
, 0, 1);
5362 return TREE_TYPE (t
);
5366 /* If the CONTEXT is not a template type, then either the field is
5367 there now or its never going to be. */
5368 if (!uses_template_parms (context
))
5370 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5371 return error_mark_node
;
5375 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5378 /* Select the right _DECL from multiple choices. */
5381 select_decl (binding
, flags
)
5386 val
= BINDING_VALUE (binding
);
5387 if (LOOKUP_NAMESPACES_ONLY (flags
))
5389 /* We are not interested in types. */
5390 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5395 /* If we could have a type and
5396 we have nothing or we need a type and have none. */
5397 if (BINDING_TYPE (binding
)
5398 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5399 && TREE_CODE (val
) != TYPE_DECL
)))
5400 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5401 /* Don't return non-types if we really prefer types. */
5402 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5403 && (TREE_CODE (val
) != TEMPLATE_DECL
5404 || !DECL_CLASS_TEMPLATE_P (val
)))
5410 /* Unscoped lookup of a global: iterate over current namespaces,
5411 considering using-directives. If SPACESP is non-NULL, store a list
5412 of the namespaces we've considered in it. */
5415 unqualified_namespace_lookup (name
, flags
, spacesp
)
5420 tree b
= make_node (CPLUS_BINDING
);
5421 tree initial
= current_decl_namespace();
5422 tree scope
= initial
;
5424 struct binding_level
*level
;
5425 tree val
= NULL_TREE
;
5428 *spacesp
= NULL_TREE
;
5430 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5433 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5434 val
= binding_for_name (name
, scope
);
5436 /* Initialize binding for this context. */
5437 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5438 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5440 /* Add all _DECLs seen through local using-directives. */
5441 for (level
= current_binding_level
;
5442 !level
->namespace_p
;
5443 level
= level
->level_chain
)
5444 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5445 scope
, flags
, spacesp
))
5446 /* Give up because of error. */
5447 return error_mark_node
;
5449 /* Add all _DECLs seen through global using-directives. */
5450 /* XXX local and global using lists should work equally. */
5454 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5455 scope
, flags
, spacesp
))
5456 /* Give up because of error. */
5457 return error_mark_node
;
5458 if (siter
== scope
) break;
5459 siter
= CP_DECL_CONTEXT (siter
);
5462 val
= select_decl (b
, flags
);
5463 if (scope
== global_namespace
)
5469 /* Combine prefer_type and namespaces_only into flags. */
5472 lookup_flags (prefer_type
, namespaces_only
)
5473 int prefer_type
, namespaces_only
;
5475 if (namespaces_only
)
5476 return LOOKUP_PREFER_NAMESPACES
;
5477 if (prefer_type
> 1)
5478 return LOOKUP_PREFER_TYPES
;
5479 if (prefer_type
> 0)
5480 return LOOKUP_PREFER_BOTH
;
5484 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5485 ignore it or not. Subroutine of lookup_name_real. */
5488 qualify_lookup (val
, flags
)
5492 if (val
== NULL_TREE
)
5494 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5496 if ((flags
& LOOKUP_PREFER_TYPES
)
5497 && (TREE_CODE (val
) == TYPE_DECL
5498 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5499 && DECL_CLASS_TEMPLATE_P (val
))))
5501 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5506 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5510 warn_about_implicit_typename_lookup (typename
, binding
)
5514 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5515 tree name
= DECL_NAME (typename
);
5517 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5518 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5519 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5520 && ! (TREE_CODE (binding
) == TYPE_DECL
5521 && same_type_p (TREE_TYPE (binding
), subtype
)))
5523 cp_warning ("lookup of `%D' finds `%#D'",
5525 cp_warning (" instead of `%D' from dependent base class",
5527 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5528 constructor_name (current_class_type
), name
);
5532 /* Look up NAME in the current binding level and its superiors in the
5533 namespace of variables, functions and typedefs. Return a ..._DECL
5534 node of some kind representing its definition if there is only one
5535 such declaration, or return a TREE_LIST with all the overloaded
5536 definitions if there are many, or return 0 if it is undefined.
5538 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5539 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5540 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5541 Otherwise we prefer non-TYPE_DECLs.
5543 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5544 using IDENTIFIER_CLASS_VALUE. */
5547 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5549 int prefer_type
, nonclass
, namespaces_only
;
5552 tree val
= NULL_TREE
;
5554 tree from_obj
= NULL_TREE
;
5556 int val_is_implicit_typename
= 0;
5558 /* Hack: copy flag set by parser, if set. */
5559 if (only_namespace_names
)
5560 namespaces_only
= 1;
5562 if (prefer_type
== -2)
5564 extern int looking_for_typename
;
5565 tree type
= NULL_TREE
;
5568 prefer_type
= looking_for_typename
;
5570 flags
= lookup_flags (prefer_type
, namespaces_only
);
5571 /* If the next thing is '<', class templates are types. */
5572 if (looking_for_template
)
5573 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5575 /* std:: becomes :: for now. */
5576 if (got_scope
== std_node
)
5577 got_scope
= void_type_node
;
5581 else if (got_object
!= error_mark_node
)
5586 if (type
== error_mark_node
)
5587 return error_mark_node
;
5588 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5589 type
= TREE_TYPE (type
);
5592 type
= complete_type (type
);
5594 if (TREE_CODE (type
) == VOID_TYPE
)
5595 type
= global_namespace
;
5596 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5598 val
= make_node (CPLUS_BINDING
);
5599 flags
|= LOOKUP_COMPLAIN
;
5600 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5602 val
= select_decl (val
, flags
);
5604 else if (! IS_AGGR_TYPE (type
)
5605 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5606 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5607 || TREE_CODE (type
) == TYPENAME_TYPE
)
5608 /* Someone else will give an error about this if needed. */
5610 else if (type
== current_class_type
)
5611 val
= IDENTIFIER_CLASS_VALUE (name
);
5613 val
= lookup_member (type
, name
, 0, prefer_type
);
5620 else if (got_object
&& val
)
5625 flags
= lookup_flags (prefer_type
, namespaces_only
);
5626 /* If we're not parsing, we need to complain. */
5627 flags
|= LOOKUP_COMPLAIN
;
5630 /* First, look in non-namespace scopes. */
5632 if (current_class_type
== NULL_TREE
)
5635 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5639 if (!LOCAL_BINDING_P (t
) && nonclass
)
5640 /* We're not looking for class-scoped bindings, so keep going. */
5643 /* If this is the kind of thing we're looking for, we're done. */
5644 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5645 binding
= BINDING_VALUE (t
);
5646 else if ((flags
& LOOKUP_PREFER_TYPES
)
5647 && qualify_lookup (BINDING_TYPE (t
), flags
))
5648 binding
= BINDING_TYPE (t
);
5650 binding
= NULL_TREE
;
5653 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5655 if (val_is_implicit_typename
&& !yylex
)
5656 warn_about_implicit_typename_lookup (val
, binding
);
5658 val_is_implicit_typename
5659 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5660 if (!val_is_implicit_typename
)
5665 /* Now lookup in namespace scopes. */
5666 if (!val
|| val_is_implicit_typename
)
5668 t
= unqualified_namespace_lookup (name
, flags
, 0);
5671 if (val_is_implicit_typename
&& !yylex
)
5672 warn_about_implicit_typename_lookup (val
, t
);
5680 /* This should only warn about types used in qualified-ids. */
5681 if (from_obj
&& from_obj
!= val
)
5683 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5684 && TREE_CODE (val
) == TYPE_DECL
5685 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5687 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5688 name
, got_object
, TREE_TYPE (from_obj
));
5689 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5693 /* We don't change val to from_obj if got_object depends on
5694 template parms because that breaks implicit typename for
5695 destructor calls. */
5696 if (! uses_template_parms (got_object
))
5700 /* If we have a single function from a using decl, pull it out. */
5701 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5702 val
= OVL_FUNCTION (val
);
5711 lookup_name_nonclass (name
)
5714 return lookup_name_real (name
, 0, 1, 0);
5718 lookup_function_nonclass (name
, args
)
5722 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5726 lookup_name_namespace_only (name
)
5729 /* type-or-namespace, nonclass, namespace_only */
5730 return lookup_name_real (name
, 1, 1, 1);
5734 lookup_name (name
, prefer_type
)
5738 return lookup_name_real (name
, prefer_type
, 0, 0);
5741 /* Similar to `lookup_name' but look only in the innermost non-class
5745 lookup_name_current_level (name
)
5748 struct binding_level
*b
;
5751 b
= current_binding_level
;
5752 while (b
->parm_flag
== 2)
5757 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5759 /* extern "C" function() */
5760 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5763 else if (IDENTIFIER_BINDING (name
)
5764 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5768 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5769 return IDENTIFIER_VALUE (name
);
5781 /* Like lookup_name_current_level, but for types. */
5784 lookup_type_current_level (name
)
5787 register tree t
= NULL_TREE
;
5789 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5791 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5792 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5794 struct binding_level
*b
= current_binding_level
;
5797 if (purpose_member (name
, b
->type_shadowed
))
5798 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5810 begin_only_namespace_names ()
5812 only_namespace_names
= 1;
5816 end_only_namespace_names ()
5818 only_namespace_names
= 0;
5821 /* Arrange for the user to get a source line number, even when the
5822 compiler is going down in flames, so that she at least has a
5823 chance of working around problems in the compiler. We used to
5824 call error(), but that let the segmentation fault continue
5825 through; now, it's much more passive by asking them to send the
5826 maintainers mail about the problem. */
5830 int sig ATTRIBUTE_UNUSED
;
5832 signal (SIGSEGV
, SIG_DFL
);
5834 signal (SIGIOT
, SIG_DFL
);
5837 signal (SIGILL
, SIG_DFL
);
5840 signal (SIGABRT
, SIG_DFL
);
5843 signal (SIGBUS
, SIG_DFL
);
5845 my_friendly_abort (0);
5848 /* Push the declarations of builtin types into the namespace.
5849 RID_INDEX, if < RID_MAX is the index of the builtin type
5850 in the array RID_POINTERS. NAME is the name used when looking
5851 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5854 record_builtin_type (rid_index
, name
, type
)
5859 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5860 tree tdecl
= NULL_TREE
;
5862 if ((int) rid_index
< (int) RID_MAX
)
5863 rname
= ridpointers
[(int) rid_index
];
5865 tname
= get_identifier (name
);
5867 TYPE_BUILT_IN (type
) = 1;
5871 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5872 set_identifier_type_value (tname
, NULL_TREE
);
5873 if ((int) rid_index
< (int) RID_MAX
)
5874 /* Built-in types live in the global namespace. */
5875 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5877 if (rname
!= NULL_TREE
)
5879 if (tname
!= NULL_TREE
)
5881 set_identifier_type_value (rname
, NULL_TREE
);
5882 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5886 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5887 set_identifier_type_value (rname
, NULL_TREE
);
5892 /* Record one of the standard Java types.
5893 * Declare it as having the given NAME.
5894 * If SIZE > 0, it is the size of one of the integral types;
5895 * otherwise it is the negative of the size of one of the other types. */
5898 record_builtin_java_type (name
, size
)
5904 type
= make_signed_type (size
);
5905 else if (size
> -32)
5906 { /* "__java_char" or ""__java_boolean". */
5907 type
= make_unsigned_type (-size
);
5908 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5911 { /* "__java_float" or ""__java_double". */
5912 type
= make_node (REAL_TYPE
);
5913 TYPE_PRECISION (type
) = - size
;
5916 record_builtin_type (RID_MAX
, name
, type
);
5917 decl
= TYPE_NAME (type
);
5919 /* Suppress generate debug symbol entries for these types,
5920 since for normal C++ they are just clutter.
5921 However, push_lang_context undoes this if extern "Java" is seen. */
5922 DECL_IGNORED_P (decl
) = 1;
5924 TYPE_FOR_JAVA (type
) = 1;
5928 /* Push a type into the namespace so that the back-ends ignore it. */
5931 record_unknown_type (type
, name
)
5935 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5936 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5937 DECL_IGNORED_P (decl
) = 1;
5938 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5939 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5940 TYPE_ALIGN (type
) = 1;
5941 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5944 /* Push overloaded decl, in global scope, with one argument so it
5945 can be used as a callback from define_function. */
5948 push_overloaded_decl_1 (x
)
5951 push_overloaded_decl (x
, PUSH_GLOBAL
);
5958 auto_function (name
, type
)
5961 return define_function
5962 (IDENTIFIER_POINTER (name
), type
, push_overloaded_decl_1
,
5963 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5967 /* Create the predefined scalar types of C,
5968 and some nodes representing standard constants (0, 1, (void *)0).
5969 Initialize the global binding level.
5970 Make definitions for built-in primitive functions. */
5973 init_decl_processing ()
5976 int wchar_type_size
;
5977 tree array_domain_type
;
5979 /* Have to make these distinct before we try using them. */
5980 lang_name_cplusplus
= get_identifier ("C++");
5981 lang_name_c
= get_identifier ("C");
5982 lang_name_java
= get_identifier ("Java");
5984 /* Let the back-end now how to save and restore language-specific
5985 per-function globals. */
5986 init_lang_status
= &push_cp_function_context
;
5987 free_lang_status
= &pop_cp_function_context
;
5988 mark_lang_status
= &mark_cp_function_context
;
5994 /* Create the global variables. */
5995 push_to_top_level ();
5997 /* Enter the global namespace. */
5998 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5999 push_namespace (get_identifier ("::"));
6000 global_namespace
= current_namespace
;
6001 current_lang_name
= NULL_TREE
;
6003 if (flag_strict_prototype
== 2)
6004 flag_strict_prototype
= pedantic
;
6005 if (! flag_permissive
&& ! pedantic
)
6006 flag_pedantic_errors
= 1;
6008 strict_prototypes_lang_c
= flag_strict_prototype
;
6011 current_lang_name
= lang_name_c
;
6013 current_function_decl
= NULL_TREE
;
6014 current_binding_level
= NULL_BINDING_LEVEL
;
6015 free_binding_level
= NULL_BINDING_LEVEL
;
6017 /* Because most segmentation signals can be traced back into user
6018 code, catch them and at least give the user a chance of working
6019 around compiler bugs. */
6020 signal (SIGSEGV
, signal_catch
);
6022 /* We will also catch aborts in the back-end through signal_catch and
6023 give the user a chance to see where the error might be, and to defeat
6024 aborts in the back-end when there have been errors previously in their
6027 signal (SIGIOT
, signal_catch
);
6030 signal (SIGILL
, signal_catch
);
6033 signal (SIGABRT
, signal_catch
);
6036 signal (SIGBUS
, signal_catch
);
6039 build_common_tree_nodes (flag_signed_char
);
6041 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6042 TREE_TYPE (error_mark_list
) = error_mark_node
;
6044 /* Make the binding_level structure for global names. */
6046 global_binding_level
= current_binding_level
;
6047 /* The global level is the namespace level of ::. */
6048 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6049 declare_namespace_level ();
6051 this_identifier
= get_identifier (THIS_NAME
);
6052 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6053 ctor_identifier
= get_identifier (CTOR_NAME
);
6054 dtor_identifier
= get_identifier (DTOR_NAME
);
6055 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6056 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6057 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6058 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6059 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6061 /* Define `int' and `char' first so that dbx will output them first. */
6062 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6063 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6065 /* `signed' is the same as `int' */
6066 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6067 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6068 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6069 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6070 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6071 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6072 record_builtin_type (RID_MAX
, "long long unsigned int",
6073 long_long_unsigned_type_node
);
6074 record_builtin_type (RID_MAX
, "long long unsigned",
6075 long_long_unsigned_type_node
);
6076 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6077 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6078 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6081 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6083 /* Define both `signed char' and `unsigned char'. */
6084 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6085 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6087 /* `unsigned long' is the standard type for sizeof.
6088 Note that stddef.h uses `unsigned long',
6089 and this must agree, even if long and int are the same size. */
6091 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6093 /* Create the widest literal types. */
6094 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6095 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6096 widest_integer_literal_type_node
));
6098 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6099 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6100 widest_unsigned_literal_type_node
));
6102 /* These are types that type_for_size and type_for_mode use. */
6103 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6104 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6105 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6106 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6107 #if HOST_BITS_PER_WIDE_INT >= 64
6108 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6110 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6111 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6112 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6113 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6114 #if HOST_BITS_PER_WIDE_INT >= 64
6115 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6118 build_common_tree_nodes_2 (flag_short_double
);
6120 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6121 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6122 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6123 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6124 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6125 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6126 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6127 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6129 integer_two_node
= build_int_2 (2, 0);
6130 TREE_TYPE (integer_two_node
) = integer_type_node
;
6131 integer_three_node
= build_int_2 (3, 0);
6132 TREE_TYPE (integer_three_node
) = integer_type_node
;
6134 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6135 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6136 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6137 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6138 TYPE_PRECISION (boolean_type_node
) = 1;
6139 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6140 boolean_false_node
= build_int_2 (0, 0);
6141 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6142 boolean_true_node
= build_int_2 (1, 0);
6143 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6145 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6146 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6147 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6149 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6150 complex_integer_type_node
));
6151 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6152 complex_float_type_node
));
6153 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6154 complex_double_type_node
));
6155 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6156 complex_long_double_type_node
));
6158 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6160 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6161 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6162 TREE_PARMLIST (void_list_node
) = 1;
6164 /* Used for expressions that do nothing, but are not errors. */
6165 void_zero_node
= build_int_2 (0, 0);
6166 TREE_TYPE (void_zero_node
) = void_type_node
;
6168 string_type_node
= build_pointer_type (char_type_node
);
6169 const_string_type_node
6170 = build_pointer_type (build_qualified_type (char_type_node
,
6172 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6174 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6177 /* Make a type to be the domain of a few array types
6178 whose domains don't really matter.
6179 200 is small enough that it always fits in size_t
6180 and large enough that it can hold most function names for the
6181 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6182 array_domain_type
= build_index_type (build_int_2 (200, 0));
6184 /* Make a type for arrays of characters.
6185 With luck nothing will ever really depend on the length of this
6187 char_array_type_node
6188 = build_array_type (char_type_node
, array_domain_type
);
6189 /* Likewise for arrays of ints. */
6191 = build_array_type (integer_type_node
, array_domain_type
);
6193 /* This is just some anonymous class type. Nobody should ever
6194 need to look inside this envelope. */
6195 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6197 if (flag_huge_objects
)
6198 delta_type_node
= long_integer_type_node
;
6200 delta_type_node
= short_integer_type_node
;
6202 default_function_type
6203 = build_function_type (integer_type_node
, NULL_TREE
);
6205 ptr_type_node
= build_pointer_type (void_type_node
);
6207 = build_pointer_type (build_qualified_type (void_type_node
,
6209 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6212 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6214 /* C++ extensions */
6216 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6217 record_unknown_type (unknown_type_node
, "unknown type");
6219 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6220 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6222 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6224 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6226 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6227 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6229 /* This is special for C++ so functions can be overloaded. */
6230 wchar_type_node
= get_identifier (flag_short_wchar
6231 ? "short unsigned int"
6233 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6234 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6235 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6236 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6238 = TREE_UNSIGNED (wchar_type_node
)
6239 ? unsigned_wchar_type_node
6240 : signed_wchar_type_node
;
6241 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6243 /* Artificial declaration of wchar_t -- can be bashed */
6244 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6246 pushdecl (wchar_decl_node
);
6248 /* This is for wide string constants. */
6249 wchar_array_type_node
6250 = build_array_type (wchar_type_node
, array_domain_type
);
6252 if (flag_vtable_thunks
)
6254 /* Make sure we get a unique function type, so we can give
6255 its pointer type a name. (This wins for gdb.) */
6256 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6257 TREE_TYPE (vfunc_type
) = integer_type_node
;
6258 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6259 layout_type (vfunc_type
);
6261 vtable_entry_type
= build_pointer_type (vfunc_type
);
6265 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6266 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6268 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6270 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6272 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6275 /* Make this part of an invisible union. */
6276 fields
[3] = copy_node (fields
[2]);
6277 TREE_TYPE (fields
[3]) = delta_type_node
;
6278 DECL_NAME (fields
[3]) = delta2_identifier
;
6279 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6280 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6281 TREE_UNSIGNED (fields
[3]) = 0;
6282 TREE_CHAIN (fields
[2]) = fields
[3];
6283 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6286 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6289 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6290 layout_type (vtbl_type_node
);
6291 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6292 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6293 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6294 layout_type (vtbl_ptr_type_node
);
6295 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6297 std_node
= build_decl (NAMESPACE_DECL
,
6298 get_identifier (flag_honor_std
? "fake std":"std"),
6300 pushdecl (std_node
);
6302 global_type_node
= make_node (LANG_TYPE
);
6303 record_unknown_type (global_type_node
, "global type");
6306 current_lang_name
= lang_name_cplusplus
;
6309 tree bad_alloc_type_node
, newtype
, deltype
;
6311 push_namespace (get_identifier ("std"));
6312 bad_alloc_type_node
= xref_tag
6313 (class_type_node
, get_identifier ("bad_alloc"), 1);
6316 newtype
= build_exception_variant
6317 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6318 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6319 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
);
6320 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6321 global_delete_fndecl
= auto_function (ansi_opname
[(int) DELETE_EXPR
],
6323 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6327 = define_function ("__pure_virtual", void_ftype
, 0, 0);
6329 /* Perform other language dependent initializations. */
6330 init_class_processing ();
6331 init_init_processing ();
6332 init_search_processing ();
6334 init_rtti_processing ();
6336 if (flag_exceptions
)
6337 init_exception_processing ();
6340 flag_inline_functions
= 0;
6343 if (! supports_one_only ())
6346 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6347 declare_function_name ();
6349 /* Prepare to check format strings against argument lists. */
6350 init_function_format_info ();
6352 /* Show we use EH for cleanups. */
6353 using_eh_for_cleanups ();
6355 print_error_function
= lang_print_error_function
;
6356 lang_get_alias_set
= &c_get_alias_set
;
6357 valid_lang_attribute
= cp_valid_lang_attribute
;
6359 /* Maintain consistency. Perhaps we should just complain if they
6360 say -fwritable-strings? */
6361 if (flag_writable_strings
)
6362 flag_const_strings
= 0;
6364 /* Add GC roots for all of our global variables. */
6365 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6366 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6367 ggc_add_tree_root (&integer_three_node
, 1);
6368 ggc_add_tree_root (&integer_two_node
, 1);
6369 ggc_add_tree_root (&signed_size_zero_node
, 1);
6370 ggc_add_tree_root (&size_one_node
, 1);
6371 ggc_add_tree_root (&size_zero_node
, 1);
6372 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6373 mark_binding_level
);
6374 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6375 ggc_add_tree_root (&static_ctors
, 1);
6376 ggc_add_tree_root (&static_dtors
, 1);
6377 ggc_add_tree_root (&lastiddecl
, 1);
6379 ggc_add_tree_root (&enum_next_value
, 1);
6380 ggc_add_tree_root (&last_function_parm_tags
, 1);
6381 ggc_add_tree_root (¤t_function_return_value
, 1);
6382 ggc_add_tree_root (¤t_function_parms
, 1);
6383 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6384 ggc_add_tree_root (&last_function_parms
, 1);
6385 ggc_add_tree_root (&error_mark_list
, 1);
6387 ggc_add_tree_root (&global_namespace
, 1);
6388 ggc_add_tree_root (&global_type_node
, 1);
6389 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6391 ggc_add_tree_root (&got_object
, 1);
6392 ggc_add_tree_root (&got_scope
, 1);
6394 ggc_add_tree_root (¤t_lang_name
, 1);
6395 ggc_add_tree_root (&static_aggregates
, 1);
6398 /* Function to print any language-specific context for an error message. */
6401 lang_print_error_function (file
)
6404 default_print_error_function (file
);
6405 maybe_print_template_context ();
6408 /* Make a definition for a builtin function named NAME and whose data type
6409 is TYPE. TYPE should be a function type with argument types.
6411 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6412 the name to be called if we can't opencode the function. */
6415 define_function (name
, type
, pfn
, library_name
)
6418 void (*pfn
) PROTO((tree
));
6419 const char *library_name
;
6421 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6422 DECL_EXTERNAL (decl
) = 1;
6423 TREE_PUBLIC (decl
) = 1;
6424 DECL_ARTIFICIAL (decl
) = 1;
6426 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6427 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6429 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6430 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6431 function in the namespace. */
6432 if (pfn
) (*pfn
) (decl
);
6434 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6435 make_function_rtl (decl
);
6440 /* Wrapper around define_function, for the benefit of
6441 c_common_nodes_and_builtins.
6442 FUNCTION_CODE tells later passes how to compile calls to this function.
6443 See tree.h for its possible values. */
6446 builtin_function (name
, type
, code
, class, libname
)
6450 enum built_in_class
class;
6451 const char *libname
;
6453 tree decl
= define_function (name
, type
, (void (*) PROTO((tree
)))pushdecl
,
6455 DECL_BUILT_IN_CLASS (decl
) = class;
6456 DECL_FUNCTION_CODE (decl
) = code
;
6460 /* When we call finish_struct for an anonymous union, we create
6461 default copy constructors and such. But, an anonymous union
6462 shouldn't have such things; this function undoes the damage to the
6463 anonymous union type T.
6465 (The reason that we create the synthesized methods is that we don't
6466 distinguish `union { int i; }' from `typedef union { int i; } U'.
6467 The first is an anonymous union; the second is just an ordinary
6471 fixup_anonymous_aggr (t
)
6476 /* Wipe out memory of synthesized methods */
6477 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6478 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6479 TYPE_HAS_INIT_REF (t
) = 0;
6480 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6481 TYPE_HAS_ASSIGN_REF (t
) = 0;
6482 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6484 /* Splice the implicitly generated functions out of the TYPE_METHODS
6486 q
= &TYPE_METHODS (t
);
6489 if (DECL_ARTIFICIAL (*q
))
6490 *q
= TREE_CHAIN (*q
);
6492 q
= &TREE_CHAIN (*q
);
6495 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6496 function members. */
6497 if (TYPE_METHODS (t
))
6498 error ("an anonymous union cannot have function members");
6501 /* Make sure that a declaration with no declarator is well-formed, i.e.
6502 just defines a tagged type or anonymous union.
6504 Returns the type defined, if any. */
6507 check_tag_decl (declspecs
)
6511 tree ob_modifier
= NULL_TREE
;
6513 register tree t
= NULL_TREE
;
6515 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6517 register tree value
= TREE_VALUE (link
);
6523 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6525 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6529 else if (value
== ridpointers
[(int) RID_FRIEND
])
6531 if (current_class_type
== NULL_TREE
6532 || current_scope () != current_class_type
)
6533 ob_modifier
= value
;
6535 else if (value
== ridpointers
[(int) RID_STATIC
]
6536 || value
== ridpointers
[(int) RID_EXTERN
]
6537 || value
== ridpointers
[(int) RID_AUTO
]
6538 || value
== ridpointers
[(int) RID_REGISTER
]
6539 || value
== ridpointers
[(int) RID_INLINE
]
6540 || value
== ridpointers
[(int) RID_VIRTUAL
]
6541 || value
== ridpointers
[(int) RID_CONST
]
6542 || value
== ridpointers
[(int) RID_VOLATILE
]
6543 || value
== ridpointers
[(int) RID_EXPLICIT
])
6544 ob_modifier
= value
;
6548 error ("multiple types in one declaration");
6550 /* Inside a class, we might be in a friend or access declaration.
6551 Until we have a good way of detecting the latter, don't warn. */
6552 if (t
== NULL_TREE
&& ! current_class_type
)
6553 pedwarn ("declaration does not declare anything");
6555 /* Check for an anonymous union. We're careful
6556 accessing TYPE_IDENTIFIER because some built-in types, like
6557 pointer-to-member types, do not have TYPE_NAME. */
6558 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6560 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6562 /* Anonymous unions are objects, so they can have specifiers. */;
6563 SET_ANON_AGGR_TYPE_P (t
);
6565 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6566 pedwarn ("ISO C++ prohibits anonymous structs");
6569 else if (ob_modifier
)
6571 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6572 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6573 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6574 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6575 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6576 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6577 cp_error ("`%D' can only be specified for constructors",
6580 cp_error ("`%D' can only be specified for objects and functions",
6587 /* Called when a declaration is seen that contains no names to declare.
6588 If its type is a reference to a structure, union or enum inherited
6589 from a containing scope, shadow that tag name for the current scope
6590 with a forward reference.
6591 If its type defines a new named structure or union
6592 or defines an enum, it is valid but we need not do anything here.
6593 Otherwise, it is an error.
6595 C++: may have to grok the declspecs to learn about static,
6596 complain for anonymous unions. */
6599 shadow_tag (declspecs
)
6602 tree t
= check_tag_decl (declspecs
);
6605 maybe_process_partial_specialization (t
);
6607 /* This is where the variables in an anonymous union are
6608 declared. An anonymous union declaration looks like:
6610 because there is no declarator after the union, the parser
6611 sends that declaration here. */
6612 if (t
&& ANON_AGGR_TYPE_P (t
))
6614 fixup_anonymous_aggr (t
);
6616 if (TYPE_FIELDS (t
))
6618 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6620 finish_anon_union (decl
);
6625 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6628 groktypename (typename
)
6631 if (TREE_CODE (typename
) != TREE_LIST
)
6633 return grokdeclarator (TREE_VALUE (typename
),
6634 TREE_PURPOSE (typename
),
6635 TYPENAME
, 0, NULL_TREE
);
6638 /* Decode a declarator in an ordinary declaration or data definition.
6639 This is called as soon as the type information and variable name
6640 have been parsed, before parsing the initializer if any.
6641 Here we create the ..._DECL node, fill in its type,
6642 and put it on the list of decls for the current context.
6643 The ..._DECL node is returned as the value.
6645 Exception: for arrays where the length is not specified,
6646 the type is left null, to be filled in by `cp_finish_decl'.
6648 Function definitions do not come here; they go to start_function
6649 instead. However, external and forward declarations of functions
6650 do go through here. Structure field declarations are done by
6651 grokfield and not through here. */
6653 /* Set this to zero to debug not using the temporary obstack
6654 to parse initializers. */
6655 int debug_temp_inits
= 1;
6658 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6659 tree declarator
, declspecs
;
6661 tree attributes
, prefix_attributes
;
6664 register tree type
, tem
;
6666 extern int have_extern_spec
;
6667 extern int used_extern_spec
;
6671 /* See code below that used this. */
6672 int init_written
= initialized
;
6675 /* This should only be done once on the top most decl. */
6676 if (have_extern_spec
&& !used_extern_spec
)
6678 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6680 used_extern_spec
= 1;
6683 if (attributes
|| prefix_attributes
)
6684 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6686 attrlist
= NULL_TREE
;
6688 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6691 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6694 type
= TREE_TYPE (decl
);
6696 if (type
== error_mark_node
)
6700 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6701 ? DECL_CLASS_CONTEXT (decl
)
6702 : DECL_CONTEXT (decl
);
6704 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6705 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6707 /* When parsing the initializer, lookup should use the object's
6709 push_decl_namespace (context
);
6712 /* We are only interested in class contexts, later. */
6713 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6714 context
= NULL_TREE
;
6717 /* Is it valid for this decl to have an initializer at all?
6718 If not, set INITIALIZED to zero, which will indirectly
6719 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6720 switch (TREE_CODE (decl
))
6723 /* typedef foo = bar means give foo the same type as bar.
6724 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6725 Any other case of an initialization in a TYPE_DECL is an error. */
6726 if (pedantic
|| list_length (declspecs
) > 1)
6728 cp_error ("typedef `%D' is initialized", decl
);
6734 cp_error ("function `%#D' is initialized like a variable", decl
);
6744 if (! toplevel_bindings_p ()
6745 && DECL_EXTERNAL (decl
))
6746 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6748 DECL_EXTERNAL (decl
) = 0;
6749 if (toplevel_bindings_p ())
6750 TREE_STATIC (decl
) = 1;
6752 /* Tell `pushdecl' this is an initialized decl
6753 even though we don't yet have the initializer expression.
6754 Also tell `cp_finish_decl' it may store the real initializer. */
6755 DECL_INITIAL (decl
) = error_mark_node
;
6758 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6759 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6762 /* Set attributes here so if duplicate decl, will have proper attributes. */
6763 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6765 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6767 push_nested_class (context
, 2);
6769 if (TREE_CODE (decl
) == VAR_DECL
)
6771 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6772 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6773 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6776 if (DECL_CONTEXT (field
) != context
)
6778 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6779 DECL_CONTEXT (field
), DECL_NAME (decl
),
6780 context
, DECL_NAME (decl
));
6781 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6783 /* Static data member are tricky; an in-class initialization
6784 still doesn't provide a definition, so the in-class
6785 declaration will have DECL_EXTERNAL set, but will have an
6786 initialization. Thus, duplicate_decls won't warn
6787 about this situation, and so we check here. */
6788 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6789 cp_error ("duplicate initialization of %D", decl
);
6790 if (duplicate_decls (decl
, field
))
6796 tree field
= check_classfn (context
, decl
);
6797 if (field
&& duplicate_decls (decl
, field
))
6801 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6802 DECL_IN_AGGR_P (decl
) = 0;
6803 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6804 || CLASSTYPE_USE_TEMPLATE (context
))
6806 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6807 /* [temp.expl.spec] An explicit specialization of a static data
6808 member of a template is a definition if the declaration
6809 includes an initializer; otherwise, it is a declaration.
6811 We check for processing_specialization so this only applies
6812 to the new specialization syntax. */
6813 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6814 DECL_EXTERNAL (decl
) = 1;
6817 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6818 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6822 /* Enter this declaration into the symbol table. */
6823 tem
= maybe_push_decl (decl
);
6825 if (processing_template_decl
)
6827 if (at_function_scope_p ())
6828 push_permanent_obstack ();
6829 tem
= push_template_decl (tem
);
6830 if (at_function_scope_p ())
6835 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6836 /* Tell the back-end to use or not use .common as appropriate. If we say
6837 -fconserve-space, we want this to save .data space, at the expense of
6838 wrong semantics. If we say -fno-conserve-space, we want this to
6839 produce errors about redefs; to do this we force variables into the
6841 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6844 if (! processing_template_decl
)
6847 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6848 push_obstacks_nochange ();
6857 tree type
= TREE_TYPE (decl
);
6858 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6860 if (type
== error_mark_node
)
6863 /* If this type of object needs a cleanup, and control may
6864 jump past it, make a new binding level so that it is cleaned
6865 up only when it is initialized first. */
6866 if (TYPE_NEEDS_DESTRUCTOR (type
)
6867 && current_binding_level
->more_cleanups_ok
== 0)
6868 pushlevel_temporary (1);
6871 /* Is it valid for this decl to have an initializer at all?
6872 If not, set INITIALIZED to zero, which will indirectly
6873 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6875 /* Don't allow initializations for incomplete types except for
6876 arrays which might be completed by the initialization. */
6877 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6878 ; /* A complete type is ok. */
6879 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6881 cp_error ("variable `%#D' has initializer but incomplete type",
6884 type
= TREE_TYPE (decl
) = error_mark_node
;
6886 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6888 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6889 cp_error ("elements of array `%#D' have incomplete type", decl
);
6890 /* else we already gave an error in start_decl. */
6896 && TREE_CODE (decl
) != TYPE_DECL
6897 && TREE_CODE (decl
) != TEMPLATE_DECL
6898 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6900 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6901 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6903 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6905 /* Change the type so that assemble_variable will give
6906 DECL an rtl we can live with: (mem (const_int 0)). */
6907 type
= TREE_TYPE (decl
) = error_mark_node
;
6911 /* If any base type in the hierarchy of TYPE needs a constructor,
6912 then we set initialized to 1. This way any nodes which are
6913 created for the purposes of initializing this aggregate
6914 will live as long as it does. This is necessary for global
6915 aggregates which do not have their initializers processed until
6916 the end of the file. */
6917 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6922 DECL_INITIAL (decl
) = NULL_TREE
;
6925 /* Handle initialization of references.
6926 These three arguments are from `cp_finish_decl', and have the
6927 same meaning here that they do there.
6929 Quotes on semantics can be found in ARM 8.4.3. */
6932 grok_reference_init (decl
, type
, init
)
6933 tree decl
, type
, init
;
6937 if (init
== NULL_TREE
)
6939 if ((DECL_LANG_SPECIFIC (decl
) == 0
6940 || DECL_IN_AGGR_P (decl
) == 0)
6941 && ! DECL_THIS_EXTERN (decl
))
6942 cp_error ("`%D' declared as reference but not initialized", decl
);
6946 if (init
== error_mark_node
)
6949 if (TREE_CODE (init
) == CONSTRUCTOR
)
6951 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6955 if (TREE_CODE (init
) == TREE_LIST
)
6956 init
= build_compound_expr (init
);
6958 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6959 init
= convert_from_reference (init
);
6961 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6962 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6964 /* Note: default conversion is only called in very special cases. */
6965 init
= default_conversion (init
);
6968 /* Convert INIT to the reference type TYPE. This may involve the
6969 creation of a temporary, whose lifetime must be the same as that
6970 of the reference. If so, a DECL_STMT for the temporary will be
6971 added just after the DECL_STMT for DECL. That's why we don't set
6972 DECL_INITIAL for local references (instead assigning to them
6973 explicitly); we need to allow the temporary to be initialized
6975 tmp
= convert_to_reference
6976 (type
, init
, CONV_IMPLICIT
,
6977 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6979 if (tmp
== error_mark_node
)
6981 else if (tmp
!= NULL_TREE
)
6984 tmp
= save_expr (tmp
);
6985 if (building_stmt_tree ())
6987 /* Initialize the declaration. */
6988 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
6989 /* Setting TREE_SIDE_EFFECTS prevents expand_expr from
6990 omitting this expression entirely. */
6991 TREE_SIDE_EFFECTS (tmp
) = 1;
6992 finish_expr_stmt (tmp
);
6995 DECL_INITIAL (decl
) = tmp
;
6999 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7003 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7005 expand_static_init (decl
, DECL_INITIAL (decl
));
7006 DECL_INITIAL (decl
) = NULL_TREE
;
7011 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7012 mucking with forces it does not comprehend (i.e. initialization with a
7013 constructor). If we are at global scope and won't go into COMMON, fill
7014 it in with a dummy CONSTRUCTOR to force the variable into .data;
7015 otherwise we can use error_mark_node. */
7018 obscure_complex_init (decl
, init
)
7021 if (! flag_no_inline
&& TREE_STATIC (decl
))
7023 if (extract_init (decl
, init
))
7027 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7028 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7029 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7033 DECL_INITIAL (decl
) = error_mark_node
;
7038 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7039 array until we finish parsing the initializer. If that's the
7040 situation we're in, update DECL accordingly. */
7043 maybe_deduce_size_from_array_init (decl
, init
)
7047 tree type
= TREE_TYPE (decl
);
7049 if (TREE_CODE (type
) == ARRAY_TYPE
7050 && TYPE_DOMAIN (type
) == NULL_TREE
7051 && TREE_CODE (decl
) != TYPE_DECL
)
7054 = (TREE_STATIC (decl
)
7055 /* Even if pedantic, an external linkage array
7056 may have incomplete type at first. */
7057 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7058 : !DECL_EXTERNAL (decl
));
7059 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7060 int failure
= complete_array_type (type
, initializer
, do_default
);
7063 cp_error ("initializer fails to determine size of `%D'", decl
);
7068 cp_error ("array size missing in `%D'", decl
);
7069 /* If a `static' var's size isn't known, make it extern as
7070 well as static, so it does not get allocated. If it's not
7071 `static', then don't mark it extern; finish_incomplete_decl
7072 will give it a default size and it will get allocated. */
7073 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7074 DECL_EXTERNAL (decl
) = 1;
7077 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7078 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7080 cp_error ("zero-size array `%D'", decl
);
7082 layout_decl (decl
, 0);
7086 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7087 any appropriate error messages regarding the layout. */
7090 layout_var_decl (decl
)
7093 tree type
= TREE_TYPE (decl
);
7094 tree ttype
= target_type (type
);
7096 /* If we haven't already layed out this declaration, do so now.
7097 Note that we must not call complete type for an external object
7098 because it's type might involve templates that we are not
7099 supposed to isntantiate yet. (And it's perfectly legal to say
7100 `extern X x' for some incomplete type `X'.) */
7101 if (!DECL_EXTERNAL (decl
))
7102 complete_type (type
);
7103 if (!DECL_SIZE (decl
)&& TYPE_SIZE (type
))
7104 layout_decl (decl
, 0);
7106 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7108 /* An automatic variable with an incomplete type: that is an error.
7109 Don't talk about array types here, since we took care of that
7110 message in grokdeclarator. */
7111 cp_error ("storage size of `%D' isn't known", decl
);
7112 TREE_TYPE (decl
) = error_mark_node
;
7114 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7115 /* Let debugger know it should output info for this type. */
7116 note_debug_info_needed (ttype
);
7118 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7119 note_debug_info_needed (DECL_CONTEXT (decl
));
7121 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7122 && DECL_SIZE (decl
) != NULL_TREE
7123 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7125 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7126 constant_expression_warning (DECL_SIZE (decl
));
7128 cp_error ("storage size of `%D' isn't constant", decl
);
7132 /* If a local static variable is declared in an inline function, or if
7133 we have a weak definition, we must endeavor to create only one
7134 instance of the variable at link-time. */
7137 maybe_commonize_var (decl
)
7140 /* Static data in a function with comdat linkage also has comdat
7142 if (TREE_STATIC (decl
)
7143 /* Don't mess with __FUNCTION__. */
7144 && ! TREE_ASM_WRITTEN (decl
)
7145 && current_function_decl
7146 && DECL_CONTEXT (decl
) == current_function_decl
7147 && (DECL_THIS_INLINE (current_function_decl
)
7148 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7149 && TREE_PUBLIC (current_function_decl
))
7151 /* Rather than try to get this right with inlining, we suppress
7152 inlining of such functions. */
7153 current_function_cannot_inline
7154 = "function with static variable cannot be inline";
7156 /* If flag_weak, we don't need to mess with this, as we can just
7157 make the function weak, and let it refer to its unique local
7158 copy. This works because we don't allow the function to be
7162 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7164 TREE_PUBLIC (decl
) = 1;
7165 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7167 else if (DECL_INITIAL (decl
) == NULL_TREE
7168 || DECL_INITIAL (decl
) == error_mark_node
)
7170 TREE_PUBLIC (decl
) = 1;
7171 DECL_COMMON (decl
) = 1;
7173 /* else we lose. We can only do this if we can use common,
7174 which we can't if it has been initialized. */
7176 if (TREE_PUBLIC (decl
))
7177 DECL_ASSEMBLER_NAME (decl
)
7178 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7179 else if (! DECL_ARTIFICIAL (decl
))
7181 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7182 cp_warning_at (" you can work around this by removing the initializer", decl
);
7186 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7187 /* Set it up again; we might have set DECL_INITIAL since the last
7189 comdat_linkage (decl
);
7192 /* Issue an error message if DECL is an uninitialized const variable. */
7195 check_for_uninitialized_const_var (decl
)
7198 tree type
= TREE_TYPE (decl
);
7200 /* ``Unless explicitly declared extern, a const object does not have
7201 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7203 if (TREE_CODE (decl
) == VAR_DECL
7204 && TREE_CODE (type
) != REFERENCE_TYPE
7205 && CP_TYPE_CONST_P (type
)
7206 && !TYPE_NEEDS_CONSTRUCTING (type
)
7207 && !DECL_INITIAL (decl
))
7208 cp_error ("uninitialized const `%D'", decl
);
7211 /* Verify INIT (the initializer for DECL), and record the
7212 initialization in DECL_INITIAL, if appropriate. Returns a new
7216 check_initializer (decl
, init
)
7222 if (TREE_CODE (decl
) == FIELD_DECL
)
7225 type
= TREE_TYPE (decl
);
7227 /* If `start_decl' didn't like having an initialization, ignore it now. */
7228 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7231 /* Check the initializer. */
7234 /* Things that are going to be initialized need to have complete
7236 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7238 if (type
== error_mark_node
)
7239 /* We will have already complained. */
7241 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7243 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7246 else if (TREE_CODE (type
) == ARRAY_TYPE
7247 && !TYPE_SIZE (TREE_TYPE (type
)))
7249 cp_error ("elements of array `%#D' have incomplete type", decl
);
7252 else if (!TYPE_SIZE (type
))
7254 cp_error ("`%D' has incomplete type", decl
);
7255 TREE_TYPE (decl
) = error_mark_node
;
7260 if (TREE_CODE (decl
) == CONST_DECL
)
7262 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7264 DECL_INITIAL (decl
) = init
;
7266 /* This will keep us from needing to worry about our obstacks. */
7267 my_friendly_assert (init
!= NULL_TREE
, 149);
7270 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7272 if (TREE_STATIC (decl
))
7273 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7274 grok_reference_init (decl
, type
, init
);
7279 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7281 if (TREE_CODE (type
) == ARRAY_TYPE
)
7282 init
= digest_init (type
, init
, (tree
*) 0);
7283 else if (TREE_CODE (init
) == CONSTRUCTOR
7284 && TREE_HAS_CONSTRUCTOR (init
))
7286 if (TYPE_NON_AGGREGATE_CLASS (type
))
7288 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7290 init
= error_mark_node
;
7293 goto dont_use_constructor
;
7298 dont_use_constructor
:
7299 if (TREE_CODE (init
) != TREE_VEC
)
7300 init
= store_init_value (decl
, init
);
7304 /* We must hide the initializer so that expand_decl
7305 won't try to do something it does not understand. */
7306 init
= obscure_complex_init (decl
, init
);
7308 else if (DECL_EXTERNAL (decl
))
7310 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7311 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7313 tree core_type
= strip_array_types (type
);
7315 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7317 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7318 cp_error ("structure `%D' with uninitialized const members", decl
);
7319 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7320 cp_error ("structure `%D' with uninitialized reference members",
7324 check_for_uninitialized_const_var (decl
);
7326 if (TYPE_SIZE (type
) != NULL_TREE
7327 && TYPE_NEEDS_CONSTRUCTING (type
))
7328 init
= obscure_complex_init (decl
, NULL_TREE
);
7332 check_for_uninitialized_const_var (decl
);
7337 /* If DECL is not a local variable, give it RTL. */
7340 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7343 const char *asmspec
;
7348 type
= TREE_TYPE (decl
);
7349 toplev
= toplevel_bindings_p ();
7351 /* Handle non-variables up front. */
7352 if (TREE_CODE (decl
) != VAR_DECL
)
7354 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7358 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7360 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7362 if (DECL_VIRTUAL_P (decl
))
7363 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7364 else if (TREE_READONLY (decl
)
7365 && DECL_INITIAL (decl
) != NULL_TREE
7366 && DECL_INITIAL (decl
) != error_mark_node
7367 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7369 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7372 && TREE_STATIC (decl
)
7373 && ! TREE_SIDE_EFFECTS (decl
)
7374 && ! TREE_PUBLIC (decl
)
7375 && ! DECL_EXTERNAL (decl
)
7376 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7377 && DECL_MODE (decl
) != BLKmode
)
7379 /* If this variable is really a constant, then fill its DECL_RTL
7380 slot with something which won't take up storage.
7381 If something later should take its address, we can always give
7382 it legitimate RTL at that time. */
7383 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7384 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7385 TREE_ASM_WRITTEN (decl
) = 1;
7387 else if (toplev
&& ! TREE_PUBLIC (decl
))
7389 /* If this is a static const, change its apparent linkage
7390 if it belongs to a #pragma interface. */
7391 if (!interface_unknown
)
7393 TREE_PUBLIC (decl
) = 1;
7394 DECL_EXTERNAL (decl
) = interface_only
;
7396 make_decl_rtl (decl
, asmspec
, toplev
);
7399 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7401 else if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7403 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7405 if (init
== NULL_TREE
7406 #ifdef DEFAULT_STATIC_DEFS
7407 /* If this code is dead, then users must
7408 explicitly declare static member variables
7409 outside the class def'n as well. */
7410 && TYPE_NEEDS_CONSTRUCTING (type
)
7414 DECL_EXTERNAL (decl
) = 1;
7415 make_decl_rtl (decl
, asmspec
, 1);
7418 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7420 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7421 || (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
)))
7422 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7425 /* The old ARM scoping rules injected variables declared in the
7426 initialization statement of a for-statement into the surrounding
7427 scope. We support this usage, in order to be backward-compatible.
7428 DECL is a just-declared VAR_DECL; if necessary inject its
7429 declaration into the surrounding scope. */
7432 maybe_inject_for_scope_var (decl
)
7435 if (current_binding_level
->is_for_scope
)
7437 struct binding_level
*outer
7438 = current_binding_level
->level_chain
;
7440 /* Check to see if the same name is already bound at the outer
7441 level, either because it was directly declared, or because a
7442 dead for-decl got preserved. In either case, the code would
7443 not have been valid under the ARM scope rules, so clear
7444 is_for_scope for the current_binding_level.
7446 Otherwise, we need to preserve the temp slot for decl to last
7447 into the outer binding level. */
7450 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7452 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7453 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7455 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7457 BINDING_VALUE (outer_binding
)
7458 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7459 current_binding_level
->is_for_scope
= 0;
7461 else if (DECL_IN_MEMORY_P (decl
))
7462 preserve_temp_slots (DECL_RTL (decl
));
7466 /* Generate code to initialize DECL (a local variable). */
7469 initialize_local_var (decl
, init
, flags
)
7476 type
= complete_type (TREE_TYPE (decl
));
7478 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7480 /* If we used it already as memory, it must stay in memory. */
7481 DECL_INITIAL (decl
) = NULL_TREE
;
7482 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7485 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7489 /* Compute and store the initial value. */
7490 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7492 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7494 int saved_stmts_are_full_exprs_p
;
7496 emit_line_note (DECL_SOURCE_FILE (decl
),
7497 DECL_SOURCE_LINE (decl
));
7498 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7499 stmts_are_full_exprs_p
= 1;
7500 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7501 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7504 /* Set this to 0 so we can tell whether an aggregate which was
7505 initialized was ever used. Don't do this if it has a
7506 destructor, so we don't complain about the 'resource
7507 allocation is initialization' idiom. Now set
7508 attribute((unused)) on types so decls of that type will be
7509 marked used. (see TREE_USED, above.) */
7510 if (TYPE_NEEDS_CONSTRUCTING (type
)
7512 && !TYPE_NEEDS_DESTRUCTOR (type
)
7513 && DECL_NAME (decl
))
7514 TREE_USED (decl
) = 0;
7515 else if (already_used
)
7516 TREE_USED (decl
) = 1;
7520 /* Generate code to destroy DECL (a local variable). */
7523 destroy_local_var (decl
)
7526 tree type
= TREE_TYPE (decl
);
7529 /* Only variables get cleaned up. */
7530 if (TREE_CODE (decl
) != VAR_DECL
)
7533 /* And only things with destructors need cleaning up. */
7534 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7537 if (TREE_CODE (decl
) == VAR_DECL
&&
7538 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7539 /* We don't clean up things that aren't defined in this
7540 translation unit, or that need a static cleanup. The latter
7541 are handled by finish_file. */
7544 /* Compute the cleanup. */
7545 cleanup
= maybe_build_cleanup (decl
);
7547 /* Record the cleanup required for this declaration. */
7548 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7550 finish_decl_cleanup (decl
, cleanup
);
7553 /* Let the back-end know about DECL. */
7556 emit_local_var (decl
)
7559 /* Create RTL for this variable. */
7560 if (DECL_RTL (decl
))
7561 /* Only a RESULT_DECL should have non-NULL RTL when
7562 arriving here. All other local variables are
7563 assigned RTL in this function. */
7564 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7568 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7569 /* The user must have specified an assembler name for this
7570 variable. Set that up now. */
7571 rest_of_decl_compilation
7572 (decl
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
7573 /*top_level=*/0, /*at_end=*/0);
7578 /* Actually do the initialization. */
7579 expand_start_target_temps ();
7580 expand_decl_init (decl
);
7581 expand_end_target_temps ();
7584 /* Finish processing of a declaration;
7585 install its line number and initial value.
7586 If the length of an array type is not known before,
7587 it must be determined now, from the initial value, or it is an error.
7589 Call `pop_obstacks' iff NEED_POP is nonzero.
7591 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7592 for aggregates that have constructors alive on the permanent obstack,
7593 so that the global initializing functions can be written at the end.
7595 INIT0 holds the value of an initializer that should be allowed to escape
7598 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7599 if the (init) syntax was used.
7601 For functions that take default parameters, DECL points to its
7602 "maximal" instantiation. `cp_finish_decl' must then also declared its
7603 subsequently lower and lower forms of instantiation, checking for
7604 ambiguity as it goes. This can be sped up later. */
7607 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7614 tree ttype
= NULL_TREE
;
7615 int temporary
= allocation_temporary_p ();
7616 const char *asmspec
= NULL
;
7617 int was_readonly
= 0;
7619 /* If this is 0, then we did not change obstacks. */
7623 error ("assignment (not initialization) in declaration");
7627 /* If a name was specified, get the string. */
7629 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7631 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7633 cp_error ("Cannot initialize `%D' to namespace `%D'",
7638 if (current_class_type
7639 && DECL_REAL_CONTEXT (decl
) == current_class_type
7640 && TYPE_BEING_DEFINED (current_class_type
)
7641 && (DECL_INITIAL (decl
) || init
))
7642 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7644 if (TREE_CODE (decl
) == VAR_DECL
7645 && DECL_CONTEXT (decl
)
7646 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7647 && DECL_CONTEXT (decl
) != current_namespace
7650 /* Leave the namespace of the object. */
7651 pop_decl_namespace ();
7654 type
= TREE_TYPE (decl
);
7656 if (type
== error_mark_node
)
7658 if (toplevel_bindings_p () && temporary
)
7659 end_temporary_allocation ();
7664 /* Add this declaration to the statement-tree. */
7665 if (building_stmt_tree ()
7666 && TREE_CODE (current_scope ()) == FUNCTION_DECL
)
7667 add_decl_stmt (decl
);
7669 if (TYPE_HAS_MUTABLE_P (type
))
7670 TREE_READONLY (decl
) = 0;
7672 if (processing_template_decl
)
7674 if (init
&& DECL_INITIAL (decl
))
7675 DECL_INITIAL (decl
) = init
;
7679 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7680 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7682 /* Take care of TYPE_DECLs up front. */
7683 if (TREE_CODE (decl
) == TYPE_DECL
)
7685 if (init
&& DECL_INITIAL (decl
))
7687 /* typedef foo = bar; store the type of bar as the type of foo. */
7688 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7689 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7691 if (type
!= error_mark_node
7692 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7694 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7695 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7696 set_identifier_type_value (DECL_NAME (decl
), type
);
7697 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7699 GNU_xref_decl (current_function_decl
, decl
);
7701 /* If we have installed this as the canonical typedef for this
7702 type, and that type has not been defined yet, delay emitting
7703 the debug information for it, as we will emit it later. */
7704 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7705 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7706 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7708 rest_of_decl_compilation (decl
, NULL_PTR
,
7709 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7713 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7714 ttype
= target_type (type
);
7716 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7717 && TYPE_NEEDS_CONSTRUCTING (type
))
7719 /* Currently, GNU C++ puts constants in text space, making them
7720 impossible to initialize. In the future, one would hope for
7721 an operating system which understood the difference between
7722 initialization and the running of a program. */
7724 TREE_READONLY (decl
) = 0;
7727 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7729 /* This must override the asm specifier which was placed by
7730 grokclassfn. Lay this out fresh. */
7731 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7732 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7733 make_decl_rtl (decl
, asmspec
, 0);
7736 /* Deduce size of array from initialization, if not already known. */
7737 maybe_deduce_size_from_array_init (decl
, init
);
7738 init
= check_initializer (decl
, init
);
7740 GNU_xref_decl (current_function_decl
, decl
);
7742 /* For top-level declaration, the initial value was read in
7743 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7744 must go in the permanent obstack; but don't discard the
7745 temporary data yet. */
7747 if (toplevel_bindings_p () && temporary
)
7748 end_temporary_allocation ();
7750 if (TREE_CODE (decl
) == VAR_DECL
)
7751 layout_var_decl (decl
);
7753 /* Output the assembler code and/or RTL code for variables and functions,
7754 unless the type is an undefined structure or union.
7755 If not, it will get done when the type is completed. */
7756 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7757 || TREE_CODE (decl
) == RESULT_DECL
)
7759 if (TREE_CODE (decl
) == VAR_DECL
)
7760 maybe_commonize_var (decl
);
7762 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7764 if (TREE_CODE (type
) == FUNCTION_TYPE
7765 || TREE_CODE (type
) == METHOD_TYPE
)
7766 abstract_virtuals_error (decl
,
7767 strip_array_types (TREE_TYPE (type
)));
7769 abstract_virtuals_error (decl
, strip_array_types (type
));
7771 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7773 else if (DECL_EXTERNAL (decl
)
7774 && ! (DECL_LANG_SPECIFIC (decl
)
7775 && DECL_NOT_REALLY_EXTERN (decl
)))
7778 DECL_INITIAL (decl
) = init
;
7780 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7782 /* Cleanups for static variables are handled by `finish_file'. */
7783 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7784 || TYPE_NEEDS_DESTRUCTOR (type
))
7785 expand_static_init (decl
, init
);
7787 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
7789 /* This is a local declaration. */
7790 if (doing_semantic_analysis_p ())
7791 maybe_inject_for_scope_var (decl
);
7792 /* Initialize the local variable. But, if we're building a
7793 statement-tree, we'll do the initialization when we
7795 if (processing_template_decl
)
7797 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7798 DECL_INITIAL (decl
) = init
;
7802 /* If we're not building RTL, then we need to do so
7804 if (!building_stmt_tree ())
7805 emit_local_var (decl
);
7806 /* Initialize the variable. */
7807 initialize_local_var (decl
, init
, flags
);
7808 /* Clean up the variable. */
7809 destroy_local_var (decl
);
7814 /* Undo call to `pushclass' that was done in `start_decl'
7815 due to initialization of qualified member variable.
7816 I.e., Foo::x = 10; */
7818 tree context
= DECL_REAL_CONTEXT (decl
);
7820 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7821 && (TREE_CODE (decl
) == VAR_DECL
7822 /* We also have a pushclass done that we need to undo here
7823 if we're at top level and declare a method. */
7824 || TREE_CODE (decl
) == FUNCTION_DECL
)
7825 /* If size hasn't been set, we're still defining it,
7826 and therefore inside the class body; don't pop
7827 the binding level.. */
7828 && TYPE_SIZE (context
) != NULL_TREE
7829 && context
== current_class_type
)
7830 pop_nested_class ();
7836 /* If requested, warn about definitions of large data objects. */
7838 if (warn_larger_than
7839 && ! processing_template_decl
7840 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7841 && !DECL_EXTERNAL (decl
))
7843 register tree decl_size
= DECL_SIZE (decl
);
7845 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7847 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7849 if (units
> larger_than_size
)
7850 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7855 /* Resume permanent allocation, if not within a function. The
7856 corresponding push_obstacks_nochange is in start_decl,
7857 start_method, groktypename, and in grokfield. */
7861 TREE_READONLY (decl
) = 1;
7864 /* This is here for a midend callback from c-common.c */
7867 finish_decl (decl
, init
, asmspec_tree
)
7871 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7874 /* Generate code to handle the destruction of the function-scoped
7875 static variable DECL. */
7878 destroy_local_static (decl
)
7881 tree cleanup
, fcall
;
7883 int saved_flag_access_control
;
7885 if (atexit_node
== 0)
7887 tree atexit_fndecl
, PFV
, pfvlist
;
7888 /* Remember this information until end of file. */
7889 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7890 PFV
= build_pointer_type (build_function_type
7891 (void_type_node
, void_list_node
));
7893 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7895 push_lang_context (lang_name_c
);
7896 /* Note that we do not call pushdecl for this function;
7897 there's no reason that this declaration should be
7898 accessible to anyone. */
7900 = define_function ("atexit",
7901 build_function_type (void_type_node
,
7903 /*pfn=*/0, NULL_PTR
);
7904 mark_used (atexit_fndecl
);
7905 atexit_node
= default_conversion (atexit_fndecl
);
7906 pop_lang_context ();
7910 /* Call build_cleanup before we enter the anonymous function so that
7911 any access checks will be done relative to the current scope,
7912 rather than the scope of the anonymous function. */
7913 build_cleanup (decl
);
7915 /* Now start the function. */
7916 cleanup
= start_anon_func ();
7918 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7919 to the original function, rather than the anonymous one. That
7920 will make the back-end think that nested functions are in use,
7921 which causes confusion. */
7922 saved_flag_access_control
= flag_access_control
;
7923 flag_access_control
= 0;
7924 fcall
= build_cleanup (decl
);
7925 flag_access_control
= saved_flag_access_control
;
7927 /* Create the body of the anonymous function. */
7928 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7929 finish_expr_stmt (fcall
);
7930 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7933 /* Call atexit with the cleanup function. */
7934 mark_addressable (cleanup
);
7935 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7936 fcall
= build_function_call (atexit_node
,
7937 tree_cons (NULL_TREE
,
7940 finish_expr_stmt (fcall
);
7944 expand_static_init (decl
, init
)
7948 tree oldstatic
= value_member (decl
, static_aggregates
);
7952 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7953 cp_error ("multiple initializations given for `%D'", decl
);
7955 else if (! toplevel_bindings_p ())
7957 /* Emit code to perform this initialization but once. */
7964 /* Remember this information until end of file. */
7965 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7967 /* Emit code to perform this initialization but once. This code
7970 static int temp = 0;
7972 // Do initialization.
7974 // Register variable for destruction at end of program.
7977 Note that the `temp' variable is only set to 1 *after* the
7978 initialization is complete. This ensures that an exception,
7979 thrown during the construction, will cause the variable to
7980 reinitialized when we pass through this code again, as per:
7984 If the initialization exits by throwing an exception, the
7985 initialization is not complete, so it will be tried again
7986 the next time control enters the declaration.
7988 In theory, this process should be thread-safe, too; multiple
7989 threads should not be able to initialize the variable more
7990 than once. We don't yet attempt to ensure thread-safety. */
7991 temp
= get_temp_name (integer_type_node
, 1);
7992 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
7994 /* Begin the conditional initialization. */
7995 if_stmt
= begin_if_stmt ();
7996 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
7999 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8001 /* Do the initialization itself. */
8002 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8003 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8004 assignment
= build_aggr_init (decl
, init
, 0);
8007 /* The initialization we're doing here is just a bitwise
8009 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8010 TREE_SIDE_EFFECTS (assignment
) = 1;
8013 assignment
= NULL_TREE
;
8015 /* Once the assignment is complete, set TEMP to 1. Since the
8016 construction of the static object is complete at this point,
8017 we want to make sure TEMP is set to 1 even if a temporary
8018 constructed during the initialization throws an exception
8019 when it is destroyed. So, we combine the initialization and
8020 the assignment to TEMP into a single expression, ensuring
8021 that when we call finish_expr_stmt the cleanups will not be
8022 run until after TEMP is set to 1. */
8023 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8026 assignment
= tree_cons (NULL_TREE
, assignment
,
8027 build_tree_list (NULL_TREE
,
8029 assignment
= build_compound_expr (assignment
);
8032 assignment
= temp_init
;
8033 finish_expr_stmt (assignment
);
8035 /* Use atexit to register a function for destroying this static
8037 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8038 destroy_local_static (decl
);
8040 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8041 finish_then_clause (if_stmt
);
8044 /* Resume old (possibly temporary) allocation. */
8049 /* This code takes into account memory allocation policy of
8050 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8051 hold for this object, then we must make permanent the storage
8052 currently in the temporary obstack. */
8053 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8054 preserve_initializer ();
8055 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8059 /* Finish the declaration of a catch-parameter. */
8062 start_handler_parms (declspecs
, declarator
)
8069 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8071 if (decl
== NULL_TREE
)
8072 error ("invalid catch parameter");
8081 /* Make TYPE a complete type based on INITIAL_VALUE.
8082 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8083 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8086 complete_array_type (type
, initial_value
, do_default
)
8087 tree type
, initial_value
;
8090 register tree maxindex
= NULL_TREE
;
8093 /* Allocate on the same obstack as TYPE. */
8094 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8098 /* Note MAXINDEX is really the maximum index,
8099 one less than the size. */
8100 if (TREE_CODE (initial_value
) == STRING_CST
)
8103 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8104 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8107 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8109 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8110 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8111 for (; elts
; elts
= TREE_CHAIN (elts
))
8113 if (TREE_PURPOSE (elts
))
8114 maxindex
= TREE_PURPOSE (elts
);
8116 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8118 maxindex
= copy_node (maxindex
);
8122 /* Make an error message unless that happened already. */
8123 if (initial_value
!= error_mark_node
)
8126 initial_value
= NULL_TREE
;
8128 /* Prevent further error messages. */
8129 maxindex
= build_int_2 (0, 0);
8136 maxindex
= build_int_2 (0, 0);
8145 domain
= build_index_type (maxindex
);
8146 TYPE_DOMAIN (type
) = domain
;
8148 if (! TREE_TYPE (maxindex
))
8149 TREE_TYPE (maxindex
) = domain
;
8151 itype
= TREE_TYPE (initial_value
);
8154 if (itype
&& !TYPE_DOMAIN (itype
))
8155 TYPE_DOMAIN (itype
) = domain
;
8156 /* The type of the main variant should never be used for arrays
8157 of different sizes. It should only ever be completed with the
8158 size of the array. */
8159 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8160 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8165 /* Lay out the type now that we can get the real answer. */
8172 /* Return zero if something is declared to be a member of type
8173 CTYPE when in the context of CUR_TYPE. STRING is the error
8174 message to print in that case. Otherwise, quietly return 1. */
8177 member_function_or_else (ctype
, cur_type
, string
)
8178 tree ctype
, cur_type
;
8181 if (ctype
&& ctype
!= cur_type
)
8183 error (string
, TYPE_NAME_STRING (ctype
));
8189 /* Subroutine of `grokdeclarator'. */
8191 /* Generate errors possibly applicable for a given set of specifiers.
8192 This is for ARM $7.1.2. */
8195 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8198 int virtualp
, quals
, friendp
, raises
, inlinep
;
8201 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8203 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8205 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8208 cp_error_at ("`%D' declared as a friend", object
);
8210 cp_error_at ("`%D' declared with an exception specification", object
);
8213 /* CTYPE is class type, or null if non-class.
8214 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8216 DECLARATOR is the function's name.
8217 VIRTUALP is truthvalue of whether the function is virtual or not.
8218 FLAGS are to be passed through to `grokclassfn'.
8219 QUALS are qualifiers indicating whether the function is `const'
8221 RAISES is a list of exceptions that this function can raise.
8222 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8223 not look, and -1 if we should not call `grokclassfn' at all.
8225 Returns `NULL_TREE' if something goes wrong, after issuing
8226 applicable error messages. */
8229 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8230 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8231 template_count
, in_namespace
)
8234 tree orig_declarator
;
8236 enum overload_flags flags
;
8238 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8242 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8243 int has_default_arg
= 0;
8247 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8248 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8254 type
= build_exception_variant (type
, raises
);
8257 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8258 /* Propagate volatile out from type to decl. */
8259 if (TYPE_VOLATILE (type
))
8260 TREE_THIS_VOLATILE (decl
) = 1;
8262 /* If this decl has namespace scope, set that up. */
8264 set_decl_namespace (decl
, in_namespace
, friendp
);
8265 else if (publicp
&& ! ctype
)
8266 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8268 /* `main' and builtins have implicit 'C' linkage. */
8269 if ((MAIN_NAME_P (declarator
)
8270 || (IDENTIFIER_LENGTH (declarator
) > 10
8271 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8272 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8273 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8274 && current_lang_name
== lang_name_cplusplus
8275 && ctype
== NULL_TREE
8276 /* NULL_TREE means global namespace. */
8277 && DECL_CONTEXT (decl
) == NULL_TREE
)
8278 DECL_LANGUAGE (decl
) = lang_c
;
8280 /* Should probably propagate const out from type to decl I bet (mrs). */
8283 DECL_STATIC_FUNCTION_P (decl
) = 1;
8284 DECL_CONTEXT (decl
) = ctype
;
8288 DECL_CLASS_CONTEXT (decl
) = ctype
;
8290 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8292 if (processing_template_decl
)
8293 error ("cannot declare `main' to be a template");
8295 error ("cannot declare `main' to be inline");
8297 error ("cannot declare `main' to be static");
8302 /* Members of anonymous types and local classes have no linkage; make
8304 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8305 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8310 /* [basic.link]: A name with no linkage (notably, the name of a class
8311 or enumeration declared in a local scope) shall not be used to
8312 declare an entity with linkage.
8314 Only check this for public decls for now. */
8315 t
= no_linkage_check (TREE_TYPE (decl
));
8318 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8320 if (DECL_LANGUAGE (decl
) == lang_c
)
8321 /* Allow this; it's pretty common in C. */;
8323 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8327 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8332 TREE_PUBLIC (decl
) = publicp
;
8335 DECL_INTERFACE_KNOWN (decl
) = 1;
8336 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8340 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8342 DECL_EXTERNAL (decl
) = 1;
8343 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8345 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8346 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8350 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8351 grok_op_properties (decl
, virtualp
, check
< 0);
8353 if (ctype
&& hack_decl_function_context (decl
))
8354 DECL_NO_STATIC_CHAIN (decl
) = 1;
8356 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8357 if (TREE_PURPOSE (t
)
8358 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8360 has_default_arg
= 1;
8365 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8369 ("defining explicit specialization `%D' in friend declaration",
8373 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8375 /* Something like `template <class T> friend void f<T>()'. */
8376 cp_error ("template-id `%D' in declaration of primary template",
8382 /* A friend declaration of the form friend void f<>(). Record
8383 the information in the TEMPLATE_ID_EXPR. */
8384 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8385 DECL_TEMPLATE_INFO (decl
)
8386 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8387 TREE_OPERAND (orig_declarator
, 1),
8390 if (has_default_arg
)
8392 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8399 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8406 if (has_default_arg
)
8407 add_defarg_fn (decl
);
8409 /* Plain overloading: will not be grok'd by grokclassfn. */
8410 if (! ctype
&& ! processing_template_decl
8411 && DECL_LANGUAGE (decl
) != lang_c
8412 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8413 set_mangled_name_for_decl (decl
);
8416 /* Make the init_value nonzero so pushdecl knows this is not
8417 tentative. error_mark_node is replaced later with the BLOCK. */
8418 DECL_INITIAL (decl
) = error_mark_node
;
8420 /* Caller will do the rest of this. */
8424 if (check
&& funcdef_flag
)
8425 DECL_INITIAL (decl
) = error_mark_node
;
8427 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8430 /* Just handle constructors here. We could do this
8431 inside the following if stmt, but I think
8432 that the code is more legible by breaking this
8433 case out. See comments below for what each of
8434 the following calls is supposed to do. */
8435 DECL_CONSTRUCTOR_P (decl
) = 1;
8437 grokclassfn (ctype
, decl
, flags
, quals
);
8439 decl
= check_explicit_specialization (orig_declarator
, decl
,
8441 2 * (funcdef_flag
!= 0) +
8442 4 * (friendp
!= 0));
8443 if (decl
== error_mark_node
)
8446 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8449 tmp
= check_classfn (ctype
, decl
);
8451 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8452 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8454 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8455 cp_error ("definition of implicitly-declared `%D'", tmp
);
8456 if (tmp
&& duplicate_decls (decl
, tmp
))
8459 if (! grok_ctor_properties (ctype
, decl
))
8466 /* Function gets the ugly name, field gets the nice one.
8467 This call may change the type of the function (because
8468 of default parameters)! */
8469 if (ctype
!= NULL_TREE
)
8470 grokclassfn (ctype
, decl
, flags
, quals
);
8472 decl
= check_explicit_specialization (orig_declarator
, decl
,
8474 2 * (funcdef_flag
!= 0) +
8475 4 * (friendp
!= 0));
8476 if (decl
== error_mark_node
)
8479 if (ctype
!= NULL_TREE
8480 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8483 tmp
= check_classfn (ctype
, decl
);
8485 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8486 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8488 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8489 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8491 /* Remove the `this' parm added by grokclassfn.
8492 XXX Isn't this done in start_function, too? */
8493 revert_static_member_fn (&decl
, NULL
, NULL
);
8494 last_function_parms
= TREE_CHAIN (last_function_parms
);
8496 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8497 cp_error ("definition of implicitly-declared `%D'", tmp
);
8500 /* Attempt to merge the declarations. This can fail, in
8501 the case of some illegal specialization declarations. */
8502 if (!duplicate_decls (decl
, tmp
))
8503 cp_error ("no `%#D' member function declared in class `%T'",
8509 if (ctype
== NULL_TREE
|| check
)
8514 DECL_VIRTUAL_P (decl
) = 1;
8515 if (DECL_VINDEX (decl
) == NULL_TREE
)
8516 DECL_VINDEX (decl
) = error_mark_node
;
8517 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8524 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8527 RID_BIT_TYPE
*specbits_in
;
8533 RID_BIT_TYPE specbits
;
8535 specbits
= *specbits_in
;
8537 if (TREE_CODE (type
) == OFFSET_TYPE
)
8539 /* If you declare a static member so that it
8540 can be initialized, the code will reach here. */
8541 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8542 type
= TREE_TYPE (type
);
8543 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8544 DECL_CONTEXT (decl
) = basetype
;
8545 DECL_CLASS_CONTEXT (decl
) = basetype
;
8546 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8553 context
= in_namespace
;
8554 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8555 context
= current_namespace
;
8557 context
= NULL_TREE
;
8559 if (processing_template_decl
)
8561 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8562 we can call push_template_decl. */
8563 push_permanent_obstack ();
8564 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8568 decl
= build_decl (VAR_DECL
, declarator
, type
);
8571 set_decl_namespace (decl
, context
, 0);
8573 context
= DECL_CONTEXT (decl
);
8574 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8575 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8579 set_decl_namespace (decl
, in_namespace
, 0);
8581 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8583 DECL_THIS_EXTERN (decl
) = 1;
8584 DECL_EXTERNAL (decl
) = !initialized
;
8587 /* In class context, static means one per class,
8588 public access, and static storage. */
8589 if (DECL_CLASS_SCOPE_P (decl
))
8591 TREE_PUBLIC (decl
) = 1;
8592 TREE_STATIC (decl
) = 1;
8593 DECL_EXTERNAL (decl
) = 0;
8595 /* At top level, either `static' or no s.c. makes a definition
8596 (perhaps tentative), and absence of `static' makes it public. */
8597 else if (toplevel_bindings_p ())
8599 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8600 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8601 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8603 /* Not at top level, only `static' makes a static definition. */
8606 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8607 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8610 if (TREE_PUBLIC (decl
))
8612 /* [basic.link]: A name with no linkage (notably, the name of a class
8613 or enumeration declared in a local scope) shall not be used to
8614 declare an entity with linkage.
8616 Only check this for public decls for now. */
8617 tree t
= no_linkage_check (TREE_TYPE (decl
));
8620 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8621 /* Ignore for now; `enum { foo } e' is pretty common. */;
8623 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8631 /* Create and return a canonical pointer to member function type, for
8632 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8635 build_ptrmemfunc_type (type
)
8641 tree unqualified_variant
= NULL_TREE
;
8643 /* If a canonical type already exists for this type, use it. We use
8644 this method instead of type_hash_canon, because it only does a
8645 simple equality check on the list of field members. */
8647 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8650 /* Make sure that we always have the unqualified pointer-to-member
8652 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8654 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8656 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8658 u
= make_lang_type (UNION_TYPE
);
8659 SET_IS_AGGR_TYPE (u
, 0);
8660 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8661 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8663 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8664 TYPE_NAME (u
) = NULL_TREE
;
8666 t
= make_lang_type (RECORD_TYPE
);
8668 /* Let the front-end know this is a pointer to member function... */
8669 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8670 /* ... and not really an aggregate. */
8671 SET_IS_AGGR_TYPE (t
, 0);
8673 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8675 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8677 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8678 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8682 /* Zap out the name so that the back-end will give us the debugging
8683 information for this anonymous RECORD_TYPE. */
8684 TYPE_NAME (t
) = NULL_TREE
;
8686 /* If this is not the unqualified form of this pointer-to-member
8687 type, set the TYPE_MAIN_VARIANT for this type to be the
8688 unqualified type. Since they are actually RECORD_TYPEs that are
8689 not variants of each other, we must do this manually. */
8690 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8692 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8693 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8694 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8695 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8698 /* Cache this pointer-to-member type so that we can find it again
8700 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8702 /* Seems to be wanted. */
8703 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8708 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8709 Check to see that the definition is valid. Issue appropriate error
8710 messages. Return 1 if the definition is particularly bad, or 0
8714 check_static_variable_definition (decl
, type
)
8718 /* Motion 10 at San Diego: If a static const integral data member is
8719 initialized with an integral constant expression, the initializer
8720 may appear either in the declaration (within the class), or in
8721 the definition, but not both. If it appears in the class, the
8722 member is a member constant. The file-scope definition is always
8724 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8726 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8728 /* If we just return the declaration, crashes will sometimes
8729 occur. We therefore return void_type_node, as if this was a
8730 friend declaration, to cause callers to completely ignore
8731 this declaration. */
8734 else if (!CP_TYPE_CONST_P (type
))
8735 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8737 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8738 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8743 /* Given declspecs and a declarator,
8744 determine the name and type of the object declared
8745 and construct a ..._DECL node for it.
8746 (In one case we can return a ..._TYPE node instead.
8747 For invalid input we sometimes return 0.)
8749 DECLSPECS is a chain of tree_list nodes whose value fields
8750 are the storage classes and type specifiers.
8752 DECL_CONTEXT says which syntactic context this declaration is in:
8753 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8754 FUNCDEF for a function definition. Like NORMAL but a few different
8755 error messages in each case. Return value may be zero meaning
8756 this definition is too screwy to try to parse.
8757 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8758 handle member functions (which have FIELD context).
8759 Return value may be zero meaning this definition is too screwy to
8761 PARM for a parameter declaration (either within a function prototype
8762 or before a function body). Make a PARM_DECL, or return void_type_node.
8763 CATCHPARM for a parameter declaration before a catch clause.
8764 TYPENAME if for a typename (in a cast or sizeof).
8765 Don't make a DECL node; just return the ..._TYPE node.
8766 FIELD for a struct or union field; make a FIELD_DECL.
8767 BITFIELD for a field with specified width.
8768 INITIALIZED is 1 if the decl has an initializer.
8770 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8771 normal attributes in TREE_PURPOSE, or NULL_TREE.
8773 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8774 It may also be so in the PARM case, for a prototype where the
8775 argument type is specified but not the name.
8777 This function is where the complicated C meanings of `static'
8778 and `extern' are interpreted.
8780 For C++, if there is any monkey business to do, the function which
8781 calls this one must do it, i.e., prepending instance variables,
8782 renaming overloaded function names, etc.
8784 Note that for this C++, it is an error to define a method within a class
8785 which does not belong to that class.
8787 Except in the case where SCOPE_REFs are implicitly known (such as
8788 methods within a class being redundantly qualified),
8789 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8790 (class_name::decl_name). The caller must also deal with this.
8792 If a constructor or destructor is seen, and the context is FIELD,
8793 then the type gains the attribute TREE_HAS_x. If such a declaration
8794 is erroneous, NULL_TREE is returned.
8796 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8797 function, these are the qualifiers to give to the `this' pointer.
8799 May return void_type_node if the declarator turned out to be a friend.
8800 See grokfield for details. */
8802 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8805 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8808 enum decl_context decl_context
;
8812 RID_BIT_TYPE specbits
;
8815 tree type
= NULL_TREE
;
8821 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8822 int explicit_int
= 0;
8823 int explicit_char
= 0;
8824 int defaulted_int
= 0;
8825 tree typedef_decl
= NULL_TREE
;
8827 tree typedef_type
= NULL_TREE
;
8828 int funcdef_flag
= 0;
8829 enum tree_code innermost_code
= ERROR_MARK
;
8832 /* See the code below that used this. */
8833 tree decl_machine_attr
= NULL_TREE
;
8835 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8836 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8837 tree init
= NULL_TREE
;
8839 /* Keep track of what sort of function is being processed
8840 so that we can warn about default return values, or explicit
8841 return values which do not match prescribed defaults. */
8842 enum return_types return_type
= return_normal
;
8844 tree dname
= NULL_TREE
;
8845 tree ctype
= current_class_type
;
8846 tree ctor_return_type
= NULL_TREE
;
8847 enum overload_flags flags
= NO_SPECIAL
;
8848 tree quals
= NULL_TREE
;
8849 tree raises
= NULL_TREE
;
8850 int template_count
= 0;
8851 tree in_namespace
= NULL_TREE
;
8855 RIDBIT_RESET_ALL (specbits
);
8856 if (decl_context
== FUNCDEF
)
8857 funcdef_flag
= 1, decl_context
= NORMAL
;
8858 else if (decl_context
== MEMFUNCDEF
)
8859 funcdef_flag
= -1, decl_context
= FIELD
;
8860 else if (decl_context
== BITFIELD
)
8861 bitfield
= 1, decl_context
= FIELD
;
8863 /* Look inside a declarator for the name being declared
8864 and get it as a string, for an error message. */
8866 tree
*next
= &declarator
;
8870 while (next
&& *next
)
8873 switch (TREE_CODE (decl
))
8876 /* For attributes. */
8877 next
= &TREE_VALUE (decl
);
8882 next
= &TREE_OPERAND (decl
, 0);
8885 case BIT_NOT_EXPR
: /* For C++ destructors! */
8887 tree name
= TREE_OPERAND (decl
, 0);
8888 tree rename
= NULL_TREE
;
8890 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8892 return_type
= return_dtor
;
8893 if (TREE_CODE (name
) == TYPE_DECL
)
8894 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8895 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8896 if (ctype
== NULL_TREE
)
8898 if (current_class_type
== NULL_TREE
)
8900 error ("destructors must be member functions");
8905 tree t
= constructor_name (current_class_name
);
8912 tree t
= constructor_name (ctype
);
8919 cp_error ("destructor `%T' must match class name `%T'",
8921 TREE_OPERAND (decl
, 0) = rename
;
8927 case ADDR_EXPR
: /* C++ reference declaration */
8932 innermost_code
= TREE_CODE (decl
);
8933 next
= &TREE_OPERAND (decl
, 0);
8937 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
8939 /* This is actually a variable declaration using
8940 constructor syntax. We need to call start_decl and
8941 cp_finish_decl so we can get the variable
8944 tree attributes
, prefix_attributes
;
8946 *next
= TREE_OPERAND (decl
, 0);
8947 init
= CALL_DECLARATOR_PARMS (decl
);
8951 attributes
= TREE_PURPOSE (attrlist
);
8952 prefix_attributes
= TREE_VALUE (attrlist
);
8956 attributes
= NULL_TREE
;
8957 prefix_attributes
= NULL_TREE
;
8960 decl
= start_decl (declarator
, declspecs
, 1,
8961 attributes
, prefix_attributes
);
8964 /* Look for __unused__ attribute */
8965 if (TREE_USED (TREE_TYPE (decl
)))
8966 TREE_USED (decl
) = 1;
8967 finish_decl (decl
, init
, NULL_TREE
);
8970 cp_error ("invalid declarator");
8973 innermost_code
= TREE_CODE (decl
);
8974 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8975 ctype
= current_class_type
;
8977 && TREE_OPERAND (decl
, 0)
8978 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
8979 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
8980 == constructor_name_full (ctype
))
8981 || (DECL_NAME (TREE_OPERAND (decl
, 0))
8982 == constructor_name (ctype
)))))
8983 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8984 next
= &TREE_OPERAND (decl
, 0);
8986 if (ctype
!= NULL_TREE
8987 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
8988 && decl
== constructor_name (ctype
))
8990 return_type
= return_ctor
;
8991 ctor_return_type
= ctype
;
8996 case TEMPLATE_ID_EXPR
:
8998 tree fns
= TREE_OPERAND (decl
, 0);
9000 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9001 fns
= TREE_OPERAND (fns
, 0);
9004 if (TREE_CODE (dname
) == COMPONENT_REF
)
9005 dname
= TREE_OPERAND (dname
, 1);
9006 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9008 my_friendly_assert (is_overloaded_fn (dname
),
9010 dname
= DECL_NAME (get_first_fn (dname
));
9015 case IDENTIFIER_NODE
:
9016 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9023 cp_error ("declarator-id missing; using reserved word `%D'",
9025 name
= IDENTIFIER_POINTER (dname
);
9027 if (! IDENTIFIER_OPNAME_P (dname
)
9028 /* GNU/Linux headers use '__op'. Arrgh. */
9029 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9030 name
= IDENTIFIER_POINTER (dname
);
9033 if (IDENTIFIER_TYPENAME_P (dname
))
9035 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9036 flags
= TYPENAME_FLAG
;
9037 ctor_return_type
= TREE_TYPE (dname
);
9038 return_type
= return_conversion
;
9040 name
= operator_name_string (dname
);
9047 /* Perform error checking, and decide on a ctype. */
9048 tree cname
= TREE_OPERAND (decl
, 0);
9049 if (cname
== NULL_TREE
)
9051 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9054 in_namespace
= TREE_OPERAND (decl
, 0);
9055 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9057 else if (! is_aggr_type (cname
, 1))
9058 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9059 /* Must test TREE_OPERAND (decl, 1), in case user gives
9060 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9061 else if (TREE_OPERAND (decl
, 1)
9062 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9064 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9065 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9067 cp_error ("`%T::%D' is not a valid declarator", cname
,
9068 TREE_OPERAND (decl
, 1));
9069 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9070 cname
, TREE_OPERAND (decl
, 1));
9071 return void_type_node
;
9073 else if (ctype
== NULL_TREE
)
9075 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9076 TREE_OPERAND (decl
, 0) = ctype
;
9079 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9081 cp_error ("type `%T' is not derived from type `%T'",
9083 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9089 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9090 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9091 == constructor_name_full (ctype
))
9092 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9093 == constructor_name (ctype
))))
9094 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9095 next
= &TREE_OPERAND (decl
, 1);
9099 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9100 && constructor_name (ctype
) == decl
)
9102 return_type
= return_ctor
;
9103 ctor_return_type
= ctype
;
9105 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9106 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9107 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9108 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9110 return_type
= return_dtor
;
9111 ctor_return_type
= ctype
;
9113 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9114 next
= &TREE_OPERAND (decl
, 0);
9125 /* Parse error puts this typespec where
9126 a declarator should go. */
9127 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9128 if (TREE_TYPE (decl
) == current_class_type
)
9129 cp_error (" perhaps you want `%T' for a constructor",
9130 current_class_name
);
9131 dname
= DECL_NAME (decl
);
9132 name
= IDENTIFIER_POINTER (dname
);
9134 /* Avoid giving two errors for this. */
9135 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9137 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9144 cp_compiler_error ("`%D' as declarator", decl
);
9145 return 0; /* We used to do a 155 abort here. */
9150 /* A function definition's declarator must have the form of
9151 a function declarator. */
9153 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9156 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9157 && innermost_code
!= CALL_EXPR
9158 && ! (ctype
&& declspecs
== NULL_TREE
))
9160 cp_error ("declaration of `%D' as non-function", dname
);
9161 return void_type_node
;
9164 /* Anything declared one level down from the top level
9165 must be one of the parameters of a function
9166 (because the body is at least two levels down). */
9168 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9169 by not allowing C++ class definitions to specify their parameters
9170 with xdecls (must be spec.d in the parmlist).
9172 Since we now wait to push a class scope until we are sure that
9173 we are in a legitimate method context, we must set oldcname
9174 explicitly (since current_class_name is not yet alive).
9176 We also want to avoid calling this a PARM if it is in a namespace. */
9178 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9180 struct binding_level
*b
= current_binding_level
;
9181 current_binding_level
= b
->level_chain
;
9182 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9183 decl_context
= PARM
;
9184 current_binding_level
= b
;
9188 name
= decl_context
== PARM
? "parameter" : "type name";
9190 /* Look through the decl specs and record which ones appear.
9191 Some typespecs are defined as built-in typenames.
9192 Others, the ones that are modifiers of other types,
9193 are represented by bits in SPECBITS: set the bits for
9194 the modifiers that appear. Storage class keywords are also in SPECBITS.
9196 If there is a typedef name or a type, store the type in TYPE.
9197 This includes builtin typedefs such as `int'.
9199 Set EXPLICIT_INT if the type is `int' or `char' and did not
9200 come from a user typedef.
9202 Set LONGLONG if `long' is mentioned twice.
9204 For C++, constructors and destructors have their own fast treatment. */
9206 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9211 /* Certain parse errors slip through. For example,
9212 `int class;' is not caught by the parser. Try
9213 weakly to recover here. */
9214 if (TREE_CODE (spec
) != TREE_LIST
)
9217 id
= TREE_VALUE (spec
);
9219 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9221 if (id
== ridpointers
[(int) RID_INT
]
9222 || id
== ridpointers
[(int) RID_CHAR
]
9223 || id
== ridpointers
[(int) RID_BOOL
]
9224 || id
== ridpointers
[(int) RID_WCHAR
])
9228 if (id
== ridpointers
[(int) RID_BOOL
])
9229 error ("`bool' is now a keyword");
9231 cp_error ("extraneous `%T' ignored", id
);
9235 if (id
== ridpointers
[(int) RID_INT
])
9237 else if (id
== ridpointers
[(int) RID_CHAR
])
9239 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9243 /* C++ aggregate types. */
9244 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9247 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9249 type
= IDENTIFIER_TYPE_VALUE (id
);
9253 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9255 if (ridpointers
[i
] == id
)
9257 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9259 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9260 pedwarn ("ANSI C++ does not support `long long'");
9262 error ("`long long long' is too long for GCC");
9266 else if (RIDBIT_SETP (i
, specbits
))
9267 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9268 RIDBIT_SET (i
, specbits
);
9273 /* C++ aggregate types. */
9274 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9277 cp_error ("multiple declarations `%T' and `%T'", type
,
9281 type
= TREE_TYPE (id
);
9282 TREE_VALUE (spec
) = type
;
9287 error ("two or more data types in declaration of `%s'", name
);
9288 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9290 register tree t
= lookup_name (id
, 1);
9291 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9292 error ("`%s' fails to be a typedef or built in type",
9293 IDENTIFIER_POINTER (id
));
9296 type
= TREE_TYPE (t
);
9298 /* See the code below that used this. */
9299 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9304 else if (id
!= error_mark_node
)
9305 /* Can't change CLASS nodes into RECORD nodes here! */
9311 typedef_type
= type
;
9313 /* No type at all: default to `int', and set DEFAULTED_INT
9314 because it was not a user-defined typedef. */
9316 if (type
== NULL_TREE
9317 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9318 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9319 || RIDBIT_SETP (RID_LONG
, specbits
)
9320 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9322 /* These imply 'int'. */
9323 type
= integer_type_node
;
9327 if (type
== NULL_TREE
)
9330 if (return_type
== return_dtor
)
9331 type
= void_type_node
;
9332 else if (return_type
== return_ctor
)
9333 type
= build_pointer_type (ctor_return_type
);
9334 else if (return_type
== return_conversion
)
9335 type
= ctor_return_type
;
9338 /* We handle `main' specially here, because 'main () { }' is so
9339 common. With no options, it is allowed. With -Wreturn-type,
9340 it is a warning. It is only an error with -pedantic-errors. */
9341 int is_main
= (funcdef_flag
9342 && MAIN_NAME_P (dname
)
9343 && ctype
== NULL_TREE
9344 && in_namespace
== NULL_TREE
9345 && current_namespace
== global_namespace
);
9347 if (in_system_header
|| flag_ms_extensions
)
9348 /* Allow it, sigh. */;
9349 else if (pedantic
|| ! is_main
)
9350 cp_pedwarn ("ANSI C++ forbids declaration of `%s' with no type",
9352 else if (warn_return_type
)
9353 cp_warning ("ANSI C++ forbids declaration of `%s' with no type",
9356 type
= integer_type_node
;
9359 else if (return_type
== return_dtor
)
9361 error ("return type specification for destructor invalid");
9362 type
= void_type_node
;
9364 else if (return_type
== return_ctor
)
9366 error ("return type specification for constructor invalid");
9367 type
= build_pointer_type (ctor_return_type
);
9369 else if (return_type
== return_conversion
)
9371 if (!same_type_p (type
, ctor_return_type
))
9372 cp_error ("operator `%T' declared to return `%T'",
9373 ctor_return_type
, type
);
9375 cp_pedwarn ("return type specified for `operator %T'",
9378 type
= ctor_return_type
;
9383 /* Now process the modifiers that were specified
9384 and check for invalid combinations. */
9386 /* Long double is a special combination. */
9388 if (RIDBIT_SETP (RID_LONG
, specbits
)
9389 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9391 RIDBIT_RESET (RID_LONG
, specbits
);
9392 type
= build_qualified_type (long_double_type_node
,
9393 CP_TYPE_QUALS (type
));
9396 /* Check all other uses of type modifiers. */
9398 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9399 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9400 || RIDBIT_SETP (RID_LONG
, specbits
)
9401 || RIDBIT_SETP (RID_SHORT
, specbits
))
9405 if (TREE_CODE (type
) == REAL_TYPE
)
9406 error ("short, signed or unsigned invalid for `%s'", name
);
9407 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9408 error ("long, short, signed or unsigned invalid for `%s'", name
);
9409 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9410 && RIDBIT_SETP (RID_SHORT
, specbits
))
9411 error ("long and short specified together for `%s'", name
);
9412 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9413 || RIDBIT_SETP (RID_SHORT
, specbits
))
9415 error ("long or short specified with char for `%s'", name
);
9416 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9417 || RIDBIT_SETP (RID_SHORT
, specbits
))
9418 && TREE_CODE (type
) == REAL_TYPE
)
9419 error ("long or short specified with floating type for `%s'", name
);
9420 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9421 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9422 error ("signed and unsigned given together for `%s'", name
);
9426 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9428 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9430 if (flag_pedantic_errors
)
9435 /* Discard the type modifiers if they are invalid. */
9438 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9439 RIDBIT_RESET (RID_SIGNED
, specbits
);
9440 RIDBIT_RESET (RID_LONG
, specbits
);
9441 RIDBIT_RESET (RID_SHORT
, specbits
);
9446 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9447 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9449 error ("complex invalid for `%s'", name
);
9450 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9453 /* Decide whether an integer type is signed or not.
9454 Optionally treat bitfields as signed by default. */
9455 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9458 It is implementation-defined whether a plain (neither
9459 explicitly signed or unsigned) char, short, int, or long
9460 bit-field is signed or unsigned.
9462 Naturally, we extend this to long long as well. Note that
9463 this does not include wchar_t. */
9464 || (bitfield
&& !flag_signed_bitfields
9465 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9466 /* A typedef for plain `int' without `signed' can be
9467 controlled just like plain `int', but a typedef for
9468 `signed int' cannot be so controlled. */
9470 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9471 && (TREE_CODE (type
) == INTEGER_TYPE
9472 || TREE_CODE (type
) == CHAR_TYPE
)
9473 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9476 type
= long_long_unsigned_type_node
;
9477 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9478 type
= long_unsigned_type_node
;
9479 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9480 type
= short_unsigned_type_node
;
9481 else if (type
== char_type_node
)
9482 type
= unsigned_char_type_node
;
9483 else if (typedef_decl
)
9484 type
= unsigned_type (type
);
9486 type
= unsigned_type_node
;
9488 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9489 && type
== char_type_node
)
9490 type
= signed_char_type_node
;
9492 type
= long_long_integer_type_node
;
9493 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9494 type
= long_integer_type_node
;
9495 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9496 type
= short_integer_type_node
;
9498 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9500 /* If we just have "complex", it is equivalent to
9501 "complex double", but if any modifiers at all are specified it is
9502 the complex form of TYPE. E.g, "complex short" is
9503 "complex short int". */
9505 if (defaulted_int
&& ! longlong
9506 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9507 || RIDBIT_SETP (RID_SHORT
, specbits
)
9508 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9509 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9510 type
= complex_double_type_node
;
9511 else if (type
== integer_type_node
)
9512 type
= complex_integer_type_node
;
9513 else if (type
== float_type_node
)
9514 type
= complex_float_type_node
;
9515 else if (type
== double_type_node
)
9516 type
= complex_double_type_node
;
9517 else if (type
== long_double_type_node
)
9518 type
= complex_long_double_type_node
;
9520 type
= build_complex_type (type
);
9523 if (return_type
== return_conversion
9524 && (RIDBIT_SETP (RID_CONST
, specbits
)
9525 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9526 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9527 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9530 /* Set CONSTP if this declaration is `const', whether by
9531 explicit specification or via a typedef.
9532 Likewise for VOLATILEP. */
9534 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9536 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9538 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9539 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9540 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9541 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9542 type
= cp_build_qualified_type (type
, type_quals
);
9544 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9545 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9546 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9547 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9548 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9550 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9551 staticp
= 1 + (decl_context
== FIELD
);
9553 if (virtualp
&& staticp
== 2)
9555 cp_error ("member `%D' cannot be declared both virtual and static",
9559 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9560 RIDBIT_RESET (RID_FRIEND
, 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");
9588 /* Static anonymous unions are dealt with here. */
9589 if (staticp
&& decl_context
== TYPENAME
9590 && TREE_CODE (declspecs
) == TREE_LIST
9591 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9592 decl_context
= FIELD
;
9594 /* Warn about storage classes that are invalid for certain
9595 kinds of declarations (parameters, typenames, etc.). */
9598 error ("multiple storage classes in declaration of `%s'", name
);
9599 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9601 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9602 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9603 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9605 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9607 else if (decl_context
== FIELD
9608 /* C++ allows static class elements */
9609 && RIDBIT_SETP (RID_STATIC
, specbits
))
9610 /* C++ also allows inlines and signed and unsigned elements,
9611 but in those cases we don't come in here. */
9615 if (decl_context
== FIELD
)
9617 tree tmp
= NULL_TREE
;
9618 register int op
= 0;
9622 /* Avoid trying to get an operand off an identifier node. */
9623 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9626 tmp
= TREE_OPERAND (declarator
, 0);
9627 op
= IDENTIFIER_OPNAME_P (tmp
);
9629 error ("storage class specified for %s `%s'",
9630 op
? "member operator" : "field",
9631 op
? operator_name_string (tmp
) : name
);
9634 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9635 ? "storage class specified for parameter `%s'"
9636 : "storage class specified for typename"), name
);
9637 RIDBIT_RESET (RID_REGISTER
, specbits
);
9638 RIDBIT_RESET (RID_AUTO
, specbits
);
9639 RIDBIT_RESET (RID_EXTERN
, specbits
);
9642 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9644 if (toplevel_bindings_p ())
9646 /* It's common practice (and completely valid) to have a const
9647 be initialized and declared extern. */
9648 if (!(type_quals
& TYPE_QUAL_CONST
))
9649 warning ("`%s' initialized and declared `extern'", name
);
9652 error ("`%s' has both `extern' and initializer", name
);
9654 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9655 && ! toplevel_bindings_p ())
9656 error ("nested function `%s' declared `extern'", name
);
9657 else if (toplevel_bindings_p ())
9659 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9660 error ("top-level declaration of `%s' specifies `auto'", name
);
9663 if (nclasses
> 0 && friendp
)
9664 error ("storage class specifiers invalid in friend function declarations");
9666 /* Now figure out the structure of the declarator proper.
9667 Descend through it, creating more complex types, until we reach
9668 the declared identifier (or NULL_TREE, in an absolute declarator). */
9670 inner_attrs
= NULL_TREE
;
9673 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9674 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9676 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9677 an INDIRECT_REF (for *...),
9678 a CALL_EXPR (for ...(...)),
9679 an identifier (for the name being declared)
9680 or a null pointer (for the place in an absolute declarator
9681 where the name was omitted).
9682 For the last two cases, we have just exited the loop.
9684 For C++ it could also be
9685 a SCOPE_REF (for class :: ...). In this case, we have converted
9686 sensible names to types, and those are the values we use to
9687 qualify the member name.
9688 an ADDR_EXPR (for &...),
9689 a BIT_NOT_EXPR (for destructors)
9691 At this point, TYPE is the type of elements of an array,
9692 or for a function to return, or for a pointer to point to.
9693 After this sequence of ifs, TYPE is the type of the
9694 array or function or pointer, and DECLARATOR has had its
9695 outermost layer removed. */
9697 if (type
== error_mark_node
)
9699 if (TREE_CODE (declarator
) == SCOPE_REF
)
9700 declarator
= TREE_OPERAND (declarator
, 1);
9702 declarator
= TREE_OPERAND (declarator
, 0);
9705 if (quals
!= NULL_TREE
9706 && (declarator
== NULL_TREE
9707 || TREE_CODE (declarator
) != SCOPE_REF
))
9709 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9710 ctype
= TYPE_METHOD_BASETYPE (type
);
9711 if (ctype
!= NULL_TREE
)
9713 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9714 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9715 type
= TREE_TYPE (dummy
);
9720 /* See the comment for the TREE_LIST case, below. */
9723 else if (inner_attrs
)
9725 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9726 inner_attrs
= NULL_TREE
;
9729 switch (TREE_CODE (declarator
))
9733 /* We encode a declarator with embedded attributes using
9734 a TREE_LIST. The attributes apply to the declarator
9735 directly inside them, so we have to skip an iteration
9736 before applying them to the type. If the declarator just
9737 inside is the declarator-id, we apply the attrs to the
9739 inner_attrs
= TREE_PURPOSE (declarator
);
9741 declarator
= TREE_VALUE (declarator
);
9747 register tree itype
= NULL_TREE
;
9748 register tree size
= TREE_OPERAND (declarator
, 1);
9749 /* The index is a signed object `sizetype' bits wide. */
9750 tree index_type
= signed_type (sizetype
);
9752 declarator
= TREE_OPERAND (declarator
, 0);
9754 /* Check for some types that there cannot be arrays of. */
9756 if (TREE_CODE (type
) == VOID_TYPE
)
9758 cp_error ("declaration of `%D' as array of voids", dname
);
9759 type
= error_mark_node
;
9762 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9764 cp_error ("declaration of `%D' as array of functions", dname
);
9765 type
= error_mark_node
;
9768 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9769 you can't have arrays of references. If we allowed them,
9770 then we'd be saying x[i] is valid for an array x, but
9771 then you'd have to ask: what does `*(x + i)' mean? */
9772 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9774 if (decl_context
== TYPENAME
)
9775 cp_error ("cannot make arrays of references");
9777 cp_error ("declaration of `%D' as array of references",
9779 type
= error_mark_node
;
9782 if (TREE_CODE (type
) == OFFSET_TYPE
)
9784 cp_error ("declaration of `%D' as array of data members",
9786 type
= error_mark_node
;
9789 if (TREE_CODE (type
) == METHOD_TYPE
)
9791 cp_error ("declaration of `%D' as array of function members",
9793 type
= error_mark_node
;
9796 if (size
== error_mark_node
)
9797 type
= error_mark_node
;
9798 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9802 the constant expressions that specify the bounds of
9803 the arrays can be omitted only for the first member
9805 cp_error ("declaration of `%D' as multidimensional array",
9807 cp_error ("must have bounds for all dimensions except the first");
9808 type
= error_mark_node
;
9811 if (type
== error_mark_node
)
9814 /* VC++ spells a zero-sized array with []. */
9815 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9816 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9817 size
= integer_zero_node
;
9821 /* Must suspend_momentary here because the index
9822 type may need to live until the end of the function.
9823 For example, it is used in the declaration of a
9824 variable which requires destructing at the end of
9825 the function; then build_vec_delete will need this
9827 int yes
= suspend_momentary ();
9828 /* Might be a cast. */
9829 if (TREE_CODE (size
) == NOP_EXPR
9830 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9831 size
= TREE_OPERAND (size
, 0);
9832 if (TREE_READONLY_DECL_P (size
))
9833 size
= decl_constant_value (size
);
9835 /* If this involves a template parameter, it will be a
9836 constant at instantiation time, but we don't know
9837 what the value is yet. Even if no template
9838 parameters are involved, we may an expression that
9839 is not a constant; we don't even simplify `1 + 2'
9840 when processing a template. */
9841 if (processing_template_decl
)
9843 /* Resolve a qualified reference to an enumerator or
9844 static const data member of ours. */
9845 if (TREE_CODE (size
) == SCOPE_REF
9846 && TREE_OPERAND (size
, 0) == current_class_type
)
9848 tree t
= lookup_field (current_class_type
,
9849 TREE_OPERAND (size
, 1), 0, 0);
9854 itype
= build_index_type (build_min
9855 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
9856 goto dont_grok_size
;
9859 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9860 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9861 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9863 cp_error ("size of array `%D' has non-integer type",
9865 size
= integer_one_node
;
9867 if (pedantic
&& integer_zerop (size
))
9868 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9869 if (TREE_CONSTANT (size
))
9871 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9872 int old_pedantic
= pedantic
;
9873 pedantic
= flag_pedantic_errors
= 1;
9874 /* Always give overflow errors on array subscripts. */
9875 constant_expression_warning (size
);
9876 pedantic
= old_pedantic
;
9877 flag_pedantic_errors
= old_flag_pedantic_errors
;
9878 if (INT_CST_LT (size
, integer_zero_node
))
9880 cp_error ("size of array `%D' is negative", dname
);
9881 size
= integer_one_node
;
9889 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9892 cp_pedwarn ("ANSI C++ forbids variable-size array");
9897 = fold (build_binary_op (MINUS_EXPR
,
9898 cp_convert (index_type
, size
),
9899 cp_convert (index_type
,
9900 integer_one_node
)));
9901 if (! TREE_CONSTANT (itype
))
9902 itype
= variable_size (itype
);
9903 else if (TREE_OVERFLOW (itype
))
9905 error ("overflow in array dimension");
9906 TREE_OVERFLOW (itype
) = 0;
9909 itype
= build_index_type (itype
);
9912 resume_momentary (yes
);
9915 type
= build_cplus_array_type (type
, itype
);
9924 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9925 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9927 /* Declaring a function type.
9928 Make sure we have a valid type for the function to return. */
9930 /* We now know that the TYPE_QUALS don't apply to the
9931 decl, but to its return type. */
9932 type_quals
= TYPE_UNQUALIFIED
;
9934 /* Warn about some types functions can't return. */
9936 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9938 error ("`%s' declared as function returning a function", name
);
9939 type
= integer_type_node
;
9941 if (TREE_CODE (type
) == ARRAY_TYPE
)
9943 error ("`%s' declared as function returning an array", name
);
9944 type
= integer_type_node
;
9947 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9948 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9950 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9953 /* Pick up type qualifiers which should be applied to `this'. */
9954 quals
= CALL_DECLARATOR_QUALS (declarator
);
9956 /* Pick up the exception specifications. */
9957 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
9959 /* Say it's a definition only for the CALL_EXPR
9960 closest to the identifier. */
9963 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9964 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9965 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9967 if (ctype
== NULL_TREE
9968 && decl_context
== FIELD
9970 && (friendp
== 0 || dname
== current_class_name
))
9971 ctype
= current_class_type
;
9973 if (ctype
&& return_type
== return_conversion
)
9974 TYPE_HAS_CONVERSION (ctype
) = 1;
9975 if (ctype
&& constructor_name (ctype
) == dname
)
9977 /* We are within a class's scope. If our declarator name
9978 is the same as the class name, and we are defining
9979 a function, then it is a constructor/destructor, and
9980 therefore returns a void type. */
9982 if (flags
== DTOR_FLAG
)
9984 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9985 not be declared const or volatile. A destructor
9986 may not be static. */
9988 error ("destructor cannot be static member function");
9991 cp_error ("destructors may not be `%s'",
9992 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9995 if (decl_context
== FIELD
)
9997 if (! member_function_or_else (ctype
, current_class_type
,
9998 "destructor for alien class `%s' cannot be a member"))
9999 return void_type_node
;
10002 else /* It's a constructor. */
10004 if (explicitp
== 1)
10006 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10007 not be declared const or volatile. A constructor may
10008 not be virtual. A constructor may not be static. */
10010 error ("constructor cannot be static member function");
10013 pedwarn ("constructors cannot be declared virtual");
10018 cp_error ("constructors may not be `%s'",
10019 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10023 RID_BIT_TYPE tmp_bits
;
10024 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10025 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10026 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10027 if (RIDBIT_ANY_SET (tmp_bits
))
10028 error ("return value type specifier for constructor ignored");
10030 type
= build_pointer_type (ctype
);
10031 if (decl_context
== FIELD
)
10033 if (! member_function_or_else (ctype
, current_class_type
,
10034 "constructor for alien class `%s' cannot be member"))
10035 return void_type_node
;
10036 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10037 if (return_type
!= return_ctor
)
10041 if (decl_context
== FIELD
)
10047 error ("can't initialize friend function `%s'", name
);
10050 /* Cannot be both friend and virtual. */
10051 error ("virtual functions cannot be friends");
10052 RIDBIT_RESET (RID_FRIEND
, specbits
);
10055 if (decl_context
== NORMAL
)
10056 error ("friend declaration not in class definition");
10057 if (current_function_decl
&& funcdef_flag
)
10058 cp_error ("can't define friend function `%s' in a local class definition",
10062 /* Construct the function type and go to the next
10063 inner layer of declarator. */
10065 declarator
= TREE_OPERAND (declarator
, 0);
10067 /* FIXME: This is where default args should be fully
10070 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10072 if (declarator
&& flags
== DTOR_FLAG
)
10074 /* A destructor declared in the body of a class will
10075 be represented as a BIT_NOT_EXPR. But, we just
10076 want the underlying IDENTIFIER. */
10077 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10078 declarator
= TREE_OPERAND (declarator
, 0);
10080 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10081 arg_types
= void_list_node
;
10082 else if (arg_types
== NULL_TREE
10083 || arg_types
!= void_list_node
)
10085 cp_error ("destructors may not have parameters");
10086 arg_types
= void_list_node
;
10087 last_function_parms
= NULL_TREE
;
10091 /* ANSI says that `const int foo ();'
10092 does not make the function foo const. */
10093 type
= build_function_type (type
, arg_types
);
10097 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10098 if (TREE_PURPOSE (t
)
10099 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10101 add_defarg_fn (type
);
10110 /* Filter out pointers-to-references and references-to-references.
10111 We can get these if a TYPE_DECL is used. */
10113 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10115 error ("cannot declare %s to references",
10116 TREE_CODE (declarator
) == ADDR_EXPR
10117 ? "references" : "pointers");
10118 declarator
= TREE_OPERAND (declarator
, 0);
10122 if (TREE_CODE (type
) == OFFSET_TYPE
10123 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10124 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10126 cp_error ("cannot declare pointer to `%#T' member",
10128 type
= TREE_TYPE (type
);
10131 /* Merge any constancy or volatility into the target type
10132 for the pointer. */
10134 /* We now know that the TYPE_QUALS don't apply to the decl,
10135 but to the target of the pointer. */
10136 type_quals
= TYPE_UNQUALIFIED
;
10138 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10140 if (TREE_CODE (type
) == VOID_TYPE
)
10141 error ("invalid type: `void &'");
10143 type
= build_reference_type (type
);
10145 else if (TREE_CODE (type
) == METHOD_TYPE
)
10146 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10148 type
= build_pointer_type (type
);
10150 /* Process a list of type modifier keywords (such as
10151 const or volatile) that were given inside the `*' or `&'. */
10153 if (TREE_TYPE (declarator
))
10155 register tree typemodlist
;
10161 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10162 typemodlist
= TREE_CHAIN (typemodlist
))
10164 tree qualifier
= TREE_VALUE (typemodlist
);
10166 if (qualifier
== ridpointers
[(int) RID_CONST
])
10168 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10170 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10175 error ("invalid type modifier within pointer declarator");
10179 pedwarn ("duplicate `const'");
10181 pedwarn ("duplicate `volatile'");
10183 pedwarn ("duplicate `restrict'");
10185 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10186 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10187 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10188 if (TREE_CODE (declarator
) == ADDR_EXPR
10189 && (constp
|| volatilep
))
10192 pedwarn ("discarding `const' applied to a reference");
10194 pedwarn ("discarding `volatile' applied to a reference");
10195 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10197 type
= cp_build_qualified_type (type
, type_quals
);
10199 declarator
= TREE_OPERAND (declarator
, 0);
10205 /* We have converted type names to NULL_TREE if the
10206 name was bogus, or to a _TYPE node, if not.
10208 The variable CTYPE holds the type we will ultimately
10209 resolve to. The code here just needs to build
10210 up appropriate member types. */
10211 tree sname
= TREE_OPERAND (declarator
, 1);
10214 /* Destructors can have their visibilities changed as well. */
10215 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10216 sname
= TREE_OPERAND (sname
, 0);
10218 if (TREE_COMPLEXITY (declarator
) == 0)
10219 /* This needs to be here, in case we are called
10220 multiple times. */ ;
10221 else if (TREE_COMPLEXITY (declarator
) == -1)
10222 /* Namespace member. */
10223 pop_decl_namespace ();
10224 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10225 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10226 else if (! IS_AGGR_TYPE_CODE
10227 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10229 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10231 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10232 that refer to ctype. They couldn't be resolved earlier
10233 because we hadn't pushed into the class yet.
10234 Example: resolve 'B<T>::type' in
10235 'B<typename B<T>::type> B<T>::f () { }'. */
10236 if (current_template_parms
10237 && uses_template_parms (type
)
10238 && uses_template_parms (current_class_type
))
10240 tree args
= current_template_args ();
10241 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10244 /* This pop_nested_class corresponds to the
10245 push_nested_class used to push into class scope for
10246 parsing the argument list of a function decl, in
10248 pop_nested_class ();
10249 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10252 my_friendly_abort (16);
10254 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10256 /* We had a reference to a global decl, or
10257 perhaps we were given a non-aggregate typedef,
10258 in which case we cleared this out, and should just
10259 keep going as though it wasn't there. */
10260 declarator
= sname
;
10263 ctype
= TREE_OPERAND (declarator
, 0);
10266 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10268 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10269 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10270 template_count
+= 1;
10271 t
= TYPE_MAIN_DECL (t
);
10272 if (DECL_LANG_SPECIFIC (t
))
10273 t
= DECL_CLASS_CONTEXT (t
);
10278 if (sname
== NULL_TREE
)
10281 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10283 /* This is the `standard' use of the scoping operator:
10284 basetype :: member . */
10286 if (ctype
== current_class_type
)
10292 Is this ill-formed? */
10295 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10298 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10300 if (current_class_type
== NULL_TREE
10302 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10303 TYPE_ARG_TYPES (type
));
10306 cp_error ("cannot declare member function `%T::%s' within `%T'",
10307 ctype
, name
, current_class_type
);
10308 return void_type_node
;
10311 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10312 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10314 /* Have to move this code elsewhere in this function.
10315 this code is used for i.e., typedef int A::M; M *pm;
10317 It is? How? jason 10/2/94 */
10319 if (current_class_type
)
10321 cp_error ("cannot declare member `%T::%s' within `%T'",
10322 ctype
, name
, current_class_type
);
10323 return void_type_node
;
10325 type
= build_offset_type (ctype
, type
);
10327 else if (uses_template_parms (ctype
))
10329 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10331 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10332 TYPE_ARG_TYPES (type
));
10336 cp_error ("structure `%T' not yet defined", ctype
);
10337 return error_mark_node
;
10340 declarator
= sname
;
10342 else if (TREE_CODE (sname
) == SCOPE_REF
)
10343 my_friendly_abort (17);
10347 declarator
= TREE_OPERAND (declarator
, 1);
10348 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10349 /* In this case, we will deal with it later. */
10353 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10354 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10355 TYPE_ARG_TYPES (type
));
10357 type
= build_offset_type (ctype
, type
);
10364 declarator
= TREE_OPERAND (declarator
, 0);
10369 case ENUMERAL_TYPE
:
10370 declarator
= NULL_TREE
;
10374 declarator
= NULL_TREE
;
10378 my_friendly_abort (158);
10382 /* See the comment for the TREE_LIST case, above. */
10385 if (! ignore_attrs
)
10386 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10388 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10390 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10393 /* Now TYPE has the actual type. */
10395 if (explicitp
== 1 || (explicitp
&& friendp
))
10397 /* [dcl.fct.spec] The explicit specifier shall only be used in
10398 declarations of constructors within a class definition. */
10399 error ("only declarations of constructors can be `explicit'");
10403 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10405 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10407 error ("non-member `%s' cannot be declared `mutable'", name
);
10408 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10410 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10412 error ("non-object member `%s' cannot be declared `mutable'", name
);
10413 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10415 else if (TREE_CODE (type
) == FUNCTION_TYPE
10416 || TREE_CODE (type
) == METHOD_TYPE
)
10418 error ("function `%s' cannot be declared `mutable'", name
);
10419 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10423 error ("static `%s' cannot be declared `mutable'", name
);
10424 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10426 else if (type_quals
& TYPE_QUAL_CONST
)
10428 error ("const `%s' cannot be declared `mutable'", name
);
10429 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10433 if (declarator
== NULL_TREE
10434 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10435 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10436 && (TREE_CODE (type
) == FUNCTION_TYPE
10437 || TREE_CODE (type
) == METHOD_TYPE
)))
10439 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10441 cp_error ("template-id `%D' used as a declarator", declarator
);
10442 declarator
= dname
;
10445 /* Unexpected declarator format. */
10446 my_friendly_abort (990210);
10448 /* If this is declaring a typedef name, return a TYPE_DECL. */
10450 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10454 /* Note that the grammar rejects storage classes
10455 in typenames, fields or parameters. */
10456 if (current_lang_name
== lang_name_java
)
10457 TYPE_FOR_JAVA (type
) = 1;
10459 if (decl_context
== FIELD
)
10461 if (declarator
== constructor_name (current_class_type
))
10462 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10464 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10468 /* Make sure this typedef lives as long as its type,
10469 since it might be used as a template parameter. */
10470 if (type
!= error_mark_node
)
10471 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10472 if (processing_template_decl
)
10473 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10475 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10476 if (type
!= error_mark_node
)
10480 /* If the user declares "typedef struct {...} foo" then the
10481 struct will have an anonymous name. Fill that name in now.
10482 Nothing can refer to it, so nothing needs know about the name
10484 if (type
!= error_mark_node
10485 && TYPE_NAME (type
)
10486 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10487 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10488 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10490 tree oldname
= TYPE_NAME (type
);
10493 /* Replace the anonymous name with the real name everywhere. */
10494 lookup_tag_reverse (type
, declarator
);
10495 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10496 if (TYPE_NAME (t
) == oldname
)
10497 TYPE_NAME (t
) = decl
;
10499 if (TYPE_LANG_SPECIFIC (type
))
10500 TYPE_WAS_ANONYMOUS (type
) = 1;
10502 /* If this is a typedef within a template class, the nested
10503 type is a (non-primary) template. The name for the
10504 template needs updating as well. */
10505 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10506 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10507 = TYPE_IDENTIFIER (type
);
10509 /* XXX Temporarily set the scope.
10510 When returning, start_decl expects it as NULL_TREE,
10511 and will then then set it using pushdecl. */
10512 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10513 if (current_class_type
)
10514 DECL_CONTEXT (decl
) = current_class_type
;
10516 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10518 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10519 DECL_ASSEMBLER_NAME (decl
)
10520 = get_identifier (build_overload_name (type
, 1, 1));
10521 DECL_CONTEXT (decl
) = NULL_TREE
;
10523 /* FIXME remangle member functions; member functions of a
10524 type with external linkage have external linkage. */
10527 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10529 cp_error_at ("typedef name may not be class-qualified", decl
);
10534 if (ctype
== NULL_TREE
)
10536 if (TREE_CODE (type
) != METHOD_TYPE
)
10537 cp_error_at ("invalid type qualifier for non-method type", decl
);
10539 ctype
= TYPE_METHOD_BASETYPE (type
);
10541 if (ctype
!= NULL_TREE
)
10542 grok_method_quals (ctype
, decl
, quals
);
10545 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10546 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10547 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10549 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10550 inlinep
, friendp
, raises
!= NULL_TREE
);
10553 error ("typedef declaration includes an initializer");
10558 /* Detect the case of an array type of unspecified size
10559 which came, as such, direct from a typedef name.
10560 We must copy the type, so that each identifier gets
10561 a distinct type, so that each identifier's size can be
10562 controlled separately by its own initializer. */
10564 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10565 && TYPE_DOMAIN (type
) == NULL_TREE
)
10567 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10570 /* If this is a type name (such as, in a cast or sizeof),
10571 compute the type and return it now. */
10573 if (decl_context
== TYPENAME
)
10575 /* Note that the grammar rejects storage classes
10576 in typenames, fields or parameters. */
10577 if (type_quals
!= TYPE_UNQUALIFIED
)
10578 type_quals
= TYPE_UNQUALIFIED
;
10580 /* Special case: "friend class foo" looks like a TYPENAME context. */
10583 if (type_quals
!= TYPE_UNQUALIFIED
)
10585 cp_error ("type qualifiers specified for friend class declaration");
10586 type_quals
= TYPE_UNQUALIFIED
;
10590 cp_error ("`inline' specified for friend class declaration");
10594 /* Only try to do this stuff if we didn't already give up. */
10595 if (type
!= integer_type_node
)
10597 /* A friendly class? */
10598 if (current_class_type
)
10599 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10601 error ("trying to make class `%s' a friend of global scope",
10602 TYPE_NAME_STRING (type
));
10603 type
= void_type_node
;
10608 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10609 if (ctype
== NULL_TREE
)
10611 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10612 ctype
= TYPE_METHOD_BASETYPE (type
);
10614 grok_method_quals (ctype
, dummy
, quals
);
10615 type
= TREE_TYPE (dummy
);
10620 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10621 && decl_context
!= CATCHPARM
10622 && TREE_CODE (type
) != UNION_TYPE
10625 cp_error ("abstract declarator `%T' used as declaration", type
);
10626 declarator
= make_anon_name ();
10629 /* `void' at top level (not within pointer)
10630 is allowed only in typedefs or type names.
10631 We don't complain about parms either, but that is because
10632 a better error message can be made later. */
10634 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10637 error ("unnamed variable or field declared void");
10638 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10640 if (IDENTIFIER_OPNAME_P (declarator
))
10641 my_friendly_abort (356);
10643 error ("variable or field `%s' declared void", name
);
10646 error ("variable or field declared void");
10647 type
= integer_type_node
;
10650 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10651 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10653 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10655 if (ctype
|| in_namespace
)
10656 error ("cannot use `::' in parameter declaration");
10658 /* A parameter declared as an array of T is really a pointer to T.
10659 One declared as a function is really a pointer to a function.
10660 One declared as a member is really a pointer to member. */
10662 if (TREE_CODE (type
) == ARRAY_TYPE
)
10664 /* Transfer const-ness of array into that of type pointed to. */
10665 type
= build_pointer_type (TREE_TYPE (type
));
10666 type_quals
= TYPE_UNQUALIFIED
;
10668 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10669 type
= build_pointer_type (type
);
10670 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10671 type
= build_pointer_type (type
);
10672 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10674 error ("declaration of `%s' as void", name
);
10680 register tree decl
;
10682 if (decl_context
== PARM
)
10684 decl
= build_decl (PARM_DECL
, declarator
, type
);
10686 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10687 inlinep
, friendp
, raises
!= NULL_TREE
);
10689 /* Compute the type actually passed in the parmlist,
10690 for the case where there is no prototype.
10691 (For example, shorts and chars are passed as ints.)
10692 When there is a prototype, this is overridden later. */
10694 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10696 else if (decl_context
== FIELD
)
10698 if (type
== error_mark_node
)
10700 /* Happens when declaring arrays of sizes which
10701 are error_mark_node, for example. */
10704 else if (in_namespace
&& !friendp
)
10706 /* Something like struct S { int N::j; }; */
10707 cp_error ("invalid use of `::'");
10710 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10713 tree function_context
;
10715 /* We catch the others as conflicts with the builtin
10717 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10719 cp_error ("function `%D' cannot be declared friend",
10726 if (ctype
== NULL_TREE
)
10727 ctype
= current_class_type
;
10729 if (ctype
== NULL_TREE
)
10731 cp_error ("can't make `%D' into a method -- not in a class",
10733 return void_type_node
;
10736 /* ``A union may [ ... ] not [ have ] virtual functions.''
10738 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10740 cp_error ("function `%D' declared virtual inside a union",
10742 return void_type_node
;
10745 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10746 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10747 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10748 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10752 cp_error ("`%D' cannot be declared virtual, since it is always static",
10757 else if (staticp
< 2)
10758 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10759 TYPE_ARG_TYPES (type
));
10762 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10763 function_context
= (ctype
!= NULL_TREE
) ?
10764 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10765 publicp
= (! friendp
|| ! staticp
)
10766 && function_context
== NULL_TREE
;
10767 decl
= grokfndecl (ctype
, type
,
10768 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10769 ? declarator
: dname
,
10771 virtualp
, flags
, quals
, raises
,
10772 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10773 funcdef_flag
, template_count
, in_namespace
);
10774 if (decl
== NULL_TREE
)
10777 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10778 /* The decl and setting of decl_machine_attr is also turned off. */
10779 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10782 /* [class.conv.ctor]
10784 A constructor declared without the function-specifier
10785 explicit that can be called with a single parameter
10786 specifies a conversion from the type of its first
10787 parameter to the type of its class. Such a constructor
10788 is called a converting constructor. */
10789 if (explicitp
== 2)
10790 DECL_NONCONVERTING_P (decl
) = 1;
10791 else if (DECL_CONSTRUCTOR_P (decl
))
10793 /* The constructor can be called with exactly one
10794 parameter if there is at least one parameter, and
10795 any subsequent parameters have default arguments.
10796 We don't look at the first parameter, which is
10797 really just the `this' parameter for the new
10800 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10802 /* Skip the `in_chrg' argument too, if present. */
10803 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10804 arg_types
= TREE_CHAIN (arg_types
);
10806 if (arg_types
== void_list_node
10808 && TREE_CHAIN (arg_types
)
10809 && TREE_CHAIN (arg_types
) != void_list_node
10810 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10811 DECL_NONCONVERTING_P (decl
) = 1;
10814 else if (TREE_CODE (type
) == METHOD_TYPE
)
10816 /* We only get here for friend declarations of
10817 members of other classes. */
10818 /* All method decls are public, so tell grokfndecl to set
10819 TREE_PUBLIC, also. */
10820 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10821 virtualp
, flags
, quals
, raises
,
10822 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10823 template_count
, in_namespace
);
10824 if (decl
== NULL_TREE
)
10827 else if (!staticp
&& ! processing_template_decl
10828 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10829 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10832 cp_error ("field `%D' has incomplete type", declarator
);
10834 cp_error ("name `%T' has incomplete type", type
);
10836 /* If we're instantiating a template, tell them which
10837 instantiation made the field's type be incomplete. */
10838 if (current_class_type
10839 && TYPE_NAME (current_class_type
)
10840 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10841 && declspecs
&& TREE_VALUE (declspecs
)
10842 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10843 cp_error (" in instantiation of template `%T'",
10844 current_class_type
);
10846 type
= error_mark_node
;
10853 error ("`%s' is neither function nor method; cannot be declared friend",
10854 IDENTIFIER_POINTER (declarator
));
10862 /* Friends are treated specially. */
10863 if (ctype
== current_class_type
)
10864 warning ("member functions are implicitly friends of their class");
10867 tree t
= NULL_TREE
;
10868 if (decl
&& DECL_NAME (decl
))
10870 if (template_class_depth (current_class_type
) == 0)
10873 = check_explicit_specialization
10875 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10876 if (decl
== error_mark_node
)
10877 return error_mark_node
;
10880 t
= do_friend (ctype
, declarator
, decl
,
10881 last_function_parms
, attrlist
, flags
, quals
,
10884 if (t
&& funcdef_flag
)
10887 return void_type_node
;
10891 /* Structure field. It may not be a function, except for C++ */
10893 if (decl
== NULL_TREE
)
10899 /* An attempt is being made to initialize a non-static
10900 member. But, from [class.mem]:
10902 4 A member-declarator can contain a
10903 constant-initializer only if it declares a static
10904 member (_class.static_) of integral or enumeration
10905 type, see _class.static.data_.
10907 This used to be relatively common practice, but
10908 the rest of the compiler does not correctly
10909 handle the initialization unless the member is
10910 static so we make it static below. */
10911 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10913 cp_pedwarn ("making `%D' static", declarator
);
10917 if (uses_template_parms (type
))
10918 /* We'll check at instantiation time. */
10920 else if (check_static_variable_definition (declarator
,
10922 /* If we just return the declaration, crashes
10923 will sometimes occur. We therefore return
10924 void_type_node, as if this was a friend
10925 declaration, to cause callers to completely
10926 ignore this declaration. */
10927 return void_type_node
;
10930 /* 9.2p13 [class.mem] */
10931 if (declarator
== constructor_name (current_class_type
)
10932 /* Divergence from the standard: In extern "C", we
10933 allow non-static data members here, because C does
10934 and /usr/include/netinet/in.h uses that. */
10935 && (staticp
|| ! in_system_header
))
10936 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10941 /* C++ allows static class members. All other work
10942 for this is done by grokfield. */
10943 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10944 TREE_STATIC (decl
) = 1;
10945 /* In class context, 'static' means public access. */
10946 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10950 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10951 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10953 DECL_MUTABLE_P (decl
) = 1;
10954 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10958 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10959 inlinep
, friendp
, raises
!= NULL_TREE
);
10962 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10964 tree original_name
;
10970 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10971 original_name
= dname
;
10973 original_name
= declarator
;
10975 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10976 error ("storage class `auto' invalid for function `%s'", name
);
10977 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10978 error ("storage class `register' invalid for function `%s'", name
);
10980 /* Function declaration not at top level.
10981 Storage classes other than `extern' are not allowed
10982 and `extern' makes no difference. */
10983 if (! toplevel_bindings_p ()
10984 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10985 || RIDBIT_SETP (RID_INLINE
, specbits
))
10988 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10989 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
10991 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
10994 if (ctype
== NULL_TREE
)
10998 error ("virtual non-class function `%s'", name
);
11002 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11003 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11004 TYPE_ARG_TYPES (type
));
11006 /* Record presence of `static'. */
11007 publicp
= (ctype
!= NULL_TREE
11008 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11009 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11011 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11012 virtualp
, flags
, quals
, raises
,
11014 publicp
, inlinep
, funcdef_flag
,
11015 template_count
, in_namespace
);
11016 if (decl
== NULL_TREE
)
11021 int illegal_static
= 0;
11023 /* Don't allow a static member function in a class, and forbid
11024 declaring main to be static. */
11025 if (TREE_CODE (type
) == METHOD_TYPE
)
11027 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11028 illegal_static
= 1;
11030 else if (current_function_decl
)
11032 /* FIXME need arm citation */
11033 error ("cannot declare static function inside another function");
11034 illegal_static
= 1;
11037 if (illegal_static
)
11040 RIDBIT_RESET (RID_STATIC
, specbits
);
11046 /* It's a variable. */
11048 /* An uninitialized decl with `extern' is a reference. */
11049 decl
= grokvardecl (type
, declarator
, &specbits
,
11051 (type_quals
& TYPE_QUAL_CONST
) != 0,
11053 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11054 inlinep
, friendp
, raises
!= NULL_TREE
);
11058 DECL_CONTEXT (decl
) = ctype
;
11061 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11063 RIDBIT_RESET (RID_STATIC
, specbits
);
11065 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11067 cp_error ("static member `%D' declared `register'", decl
);
11068 RIDBIT_RESET (RID_REGISTER
, specbits
);
11070 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11072 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11074 RIDBIT_RESET (RID_EXTERN
, specbits
);
11079 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11081 /* Record `register' declaration for warnings on &
11082 and in case doing stupid register allocation. */
11084 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11085 DECL_REGISTER (decl
) = 1;
11087 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11088 DECL_THIS_EXTERN (decl
) = 1;
11090 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11091 DECL_THIS_STATIC (decl
) = 1;
11093 /* Record constancy and volatility. There's no need to do this
11094 when processing a template; we'll do this for the instantiated
11095 declaration based on the type of DECL. */
11096 if (!processing_template_decl
)
11097 c_apply_type_quals_to_decl (type_quals
, decl
);
11103 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11104 An empty exprlist is a parmlist. An exprlist which
11105 contains only identifiers at the global level
11106 is a parmlist. Otherwise, it is an exprlist. */
11109 parmlist_is_exprlist (exprs
)
11112 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11115 if (toplevel_bindings_p ())
11117 /* At the global level, if these are all identifiers,
11118 then it is a parmlist. */
11121 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11123 exprs
= TREE_CHAIN (exprs
);
11130 /* Subroutine of start_function. Ensure that each of the parameter
11131 types (as listed in PARMS) is complete, as is required for a
11132 function definition. */
11135 require_complete_types_for_parms (parms
)
11140 tree type
= TREE_TYPE (parms
);
11141 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11143 if (DECL_NAME (parms
))
11144 error ("parameter `%s' has incomplete type",
11145 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11147 error ("parameter has incomplete type");
11148 TREE_TYPE (parms
) = error_mark_node
;
11151 layout_decl (parms
, 0);
11153 parms
= TREE_CHAIN (parms
);
11157 /* Returns *TP if *TP is a local variable (or parameter). Returns
11158 NULL_TREE otherwise. */
11161 local_variable_p (tp
)
11166 if ((TREE_CODE (t
) == VAR_DECL
11167 /* A VAR_DECL with a context that is a _TYPE is a static data
11169 && !TYPE_P (CP_DECL_CONTEXT (t
))
11170 /* Any other non-local variable must be at namespace scope. */
11171 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11172 || (TREE_CODE (t
) == PARM_DECL
))
11178 /* Check that ARG, which is a default-argument expression for a
11179 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11180 something goes wrong. DECL may also be a _TYPE node, rather than a
11181 DECL, if there is no DECL available. */
11184 check_default_argument (decl
, arg
)
11191 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11192 /* We get a DEFAULT_ARG when looking at an in-class declaration
11193 with a default argument. Ignore the argument for now; we'll
11194 deal with it after the class is complete. */
11197 if (processing_template_decl
|| uses_template_parms (arg
))
11198 /* We don't do anything checking until instantiation-time. Note
11199 that there may be uninstantiated arguments even for an
11200 instantiated function, since default arguments are not
11201 instantiated until they are needed. */
11210 decl_type
= TREE_TYPE (decl
);
11212 if (arg
== error_mark_node
11213 || decl
== error_mark_node
11214 || TREE_TYPE (arg
) == error_mark_node
11215 || decl_type
== error_mark_node
)
11216 /* Something already went wrong. There's no need to check
11218 return error_mark_node
;
11220 /* [dcl.fct.default]
11222 A default argument expression is implicitly converted to the
11224 if (!TREE_TYPE (arg
)
11225 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11228 cp_error ("default argument for `%#D' has type `%T'",
11229 decl
, TREE_TYPE (arg
));
11231 cp_error ("default argument for parameter of type `%T' has type `%T'",
11232 decl_type
, TREE_TYPE (arg
));
11234 return error_mark_node
;
11237 /* [dcl.fct.default]
11239 Local variables shall not be used in default argument
11242 The keyword `this' shall not be used in a default argument of a
11243 member function. */
11244 var
= search_tree (&arg
, local_variable_p
);
11247 cp_error ("default argument `%E' uses local variable `%D'",
11249 return error_mark_node
;
11256 /* Decode the list of parameter types for a function type.
11257 Given the list of things declared inside the parens,
11258 return a list of types.
11260 The list we receive can have three kinds of elements:
11261 an IDENTIFIER_NODE for names given without types,
11262 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11263 or void_type_node, to mark the end of an argument list
11264 when additional arguments are not permitted (... was not used).
11266 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11267 a mere declaration. A nonempty identifier-list gets an error message
11268 when FUNCDEF_FLAG is zero.
11269 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11270 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11272 If all elements of the input list contain types,
11273 we return a list of the types.
11274 If all elements contain no type (except perhaps a void_type_node
11275 at the end), we return a null list.
11276 If some have types and some do not, it is an error, and we
11277 return a null list.
11279 Also set last_function_parms to either
11280 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11281 A list of names is converted to a chain of PARM_DECLs
11282 by store_parm_decls so that ultimately it is always a chain of decls.
11284 Note that in C++, parameters can take default values. These default
11285 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11286 an error to specify default values which are followed by parameters
11287 that have no default values, or an ELLIPSES. For simplicities sake,
11288 only parameters which are specified with their types can take on
11292 grokparms (first_parm
, funcdef_flag
)
11296 tree result
= NULL_TREE
;
11297 tree decls
= NULL_TREE
;
11299 if (first_parm
!= NULL_TREE
11300 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11302 if (! funcdef_flag
)
11303 pedwarn ("parameter names (without types) in function declaration");
11304 last_function_parms
= first_parm
;
11307 else if (first_parm
!= NULL_TREE
11308 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11309 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11310 my_friendly_abort (145);
11313 /* Types were specified. This is a list of declarators
11314 each represented as a TREE_LIST node. */
11315 register tree parm
, chain
;
11316 int any_init
= 0, any_error
= 0;
11318 if (first_parm
!= NULL_TREE
)
11320 tree last_result
= NULL_TREE
;
11321 tree last_decl
= NULL_TREE
;
11323 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11325 tree type
= NULL_TREE
, list_node
= parm
;
11326 register tree decl
= TREE_VALUE (parm
);
11327 tree init
= TREE_PURPOSE (parm
);
11329 chain
= TREE_CHAIN (parm
);
11330 /* @@ weak defense against parse errors. */
11331 if (TREE_CODE (decl
) != VOID_TYPE
11332 && TREE_CODE (decl
) != TREE_LIST
)
11334 /* Give various messages as the need arises. */
11335 if (TREE_CODE (decl
) == STRING_CST
)
11336 cp_error ("invalid string constant `%E'", decl
);
11337 else if (TREE_CODE (decl
) == INTEGER_CST
)
11338 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11342 if (TREE_CODE (decl
) != VOID_TYPE
)
11344 decl
= grokdeclarator (TREE_VALUE (decl
),
11345 TREE_PURPOSE (decl
),
11346 PARM
, init
!= NULL_TREE
,
11348 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11351 /* Top-level qualifiers on the parameters are
11352 ignored for function types. */
11353 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11355 if (TREE_CODE (type
) == VOID_TYPE
)
11356 decl
= void_type_node
;
11357 else if (TREE_CODE (type
) == METHOD_TYPE
)
11359 if (DECL_NAME (decl
))
11360 /* Cannot use the decl here because
11361 we don't have DECL_CONTEXT set up yet. */
11362 cp_error ("parameter `%D' invalidly declared method type",
11365 error ("parameter invalidly declared method type");
11366 type
= build_pointer_type (type
);
11367 TREE_TYPE (decl
) = type
;
11369 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11371 if (DECL_NAME (decl
))
11372 cp_error ("parameter `%D' invalidly declared offset type",
11375 error ("parameter invalidly declared offset type");
11376 type
= build_pointer_type (type
);
11377 TREE_TYPE (decl
) = type
;
11379 else if (abstract_virtuals_error (decl
, type
))
11380 any_error
= 1; /* Seems like a good idea. */
11381 else if (POINTER_TYPE_P (type
))
11384 while (POINTER_TYPE_P (t
)
11385 || (TREE_CODE (t
) == ARRAY_TYPE
11386 && TYPE_DOMAIN (t
) != NULL_TREE
))
11388 if (TREE_CODE (t
) == ARRAY_TYPE
)
11389 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11391 TYPE_PTR_P (type
) ? "pointer" : "reference");
11395 if (TREE_CODE (decl
) == VOID_TYPE
)
11397 if (result
== NULL_TREE
)
11399 result
= void_list_node
;
11400 last_result
= result
;
11404 TREE_CHAIN (last_result
) = void_list_node
;
11405 last_result
= void_list_node
;
11408 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11409 error ("`void' in parameter list must be entire list");
11413 /* Since there is a prototype, args are passed in their own types. */
11414 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11415 if (PROMOTE_PROTOTYPES
11416 && (TREE_CODE (type
) == INTEGER_TYPE
11417 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11418 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11419 DECL_ARG_TYPE (decl
) = integer_type_node
;
11420 if (!any_error
&& init
)
11423 init
= check_default_argument (decl
, init
);
11428 if (decls
== NULL_TREE
)
11435 TREE_CHAIN (last_decl
) = decl
;
11438 list_node
= tree_cons (init
, type
, NULL_TREE
);
11439 if (result
== NULL_TREE
)
11441 result
= list_node
;
11442 last_result
= result
;
11446 TREE_CHAIN (last_result
) = list_node
;
11447 last_result
= list_node
;
11451 TREE_CHAIN (last_result
) = NULL_TREE
;
11452 /* If there are no parameters, and the function does not end
11453 with `...', then last_decl will be NULL_TREE. */
11454 if (last_decl
!= NULL_TREE
)
11455 TREE_CHAIN (last_decl
) = NULL_TREE
;
11459 last_function_parms
= decls
;
11464 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11465 FUNCTION_TYPE with the newly parsed version of its default argument, which
11466 was previously digested as text. See snarf_defarg et al in lex.c. */
11469 replace_defarg (arg
, init
)
11472 if (! processing_template_decl
11473 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11474 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11475 TREE_TYPE (init
), TREE_VALUE (arg
));
11476 TREE_PURPOSE (arg
) = init
;
11483 tree t
= FUNCTION_ARG_CHAIN (d
);
11484 if (DECL_CONSTRUCTOR_P (d
)
11485 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11486 t
= TREE_CHAIN (t
);
11487 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11488 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11489 == DECL_CLASS_CONTEXT (d
))
11490 && (TREE_CHAIN (t
) == NULL_TREE
11491 || TREE_CHAIN (t
) == void_list_node
11492 || TREE_PURPOSE (TREE_CHAIN (t
))))
11497 /* These memoizing functions keep track of special properties which
11498 a class may have. `grok_ctor_properties' notices whether a class
11499 has a constructor of the form X(X&), and also complains
11500 if the class has a constructor of the form X(X).
11501 `grok_op_properties' takes notice of the various forms of
11502 operator= which are defined, as well as what sorts of type conversion
11503 may apply. Both functions take a FUNCTION_DECL as an argument. */
11506 grok_ctor_properties (ctype
, decl
)
11509 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11510 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11512 /* When a type has virtual baseclasses, a magical first int argument is
11513 added to any ctor so we can tell if the class has been initialized
11514 yet. This could screw things up in this function, so we deliberately
11515 ignore the leading int if we're in that situation. */
11516 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11518 my_friendly_assert (parmtypes
11519 && TREE_VALUE (parmtypes
) == integer_type_node
,
11521 parmtypes
= TREE_CHAIN (parmtypes
);
11522 parmtype
= TREE_VALUE (parmtypes
);
11527 A non-template constructor for class X is a copy constructor if
11528 its first parameter is of type X&, const X&, volatile X& or const
11529 volatile X&, and either there are no other parameters or else all
11530 other parameters have default arguments. */
11531 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11532 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11533 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11534 || TREE_CHAIN (parmtypes
) == void_list_node
11535 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11536 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11537 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11539 TYPE_HAS_INIT_REF (ctype
) = 1;
11540 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11541 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11545 A declaration of a constructor for a class X is ill-formed if its
11546 first parameter is of type (optionally cv-qualified) X and either
11547 there are no other parameters or else all other parameters have
11550 We *don't* complain about member template instantiations that
11551 have this form, though; they can occur as we try to decide what
11552 constructor to use during overload resolution. Since overload
11553 resolution will never prefer such a constructor to the
11554 non-template copy constructor (which is either explicitly or
11555 implicitly defined), there's no need to worry about their
11556 existence. Theoretically, they should never even be
11557 instantiated, but that's hard to forestall. */
11558 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11559 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11560 || TREE_CHAIN (parmtypes
) == void_list_node
11561 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11562 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11563 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11565 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11567 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11570 else if (TREE_CODE (parmtype
) == VOID_TYPE
11571 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11572 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11577 /* An operator with this name can be either unary or binary. */
11583 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11584 || name
== ansi_opname
[(int) ADDR_EXPR
]
11585 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11586 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11587 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11588 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11591 /* An operator with this name can only be unary. */
11597 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11598 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11599 || name
== ansi_opname
[(int) COMPONENT_REF
]
11600 || IDENTIFIER_TYPENAME_P (name
));
11603 /* Do a little sanity-checking on how they declared their operator. */
11606 grok_op_properties (decl
, virtualp
, friendp
)
11608 int virtualp
, friendp
;
11610 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11611 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11612 tree name
= DECL_NAME (decl
);
11614 if (current_class_type
== NULL_TREE
)
11621 A user-declared copy assignment operator X::operator= is a
11622 non-static non-template member function of class X with
11623 exactly one parameter of type X, X&, const X&, volatile X& or
11624 const volatile X&. */
11625 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11626 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11627 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11629 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11630 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11631 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11632 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11633 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11634 || name
== ansi_opname
[(int) MEMBER_REF
])
11635 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11636 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11637 TYPE_GETS_NEW (current_class_type
) |= 1;
11638 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11639 TYPE_GETS_DELETE (current_class_type
) |= 1;
11640 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11641 TYPE_GETS_NEW (current_class_type
) |= 2;
11642 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11643 TYPE_GETS_DELETE (current_class_type
) |= 2;
11646 if (name
== ansi_opname
[(int) NEW_EXPR
]
11647 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11649 /* When the compiler encounters the definition of A::operator new, it
11650 doesn't look at the class declaration to find out if it's static. */
11652 revert_static_member_fn (&decl
, NULL
, NULL
);
11654 /* Take care of function decl if we had syntax errors. */
11655 if (argtypes
== NULL_TREE
)
11657 = build_function_type (ptr_type_node
,
11658 hash_tree_chain (integer_type_node
,
11661 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11663 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11664 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11667 revert_static_member_fn (&decl
, NULL
, NULL
);
11669 if (argtypes
== NULL_TREE
)
11671 = build_function_type (void_type_node
,
11672 hash_tree_chain (ptr_type_node
,
11676 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11678 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11679 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11680 != void_list_node
))
11681 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11686 /* An operator function must either be a non-static member function
11687 or have at least one parameter of a class, a reference to a class,
11688 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11689 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11691 if (IDENTIFIER_TYPENAME_P (name
)
11692 || name
== ansi_opname
[(int) CALL_EXPR
]
11693 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11694 || name
== ansi_opname
[(int) COMPONENT_REF
]
11695 || name
== ansi_opname
[(int) ARRAY_REF
])
11696 cp_error ("`%D' must be a nonstatic member function", decl
);
11701 if (DECL_STATIC_FUNCTION_P (decl
))
11702 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11705 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11707 tree arg
= TREE_VALUE (p
);
11708 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11709 arg
= TREE_TYPE (arg
);
11711 /* This lets bad template code slip through. */
11712 if (IS_AGGR_TYPE (arg
)
11713 || TREE_CODE (arg
) == ENUMERAL_TYPE
11714 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11715 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11719 ("`%D' must have an argument of class or enumerated type",
11726 if (name
== ansi_opname
[(int) CALL_EXPR
])
11727 return; /* No restrictions on args. */
11729 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11731 tree t
= TREE_TYPE (name
);
11732 if (TREE_CODE (t
) == VOID_TYPE
)
11733 pedwarn ("void is not a valid type conversion operator");
11734 else if (! friendp
)
11736 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11737 const char *what
= 0;
11739 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11741 if (t
== current_class_type
)
11742 what
= "the same type";
11743 /* Don't force t to be complete here. */
11744 else if (IS_AGGR_TYPE (t
)
11746 && DERIVED_FROM_P (t
, current_class_type
))
11747 what
= "a base class";
11750 warning ("conversion to %s%s will never use a type conversion operator",
11751 ref
? "a reference to " : "", what
);
11755 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11759 if (list_length (argtypes
) != 3 && methodp
)
11761 cp_error ("`%D' must take exactly one argument", decl
);
11764 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11766 if (copy_assignment_arg_p (parmtype
, virtualp
)
11769 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11770 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11771 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11772 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11775 else if (name
== ansi_opname
[(int) COND_EXPR
])
11778 cp_error ("ANSI C++ prohibits overloading operator ?:");
11780 else if (ambi_op_p (name
))
11782 if (list_length (argtypes
) == 2)
11784 else if (list_length (argtypes
) == 3)
11786 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11787 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11788 && ! processing_template_decl
11789 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11792 cp_error ("postfix `%D' must take `int' as its argument",
11796 ("postfix `%D' must take `int' as its second argument",
11803 cp_error ("`%D' must take either zero or one argument", decl
);
11805 cp_error ("`%D' must take either one or two arguments", decl
);
11808 /* More Effective C++ rule 6. */
11810 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11811 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11813 tree arg
= TREE_VALUE (argtypes
);
11814 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11815 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11816 arg
= TREE_TYPE (arg
);
11817 arg
= TYPE_MAIN_VARIANT (arg
);
11818 if (list_length (argtypes
) == 2)
11820 if (TREE_CODE (ret
) != REFERENCE_TYPE
11821 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11823 cp_warning ("prefix `%D' should return `%T'", decl
,
11824 build_reference_type (arg
));
11828 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11829 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11833 else if (unary_op_p (name
))
11835 if (list_length (argtypes
) != 2)
11838 cp_error ("`%D' must take `void'", decl
);
11840 cp_error ("`%D' must take exactly one argument", decl
);
11843 else /* if (binary_op_p (name)) */
11845 if (list_length (argtypes
) != 3)
11848 cp_error ("`%D' must take exactly one argument", decl
);
11850 cp_error ("`%D' must take exactly two arguments", decl
);
11853 /* More Effective C++ rule 7. */
11855 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11856 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11857 || name
== ansi_opname
[COMPOUND_EXPR
]))
11858 cp_warning ("user-defined `%D' always evaluates both arguments",
11862 /* Effective C++ rule 23. */
11864 && list_length (argtypes
) == 3
11865 && (name
== ansi_opname
[PLUS_EXPR
]
11866 || name
== ansi_opname
[MINUS_EXPR
]
11867 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11868 || name
== ansi_opname
[MULT_EXPR
])
11869 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11870 cp_warning ("`%D' should return by value", decl
);
11874 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11875 if (TREE_PURPOSE (argtypes
))
11877 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11878 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11879 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11882 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11885 cp_error ("`%D' cannot have default arguments", decl
);
11890 static const char *
11892 enum tag_types code
;
11905 my_friendly_abort (981122);
11909 /* Get the struct, enum or union (CODE says which) with tag NAME.
11910 Define the tag as a forward-reference if it is not defined.
11912 C++: If a class derivation is given, process it here, and report
11913 an error if multiple derivation declarations are not identical.
11915 If this is a definition, come in through xref_tag and only look in
11916 the current frame for the name (since C++ allows new names in any
11920 xref_tag (code_type_node
, name
, globalize
)
11921 tree code_type_node
;
11925 enum tag_types tag_code
;
11926 enum tree_code code
;
11928 register tree ref
, t
;
11929 struct binding_level
*b
= current_binding_level
;
11931 tree attributes
= NULL_TREE
;
11932 tree context
= NULL_TREE
;
11934 /* If we are called from the parser, code_type_node will sometimes be a
11935 TREE_LIST. This indicates that the user wrote
11936 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11938 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11940 attributes
= TREE_PURPOSE (code_type_node
);
11941 code_type_node
= TREE_VALUE (code_type_node
);
11944 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11949 code
= RECORD_TYPE
;
11955 code
= ENUMERAL_TYPE
;
11958 my_friendly_abort (18);
11961 /* If a cross reference is requested, look up the type
11962 already defined for this tag and return it. */
11963 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11966 name
= TYPE_IDENTIFIER (t
);
11970 t
= IDENTIFIER_TYPE_VALUE (name
);
11972 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11973 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11978 /* If we know we are defining this tag, only look it up in
11979 this scope and don't try to find it as a type. */
11980 ref
= lookup_tag (code
, name
, b
, 1);
11986 /* [dcl.type.elab] If the identifier resolves to a
11987 typedef-name or a template type-parameter, the
11988 elaborated-type-specifier is ill-formed. */
11989 if (t
!= TYPE_MAIN_VARIANT (t
)
11990 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
11991 cp_pedwarn ("using typedef-name `%D' after `%s'",
11992 TYPE_NAME (t
), tag_name (tag_code
));
11993 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
11994 cp_error ("using template type parameter `%T' after `%s'",
11995 t
, tag_name (tag_code
));
12000 ref
= lookup_tag (code
, name
, b
, 0);
12004 /* Try finding it as a type declaration. If that wins,
12006 ref
= lookup_name (name
, 1);
12008 if (ref
!= NULL_TREE
12009 && processing_template_decl
12010 && DECL_CLASS_TEMPLATE_P (ref
)
12011 && template_class_depth (current_class_type
) == 0)
12012 /* Since GLOBALIZE is true, we're declaring a global
12013 template, so we want this type. */
12014 ref
= DECL_RESULT (ref
);
12016 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12017 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12018 ref
= TREE_TYPE (ref
);
12023 if (ref
&& current_class_type
12024 && template_class_depth (current_class_type
)
12025 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12027 /* Since GLOBALIZE is non-zero, we are not looking at a
12028 definition of this tag. Since, in addition, we are currently
12029 processing a (member) template declaration of a template
12030 class, we must be very careful; consider:
12037 { template <class V>
12038 friend struct S1; };
12040 Here, the S2::S1 declaration should not be confused with the
12041 outer declaration. In particular, the inner version should
12042 have a template parameter of level 2, not level 1. This
12043 would be particularly important if the member declaration
12046 template <class V = U> friend struct S1;
12048 say, when we should tsubst into `U' when instantiating
12049 S2. On the other hand, when presented with:
12059 we must find the inner binding eventually. We
12060 accomplish this by making sure that the new type we
12061 create to represent this declaration has the right
12063 context
= TYPE_CONTEXT (ref
);
12068 push_obstacks_nochange ();
12072 /* If no such tag is yet defined, create a forward-reference node
12073 and record it as the "definition".
12074 When a real declaration of this type is found,
12075 the forward-reference will be altered into a real type. */
12077 /* In C++, since these migrate into the global scope, we must
12078 build them on the permanent obstack. */
12080 temp
= allocation_temporary_p ();
12082 end_temporary_allocation ();
12084 if (code
== ENUMERAL_TYPE
)
12086 cp_error ("use of enum `%#D' without previous declaration", name
);
12088 ref
= make_node (ENUMERAL_TYPE
);
12090 /* Give the type a default layout like unsigned int
12091 to avoid crashing if it does not get defined. */
12092 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12093 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12094 TREE_UNSIGNED (ref
) = 1;
12095 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12096 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12097 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12099 /* Enable us to recognize when a type is created in class context.
12100 To do nested classes correctly, this should probably be cleared
12101 out when we leave this classes scope. Currently this in only
12102 done in `start_enum'. */
12104 pushtag (name
, ref
, globalize
);
12108 struct binding_level
*old_b
= class_binding_level
;
12110 ref
= make_lang_type (code
);
12111 TYPE_CONTEXT (ref
) = context
;
12113 #ifdef NONNESTED_CLASSES
12114 /* Class types don't nest the way enums do. */
12115 class_binding_level
= (struct binding_level
*)0;
12117 pushtag (name
, ref
, globalize
);
12118 class_binding_level
= old_b
;
12123 /* If it no longer looks like a nested type, make sure it's
12125 If it is not an IDENTIFIER, this is not a declaration */
12126 if (b
->namespace_p
&& !class_binding_level
12127 && TREE_CODE (name
) == IDENTIFIER_NODE
12128 && IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12129 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12131 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12132 redeclare_class_template (ref
, current_template_parms
);
12135 /* Until the type is defined, tentatively accept whatever
12136 structure tag the user hands us. */
12137 if (TYPE_SIZE (ref
) == NULL_TREE
12138 && ref
!= current_class_type
12139 /* Have to check this, in case we have contradictory tag info. */
12140 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12142 if (tag_code
== class_type
)
12143 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12144 else if (tag_code
== record_type
)
12145 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12150 TREE_TYPE (ref
) = attributes
;
12156 xref_tag_from_type (old
, id
, globalize
)
12160 tree code_type_node
;
12162 if (TREE_CODE (old
) == RECORD_TYPE
)
12163 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12164 ? class_type_node
: record_type_node
);
12166 code_type_node
= union_type_node
;
12168 if (id
== NULL_TREE
)
12169 id
= TYPE_IDENTIFIER (old
);
12171 return xref_tag (code_type_node
, id
, globalize
);
12174 /* REF is a type (named NAME), for which we have just seen some
12175 baseclasses. BINFO is a list of those baseclasses; the
12176 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12177 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12178 struct, or union. */
12181 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12182 tree code_type_node
;
12186 /* In the declaration `A : X, Y, ... Z' we mark all the types
12187 (A, X, Y, ..., Z) so we can check for duplicates. */
12192 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12194 if (tag_code
== union_type
)
12196 cp_error ("derived union `%T' invalid", ref
);
12200 len
= list_length (binfo
);
12201 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12203 /* First, make sure that any templates in base-classes are
12204 instantiated. This ensures that if we call ourselves recursively
12205 we do not get confused about which classes are marked and which
12207 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12208 complete_type (TREE_VALUE (base
));
12210 SET_CLASSTYPE_MARKED (ref
);
12211 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12213 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12215 /* The base of a derived struct is public by default. */
12217 = (TREE_PURPOSE (binfo
) == access_public_node
12218 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12219 || (tag_code
!= class_type
12220 && (TREE_PURPOSE (binfo
) == access_default_node
12221 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12223 = (TREE_PURPOSE (binfo
) == access_protected_node
12224 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12226 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12227 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12228 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12229 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12230 tree basetype
= TREE_VALUE (binfo
);
12233 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12234 basetype
= TREE_TYPE (basetype
);
12236 || (TREE_CODE (basetype
) != RECORD_TYPE
12237 && TREE_CODE (basetype
) != TYPENAME_TYPE
12238 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12239 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12241 cp_error ("base type `%T' fails to be a struct or class type",
12242 TREE_VALUE (binfo
));
12246 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12248 /* This code replaces similar code in layout_basetypes.
12249 We put the complete_type first for implicit `typename'. */
12250 if (TYPE_SIZE (basetype
) == NULL_TREE
12251 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12253 cp_error ("base class `%T' has incomplete type", basetype
);
12258 if (CLASSTYPE_MARKED (basetype
))
12260 if (basetype
== ref
)
12261 cp_error ("recursive type `%T' undefined", basetype
);
12263 cp_error ("duplicate base type `%T' invalid", basetype
);
12267 if (TYPE_FOR_JAVA (basetype
)
12268 && (current_lang_stack
12269 == &VARRAY_TREE (current_lang_base
, 0)))
12270 TYPE_FOR_JAVA (ref
) = 1;
12272 /* Note that the BINFO records which describe individual
12273 inheritances are *not* shared in the lattice! They
12274 cannot be shared because a given baseclass may be
12275 inherited with different `accessibility' by different
12276 derived classes. (Each BINFO record describing an
12277 individual inheritance contains flags which say what
12278 the `accessibility' of that particular inheritance is.) */
12281 = make_binfo (integer_zero_node
, basetype
,
12282 CLASS_TYPE_P (basetype
)
12283 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12284 CLASS_TYPE_P (basetype
)
12285 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12287 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12288 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12289 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12290 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12291 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12293 /* We need to unshare the binfos now so that lookups during class
12294 definition work. */
12295 unshare_base_binfos (base_binfo
);
12297 SET_CLASSTYPE_MARKED (basetype
);
12299 /* We are free to modify these bits because they are meaningless
12300 at top level, and BASETYPE is a top-level type. */
12301 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12303 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12304 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12307 if (CLASS_TYPE_P (basetype
))
12309 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12310 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12317 TREE_VEC_LENGTH (binfos
) = i
;
12319 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12322 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12325 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12327 if (CLASS_TYPE_P (basetype
))
12328 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12329 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12332 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12333 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12335 /* Unmark all the types. */
12337 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12338 CLEAR_CLASSTYPE_MARKED (ref
);
12340 /* Now that we know all the base-classes, set up the list of virtual
12342 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12348 /* Begin compiling the definition of an enumeration type.
12349 NAME is its name (or null if anonymous).
12350 Returns the type object, as yet incomplete.
12351 Also records info about it so that build_enumerator
12352 may be used to declare the individual values as they are read. */
12358 register tree enumtype
= NULL_TREE
;
12359 struct binding_level
*b
= current_binding_level
;
12361 /* We are wasting space here and putting these on the permanent_obstack so
12362 that typeid(local enum) will work correctly. */
12363 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12365 /* If this is the real definition for a previous forward reference,
12366 fill in the contents in the same object that used to be the
12367 forward reference. */
12369 if (name
!= NULL_TREE
)
12370 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12372 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12374 cp_error ("multiple definition of `%#T'", enumtype
);
12375 cp_error_at ("previous definition here", enumtype
);
12379 enumtype
= make_node (ENUMERAL_TYPE
);
12380 pushtag (name
, enumtype
, 0);
12383 if (current_class_type
)
12384 TREE_ADDRESSABLE (b
->tags
) = 1;
12386 /* We don't copy this value because build_enumerator needs to do it. */
12387 enum_next_value
= integer_zero_node
;
12390 GNU_xref_decl (current_function_decl
, enumtype
);
12394 /* After processing and defining all the values of an enumeration type,
12395 install their decls in the enumeration type and finish it off.
12396 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12397 Returns ENUMTYPE. */
12400 finish_enum (enumtype
)
12403 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12404 /* Calculate the maximum value of any enumerator in this type. */
12406 tree values
= TYPE_VALUES (enumtype
);
12411 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12416 /* The TREE_VALUE is a CONST_DECL for this enumeration
12418 decl
= TREE_VALUE (pair
);
12420 /* The DECL_INITIAL will be NULL if we are processing a
12421 template declaration and this enumeration constant had no
12422 explicit initializer. */
12423 value
= DECL_INITIAL (decl
);
12424 if (value
&& !processing_template_decl
)
12426 /* Set the TREE_TYPE for the VALUE as well. That's so
12427 that when we call decl_constant_value we get an
12428 entity of the right type (but with the constant
12429 value). Since we shouldn't ever call
12430 decl_constant_value on a template type, there's no
12431 reason to do that when processing_template_decl.
12432 And, if the expression is something like a
12433 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12434 wreak havoc on the intended type of the expression.
12436 Of course, there's also no point in trying to compute
12437 minimum or maximum values if we're in a template. */
12438 TREE_TYPE (value
) = enumtype
;
12441 minnode
= maxnode
= value
;
12442 else if (tree_int_cst_lt (maxnode
, value
))
12444 else if (tree_int_cst_lt (value
, minnode
))
12448 if (processing_template_decl
)
12449 /* If this is just a template, leave the CONST_DECL
12450 alone. That way tsubst_copy will find CONST_DECLs for
12451 CONST_DECLs, and not INTEGER_CSTs. */
12454 /* In the list we're building up, we want the enumeration
12455 values, not the CONST_DECLs. */
12456 TREE_VALUE (pair
) = value
;
12460 maxnode
= minnode
= integer_zero_node
;
12462 TYPE_VALUES (enumtype
) = nreverse (values
);
12464 if (processing_template_decl
)
12466 tree scope
= current_scope ();
12467 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12468 add_tree (build_min (TAG_DEFN
, enumtype
));
12472 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12473 int lowprec
= min_precision (minnode
, unsignedp
);
12474 int highprec
= min_precision (maxnode
, unsignedp
);
12475 int precision
= MAX (lowprec
, highprec
);
12478 TYPE_SIZE (enumtype
) = NULL_TREE
;
12480 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12482 TYPE_PRECISION (enumtype
) = precision
;
12484 fixup_unsigned_type (enumtype
);
12486 fixup_signed_type (enumtype
);
12488 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12489 /* Use the width of the narrowest normal C type which is wide
12491 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12494 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12496 TYPE_SIZE (enumtype
) = 0;
12497 layout_type (enumtype
);
12499 /* Fix up all variant types of this enum type. */
12500 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12501 tem
= TYPE_NEXT_VARIANT (tem
))
12503 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12504 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12505 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12506 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12507 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12508 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12509 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12510 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12511 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12514 /* Finish debugging output for this type. */
12515 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12518 /* In start_enum we pushed obstacks. Here, we must pop them. */
12524 /* Build and install a CONST_DECL for an enumeration constant of the
12525 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12526 Assignment of sequential values by default is handled here. */
12529 build_enumerator (name
, value
, type
)
12537 /* Remove no-op casts from the value. */
12539 STRIP_TYPE_NOPS (value
);
12541 if (! processing_template_decl
)
12543 /* Validate and default VALUE. */
12544 if (value
!= NULL_TREE
)
12546 if (TREE_READONLY_DECL_P (value
))
12547 value
= decl_constant_value (value
);
12549 if (TREE_CODE (value
) == INTEGER_CST
)
12551 value
= default_conversion (value
);
12552 constant_expression_warning (value
);
12556 cp_error ("enumerator value for `%D' not integer constant", name
);
12561 /* Default based on previous value. */
12562 if (value
== NULL_TREE
&& ! processing_template_decl
)
12564 value
= enum_next_value
;
12566 cp_error ("overflow in enumeration values at `%D'", name
);
12569 /* Remove no-op casts from the value. */
12571 STRIP_TYPE_NOPS (value
);
12573 /* To fix MAX_VAL enum consts. (bkoz) */
12574 TREE_TYPE (value
) = integer_type_node
;
12578 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12579 Even in other cases, we will later (in finish_enum) be setting the
12581 if (value
!= NULL_TREE
)
12582 value
= copy_node (value
);
12584 /* C++ associates enums with global, function, or class declarations. */
12586 context
= current_scope ();
12587 if (context
&& context
== current_class_type
)
12588 /* This enum declaration is local to the class. */
12589 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12591 /* It's a global enum, or it's local to a function. (Note local to
12592 a function could mean local to a class method. */
12593 decl
= build_decl (CONST_DECL
, name
, type
);
12595 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12596 DECL_INITIAL (decl
) = value
;
12597 TREE_READONLY (decl
) = 1;
12599 if (context
&& context
== current_class_type
)
12600 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12601 on the TYPE_FIELDS list for `S'. (That's so that you can say
12602 things like `S::i' later.) */
12603 finish_member_declaration (decl
);
12607 GNU_xref_decl (current_function_decl
, decl
);
12610 if (! processing_template_decl
)
12612 /* Set basis for default for next value. */
12613 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12614 integer_one_node
, PLUS_EXPR
);
12615 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12618 result
= tree_cons (name
, decl
, NULL_TREE
);
12623 static int function_depth
;
12625 /* We're defining DECL. Make sure that it's type is OK. */
12628 check_function_type (decl
)
12631 tree fntype
= TREE_TYPE (decl
);
12633 /* In a function definition, arg types must be complete. */
12634 require_complete_types_for_parms (current_function_parms
);
12636 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12638 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12640 /* Make it return void instead, but don't change the
12641 type of the DECL_RESULT, in case we have a named return value. */
12642 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12644 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12646 = build_cplus_method_type (ctype
,
12648 FUNCTION_ARG_CHAIN (decl
));
12652 = build_function_type (void_type_node
,
12653 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12655 = build_exception_variant (fntype
,
12656 TYPE_RAISES_EXCEPTIONS (fntype
));
12659 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12662 /* Create the FUNCTION_DECL for a function definition.
12663 DECLSPECS and DECLARATOR are the parts of the declaration;
12664 they describe the function's name and the type it returns,
12665 but twisted together in a fashion that parallels the syntax of C.
12667 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12668 DECLARATOR is really the DECL for the function we are about to
12669 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12670 indicating that the function is an inline defined in-class, and
12671 SF_EXPAND indicating that we should generate RTL for this
12674 This function creates a binding context for the function body
12675 as well as setting up the FUNCTION_DECL in current_function_decl.
12677 Returns 1 on success. If the DECLARATOR is not suitable for a function
12678 (it defines a datum instead), we return 0, which tells
12679 yyparse to report a parse error.
12681 For C++, we must first check whether that datum makes any sense.
12682 For example, "class A local_a(1,2);" means that variable local_a
12683 is an aggregate of type A, which should have a constructor
12684 applied to it with the argument list [1, 2]. */
12687 start_function (declspecs
, declarator
, attrs
, flags
)
12688 tree declspecs
, declarator
, attrs
;
12692 tree ctype
= NULL_TREE
;
12695 extern int have_extern_spec
;
12696 extern int used_extern_spec
;
12697 int doing_friend
= 0;
12698 struct binding_level
*bl
;
12700 /* Sanity check. */
12701 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12702 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12704 /* This should only be done once on the top most decl. */
12705 if (have_extern_spec
&& !used_extern_spec
)
12707 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12708 used_extern_spec
= 1;
12711 if (flags
& SF_PRE_PARSED
)
12713 decl1
= declarator
;
12715 fntype
= TREE_TYPE (decl1
);
12716 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12717 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12719 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12720 class is in the (lexical) scope of the class in which it is
12722 if (!ctype
&& DECL_FRIEND_P (decl1
))
12724 ctype
= DECL_CLASS_CONTEXT (decl1
);
12726 /* CTYPE could be null here if we're dealing with a template;
12727 for example, `inline friend float foo()' inside a template
12728 will have no CTYPE set. */
12729 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12735 last_function_parms
= DECL_ARGUMENTS (decl1
);
12736 last_function_parm_tags
= NULL_TREE
;
12740 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12741 /* If the declarator is not suitable for a function definition,
12742 cause a syntax error. */
12743 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12745 fntype
= TREE_TYPE (decl1
);
12747 restype
= TREE_TYPE (fntype
);
12748 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12750 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12751 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12752 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12753 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12754 fntype
= build_function_type (integer_type_node
,
12755 TYPE_ARG_TYPES (fntype
));
12757 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12759 TYPE_ARG_TYPES (fntype
));
12760 TREE_TYPE (decl1
) = fntype
;
12763 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12764 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12765 else if (DECL_MAIN_P (decl1
))
12767 /* If this doesn't return integer_type, complain. */
12768 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12770 if (pedantic
|| warn_return_type
)
12771 pedwarn ("return type for `main' changed to `int'");
12772 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12777 /* Sometimes we don't notice that a function is a static member, and
12778 build a METHOD_TYPE for it. Fix that up now. */
12779 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
12780 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
12782 revert_static_member_fn (&decl1
, NULL
, NULL
);
12783 last_function_parms
= TREE_CHAIN (last_function_parms
);
12787 /* Warn if function was previously implicitly declared
12788 (but not if we warned then). */
12789 if (! warn_implicit
12790 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12791 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12793 /* Set up current_class_type, and enter the scope of the class, if
12796 push_nested_class (ctype
, 1);
12797 else if (DECL_STATIC_FUNCTION_P (decl1
))
12798 push_nested_class (DECL_CONTEXT (decl1
), 2);
12800 /* Now that we have entered the scope of the class, we must restore
12801 the bindings for any template parameters surrounding DECL1, if it
12802 is an inline member template. (Order is important; consider the
12803 case where a template parameter has the same name as a field of
12804 the class.) It is not until after this point that
12805 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12806 if (flags
& SF_INCLASS_INLINE
)
12807 maybe_begin_member_template_processing (decl1
);
12809 /* Effective C++ rule 15. See also c_expand_return. */
12811 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12812 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12813 cp_warning ("`operator=' should return a reference to `*this'");
12815 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12816 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12817 if (!DECL_INITIAL (decl1
))
12818 DECL_INITIAL (decl1
) = error_mark_node
;
12820 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12821 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12824 /* This function exists in static storage.
12825 (This does not mean `static' in the C sense!) */
12826 TREE_STATIC (decl1
) = 1;
12828 /* We must call push_template_decl after current_class_type is set
12829 up. (If we are processing inline definitions after exiting a
12830 class scope, current_class_type will be NULL_TREE until set above
12831 by push_nested_class.) */
12832 if (processing_template_decl
)
12833 decl1
= push_template_decl (decl1
);
12835 /* We are now in the scope of the function being defined. */
12836 current_function_decl
= decl1
;
12838 /* Save the parm names or decls from this function's declarator
12839 where store_parm_decls will find them. */
12840 current_function_parms
= last_function_parms
;
12841 current_function_parm_tags
= last_function_parm_tags
;
12843 /* Make sure the parameter and return types are reasonable. When
12844 you declare a function, these types can be incomplete, but they
12845 must be complete when you define the function. */
12846 if (! processing_template_decl
)
12847 check_function_type (decl1
);
12849 /* Build the return declaration for the function. */
12850 restype
= TREE_TYPE (fntype
);
12851 if (!processing_template_decl
)
12853 if (!DECL_RESULT (decl1
))
12855 DECL_RESULT (decl1
)
12856 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12857 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12858 DECL_RESULT (decl1
));
12862 /* Just use `void'. Nobody will ever look at this anyhow. */
12863 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12865 /* Initialize RTL machinery. We cannot do this until
12866 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12867 even when processing a template; this is how we get
12868 CURRENT_FUNCTION set up, and our per-function variables
12870 bl
= current_binding_level
;
12871 init_function_start (decl1
, input_filename
, lineno
);
12872 current_binding_level
= bl
;
12873 expanding_p
= (flags
& SF_EXPAND
) != 0;
12875 /* Even though we're inside a function body, we still don't want to
12876 call expand_expr to calculate the size of a variable-sized array.
12877 We haven't necessarily assigned RTL to all variables yet, so it's
12878 not safe to try to expand expressions involving them. */
12879 immediate_size_expand
= 0;
12880 current_function
->x_dont_save_pending_sizes_p
= 1;
12882 /* Let the user know we're compiling this function. */
12883 if (processing_template_decl
|| !building_stmt_tree ())
12884 announce_function (decl1
);
12886 /* Record the decl so that the function name is defined.
12887 If we already have a decl for this name, and it is a FUNCTION_DECL,
12888 use the old decl. */
12889 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12891 /* A specialization is not used to guide overload resolution. */
12892 if ((flag_guiding_decls
12893 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12894 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12895 decl1
= pushdecl (decl1
);
12898 /* We need to set the DECL_CONTEXT. */
12899 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12900 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12901 /* And make sure we have enough default args. */
12902 check_default_args (decl1
);
12904 DECL_MAIN_VARIANT (decl1
) = decl1
;
12905 fntype
= TREE_TYPE (decl1
);
12908 /* Reset these in case the call to pushdecl changed them. */
12909 current_function_decl
= decl1
;
12910 current_function
->decl
= decl1
;
12912 /* Initialize the per-function data. */
12913 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
12915 /* If we already parsed this function, and we're just expanding it
12916 now, restore saved state. */
12917 struct binding_level
*bl
= current_binding_level
;
12918 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
12919 current_binding_level
= bl
;
12921 /* This function is being processed in whole-function mode; we
12922 already did semantic analysis. */
12923 current_function
->x_whole_function_mode_p
= 1;
12925 /* If we decided that we didn't want to inline this function,
12926 make sure the back-end knows that. */
12927 if (!current_function_cannot_inline
)
12928 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
12930 /* We don't need the saved data anymore. */
12931 free (DECL_SAVED_FUNCTION_DATA (decl1
));
12932 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
12934 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
12936 /* We know that this was set up by `grokclassfn'. We do not
12937 wait until `store_parm_decls', since evil parse errors may
12938 never get us to that point. Here we keep the consistency
12939 between `current_class_type' and `current_class_ptr'. */
12940 tree t
= DECL_ARGUMENTS (decl1
);
12942 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
12944 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
12947 cp_function_chain
->x_current_class_ref
12948 = build_indirect_ref (t
, NULL_PTR
);
12949 cp_function_chain
->x_current_class_ptr
= t
;
12951 if (DECL_DESTRUCTOR_P (decl1
))
12952 current_in_charge_parm
= TREE_CHAIN (t
);
12955 if (DECL_INTERFACE_KNOWN (decl1
))
12957 tree ctx
= hack_decl_function_context (decl1
);
12959 if (DECL_NOT_REALLY_EXTERN (decl1
))
12960 DECL_EXTERNAL (decl1
) = 0;
12962 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12963 && TREE_PUBLIC (ctx
))
12964 /* This is a function in a local class in an extern inline
12966 comdat_linkage (decl1
);
12968 /* If this function belongs to an interface, it is public.
12969 If it belongs to someone else's interface, it is also external.
12970 This only affects inlines and template instantiations. */
12971 else if (interface_unknown
== 0
12972 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12973 || flag_alt_external_templates
))
12975 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12976 || processing_template_decl
)
12978 DECL_EXTERNAL (decl1
)
12980 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
12981 && !DECL_VINDEX (decl1
)));
12983 /* For WIN32 we also want to put these in linkonce sections. */
12984 maybe_make_one_only (decl1
);
12987 DECL_EXTERNAL (decl1
) = 0;
12988 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
12989 DECL_INTERFACE_KNOWN (decl1
) = 1;
12991 else if (interface_unknown
&& interface_only
12992 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12993 || flag_alt_external_templates
))
12995 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
12996 interface, we will have interface_only set but not
12997 interface_known. In that case, we don't want to use the normal
12998 heuristics because someone will supply a #pragma implementation
12999 elsewhere, and deducing it here would produce a conflict. */
13000 comdat_linkage (decl1
);
13001 DECL_EXTERNAL (decl1
) = 0;
13002 DECL_INTERFACE_KNOWN (decl1
) = 1;
13003 DECL_DEFER_OUTPUT (decl1
) = 1;
13007 /* This is a definition, not a reference.
13008 So clear DECL_EXTERNAL. */
13009 DECL_EXTERNAL (decl1
) = 0;
13011 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13012 && ! DECL_INTERFACE_KNOWN (decl1
)
13013 /* Don't try to defer nested functions for now. */
13014 && ! hack_decl_function_context (decl1
))
13015 DECL_DEFER_OUTPUT (decl1
) = 1;
13017 DECL_INTERFACE_KNOWN (decl1
) = 1;
13020 if (doing_semantic_analysis_p ())
13023 current_binding_level
->parm_flag
= 1;
13027 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13029 if (!building_stmt_tree ())
13031 GNU_xref_function (decl1
, current_function_parms
);
13032 make_function_rtl (decl1
);
13035 /* Promote the value to int before returning it. */
13036 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13037 restype
= type_promotes_to (restype
);
13039 /* If this fcn was already referenced via a block-scope `extern' decl
13040 (or an implicit decl), propagate certain information about the usage. */
13041 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13042 TREE_ADDRESSABLE (decl1
) = 1;
13044 if (DECL_RESULT (decl1
) == NULL_TREE
)
13046 DECL_RESULT (decl1
)
13047 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13048 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13049 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13052 /* Allocate further tree nodes temporarily during compilation
13053 of this function only. Tiemann moved up here from bottom of fn. */
13054 /* If this is a nested function, then we must continue to allocate RTL
13055 on the permanent obstack in case we need to inline it later. */
13056 if (! hack_decl_function_context (decl1
))
13057 temporary_allocation ();
13059 /* Make sure that we always have a momntary obstack while we're in a
13063 if (building_stmt_tree ())
13064 begin_stmt_tree (decl1
);
13068 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13069 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13070 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13071 else if (DECL_CONSTRUCTOR_P (decl1
))
13072 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13077 /* Called after store_parm_decls for a function-try-block. We need to update
13078 last_parm_cleanup_insn so that the base initializers for a constructor
13079 are run within this block, not before it. */
13082 expand_start_early_try_stmts ()
13084 expand_start_try_stmts ();
13085 last_parm_cleanup_insn
= get_last_insn ();
13088 /* Store the parameter declarations into the current function declaration.
13089 This is called after parsing the parameter declarations, before
13090 digesting the body of the function.
13092 Also install to binding contour return value identifier, if any. */
13095 store_parm_decls ()
13097 register tree fndecl
= current_function_decl
;
13098 register tree parm
;
13099 int parms_have_cleanups
= 0;
13100 tree cleanups
= NULL_TREE
;
13102 /* This is a list of types declared among parms in a prototype. */
13103 tree parmtags
= current_function_parm_tags
;
13105 /* This is a chain of any other decls that came in among the parm
13106 declarations. If a parm is declared with enum {foo, bar} x;
13107 then CONST_DECLs for foo and bar are put here. */
13108 tree nonparms
= NULL_TREE
;
13110 /* Create a binding level for the parms. */
13111 if (!building_stmt_tree ())
13112 expand_start_bindings (2);
13114 if (current_function_parms
)
13116 /* This case is when the function was defined with an ANSI prototype.
13117 The parms already have decls, so we need not do anything here
13118 except record them as in effect
13119 and complain if any redundant old-style parm decls were written. */
13121 tree specparms
= current_function_parms
;
13124 if (doing_semantic_analysis_p ())
13126 /* Must clear this because it might contain TYPE_DECLs declared
13128 storedecls (NULL_TREE
);
13130 /* If we're doing semantic analysis, then we'll call pushdecl
13131 for each of these. We must do them in reverse order so that
13132 they end in the correct forward order. */
13133 specparms
= nreverse (specparms
);
13136 for (parm
= specparms
; parm
; parm
= next
)
13138 next
= TREE_CHAIN (parm
);
13139 if (TREE_CODE (parm
) == PARM_DECL
)
13143 if (doing_semantic_analysis_p ())
13145 if (DECL_NAME (parm
) == NULL_TREE
13146 || TREE_CODE (TREE_TYPE (parm
)) != VOID_TYPE
)
13149 cp_error ("parameter `%D' declared void", parm
);
13152 if (! building_stmt_tree ()
13153 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13155 expand_decl (parm
);
13156 parms_have_cleanups
= 1;
13158 /* Keep track of the cleanups. */
13159 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13164 /* If we find an enum constant or a type tag,
13165 put it aside for the moment. */
13166 TREE_CHAIN (parm
) = NULL_TREE
;
13167 nonparms
= chainon (nonparms
, parm
);
13171 if (doing_semantic_analysis_p ())
13173 /* Get the decls in their original chain order
13174 and record in the function. This is all and only the
13175 PARM_DECLs that were pushed into scope by the loop above. */
13176 DECL_ARGUMENTS (fndecl
) = getdecls ();
13177 storetags (chainon (parmtags
, gettags ()));
13179 /* We built up the cleanups in reversed order. */
13180 cleanups
= nreverse (cleanups
);
13184 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13186 /* Now store the final chain of decls for the arguments
13187 as the decl-chain of the current lexical scope.
13188 Put the enumerators in as well, at the front so that
13189 DECL_ARGUMENTS is not modified. */
13190 if (doing_semantic_analysis_p ())
13191 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13193 /* Initialize the RTL code for the function. */
13194 DECL_SAVED_INSNS (fndecl
) = 0;
13195 if (! building_stmt_tree ())
13196 expand_function_start (fndecl
, parms_have_cleanups
);
13198 current_function_parms_stored
= 1;
13200 /* If this function is `main', emit a call to `__main'
13201 to run global initializers, etc. */
13202 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13203 expand_main_function ();
13205 /* Now that we have initialized the parms, we can start their
13206 cleanups. We cannot do this before, since expand_decl_cleanup
13207 should not be called before the parm can be used. */
13208 if (cleanups
&& !building_stmt_tree ())
13211 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
),
13212 TREE_VALUE (cleanups
)))
13213 cp_error ("parser lost in parsing declaration of `%D'",
13214 TREE_PURPOSE (cleanups
));
13216 cleanups
= TREE_CHAIN (cleanups
);
13219 /* Create a binding contour which can be used to catch
13220 cleanup-generated temporaries. Also, if the return value needs or
13221 has initialization, deal with that now. */
13222 if (parms_have_cleanups
)
13225 if (!building_stmt_tree ())
13226 expand_start_bindings (2);
13229 /* Do the starting of the exception specifications, if we have any. */
13230 if (flag_exceptions
&& !processing_template_decl
13231 && building_stmt_tree ()
13232 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13233 current_eh_spec_try_block
= expand_start_eh_spec ();
13235 last_parm_cleanup_insn
= get_last_insn ();
13236 last_dtor_insn
= get_last_insn ();
13239 /* Bind a name and initialization to the return value of
13240 the current function. */
13243 store_return_init (decl
)
13246 /* If this named return value comes in a register, put it in a
13247 pseudo-register. */
13248 if (DECL_REGISTER (decl
))
13250 original_result_rtx
= DECL_RTL (decl
);
13251 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13256 /* We have finished doing semantic analysis on DECL, but have not yet
13257 generated RTL for its body. Save away our current state, so that
13258 when we want to generate RTL later we know what to do. */
13261 save_function_data (decl
)
13264 struct language_function
*f
;
13266 /* Save the language-specific per-function data so that we can
13267 get it back when we really expand this function. */
13268 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13272 f
= ((struct language_function
*)
13273 xmalloc (sizeof (struct language_function
)));
13274 bcopy ((char *) cp_function_chain
, (char *) f
,
13275 sizeof (struct language_function
));
13276 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13278 /* Clear out the bits we don't need. */
13279 f
->x_base_init_list
= NULL_TREE
;
13280 f
->x_member_init_list
= NULL_TREE
;
13281 f
->x_last_tree
= NULL_TREE
;
13282 f
->x_last_expr_type
= NULL_TREE
;
13283 f
->x_last_dtor_insn
= NULL_RTX
;
13284 f
->x_last_parm_cleanup_insn
= NULL_RTX
;
13285 f
->x_result_rtx
= NULL_RTX
;
13286 f
->x_named_label_uses
= NULL
;
13287 f
->bindings
= NULL
;
13289 /* When we get back here again, we will be expanding. */
13290 f
->x_expanding_p
= 1;
13292 /* If we've already decided that we cannot inline this function, we
13293 must remember that fact when we actually go to expand the
13295 f
->cannot_inline
= current_function_cannot_inline
;
13298 /* At the end of every constructor we generate to code to return
13299 `this'. Do that now. */
13302 finish_constructor_body ()
13304 /* Any return from a constructor will end up here. */
13305 add_tree (build_min_nt (LABEL_STMT
, ctor_label
));
13307 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13308 generate the return, rather than a goto to CTOR_LABEL. */
13309 ctor_label
= NULL_TREE
;
13310 /* In check_return_expr we translate an empty return from a
13311 constructor to a return of `this'. */
13312 finish_return_stmt (NULL_TREE
);
13315 /* At the end of every destructor we generate code to restore virtual
13316 function tables to the values desired by base classes and to call
13317 to base class destructors. Do that now. */
13320 finish_destructor_body ()
13322 tree compound_stmt
;
13327 /* Create a block to contain all the extra code. */
13328 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13330 /* Any return from a destructor will end up here. */
13331 add_tree (build_min_nt (LABEL_STMT
, dtor_label
));
13333 /* Generate the code to call destructor on base class. If this
13334 destructor belongs to a class with virtual functions, then set
13335 the virtual function table pointer to represent the type of our
13338 /* This side-effect makes call to `build_delete' generate the code
13339 we have to have at the end of this destructor. `build_delete'
13340 will set the flag again. */
13341 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13343 /* These are two cases where we cannot delegate deletion. */
13344 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13345 || TYPE_GETS_REG_DELETE (current_class_type
))
13346 in_charge
= integer_zero_node
;
13348 in_charge
= current_in_charge_parm
;
13350 exprstmt
= build_delete (current_class_type
,
13353 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13356 if (exprstmt
!= error_mark_node
13357 && (TREE_CODE (exprstmt
) != NOP_EXPR
13358 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13359 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13361 if (exprstmt
!= void_zero_node
)
13362 /* Don't call `expand_expr_stmt' if we're not going to do
13363 anything, since -Wall will give a diagnostic. */
13364 finish_expr_stmt (exprstmt
);
13366 /* Run destructors for all virtual baseclasses. */
13367 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13369 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13370 tree if_stmt
= begin_if_stmt ();
13371 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13372 current_in_charge_parm
,
13378 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13380 tree vb
= get_vbase
13381 (BINFO_TYPE (vbases
),
13382 TYPE_BINFO (current_class_type
));
13384 (build_scoped_method_call
13385 (current_class_ref
, vb
, dtor_identifier
,
13386 build_expr_list (NULL_TREE
, integer_zero_node
)));
13388 vbases
= TREE_CHAIN (vbases
);
13391 finish_then_clause (if_stmt
);
13396 virtual_size
= c_sizeof (current_class_type
);
13398 /* At the end, call delete if that's what's requested. */
13400 /* FDIS sez: At the point of definition of a virtual destructor
13401 (including an implicit definition), non-placement operator delete
13402 shall be looked up in the scope of the destructor's class and if
13403 found shall be accessible and unambiguous.
13405 This is somewhat unclear, but I take it to mean that if the class
13406 only defines placement deletes we don't do anything here. So we
13407 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13408 they ever try to delete one of these. */
13409 if (TYPE_GETS_REG_DELETE (current_class_type
)
13410 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13414 exprstmt
= build_op_delete_call
13415 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13416 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13418 if_stmt
= begin_if_stmt ();
13419 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13420 current_in_charge_parm
,
13423 finish_expr_stmt (exprstmt
);
13424 finish_then_clause (if_stmt
);
13428 /* Close the block we started above. */
13429 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13432 /* Finish up a function declaration and compile that function
13433 all the way to assembler language output. The free the storage
13434 for the function definition.
13436 This is called after parsing the body of the function definition.
13437 LINENO is the current line number.
13439 FLAGS is a bitwise or of the following values:
13441 An extra call to poplevel (and expand_end_bindings) must be
13442 made to take care of the binding contour for the base
13443 initializers. This is only relevant for constructors.
13445 We just finished processing the body of an in-class inline
13446 function definition. (This processing will have taken place
13447 after the class definition is complete.) */
13450 finish_function (lineno
, flags
)
13454 register tree fndecl
= current_function_decl
;
13455 tree fntype
, ctype
= NULL_TREE
;
13456 /* Label to use if this function is supposed to return a value. */
13457 tree no_return_label
= NULL_TREE
;
13458 int call_poplevel
= (flags
& 1) != 0;
13459 int inclass_inline
= (flags
& 2) != 0;
13463 /* When we get some parse errors, we can end up without a
13464 current_function_decl, so cope. */
13465 if (fndecl
== NULL_TREE
)
13466 return error_mark_node
;
13468 nested
= function_depth
> 1;
13469 fntype
= TREE_TYPE (fndecl
);
13471 /* TREE_READONLY (fndecl) = 1;
13472 This caused &foo to be of type ptr-to-const-function
13473 which then got a warning when stored in a ptr-to-function variable. */
13475 /* This happens on strange parse errors. */
13476 if (! current_function_parms_stored
)
13479 store_parm_decls ();
13482 if (building_stmt_tree ())
13484 if (DECL_CONSTRUCTOR_P (fndecl
))
13486 finish_constructor_body ();
13490 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13491 finish_destructor_body ();
13492 else if (DECL_MAIN_P (fndecl
))
13494 /* Make it so that `main' always returns 0 by default. */
13496 finish_return_stmt (integer_one_node
);
13498 finish_return_stmt (integer_zero_node
);
13502 /* Finish dealing with exception specifiers. */
13503 if (flag_exceptions
&& !processing_template_decl
13504 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13505 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13506 (TREE_TYPE (current_function_decl
)),
13507 current_eh_spec_try_block
);
13511 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13513 tree ttype
= target_type (fntype
);
13516 if (IS_AGGR_TYPE (ttype
))
13517 /* Let debugger know it should output info for this type. */
13518 note_debug_info_needed (ttype
);
13520 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13522 ttype
= target_type (TREE_TYPE (parmdecl
));
13523 if (IS_AGGR_TYPE (ttype
))
13524 /* Let debugger know it should output info for this type. */
13525 note_debug_info_needed (ttype
);
13529 /* Clean house because we will need to reorder insns here. */
13530 do_pending_stack_adjust ();
13534 else if (DECL_CONSTRUCTOR_P (fndecl
))
13536 /* All subobjects have been fully constructed at this point. */
13537 end_protect_partials ();
13542 else if (return_label
!= NULL_RTX
13543 && flag_this_is_variable
<= 0
13544 && current_function_return_value
== NULL_TREE
13545 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13546 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13548 if (flag_exceptions
)
13549 expand_exception_blocks ();
13551 /* If this function is supposed to return a value, ensure that
13552 we do not fall into the cleanups by mistake. The end of our
13553 function will look like this:
13555 user code (may have return stmt somewhere)
13556 goto no_return_label
13561 NOTE_INSN_FUNCTION_END
13565 If the user omits a return stmt in the USER CODE section, we
13566 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13567 Otherwise, we won't. */
13568 if (no_return_label
)
13570 DECL_CONTEXT (no_return_label
) = fndecl
;
13571 DECL_INITIAL (no_return_label
) = error_mark_node
;
13572 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13573 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13574 expand_goto (no_return_label
);
13579 /* Remove the binding contour which is used
13580 to catch cleanup-generated temporaries. */
13581 expand_end_bindings (0, 0, 0);
13582 poplevel (0, 0, 0);
13584 /* Emit label at beginning of cleanup code for parameters. */
13585 emit_label (cleanup_label
);
13588 /* Get return value into register if that's where it's supposed
13590 if (original_result_rtx
)
13591 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13593 /* Finish building code that will trigger warnings if users forget
13594 to make their functions return values. */
13595 if (no_return_label
|| cleanup_label
)
13596 emit_jump (return_label
);
13597 if (no_return_label
)
13599 /* We don't need to call `expand_*_return' here because we
13600 don't need any cleanups here--this path of code is only
13601 for error checking purposes. */
13602 expand_label (no_return_label
);
13605 /* We hard-wired immediate_size_expand to zero in
13606 start_function. Expand_function_end will decrement this
13607 variable. So, we set the variable to one here, so that after
13608 the decrement it will remain zero. */
13609 immediate_size_expand
= 1;
13611 /* Generate rtl for function exit. */
13612 expand_function_end (input_filename
, lineno
, 1);
13615 /* We have to save this value here in case
13616 maybe_end_member_template_processing decides to pop all the
13617 template parameters. */
13618 expand_p
= !building_stmt_tree ();
13620 /* If we're saving up tree structure, tie off the function now. */
13622 finish_stmt_tree (fndecl
);
13624 /* This must come after expand_function_end because cleanups might
13625 have declarations (from inline functions) that need to go into
13626 this function's blocks. */
13627 if (doing_semantic_analysis_p ())
13629 if (current_binding_level
->parm_flag
!= 1)
13630 my_friendly_abort (122);
13631 poplevel (1, 0, 1);
13634 /* Remember that we were in class scope. */
13635 if (current_class_name
)
13636 ctype
= current_class_type
;
13638 /* Must mark the RESULT_DECL as being in this function. */
13639 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13641 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13642 to the FUNCTION_DECL node itself. */
13643 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13645 /* Undo the call to push_momentary in start_function. */
13648 /* Save away current state, if appropriate. */
13649 if (!expanding_p
&& !processing_template_decl
)
13650 save_function_data (fndecl
);
13656 int saved_flag_keep_inline_functions
=
13657 flag_keep_inline_functions
;
13659 /* So we can tell if jump_optimize sets it to 1. */
13662 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13663 && hack_decl_function_context (fndecl
))
13664 /* Trick rest_of_compilation into not deferring output of this
13665 function, even if it is inline, since the rtl_obstack for
13666 this function is the function_obstack of the enclosing
13667 function and will be deallocated when the enclosing
13668 function is gone. See save_tree_status. */
13669 flag_keep_inline_functions
= 1;
13671 /* Before we call rest_of_compilation (which will pop the
13672 CURRENT_FUNCTION), we must save these values. */
13673 returns_null
= current_function_returns_null
;
13674 returns_value
= current_function_returns_value
;
13676 /* If this is a nested function (like a template instantiation
13677 that we're compiling in the midst of compiling something
13678 else), push a new GC context. That will keep local variables
13679 on the stack from being collected while we're doing the
13680 compilation of this function. */
13681 if (function_depth
> 1)
13682 ggc_push_context ();
13684 /* Run the optimizers and output the assembler code for this
13686 if (DECL_ARTIFICIAL (fndecl
))
13688 /* Do we really *want* to inline this synthesized method? */
13690 int save_fif
= flag_inline_functions
;
13691 flag_inline_functions
= 1;
13693 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13694 will check our size. */
13695 DECL_INLINE (fndecl
) = 0;
13697 rest_of_compilation (fndecl
);
13698 flag_inline_functions
= save_fif
;
13701 rest_of_compilation (fndecl
);
13703 /* Undo the call to ggc_push_context above. */
13704 if (function_depth
> 1)
13705 ggc_pop_context ();
13707 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13709 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13711 /* Set DECL_EXTERNAL so that assemble_external will be called as
13712 necessary. We'll clear it again in finish_file. */
13713 if (! DECL_EXTERNAL (fndecl
))
13714 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13715 DECL_EXTERNAL (fndecl
) = 1;
13716 mark_inline_for_output (fndecl
);
13719 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13720 note_debug_info_needed (ctype
);
13722 returns_null
|= can_reach_end
;
13724 /* Since we don't normally go through c_expand_return for constructors,
13725 this normally gets the wrong value.
13726 Also, named return values have their return codes emitted after
13727 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13728 if (DECL_CONSTRUCTOR_P (fndecl
)
13729 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13732 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13733 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13734 else if ((warn_return_type
|| pedantic
)
13736 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13738 /* If this function returns non-void and control can drop through,
13740 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13742 /* With just -W, complain only if function returns both with
13743 and without a value. */
13744 else if (extra_warnings
&& returns_value
&& returns_null
)
13745 warning ("this function may return with or without a value");
13749 /* Since we never call rest_of_compilation, we never clear
13750 CURRENT_FUNCTION. Do so explicitly. */
13751 free_after_compilation (current_function
);
13752 current_function
= NULL
;
13755 /* If this is a in-class inline definition, we may have to pop the
13756 bindings for the template parameters that we added in
13757 maybe_begin_member_template_processing when start_function was
13759 if (inclass_inline
)
13760 maybe_end_member_template_processing ();
13762 /* Leave the scope of the class. */
13764 pop_nested_class ();
13768 /* Free all the tree nodes making up this function. */
13769 /* Switch back to allocating nodes permanently
13770 until we start another function. */
13772 permanent_allocation (1);
13774 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
))
13778 /* Stop pointing to the local nodes about to be freed. */
13779 /* But DECL_INITIAL must remain nonzero so we know this
13780 was an actual function definition. */
13781 DECL_INITIAL (fndecl
) = error_mark_node
;
13782 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13783 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13786 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13787 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13788 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13789 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13794 /* Let the error reporting routines know that we're outside a
13795 function. For a nested function, this value is used in
13796 pop_cp_function_context and then reset via pop_function_context. */
13797 current_function_decl
= NULL_TREE
;
13803 /* Create the FUNCTION_DECL for a function definition.
13804 DECLSPECS and DECLARATOR are the parts of the declaration;
13805 they describe the return type and the name of the function,
13806 but twisted together in a fashion that parallels the syntax of C.
13808 This function creates a binding context for the function body
13809 as well as setting up the FUNCTION_DECL in current_function_decl.
13811 Returns a FUNCTION_DECL on success.
13813 If the DECLARATOR is not suitable for a function (it defines a datum
13814 instead), we return 0, which tells yyparse to report a parse error.
13816 May return void_type_node indicating that this method is actually
13817 a friend. See grokfield for more details.
13819 Came here with a `.pushlevel' .
13821 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13822 CHANGES TO CODE IN `grokfield'. */
13825 start_method (declspecs
, declarator
, attrlist
)
13826 tree declarator
, declspecs
, attrlist
;
13828 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13831 /* Something too ugly to handle. */
13832 if (fndecl
== NULL_TREE
)
13835 /* Pass friends other than inline friend functions back. */
13836 if (fndecl
== void_type_node
)
13839 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13840 /* Not a function, tell parser to report parse error. */
13843 if (DECL_IN_AGGR_P (fndecl
))
13845 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13847 if (DECL_CONTEXT (fndecl
)
13848 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13849 cp_error ("`%D' is already defined in class %s", fndecl
,
13850 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13852 return void_type_node
;
13855 check_template_shadow (fndecl
);
13857 DECL_THIS_INLINE (fndecl
) = 1;
13859 if (flag_default_inline
)
13860 DECL_INLINE (fndecl
) = 1;
13862 /* We process method specializations in finish_struct_1. */
13863 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13864 fndecl
= push_template_decl (fndecl
);
13866 /* We read in the parameters on the maybepermanent_obstack,
13867 but we won't be getting back to them until after we
13868 may have clobbered them. So the call to preserve_data
13869 will keep them safe. */
13872 if (! DECL_FRIEND_P (fndecl
))
13874 if (TREE_CHAIN (fndecl
))
13876 fndecl
= copy_node (fndecl
);
13877 TREE_CHAIN (fndecl
) = NULL_TREE
;
13880 if (DECL_CONSTRUCTOR_P (fndecl
))
13882 if (! grok_ctor_properties (current_class_type
, fndecl
))
13883 return void_type_node
;
13885 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13886 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13889 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13891 /* Make a place for the parms */
13893 current_binding_level
->parm_flag
= 1;
13895 DECL_IN_AGGR_P (fndecl
) = 1;
13899 /* Go through the motions of finishing a function definition.
13900 We don't compile this method until after the whole class has
13903 FINISH_METHOD must return something that looks as though it
13904 came from GROKFIELD (since we are defining a method, after all).
13906 This is called after parsing the body of the function definition.
13907 STMTS is the chain of statements that makes up the function body.
13909 DECL is the ..._DECL that `start_method' provided. */
13912 finish_method (decl
)
13915 register tree fndecl
= decl
;
13918 register tree link
;
13920 if (decl
== void_type_node
)
13923 old_initial
= DECL_INITIAL (fndecl
);
13925 /* Undo the level for the parms (from start_method).
13926 This is like poplevel, but it causes nothing to be
13927 saved. Saving information here confuses symbol-table
13928 output routines. Besides, this information will
13929 be correctly output when this method is actually
13932 /* Clear out the meanings of the local variables of this level;
13933 also record in each decl which block it belongs to. */
13935 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13937 if (DECL_NAME (link
) != NULL_TREE
)
13938 pop_binding (DECL_NAME (link
), link
);
13939 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13940 DECL_CONTEXT (link
) = NULL_TREE
;
13943 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13944 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13945 current_binding_level
->parm_flag
,
13946 current_binding_level
->keep
);
13948 poplevel (0, 0, 0);
13950 DECL_INITIAL (fndecl
) = old_initial
;
13952 /* We used to check if the context of FNDECL was different from
13953 current_class_type as another way to get inside here. This didn't work
13954 for String.cc in libg++. */
13955 if (DECL_FRIEND_P (fndecl
))
13957 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13958 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13959 decl
= void_type_node
;
13965 /* Called when a new struct TYPE is defined.
13966 If this structure or union completes the type of any previous
13967 variable declaration, lay it out and output its rtl. */
13970 hack_incomplete_structures (type
)
13975 if (current_binding_level
->incomplete
== NULL_TREE
)
13978 if (!type
) /* Don't do this for class templates. */
13981 for (list
= ¤t_binding_level
->incomplete
; *list
; )
13983 tree decl
= TREE_VALUE (*list
);
13984 if ((decl
&& TREE_TYPE (decl
) == type
)
13985 || (TREE_TYPE (decl
)
13986 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13987 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
13989 int toplevel
= toplevel_bindings_p ();
13990 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13991 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
13992 layout_type (TREE_TYPE (decl
));
13993 layout_decl (decl
, 0);
13994 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
13998 expand_decl (decl
);
13999 cleanup
= maybe_build_cleanup (decl
);
14000 expand_decl_init (decl
);
14001 if (! expand_decl_cleanup (decl
, cleanup
))
14002 cp_error ("parser lost in parsing declaration of `%D'",
14005 *list
= TREE_CHAIN (*list
);
14008 list
= &TREE_CHAIN (*list
);
14012 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14013 See build_delete for information about AUTO_DELETE.
14015 Don't build these on the momentary obstack; they must live
14016 the life of the binding contour. */
14019 maybe_build_cleanup_1 (decl
, auto_delete
)
14020 tree decl
, auto_delete
;
14022 tree type
= TREE_TYPE (decl
);
14023 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14025 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14028 if (TREE_CODE (decl
) != PARM_DECL
)
14029 temp
= suspend_momentary ();
14031 if (TREE_CODE (type
) == ARRAY_TYPE
)
14035 mark_addressable (decl
);
14036 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14039 /* Optimize for space over speed here. */
14040 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14041 || flag_expensive_optimizations
)
14042 flags
|= LOOKUP_NONVIRTUAL
;
14044 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14046 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14047 && ! TYPE_HAS_DESTRUCTOR (type
))
14048 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14049 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14051 if (TREE_CODE (decl
) != PARM_DECL
)
14052 resume_momentary (temp
);
14059 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
14062 build_target_expr (decl
, value
)
14068 t
= build (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
14069 maybe_build_cleanup (decl
), NULL_TREE
);
14070 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
14071 ignore the TARGET_EXPR. If there really turn out to be no
14072 side-effects, then the optimizer should be able to get rid of
14073 whatever code is generated anyhow. */
14074 TREE_SIDE_EFFECTS (t
) = 1;
14079 /* If DECL is of a type which needs a cleanup, build that cleanup
14080 here. The cleanup does free the storage with a call to delete. */
14083 maybe_build_cleanup_and_delete (decl
)
14086 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14089 /* If DECL is of a type which needs a cleanup, build that cleanup
14090 here. The cleanup does not free the storage with a call a delete. */
14093 maybe_build_cleanup (decl
)
14096 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14099 /* Expand a C++ expression at the statement level.
14100 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14101 The C++ type checker should get all of these out when
14102 expressions are combined with other, type-providing, expressions,
14103 leaving only orphan expressions, such as:
14105 &class::bar; / / takes its address, but does nothing with it. */
14108 cplus_expand_expr_stmt (exp
)
14111 if (stmts_are_full_exprs_p
)
14112 exp
= convert_to_void (exp
, "statement");
14115 /* We should do this eventually, but right now this causes regex.o from
14116 libg++ to miscompile, and tString to core dump. */
14117 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14120 /* If we don't do this, we end up down inside expand_expr
14121 trying to do TYPE_MODE on the ERROR_MARK, and really
14122 go outside the bounds of the type. */
14123 if (exp
!= error_mark_node
)
14124 expand_expr_stmt (break_out_cleanups (exp
));
14127 /* When a stmt has been parsed, this function is called. */
14132 /* Always assume this statement was not an expression statement. If
14133 it actually was an expression statement, its our callers
14134 responsibility to fix this up. */
14135 last_expr_type
= NULL_TREE
;
14138 /* Change a static member function definition into a FUNCTION_TYPE, instead
14139 of the METHOD_TYPE that we create when it's originally parsed.
14141 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14142 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14143 other decls. Either pass the addresses of local variables or NULL. */
14146 revert_static_member_fn (decl
, fn
, argtypes
)
14147 tree
*decl
, *fn
, *argtypes
;
14150 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14151 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14153 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14154 != TYPE_UNQUALIFIED
)
14155 cp_error ("static member function `%#D' declared with type qualifiers",
14158 args
= TREE_CHAIN (args
);
14159 tmp
= build_function_type (TREE_TYPE (function
), args
);
14160 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14161 tmp
= build_exception_variant (tmp
,
14162 TYPE_RAISES_EXCEPTIONS (function
));
14163 TREE_TYPE (*decl
) = tmp
;
14164 if (DECL_ARGUMENTS (*decl
))
14165 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14166 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14173 /* Initialize the variables used during compilation of a C++
14177 push_cp_function_context (f
)
14178 struct function
*f
;
14180 struct language_function
*p
14181 = ((struct language_function
*)
14182 xcalloc (1, sizeof (struct language_function
)));
14185 /* It takes an explicit call to expand_body to generate RTL for a
14189 /* Whenever we start a new function, we destroy temporaries in the
14191 stmts_are_full_exprs_p
= 1;
14194 /* Free the language-specific parts of F, now that we've finished
14195 compiling the function. */
14198 pop_cp_function_context (f
)
14199 struct function
*f
;
14201 free (f
->language
);
14205 /* Mark P for GC. */
14208 mark_lang_function (p
)
14209 struct language_function
*p
;
14214 ggc_mark_tree (p
->x_named_labels
);
14215 ggc_mark_tree (p
->x_ctor_label
);
14216 ggc_mark_tree (p
->x_dtor_label
);
14217 ggc_mark_tree (p
->x_base_init_list
);
14218 ggc_mark_tree (p
->x_member_init_list
);
14219 ggc_mark_tree (p
->x_current_class_ptr
);
14220 ggc_mark_tree (p
->x_current_class_ref
);
14221 ggc_mark_tree (p
->x_last_tree
);
14222 ggc_mark_tree (p
->x_last_expr_type
);
14223 ggc_mark_tree (p
->x_eh_spec_try_block
);
14224 ggc_mark_tree (p
->x_scope_stmt_stack
);
14226 ggc_mark_rtx (p
->x_last_dtor_insn
);
14227 ggc_mark_rtx (p
->x_last_parm_cleanup_insn
);
14228 ggc_mark_rtx (p
->x_result_rtx
);
14230 mark_binding_level (&p
->bindings
);
14233 /* Mark the language-specific data in F for GC. */
14236 mark_cp_function_context (f
)
14237 struct function
*f
;
14239 mark_lang_function (f
->language
);
14245 return function_depth
!= 0;
14250 lang_mark_false_label_stack (l
)
14251 struct label_node
*l
;
14253 /* C++ doesn't use false_label_stack. It better be NULL. */
14254 my_friendly_assert (l
== NULL
, 19990904);
14261 enum tree_code code
= TREE_CODE (t
);
14262 if (code
== IDENTIFIER_NODE
)
14264 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14265 struct lang_id2
*li2
= li
->x
;
14266 ggc_mark_tree (li
->namespace_bindings
);
14267 ggc_mark_tree (li
->bindings
);
14268 ggc_mark_tree (li
->class_value
);
14269 ggc_mark_tree (li
->class_template_info
);
14273 ggc_mark_tree (li2
->label_value
);
14274 ggc_mark_tree (li2
->implicit_decl
);
14275 ggc_mark_tree (li2
->error_locus
);
14278 else if (code
== CPLUS_BINDING
)
14280 if (BINDING_HAS_LEVEL_P (t
))
14281 mark_binding_level (&BINDING_LEVEL (t
));
14283 ggc_mark_tree (BINDING_SCOPE (t
));
14284 ggc_mark_tree (BINDING_VALUE (t
));
14286 else if (code
== OVERLOAD
)
14287 ggc_mark_tree (OVL_FUNCTION (t
));
14288 else if (code
== TEMPLATE_PARM_INDEX
)
14289 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14290 else if (TREE_CODE_CLASS (code
) == 'd')
14292 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14297 ggc_mark_tree (ld
->decl_flags
.access
);
14298 ggc_mark_tree (ld
->decl_flags
.context
);
14299 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14300 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14301 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14303 ggc_mark_tree (ld
->main_decl_variant
);
14304 ggc_mark_tree (ld
->befriending_classes
);
14305 ggc_mark_tree (ld
->saved_tree
);
14306 if (TREE_CODE (t
) == TYPE_DECL
)
14307 ggc_mark_tree (ld
->u
.sorted_fields
);
14308 else if (TREE_CODE (t
) == FUNCTION_DECL
14309 && !DECL_PENDING_INLINE_P (t
))
14310 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14314 else if (TREE_CODE_CLASS (code
) == 't')
14316 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14318 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14319 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14322 ggc_mark_tree (lt
->vfields
);
14323 ggc_mark_tree (lt
->vbases
);
14324 ggc_mark_tree (lt
->tags
);
14325 ggc_mark_tree (lt
->search_slot
);
14326 ggc_mark_tree (lt
->size
);
14327 ggc_mark_tree (lt
->abstract_virtuals
);
14328 ggc_mark_tree (lt
->friend_classes
);
14329 ggc_mark_tree (lt
->rtti
);
14330 ggc_mark_tree (lt
->methods
);
14331 ggc_mark_tree (lt
->template_info
);
14332 ggc_mark_tree (lt
->befriending_classes
);
14335 /* In the case of pointer-to-member function types, the
14336 TYPE_LANG_SPECIFIC is really just a tree. */
14337 ggc_mark_tree ((tree
) lt
);