1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-98, 1999 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Process declarations and symbol lookup for C front end.
24 Also constructs types; the standard scalar types at initialization,
25 and structure, union, array and enum types when they are declared. */
27 /* ??? not all decl nodes are given the most useful possible
28 line numbers. For example, the CONST_DECLs for enum values. */
48 #define obstack_chunk_alloc xmalloc
49 #define obstack_chunk_free free
51 extern struct obstack permanent_obstack
;
52 extern struct obstack
* saveable_obstack
;
54 extern int current_class_depth
;
56 extern tree static_ctors
, static_dtors
;
58 extern tree global_namespace
;
60 extern int (*valid_lang_attribute
) PROTO ((tree
, tree
, tree
, tree
));
62 /* Use garbage collection. */
66 /* Obstack used for remembering local class declarations (like
67 enums and static (const) members. */
69 struct obstack decl_obstack
;
70 static struct stack_level
*decl_stack
;
72 #ifndef CHAR_TYPE_SIZE
73 #define CHAR_TYPE_SIZE BITS_PER_UNIT
76 #ifndef SHORT_TYPE_SIZE
77 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
81 #define INT_TYPE_SIZE BITS_PER_WORD
84 #ifndef LONG_TYPE_SIZE
85 #define LONG_TYPE_SIZE BITS_PER_WORD
88 #ifndef LONG_LONG_TYPE_SIZE
89 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
92 #ifndef WCHAR_UNSIGNED
93 #define WCHAR_UNSIGNED 0
96 #ifndef FLOAT_TYPE_SIZE
97 #define FLOAT_TYPE_SIZE BITS_PER_WORD
100 #ifndef DOUBLE_TYPE_SIZE
101 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
104 #ifndef LONG_DOUBLE_TYPE_SIZE
105 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
108 #ifndef BOOL_TYPE_SIZE
109 #ifdef SLOW_BYTE_ACCESS
110 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
112 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
116 /* We let tm.h override the types used here, to handle trivial differences
117 such as the choice of unsigned int or long unsigned int for size_t.
118 When machines start needing nontrivial differences in the size type,
119 it would be best to do something here to figure out automatically
120 from other information what type to use. */
123 #define SIZE_TYPE "long unsigned int"
127 #define PTRDIFF_TYPE "long int"
131 #define WCHAR_TYPE "int"
134 static tree grokparms
PROTO((tree
, int));
135 static const char *redeclaration_error_message
PROTO((tree
, tree
));
137 static struct stack_level
*push_decl_level
PROTO((struct stack_level
*,
139 static void push_binding_level
PROTO((struct binding_level
*, int,
141 static void pop_binding_level
PROTO((void));
142 static void suspend_binding_level
PROTO((void));
143 static void resume_binding_level
PROTO((struct binding_level
*));
144 static struct binding_level
*make_binding_level
PROTO((void));
145 static void declare_namespace_level
PROTO((void));
146 static void signal_catch
PROTO((int)) ATTRIBUTE_NORETURN
;
147 static void storedecls
PROTO((tree
));
148 static void require_complete_types_for_parms
PROTO((tree
));
149 static void push_overloaded_decl_1
PROTO((tree
));
150 static int ambi_op_p
PROTO((tree
));
151 static int unary_op_p
PROTO((tree
));
152 static tree store_bindings
PROTO((tree
, tree
));
153 static tree lookup_tag_reverse
PROTO((tree
, tree
));
154 static tree obscure_complex_init
PROTO((tree
, tree
));
155 static tree maybe_build_cleanup_1
PROTO((tree
, tree
));
156 static tree lookup_name_real
PROTO((tree
, int, int, int));
157 static void warn_extern_redeclared_static
PROTO((tree
, tree
));
158 static void grok_reference_init
PROTO((tree
, tree
, tree
));
159 static tree grokfndecl
PROTO((tree
, tree
, tree
, tree
, int,
160 enum overload_flags
, tree
,
161 tree
, int, int, int, int, int, int, tree
));
162 static tree grokvardecl
PROTO((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
163 static tree lookup_tag
PROTO((enum tree_code
, tree
,
164 struct binding_level
*, int));
165 static void set_identifier_type_value_with_scope
166 PROTO((tree
, tree
, struct binding_level
*));
167 static void record_builtin_type
PROTO((enum rid
, const char *, tree
));
168 static void record_unknown_type
PROTO((tree
, const char *));
169 static int member_function_or_else
PROTO((tree
, tree
, const char *));
170 static void bad_specifiers
PROTO((tree
, const char *, int, int, int, int,
172 static void lang_print_error_function
PROTO((const char *));
173 static tree maybe_process_template_type_declaration
PROTO((tree
, int, struct binding_level
*));
174 static void check_for_uninitialized_const_var
PROTO((tree
));
175 static unsigned long typename_hash
PROTO((hash_table_key
));
176 static boolean typename_compare
PROTO((hash_table_key
, hash_table_key
));
177 static void push_binding
PROTO((tree
, tree
, struct binding_level
*));
178 static int add_binding
PROTO((tree
, tree
));
179 static void pop_binding
PROTO((tree
, tree
));
180 static tree local_variable_p
PROTO((tree
));
181 static tree find_binding
PROTO((tree
, tree
));
182 static tree select_decl
PROTO((tree
, int));
183 static int lookup_flags
PROTO((int, int));
184 static tree qualify_lookup
PROTO((tree
, int));
185 static tree record_builtin_java_type
PROTO((const char *, int));
186 static const char *tag_name
PROTO((enum tag_types code
));
187 static void find_class_binding_level
PROTO((void));
188 static struct binding_level
*innermost_nonclass_level
PROTO((void));
189 static tree poplevel_class
PROTO((void));
190 static void warn_about_implicit_typename_lookup
PROTO((tree
, tree
));
191 static int walk_namespaces_r
PROTO((tree
, walk_namespaces_fn
, void *));
192 static int walk_globals_r
PROTO((tree
, void *));
193 static void add_decl_to_level
PROTO((tree
, struct binding_level
*));
194 static tree make_label_decl
PROTO((tree
, int));
195 static void pop_label
PROTO((tree
));
196 static void pop_labels
PROTO((tree
));
197 static void maybe_deduce_size_from_array_init
PROTO((tree
, tree
));
198 static tree layout_var_decl
PROTO((tree
, tree
));
199 static void maybe_commonize_var
PROTO((tree
));
200 static tree build_cleanup_on_safe_obstack
PROTO((tree
));
201 static tree check_initializer
PROTO((tree
, tree
));
202 static void make_rtl_for_nonlocal_decl
PROTO((tree
, tree
, const char *));
203 static void push_cp_function_context
PROTO((struct function
*));
204 static void pop_cp_function_context
PROTO((struct function
*));
205 static void mark_binding_level
PROTO((void *));
206 static void mark_cp_function_context
PROTO((struct function
*));
207 static void mark_saved_scope
PROTO((void *));
209 #if defined (DEBUG_CP_BINDING_LEVELS)
210 static void indent
PROTO((void));
213 /* A node which has tree code ERROR_MARK, and whose type is itself.
214 All erroneous expressions are replaced with this node. All functions
215 that accept nodes as arguments should avoid generating error messages
216 if this node is one of the arguments, since it is undesirable to get
217 multiple error messages from one error in the input. */
219 tree error_mark_node
;
221 /* Erroneous argument lists can use this *IFF* they do not modify it. */
222 tree error_mark_list
;
224 /* The following symbols are subsumed in the cp_global_trees array, and
225 listed here individually for documentation purposes.
228 tree wchar_decl_node;
231 tree vtable_entry_type;
232 tree delta_type_node;
235 tree __baselist_desc_type_node;
236 tree __i_desc_type_node, __m_desc_type_node;
237 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
239 tree __t_desc_type_node;
241 tree __tp_desc_type_node;
243 tree __access_mode_type_node;
244 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
245 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
246 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
248 Not needed yet? May be needed one day?
249 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
250 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
251 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
254 tree class_star_type_node;
255 tree class_type_node, record_type_node, union_type_node, enum_type_node;
256 tree unknown_type_node;
258 Array type `vtable_entry_type[]'
261 tree vtbl_ptr_type_node;
267 A FUNCTION_DECL which can call `abort'. Not necessarily the
268 one that the user will declare, but sufficient to be called
269 by routines that want to abort the program.
273 The FUNCTION_DECL for the default `::operator delete'.
275 tree global_delete_fndecl;
278 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
282 tree cp_global_trees
[CPTI_MAX
];
284 /* These can't be part of the above array, since they are declared
285 individually in tree.h, and used by the debug output routines. */
289 tree integer_type_node
;
290 tree unsigned_type_node
;
292 /* These can't be part of the above array, since they are declared
293 individially in tree.h and used by the target routines. */
296 tree va_list_type_node
;
297 tree null_pointer_node
;
299 /* Indicates that there is a type value in some namespace, although
300 that is not necessarily in scope at the moment. */
302 static tree global_type_node
;
307 /* Expect only namespace names now. */
308 static int only_namespace_names
;
310 /* In a destructor, the last insn emitted after the start of the
311 function and the parms. */
313 #define last_dtor_insn cp_function_chain->x_last_dtor_insn
315 /* In a constructor, the last insn emitted after the start of the
316 function and the parms, the exception specification and any
317 function-try-block. The constructor initializers are emitted after
320 #define last_parm_cleanup_insn cp_function_chain->x_last_parm_cleanup_insn
322 /* If original DECL_RESULT of current function was a register,
323 but due to being an addressable named return value, would up
324 on the stack, this variable holds the named return value's
325 original location. */
327 #define original_result_rtx cp_function_chain->x_result_rtx
329 struct named_label_list
331 struct binding_level
*binding_level
;
334 const char *filename_o_goto
;
336 struct named_label_list
*next
;
339 /* A list (chain of TREE_LIST nodes) of named label uses.
340 The TREE_PURPOSE field is the list of variables defined
341 in the label's scope defined at the point of use.
342 The TREE_VALUE field is the LABEL_DECL used.
343 The TREE_TYPE field holds `current_binding_level' at the
344 point of the label's use.
346 BWAHAHAAHAHahhahahahaah. No, no, no, said the little chicken.
348 Look at the pretty struct named_label_list. See the pretty struct
349 with the pretty named fields that describe what they do. See the
350 pretty lack of gratuitous casts. Notice the code got a lot cleaner.
352 Used only for jumps to as-yet undefined labels, since
353 jumps to defined labels can have their validity checked
356 #define named_label_uses cp_function_chain->named_label_uses
358 /* A list of objects which have constructors or destructors
359 which reside in the global scope. The decl is stored in
360 the TREE_VALUE slot and the initializer is stored
361 in the TREE_PURPOSE slot. */
362 tree static_aggregates
;
366 /* An expression of type `int' for the constant zero. */
368 tree integer_zero_node
;
370 /* A node for the integer constants 1, 2, and 3. */
372 tree integer_one_node
, integer_two_node
, integer_three_node
;
374 /* While defining an enum type, this is 1 plus the last enumerator
377 static tree enum_next_value
;
379 /* Nonzero means that there was overflow computing enum_next_value. */
381 static int enum_overflow
;
383 /* Parsing a function declarator leaves here a chain of structure
384 and enum types declared in the parmlist. */
386 static tree last_function_parm_tags
;
388 /* Similar, for last_function_parm_tags. */
389 tree last_function_parms
;
390 static tree current_function_parm_tags
;
392 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
393 that have names. Here so we can clear out their names' definitions
394 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
395 TREE_PURPOSE is the previous binding of the label. */
397 #define named_labels cp_function_chain->x_named_labels
399 /* The FUNCTION_DECL for the function currently being compiled,
400 or 0 if between functions. */
401 tree current_function_decl
;
403 /* Set to 0 at beginning of a function definition, and whenever
404 a label (case or named) is defined. Set to value of expression
405 returned from function when that value can be transformed into
406 a named return value. */
408 tree current_function_return_value
;
410 /* Nonzero means give `double' the same size as `float'. */
412 extern int flag_short_double
;
414 /* Nonzero means don't recognize any builtin functions. */
416 extern int flag_no_builtin
;
418 /* Nonzero means don't recognize the non-ANSI builtin functions.
421 extern int flag_no_nonansi_builtin
;
423 /* Nonzero means enable obscure ANSI features and disable GNU extensions
424 that might cause ANSI-compliant code to be miscompiled. */
426 extern int flag_ansi
;
428 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
430 extern int flag_huge_objects
;
432 /* Nonzero if we want to conserve space in the .o files. We do this
433 by putting uninitialized data and runtime initialized data into
434 .common instead of .data at the expense of not flagging multiple
436 extern int flag_conserve_space
;
438 /* C and C++ flags are in decl2.c. */
440 /* Set to 0 at beginning of a constructor, set to 1
441 if that function does an allocation before referencing its
442 instance variable. */
443 #define current_function_assigns_this cp_function_chain->assigns_this
444 #define current_function_just_assigned_this \
445 cp_function_chain->just_assigned_this
447 /* Flag used when debugging spew.c */
449 extern int spew_debug
;
451 /* A expression of value 0 with the same precision as a sizetype
453 tree signed_size_zero_node
;
455 /* The name of the anonymous namespace, throughout this translation
457 tree anonymous_namespace_name
;
460 /* Allocate a level of searching. */
464 push_decl_level (stack
, obstack
)
465 struct stack_level
*stack
;
466 struct obstack
*obstack
;
468 struct stack_level tem
;
471 return push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
474 /* For each binding contour we allocate a binding_level structure
475 which records the names defined in that contour.
478 1) one for each function definition,
479 where internal declarations of the parameters appear.
480 2) one for each compound statement,
481 to record its declarations.
483 The current meaning of a name can be found by searching the levels
484 from the current one out to the global one.
486 Off to the side, may be the class_binding_level. This exists only
487 to catch class-local declarations. It is otherwise nonexistent.
489 Also there may be binding levels that catch cleanups that must be
490 run when exceptions occur. Thus, to see whether a name is bound in
491 the current scope, it is not enough to look in the
492 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
495 /* Note that the information in the `names' component of the global contour
496 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
500 /* A chain of _DECL nodes for all variables, constants, functions,
501 and typedef types. These are in the reverse of the order
502 supplied. There may be OVERLOADs on this list, too, but they
503 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
506 /* A list of structure, union and enum definitions, for looking up
508 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
509 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
510 or ENUMERAL_TYPE node.
512 C++: the TREE_VALUE nodes can be simple types for
513 component_bindings. */
516 /* A list of USING_DECL nodes. */
519 /* A list of used namespaces. PURPOSE is the namespace,
520 VALUE the common ancestor with this binding_level's namespace. */
521 tree using_directives
;
523 /* If this binding level is the binding level for a class, then
524 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
525 is the name of an entity bound in the class; the TREE_VALUE is
526 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
527 when leaving class scope, we can restore the
528 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
529 the DECL bound by this name in the class. */
532 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
533 is used for all binding levels. */
536 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
537 label in this scope. The TREE_PURPOSE is the previous value of
538 the IDENTIFIER_LABEL VALUE. */
539 tree shadowed_labels
;
541 /* For each level (except not the global one),
542 a chain of BLOCK nodes for all the levels
543 that were entered and exited one level down. */
546 /* The BLOCK node for this level, if one has been preallocated.
547 If 0, the BLOCK is allocated (if needed) when the level is popped. */
550 /* The binding level which this one is contained in (inherits from). */
551 struct binding_level
*level_chain
;
553 /* List of decls in `names' that have incomplete
554 structure or union types. */
557 /* List of VAR_DECLS saved from a previous for statement.
558 These would be dead in ANSI-conforming code, but might
559 be referenced in ARM-era code. These are stored in a
560 TREE_LIST; the TREE_VALUE is the actual declaration. */
561 tree dead_vars_from_for
;
563 /* 1 for the level that holds the parameters of a function.
564 2 for the level that holds a class declaration.
565 3 for levels that hold parameter declarations. */
566 unsigned parm_flag
: 4;
568 /* 1 means make a BLOCK for this level regardless of all else.
569 2 for temporary binding contours created by the compiler. */
572 /* Nonzero if this level "doesn't exist" for tags. */
573 unsigned tag_transparent
: 1;
575 /* Nonzero if this level can safely have additional
576 cleanup-needing variables added to it. */
577 unsigned more_cleanups_ok
: 1;
578 unsigned have_cleanups
: 1;
580 /* Nonzero if this level is for storing the decls for template
581 parameters and generic decls; these decls will be discarded and
582 replaced with a TEMPLATE_DECL. */
583 unsigned pseudo_global
: 1;
585 /* This is set for a namespace binding level. */
586 unsigned namespace_p
: 1;
588 /* True if this level is that of a for-statement where we need to
589 worry about ambiguous (ARM or ANSI) scope rules. */
590 unsigned is_for_scope
: 1;
592 /* True if this level corresponds to an EH region, as for a try block. */
593 unsigned eh_region
: 1;
595 /* One bit left for this word. */
597 #if defined(DEBUG_CP_BINDING_LEVELS)
598 /* Binding depth at which this level began. */
599 unsigned binding_depth
;
600 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
603 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
605 /* The binding level currently in effect. */
607 #define current_binding_level cp_function_chain->binding_level
609 /* The binding level of the current class, if any. */
611 #define class_binding_level scope_chain->class_bindings
613 /* A chain of binding_level structures awaiting reuse. */
615 static struct binding_level
*free_binding_level
;
617 /* The outermost binding level, for names of file scope.
618 This is created when the compiler is started and exists
619 through the entire run. */
621 static struct binding_level
*global_binding_level
;
623 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
625 static int keep_next_level_flag
;
627 #if defined(DEBUG_CP_BINDING_LEVELS)
628 static int binding_depth
= 0;
629 static int is_class_level
= 0;
636 for (i
= 0; i
< binding_depth
*2; i
++)
639 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
641 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
644 push_binding_level (newlevel
, tag_transparent
, keep
)
645 struct binding_level
*newlevel
;
646 int tag_transparent
, keep
;
648 /* Add this level to the front of the chain (stack) of levels that
650 bzero ((char*) newlevel
, sizeof (struct binding_level
));
651 newlevel
->level_chain
= current_binding_level
;
652 current_binding_level
= newlevel
;
653 newlevel
->tag_transparent
= tag_transparent
;
654 newlevel
->more_cleanups_ok
= 1;
656 /* We are called before expand_start_bindings, but after
657 expand_eh_region_start for a try block; so we check this now,
658 before the EH block is covered up. */
659 newlevel
->eh_region
= is_eh_region ();
661 newlevel
->keep
= keep
;
662 #if defined(DEBUG_CP_BINDING_LEVELS)
663 newlevel
->binding_depth
= binding_depth
;
665 fprintf (stderr
, "push %s level 0x%08x line %d\n",
666 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
669 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
672 /* Find the innermost enclosing class scope, and reset
673 CLASS_BINDING_LEVEL appropriately. */
676 find_class_binding_level ()
678 struct binding_level
*level
= current_binding_level
;
680 while (level
&& level
->parm_flag
!= 2)
681 level
= level
->level_chain
;
682 if (level
&& level
->parm_flag
== 2)
683 class_binding_level
= level
;
685 class_binding_level
= 0;
691 if (global_binding_level
)
693 /* Cannot pop a level, if there are none left to pop. */
694 if (current_binding_level
== global_binding_level
)
695 my_friendly_abort (123);
697 /* Pop the current level, and free the structure for reuse. */
698 #if defined(DEBUG_CP_BINDING_LEVELS)
701 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
702 (is_class_level
) ? "class" : "block",
703 current_binding_level
, lineno
);
704 if (is_class_level
!= (current_binding_level
== class_binding_level
))
707 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
710 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
712 register struct binding_level
*level
= current_binding_level
;
713 current_binding_level
= current_binding_level
->level_chain
;
714 level
->level_chain
= free_binding_level
;
715 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
716 if (level
->binding_depth
!= binding_depth
)
718 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
719 free_binding_level
= level
;
720 find_class_binding_level ();
725 suspend_binding_level ()
727 if (class_binding_level
)
728 current_binding_level
= class_binding_level
;
730 if (global_binding_level
)
732 /* Cannot suspend a level, if there are none left to suspend. */
733 if (current_binding_level
== global_binding_level
)
734 my_friendly_abort (123);
736 /* Suspend the current level. */
737 #if defined(DEBUG_CP_BINDING_LEVELS)
740 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
741 (is_class_level
) ? "class" : "block",
742 current_binding_level
, lineno
);
743 if (is_class_level
!= (current_binding_level
== class_binding_level
))
746 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
749 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
750 current_binding_level
= current_binding_level
->level_chain
;
751 find_class_binding_level ();
755 resume_binding_level (b
)
756 struct binding_level
*b
;
758 /* Resuming binding levels is meant only for namespaces,
759 and those cannot nest into classes. */
760 my_friendly_assert(!class_binding_level
, 386);
761 /* Also, resuming a non-directly nested namespace is a no-no. */
762 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
763 current_binding_level
= b
;
764 #if defined(DEBUG_CP_BINDING_LEVELS)
765 b
->binding_depth
= binding_depth
;
767 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
768 (is_class_level
) ? "class" : "block", b
, lineno
);
771 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
774 /* Create a new `struct binding_level'. */
777 struct binding_level
*
778 make_binding_level ()
781 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
784 /* Nonzero if we are currently in the global binding level. */
789 return current_binding_level
== global_binding_level
;
792 /* Return the innermost binding level that is not for a class scope. */
794 static struct binding_level
*
795 innermost_nonclass_level ()
797 struct binding_level
*b
;
799 b
= current_binding_level
;
800 while (b
->parm_flag
== 2)
806 /* Nonzero if we are currently in a toplevel binding level. This
807 means either the global binding level or a namespace in a toplevel
808 binding level. Since there are no non-toplevel namespace levels,
809 this really means any namespace or pseudo-global level. We also
810 include a class whose context is toplevel. */
813 toplevel_bindings_p ()
815 struct binding_level
*b
= innermost_nonclass_level ();
817 return b
->namespace_p
|| b
->pseudo_global
;
820 /* Nonzero if this is a namespace scope, or if we are defining a class
821 which is itself at namespace scope, or whose enclosing class is
822 such a class, etc. */
825 namespace_bindings_p ()
827 struct binding_level
*b
= innermost_nonclass_level ();
829 return b
->namespace_p
;
832 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
833 unconditionally. Otherwise, use the normal logic to decide whether
834 or not to create a BLOCK. */
837 keep_next_level (keep
)
840 keep_next_level_flag
= keep
;
843 /* Nonzero if the current level needs to have a BLOCK made. */
848 return (current_binding_level
->blocks
!= NULL_TREE
849 || current_binding_level
->keep
850 || current_binding_level
->names
!= NULL_TREE
851 || (current_binding_level
->tags
!= NULL_TREE
852 && !current_binding_level
->tag_transparent
));
855 /* Identify this binding level as a level of parameters. */
858 declare_parm_level ()
860 current_binding_level
->parm_flag
= 1;
864 declare_pseudo_global_level ()
866 current_binding_level
->pseudo_global
= 1;
870 declare_namespace_level ()
872 current_binding_level
->namespace_p
= 1;
876 pseudo_global_level_p ()
878 return current_binding_level
->pseudo_global
;
882 set_class_shadows (shadows
)
885 class_binding_level
->class_shadowed
= shadows
;
888 /* Enter a new binding level.
889 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
890 not for that of tags. */
893 pushlevel (tag_transparent
)
896 register struct binding_level
*newlevel
= NULL_BINDING_LEVEL
;
898 /* If this is the top level of a function,
899 just make sure that NAMED_LABELS is 0.
900 They should have been set to 0 at the end of the previous function. */
902 if (current_binding_level
== global_binding_level
)
903 my_friendly_assert (named_labels
== NULL_TREE
, 134);
905 /* Reuse or create a struct for this binding level. */
907 #if defined(DEBUG_CP_BINDING_LEVELS)
909 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
910 if (free_binding_level
)
911 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
913 newlevel
= free_binding_level
;
914 free_binding_level
= free_binding_level
->level_chain
;
917 newlevel
= make_binding_level ();
919 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
920 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
921 keep_next_level_flag
= 0;
925 note_level_for_for ()
927 current_binding_level
->is_for_scope
= 1;
931 pushlevel_temporary (tag_transparent
)
934 pushlevel (tag_transparent
);
935 current_binding_level
->keep
= 2;
938 /* Note we don't call push_momentary() here. Otherwise, it would cause
939 cleanups to be allocated on the momentary obstack, and they will be
940 overwritten by the next statement. */
942 expand_start_bindings (0);
945 /* For a binding between a name and an entity at a block scope,
946 this is the `struct binding_level' for the block. */
947 #define BINDING_LEVEL(NODE) \
948 (((struct tree_binding*)NODE)->scope.level)
950 /* Make DECL the innermost binding for ID. The LEVEL is the binding
951 level at which this declaration is being bound. */
954 push_binding (id
, decl
, level
)
957 struct binding_level
* level
;
961 binding
= make_node (CPLUS_BINDING
);
963 /* Now, fill in the binding information. */
964 BINDING_VALUE (binding
) = decl
;
965 BINDING_TYPE (binding
) = NULL_TREE
;
966 BINDING_LEVEL (binding
) = level
;
967 INHERITED_VALUE_BINDING_P (binding
) = 0;
968 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
969 BINDING_HAS_LEVEL_P (binding
) = 1;
971 /* And put it on the front of the list of bindings for ID. */
972 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
973 IDENTIFIER_BINDING (id
) = binding
;
976 /* ID is already bound in the current scope. But, DECL is an
977 additional binding for ID in the same scope. This is the `struct
978 stat' hack whereby a non-typedef class-name or enum-name can be
979 bound at the same level as some other kind of entity. It's the
980 responsibility of the caller to check that inserting this name is
981 legal here. Returns nonzero if the new binding was successful. */
983 add_binding (id
, decl
)
987 tree binding
= IDENTIFIER_BINDING (id
);
990 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
991 /* The new name is the type name. */
992 BINDING_TYPE (binding
) = decl
;
993 else if (!BINDING_VALUE (binding
))
994 /* This situation arises when push_class_level_binding moves an
995 inherited type-binding out of the way to make room for a new
997 BINDING_VALUE (binding
) = decl
;
998 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
999 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1001 /* The old binding was a type name. It was placed in
1002 BINDING_VALUE because it was thought, at the point it was
1003 declared, to be the only entity with such a name. Move the
1004 type name into the type slot; it is now hidden by the new
1006 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1007 BINDING_VALUE (binding
) = decl
;
1008 INHERITED_VALUE_BINDING_P (binding
) = 0;
1010 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1011 && TREE_CODE (decl
) == TYPE_DECL
1012 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1013 && same_type_p (TREE_TYPE (decl
),
1014 TREE_TYPE (BINDING_VALUE (binding
))))
1015 /* We have two typedef-names, both naming the same type to have
1016 the same name. This is OK because of:
1020 In a given scope, a typedef specifier can be used to redefine
1021 the name of any type declared in that scope to refer to the
1022 type to which it already refers. */
1026 cp_error ("declaration of `%#D'", decl
);
1027 cp_error_at ("conflicts with previous declaration `%#D'",
1028 BINDING_VALUE (binding
));
1035 /* Add DECL to the list of things declared in B. */
1038 add_decl_to_level (decl
, b
)
1040 struct binding_level
*b
;
1042 /* Only things that will live forever should go in the global
1044 my_friendly_assert (!(b
== global_binding_level
1045 && !TREE_PERMANENT (decl
)),
1048 /* We build up the list in reverse order, and reverse it later if
1050 TREE_CHAIN (decl
) = b
->names
;
1054 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1055 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1056 doesn't really belong to this binding level, that it got here
1057 through a using-declaration. */
1060 push_local_binding (id
, decl
, flags
)
1065 struct binding_level
*b
;
1067 /* Skip over any local classes. This makes sense if we call
1068 push_local_binding with a friend decl of a local class. */
1069 b
= current_binding_level
;
1070 while (b
->parm_flag
== 2)
1073 if (lookup_name_current_level (id
))
1075 /* Supplement the existing binding. */
1076 if (!add_binding (id
, decl
))
1077 /* It didn't work. Something else must be bound at this
1078 level. Do not add DECL to the list of things to pop
1083 /* Create a new binding. */
1084 push_binding (id
, decl
, b
);
1086 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1087 /* We must put the OVERLOAD into a TREE_LIST since the
1088 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1089 decls that got here through a using-declaration. */
1090 decl
= build_tree_list (NULL_TREE
, decl
);
1092 /* And put DECL on the list of things declared by the current
1094 add_decl_to_level (decl
, b
);
1097 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1098 binding was successful. */
1101 push_class_binding (id
, decl
)
1106 tree binding
= IDENTIFIER_BINDING (id
);
1109 /* Note that we declared this value so that we can issue an error if
1110 this an illegal redeclaration of a name already used for some
1112 note_name_declared_in_class (id
, decl
);
1114 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1115 /* Supplement the existing binding. */
1116 result
= add_binding (id
, decl
);
1118 /* Create a new binding. */
1119 push_binding (id
, decl
, class_binding_level
);
1121 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1122 class-level declaration. Note that we do not use DECL here
1123 because of the possibility of the `struct stat' hack; if DECL is
1124 a class-name or enum-name we might prefer a field-name, or some
1126 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1128 /* If this is a binding from a base class, mark it as such. */
1129 binding
= IDENTIFIER_BINDING (id
);
1130 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1132 /* Any implicit typename must be from a base-class. The
1133 context for an implicit typename declaration is always
1134 the derived class in which the lookup was done, so the checks
1135 based on the context of DECL below will not trigger. */
1136 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1137 INHERITED_VALUE_BINDING_P (binding
) = 1;
1140 if (TREE_CODE (decl
) == OVERLOAD
)
1141 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
1144 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1146 context
= DECL_REAL_CONTEXT (decl
);
1149 if (is_properly_derived_from (current_class_type
, context
))
1150 INHERITED_VALUE_BINDING_P (binding
) = 1;
1152 INHERITED_VALUE_BINDING_P (binding
) = 0;
1155 else if (BINDING_VALUE (binding
) == decl
)
1156 /* We only encounter a TREE_LIST when push_class_decls detects an
1157 ambiguity. Such an ambiguity can be overridden by a definition
1159 INHERITED_VALUE_BINDING_P (binding
) = 1;
1164 /* Remove the binding for DECL which should be the innermost binding
1168 pop_binding (id
, decl
)
1174 if (id
== NULL_TREE
)
1175 /* It's easiest to write the loops that call this function without
1176 checking whether or not the entities involved have names. We
1177 get here for such an entity. */
1180 /* Get the innermost binding for ID. */
1181 binding
= IDENTIFIER_BINDING (id
);
1183 /* The name should be bound. */
1184 my_friendly_assert (binding
!= NULL_TREE
, 0);
1186 /* The DECL will be either the ordinary binding or the type
1187 binding for this identifier. Remove that binding. */
1188 if (BINDING_VALUE (binding
) == decl
)
1189 BINDING_VALUE (binding
) = NULL_TREE
;
1190 else if (BINDING_TYPE (binding
) == decl
)
1191 BINDING_TYPE (binding
) = NULL_TREE
;
1193 my_friendly_abort (0);
1195 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1196 /* We're completely done with the innermost binding for this
1197 identifier. Unhook it from the list of bindings. */
1198 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1201 /* When a label goes out of scope, check to see if that label was used
1202 in a valid manner, and issue any appropriate warnings or errors. */
1208 tree label
= TREE_VALUE (link
);
1210 if (DECL_INITIAL (label
) == NULL_TREE
)
1212 cp_error_at ("label `%D' used but not defined", label
);
1213 /* Avoid crashing later. */
1214 define_label (input_filename
, 1, DECL_NAME (label
));
1216 else if (warn_unused
&& !TREE_USED (label
))
1217 cp_warning_at ("label `%D' defined but not used", label
);
1219 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1222 /* At the end of a function, all labels declared within the fucntion
1223 go out of scope. BLOCK is the top-level block for the
1232 /* Clear out the definitions of all label names, since their scopes
1234 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1237 /* Put the labels into the "variables" of the top-level block,
1238 so debugger can see them. */
1239 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1240 BLOCK_VARS (block
) = TREE_VALUE (link
);
1243 named_labels
= NULL_TREE
;
1246 /* Exit a binding level.
1247 Pop the level off, and restore the state of the identifier-decl mappings
1248 that were in effect when this level was entered.
1250 If KEEP == 1, this level had explicit declarations, so
1251 and create a "block" (a BLOCK node) for the level
1252 to record its declarations and subblocks for symbol table output.
1254 If FUNCTIONBODY is nonzero, this level is the body of a function,
1255 so create a block as if KEEP were set and also clear out all
1258 If REVERSE is nonzero, reverse the order of decls before putting
1259 them into the BLOCK. */
1262 poplevel (keep
, reverse
, functionbody
)
1268 /* The chain of decls was accumulated in reverse order.
1269 Put it into forward order, just for cleanliness. */
1271 int tmp
= functionbody
;
1272 int real_functionbody
= current_binding_level
->keep
== 2
1273 ? ((functionbody
= 0), tmp
) : functionbody
;
1274 tree tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1275 tree subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1276 tree block
= NULL_TREE
;
1278 int block_previously_created
;
1279 int leaving_for_scope
;
1281 if (current_binding_level
->parm_flag
== 2)
1282 return poplevel_class ();
1284 my_friendly_assert (!current_binding_level
->class_shadowed
,
1287 /* We used to use KEEP == 2 to indicate that the new block should go
1288 at the beginning of the list of blocks at this binding level,
1289 rather than the end. This hack is no longer used. */
1290 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1292 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1293 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1294 current_binding_level
->parm_flag
,
1295 current_binding_level
->keep
);
1297 if (current_binding_level
->keep
== 1)
1300 /* Get the decls in the order they were written.
1301 Usually current_binding_level->names is in reverse order.
1302 But parameter decls were previously put in forward order. */
1305 current_binding_level
->names
1306 = decls
= nreverse (current_binding_level
->names
);
1308 decls
= current_binding_level
->names
;
1310 /* Output any nested inline functions within this block
1311 if they weren't already output. */
1313 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1314 if (TREE_CODE (decl
) == FUNCTION_DECL
1315 && ! TREE_ASM_WRITTEN (decl
)
1316 && DECL_INITIAL (decl
) != NULL_TREE
1317 && TREE_ADDRESSABLE (decl
)
1318 && decl_function_context (decl
) == current_function_decl
)
1320 /* If this decl was copied from a file-scope decl
1321 on account of a block-scope extern decl,
1322 propagate TREE_ADDRESSABLE to the file-scope decl. */
1323 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1324 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1327 push_function_context ();
1328 output_inline_function (decl
);
1329 pop_function_context ();
1333 /* If there were any declarations or structure tags in that level,
1334 or if this level is a function body,
1335 create a BLOCK to record them for the life of this function. */
1338 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1339 if (block_previously_created
)
1340 block
= current_binding_level
->this_block
;
1341 else if (keep
== 1 || functionbody
)
1342 block
= make_node (BLOCK
);
1343 if (block
!= NULL_TREE
)
1345 if (block_previously_created
)
1347 if (decls
|| tags
|| subblocks
)
1349 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1350 warning ("internal compiler error: debugging info corrupted");
1352 BLOCK_VARS (block
) = decls
;
1353 BLOCK_TYPE_TAGS (block
) = tags
;
1355 /* We can have previous subblocks and new subblocks when
1356 doing fixup_gotos with complex cleanups. We chain the new
1357 subblocks onto the end of any pre-existing subblocks. */
1358 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1361 /* If we created the block earlier on, and we are just
1362 diddling it now, then it already should have a proper
1363 BLOCK_END_NOTE value associated with it. */
1367 BLOCK_VARS (block
) = decls
;
1368 BLOCK_TYPE_TAGS (block
) = tags
;
1369 BLOCK_SUBBLOCKS (block
) = subblocks
;
1370 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1372 remember_end_note (block
);
1376 /* In each subblock, record that this is its superior. */
1379 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1380 BLOCK_SUPERCONTEXT (link
) = block
;
1382 /* We still support the old for-scope rules, whereby the variables
1383 in a for-init statement were in scope after the for-statement
1384 ended. We only use the new rules in flag_new_for_scope is
1387 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1389 /* Remove declarations for all the DECLs in this level. */
1390 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1392 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1395 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1399 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1401 ns_binding
= NULL_TREE
;
1404 && (BINDING_LEVEL (outer_binding
)
1405 == current_binding_level
->level_chain
))
1406 /* We have something like:
1411 and we are leaving the `for' scope. There's no reason to
1412 keep the binding of the inner `i' in this case. */
1413 pop_binding (DECL_NAME (link
), link
);
1414 else if ((outer_binding
1415 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1418 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1419 /* Here, we have something like:
1427 We must pop the for-scope binding so we know what's a
1428 type and what isn't. */
1429 pop_binding (DECL_NAME (link
), link
);
1432 /* Mark this VAR_DECL as dead so that we can tell we left it
1433 there only for backward compatibility. */
1434 DECL_DEAD_FOR_LOCAL (link
) = 1;
1436 /* Keep track of what should of have happenned when we
1437 popped the binding. */
1438 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1439 DECL_SHADOWED_FOR_VAR (link
)
1440 = BINDING_VALUE (outer_binding
);
1442 /* Add it to the list of dead variables in the next
1443 outermost binding to that we can remove these when we
1444 leave that binding. */
1445 current_binding_level
->level_chain
->dead_vars_from_for
1446 = tree_cons (NULL_TREE
, link
,
1447 current_binding_level
->level_chain
->
1448 dead_vars_from_for
);
1450 /* Although we don't pop the CPLUS_BINDING, we do clear
1451 its BINDING_LEVEL since the level is going away now. */
1452 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1458 /* Remove the binding. */
1460 if (TREE_CODE (decl
) == TREE_LIST
)
1461 decl
= TREE_VALUE (decl
);
1462 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1463 pop_binding (DECL_NAME (decl
), decl
);
1464 else if (TREE_CODE (decl
) == OVERLOAD
)
1465 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1467 my_friendly_abort (0);
1471 /* Remove declarations for any `for' variables from inner scopes
1472 that we kept around. */
1473 for (link
= current_binding_level
->dead_vars_from_for
;
1474 link
; link
= TREE_CHAIN (link
))
1475 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1477 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1478 for (link
= current_binding_level
->type_shadowed
;
1479 link
; link
= TREE_CHAIN (link
))
1480 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1482 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1483 for (link
= current_binding_level
->shadowed_labels
;
1485 link
= TREE_CHAIN (link
))
1488 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1489 list if a `using' declaration put them there. The debugging
1490 back-ends won't understand OVERLOAD, so we remove them here.
1491 Because the BLOCK_VARS are (temporarily) shared with
1492 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1493 popped all the bindings. */
1498 for (d
= &BLOCK_VARS (block
); *d
; )
1500 if (TREE_CODE (*d
) == TREE_LIST
)
1501 *d
= TREE_CHAIN (*d
);
1503 d
= &TREE_CHAIN (*d
);
1507 /* If the level being exited is the top level of a function,
1508 check over all the labels. */
1511 /* Since this is the top level block of a function, the vars are
1512 the function's parameters. Don't leave them in the BLOCK
1513 because they are found in the FUNCTION_DECL instead. */
1514 BLOCK_VARS (block
) = 0;
1518 /* Any uses of undefined labels now operate under constraints
1519 of next binding contour. */
1521 struct binding_level
*level_chain
;
1522 level_chain
= current_binding_level
->level_chain
;
1525 struct named_label_list
*labels
;
1526 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1527 if (labels
->binding_level
== current_binding_level
)
1529 labels
->binding_level
= level_chain
;
1530 labels
->names_in_scope
= level_chain
->names
;
1535 tmp
= current_binding_level
->keep
;
1537 pop_binding_level ();
1539 DECL_INITIAL (current_function_decl
) = block
;
1542 if (!block_previously_created
)
1543 current_binding_level
->blocks
1544 = chainon (current_binding_level
->blocks
, block
);
1546 /* If we did not make a block for the level just exited,
1547 any blocks made for inner levels
1548 (since they cannot be recorded as subblocks in that level)
1549 must be carried forward so they will later become subblocks
1550 of something else. */
1552 current_binding_level
->blocks
1553 = chainon (current_binding_level
->blocks
, subblocks
);
1555 /* Take care of compiler's internal binding structures. */
1558 expand_end_bindings (getdecls (), keep
, 1);
1559 /* Each and every BLOCK node created here in `poplevel' is important
1560 (e.g. for proper debugging information) so if we created one
1561 earlier, mark it as "used". */
1563 TREE_USED (block
) = 1;
1564 block
= poplevel (keep
, reverse
, real_functionbody
);
1567 /* Each and every BLOCK node created here in `poplevel' is important
1568 (e.g. for proper debugging information) so if we created one
1569 earlier, mark it as "used". */
1571 TREE_USED (block
) = 1;
1575 /* Delete the node BLOCK from the current binding level.
1576 This is used for the block inside a stmt expr ({...})
1577 so that the block can be reinserted where appropriate. */
1580 delete_block (block
)
1584 if (current_binding_level
->blocks
== block
)
1585 current_binding_level
->blocks
= TREE_CHAIN (block
);
1586 for (t
= current_binding_level
->blocks
; t
;)
1588 if (TREE_CHAIN (t
) == block
)
1589 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1593 TREE_CHAIN (block
) = NULL_TREE
;
1594 /* Clear TREE_USED which is always set by poplevel.
1595 The flag is set again if insert_block is called. */
1596 TREE_USED (block
) = 0;
1599 /* Insert BLOCK at the end of the list of subblocks of the
1600 current binding level. This is used when a BIND_EXPR is expanded,
1601 to handle the BLOCK node inside the BIND_EXPR. */
1604 insert_block (block
)
1607 TREE_USED (block
) = 1;
1608 current_binding_level
->blocks
1609 = chainon (current_binding_level
->blocks
, block
);
1612 /* Set the BLOCK node for the innermost scope
1613 (the one we are currently in). */
1617 register tree block
;
1619 current_binding_level
->this_block
= block
;
1622 /* Do a pushlevel for class declarations. */
1627 register struct binding_level
*newlevel
;
1629 /* Reuse or create a struct for this binding level. */
1630 #if defined(DEBUG_CP_BINDING_LEVELS)
1632 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1633 if (free_binding_level
)
1634 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1636 newlevel
= free_binding_level
;
1637 free_binding_level
= free_binding_level
->level_chain
;
1640 newlevel
= make_binding_level ();
1642 #if defined(DEBUG_CP_BINDING_LEVELS)
1644 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1646 push_binding_level (newlevel
, 0, 0);
1648 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1649 class_binding_level
= current_binding_level
;
1650 class_binding_level
->parm_flag
= 2;
1653 /* ...and a poplevel for class declarations. */
1658 register struct binding_level
*level
= class_binding_level
;
1661 my_friendly_assert (level
!= 0, 354);
1663 decl_stack
= pop_stack_level (decl_stack
);
1664 /* If we're leaving a toplevel class, don't bother to do the setting
1665 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1666 shouldn't even be used when current_class_type isn't set, and second,
1667 if we don't touch it here, we're able to use the cache effect if the
1668 next time we're entering a class scope, it is the same class. */
1669 if (current_class_depth
!= 1)
1671 struct binding_level
* b
;
1673 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1674 for (shadowed
= level
->class_shadowed
;
1676 shadowed
= TREE_CHAIN (shadowed
))
1677 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1679 /* Find the next enclosing class, and recreate
1680 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1681 b
= level
->level_chain
;
1682 while (b
&& b
->parm_flag
!= 2)
1686 for (shadowed
= b
->class_shadowed
;
1688 shadowed
= TREE_CHAIN (shadowed
))
1692 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1693 while (t
&& BINDING_LEVEL (t
) != b
)
1697 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1698 = BINDING_VALUE (t
);
1702 /* Remember to save what IDENTIFIER's were bound in this scope so we
1703 can recover from cache misses. */
1705 previous_class_type
= current_class_type
;
1706 previous_class_values
= class_binding_level
->class_shadowed
;
1708 for (shadowed
= level
->type_shadowed
;
1710 shadowed
= TREE_CHAIN (shadowed
))
1711 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1713 /* Remove the bindings for all of the class-level declarations. */
1714 for (shadowed
= level
->class_shadowed
;
1716 shadowed
= TREE_CHAIN (shadowed
))
1717 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1719 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1720 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1721 class_binding_level
->parm_flag
,
1722 class_binding_level
->keep
);
1724 /* Now, pop out of the binding level which we created up in the
1725 `pushlevel_class' routine. */
1726 #if defined(DEBUG_CP_BINDING_LEVELS)
1728 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1730 pop_binding_level ();
1735 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1736 for any names in enclosing classes. */
1739 clear_identifier_class_values ()
1743 if (!class_binding_level
)
1746 for (t
= class_binding_level
->class_shadowed
;
1749 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1752 /* Returns non-zero if T is a virtual function table. */
1755 vtable_decl_p (t
, data
)
1757 void *data ATTRIBUTE_UNUSED
;
1759 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1762 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1766 vtype_decl_p (t
, data
)
1768 void *data ATTRIBUTE_UNUSED
;
1770 return (TREE_CODE (t
) == TYPE_DECL
1771 && TREE_TYPE (t
) != error_mark_node
1772 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1773 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1776 /* Return the declarations that are members of the namespace NS. */
1779 cp_namespace_decls (ns
)
1782 return NAMESPACE_LEVEL (ns
)->names
;
1785 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1786 itself, calling F for each. The DATA is passed to F as well. */
1789 walk_namespaces_r (namespace, f
, data
)
1791 walk_namespaces_fn f
;
1797 result
|= (*f
) (namespace, data
);
1799 for (current
= cp_namespace_decls (namespace);
1801 current
= TREE_CHAIN (current
))
1803 if (TREE_CODE (current
) != NAMESPACE_DECL
1804 || DECL_NAMESPACE_ALIAS (current
))
1806 if (!DECL_LANG_SPECIFIC (current
))
1809 my_friendly_assert (current
== std_node
, 393);
1813 /* We found a namespace. */
1814 result
|= walk_namespaces_r (current
, f
, data
);
1820 /* Walk all the namespaces, calling F for each. The DATA is passed to
1824 walk_namespaces (f
, data
)
1825 walk_namespaces_fn f
;
1828 return walk_namespaces_r (global_namespace
, f
, data
);
1831 struct walk_globals_data
{
1832 walk_globals_pred p
;
1837 /* Walk the global declarations in NAMESPACE. Whenever one is found
1838 for which P returns non-zero, call F with its address. If any call
1839 to F returns a non-zero value, return a non-zero value. */
1842 walk_globals_r (namespace, data
)
1846 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1847 walk_globals_pred p
= wgd
->p
;
1848 walk_globals_fn f
= wgd
->f
;
1849 void *d
= wgd
->data
;
1853 t
= &NAMESPACE_LEVEL (namespace)->names
;
1860 result
|= (*f
) (t
, d
);
1862 /* If F changed *T, then *T still points at the next item to
1865 t
= &TREE_CHAIN (*t
);
1871 /* Walk the global declarations. Whenever one is found for which P
1872 returns non-zero, call F with its address. If any call to F
1873 returns a non-zero value, return a non-zero value. */
1876 walk_globals (p
, f
, data
)
1877 walk_globals_pred p
;
1881 struct walk_globals_data wgd
;
1886 return walk_namespaces (walk_globals_r
, &wgd
);
1889 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1890 DATA is non-NULL, this is the last time we will call
1891 wrapup_global_declarations for this NAMESPACE. */
1894 wrapup_globals_for_namespace (namespace, data
)
1898 tree globals
= cp_namespace_decls (namespace);
1899 int len
= list_length (globals
);
1900 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1904 int last_time
= (data
!= 0);
1906 if (last_time
&& namespace == global_namespace
)
1907 /* Let compile_file handle the global namespace. */
1910 /* Process the decls in reverse order--earliest first.
1911 Put them into VEC from back to front, then take out from front. */
1913 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1914 vec
[len
- i
- 1] = decl
;
1918 check_global_declarations (vec
, len
);
1922 /* Temporarily mark vtables as external. That prevents
1923 wrapup_global_declarations from writing them out; we must process
1924 them ourselves in finish_vtable_vardecl. */
1925 for (i
= 0; i
< len
; ++i
)
1926 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1928 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1929 DECL_EXTERNAL (vec
[i
]) = 1;
1932 /* Write out any globals that need to be output. */
1933 result
= wrapup_global_declarations (vec
, len
);
1935 /* Undo the hack to DECL_EXTERNAL above. */
1936 for (i
= 0; i
< len
; ++i
)
1937 if (vtable_decl_p (vec
[i
], /*data=*/0)
1938 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1940 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1941 DECL_EXTERNAL (vec
[i
]) = 0;
1948 /* Mark ARG (which is really a struct binding_level **) for GC. */
1951 mark_binding_level (arg
)
1954 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1958 ggc_mark_tree (lvl
->names
);
1959 ggc_mark_tree (lvl
->tags
);
1960 ggc_mark_tree (lvl
->usings
);
1961 ggc_mark_tree (lvl
->using_directives
);
1962 ggc_mark_tree (lvl
->class_shadowed
);
1963 ggc_mark_tree (lvl
->type_shadowed
);
1964 ggc_mark_tree (lvl
->shadowed_labels
);
1965 ggc_mark_tree (lvl
->blocks
);
1966 ggc_mark_tree (lvl
->this_block
);
1967 ggc_mark_tree (lvl
->incomplete
);
1968 ggc_mark_tree (lvl
->dead_vars_from_for
);
1970 lvl
= lvl
->level_chain
;
1974 /* For debugging. */
1975 static int no_print_functions
= 0;
1976 static int no_print_builtins
= 0;
1979 print_binding_level (lvl
)
1980 struct binding_level
*lvl
;
1984 fprintf (stderr
, " blocks=");
1985 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1986 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1987 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1988 if (lvl
->tag_transparent
)
1989 fprintf (stderr
, " tag-transparent");
1990 if (lvl
->more_cleanups_ok
)
1991 fprintf (stderr
, " more-cleanups-ok");
1992 if (lvl
->have_cleanups
)
1993 fprintf (stderr
, " have-cleanups");
1994 fprintf (stderr
, "\n");
1997 fprintf (stderr
, " names:\t");
1998 /* We can probably fit 3 names to a line? */
1999 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2001 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2003 if (no_print_builtins
2004 && (TREE_CODE (t
) == TYPE_DECL
)
2005 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2008 /* Function decls tend to have longer names. */
2009 if (TREE_CODE (t
) == FUNCTION_DECL
)
2016 fprintf (stderr
, "\n\t");
2019 print_node_brief (stderr
, "", t
, 0);
2020 if (t
== error_mark_node
)
2024 fprintf (stderr
, "\n");
2028 fprintf (stderr
, " tags:\t");
2030 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2032 if (TREE_PURPOSE (t
) == NULL_TREE
)
2034 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2041 fprintf (stderr
, "\n\t");
2044 if (TREE_PURPOSE (t
) == NULL_TREE
)
2046 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2047 fprintf (stderr
, ">");
2049 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2050 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2053 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2054 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2055 fprintf (stderr
, ">");
2059 fprintf (stderr
, "\n");
2061 if (lvl
->class_shadowed
)
2063 fprintf (stderr
, " class-shadowed:");
2064 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2066 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2068 fprintf (stderr
, "\n");
2070 if (lvl
->type_shadowed
)
2072 fprintf (stderr
, " type-shadowed:");
2073 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2075 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2077 fprintf (stderr
, "\n");
2082 print_other_binding_stack (stack
)
2083 struct binding_level
*stack
;
2085 struct binding_level
*level
;
2086 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2088 fprintf (stderr
, "binding level ");
2089 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2090 fprintf (stderr
, "\n");
2091 print_binding_level (level
);
2096 print_binding_stack ()
2098 struct binding_level
*b
;
2099 fprintf (stderr
, "current_binding_level=");
2100 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2101 fprintf (stderr
, "\nclass_binding_level=");
2102 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2103 fprintf (stderr
, "\nglobal_binding_level=");
2104 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2105 fprintf (stderr
, "\n");
2106 if (class_binding_level
)
2108 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2109 if (b
== current_binding_level
)
2112 b
= class_binding_level
;
2114 b
= current_binding_level
;
2117 b
= current_binding_level
;
2118 print_other_binding_stack (b
);
2119 fprintf (stderr
, "global:\n");
2120 print_binding_level (global_binding_level
);
2123 /* Namespace binding access routines: The namespace_bindings field of
2124 the identifier is polymorphic, with three possible values:
2125 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2126 indicating the BINDING_VALUE of global_namespace. */
2128 /* Check whether the a binding for the name to scope is known.
2129 Assumes that the bindings of the name are already a list
2130 of bindings. Returns the binding found, or NULL_TREE. */
2133 find_binding (name
, scope
)
2137 tree iter
, prev
= NULL_TREE
;
2139 scope
= ORIGINAL_NAMESPACE (scope
);
2141 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2142 iter
= TREE_CHAIN (iter
))
2144 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2145 if (BINDING_SCOPE (iter
) == scope
)
2147 /* Move binding found to the front of the list, so
2148 subsequent lookups will find it faster. */
2151 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2152 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2153 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2162 /* Always returns a binding for name in scope. If the
2163 namespace_bindings is not a list, convert it to one first.
2164 If no binding is found, make a new one. */
2167 binding_for_name (name
, scope
)
2171 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2174 scope
= ORIGINAL_NAMESPACE (scope
);
2176 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2178 /* Get rid of optimization for global scope. */
2179 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2180 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2181 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2183 if (b
&& (result
= find_binding (name
, scope
)))
2185 /* Not found, make a new permanent one. */
2186 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2187 result
= make_node (CPLUS_BINDING
);
2188 TREE_CHAIN (result
) = b
;
2189 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2190 BINDING_SCOPE (result
) = scope
;
2191 BINDING_TYPE (result
) = NULL_TREE
;
2192 BINDING_VALUE (result
) = NULL_TREE
;
2197 /* Return the binding value for name in scope, considering that
2198 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2201 namespace_binding (name
, scope
)
2205 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2208 if (scope
== NULL_TREE
)
2209 scope
= global_namespace
;
2210 if (TREE_CODE (b
) != CPLUS_BINDING
)
2211 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2212 name
= find_binding (name
,scope
);
2213 if (name
== NULL_TREE
)
2215 return BINDING_VALUE (name
);
2218 /* Set the binding value for name in scope. If modifying the binding
2219 of global_namespace is attempted, try to optimize it. */
2222 set_namespace_binding (name
, scope
, val
)
2229 if (scope
== NULL_TREE
)
2230 scope
= global_namespace
;
2232 if (scope
== global_namespace
)
2234 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2235 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2237 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2241 b
= binding_for_name (name
, scope
);
2242 BINDING_VALUE (b
) = val
;
2245 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2246 select a name that is unique to this compilation unit. */
2249 push_namespace (name
)
2254 int implicit_use
= 0;
2256 if (!global_namespace
)
2258 /* This must be ::. */
2259 my_friendly_assert (name
== get_identifier ("::"), 377);
2264 /* The name of anonymous namespace is unique for the translation
2266 if (!anonymous_namespace_name
)
2267 anonymous_namespace_name
= get_file_function_name ('N');
2268 name
= anonymous_namespace_name
;
2269 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2271 /* Reopening anonymous namespace. */
2275 else if (current_namespace
== global_namespace
2276 && name
== DECL_NAME (std_node
))
2283 /* Check whether this is an extended namespace definition. */
2284 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2285 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2288 if (DECL_NAMESPACE_ALIAS (d
))
2290 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2291 d
, DECL_NAMESPACE_ALIAS (d
));
2292 d
= DECL_NAMESPACE_ALIAS (d
);
2299 /* Make a new namespace, binding the name to it. */
2300 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2301 /* The global namespace is not pushed, and the global binding
2302 level is set elsewhere. */
2307 declare_namespace_level ();
2308 NAMESPACE_LEVEL (d
) = current_binding_level
;
2312 resume_binding_level (NAMESPACE_LEVEL (d
));
2315 do_using_directive (d
);
2316 /* Enter the name space. */
2317 current_namespace
= d
;
2320 /* Pop from the scope of the current namespace. */
2325 if (current_namespace
== global_namespace
)
2327 my_friendly_assert (in_std
>0, 980421);
2331 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2332 /* The binding level is not popped, as it might be re-opened later. */
2333 suspend_binding_level ();
2336 /* Push into the scope of the namespace NS, even if it is deeply
2337 nested within another namespace. */
2340 push_nested_namespace (ns
)
2343 if (ns
== global_namespace
)
2344 push_to_top_level ();
2347 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2348 push_namespace (DECL_NAME (ns
));
2352 /* Pop back from the scope of the namespace NS, which was previously
2353 entered with push_nested_namespace. */
2356 pop_nested_namespace (ns
)
2359 while (ns
!= global_namespace
)
2362 ns
= CP_DECL_CONTEXT (ns
);
2365 pop_from_top_level ();
2369 /* Subroutines for reverting temporarily to top-level for instantiation
2370 of templates and such. We actually need to clear out the class- and
2371 local-value slots of all identifiers, so that only the global values
2372 are at all visible. Simply setting current_binding_level to the global
2373 scope isn't enough, because more binding levels may be pushed. */
2374 struct saved_scope
*scope_chain
;
2376 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2379 mark_saved_scope (arg
)
2382 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2385 mark_binding_level (&t
->class_bindings
);
2386 ggc_mark_tree (t
->old_bindings
);
2387 ggc_mark_tree (t
->old_namespace
);
2388 ggc_mark_tree (t
->class_name
);
2389 ggc_mark_tree (t
->class_type
);
2390 ggc_mark_tree (t
->access_specifier
);
2392 ggc_mark_tree_varray (t
->lang_base
);
2393 ggc_mark_tree (t
->lang_name
);
2394 ggc_mark_tree (t
->x_function_parms
);
2395 ggc_mark_tree (t
->template_parms
);
2396 ggc_mark_tree (t
->x_previous_class_type
);
2397 ggc_mark_tree (t
->x_previous_class_values
);
2403 store_bindings (names
, old_bindings
)
2404 tree names
, old_bindings
;
2407 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2409 tree binding
, t1
, id
;
2411 if (TREE_CODE (t
) == TREE_LIST
)
2412 id
= TREE_PURPOSE (t
);
2417 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2418 we have no IDENTIFIER_BINDING if we have left the class
2419 scope, but cached the class-level declarations. */
2420 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2423 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2424 if (TREE_VEC_ELT (t1
, 0) == id
)
2427 binding
= make_tree_vec (4);
2431 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2432 TREE_VEC_ELT (binding
, 0) = id
;
2433 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2434 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2435 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2436 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2437 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2439 TREE_CHAIN (binding
) = old_bindings
;
2440 old_bindings
= binding
;
2444 return old_bindings
;
2448 maybe_push_to_top_level (pseudo
)
2451 struct saved_scope
*s
2452 = (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2453 struct binding_level
*b
;
2454 tree old_bindings
= NULL_TREE
;
2456 b
= scope_chain
? current_binding_level
: 0;
2458 push_function_context_to (NULL_TREE
);
2460 if (scope_chain
&& previous_class_type
)
2461 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2463 /* Have to include global_binding_level, because class-level decls
2464 aren't listed anywhere useful. */
2465 for (; b
; b
= b
->level_chain
)
2469 /* Template IDs are inserted into the global level. If they were
2470 inserted into namespace level, finish_file wouldn't find them
2471 when doing pending instantiations. Therefore, don't stop at
2472 namespace level, but continue until :: . */
2473 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2476 old_bindings
= store_bindings (b
->names
, old_bindings
);
2477 /* We also need to check class_shadowed to save class-level type
2478 bindings, since pushclass doesn't fill in b->names. */
2479 if (b
->parm_flag
== 2)
2480 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2482 /* Unwind type-value slots back to top level. */
2483 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2484 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2486 current_binding_level
= b
;
2488 s
->prev
= scope_chain
;
2489 s
->old_bindings
= old_bindings
;
2492 current_function_decl
= NULL_TREE
;
2493 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2494 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2495 current_lang_name
= lang_name_cplusplus
;
2496 strict_prototype
= strict_prototypes_lang_cplusplus
;
2497 named_labels
= NULL_TREE
;
2498 current_namespace
= global_namespace
;
2500 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2504 push_to_top_level ()
2506 maybe_push_to_top_level (0);
2510 pop_from_top_level ()
2512 struct saved_scope
*s
= scope_chain
;
2515 /* Clear out class-level bindings cache. */
2516 if (previous_class_type
)
2517 invalidate_class_lookup_cache ();
2521 VARRAY_FREE (current_lang_base
);
2523 scope_chain
= s
->prev
;
2524 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2526 tree id
= TREE_VEC_ELT (t
, 0);
2529 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2530 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2531 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2535 if (current_lang_name
== lang_name_cplusplus
)
2536 strict_prototype
= strict_prototypes_lang_cplusplus
;
2537 else if (current_lang_name
== lang_name_c
)
2538 strict_prototype
= strict_prototypes_lang_c
;
2542 pop_function_context_from (NULL_TREE
);
2545 /* Push a definition of struct, union or enum tag "name".
2546 into binding_level "b". "type" should be the type node,
2547 We assume that the tag "name" is not already defined.
2549 Note that the definition may really be just a forward reference.
2550 In that case, the TYPE_SIZE will be a NULL_TREE.
2552 C++ gratuitously puts all these tags in the name space. */
2554 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2555 record the shadowed value for this binding contour. TYPE is
2556 the type that ID maps to. */
2559 set_identifier_type_value_with_scope (id
, type
, b
)
2562 struct binding_level
*b
;
2564 if (!b
->namespace_p
)
2566 /* Shadow the marker, not the real thing, so that the marker
2567 gets restored later. */
2568 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2570 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2574 tree binding
= binding_for_name (id
, current_namespace
);
2575 BINDING_TYPE (binding
) = type
;
2576 /* Store marker instead of real type. */
2577 type
= global_type_node
;
2579 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2582 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2585 set_identifier_type_value (id
, type
)
2589 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2592 /* Return the type associated with id. */
2595 identifier_type_value (id
)
2598 /* There is no type with that name, anywhere. */
2599 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2601 /* This is not the type marker, but the real thing. */
2602 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2603 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2604 /* Have to search for it. It must be on the global level, now.
2605 Ask lookup_name not to return non-types. */
2606 id
= lookup_name_real (id
, 2, 1, 0);
2608 return TREE_TYPE (id
);
2612 /* Pop off extraneous binding levels left over due to syntax errors.
2614 We don't pop past namespaces, as they might be valid. */
2619 #ifdef DEBUG_CP_BINDING_LEVELS
2620 fprintf (stderr
, "XXX entering pop_everything ()\n");
2622 while (!toplevel_bindings_p ())
2624 if (current_binding_level
->parm_flag
== 2)
2625 pop_nested_class ();
2629 #ifdef DEBUG_CP_BINDING_LEVELS
2630 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2634 /* The type TYPE is being declared. If it is a class template, or a
2635 specialization of a class template, do any processing required and
2636 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2637 being declared a friend. B is the binding level at which this TYPE
2640 Returns the TYPE_DECL for TYPE, which may have been altered by this
2644 maybe_process_template_type_declaration (type
, globalize
, b
)
2647 struct binding_level
* b
;
2649 tree decl
= TYPE_NAME (type
);
2651 if (processing_template_parmlist
)
2652 /* You can't declare a new template type in a template parameter
2653 list. But, you can declare a non-template type:
2655 template <class A*> struct S;
2657 is a forward-declaration of `A'. */
2661 maybe_check_template_type (type
);
2663 my_friendly_assert (IS_AGGR_TYPE (type
)
2664 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2667 if (processing_template_decl
)
2669 /* This may change after the call to
2670 push_template_decl_real, but we want the original value. */
2671 tree name
= DECL_NAME (decl
);
2673 decl
= push_template_decl_real (decl
, globalize
);
2674 /* If the current binding level is the binding level for the
2675 template parameters (see the comment in
2676 begin_template_parm_list) and the enclosing level is a class
2677 scope, and we're not looking at a friend, push the
2678 declaration of the member class into the class scope. In the
2679 friend case, push_template_decl will already have put the
2680 friend into global scope, if appropriate. */
2681 if (TREE_CODE (type
) != ENUMERAL_TYPE
2682 && !globalize
&& b
->pseudo_global
2683 && b
->level_chain
->parm_flag
== 2)
2685 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2686 /* Put this tag on the list of tags for the class, since
2687 that won't happen below because B is not the class
2688 binding level, but is instead the pseudo-global level. */
2689 b
->level_chain
->tags
=
2690 tree_cons (name
, type
, b
->level_chain
->tags
);
2691 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2692 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2700 /* In C++, you don't have to write `struct S' to refer to `S'; you
2701 can just use `S'. We accomplish this by creating a TYPE_DECL as
2702 if the user had written `typedef struct S S'. Create and return
2703 the TYPE_DECL for TYPE. */
2706 create_implicit_typedef (name
, type
)
2712 decl
= build_decl (TYPE_DECL
, name
, type
);
2713 SET_DECL_ARTIFICIAL (decl
);
2714 /* There are other implicit type declarations, like the one *within*
2715 a class that allows you to write `S::S'. We must distinguish
2717 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2718 TYPE_NAME (type
) = decl
;
2723 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2724 Normally put it into the inner-most non-tag-transparent scope,
2725 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2726 The latter is needed for implicit declarations. */
2729 pushtag (name
, type
, globalize
)
2733 register struct binding_level
*b
;
2735 b
= current_binding_level
;
2736 while (b
->tag_transparent
2737 || (globalize
&& b
->parm_flag
== 2))
2740 b
->tags
= tree_cons (name
, type
, b
->tags
);
2744 /* Do C++ gratuitous typedefing. */
2745 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2747 register tree d
= NULL_TREE
;
2749 tree context
= TYPE_CONTEXT (type
);
2753 tree cs
= current_scope ();
2757 else if (cs
!= NULL_TREE
2758 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2759 /* When declaring a friend class of a local class, we want
2760 to inject the newly named class into the scope
2761 containing the local class, not the namespace scope. */
2762 context
= hack_decl_function_context (get_type_decl (cs
));
2765 context
= current_namespace
;
2767 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2768 || b
->parm_flag
== 2)
2771 if (current_lang_name
== lang_name_java
)
2772 TYPE_FOR_JAVA (type
) = 1;
2774 d
= create_implicit_typedef (name
, type
);
2775 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2777 set_identifier_type_value_with_scope (name
, type
, b
);
2779 d
= maybe_process_template_type_declaration (type
,
2782 if (b
->parm_flag
== 2)
2784 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2785 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2786 class. But if it's a member template class, we
2787 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2789 finish_member_declaration (d
);
2791 pushdecl_class_level (d
);
2794 d
= pushdecl_with_scope (d
, b
);
2796 if (ANON_AGGRNAME_P (name
))
2797 DECL_IGNORED_P (d
) = 1;
2799 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2800 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2801 if (!uses_template_parms (type
))
2802 DECL_ASSEMBLER_NAME (d
)
2803 = get_identifier (build_overload_name (type
, 1, 1));
2805 if (b
->parm_flag
== 2)
2807 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2808 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2812 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2813 /* Use the canonical TYPE_DECL for this node. */
2814 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2817 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2818 will be the tagged type we just added to the current
2819 binding level. This fake NULL-named TYPE_DECL node helps
2820 dwarfout.c to know when it needs to output a
2821 representation of a tagged type, and it also gives us a
2822 convenient place to record the "scope start" address for
2825 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2826 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2830 /* Counter used to create anonymous type names. */
2832 static int anon_cnt
= 0;
2834 /* Return an IDENTIFIER which can be used as a name for
2835 anonymous structs and unions. */
2842 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2843 return get_identifier (buf
);
2846 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2847 This keeps dbxout from getting confused. */
2852 register struct binding_level
*b
;
2854 static int last_cnt
= 0;
2856 /* Fast out if no new anon names were declared. */
2857 if (last_cnt
== anon_cnt
)
2860 b
= current_binding_level
;
2861 while (b
->tag_transparent
)
2866 /* A NULL purpose means we have already processed all tags
2867 from here to the end of the list. */
2868 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2870 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2871 TREE_PURPOSE (tags
) = NULL_TREE
;
2872 tags
= TREE_CHAIN (tags
);
2874 last_cnt
= anon_cnt
;
2877 /* Subroutine of duplicate_decls: return truthvalue of whether
2878 or not types of these decls match.
2880 For C++, we must compare the parameter list so that `int' can match
2881 `int&' in a parameter position, but `int&' is not confused with
2885 decls_match (newdecl
, olddecl
)
2886 tree newdecl
, olddecl
;
2890 if (newdecl
== olddecl
)
2893 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2894 /* If the two DECLs are not even the same kind of thing, we're not
2895 interested in their types. */
2898 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2900 tree f1
= TREE_TYPE (newdecl
);
2901 tree f2
= TREE_TYPE (olddecl
);
2902 tree p1
= TYPE_ARG_TYPES (f1
);
2903 tree p2
= TYPE_ARG_TYPES (f2
);
2905 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2906 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2907 && DECL_LANGUAGE (olddecl
) == lang_c
))
2910 /* When we parse a static member function definition,
2911 we put together a FUNCTION_DECL which thinks its type
2912 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2914 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2915 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2916 else if (TREE_CODE (f2
) == METHOD_TYPE
2917 && DECL_STATIC_FUNCTION_P (newdecl
))
2918 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2920 /* Here we must take care of the case where new default
2921 parameters are specified. Also, warn if an old
2922 declaration becomes ambiguous because default
2923 parameters may cause the two to be ambiguous. */
2924 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2926 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2927 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2929 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2933 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2935 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2938 types_match
= self_promoting_args_p (p1
);
2939 if (p1
== void_list_node
)
2940 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2942 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2943 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2945 types_match
= self_promoting_args_p (p2
);
2946 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2949 types_match
= compparms (p1
, p2
);
2954 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2956 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2957 DECL_TEMPLATE_PARMS (olddecl
)))
2960 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2963 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2964 DECL_TEMPLATE_RESULT (newdecl
));
2968 if (TREE_TYPE (newdecl
) == error_mark_node
)
2969 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2970 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2971 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2972 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2975 types_match
= comptypes (TREE_TYPE (newdecl
),
2976 TREE_TYPE (olddecl
),
2977 COMPARE_REDECLARATION
);
2983 /* If NEWDECL is `static' and an `extern' was seen previously,
2984 warn about it. (OLDDECL may be NULL_TREE; NAME contains
2985 information about previous usage as an `extern'.)
2987 Note that this does not apply to the C++ case of declaring
2988 a variable `extern const' and then later `const'.
2990 Don't complain about built-in functions, since they are beyond
2991 the user's control. */
2994 warn_extern_redeclared_static (newdecl
, olddecl
)
2995 tree newdecl
, olddecl
;
2999 static const char *explicit_extern_static_warning
3000 = "`%D' was declared `extern' and later `static'";
3001 static const char *implicit_extern_static_warning
3002 = "`%D' was declared implicitly `extern' and later `static'";
3004 if (TREE_CODE (newdecl
) == TYPE_DECL
)
3007 name
= DECL_ASSEMBLER_NAME (newdecl
);
3008 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
3010 /* It's okay to redeclare an ANSI built-in function as static,
3011 or to declare a non-ANSI built-in function as anything. */
3012 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
3013 && olddecl
!= NULL_TREE
3014 && TREE_CODE (olddecl
) == FUNCTION_DECL
3015 && DECL_ARTIFICIAL (olddecl
)))
3017 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3018 ? implicit_extern_static_warning
3019 : explicit_extern_static_warning
, newdecl
);
3020 if (olddecl
!= NULL_TREE
)
3021 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3026 /* Handle when a new declaration NEWDECL has the same name as an old
3027 one OLDDECL in the same binding contour. Prints an error message
3030 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3031 Otherwise, return 0. */
3034 duplicate_decls (newdecl
, olddecl
)
3035 tree newdecl
, olddecl
;
3037 unsigned olddecl_uid
= DECL_UID (olddecl
);
3038 int olddecl_friend
= 0, types_match
= 0;
3039 int new_defines_function
= 0;
3041 if (newdecl
== olddecl
)
3044 types_match
= decls_match (newdecl
, olddecl
);
3046 /* If either the type of the new decl or the type of the old decl is an
3047 error_mark_node, then that implies that we have already issued an
3048 error (earlier) for some bogus type specification, and in that case,
3049 it is rather pointless to harass the user with yet more error message
3050 about the same declaration, so just pretend the types match here. */
3051 if (TREE_TYPE (newdecl
) == error_mark_node
3052 || TREE_TYPE (olddecl
) == error_mark_node
)
3055 /* Check for redeclaration and other discrepancies. */
3056 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3057 && DECL_ARTIFICIAL (olddecl
))
3059 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3061 /* If you declare a built-in or predefined function name as static,
3062 the old definition is overridden, but optionally warn this was a
3063 bad choice of name. */
3064 if (! TREE_PUBLIC (newdecl
))
3067 cp_warning ("shadowing %s function `%#D'",
3068 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3070 /* Discard the old built-in function. */
3073 /* If the built-in is not ansi, then programs can override
3074 it even globally without an error. */
3075 else if (! DECL_BUILT_IN (olddecl
))
3076 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3080 cp_error ("declaration of `%#D'", newdecl
);
3081 cp_error ("conflicts with built-in declaration `%#D'",
3086 else if (!types_match
)
3088 if ((DECL_LANGUAGE (newdecl
) == lang_c
3089 && DECL_LANGUAGE (olddecl
) == lang_c
)
3090 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3091 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3093 /* A near match; override the builtin. */
3095 if (TREE_PUBLIC (newdecl
))
3097 cp_warning ("new declaration `%#D'", newdecl
);
3098 cp_warning ("ambiguates built-in declaration `%#D'",
3101 else if (warn_shadow
)
3102 cp_warning ("shadowing %s function `%#D'",
3103 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3107 /* Discard the old built-in function. */
3111 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3113 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3114 && TREE_CODE (newdecl
) != TYPE_DECL
3115 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3116 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3117 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3118 && TREE_CODE (olddecl
) != TYPE_DECL
3119 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3120 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3123 /* We do nothing special here, because C++ does such nasty
3124 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3125 get shadowed, and know that if we need to find a TYPE_DECL
3126 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3127 slot of the identifier. */
3131 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3132 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3133 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3134 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3137 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3138 if (TREE_CODE (olddecl
) == TREE_LIST
)
3139 olddecl
= TREE_VALUE (olddecl
);
3140 cp_error_at ("previous declaration of `%#D'", olddecl
);
3142 /* New decl is completely inconsistent with the old one =>
3143 tell caller to replace the old one. */
3147 else if (!types_match
)
3149 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3150 /* These are certainly not duplicate declarations; they're
3151 from different scopes. */
3154 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3156 /* The name of a class template may not be declared to refer to
3157 any other template, class, function, object, namespace, value,
3158 or type in the same scope. */
3159 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3160 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3162 cp_error ("declaration of template `%#D'", newdecl
);
3163 cp_error_at ("conflicts with previous declaration `%#D'",
3166 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3167 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3168 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3169 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3170 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3171 DECL_TEMPLATE_PARMS (olddecl
)))
3173 cp_error ("new declaration `%#D'", newdecl
);
3174 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3178 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3180 if (DECL_LANGUAGE (newdecl
) == lang_c
3181 && DECL_LANGUAGE (olddecl
) == lang_c
)
3183 cp_error ("declaration of C function `%#D' conflicts with",
3185 cp_error_at ("previous declaration `%#D' here", olddecl
);
3187 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3188 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3190 cp_error ("new declaration `%#D'", newdecl
);
3191 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3197 /* Already complained about this, so don't do so again. */
3198 else if (current_class_type
== NULL_TREE
3199 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3201 cp_error ("conflicting types for `%#D'", newdecl
);
3202 cp_error_at ("previous declaration as `%#D'", olddecl
);
3205 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3206 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3207 && (!DECL_TEMPLATE_INFO (newdecl
)
3208 || (DECL_TI_TEMPLATE (newdecl
)
3209 != DECL_TI_TEMPLATE (olddecl
))))
3210 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3211 && (!DECL_TEMPLATE_INFO (olddecl
)
3212 || (DECL_TI_TEMPLATE (olddecl
)
3213 != DECL_TI_TEMPLATE (newdecl
))))))
3214 /* It's OK to have a template specialization and a non-template
3215 with the same type, or to have specializations of two
3216 different templates with the same type. Note that if one is a
3217 specialization, and the other is an instantiation of the same
3218 template, that we do not exit at this point. That situation
3219 can occur if we instantiate a template class, and then
3220 specialize one of its methods. This situation is legal, but
3221 the declarations must be merged in the usual way. */
3223 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3224 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3225 && !DECL_USE_TEMPLATE (newdecl
))
3226 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3227 && !DECL_USE_TEMPLATE (olddecl
))))
3228 /* One of the declarations is a template instantiation, and the
3229 other is not a template at all. That's OK. */
3231 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3232 && DECL_NAMESPACE_ALIAS (newdecl
)
3233 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3234 /* Redeclaration of namespace alias, ignore it. */
3238 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3241 cp_error (errmsg
, newdecl
);
3242 if (DECL_NAME (olddecl
) != NULL_TREE
)
3243 cp_error_at ((DECL_INITIAL (olddecl
)
3244 && namespace_bindings_p ())
3245 ? "`%#D' previously defined here"
3246 : "`%#D' previously declared here", olddecl
);
3248 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3249 && DECL_INITIAL (olddecl
) != NULL_TREE
3250 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3251 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3253 /* Prototype decl follows defn w/o prototype. */
3254 cp_warning_at ("prototype for `%#D'", newdecl
);
3255 cp_warning_at ("follows non-prototype definition here", olddecl
);
3257 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3258 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3260 /* extern "C" int foo ();
3261 int foo () { bar (); }
3263 if (current_lang_stack
3264 == &VARRAY_TREE (current_lang_base
, 0))
3265 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3268 cp_error_at ("previous declaration of `%#D' with %L linkage",
3269 olddecl
, DECL_LANGUAGE (olddecl
));
3270 cp_error ("conflicts with new declaration with %L linkage",
3271 DECL_LANGUAGE (newdecl
));
3275 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3277 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3279 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3280 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3283 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3284 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3286 for (; t1
&& t1
!= void_list_node
;
3287 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3288 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3290 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3295 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3297 cp_pedwarn_at ("after previous specification in `%#D'",
3303 cp_error ("default argument given for parameter %d of `%#D'",
3305 cp_error_at ("after previous specification in `%#D'",
3310 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3311 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3313 cp_warning ("`%#D' was used before it was declared inline",
3315 cp_warning_at ("previous non-inline declaration here",
3321 /* If new decl is `static' and an `extern' was seen previously,
3323 warn_extern_redeclared_static (newdecl
, olddecl
);
3325 /* We have committed to returning 1 at this point. */
3326 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3328 /* Now that functions must hold information normally held
3329 by field decls, there is extra work to do so that
3330 declaration information does not get destroyed during
3332 if (DECL_VINDEX (olddecl
))
3333 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3334 if (DECL_CONTEXT (olddecl
))
3335 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3336 if (DECL_CLASS_CONTEXT (olddecl
))
3337 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3338 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3339 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3340 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3341 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3342 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3343 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3344 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3345 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3347 /* Optionally warn about more than one declaration for the same
3348 name, but don't warn about a function declaration followed by a
3350 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3351 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3352 /* Don't warn about extern decl followed by definition. */
3353 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3354 /* Don't warn about friends, let add_friend take care of it. */
3355 && ! DECL_FRIEND_P (newdecl
))
3357 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3358 cp_warning_at ("previous declaration of `%D'", olddecl
);
3362 /* Deal with C++: must preserve virtual function table size. */
3363 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3365 register tree newtype
= TREE_TYPE (newdecl
);
3366 register tree oldtype
= TREE_TYPE (olddecl
);
3368 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3369 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3371 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3372 CLASSTYPE_FRIEND_CLASSES (newtype
)
3373 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3377 /* Copy all the DECL_... slots specified in the new decl
3378 except for any that we copy here from the old type. */
3379 DECL_MACHINE_ATTRIBUTES (newdecl
)
3380 = merge_machine_decl_attributes (olddecl
, newdecl
);
3382 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3384 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3385 DECL_TEMPLATE_RESULT (olddecl
)))
3386 cp_error ("invalid redeclaration of %D", newdecl
);
3387 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3388 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3389 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3390 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3397 /* Automatically handles default parameters. */
3398 tree oldtype
= TREE_TYPE (olddecl
);
3401 /* Make sure we put the new type in the same obstack as the old one. */
3403 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3405 push_permanent_obstack ();
3407 /* Merge the data types specified in the two decls. */
3408 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3410 if (TREE_CODE (newdecl
) == VAR_DECL
)
3411 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3412 /* Do this after calling `common_type' so that default
3413 parameters don't confuse us. */
3414 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3415 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3416 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3418 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3419 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3420 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3421 TYPE_RAISES_EXCEPTIONS (oldtype
));
3423 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3424 && DECL_SOURCE_LINE (olddecl
) != 0
3426 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3427 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3429 cp_error ("declaration of `%F' throws different exceptions",
3431 cp_error_at ("to previous declaration `%F'", olddecl
);
3434 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3436 /* Lay the type out, unless already done. */
3437 if (! same_type_p (newtype
, oldtype
)
3438 && TREE_TYPE (newdecl
) != error_mark_node
3439 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3440 layout_type (TREE_TYPE (newdecl
));
3442 if ((TREE_CODE (newdecl
) == VAR_DECL
3443 || TREE_CODE (newdecl
) == PARM_DECL
3444 || TREE_CODE (newdecl
) == RESULT_DECL
3445 || TREE_CODE (newdecl
) == FIELD_DECL
3446 || TREE_CODE (newdecl
) == TYPE_DECL
)
3447 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3448 layout_decl (newdecl
, 0);
3450 /* Merge the type qualifiers. */
3451 if (TREE_READONLY (newdecl
))
3452 TREE_READONLY (olddecl
) = 1;
3453 if (TREE_THIS_VOLATILE (newdecl
))
3454 TREE_THIS_VOLATILE (olddecl
) = 1;
3456 /* Merge the initialization information. */
3457 if (DECL_INITIAL (newdecl
) == NULL_TREE
3458 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3460 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3461 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3462 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3463 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3464 && DECL_LANG_SPECIFIC (newdecl
)
3465 && DECL_LANG_SPECIFIC (olddecl
))
3466 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3469 /* Merge the section attribute.
3470 We want to issue an error if the sections conflict but that must be
3471 done later in decl_attributes since we are called before attributes
3473 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3474 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3476 /* Keep the old rtl since we can safely use it, unless it's the
3477 call to abort() used for abstract virtuals. */
3478 if ((DECL_LANG_SPECIFIC (olddecl
)
3479 && !DECL_ABSTRACT_VIRTUAL_P (olddecl
))
3480 || DECL_RTL (olddecl
) != DECL_RTL (abort_fndecl
))
3481 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3485 /* If cannot merge, then use the new type and qualifiers,
3486 and don't preserve the old rtl. */
3489 /* Clean out any memory we had of the old declaration. */
3490 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3492 TREE_VALUE (oldstatic
) = error_mark_node
;
3494 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3495 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3496 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3497 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3500 /* Merge the storage class information. */
3501 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3502 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3503 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3504 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3505 if (! DECL_EXTERNAL (olddecl
))
3506 DECL_EXTERNAL (newdecl
) = 0;
3508 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3510 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3511 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3512 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3513 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3514 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3515 /* Don't really know how much of the language-specific
3516 values we should copy from old to new. */
3517 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3518 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3519 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3520 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3521 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3523 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3524 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3525 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3526 DECL_BEFRIENDING_CLASSES (newdecl
)
3527 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3528 DECL_BEFRIENDING_CLASSES (olddecl
));
3531 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3533 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3534 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3536 /* If newdecl is not a specialization, then it is not a
3537 template-related function at all. And that means that we
3538 shoud have exited above, returning 0. */
3539 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3542 if (TREE_USED (olddecl
))
3543 /* From [temp.expl.spec]:
3545 If a template, a member template or the member of a class
3546 template is explicitly specialized then that
3547 specialization shall be declared before the first use of
3548 that specialization that would cause an implicit
3549 instantiation to take place, in every translation unit in
3550 which such a use occurs. */
3551 cp_error ("explicit specialization of %D after first use",
3554 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3556 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3558 /* If either decl says `inline', this fn is inline, unless its
3559 definition was passed already. */
3560 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3561 DECL_INLINE (olddecl
) = 1;
3562 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3566 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3567 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3568 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3570 if (! types_match
|| new_defines_function
)
3572 /* These need to be copied so that the names are available.
3573 Note that if the types do match, we'll preserve inline
3574 info and other bits, but if not, we won't. */
3575 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3576 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3578 if (new_defines_function
)
3579 /* If defining a function declared with other language
3580 linkage, use the previously declared language linkage. */
3581 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3582 else if (types_match
)
3584 /* If redeclaring a builtin function, and not a definition,
3585 it stays built in. */
3586 if (DECL_BUILT_IN (olddecl
))
3588 DECL_BUILT_IN (newdecl
) = 1;
3589 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3590 /* If we're keeping the built-in definition, keep the rtl,
3591 regardless of declaration matches. */
3592 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3595 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3597 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3598 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3599 /* Previously saved insns go together with
3600 the function's previous definition. */
3601 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3602 /* Don't clear out the arguments if we're redefining a function. */
3603 if (DECL_ARGUMENTS (olddecl
))
3604 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3606 if (DECL_LANG_SPECIFIC (olddecl
))
3607 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3610 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3612 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3615 /* Now preserve various other info from the definition. */
3616 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3617 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3618 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3619 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3621 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3625 function_size
= sizeof (struct tree_decl
);
3627 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3628 (char *) olddecl
+ sizeof (struct tree_common
),
3629 function_size
- sizeof (struct tree_common
));
3631 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3633 /* If newdecl is a template instantiation, it is possible that
3634 the following sequence of events has occurred:
3636 o A friend function was declared in a class template. The
3637 class template was instantiated.
3639 o The instantiation of the friend declaration was
3640 recorded on the instantiation list, and is newdecl.
3642 o Later, however, instantiate_class_template called pushdecl
3643 on the newdecl to perform name injection. But, pushdecl in
3644 turn called duplicate_decls when it discovered that another
3645 declaration of a global function with the same name already
3648 o Here, in duplicate_decls, we decided to clobber newdecl.
3650 If we're going to do that, we'd better make sure that
3651 olddecl, and not newdecl, is on the list of
3652 instantiations so that if we try to do the instantiation
3653 again we won't get the clobbered declaration. */
3655 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3656 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3658 for (; decls
; decls
= TREE_CHAIN (decls
))
3659 if (TREE_VALUE (decls
) == newdecl
)
3660 TREE_VALUE (decls
) = olddecl
;
3665 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3666 (char *) olddecl
+ sizeof (struct tree_common
),
3667 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3668 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3671 DECL_UID (olddecl
) = olddecl_uid
;
3673 DECL_FRIEND_P (olddecl
) = 1;
3675 /* NEWDECL contains the merged attribute lists.
3676 Update OLDDECL to be the same. */
3677 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3682 /* Record a decl-node X as belonging to the current lexical scope.
3683 Check for errors (such as an incompatible declaration for the same
3684 name already seen in the same scope).
3686 Returns either X or an old decl for the same name.
3687 If an old decl is returned, it may have been smashed
3688 to agree with what X says. */
3695 register tree name
= DECL_ASSEMBLER_NAME (x
);
3696 int need_new_binding
= 1;
3698 if (DECL_TEMPLATE_PARM_P (x
))
3699 /* Template parameters have no context; they are not X::T even
3700 when declared within a class or namespace. */
3704 if (current_function_decl
&& x
!= current_function_decl
3705 /* A local declaration for a function doesn't constitute
3707 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3708 /* Don't change DECL_CONTEXT of virtual methods. */
3709 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3710 && !DECL_CONTEXT (x
))
3711 DECL_CONTEXT (x
) = current_function_decl
;
3712 if (!DECL_CONTEXT (x
))
3713 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3716 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3717 compiler wants to use. */
3718 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3719 || TREE_CODE (x
) == NAMESPACE_DECL
)
3720 name
= DECL_NAME (x
);
3725 /* Not needed...see below. */
3729 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3730 name
= TREE_OPERAND (name
, 0);
3732 /* Namespace-scoped variables are not found in the current level. */
3733 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3734 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3736 t
= lookup_name_current_level (name
);
3737 if (t
== error_mark_node
)
3739 /* error_mark_node is 0 for a while during initialization! */
3741 cp_error_at ("`%#D' used prior to declaration", x
);
3744 else if (t
!= NULL_TREE
)
3747 /* This is turned off until I have time to do it right (bpk). */
3748 /* With the code below that uses it... */
3749 file
= DECL_SOURCE_FILE (t
);
3750 line
= DECL_SOURCE_LINE (t
);
3752 if (TREE_CODE (t
) == PARM_DECL
)
3754 if (DECL_CONTEXT (t
) == NULL_TREE
)
3755 fatal ("parse errors have confused me too much");
3757 /* Check for duplicate params. */
3758 if (duplicate_decls (x
, t
))
3761 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3762 || DECL_FUNCTION_TEMPLATE_P (x
))
3763 && is_overloaded_fn (t
))
3764 /* Don't do anything just yet. */;
3765 else if (t
== wchar_decl_node
)
3767 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3768 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3770 /* Throw away the redeclaration. */
3773 else if (TREE_CODE (t
) != TREE_CODE (x
))
3775 if (duplicate_decls (x
, t
))
3778 else if (duplicate_decls (x
, t
))
3781 /* This is turned off until I have time to do it right (bpk). */
3783 /* Also warn if they did a prototype with `static' on it, but
3784 then later left the `static' off. */
3785 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3787 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3792 cp_warning ("`static' missing from declaration of `%D'",
3794 warning_with_file_and_line (file
, line
,
3795 "previous declaration of `%s'",
3796 decl_as_string (t
, 0));
3799 /* Now fix things so it'll do what they expect. */
3800 if (current_function_decl
)
3801 TREE_PUBLIC (current_function_decl
) = 0;
3803 /* Due to interference in memory reclamation (X may be
3804 obstack-deallocated at this point), we must guard against
3805 one really special case. [jason: This should be handled
3806 by start_function] */
3807 if (current_function_decl
== x
)
3808 current_function_decl
= t
;
3810 if (TREE_CODE (t
) == TYPE_DECL
)
3811 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3812 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3813 check_default_args (t
);
3817 else if (DECL_MAIN_P (x
))
3819 /* A redeclaration of main, but not a duplicate of the
3824 This function shall not be overloaded. */
3825 cp_error_at ("invalid redeclaration of `%D'", t
);
3826 cp_error ("as `%D'", x
);
3827 /* We don't try to push this declaration since that
3833 check_template_shadow (x
);
3835 /* If this is a function conjured up by the backend, massage it
3836 so it looks friendly. */
3837 if (TREE_CODE (x
) == FUNCTION_DECL
3838 && ! DECL_LANG_SPECIFIC (x
))
3840 retrofit_lang_decl (x
);
3841 DECL_LANGUAGE (x
) = lang_c
;
3844 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3846 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3847 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3849 if (!namespace_bindings_p ())
3850 /* We do not need to create a binding for this name;
3851 push_overloaded_decl will have already done so if
3853 need_new_binding
= 0;
3855 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3857 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3859 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3863 /* If declaring a type as a typedef, copy the type (unless we're
3864 at line 0), and install this TYPE_DECL as the new type's typedef
3865 name. See the extensive comment in ../c-decl.c (pushdecl). */
3866 if (TREE_CODE (x
) == TYPE_DECL
)
3868 tree type
= TREE_TYPE (x
);
3869 if (DECL_SOURCE_LINE (x
) == 0)
3871 if (TYPE_NAME (type
) == 0)
3872 TYPE_NAME (type
) = x
;
3874 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3875 /* We don't want to copy the type when all we're
3876 doing is making a TYPE_DECL for the purposes of
3878 && (!TYPE_NAME (type
)
3879 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3881 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3883 DECL_ORIGINAL_TYPE (x
) = type
;
3884 type
= build_type_copy (type
);
3885 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3886 TYPE_NAME (type
) = x
;
3887 TREE_TYPE (x
) = type
;
3892 if (type
!= error_mark_node
3894 && TYPE_IDENTIFIER (type
))
3895 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3896 current_binding_level
);
3900 /* Multiple external decls of the same identifier ought to match.
3902 We get warnings about inline functions where they are defined.
3903 We get warnings about other functions from push_overloaded_decl.
3905 Avoid duplicate warnings where they are used. */
3906 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3910 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3911 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3912 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3913 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3918 /* If different sort of thing, we already gave an error. */
3919 && TREE_CODE (decl
) == TREE_CODE (x
)
3920 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3922 cp_pedwarn ("type mismatch with previous external decl", x
);
3923 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3927 /* This name is new in its binding level.
3928 Install the new declaration and return it. */
3929 if (namespace_bindings_p ())
3931 /* Install a global value. */
3933 /* If the first global decl has external linkage,
3934 warn if we later see static one. */
3935 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3936 TREE_PUBLIC (name
) = 1;
3938 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3941 if (TREE_CODE (x
) == FUNCTION_DECL
)
3943 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3944 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3945 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3948 /* Don't forget if the function was used via an implicit decl. */
3949 if (IDENTIFIER_IMPLICIT_DECL (name
)
3950 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3953 /* Don't forget if its address was taken in that way. */
3954 if (IDENTIFIER_IMPLICIT_DECL (name
)
3955 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3956 TREE_ADDRESSABLE (x
) = 1;
3958 /* Warn about mismatches against previous implicit decl. */
3959 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3960 /* If this real decl matches the implicit, don't complain. */
3961 && ! (TREE_CODE (x
) == FUNCTION_DECL
3962 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3964 ("`%D' was previously implicitly declared to return `int'", x
);
3966 /* If new decl is `static' and an `extern' was seen previously,
3968 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3969 warn_extern_redeclared_static (x
, t
);
3973 /* Here to install a non-global value. */
3974 tree oldlocal
= IDENTIFIER_VALUE (name
);
3975 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3977 if (need_new_binding
)
3979 push_local_binding (name
, x
, 0);
3980 /* Because push_local_binding will hook X on to the
3981 current_binding_level's name list, we don't want to
3982 do that again below. */
3983 need_new_binding
= 0;
3986 /* If this is a TYPE_DECL, push it into the type value slot. */
3987 if (TREE_CODE (x
) == TYPE_DECL
)
3988 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3989 current_binding_level
);
3991 /* Clear out any TYPE_DECL shadowed by a namespace so that
3992 we won't think this is a type. The C struct hack doesn't
3993 go through namespaces. */
3994 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3995 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3996 current_binding_level
);
3998 /* If this is an extern function declaration, see if we
3999 have a global definition or declaration for the function. */
4000 if (oldlocal
== NULL_TREE
4001 && DECL_EXTERNAL (x
)
4002 && oldglobal
!= NULL_TREE
4003 && TREE_CODE (x
) == FUNCTION_DECL
4004 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4006 /* We have one. Their types must agree. */
4007 if (decls_match (x
, oldglobal
))
4011 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4012 cp_warning_at ("global declaration `%#D'", oldglobal
);
4015 /* If we have a local external declaration,
4016 and no file-scope declaration has yet been seen,
4017 then if we later have a file-scope decl it must not be static. */
4018 if (oldlocal
== NULL_TREE
4019 && oldglobal
== NULL_TREE
4020 && DECL_EXTERNAL (x
)
4022 TREE_PUBLIC (name
) = 1;
4024 if (DECL_FROM_INLINE (x
))
4025 /* Inline decls shadow nothing. */;
4027 /* Warn if shadowing an argument at the top level of the body. */
4028 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4029 && TREE_CODE (oldlocal
) == PARM_DECL
4030 /* Don't complain if it's from an enclosing function. */
4031 && DECL_CONTEXT (oldlocal
) == current_function_decl
4032 && TREE_CODE (x
) != PARM_DECL
)
4034 /* Go to where the parms should be and see if we
4036 struct binding_level
*b
= current_binding_level
->level_chain
;
4042 if (b
->parm_flag
== 1)
4043 cp_error ("declaration of `%#D' shadows a parameter", name
);
4045 else if (warn_shadow
&& oldlocal
!= NULL_TREE
4046 && current_binding_level
->is_for_scope
4047 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
4049 warning ("variable `%s' shadows local",
4050 IDENTIFIER_POINTER (name
));
4051 cp_warning_at (" this is the shadowed declaration", oldlocal
);
4053 /* Maybe warn if shadowing something else. */
4054 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4055 /* No shadow warnings for internally generated vars. */
4056 && ! DECL_ARTIFICIAL (x
)
4057 /* No shadow warnings for vars made for inlining. */
4058 && ! DECL_FROM_INLINE (x
))
4060 const char *warnstring
= NULL
;
4062 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4063 warnstring
= "declaration of `%s' shadows a parameter";
4064 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4065 && current_class_ptr
4066 && !TREE_STATIC (name
))
4067 warnstring
= "declaration of `%s' shadows a member of `this'";
4068 else if (oldlocal
!= NULL_TREE
)
4069 warnstring
= "declaration of `%s' shadows previous local";
4070 else if (oldglobal
!= NULL_TREE
)
4071 /* XXX shadow warnings in outer-more namespaces */
4072 warnstring
= "declaration of `%s' shadows global declaration";
4075 warning (warnstring
, IDENTIFIER_POINTER (name
));
4079 if (TREE_CODE (x
) == FUNCTION_DECL
)
4080 check_default_args (x
);
4082 /* Keep count of variables in this level with incomplete type. */
4083 if (TREE_CODE (x
) == VAR_DECL
4084 && TREE_TYPE (x
) != error_mark_node
4085 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4086 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4087 /* RTTI TD entries are created while defining the type_info. */
4088 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4089 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4090 current_binding_level
->incomplete
4091 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4094 if (need_new_binding
)
4095 add_decl_to_level (x
, current_binding_level
);
4100 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4101 caller to set DECL_CONTEXT properly. */
4104 pushdecl_with_scope (x
, level
)
4106 struct binding_level
*level
;
4108 register struct binding_level
*b
;
4109 tree function_decl
= current_function_decl
;
4111 current_function_decl
= NULL_TREE
;
4112 if (level
->parm_flag
== 2)
4114 b
= class_binding_level
;
4115 class_binding_level
= level
;
4116 pushdecl_class_level (x
);
4117 class_binding_level
= b
;
4121 b
= current_binding_level
;
4122 current_binding_level
= level
;
4124 current_binding_level
= b
;
4126 current_function_decl
= function_decl
;
4130 /* Like pushdecl, only it places X in the current namespace,
4134 pushdecl_namespace_level (x
)
4137 register struct binding_level
*b
= current_binding_level
;
4140 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4142 /* Now, the type_shadowed stack may screw us. Munge it so it does
4144 if (TREE_CODE (x
) == TYPE_DECL
)
4146 tree name
= DECL_NAME (x
);
4148 tree
*ptr
= (tree
*)0;
4149 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4151 tree shadowed
= b
->type_shadowed
;
4152 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4153 if (TREE_PURPOSE (shadowed
) == name
)
4155 ptr
= &TREE_VALUE (shadowed
);
4156 /* Can't break out of the loop here because sometimes
4157 a binding level will have duplicate bindings for
4158 PT names. It's gross, but I haven't time to fix it. */
4161 newval
= TREE_TYPE (x
);
4162 if (ptr
== (tree
*)0)
4164 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4165 up here if this is changed to an assertion. --KR */
4166 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4176 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4180 pushdecl_top_level (x
)
4183 tree cur_namespace
= current_namespace
;
4184 current_namespace
= global_namespace
;
4185 x
= pushdecl_namespace_level (x
);
4186 current_namespace
= cur_namespace
;
4190 /* Make the declaration of X appear in CLASS scope. */
4193 pushdecl_class_level (x
)
4196 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4197 scope looks for the pre-mangled name. */
4200 if (TREE_CODE (x
) == OVERLOAD
)
4201 x
= OVL_CURRENT (x
);
4202 name
= DECL_NAME (x
);
4206 push_class_level_binding (name
, x
);
4207 if (TREE_CODE (x
) == TYPE_DECL
)
4208 set_identifier_type_value (name
, TREE_TYPE (x
));
4210 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4214 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4217 pushdecl_class_level (f
);
4221 /* Enter DECL into the symbol table, if that's appropriate. Returns
4222 DECL, or a modified version thereof. */
4225 maybe_push_decl (decl
)
4228 tree type
= TREE_TYPE (decl
);
4230 /* Add this decl to the current binding level, but not if it comes
4231 from another scope, e.g. a static member variable. TEM may equal
4232 DECL or it may be a previous decl of the same name. */
4233 if ((TREE_CODE (decl
) != PARM_DECL
4234 && DECL_CONTEXT (decl
) != NULL_TREE
4235 /* Definitions of namespace members outside their namespace are
4237 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4238 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4239 || TREE_CODE (type
) == UNKNOWN_TYPE
4240 /* The declaration of a template specialization does not affect
4241 the functions available for overload resolution, so we do not
4243 || (TREE_CODE (decl
) == FUNCTION_DECL
4244 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4247 return pushdecl (decl
);
4251 /* This function is used to push the mangled decls for nested types into
4252 the appropriate scope. Previously pushdecl_top_level was used, but that
4253 is incorrect for members of local classes. */
4256 pushdecl_nonclass_level (x
)
4259 struct binding_level
*b
= current_binding_level
;
4261 my_friendly_assert (b
->parm_flag
!= 2, 180);
4264 /* Get out of template binding levels */
4265 while (b
->pseudo_global
)
4269 pushdecl_with_scope (x
, b
);
4273 /* Make the declaration(s) of X appear in CLASS scope
4274 under the name NAME. */
4277 push_class_level_binding (name
, x
)
4282 /* The class_binding_level will be NULL if x is a template
4283 parameter name in a member template. */
4284 if (!class_binding_level
)
4287 /* Make sure that this new member does not have the same name
4288 as a template parameter. */
4289 if (TYPE_BEING_DEFINED (current_class_type
))
4290 check_template_shadow (x
);
4292 /* If this declaration shadows a declaration from an enclosing
4293 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4294 we leave this class. Record the shadowed declaration here. */
4295 binding
= IDENTIFIER_BINDING (name
);
4297 && ((TREE_CODE (x
) == OVERLOAD
4298 && BINDING_VALUE (binding
)
4299 && is_overloaded_fn (BINDING_VALUE (binding
)))
4300 || INHERITED_VALUE_BINDING_P (binding
)))
4305 /* If the old binding was from a base class, and was for a tag
4306 name, slide it over to make room for the new binding. The
4307 old binding is still visible if explicitly qualified with a
4309 if (INHERITED_VALUE_BINDING_P (binding
)
4310 && BINDING_VALUE (binding
)
4311 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4312 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4313 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4315 old_decl
= BINDING_TYPE (binding
);
4316 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4317 BINDING_VALUE (binding
) = NULL_TREE
;
4318 INHERITED_VALUE_BINDING_P (binding
) = 0;
4321 old_decl
= BINDING_VALUE (binding
);
4323 /* There was already a binding for X containing fewer
4324 functions than are named in X. Find the previous
4325 declaration of X on the class-shadowed list, and update it. */
4326 for (shadow
= class_binding_level
->class_shadowed
;
4328 shadow
= TREE_CHAIN (shadow
))
4329 if (TREE_PURPOSE (shadow
) == name
4330 && TREE_TYPE (shadow
) == old_decl
)
4332 BINDING_VALUE (binding
) = x
;
4333 INHERITED_VALUE_BINDING_P (binding
) = 0;
4334 TREE_TYPE (shadow
) = x
;
4339 /* If we didn't replace an existing binding, put the binding on the
4340 stack of bindings for the identifier, and update
4341 IDENTIFIER_CLASS_VALUE. */
4342 if (push_class_binding (name
, x
))
4344 push_cache_obstack ();
4345 class_binding_level
->class_shadowed
4346 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4347 class_binding_level
->class_shadowed
);
4349 /* Record the value we are binding NAME to so that we can know
4350 what to pop later. */
4351 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4355 /* Insert another USING_DECL into the current binding level,
4356 returning this declaration. If this is a redeclaration,
4357 do nothing and return NULL_TREE. */
4360 push_using_decl (scope
, name
)
4366 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4367 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4368 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4369 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4373 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4374 DECL_INITIAL (decl
) = scope
;
4375 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4376 current_binding_level
->usings
= decl
;
4380 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4381 changed (i.e. there was already a directive), or the fresh
4382 TREE_LIST otherwise. */
4385 push_using_directive (used
)
4388 tree ud
= current_binding_level
->using_directives
;
4389 tree iter
, ancestor
;
4391 /* Check if we already have this. */
4392 if (purpose_member (used
, ud
) != NULL_TREE
)
4395 /* Recursively add all namespaces used. */
4396 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4397 push_using_directive (TREE_PURPOSE (iter
));
4399 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4400 ud
= current_binding_level
->using_directives
;
4401 ud
= tree_cons (used
, ancestor
, ud
);
4402 current_binding_level
->using_directives
= ud
;
4406 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4407 other definitions already in place. We get around this by making
4408 the value of the identifier point to a list of all the things that
4409 want to be referenced by that name. It is then up to the users of
4410 that name to decide what to do with that list.
4412 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4413 slot. It is dealt with the same way.
4415 FLAGS is a bitwise-or of the following values:
4416 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4418 PUSH_USING: DECL is being pushed as the result of a using
4421 The value returned may be a previous declaration if we guessed wrong
4422 about what language DECL should belong to (C or C++). Otherwise,
4423 it's always DECL (and never something that's not a _DECL). */
4426 push_overloaded_decl (decl
, flags
)
4430 tree name
= DECL_NAME (decl
);
4433 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4436 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4438 old
= lookup_name_current_level (name
);
4442 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4444 tree t
= TREE_TYPE (old
);
4445 if (IS_AGGR_TYPE (t
) && warn_shadow
4446 && (! DECL_IN_SYSTEM_HEADER (decl
)
4447 || ! DECL_IN_SYSTEM_HEADER (old
)))
4448 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4451 else if (is_overloaded_fn (old
))
4455 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4457 tree fn
= OVL_CURRENT (tmp
);
4459 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4460 && !(flags
& PUSH_USING
)
4461 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4462 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4463 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4466 if (duplicate_decls (decl
, fn
))
4472 cp_error_at ("previous non-function declaration `%#D'", old
);
4473 cp_error ("conflicts with function declaration `%#D'", decl
);
4478 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4480 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4481 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4483 new_binding
= ovl_cons (decl
, old
);
4484 if (flags
& PUSH_USING
)
4485 OVL_USED (new_binding
) = 1;
4488 /* NAME is not ambiguous. */
4492 set_namespace_binding (name
, current_namespace
, new_binding
);
4495 /* We only create an OVERLOAD if there was a previous binding at
4496 this level, or if decl is a template. In the former case, we
4497 need to remove the old binding and replace it with the new
4498 binding. We must also run through the NAMES on the binding
4499 level where the name was bound to update the chain. */
4501 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4505 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4507 d
= &TREE_CHAIN (*d
))
4509 || (TREE_CODE (*d
) == TREE_LIST
4510 && TREE_VALUE (*d
) == old
))
4512 if (TREE_CODE (*d
) == TREE_LIST
)
4513 /* Just replace the old binding with the new. */
4514 TREE_VALUE (*d
) = new_binding
;
4516 /* Build a TREE_LIST to wrap the OVERLOAD. */
4517 *d
= build_tree_list (NULL_TREE
, new_binding
);
4519 /* And update the CPLUS_BINDING node. */
4520 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4525 /* We should always find a previous binding in this case. */
4526 my_friendly_abort (0);
4529 /* Install the new binding. */
4530 push_local_binding (name
, new_binding
, flags
);
4536 /* Generate an implicit declaration for identifier FUNCTIONID
4537 as a function of type int (). Print a warning if appropriate. */
4540 implicitly_declare (functionid
)
4544 int temp
= allocation_temporary_p ();
4546 push_obstacks_nochange ();
4548 /* Save the decl permanently so we can warn if definition follows.
4549 In ANSI C, warn_implicit is usually false, so the saves little space.
4550 But in C++, it's usually true, hence the extra code. */
4551 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4552 end_temporary_allocation ();
4554 /* We used to reuse an old implicit decl here,
4555 but this loses with inline functions because it can clobber
4556 the saved decl chains. */
4557 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4559 DECL_EXTERNAL (decl
) = 1;
4560 TREE_PUBLIC (decl
) = 1;
4562 /* ANSI standard says implicit declarations are in the innermost block.
4563 So we record the decl in the standard fashion. */
4565 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4568 /* Only one warning per identifier. */
4569 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4571 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4574 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4581 /* Return zero if the declaration NEWDECL is valid
4582 when the declaration OLDDECL (assumed to be for the same name)
4583 has already been seen.
4584 Otherwise return an error message format string with a %s
4585 where the identifier should go. */
4588 redeclaration_error_message (newdecl
, olddecl
)
4589 tree newdecl
, olddecl
;
4591 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4593 /* Because C++ can put things into name space for free,
4594 constructs like "typedef struct foo { ... } foo"
4595 would look like an erroneous redeclaration. */
4596 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4599 return "redefinition of `%#D'";
4601 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4603 /* If this is a pure function, its olddecl will actually be
4604 the original initialization to `0' (which we force to call
4605 abort()). Don't complain about redefinition in this case. */
4606 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4609 /* If both functions come from different namespaces, this is not
4610 a redeclaration - this is a conflict with a used function. */
4611 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4612 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4613 return "`%D' conflicts with used function";
4615 /* We'll complain about linkage mismatches in
4616 warn_extern_redeclared_static. */
4618 /* Defining the same name twice is no good. */
4619 if (DECL_INITIAL (olddecl
) != NULL_TREE
4620 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4622 if (DECL_NAME (olddecl
) == NULL_TREE
)
4623 return "`%#D' not declared in class";
4625 return "redefinition of `%#D'";
4629 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4631 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4632 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4633 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4634 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4635 && TYPE_SIZE (TREE_TYPE (newdecl
))
4636 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4637 return "redefinition of `%#D'";
4640 else if (toplevel_bindings_p ())
4642 /* Objects declared at top level: */
4643 /* If at least one is a reference, it's ok. */
4644 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4646 /* Reject two definitions. */
4647 return "redefinition of `%#D'";
4651 /* Objects declared with block scope: */
4652 /* Reject two definitions, and reject a definition
4653 together with an external reference. */
4654 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4655 return "redeclaration of `%#D'";
4660 /* Create a new label, named ID. */
4663 make_label_decl (id
, local_p
)
4669 if (building_stmt_tree ())
4670 push_permanent_obstack ();
4671 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4672 if (building_stmt_tree ())
4675 /* Make sure every label has an rtx. */
4678 DECL_CONTEXT (decl
) = current_function_decl
;
4679 DECL_MODE (decl
) = VOIDmode
;
4680 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4682 /* Say where one reference is to the label, for the sake of the
4683 error if it is not defined. */
4684 DECL_SOURCE_LINE (decl
) = lineno
;
4685 DECL_SOURCE_FILE (decl
) = input_filename
;
4687 /* Record the fact that this identifier is bound to this label. */
4688 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4690 /* Record this label on the list of used labels so that we can check
4691 at the end of the function to see whether or not the label was
4692 actually defined. */
4693 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4694 && (named_label_uses
== NULL
4695 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4696 || named_label_uses
->label_decl
!= decl
))
4698 struct named_label_list
*new_ent
;
4700 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4701 new_ent
->label_decl
= decl
;
4702 new_ent
->names_in_scope
= current_binding_level
->names
;
4703 new_ent
->binding_level
= current_binding_level
;
4704 new_ent
->lineno_o_goto
= lineno
;
4705 new_ent
->filename_o_goto
= input_filename
;
4706 new_ent
->next
= named_label_uses
;
4707 named_label_uses
= new_ent
;
4713 /* Look for a label named ID in the current function. If one cannot
4714 be found, create one. (We keep track of used, but undefined,
4715 labels, and complain about them at the end of a function.) */
4723 /* You can't use labels at global scope. */
4724 if (current_function_decl
== NULL_TREE
)
4726 error ("label `%s' referenced outside of any function",
4727 IDENTIFIER_POINTER (id
));
4731 /* See if we've already got this label. */
4732 decl
= IDENTIFIER_LABEL_VALUE (id
);
4733 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4736 /* Record this label on the list of labels used in this function.
4737 We do this before calling make_label_decl so that we get the
4738 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4739 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4741 /* We need a new label. */
4742 decl
= make_label_decl (id
, /*local_p=*/0);
4743 /* Now fill in the information we didn't have before. */
4744 TREE_VALUE (named_labels
) = decl
;
4749 /* Declare a local label named ID. */
4752 declare_local_label (id
)
4757 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4758 this scope we can restore the old value of
4759 IDENTIFIER_TYPE_VALUE. */
4760 current_binding_level
->shadowed_labels
4761 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4762 current_binding_level
->shadowed_labels
);
4763 /* Look for the label. */
4764 decl
= make_label_decl (id
, /*local_p=*/1);
4765 /* Now fill in the information we didn't have before. */
4766 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4771 /* Define a label, specifying the location in the source file.
4772 Return the LABEL_DECL node for the label, if the definition is valid.
4773 Otherwise return 0. */
4776 define_label (filename
, line
, name
)
4781 tree decl
= lookup_label (name
);
4783 /* After labels, make any new cleanups go into their
4784 own new (temporary) binding contour. */
4785 current_binding_level
->more_cleanups_ok
= 0;
4787 if (name
== get_identifier ("wchar_t"))
4788 cp_pedwarn ("label named wchar_t");
4790 if (DECL_INITIAL (decl
) != NULL_TREE
)
4792 cp_error ("duplicate label `%D'", decl
);
4797 struct named_label_list
*uses
, *prev
;
4801 /* Mark label as having been defined. */
4802 DECL_INITIAL (decl
) = error_mark_node
;
4803 /* Say where in the source. */
4804 DECL_SOURCE_FILE (decl
) = filename
;
4805 DECL_SOURCE_LINE (decl
) = line
;
4808 uses
= named_label_uses
;
4809 while (uses
!= NULL
)
4810 if (uses
->label_decl
== decl
)
4812 struct binding_level
*b
= current_binding_level
;
4815 tree new_decls
= b
->names
;
4816 tree old_decls
= (b
== uses
->binding_level
)
4817 ? uses
->names_in_scope
: NULL_TREE
;
4818 while (new_decls
!= old_decls
)
4820 if (TREE_CODE (new_decls
) == VAR_DECL
4821 /* Don't complain about crossing initialization
4822 of internal entities. They can't be accessed,
4823 and they should be cleaned up
4824 by the time we get to the label. */
4825 && ! DECL_ARTIFICIAL (new_decls
)
4826 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4827 && pod_type_p (TREE_TYPE (new_decls
))))
4829 /* This is really only important if we're crossing
4830 an initialization. The POD stuff is just
4831 pedantry; why should it matter if the class
4832 contains a field of pointer to member type? */
4833 int problem
= (DECL_INITIAL (new_decls
)
4834 || (TYPE_NEEDS_CONSTRUCTING
4835 (TREE_TYPE (new_decls
))));
4841 cp_error ("jump to label `%D'", decl
);
4842 error_with_file_and_line
4843 (uses
->filename_o_goto
,
4844 uses
->lineno_o_goto
, " from here");
4848 cp_pedwarn ("jump to label `%D'", decl
);
4849 pedwarn_with_file_and_line
4850 (uses
->filename_o_goto
,
4851 uses
->lineno_o_goto
, " from here");
4857 cp_error_at (" crosses initialization of `%#D'",
4860 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4863 new_decls
= TREE_CHAIN (new_decls
);
4865 if (b
== uses
->binding_level
)
4867 if (b
->eh_region
&& ! saw_eh
)
4871 cp_error ("jump to label `%D'", decl
);
4872 error_with_file_and_line
4873 (uses
->filename_o_goto
,
4874 uses
->lineno_o_goto
, " from here");
4877 error (" enters exception handling block");
4884 prev
->next
= uses
->next
;
4886 named_label_uses
= uses
->next
;
4895 current_function_return_value
= NULL_TREE
;
4902 struct binding_level
*level
;
4903 struct cp_switch
*next
;
4906 static struct cp_switch
*switch_stack
;
4912 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4913 p
->level
= current_binding_level
;
4914 p
->next
= switch_stack
;
4921 switch_stack
= switch_stack
->next
;
4924 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4925 /* XXX Note decl is never actually used. (bpk) */
4928 define_case_label ()
4930 tree cleanup
= last_cleanup_this_contour ();
4931 struct binding_level
*b
= current_binding_level
;
4936 static int explained
= 0;
4937 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4938 warning ("where case label appears here");
4941 warning ("(enclose actions of previous case statements requiring");
4942 warning ("destructors in their own binding contours.)");
4947 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4949 tree new_decls
= b
->names
;
4950 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4952 if (TREE_CODE (new_decls
) == VAR_DECL
4953 /* Don't complain about crossing initialization
4954 of internal entities. They can't be accessed,
4955 and they should be cleaned up
4956 by the time we get to the label. */
4957 && ! DECL_ARTIFICIAL (new_decls
)
4958 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4959 && DECL_INITIAL (new_decls
) != error_mark_node
)
4960 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4963 error ("jump to case label");
4965 cp_error_at (" crosses initialization of `%#D'",
4971 /* After labels, make any new cleanups go into their
4972 own new (temporary) binding contour. */
4974 current_binding_level
->more_cleanups_ok
= 0;
4975 current_function_return_value
= NULL_TREE
;
4978 /* Return the list of declarations of the current level.
4979 Note that this list is in reverse order unless/until
4980 you nreverse it; and when you do nreverse it, you must
4981 store the result back using `storedecls' or you will lose. */
4986 return current_binding_level
->names
;
4989 /* Return the list of type-tags (for structs, etc) of the current level. */
4994 return current_binding_level
->tags
;
4997 /* Store the list of declarations of the current level.
4998 This is done for the parameter declarations of a function being defined,
4999 after they are modified in the light of any missing parameters. */
5005 current_binding_level
->names
= decls
;
5008 /* Similarly, store the list of tags of the current level. */
5014 current_binding_level
->tags
= tags
;
5017 /* Given NAME, an IDENTIFIER_NODE,
5018 return the structure (or union or enum) definition for that name.
5019 Searches binding levels from BINDING_LEVEL up to the global level.
5020 If THISLEVEL_ONLY is nonzero, searches only the specified context
5021 (but skips any tag-transparent contexts to find one that is
5022 meaningful for tags).
5023 FORM says which kind of type the caller wants;
5024 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5025 If the wrong kind of type is found, and it's not a template, an error is
5029 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5030 enum tree_code form
;
5032 struct binding_level
*binding_level
;
5035 register struct binding_level
*level
;
5036 /* Non-zero if, we should look past a pseudo-global level, even if
5038 int allow_pseudo_global
= 1;
5040 for (level
= binding_level
; level
; level
= level
->level_chain
)
5043 if (ANON_AGGRNAME_P (name
))
5044 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5046 /* There's no need for error checking here, because
5047 anon names are unique throughout the compilation. */
5048 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5049 return TREE_VALUE (tail
);
5051 else if (level
->namespace_p
)
5052 /* Do namespace lookup. */
5053 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5055 tree old
= binding_for_name (name
, tail
);
5057 /* If we just skipped past a pseudo global level, even
5058 though THISLEVEL_ONLY, and we find a template class
5059 declaration, then we use the _TYPE node for the
5060 template. See the example below. */
5061 if (thislevel_only
&& !allow_pseudo_global
5062 && old
&& BINDING_VALUE (old
)
5063 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5064 old
= TREE_TYPE (BINDING_VALUE (old
));
5066 old
= BINDING_TYPE (old
);
5068 /* If it has an original type, it is a typedef, and we
5069 should not return it. */
5070 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5072 if (old
&& TREE_CODE (old
) != form
5073 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5075 cp_error ("`%#D' redeclared as %C", old
, form
);
5080 if (thislevel_only
|| tail
== global_namespace
)
5084 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5086 if (TREE_PURPOSE (tail
) == name
)
5088 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5089 /* Should tighten this up; it'll probably permit
5090 UNION_TYPE and a struct template, for example. */
5092 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5094 /* Definition isn't the kind we were looking for. */
5095 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5099 return TREE_VALUE (tail
);
5102 if (thislevel_only
&& ! level
->tag_transparent
)
5104 if (level
->pseudo_global
&& allow_pseudo_global
)
5106 /* We must deal with cases like this:
5108 template <class T> struct S;
5109 template <class T> struct S {};
5111 When looking up `S', for the second declaration, we
5112 would like to find the first declaration. But, we
5113 are in the pseudo-global level created for the
5114 template parameters, rather than the (surrounding)
5115 namespace level. Thus, we keep going one more level,
5116 even though THISLEVEL_ONLY is non-zero. */
5117 allow_pseudo_global
= 0;
5129 set_current_level_tags_transparency (tags_transparent
)
5130 int tags_transparent
;
5132 current_binding_level
->tag_transparent
= tags_transparent
;
5136 /* Given a type, find the tag that was defined for it and return the tag name.
5137 Otherwise return 0. However, the value can never be 0
5138 in the cases in which this is used.
5140 C++: If NAME is non-zero, this is the new name to install. This is
5141 done when replacing anonymous tags with real tag names. */
5144 lookup_tag_reverse (type
, name
)
5148 register struct binding_level
*level
;
5150 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5153 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5155 if (TREE_VALUE (tail
) == type
)
5158 TREE_PURPOSE (tail
) = name
;
5159 return TREE_PURPOSE (tail
);
5166 /* Look up NAME in the NAMESPACE. */
5169 lookup_namespace_name (namespace, name
)
5170 tree
namespace, name
;
5173 tree template_id
= NULL_TREE
;
5175 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5177 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5178 /* This happens for A::B<int> when B is a namespace. */
5180 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5182 /* This happens for A::B where B is a template, and there are no
5183 template arguments. */
5184 cp_error ("invalid use of `%D'", name
);
5185 return error_mark_node
;
5188 namespace = ORIGINAL_NAMESPACE (namespace);
5190 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5193 name
= TREE_OPERAND (name
, 0);
5194 if (TREE_CODE (name
) == OVERLOAD
)
5195 name
= DECL_NAME (OVL_CURRENT (name
));
5196 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5197 name
= DECL_NAME (name
);
5200 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5202 val
= make_node (CPLUS_BINDING
);
5203 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5204 return error_mark_node
;
5206 if (BINDING_VALUE (val
))
5208 val
= BINDING_VALUE (val
);
5212 if (DECL_CLASS_TEMPLATE_P (val
))
5213 val
= lookup_template_class (val
,
5214 TREE_OPERAND (template_id
, 1),
5215 /*in_decl=*/NULL_TREE
,
5216 /*context=*/NULL_TREE
,
5217 /*entering_scope=*/0);
5218 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5219 || TREE_CODE (val
) == OVERLOAD
)
5220 val
= lookup_template_function (val
,
5221 TREE_OPERAND (template_id
, 1));
5224 cp_error ("`%D::%D' is not a template",
5226 return error_mark_node
;
5230 /* If we have a single function from a using decl, pull it out. */
5231 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5232 val
= OVL_FUNCTION (val
);
5236 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5237 return error_mark_node
;
5240 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5242 static unsigned long
5250 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5251 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5256 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5259 typename_compare (k1
, k2
)
5270 d1
= TYPE_NAME (t1
);
5271 d2
= TYPE_NAME (t2
);
5273 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5274 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5275 && ((TREE_TYPE (t1
) != NULL_TREE
)
5276 == (TREE_TYPE (t2
) != NULL_TREE
))
5277 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5278 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5281 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5282 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5283 is non-NULL, this type is being created by the implicit typename
5284 extension, and BASE_TYPE is a type named `t' in some base class of
5285 `T' which depends on template parameters.
5287 Returns the new TYPENAME_TYPE. */
5290 build_typename_type (context
, name
, fullname
, base_type
)
5298 struct hash_entry
* e
;
5300 static struct hash_table ht
;
5302 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5306 static struct hash_table
*h
= &ht
;
5307 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5309 fatal ("virtual memory exhausted");
5310 ggc_add_tree_hash_table_root (&h
, 1);
5313 /* Build the TYPENAME_TYPE. */
5314 t
= make_lang_type (TYPENAME_TYPE
);
5315 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5316 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5317 TREE_TYPE (t
) = base_type
;
5319 /* Build the corresponding TYPE_DECL. */
5320 d
= build_decl (TYPE_DECL
, name
, t
);
5321 TYPE_NAME (TREE_TYPE (d
)) = d
;
5322 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5323 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5324 DECL_ARTIFICIAL (d
) = 1;
5326 /* See if we already have this type. */
5327 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5331 /* Insert the type into the table. */
5332 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5340 make_typename_type (context
, name
)
5345 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5347 if (!(TYPE_LANG_SPECIFIC (name
)
5348 && (CLASSTYPE_IS_TEMPLATE (name
)
5349 || CLASSTYPE_USE_TEMPLATE (name
))))
5350 name
= TYPE_IDENTIFIER (name
);
5352 /* Create a TEMPLATE_ID_EXPR for the type. */
5353 name
= build_nt (TEMPLATE_ID_EXPR
,
5354 CLASSTYPE_TI_TEMPLATE (name
),
5355 CLASSTYPE_TI_ARGS (name
));
5357 else if (TREE_CODE (name
) == TYPE_DECL
)
5358 name
= DECL_NAME (name
);
5362 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5364 name
= TREE_OPERAND (name
, 0);
5365 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5366 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5368 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5369 my_friendly_abort (2000);
5371 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5373 /* We can get here from typename_sub0 in the explicit_template_type
5374 expansion. Just fail. */
5375 cp_error ("no class template named `%#T' in `%#T'",
5377 return error_mark_node
;
5380 if (! uses_template_parms (context
)
5381 || currently_open_class (context
))
5383 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5385 tree tmpl
= NULL_TREE
;
5386 if (IS_AGGR_TYPE (context
))
5387 tmpl
= lookup_field (context
, name
, 0, 0);
5388 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5390 cp_error ("no class template named `%#T' in `%#T'",
5392 return error_mark_node
;
5395 return lookup_template_class (tmpl
,
5396 TREE_OPERAND (fullname
, 1),
5398 /*entering_scope=*/0);
5404 if (!IS_AGGR_TYPE (context
))
5406 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5407 return error_mark_node
;
5410 t
= lookup_field (context
, name
, 0, 1);
5412 return TREE_TYPE (t
);
5416 /* If the CONTEXT is not a template type, then either the field is
5417 there now or its never going to be. */
5418 if (!uses_template_parms (context
))
5420 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5421 return error_mark_node
;
5425 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5428 /* Select the right _DECL from multiple choices. */
5431 select_decl (binding
, flags
)
5436 val
= BINDING_VALUE (binding
);
5437 if (LOOKUP_NAMESPACES_ONLY (flags
))
5439 /* We are not interested in types. */
5440 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5445 /* If we could have a type and
5446 we have nothing or we need a type and have none. */
5447 if (BINDING_TYPE (binding
)
5448 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5449 && TREE_CODE (val
) != TYPE_DECL
)))
5450 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5451 /* Don't return non-types if we really prefer types. */
5452 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5453 && (TREE_CODE (val
) != TEMPLATE_DECL
5454 || !DECL_CLASS_TEMPLATE_P (val
)))
5460 /* Unscoped lookup of a global: iterate over current namespaces,
5461 considering using-directives. If SPACESP is non-NULL, store a list
5462 of the namespaces we've considered in it. */
5465 unqualified_namespace_lookup (name
, flags
, spacesp
)
5470 tree b
= make_node (CPLUS_BINDING
);
5471 tree initial
= current_decl_namespace();
5472 tree scope
= initial
;
5474 struct binding_level
*level
;
5475 tree val
= NULL_TREE
;
5478 *spacesp
= NULL_TREE
;
5480 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5483 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5484 val
= binding_for_name (name
, scope
);
5486 /* Initialize binding for this context. */
5487 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5488 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5490 /* Add all _DECLs seen through local using-directives. */
5491 for (level
= current_binding_level
;
5492 !level
->namespace_p
;
5493 level
= level
->level_chain
)
5494 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5495 scope
, flags
, spacesp
))
5496 /* Give up because of error. */
5497 return error_mark_node
;
5499 /* Add all _DECLs seen through global using-directives. */
5500 /* XXX local and global using lists should work equally. */
5504 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5505 scope
, flags
, spacesp
))
5506 /* Give up because of error. */
5507 return error_mark_node
;
5508 if (siter
== scope
) break;
5509 siter
= CP_DECL_CONTEXT (siter
);
5512 val
= select_decl (b
, flags
);
5513 if (scope
== global_namespace
)
5519 /* Combine prefer_type and namespaces_only into flags. */
5522 lookup_flags (prefer_type
, namespaces_only
)
5523 int prefer_type
, namespaces_only
;
5525 if (namespaces_only
)
5526 return LOOKUP_PREFER_NAMESPACES
;
5527 if (prefer_type
> 1)
5528 return LOOKUP_PREFER_TYPES
;
5529 if (prefer_type
> 0)
5530 return LOOKUP_PREFER_BOTH
;
5534 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5535 ignore it or not. Subroutine of lookup_name_real. */
5538 qualify_lookup (val
, flags
)
5542 if (val
== NULL_TREE
)
5544 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5546 if ((flags
& LOOKUP_PREFER_TYPES
)
5547 && (TREE_CODE (val
) == TYPE_DECL
5548 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5549 && DECL_CLASS_TEMPLATE_P (val
))))
5551 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5556 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5560 warn_about_implicit_typename_lookup (typename
, binding
)
5564 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5565 tree name
= DECL_NAME (typename
);
5567 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5568 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5569 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5570 && ! (TREE_CODE (binding
) == TYPE_DECL
5571 && same_type_p (TREE_TYPE (binding
), subtype
)))
5573 cp_warning ("lookup of `%D' finds `%#D'",
5575 cp_warning (" instead of `%D' from dependent base class",
5577 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5578 constructor_name (current_class_type
), name
);
5582 /* Look up NAME in the current binding level and its superiors in the
5583 namespace of variables, functions and typedefs. Return a ..._DECL
5584 node of some kind representing its definition if there is only one
5585 such declaration, or return a TREE_LIST with all the overloaded
5586 definitions if there are many, or return 0 if it is undefined.
5588 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5589 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5590 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5591 Otherwise we prefer non-TYPE_DECLs.
5593 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5594 using IDENTIFIER_CLASS_VALUE. */
5597 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5599 int prefer_type
, nonclass
, namespaces_only
;
5602 tree val
= NULL_TREE
;
5604 tree from_obj
= NULL_TREE
;
5606 int val_is_implicit_typename
= 0;
5608 /* Hack: copy flag set by parser, if set. */
5609 if (only_namespace_names
)
5610 namespaces_only
= 1;
5612 if (prefer_type
== -2)
5614 extern int looking_for_typename
;
5615 tree type
= NULL_TREE
;
5618 prefer_type
= looking_for_typename
;
5620 flags
= lookup_flags (prefer_type
, namespaces_only
);
5621 /* If the next thing is '<', class templates are types. */
5622 if (looking_for_template
)
5623 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5625 /* std:: becomes :: for now. */
5626 if (got_scope
== std_node
)
5627 got_scope
= void_type_node
;
5631 else if (got_object
!= error_mark_node
)
5636 if (type
== error_mark_node
)
5637 return error_mark_node
;
5638 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5639 type
= TREE_TYPE (type
);
5642 type
= complete_type (type
);
5644 if (TREE_CODE (type
) == VOID_TYPE
)
5645 type
= global_namespace
;
5646 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5648 val
= make_node (CPLUS_BINDING
);
5649 flags
|= LOOKUP_COMPLAIN
;
5650 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5652 val
= select_decl (val
, flags
);
5654 else if (! IS_AGGR_TYPE (type
)
5655 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5656 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5657 || TREE_CODE (type
) == TYPENAME_TYPE
)
5658 /* Someone else will give an error about this if needed. */
5660 else if (type
== current_class_type
)
5661 val
= IDENTIFIER_CLASS_VALUE (name
);
5663 val
= lookup_member (type
, name
, 0, prefer_type
);
5670 else if (got_object
&& val
)
5675 flags
= lookup_flags (prefer_type
, namespaces_only
);
5676 /* If we're not parsing, we need to complain. */
5677 flags
|= LOOKUP_COMPLAIN
;
5680 /* First, look in non-namespace scopes. */
5682 if (current_class_type
== NULL_TREE
)
5685 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5689 if (!LOCAL_BINDING_P (t
) && nonclass
)
5690 /* We're not looking for class-scoped bindings, so keep going. */
5693 /* If this is the kind of thing we're looking for, we're done. */
5694 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5695 binding
= BINDING_VALUE (t
);
5696 else if ((flags
& LOOKUP_PREFER_TYPES
)
5697 && qualify_lookup (BINDING_TYPE (t
), flags
))
5698 binding
= BINDING_TYPE (t
);
5700 binding
= NULL_TREE
;
5703 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5705 if (val_is_implicit_typename
&& !yylex
)
5706 warn_about_implicit_typename_lookup (val
, binding
);
5708 val_is_implicit_typename
5709 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5710 if (!val_is_implicit_typename
)
5715 /* Now lookup in namespace scopes. */
5716 if (!val
|| val_is_implicit_typename
)
5718 t
= unqualified_namespace_lookup (name
, flags
, 0);
5721 if (val_is_implicit_typename
&& !yylex
)
5722 warn_about_implicit_typename_lookup (val
, t
);
5730 /* This should only warn about types used in qualified-ids. */
5731 if (from_obj
&& from_obj
!= val
)
5733 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5734 && TREE_CODE (val
) == TYPE_DECL
5735 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5737 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5738 name
, got_object
, TREE_TYPE (from_obj
));
5739 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5743 /* We don't change val to from_obj if got_object depends on
5744 template parms because that breaks implicit typename for
5745 destructor calls. */
5746 if (! uses_template_parms (got_object
))
5750 /* If we have a single function from a using decl, pull it out. */
5751 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5752 val
= OVL_FUNCTION (val
);
5761 lookup_name_nonclass (name
)
5764 return lookup_name_real (name
, 0, 1, 0);
5768 lookup_function_nonclass (name
, args
)
5772 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5776 lookup_name_namespace_only (name
)
5779 /* type-or-namespace, nonclass, namespace_only */
5780 return lookup_name_real (name
, 1, 1, 1);
5784 lookup_name (name
, prefer_type
)
5788 return lookup_name_real (name
, prefer_type
, 0, 0);
5791 /* Similar to `lookup_name' but look only in the innermost non-class
5795 lookup_name_current_level (name
)
5798 struct binding_level
*b
;
5801 b
= current_binding_level
;
5802 while (b
->parm_flag
== 2)
5807 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5809 /* extern "C" function() */
5810 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5813 else if (IDENTIFIER_BINDING (name
)
5814 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5818 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5819 return IDENTIFIER_VALUE (name
);
5831 /* Like lookup_name_current_level, but for types. */
5834 lookup_type_current_level (name
)
5837 register tree t
= NULL_TREE
;
5839 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5841 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5842 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5844 struct binding_level
*b
= current_binding_level
;
5847 if (purpose_member (name
, b
->type_shadowed
))
5848 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5860 begin_only_namespace_names ()
5862 only_namespace_names
= 1;
5866 end_only_namespace_names ()
5868 only_namespace_names
= 0;
5871 /* Arrange for the user to get a source line number, even when the
5872 compiler is going down in flames, so that she at least has a
5873 chance of working around problems in the compiler. We used to
5874 call error(), but that let the segmentation fault continue
5875 through; now, it's much more passive by asking them to send the
5876 maintainers mail about the problem. */
5880 int sig ATTRIBUTE_UNUSED
;
5882 signal (SIGSEGV
, SIG_DFL
);
5884 signal (SIGIOT
, SIG_DFL
);
5887 signal (SIGILL
, SIG_DFL
);
5890 signal (SIGABRT
, SIG_DFL
);
5893 signal (SIGBUS
, SIG_DFL
);
5895 my_friendly_abort (0);
5898 /* Push the declarations of builtin types into the namespace.
5899 RID_INDEX, if < RID_MAX is the index of the builtin type
5900 in the array RID_POINTERS. NAME is the name used when looking
5901 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5904 record_builtin_type (rid_index
, name
, type
)
5909 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5910 tree tdecl
= NULL_TREE
;
5912 if ((int) rid_index
< (int) RID_MAX
)
5913 rname
= ridpointers
[(int) rid_index
];
5915 tname
= get_identifier (name
);
5917 TYPE_BUILT_IN (type
) = 1;
5921 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5922 set_identifier_type_value (tname
, NULL_TREE
);
5923 if ((int) rid_index
< (int) RID_MAX
)
5924 /* Built-in types live in the global namespace. */
5925 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5927 if (rname
!= NULL_TREE
)
5929 if (tname
!= NULL_TREE
)
5931 set_identifier_type_value (rname
, NULL_TREE
);
5932 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5936 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5937 set_identifier_type_value (rname
, NULL_TREE
);
5942 /* Record one of the standard Java types.
5943 * Declare it as having the given NAME.
5944 * If SIZE > 0, it is the size of one of the integral types;
5945 * otherwise it is the negative of the size of one of the other types. */
5948 record_builtin_java_type (name
, size
)
5954 type
= make_signed_type (size
);
5955 else if (size
> -32)
5956 { /* "__java_char" or ""__java_boolean". */
5957 type
= make_unsigned_type (-size
);
5958 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5961 { /* "__java_float" or ""__java_double". */
5962 type
= make_node (REAL_TYPE
);
5963 TYPE_PRECISION (type
) = - size
;
5966 record_builtin_type (RID_MAX
, name
, type
);
5967 decl
= TYPE_NAME (type
);
5969 /* Suppress generate debug symbol entries for these types,
5970 since for normal C++ they are just clutter.
5971 However, push_lang_context undoes this if extern "Java" is seen. */
5972 DECL_IGNORED_P (decl
) = 1;
5974 TYPE_FOR_JAVA (type
) = 1;
5978 /* Push a type into the namespace so that the back-ends ignore it. */
5981 record_unknown_type (type
, name
)
5985 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5986 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5987 DECL_IGNORED_P (decl
) = 1;
5988 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5989 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5990 TYPE_ALIGN (type
) = 1;
5991 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5994 /* Push overloaded decl, in global scope, with one argument so it
5995 can be used as a callback from define_function. */
5998 push_overloaded_decl_1 (x
)
6001 push_overloaded_decl (x
, PUSH_GLOBAL
);
6008 auto_function (name
, type
, code
)
6010 enum built_in_function code
;
6012 return define_function
6013 (IDENTIFIER_POINTER (name
), type
, code
, push_overloaded_decl_1
,
6014 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
6018 /* Create the predefined scalar types of C,
6019 and some nodes representing standard constants (0, 1, (void *)0).
6020 Initialize the global binding level.
6021 Make definitions for built-in primitive functions. */
6024 init_decl_processing ()
6027 int wchar_type_size
;
6028 tree array_domain_type
;
6030 /* Have to make these distinct before we try using them. */
6031 lang_name_cplusplus
= get_identifier ("C++");
6032 lang_name_c
= get_identifier ("C");
6033 lang_name_java
= get_identifier ("Java");
6035 /* Let the back-end now how to save and restore language-specific
6036 per-function globals. */
6037 save_lang_status
= &push_cp_function_context
;
6038 restore_lang_status
= &pop_cp_function_context
;
6039 mark_lang_status
= &mark_cp_function_context
;
6045 /* Create the global variables. */
6046 push_to_top_level ();
6048 /* Enter the global namespace. */
6049 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6050 push_namespace (get_identifier ("::"));
6051 global_namespace
= current_namespace
;
6052 current_lang_name
= NULL_TREE
;
6054 if (flag_strict_prototype
== 2)
6055 flag_strict_prototype
= pedantic
;
6056 if (! flag_permissive
&& ! pedantic
)
6057 flag_pedantic_errors
= 1;
6059 strict_prototypes_lang_c
= flag_strict_prototype
;
6062 current_lang_name
= lang_name_c
;
6064 current_function_decl
= NULL_TREE
;
6065 named_labels
= NULL_TREE
;
6066 named_label_uses
= NULL
;
6067 current_binding_level
= NULL_BINDING_LEVEL
;
6068 free_binding_level
= NULL_BINDING_LEVEL
;
6070 /* Because most segmentation signals can be traced back into user
6071 code, catch them and at least give the user a chance of working
6072 around compiler bugs. */
6073 signal (SIGSEGV
, signal_catch
);
6075 /* We will also catch aborts in the back-end through signal_catch and
6076 give the user a chance to see where the error might be, and to defeat
6077 aborts in the back-end when there have been errors previously in their
6080 signal (SIGIOT
, signal_catch
);
6083 signal (SIGILL
, signal_catch
);
6086 signal (SIGABRT
, signal_catch
);
6089 signal (SIGBUS
, signal_catch
);
6092 gcc_obstack_init (&decl_obstack
);
6094 /* Must lay these out before anything else gets laid out. */
6095 error_mark_node
= make_node (ERROR_MARK
);
6096 TREE_PERMANENT (error_mark_node
) = 1;
6097 TREE_TYPE (error_mark_node
) = error_mark_node
;
6098 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6099 TREE_TYPE (error_mark_list
) = error_mark_node
;
6101 /* Make the binding_level structure for global names. */
6103 global_binding_level
= current_binding_level
;
6104 /* The global level is the namespace level of ::. */
6105 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6106 declare_namespace_level ();
6108 this_identifier
= get_identifier (THIS_NAME
);
6109 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6110 ctor_identifier
= get_identifier (CTOR_NAME
);
6111 dtor_identifier
= get_identifier (DTOR_NAME
);
6112 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6113 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6114 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6115 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6116 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6118 /* Define `int' and `char' first so that dbx will output them first. */
6120 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
6121 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6123 /* Define `char', which is like either `signed char' or `unsigned char'
6124 but not the same as either. */
6128 ? make_signed_type (CHAR_TYPE_SIZE
)
6129 : make_unsigned_type (CHAR_TYPE_SIZE
));
6130 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6132 /* `signed' is the same as `int' */
6133 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6135 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
6136 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6138 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
6139 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6141 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
6142 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6143 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6145 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
6146 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6148 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
6149 record_builtin_type (RID_MAX
, "long long unsigned int",
6150 long_long_unsigned_type_node
);
6151 record_builtin_type (RID_MAX
, "long long unsigned",
6152 long_long_unsigned_type_node
);
6154 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
6155 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6156 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
6157 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6158 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6160 /* `unsigned long' is the standard type for sizeof.
6161 Note that stddef.h uses `unsigned long',
6162 and this must agree, even if long and int are the same size. */
6164 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6167 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6169 /* Define both `signed char' and `unsigned char'. */
6170 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
6171 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6172 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
6173 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6175 /* Create the widest literal types. */
6176 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6177 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6178 widest_integer_literal_type_node
));
6180 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6181 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6182 widest_unsigned_literal_type_node
));
6184 /* These are types that type_for_size and type_for_mode use. */
6185 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
6186 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6187 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
6188 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6189 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
6190 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6191 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
6192 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6193 #if HOST_BITS_PER_WIDE_INT >= 64
6194 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
6195 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6197 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
6198 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6199 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
6200 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6201 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
6202 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6203 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
6204 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6205 #if HOST_BITS_PER_WIDE_INT >= 64
6206 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
6207 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6210 float_type_node
= make_node (REAL_TYPE
);
6211 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
6212 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6213 layout_type (float_type_node
);
6215 double_type_node
= make_node (REAL_TYPE
);
6216 if (flag_short_double
)
6217 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
6219 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
6220 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6221 layout_type (double_type_node
);
6223 long_double_type_node
= make_node (REAL_TYPE
);
6224 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
6225 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6226 layout_type (long_double_type_node
);
6228 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
6229 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6230 complex_integer_type_node
));
6231 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
6232 layout_type (complex_integer_type_node
);
6234 complex_float_type_node
= make_node (COMPLEX_TYPE
);
6235 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6236 complex_float_type_node
));
6237 TREE_TYPE (complex_float_type_node
) = float_type_node
;
6238 layout_type (complex_float_type_node
);
6240 complex_double_type_node
= make_node (COMPLEX_TYPE
);
6241 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6242 complex_double_type_node
));
6243 TREE_TYPE (complex_double_type_node
) = double_type_node
;
6244 layout_type (complex_double_type_node
);
6246 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
6247 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6248 complex_long_double_type_node
));
6249 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
6250 layout_type (complex_long_double_type_node
);
6252 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6253 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6254 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6255 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6256 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6257 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6258 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6259 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6261 integer_zero_node
= build_int_2 (0, 0);
6262 TREE_TYPE (integer_zero_node
) = integer_type_node
;
6263 integer_one_node
= build_int_2 (1, 0);
6264 TREE_TYPE (integer_one_node
) = integer_type_node
;
6265 integer_two_node
= build_int_2 (2, 0);
6266 TREE_TYPE (integer_two_node
) = integer_type_node
;
6267 integer_three_node
= build_int_2 (3, 0);
6268 TREE_TYPE (integer_three_node
) = integer_type_node
;
6270 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6271 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6272 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6273 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6274 TYPE_PRECISION (boolean_type_node
) = 1;
6275 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6276 boolean_false_node
= build_int_2 (0, 0);
6277 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6278 boolean_true_node
= build_int_2 (1, 0);
6279 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6281 /* These are needed by stor-layout.c. */
6282 size_zero_node
= size_int (0);
6283 size_one_node
= size_int (1);
6285 signed_size_zero_node
= build_int_2 (0, 0);
6286 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6288 void_type_node
= make_node (VOID_TYPE
);
6289 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6290 layout_type (void_type_node
); /* Uses integer_zero_node. */
6291 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6292 TREE_PARMLIST (void_list_node
) = 1;
6294 null_pointer_node
= build_int_2 (0, 0);
6295 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
6296 layout_type (TREE_TYPE (null_pointer_node
));
6298 /* Used for expressions that do nothing, but are not errors. */
6299 void_zero_node
= build_int_2 (0, 0);
6300 TREE_TYPE (void_zero_node
) = void_type_node
;
6302 string_type_node
= build_pointer_type (char_type_node
);
6303 const_string_type_node
6304 = build_pointer_type (build_qualified_type (char_type_node
,
6306 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6308 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6311 /* Make a type to be the domain of a few array types
6312 whose domains don't really matter.
6313 200 is small enough that it always fits in size_t
6314 and large enough that it can hold most function names for the
6315 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6316 array_domain_type
= build_index_type (build_int_2 (200, 0));
6318 /* Make a type for arrays of characters.
6319 With luck nothing will ever really depend on the length of this
6321 char_array_type_node
6322 = build_array_type (char_type_node
, array_domain_type
);
6323 /* Likewise for arrays of ints. */
6325 = build_array_type (integer_type_node
, array_domain_type
);
6327 /* This is just some anonymous class type. Nobody should ever
6328 need to look inside this envelope. */
6329 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6331 if (flag_huge_objects
)
6332 delta_type_node
= long_integer_type_node
;
6334 delta_type_node
= short_integer_type_node
;
6336 default_function_type
6337 = build_function_type (integer_type_node
, NULL_TREE
);
6339 ptr_type_node
= build_pointer_type (void_type_node
);
6341 = build_pointer_type (build_qualified_type (void_type_node
,
6343 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6346 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6348 /* C++ extensions */
6350 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6351 record_unknown_type (unknown_type_node
, "unknown type");
6353 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6354 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6356 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6358 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6360 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6361 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6363 /* This is special for C++ so functions can be overloaded. */
6365 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6366 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6367 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6368 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6370 = TREE_UNSIGNED (wchar_type_node
)
6371 ? unsigned_wchar_type_node
6372 : signed_wchar_type_node
;
6373 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6375 /* Artificial declaration of wchar_t -- can be bashed */
6376 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6378 pushdecl (wchar_decl_node
);
6380 /* This is for wide string constants. */
6381 wchar_array_type_node
6382 = build_array_type (wchar_type_node
, array_domain_type
);
6384 if (flag_vtable_thunks
)
6386 /* Make sure we get a unique function type, so we can give
6387 its pointer type a name. (This wins for gdb.) */
6388 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6389 TREE_TYPE (vfunc_type
) = integer_type_node
;
6390 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6391 layout_type (vfunc_type
);
6393 vtable_entry_type
= build_pointer_type (vfunc_type
);
6397 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6398 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6400 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6402 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6404 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6407 /* Make this part of an invisible union. */
6408 fields
[3] = copy_node (fields
[2]);
6409 TREE_TYPE (fields
[3]) = delta_type_node
;
6410 DECL_NAME (fields
[3]) = delta2_identifier
;
6411 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6412 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6413 TREE_UNSIGNED (fields
[3]) = 0;
6414 TREE_CHAIN (fields
[2]) = fields
[3];
6415 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6418 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6421 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6422 layout_type (vtbl_type_node
);
6423 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6424 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6425 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6426 layout_type (vtbl_ptr_type_node
);
6427 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6429 std_node
= build_decl (NAMESPACE_DECL
,
6430 get_identifier (flag_honor_std
? "fake std":"std"),
6432 pushdecl (std_node
);
6434 global_type_node
= make_node (LANG_TYPE
);
6435 record_unknown_type (global_type_node
, "global type");
6438 current_lang_name
= lang_name_cplusplus
;
6441 tree bad_alloc_type_node
, newtype
, deltype
;
6443 push_namespace (get_identifier ("std"));
6444 bad_alloc_type_node
= xref_tag
6445 (class_type_node
, get_identifier ("bad_alloc"), 1);
6448 newtype
= build_exception_variant
6449 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6450 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6451 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6452 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6453 global_delete_fndecl
6454 = auto_function (ansi_opname
[(int) DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6455 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6459 = define_function ("__pure_virtual", void_ftype
,
6460 NOT_BUILT_IN
, 0, 0);
6462 /* Perform other language dependent initializations. */
6463 init_class_processing ();
6464 init_init_processing ();
6465 init_search_processing ();
6467 init_rtti_processing ();
6469 if (flag_exceptions
)
6470 init_exception_processing ();
6473 flag_inline_functions
= 0;
6476 if (! supports_one_only ())
6479 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6480 declare_function_name ();
6482 /* Prepare to check format strings against argument lists. */
6483 init_function_format_info ();
6485 /* Show we use EH for cleanups. */
6486 using_eh_for_cleanups ();
6488 print_error_function
= lang_print_error_function
;
6489 lang_get_alias_set
= &c_get_alias_set
;
6490 valid_lang_attribute
= cp_valid_lang_attribute
;
6492 /* Maintain consistency. Perhaps we should just complain if they
6493 say -fwritable-strings? */
6494 if (flag_writable_strings
)
6495 flag_const_strings
= 0;
6497 /* Add GC roots for all of our global variables. */
6498 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6499 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6500 ggc_add_tree_root (&char_type_node
, 1);
6501 ggc_add_tree_root (&error_mark_node
, 1);
6502 ggc_add_tree_root (&integer_type_node
, 1);
6503 ggc_add_tree_root (&integer_three_node
, 1);
6504 ggc_add_tree_root (&integer_two_node
, 1);
6505 ggc_add_tree_root (&integer_one_node
, 1);
6506 ggc_add_tree_root (&integer_zero_node
, 1);
6507 ggc_add_tree_root (&signed_size_zero_node
, 1);
6508 ggc_add_tree_root (&size_one_node
, 1);
6509 ggc_add_tree_root (&size_zero_node
, 1);
6510 ggc_add_tree_root (&unsigned_type_node
, 1);
6511 ggc_add_tree_root (&ptr_type_node
, 1);
6512 ggc_add_tree_root (&null_pointer_node
, 1);
6513 ggc_add_tree_root (&va_list_type_node
, 1);
6514 ggc_add_tree_root (&void_type_node
, 1);
6515 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6516 mark_binding_level
);
6517 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6518 ggc_add_tree_root (&static_ctors
, 1);
6519 ggc_add_tree_root (&static_dtors
, 1);
6520 ggc_add_tree_root (&lastiddecl
, 1);
6522 ggc_add_tree_root (&enum_next_value
, 1);
6523 ggc_add_tree_root (&last_function_parm_tags
, 1);
6524 ggc_add_tree_root (¤t_function_return_value
, 1);
6525 ggc_add_tree_root (¤t_function_parms
, 1);
6526 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6527 ggc_add_tree_root (&last_function_parms
, 1);
6528 ggc_add_tree_root (&error_mark_list
, 1);
6530 ggc_add_tree_root (&global_namespace
, 1);
6531 ggc_add_tree_root (&global_type_node
, 1);
6532 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6534 ggc_add_tree_root (&got_object
, 1);
6535 ggc_add_tree_root (&got_scope
, 1);
6537 ggc_add_tree_root (¤t_lang_name
, 1);
6538 ggc_add_tree_root (&static_aggregates
, 1);
6541 /* Function to print any language-specific context for an error message. */
6544 lang_print_error_function (file
)
6547 default_print_error_function (file
);
6548 maybe_print_template_context ();
6551 /* Make a definition for a builtin function named NAME and whose data type
6552 is TYPE. TYPE should be a function type with argument types.
6553 FUNCTION_CODE tells later passes how to compile calls to this function.
6554 See tree.h for its possible values.
6556 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6557 the name to be called if we can't opencode the function. */
6560 define_function (name
, type
, function_code
, pfn
, library_name
)
6563 enum built_in_function function_code
;
6564 void (*pfn
) PROTO((tree
));
6565 const char *library_name
;
6567 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6568 DECL_EXTERNAL (decl
) = 1;
6569 TREE_PUBLIC (decl
) = 1;
6570 DECL_ARTIFICIAL (decl
) = 1;
6572 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6573 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6575 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6576 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6577 function in the namespace. */
6578 if (pfn
) (*pfn
) (decl
);
6580 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6581 make_function_rtl (decl
);
6582 if (function_code
!= NOT_BUILT_IN
)
6584 DECL_BUILT_IN (decl
) = 1;
6585 DECL_FUNCTION_CODE (decl
) = function_code
;
6591 builtin_function (name
, type
, code
, libname
)
6594 enum built_in_function code
;
6595 const char *libname
;
6597 return define_function (name
, type
, code
, (void (*) PROTO((tree
)))pushdecl
, libname
);
6600 /* When we call finish_struct for an anonymous union, we create
6601 default copy constructors and such. But, an anonymous union
6602 shouldn't have such things; this function undoes the damage to the
6603 anonymous union type T.
6605 (The reason that we create the synthesized methods is that we don't
6606 distinguish `union { int i; }' from `typedef union { int i; } U'.
6607 The first is an anonymous union; the second is just an ordinary
6611 fixup_anonymous_aggr (t
)
6616 /* Wipe out memory of synthesized methods */
6617 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6618 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6619 TYPE_HAS_INIT_REF (t
) = 0;
6620 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6621 TYPE_HAS_ASSIGN_REF (t
) = 0;
6622 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6624 /* Splice the implicitly generated functions out of the TYPE_METHODS
6626 q
= &TYPE_METHODS (t
);
6629 if (DECL_ARTIFICIAL (*q
))
6630 *q
= TREE_CHAIN (*q
);
6632 q
= &TREE_CHAIN (*q
);
6635 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6636 function members. */
6637 if (TYPE_METHODS (t
))
6638 error ("an anonymous union cannot have function members");
6641 /* Make sure that a declaration with no declarator is well-formed, i.e.
6642 just defines a tagged type or anonymous union.
6644 Returns the type defined, if any. */
6647 check_tag_decl (declspecs
)
6651 tree ob_modifier
= NULL_TREE
;
6653 register tree t
= NULL_TREE
;
6655 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6657 register tree value
= TREE_VALUE (link
);
6663 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6665 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6669 else if (value
== ridpointers
[(int) RID_FRIEND
])
6671 if (current_class_type
== NULL_TREE
6672 || current_scope () != current_class_type
)
6673 ob_modifier
= value
;
6675 else if (value
== ridpointers
[(int) RID_STATIC
]
6676 || value
== ridpointers
[(int) RID_EXTERN
]
6677 || value
== ridpointers
[(int) RID_AUTO
]
6678 || value
== ridpointers
[(int) RID_REGISTER
]
6679 || value
== ridpointers
[(int) RID_INLINE
]
6680 || value
== ridpointers
[(int) RID_VIRTUAL
]
6681 || value
== ridpointers
[(int) RID_CONST
]
6682 || value
== ridpointers
[(int) RID_VOLATILE
]
6683 || value
== ridpointers
[(int) RID_EXPLICIT
])
6684 ob_modifier
= value
;
6688 error ("multiple types in one declaration");
6690 /* Inside a class, we might be in a friend or access declaration.
6691 Until we have a good way of detecting the latter, don't warn. */
6692 if (t
== NULL_TREE
&& ! current_class_type
)
6693 pedwarn ("declaration does not declare anything");
6695 /* Check for an anonymous union. We're careful
6696 accessing TYPE_IDENTIFIER because some built-in types, like
6697 pointer-to-member types, do not have TYPE_NAME. */
6698 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6700 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6702 /* Anonymous unions are objects, so they can have specifiers. */;
6703 SET_ANON_AGGR_TYPE_P (t
);
6705 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6706 pedwarn ("ISO C++ prohibits anonymous structs");
6709 else if (ob_modifier
)
6711 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6712 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6713 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6714 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6715 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6716 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6717 cp_error ("`%D' can only be specified for constructors",
6720 cp_error ("`%D' can only be specified for objects and functions",
6727 /* Called when a declaration is seen that contains no names to declare.
6728 If its type is a reference to a structure, union or enum inherited
6729 from a containing scope, shadow that tag name for the current scope
6730 with a forward reference.
6731 If its type defines a new named structure or union
6732 or defines an enum, it is valid but we need not do anything here.
6733 Otherwise, it is an error.
6735 C++: may have to grok the declspecs to learn about static,
6736 complain for anonymous unions. */
6739 shadow_tag (declspecs
)
6742 tree t
= check_tag_decl (declspecs
);
6745 maybe_process_partial_specialization (t
);
6747 /* This is where the variables in an anonymous union are
6748 declared. An anonymous union declaration looks like:
6750 because there is no declarator after the union, the parser
6751 sends that declaration here. */
6752 if (t
&& ANON_AGGR_TYPE_P (t
))
6754 fixup_anonymous_aggr (t
);
6756 if (TYPE_FIELDS (t
))
6758 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6760 finish_anon_union (decl
);
6765 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6768 groktypename (typename
)
6771 if (TREE_CODE (typename
) != TREE_LIST
)
6773 return grokdeclarator (TREE_VALUE (typename
),
6774 TREE_PURPOSE (typename
),
6775 TYPENAME
, 0, NULL_TREE
);
6778 /* Decode a declarator in an ordinary declaration or data definition.
6779 This is called as soon as the type information and variable name
6780 have been parsed, before parsing the initializer if any.
6781 Here we create the ..._DECL node, fill in its type,
6782 and put it on the list of decls for the current context.
6783 The ..._DECL node is returned as the value.
6785 Exception: for arrays where the length is not specified,
6786 the type is left null, to be filled in by `cp_finish_decl'.
6788 Function definitions do not come here; they go to start_function
6789 instead. However, external and forward declarations of functions
6790 do go through here. Structure field declarations are done by
6791 grokfield and not through here. */
6793 /* Set this to zero to debug not using the temporary obstack
6794 to parse initializers. */
6795 int debug_temp_inits
= 1;
6798 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6799 tree declarator
, declspecs
;
6801 tree attributes
, prefix_attributes
;
6804 register tree type
, tem
;
6806 extern int have_extern_spec
;
6807 extern int used_extern_spec
;
6811 /* See code below that used this. */
6812 int init_written
= initialized
;
6815 /* This should only be done once on the top most decl. */
6816 if (have_extern_spec
&& !used_extern_spec
)
6818 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6820 used_extern_spec
= 1;
6823 if (attributes
|| prefix_attributes
)
6824 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6826 attrlist
= NULL_TREE
;
6828 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6831 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6834 type
= TREE_TYPE (decl
);
6836 if (type
== error_mark_node
)
6839 /* Don't lose if destructors must be executed at file-level. */
6840 if (! processing_template_decl
&& TREE_STATIC (decl
)
6841 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
6842 && !TREE_PERMANENT (decl
))
6844 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6845 decl
= copy_node (decl
);
6846 if (TREE_CODE (type
) == ARRAY_TYPE
)
6848 tree itype
= TYPE_DOMAIN (type
);
6849 if (itype
&& ! TREE_PERMANENT (itype
))
6851 itype
= build_index_type (TYPE_MAX_VALUE (itype
));
6852 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
6853 TREE_TYPE (decl
) = type
;
6860 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6861 ? DECL_CLASS_CONTEXT (decl
)
6862 : DECL_CONTEXT (decl
);
6864 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6865 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6867 /* When parsing the initializer, lookup should use the object's
6869 push_decl_namespace (context
);
6872 /* We are only interested in class contexts, later. */
6873 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6874 context
= NULL_TREE
;
6877 /* Is it valid for this decl to have an initializer at all?
6878 If not, set INITIALIZED to zero, which will indirectly
6879 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6880 switch (TREE_CODE (decl
))
6883 /* typedef foo = bar means give foo the same type as bar.
6884 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6885 Any other case of an initialization in a TYPE_DECL is an error. */
6886 if (pedantic
|| list_length (declspecs
) > 1)
6888 cp_error ("typedef `%D' is initialized", decl
);
6894 cp_error ("function `%#D' is initialized like a variable", decl
);
6904 if (! toplevel_bindings_p ()
6905 && DECL_EXTERNAL (decl
))
6906 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6908 DECL_EXTERNAL (decl
) = 0;
6909 if (toplevel_bindings_p ())
6910 TREE_STATIC (decl
) = 1;
6912 /* Tell `pushdecl' this is an initialized decl
6913 even though we don't yet have the initializer expression.
6914 Also tell `cp_finish_decl' it may store the real initializer. */
6915 DECL_INITIAL (decl
) = error_mark_node
;
6918 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6919 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6922 /* Set attributes here so if duplicate decl, will have proper attributes. */
6923 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6925 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6927 push_nested_class (context
, 2);
6929 if (TREE_CODE (decl
) == VAR_DECL
)
6931 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6932 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6933 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6936 if (DECL_CONTEXT (field
) != context
)
6938 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6939 DECL_CONTEXT (field
), DECL_NAME (decl
),
6940 context
, DECL_NAME (decl
));
6941 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6943 /* Static data member are tricky; an in-class initialization
6944 still doesn't provide a definition, so the in-class
6945 declaration will have DECL_EXTERNAL set, but will have an
6946 initialization. Thus, duplicate_decls won't warn
6947 about this situation, and so we check here. */
6948 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6949 cp_error ("duplicate initialization of %D", decl
);
6950 if (duplicate_decls (decl
, field
))
6956 tree field
= check_classfn (context
, decl
);
6957 if (field
&& duplicate_decls (decl
, field
))
6961 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6962 DECL_IN_AGGR_P (decl
) = 0;
6963 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6964 || CLASSTYPE_USE_TEMPLATE (context
))
6966 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6967 /* [temp.expl.spec] An explicit specialization of a static data
6968 member of a template is a definition if the declaration
6969 includes an initializer; otherwise, it is a declaration.
6971 We check for processing_specialization so this only applies
6972 to the new specialization syntax. */
6973 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6974 DECL_EXTERNAL (decl
) = 1;
6977 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6978 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6982 /* Enter this declaration into the symbol table. */
6983 tem
= maybe_push_decl (decl
);
6985 if (processing_template_decl
)
6987 if (at_function_scope_p ())
6988 push_permanent_obstack ();
6990 tem
= push_template_decl (tem
);
6991 /* In a a local scope, add a representation of this declaration
6992 to the statement tree. */
6993 if (at_function_scope_p ())
6995 add_decl_stmt (decl
);
7001 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7002 /* Tell the back-end to use or not use .common as appropriate. If we say
7003 -fconserve-space, we want this to save .data space, at the expense of
7004 wrong semantics. If we say -fno-conserve-space, we want this to
7005 produce errors about redefs; to do this we force variables into the
7007 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7010 if (! processing_template_decl
)
7013 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
7014 push_obstacks_nochange ();
7023 tree type
= TREE_TYPE (decl
);
7024 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7026 if (type
== error_mark_node
)
7029 /* If this type of object needs a cleanup, and control may
7030 jump past it, make a new binding level so that it is cleaned
7031 up only when it is initialized first. */
7032 if (TYPE_NEEDS_DESTRUCTOR (type
)
7033 && current_binding_level
->more_cleanups_ok
== 0)
7034 pushlevel_temporary (1);
7037 /* Is it valid for this decl to have an initializer at all?
7038 If not, set INITIALIZED to zero, which will indirectly
7039 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7041 /* Don't allow initializations for incomplete types except for
7042 arrays which might be completed by the initialization. */
7043 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
7044 ; /* A complete type is ok. */
7045 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7047 cp_error ("variable `%#D' has initializer but incomplete type",
7050 type
= TREE_TYPE (decl
) = error_mark_node
;
7052 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
7054 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7055 cp_error ("elements of array `%#D' have incomplete type", decl
);
7056 /* else we already gave an error in start_decl. */
7062 && TREE_CODE (decl
) != TYPE_DECL
7063 && TREE_CODE (decl
) != TEMPLATE_DECL
7064 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
7066 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7067 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
7069 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7071 /* Change the type so that assemble_variable will give
7072 DECL an rtl we can live with: (mem (const_int 0)). */
7073 type
= TREE_TYPE (decl
) = error_mark_node
;
7077 /* If any base type in the hierarchy of TYPE needs a constructor,
7078 then we set initialized to 1. This way any nodes which are
7079 created for the purposes of initializing this aggregate
7080 will live as long as it does. This is necessary for global
7081 aggregates which do not have their initializers processed until
7082 the end of the file. */
7083 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7088 DECL_INITIAL (decl
) = NULL_TREE
;
7091 /* Handle initialization of references.
7092 These three arguments are from `cp_finish_decl', and have the
7093 same meaning here that they do there.
7095 Quotes on semantics can be found in ARM 8.4.3. */
7098 grok_reference_init (decl
, type
, init
)
7099 tree decl
, type
, init
;
7103 if (init
== NULL_TREE
)
7105 if ((DECL_LANG_SPECIFIC (decl
) == 0
7106 || DECL_IN_AGGR_P (decl
) == 0)
7107 && ! DECL_THIS_EXTERN (decl
))
7109 cp_error ("`%D' declared as reference but not initialized", decl
);
7110 if (TREE_CODE (decl
) == VAR_DECL
)
7111 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7116 if (init
== error_mark_node
)
7119 if (TREE_CODE (type
) == REFERENCE_TYPE
7120 && TREE_CODE (init
) == CONSTRUCTOR
)
7122 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
7126 if (TREE_CODE (init
) == TREE_LIST
)
7127 init
= build_compound_expr (init
);
7129 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7130 init
= convert_from_reference (init
);
7132 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7133 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7135 /* Note: default conversion is only called in very special cases. */
7136 init
= default_conversion (init
);
7139 tmp
= convert_to_reference
7140 (type
, init
, CONV_IMPLICIT
,
7141 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
7143 if (tmp
== error_mark_node
)
7145 else if (tmp
!= NULL_TREE
)
7148 DECL_INITIAL (decl
) = save_expr (init
);
7152 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7156 /* ?? Can this be optimized in some cases to
7157 hand back the DECL_INITIAL slot?? */
7158 if (TYPE_SIZE (TREE_TYPE (type
)))
7160 init
= convert_from_reference (decl
);
7161 SET_DECL_REFERENCE_SLOT (decl
, init
);
7164 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7166 expand_static_init (decl
, DECL_INITIAL (decl
));
7167 DECL_INITIAL (decl
) = NULL_TREE
;
7172 if (TREE_CODE (decl
) == VAR_DECL
)
7173 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7177 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7178 mucking with forces it does not comprehend (i.e. initialization with a
7179 constructor). If we are at global scope and won't go into COMMON, fill
7180 it in with a dummy CONSTRUCTOR to force the variable into .data;
7181 otherwise we can use error_mark_node. */
7184 obscure_complex_init (decl
, init
)
7187 if (! flag_no_inline
&& TREE_STATIC (decl
))
7189 if (extract_init (decl
, init
))
7193 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7194 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7195 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7199 DECL_INITIAL (decl
) = error_mark_node
;
7204 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7205 array until we finish parsing the initializer. If that's the
7206 situation we're in, update DECL accordingly. */
7209 maybe_deduce_size_from_array_init (decl
, init
)
7213 tree type
= TREE_TYPE (decl
);
7215 if (TREE_CODE (type
) == ARRAY_TYPE
7216 && TYPE_DOMAIN (type
) == NULL_TREE
7217 && TREE_CODE (decl
) != TYPE_DECL
)
7220 = (TREE_STATIC (decl
)
7221 /* Even if pedantic, an external linkage array
7222 may have incomplete type at first. */
7223 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7224 : !DECL_EXTERNAL (decl
));
7225 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7226 int failure
= complete_array_type (type
, initializer
, do_default
);
7229 cp_error ("initializer fails to determine size of `%D'", decl
);
7234 cp_error ("array size missing in `%D'", decl
);
7235 /* If a `static' var's size isn't known, make it extern as
7236 well as static, so it does not get allocated. If it's not
7237 `static', then don't mark it extern; finish_incomplete_decl
7238 will give it a default size and it will get allocated. */
7239 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7240 DECL_EXTERNAL (decl
) = 1;
7243 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7244 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7246 cp_error ("zero-size array `%D'", decl
);
7248 layout_decl (decl
, 0);
7252 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7253 any appropriate error messages regarding the layout. INIT is a
7254 the initializer for DECL; returns a modified version. */
7257 layout_var_decl (decl
, init
)
7261 tree ttype
= target_type (TREE_TYPE (decl
));
7263 /* If we haven't already layed out this declaration, and we know its
7264 type, do so now. Note that we must not call complete type for an
7265 external object because it's type might involve templates that we
7266 are not supposed to isntantiate yet. */
7267 if (!DECL_EXTERNAL (decl
)
7268 && DECL_SIZE (decl
) == NULL_TREE
7269 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7270 layout_decl (decl
, 0);
7272 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7274 /* An automatic variable with an incomplete type: that is an error.
7275 Don't talk about array types here, since we took care of that
7276 message in grokdeclarator. */
7277 cp_error ("storage size of `%D' isn't known", decl
);
7278 TREE_TYPE (decl
) = error_mark_node
;
7280 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7281 /* Let debugger know it should output info for this type. */
7282 note_debug_info_needed (ttype
);
7284 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7285 note_debug_info_needed (DECL_CONTEXT (decl
));
7287 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7288 && DECL_SIZE (decl
) != NULL_TREE
7289 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7291 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7292 constant_expression_warning (DECL_SIZE (decl
));
7294 cp_error ("storage size of `%D' isn't constant", decl
);
7300 /* Return a cleanup for DECL, created on whatever obstack is
7304 build_cleanup_on_safe_obstack (decl
)
7311 type
= TREE_TYPE (decl
);
7313 /* Only variables get cleaned up. */
7314 if (TREE_CODE (decl
) != VAR_DECL
)
7317 /* And only things with destructors need cleaning up. */
7318 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7321 if (TREE_CODE (decl
) == VAR_DECL
&&
7322 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7323 /* We don't clean up things that aren't defined in this
7324 translation unit, or that need a static cleanup. The latter
7325 are handled by finish_file. */
7328 /* Switch to an obstack that will live until the point where the
7329 cleanup code is actually expanded. */
7330 need_pop
= suspend_momentary ();
7332 /* Compute the cleanup. */
7333 cleanup
= maybe_build_cleanup (decl
);
7335 /* Pop back to the obstack we were on before. */
7336 resume_momentary (need_pop
);
7341 /* If a local static variable is declared in an inline function, or if
7342 we have a weak definition, we must endeavor to create only one
7343 instance of the variable at link-time. */
7346 maybe_commonize_var (decl
)
7349 /* Static data in a function with comdat linkage also has comdat
7351 if (TREE_STATIC (decl
)
7352 /* Don't mess with __FUNCTION__. */
7353 && ! TREE_ASM_WRITTEN (decl
)
7354 && current_function_decl
7355 && DECL_CONTEXT (decl
) == current_function_decl
7356 && (DECL_THIS_INLINE (current_function_decl
)
7357 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7358 && TREE_PUBLIC (current_function_decl
))
7360 /* Rather than try to get this right with inlining, we suppress
7361 inlining of such functions. */
7362 current_function_cannot_inline
7363 = "function with static variable cannot be inline";
7365 /* If flag_weak, we don't need to mess with this, as we can just
7366 make the function weak, and let it refer to its unique local
7367 copy. This works because we don't allow the function to be
7371 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7373 TREE_PUBLIC (decl
) = 1;
7374 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7376 else if (DECL_INITIAL (decl
) == NULL_TREE
7377 || DECL_INITIAL (decl
) == error_mark_node
)
7379 TREE_PUBLIC (decl
) = 1;
7380 DECL_COMMON (decl
) = 1;
7382 /* else we lose. We can only do this if we can use common,
7383 which we can't if it has been initialized. */
7385 if (TREE_PUBLIC (decl
))
7386 DECL_ASSEMBLER_NAME (decl
)
7387 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7388 else if (! DECL_ARTIFICIAL (decl
))
7390 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7391 cp_warning_at (" you can work around this by removing the initializer", decl
);
7395 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7396 /* Set it up again; we might have set DECL_INITIAL since the last
7398 comdat_linkage (decl
);
7401 /* Issue an error message if DECL is an uninitialized const variable. */
7404 check_for_uninitialized_const_var (decl
)
7407 tree type
= TREE_TYPE (decl
);
7409 /* ``Unless explicitly declared extern, a const object does not have
7410 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7412 if (TREE_CODE (decl
) == VAR_DECL
7413 && TREE_CODE (type
) != REFERENCE_TYPE
7414 && CP_TYPE_CONST_P (type
)
7415 && !TYPE_NEEDS_CONSTRUCTING (type
)
7416 && !DECL_INITIAL (decl
))
7417 cp_error ("uninitialized const `%D'", decl
);
7420 /* Verify INIT (the initializer for DECL), and record the
7421 initialization in DECL_INITIAL, if appropriate. Returns a new
7425 check_initializer (decl
, init
)
7431 if (TREE_CODE (decl
) == FIELD_DECL
)
7434 type
= TREE_TYPE (decl
);
7436 /* If `start_decl' didn't like having an initialization, ignore it now. */
7437 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7440 /* Check the initializer. */
7443 /* Things that are going to be initialized need to have complete
7445 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7447 if (type
== error_mark_node
)
7448 /* We will have already complained. */
7450 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7452 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7455 else if (TREE_CODE (type
) == ARRAY_TYPE
7456 && !TYPE_SIZE (TREE_TYPE (type
)))
7458 cp_error ("elements of array `%#D' have incomplete type", decl
);
7461 else if (!TYPE_SIZE (type
))
7463 cp_error ("`%D' has incomplete type", decl
);
7464 TREE_TYPE (decl
) = error_mark_node
;
7469 if (TREE_CODE (decl
) == CONST_DECL
)
7471 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7473 DECL_INITIAL (decl
) = init
;
7475 /* This will keep us from needing to worry about our obstacks. */
7476 my_friendly_assert (init
!= NULL_TREE
, 149);
7479 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7481 if (TREE_STATIC (decl
))
7482 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7483 grok_reference_init (decl
, type
, init
);
7488 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7490 if (TREE_CODE (type
) == ARRAY_TYPE
)
7491 init
= digest_init (type
, init
, (tree
*) 0);
7492 else if (TREE_CODE (init
) == CONSTRUCTOR
7493 && TREE_HAS_CONSTRUCTOR (init
))
7495 if (TYPE_NON_AGGREGATE_CLASS (type
))
7497 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7499 init
= error_mark_node
;
7502 goto dont_use_constructor
;
7507 dont_use_constructor
:
7508 if (TREE_CODE (init
) != TREE_VEC
)
7509 init
= store_init_value (decl
, init
);
7513 /* We must hide the initializer so that expand_decl
7514 won't try to do something it does not understand. */
7515 init
= obscure_complex_init (decl
, init
);
7517 else if (DECL_EXTERNAL (decl
))
7519 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7520 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7522 tree core_type
= strip_array_types (type
);
7524 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7526 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7527 cp_error ("structure `%D' with uninitialized const members", decl
);
7528 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7529 cp_error ("structure `%D' with uninitialized reference members",
7533 check_for_uninitialized_const_var (decl
);
7535 if (TYPE_SIZE (type
) != NULL_TREE
7536 && TYPE_NEEDS_CONSTRUCTING (type
))
7537 init
= obscure_complex_init (decl
, NULL_TREE
);
7541 check_for_uninitialized_const_var (decl
);
7546 /* If DECL is not a local variable, give it RTL. */
7549 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7552 const char *asmspec
;
7557 type
= TREE_TYPE (decl
);
7558 toplev
= toplevel_bindings_p ();
7559 push_obstacks_nochange ();
7560 if (TREE_STATIC (decl
)
7561 && TYPE_NEEDS_DESTRUCTOR (type
)
7562 && allocation_temporary_p ())
7563 end_temporary_allocation ();
7565 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7566 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7567 else if (TREE_CODE (decl
) == VAR_DECL
7568 && TREE_READONLY (decl
)
7569 && DECL_INITIAL (decl
) != NULL_TREE
7570 && DECL_INITIAL (decl
) != error_mark_node
7571 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7573 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7576 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7579 && TREE_STATIC (decl
)
7580 && ! TREE_SIDE_EFFECTS (decl
)
7581 && ! TREE_PUBLIC (decl
)
7582 && ! DECL_EXTERNAL (decl
)
7583 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7584 && DECL_MODE (decl
) != BLKmode
)
7586 /* If this variable is really a constant, then fill its DECL_RTL
7587 slot with something which won't take up storage.
7588 If something later should take its address, we can always give
7589 it legitimate RTL at that time. */
7590 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7591 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7592 TREE_ASM_WRITTEN (decl
) = 1;
7594 else if (toplev
&& ! TREE_PUBLIC (decl
))
7596 /* If this is a static const, change its apparent linkage
7597 if it belongs to a #pragma interface. */
7598 if (!interface_unknown
)
7600 TREE_PUBLIC (decl
) = 1;
7601 DECL_EXTERNAL (decl
) = interface_only
;
7603 make_decl_rtl (decl
, asmspec
, toplev
);
7606 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7608 else if (TREE_CODE (decl
) == VAR_DECL
7609 && DECL_LANG_SPECIFIC (decl
)
7610 && DECL_IN_AGGR_P (decl
))
7612 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7614 if (init
== NULL_TREE
7615 #ifdef DEFAULT_STATIC_DEFS
7616 /* If this code is dead, then users must
7617 explicitly declare static member variables
7618 outside the class def'n as well. */
7619 && TYPE_NEEDS_CONSTRUCTING (type
)
7623 DECL_EXTERNAL (decl
) = 1;
7624 make_decl_rtl (decl
, asmspec
, 1);
7627 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7630 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7635 /* The old ARM scoping rules injected variables declared in the
7636 initialization statement of a for-statement into the surrounding
7637 scope. We support this usage, in order to be backward-compatible.
7638 DECL is a just-declared VAR_DECL; if necessary inject its
7639 declaration into the surrounding scope. */
7642 maybe_inject_for_scope_var (decl
)
7645 if (current_binding_level
->is_for_scope
)
7647 struct binding_level
*outer
7648 = current_binding_level
->level_chain
;
7650 /* Check to see if the same name is already bound at the outer
7651 level, either because it was directly declared, or because a
7652 dead for-decl got preserved. In either case, the code would
7653 not have been valid under the ARM scope rules, so clear
7654 is_for_scope for the current_binding_level.
7656 Otherwise, we need to preserve the temp slot for decl to last
7657 into the outer binding level. */
7660 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7662 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7663 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7665 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7667 BINDING_VALUE (outer_binding
)
7668 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7669 current_binding_level
->is_for_scope
= 0;
7671 else if (DECL_IN_MEMORY_P (decl
))
7672 preserve_temp_slots (DECL_RTL (decl
));
7676 /* Generate code to initialized DECL (a local variable). */
7679 initialize_local_var (decl
, init
, flags
)
7687 type
= complete_type (TREE_TYPE (decl
));
7689 cleanup
= build_cleanup_on_safe_obstack (decl
);
7691 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7693 /* If we used it already as memory, it must stay in memory. */
7694 DECL_INITIAL (decl
) = NULL_TREE
;
7695 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7698 if (DECL_RTL (decl
))
7699 /* Only a RESULT_DECL should have non-NULL RTL when arriving here.
7700 All other local variables are assigned RTL in this function. */
7701 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
, 19990828);
7703 /* Create RTL for this variable. */
7706 expand_start_target_temps ();
7708 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7712 /* Compute and store the initial value. */
7713 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7715 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7717 emit_line_note (DECL_SOURCE_FILE (decl
),
7718 DECL_SOURCE_LINE (decl
));
7719 /* We call push_momentary here so that when
7720 finish_expr_stmt clears the momentary obstack it
7721 doesn't destory any momentary expressions we may
7722 have lying around. Although cp_finish_decl is
7723 usually called at the end of a declaration
7724 statement, it may also be called for a temporary
7725 object in the middle of an expression. */
7727 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7731 expand_decl_init (decl
);
7733 /* Set this to 0 so we can tell whether an aggregate which was
7734 initialized was ever used. Don't do this if it has a
7735 destructor, so we don't complain about the 'resource
7736 allocation is initialization' idiom. Now set
7737 attribute((unused)) on types so decls of that type will be
7738 marked used. (see TREE_USED, above.) */
7739 if (TYPE_NEEDS_CONSTRUCTING (type
)
7741 && cleanup
== NULL_TREE
7742 && DECL_NAME (decl
))
7743 TREE_USED (decl
) = 0;
7744 else if (already_used
)
7745 TREE_USED (decl
) = 1;
7748 /* Cleanup any temporaries needed for the initial value. */
7749 expand_end_target_temps ();
7751 /* Record the cleanup required for this declaration. */
7752 if (DECL_SIZE (decl
)
7753 && type
!= error_mark_node
7755 && !expand_decl_cleanup (decl
, cleanup
))
7756 cp_error ("parser lost in parsing declaration of `%D'", decl
);
7759 /* Finish processing of a declaration;
7760 install its line number and initial value.
7761 If the length of an array type is not known before,
7762 it must be determined now, from the initial value, or it is an error.
7764 Call `pop_obstacks' iff NEED_POP is nonzero.
7766 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7767 for aggregates that have constructors alive on the permanent obstack,
7768 so that the global initializing functions can be written at the end.
7770 INIT0 holds the value of an initializer that should be allowed to escape
7773 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7774 if the (init) syntax was used.
7776 For functions that take default parameters, DECL points to its
7777 "maximal" instantiation. `cp_finish_decl' must then also declared its
7778 subsequently lower and lower forms of instantiation, checking for
7779 ambiguity as it goes. This can be sped up later. */
7782 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7789 tree ttype
= NULL_TREE
;
7790 int temporary
= allocation_temporary_p ();
7791 const char *asmspec
= NULL
;
7792 int was_readonly
= 0;
7794 /* If this is 0, then we did not change obstacks. */
7798 error ("assignment (not initialization) in declaration");
7802 /* If a name was specified, get the string. */
7804 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7806 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7808 cp_error ("Cannot initialize `%D' to namespace `%D'",
7813 if (current_class_type
7814 && DECL_REAL_CONTEXT (decl
) == current_class_type
7815 && TYPE_BEING_DEFINED (current_class_type
)
7816 && (DECL_INITIAL (decl
) || init
))
7817 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7819 if (TREE_CODE (decl
) == VAR_DECL
7820 && DECL_CONTEXT (decl
)
7821 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7822 && DECL_CONTEXT (decl
) != current_namespace
7825 /* Leave the namespace of the object. */
7826 pop_decl_namespace ();
7829 type
= TREE_TYPE (decl
);
7831 if (type
== error_mark_node
)
7833 if (toplevel_bindings_p () && temporary
)
7834 end_temporary_allocation ();
7839 if (TYPE_HAS_MUTABLE_P (type
))
7840 TREE_READONLY (decl
) = 0;
7842 if (processing_template_decl
)
7844 if (init
&& DECL_INITIAL (decl
))
7845 DECL_INITIAL (decl
) = init
;
7849 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7850 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7852 /* Take care of TYPE_DECLs up front. */
7853 if (TREE_CODE (decl
) == TYPE_DECL
)
7855 if (init
&& DECL_INITIAL (decl
))
7857 /* typedef foo = bar; store the type of bar as the type of foo. */
7858 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7859 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7861 if (type
!= error_mark_node
7862 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7864 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7865 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7866 set_identifier_type_value (DECL_NAME (decl
), type
);
7867 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7869 GNU_xref_decl (current_function_decl
, decl
);
7871 /* If we have installed this as the canonical typedef for this
7872 type, and that type has not been defined yet, delay emitting
7873 the debug information for it, as we will emit it later. */
7874 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7875 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7876 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7878 rest_of_decl_compilation (decl
, NULL_PTR
,
7879 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7883 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7884 ttype
= target_type (type
);
7886 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7887 && TYPE_NEEDS_CONSTRUCTING (type
))
7889 /* Currently, GNU C++ puts constants in text space, making them
7890 impossible to initialize. In the future, one would hope for
7891 an operating system which understood the difference between
7892 initialization and the running of a program. */
7894 TREE_READONLY (decl
) = 0;
7897 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7899 /* This must override the asm specifier which was placed by
7900 grokclassfn. Lay this out fresh. */
7901 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7902 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7903 make_decl_rtl (decl
, asmspec
, 0);
7906 /* Deduce size of array from initialization, if not already known. */
7907 maybe_deduce_size_from_array_init (decl
, init
);
7908 init
= check_initializer (decl
, init
);
7910 GNU_xref_decl (current_function_decl
, decl
);
7912 /* For top-level declaration, the initial value was read in
7913 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7914 must go in the permanent obstack; but don't discard the
7915 temporary data yet. */
7917 if (toplevel_bindings_p () && temporary
)
7918 end_temporary_allocation ();
7920 if (TREE_CODE (decl
) == VAR_DECL
)
7921 init
= layout_var_decl (decl
, init
);
7923 /* Output the assembler code and/or RTL code for variables and functions,
7924 unless the type is an undefined structure or union.
7925 If not, it will get done when the type is completed. */
7926 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7927 || TREE_CODE (decl
) == RESULT_DECL
)
7929 /* ??? FIXME: What about nested classes? */
7930 int toplev
= toplevel_bindings_p ();
7932 if (TREE_CODE (decl
) == VAR_DECL
)
7933 maybe_commonize_var (decl
);
7935 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7937 if (TREE_CODE (type
) == FUNCTION_TYPE
7938 || TREE_CODE (type
) == METHOD_TYPE
)
7939 abstract_virtuals_error (decl
,
7940 strip_array_types (TREE_TYPE (type
)));
7942 abstract_virtuals_error (decl
, strip_array_types (type
));
7944 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7946 else if (DECL_EXTERNAL (decl
)
7947 && ! (DECL_LANG_SPECIFIC (decl
)
7948 && DECL_NOT_REALLY_EXTERN (decl
)))
7951 DECL_INITIAL (decl
) = init
;
7953 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7955 /* Cleanups for static variables are handled by `finish_file'. */
7956 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7957 || TYPE_NEEDS_DESTRUCTOR (type
))
7958 expand_static_init (decl
, init
);
7962 /* This is a local declaration. */
7963 maybe_inject_for_scope_var (decl
);
7964 /* Initialize the local variable. But, if we're building a
7965 statement-tree, we'll do the initialization when we
7967 if (!building_stmt_tree ())
7968 initialize_local_var (decl
, init
, flags
);
7969 else if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7970 DECL_INITIAL (decl
) = init
;
7974 /* Undo call to `pushclass' that was done in `start_decl'
7975 due to initialization of qualified member variable.
7976 I.e., Foo::x = 10; */
7978 tree context
= DECL_REAL_CONTEXT (decl
);
7980 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7981 && (TREE_CODE (decl
) == VAR_DECL
7982 /* We also have a pushclass done that we need to undo here
7983 if we're at top level and declare a method. */
7984 || TREE_CODE (decl
) == FUNCTION_DECL
)
7985 /* If size hasn't been set, we're still defining it,
7986 and therefore inside the class body; don't pop
7987 the binding level.. */
7988 && TYPE_SIZE (context
) != NULL_TREE
7989 && context
== current_class_type
)
7990 pop_nested_class ();
7996 /* If requested, warn about definitions of large data objects. */
7998 if (warn_larger_than
7999 && ! processing_template_decl
8000 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
8001 && !DECL_EXTERNAL (decl
))
8003 register tree decl_size
= DECL_SIZE (decl
);
8005 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
8007 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
8009 if (units
> larger_than_size
)
8010 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
8015 /* Resume permanent allocation, if not within a function. The
8016 corresponding push_obstacks_nochange is in start_decl,
8017 start_method, groktypename, and in grokfield. */
8021 TREE_READONLY (decl
) = 1;
8024 /* This is here for a midend callback from c-common.c */
8027 finish_decl (decl
, init
, asmspec_tree
)
8031 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
8035 expand_static_init (decl
, init
)
8039 tree oldstatic
= value_member (decl
, static_aggregates
);
8043 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8044 cp_error ("multiple initializations given for `%D'", decl
);
8046 else if (! toplevel_bindings_p ())
8048 /* Emit code to perform this initialization but once. */
8054 /* Remember this information until end of file. */
8055 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8057 /* Emit code to perform this initialization but once. This code
8060 static int temp = 0;
8062 // Do initialization.
8064 // Register variable for destruction at end of program.
8067 Note that the `temp' variable is only set to 1 *after* the
8068 initialization is complete. This ensures that an exception,
8069 thrown during the construction, will cause the variable to
8070 reinitialized when we pass through this code again, as per:
8074 If the initialization exits by throwing an exception, the
8075 initialization is not complete, so it will be tried again
8076 the next time control enters the declaration.
8078 In theory, this process should be thread-safe, too; multiple
8079 threads should not be able to initialize the variable more
8080 than once. We don't yet attempt to ensure thread-safety. */
8081 temp
= get_temp_name (integer_type_node
, 1);
8082 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8084 /* Begin the conditional initialization. */
8085 if_stmt
= begin_if_stmt ();
8086 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
8090 /* Do the initialization itself. */
8091 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8092 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8093 assignment
= build_aggr_init (decl
, init
, 0);
8095 /* The initialization we're doing here is just a bitwise
8097 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8099 assignment
= NULL_TREE
;
8101 /* Once the assignment is complete, set TEMP to 1. Since the
8102 construction of the static object is complete at this point,
8103 we want to make sure TEMP is set to 1 even if a temporary
8104 constructed during the initialization throws an exception
8105 when it is destroyed. So, we combine the initialization and
8106 the assignment to TEMP into a single expression, ensuring
8107 that when we call finish_expr_stmt the cleanups will not be
8108 run until after TEMP is set to 1. */
8109 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8112 assignment
= tree_cons (NULL_TREE
, assignment
,
8113 build_tree_list (NULL_TREE
,
8115 assignment
= build_compound_expr (assignment
);
8118 assignment
= temp_init
;
8119 finish_expr_stmt (assignment
);
8121 /* Use atexit to register a function for destroying this static
8123 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8125 tree cleanup
, fcall
;
8126 static tree Atexit
= 0;
8127 int saved_flag_access_control
;
8131 tree atexit_fndecl
, PFV
, pfvlist
;
8133 ggc_add_tree_root (&Atexit
, 1);
8135 /* Remember this information until end of file. */
8136 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8137 PFV
= build_pointer_type (build_function_type
8138 (void_type_node
, void_list_node
));
8140 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
8142 push_lang_context (lang_name_c
);
8143 /* Note that we do not call pushdecl for this function;
8144 there's no reason that this declaration should be
8145 accessible to anyone. */
8147 = define_function ("atexit",
8148 build_function_type (void_type_node
,
8153 mark_used (atexit_fndecl
);
8154 Atexit
= default_conversion (atexit_fndecl
);
8155 pop_lang_context ();
8159 /* Call build_cleanup before we enter the anonymous function
8160 so that any access checks will be done relative to the
8161 current scope, rather than the scope of the anonymous
8163 build_cleanup (decl
);
8165 /* Now start the function. */
8166 cleanup
= start_anon_func ();
8168 /* Now, recompute the cleanup. It may contain SAVE_EXPRs
8169 that refer to the original function, rather than the
8170 anonymous one. That will make the back-end think that
8171 nested functions are in use, which causes confusion. */
8172 saved_flag_access_control
= flag_access_control
;
8173 flag_access_control
= 0;
8174 fcall
= build_cleanup (decl
);
8175 flag_access_control
= saved_flag_access_control
;
8177 /* Finish off the function. */
8178 expand_expr_stmt (fcall
);
8181 /* Call atexit with the cleanup function. */
8182 mark_addressable (cleanup
);
8183 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8184 fcall
= build_function_call (Atexit
,
8185 tree_cons (NULL_TREE
,
8188 finish_expr_stmt (fcall
);
8191 finish_then_clause (if_stmt
);
8194 /* Resume old (possibly temporary) allocation. */
8199 /* This code takes into account memory allocation policy of
8200 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8201 hold for this object, then we must make permanent the storage
8202 currently in the temporary obstack. */
8203 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8204 preserve_initializer ();
8205 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8209 /* Finish the declaration of a catch-parameter. */
8212 start_handler_parms (declspecs
, declarator
)
8219 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8221 if (decl
== NULL_TREE
)
8222 error ("invalid catch parameter");
8226 expand_start_catch_block (decl
);
8230 /* Make TYPE a complete type based on INITIAL_VALUE.
8231 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8232 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8235 complete_array_type (type
, initial_value
, do_default
)
8236 tree type
, initial_value
;
8239 register tree maxindex
= NULL_TREE
;
8242 /* Allocate on the same obstack as TYPE. */
8243 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8247 /* Note MAXINDEX is really the maximum index,
8248 one less than the size. */
8249 if (TREE_CODE (initial_value
) == STRING_CST
)
8252 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8253 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8256 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8258 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8259 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8260 for (; elts
; elts
= TREE_CHAIN (elts
))
8262 if (TREE_PURPOSE (elts
))
8263 maxindex
= TREE_PURPOSE (elts
);
8265 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8267 maxindex
= copy_node (maxindex
);
8271 /* Make an error message unless that happened already. */
8272 if (initial_value
!= error_mark_node
)
8275 initial_value
= NULL_TREE
;
8277 /* Prevent further error messages. */
8278 maxindex
= build_int_2 (0, 0);
8285 maxindex
= build_int_2 (0, 0);
8294 domain
= build_index_type (maxindex
);
8295 TYPE_DOMAIN (type
) = domain
;
8297 if (! TREE_TYPE (maxindex
))
8298 TREE_TYPE (maxindex
) = domain
;
8300 itype
= TREE_TYPE (initial_value
);
8303 if (itype
&& !TYPE_DOMAIN (itype
))
8304 TYPE_DOMAIN (itype
) = domain
;
8305 /* The type of the main variant should never be used for arrays
8306 of different sizes. It should only ever be completed with the
8307 size of the array. */
8308 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8309 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8314 /* Lay out the type now that we can get the real answer. */
8321 /* Return zero if something is declared to be a member of type
8322 CTYPE when in the context of CUR_TYPE. STRING is the error
8323 message to print in that case. Otherwise, quietly return 1. */
8326 member_function_or_else (ctype
, cur_type
, string
)
8327 tree ctype
, cur_type
;
8330 if (ctype
&& ctype
!= cur_type
)
8332 error (string
, TYPE_NAME_STRING (ctype
));
8338 /* Subroutine of `grokdeclarator'. */
8340 /* Generate errors possibly applicable for a given set of specifiers.
8341 This is for ARM $7.1.2. */
8344 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8347 int virtualp
, quals
, friendp
, raises
, inlinep
;
8350 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8352 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8354 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8357 cp_error_at ("`%D' declared as a friend", object
);
8359 cp_error_at ("`%D' declared with an exception specification", object
);
8362 /* CTYPE is class type, or null if non-class.
8363 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8365 DECLARATOR is the function's name.
8366 VIRTUALP is truthvalue of whether the function is virtual or not.
8367 FLAGS are to be passed through to `grokclassfn'.
8368 QUALS are qualifiers indicating whether the function is `const'
8370 RAISES is a list of exceptions that this function can raise.
8371 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8372 not look, and -1 if we should not call `grokclassfn' at all.
8374 Returns `NULL_TREE' if something goes wrong, after issuing
8375 applicable error messages. */
8378 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8379 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8380 template_count
, in_namespace
)
8383 tree orig_declarator
;
8385 enum overload_flags flags
;
8387 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8391 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8392 int has_default_arg
= 0;
8396 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8397 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8403 type
= build_exception_variant (type
, raises
);
8406 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8407 /* Propagate volatile out from type to decl. */
8408 if (TYPE_VOLATILE (type
))
8409 TREE_THIS_VOLATILE (decl
) = 1;
8411 /* If this decl has namespace scope, set that up. */
8413 set_decl_namespace (decl
, in_namespace
, friendp
);
8414 else if (publicp
&& ! ctype
)
8415 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8417 /* `main' and builtins have implicit 'C' linkage. */
8418 if ((MAIN_NAME_P (declarator
)
8419 || (IDENTIFIER_LENGTH (declarator
) > 10
8420 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8421 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8422 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8423 && current_lang_name
== lang_name_cplusplus
8424 && ctype
== NULL_TREE
8425 /* NULL_TREE means global namespace. */
8426 && DECL_CONTEXT (decl
) == NULL_TREE
)
8427 DECL_LANGUAGE (decl
) = lang_c
;
8429 /* Should probably propagate const out from type to decl I bet (mrs). */
8432 DECL_STATIC_FUNCTION_P (decl
) = 1;
8433 DECL_CONTEXT (decl
) = ctype
;
8437 DECL_CLASS_CONTEXT (decl
) = ctype
;
8439 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8441 if (processing_template_decl
)
8442 error ("cannot declare `main' to be a template");
8444 error ("cannot declare `main' to be inline");
8446 error ("cannot declare `main' to be static");
8451 /* Members of anonymous types and local classes have no linkage; make
8453 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8454 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8459 /* [basic.link]: A name with no linkage (notably, the name of a class
8460 or enumeration declared in a local scope) shall not be used to
8461 declare an entity with linkage.
8463 Only check this for public decls for now. */
8464 t
= no_linkage_check (TREE_TYPE (decl
));
8467 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8469 if (DECL_LANGUAGE (decl
) == lang_c
)
8470 /* Allow this; it's pretty common in C. */;
8472 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8476 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8481 TREE_PUBLIC (decl
) = publicp
;
8484 DECL_INTERFACE_KNOWN (decl
) = 1;
8485 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8489 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8491 DECL_EXTERNAL (decl
) = 1;
8492 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8494 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8495 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8499 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8500 grok_op_properties (decl
, virtualp
, check
< 0);
8502 if (ctype
&& hack_decl_function_context (decl
))
8503 DECL_NO_STATIC_CHAIN (decl
) = 1;
8505 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8506 if (TREE_PURPOSE (t
)
8507 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8509 has_default_arg
= 1;
8514 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8518 ("defining explicit specialization `%D' in friend declaration",
8522 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8524 /* Something like `template <class T> friend void f<T>()'. */
8525 cp_error ("template-id `%D' in declaration of primary template",
8531 /* A friend declaration of the form friend void f<>(). Record
8532 the information in the TEMPLATE_ID_EXPR. */
8533 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8534 DECL_TEMPLATE_INFO (decl
)
8535 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8536 TREE_OPERAND (orig_declarator
, 1),
8539 if (has_default_arg
)
8541 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8548 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8555 if (has_default_arg
)
8556 add_defarg_fn (decl
);
8558 /* Plain overloading: will not be grok'd by grokclassfn. */
8559 if (! ctype
&& ! processing_template_decl
8560 && DECL_LANGUAGE (decl
) != lang_c
8561 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8562 set_mangled_name_for_decl (decl
);
8565 /* Make the init_value nonzero so pushdecl knows this is not
8566 tentative. error_mark_node is replaced later with the BLOCK. */
8567 DECL_INITIAL (decl
) = error_mark_node
;
8569 /* Caller will do the rest of this. */
8573 if (check
&& funcdef_flag
)
8574 DECL_INITIAL (decl
) = error_mark_node
;
8576 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8579 /* Just handle constructors here. We could do this
8580 inside the following if stmt, but I think
8581 that the code is more legible by breaking this
8582 case out. See comments below for what each of
8583 the following calls is supposed to do. */
8584 DECL_CONSTRUCTOR_P (decl
) = 1;
8586 grokclassfn (ctype
, decl
, flags
, quals
);
8588 decl
= check_explicit_specialization (orig_declarator
, decl
,
8590 2 * (funcdef_flag
!= 0) +
8591 4 * (friendp
!= 0));
8592 if (decl
== error_mark_node
)
8595 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8598 tmp
= check_classfn (ctype
, decl
);
8600 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8601 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8603 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8604 cp_error ("definition of implicitly-declared `%D'", tmp
);
8605 if (tmp
&& duplicate_decls (decl
, tmp
))
8608 if (! grok_ctor_properties (ctype
, decl
))
8615 /* Function gets the ugly name, field gets the nice one.
8616 This call may change the type of the function (because
8617 of default parameters)! */
8618 if (ctype
!= NULL_TREE
)
8619 grokclassfn (ctype
, decl
, flags
, quals
);
8621 decl
= check_explicit_specialization (orig_declarator
, decl
,
8623 2 * (funcdef_flag
!= 0) +
8624 4 * (friendp
!= 0));
8625 if (decl
== error_mark_node
)
8628 if (ctype
!= NULL_TREE
8629 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8632 tmp
= check_classfn (ctype
, decl
);
8634 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8635 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8637 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8638 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8640 /* Remove the `this' parm added by grokclassfn.
8641 XXX Isn't this done in start_function, too? */
8642 revert_static_member_fn (&decl
, NULL
, NULL
);
8643 last_function_parms
= TREE_CHAIN (last_function_parms
);
8645 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8646 cp_error ("definition of implicitly-declared `%D'", tmp
);
8649 /* Attempt to merge the declarations. This can fail, in
8650 the case of some illegal specialization declarations. */
8651 if (!duplicate_decls (decl
, tmp
))
8652 cp_error ("no `%#D' member function declared in class `%T'",
8658 if (ctype
== NULL_TREE
|| check
)
8663 DECL_VIRTUAL_P (decl
) = 1;
8664 if (DECL_VINDEX (decl
) == NULL_TREE
)
8665 DECL_VINDEX (decl
) = error_mark_node
;
8666 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8673 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8676 RID_BIT_TYPE
*specbits_in
;
8682 RID_BIT_TYPE specbits
;
8684 specbits
= *specbits_in
;
8686 if (TREE_CODE (type
) == OFFSET_TYPE
)
8688 /* If you declare a static member so that it
8689 can be initialized, the code will reach here. */
8690 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8691 type
= TREE_TYPE (type
);
8692 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8693 DECL_CONTEXT (decl
) = basetype
;
8694 DECL_CLASS_CONTEXT (decl
) = basetype
;
8695 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8702 context
= in_namespace
;
8703 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8704 context
= current_namespace
;
8706 context
= NULL_TREE
;
8708 if (processing_template_decl
)
8710 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8711 we can call push_template_decl. */
8712 push_permanent_obstack ();
8713 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8717 decl
= build_decl (VAR_DECL
, declarator
, type
);
8720 set_decl_namespace (decl
, context
, 0);
8722 context
= DECL_CONTEXT (decl
);
8723 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8724 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8728 set_decl_namespace (decl
, in_namespace
, 0);
8730 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8732 DECL_THIS_EXTERN (decl
) = 1;
8733 DECL_EXTERNAL (decl
) = !initialized
;
8736 /* In class context, static means one per class,
8737 public access, and static storage. */
8738 if (DECL_CLASS_SCOPE_P (decl
))
8740 TREE_PUBLIC (decl
) = 1;
8741 TREE_STATIC (decl
) = 1;
8742 DECL_EXTERNAL (decl
) = 0;
8744 /* At top level, either `static' or no s.c. makes a definition
8745 (perhaps tentative), and absence of `static' makes it public. */
8746 else if (toplevel_bindings_p ())
8748 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8749 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8750 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8752 /* Not at top level, only `static' makes a static definition. */
8755 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8756 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8759 if (TREE_PUBLIC (decl
))
8761 /* [basic.link]: A name with no linkage (notably, the name of a class
8762 or enumeration declared in a local scope) shall not be used to
8763 declare an entity with linkage.
8765 Only check this for public decls for now. */
8766 tree t
= no_linkage_check (TREE_TYPE (decl
));
8769 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8770 /* Ignore for now; `enum { foo } e' is pretty common. */;
8772 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8780 /* Create and return a canonical pointer to member function type, for
8781 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8784 build_ptrmemfunc_type (type
)
8790 tree unqualified_variant
= NULL_TREE
;
8792 /* If a canonical type already exists for this type, use it. We use
8793 this method instead of type_hash_canon, because it only does a
8794 simple equality check on the list of field members. */
8796 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8799 /* Make sure that we always have the unqualified pointer-to-member
8801 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8803 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8805 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8807 u
= make_lang_type (UNION_TYPE
);
8808 SET_IS_AGGR_TYPE (u
, 0);
8809 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8810 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8812 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8813 TYPE_NAME (u
) = NULL_TREE
;
8815 t
= make_lang_type (RECORD_TYPE
);
8817 /* Let the front-end know this is a pointer to member function... */
8818 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8819 /* ... and not really an aggregate. */
8820 SET_IS_AGGR_TYPE (t
, 0);
8822 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8824 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8826 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8827 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8831 /* Zap out the name so that the back-end will give us the debugging
8832 information for this anonymous RECORD_TYPE. */
8833 TYPE_NAME (t
) = NULL_TREE
;
8835 /* If this is not the unqualified form of this pointer-to-member
8836 type, set the TYPE_MAIN_VARIANT for this type to be the
8837 unqualified type. Since they are actually RECORD_TYPEs that are
8838 not variants of each other, we must do this manually. */
8839 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8841 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8842 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8843 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8844 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8847 /* Cache this pointer-to-member type so that we can find it again
8849 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8851 /* Seems to be wanted. */
8852 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8857 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8858 Check to see that the definition is valid. Issue appropriate error
8859 messages. Return 1 if the definition is particularly bad, or 0
8863 check_static_variable_definition (decl
, type
)
8867 /* Motion 10 at San Diego: If a static const integral data member is
8868 initialized with an integral constant expression, the initializer
8869 may appear either in the declaration (within the class), or in
8870 the definition, but not both. If it appears in the class, the
8871 member is a member constant. The file-scope definition is always
8873 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8875 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8877 /* If we just return the declaration, crashes will sometimes
8878 occur. We therefore return void_type_node, as if this was a
8879 friend declaration, to cause callers to completely ignore
8880 this declaration. */
8883 else if (!CP_TYPE_CONST_P (type
))
8884 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8886 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8887 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8892 /* Given declspecs and a declarator,
8893 determine the name and type of the object declared
8894 and construct a ..._DECL node for it.
8895 (In one case we can return a ..._TYPE node instead.
8896 For invalid input we sometimes return 0.)
8898 DECLSPECS is a chain of tree_list nodes whose value fields
8899 are the storage classes and type specifiers.
8901 DECL_CONTEXT says which syntactic context this declaration is in:
8902 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8903 FUNCDEF for a function definition. Like NORMAL but a few different
8904 error messages in each case. Return value may be zero meaning
8905 this definition is too screwy to try to parse.
8906 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8907 handle member functions (which have FIELD context).
8908 Return value may be zero meaning this definition is too screwy to
8910 PARM for a parameter declaration (either within a function prototype
8911 or before a function body). Make a PARM_DECL, or return void_type_node.
8912 CATCHPARM for a parameter declaration before a catch clause.
8913 TYPENAME if for a typename (in a cast or sizeof).
8914 Don't make a DECL node; just return the ..._TYPE node.
8915 FIELD for a struct or union field; make a FIELD_DECL.
8916 BITFIELD for a field with specified width.
8917 INITIALIZED is 1 if the decl has an initializer.
8919 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8920 normal attributes in TREE_PURPOSE, or NULL_TREE.
8922 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8923 It may also be so in the PARM case, for a prototype where the
8924 argument type is specified but not the name.
8926 This function is where the complicated C meanings of `static'
8927 and `extern' are interpreted.
8929 For C++, if there is any monkey business to do, the function which
8930 calls this one must do it, i.e., prepending instance variables,
8931 renaming overloaded function names, etc.
8933 Note that for this C++, it is an error to define a method within a class
8934 which does not belong to that class.
8936 Except in the case where SCOPE_REFs are implicitly known (such as
8937 methods within a class being redundantly qualified),
8938 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8939 (class_name::decl_name). The caller must also deal with this.
8941 If a constructor or destructor is seen, and the context is FIELD,
8942 then the type gains the attribute TREE_HAS_x. If such a declaration
8943 is erroneous, NULL_TREE is returned.
8945 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8946 function, these are the qualifiers to give to the `this' pointer.
8948 May return void_type_node if the declarator turned out to be a friend.
8949 See grokfield for details. */
8951 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8954 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8957 enum decl_context decl_context
;
8961 RID_BIT_TYPE specbits
;
8964 tree type
= NULL_TREE
;
8970 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8971 int explicit_int
= 0;
8972 int explicit_char
= 0;
8973 int defaulted_int
= 0;
8974 tree typedef_decl
= NULL_TREE
;
8976 tree typedef_type
= NULL_TREE
;
8977 int funcdef_flag
= 0;
8978 enum tree_code innermost_code
= ERROR_MARK
;
8981 /* See the code below that used this. */
8982 tree decl_machine_attr
= NULL_TREE
;
8984 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8985 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8986 tree init
= NULL_TREE
;
8988 /* Keep track of what sort of function is being processed
8989 so that we can warn about default return values, or explicit
8990 return values which do not match prescribed defaults. */
8991 enum return_types return_type
= return_normal
;
8993 tree dname
= NULL_TREE
;
8994 tree ctype
= current_class_type
;
8995 tree ctor_return_type
= NULL_TREE
;
8996 enum overload_flags flags
= NO_SPECIAL
;
8997 tree quals
= NULL_TREE
;
8998 tree raises
= NULL_TREE
;
8999 int template_count
= 0;
9000 tree in_namespace
= NULL_TREE
;
9004 RIDBIT_RESET_ALL (specbits
);
9005 if (decl_context
== FUNCDEF
)
9006 funcdef_flag
= 1, decl_context
= NORMAL
;
9007 else if (decl_context
== MEMFUNCDEF
)
9008 funcdef_flag
= -1, decl_context
= FIELD
;
9009 else if (decl_context
== BITFIELD
)
9010 bitfield
= 1, decl_context
= FIELD
;
9012 /* Look inside a declarator for the name being declared
9013 and get it as a string, for an error message. */
9015 tree
*next
= &declarator
;
9019 while (next
&& *next
)
9022 switch (TREE_CODE (decl
))
9025 /* For attributes. */
9026 next
= &TREE_VALUE (decl
);
9031 next
= &TREE_OPERAND (decl
, 0);
9034 case BIT_NOT_EXPR
: /* For C++ destructors! */
9036 tree name
= TREE_OPERAND (decl
, 0);
9037 tree rename
= NULL_TREE
;
9039 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9041 return_type
= return_dtor
;
9042 if (TREE_CODE (name
) == TYPE_DECL
)
9043 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9044 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9045 if (ctype
== NULL_TREE
)
9047 if (current_class_type
== NULL_TREE
)
9049 error ("destructors must be member functions");
9054 tree t
= constructor_name (current_class_name
);
9061 tree t
= constructor_name (ctype
);
9068 cp_error ("destructor `%T' must match class name `%T'",
9070 TREE_OPERAND (decl
, 0) = rename
;
9076 case ADDR_EXPR
: /* C++ reference declaration */
9081 innermost_code
= TREE_CODE (decl
);
9082 next
= &TREE_OPERAND (decl
, 0);
9086 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9088 /* This is actually a variable declaration using
9089 constructor syntax. We need to call start_decl and
9090 cp_finish_decl so we can get the variable
9093 tree attributes
, prefix_attributes
;
9095 *next
= TREE_OPERAND (decl
, 0);
9096 init
= CALL_DECLARATOR_PARMS (decl
);
9100 attributes
= TREE_PURPOSE (attrlist
);
9101 prefix_attributes
= TREE_VALUE (attrlist
);
9105 attributes
= NULL_TREE
;
9106 prefix_attributes
= NULL_TREE
;
9109 decl
= start_decl (declarator
, declspecs
, 1,
9110 attributes
, prefix_attributes
);
9113 /* Look for __unused__ attribute */
9114 if (TREE_USED (TREE_TYPE (decl
)))
9115 TREE_USED (decl
) = 1;
9116 finish_decl (decl
, init
, NULL_TREE
);
9119 cp_error ("invalid declarator");
9122 innermost_code
= TREE_CODE (decl
);
9123 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9124 ctype
= current_class_type
;
9126 && TREE_OPERAND (decl
, 0)
9127 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9128 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9129 == constructor_name_full (ctype
))
9130 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9131 == constructor_name (ctype
)))))
9132 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9133 next
= &TREE_OPERAND (decl
, 0);
9135 if (ctype
!= NULL_TREE
9136 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9137 && decl
== constructor_name (ctype
))
9139 return_type
= return_ctor
;
9140 ctor_return_type
= ctype
;
9145 case TEMPLATE_ID_EXPR
:
9147 tree fns
= TREE_OPERAND (decl
, 0);
9149 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9150 fns
= TREE_OPERAND (fns
, 0);
9153 if (TREE_CODE (dname
) == COMPONENT_REF
)
9154 dname
= TREE_OPERAND (dname
, 1);
9155 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9157 my_friendly_assert (is_overloaded_fn (dname
),
9159 dname
= DECL_NAME (get_first_fn (dname
));
9164 case IDENTIFIER_NODE
:
9165 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9172 cp_error ("declarator-id missing; using reserved word `%D'",
9174 name
= IDENTIFIER_POINTER (dname
);
9176 if (! IDENTIFIER_OPNAME_P (dname
)
9177 /* GNU/Linux headers use '__op'. Arrgh. */
9178 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9179 name
= IDENTIFIER_POINTER (dname
);
9182 if (IDENTIFIER_TYPENAME_P (dname
))
9184 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9185 flags
= TYPENAME_FLAG
;
9186 ctor_return_type
= TREE_TYPE (dname
);
9187 return_type
= return_conversion
;
9189 name
= operator_name_string (dname
);
9196 /* Perform error checking, and decide on a ctype. */
9197 tree cname
= TREE_OPERAND (decl
, 0);
9198 if (cname
== NULL_TREE
)
9200 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9203 in_namespace
= TREE_OPERAND (decl
, 0);
9204 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9206 else if (! is_aggr_type (cname
, 1))
9207 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9208 /* Must test TREE_OPERAND (decl, 1), in case user gives
9209 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9210 else if (TREE_OPERAND (decl
, 1)
9211 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9213 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9214 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9216 cp_error ("`%T::%D' is not a valid declarator", cname
,
9217 TREE_OPERAND (decl
, 1));
9218 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9219 cname
, TREE_OPERAND (decl
, 1));
9220 return void_type_node
;
9222 else if (ctype
== NULL_TREE
)
9224 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9225 TREE_OPERAND (decl
, 0) = ctype
;
9228 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9230 cp_error ("type `%T' is not derived from type `%T'",
9232 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9238 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9239 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9240 == constructor_name_full (ctype
))
9241 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9242 == constructor_name (ctype
))))
9243 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9244 next
= &TREE_OPERAND (decl
, 1);
9248 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9249 && constructor_name (ctype
) == decl
)
9251 return_type
= return_ctor
;
9252 ctor_return_type
= ctype
;
9254 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9255 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9256 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9257 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9259 return_type
= return_dtor
;
9260 ctor_return_type
= ctype
;
9262 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9263 next
= &TREE_OPERAND (decl
, 0);
9274 /* Parse error puts this typespec where
9275 a declarator should go. */
9276 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9277 if (TREE_TYPE (decl
) == current_class_type
)
9278 cp_error (" perhaps you want `%T' for a constructor",
9279 current_class_name
);
9280 dname
= DECL_NAME (decl
);
9281 name
= IDENTIFIER_POINTER (dname
);
9283 /* Avoid giving two errors for this. */
9284 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9286 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9293 cp_compiler_error ("`%D' as declarator", decl
);
9294 return 0; /* We used to do a 155 abort here. */
9301 /* A function definition's declarator must have the form of
9302 a function declarator. */
9304 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9307 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9308 && innermost_code
!= CALL_EXPR
9309 && ! (ctype
&& declspecs
== NULL_TREE
))
9311 cp_error ("declaration of `%D' as non-function", dname
);
9312 return void_type_node
;
9315 /* Anything declared one level down from the top level
9316 must be one of the parameters of a function
9317 (because the body is at least two levels down). */
9319 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9320 by not allowing C++ class definitions to specify their parameters
9321 with xdecls (must be spec.d in the parmlist).
9323 Since we now wait to push a class scope until we are sure that
9324 we are in a legitimate method context, we must set oldcname
9325 explicitly (since current_class_name is not yet alive).
9327 We also want to avoid calling this a PARM if it is in a namespace. */
9329 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9331 struct binding_level
*b
= current_binding_level
;
9332 current_binding_level
= b
->level_chain
;
9333 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9334 decl_context
= PARM
;
9335 current_binding_level
= b
;
9338 /* Look through the decl specs and record which ones appear.
9339 Some typespecs are defined as built-in typenames.
9340 Others, the ones that are modifiers of other types,
9341 are represented by bits in SPECBITS: set the bits for
9342 the modifiers that appear. Storage class keywords are also in SPECBITS.
9344 If there is a typedef name or a type, store the type in TYPE.
9345 This includes builtin typedefs such as `int'.
9347 Set EXPLICIT_INT if the type is `int' or `char' and did not
9348 come from a user typedef.
9350 Set LONGLONG if `long' is mentioned twice.
9352 For C++, constructors and destructors have their own fast treatment. */
9354 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9359 /* Certain parse errors slip through. For example,
9360 `int class;' is not caught by the parser. Try
9361 weakly to recover here. */
9362 if (TREE_CODE (spec
) != TREE_LIST
)
9365 id
= TREE_VALUE (spec
);
9367 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9369 if (id
== ridpointers
[(int) RID_INT
]
9370 || id
== ridpointers
[(int) RID_CHAR
]
9371 || id
== ridpointers
[(int) RID_BOOL
]
9372 || id
== ridpointers
[(int) RID_WCHAR
])
9376 if (id
== ridpointers
[(int) RID_BOOL
])
9377 error ("`bool' is now a keyword");
9379 cp_error ("extraneous `%T' ignored", id
);
9383 if (id
== ridpointers
[(int) RID_INT
])
9385 else if (id
== ridpointers
[(int) RID_CHAR
])
9387 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9391 /* C++ aggregate types. */
9392 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9395 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9397 type
= IDENTIFIER_TYPE_VALUE (id
);
9401 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9403 if (ridpointers
[i
] == id
)
9405 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9407 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9408 pedwarn ("ANSI C++ does not support `long long'");
9410 error ("`long long long' is too long for GCC");
9414 else if (RIDBIT_SETP (i
, specbits
))
9415 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9416 RIDBIT_SET (i
, specbits
);
9421 /* C++ aggregate types. */
9422 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9425 cp_error ("multiple declarations `%T' and `%T'", type
,
9429 type
= TREE_TYPE (id
);
9430 TREE_VALUE (spec
) = type
;
9435 error ("two or more data types in declaration of `%s'", name
);
9436 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9438 register tree t
= lookup_name (id
, 1);
9439 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9440 error ("`%s' fails to be a typedef or built in type",
9441 IDENTIFIER_POINTER (id
));
9444 type
= TREE_TYPE (t
);
9446 /* See the code below that used this. */
9447 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9452 else if (id
!= error_mark_node
)
9453 /* Can't change CLASS nodes into RECORD nodes here! */
9459 typedef_type
= type
;
9461 /* No type at all: default to `int', and set DEFAULTED_INT
9462 because it was not a user-defined typedef. */
9464 if (type
== NULL_TREE
9465 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9466 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9467 || RIDBIT_SETP (RID_LONG
, specbits
)
9468 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9470 /* These imply 'int'. */
9471 type
= integer_type_node
;
9475 if (type
== NULL_TREE
)
9478 if (return_type
== return_dtor
)
9479 type
= void_type_node
;
9480 else if (return_type
== return_ctor
)
9481 type
= build_pointer_type (ctor_return_type
);
9482 else if (return_type
== return_conversion
)
9483 type
= ctor_return_type
;
9486 /* We handle `main' specially here, because 'main () { }' is so
9487 common. With no options, it is allowed. With -Wreturn-type,
9488 it is a warning. It is only an error with -pedantic-errors. */
9489 int is_main
= (funcdef_flag
9490 && MAIN_NAME_P (dname
)
9491 && ctype
== NULL_TREE
9492 && in_namespace
== NULL_TREE
9493 && current_namespace
== global_namespace
);
9495 if (in_system_header
|| flag_ms_extensions
)
9496 /* Allow it, sigh. */;
9497 else if (pedantic
|| ! is_main
)
9498 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9500 else if (warn_return_type
)
9501 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9504 type
= integer_type_node
;
9507 else if (return_type
== return_dtor
)
9509 error ("return type specification for destructor invalid");
9510 type
= void_type_node
;
9512 else if (return_type
== return_ctor
)
9514 error ("return type specification for constructor invalid");
9515 type
= build_pointer_type (ctor_return_type
);
9517 else if (return_type
== return_conversion
)
9519 if (!same_type_p (type
, ctor_return_type
))
9520 cp_error ("operator `%T' declared to return `%T'",
9521 ctor_return_type
, type
);
9523 cp_pedwarn ("return type specified for `operator %T'",
9526 type
= ctor_return_type
;
9531 /* Now process the modifiers that were specified
9532 and check for invalid combinations. */
9534 /* Long double is a special combination. */
9536 if (RIDBIT_SETP (RID_LONG
, specbits
)
9537 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9539 RIDBIT_RESET (RID_LONG
, specbits
);
9540 type
= build_qualified_type (long_double_type_node
,
9541 CP_TYPE_QUALS (type
));
9544 /* Check all other uses of type modifiers. */
9546 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9547 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9548 || RIDBIT_SETP (RID_LONG
, specbits
)
9549 || RIDBIT_SETP (RID_SHORT
, specbits
))
9553 if (TREE_CODE (type
) == REAL_TYPE
)
9554 error ("short, signed or unsigned invalid for `%s'", name
);
9555 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9556 error ("long, short, signed or unsigned invalid for `%s'", name
);
9557 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9558 && RIDBIT_SETP (RID_SHORT
, specbits
))
9559 error ("long and short specified together for `%s'", name
);
9560 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9561 || RIDBIT_SETP (RID_SHORT
, specbits
))
9563 error ("long or short specified with char for `%s'", name
);
9564 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9565 || RIDBIT_SETP (RID_SHORT
, specbits
))
9566 && TREE_CODE (type
) == REAL_TYPE
)
9567 error ("long or short specified with floating type for `%s'", name
);
9568 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9569 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9570 error ("signed and unsigned given together for `%s'", name
);
9574 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9576 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9578 if (flag_pedantic_errors
)
9583 /* Discard the type modifiers if they are invalid. */
9586 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9587 RIDBIT_RESET (RID_SIGNED
, specbits
);
9588 RIDBIT_RESET (RID_LONG
, specbits
);
9589 RIDBIT_RESET (RID_SHORT
, specbits
);
9594 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9595 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9597 error ("complex invalid for `%s'", name
);
9598 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9601 /* Decide whether an integer type is signed or not.
9602 Optionally treat bitfields as signed by default. */
9603 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9606 It is implementation-defined whether a plain (neither
9607 explicitly signed or unsigned) char, short, int, or long
9608 bit-field is signed or unsigned.
9610 Naturally, we extend this to long long as well. Note that
9611 this does not include wchar_t. */
9612 || (bitfield
&& !flag_signed_bitfields
9613 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9614 /* A typedef for plain `int' without `signed' can be
9615 controlled just like plain `int', but a typedef for
9616 `signed int' cannot be so controlled. */
9618 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9619 && (TREE_CODE (type
) == INTEGER_TYPE
9620 || TREE_CODE (type
) == CHAR_TYPE
)
9621 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9624 type
= long_long_unsigned_type_node
;
9625 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9626 type
= long_unsigned_type_node
;
9627 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9628 type
= short_unsigned_type_node
;
9629 else if (type
== char_type_node
)
9630 type
= unsigned_char_type_node
;
9631 else if (typedef_decl
)
9632 type
= unsigned_type (type
);
9634 type
= unsigned_type_node
;
9636 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9637 && type
== char_type_node
)
9638 type
= signed_char_type_node
;
9640 type
= long_long_integer_type_node
;
9641 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9642 type
= long_integer_type_node
;
9643 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9644 type
= short_integer_type_node
;
9646 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9648 /* If we just have "complex", it is equivalent to
9649 "complex double", but if any modifiers at all are specified it is
9650 the complex form of TYPE. E.g, "complex short" is
9651 "complex short int". */
9653 if (defaulted_int
&& ! longlong
9654 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9655 || RIDBIT_SETP (RID_SHORT
, specbits
)
9656 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9657 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9658 type
= complex_double_type_node
;
9659 else if (type
== integer_type_node
)
9660 type
= complex_integer_type_node
;
9661 else if (type
== float_type_node
)
9662 type
= complex_float_type_node
;
9663 else if (type
== double_type_node
)
9664 type
= complex_double_type_node
;
9665 else if (type
== long_double_type_node
)
9666 type
= complex_long_double_type_node
;
9668 type
= build_complex_type (type
);
9671 if (return_type
== return_conversion
9672 && (RIDBIT_SETP (RID_CONST
, specbits
)
9673 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9674 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9675 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9678 /* Set CONSTP if this declaration is `const', whether by
9679 explicit specification or via a typedef.
9680 Likewise for VOLATILEP. */
9682 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9684 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9686 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9687 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9688 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9689 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9690 type
= cp_build_qualified_type (type
, type_quals
);
9692 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9693 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9694 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9695 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9696 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9698 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9699 staticp
= 1 + (decl_context
== FIELD
);
9701 if (virtualp
&& staticp
== 2)
9703 cp_error ("member `%D' cannot be declared both virtual and static",
9707 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9708 RIDBIT_RESET (RID_FRIEND
, specbits
);
9710 /* $7.1.2, Function specifiers */
9711 if (friendp
&& explicitp
)
9712 error ("only declarations of constructors can be `explicit'");
9714 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9716 if (decl_context
== PARM
)
9718 error ("non-member `%s' cannot be declared `mutable'", name
);
9719 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9721 else if (friendp
|| decl_context
== TYPENAME
)
9723 error ("non-object member `%s' cannot be declared `mutable'", name
);
9724 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9728 /* Warn if two storage classes are given. Default to `auto'. */
9730 if (RIDBIT_ANY_SET (specbits
))
9732 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9733 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9734 if (decl_context
== PARM
&& nclasses
> 0)
9735 error ("storage class specifiers invalid in parameter declarations");
9736 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9738 if (decl_context
== PARM
)
9739 error ("typedef declaration invalid in parameter declaration");
9742 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9743 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9746 /* Give error if `virtual' is used outside of class declaration. */
9748 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9750 error ("virtual outside class declaration");
9753 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9755 error ("only members can be declared mutable");
9756 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9759 /* Static anonymous unions are dealt with here. */
9760 if (staticp
&& decl_context
== TYPENAME
9761 && TREE_CODE (declspecs
) == TREE_LIST
9762 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9763 decl_context
= FIELD
;
9765 /* Warn about storage classes that are invalid for certain
9766 kinds of declarations (parameters, typenames, etc.). */
9769 error ("multiple storage classes in declaration of `%s'", name
);
9770 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9772 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9773 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9774 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9776 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9778 else if (decl_context
== FIELD
9779 /* C++ allows static class elements */
9780 && RIDBIT_SETP (RID_STATIC
, specbits
))
9781 /* C++ also allows inlines and signed and unsigned elements,
9782 but in those cases we don't come in here. */
9786 if (decl_context
== FIELD
)
9788 tree tmp
= NULL_TREE
;
9789 register int op
= 0;
9793 /* Avoid trying to get an operand off an identifier node. */
9794 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9797 tmp
= TREE_OPERAND (declarator
, 0);
9798 op
= IDENTIFIER_OPNAME_P (tmp
);
9800 error ("storage class specified for %s `%s'",
9801 op
? "member operator" : "field",
9802 op
? operator_name_string (tmp
) : name
);
9805 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9806 ? "storage class specified for parameter `%s'"
9807 : "storage class specified for typename"), name
);
9808 RIDBIT_RESET (RID_REGISTER
, specbits
);
9809 RIDBIT_RESET (RID_AUTO
, specbits
);
9810 RIDBIT_RESET (RID_EXTERN
, specbits
);
9813 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9815 if (toplevel_bindings_p ())
9817 /* It's common practice (and completely valid) to have a const
9818 be initialized and declared extern. */
9819 if (!(type_quals
& TYPE_QUAL_CONST
))
9820 warning ("`%s' initialized and declared `extern'", name
);
9823 error ("`%s' has both `extern' and initializer", name
);
9825 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9826 && ! toplevel_bindings_p ())
9827 error ("nested function `%s' declared `extern'", name
);
9828 else if (toplevel_bindings_p ())
9830 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9831 error ("top-level declaration of `%s' specifies `auto'", name
);
9834 if (nclasses
> 0 && friendp
)
9835 error ("storage class specifiers invalid in friend function declarations");
9837 /* Now figure out the structure of the declarator proper.
9838 Descend through it, creating more complex types, until we reach
9839 the declared identifier (or NULL_TREE, in an absolute declarator). */
9841 inner_attrs
= NULL_TREE
;
9844 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9845 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9847 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9848 an INDIRECT_REF (for *...),
9849 a CALL_EXPR (for ...(...)),
9850 an identifier (for the name being declared)
9851 or a null pointer (for the place in an absolute declarator
9852 where the name was omitted).
9853 For the last two cases, we have just exited the loop.
9855 For C++ it could also be
9856 a SCOPE_REF (for class :: ...). In this case, we have converted
9857 sensible names to types, and those are the values we use to
9858 qualify the member name.
9859 an ADDR_EXPR (for &...),
9860 a BIT_NOT_EXPR (for destructors)
9862 At this point, TYPE is the type of elements of an array,
9863 or for a function to return, or for a pointer to point to.
9864 After this sequence of ifs, TYPE is the type of the
9865 array or function or pointer, and DECLARATOR has had its
9866 outermost layer removed. */
9868 if (type
== error_mark_node
)
9870 if (TREE_CODE (declarator
) == SCOPE_REF
)
9871 declarator
= TREE_OPERAND (declarator
, 1);
9873 declarator
= TREE_OPERAND (declarator
, 0);
9876 if (quals
!= NULL_TREE
9877 && (declarator
== NULL_TREE
9878 || TREE_CODE (declarator
) != SCOPE_REF
))
9880 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9881 ctype
= TYPE_METHOD_BASETYPE (type
);
9882 if (ctype
!= NULL_TREE
)
9884 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9885 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9886 type
= TREE_TYPE (dummy
);
9891 /* See the comment for the TREE_LIST case, below. */
9894 else if (inner_attrs
)
9896 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9897 inner_attrs
= NULL_TREE
;
9900 switch (TREE_CODE (declarator
))
9904 /* We encode a declarator with embedded attributes using
9905 a TREE_LIST. The attributes apply to the declarator
9906 directly inside them, so we have to skip an iteration
9907 before applying them to the type. If the declarator just
9908 inside is the declarator-id, we apply the attrs to the
9910 inner_attrs
= TREE_PURPOSE (declarator
);
9912 declarator
= TREE_VALUE (declarator
);
9918 register tree itype
= NULL_TREE
;
9919 register tree size
= TREE_OPERAND (declarator
, 1);
9920 /* The index is a signed object `sizetype' bits wide. */
9921 tree index_type
= signed_type (sizetype
);
9923 declarator
= TREE_OPERAND (declarator
, 0);
9925 /* Check for some types that there cannot be arrays of. */
9927 if (TREE_CODE (type
) == VOID_TYPE
)
9929 cp_error ("declaration of `%D' as array of voids", dname
);
9930 type
= error_mark_node
;
9933 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9935 cp_error ("declaration of `%D' as array of functions", dname
);
9936 type
= error_mark_node
;
9939 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9940 you can't have arrays of references. If we allowed them,
9941 then we'd be saying x[i] is valid for an array x, but
9942 then you'd have to ask: what does `*(x + i)' mean? */
9943 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9945 if (decl_context
== TYPENAME
)
9946 cp_error ("cannot make arrays of references");
9948 cp_error ("declaration of `%D' as array of references",
9950 type
= error_mark_node
;
9953 if (TREE_CODE (type
) == OFFSET_TYPE
)
9955 cp_error ("declaration of `%D' as array of data members",
9957 type
= error_mark_node
;
9960 if (TREE_CODE (type
) == METHOD_TYPE
)
9962 cp_error ("declaration of `%D' as array of function members",
9964 type
= error_mark_node
;
9967 if (size
== error_mark_node
)
9968 type
= error_mark_node
;
9969 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9973 the constant expressions that specify the bounds of
9974 the arrays can be omitted only for the first member
9976 cp_error ("declaration of `%D' as multidimensional array",
9978 cp_error ("must have bounds for all dimensions except the first");
9979 type
= error_mark_node
;
9982 if (type
== error_mark_node
)
9985 /* VC++ spells a zero-sized array with []. */
9986 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9987 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9988 size
= integer_zero_node
;
9992 /* Must suspend_momentary here because the index
9993 type may need to live until the end of the function.
9994 For example, it is used in the declaration of a
9995 variable which requires destructing at the end of
9996 the function; then build_vec_delete will need this
9998 int yes
= suspend_momentary ();
9999 /* Might be a cast. */
10000 if (TREE_CODE (size
) == NOP_EXPR
10001 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
10002 size
= TREE_OPERAND (size
, 0);
10003 if (TREE_READONLY_DECL_P (size
))
10004 size
= decl_constant_value (size
);
10006 /* If this involves a template parameter, it will be a
10007 constant at instantiation time, but we don't know
10008 what the value is yet. Even if no template
10009 parameters are involved, we may an expression that
10010 is not a constant; we don't even simplify `1 + 2'
10011 when processing a template. */
10012 if (processing_template_decl
)
10014 /* Resolve a qualified reference to an enumerator or
10015 static const data member of ours. */
10016 if (TREE_CODE (size
) == SCOPE_REF
10017 && TREE_OPERAND (size
, 0) == current_class_type
)
10019 tree t
= lookup_field (current_class_type
,
10020 TREE_OPERAND (size
, 1), 0, 0);
10025 itype
= build_index_type (build_min
10026 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
10027 goto dont_grok_size
;
10030 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
10031 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
10032 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
10034 cp_error ("size of array `%D' has non-integer type",
10036 size
= integer_one_node
;
10038 if (pedantic
&& integer_zerop (size
))
10039 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
10040 if (TREE_CONSTANT (size
))
10042 int old_flag_pedantic_errors
= flag_pedantic_errors
;
10043 int old_pedantic
= pedantic
;
10044 pedantic
= flag_pedantic_errors
= 1;
10045 /* Always give overflow errors on array subscripts. */
10046 constant_expression_warning (size
);
10047 pedantic
= old_pedantic
;
10048 flag_pedantic_errors
= old_flag_pedantic_errors
;
10049 if (INT_CST_LT (size
, integer_zero_node
))
10051 cp_error ("size of array `%D' is negative", dname
);
10052 size
= integer_one_node
;
10060 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
10063 cp_pedwarn ("ANSI C++ forbids variable-size array");
10068 = fold (build_binary_op (MINUS_EXPR
,
10069 cp_convert (index_type
, size
),
10070 cp_convert (index_type
,
10071 integer_one_node
)));
10072 if (! TREE_CONSTANT (itype
))
10073 itype
= variable_size (itype
);
10074 else if (TREE_OVERFLOW (itype
))
10076 error ("overflow in array dimension");
10077 TREE_OVERFLOW (itype
) = 0;
10080 /* If we're a parm, we need to have a permanent type so
10081 mangling checks for re-use will work right. If both the
10082 element and index types are permanent, the array type
10084 if (decl_context
== PARM
10085 && allocation_temporary_p () && TREE_PERMANENT (type
))
10087 push_obstacks (&permanent_obstack
, &permanent_obstack
);
10088 itype
= build_index_type (itype
);
10092 itype
= build_index_type (itype
);
10095 resume_momentary (yes
);
10098 type
= build_cplus_array_type (type
, itype
);
10107 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10108 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10110 /* Declaring a function type.
10111 Make sure we have a valid type for the function to return. */
10113 /* We now know that the TYPE_QUALS don't apply to the
10114 decl, but to its return type. */
10115 type_quals
= TYPE_UNQUALIFIED
;
10117 /* Warn about some types functions can't return. */
10119 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10121 error ("`%s' declared as function returning a function", name
);
10122 type
= integer_type_node
;
10124 if (TREE_CODE (type
) == ARRAY_TYPE
)
10126 error ("`%s' declared as function returning an array", name
);
10127 type
= integer_type_node
;
10130 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10131 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10133 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10134 inner_decl
= dname
;
10136 /* Pick up type qualifiers which should be applied to `this'. */
10137 quals
= CALL_DECLARATOR_QUALS (declarator
);
10139 /* Pick up the exception specifications. */
10140 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10142 /* Say it's a definition only for the CALL_EXPR
10143 closest to the identifier. */
10146 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10147 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10148 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10150 if (ctype
== NULL_TREE
10151 && decl_context
== FIELD
10153 && (friendp
== 0 || dname
== current_class_name
))
10154 ctype
= current_class_type
;
10156 if (ctype
&& return_type
== return_conversion
)
10157 TYPE_HAS_CONVERSION (ctype
) = 1;
10158 if (ctype
&& constructor_name (ctype
) == dname
)
10160 /* We are within a class's scope. If our declarator name
10161 is the same as the class name, and we are defining
10162 a function, then it is a constructor/destructor, and
10163 therefore returns a void type. */
10165 if (flags
== DTOR_FLAG
)
10167 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10168 not be declared const or volatile. A destructor
10169 may not be static. */
10171 error ("destructor cannot be static member function");
10174 cp_error ("destructors may not be `%s'",
10175 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10178 if (decl_context
== FIELD
)
10180 if (! member_function_or_else (ctype
, current_class_type
,
10181 "destructor for alien class `%s' cannot be a member"))
10182 return void_type_node
;
10185 else /* It's a constructor. */
10187 if (explicitp
== 1)
10189 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10190 not be declared const or volatile. A constructor may
10191 not be virtual. A constructor may not be static. */
10193 error ("constructor cannot be static member function");
10196 pedwarn ("constructors cannot be declared virtual");
10201 cp_error ("constructors may not be `%s'",
10202 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10206 RID_BIT_TYPE tmp_bits
;
10207 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10208 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10209 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10210 if (RIDBIT_ANY_SET (tmp_bits
))
10211 error ("return value type specifier for constructor ignored");
10213 type
= build_pointer_type (ctype
);
10214 if (decl_context
== FIELD
)
10216 if (! member_function_or_else (ctype
, current_class_type
,
10217 "constructor for alien class `%s' cannot be member"))
10218 return void_type_node
;
10219 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10220 if (return_type
!= return_ctor
)
10224 if (decl_context
== FIELD
)
10230 error ("can't initialize friend function `%s'", name
);
10233 /* Cannot be both friend and virtual. */
10234 error ("virtual functions cannot be friends");
10235 RIDBIT_RESET (RID_FRIEND
, specbits
);
10238 if (decl_context
== NORMAL
)
10239 error ("friend declaration not in class definition");
10240 if (current_function_decl
&& funcdef_flag
)
10241 cp_error ("can't define friend function `%s' in a local class definition",
10245 /* Construct the function type and go to the next
10246 inner layer of declarator. */
10248 declarator
= TREE_OPERAND (declarator
, 0);
10250 /* FIXME: This is where default args should be fully
10253 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10255 if (declarator
&& flags
== DTOR_FLAG
)
10257 /* A destructor declared in the body of a class will
10258 be represented as a BIT_NOT_EXPR. But, we just
10259 want the underlying IDENTIFIER. */
10260 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10261 declarator
= TREE_OPERAND (declarator
, 0);
10263 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10264 arg_types
= void_list_node
;
10265 else if (arg_types
== NULL_TREE
10266 || arg_types
!= void_list_node
)
10268 cp_error ("destructors may not have parameters");
10269 arg_types
= void_list_node
;
10270 last_function_parms
= NULL_TREE
;
10274 /* ANSI says that `const int foo ();'
10275 does not make the function foo const. */
10276 type
= build_function_type (type
, arg_types
);
10280 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10281 if (TREE_PURPOSE (t
)
10282 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10284 add_defarg_fn (type
);
10293 /* Filter out pointers-to-references and references-to-references.
10294 We can get these if a TYPE_DECL is used. */
10296 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10298 error ("cannot declare %s to references",
10299 TREE_CODE (declarator
) == ADDR_EXPR
10300 ? "references" : "pointers");
10301 declarator
= TREE_OPERAND (declarator
, 0);
10305 if (TREE_CODE (type
) == OFFSET_TYPE
10306 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10307 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10309 cp_error ("cannot declare pointer to `%#T' member",
10311 type
= TREE_TYPE (type
);
10314 /* Merge any constancy or volatility into the target type
10315 for the pointer. */
10317 /* We now know that the TYPE_QUALS don't apply to the decl,
10318 but to the target of the pointer. */
10319 type_quals
= TYPE_UNQUALIFIED
;
10321 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10323 if (TREE_CODE (type
) == VOID_TYPE
)
10324 error ("invalid type: `void &'");
10326 type
= build_reference_type (type
);
10328 else if (TREE_CODE (type
) == METHOD_TYPE
)
10329 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10331 type
= build_pointer_type (type
);
10333 /* Process a list of type modifier keywords (such as
10334 const or volatile) that were given inside the `*' or `&'. */
10336 if (TREE_TYPE (declarator
))
10338 register tree typemodlist
;
10344 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10345 typemodlist
= TREE_CHAIN (typemodlist
))
10347 tree qualifier
= TREE_VALUE (typemodlist
);
10349 if (qualifier
== ridpointers
[(int) RID_CONST
])
10351 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10353 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10358 error ("invalid type modifier within pointer declarator");
10362 pedwarn ("duplicate `const'");
10364 pedwarn ("duplicate `volatile'");
10366 pedwarn ("duplicate `restrict'");
10368 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10369 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10370 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10371 if (TREE_CODE (declarator
) == ADDR_EXPR
10372 && (constp
|| volatilep
))
10375 pedwarn ("discarding `const' applied to a reference");
10377 pedwarn ("discarding `volatile' applied to a reference");
10378 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10380 type
= cp_build_qualified_type (type
, type_quals
);
10382 declarator
= TREE_OPERAND (declarator
, 0);
10388 /* We have converted type names to NULL_TREE if the
10389 name was bogus, or to a _TYPE node, if not.
10391 The variable CTYPE holds the type we will ultimately
10392 resolve to. The code here just needs to build
10393 up appropriate member types. */
10394 tree sname
= TREE_OPERAND (declarator
, 1);
10397 /* Destructors can have their visibilities changed as well. */
10398 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10399 sname
= TREE_OPERAND (sname
, 0);
10401 if (TREE_COMPLEXITY (declarator
) == 0)
10402 /* This needs to be here, in case we are called
10403 multiple times. */ ;
10404 else if (TREE_COMPLEXITY (declarator
) == -1)
10405 /* Namespace member. */
10406 pop_decl_namespace ();
10407 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10408 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10409 else if (! IS_AGGR_TYPE_CODE
10410 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10412 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10414 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10415 that refer to ctype. They couldn't be resolved earlier
10416 because we hadn't pushed into the class yet.
10417 Example: resolve 'B<T>::type' in
10418 'B<typename B<T>::type> B<T>::f () { }'. */
10419 if (current_template_parms
10420 && uses_template_parms (type
)
10421 && uses_template_parms (current_class_type
))
10423 tree args
= current_template_args ();
10424 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10427 /* This pop_nested_class corresponds to the
10428 push_nested_class used to push into class scope for
10429 parsing the argument list of a function decl, in
10431 pop_nested_class ();
10432 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10435 my_friendly_abort (16);
10437 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10439 /* We had a reference to a global decl, or
10440 perhaps we were given a non-aggregate typedef,
10441 in which case we cleared this out, and should just
10442 keep going as though it wasn't there. */
10443 declarator
= sname
;
10446 ctype
= TREE_OPERAND (declarator
, 0);
10449 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10451 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10452 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10453 template_count
+= 1;
10454 t
= TYPE_MAIN_DECL (t
);
10455 if (DECL_LANG_SPECIFIC (t
))
10456 t
= DECL_CLASS_CONTEXT (t
);
10461 if (sname
== NULL_TREE
)
10464 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10466 /* This is the `standard' use of the scoping operator:
10467 basetype :: member . */
10469 if (ctype
== current_class_type
)
10475 Is this ill-formed? */
10478 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10481 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10483 if (current_class_type
== NULL_TREE
10485 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10486 TYPE_ARG_TYPES (type
));
10489 cp_error ("cannot declare member function `%T::%s' within `%T'",
10490 ctype
, name
, current_class_type
);
10491 return void_type_node
;
10494 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10495 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10497 /* Have to move this code elsewhere in this function.
10498 this code is used for i.e., typedef int A::M; M *pm;
10500 It is? How? jason 10/2/94 */
10502 if (current_class_type
)
10504 cp_error ("cannot declare member `%T::%s' within `%T'",
10505 ctype
, name
, current_class_type
);
10506 return void_type_node
;
10508 type
= build_offset_type (ctype
, type
);
10510 else if (uses_template_parms (ctype
))
10512 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10514 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10515 TYPE_ARG_TYPES (type
));
10519 cp_error ("structure `%T' not yet defined", ctype
);
10520 return error_mark_node
;
10523 declarator
= sname
;
10525 else if (TREE_CODE (sname
) == SCOPE_REF
)
10526 my_friendly_abort (17);
10530 declarator
= TREE_OPERAND (declarator
, 1);
10531 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10532 /* In this case, we will deal with it later. */
10536 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10537 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10538 TYPE_ARG_TYPES (type
));
10540 type
= build_offset_type (ctype
, type
);
10547 declarator
= TREE_OPERAND (declarator
, 0);
10552 case ENUMERAL_TYPE
:
10553 declarator
= NULL_TREE
;
10557 declarator
= NULL_TREE
;
10561 my_friendly_abort (158);
10565 /* See the comment for the TREE_LIST case, above. */
10568 if (! ignore_attrs
)
10569 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10571 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10573 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10576 /* Now TYPE has the actual type. */
10578 if (explicitp
== 1)
10580 error ("only constructors can be declared `explicit'");
10584 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10586 if (type_quals
& TYPE_QUAL_CONST
)
10588 error ("const `%s' cannot be declared `mutable'", name
);
10589 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10593 error ("static `%s' cannot be declared `mutable'", name
);
10594 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10598 if (declarator
== NULL_TREE
10599 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10600 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10601 && (TREE_CODE (type
) == FUNCTION_TYPE
10602 || TREE_CODE (type
) == METHOD_TYPE
)))
10604 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10606 cp_error ("template-id `%D' used as a declarator", declarator
);
10607 declarator
= dname
;
10610 /* Unexpected declarator format. */
10611 my_friendly_abort (990210);
10613 /* If this is declaring a typedef name, return a TYPE_DECL. */
10615 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10619 /* Note that the grammar rejects storage classes
10620 in typenames, fields or parameters. */
10621 if (current_lang_name
== lang_name_java
)
10622 TYPE_FOR_JAVA (type
) = 1;
10624 if (decl_context
== FIELD
)
10626 if (declarator
== constructor_name (current_class_type
))
10627 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10629 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10633 /* Make sure this typedef lives as long as its type,
10634 since it might be used as a template parameter. */
10635 if (type
!= error_mark_node
)
10636 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10637 if (processing_template_decl
)
10638 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10640 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10641 if (type
!= error_mark_node
)
10645 /* If the user declares "typedef struct {...} foo" then the
10646 struct will have an anonymous name. Fill that name in now.
10647 Nothing can refer to it, so nothing needs know about the name
10649 if (type
!= error_mark_node
10650 && TYPE_NAME (type
)
10651 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10652 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10653 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10655 tree oldname
= TYPE_NAME (type
);
10658 /* Replace the anonymous name with the real name everywhere. */
10659 lookup_tag_reverse (type
, declarator
);
10660 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10661 if (TYPE_NAME (t
) == oldname
)
10662 TYPE_NAME (t
) = decl
;
10664 if (TYPE_LANG_SPECIFIC (type
))
10665 TYPE_WAS_ANONYMOUS (type
) = 1;
10667 /* If this is a typedef within a template class, the nested
10668 type is a (non-primary) template. The name for the
10669 template needs updating as well. */
10670 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10671 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10672 = TYPE_IDENTIFIER (type
);
10674 /* XXX Temporarily set the scope.
10675 When returning, start_decl expects it as NULL_TREE,
10676 and will then then set it using pushdecl. */
10677 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10678 if (current_class_type
)
10679 DECL_CONTEXT (decl
) = current_class_type
;
10681 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10683 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10684 DECL_ASSEMBLER_NAME (decl
)
10685 = get_identifier (build_overload_name (type
, 1, 1));
10686 DECL_CONTEXT (decl
) = NULL_TREE
;
10688 /* FIXME remangle member functions; member functions of a
10689 type with external linkage have external linkage. */
10692 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10694 cp_error_at ("typedef name may not be class-qualified", decl
);
10699 if (ctype
== NULL_TREE
)
10701 if (TREE_CODE (type
) != METHOD_TYPE
)
10702 cp_error_at ("invalid type qualifier for non-method type", decl
);
10704 ctype
= TYPE_METHOD_BASETYPE (type
);
10706 if (ctype
!= NULL_TREE
)
10707 grok_method_quals (ctype
, decl
, quals
);
10710 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10711 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10712 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10714 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10715 error ("non-object member `%s' cannot be declared mutable", name
);
10717 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10718 inlinep
, friendp
, raises
!= NULL_TREE
);
10721 error ("typedef declaration includes an initializer");
10726 /* Detect the case of an array type of unspecified size
10727 which came, as such, direct from a typedef name.
10728 We must copy the type, so that each identifier gets
10729 a distinct type, so that each identifier's size can be
10730 controlled separately by its own initializer. */
10732 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10733 && TYPE_DOMAIN (type
) == NULL_TREE
)
10735 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10738 /* If this is a type name (such as, in a cast or sizeof),
10739 compute the type and return it now. */
10741 if (decl_context
== TYPENAME
)
10743 /* Note that the grammar rejects storage classes
10744 in typenames, fields or parameters. */
10745 if (type_quals
!= TYPE_UNQUALIFIED
)
10746 type_quals
= TYPE_UNQUALIFIED
;
10748 /* Special case: "friend class foo" looks like a TYPENAME context. */
10751 if (type_quals
!= TYPE_UNQUALIFIED
)
10753 cp_error ("type qualifiers specified for friend class declaration");
10754 type_quals
= TYPE_UNQUALIFIED
;
10758 cp_error ("`inline' specified for friend class declaration");
10762 /* Only try to do this stuff if we didn't already give up. */
10763 if (type
!= integer_type_node
)
10765 /* A friendly class? */
10766 if (current_class_type
)
10767 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10769 error ("trying to make class `%s' a friend of global scope",
10770 TYPE_NAME_STRING (type
));
10771 type
= void_type_node
;
10776 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10777 if (ctype
== NULL_TREE
)
10779 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10780 ctype
= TYPE_METHOD_BASETYPE (type
);
10782 grok_method_quals (ctype
, dummy
, quals
);
10783 type
= TREE_TYPE (dummy
);
10788 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10789 && decl_context
!= CATCHPARM
10790 && TREE_CODE (type
) != UNION_TYPE
10793 cp_error ("abstract declarator `%T' used as declaration", type
);
10794 declarator
= make_anon_name ();
10797 /* `void' at top level (not within pointer)
10798 is allowed only in typedefs or type names.
10799 We don't complain about parms either, but that is because
10800 a better error message can be made later. */
10802 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10805 error ("unnamed variable or field declared void");
10806 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10808 if (IDENTIFIER_OPNAME_P (declarator
))
10809 my_friendly_abort (356);
10811 error ("variable or field `%s' declared void", name
);
10814 error ("variable or field declared void");
10815 type
= integer_type_node
;
10818 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10819 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10821 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10823 if (ctype
|| in_namespace
)
10824 error ("cannot use `::' in parameter declaration");
10826 /* A parameter declared as an array of T is really a pointer to T.
10827 One declared as a function is really a pointer to a function.
10828 One declared as a member is really a pointer to member. */
10830 if (TREE_CODE (type
) == ARRAY_TYPE
)
10832 /* Transfer const-ness of array into that of type pointed to. */
10833 type
= build_pointer_type (TREE_TYPE (type
));
10834 type_quals
= TYPE_UNQUALIFIED
;
10836 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10837 type
= build_pointer_type (type
);
10838 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10839 type
= build_pointer_type (type
);
10840 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10842 error ("declaration of `%s' as void", name
);
10848 register tree decl
;
10850 if (decl_context
== PARM
)
10852 decl
= build_decl (PARM_DECL
, declarator
, type
);
10854 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10855 inlinep
, friendp
, raises
!= NULL_TREE
);
10857 /* Compute the type actually passed in the parmlist,
10858 for the case where there is no prototype.
10859 (For example, shorts and chars are passed as ints.)
10860 When there is a prototype, this is overridden later. */
10862 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10864 else if (decl_context
== FIELD
)
10866 if (type
== error_mark_node
)
10868 /* Happens when declaring arrays of sizes which
10869 are error_mark_node, for example. */
10872 else if (in_namespace
&& !friendp
)
10874 /* Something like struct S { int N::j; }; */
10875 cp_error ("invalid use of `::'");
10878 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10881 tree function_context
;
10883 /* We catch the others as conflicts with the builtin
10885 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10887 cp_error ("function `%D' cannot be declared friend",
10894 if (ctype
== NULL_TREE
)
10895 ctype
= current_class_type
;
10897 if (ctype
== NULL_TREE
)
10899 cp_error ("can't make `%D' into a method -- not in a class",
10901 return void_type_node
;
10904 /* ``A union may [ ... ] not [ have ] virtual functions.''
10906 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10908 cp_error ("function `%D' declared virtual inside a union",
10910 return void_type_node
;
10913 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10914 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10915 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10916 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10920 cp_error ("`%D' cannot be declared virtual, since it is always static",
10925 else if (staticp
< 2)
10926 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10927 TYPE_ARG_TYPES (type
));
10930 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10931 function_context
= (ctype
!= NULL_TREE
) ?
10932 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10933 publicp
= (! friendp
|| ! staticp
)
10934 && function_context
== NULL_TREE
;
10935 decl
= grokfndecl (ctype
, type
,
10936 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10937 ? declarator
: dname
,
10939 virtualp
, flags
, quals
, raises
,
10940 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10941 funcdef_flag
, template_count
, in_namespace
);
10942 if (decl
== NULL_TREE
)
10945 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10946 /* The decl and setting of decl_machine_attr is also turned off. */
10947 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10950 /* [class.conv.ctor]
10952 A constructor declared without the function-specifier
10953 explicit that can be called with a single parameter
10954 specifies a conversion from the type of its first
10955 parameter to the type of its class. Such a constructor
10956 is called a converting constructor. */
10957 if (explicitp
== 2)
10958 DECL_NONCONVERTING_P (decl
) = 1;
10959 else if (DECL_CONSTRUCTOR_P (decl
))
10961 /* The constructor can be called with exactly one
10962 parameter if there is at least one parameter, and
10963 any subsequent parameters have default arguments.
10964 We don't look at the first parameter, which is
10965 really just the `this' parameter for the new
10968 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10970 /* Skip the `in_chrg' argument too, if present. */
10971 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10972 arg_types
= TREE_CHAIN (arg_types
);
10974 if (arg_types
== void_list_node
10976 && TREE_CHAIN (arg_types
)
10977 && TREE_CHAIN (arg_types
) != void_list_node
10978 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10979 DECL_NONCONVERTING_P (decl
) = 1;
10982 else if (TREE_CODE (type
) == METHOD_TYPE
)
10984 /* We only get here for friend declarations of
10985 members of other classes. */
10986 /* All method decls are public, so tell grokfndecl to set
10987 TREE_PUBLIC, also. */
10988 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10989 virtualp
, flags
, quals
, raises
,
10990 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10991 template_count
, in_namespace
);
10992 if (decl
== NULL_TREE
)
10995 else if (!staticp
&& ! processing_template_decl
10996 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10997 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11000 cp_error ("field `%D' has incomplete type", declarator
);
11002 cp_error ("name `%T' has incomplete type", type
);
11004 /* If we're instantiating a template, tell them which
11005 instantiation made the field's type be incomplete. */
11006 if (current_class_type
11007 && TYPE_NAME (current_class_type
)
11008 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11009 && declspecs
&& TREE_VALUE (declspecs
)
11010 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11011 cp_error (" in instantiation of template `%T'",
11012 current_class_type
);
11014 type
= error_mark_node
;
11021 error ("`%s' is neither function nor method; cannot be declared friend",
11022 IDENTIFIER_POINTER (declarator
));
11030 /* Friends are treated specially. */
11031 if (ctype
== current_class_type
)
11032 warning ("member functions are implicitly friends of their class");
11035 tree t
= NULL_TREE
;
11036 if (decl
&& DECL_NAME (decl
))
11038 if (template_class_depth (current_class_type
) == 0)
11041 = check_explicit_specialization
11043 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11044 if (decl
== error_mark_node
)
11045 return error_mark_node
;
11048 t
= do_friend (ctype
, declarator
, decl
,
11049 last_function_parms
, attrlist
, flags
, quals
,
11052 if (t
&& funcdef_flag
)
11055 return void_type_node
;
11059 /* Structure field. It may not be a function, except for C++ */
11061 if (decl
== NULL_TREE
)
11067 /* An attempt is being made to initialize a non-static
11068 member. But, from [class.mem]:
11070 4 A member-declarator can contain a
11071 constant-initializer only if it declares a static
11072 member (_class.static_) of integral or enumeration
11073 type, see _class.static.data_.
11075 This used to be relatively common practice, but
11076 the rest of the compiler does not correctly
11077 handle the initialization unless the member is
11078 static so we make it static below. */
11079 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
11081 cp_pedwarn ("making `%D' static", declarator
);
11085 if (uses_template_parms (type
))
11086 /* We'll check at instantiation time. */
11088 else if (check_static_variable_definition (declarator
,
11090 /* If we just return the declaration, crashes
11091 will sometimes occur. We therefore return
11092 void_type_node, as if this was a friend
11093 declaration, to cause callers to completely
11094 ignore this declaration. */
11095 return void_type_node
;
11098 /* 9.2p13 [class.mem] */
11099 if (declarator
== constructor_name (current_class_type
)
11100 /* Divergence from the standard: In extern "C", we
11101 allow non-static data members here, because C does
11102 and /usr/include/netinet/in.h uses that. */
11103 && (staticp
|| ! in_system_header
))
11104 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
11109 /* C++ allows static class members. All other work
11110 for this is done by grokfield. */
11111 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11112 TREE_STATIC (decl
) = 1;
11113 /* In class context, 'static' means public access. */
11114 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11118 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
11119 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11121 DECL_MUTABLE_P (decl
) = 1;
11122 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11126 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11127 inlinep
, friendp
, raises
!= NULL_TREE
);
11130 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11132 tree original_name
;
11138 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11139 original_name
= dname
;
11141 original_name
= declarator
;
11143 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11144 error ("storage class `auto' invalid for function `%s'", name
);
11145 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11146 error ("storage class `register' invalid for function `%s'", name
);
11148 /* Function declaration not at top level.
11149 Storage classes other than `extern' are not allowed
11150 and `extern' makes no difference. */
11151 if (! toplevel_bindings_p ()
11152 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11153 || RIDBIT_SETP (RID_INLINE
, specbits
))
11156 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11157 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11159 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11162 if (ctype
== NULL_TREE
)
11166 error ("virtual non-class function `%s'", name
);
11170 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11171 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11172 TYPE_ARG_TYPES (type
));
11174 /* Record presence of `static'. */
11175 publicp
= (ctype
!= NULL_TREE
11176 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11177 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11179 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11180 virtualp
, flags
, quals
, raises
,
11182 publicp
, inlinep
, funcdef_flag
,
11183 template_count
, in_namespace
);
11184 if (decl
== NULL_TREE
)
11189 int illegal_static
= 0;
11191 /* Don't allow a static member function in a class, and forbid
11192 declaring main to be static. */
11193 if (TREE_CODE (type
) == METHOD_TYPE
)
11195 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11196 illegal_static
= 1;
11198 else if (current_function_decl
)
11200 /* FIXME need arm citation */
11201 error ("cannot declare static function inside another function");
11202 illegal_static
= 1;
11205 if (illegal_static
)
11208 RIDBIT_RESET (RID_STATIC
, specbits
);
11214 /* It's a variable. */
11216 /* An uninitialized decl with `extern' is a reference. */
11217 decl
= grokvardecl (type
, declarator
, &specbits
,
11219 (type_quals
& TYPE_QUAL_CONST
) != 0,
11221 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11222 inlinep
, friendp
, raises
!= NULL_TREE
);
11226 DECL_CONTEXT (decl
) = ctype
;
11229 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11231 RIDBIT_RESET (RID_STATIC
, specbits
);
11233 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11235 cp_error ("static member `%D' declared `register'", decl
);
11236 RIDBIT_RESET (RID_REGISTER
, specbits
);
11238 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11240 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11242 RIDBIT_RESET (RID_EXTERN
, specbits
);
11247 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11249 error ("`%s' cannot be declared mutable", name
);
11252 /* Record `register' declaration for warnings on &
11253 and in case doing stupid register allocation. */
11255 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11256 DECL_REGISTER (decl
) = 1;
11258 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11259 DECL_THIS_EXTERN (decl
) = 1;
11261 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11262 DECL_THIS_STATIC (decl
) = 1;
11264 /* Record constancy and volatility. There's no need to do this
11265 when processing a template; we'll do this for the instantiated
11266 declaration based on the type of DECL. */
11267 if (!processing_template_decl
)
11268 c_apply_type_quals_to_decl (type_quals
, decl
);
11274 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11275 An empty exprlist is a parmlist. An exprlist which
11276 contains only identifiers at the global level
11277 is a parmlist. Otherwise, it is an exprlist. */
11280 parmlist_is_exprlist (exprs
)
11283 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11286 if (toplevel_bindings_p ())
11288 /* At the global level, if these are all identifiers,
11289 then it is a parmlist. */
11292 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11294 exprs
= TREE_CHAIN (exprs
);
11301 /* Subroutine of start_function. Ensure that each of the parameter
11302 types (as listed in PARMS) is complete, as is required for a
11303 function definition. */
11306 require_complete_types_for_parms (parms
)
11311 tree type
= TREE_TYPE (parms
);
11312 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11314 if (DECL_NAME (parms
))
11315 error ("parameter `%s' has incomplete type",
11316 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11318 error ("parameter has incomplete type");
11319 TREE_TYPE (parms
) = error_mark_node
;
11322 layout_decl (parms
, 0);
11324 parms
= TREE_CHAIN (parms
);
11328 /* Returns DECL if DECL is a local variable (or parameter). Returns
11329 NULL_TREE otherwise. */
11332 local_variable_p (t
)
11335 if ((TREE_CODE (t
) == VAR_DECL
11336 /* A VAR_DECL with a context that is a _TYPE is a static data
11338 && !TYPE_P (CP_DECL_CONTEXT (t
))
11339 /* Any other non-local variable must be at namespace scope. */
11340 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11341 || (TREE_CODE (t
) == PARM_DECL
))
11347 /* Check that ARG, which is a default-argument expression for a
11348 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11349 something goes wrong. DECL may also be a _TYPE node, rather than a
11350 DECL, if there is no DECL available. */
11353 check_default_argument (decl
, arg
)
11360 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11361 /* We get a DEFAULT_ARG when looking at an in-class declaration
11362 with a default argument. Ignore the argument for now; we'll
11363 deal with it after the class is complete. */
11366 if (processing_template_decl
|| uses_template_parms (arg
))
11367 /* We don't do anything checking until instantiation-time. Note
11368 that there may be uninstantiated arguments even for an
11369 instantiated function, since default arguments are not
11370 instantiated until they are needed. */
11379 decl_type
= TREE_TYPE (decl
);
11381 if (arg
== error_mark_node
11382 || decl
== error_mark_node
11383 || TREE_TYPE (arg
) == error_mark_node
11384 || decl_type
== error_mark_node
)
11385 /* Something already went wrong. There's no need to check
11387 return error_mark_node
;
11389 /* [dcl.fct.default]
11391 A default argument expression is implicitly converted to the
11393 if (!TREE_TYPE (arg
)
11394 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11397 cp_error ("default argument for `%#D' has type `%T'",
11398 decl
, TREE_TYPE (arg
));
11400 cp_error ("default argument for parameter of type `%T' has type `%T'",
11401 decl_type
, TREE_TYPE (arg
));
11403 return error_mark_node
;
11406 /* [dcl.fct.default]
11408 Local variables shall not be used in default argument
11411 The keyword `this' shall not be used in a default argument of a
11412 member function. */
11413 var
= search_tree (arg
, local_variable_p
);
11416 cp_error ("default argument `%E' uses local variable `%D'",
11418 return error_mark_node
;
11425 /* Decode the list of parameter types for a function type.
11426 Given the list of things declared inside the parens,
11427 return a list of types.
11429 The list we receive can have three kinds of elements:
11430 an IDENTIFIER_NODE for names given without types,
11431 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11432 or void_type_node, to mark the end of an argument list
11433 when additional arguments are not permitted (... was not used).
11435 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11436 a mere declaration. A nonempty identifier-list gets an error message
11437 when FUNCDEF_FLAG is zero.
11438 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11439 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11441 If all elements of the input list contain types,
11442 we return a list of the types.
11443 If all elements contain no type (except perhaps a void_type_node
11444 at the end), we return a null list.
11445 If some have types and some do not, it is an error, and we
11446 return a null list.
11448 Also set last_function_parms to either
11449 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11450 A list of names is converted to a chain of PARM_DECLs
11451 by store_parm_decls so that ultimately it is always a chain of decls.
11453 Note that in C++, parameters can take default values. These default
11454 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11455 an error to specify default values which are followed by parameters
11456 that have no default values, or an ELLIPSES. For simplicities sake,
11457 only parameters which are specified with their types can take on
11461 grokparms (first_parm
, funcdef_flag
)
11465 tree result
= NULL_TREE
;
11466 tree decls
= NULL_TREE
;
11468 if (first_parm
!= NULL_TREE
11469 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11471 if (! funcdef_flag
)
11472 pedwarn ("parameter names (without types) in function declaration");
11473 last_function_parms
= first_parm
;
11476 else if (first_parm
!= NULL_TREE
11477 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11478 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11479 my_friendly_abort (145);
11482 /* Types were specified. This is a list of declarators
11483 each represented as a TREE_LIST node. */
11484 register tree parm
, chain
;
11485 int any_init
= 0, any_error
= 0;
11487 if (first_parm
!= NULL_TREE
)
11489 tree last_result
= NULL_TREE
;
11490 tree last_decl
= NULL_TREE
;
11492 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11494 tree type
= NULL_TREE
, list_node
= parm
;
11495 register tree decl
= TREE_VALUE (parm
);
11496 tree init
= TREE_PURPOSE (parm
);
11498 chain
= TREE_CHAIN (parm
);
11499 /* @@ weak defense against parse errors. */
11500 if (TREE_CODE (decl
) != VOID_TYPE
11501 && TREE_CODE (decl
) != TREE_LIST
)
11503 /* Give various messages as the need arises. */
11504 if (TREE_CODE (decl
) == STRING_CST
)
11505 cp_error ("invalid string constant `%E'", decl
);
11506 else if (TREE_CODE (decl
) == INTEGER_CST
)
11507 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11511 if (TREE_CODE (decl
) != VOID_TYPE
)
11513 decl
= grokdeclarator (TREE_VALUE (decl
),
11514 TREE_PURPOSE (decl
),
11515 PARM
, init
!= NULL_TREE
,
11517 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11520 /* Top-level qualifiers on the parameters are
11521 ignored for function types. */
11522 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11524 if (TREE_CODE (type
) == VOID_TYPE
)
11525 decl
= void_type_node
;
11526 else if (TREE_CODE (type
) == METHOD_TYPE
)
11528 if (DECL_NAME (decl
))
11529 /* Cannot use the decl here because
11530 we don't have DECL_CONTEXT set up yet. */
11531 cp_error ("parameter `%D' invalidly declared method type",
11534 error ("parameter invalidly declared method type");
11535 type
= build_pointer_type (type
);
11536 TREE_TYPE (decl
) = type
;
11538 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11540 if (DECL_NAME (decl
))
11541 cp_error ("parameter `%D' invalidly declared offset type",
11544 error ("parameter invalidly declared offset type");
11545 type
= build_pointer_type (type
);
11546 TREE_TYPE (decl
) = type
;
11548 else if (abstract_virtuals_error (decl
, type
))
11549 any_error
= 1; /* Seems like a good idea. */
11550 else if (POINTER_TYPE_P (type
))
11553 while (POINTER_TYPE_P (t
)
11554 || (TREE_CODE (t
) == ARRAY_TYPE
11555 && TYPE_DOMAIN (t
) != NULL_TREE
))
11557 if (TREE_CODE (t
) == ARRAY_TYPE
)
11558 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11560 TYPE_PTR_P (type
) ? "pointer" : "reference");
11564 if (TREE_CODE (decl
) == VOID_TYPE
)
11566 if (result
== NULL_TREE
)
11568 result
= void_list_node
;
11569 last_result
= result
;
11573 TREE_CHAIN (last_result
) = void_list_node
;
11574 last_result
= void_list_node
;
11577 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11578 error ("`void' in parameter list must be entire list");
11582 /* Since there is a prototype, args are passed in their own types. */
11583 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11584 if (PROMOTE_PROTOTYPES
11585 && (TREE_CODE (type
) == INTEGER_TYPE
11586 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11587 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11588 DECL_ARG_TYPE (decl
) = integer_type_node
;
11589 if (!any_error
&& init
)
11592 init
= check_default_argument (decl
, init
);
11597 if (decls
== NULL_TREE
)
11604 TREE_CHAIN (last_decl
) = decl
;
11607 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11609 TREE_PURPOSE (list_node
) = init
;
11610 TREE_VALUE (list_node
) = type
;
11611 TREE_CHAIN (list_node
) = NULL_TREE
;
11614 list_node
= tree_cons (init
, type
, NULL_TREE
);
11615 if (result
== NULL_TREE
)
11617 result
= list_node
;
11618 last_result
= result
;
11622 TREE_CHAIN (last_result
) = list_node
;
11623 last_result
= list_node
;
11627 TREE_CHAIN (last_result
) = NULL_TREE
;
11628 /* If there are no parameters, and the function does not end
11629 with `...', then last_decl will be NULL_TREE. */
11630 if (last_decl
!= NULL_TREE
)
11631 TREE_CHAIN (last_decl
) = NULL_TREE
;
11635 last_function_parms
= decls
;
11640 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11641 FUNCTION_TYPE with the newly parsed version of its default argument, which
11642 was previously digested as text. See snarf_defarg et al in lex.c. */
11645 replace_defarg (arg
, init
)
11648 if (! processing_template_decl
11649 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11650 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11651 TREE_TYPE (init
), TREE_VALUE (arg
));
11652 TREE_PURPOSE (arg
) = init
;
11659 tree t
= FUNCTION_ARG_CHAIN (d
);
11660 if (DECL_CONSTRUCTOR_P (d
)
11661 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11662 t
= TREE_CHAIN (t
);
11663 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11664 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11665 == DECL_CLASS_CONTEXT (d
))
11666 && (TREE_CHAIN (t
) == NULL_TREE
11667 || TREE_CHAIN (t
) == void_list_node
11668 || TREE_PURPOSE (TREE_CHAIN (t
))))
11673 /* These memoizing functions keep track of special properties which
11674 a class may have. `grok_ctor_properties' notices whether a class
11675 has a constructor of the form X(X&), and also complains
11676 if the class has a constructor of the form X(X).
11677 `grok_op_properties' takes notice of the various forms of
11678 operator= which are defined, as well as what sorts of type conversion
11679 may apply. Both functions take a FUNCTION_DECL as an argument. */
11682 grok_ctor_properties (ctype
, decl
)
11685 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11686 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11688 /* When a type has virtual baseclasses, a magical first int argument is
11689 added to any ctor so we can tell if the class has been initialized
11690 yet. This could screw things up in this function, so we deliberately
11691 ignore the leading int if we're in that situation. */
11692 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11694 my_friendly_assert (parmtypes
11695 && TREE_VALUE (parmtypes
) == integer_type_node
,
11697 parmtypes
= TREE_CHAIN (parmtypes
);
11698 parmtype
= TREE_VALUE (parmtypes
);
11703 A non-template constructor for class X is a copy constructor if
11704 its first parameter is of type X&, const X&, volatile X& or const
11705 volatile X&, and either there are no other parameters or else all
11706 other parameters have default arguments. */
11707 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11708 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11709 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11710 || TREE_CHAIN (parmtypes
) == void_list_node
11711 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11712 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11713 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11715 TYPE_HAS_INIT_REF (ctype
) = 1;
11716 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11717 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11721 A declaration of a constructor for a class X is ill-formed if its
11722 first parameter is of type (optionally cv-qualified) X and either
11723 there are no other parameters or else all other parameters have
11726 We *don't* complain about member template instantiations that
11727 have this form, though; they can occur as we try to decide what
11728 constructor to use during overload resolution. Since overload
11729 resolution will never prefer such a constructor to the
11730 non-template copy constructor (which is either explicitly or
11731 implicitly defined), there's no need to worry about their
11732 existence. Theoretically, they should never even be
11733 instantiated, but that's hard to forestall. */
11734 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11735 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11736 || TREE_CHAIN (parmtypes
) == void_list_node
11737 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11738 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11739 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11741 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11743 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11746 else if (TREE_CODE (parmtype
) == VOID_TYPE
11747 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11748 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11753 /* An operator with this name can be either unary or binary. */
11759 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11760 || name
== ansi_opname
[(int) ADDR_EXPR
]
11761 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11762 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11763 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11764 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11767 /* An operator with this name can only be unary. */
11773 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11774 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11775 || name
== ansi_opname
[(int) COMPONENT_REF
]
11776 || IDENTIFIER_TYPENAME_P (name
));
11779 /* Do a little sanity-checking on how they declared their operator. */
11782 grok_op_properties (decl
, virtualp
, friendp
)
11784 int virtualp
, friendp
;
11786 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11787 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11788 tree name
= DECL_NAME (decl
);
11790 if (current_class_type
== NULL_TREE
)
11797 A user-declared copy assignment operator X::operator= is a
11798 non-static non-template member function of class X with
11799 exactly one parameter of type X, X&, const X&, volatile X& or
11800 const volatile X&. */
11801 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11802 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11803 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11805 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11806 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11807 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11808 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11809 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11810 || name
== ansi_opname
[(int) MEMBER_REF
])
11811 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11812 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11813 TYPE_GETS_NEW (current_class_type
) |= 1;
11814 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11815 TYPE_GETS_DELETE (current_class_type
) |= 1;
11816 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11817 TYPE_GETS_NEW (current_class_type
) |= 2;
11818 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11819 TYPE_GETS_DELETE (current_class_type
) |= 2;
11822 if (name
== ansi_opname
[(int) NEW_EXPR
]
11823 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11825 /* When the compiler encounters the definition of A::operator new, it
11826 doesn't look at the class declaration to find out if it's static. */
11828 revert_static_member_fn (&decl
, NULL
, NULL
);
11830 /* Take care of function decl if we had syntax errors. */
11831 if (argtypes
== NULL_TREE
)
11833 = build_function_type (ptr_type_node
,
11834 hash_tree_chain (integer_type_node
,
11837 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11839 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11840 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11843 revert_static_member_fn (&decl
, NULL
, NULL
);
11845 if (argtypes
== NULL_TREE
)
11847 = build_function_type (void_type_node
,
11848 hash_tree_chain (ptr_type_node
,
11852 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11854 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11855 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11856 != void_list_node
))
11857 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11862 /* An operator function must either be a non-static member function
11863 or have at least one parameter of a class, a reference to a class,
11864 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11865 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11867 if (IDENTIFIER_TYPENAME_P (name
)
11868 || name
== ansi_opname
[(int) CALL_EXPR
]
11869 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11870 || name
== ansi_opname
[(int) COMPONENT_REF
]
11871 || name
== ansi_opname
[(int) ARRAY_REF
])
11872 cp_error ("`%D' must be a nonstatic member function", decl
);
11877 if (DECL_STATIC_FUNCTION_P (decl
))
11878 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11881 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11883 tree arg
= TREE_VALUE (p
);
11884 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11885 arg
= TREE_TYPE (arg
);
11887 /* This lets bad template code slip through. */
11888 if (IS_AGGR_TYPE (arg
)
11889 || TREE_CODE (arg
) == ENUMERAL_TYPE
11890 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11891 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11895 ("`%D' must have an argument of class or enumerated type",
11902 if (name
== ansi_opname
[(int) CALL_EXPR
])
11903 return; /* No restrictions on args. */
11905 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11907 tree t
= TREE_TYPE (name
);
11908 if (TREE_CODE (t
) == VOID_TYPE
)
11909 pedwarn ("void is not a valid type conversion operator");
11910 else if (! friendp
)
11912 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11913 const char *what
= 0;
11915 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11917 if (t
== current_class_type
)
11918 what
= "the same type";
11919 /* Don't force t to be complete here. */
11920 else if (IS_AGGR_TYPE (t
)
11922 && DERIVED_FROM_P (t
, current_class_type
))
11923 what
= "a base class";
11926 warning ("conversion to %s%s will never use a type conversion operator",
11927 ref
? "a reference to " : "", what
);
11931 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11935 if (list_length (argtypes
) != 3 && methodp
)
11937 cp_error ("`%D' must take exactly one argument", decl
);
11940 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11942 if (copy_assignment_arg_p (parmtype
, virtualp
)
11945 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11946 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11947 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11948 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11951 else if (name
== ansi_opname
[(int) COND_EXPR
])
11954 cp_error ("ANSI C++ prohibits overloading operator ?:");
11956 else if (ambi_op_p (name
))
11958 if (list_length (argtypes
) == 2)
11960 else if (list_length (argtypes
) == 3)
11962 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11963 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11964 && ! processing_template_decl
11965 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11968 cp_error ("postfix `%D' must take `int' as its argument",
11972 ("postfix `%D' must take `int' as its second argument",
11979 cp_error ("`%D' must take either zero or one argument", decl
);
11981 cp_error ("`%D' must take either one or two arguments", decl
);
11984 /* More Effective C++ rule 6. */
11986 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11987 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11989 tree arg
= TREE_VALUE (argtypes
);
11990 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11991 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11992 arg
= TREE_TYPE (arg
);
11993 arg
= TYPE_MAIN_VARIANT (arg
);
11994 if (list_length (argtypes
) == 2)
11996 if (TREE_CODE (ret
) != REFERENCE_TYPE
11997 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11999 cp_warning ("prefix `%D' should return `%T'", decl
,
12000 build_reference_type (arg
));
12004 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12005 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12009 else if (unary_op_p (name
))
12011 if (list_length (argtypes
) != 2)
12014 cp_error ("`%D' must take `void'", decl
);
12016 cp_error ("`%D' must take exactly one argument", decl
);
12019 else /* if (binary_op_p (name)) */
12021 if (list_length (argtypes
) != 3)
12024 cp_error ("`%D' must take exactly one argument", decl
);
12026 cp_error ("`%D' must take exactly two arguments", decl
);
12029 /* More Effective C++ rule 7. */
12031 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
12032 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
12033 || name
== ansi_opname
[COMPOUND_EXPR
]))
12034 cp_warning ("user-defined `%D' always evaluates both arguments",
12038 /* Effective C++ rule 23. */
12040 && list_length (argtypes
) == 3
12041 && (name
== ansi_opname
[PLUS_EXPR
]
12042 || name
== ansi_opname
[MINUS_EXPR
]
12043 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
12044 || name
== ansi_opname
[MULT_EXPR
])
12045 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12046 cp_warning ("`%D' should return by value", decl
);
12050 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
12051 if (TREE_PURPOSE (argtypes
))
12053 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12054 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12055 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
12058 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12061 cp_error ("`%D' cannot have default arguments", decl
);
12066 static const char *
12068 enum tag_types code
;
12081 my_friendly_abort (981122);
12085 /* Get the struct, enum or union (CODE says which) with tag NAME.
12086 Define the tag as a forward-reference if it is not defined.
12088 C++: If a class derivation is given, process it here, and report
12089 an error if multiple derivation declarations are not identical.
12091 If this is a definition, come in through xref_tag and only look in
12092 the current frame for the name (since C++ allows new names in any
12096 xref_tag (code_type_node
, name
, globalize
)
12097 tree code_type_node
;
12101 enum tag_types tag_code
;
12102 enum tree_code code
;
12104 register tree ref
, t
;
12105 struct binding_level
*b
= current_binding_level
;
12107 tree attributes
= NULL_TREE
;
12108 tree context
= NULL_TREE
;
12110 /* If we are called from the parser, code_type_node will sometimes be a
12111 TREE_LIST. This indicates that the user wrote
12112 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12114 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12116 attributes
= TREE_PURPOSE (code_type_node
);
12117 code_type_node
= TREE_VALUE (code_type_node
);
12120 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12125 code
= RECORD_TYPE
;
12131 code
= ENUMERAL_TYPE
;
12134 my_friendly_abort (18);
12137 /* If a cross reference is requested, look up the type
12138 already defined for this tag and return it. */
12139 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
12142 name
= TYPE_IDENTIFIER (t
);
12146 t
= IDENTIFIER_TYPE_VALUE (name
);
12148 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12149 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12154 /* If we know we are defining this tag, only look it up in
12155 this scope and don't try to find it as a type. */
12156 ref
= lookup_tag (code
, name
, b
, 1);
12162 /* [dcl.type.elab] If the identifier resolves to a
12163 typedef-name or a template type-parameter, the
12164 elaborated-type-specifier is ill-formed. */
12165 if (t
!= TYPE_MAIN_VARIANT (t
)
12166 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12167 cp_pedwarn ("using typedef-name `%D' after `%s'",
12168 TYPE_NAME (t
), tag_name (tag_code
));
12169 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12170 cp_error ("using template type parameter `%T' after `%s'",
12171 t
, tag_name (tag_code
));
12176 ref
= lookup_tag (code
, name
, b
, 0);
12180 /* Try finding it as a type declaration. If that wins,
12182 ref
= lookup_name (name
, 1);
12184 if (ref
!= NULL_TREE
12185 && processing_template_decl
12186 && DECL_CLASS_TEMPLATE_P (ref
)
12187 && template_class_depth (current_class_type
) == 0)
12188 /* Since GLOBALIZE is true, we're declaring a global
12189 template, so we want this type. */
12190 ref
= DECL_RESULT (ref
);
12192 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12193 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12194 ref
= TREE_TYPE (ref
);
12199 if (ref
&& current_class_type
12200 && template_class_depth (current_class_type
)
12201 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12203 /* Since GLOBALIZE is non-zero, we are not looking at a
12204 definition of this tag. Since, in addition, we are currently
12205 processing a (member) template declaration of a template
12206 class, we must be very careful; consider:
12213 { template <class V>
12214 friend struct S1; };
12216 Here, the S2::S1 declaration should not be confused with the
12217 outer declaration. In particular, the inner version should
12218 have a template parameter of level 2, not level 1. This
12219 would be particularly important if the member declaration
12222 template <class V = U> friend struct S1;
12224 say, when we should tsubst into `U' when instantiating
12225 S2. On the other hand, when presented with:
12235 we must find the inner binding eventually. We
12236 accomplish this by making sure that the new type we
12237 create to represent this declaration has the right
12239 context
= TYPE_CONTEXT (ref
);
12244 push_obstacks_nochange ();
12248 /* If no such tag is yet defined, create a forward-reference node
12249 and record it as the "definition".
12250 When a real declaration of this type is found,
12251 the forward-reference will be altered into a real type. */
12253 /* In C++, since these migrate into the global scope, we must
12254 build them on the permanent obstack. */
12256 temp
= allocation_temporary_p ();
12258 end_temporary_allocation ();
12260 if (code
== ENUMERAL_TYPE
)
12262 cp_error ("use of enum `%#D' without previous declaration", name
);
12264 ref
= make_node (ENUMERAL_TYPE
);
12266 /* Give the type a default layout like unsigned int
12267 to avoid crashing if it does not get defined. */
12268 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12269 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12270 TREE_UNSIGNED (ref
) = 1;
12271 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12272 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12273 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12275 /* Enable us to recognize when a type is created in class context.
12276 To do nested classes correctly, this should probably be cleared
12277 out when we leave this classes scope. Currently this in only
12278 done in `start_enum'. */
12280 pushtag (name
, ref
, globalize
);
12284 struct binding_level
*old_b
= class_binding_level
;
12286 ref
= make_lang_type (code
);
12287 TYPE_CONTEXT (ref
) = context
;
12289 #ifdef NONNESTED_CLASSES
12290 /* Class types don't nest the way enums do. */
12291 class_binding_level
= (struct binding_level
*)0;
12293 pushtag (name
, ref
, globalize
);
12294 class_binding_level
= old_b
;
12299 /* If it no longer looks like a nested type, make sure it's
12301 If it is not an IDENTIFIER, this is not a declaration */
12302 if (b
->namespace_p
&& !class_binding_level
12303 && TREE_CODE (name
) == IDENTIFIER_NODE
)
12305 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12306 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12309 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12310 redeclare_class_template (ref
, current_template_parms
);
12313 /* Until the type is defined, tentatively accept whatever
12314 structure tag the user hands us. */
12315 if (TYPE_SIZE (ref
) == NULL_TREE
12316 && ref
!= current_class_type
12317 /* Have to check this, in case we have contradictory tag info. */
12318 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12320 if (tag_code
== class_type
)
12321 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12322 else if (tag_code
== record_type
)
12323 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12328 TREE_TYPE (ref
) = attributes
;
12334 xref_tag_from_type (old
, id
, globalize
)
12338 tree code_type_node
;
12340 if (TREE_CODE (old
) == RECORD_TYPE
)
12341 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12342 ? class_type_node
: record_type_node
);
12344 code_type_node
= union_type_node
;
12346 if (id
== NULL_TREE
)
12347 id
= TYPE_IDENTIFIER (old
);
12349 return xref_tag (code_type_node
, id
, globalize
);
12352 /* REF is a type (named NAME), for which we have just seen some
12353 baseclasses. BINFO is a list of those baseclasses; the
12354 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12355 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12356 struct, or union. */
12359 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12360 tree code_type_node
;
12364 /* In the declaration `A : X, Y, ... Z' we mark all the types
12365 (A, X, Y, ..., Z) so we can check for duplicates. */
12370 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12372 if (tag_code
== union_type
)
12374 cp_error ("derived union `%T' invalid", ref
);
12378 len
= list_length (binfo
);
12379 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12381 /* First, make sure that any templates in base-classes are
12382 instantiated. This ensures that if we call ourselves recursively
12383 we do not get confused about which classes are marked and which
12385 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12386 complete_type (TREE_VALUE (base
));
12388 SET_CLASSTYPE_MARKED (ref
);
12389 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12391 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12393 /* The base of a derived struct is public by default. */
12395 = (TREE_PURPOSE (binfo
) == access_public_node
12396 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12397 || (tag_code
!= class_type
12398 && (TREE_PURPOSE (binfo
) == access_default_node
12399 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12401 = (TREE_PURPOSE (binfo
) == access_protected_node
12402 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12404 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12405 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12406 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12407 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12408 tree basetype
= TREE_VALUE (binfo
);
12411 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12412 basetype
= TREE_TYPE (basetype
);
12414 || (TREE_CODE (basetype
) != RECORD_TYPE
12415 && TREE_CODE (basetype
) != TYPENAME_TYPE
12416 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12417 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12419 cp_error ("base type `%T' fails to be a struct or class type",
12420 TREE_VALUE (binfo
));
12424 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12426 /* This code replaces similar code in layout_basetypes.
12427 We put the complete_type first for implicit `typename'. */
12428 if (TYPE_SIZE (basetype
) == NULL_TREE
12429 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12431 cp_error ("base class `%T' has incomplete type", basetype
);
12436 if (CLASSTYPE_MARKED (basetype
))
12438 if (basetype
== ref
)
12439 cp_error ("recursive type `%T' undefined", basetype
);
12441 cp_error ("duplicate base type `%T' invalid", basetype
);
12445 if (TYPE_FOR_JAVA (basetype
)
12446 && (current_lang_stack
12447 == &VARRAY_TREE (current_lang_base
, 0)))
12448 TYPE_FOR_JAVA (ref
) = 1;
12450 /* Note that the BINFO records which describe individual
12451 inheritances are *not* shared in the lattice! They
12452 cannot be shared because a given baseclass may be
12453 inherited with different `accessibility' by different
12454 derived classes. (Each BINFO record describing an
12455 individual inheritance contains flags which say what
12456 the `accessibility' of that particular inheritance is.) */
12459 = make_binfo (integer_zero_node
, basetype
,
12460 CLASS_TYPE_P (basetype
)
12461 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12462 CLASS_TYPE_P (basetype
)
12463 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12465 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12466 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12467 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12468 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12469 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12471 /* We need to unshare the binfos now so that lookups during class
12472 definition work. */
12473 unshare_base_binfos (base_binfo
);
12475 SET_CLASSTYPE_MARKED (basetype
);
12477 /* We are free to modify these bits because they are meaningless
12478 at top level, and BASETYPE is a top-level type. */
12479 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12481 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12482 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12485 if (CLASS_TYPE_P (basetype
))
12487 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12488 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12495 TREE_VEC_LENGTH (binfos
) = i
;
12497 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12500 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12503 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12505 if (CLASS_TYPE_P (basetype
))
12506 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12507 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12510 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12511 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12513 /* Unmark all the types. */
12515 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12516 CLEAR_CLASSTYPE_MARKED (ref
);
12518 /* Now that we know all the base-classes, set up the list of virtual
12520 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12526 /* Begin compiling the definition of an enumeration type.
12527 NAME is its name (or null if anonymous).
12528 Returns the type object, as yet incomplete.
12529 Also records info about it so that build_enumerator
12530 may be used to declare the individual values as they are read. */
12536 register tree enumtype
= NULL_TREE
;
12537 struct binding_level
*b
= current_binding_level
;
12539 /* We are wasting space here and putting these on the permanent_obstack so
12540 that typeid(local enum) will work correctly. */
12541 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12543 /* If this is the real definition for a previous forward reference,
12544 fill in the contents in the same object that used to be the
12545 forward reference. */
12547 if (name
!= NULL_TREE
)
12548 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12550 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12552 cp_error ("multiple definition of `%#T'", enumtype
);
12553 cp_error_at ("previous definition here", enumtype
);
12557 enumtype
= make_node (ENUMERAL_TYPE
);
12558 pushtag (name
, enumtype
, 0);
12561 if (current_class_type
)
12562 TREE_ADDRESSABLE (b
->tags
) = 1;
12564 /* We don't copy this value because build_enumerator needs to do it. */
12565 enum_next_value
= integer_zero_node
;
12568 GNU_xref_decl (current_function_decl
, enumtype
);
12572 /* After processing and defining all the values of an enumeration type,
12573 install their decls in the enumeration type and finish it off.
12574 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12575 Returns ENUMTYPE. */
12578 finish_enum (enumtype
)
12581 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12582 /* Calculate the maximum value of any enumerator in this type. */
12584 tree values
= TYPE_VALUES (enumtype
);
12589 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12594 /* The TREE_VALUE is a CONST_DECL for this enumeration
12596 decl
= TREE_VALUE (pair
);
12598 /* The DECL_INITIAL will be NULL if we are processing a
12599 template declaration and this enumeration constant had no
12600 explicit initializer. */
12601 value
= DECL_INITIAL (decl
);
12602 if (value
&& !processing_template_decl
)
12604 /* Set the TREE_TYPE for the VALUE as well. That's so
12605 that when we call decl_constant_value we get an
12606 entity of the right type (but with the constant
12607 value). Since we shouldn't ever call
12608 decl_constant_value on a template type, there's no
12609 reason to do that when processing_template_decl.
12610 And, if the expression is something like a
12611 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12612 wreak havoc on the intended type of the expression.
12614 Of course, there's also no point in trying to compute
12615 minimum or maximum values if we're in a template. */
12616 TREE_TYPE (value
) = enumtype
;
12619 minnode
= maxnode
= value
;
12620 else if (tree_int_cst_lt (maxnode
, value
))
12622 else if (tree_int_cst_lt (value
, minnode
))
12626 if (processing_template_decl
)
12627 /* If this is just a template, leave the CONST_DECL
12628 alone. That way tsubst_copy will find CONST_DECLs for
12629 CONST_DECLs, and not INTEGER_CSTs. */
12632 /* In the list we're building up, we want the enumeration
12633 values, not the CONST_DECLs. */
12634 TREE_VALUE (pair
) = value
;
12638 maxnode
= minnode
= integer_zero_node
;
12640 TYPE_VALUES (enumtype
) = nreverse (values
);
12642 if (processing_template_decl
)
12644 tree scope
= current_scope ();
12645 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12646 add_tree (build_min (TAG_DEFN
, enumtype
));
12650 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12651 int lowprec
= min_precision (minnode
, unsignedp
);
12652 int highprec
= min_precision (maxnode
, unsignedp
);
12653 int precision
= MAX (lowprec
, highprec
);
12656 TYPE_SIZE (enumtype
) = NULL_TREE
;
12658 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12660 TYPE_PRECISION (enumtype
) = precision
;
12662 fixup_unsigned_type (enumtype
);
12664 fixup_signed_type (enumtype
);
12666 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12667 /* Use the width of the narrowest normal C type which is wide
12669 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12672 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12674 TYPE_SIZE (enumtype
) = 0;
12675 layout_type (enumtype
);
12677 /* Fix up all variant types of this enum type. */
12678 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12679 tem
= TYPE_NEXT_VARIANT (tem
))
12681 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12682 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12683 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12684 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12685 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12686 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12687 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12688 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12689 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12692 /* Finish debugging output for this type. */
12693 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12696 /* In start_enum we pushed obstacks. Here, we must pop them. */
12702 /* Build and install a CONST_DECL for an enumeration constant of the
12703 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12704 Assignment of sequential values by default is handled here. */
12707 build_enumerator (name
, value
, type
)
12715 /* Remove no-op casts from the value. */
12717 STRIP_TYPE_NOPS (value
);
12719 if (! processing_template_decl
)
12721 /* Validate and default VALUE. */
12722 if (value
!= NULL_TREE
)
12724 if (TREE_READONLY_DECL_P (value
))
12725 value
= decl_constant_value (value
);
12727 if (TREE_CODE (value
) == INTEGER_CST
)
12729 value
= default_conversion (value
);
12730 constant_expression_warning (value
);
12734 cp_error ("enumerator value for `%D' not integer constant", name
);
12739 /* Default based on previous value. */
12740 if (value
== NULL_TREE
&& ! processing_template_decl
)
12742 value
= enum_next_value
;
12744 cp_error ("overflow in enumeration values at `%D'", name
);
12747 /* Remove no-op casts from the value. */
12749 STRIP_TYPE_NOPS (value
);
12751 /* To fix MAX_VAL enum consts. (bkoz) */
12752 TREE_TYPE (value
) = integer_type_node
;
12756 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12757 Even in other cases, we will later (in finish_enum) be setting the
12759 if (value
!= NULL_TREE
)
12760 value
= copy_node (value
);
12762 /* C++ associates enums with global, function, or class declarations. */
12764 context
= current_scope ();
12765 if (context
&& context
== current_class_type
)
12766 /* This enum declaration is local to the class. */
12767 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12769 /* It's a global enum, or it's local to a function. (Note local to
12770 a function could mean local to a class method. */
12771 decl
= build_decl (CONST_DECL
, name
, type
);
12773 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12774 DECL_INITIAL (decl
) = value
;
12775 TREE_READONLY (decl
) = 1;
12777 if (context
&& context
== current_class_type
)
12778 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12779 on the TYPE_FIELDS list for `S'. (That's so that you can say
12780 things like `S::i' later.) */
12781 finish_member_declaration (decl
);
12785 GNU_xref_decl (current_function_decl
, decl
);
12788 if (! processing_template_decl
)
12790 /* Set basis for default for next value. */
12791 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12792 integer_one_node
, PLUS_EXPR
);
12793 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12796 result
= tree_cons (name
, decl
, NULL_TREE
);
12801 static int function_depth
;
12803 /* Create the FUNCTION_DECL for a function definition.
12804 DECLSPECS and DECLARATOR are the parts of the declaration;
12805 they describe the function's name and the type it returns,
12806 but twisted together in a fashion that parallels the syntax of C.
12808 If PRE_PARSED_P is non-zero then DECLARATOR is really the DECL for
12809 the function we are about to process; DECLSPECS are ignored. For
12810 example, we set PRE_PARSED_P when processing the definition of
12811 inline function that was defined in-class; the definition is
12812 actually processed when the class is complete. In this case,
12813 PRE_PARSED_P is 2. We also set PRE_PARSED_P when instanting the
12814 body of a template function, and when constructing thunk functions
12815 and such; in these cases PRE_PARSED_P is 1.
12817 This function creates a binding context for the function body
12818 as well as setting up the FUNCTION_DECL in current_function_decl.
12820 Returns 1 on success. If the DECLARATOR is not suitable for a function
12821 (it defines a datum instead), we return 0, which tells
12822 yyparse to report a parse error.
12824 For C++, we must first check whether that datum makes any sense.
12825 For example, "class A local_a(1,2);" means that variable local_a
12826 is an aggregate of type A, which should have a constructor
12827 applied to it with the argument list [1, 2]. */
12830 start_function (declspecs
, declarator
, attrs
, pre_parsed_p
)
12831 tree declspecs
, declarator
, attrs
;
12835 tree ctype
= NULL_TREE
;
12838 extern int have_extern_spec
;
12839 extern int used_extern_spec
;
12840 int doing_friend
= 0;
12842 /* Sanity check. */
12843 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12844 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12846 /* Assume, until we see it does. */
12847 current_function_returns_value
= 0;
12848 current_function_returns_null
= 0;
12850 current_function_assigns_this
= 0;
12851 current_function_just_assigned_this
= 0;
12852 current_function_parms_stored
= 0;
12853 last_dtor_insn
= NULL_RTX
;
12854 last_parm_cleanup_insn
= NULL_RTX
;
12855 original_result_rtx
= NULL_RTX
;
12856 base_init_expr
= NULL_TREE
;
12857 current_base_init_list
= NULL_TREE
;
12858 current_member_init_list
= NULL_TREE
;
12859 ctor_label
= dtor_label
= NULL_TREE
;
12860 static_labelno
= 0;
12861 in_function_try_handler
= 0;
12863 clear_temp_name ();
12865 /* This should only be done once on the top most decl. */
12866 if (have_extern_spec
&& !used_extern_spec
)
12868 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12869 used_extern_spec
= 1;
12874 decl1
= declarator
;
12876 fntype
= TREE_TYPE (decl1
);
12877 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12878 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12880 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12881 class is in the (lexical) scope of the class in which it is
12883 if (!ctype
&& DECL_FRIEND_P (decl1
))
12885 ctype
= DECL_CLASS_CONTEXT (decl1
);
12887 /* CTYPE could be null here if we're dealing with a template;
12888 for example, `inline friend float foo()' inside a template
12889 will have no CTYPE set. */
12890 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12896 last_function_parms
= DECL_ARGUMENTS (decl1
);
12897 last_function_parm_tags
= NULL_TREE
;
12901 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12902 /* If the declarator is not suitable for a function definition,
12903 cause a syntax error. */
12904 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12906 fntype
= TREE_TYPE (decl1
);
12908 restype
= TREE_TYPE (fntype
);
12909 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12911 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12912 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12913 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12914 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12915 fntype
= build_function_type (integer_type_node
,
12916 TYPE_ARG_TYPES (fntype
));
12918 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12920 TYPE_ARG_TYPES (fntype
));
12921 TREE_TYPE (decl1
) = fntype
;
12924 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12925 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12926 else if (DECL_MAIN_P (decl1
))
12928 /* If this doesn't return integer_type, complain. */
12929 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12931 if (pedantic
|| warn_return_type
)
12932 pedwarn ("return type for `main' changed to `int'");
12933 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12938 /* Warn if function was previously implicitly declared
12939 (but not if we warned then). */
12940 if (! warn_implicit
12941 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12942 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12944 if (!building_stmt_tree ())
12945 announce_function (decl1
);
12947 /* Set up current_class_type, and enter the scope of the class, if
12950 push_nested_class (ctype
, 1);
12951 else if (DECL_STATIC_FUNCTION_P (decl1
))
12952 push_nested_class (DECL_CONTEXT (decl1
), 2);
12954 /* Now that we have entered the scope of the class, we must restore
12955 the bindings for any template parameters surrounding DECL1, if it
12956 is an inline member template. (Order is important; consider the
12957 case where a template parameter has the same name as a field of
12958 the class.) It is not until after this point that
12959 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12960 if (pre_parsed_p
== 2)
12961 maybe_begin_member_template_processing (decl1
);
12963 /* Effective C++ rule 15. See also c_expand_return. */
12965 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12966 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12967 cp_warning ("`operator=' should return a reference to `*this'");
12969 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12970 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12971 DECL_INITIAL (decl1
) = error_mark_node
;
12973 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12974 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12977 /* This function exists in static storage.
12978 (This does not mean `static' in the C sense!) */
12979 TREE_STATIC (decl1
) = 1;
12981 /* We must call push_template_decl after current_class_type is set
12982 up. (If we are processing inline definitions after exiting a
12983 class scope, current_class_type will be NULL_TREE until set above
12984 by push_nested_class.) */
12985 if (processing_template_decl
)
12986 decl1
= push_template_decl (decl1
);
12988 /* We are now in the scope of the function being defined. */
12989 current_function_decl
= decl1
;
12991 /* Save the parm names or decls from this function's declarator
12992 where store_parm_decls will find them. */
12993 current_function_parms
= last_function_parms
;
12994 current_function_parm_tags
= last_function_parm_tags
;
12996 if (! processing_template_decl
)
12998 /* In a function definition, arg types must be complete. */
12999 require_complete_types_for_parms (current_function_parms
);
13001 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
13003 cp_error ("return-type `%#T' is an incomplete type",
13004 TREE_TYPE (fntype
));
13006 /* Make it return void instead, but don't change the
13007 type of the DECL_RESULT, in case we have a named return value. */
13010 = build_cplus_method_type (build_type_variant (ctype
,
13011 TREE_READONLY (decl1
),
13012 TREE_SIDE_EFFECTS (decl1
)),
13014 FUNCTION_ARG_CHAIN (decl1
));
13017 = build_function_type (void_type_node
,
13018 TYPE_ARG_TYPES (TREE_TYPE (decl1
)));
13019 DECL_RESULT (decl1
)
13020 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)));
13021 TREE_READONLY (DECL_RESULT (decl1
))
13022 = CP_TYPE_CONST_P (TREE_TYPE (fntype
));
13023 TREE_THIS_VOLATILE (DECL_RESULT (decl1
))
13024 = CP_TYPE_VOLATILE_P (TREE_TYPE (fntype
));
13027 abstract_virtuals_error (decl1
, TREE_TYPE (fntype
));
13030 /* Record the decl so that the function name is defined.
13031 If we already have a decl for this name, and it is a FUNCTION_DECL,
13032 use the old decl. */
13033 if (!processing_template_decl
&& pre_parsed_p
== 0)
13035 /* A specialization is not used to guide overload resolution. */
13036 if ((flag_guiding_decls
13037 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
13038 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13039 decl1
= pushdecl (decl1
);
13042 /* We need to set the DECL_CONTEXT. */
13043 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13044 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13045 /* And make sure we have enough default args. */
13046 check_default_args (decl1
);
13048 DECL_MAIN_VARIANT (decl1
) = decl1
;
13049 fntype
= TREE_TYPE (decl1
);
13052 current_function_decl
= decl1
;
13054 if (DECL_INTERFACE_KNOWN (decl1
))
13056 tree ctx
= hack_decl_function_context (decl1
);
13058 if (DECL_NOT_REALLY_EXTERN (decl1
))
13059 DECL_EXTERNAL (decl1
) = 0;
13061 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13062 && TREE_PUBLIC (ctx
))
13063 /* This is a function in a local class in an extern inline
13065 comdat_linkage (decl1
);
13067 /* If this function belongs to an interface, it is public.
13068 If it belongs to someone else's interface, it is also external.
13069 This only affects inlines and template instantiations. */
13070 else if (interface_unknown
== 0
13071 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13072 || flag_alt_external_templates
))
13074 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13075 || processing_template_decl
)
13077 DECL_EXTERNAL (decl1
)
13079 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13080 && !DECL_VINDEX (decl1
)));
13082 /* For WIN32 we also want to put these in linkonce sections. */
13083 maybe_make_one_only (decl1
);
13086 DECL_EXTERNAL (decl1
) = 0;
13087 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13088 DECL_INTERFACE_KNOWN (decl1
) = 1;
13090 else if (interface_unknown
&& interface_only
13091 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13092 || flag_alt_external_templates
))
13094 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13095 interface, we will have interface_only set but not
13096 interface_known. In that case, we don't want to use the normal
13097 heuristics because someone will supply a #pragma implementation
13098 elsewhere, and deducing it here would produce a conflict. */
13099 comdat_linkage (decl1
);
13100 DECL_EXTERNAL (decl1
) = 0;
13101 DECL_INTERFACE_KNOWN (decl1
) = 1;
13102 DECL_DEFER_OUTPUT (decl1
) = 1;
13106 /* This is a definition, not a reference.
13107 So clear DECL_EXTERNAL. */
13108 DECL_EXTERNAL (decl1
) = 0;
13110 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13111 && ! DECL_INTERFACE_KNOWN (decl1
)
13112 /* Don't try to defer nested functions for now. */
13113 && ! hack_decl_function_context (decl1
))
13114 DECL_DEFER_OUTPUT (decl1
) = 1;
13116 DECL_INTERFACE_KNOWN (decl1
) = 1;
13119 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
13121 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13122 TREE_TYPE (decl1
) = fntype
13123 = build_function_type (TREE_TYPE (fntype
),
13124 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
13125 current_function_parms
= TREE_CHAIN (current_function_parms
);
13126 DECL_ARGUMENTS (decl1
) = current_function_parms
;
13129 restype
= TREE_TYPE (fntype
);
13133 /* If we're compiling a friend function, neither of the variables
13134 current_class_ptr nor current_class_type will have values. */
13135 if (! doing_friend
)
13137 /* We know that this was set up by `grokclassfn'.
13138 We do not wait until `store_parm_decls', since evil
13139 parse errors may never get us to that point. Here
13140 we keep the consistency between `current_class_type'
13141 and `current_class_ptr'. */
13142 tree t
= current_function_parms
;
13145 my_friendly_assert (t
!= NULL_TREE
13146 && TREE_CODE (t
) == PARM_DECL
, 162);
13147 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13150 if (! hack_decl_function_context (decl1
))
13151 temporary_allocation ();
13152 i
= suspend_momentary ();
13154 /* Normally, build_indirect_ref returns current_class_ref
13155 whenever current_class_ptr is dereferenced. This time,
13156 however, we want it to *create* current_class_ref, so we
13157 temporarily clear current_class_ptr to fool it. */
13158 current_class_ptr
= NULL_TREE
;
13159 current_class_ref
= build_indirect_ref (t
, NULL_PTR
);
13160 current_class_ptr
= t
;
13162 resume_momentary (i
);
13163 if (! hack_decl_function_context (decl1
))
13164 end_temporary_allocation ();
13168 current_class_ptr
= current_class_ref
= NULL_TREE
;
13171 current_binding_level
->parm_flag
= 1;
13174 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13176 if (!building_stmt_tree ())
13178 GNU_xref_function (decl1
, current_function_parms
);
13179 make_function_rtl (decl1
);
13182 /* Promote the value to int before returning it. */
13183 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13184 restype
= type_promotes_to (restype
);
13186 /* If this fcn was already referenced via a block-scope `extern' decl
13187 (or an implicit decl), propagate certain information about the usage. */
13188 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13189 TREE_ADDRESSABLE (decl1
) = 1;
13191 if (DECL_RESULT (decl1
) == NULL_TREE
)
13193 DECL_RESULT (decl1
)
13194 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13195 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13196 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13199 /* Allocate further tree nodes temporarily during compilation
13200 of this function only. Tiemann moved up here from bottom of fn. */
13201 /* If this is a nested function, then we must continue to allocate RTL
13202 on the permanent obstack in case we need to inline it later. */
13203 if (! hack_decl_function_context (decl1
))
13204 temporary_allocation ();
13206 /* Make sure that we always have a momntary obstack while we're in a
13210 if (building_stmt_tree ())
13211 begin_stmt_tree (decl1
);
13215 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13216 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13218 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13219 ctor_label
= NULL_TREE
;
13223 dtor_label
= NULL_TREE
;
13224 if (DECL_CONSTRUCTOR_P (decl1
))
13225 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13231 /* Called after store_parm_decls for a function-try-block. We need to update
13232 last_parm_cleanup_insn so that the base initializers for a constructor
13233 are run within this block, not before it. */
13236 expand_start_early_try_stmts ()
13238 expand_start_try_stmts ();
13239 last_parm_cleanup_insn
= get_last_insn ();
13242 /* Store the parameter declarations into the current function declaration.
13243 This is called after parsing the parameter declarations, before
13244 digesting the body of the function.
13246 Also install to binding contour return value identifier, if any. */
13249 store_parm_decls ()
13251 register tree fndecl
= current_function_decl
;
13252 register tree parm
;
13253 int parms_have_cleanups
= 0;
13254 tree cleanups
= NULL_TREE
;
13256 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13257 tree specparms
= current_function_parms
;
13259 /* This is a list of types declared among parms in a prototype. */
13260 tree parmtags
= current_function_parm_tags
;
13262 /* This is a chain of any other decls that came in among the parm
13263 declarations. If a parm is declared with enum {foo, bar} x;
13264 then CONST_DECLs for foo and bar are put here. */
13265 tree nonparms
= NULL_TREE
;
13267 if (toplevel_bindings_p ())
13268 fatal ("parse errors have confused me too much");
13270 /* Initialize RTL machinery. */
13271 init_function_start (fndecl
, input_filename
, lineno
);
13272 /* Even though we're inside a function body, we still don't want to
13273 call expand_expr to calculate the size of a variable-sized array.
13274 We haven't necessarily assigned RTL to all variables yet, so it's
13275 not safe to try to expand expressions involving them. */
13276 immediate_size_expand
= 0;
13277 get_pending_sizes ();
13279 /* Create a binding level for the parms. */
13280 expand_start_bindings (0);
13282 if (specparms
!= NULL_TREE
)
13284 /* This case is when the function was defined with an ANSI prototype.
13285 The parms already have decls, so we need not do anything here
13286 except record them as in effect
13287 and complain if any redundant old-style parm decls were written. */
13289 register tree next
;
13291 /* Must clear this because it might contain TYPE_DECLs declared
13293 storedecls (NULL_TREE
);
13295 for (parm
= nreverse (specparms
); parm
; parm
= next
)
13297 next
= TREE_CHAIN (parm
);
13298 if (TREE_CODE (parm
) == PARM_DECL
)
13301 if (DECL_NAME (parm
) == NULL_TREE
)
13305 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
13306 cp_error ("parameter `%D' declared void", parm
);
13309 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
13310 A parameter is assumed not to have any side effects.
13311 If this should change for any reason, then this
13312 will have to wrap the bashed reference type in a save_expr.
13314 Also, if the parameter type is declared to be an X
13315 and there is an X(X&) constructor, we cannot lay it
13316 into the stack (any more), so we make this parameter
13317 look like it is really of reference type. Functions
13318 which pass parameters to this function will know to
13319 create a temporary in their frame, and pass a reference
13322 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
13323 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
13324 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
13328 if (! building_stmt_tree ()
13329 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13331 expand_decl (parm
);
13332 parms_have_cleanups
= 1;
13334 /* Keep track of the cleanups. */
13335 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13340 /* If we find an enum constant or a type tag,
13341 put it aside for the moment. */
13342 TREE_CHAIN (parm
) = NULL_TREE
;
13343 nonparms
= chainon (nonparms
, parm
);
13347 /* Get the decls in their original chain order
13348 and record in the function. This is all and only the
13349 PARM_DECLs that were pushed into scope by the loop above. */
13350 DECL_ARGUMENTS (fndecl
) = getdecls ();
13352 storetags (chainon (parmtags
, gettags ()));
13355 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13357 /* Now store the final chain of decls for the arguments
13358 as the decl-chain of the current lexical scope.
13359 Put the enumerators in as well, at the front so that
13360 DECL_ARGUMENTS is not modified. */
13362 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13364 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
13365 declare_function_name ();
13367 /* Initialize the RTL code for the function. */
13368 DECL_SAVED_INSNS (fndecl
) = 0;
13369 if (! building_stmt_tree ())
13370 expand_function_start (fndecl
, parms_have_cleanups
);
13372 current_function_parms_stored
= 1;
13374 /* If this function is `main', emit a call to `__main'
13375 to run global initializers, etc. */
13376 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13377 expand_main_function ();
13379 /* Now that we have initialized the parms, we can start their
13380 cleanups. We cannot do this before, since expand_decl_cleanup
13381 should not be called before the parm can be used. */
13382 if (cleanups
&& !building_stmt_tree ())
13384 for (cleanups
= nreverse (cleanups
); cleanups
; cleanups
= TREE_CHAIN (cleanups
))
13386 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
), TREE_VALUE (cleanups
)))
13387 cp_error ("parser lost in parsing declaration of `%D'",
13388 TREE_PURPOSE (cleanups
));
13392 /* Create a binding contour which can be used to catch
13393 cleanup-generated temporaries. Also, if the return value needs or
13394 has initialization, deal with that now. */
13395 if (parms_have_cleanups
)
13398 if (!building_stmt_tree ())
13399 expand_start_bindings (0);
13402 if (! building_stmt_tree () && flag_exceptions
)
13404 /* Do the starting of the exception specifications, if we have any. */
13405 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13406 expand_start_eh_spec ();
13409 last_parm_cleanup_insn
= get_last_insn ();
13410 last_dtor_insn
= get_last_insn ();
13413 /* Bind a name and initialization to the return value of
13414 the current function. */
13417 store_return_init (decl
)
13420 /* If this named return value comes in a register, put it in a
13421 pseudo-register. */
13422 if (DECL_REGISTER (decl
))
13424 original_result_rtx
= DECL_RTL (decl
);
13425 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13430 /* Finish up a function declaration and compile that function
13431 all the way to assembler language output. The free the storage
13432 for the function definition.
13434 This is called after parsing the body of the function definition.
13435 LINENO is the current line number.
13437 FLAGS is a bitwise or of the following values:
13439 An extra call to poplevel (and expand_end_bindings) must be
13440 made to take care of the binding contour for the base
13441 initializers. This is only relevant for constructors.
13443 We just finished processing the body of an in-class inline
13444 function definition. (This processing will have taken place
13445 after the class definition is complete.) */
13448 finish_function (lineno
, flags
)
13452 register tree fndecl
= current_function_decl
;
13453 tree fntype
, ctype
= NULL_TREE
;
13454 rtx fn_last_parm_insn
, insns
;
13455 /* Label to use if this function is supposed to return a value. */
13456 tree no_return_label
= NULL_TREE
;
13457 tree decls
= 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
)
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
) && call_poplevel
)
13486 decls
= getdecls ();
13487 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13488 poplevel (decls
!= NULL_TREE
, 0, 0);
13491 /* Because we do not call expand_function_end, we won't call
13492 expand_end_bindings to match the call to
13493 expand_start_bindings we did in store_parm_decls. Therefore,
13494 we explicitly call expand_end_bindings here. However, we
13495 really shouldn't be calling expand_start_bindings at all when
13496 building_stmt_tree; it's conceptually an RTL-generation
13497 function, rather than a front-end function. */
13498 expand_end_bindings (0, 0, 0);
13502 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13504 tree ttype
= target_type (fntype
);
13507 if (IS_AGGR_TYPE (ttype
))
13508 /* Let debugger know it should output info for this type. */
13509 note_debug_info_needed (ttype
);
13511 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13513 ttype
= target_type (TREE_TYPE (parmdecl
));
13514 if (IS_AGGR_TYPE (ttype
))
13515 /* Let debugger know it should output info for this type. */
13516 note_debug_info_needed (ttype
);
13520 /* Clean house because we will need to reorder insns here. */
13521 do_pending_stack_adjust ();
13525 tree binfo
= TYPE_BINFO (current_class_type
);
13526 tree cond
= integer_one_node
;
13528 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13530 int ok_to_optimize_dtor
= 0;
13531 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13533 if (current_function_assigns_this
)
13534 cond
= build (NE_EXPR
, boolean_type_node
,
13535 current_class_ptr
, integer_zero_node
);
13538 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13540 /* If this destructor is empty, then we don't need to check
13541 whether `this' is NULL in some cases. */
13542 if ((flag_this_is_variable
& 1) == 0)
13543 ok_to_optimize_dtor
= 1;
13544 else if (empty_dtor
)
13545 ok_to_optimize_dtor
13546 = (n_baseclasses
== 0
13547 || (n_baseclasses
== 1
13548 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13551 /* These initializations might go inline. Protect
13552 the binding level of the parms. */
13554 expand_start_bindings (0);
13556 if (current_function_assigns_this
)
13558 current_function_assigns_this
= 0;
13559 current_function_just_assigned_this
= 0;
13562 /* Generate the code to call destructor on base class.
13563 If this destructor belongs to a class with virtual
13564 functions, then set the virtual function table
13565 pointer to represent the type of our base class. */
13567 /* This side-effect makes call to `build_delete' generate the
13568 code we have to have at the end of this destructor.
13569 `build_delete' will set the flag again. */
13570 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13572 /* These are two cases where we cannot delegate deletion. */
13573 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13574 || TYPE_GETS_REG_DELETE (current_class_type
))
13575 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
13576 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13578 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
13579 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13581 /* If we did not assign to this, then `this' is non-zero at
13582 the end of a destructor. As a special optimization, don't
13583 emit test if this is an empty destructor. If it does nothing,
13584 it does nothing. If it calls a base destructor, the base
13585 destructor will perform the test. */
13587 if (exprstmt
!= error_mark_node
13588 && (TREE_CODE (exprstmt
) != NOP_EXPR
13589 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13590 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13592 expand_label (dtor_label
);
13593 if (cond
!= integer_one_node
)
13594 expand_start_cond (cond
, 0);
13595 if (exprstmt
!= void_zero_node
)
13596 /* Don't call `expand_expr_stmt' if we're not going to do
13597 anything, since -Wall will give a diagnostic. */
13598 expand_expr_stmt (exprstmt
);
13600 /* Run destructor on all virtual baseclasses. */
13601 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13603 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13604 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13605 in_charge_node
, integer_two_node
), 0);
13608 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13610 tree vb
= get_vbase
13611 (BINFO_TYPE (vbases
),
13612 TYPE_BINFO (current_class_type
));
13614 (build_scoped_method_call
13615 (current_class_ref
, vb
, dtor_identifier
,
13616 build_expr_list (NULL_TREE
, integer_zero_node
)));
13618 vbases
= TREE_CHAIN (vbases
);
13620 expand_end_cond ();
13623 do_pending_stack_adjust ();
13624 if (cond
!= integer_one_node
)
13625 expand_end_cond ();
13628 virtual_size
= c_sizeof (current_class_type
);
13630 /* At the end, call delete if that's what's requested. */
13632 /* FDIS sez: At the point of definition of a virtual destructor
13633 (including an implicit definition), non-placement operator
13634 delete shall be looked up in the scope of the destructor's
13635 class and if found shall be accessible and unambiguous.
13637 This is somewhat unclear, but I take it to mean that if the
13638 class only defines placement deletes we don't do anything here.
13639 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13640 for us if they ever try to delete one of these. */
13642 if (TYPE_GETS_REG_DELETE (current_class_type
)
13643 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13644 exprstmt
= build_op_delete_call
13645 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13646 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13648 exprstmt
= NULL_TREE
;
13652 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13653 in_charge_node
, integer_one_node
);
13654 expand_start_cond (cond
, 0);
13655 expand_expr_stmt (exprstmt
);
13656 expand_end_cond ();
13659 /* End of destructor. */
13660 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13661 poplevel (getdecls () != NULL_TREE
, 0, 0);
13663 /* Back to the top of destructor. */
13664 /* Don't execute destructor code if `this' is NULL. */
13668 /* If the dtor is empty, and we know there is not possible way we
13669 could use any vtable entries, before they are possibly set by
13670 a base class dtor, we don't have to setup the vtables, as we
13671 know that any base class dtoring will set up any vtables it
13672 needs. We avoid MI, because one base class dtor can do a
13673 virtual dispatch to an overridden function that would need to
13674 have a non-related vtable set up, we cannot avoid setting up
13675 vtables in that case. We could change this to see if there is
13676 just one vtable. */
13677 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13679 /* Make all virtual function table pointers in non-virtual base
13680 classes point to CURRENT_CLASS_TYPE's virtual function
13682 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13684 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13685 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13688 if (! ok_to_optimize_dtor
)
13690 cond
= build_binary_op (NE_EXPR
,
13691 current_class_ptr
, integer_zero_node
);
13692 expand_start_cond (cond
, 0);
13695 insns
= get_insns ();
13698 fn_last_parm_insn
= get_first_nonparm_insn ();
13699 if (fn_last_parm_insn
== NULL_RTX
)
13700 fn_last_parm_insn
= get_last_insn ();
13702 fn_last_parm_insn
= previous_insn (fn_last_parm_insn
);
13704 emit_insns_after (insns
, fn_last_parm_insn
);
13706 if (! ok_to_optimize_dtor
)
13707 expand_end_cond ();
13709 else if (current_function_assigns_this
)
13711 /* Does not need to call emit_base_init, because
13712 that is done (if needed) just after assignment to this
13715 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13717 end_protect_partials ();
13718 expand_label (ctor_label
);
13719 ctor_label
= NULL_TREE
;
13723 decls
= getdecls ();
13724 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13725 poplevel (decls
!= NULL_TREE
, 0, 0);
13727 /* c_expand_return knows to return 'this' from a constructor. */
13728 c_expand_return (NULL_TREE
);
13730 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13731 && return_label
!= NULL_RTX
)
13732 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13734 current_function_assigns_this
= 0;
13735 current_function_just_assigned_this
= 0;
13736 base_init_expr
= NULL_TREE
;
13738 else if (DECL_CONSTRUCTOR_P (fndecl
))
13740 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13741 /* Allow constructor for a type to get a new instance of the object
13742 using `build_new'. */
13743 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13744 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13746 if (flag_this_is_variable
> 0)
13748 cond
= build_binary_op (EQ_EXPR
,
13749 current_class_ptr
, integer_zero_node
);
13750 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13751 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13754 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13758 if (flag_this_is_variable
> 0)
13760 expand_start_cond (cond
, 0);
13761 expand_expr_stmt (thenclause
);
13762 expand_end_cond ();
13765 /* Emit insns from `emit_base_init' which sets up virtual
13766 function table pointer(s). */
13767 if (base_init_expr
)
13769 expand_expr_stmt (base_init_expr
);
13770 base_init_expr
= NULL_TREE
;
13773 insns
= get_insns ();
13776 /* This is where the body of the constructor begins. */
13778 emit_insns_after (insns
, last_parm_cleanup_insn
);
13780 end_protect_partials ();
13782 /* This is where the body of the constructor ends. */
13783 expand_label (ctor_label
);
13784 ctor_label
= NULL_TREE
;
13788 decls
= getdecls ();
13789 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13790 poplevel (decls
!= NULL_TREE
, 1, 0);
13793 /* c_expand_return knows to return 'this' from a constructor. */
13794 c_expand_return (NULL_TREE
);
13796 current_function_assigns_this
= 0;
13797 current_function_just_assigned_this
= 0;
13799 else if (DECL_MAIN_P (fndecl
))
13801 /* Make it so that `main' always returns 0 by default. */
13803 c_expand_return (integer_one_node
);
13805 c_expand_return (integer_zero_node
);
13808 else if (return_label
!= NULL_RTX
13809 && current_function_return_value
== NULL_TREE
13810 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13811 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13813 if (flag_exceptions
)
13814 expand_exception_blocks ();
13816 /* If this function is supposed to return a value, ensure that
13817 we do not fall into the cleanups by mistake. The end of our
13818 function will look like this:
13820 user code (may have return stmt somewhere)
13821 goto no_return_label
13826 NOTE_INSN_FUNCTION_END
13830 If the user omits a return stmt in the USER CODE section, we
13831 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13832 Otherwise, we won't. */
13833 if (no_return_label
)
13835 DECL_CONTEXT (no_return_label
) = fndecl
;
13836 DECL_INITIAL (no_return_label
) = error_mark_node
;
13837 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13838 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13839 expand_goto (no_return_label
);
13844 /* Remove the binding contour which is used
13845 to catch cleanup-generated temporaries. */
13846 expand_end_bindings (0, 0, 0);
13847 poplevel (0, 0, 0);
13849 /* Emit label at beginning of cleanup code for parameters. */
13850 emit_label (cleanup_label
);
13853 /* Get return value into register if that's where it's supposed to be. */
13854 if (original_result_rtx
)
13855 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13857 /* Finish building code that will trigger warnings if users forget
13858 to make their functions return values. */
13859 if (no_return_label
|| cleanup_label
)
13860 emit_jump (return_label
);
13861 if (no_return_label
)
13863 /* We don't need to call `expand_*_return' here because we
13864 don't need any cleanups here--this path of code is only
13865 for error checking purposes. */
13866 expand_label (no_return_label
);
13869 /* We hard-wired immediate_size_expand to zero in
13870 start_function. Expand_function_end will decrement this
13871 variable. So, we set the variable to one here, so that after
13872 the decrement it will remain zero. */
13873 immediate_size_expand
= 1;
13875 /* Generate rtl for function exit. */
13876 expand_function_end (input_filename
, lineno
, 1);
13879 /* We have to save this value here in case
13880 maybe_end_member_template_processing decides to pop all the
13881 template parameters. */
13882 expand_p
= !building_stmt_tree ();
13884 /* If we're saving up tree structure, tie off the function now. */
13886 finish_stmt_tree (fndecl
);
13888 /* This must come after expand_function_end because cleanups might
13889 have declarations (from inline functions) that need to go into
13890 this function's blocks. */
13891 if (current_binding_level
->parm_flag
!= 1)
13892 my_friendly_abort (122);
13893 poplevel (1, 0, 1);
13895 /* If this is a in-class inline definition, we may have to pop the
13896 bindings for the template parameters that we added in
13897 maybe_begin_member_template_processing when start_function was
13899 if (inclass_inline
)
13900 maybe_end_member_template_processing ();
13902 /* Reset scope for C++: if we were in the scope of a class,
13903 then when we finish this function, we are not longer so.
13904 This cannot be done until we know for sure that no more
13905 class members will ever be referenced in this function
13906 (i.e., calls to destructors). */
13907 if (current_class_name
)
13909 ctype
= current_class_type
;
13910 pop_nested_class ();
13913 /* Must mark the RESULT_DECL as being in this function. */
13914 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13916 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13917 to the FUNCTION_DECL node itself. */
13918 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13920 /* Undo the call to push_momentary in start_function. */
13925 int saved_flag_keep_inline_functions
=
13926 flag_keep_inline_functions
;
13928 /* So we can tell if jump_optimize sets it to 1. */
13931 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13932 && hack_decl_function_context (fndecl
))
13933 /* Trick rest_of_compilation into not deferring output of this
13934 function, even if it is inline, since the rtl_obstack for
13935 this function is the function_obstack of the enclosing
13936 function and will be deallocated when the enclosing
13937 function is gone. See save_tree_status. */
13938 flag_keep_inline_functions
= 1;
13940 /* If this is a nested function (like a template instantiation
13941 that we're compiling in the midst of compiling something
13942 else), push a new GC context. That will keep local variables
13943 on the stack from being collected while we're doing the
13944 compilation of this function. */
13945 if (function_depth
> 1)
13946 ggc_push_context ();
13948 /* Run the optimizers and output the assembler code for this
13950 if (DECL_ARTIFICIAL (fndecl
))
13952 /* Do we really *want* to inline this synthesized method? */
13954 int save_fif
= flag_inline_functions
;
13955 flag_inline_functions
= 1;
13957 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13958 will check our size. */
13959 DECL_INLINE (fndecl
) = 0;
13961 rest_of_compilation (fndecl
);
13962 flag_inline_functions
= save_fif
;
13965 rest_of_compilation (fndecl
);
13967 /* Undo the call to ggc_push_context above. */
13968 if (function_depth
> 1)
13969 ggc_pop_context ();
13971 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13973 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13975 /* Set DECL_EXTERNAL so that assemble_external will be called as
13976 necessary. We'll clear it again in finish_file. */
13977 if (! DECL_EXTERNAL (fndecl
))
13978 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13979 DECL_EXTERNAL (fndecl
) = 1;
13980 mark_inline_for_output (fndecl
);
13983 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13984 note_debug_info_needed (ctype
);
13986 current_function_returns_null
|= can_reach_end
;
13988 /* Since we don't normally go through c_expand_return for constructors,
13989 this normally gets the wrong value.
13990 Also, named return values have their return codes emitted after
13991 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13992 if (DECL_CONSTRUCTOR_P (fndecl
)
13993 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13994 current_function_returns_null
= 0;
13996 if (TREE_THIS_VOLATILE (fndecl
) && current_function_returns_null
)
13997 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13998 else if ((warn_return_type
|| pedantic
)
13999 && current_function_returns_null
14000 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
14002 /* If this function returns non-void and control can drop through,
14004 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
14006 /* With just -W, complain only if function returns both with
14007 and without a value. */
14008 else if (extra_warnings
14009 && current_function_returns_value
&& current_function_returns_null
)
14010 warning ("this function may return with or without a value");
14015 /* Free all the tree nodes making up this function. */
14016 /* Switch back to allocating nodes permanently
14017 until we start another function. */
14019 permanent_allocation (1);
14021 if (DECL_SAVED_INSNS (fndecl
) == 0)
14025 /* Stop pointing to the local nodes about to be freed. */
14026 /* But DECL_INITIAL must remain nonzero so we know this
14027 was an actual function definition. */
14028 DECL_INITIAL (fndecl
) = error_mark_node
;
14029 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
14030 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
14033 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
14034 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
14035 if (DECL_STATIC_DESTRUCTOR (fndecl
))
14036 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
14040 /* Let the error reporting routines know that we're outside a
14041 function. For a nested function, this value is used in
14042 pop_cp_function_context and then reset via pop_function_context. */
14043 current_function_decl
= NULL_TREE
;
14046 named_label_uses
= NULL
;
14047 current_class_ptr
= NULL_TREE
;
14048 current_class_ref
= NULL_TREE
;
14051 /* Create the FUNCTION_DECL for a function definition.
14052 DECLSPECS and DECLARATOR are the parts of the declaration;
14053 they describe the return type and the name of the function,
14054 but twisted together in a fashion that parallels the syntax of C.
14056 This function creates a binding context for the function body
14057 as well as setting up the FUNCTION_DECL in current_function_decl.
14059 Returns a FUNCTION_DECL on success.
14061 If the DECLARATOR is not suitable for a function (it defines a datum
14062 instead), we return 0, which tells yyparse to report a parse error.
14064 May return void_type_node indicating that this method is actually
14065 a friend. See grokfield for more details.
14067 Came here with a `.pushlevel' .
14069 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14070 CHANGES TO CODE IN `grokfield'. */
14073 start_method (declspecs
, declarator
, attrlist
)
14074 tree declarator
, declspecs
, attrlist
;
14076 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14079 /* Something too ugly to handle. */
14080 if (fndecl
== NULL_TREE
)
14083 /* Pass friends other than inline friend functions back. */
14084 if (fndecl
== void_type_node
)
14087 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14088 /* Not a function, tell parser to report parse error. */
14091 if (DECL_IN_AGGR_P (fndecl
))
14093 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14095 if (DECL_CONTEXT (fndecl
)
14096 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14097 cp_error ("`%D' is already defined in class %s", fndecl
,
14098 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
14100 return void_type_node
;
14103 check_template_shadow (fndecl
);
14105 DECL_THIS_INLINE (fndecl
) = 1;
14107 if (flag_default_inline
)
14108 DECL_INLINE (fndecl
) = 1;
14110 /* We process method specializations in finish_struct_1. */
14111 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14112 fndecl
= push_template_decl (fndecl
);
14114 /* We read in the parameters on the maybepermanent_obstack,
14115 but we won't be getting back to them until after we
14116 may have clobbered them. So the call to preserve_data
14117 will keep them safe. */
14120 if (! DECL_FRIEND_P (fndecl
))
14122 if (TREE_CHAIN (fndecl
))
14124 fndecl
= copy_node (fndecl
);
14125 TREE_CHAIN (fndecl
) = NULL_TREE
;
14128 if (DECL_CONSTRUCTOR_P (fndecl
))
14130 if (! grok_ctor_properties (current_class_type
, fndecl
))
14131 return void_type_node
;
14133 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14134 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14137 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
14139 /* Make a place for the parms */
14141 current_binding_level
->parm_flag
= 1;
14143 DECL_IN_AGGR_P (fndecl
) = 1;
14147 /* Go through the motions of finishing a function definition.
14148 We don't compile this method until after the whole class has
14151 FINISH_METHOD must return something that looks as though it
14152 came from GROKFIELD (since we are defining a method, after all).
14154 This is called after parsing the body of the function definition.
14155 STMTS is the chain of statements that makes up the function body.
14157 DECL is the ..._DECL that `start_method' provided. */
14160 finish_method (decl
)
14163 register tree fndecl
= decl
;
14166 register tree link
;
14168 if (decl
== void_type_node
)
14171 old_initial
= DECL_INITIAL (fndecl
);
14173 /* Undo the level for the parms (from start_method).
14174 This is like poplevel, but it causes nothing to be
14175 saved. Saving information here confuses symbol-table
14176 output routines. Besides, this information will
14177 be correctly output when this method is actually
14180 /* Clear out the meanings of the local variables of this level;
14181 also record in each decl which block it belongs to. */
14183 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14185 if (DECL_NAME (link
) != NULL_TREE
)
14186 pop_binding (DECL_NAME (link
), link
);
14187 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14188 DECL_CONTEXT (link
) = NULL_TREE
;
14191 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14192 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14193 current_binding_level
->parm_flag
,
14194 current_binding_level
->keep
);
14196 poplevel (0, 0, 0);
14198 DECL_INITIAL (fndecl
) = old_initial
;
14200 /* We used to check if the context of FNDECL was different from
14201 current_class_type as another way to get inside here. This didn't work
14202 for String.cc in libg++. */
14203 if (DECL_FRIEND_P (fndecl
))
14205 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14206 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14207 decl
= void_type_node
;
14213 /* Called when a new struct TYPE is defined.
14214 If this structure or union completes the type of any previous
14215 variable declaration, lay it out and output its rtl. */
14218 hack_incomplete_structures (type
)
14223 if (current_binding_level
->incomplete
== NULL_TREE
)
14226 if (!type
) /* Don't do this for class templates. */
14229 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14231 tree decl
= TREE_VALUE (*list
);
14232 if ((decl
&& TREE_TYPE (decl
) == type
)
14233 || (TREE_TYPE (decl
)
14234 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14235 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14237 int toplevel
= toplevel_bindings_p ();
14238 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14239 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14240 layout_type (TREE_TYPE (decl
));
14241 layout_decl (decl
, 0);
14242 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14246 expand_decl (decl
);
14247 cleanup
= maybe_build_cleanup (decl
);
14248 expand_decl_init (decl
);
14249 if (! expand_decl_cleanup (decl
, cleanup
))
14250 cp_error ("parser lost in parsing declaration of `%D'",
14253 *list
= TREE_CHAIN (*list
);
14256 list
= &TREE_CHAIN (*list
);
14260 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14261 See build_delete for information about AUTO_DELETE.
14263 Don't build these on the momentary obstack; they must live
14264 the life of the binding contour. */
14267 maybe_build_cleanup_1 (decl
, auto_delete
)
14268 tree decl
, auto_delete
;
14270 tree type
= TREE_TYPE (decl
);
14271 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14273 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14276 if (TREE_CODE (decl
) != PARM_DECL
)
14277 temp
= suspend_momentary ();
14279 if (TREE_CODE (type
) == ARRAY_TYPE
)
14283 mark_addressable (decl
);
14284 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14287 /* Optimize for space over speed here. */
14288 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14289 || flag_expensive_optimizations
)
14290 flags
|= LOOKUP_NONVIRTUAL
;
14292 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14294 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14295 && ! TYPE_HAS_DESTRUCTOR (type
))
14296 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14297 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14299 if (TREE_CODE (decl
) != PARM_DECL
)
14300 resume_momentary (temp
);
14307 /* If DECL is of a type which needs a cleanup, build that cleanup
14308 here. The cleanup does free the storage with a call to delete. */
14311 maybe_build_cleanup_and_delete (decl
)
14314 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14317 /* If DECL is of a type which needs a cleanup, build that cleanup
14318 here. The cleanup does not free the storage with a call a delete. */
14321 maybe_build_cleanup (decl
)
14324 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14327 /* Expand a C++ expression at the statement level.
14328 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14329 The C++ type checker should get all of these out when
14330 expressions are combined with other, type-providing, expressions,
14331 leaving only orphan expressions, such as:
14333 &class::bar; / / takes its address, but does nothing with it. */
14336 cplus_expand_expr_stmt (exp
)
14339 exp
= require_complete_type_in_void (exp
);
14341 if (TREE_CODE (exp
) == FUNCTION_DECL
)
14343 cp_warning ("reference, not call, to function `%D'", exp
);
14344 warning ("at this point in file");
14348 /* We should do this eventually, but right now this causes regex.o from
14349 libg++ to miscompile, and tString to core dump. */
14350 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14353 /* Strip unused implicit INDIRECT_REFs of references. */
14354 if (TREE_CODE (exp
) == INDIRECT_REF
14355 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
14356 exp
= TREE_OPERAND (exp
, 0);
14358 /* If we don't do this, we end up down inside expand_expr
14359 trying to do TYPE_MODE on the ERROR_MARK, and really
14360 go outside the bounds of the type. */
14361 if (exp
!= error_mark_node
)
14362 expand_expr_stmt (break_out_cleanups (exp
));
14365 /* When a stmt has been parsed, this function is called. */
14370 if (!current_function_assigns_this
14371 && current_function_just_assigned_this
)
14373 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14375 /* Constructors must wait until we are out of control
14376 zones before calling base constructors. */
14377 if (in_control_zone_p ())
14379 expand_expr_stmt (base_init_expr
);
14380 check_base_init (current_class_type
);
14382 current_function_assigns_this
= 1;
14385 /* Always assume this statement was not an expression statement. If
14386 it actually was an expression statement, its our callers
14387 responsibility to fix this up. */
14388 last_expr_type
= NULL_TREE
;
14391 /* Change a static member function definition into a FUNCTION_TYPE, instead
14392 of the METHOD_TYPE that we create when it's originally parsed.
14394 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14395 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14396 other decls. Either pass the addresses of local variables or NULL. */
14399 revert_static_member_fn (decl
, fn
, argtypes
)
14400 tree
*decl
, *fn
, *argtypes
;
14403 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14404 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14406 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14407 != TYPE_UNQUALIFIED
)
14408 cp_error ("static member function `%#D' declared with type qualifiers",
14411 args
= TREE_CHAIN (args
);
14412 tmp
= build_function_type (TREE_TYPE (function
), args
);
14413 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14414 tmp
= build_exception_variant (tmp
,
14415 TYPE_RAISES_EXCEPTIONS (function
));
14416 TREE_TYPE (*decl
) = tmp
;
14417 if (DECL_ARGUMENTS (*decl
))
14418 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14419 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14426 /* Save and reinitialize the variables
14427 used during compilation of a C++ function. */
14430 push_cp_function_context (f
)
14431 struct function
*f
;
14433 struct language_function
*p
14434 = ((struct language_function
*)
14435 xcalloc (1, sizeof (struct language_function
)));
14438 p
->binding_level
= f
->next
->language
->binding_level
;
14440 /* For now, we always assume we're expanding all the way to RTL
14441 unless we're explicitly doing otherwise. */
14444 /* Whenever we start a new function, we destroy temporaries in the
14446 stmts_are_full_exprs_p
= 1;
14449 /* Restore the variables used during compilation of a C++ function. */
14452 pop_cp_function_context (f
)
14453 struct function
*f
;
14455 free (f
->language
);
14460 mark_cp_function_context (f
)
14461 struct function
*f
;
14463 struct language_function
*p
= f
->language
;
14468 ggc_mark_tree (p
->x_named_labels
);
14469 ggc_mark_tree (p
->x_ctor_label
);
14470 ggc_mark_tree (p
->x_dtor_label
);
14471 ggc_mark_tree (p
->x_base_init_list
);
14472 ggc_mark_tree (p
->x_member_init_list
);
14473 ggc_mark_tree (p
->x_base_init_expr
);
14474 ggc_mark_tree (p
->x_current_class_ptr
);
14475 ggc_mark_tree (p
->x_current_class_ref
);
14476 ggc_mark_tree (p
->x_last_tree
);
14477 ggc_mark_tree (p
->x_last_expr_type
);
14479 ggc_mark_rtx (p
->x_last_dtor_insn
);
14480 ggc_mark_rtx (p
->x_last_parm_cleanup_insn
);
14481 ggc_mark_rtx (p
->x_result_rtx
);
14483 mark_binding_level (&p
->binding_level
);
14490 return function_depth
!= 0;
14495 lang_mark_false_label_stack (l
)
14496 struct label_node
*l
;
14498 /* C++ doesn't use false_label_stack. It better be NULL. */
14499 my_friendly_assert (l
== NULL
, 19990904);
14506 enum tree_code code
= TREE_CODE (t
);
14507 if (code
== IDENTIFIER_NODE
)
14509 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14510 struct lang_id2
*li2
= li
->x
;
14511 ggc_mark_tree (li
->namespace_bindings
);
14512 ggc_mark_tree (li
->class_value
);
14513 ggc_mark_tree (li
->class_template_info
);
14517 ggc_mark_tree (li2
->label_value
);
14518 ggc_mark_tree (li2
->implicit_decl
);
14519 ggc_mark_tree (li2
->error_locus
);
14522 else if (code
== CPLUS_BINDING
)
14524 if (BINDING_HAS_LEVEL_P (t
))
14525 mark_binding_level (&BINDING_LEVEL (t
));
14527 ggc_mark_tree (BINDING_SCOPE (t
));
14528 ggc_mark_tree (BINDING_VALUE (t
));
14530 else if (code
== OVERLOAD
)
14531 ggc_mark_tree (OVL_FUNCTION (t
));
14532 else if (code
== TEMPLATE_PARM_INDEX
)
14533 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14534 else if (TREE_CODE_CLASS (code
) == 'd')
14536 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14541 ggc_mark_tree (ld
->decl_flags
.access
);
14542 ggc_mark_tree (ld
->decl_flags
.context
);
14543 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14544 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14545 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14547 ggc_mark_tree (ld
->main_decl_variant
);
14548 ggc_mark_tree (ld
->befriending_classes
);
14549 ggc_mark_tree (ld
->saved_tree
);
14550 if (TREE_CODE (t
) == TYPE_DECL
)
14551 ggc_mark_tree (ld
->u
.sorted_fields
);
14555 else if (TREE_CODE_CLASS (code
) == 't')
14557 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14559 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14560 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14562 ggc_mark_tree (lt
->vfields
);
14563 ggc_mark_tree (lt
->vbases
);
14564 ggc_mark_tree (lt
->tags
);
14565 ggc_mark_tree (lt
->search_slot
);
14566 ggc_mark_tree (lt
->size
);
14567 ggc_mark_tree (lt
->abstract_virtuals
);
14568 ggc_mark_tree (lt
->friend_classes
);
14569 ggc_mark_tree (lt
->rtti
);
14570 ggc_mark_tree (lt
->methods
);
14571 ggc_mark_tree (lt
->template_info
);
14572 ggc_mark_tree (lt
->befriending_classes
);
14575 /* In the case of pointer-to-member function types, the
14576 TYPE_LANG_SPECIFIC is really just a tree. */
14577 ggc_mark_tree ((tree
) lt
);
14582 lang_cleanup_tree (t
)
14585 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
14586 && TYPE_LANG_SPECIFIC (t
) != NULL
14587 && !(TREE_CODE (t
) == POINTER_TYPE
14588 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14589 free (TYPE_LANG_SPECIFIC (t
));