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 *));
208 static void check_function_type
PROTO((tree
));
209 static void destroy_local_static
PROTO((tree
));
211 #if defined (DEBUG_CP_BINDING_LEVELS)
212 static void indent
PROTO((void));
215 /* A node which has tree code ERROR_MARK, and whose type is itself.
216 All erroneous expressions are replaced with this node. All functions
217 that accept nodes as arguments should avoid generating error messages
218 if this node is one of the arguments, since it is undesirable to get
219 multiple error messages from one error in the input. */
221 tree error_mark_node
;
223 /* Erroneous argument lists can use this *IFF* they do not modify it. */
224 tree error_mark_list
;
226 /* The following symbols are subsumed in the cp_global_trees array, and
227 listed here individually for documentation purposes.
230 tree wchar_decl_node;
233 tree vtable_entry_type;
234 tree delta_type_node;
237 tree __baselist_desc_type_node;
238 tree __i_desc_type_node, __m_desc_type_node;
239 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
241 tree __t_desc_type_node;
243 tree __tp_desc_type_node;
245 tree __access_mode_type_node;
246 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
247 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
248 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
250 Not needed yet? May be needed one day?
251 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
252 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
253 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
256 tree class_star_type_node;
257 tree class_type_node, record_type_node, union_type_node, enum_type_node;
258 tree unknown_type_node;
260 Array type `vtable_entry_type[]'
263 tree vtbl_ptr_type_node;
269 A FUNCTION_DECL which can call `abort'. Not necessarily the
270 one that the user will declare, but sufficient to be called
271 by routines that want to abort the program.
275 The FUNCTION_DECL for the default `::operator delete'.
277 tree global_delete_fndecl;
280 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
284 tree cp_global_trees
[CPTI_MAX
];
286 /* These can't be part of the above array, since they are declared
287 individually in tree.h, and used by the debug output routines. */
291 tree integer_type_node
;
292 tree unsigned_type_node
;
294 /* These can't be part of the above array, since they are declared
295 individially in tree.h and used by the target routines. */
298 tree va_list_type_node
;
299 tree null_pointer_node
;
301 /* Indicates that there is a type value in some namespace, although
302 that is not necessarily in scope at the moment. */
304 static tree global_type_node
;
309 /* Expect only namespace names now. */
310 static int only_namespace_names
;
312 /* In a destructor, the last insn emitted after the start of the
313 function and the parms. */
315 #define last_dtor_insn cp_function_chain->x_last_dtor_insn
317 /* In a constructor, the last insn emitted after the start of the
318 function and the parms, the exception specification and any
319 function-try-block. The constructor initializers are emitted after
322 #define last_parm_cleanup_insn cp_function_chain->x_last_parm_cleanup_insn
324 /* If original DECL_RESULT of current function was a register,
325 but due to being an addressable named return value, would up
326 on the stack, this variable holds the named return value's
327 original location. */
329 #define original_result_rtx cp_function_chain->x_result_rtx
331 struct named_label_list
333 struct binding_level
*binding_level
;
336 const char *filename_o_goto
;
338 struct named_label_list
*next
;
341 /* A list (chain of TREE_LIST nodes) of named label uses.
342 The TREE_PURPOSE field is the list of variables defined
343 in the label's scope defined at the point of use.
344 The TREE_VALUE field is the LABEL_DECL used.
345 The TREE_TYPE field holds `current_binding_level' at the
346 point of the label's use.
348 BWAHAHAAHAHahhahahahaah. No, no, no, said the little chicken.
350 Look at the pretty struct named_label_list. See the pretty struct
351 with the pretty named fields that describe what they do. See the
352 pretty lack of gratuitous casts. Notice the code got a lot cleaner.
354 Used only for jumps to as-yet undefined labels, since
355 jumps to defined labels can have their validity checked
358 #define named_label_uses cp_function_chain->named_label_uses
360 /* A list of objects which have constructors or destructors
361 which reside in the global scope. The decl is stored in
362 the TREE_VALUE slot and the initializer is stored
363 in the TREE_PURPOSE slot. */
364 tree static_aggregates
;
368 /* An expression of type `int' for the constant zero. */
370 tree integer_zero_node
;
372 /* A node for the integer constants 1, 2, and 3. */
374 tree integer_one_node
, integer_two_node
, integer_three_node
;
376 /* While defining an enum type, this is 1 plus the last enumerator
379 static tree enum_next_value
;
381 /* Nonzero means that there was overflow computing enum_next_value. */
383 static int enum_overflow
;
385 /* Parsing a function declarator leaves here a chain of structure
386 and enum types declared in the parmlist. */
388 static tree last_function_parm_tags
;
390 /* Similar, for last_function_parm_tags. */
391 tree last_function_parms
;
392 static tree current_function_parm_tags
;
394 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
395 that have names. Here so we can clear out their names' definitions
396 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
397 TREE_PURPOSE is the previous binding of the label. */
399 #define named_labels cp_function_chain->x_named_labels
401 /* The FUNCTION_DECL for the function currently being compiled,
402 or 0 if between functions. */
403 tree current_function_decl
;
405 /* Set to 0 at beginning of a function definition, and whenever
406 a label (case or named) is defined. Set to value of expression
407 returned from function when that value can be transformed into
408 a named return value. */
410 tree current_function_return_value
;
412 /* Nonzero means give `double' the same size as `float'. */
414 extern int flag_short_double
;
416 /* Nonzero means don't recognize any builtin functions. */
418 extern int flag_no_builtin
;
420 /* Nonzero means don't recognize the non-ANSI builtin functions.
423 extern int flag_no_nonansi_builtin
;
425 /* Nonzero means enable obscure ANSI features and disable GNU extensions
426 that might cause ANSI-compliant code to be miscompiled. */
428 extern int flag_ansi
;
430 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
432 extern int flag_huge_objects
;
434 /* Nonzero if we want to conserve space in the .o files. We do this
435 by putting uninitialized data and runtime initialized data into
436 .common instead of .data at the expense of not flagging multiple
438 extern int flag_conserve_space
;
440 /* C and C++ flags are in decl2.c. */
442 /* Set to 0 at beginning of a constructor, set to 1
443 if that function does an allocation before referencing its
444 instance variable. */
445 #define current_function_assigns_this cp_function_chain->assigns_this
446 #define current_function_just_assigned_this \
447 cp_function_chain->just_assigned_this
449 /* Flag used when debugging spew.c */
451 extern int spew_debug
;
453 /* A expression of value 0 with the same precision as a sizetype
455 tree signed_size_zero_node
;
457 /* The name of the anonymous namespace, throughout this translation
459 tree anonymous_namespace_name
;
462 /* Allocate a level of searching. */
466 push_decl_level (stack
, obstack
)
467 struct stack_level
*stack
;
468 struct obstack
*obstack
;
470 struct stack_level tem
;
473 return push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
476 /* For each binding contour we allocate a binding_level structure
477 which records the names defined in that contour.
480 1) one for each function definition,
481 where internal declarations of the parameters appear.
482 2) one for each compound statement,
483 to record its declarations.
485 The current meaning of a name can be found by searching the levels
486 from the current one out to the global one.
488 Off to the side, may be the class_binding_level. This exists only
489 to catch class-local declarations. It is otherwise nonexistent.
491 Also there may be binding levels that catch cleanups that must be
492 run when exceptions occur. Thus, to see whether a name is bound in
493 the current scope, it is not enough to look in the
494 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
497 /* Note that the information in the `names' component of the global contour
498 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
502 /* A chain of _DECL nodes for all variables, constants, functions,
503 and typedef types. These are in the reverse of the order
504 supplied. There may be OVERLOADs on this list, too, but they
505 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
508 /* A list of structure, union and enum definitions, for looking up
510 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
511 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
512 or ENUMERAL_TYPE node.
514 C++: the TREE_VALUE nodes can be simple types for
515 component_bindings. */
518 /* A list of USING_DECL nodes. */
521 /* A list of used namespaces. PURPOSE is the namespace,
522 VALUE the common ancestor with this binding_level's namespace. */
523 tree using_directives
;
525 /* If this binding level is the binding level for a class, then
526 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
527 is the name of an entity bound in the class; the TREE_VALUE is
528 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
529 when leaving class scope, we can restore the
530 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
531 the DECL bound by this name in the class. */
534 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
535 is used for all binding levels. */
538 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
539 label in this scope. The TREE_PURPOSE is the previous value of
540 the IDENTIFIER_LABEL VALUE. */
541 tree shadowed_labels
;
543 /* For each level (except not the global one),
544 a chain of BLOCK nodes for all the levels
545 that were entered and exited one level down. */
548 /* The BLOCK node for this level, if one has been preallocated.
549 If 0, the BLOCK is allocated (if needed) when the level is popped. */
552 /* The binding level which this one is contained in (inherits from). */
553 struct binding_level
*level_chain
;
555 /* List of decls in `names' that have incomplete
556 structure or union types. */
559 /* List of VAR_DECLS saved from a previous for statement.
560 These would be dead in ANSI-conforming code, but might
561 be referenced in ARM-era code. These are stored in a
562 TREE_LIST; the TREE_VALUE is the actual declaration. */
563 tree dead_vars_from_for
;
565 /* 1 for the level that holds the parameters of a function.
566 2 for the level that holds a class declaration.
567 3 for levels that hold parameter declarations. */
568 unsigned parm_flag
: 4;
570 /* 1 means make a BLOCK for this level regardless of all else.
571 2 for temporary binding contours created by the compiler. */
574 /* Nonzero if this level "doesn't exist" for tags. */
575 unsigned tag_transparent
: 1;
577 /* Nonzero if this level can safely have additional
578 cleanup-needing variables added to it. */
579 unsigned more_cleanups_ok
: 1;
580 unsigned have_cleanups
: 1;
582 /* Nonzero if this level is for storing the decls for template
583 parameters and generic decls; these decls will be discarded and
584 replaced with a TEMPLATE_DECL. */
585 unsigned pseudo_global
: 1;
587 /* This is set for a namespace binding level. */
588 unsigned namespace_p
: 1;
590 /* True if this level is that of a for-statement where we need to
591 worry about ambiguous (ARM or ANSI) scope rules. */
592 unsigned is_for_scope
: 1;
594 /* True if this level corresponds to an EH region, as for a try block. */
595 unsigned eh_region
: 1;
597 /* One bit left for this word. */
599 #if defined(DEBUG_CP_BINDING_LEVELS)
600 /* Binding depth at which this level began. */
601 unsigned binding_depth
;
602 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
605 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
607 /* The binding level currently in effect. */
609 #define current_binding_level \
611 ? cp_function_chain->bindings \
612 : scope_chain->bindings)
614 /* The binding level of the current class, if any. */
616 #define class_binding_level scope_chain->class_bindings
618 /* A chain of binding_level structures awaiting reuse. */
620 static struct binding_level
*free_binding_level
;
622 /* The outermost binding level, for names of file scope.
623 This is created when the compiler is started and exists
624 through the entire run. */
626 static struct binding_level
*global_binding_level
;
628 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
630 static int keep_next_level_flag
;
632 #if defined(DEBUG_CP_BINDING_LEVELS)
633 static int binding_depth
= 0;
634 static int is_class_level
= 0;
641 for (i
= 0; i
< binding_depth
*2; i
++)
644 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
646 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
649 push_binding_level (newlevel
, tag_transparent
, keep
)
650 struct binding_level
*newlevel
;
651 int tag_transparent
, keep
;
653 /* Add this level to the front of the chain (stack) of levels that
655 bzero ((char*) newlevel
, sizeof (struct binding_level
));
656 newlevel
->level_chain
= current_binding_level
;
657 current_binding_level
= newlevel
;
658 newlevel
->tag_transparent
= tag_transparent
;
659 newlevel
->more_cleanups_ok
= 1;
661 /* We are called before expand_start_bindings, but after
662 expand_eh_region_start for a try block; so we check this now,
663 before the EH block is covered up. */
664 newlevel
->eh_region
= is_eh_region ();
666 newlevel
->keep
= keep
;
667 #if defined(DEBUG_CP_BINDING_LEVELS)
668 newlevel
->binding_depth
= binding_depth
;
670 fprintf (stderr
, "push %s level 0x%08x line %d\n",
671 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
674 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
677 /* Find the innermost enclosing class scope, and reset
678 CLASS_BINDING_LEVEL appropriately. */
681 find_class_binding_level ()
683 struct binding_level
*level
= current_binding_level
;
685 while (level
&& level
->parm_flag
!= 2)
686 level
= level
->level_chain
;
687 if (level
&& level
->parm_flag
== 2)
688 class_binding_level
= level
;
690 class_binding_level
= 0;
696 if (global_binding_level
)
698 /* Cannot pop a level, if there are none left to pop. */
699 if (current_binding_level
== global_binding_level
)
700 my_friendly_abort (123);
702 /* Pop the current level, and free the structure for reuse. */
703 #if defined(DEBUG_CP_BINDING_LEVELS)
706 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
707 (is_class_level
) ? "class" : "block",
708 current_binding_level
, lineno
);
709 if (is_class_level
!= (current_binding_level
== class_binding_level
))
712 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
715 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
717 register struct binding_level
*level
= current_binding_level
;
718 current_binding_level
= current_binding_level
->level_chain
;
719 level
->level_chain
= free_binding_level
;
720 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
721 if (level
->binding_depth
!= binding_depth
)
723 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
724 free_binding_level
= level
;
725 find_class_binding_level ();
730 suspend_binding_level ()
732 if (class_binding_level
)
733 current_binding_level
= class_binding_level
;
735 if (global_binding_level
)
737 /* Cannot suspend a level, if there are none left to suspend. */
738 if (current_binding_level
== global_binding_level
)
739 my_friendly_abort (123);
741 /* Suspend the current level. */
742 #if defined(DEBUG_CP_BINDING_LEVELS)
745 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
746 (is_class_level
) ? "class" : "block",
747 current_binding_level
, lineno
);
748 if (is_class_level
!= (current_binding_level
== class_binding_level
))
751 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
754 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
755 current_binding_level
= current_binding_level
->level_chain
;
756 find_class_binding_level ();
760 resume_binding_level (b
)
761 struct binding_level
*b
;
763 /* Resuming binding levels is meant only for namespaces,
764 and those cannot nest into classes. */
765 my_friendly_assert(!class_binding_level
, 386);
766 /* Also, resuming a non-directly nested namespace is a no-no. */
767 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
768 current_binding_level
= b
;
769 #if defined(DEBUG_CP_BINDING_LEVELS)
770 b
->binding_depth
= binding_depth
;
772 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
773 (is_class_level
) ? "class" : "block", b
, lineno
);
776 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
779 /* Create a new `struct binding_level'. */
782 struct binding_level
*
783 make_binding_level ()
786 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
789 /* Nonzero if we are currently in the global binding level. */
794 return current_binding_level
== global_binding_level
;
797 /* Return the innermost binding level that is not for a class scope. */
799 static struct binding_level
*
800 innermost_nonclass_level ()
802 struct binding_level
*b
;
804 b
= current_binding_level
;
805 while (b
->parm_flag
== 2)
811 /* Nonzero if we are currently in a toplevel binding level. This
812 means either the global binding level or a namespace in a toplevel
813 binding level. Since there are no non-toplevel namespace levels,
814 this really means any namespace or pseudo-global level. We also
815 include a class whose context is toplevel. */
818 toplevel_bindings_p ()
820 struct binding_level
*b
= innermost_nonclass_level ();
822 return b
->namespace_p
|| b
->pseudo_global
;
825 /* Nonzero if this is a namespace scope, or if we are defining a class
826 which is itself at namespace scope, or whose enclosing class is
827 such a class, etc. */
830 namespace_bindings_p ()
832 struct binding_level
*b
= innermost_nonclass_level ();
834 return b
->namespace_p
;
837 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
838 unconditionally. Otherwise, use the normal logic to decide whether
839 or not to create a BLOCK. */
842 keep_next_level (keep
)
845 keep_next_level_flag
= keep
;
848 /* Nonzero if the current level needs to have a BLOCK made. */
853 return (current_binding_level
->blocks
!= NULL_TREE
854 || current_binding_level
->keep
855 || current_binding_level
->names
!= NULL_TREE
856 || (current_binding_level
->tags
!= NULL_TREE
857 && !current_binding_level
->tag_transparent
));
860 /* Identify this binding level as a level of parameters. */
863 declare_parm_level ()
865 current_binding_level
->parm_flag
= 1;
869 declare_pseudo_global_level ()
871 current_binding_level
->pseudo_global
= 1;
875 declare_namespace_level ()
877 current_binding_level
->namespace_p
= 1;
881 pseudo_global_level_p ()
883 return current_binding_level
->pseudo_global
;
887 set_class_shadows (shadows
)
890 class_binding_level
->class_shadowed
= shadows
;
893 /* Enter a new binding level.
894 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
895 not for that of tags. */
898 pushlevel (tag_transparent
)
901 register struct binding_level
*newlevel
= NULL_BINDING_LEVEL
;
903 /* Reuse or create a struct for this binding level. */
905 #if defined(DEBUG_CP_BINDING_LEVELS)
907 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
908 if (free_binding_level
)
909 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
911 newlevel
= free_binding_level
;
912 free_binding_level
= free_binding_level
->level_chain
;
915 newlevel
= make_binding_level ();
917 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
918 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
919 keep_next_level_flag
= 0;
923 note_level_for_for ()
925 current_binding_level
->is_for_scope
= 1;
929 pushlevel_temporary (tag_transparent
)
932 pushlevel (tag_transparent
);
933 current_binding_level
->keep
= 2;
936 /* Note we don't call push_momentary() here. Otherwise, it would cause
937 cleanups to be allocated on the momentary obstack, and they will be
938 overwritten by the next statement. */
940 expand_start_bindings (0);
943 /* For a binding between a name and an entity at a block scope,
944 this is the `struct binding_level' for the block. */
945 #define BINDING_LEVEL(NODE) \
946 (((struct tree_binding*)NODE)->scope.level)
948 /* Make DECL the innermost binding for ID. The LEVEL is the binding
949 level at which this declaration is being bound. */
952 push_binding (id
, decl
, level
)
955 struct binding_level
* level
;
959 binding
= make_node (CPLUS_BINDING
);
961 /* Now, fill in the binding information. */
962 BINDING_VALUE (binding
) = decl
;
963 BINDING_TYPE (binding
) = NULL_TREE
;
964 BINDING_LEVEL (binding
) = level
;
965 INHERITED_VALUE_BINDING_P (binding
) = 0;
966 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
967 BINDING_HAS_LEVEL_P (binding
) = 1;
969 /* And put it on the front of the list of bindings for ID. */
970 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
971 IDENTIFIER_BINDING (id
) = binding
;
974 /* ID is already bound in the current scope. But, DECL is an
975 additional binding for ID in the same scope. This is the `struct
976 stat' hack whereby a non-typedef class-name or enum-name can be
977 bound at the same level as some other kind of entity. It's the
978 responsibility of the caller to check that inserting this name is
979 legal here. Returns nonzero if the new binding was successful. */
981 add_binding (id
, decl
)
985 tree binding
= IDENTIFIER_BINDING (id
);
988 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
989 /* The new name is the type name. */
990 BINDING_TYPE (binding
) = decl
;
991 else if (!BINDING_VALUE (binding
))
992 /* This situation arises when push_class_level_binding moves an
993 inherited type-binding out of the way to make room for a new
995 BINDING_VALUE (binding
) = decl
;
996 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
997 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
999 /* The old binding was a type name. It was placed in
1000 BINDING_VALUE because it was thought, at the point it was
1001 declared, to be the only entity with such a name. Move the
1002 type name into the type slot; it is now hidden by the new
1004 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1005 BINDING_VALUE (binding
) = decl
;
1006 INHERITED_VALUE_BINDING_P (binding
) = 0;
1008 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1009 && TREE_CODE (decl
) == TYPE_DECL
1010 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1011 && same_type_p (TREE_TYPE (decl
),
1012 TREE_TYPE (BINDING_VALUE (binding
))))
1013 /* We have two typedef-names, both naming the same type to have
1014 the same name. This is OK because of:
1018 In a given scope, a typedef specifier can be used to redefine
1019 the name of any type declared in that scope to refer to the
1020 type to which it already refers. */
1024 cp_error ("declaration of `%#D'", decl
);
1025 cp_error_at ("conflicts with previous declaration `%#D'",
1026 BINDING_VALUE (binding
));
1033 /* Add DECL to the list of things declared in B. */
1036 add_decl_to_level (decl
, b
)
1038 struct binding_level
*b
;
1040 /* Only things that will live forever should go in the global
1042 my_friendly_assert (!(b
== global_binding_level
1043 && !TREE_PERMANENT (decl
)),
1046 /* We build up the list in reverse order, and reverse it later if
1048 TREE_CHAIN (decl
) = b
->names
;
1052 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1053 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1054 doesn't really belong to this binding level, that it got here
1055 through a using-declaration. */
1058 push_local_binding (id
, decl
, flags
)
1063 struct binding_level
*b
;
1065 /* Skip over any local classes. This makes sense if we call
1066 push_local_binding with a friend decl of a local class. */
1067 b
= current_binding_level
;
1068 while (b
->parm_flag
== 2)
1071 if (lookup_name_current_level (id
))
1073 /* Supplement the existing binding. */
1074 if (!add_binding (id
, decl
))
1075 /* It didn't work. Something else must be bound at this
1076 level. Do not add DECL to the list of things to pop
1081 /* Create a new binding. */
1082 push_binding (id
, decl
, b
);
1084 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1085 /* We must put the OVERLOAD into a TREE_LIST since the
1086 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1087 decls that got here through a using-declaration. */
1088 decl
= build_tree_list (NULL_TREE
, decl
);
1090 /* And put DECL on the list of things declared by the current
1092 add_decl_to_level (decl
, b
);
1095 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1096 binding was successful. */
1099 push_class_binding (id
, decl
)
1104 tree binding
= IDENTIFIER_BINDING (id
);
1107 /* Note that we declared this value so that we can issue an error if
1108 this an illegal redeclaration of a name already used for some
1110 note_name_declared_in_class (id
, decl
);
1112 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1113 /* Supplement the existing binding. */
1114 result
= add_binding (id
, decl
);
1116 /* Create a new binding. */
1117 push_binding (id
, decl
, class_binding_level
);
1119 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1120 class-level declaration. Note that we do not use DECL here
1121 because of the possibility of the `struct stat' hack; if DECL is
1122 a class-name or enum-name we might prefer a field-name, or some
1124 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1126 /* If this is a binding from a base class, mark it as such. */
1127 binding
= IDENTIFIER_BINDING (id
);
1128 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1130 /* Any implicit typename must be from a base-class. The
1131 context for an implicit typename declaration is always
1132 the derived class in which the lookup was done, so the checks
1133 based on the context of DECL below will not trigger. */
1134 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1135 INHERITED_VALUE_BINDING_P (binding
) = 1;
1138 if (TREE_CODE (decl
) == OVERLOAD
)
1139 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
1142 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1144 context
= DECL_REAL_CONTEXT (decl
);
1147 if (is_properly_derived_from (current_class_type
, context
))
1148 INHERITED_VALUE_BINDING_P (binding
) = 1;
1150 INHERITED_VALUE_BINDING_P (binding
) = 0;
1153 else if (BINDING_VALUE (binding
) == decl
)
1154 /* We only encounter a TREE_LIST when push_class_decls detects an
1155 ambiguity. Such an ambiguity can be overridden by a definition
1157 INHERITED_VALUE_BINDING_P (binding
) = 1;
1162 /* Remove the binding for DECL which should be the innermost binding
1166 pop_binding (id
, decl
)
1172 if (id
== NULL_TREE
)
1173 /* It's easiest to write the loops that call this function without
1174 checking whether or not the entities involved have names. We
1175 get here for such an entity. */
1178 /* Get the innermost binding for ID. */
1179 binding
= IDENTIFIER_BINDING (id
);
1181 /* The name should be bound. */
1182 my_friendly_assert (binding
!= NULL_TREE
, 0);
1184 /* The DECL will be either the ordinary binding or the type
1185 binding for this identifier. Remove that binding. */
1186 if (BINDING_VALUE (binding
) == decl
)
1187 BINDING_VALUE (binding
) = NULL_TREE
;
1188 else if (BINDING_TYPE (binding
) == decl
)
1189 BINDING_TYPE (binding
) = NULL_TREE
;
1191 my_friendly_abort (0);
1193 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1194 /* We're completely done with the innermost binding for this
1195 identifier. Unhook it from the list of bindings. */
1196 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1199 /* When a label goes out of scope, check to see if that label was used
1200 in a valid manner, and issue any appropriate warnings or errors. */
1206 tree label
= TREE_VALUE (link
);
1208 if (DECL_INITIAL (label
) == NULL_TREE
)
1210 cp_error_at ("label `%D' used but not defined", label
);
1211 /* Avoid crashing later. */
1212 define_label (input_filename
, 1, DECL_NAME (label
));
1214 else if (warn_unused
&& !TREE_USED (label
))
1215 cp_warning_at ("label `%D' defined but not used", label
);
1217 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1220 /* At the end of a function, all labels declared within the fucntion
1221 go out of scope. BLOCK is the top-level block for the
1230 /* Clear out the definitions of all label names, since their scopes
1232 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1235 /* Put the labels into the "variables" of the top-level block,
1236 so debugger can see them. */
1237 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1238 BLOCK_VARS (block
) = TREE_VALUE (link
);
1241 named_labels
= NULL_TREE
;
1244 /* Exit a binding level.
1245 Pop the level off, and restore the state of the identifier-decl mappings
1246 that were in effect when this level was entered.
1248 If KEEP == 1, this level had explicit declarations, so
1249 and create a "block" (a BLOCK node) for the level
1250 to record its declarations and subblocks for symbol table output.
1252 If FUNCTIONBODY is nonzero, this level is the body of a function,
1253 so create a block as if KEEP were set and also clear out all
1256 If REVERSE is nonzero, reverse the order of decls before putting
1257 them into the BLOCK. */
1260 poplevel (keep
, reverse
, functionbody
)
1266 /* The chain of decls was accumulated in reverse order.
1267 Put it into forward order, just for cleanliness. */
1269 int tmp
= functionbody
;
1270 int real_functionbody
= current_binding_level
->keep
== 2
1271 ? ((functionbody
= 0), tmp
) : functionbody
;
1272 tree tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1273 tree subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1274 tree block
= NULL_TREE
;
1276 int block_previously_created
;
1277 int leaving_for_scope
;
1279 if (current_binding_level
->parm_flag
== 2)
1280 return poplevel_class ();
1282 my_friendly_assert (!current_binding_level
->class_shadowed
,
1285 /* We used to use KEEP == 2 to indicate that the new block should go
1286 at the beginning of the list of blocks at this binding level,
1287 rather than the end. This hack is no longer used. */
1288 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1290 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1291 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1292 current_binding_level
->parm_flag
,
1293 current_binding_level
->keep
);
1295 if (current_binding_level
->keep
== 1)
1298 /* Get the decls in the order they were written.
1299 Usually current_binding_level->names is in reverse order.
1300 But parameter decls were previously put in forward order. */
1303 current_binding_level
->names
1304 = decls
= nreverse (current_binding_level
->names
);
1306 decls
= current_binding_level
->names
;
1308 /* Output any nested inline functions within this block
1309 if they weren't already output. */
1311 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1312 if (TREE_CODE (decl
) == FUNCTION_DECL
1313 && ! TREE_ASM_WRITTEN (decl
)
1314 && DECL_INITIAL (decl
) != NULL_TREE
1315 && TREE_ADDRESSABLE (decl
)
1316 && decl_function_context (decl
) == current_function_decl
)
1318 /* If this decl was copied from a file-scope decl
1319 on account of a block-scope extern decl,
1320 propagate TREE_ADDRESSABLE to the file-scope decl. */
1321 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1322 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1325 push_function_context ();
1326 output_inline_function (decl
);
1327 pop_function_context ();
1331 /* If there were any declarations or structure tags in that level,
1332 or if this level is a function body,
1333 create a BLOCK to record them for the life of this function. */
1336 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1337 if (block_previously_created
)
1338 block
= current_binding_level
->this_block
;
1339 else if (keep
== 1 || functionbody
)
1340 block
= make_node (BLOCK
);
1341 if (block
!= NULL_TREE
)
1343 if (block_previously_created
)
1345 if (decls
|| tags
|| subblocks
)
1347 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1348 warning ("internal compiler error: debugging info corrupted");
1350 BLOCK_VARS (block
) = decls
;
1351 BLOCK_TYPE_TAGS (block
) = tags
;
1353 /* We can have previous subblocks and new subblocks when
1354 doing fixup_gotos with complex cleanups. We chain the new
1355 subblocks onto the end of any pre-existing subblocks. */
1356 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1359 /* If we created the block earlier on, and we are just
1360 diddling it now, then it already should have a proper
1361 BLOCK_END_NOTE value associated with it. */
1365 BLOCK_VARS (block
) = decls
;
1366 BLOCK_TYPE_TAGS (block
) = tags
;
1367 BLOCK_SUBBLOCKS (block
) = subblocks
;
1368 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1370 remember_end_note (block
);
1374 /* In each subblock, record that this is its superior. */
1377 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1378 BLOCK_SUPERCONTEXT (link
) = block
;
1380 /* We still support the old for-scope rules, whereby the variables
1381 in a for-init statement were in scope after the for-statement
1382 ended. We only use the new rules in flag_new_for_scope is
1385 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1387 /* Remove declarations for all the DECLs in this level. */
1388 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1390 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1393 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1397 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1399 ns_binding
= NULL_TREE
;
1402 && (BINDING_LEVEL (outer_binding
)
1403 == current_binding_level
->level_chain
))
1404 /* We have something like:
1409 and we are leaving the `for' scope. There's no reason to
1410 keep the binding of the inner `i' in this case. */
1411 pop_binding (DECL_NAME (link
), link
);
1412 else if ((outer_binding
1413 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1416 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1417 /* Here, we have something like:
1425 We must pop the for-scope binding so we know what's a
1426 type and what isn't. */
1427 pop_binding (DECL_NAME (link
), link
);
1430 /* Mark this VAR_DECL as dead so that we can tell we left it
1431 there only for backward compatibility. */
1432 DECL_DEAD_FOR_LOCAL (link
) = 1;
1434 /* Keep track of what should of have happenned when we
1435 popped the binding. */
1436 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1437 DECL_SHADOWED_FOR_VAR (link
)
1438 = BINDING_VALUE (outer_binding
);
1440 /* Add it to the list of dead variables in the next
1441 outermost binding to that we can remove these when we
1442 leave that binding. */
1443 current_binding_level
->level_chain
->dead_vars_from_for
1444 = tree_cons (NULL_TREE
, link
,
1445 current_binding_level
->level_chain
->
1446 dead_vars_from_for
);
1448 /* Although we don't pop the CPLUS_BINDING, we do clear
1449 its BINDING_LEVEL since the level is going away now. */
1450 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1456 /* Remove the binding. */
1458 if (TREE_CODE (decl
) == TREE_LIST
)
1459 decl
= TREE_VALUE (decl
);
1460 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1461 pop_binding (DECL_NAME (decl
), decl
);
1462 else if (TREE_CODE (decl
) == OVERLOAD
)
1463 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1465 my_friendly_abort (0);
1469 /* Remove declarations for any `for' variables from inner scopes
1470 that we kept around. */
1471 for (link
= current_binding_level
->dead_vars_from_for
;
1472 link
; link
= TREE_CHAIN (link
))
1473 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1475 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1476 for (link
= current_binding_level
->type_shadowed
;
1477 link
; link
= TREE_CHAIN (link
))
1478 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1480 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1481 for (link
= current_binding_level
->shadowed_labels
;
1483 link
= TREE_CHAIN (link
))
1486 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1487 list if a `using' declaration put them there. The debugging
1488 back-ends won't understand OVERLOAD, so we remove them here.
1489 Because the BLOCK_VARS are (temporarily) shared with
1490 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1491 popped all the bindings. */
1496 for (d
= &BLOCK_VARS (block
); *d
; )
1498 if (TREE_CODE (*d
) == TREE_LIST
)
1499 *d
= TREE_CHAIN (*d
);
1501 d
= &TREE_CHAIN (*d
);
1505 /* If the level being exited is the top level of a function,
1506 check over all the labels. */
1509 /* Since this is the top level block of a function, the vars are
1510 the function's parameters. Don't leave them in the BLOCK
1511 because they are found in the FUNCTION_DECL instead. */
1512 BLOCK_VARS (block
) = 0;
1516 /* Any uses of undefined labels now operate under constraints
1517 of next binding contour. */
1518 if (current_function
)
1520 struct binding_level
*level_chain
;
1521 level_chain
= current_binding_level
->level_chain
;
1524 struct named_label_list
*labels
;
1525 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1526 if (labels
->binding_level
== current_binding_level
)
1528 labels
->binding_level
= level_chain
;
1529 labels
->names_in_scope
= level_chain
->names
;
1534 tmp
= current_binding_level
->keep
;
1536 pop_binding_level ();
1538 DECL_INITIAL (current_function_decl
) = block
;
1541 if (!block_previously_created
)
1542 current_binding_level
->blocks
1543 = chainon (current_binding_level
->blocks
, block
);
1545 /* If we did not make a block for the level just exited,
1546 any blocks made for inner levels
1547 (since they cannot be recorded as subblocks in that level)
1548 must be carried forward so they will later become subblocks
1549 of something else. */
1551 current_binding_level
->blocks
1552 = chainon (current_binding_level
->blocks
, subblocks
);
1554 /* Take care of compiler's internal binding structures. */
1557 expand_end_bindings (getdecls (), keep
, 1);
1558 /* Each and every BLOCK node created here in `poplevel' is important
1559 (e.g. for proper debugging information) so if we created one
1560 earlier, mark it as "used". */
1562 TREE_USED (block
) = 1;
1563 block
= poplevel (keep
, reverse
, real_functionbody
);
1566 /* Each and every BLOCK node created here in `poplevel' is important
1567 (e.g. for proper debugging information) so if we created one
1568 earlier, mark it as "used". */
1570 TREE_USED (block
) = 1;
1574 /* Delete the node BLOCK from the current binding level.
1575 This is used for the block inside a stmt expr ({...})
1576 so that the block can be reinserted where appropriate. */
1579 delete_block (block
)
1583 if (current_binding_level
->blocks
== block
)
1584 current_binding_level
->blocks
= TREE_CHAIN (block
);
1585 for (t
= current_binding_level
->blocks
; t
;)
1587 if (TREE_CHAIN (t
) == block
)
1588 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1592 TREE_CHAIN (block
) = NULL_TREE
;
1593 /* Clear TREE_USED which is always set by poplevel.
1594 The flag is set again if insert_block is called. */
1595 TREE_USED (block
) = 0;
1598 /* Insert BLOCK at the end of the list of subblocks of the
1599 current binding level. This is used when a BIND_EXPR is expanded,
1600 to handle the BLOCK node inside the BIND_EXPR. */
1603 insert_block (block
)
1606 TREE_USED (block
) = 1;
1607 current_binding_level
->blocks
1608 = chainon (current_binding_level
->blocks
, block
);
1611 /* Set the BLOCK node for the innermost scope
1612 (the one we are currently in). */
1616 register tree block
;
1618 current_binding_level
->this_block
= block
;
1621 /* Do a pushlevel for class declarations. */
1626 register struct binding_level
*newlevel
;
1628 /* Reuse or create a struct for this binding level. */
1629 #if defined(DEBUG_CP_BINDING_LEVELS)
1631 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1632 if (free_binding_level
)
1633 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1635 newlevel
= free_binding_level
;
1636 free_binding_level
= free_binding_level
->level_chain
;
1639 newlevel
= make_binding_level ();
1641 #if defined(DEBUG_CP_BINDING_LEVELS)
1643 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1645 push_binding_level (newlevel
, 0, 0);
1647 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1648 class_binding_level
= current_binding_level
;
1649 class_binding_level
->parm_flag
= 2;
1652 /* ...and a poplevel for class declarations. */
1657 register struct binding_level
*level
= class_binding_level
;
1660 my_friendly_assert (level
!= 0, 354);
1662 decl_stack
= pop_stack_level (decl_stack
);
1663 /* If we're leaving a toplevel class, don't bother to do the setting
1664 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1665 shouldn't even be used when current_class_type isn't set, and second,
1666 if we don't touch it here, we're able to use the cache effect if the
1667 next time we're entering a class scope, it is the same class. */
1668 if (current_class_depth
!= 1)
1670 struct binding_level
* b
;
1672 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1673 for (shadowed
= level
->class_shadowed
;
1675 shadowed
= TREE_CHAIN (shadowed
))
1676 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1678 /* Find the next enclosing class, and recreate
1679 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1680 b
= level
->level_chain
;
1681 while (b
&& b
->parm_flag
!= 2)
1685 for (shadowed
= b
->class_shadowed
;
1687 shadowed
= TREE_CHAIN (shadowed
))
1691 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1692 while (t
&& BINDING_LEVEL (t
) != b
)
1696 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1697 = BINDING_VALUE (t
);
1701 /* Remember to save what IDENTIFIER's were bound in this scope so we
1702 can recover from cache misses. */
1704 previous_class_type
= current_class_type
;
1705 previous_class_values
= class_binding_level
->class_shadowed
;
1707 for (shadowed
= level
->type_shadowed
;
1709 shadowed
= TREE_CHAIN (shadowed
))
1710 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1712 /* Remove the bindings for all of the class-level declarations. */
1713 for (shadowed
= level
->class_shadowed
;
1715 shadowed
= TREE_CHAIN (shadowed
))
1716 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1718 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1719 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1720 class_binding_level
->parm_flag
,
1721 class_binding_level
->keep
);
1723 /* Now, pop out of the binding level which we created up in the
1724 `pushlevel_class' routine. */
1725 #if defined(DEBUG_CP_BINDING_LEVELS)
1727 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1729 pop_binding_level ();
1734 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1735 for any names in enclosing classes. */
1738 clear_identifier_class_values ()
1742 if (!class_binding_level
)
1745 for (t
= class_binding_level
->class_shadowed
;
1748 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1751 /* Returns non-zero if T is a virtual function table. */
1754 vtable_decl_p (t
, data
)
1756 void *data ATTRIBUTE_UNUSED
;
1758 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1761 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1765 vtype_decl_p (t
, data
)
1767 void *data ATTRIBUTE_UNUSED
;
1769 return (TREE_CODE (t
) == TYPE_DECL
1770 && TREE_TYPE (t
) != error_mark_node
1771 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1772 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1775 /* Return the declarations that are members of the namespace NS. */
1778 cp_namespace_decls (ns
)
1781 return NAMESPACE_LEVEL (ns
)->names
;
1784 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1785 itself, calling F for each. The DATA is passed to F as well. */
1788 walk_namespaces_r (namespace, f
, data
)
1790 walk_namespaces_fn f
;
1796 result
|= (*f
) (namespace, data
);
1798 for (current
= cp_namespace_decls (namespace);
1800 current
= TREE_CHAIN (current
))
1802 if (TREE_CODE (current
) != NAMESPACE_DECL
1803 || DECL_NAMESPACE_ALIAS (current
))
1805 if (!DECL_LANG_SPECIFIC (current
))
1808 my_friendly_assert (current
== std_node
, 393);
1812 /* We found a namespace. */
1813 result
|= walk_namespaces_r (current
, f
, data
);
1819 /* Walk all the namespaces, calling F for each. The DATA is passed to
1823 walk_namespaces (f
, data
)
1824 walk_namespaces_fn f
;
1827 return walk_namespaces_r (global_namespace
, f
, data
);
1830 struct walk_globals_data
{
1831 walk_globals_pred p
;
1836 /* Walk the global declarations in NAMESPACE. Whenever one is found
1837 for which P returns non-zero, call F with its address. If any call
1838 to F returns a non-zero value, return a non-zero value. */
1841 walk_globals_r (namespace, data
)
1845 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1846 walk_globals_pred p
= wgd
->p
;
1847 walk_globals_fn f
= wgd
->f
;
1848 void *d
= wgd
->data
;
1852 t
= &NAMESPACE_LEVEL (namespace)->names
;
1859 result
|= (*f
) (t
, d
);
1861 /* If F changed *T, then *T still points at the next item to
1864 t
= &TREE_CHAIN (*t
);
1870 /* Walk the global declarations. Whenever one is found for which P
1871 returns non-zero, call F with its address. If any call to F
1872 returns a non-zero value, return a non-zero value. */
1875 walk_globals (p
, f
, data
)
1876 walk_globals_pred p
;
1880 struct walk_globals_data wgd
;
1885 return walk_namespaces (walk_globals_r
, &wgd
);
1888 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1889 DATA is non-NULL, this is the last time we will call
1890 wrapup_global_declarations for this NAMESPACE. */
1893 wrapup_globals_for_namespace (namespace, data
)
1897 tree globals
= cp_namespace_decls (namespace);
1898 int len
= list_length (globals
);
1899 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1903 int last_time
= (data
!= 0);
1905 if (last_time
&& namespace == global_namespace
)
1906 /* Let compile_file handle the global namespace. */
1909 /* Process the decls in reverse order--earliest first.
1910 Put them into VEC from back to front, then take out from front. */
1912 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1913 vec
[len
- i
- 1] = decl
;
1917 check_global_declarations (vec
, len
);
1921 /* Temporarily mark vtables as external. That prevents
1922 wrapup_global_declarations from writing them out; we must process
1923 them ourselves in finish_vtable_vardecl. */
1924 for (i
= 0; i
< len
; ++i
)
1925 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1927 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1928 DECL_EXTERNAL (vec
[i
]) = 1;
1931 /* Write out any globals that need to be output. */
1932 result
= wrapup_global_declarations (vec
, len
);
1934 /* Undo the hack to DECL_EXTERNAL above. */
1935 for (i
= 0; i
< len
; ++i
)
1936 if (vtable_decl_p (vec
[i
], /*data=*/0)
1937 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1939 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1940 DECL_EXTERNAL (vec
[i
]) = 0;
1947 /* Mark ARG (which is really a struct binding_level **) for GC. */
1950 mark_binding_level (arg
)
1953 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1957 ggc_mark_tree (lvl
->names
);
1958 ggc_mark_tree (lvl
->tags
);
1959 ggc_mark_tree (lvl
->usings
);
1960 ggc_mark_tree (lvl
->using_directives
);
1961 ggc_mark_tree (lvl
->class_shadowed
);
1962 ggc_mark_tree (lvl
->type_shadowed
);
1963 ggc_mark_tree (lvl
->shadowed_labels
);
1964 ggc_mark_tree (lvl
->blocks
);
1965 ggc_mark_tree (lvl
->this_block
);
1966 ggc_mark_tree (lvl
->incomplete
);
1967 ggc_mark_tree (lvl
->dead_vars_from_for
);
1969 lvl
= lvl
->level_chain
;
1973 /* For debugging. */
1974 static int no_print_functions
= 0;
1975 static int no_print_builtins
= 0;
1978 print_binding_level (lvl
)
1979 struct binding_level
*lvl
;
1983 fprintf (stderr
, " blocks=");
1984 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1985 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1986 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1987 if (lvl
->tag_transparent
)
1988 fprintf (stderr
, " tag-transparent");
1989 if (lvl
->more_cleanups_ok
)
1990 fprintf (stderr
, " more-cleanups-ok");
1991 if (lvl
->have_cleanups
)
1992 fprintf (stderr
, " have-cleanups");
1993 fprintf (stderr
, "\n");
1996 fprintf (stderr
, " names:\t");
1997 /* We can probably fit 3 names to a line? */
1998 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2000 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2002 if (no_print_builtins
2003 && (TREE_CODE (t
) == TYPE_DECL
)
2004 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2007 /* Function decls tend to have longer names. */
2008 if (TREE_CODE (t
) == FUNCTION_DECL
)
2015 fprintf (stderr
, "\n\t");
2018 print_node_brief (stderr
, "", t
, 0);
2019 if (t
== error_mark_node
)
2023 fprintf (stderr
, "\n");
2027 fprintf (stderr
, " tags:\t");
2029 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2031 if (TREE_PURPOSE (t
) == NULL_TREE
)
2033 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2040 fprintf (stderr
, "\n\t");
2043 if (TREE_PURPOSE (t
) == NULL_TREE
)
2045 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2046 fprintf (stderr
, ">");
2048 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2049 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2052 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2053 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2054 fprintf (stderr
, ">");
2058 fprintf (stderr
, "\n");
2060 if (lvl
->class_shadowed
)
2062 fprintf (stderr
, " class-shadowed:");
2063 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2065 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2067 fprintf (stderr
, "\n");
2069 if (lvl
->type_shadowed
)
2071 fprintf (stderr
, " type-shadowed:");
2072 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2074 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2076 fprintf (stderr
, "\n");
2081 print_other_binding_stack (stack
)
2082 struct binding_level
*stack
;
2084 struct binding_level
*level
;
2085 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2087 fprintf (stderr
, "binding level ");
2088 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2089 fprintf (stderr
, "\n");
2090 print_binding_level (level
);
2095 print_binding_stack ()
2097 struct binding_level
*b
;
2098 fprintf (stderr
, "current_binding_level=");
2099 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2100 fprintf (stderr
, "\nclass_binding_level=");
2101 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2102 fprintf (stderr
, "\nglobal_binding_level=");
2103 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2104 fprintf (stderr
, "\n");
2105 if (class_binding_level
)
2107 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2108 if (b
== current_binding_level
)
2111 b
= class_binding_level
;
2113 b
= current_binding_level
;
2116 b
= current_binding_level
;
2117 print_other_binding_stack (b
);
2118 fprintf (stderr
, "global:\n");
2119 print_binding_level (global_binding_level
);
2122 /* Namespace binding access routines: The namespace_bindings field of
2123 the identifier is polymorphic, with three possible values:
2124 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2125 indicating the BINDING_VALUE of global_namespace. */
2127 /* Check whether the a binding for the name to scope is known.
2128 Assumes that the bindings of the name are already a list
2129 of bindings. Returns the binding found, or NULL_TREE. */
2132 find_binding (name
, scope
)
2136 tree iter
, prev
= NULL_TREE
;
2138 scope
= ORIGINAL_NAMESPACE (scope
);
2140 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2141 iter
= TREE_CHAIN (iter
))
2143 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2144 if (BINDING_SCOPE (iter
) == scope
)
2146 /* Move binding found to the front of the list, so
2147 subsequent lookups will find it faster. */
2150 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2151 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2152 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2161 /* Always returns a binding for name in scope. If the
2162 namespace_bindings is not a list, convert it to one first.
2163 If no binding is found, make a new one. */
2166 binding_for_name (name
, scope
)
2170 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2173 scope
= ORIGINAL_NAMESPACE (scope
);
2175 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2177 /* Get rid of optimization for global scope. */
2178 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2179 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2180 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2182 if (b
&& (result
= find_binding (name
, scope
)))
2184 /* Not found, make a new permanent one. */
2185 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2186 result
= make_node (CPLUS_BINDING
);
2187 TREE_CHAIN (result
) = b
;
2188 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2189 BINDING_SCOPE (result
) = scope
;
2190 BINDING_TYPE (result
) = NULL_TREE
;
2191 BINDING_VALUE (result
) = NULL_TREE
;
2196 /* Return the binding value for name in scope, considering that
2197 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2200 namespace_binding (name
, scope
)
2204 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2207 if (scope
== NULL_TREE
)
2208 scope
= global_namespace
;
2209 if (TREE_CODE (b
) != CPLUS_BINDING
)
2210 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2211 name
= find_binding (name
,scope
);
2212 if (name
== NULL_TREE
)
2214 return BINDING_VALUE (name
);
2217 /* Set the binding value for name in scope. If modifying the binding
2218 of global_namespace is attempted, try to optimize it. */
2221 set_namespace_binding (name
, scope
, val
)
2228 if (scope
== NULL_TREE
)
2229 scope
= global_namespace
;
2231 if (scope
== global_namespace
)
2233 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2234 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2236 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2240 b
= binding_for_name (name
, scope
);
2241 BINDING_VALUE (b
) = val
;
2244 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2245 select a name that is unique to this compilation unit. */
2248 push_namespace (name
)
2253 int implicit_use
= 0;
2255 if (!global_namespace
)
2257 /* This must be ::. */
2258 my_friendly_assert (name
== get_identifier ("::"), 377);
2263 /* The name of anonymous namespace is unique for the translation
2265 if (!anonymous_namespace_name
)
2266 anonymous_namespace_name
= get_file_function_name ('N');
2267 name
= anonymous_namespace_name
;
2268 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2270 /* Reopening anonymous namespace. */
2274 else if (current_namespace
== global_namespace
2275 && name
== DECL_NAME (std_node
))
2282 /* Check whether this is an extended namespace definition. */
2283 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2284 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2287 if (DECL_NAMESPACE_ALIAS (d
))
2289 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2290 d
, DECL_NAMESPACE_ALIAS (d
));
2291 d
= DECL_NAMESPACE_ALIAS (d
);
2298 /* Make a new namespace, binding the name to it. */
2299 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2300 /* The global namespace is not pushed, and the global binding
2301 level is set elsewhere. */
2306 declare_namespace_level ();
2307 NAMESPACE_LEVEL (d
) = current_binding_level
;
2311 resume_binding_level (NAMESPACE_LEVEL (d
));
2314 do_using_directive (d
);
2315 /* Enter the name space. */
2316 current_namespace
= d
;
2319 /* Pop from the scope of the current namespace. */
2324 if (current_namespace
== global_namespace
)
2326 my_friendly_assert (in_std
>0, 980421);
2330 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2331 /* The binding level is not popped, as it might be re-opened later. */
2332 suspend_binding_level ();
2335 /* Push into the scope of the namespace NS, even if it is deeply
2336 nested within another namespace. */
2339 push_nested_namespace (ns
)
2342 if (ns
== global_namespace
)
2343 push_to_top_level ();
2346 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2347 push_namespace (DECL_NAME (ns
));
2351 /* Pop back from the scope of the namespace NS, which was previously
2352 entered with push_nested_namespace. */
2355 pop_nested_namespace (ns
)
2358 while (ns
!= global_namespace
)
2361 ns
= CP_DECL_CONTEXT (ns
);
2364 pop_from_top_level ();
2368 /* Subroutines for reverting temporarily to top-level for instantiation
2369 of templates and such. We actually need to clear out the class- and
2370 local-value slots of all identifiers, so that only the global values
2371 are at all visible. Simply setting current_binding_level to the global
2372 scope isn't enough, because more binding levels may be pushed. */
2373 struct saved_scope
*scope_chain
;
2375 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2378 mark_saved_scope (arg
)
2381 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2384 mark_binding_level (&t
->class_bindings
);
2385 ggc_mark_tree (t
->old_bindings
);
2386 ggc_mark_tree (t
->old_namespace
);
2387 ggc_mark_tree (t
->class_name
);
2388 ggc_mark_tree (t
->class_type
);
2389 ggc_mark_tree (t
->access_specifier
);
2390 ggc_mark_tree (t
->function_decl
);
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
);
2398 mark_binding_level (&t
->bindings
);
2404 store_bindings (names
, old_bindings
)
2405 tree names
, old_bindings
;
2408 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2410 tree binding
, t1
, id
;
2412 if (TREE_CODE (t
) == TREE_LIST
)
2413 id
= TREE_PURPOSE (t
);
2418 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2419 we have no IDENTIFIER_BINDING if we have left the class
2420 scope, but cached the class-level declarations. */
2421 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2424 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2425 if (TREE_VEC_ELT (t1
, 0) == id
)
2428 binding
= make_tree_vec (4);
2432 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2433 TREE_VEC_ELT (binding
, 0) = id
;
2434 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2435 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2436 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2437 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2438 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2440 TREE_CHAIN (binding
) = old_bindings
;
2441 old_bindings
= binding
;
2445 return old_bindings
;
2449 maybe_push_to_top_level (pseudo
)
2452 struct saved_scope
*s
;
2453 struct binding_level
*b
;
2457 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2459 b
= scope_chain
? current_binding_level
: 0;
2461 /* If we're in the middle of some function, save our state. */
2462 if (current_function
)
2465 push_function_context_to (NULL_TREE
);
2470 old_bindings
= NULL_TREE
;
2471 if (scope_chain
&& previous_class_type
)
2472 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2474 /* Have to include global_binding_level, because class-level decls
2475 aren't listed anywhere useful. */
2476 for (; b
; b
= b
->level_chain
)
2480 /* Template IDs are inserted into the global level. If they were
2481 inserted into namespace level, finish_file wouldn't find them
2482 when doing pending instantiations. Therefore, don't stop at
2483 namespace level, but continue until :: . */
2484 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2487 old_bindings
= store_bindings (b
->names
, old_bindings
);
2488 /* We also need to check class_shadowed to save class-level type
2489 bindings, since pushclass doesn't fill in b->names. */
2490 if (b
->parm_flag
== 2)
2491 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2493 /* Unwind type-value slots back to top level. */
2494 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2495 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2497 s
->prev
= scope_chain
;
2498 s
->old_bindings
= old_bindings
;
2500 s
->need_pop_function_context
= need_pop
;
2501 s
->function_decl
= current_function_decl
;
2504 current_function_decl
= NULL_TREE
;
2505 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2506 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2507 current_lang_name
= lang_name_cplusplus
;
2508 strict_prototype
= strict_prototypes_lang_cplusplus
;
2509 current_namespace
= global_namespace
;
2511 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2515 push_to_top_level ()
2517 maybe_push_to_top_level (0);
2521 pop_from_top_level ()
2523 struct saved_scope
*s
= scope_chain
;
2526 /* Clear out class-level bindings cache. */
2527 if (previous_class_type
)
2528 invalidate_class_lookup_cache ();
2532 VARRAY_FREE (current_lang_base
);
2534 scope_chain
= s
->prev
;
2535 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2537 tree id
= TREE_VEC_ELT (t
, 0);
2540 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2541 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2542 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2546 if (current_lang_name
== lang_name_cplusplus
)
2547 strict_prototype
= strict_prototypes_lang_cplusplus
;
2548 else if (current_lang_name
== lang_name_c
)
2549 strict_prototype
= strict_prototypes_lang_c
;
2551 /* If we were in the middle of compiling a function, restore our
2553 if (s
->need_pop_function_context
)
2554 pop_function_context_from (NULL_TREE
);
2555 current_function_decl
= s
->function_decl
;
2560 /* Push a definition of struct, union or enum tag "name".
2561 into binding_level "b". "type" should be the type node,
2562 We assume that the tag "name" is not already defined.
2564 Note that the definition may really be just a forward reference.
2565 In that case, the TYPE_SIZE will be a NULL_TREE.
2567 C++ gratuitously puts all these tags in the name space. */
2569 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2570 record the shadowed value for this binding contour. TYPE is
2571 the type that ID maps to. */
2574 set_identifier_type_value_with_scope (id
, type
, b
)
2577 struct binding_level
*b
;
2579 if (!b
->namespace_p
)
2581 /* Shadow the marker, not the real thing, so that the marker
2582 gets restored later. */
2583 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2585 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2589 tree binding
= binding_for_name (id
, current_namespace
);
2590 BINDING_TYPE (binding
) = type
;
2591 /* Store marker instead of real type. */
2592 type
= global_type_node
;
2594 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2597 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2600 set_identifier_type_value (id
, type
)
2604 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2607 /* Return the type associated with id. */
2610 identifier_type_value (id
)
2613 /* There is no type with that name, anywhere. */
2614 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2616 /* This is not the type marker, but the real thing. */
2617 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2618 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2619 /* Have to search for it. It must be on the global level, now.
2620 Ask lookup_name not to return non-types. */
2621 id
= lookup_name_real (id
, 2, 1, 0);
2623 return TREE_TYPE (id
);
2627 /* Pop off extraneous binding levels left over due to syntax errors.
2629 We don't pop past namespaces, as they might be valid. */
2634 #ifdef DEBUG_CP_BINDING_LEVELS
2635 fprintf (stderr
, "XXX entering pop_everything ()\n");
2637 while (!toplevel_bindings_p ())
2639 if (current_binding_level
->parm_flag
== 2)
2640 pop_nested_class ();
2644 #ifdef DEBUG_CP_BINDING_LEVELS
2645 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2649 /* The type TYPE is being declared. If it is a class template, or a
2650 specialization of a class template, do any processing required and
2651 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2652 being declared a friend. B is the binding level at which this TYPE
2655 Returns the TYPE_DECL for TYPE, which may have been altered by this
2659 maybe_process_template_type_declaration (type
, globalize
, b
)
2662 struct binding_level
* b
;
2664 tree decl
= TYPE_NAME (type
);
2666 if (processing_template_parmlist
)
2667 /* You can't declare a new template type in a template parameter
2668 list. But, you can declare a non-template type:
2670 template <class A*> struct S;
2672 is a forward-declaration of `A'. */
2676 maybe_check_template_type (type
);
2678 my_friendly_assert (IS_AGGR_TYPE (type
)
2679 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2682 if (processing_template_decl
)
2684 /* This may change after the call to
2685 push_template_decl_real, but we want the original value. */
2686 tree name
= DECL_NAME (decl
);
2688 decl
= push_template_decl_real (decl
, globalize
);
2689 /* If the current binding level is the binding level for the
2690 template parameters (see the comment in
2691 begin_template_parm_list) and the enclosing level is a class
2692 scope, and we're not looking at a friend, push the
2693 declaration of the member class into the class scope. In the
2694 friend case, push_template_decl will already have put the
2695 friend into global scope, if appropriate. */
2696 if (TREE_CODE (type
) != ENUMERAL_TYPE
2697 && !globalize
&& b
->pseudo_global
2698 && b
->level_chain
->parm_flag
== 2)
2700 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2701 /* Put this tag on the list of tags for the class, since
2702 that won't happen below because B is not the class
2703 binding level, but is instead the pseudo-global level. */
2704 b
->level_chain
->tags
=
2705 tree_cons (name
, type
, b
->level_chain
->tags
);
2706 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2707 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2715 /* In C++, you don't have to write `struct S' to refer to `S'; you
2716 can just use `S'. We accomplish this by creating a TYPE_DECL as
2717 if the user had written `typedef struct S S'. Create and return
2718 the TYPE_DECL for TYPE. */
2721 create_implicit_typedef (name
, type
)
2727 decl
= build_decl (TYPE_DECL
, name
, type
);
2728 SET_DECL_ARTIFICIAL (decl
);
2729 /* There are other implicit type declarations, like the one *within*
2730 a class that allows you to write `S::S'. We must distinguish
2732 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2733 TYPE_NAME (type
) = decl
;
2738 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2739 Normally put it into the inner-most non-tag-transparent scope,
2740 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2741 The latter is needed for implicit declarations. */
2744 pushtag (name
, type
, globalize
)
2748 register struct binding_level
*b
;
2750 b
= current_binding_level
;
2751 while (b
->tag_transparent
2752 || (globalize
&& b
->parm_flag
== 2))
2755 b
->tags
= tree_cons (name
, type
, b
->tags
);
2759 /* Do C++ gratuitous typedefing. */
2760 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2762 register tree d
= NULL_TREE
;
2764 tree context
= TYPE_CONTEXT (type
);
2768 tree cs
= current_scope ();
2772 else if (cs
!= NULL_TREE
2773 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2774 /* When declaring a friend class of a local class, we want
2775 to inject the newly named class into the scope
2776 containing the local class, not the namespace scope. */
2777 context
= hack_decl_function_context (get_type_decl (cs
));
2780 context
= current_namespace
;
2782 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2783 || b
->parm_flag
== 2)
2786 if (current_lang_name
== lang_name_java
)
2787 TYPE_FOR_JAVA (type
) = 1;
2789 d
= create_implicit_typedef (name
, type
);
2790 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2792 set_identifier_type_value_with_scope (name
, type
, b
);
2794 d
= maybe_process_template_type_declaration (type
,
2797 if (b
->parm_flag
== 2)
2799 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2800 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2801 class. But if it's a member template class, we
2802 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2804 finish_member_declaration (d
);
2806 pushdecl_class_level (d
);
2809 d
= pushdecl_with_scope (d
, b
);
2811 if (ANON_AGGRNAME_P (name
))
2812 DECL_IGNORED_P (d
) = 1;
2814 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2815 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2816 if (!uses_template_parms (type
))
2817 DECL_ASSEMBLER_NAME (d
)
2818 = get_identifier (build_overload_name (type
, 1, 1));
2820 if (b
->parm_flag
== 2)
2822 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2823 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2827 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2828 /* Use the canonical TYPE_DECL for this node. */
2829 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2832 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2833 will be the tagged type we just added to the current
2834 binding level. This fake NULL-named TYPE_DECL node helps
2835 dwarfout.c to know when it needs to output a
2836 representation of a tagged type, and it also gives us a
2837 convenient place to record the "scope start" address for
2840 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2841 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2845 /* Counter used to create anonymous type names. */
2847 static int anon_cnt
= 0;
2849 /* Return an IDENTIFIER which can be used as a name for
2850 anonymous structs and unions. */
2857 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2858 return get_identifier (buf
);
2861 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2862 This keeps dbxout from getting confused. */
2867 register struct binding_level
*b
;
2869 static int last_cnt
= 0;
2871 /* Fast out if no new anon names were declared. */
2872 if (last_cnt
== anon_cnt
)
2875 b
= current_binding_level
;
2876 while (b
->tag_transparent
)
2881 /* A NULL purpose means we have already processed all tags
2882 from here to the end of the list. */
2883 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2885 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2886 TREE_PURPOSE (tags
) = NULL_TREE
;
2887 tags
= TREE_CHAIN (tags
);
2889 last_cnt
= anon_cnt
;
2892 /* Subroutine of duplicate_decls: return truthvalue of whether
2893 or not types of these decls match.
2895 For C++, we must compare the parameter list so that `int' can match
2896 `int&' in a parameter position, but `int&' is not confused with
2900 decls_match (newdecl
, olddecl
)
2901 tree newdecl
, olddecl
;
2905 if (newdecl
== olddecl
)
2908 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2909 /* If the two DECLs are not even the same kind of thing, we're not
2910 interested in their types. */
2913 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2915 tree f1
= TREE_TYPE (newdecl
);
2916 tree f2
= TREE_TYPE (olddecl
);
2917 tree p1
= TYPE_ARG_TYPES (f1
);
2918 tree p2
= TYPE_ARG_TYPES (f2
);
2920 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2921 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2922 && DECL_LANGUAGE (olddecl
) == lang_c
))
2925 /* When we parse a static member function definition,
2926 we put together a FUNCTION_DECL which thinks its type
2927 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2929 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2930 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2931 else if (TREE_CODE (f2
) == METHOD_TYPE
2932 && DECL_STATIC_FUNCTION_P (newdecl
))
2933 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2935 /* Here we must take care of the case where new default
2936 parameters are specified. Also, warn if an old
2937 declaration becomes ambiguous because default
2938 parameters may cause the two to be ambiguous. */
2939 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2941 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2942 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2944 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2948 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2950 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2953 types_match
= self_promoting_args_p (p1
);
2954 if (p1
== void_list_node
)
2955 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2957 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2958 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2960 types_match
= self_promoting_args_p (p2
);
2961 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2964 types_match
= compparms (p1
, p2
);
2969 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2971 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2972 DECL_TEMPLATE_PARMS (olddecl
)))
2975 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2978 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2979 DECL_TEMPLATE_RESULT (newdecl
));
2983 if (TREE_TYPE (newdecl
) == error_mark_node
)
2984 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2985 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2986 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2987 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2990 types_match
= comptypes (TREE_TYPE (newdecl
),
2991 TREE_TYPE (olddecl
),
2992 COMPARE_REDECLARATION
);
2998 /* If NEWDECL is `static' and an `extern' was seen previously,
2999 warn about it. (OLDDECL may be NULL_TREE; NAME contains
3000 information about previous usage as an `extern'.)
3002 Note that this does not apply to the C++ case of declaring
3003 a variable `extern const' and then later `const'.
3005 Don't complain about built-in functions, since they are beyond
3006 the user's control. */
3009 warn_extern_redeclared_static (newdecl
, olddecl
)
3010 tree newdecl
, olddecl
;
3014 static const char *explicit_extern_static_warning
3015 = "`%D' was declared `extern' and later `static'";
3016 static const char *implicit_extern_static_warning
3017 = "`%D' was declared implicitly `extern' and later `static'";
3019 if (TREE_CODE (newdecl
) == TYPE_DECL
)
3022 name
= DECL_ASSEMBLER_NAME (newdecl
);
3023 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
3025 /* It's okay to redeclare an ANSI built-in function as static,
3026 or to declare a non-ANSI built-in function as anything. */
3027 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
3028 && olddecl
!= NULL_TREE
3029 && TREE_CODE (olddecl
) == FUNCTION_DECL
3030 && DECL_ARTIFICIAL (olddecl
)))
3032 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3033 ? implicit_extern_static_warning
3034 : explicit_extern_static_warning
, newdecl
);
3035 if (olddecl
!= NULL_TREE
)
3036 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3041 /* Handle when a new declaration NEWDECL has the same name as an old
3042 one OLDDECL in the same binding contour. Prints an error message
3045 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3046 Otherwise, return 0. */
3049 duplicate_decls (newdecl
, olddecl
)
3050 tree newdecl
, olddecl
;
3052 unsigned olddecl_uid
= DECL_UID (olddecl
);
3053 int olddecl_friend
= 0, types_match
= 0;
3054 int new_defines_function
= 0;
3056 if (newdecl
== olddecl
)
3059 types_match
= decls_match (newdecl
, olddecl
);
3061 /* If either the type of the new decl or the type of the old decl is an
3062 error_mark_node, then that implies that we have already issued an
3063 error (earlier) for some bogus type specification, and in that case,
3064 it is rather pointless to harass the user with yet more error message
3065 about the same declaration, so just pretend the types match here. */
3066 if (TREE_TYPE (newdecl
) == error_mark_node
3067 || TREE_TYPE (olddecl
) == error_mark_node
)
3070 /* Check for redeclaration and other discrepancies. */
3071 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3072 && DECL_ARTIFICIAL (olddecl
))
3074 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3076 /* If you declare a built-in or predefined function name as static,
3077 the old definition is overridden, but optionally warn this was a
3078 bad choice of name. */
3079 if (! TREE_PUBLIC (newdecl
))
3082 cp_warning ("shadowing %s function `%#D'",
3083 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3085 /* Discard the old built-in function. */
3088 /* If the built-in is not ansi, then programs can override
3089 it even globally without an error. */
3090 else if (! DECL_BUILT_IN (olddecl
))
3091 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3095 cp_error ("declaration of `%#D'", newdecl
);
3096 cp_error ("conflicts with built-in declaration `%#D'",
3101 else if (!types_match
)
3103 if ((DECL_LANGUAGE (newdecl
) == lang_c
3104 && DECL_LANGUAGE (olddecl
) == lang_c
)
3105 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3106 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3108 /* A near match; override the builtin. */
3110 if (TREE_PUBLIC (newdecl
))
3112 cp_warning ("new declaration `%#D'", newdecl
);
3113 cp_warning ("ambiguates built-in declaration `%#D'",
3116 else if (warn_shadow
)
3117 cp_warning ("shadowing %s function `%#D'",
3118 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3122 /* Discard the old built-in function. */
3126 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3128 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3129 && TREE_CODE (newdecl
) != TYPE_DECL
3130 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3131 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3132 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3133 && TREE_CODE (olddecl
) != TYPE_DECL
3134 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3135 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3138 /* We do nothing special here, because C++ does such nasty
3139 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3140 get shadowed, and know that if we need to find a TYPE_DECL
3141 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3142 slot of the identifier. */
3146 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3147 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3148 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3149 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3152 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3153 if (TREE_CODE (olddecl
) == TREE_LIST
)
3154 olddecl
= TREE_VALUE (olddecl
);
3155 cp_error_at ("previous declaration of `%#D'", olddecl
);
3157 /* New decl is completely inconsistent with the old one =>
3158 tell caller to replace the old one. */
3162 else if (!types_match
)
3164 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3165 /* These are certainly not duplicate declarations; they're
3166 from different scopes. */
3169 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3171 /* The name of a class template may not be declared to refer to
3172 any other template, class, function, object, namespace, value,
3173 or type in the same scope. */
3174 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3175 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3177 cp_error ("declaration of template `%#D'", newdecl
);
3178 cp_error_at ("conflicts with previous declaration `%#D'",
3181 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3182 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3183 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3184 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3185 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3186 DECL_TEMPLATE_PARMS (olddecl
)))
3188 cp_error ("new declaration `%#D'", newdecl
);
3189 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3193 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3195 if (DECL_LANGUAGE (newdecl
) == lang_c
3196 && DECL_LANGUAGE (olddecl
) == lang_c
)
3198 cp_error ("declaration of C function `%#D' conflicts with",
3200 cp_error_at ("previous declaration `%#D' here", olddecl
);
3202 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3203 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3205 cp_error ("new declaration `%#D'", newdecl
);
3206 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3212 /* Already complained about this, so don't do so again. */
3213 else if (current_class_type
== NULL_TREE
3214 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3216 cp_error ("conflicting types for `%#D'", newdecl
);
3217 cp_error_at ("previous declaration as `%#D'", olddecl
);
3220 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3221 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3222 && (!DECL_TEMPLATE_INFO (newdecl
)
3223 || (DECL_TI_TEMPLATE (newdecl
)
3224 != DECL_TI_TEMPLATE (olddecl
))))
3225 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3226 && (!DECL_TEMPLATE_INFO (olddecl
)
3227 || (DECL_TI_TEMPLATE (olddecl
)
3228 != DECL_TI_TEMPLATE (newdecl
))))))
3229 /* It's OK to have a template specialization and a non-template
3230 with the same type, or to have specializations of two
3231 different templates with the same type. Note that if one is a
3232 specialization, and the other is an instantiation of the same
3233 template, that we do not exit at this point. That situation
3234 can occur if we instantiate a template class, and then
3235 specialize one of its methods. This situation is legal, but
3236 the declarations must be merged in the usual way. */
3238 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3239 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3240 && !DECL_USE_TEMPLATE (newdecl
))
3241 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3242 && !DECL_USE_TEMPLATE (olddecl
))))
3243 /* One of the declarations is a template instantiation, and the
3244 other is not a template at all. That's OK. */
3246 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3247 && DECL_NAMESPACE_ALIAS (newdecl
)
3248 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3249 /* Redeclaration of namespace alias, ignore it. */
3253 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3256 cp_error (errmsg
, newdecl
);
3257 if (DECL_NAME (olddecl
) != NULL_TREE
)
3258 cp_error_at ((DECL_INITIAL (olddecl
)
3259 && namespace_bindings_p ())
3260 ? "`%#D' previously defined here"
3261 : "`%#D' previously declared here", olddecl
);
3263 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3264 && DECL_INITIAL (olddecl
) != NULL_TREE
3265 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3266 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3268 /* Prototype decl follows defn w/o prototype. */
3269 cp_warning_at ("prototype for `%#D'", newdecl
);
3270 cp_warning_at ("follows non-prototype definition here", olddecl
);
3272 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3273 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3275 /* extern "C" int foo ();
3276 int foo () { bar (); }
3278 if (current_lang_stack
3279 == &VARRAY_TREE (current_lang_base
, 0))
3280 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3283 cp_error_at ("previous declaration of `%#D' with %L linkage",
3284 olddecl
, DECL_LANGUAGE (olddecl
));
3285 cp_error ("conflicts with new declaration with %L linkage",
3286 DECL_LANGUAGE (newdecl
));
3290 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3292 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3294 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3295 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3298 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3299 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3301 for (; t1
&& t1
!= void_list_node
;
3302 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3303 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3305 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3310 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3312 cp_pedwarn_at ("after previous specification in `%#D'",
3318 cp_error ("default argument given for parameter %d of `%#D'",
3320 cp_error_at ("after previous specification in `%#D'",
3325 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3326 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3328 cp_warning ("`%#D' was used before it was declared inline",
3330 cp_warning_at ("previous non-inline declaration here",
3336 /* If new decl is `static' and an `extern' was seen previously,
3338 warn_extern_redeclared_static (newdecl
, olddecl
);
3340 /* We have committed to returning 1 at this point. */
3341 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3343 /* Now that functions must hold information normally held
3344 by field decls, there is extra work to do so that
3345 declaration information does not get destroyed during
3347 if (DECL_VINDEX (olddecl
))
3348 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3349 if (DECL_CONTEXT (olddecl
))
3350 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3351 if (DECL_CLASS_CONTEXT (olddecl
))
3352 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3353 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3354 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3355 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3356 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3357 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3358 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3359 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3360 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3362 /* Optionally warn about more than one declaration for the same
3363 name, but don't warn about a function declaration followed by a
3365 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3366 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3367 /* Don't warn about extern decl followed by definition. */
3368 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3369 /* Don't warn about friends, let add_friend take care of it. */
3370 && ! DECL_FRIEND_P (newdecl
))
3372 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3373 cp_warning_at ("previous declaration of `%D'", olddecl
);
3377 /* Deal with C++: must preserve virtual function table size. */
3378 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3380 register tree newtype
= TREE_TYPE (newdecl
);
3381 register tree oldtype
= TREE_TYPE (olddecl
);
3383 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3384 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3386 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3387 CLASSTYPE_FRIEND_CLASSES (newtype
)
3388 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3392 /* Copy all the DECL_... slots specified in the new decl
3393 except for any that we copy here from the old type. */
3394 DECL_MACHINE_ATTRIBUTES (newdecl
)
3395 = merge_machine_decl_attributes (olddecl
, newdecl
);
3397 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3399 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3400 DECL_TEMPLATE_RESULT (olddecl
)))
3401 cp_error ("invalid redeclaration of %D", newdecl
);
3402 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3403 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3404 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3405 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3412 /* Automatically handles default parameters. */
3413 tree oldtype
= TREE_TYPE (olddecl
);
3416 /* Make sure we put the new type in the same obstack as the old one. */
3418 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3420 push_permanent_obstack ();
3422 /* Merge the data types specified in the two decls. */
3423 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3425 if (TREE_CODE (newdecl
) == VAR_DECL
)
3426 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3427 /* Do this after calling `common_type' so that default
3428 parameters don't confuse us. */
3429 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3430 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3431 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3433 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3434 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3435 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3436 TYPE_RAISES_EXCEPTIONS (oldtype
));
3438 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3439 && DECL_SOURCE_LINE (olddecl
) != 0
3441 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3442 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3444 cp_error ("declaration of `%F' throws different exceptions",
3446 cp_error_at ("to previous declaration `%F'", olddecl
);
3449 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3451 /* Lay the type out, unless already done. */
3452 if (! same_type_p (newtype
, oldtype
)
3453 && TREE_TYPE (newdecl
) != error_mark_node
3454 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3455 layout_type (TREE_TYPE (newdecl
));
3457 if ((TREE_CODE (newdecl
) == VAR_DECL
3458 || TREE_CODE (newdecl
) == PARM_DECL
3459 || TREE_CODE (newdecl
) == RESULT_DECL
3460 || TREE_CODE (newdecl
) == FIELD_DECL
3461 || TREE_CODE (newdecl
) == TYPE_DECL
)
3462 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3463 layout_decl (newdecl
, 0);
3465 /* Merge the type qualifiers. */
3466 if (TREE_READONLY (newdecl
))
3467 TREE_READONLY (olddecl
) = 1;
3468 if (TREE_THIS_VOLATILE (newdecl
))
3469 TREE_THIS_VOLATILE (olddecl
) = 1;
3471 /* Merge the initialization information. */
3472 if (DECL_INITIAL (newdecl
) == NULL_TREE
3473 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3475 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3476 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3477 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3478 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3479 && DECL_LANG_SPECIFIC (newdecl
)
3480 && DECL_LANG_SPECIFIC (olddecl
))
3481 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3484 /* Merge the section attribute.
3485 We want to issue an error if the sections conflict but that must be
3486 done later in decl_attributes since we are called before attributes
3488 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3489 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3491 /* Keep the old rtl since we can safely use it, unless it's the
3492 call to abort() used for abstract virtuals. */
3493 if ((DECL_LANG_SPECIFIC (olddecl
)
3494 && !DECL_ABSTRACT_VIRTUAL_P (olddecl
))
3495 || DECL_RTL (olddecl
) != DECL_RTL (abort_fndecl
))
3496 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3500 /* If cannot merge, then use the new type and qualifiers,
3501 and don't preserve the old rtl. */
3504 /* Clean out any memory we had of the old declaration. */
3505 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3507 TREE_VALUE (oldstatic
) = error_mark_node
;
3509 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3510 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3511 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3512 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3515 /* Merge the storage class information. */
3516 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3517 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3518 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3519 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3520 if (! DECL_EXTERNAL (olddecl
))
3521 DECL_EXTERNAL (newdecl
) = 0;
3523 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3525 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3526 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3527 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3528 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3529 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3530 /* Don't really know how much of the language-specific
3531 values we should copy from old to new. */
3532 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3533 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3534 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3535 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3536 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3538 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3539 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3540 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3541 DECL_BEFRIENDING_CLASSES (newdecl
)
3542 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3543 DECL_BEFRIENDING_CLASSES (olddecl
));
3546 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3548 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3549 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3551 /* If newdecl is not a specialization, then it is not a
3552 template-related function at all. And that means that we
3553 shoud have exited above, returning 0. */
3554 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3557 if (TREE_USED (olddecl
))
3558 /* From [temp.expl.spec]:
3560 If a template, a member template or the member of a class
3561 template is explicitly specialized then that
3562 specialization shall be declared before the first use of
3563 that specialization that would cause an implicit
3564 instantiation to take place, in every translation unit in
3565 which such a use occurs. */
3566 cp_error ("explicit specialization of %D after first use",
3569 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3571 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3573 /* If either decl says `inline', this fn is inline, unless its
3574 definition was passed already. */
3575 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3576 DECL_INLINE (olddecl
) = 1;
3577 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3581 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3582 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3583 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3585 if (! types_match
|| new_defines_function
)
3587 /* These need to be copied so that the names are available.
3588 Note that if the types do match, we'll preserve inline
3589 info and other bits, but if not, we won't. */
3590 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3591 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3593 if (new_defines_function
)
3594 /* If defining a function declared with other language
3595 linkage, use the previously declared language linkage. */
3596 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3597 else if (types_match
)
3599 /* If redeclaring a builtin function, and not a definition,
3600 it stays built in. */
3601 if (DECL_BUILT_IN (olddecl
))
3603 DECL_BUILT_IN (newdecl
) = 1;
3604 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3605 /* If we're keeping the built-in definition, keep the rtl,
3606 regardless of declaration matches. */
3607 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3610 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3612 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3613 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3614 /* Previously saved insns go together with
3615 the function's previous definition. */
3616 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3617 /* Don't clear out the arguments if we're redefining a function. */
3618 if (DECL_ARGUMENTS (olddecl
))
3619 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3621 if (DECL_LANG_SPECIFIC (olddecl
))
3622 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3625 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3627 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3630 /* Now preserve various other info from the definition. */
3631 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3632 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3633 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3634 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3636 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3640 function_size
= sizeof (struct tree_decl
);
3642 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3643 (char *) olddecl
+ sizeof (struct tree_common
),
3644 function_size
- sizeof (struct tree_common
));
3646 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3648 /* If newdecl is a template instantiation, it is possible that
3649 the following sequence of events has occurred:
3651 o A friend function was declared in a class template. The
3652 class template was instantiated.
3654 o The instantiation of the friend declaration was
3655 recorded on the instantiation list, and is newdecl.
3657 o Later, however, instantiate_class_template called pushdecl
3658 on the newdecl to perform name injection. But, pushdecl in
3659 turn called duplicate_decls when it discovered that another
3660 declaration of a global function with the same name already
3663 o Here, in duplicate_decls, we decided to clobber newdecl.
3665 If we're going to do that, we'd better make sure that
3666 olddecl, and not newdecl, is on the list of
3667 instantiations so that if we try to do the instantiation
3668 again we won't get the clobbered declaration. */
3670 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3671 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3673 for (; decls
; decls
= TREE_CHAIN (decls
))
3674 if (TREE_VALUE (decls
) == newdecl
)
3675 TREE_VALUE (decls
) = olddecl
;
3680 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3681 (char *) olddecl
+ sizeof (struct tree_common
),
3682 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3683 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3686 DECL_UID (olddecl
) = olddecl_uid
;
3688 DECL_FRIEND_P (olddecl
) = 1;
3690 /* NEWDECL contains the merged attribute lists.
3691 Update OLDDECL to be the same. */
3692 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3697 /* Record a decl-node X as belonging to the current lexical scope.
3698 Check for errors (such as an incompatible declaration for the same
3699 name already seen in the same scope).
3701 Returns either X or an old decl for the same name.
3702 If an old decl is returned, it may have been smashed
3703 to agree with what X says. */
3710 register tree name
= DECL_ASSEMBLER_NAME (x
);
3711 int need_new_binding
= 1;
3713 if (DECL_TEMPLATE_PARM_P (x
))
3714 /* Template parameters have no context; they are not X::T even
3715 when declared within a class or namespace. */
3719 if (current_function_decl
&& x
!= current_function_decl
3720 /* A local declaration for a function doesn't constitute
3722 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3723 /* Don't change DECL_CONTEXT of virtual methods. */
3724 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3725 && !DECL_CONTEXT (x
))
3726 DECL_CONTEXT (x
) = current_function_decl
;
3727 if (!DECL_CONTEXT (x
))
3728 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3731 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3732 compiler wants to use. */
3733 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3734 || TREE_CODE (x
) == NAMESPACE_DECL
)
3735 name
= DECL_NAME (x
);
3740 /* Not needed...see below. */
3744 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3745 name
= TREE_OPERAND (name
, 0);
3747 /* Namespace-scoped variables are not found in the current level. */
3748 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3749 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3751 t
= lookup_name_current_level (name
);
3752 if (t
== error_mark_node
)
3754 /* error_mark_node is 0 for a while during initialization! */
3756 cp_error_at ("`%#D' used prior to declaration", x
);
3759 else if (t
!= NULL_TREE
)
3762 /* This is turned off until I have time to do it right (bpk). */
3763 /* With the code below that uses it... */
3764 file
= DECL_SOURCE_FILE (t
);
3765 line
= DECL_SOURCE_LINE (t
);
3767 if (TREE_CODE (t
) == PARM_DECL
)
3769 if (DECL_CONTEXT (t
) == NULL_TREE
)
3770 fatal ("parse errors have confused me too much");
3772 /* Check for duplicate params. */
3773 if (duplicate_decls (x
, t
))
3776 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3777 || DECL_FUNCTION_TEMPLATE_P (x
))
3778 && is_overloaded_fn (t
))
3779 /* Don't do anything just yet. */;
3780 else if (t
== wchar_decl_node
)
3782 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3783 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3785 /* Throw away the redeclaration. */
3788 else if (TREE_CODE (t
) != TREE_CODE (x
))
3790 if (duplicate_decls (x
, t
))
3793 else if (duplicate_decls (x
, t
))
3796 /* This is turned off until I have time to do it right (bpk). */
3798 /* Also warn if they did a prototype with `static' on it, but
3799 then later left the `static' off. */
3800 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3802 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3807 cp_warning ("`static' missing from declaration of `%D'",
3809 warning_with_file_and_line (file
, line
,
3810 "previous declaration of `%s'",
3811 decl_as_string (t
, 0));
3814 /* Now fix things so it'll do what they expect. */
3815 if (current_function_decl
)
3816 TREE_PUBLIC (current_function_decl
) = 0;
3818 /* Due to interference in memory reclamation (X may be
3819 obstack-deallocated at this point), we must guard against
3820 one really special case. [jason: This should be handled
3821 by start_function] */
3822 if (current_function_decl
== x
)
3823 current_function_decl
= t
;
3825 if (TREE_CODE (t
) == TYPE_DECL
)
3826 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3827 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3828 check_default_args (t
);
3832 else if (DECL_MAIN_P (x
))
3834 /* A redeclaration of main, but not a duplicate of the
3839 This function shall not be overloaded. */
3840 cp_error_at ("invalid redeclaration of `%D'", t
);
3841 cp_error ("as `%D'", x
);
3842 /* We don't try to push this declaration since that
3848 check_template_shadow (x
);
3850 /* If this is a function conjured up by the backend, massage it
3851 so it looks friendly. */
3852 if (TREE_CODE (x
) == FUNCTION_DECL
3853 && ! DECL_LANG_SPECIFIC (x
))
3855 retrofit_lang_decl (x
);
3856 DECL_LANGUAGE (x
) = lang_c
;
3859 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3861 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3862 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3864 if (!namespace_bindings_p ())
3865 /* We do not need to create a binding for this name;
3866 push_overloaded_decl will have already done so if
3868 need_new_binding
= 0;
3870 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3872 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3874 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3878 /* If declaring a type as a typedef, copy the type (unless we're
3879 at line 0), and install this TYPE_DECL as the new type's typedef
3880 name. See the extensive comment in ../c-decl.c (pushdecl). */
3881 if (TREE_CODE (x
) == TYPE_DECL
)
3883 tree type
= TREE_TYPE (x
);
3884 if (DECL_SOURCE_LINE (x
) == 0)
3886 if (TYPE_NAME (type
) == 0)
3887 TYPE_NAME (type
) = x
;
3889 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3890 /* We don't want to copy the type when all we're
3891 doing is making a TYPE_DECL for the purposes of
3893 && (!TYPE_NAME (type
)
3894 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3896 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3898 DECL_ORIGINAL_TYPE (x
) = type
;
3899 type
= build_type_copy (type
);
3900 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3901 TYPE_NAME (type
) = x
;
3902 TREE_TYPE (x
) = type
;
3907 if (type
!= error_mark_node
3909 && TYPE_IDENTIFIER (type
))
3910 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3911 current_binding_level
);
3915 /* Multiple external decls of the same identifier ought to match.
3917 We get warnings about inline functions where they are defined.
3918 We get warnings about other functions from push_overloaded_decl.
3920 Avoid duplicate warnings where they are used. */
3921 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3925 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3926 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3927 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3928 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3933 /* If different sort of thing, we already gave an error. */
3934 && TREE_CODE (decl
) == TREE_CODE (x
)
3935 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3937 cp_pedwarn ("type mismatch with previous external decl", x
);
3938 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3942 /* This name is new in its binding level.
3943 Install the new declaration and return it. */
3944 if (namespace_bindings_p ())
3946 /* Install a global value. */
3948 /* If the first global decl has external linkage,
3949 warn if we later see static one. */
3950 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3951 TREE_PUBLIC (name
) = 1;
3953 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3956 if (TREE_CODE (x
) == FUNCTION_DECL
)
3958 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3959 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3960 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3963 /* Don't forget if the function was used via an implicit decl. */
3964 if (IDENTIFIER_IMPLICIT_DECL (name
)
3965 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3968 /* Don't forget if its address was taken in that way. */
3969 if (IDENTIFIER_IMPLICIT_DECL (name
)
3970 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3971 TREE_ADDRESSABLE (x
) = 1;
3973 /* Warn about mismatches against previous implicit decl. */
3974 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3975 /* If this real decl matches the implicit, don't complain. */
3976 && ! (TREE_CODE (x
) == FUNCTION_DECL
3977 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3979 ("`%D' was previously implicitly declared to return `int'", x
);
3981 /* If new decl is `static' and an `extern' was seen previously,
3983 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3984 warn_extern_redeclared_static (x
, t
);
3988 /* Here to install a non-global value. */
3989 tree oldlocal
= IDENTIFIER_VALUE (name
);
3990 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3992 if (need_new_binding
)
3994 push_local_binding (name
, x
, 0);
3995 /* Because push_local_binding will hook X on to the
3996 current_binding_level's name list, we don't want to
3997 do that again below. */
3998 need_new_binding
= 0;
4001 /* If this is a TYPE_DECL, push it into the type value slot. */
4002 if (TREE_CODE (x
) == TYPE_DECL
)
4003 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4004 current_binding_level
);
4006 /* Clear out any TYPE_DECL shadowed by a namespace so that
4007 we won't think this is a type. The C struct hack doesn't
4008 go through namespaces. */
4009 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4010 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4011 current_binding_level
);
4013 /* If this is an extern function declaration, see if we
4014 have a global definition or declaration for the function. */
4015 if (oldlocal
== NULL_TREE
4016 && DECL_EXTERNAL (x
)
4017 && oldglobal
!= NULL_TREE
4018 && TREE_CODE (x
) == FUNCTION_DECL
4019 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4021 /* We have one. Their types must agree. */
4022 if (decls_match (x
, oldglobal
))
4026 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4027 cp_warning_at ("global declaration `%#D'", oldglobal
);
4030 /* If we have a local external declaration,
4031 and no file-scope declaration has yet been seen,
4032 then if we later have a file-scope decl it must not be static. */
4033 if (oldlocal
== NULL_TREE
4034 && oldglobal
== NULL_TREE
4035 && DECL_EXTERNAL (x
)
4037 TREE_PUBLIC (name
) = 1;
4039 if (DECL_FROM_INLINE (x
))
4040 /* Inline decls shadow nothing. */;
4042 /* Warn if shadowing an argument at the top level of the body. */
4043 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4044 && TREE_CODE (oldlocal
) == PARM_DECL
4045 /* Don't complain if it's from an enclosing function. */
4046 && DECL_CONTEXT (oldlocal
) == current_function_decl
4047 && TREE_CODE (x
) != PARM_DECL
)
4049 /* Go to where the parms should be and see if we
4051 struct binding_level
*b
= current_binding_level
->level_chain
;
4057 if (b
->parm_flag
== 1)
4058 cp_error ("declaration of `%#D' shadows a parameter", name
);
4060 else if (warn_shadow
&& oldlocal
!= NULL_TREE
4061 && current_binding_level
->is_for_scope
4062 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
4064 warning ("variable `%s' shadows local",
4065 IDENTIFIER_POINTER (name
));
4066 cp_warning_at (" this is the shadowed declaration", oldlocal
);
4068 /* Maybe warn if shadowing something else. */
4069 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4070 /* No shadow warnings for internally generated vars. */
4071 && ! DECL_ARTIFICIAL (x
)
4072 /* No shadow warnings for vars made for inlining. */
4073 && ! DECL_FROM_INLINE (x
))
4075 const char *warnstring
= NULL
;
4077 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4078 warnstring
= "declaration of `%s' shadows a parameter";
4079 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4080 && current_class_ptr
4081 && !TREE_STATIC (name
))
4082 warnstring
= "declaration of `%s' shadows a member of `this'";
4083 else if (oldlocal
!= NULL_TREE
)
4084 warnstring
= "declaration of `%s' shadows previous local";
4085 else if (oldglobal
!= NULL_TREE
)
4086 /* XXX shadow warnings in outer-more namespaces */
4087 warnstring
= "declaration of `%s' shadows global declaration";
4090 warning (warnstring
, IDENTIFIER_POINTER (name
));
4094 if (TREE_CODE (x
) == FUNCTION_DECL
)
4095 check_default_args (x
);
4097 /* Keep count of variables in this level with incomplete type. */
4098 if (TREE_CODE (x
) == VAR_DECL
4099 && TREE_TYPE (x
) != error_mark_node
4100 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4101 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4102 /* RTTI TD entries are created while defining the type_info. */
4103 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4104 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4105 current_binding_level
->incomplete
4106 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4109 if (need_new_binding
)
4110 add_decl_to_level (x
, current_binding_level
);
4115 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4116 caller to set DECL_CONTEXT properly. */
4119 pushdecl_with_scope (x
, level
)
4121 struct binding_level
*level
;
4123 register struct binding_level
*b
;
4124 tree function_decl
= current_function_decl
;
4126 current_function_decl
= NULL_TREE
;
4127 if (level
->parm_flag
== 2)
4129 b
= class_binding_level
;
4130 class_binding_level
= level
;
4131 pushdecl_class_level (x
);
4132 class_binding_level
= b
;
4136 b
= current_binding_level
;
4137 current_binding_level
= level
;
4139 current_binding_level
= b
;
4141 current_function_decl
= function_decl
;
4145 /* Like pushdecl, only it places X in the current namespace,
4149 pushdecl_namespace_level (x
)
4152 register struct binding_level
*b
= current_binding_level
;
4155 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4157 /* Now, the type_shadowed stack may screw us. Munge it so it does
4159 if (TREE_CODE (x
) == TYPE_DECL
)
4161 tree name
= DECL_NAME (x
);
4163 tree
*ptr
= (tree
*)0;
4164 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4166 tree shadowed
= b
->type_shadowed
;
4167 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4168 if (TREE_PURPOSE (shadowed
) == name
)
4170 ptr
= &TREE_VALUE (shadowed
);
4171 /* Can't break out of the loop here because sometimes
4172 a binding level will have duplicate bindings for
4173 PT names. It's gross, but I haven't time to fix it. */
4176 newval
= TREE_TYPE (x
);
4177 if (ptr
== (tree
*)0)
4179 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4180 up here if this is changed to an assertion. --KR */
4181 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4191 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4195 pushdecl_top_level (x
)
4198 tree cur_namespace
= current_namespace
;
4199 current_namespace
= global_namespace
;
4200 x
= pushdecl_namespace_level (x
);
4201 current_namespace
= cur_namespace
;
4205 /* Make the declaration of X appear in CLASS scope. */
4208 pushdecl_class_level (x
)
4211 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4212 scope looks for the pre-mangled name. */
4215 if (TREE_CODE (x
) == OVERLOAD
)
4216 x
= OVL_CURRENT (x
);
4217 name
= DECL_NAME (x
);
4221 push_class_level_binding (name
, x
);
4222 if (TREE_CODE (x
) == TYPE_DECL
)
4223 set_identifier_type_value (name
, TREE_TYPE (x
));
4225 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4229 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4232 pushdecl_class_level (f
);
4236 /* Enter DECL into the symbol table, if that's appropriate. Returns
4237 DECL, or a modified version thereof. */
4240 maybe_push_decl (decl
)
4243 tree type
= TREE_TYPE (decl
);
4245 /* Add this decl to the current binding level, but not if it comes
4246 from another scope, e.g. a static member variable. TEM may equal
4247 DECL or it may be a previous decl of the same name. */
4248 if ((TREE_CODE (decl
) != PARM_DECL
4249 && DECL_CONTEXT (decl
) != NULL_TREE
4250 /* Definitions of namespace members outside their namespace are
4252 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4253 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4254 || TREE_CODE (type
) == UNKNOWN_TYPE
4255 /* The declaration of a template specialization does not affect
4256 the functions available for overload resolution, so we do not
4258 || (TREE_CODE (decl
) == FUNCTION_DECL
4259 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4262 return pushdecl (decl
);
4266 /* This function is used to push the mangled decls for nested types into
4267 the appropriate scope. Previously pushdecl_top_level was used, but that
4268 is incorrect for members of local classes. */
4271 pushdecl_nonclass_level (x
)
4274 struct binding_level
*b
= current_binding_level
;
4276 my_friendly_assert (b
->parm_flag
!= 2, 180);
4279 /* Get out of template binding levels */
4280 while (b
->pseudo_global
)
4284 pushdecl_with_scope (x
, b
);
4288 /* Make the declaration(s) of X appear in CLASS scope
4289 under the name NAME. */
4292 push_class_level_binding (name
, x
)
4297 /* The class_binding_level will be NULL if x is a template
4298 parameter name in a member template. */
4299 if (!class_binding_level
)
4302 /* Make sure that this new member does not have the same name
4303 as a template parameter. */
4304 if (TYPE_BEING_DEFINED (current_class_type
))
4305 check_template_shadow (x
);
4307 /* If this declaration shadows a declaration from an enclosing
4308 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4309 we leave this class. Record the shadowed declaration here. */
4310 binding
= IDENTIFIER_BINDING (name
);
4312 && ((TREE_CODE (x
) == OVERLOAD
4313 && BINDING_VALUE (binding
)
4314 && is_overloaded_fn (BINDING_VALUE (binding
)))
4315 || INHERITED_VALUE_BINDING_P (binding
)))
4320 /* If the old binding was from a base class, and was for a tag
4321 name, slide it over to make room for the new binding. The
4322 old binding is still visible if explicitly qualified with a
4324 if (INHERITED_VALUE_BINDING_P (binding
)
4325 && BINDING_VALUE (binding
)
4326 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4327 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4328 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4330 old_decl
= BINDING_TYPE (binding
);
4331 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4332 BINDING_VALUE (binding
) = NULL_TREE
;
4333 INHERITED_VALUE_BINDING_P (binding
) = 0;
4336 old_decl
= BINDING_VALUE (binding
);
4338 /* There was already a binding for X containing fewer
4339 functions than are named in X. Find the previous
4340 declaration of X on the class-shadowed list, and update it. */
4341 for (shadow
= class_binding_level
->class_shadowed
;
4343 shadow
= TREE_CHAIN (shadow
))
4344 if (TREE_PURPOSE (shadow
) == name
4345 && TREE_TYPE (shadow
) == old_decl
)
4347 BINDING_VALUE (binding
) = x
;
4348 INHERITED_VALUE_BINDING_P (binding
) = 0;
4349 TREE_TYPE (shadow
) = x
;
4354 /* If we didn't replace an existing binding, put the binding on the
4355 stack of bindings for the identifier, and update
4356 IDENTIFIER_CLASS_VALUE. */
4357 if (push_class_binding (name
, x
))
4359 push_cache_obstack ();
4360 class_binding_level
->class_shadowed
4361 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4362 class_binding_level
->class_shadowed
);
4364 /* Record the value we are binding NAME to so that we can know
4365 what to pop later. */
4366 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4370 /* Insert another USING_DECL into the current binding level,
4371 returning this declaration. If this is a redeclaration,
4372 do nothing and return NULL_TREE. */
4375 push_using_decl (scope
, name
)
4381 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4382 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4383 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4384 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4388 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4389 DECL_INITIAL (decl
) = scope
;
4390 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4391 current_binding_level
->usings
= decl
;
4395 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4396 changed (i.e. there was already a directive), or the fresh
4397 TREE_LIST otherwise. */
4400 push_using_directive (used
)
4403 tree ud
= current_binding_level
->using_directives
;
4404 tree iter
, ancestor
;
4406 /* Check if we already have this. */
4407 if (purpose_member (used
, ud
) != NULL_TREE
)
4410 /* Recursively add all namespaces used. */
4411 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4412 push_using_directive (TREE_PURPOSE (iter
));
4414 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4415 ud
= current_binding_level
->using_directives
;
4416 ud
= tree_cons (used
, ancestor
, ud
);
4417 current_binding_level
->using_directives
= ud
;
4421 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4422 other definitions already in place. We get around this by making
4423 the value of the identifier point to a list of all the things that
4424 want to be referenced by that name. It is then up to the users of
4425 that name to decide what to do with that list.
4427 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4428 slot. It is dealt with the same way.
4430 FLAGS is a bitwise-or of the following values:
4431 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4433 PUSH_USING: DECL is being pushed as the result of a using
4436 The value returned may be a previous declaration if we guessed wrong
4437 about what language DECL should belong to (C or C++). Otherwise,
4438 it's always DECL (and never something that's not a _DECL). */
4441 push_overloaded_decl (decl
, flags
)
4445 tree name
= DECL_NAME (decl
);
4448 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4451 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4453 old
= lookup_name_current_level (name
);
4457 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4459 tree t
= TREE_TYPE (old
);
4460 if (IS_AGGR_TYPE (t
) && warn_shadow
4461 && (! DECL_IN_SYSTEM_HEADER (decl
)
4462 || ! DECL_IN_SYSTEM_HEADER (old
)))
4463 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4466 else if (is_overloaded_fn (old
))
4470 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4472 tree fn
= OVL_CURRENT (tmp
);
4474 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4475 && !(flags
& PUSH_USING
)
4476 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4477 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4478 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4481 if (duplicate_decls (decl
, fn
))
4487 cp_error_at ("previous non-function declaration `%#D'", old
);
4488 cp_error ("conflicts with function declaration `%#D'", decl
);
4493 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4495 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4496 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4498 new_binding
= ovl_cons (decl
, old
);
4499 if (flags
& PUSH_USING
)
4500 OVL_USED (new_binding
) = 1;
4503 /* NAME is not ambiguous. */
4507 set_namespace_binding (name
, current_namespace
, new_binding
);
4510 /* We only create an OVERLOAD if there was a previous binding at
4511 this level, or if decl is a template. In the former case, we
4512 need to remove the old binding and replace it with the new
4513 binding. We must also run through the NAMES on the binding
4514 level where the name was bound to update the chain. */
4516 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4520 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4522 d
= &TREE_CHAIN (*d
))
4524 || (TREE_CODE (*d
) == TREE_LIST
4525 && TREE_VALUE (*d
) == old
))
4527 if (TREE_CODE (*d
) == TREE_LIST
)
4528 /* Just replace the old binding with the new. */
4529 TREE_VALUE (*d
) = new_binding
;
4531 /* Build a TREE_LIST to wrap the OVERLOAD. */
4532 *d
= build_tree_list (NULL_TREE
, new_binding
);
4534 /* And update the CPLUS_BINDING node. */
4535 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4540 /* We should always find a previous binding in this case. */
4541 my_friendly_abort (0);
4544 /* Install the new binding. */
4545 push_local_binding (name
, new_binding
, flags
);
4551 /* Generate an implicit declaration for identifier FUNCTIONID
4552 as a function of type int (). Print a warning if appropriate. */
4555 implicitly_declare (functionid
)
4559 int temp
= allocation_temporary_p ();
4561 push_obstacks_nochange ();
4563 /* Save the decl permanently so we can warn if definition follows.
4564 In ANSI C, warn_implicit is usually false, so the saves little space.
4565 But in C++, it's usually true, hence the extra code. */
4566 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4567 end_temporary_allocation ();
4569 /* We used to reuse an old implicit decl here,
4570 but this loses with inline functions because it can clobber
4571 the saved decl chains. */
4572 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4574 DECL_EXTERNAL (decl
) = 1;
4575 TREE_PUBLIC (decl
) = 1;
4577 /* ANSI standard says implicit declarations are in the innermost block.
4578 So we record the decl in the standard fashion. */
4580 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4583 /* Only one warning per identifier. */
4584 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4586 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4589 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4596 /* Return zero if the declaration NEWDECL is valid
4597 when the declaration OLDDECL (assumed to be for the same name)
4598 has already been seen.
4599 Otherwise return an error message format string with a %s
4600 where the identifier should go. */
4603 redeclaration_error_message (newdecl
, olddecl
)
4604 tree newdecl
, olddecl
;
4606 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4608 /* Because C++ can put things into name space for free,
4609 constructs like "typedef struct foo { ... } foo"
4610 would look like an erroneous redeclaration. */
4611 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4614 return "redefinition of `%#D'";
4616 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4618 /* If this is a pure function, its olddecl will actually be
4619 the original initialization to `0' (which we force to call
4620 abort()). Don't complain about redefinition in this case. */
4621 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4624 /* If both functions come from different namespaces, this is not
4625 a redeclaration - this is a conflict with a used function. */
4626 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4627 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4628 return "`%D' conflicts with used function";
4630 /* We'll complain about linkage mismatches in
4631 warn_extern_redeclared_static. */
4633 /* Defining the same name twice is no good. */
4634 if (DECL_INITIAL (olddecl
) != NULL_TREE
4635 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4637 if (DECL_NAME (olddecl
) == NULL_TREE
)
4638 return "`%#D' not declared in class";
4640 return "redefinition of `%#D'";
4644 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4646 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4647 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4648 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4649 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4650 && TYPE_SIZE (TREE_TYPE (newdecl
))
4651 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4652 return "redefinition of `%#D'";
4655 else if (toplevel_bindings_p ())
4657 /* Objects declared at top level: */
4658 /* If at least one is a reference, it's ok. */
4659 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4661 /* Reject two definitions. */
4662 return "redefinition of `%#D'";
4666 /* Objects declared with block scope: */
4667 /* Reject two definitions, and reject a definition
4668 together with an external reference. */
4669 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4670 return "redeclaration of `%#D'";
4675 /* Create a new label, named ID. */
4678 make_label_decl (id
, local_p
)
4684 if (building_stmt_tree ())
4685 push_permanent_obstack ();
4686 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4687 if (building_stmt_tree ())
4690 /* Make sure every label has an rtx. */
4693 DECL_CONTEXT (decl
) = current_function_decl
;
4694 DECL_MODE (decl
) = VOIDmode
;
4695 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4697 /* Say where one reference is to the label, for the sake of the
4698 error if it is not defined. */
4699 DECL_SOURCE_LINE (decl
) = lineno
;
4700 DECL_SOURCE_FILE (decl
) = input_filename
;
4702 /* Record the fact that this identifier is bound to this label. */
4703 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4705 /* Record this label on the list of used labels so that we can check
4706 at the end of the function to see whether or not the label was
4707 actually defined. */
4708 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4709 && (named_label_uses
== NULL
4710 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4711 || named_label_uses
->label_decl
!= decl
))
4713 struct named_label_list
*new_ent
;
4715 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4716 new_ent
->label_decl
= decl
;
4717 new_ent
->names_in_scope
= current_binding_level
->names
;
4718 new_ent
->binding_level
= current_binding_level
;
4719 new_ent
->lineno_o_goto
= lineno
;
4720 new_ent
->filename_o_goto
= input_filename
;
4721 new_ent
->next
= named_label_uses
;
4722 named_label_uses
= new_ent
;
4728 /* Look for a label named ID in the current function. If one cannot
4729 be found, create one. (We keep track of used, but undefined,
4730 labels, and complain about them at the end of a function.) */
4738 /* You can't use labels at global scope. */
4739 if (current_function_decl
== NULL_TREE
)
4741 error ("label `%s' referenced outside of any function",
4742 IDENTIFIER_POINTER (id
));
4746 /* See if we've already got this label. */
4747 decl
= IDENTIFIER_LABEL_VALUE (id
);
4748 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4751 /* Record this label on the list of labels used in this function.
4752 We do this before calling make_label_decl so that we get the
4753 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4754 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4756 /* We need a new label. */
4757 decl
= make_label_decl (id
, /*local_p=*/0);
4758 /* Now fill in the information we didn't have before. */
4759 TREE_VALUE (named_labels
) = decl
;
4764 /* Declare a local label named ID. */
4767 declare_local_label (id
)
4772 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4773 this scope we can restore the old value of
4774 IDENTIFIER_TYPE_VALUE. */
4775 current_binding_level
->shadowed_labels
4776 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4777 current_binding_level
->shadowed_labels
);
4778 /* Look for the label. */
4779 decl
= make_label_decl (id
, /*local_p=*/1);
4780 /* Now fill in the information we didn't have before. */
4781 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4786 /* Define a label, specifying the location in the source file.
4787 Return the LABEL_DECL node for the label, if the definition is valid.
4788 Otherwise return 0. */
4791 define_label (filename
, line
, name
)
4796 tree decl
= lookup_label (name
);
4798 /* After labels, make any new cleanups go into their
4799 own new (temporary) binding contour. */
4800 current_binding_level
->more_cleanups_ok
= 0;
4802 if (name
== get_identifier ("wchar_t"))
4803 cp_pedwarn ("label named wchar_t");
4805 if (DECL_INITIAL (decl
) != NULL_TREE
)
4807 cp_error ("duplicate label `%D'", decl
);
4812 struct named_label_list
*uses
, *prev
;
4816 /* Mark label as having been defined. */
4817 DECL_INITIAL (decl
) = error_mark_node
;
4818 /* Say where in the source. */
4819 DECL_SOURCE_FILE (decl
) = filename
;
4820 DECL_SOURCE_LINE (decl
) = line
;
4823 uses
= named_label_uses
;
4824 while (uses
!= NULL
)
4825 if (uses
->label_decl
== decl
)
4827 struct binding_level
*b
= current_binding_level
;
4830 tree new_decls
= b
->names
;
4831 tree old_decls
= (b
== uses
->binding_level
)
4832 ? uses
->names_in_scope
: NULL_TREE
;
4833 while (new_decls
!= old_decls
)
4835 if (TREE_CODE (new_decls
) == VAR_DECL
4836 /* Don't complain about crossing initialization
4837 of internal entities. They can't be accessed,
4838 and they should be cleaned up
4839 by the time we get to the label. */
4840 && ! DECL_ARTIFICIAL (new_decls
)
4841 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4842 && pod_type_p (TREE_TYPE (new_decls
))))
4844 /* This is really only important if we're crossing
4845 an initialization. The POD stuff is just
4846 pedantry; why should it matter if the class
4847 contains a field of pointer to member type? */
4848 int problem
= (DECL_INITIAL (new_decls
)
4849 || (TYPE_NEEDS_CONSTRUCTING
4850 (TREE_TYPE (new_decls
))));
4856 cp_error ("jump to label `%D'", decl
);
4857 error_with_file_and_line
4858 (uses
->filename_o_goto
,
4859 uses
->lineno_o_goto
, " from here");
4863 cp_pedwarn ("jump to label `%D'", decl
);
4864 pedwarn_with_file_and_line
4865 (uses
->filename_o_goto
,
4866 uses
->lineno_o_goto
, " from here");
4872 cp_error_at (" crosses initialization of `%#D'",
4875 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4878 new_decls
= TREE_CHAIN (new_decls
);
4880 if (b
== uses
->binding_level
)
4882 if (b
->eh_region
&& ! saw_eh
)
4886 cp_error ("jump to label `%D'", decl
);
4887 error_with_file_and_line
4888 (uses
->filename_o_goto
,
4889 uses
->lineno_o_goto
, " from here");
4892 error (" enters exception handling block");
4899 prev
->next
= uses
->next
;
4901 named_label_uses
= uses
->next
;
4910 current_function_return_value
= NULL_TREE
;
4917 struct binding_level
*level
;
4918 struct cp_switch
*next
;
4921 static struct cp_switch
*switch_stack
;
4927 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4928 p
->level
= current_binding_level
;
4929 p
->next
= switch_stack
;
4936 switch_stack
= switch_stack
->next
;
4939 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4940 /* XXX Note decl is never actually used. (bpk) */
4943 define_case_label ()
4945 tree cleanup
= last_cleanup_this_contour ();
4946 struct binding_level
*b
= current_binding_level
;
4951 static int explained
= 0;
4952 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4953 warning ("where case label appears here");
4956 warning ("(enclose actions of previous case statements requiring");
4957 warning ("destructors in their own binding contours.)");
4962 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4964 tree new_decls
= b
->names
;
4965 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4967 if (TREE_CODE (new_decls
) == VAR_DECL
4968 /* Don't complain about crossing initialization
4969 of internal entities. They can't be accessed,
4970 and they should be cleaned up
4971 by the time we get to the label. */
4972 && ! DECL_ARTIFICIAL (new_decls
)
4973 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4974 && DECL_INITIAL (new_decls
) != error_mark_node
)
4975 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4978 error ("jump to case label");
4980 cp_error_at (" crosses initialization of `%#D'",
4986 /* After labels, make any new cleanups go into their
4987 own new (temporary) binding contour. */
4989 current_binding_level
->more_cleanups_ok
= 0;
4990 current_function_return_value
= NULL_TREE
;
4993 /* Return the list of declarations of the current level.
4994 Note that this list is in reverse order unless/until
4995 you nreverse it; and when you do nreverse it, you must
4996 store the result back using `storedecls' or you will lose. */
5001 return current_binding_level
->names
;
5004 /* Return the list of type-tags (for structs, etc) of the current level. */
5009 return current_binding_level
->tags
;
5012 /* Store the list of declarations of the current level.
5013 This is done for the parameter declarations of a function being defined,
5014 after they are modified in the light of any missing parameters. */
5020 current_binding_level
->names
= decls
;
5023 /* Similarly, store the list of tags of the current level. */
5029 current_binding_level
->tags
= tags
;
5032 /* Given NAME, an IDENTIFIER_NODE,
5033 return the structure (or union or enum) definition for that name.
5034 Searches binding levels from BINDING_LEVEL up to the global level.
5035 If THISLEVEL_ONLY is nonzero, searches only the specified context
5036 (but skips any tag-transparent contexts to find one that is
5037 meaningful for tags).
5038 FORM says which kind of type the caller wants;
5039 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5040 If the wrong kind of type is found, and it's not a template, an error is
5044 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5045 enum tree_code form
;
5047 struct binding_level
*binding_level
;
5050 register struct binding_level
*level
;
5051 /* Non-zero if, we should look past a pseudo-global level, even if
5053 int allow_pseudo_global
= 1;
5055 for (level
= binding_level
; level
; level
= level
->level_chain
)
5058 if (ANON_AGGRNAME_P (name
))
5059 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5061 /* There's no need for error checking here, because
5062 anon names are unique throughout the compilation. */
5063 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5064 return TREE_VALUE (tail
);
5066 else if (level
->namespace_p
)
5067 /* Do namespace lookup. */
5068 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5070 tree old
= binding_for_name (name
, tail
);
5072 /* If we just skipped past a pseudo global level, even
5073 though THISLEVEL_ONLY, and we find a template class
5074 declaration, then we use the _TYPE node for the
5075 template. See the example below. */
5076 if (thislevel_only
&& !allow_pseudo_global
5077 && old
&& BINDING_VALUE (old
)
5078 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5079 old
= TREE_TYPE (BINDING_VALUE (old
));
5081 old
= BINDING_TYPE (old
);
5083 /* If it has an original type, it is a typedef, and we
5084 should not return it. */
5085 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5087 if (old
&& TREE_CODE (old
) != form
5088 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5090 cp_error ("`%#D' redeclared as %C", old
, form
);
5095 if (thislevel_only
|| tail
== global_namespace
)
5099 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5101 if (TREE_PURPOSE (tail
) == name
)
5103 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5104 /* Should tighten this up; it'll probably permit
5105 UNION_TYPE and a struct template, for example. */
5107 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5109 /* Definition isn't the kind we were looking for. */
5110 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5114 return TREE_VALUE (tail
);
5117 if (thislevel_only
&& ! level
->tag_transparent
)
5119 if (level
->pseudo_global
&& allow_pseudo_global
)
5121 /* We must deal with cases like this:
5123 template <class T> struct S;
5124 template <class T> struct S {};
5126 When looking up `S', for the second declaration, we
5127 would like to find the first declaration. But, we
5128 are in the pseudo-global level created for the
5129 template parameters, rather than the (surrounding)
5130 namespace level. Thus, we keep going one more level,
5131 even though THISLEVEL_ONLY is non-zero. */
5132 allow_pseudo_global
= 0;
5144 set_current_level_tags_transparency (tags_transparent
)
5145 int tags_transparent
;
5147 current_binding_level
->tag_transparent
= tags_transparent
;
5151 /* Given a type, find the tag that was defined for it and return the tag name.
5152 Otherwise return 0. However, the value can never be 0
5153 in the cases in which this is used.
5155 C++: If NAME is non-zero, this is the new name to install. This is
5156 done when replacing anonymous tags with real tag names. */
5159 lookup_tag_reverse (type
, name
)
5163 register struct binding_level
*level
;
5165 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5168 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5170 if (TREE_VALUE (tail
) == type
)
5173 TREE_PURPOSE (tail
) = name
;
5174 return TREE_PURPOSE (tail
);
5181 /* Look up NAME in the NAMESPACE. */
5184 lookup_namespace_name (namespace, name
)
5185 tree
namespace, name
;
5188 tree template_id
= NULL_TREE
;
5190 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5192 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5193 /* This happens for A::B<int> when B is a namespace. */
5195 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5197 /* This happens for A::B where B is a template, and there are no
5198 template arguments. */
5199 cp_error ("invalid use of `%D'", name
);
5200 return error_mark_node
;
5203 namespace = ORIGINAL_NAMESPACE (namespace);
5205 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5208 name
= TREE_OPERAND (name
, 0);
5209 if (TREE_CODE (name
) == OVERLOAD
)
5210 name
= DECL_NAME (OVL_CURRENT (name
));
5211 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5212 name
= DECL_NAME (name
);
5215 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5217 val
= make_node (CPLUS_BINDING
);
5218 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5219 return error_mark_node
;
5221 if (BINDING_VALUE (val
))
5223 val
= BINDING_VALUE (val
);
5227 if (DECL_CLASS_TEMPLATE_P (val
))
5228 val
= lookup_template_class (val
,
5229 TREE_OPERAND (template_id
, 1),
5230 /*in_decl=*/NULL_TREE
,
5231 /*context=*/NULL_TREE
,
5232 /*entering_scope=*/0);
5233 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5234 || TREE_CODE (val
) == OVERLOAD
)
5235 val
= lookup_template_function (val
,
5236 TREE_OPERAND (template_id
, 1));
5239 cp_error ("`%D::%D' is not a template",
5241 return error_mark_node
;
5245 /* If we have a single function from a using decl, pull it out. */
5246 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5247 val
= OVL_FUNCTION (val
);
5251 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5252 return error_mark_node
;
5255 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5257 static unsigned long
5265 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5266 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5271 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5274 typename_compare (k1
, k2
)
5285 d1
= TYPE_NAME (t1
);
5286 d2
= TYPE_NAME (t2
);
5288 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5289 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5290 && ((TREE_TYPE (t1
) != NULL_TREE
)
5291 == (TREE_TYPE (t2
) != NULL_TREE
))
5292 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5293 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5296 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5297 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5298 is non-NULL, this type is being created by the implicit typename
5299 extension, and BASE_TYPE is a type named `t' in some base class of
5300 `T' which depends on template parameters.
5302 Returns the new TYPENAME_TYPE. */
5305 build_typename_type (context
, name
, fullname
, base_type
)
5313 struct hash_entry
* e
;
5315 static struct hash_table ht
;
5317 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5321 static struct hash_table
*h
= &ht
;
5322 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5324 fatal ("virtual memory exhausted");
5325 ggc_add_tree_hash_table_root (&h
, 1);
5328 /* Build the TYPENAME_TYPE. */
5329 t
= make_lang_type (TYPENAME_TYPE
);
5330 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5331 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5332 TREE_TYPE (t
) = base_type
;
5334 /* Build the corresponding TYPE_DECL. */
5335 d
= build_decl (TYPE_DECL
, name
, t
);
5336 TYPE_NAME (TREE_TYPE (d
)) = d
;
5337 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5338 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5339 DECL_ARTIFICIAL (d
) = 1;
5341 /* See if we already have this type. */
5342 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5346 /* Insert the type into the table. */
5347 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5355 make_typename_type (context
, name
)
5360 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5362 if (!(TYPE_LANG_SPECIFIC (name
)
5363 && (CLASSTYPE_IS_TEMPLATE (name
)
5364 || CLASSTYPE_USE_TEMPLATE (name
))))
5365 name
= TYPE_IDENTIFIER (name
);
5367 /* Create a TEMPLATE_ID_EXPR for the type. */
5368 name
= build_nt (TEMPLATE_ID_EXPR
,
5369 CLASSTYPE_TI_TEMPLATE (name
),
5370 CLASSTYPE_TI_ARGS (name
));
5372 else if (TREE_CODE (name
) == TYPE_DECL
)
5373 name
= DECL_NAME (name
);
5377 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5379 name
= TREE_OPERAND (name
, 0);
5380 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5381 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5383 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5384 my_friendly_abort (2000);
5386 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5388 /* We can get here from typename_sub0 in the explicit_template_type
5389 expansion. Just fail. */
5390 cp_error ("no class template named `%#T' in `%#T'",
5392 return error_mark_node
;
5395 if (! uses_template_parms (context
)
5396 || currently_open_class (context
))
5398 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5400 tree tmpl
= NULL_TREE
;
5401 if (IS_AGGR_TYPE (context
))
5402 tmpl
= lookup_field (context
, name
, 0, 0);
5403 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5405 cp_error ("no class template named `%#T' in `%#T'",
5407 return error_mark_node
;
5410 return lookup_template_class (tmpl
,
5411 TREE_OPERAND (fullname
, 1),
5413 /*entering_scope=*/0);
5419 if (!IS_AGGR_TYPE (context
))
5421 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5422 return error_mark_node
;
5425 t
= lookup_field (context
, name
, 0, 1);
5427 return TREE_TYPE (t
);
5431 /* If the CONTEXT is not a template type, then either the field is
5432 there now or its never going to be. */
5433 if (!uses_template_parms (context
))
5435 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5436 return error_mark_node
;
5440 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5443 /* Select the right _DECL from multiple choices. */
5446 select_decl (binding
, flags
)
5451 val
= BINDING_VALUE (binding
);
5452 if (LOOKUP_NAMESPACES_ONLY (flags
))
5454 /* We are not interested in types. */
5455 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5460 /* If we could have a type and
5461 we have nothing or we need a type and have none. */
5462 if (BINDING_TYPE (binding
)
5463 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5464 && TREE_CODE (val
) != TYPE_DECL
)))
5465 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5466 /* Don't return non-types if we really prefer types. */
5467 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5468 && (TREE_CODE (val
) != TEMPLATE_DECL
5469 || !DECL_CLASS_TEMPLATE_P (val
)))
5475 /* Unscoped lookup of a global: iterate over current namespaces,
5476 considering using-directives. If SPACESP is non-NULL, store a list
5477 of the namespaces we've considered in it. */
5480 unqualified_namespace_lookup (name
, flags
, spacesp
)
5485 tree b
= make_node (CPLUS_BINDING
);
5486 tree initial
= current_decl_namespace();
5487 tree scope
= initial
;
5489 struct binding_level
*level
;
5490 tree val
= NULL_TREE
;
5493 *spacesp
= NULL_TREE
;
5495 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5498 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5499 val
= binding_for_name (name
, scope
);
5501 /* Initialize binding for this context. */
5502 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5503 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5505 /* Add all _DECLs seen through local using-directives. */
5506 for (level
= current_binding_level
;
5507 !level
->namespace_p
;
5508 level
= level
->level_chain
)
5509 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5510 scope
, flags
, spacesp
))
5511 /* Give up because of error. */
5512 return error_mark_node
;
5514 /* Add all _DECLs seen through global using-directives. */
5515 /* XXX local and global using lists should work equally. */
5519 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5520 scope
, flags
, spacesp
))
5521 /* Give up because of error. */
5522 return error_mark_node
;
5523 if (siter
== scope
) break;
5524 siter
= CP_DECL_CONTEXT (siter
);
5527 val
= select_decl (b
, flags
);
5528 if (scope
== global_namespace
)
5534 /* Combine prefer_type and namespaces_only into flags. */
5537 lookup_flags (prefer_type
, namespaces_only
)
5538 int prefer_type
, namespaces_only
;
5540 if (namespaces_only
)
5541 return LOOKUP_PREFER_NAMESPACES
;
5542 if (prefer_type
> 1)
5543 return LOOKUP_PREFER_TYPES
;
5544 if (prefer_type
> 0)
5545 return LOOKUP_PREFER_BOTH
;
5549 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5550 ignore it or not. Subroutine of lookup_name_real. */
5553 qualify_lookup (val
, flags
)
5557 if (val
== NULL_TREE
)
5559 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5561 if ((flags
& LOOKUP_PREFER_TYPES
)
5562 && (TREE_CODE (val
) == TYPE_DECL
5563 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5564 && DECL_CLASS_TEMPLATE_P (val
))))
5566 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5571 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5575 warn_about_implicit_typename_lookup (typename
, binding
)
5579 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5580 tree name
= DECL_NAME (typename
);
5582 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5583 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5584 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5585 && ! (TREE_CODE (binding
) == TYPE_DECL
5586 && same_type_p (TREE_TYPE (binding
), subtype
)))
5588 cp_warning ("lookup of `%D' finds `%#D'",
5590 cp_warning (" instead of `%D' from dependent base class",
5592 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5593 constructor_name (current_class_type
), name
);
5597 /* Look up NAME in the current binding level and its superiors in the
5598 namespace of variables, functions and typedefs. Return a ..._DECL
5599 node of some kind representing its definition if there is only one
5600 such declaration, or return a TREE_LIST with all the overloaded
5601 definitions if there are many, or return 0 if it is undefined.
5603 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5604 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5605 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5606 Otherwise we prefer non-TYPE_DECLs.
5608 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5609 using IDENTIFIER_CLASS_VALUE. */
5612 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5614 int prefer_type
, nonclass
, namespaces_only
;
5617 tree val
= NULL_TREE
;
5619 tree from_obj
= NULL_TREE
;
5621 int val_is_implicit_typename
= 0;
5623 /* Hack: copy flag set by parser, if set. */
5624 if (only_namespace_names
)
5625 namespaces_only
= 1;
5627 if (prefer_type
== -2)
5629 extern int looking_for_typename
;
5630 tree type
= NULL_TREE
;
5633 prefer_type
= looking_for_typename
;
5635 flags
= lookup_flags (prefer_type
, namespaces_only
);
5636 /* If the next thing is '<', class templates are types. */
5637 if (looking_for_template
)
5638 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5640 /* std:: becomes :: for now. */
5641 if (got_scope
== std_node
)
5642 got_scope
= void_type_node
;
5646 else if (got_object
!= error_mark_node
)
5651 if (type
== error_mark_node
)
5652 return error_mark_node
;
5653 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5654 type
= TREE_TYPE (type
);
5657 type
= complete_type (type
);
5659 if (TREE_CODE (type
) == VOID_TYPE
)
5660 type
= global_namespace
;
5661 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5663 val
= make_node (CPLUS_BINDING
);
5664 flags
|= LOOKUP_COMPLAIN
;
5665 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5667 val
= select_decl (val
, flags
);
5669 else if (! IS_AGGR_TYPE (type
)
5670 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5671 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5672 || TREE_CODE (type
) == TYPENAME_TYPE
)
5673 /* Someone else will give an error about this if needed. */
5675 else if (type
== current_class_type
)
5676 val
= IDENTIFIER_CLASS_VALUE (name
);
5678 val
= lookup_member (type
, name
, 0, prefer_type
);
5685 else if (got_object
&& val
)
5690 flags
= lookup_flags (prefer_type
, namespaces_only
);
5691 /* If we're not parsing, we need to complain. */
5692 flags
|= LOOKUP_COMPLAIN
;
5695 /* First, look in non-namespace scopes. */
5697 if (current_class_type
== NULL_TREE
)
5700 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5704 if (!LOCAL_BINDING_P (t
) && nonclass
)
5705 /* We're not looking for class-scoped bindings, so keep going. */
5708 /* If this is the kind of thing we're looking for, we're done. */
5709 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5710 binding
= BINDING_VALUE (t
);
5711 else if ((flags
& LOOKUP_PREFER_TYPES
)
5712 && qualify_lookup (BINDING_TYPE (t
), flags
))
5713 binding
= BINDING_TYPE (t
);
5715 binding
= NULL_TREE
;
5718 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5720 if (val_is_implicit_typename
&& !yylex
)
5721 warn_about_implicit_typename_lookup (val
, binding
);
5723 val_is_implicit_typename
5724 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5725 if (!val_is_implicit_typename
)
5730 /* Now lookup in namespace scopes. */
5731 if (!val
|| val_is_implicit_typename
)
5733 t
= unqualified_namespace_lookup (name
, flags
, 0);
5736 if (val_is_implicit_typename
&& !yylex
)
5737 warn_about_implicit_typename_lookup (val
, t
);
5745 /* This should only warn about types used in qualified-ids. */
5746 if (from_obj
&& from_obj
!= val
)
5748 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5749 && TREE_CODE (val
) == TYPE_DECL
5750 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5752 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5753 name
, got_object
, TREE_TYPE (from_obj
));
5754 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5758 /* We don't change val to from_obj if got_object depends on
5759 template parms because that breaks implicit typename for
5760 destructor calls. */
5761 if (! uses_template_parms (got_object
))
5765 /* If we have a single function from a using decl, pull it out. */
5766 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5767 val
= OVL_FUNCTION (val
);
5776 lookup_name_nonclass (name
)
5779 return lookup_name_real (name
, 0, 1, 0);
5783 lookup_function_nonclass (name
, args
)
5787 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5791 lookup_name_namespace_only (name
)
5794 /* type-or-namespace, nonclass, namespace_only */
5795 return lookup_name_real (name
, 1, 1, 1);
5799 lookup_name (name
, prefer_type
)
5803 return lookup_name_real (name
, prefer_type
, 0, 0);
5806 /* Similar to `lookup_name' but look only in the innermost non-class
5810 lookup_name_current_level (name
)
5813 struct binding_level
*b
;
5816 b
= current_binding_level
;
5817 while (b
->parm_flag
== 2)
5822 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5824 /* extern "C" function() */
5825 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5828 else if (IDENTIFIER_BINDING (name
)
5829 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5833 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5834 return IDENTIFIER_VALUE (name
);
5846 /* Like lookup_name_current_level, but for types. */
5849 lookup_type_current_level (name
)
5852 register tree t
= NULL_TREE
;
5854 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5856 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5857 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5859 struct binding_level
*b
= current_binding_level
;
5862 if (purpose_member (name
, b
->type_shadowed
))
5863 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5875 begin_only_namespace_names ()
5877 only_namespace_names
= 1;
5881 end_only_namespace_names ()
5883 only_namespace_names
= 0;
5886 /* Arrange for the user to get a source line number, even when the
5887 compiler is going down in flames, so that she at least has a
5888 chance of working around problems in the compiler. We used to
5889 call error(), but that let the segmentation fault continue
5890 through; now, it's much more passive by asking them to send the
5891 maintainers mail about the problem. */
5895 int sig ATTRIBUTE_UNUSED
;
5897 signal (SIGSEGV
, SIG_DFL
);
5899 signal (SIGIOT
, SIG_DFL
);
5902 signal (SIGILL
, SIG_DFL
);
5905 signal (SIGABRT
, SIG_DFL
);
5908 signal (SIGBUS
, SIG_DFL
);
5910 my_friendly_abort (0);
5913 /* Push the declarations of builtin types into the namespace.
5914 RID_INDEX, if < RID_MAX is the index of the builtin type
5915 in the array RID_POINTERS. NAME is the name used when looking
5916 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5919 record_builtin_type (rid_index
, name
, type
)
5924 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5925 tree tdecl
= NULL_TREE
;
5927 if ((int) rid_index
< (int) RID_MAX
)
5928 rname
= ridpointers
[(int) rid_index
];
5930 tname
= get_identifier (name
);
5932 TYPE_BUILT_IN (type
) = 1;
5936 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5937 set_identifier_type_value (tname
, NULL_TREE
);
5938 if ((int) rid_index
< (int) RID_MAX
)
5939 /* Built-in types live in the global namespace. */
5940 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5942 if (rname
!= NULL_TREE
)
5944 if (tname
!= NULL_TREE
)
5946 set_identifier_type_value (rname
, NULL_TREE
);
5947 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5951 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5952 set_identifier_type_value (rname
, NULL_TREE
);
5957 /* Record one of the standard Java types.
5958 * Declare it as having the given NAME.
5959 * If SIZE > 0, it is the size of one of the integral types;
5960 * otherwise it is the negative of the size of one of the other types. */
5963 record_builtin_java_type (name
, size
)
5969 type
= make_signed_type (size
);
5970 else if (size
> -32)
5971 { /* "__java_char" or ""__java_boolean". */
5972 type
= make_unsigned_type (-size
);
5973 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5976 { /* "__java_float" or ""__java_double". */
5977 type
= make_node (REAL_TYPE
);
5978 TYPE_PRECISION (type
) = - size
;
5981 record_builtin_type (RID_MAX
, name
, type
);
5982 decl
= TYPE_NAME (type
);
5984 /* Suppress generate debug symbol entries for these types,
5985 since for normal C++ they are just clutter.
5986 However, push_lang_context undoes this if extern "Java" is seen. */
5987 DECL_IGNORED_P (decl
) = 1;
5989 TYPE_FOR_JAVA (type
) = 1;
5993 /* Push a type into the namespace so that the back-ends ignore it. */
5996 record_unknown_type (type
, name
)
6000 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6001 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6002 DECL_IGNORED_P (decl
) = 1;
6003 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6004 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6005 TYPE_ALIGN (type
) = 1;
6006 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6009 /* Push overloaded decl, in global scope, with one argument so it
6010 can be used as a callback from define_function. */
6013 push_overloaded_decl_1 (x
)
6016 push_overloaded_decl (x
, PUSH_GLOBAL
);
6023 auto_function (name
, type
, code
)
6025 enum built_in_function code
;
6027 return define_function
6028 (IDENTIFIER_POINTER (name
), type
, code
, push_overloaded_decl_1
,
6029 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
6033 /* Create the predefined scalar types of C,
6034 and some nodes representing standard constants (0, 1, (void *)0).
6035 Initialize the global binding level.
6036 Make definitions for built-in primitive functions. */
6039 init_decl_processing ()
6042 int wchar_type_size
;
6043 tree array_domain_type
;
6045 /* Have to make these distinct before we try using them. */
6046 lang_name_cplusplus
= get_identifier ("C++");
6047 lang_name_c
= get_identifier ("C");
6048 lang_name_java
= get_identifier ("Java");
6050 /* Let the back-end now how to save and restore language-specific
6051 per-function globals. */
6052 init_lang_status
= &push_cp_function_context
;
6053 free_lang_status
= &pop_cp_function_context
;
6054 mark_lang_status
= &mark_cp_function_context
;
6060 /* Create the global variables. */
6061 push_to_top_level ();
6063 /* Enter the global namespace. */
6064 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6065 push_namespace (get_identifier ("::"));
6066 global_namespace
= current_namespace
;
6067 current_lang_name
= NULL_TREE
;
6069 if (flag_strict_prototype
== 2)
6070 flag_strict_prototype
= pedantic
;
6071 if (! flag_permissive
&& ! pedantic
)
6072 flag_pedantic_errors
= 1;
6074 strict_prototypes_lang_c
= flag_strict_prototype
;
6077 current_lang_name
= lang_name_c
;
6079 current_function_decl
= NULL_TREE
;
6080 current_binding_level
= NULL_BINDING_LEVEL
;
6081 free_binding_level
= NULL_BINDING_LEVEL
;
6083 /* Because most segmentation signals can be traced back into user
6084 code, catch them and at least give the user a chance of working
6085 around compiler bugs. */
6086 signal (SIGSEGV
, signal_catch
);
6088 /* We will also catch aborts in the back-end through signal_catch and
6089 give the user a chance to see where the error might be, and to defeat
6090 aborts in the back-end when there have been errors previously in their
6093 signal (SIGIOT
, signal_catch
);
6096 signal (SIGILL
, signal_catch
);
6099 signal (SIGABRT
, signal_catch
);
6102 signal (SIGBUS
, signal_catch
);
6105 gcc_obstack_init (&decl_obstack
);
6107 /* Must lay these out before anything else gets laid out. */
6108 error_mark_node
= make_node (ERROR_MARK
);
6109 TREE_PERMANENT (error_mark_node
) = 1;
6110 TREE_TYPE (error_mark_node
) = error_mark_node
;
6111 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6112 TREE_TYPE (error_mark_list
) = error_mark_node
;
6114 /* Make the binding_level structure for global names. */
6116 global_binding_level
= current_binding_level
;
6117 /* The global level is the namespace level of ::. */
6118 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6119 declare_namespace_level ();
6121 this_identifier
= get_identifier (THIS_NAME
);
6122 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6123 ctor_identifier
= get_identifier (CTOR_NAME
);
6124 dtor_identifier
= get_identifier (DTOR_NAME
);
6125 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6126 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6127 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6128 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6129 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6131 /* Define `int' and `char' first so that dbx will output them first. */
6133 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
6134 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6136 /* Define `char', which is like either `signed char' or `unsigned char'
6137 but not the same as either. */
6141 ? make_signed_type (CHAR_TYPE_SIZE
)
6142 : make_unsigned_type (CHAR_TYPE_SIZE
));
6143 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6145 /* `signed' is the same as `int' */
6146 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6148 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
6149 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6151 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
6152 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6154 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
6155 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6156 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6158 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
6159 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6161 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
6162 record_builtin_type (RID_MAX
, "long long unsigned int",
6163 long_long_unsigned_type_node
);
6164 record_builtin_type (RID_MAX
, "long long unsigned",
6165 long_long_unsigned_type_node
);
6167 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
6168 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6169 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
6170 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6171 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6173 /* `unsigned long' is the standard type for sizeof.
6174 Note that stddef.h uses `unsigned long',
6175 and this must agree, even if long and int are the same size. */
6177 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6180 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6182 /* Define both `signed char' and `unsigned char'. */
6183 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
6184 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6185 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
6186 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6188 /* Create the widest literal types. */
6189 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6190 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6191 widest_integer_literal_type_node
));
6193 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6194 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6195 widest_unsigned_literal_type_node
));
6197 /* These are types that type_for_size and type_for_mode use. */
6198 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
6199 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6200 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
6201 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6202 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
6203 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6204 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
6205 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6206 #if HOST_BITS_PER_WIDE_INT >= 64
6207 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
6208 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6210 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
6211 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6212 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
6213 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6214 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
6215 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6216 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
6217 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6218 #if HOST_BITS_PER_WIDE_INT >= 64
6219 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
6220 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6223 float_type_node
= make_node (REAL_TYPE
);
6224 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
6225 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6226 layout_type (float_type_node
);
6228 double_type_node
= make_node (REAL_TYPE
);
6229 if (flag_short_double
)
6230 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
6232 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
6233 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6234 layout_type (double_type_node
);
6236 long_double_type_node
= make_node (REAL_TYPE
);
6237 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
6238 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6239 layout_type (long_double_type_node
);
6241 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
6242 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6243 complex_integer_type_node
));
6244 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
6245 layout_type (complex_integer_type_node
);
6247 complex_float_type_node
= make_node (COMPLEX_TYPE
);
6248 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6249 complex_float_type_node
));
6250 TREE_TYPE (complex_float_type_node
) = float_type_node
;
6251 layout_type (complex_float_type_node
);
6253 complex_double_type_node
= make_node (COMPLEX_TYPE
);
6254 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6255 complex_double_type_node
));
6256 TREE_TYPE (complex_double_type_node
) = double_type_node
;
6257 layout_type (complex_double_type_node
);
6259 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
6260 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6261 complex_long_double_type_node
));
6262 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
6263 layout_type (complex_long_double_type_node
);
6265 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6266 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6267 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6268 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6269 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6270 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6271 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6272 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6274 integer_zero_node
= build_int_2 (0, 0);
6275 TREE_TYPE (integer_zero_node
) = integer_type_node
;
6276 integer_one_node
= build_int_2 (1, 0);
6277 TREE_TYPE (integer_one_node
) = integer_type_node
;
6278 integer_two_node
= build_int_2 (2, 0);
6279 TREE_TYPE (integer_two_node
) = integer_type_node
;
6280 integer_three_node
= build_int_2 (3, 0);
6281 TREE_TYPE (integer_three_node
) = integer_type_node
;
6283 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6284 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6285 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6286 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6287 TYPE_PRECISION (boolean_type_node
) = 1;
6288 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6289 boolean_false_node
= build_int_2 (0, 0);
6290 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6291 boolean_true_node
= build_int_2 (1, 0);
6292 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6294 /* These are needed by stor-layout.c. */
6295 size_zero_node
= size_int (0);
6296 size_one_node
= size_int (1);
6298 signed_size_zero_node
= build_int_2 (0, 0);
6299 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6301 void_type_node
= make_node (VOID_TYPE
);
6302 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6303 layout_type (void_type_node
); /* Uses integer_zero_node. */
6304 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6305 TREE_PARMLIST (void_list_node
) = 1;
6307 null_pointer_node
= build_int_2 (0, 0);
6308 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
6309 layout_type (TREE_TYPE (null_pointer_node
));
6311 /* Used for expressions that do nothing, but are not errors. */
6312 void_zero_node
= build_int_2 (0, 0);
6313 TREE_TYPE (void_zero_node
) = void_type_node
;
6315 string_type_node
= build_pointer_type (char_type_node
);
6316 const_string_type_node
6317 = build_pointer_type (build_qualified_type (char_type_node
,
6319 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6321 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6324 /* Make a type to be the domain of a few array types
6325 whose domains don't really matter.
6326 200 is small enough that it always fits in size_t
6327 and large enough that it can hold most function names for the
6328 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6329 array_domain_type
= build_index_type (build_int_2 (200, 0));
6331 /* Make a type for arrays of characters.
6332 With luck nothing will ever really depend on the length of this
6334 char_array_type_node
6335 = build_array_type (char_type_node
, array_domain_type
);
6336 /* Likewise for arrays of ints. */
6338 = build_array_type (integer_type_node
, array_domain_type
);
6340 /* This is just some anonymous class type. Nobody should ever
6341 need to look inside this envelope. */
6342 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6344 if (flag_huge_objects
)
6345 delta_type_node
= long_integer_type_node
;
6347 delta_type_node
= short_integer_type_node
;
6349 default_function_type
6350 = build_function_type (integer_type_node
, NULL_TREE
);
6352 ptr_type_node
= build_pointer_type (void_type_node
);
6354 = build_pointer_type (build_qualified_type (void_type_node
,
6356 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6359 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6361 /* C++ extensions */
6363 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6364 record_unknown_type (unknown_type_node
, "unknown type");
6366 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6367 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6369 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6371 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6373 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6374 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6376 /* This is special for C++ so functions can be overloaded. */
6378 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6379 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6380 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6381 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6383 = TREE_UNSIGNED (wchar_type_node
)
6384 ? unsigned_wchar_type_node
6385 : signed_wchar_type_node
;
6386 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6388 /* Artificial declaration of wchar_t -- can be bashed */
6389 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6391 pushdecl (wchar_decl_node
);
6393 /* This is for wide string constants. */
6394 wchar_array_type_node
6395 = build_array_type (wchar_type_node
, array_domain_type
);
6397 if (flag_vtable_thunks
)
6399 /* Make sure we get a unique function type, so we can give
6400 its pointer type a name. (This wins for gdb.) */
6401 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6402 TREE_TYPE (vfunc_type
) = integer_type_node
;
6403 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6404 layout_type (vfunc_type
);
6406 vtable_entry_type
= build_pointer_type (vfunc_type
);
6410 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6411 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6413 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6415 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6417 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6420 /* Make this part of an invisible union. */
6421 fields
[3] = copy_node (fields
[2]);
6422 TREE_TYPE (fields
[3]) = delta_type_node
;
6423 DECL_NAME (fields
[3]) = delta2_identifier
;
6424 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6425 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6426 TREE_UNSIGNED (fields
[3]) = 0;
6427 TREE_CHAIN (fields
[2]) = fields
[3];
6428 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6431 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6434 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6435 layout_type (vtbl_type_node
);
6436 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6437 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6438 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6439 layout_type (vtbl_ptr_type_node
);
6440 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6442 std_node
= build_decl (NAMESPACE_DECL
,
6443 get_identifier (flag_honor_std
? "fake std":"std"),
6445 pushdecl (std_node
);
6447 global_type_node
= make_node (LANG_TYPE
);
6448 record_unknown_type (global_type_node
, "global type");
6451 current_lang_name
= lang_name_cplusplus
;
6454 tree bad_alloc_type_node
, newtype
, deltype
;
6456 push_namespace (get_identifier ("std"));
6457 bad_alloc_type_node
= xref_tag
6458 (class_type_node
, get_identifier ("bad_alloc"), 1);
6461 newtype
= build_exception_variant
6462 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6463 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6464 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6465 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6466 global_delete_fndecl
6467 = auto_function (ansi_opname
[(int) DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6468 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6472 = define_function ("__pure_virtual", void_ftype
,
6473 NOT_BUILT_IN
, 0, 0);
6475 /* Perform other language dependent initializations. */
6476 init_class_processing ();
6477 init_init_processing ();
6478 init_search_processing ();
6480 init_rtti_processing ();
6482 if (flag_exceptions
)
6483 init_exception_processing ();
6486 flag_inline_functions
= 0;
6489 if (! supports_one_only ())
6492 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6493 declare_function_name ();
6495 /* Prepare to check format strings against argument lists. */
6496 init_function_format_info ();
6498 /* Show we use EH for cleanups. */
6499 using_eh_for_cleanups ();
6501 print_error_function
= lang_print_error_function
;
6502 lang_get_alias_set
= &c_get_alias_set
;
6503 valid_lang_attribute
= cp_valid_lang_attribute
;
6505 /* Maintain consistency. Perhaps we should just complain if they
6506 say -fwritable-strings? */
6507 if (flag_writable_strings
)
6508 flag_const_strings
= 0;
6510 /* Add GC roots for all of our global variables. */
6511 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6512 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6513 ggc_add_tree_root (&char_type_node
, 1);
6514 ggc_add_tree_root (&error_mark_node
, 1);
6515 ggc_add_tree_root (&integer_type_node
, 1);
6516 ggc_add_tree_root (&integer_three_node
, 1);
6517 ggc_add_tree_root (&integer_two_node
, 1);
6518 ggc_add_tree_root (&integer_one_node
, 1);
6519 ggc_add_tree_root (&integer_zero_node
, 1);
6520 ggc_add_tree_root (&signed_size_zero_node
, 1);
6521 ggc_add_tree_root (&size_one_node
, 1);
6522 ggc_add_tree_root (&size_zero_node
, 1);
6523 ggc_add_tree_root (&unsigned_type_node
, 1);
6524 ggc_add_tree_root (&ptr_type_node
, 1);
6525 ggc_add_tree_root (&null_pointer_node
, 1);
6526 ggc_add_tree_root (&va_list_type_node
, 1);
6527 ggc_add_tree_root (&void_type_node
, 1);
6528 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6529 mark_binding_level
);
6530 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6531 ggc_add_tree_root (&static_ctors
, 1);
6532 ggc_add_tree_root (&static_dtors
, 1);
6533 ggc_add_tree_root (&lastiddecl
, 1);
6535 ggc_add_tree_root (&enum_next_value
, 1);
6536 ggc_add_tree_root (&last_function_parm_tags
, 1);
6537 ggc_add_tree_root (¤t_function_return_value
, 1);
6538 ggc_add_tree_root (¤t_function_parms
, 1);
6539 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6540 ggc_add_tree_root (&last_function_parms
, 1);
6541 ggc_add_tree_root (&error_mark_list
, 1);
6543 ggc_add_tree_root (&global_namespace
, 1);
6544 ggc_add_tree_root (&global_type_node
, 1);
6545 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6547 ggc_add_tree_root (&got_object
, 1);
6548 ggc_add_tree_root (&got_scope
, 1);
6550 ggc_add_tree_root (¤t_lang_name
, 1);
6551 ggc_add_tree_root (&static_aggregates
, 1);
6554 /* Function to print any language-specific context for an error message. */
6557 lang_print_error_function (file
)
6560 default_print_error_function (file
);
6561 maybe_print_template_context ();
6564 /* Make a definition for a builtin function named NAME and whose data type
6565 is TYPE. TYPE should be a function type with argument types.
6566 FUNCTION_CODE tells later passes how to compile calls to this function.
6567 See tree.h for its possible values.
6569 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6570 the name to be called if we can't opencode the function. */
6573 define_function (name
, type
, function_code
, pfn
, library_name
)
6576 enum built_in_function function_code
;
6577 void (*pfn
) PROTO((tree
));
6578 const char *library_name
;
6580 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6581 DECL_EXTERNAL (decl
) = 1;
6582 TREE_PUBLIC (decl
) = 1;
6583 DECL_ARTIFICIAL (decl
) = 1;
6585 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6586 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6588 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6589 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6590 function in the namespace. */
6591 if (pfn
) (*pfn
) (decl
);
6593 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6594 make_function_rtl (decl
);
6595 if (function_code
!= NOT_BUILT_IN
)
6597 DECL_BUILT_IN (decl
) = 1;
6598 DECL_FUNCTION_CODE (decl
) = function_code
;
6604 builtin_function (name
, type
, code
, libname
)
6607 enum built_in_function code
;
6608 const char *libname
;
6610 return define_function (name
, type
, code
, (void (*) PROTO((tree
)))pushdecl
, libname
);
6613 /* When we call finish_struct for an anonymous union, we create
6614 default copy constructors and such. But, an anonymous union
6615 shouldn't have such things; this function undoes the damage to the
6616 anonymous union type T.
6618 (The reason that we create the synthesized methods is that we don't
6619 distinguish `union { int i; }' from `typedef union { int i; } U'.
6620 The first is an anonymous union; the second is just an ordinary
6624 fixup_anonymous_aggr (t
)
6629 /* Wipe out memory of synthesized methods */
6630 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6631 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6632 TYPE_HAS_INIT_REF (t
) = 0;
6633 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6634 TYPE_HAS_ASSIGN_REF (t
) = 0;
6635 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6637 /* Splice the implicitly generated functions out of the TYPE_METHODS
6639 q
= &TYPE_METHODS (t
);
6642 if (DECL_ARTIFICIAL (*q
))
6643 *q
= TREE_CHAIN (*q
);
6645 q
= &TREE_CHAIN (*q
);
6648 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6649 function members. */
6650 if (TYPE_METHODS (t
))
6651 error ("an anonymous union cannot have function members");
6654 /* Make sure that a declaration with no declarator is well-formed, i.e.
6655 just defines a tagged type or anonymous union.
6657 Returns the type defined, if any. */
6660 check_tag_decl (declspecs
)
6664 tree ob_modifier
= NULL_TREE
;
6666 register tree t
= NULL_TREE
;
6668 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6670 register tree value
= TREE_VALUE (link
);
6676 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6678 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6682 else if (value
== ridpointers
[(int) RID_FRIEND
])
6684 if (current_class_type
== NULL_TREE
6685 || current_scope () != current_class_type
)
6686 ob_modifier
= value
;
6688 else if (value
== ridpointers
[(int) RID_STATIC
]
6689 || value
== ridpointers
[(int) RID_EXTERN
]
6690 || value
== ridpointers
[(int) RID_AUTO
]
6691 || value
== ridpointers
[(int) RID_REGISTER
]
6692 || value
== ridpointers
[(int) RID_INLINE
]
6693 || value
== ridpointers
[(int) RID_VIRTUAL
]
6694 || value
== ridpointers
[(int) RID_CONST
]
6695 || value
== ridpointers
[(int) RID_VOLATILE
]
6696 || value
== ridpointers
[(int) RID_EXPLICIT
])
6697 ob_modifier
= value
;
6701 error ("multiple types in one declaration");
6703 /* Inside a class, we might be in a friend or access declaration.
6704 Until we have a good way of detecting the latter, don't warn. */
6705 if (t
== NULL_TREE
&& ! current_class_type
)
6706 pedwarn ("declaration does not declare anything");
6708 /* Check for an anonymous union. We're careful
6709 accessing TYPE_IDENTIFIER because some built-in types, like
6710 pointer-to-member types, do not have TYPE_NAME. */
6711 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6713 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6715 /* Anonymous unions are objects, so they can have specifiers. */;
6716 SET_ANON_AGGR_TYPE_P (t
);
6718 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6719 pedwarn ("ISO C++ prohibits anonymous structs");
6722 else if (ob_modifier
)
6724 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6725 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6726 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6727 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6728 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6729 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6730 cp_error ("`%D' can only be specified for constructors",
6733 cp_error ("`%D' can only be specified for objects and functions",
6740 /* Called when a declaration is seen that contains no names to declare.
6741 If its type is a reference to a structure, union or enum inherited
6742 from a containing scope, shadow that tag name for the current scope
6743 with a forward reference.
6744 If its type defines a new named structure or union
6745 or defines an enum, it is valid but we need not do anything here.
6746 Otherwise, it is an error.
6748 C++: may have to grok the declspecs to learn about static,
6749 complain for anonymous unions. */
6752 shadow_tag (declspecs
)
6755 tree t
= check_tag_decl (declspecs
);
6758 maybe_process_partial_specialization (t
);
6760 /* This is where the variables in an anonymous union are
6761 declared. An anonymous union declaration looks like:
6763 because there is no declarator after the union, the parser
6764 sends that declaration here. */
6765 if (t
&& ANON_AGGR_TYPE_P (t
))
6767 fixup_anonymous_aggr (t
);
6769 if (TYPE_FIELDS (t
))
6771 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6773 finish_anon_union (decl
);
6778 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6781 groktypename (typename
)
6784 if (TREE_CODE (typename
) != TREE_LIST
)
6786 return grokdeclarator (TREE_VALUE (typename
),
6787 TREE_PURPOSE (typename
),
6788 TYPENAME
, 0, NULL_TREE
);
6791 /* Decode a declarator in an ordinary declaration or data definition.
6792 This is called as soon as the type information and variable name
6793 have been parsed, before parsing the initializer if any.
6794 Here we create the ..._DECL node, fill in its type,
6795 and put it on the list of decls for the current context.
6796 The ..._DECL node is returned as the value.
6798 Exception: for arrays where the length is not specified,
6799 the type is left null, to be filled in by `cp_finish_decl'.
6801 Function definitions do not come here; they go to start_function
6802 instead. However, external and forward declarations of functions
6803 do go through here. Structure field declarations are done by
6804 grokfield and not through here. */
6806 /* Set this to zero to debug not using the temporary obstack
6807 to parse initializers. */
6808 int debug_temp_inits
= 1;
6811 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6812 tree declarator
, declspecs
;
6814 tree attributes
, prefix_attributes
;
6817 register tree type
, tem
;
6819 extern int have_extern_spec
;
6820 extern int used_extern_spec
;
6824 /* See code below that used this. */
6825 int init_written
= initialized
;
6828 /* This should only be done once on the top most decl. */
6829 if (have_extern_spec
&& !used_extern_spec
)
6831 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6833 used_extern_spec
= 1;
6836 if (attributes
|| prefix_attributes
)
6837 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6839 attrlist
= NULL_TREE
;
6841 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6844 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6847 type
= TREE_TYPE (decl
);
6849 if (type
== error_mark_node
)
6852 /* Don't lose if destructors must be executed at file-level. */
6853 if (! processing_template_decl
&& TREE_STATIC (decl
)
6854 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
6855 && !TREE_PERMANENT (decl
))
6857 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6858 decl
= copy_node (decl
);
6859 if (TREE_CODE (type
) == ARRAY_TYPE
)
6861 tree itype
= TYPE_DOMAIN (type
);
6862 if (itype
&& ! TREE_PERMANENT (itype
))
6864 itype
= build_index_type (TYPE_MAX_VALUE (itype
));
6865 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
6866 TREE_TYPE (decl
) = type
;
6873 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6874 ? DECL_CLASS_CONTEXT (decl
)
6875 : DECL_CONTEXT (decl
);
6877 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6878 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6880 /* When parsing the initializer, lookup should use the object's
6882 push_decl_namespace (context
);
6885 /* We are only interested in class contexts, later. */
6886 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6887 context
= NULL_TREE
;
6890 /* Is it valid for this decl to have an initializer at all?
6891 If not, set INITIALIZED to zero, which will indirectly
6892 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6893 switch (TREE_CODE (decl
))
6896 /* typedef foo = bar means give foo the same type as bar.
6897 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6898 Any other case of an initialization in a TYPE_DECL is an error. */
6899 if (pedantic
|| list_length (declspecs
) > 1)
6901 cp_error ("typedef `%D' is initialized", decl
);
6907 cp_error ("function `%#D' is initialized like a variable", decl
);
6917 if (! toplevel_bindings_p ()
6918 && DECL_EXTERNAL (decl
))
6919 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6921 DECL_EXTERNAL (decl
) = 0;
6922 if (toplevel_bindings_p ())
6923 TREE_STATIC (decl
) = 1;
6925 /* Tell `pushdecl' this is an initialized decl
6926 even though we don't yet have the initializer expression.
6927 Also tell `cp_finish_decl' it may store the real initializer. */
6928 DECL_INITIAL (decl
) = error_mark_node
;
6931 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6932 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6935 /* Set attributes here so if duplicate decl, will have proper attributes. */
6936 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6938 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6940 push_nested_class (context
, 2);
6942 if (TREE_CODE (decl
) == VAR_DECL
)
6944 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6945 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6946 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6949 if (DECL_CONTEXT (field
) != context
)
6951 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6952 DECL_CONTEXT (field
), DECL_NAME (decl
),
6953 context
, DECL_NAME (decl
));
6954 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6956 /* Static data member are tricky; an in-class initialization
6957 still doesn't provide a definition, so the in-class
6958 declaration will have DECL_EXTERNAL set, but will have an
6959 initialization. Thus, duplicate_decls won't warn
6960 about this situation, and so we check here. */
6961 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6962 cp_error ("duplicate initialization of %D", decl
);
6963 if (duplicate_decls (decl
, field
))
6969 tree field
= check_classfn (context
, decl
);
6970 if (field
&& duplicate_decls (decl
, field
))
6974 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6975 DECL_IN_AGGR_P (decl
) = 0;
6976 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6977 || CLASSTYPE_USE_TEMPLATE (context
))
6979 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6980 /* [temp.expl.spec] An explicit specialization of a static data
6981 member of a template is a definition if the declaration
6982 includes an initializer; otherwise, it is a declaration.
6984 We check for processing_specialization so this only applies
6985 to the new specialization syntax. */
6986 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6987 DECL_EXTERNAL (decl
) = 1;
6990 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6991 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6995 /* Enter this declaration into the symbol table. */
6996 tem
= maybe_push_decl (decl
);
6998 if (processing_template_decl
)
7000 if (at_function_scope_p ())
7001 push_permanent_obstack ();
7003 tem
= push_template_decl (tem
);
7004 /* In a a local scope, add a representation of this declaration
7005 to the statement tree. */
7006 if (at_function_scope_p ())
7008 add_decl_stmt (decl
);
7014 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7015 /* Tell the back-end to use or not use .common as appropriate. If we say
7016 -fconserve-space, we want this to save .data space, at the expense of
7017 wrong semantics. If we say -fno-conserve-space, we want this to
7018 produce errors about redefs; to do this we force variables into the
7020 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7023 if (! processing_template_decl
)
7026 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
7027 push_obstacks_nochange ();
7036 tree type
= TREE_TYPE (decl
);
7037 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7039 if (type
== error_mark_node
)
7042 /* If this type of object needs a cleanup, and control may
7043 jump past it, make a new binding level so that it is cleaned
7044 up only when it is initialized first. */
7045 if (TYPE_NEEDS_DESTRUCTOR (type
)
7046 && current_binding_level
->more_cleanups_ok
== 0)
7047 pushlevel_temporary (1);
7050 /* Is it valid for this decl to have an initializer at all?
7051 If not, set INITIALIZED to zero, which will indirectly
7052 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7054 /* Don't allow initializations for incomplete types except for
7055 arrays which might be completed by the initialization. */
7056 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
7057 ; /* A complete type is ok. */
7058 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7060 cp_error ("variable `%#D' has initializer but incomplete type",
7063 type
= TREE_TYPE (decl
) = error_mark_node
;
7065 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
7067 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7068 cp_error ("elements of array `%#D' have incomplete type", decl
);
7069 /* else we already gave an error in start_decl. */
7075 && TREE_CODE (decl
) != TYPE_DECL
7076 && TREE_CODE (decl
) != TEMPLATE_DECL
7077 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
7079 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7080 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
7082 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7084 /* Change the type so that assemble_variable will give
7085 DECL an rtl we can live with: (mem (const_int 0)). */
7086 type
= TREE_TYPE (decl
) = error_mark_node
;
7090 /* If any base type in the hierarchy of TYPE needs a constructor,
7091 then we set initialized to 1. This way any nodes which are
7092 created for the purposes of initializing this aggregate
7093 will live as long as it does. This is necessary for global
7094 aggregates which do not have their initializers processed until
7095 the end of the file. */
7096 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7101 DECL_INITIAL (decl
) = NULL_TREE
;
7104 /* Handle initialization of references.
7105 These three arguments are from `cp_finish_decl', and have the
7106 same meaning here that they do there.
7108 Quotes on semantics can be found in ARM 8.4.3. */
7111 grok_reference_init (decl
, type
, init
)
7112 tree decl
, type
, init
;
7116 if (init
== NULL_TREE
)
7118 if ((DECL_LANG_SPECIFIC (decl
) == 0
7119 || DECL_IN_AGGR_P (decl
) == 0)
7120 && ! DECL_THIS_EXTERN (decl
))
7122 cp_error ("`%D' declared as reference but not initialized", decl
);
7123 if (TREE_CODE (decl
) == VAR_DECL
)
7124 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7129 if (init
== error_mark_node
)
7132 if (TREE_CODE (type
) == REFERENCE_TYPE
7133 && TREE_CODE (init
) == CONSTRUCTOR
)
7135 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
7139 if (TREE_CODE (init
) == TREE_LIST
)
7140 init
= build_compound_expr (init
);
7142 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7143 init
= convert_from_reference (init
);
7145 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7146 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7148 /* Note: default conversion is only called in very special cases. */
7149 init
= default_conversion (init
);
7152 tmp
= convert_to_reference
7153 (type
, init
, CONV_IMPLICIT
,
7154 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
7156 if (tmp
== error_mark_node
)
7158 else if (tmp
!= NULL_TREE
)
7161 DECL_INITIAL (decl
) = save_expr (init
);
7165 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7169 /* ?? Can this be optimized in some cases to
7170 hand back the DECL_INITIAL slot?? */
7171 if (TYPE_SIZE (TREE_TYPE (type
)))
7173 init
= convert_from_reference (decl
);
7174 SET_DECL_REFERENCE_SLOT (decl
, init
);
7177 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7179 expand_static_init (decl
, DECL_INITIAL (decl
));
7180 DECL_INITIAL (decl
) = NULL_TREE
;
7185 if (TREE_CODE (decl
) == VAR_DECL
)
7186 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7190 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7191 mucking with forces it does not comprehend (i.e. initialization with a
7192 constructor). If we are at global scope and won't go into COMMON, fill
7193 it in with a dummy CONSTRUCTOR to force the variable into .data;
7194 otherwise we can use error_mark_node. */
7197 obscure_complex_init (decl
, init
)
7200 if (! flag_no_inline
&& TREE_STATIC (decl
))
7202 if (extract_init (decl
, init
))
7206 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7207 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7208 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7212 DECL_INITIAL (decl
) = error_mark_node
;
7217 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7218 array until we finish parsing the initializer. If that's the
7219 situation we're in, update DECL accordingly. */
7222 maybe_deduce_size_from_array_init (decl
, init
)
7226 tree type
= TREE_TYPE (decl
);
7228 if (TREE_CODE (type
) == ARRAY_TYPE
7229 && TYPE_DOMAIN (type
) == NULL_TREE
7230 && TREE_CODE (decl
) != TYPE_DECL
)
7233 = (TREE_STATIC (decl
)
7234 /* Even if pedantic, an external linkage array
7235 may have incomplete type at first. */
7236 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7237 : !DECL_EXTERNAL (decl
));
7238 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7239 int failure
= complete_array_type (type
, initializer
, do_default
);
7242 cp_error ("initializer fails to determine size of `%D'", decl
);
7247 cp_error ("array size missing in `%D'", decl
);
7248 /* If a `static' var's size isn't known, make it extern as
7249 well as static, so it does not get allocated. If it's not
7250 `static', then don't mark it extern; finish_incomplete_decl
7251 will give it a default size and it will get allocated. */
7252 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7253 DECL_EXTERNAL (decl
) = 1;
7256 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7257 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7259 cp_error ("zero-size array `%D'", decl
);
7261 layout_decl (decl
, 0);
7265 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7266 any appropriate error messages regarding the layout. INIT is a
7267 the initializer for DECL; returns a modified version. */
7270 layout_var_decl (decl
, init
)
7274 tree ttype
= target_type (TREE_TYPE (decl
));
7276 /* If we haven't already layed out this declaration, and we know its
7277 type, do so now. Note that we must not call complete type for an
7278 external object because it's type might involve templates that we
7279 are not supposed to isntantiate yet. */
7280 if (!DECL_EXTERNAL (decl
)
7281 && DECL_SIZE (decl
) == NULL_TREE
7282 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7283 layout_decl (decl
, 0);
7285 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7287 /* An automatic variable with an incomplete type: that is an error.
7288 Don't talk about array types here, since we took care of that
7289 message in grokdeclarator. */
7290 cp_error ("storage size of `%D' isn't known", decl
);
7291 TREE_TYPE (decl
) = error_mark_node
;
7293 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7294 /* Let debugger know it should output info for this type. */
7295 note_debug_info_needed (ttype
);
7297 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7298 note_debug_info_needed (DECL_CONTEXT (decl
));
7300 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7301 && DECL_SIZE (decl
) != NULL_TREE
7302 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7304 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7305 constant_expression_warning (DECL_SIZE (decl
));
7307 cp_error ("storage size of `%D' isn't constant", decl
);
7313 /* Return a cleanup for DECL, created on whatever obstack is
7317 build_cleanup_on_safe_obstack (decl
)
7324 type
= TREE_TYPE (decl
);
7326 /* Only variables get cleaned up. */
7327 if (TREE_CODE (decl
) != VAR_DECL
)
7330 /* And only things with destructors need cleaning up. */
7331 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7334 if (TREE_CODE (decl
) == VAR_DECL
&&
7335 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7336 /* We don't clean up things that aren't defined in this
7337 translation unit, or that need a static cleanup. The latter
7338 are handled by finish_file. */
7341 /* Switch to an obstack that will live until the point where the
7342 cleanup code is actually expanded. */
7343 need_pop
= suspend_momentary ();
7345 /* Compute the cleanup. */
7346 cleanup
= maybe_build_cleanup (decl
);
7348 /* Pop back to the obstack we were on before. */
7349 resume_momentary (need_pop
);
7354 /* If a local static variable is declared in an inline function, or if
7355 we have a weak definition, we must endeavor to create only one
7356 instance of the variable at link-time. */
7359 maybe_commonize_var (decl
)
7362 /* Static data in a function with comdat linkage also has comdat
7364 if (TREE_STATIC (decl
)
7365 /* Don't mess with __FUNCTION__. */
7366 && ! TREE_ASM_WRITTEN (decl
)
7367 && current_function_decl
7368 && DECL_CONTEXT (decl
) == current_function_decl
7369 && (DECL_THIS_INLINE (current_function_decl
)
7370 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7371 && TREE_PUBLIC (current_function_decl
))
7373 /* Rather than try to get this right with inlining, we suppress
7374 inlining of such functions. */
7375 current_function_cannot_inline
7376 = "function with static variable cannot be inline";
7378 /* If flag_weak, we don't need to mess with this, as we can just
7379 make the function weak, and let it refer to its unique local
7380 copy. This works because we don't allow the function to be
7384 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7386 TREE_PUBLIC (decl
) = 1;
7387 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7389 else if (DECL_INITIAL (decl
) == NULL_TREE
7390 || DECL_INITIAL (decl
) == error_mark_node
)
7392 TREE_PUBLIC (decl
) = 1;
7393 DECL_COMMON (decl
) = 1;
7395 /* else we lose. We can only do this if we can use common,
7396 which we can't if it has been initialized. */
7398 if (TREE_PUBLIC (decl
))
7399 DECL_ASSEMBLER_NAME (decl
)
7400 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7401 else if (! DECL_ARTIFICIAL (decl
))
7403 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7404 cp_warning_at (" you can work around this by removing the initializer", decl
);
7408 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7409 /* Set it up again; we might have set DECL_INITIAL since the last
7411 comdat_linkage (decl
);
7414 /* Issue an error message if DECL is an uninitialized const variable. */
7417 check_for_uninitialized_const_var (decl
)
7420 tree type
= TREE_TYPE (decl
);
7422 /* ``Unless explicitly declared extern, a const object does not have
7423 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7425 if (TREE_CODE (decl
) == VAR_DECL
7426 && TREE_CODE (type
) != REFERENCE_TYPE
7427 && CP_TYPE_CONST_P (type
)
7428 && !TYPE_NEEDS_CONSTRUCTING (type
)
7429 && !DECL_INITIAL (decl
))
7430 cp_error ("uninitialized const `%D'", decl
);
7433 /* Verify INIT (the initializer for DECL), and record the
7434 initialization in DECL_INITIAL, if appropriate. Returns a new
7438 check_initializer (decl
, init
)
7444 if (TREE_CODE (decl
) == FIELD_DECL
)
7447 type
= TREE_TYPE (decl
);
7449 /* If `start_decl' didn't like having an initialization, ignore it now. */
7450 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7453 /* Check the initializer. */
7456 /* Things that are going to be initialized need to have complete
7458 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7460 if (type
== error_mark_node
)
7461 /* We will have already complained. */
7463 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7465 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7468 else if (TREE_CODE (type
) == ARRAY_TYPE
7469 && !TYPE_SIZE (TREE_TYPE (type
)))
7471 cp_error ("elements of array `%#D' have incomplete type", decl
);
7474 else if (!TYPE_SIZE (type
))
7476 cp_error ("`%D' has incomplete type", decl
);
7477 TREE_TYPE (decl
) = error_mark_node
;
7482 if (TREE_CODE (decl
) == CONST_DECL
)
7484 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7486 DECL_INITIAL (decl
) = init
;
7488 /* This will keep us from needing to worry about our obstacks. */
7489 my_friendly_assert (init
!= NULL_TREE
, 149);
7492 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7494 if (TREE_STATIC (decl
))
7495 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7496 grok_reference_init (decl
, type
, init
);
7501 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7503 if (TREE_CODE (type
) == ARRAY_TYPE
)
7504 init
= digest_init (type
, init
, (tree
*) 0);
7505 else if (TREE_CODE (init
) == CONSTRUCTOR
7506 && TREE_HAS_CONSTRUCTOR (init
))
7508 if (TYPE_NON_AGGREGATE_CLASS (type
))
7510 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7512 init
= error_mark_node
;
7515 goto dont_use_constructor
;
7520 dont_use_constructor
:
7521 if (TREE_CODE (init
) != TREE_VEC
)
7522 init
= store_init_value (decl
, init
);
7526 /* We must hide the initializer so that expand_decl
7527 won't try to do something it does not understand. */
7528 init
= obscure_complex_init (decl
, init
);
7530 else if (DECL_EXTERNAL (decl
))
7532 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7533 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7535 tree core_type
= strip_array_types (type
);
7537 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7539 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7540 cp_error ("structure `%D' with uninitialized const members", decl
);
7541 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7542 cp_error ("structure `%D' with uninitialized reference members",
7546 check_for_uninitialized_const_var (decl
);
7548 if (TYPE_SIZE (type
) != NULL_TREE
7549 && TYPE_NEEDS_CONSTRUCTING (type
))
7550 init
= obscure_complex_init (decl
, NULL_TREE
);
7554 check_for_uninitialized_const_var (decl
);
7559 /* If DECL is not a local variable, give it RTL. */
7562 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7565 const char *asmspec
;
7570 type
= TREE_TYPE (decl
);
7571 toplev
= toplevel_bindings_p ();
7572 push_obstacks_nochange ();
7573 if (TREE_STATIC (decl
)
7574 && TYPE_NEEDS_DESTRUCTOR (type
)
7575 && allocation_temporary_p ())
7576 end_temporary_allocation ();
7578 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7579 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7580 else if (TREE_CODE (decl
) == VAR_DECL
7581 && TREE_READONLY (decl
)
7582 && DECL_INITIAL (decl
) != NULL_TREE
7583 && DECL_INITIAL (decl
) != error_mark_node
7584 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7586 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7589 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7592 && TREE_STATIC (decl
)
7593 && ! TREE_SIDE_EFFECTS (decl
)
7594 && ! TREE_PUBLIC (decl
)
7595 && ! DECL_EXTERNAL (decl
)
7596 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7597 && DECL_MODE (decl
) != BLKmode
)
7599 /* If this variable is really a constant, then fill its DECL_RTL
7600 slot with something which won't take up storage.
7601 If something later should take its address, we can always give
7602 it legitimate RTL at that time. */
7603 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7604 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7605 TREE_ASM_WRITTEN (decl
) = 1;
7607 else if (toplev
&& ! TREE_PUBLIC (decl
))
7609 /* If this is a static const, change its apparent linkage
7610 if it belongs to a #pragma interface. */
7611 if (!interface_unknown
)
7613 TREE_PUBLIC (decl
) = 1;
7614 DECL_EXTERNAL (decl
) = interface_only
;
7616 make_decl_rtl (decl
, asmspec
, toplev
);
7619 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7621 else if (TREE_CODE (decl
) == VAR_DECL
7622 && DECL_LANG_SPECIFIC (decl
)
7623 && DECL_IN_AGGR_P (decl
))
7625 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7627 if (init
== NULL_TREE
7628 #ifdef DEFAULT_STATIC_DEFS
7629 /* If this code is dead, then users must
7630 explicitly declare static member variables
7631 outside the class def'n as well. */
7632 && TYPE_NEEDS_CONSTRUCTING (type
)
7636 DECL_EXTERNAL (decl
) = 1;
7637 make_decl_rtl (decl
, asmspec
, 1);
7640 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7643 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7648 /* The old ARM scoping rules injected variables declared in the
7649 initialization statement of a for-statement into the surrounding
7650 scope. We support this usage, in order to be backward-compatible.
7651 DECL is a just-declared VAR_DECL; if necessary inject its
7652 declaration into the surrounding scope. */
7655 maybe_inject_for_scope_var (decl
)
7658 if (current_binding_level
->is_for_scope
)
7660 struct binding_level
*outer
7661 = current_binding_level
->level_chain
;
7663 /* Check to see if the same name is already bound at the outer
7664 level, either because it was directly declared, or because a
7665 dead for-decl got preserved. In either case, the code would
7666 not have been valid under the ARM scope rules, so clear
7667 is_for_scope for the current_binding_level.
7669 Otherwise, we need to preserve the temp slot for decl to last
7670 into the outer binding level. */
7673 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7675 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7676 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7678 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7680 BINDING_VALUE (outer_binding
)
7681 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7682 current_binding_level
->is_for_scope
= 0;
7684 else if (DECL_IN_MEMORY_P (decl
))
7685 preserve_temp_slots (DECL_RTL (decl
));
7689 /* Generate code to initialized DECL (a local variable). */
7692 initialize_local_var (decl
, init
, flags
)
7700 type
= complete_type (TREE_TYPE (decl
));
7702 cleanup
= build_cleanup_on_safe_obstack (decl
);
7704 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7706 /* If we used it already as memory, it must stay in memory. */
7707 DECL_INITIAL (decl
) = NULL_TREE
;
7708 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7711 if (DECL_RTL (decl
))
7712 /* Only a RESULT_DECL should have non-NULL RTL when arriving here.
7713 All other local variables are assigned RTL in this function. */
7714 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
, 19990828);
7716 /* Create RTL for this variable. */
7719 expand_start_target_temps ();
7721 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7725 /* Compute and store the initial value. */
7726 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7728 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7730 emit_line_note (DECL_SOURCE_FILE (decl
),
7731 DECL_SOURCE_LINE (decl
));
7732 /* We call push_momentary here so that when
7733 finish_expr_stmt clears the momentary obstack it
7734 doesn't destory any momentary expressions we may
7735 have lying around. Although cp_finish_decl is
7736 usually called at the end of a declaration
7737 statement, it may also be called for a temporary
7738 object in the middle of an expression. */
7740 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7744 expand_decl_init (decl
);
7746 /* Set this to 0 so we can tell whether an aggregate which was
7747 initialized was ever used. Don't do this if it has a
7748 destructor, so we don't complain about the 'resource
7749 allocation is initialization' idiom. Now set
7750 attribute((unused)) on types so decls of that type will be
7751 marked used. (see TREE_USED, above.) */
7752 if (TYPE_NEEDS_CONSTRUCTING (type
)
7754 && cleanup
== NULL_TREE
7755 && DECL_NAME (decl
))
7756 TREE_USED (decl
) = 0;
7757 else if (already_used
)
7758 TREE_USED (decl
) = 1;
7761 /* Cleanup any temporaries needed for the initial value. */
7762 expand_end_target_temps ();
7764 /* Record the cleanup required for this declaration. */
7765 if (DECL_SIZE (decl
)
7766 && type
!= error_mark_node
7768 && !expand_decl_cleanup (decl
, cleanup
))
7769 cp_error ("parser lost in parsing declaration of `%D'", decl
);
7772 /* Finish processing of a declaration;
7773 install its line number and initial value.
7774 If the length of an array type is not known before,
7775 it must be determined now, from the initial value, or it is an error.
7777 Call `pop_obstacks' iff NEED_POP is nonzero.
7779 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7780 for aggregates that have constructors alive on the permanent obstack,
7781 so that the global initializing functions can be written at the end.
7783 INIT0 holds the value of an initializer that should be allowed to escape
7786 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7787 if the (init) syntax was used.
7789 For functions that take default parameters, DECL points to its
7790 "maximal" instantiation. `cp_finish_decl' must then also declared its
7791 subsequently lower and lower forms of instantiation, checking for
7792 ambiguity as it goes. This can be sped up later. */
7795 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7802 tree ttype
= NULL_TREE
;
7803 int temporary
= allocation_temporary_p ();
7804 const char *asmspec
= NULL
;
7805 int was_readonly
= 0;
7807 /* If this is 0, then we did not change obstacks. */
7811 error ("assignment (not initialization) in declaration");
7815 /* If a name was specified, get the string. */
7817 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7819 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7821 cp_error ("Cannot initialize `%D' to namespace `%D'",
7826 if (current_class_type
7827 && DECL_REAL_CONTEXT (decl
) == current_class_type
7828 && TYPE_BEING_DEFINED (current_class_type
)
7829 && (DECL_INITIAL (decl
) || init
))
7830 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7832 if (TREE_CODE (decl
) == VAR_DECL
7833 && DECL_CONTEXT (decl
)
7834 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7835 && DECL_CONTEXT (decl
) != current_namespace
7838 /* Leave the namespace of the object. */
7839 pop_decl_namespace ();
7842 type
= TREE_TYPE (decl
);
7844 if (type
== error_mark_node
)
7846 if (toplevel_bindings_p () && temporary
)
7847 end_temporary_allocation ();
7852 if (TYPE_HAS_MUTABLE_P (type
))
7853 TREE_READONLY (decl
) = 0;
7855 if (processing_template_decl
)
7857 if (init
&& DECL_INITIAL (decl
))
7858 DECL_INITIAL (decl
) = init
;
7862 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7863 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7865 /* Take care of TYPE_DECLs up front. */
7866 if (TREE_CODE (decl
) == TYPE_DECL
)
7868 if (init
&& DECL_INITIAL (decl
))
7870 /* typedef foo = bar; store the type of bar as the type of foo. */
7871 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7872 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7874 if (type
!= error_mark_node
7875 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7877 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7878 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7879 set_identifier_type_value (DECL_NAME (decl
), type
);
7880 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7882 GNU_xref_decl (current_function_decl
, decl
);
7884 /* If we have installed this as the canonical typedef for this
7885 type, and that type has not been defined yet, delay emitting
7886 the debug information for it, as we will emit it later. */
7887 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7888 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7889 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7891 rest_of_decl_compilation (decl
, NULL_PTR
,
7892 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7896 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7897 ttype
= target_type (type
);
7899 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7900 && TYPE_NEEDS_CONSTRUCTING (type
))
7902 /* Currently, GNU C++ puts constants in text space, making them
7903 impossible to initialize. In the future, one would hope for
7904 an operating system which understood the difference between
7905 initialization and the running of a program. */
7907 TREE_READONLY (decl
) = 0;
7910 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7912 /* This must override the asm specifier which was placed by
7913 grokclassfn. Lay this out fresh. */
7914 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7915 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7916 make_decl_rtl (decl
, asmspec
, 0);
7919 /* Deduce size of array from initialization, if not already known. */
7920 maybe_deduce_size_from_array_init (decl
, init
);
7921 init
= check_initializer (decl
, init
);
7923 GNU_xref_decl (current_function_decl
, decl
);
7925 /* For top-level declaration, the initial value was read in
7926 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7927 must go in the permanent obstack; but don't discard the
7928 temporary data yet. */
7930 if (toplevel_bindings_p () && temporary
)
7931 end_temporary_allocation ();
7933 if (TREE_CODE (decl
) == VAR_DECL
)
7934 init
= layout_var_decl (decl
, init
);
7936 /* Output the assembler code and/or RTL code for variables and functions,
7937 unless the type is an undefined structure or union.
7938 If not, it will get done when the type is completed. */
7939 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7940 || TREE_CODE (decl
) == RESULT_DECL
)
7942 /* ??? FIXME: What about nested classes? */
7943 int toplev
= toplevel_bindings_p ();
7945 if (TREE_CODE (decl
) == VAR_DECL
)
7946 maybe_commonize_var (decl
);
7948 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7950 if (TREE_CODE (type
) == FUNCTION_TYPE
7951 || TREE_CODE (type
) == METHOD_TYPE
)
7952 abstract_virtuals_error (decl
,
7953 strip_array_types (TREE_TYPE (type
)));
7955 abstract_virtuals_error (decl
, strip_array_types (type
));
7957 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7959 else if (DECL_EXTERNAL (decl
)
7960 && ! (DECL_LANG_SPECIFIC (decl
)
7961 && DECL_NOT_REALLY_EXTERN (decl
)))
7964 DECL_INITIAL (decl
) = init
;
7966 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7968 /* Cleanups for static variables are handled by `finish_file'. */
7969 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7970 || TYPE_NEEDS_DESTRUCTOR (type
))
7971 expand_static_init (decl
, init
);
7975 /* This is a local declaration. */
7976 maybe_inject_for_scope_var (decl
);
7977 /* Initialize the local variable. But, if we're building a
7978 statement-tree, we'll do the initialization when we
7980 if (!building_stmt_tree ())
7981 initialize_local_var (decl
, init
, flags
);
7982 else if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7983 DECL_INITIAL (decl
) = init
;
7987 /* Undo call to `pushclass' that was done in `start_decl'
7988 due to initialization of qualified member variable.
7989 I.e., Foo::x = 10; */
7991 tree context
= DECL_REAL_CONTEXT (decl
);
7993 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7994 && (TREE_CODE (decl
) == VAR_DECL
7995 /* We also have a pushclass done that we need to undo here
7996 if we're at top level and declare a method. */
7997 || TREE_CODE (decl
) == FUNCTION_DECL
)
7998 /* If size hasn't been set, we're still defining it,
7999 and therefore inside the class body; don't pop
8000 the binding level.. */
8001 && TYPE_SIZE (context
) != NULL_TREE
8002 && context
== current_class_type
)
8003 pop_nested_class ();
8009 /* If requested, warn about definitions of large data objects. */
8011 if (warn_larger_than
8012 && ! processing_template_decl
8013 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
8014 && !DECL_EXTERNAL (decl
))
8016 register tree decl_size
= DECL_SIZE (decl
);
8018 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
8020 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
8022 if (units
> larger_than_size
)
8023 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
8028 /* Resume permanent allocation, if not within a function. The
8029 corresponding push_obstacks_nochange is in start_decl,
8030 start_method, groktypename, and in grokfield. */
8034 TREE_READONLY (decl
) = 1;
8037 /* This is here for a midend callback from c-common.c */
8040 finish_decl (decl
, init
, asmspec_tree
)
8044 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
8047 /* Generate code to handle the destruction of the function-scoped
8048 static variable DECL. */
8051 destroy_local_static (decl
)
8054 tree cleanup
, fcall
;
8056 int saved_flag_access_control
;
8058 if (atexit_node
== 0)
8060 tree atexit_fndecl
, PFV
, pfvlist
;
8061 /* Remember this information until end of file. */
8062 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8063 PFV
= build_pointer_type (build_function_type
8064 (void_type_node
, void_list_node
));
8066 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
8068 push_lang_context (lang_name_c
);
8069 /* Note that we do not call pushdecl for this function;
8070 there's no reason that this declaration should be
8071 accessible to anyone. */
8073 = define_function ("atexit",
8074 build_function_type (void_type_node
,
8079 mark_used (atexit_fndecl
);
8080 atexit_node
= default_conversion (atexit_fndecl
);
8081 pop_lang_context ();
8085 /* Call build_cleanup before we enter the anonymous function so that
8086 any access checks will be done relative to the current scope,
8087 rather than the scope of the anonymous function. */
8088 build_cleanup (decl
);
8090 /* Now start the function. */
8091 cleanup
= start_anon_func ();
8093 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8094 to the original function, rather than the anonymous one. That
8095 will make the back-end think that nested functions are in use,
8096 which causes confusion. */
8097 saved_flag_access_control
= flag_access_control
;
8098 flag_access_control
= 0;
8099 fcall
= build_cleanup (decl
);
8100 flag_access_control
= saved_flag_access_control
;
8102 /* Create the body of the anonymous function. */
8103 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8104 finish_expr_stmt (fcall
);
8105 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8108 /* Call atexit with the cleanup function. */
8109 mark_addressable (cleanup
);
8110 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8111 fcall
= build_function_call (atexit_node
,
8112 tree_cons (NULL_TREE
,
8115 finish_expr_stmt (fcall
);
8119 expand_static_init (decl
, init
)
8123 tree oldstatic
= value_member (decl
, static_aggregates
);
8127 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8128 cp_error ("multiple initializations given for `%D'", decl
);
8130 else if (! toplevel_bindings_p ())
8132 /* Emit code to perform this initialization but once. */
8139 /* Remember this information until end of file. */
8140 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8142 /* Emit code to perform this initialization but once. This code
8145 static int temp = 0;
8147 // Do initialization.
8149 // Register variable for destruction at end of program.
8152 Note that the `temp' variable is only set to 1 *after* the
8153 initialization is complete. This ensures that an exception,
8154 thrown during the construction, will cause the variable to
8155 reinitialized when we pass through this code again, as per:
8159 If the initialization exits by throwing an exception, the
8160 initialization is not complete, so it will be tried again
8161 the next time control enters the declaration.
8163 In theory, this process should be thread-safe, too; multiple
8164 threads should not be able to initialize the variable more
8165 than once. We don't yet attempt to ensure thread-safety. */
8166 temp
= get_temp_name (integer_type_node
, 1);
8167 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8169 /* Begin the conditional initialization. */
8170 if_stmt
= begin_if_stmt ();
8171 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
8174 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8176 /* Do the initialization itself. */
8177 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8178 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8179 assignment
= build_aggr_init (decl
, init
, 0);
8181 /* The initialization we're doing here is just a bitwise
8183 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8185 assignment
= NULL_TREE
;
8187 /* Once the assignment is complete, set TEMP to 1. Since the
8188 construction of the static object is complete at this point,
8189 we want to make sure TEMP is set to 1 even if a temporary
8190 constructed during the initialization throws an exception
8191 when it is destroyed. So, we combine the initialization and
8192 the assignment to TEMP into a single expression, ensuring
8193 that when we call finish_expr_stmt the cleanups will not be
8194 run until after TEMP is set to 1. */
8195 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8198 assignment
= tree_cons (NULL_TREE
, assignment
,
8199 build_tree_list (NULL_TREE
,
8201 assignment
= build_compound_expr (assignment
);
8204 assignment
= temp_init
;
8205 finish_expr_stmt (assignment
);
8207 /* Use atexit to register a function for destroying this static
8209 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8210 destroy_local_static (decl
);
8212 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8213 finish_then_clause (if_stmt
);
8216 /* Resume old (possibly temporary) allocation. */
8221 /* This code takes into account memory allocation policy of
8222 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8223 hold for this object, then we must make permanent the storage
8224 currently in the temporary obstack. */
8225 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8226 preserve_initializer ();
8227 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8231 /* Finish the declaration of a catch-parameter. */
8234 start_handler_parms (declspecs
, declarator
)
8241 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8243 if (decl
== NULL_TREE
)
8244 error ("invalid catch parameter");
8248 expand_start_catch_block (decl
);
8252 /* Make TYPE a complete type based on INITIAL_VALUE.
8253 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8254 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8257 complete_array_type (type
, initial_value
, do_default
)
8258 tree type
, initial_value
;
8261 register tree maxindex
= NULL_TREE
;
8264 /* Allocate on the same obstack as TYPE. */
8265 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8269 /* Note MAXINDEX is really the maximum index,
8270 one less than the size. */
8271 if (TREE_CODE (initial_value
) == STRING_CST
)
8274 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8275 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8278 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8280 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8281 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8282 for (; elts
; elts
= TREE_CHAIN (elts
))
8284 if (TREE_PURPOSE (elts
))
8285 maxindex
= TREE_PURPOSE (elts
);
8287 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8289 maxindex
= copy_node (maxindex
);
8293 /* Make an error message unless that happened already. */
8294 if (initial_value
!= error_mark_node
)
8297 initial_value
= NULL_TREE
;
8299 /* Prevent further error messages. */
8300 maxindex
= build_int_2 (0, 0);
8307 maxindex
= build_int_2 (0, 0);
8316 domain
= build_index_type (maxindex
);
8317 TYPE_DOMAIN (type
) = domain
;
8319 if (! TREE_TYPE (maxindex
))
8320 TREE_TYPE (maxindex
) = domain
;
8322 itype
= TREE_TYPE (initial_value
);
8325 if (itype
&& !TYPE_DOMAIN (itype
))
8326 TYPE_DOMAIN (itype
) = domain
;
8327 /* The type of the main variant should never be used for arrays
8328 of different sizes. It should only ever be completed with the
8329 size of the array. */
8330 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8331 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8336 /* Lay out the type now that we can get the real answer. */
8343 /* Return zero if something is declared to be a member of type
8344 CTYPE when in the context of CUR_TYPE. STRING is the error
8345 message to print in that case. Otherwise, quietly return 1. */
8348 member_function_or_else (ctype
, cur_type
, string
)
8349 tree ctype
, cur_type
;
8352 if (ctype
&& ctype
!= cur_type
)
8354 error (string
, TYPE_NAME_STRING (ctype
));
8360 /* Subroutine of `grokdeclarator'. */
8362 /* Generate errors possibly applicable for a given set of specifiers.
8363 This is for ARM $7.1.2. */
8366 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8369 int virtualp
, quals
, friendp
, raises
, inlinep
;
8372 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8374 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8376 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8379 cp_error_at ("`%D' declared as a friend", object
);
8381 cp_error_at ("`%D' declared with an exception specification", object
);
8384 /* CTYPE is class type, or null if non-class.
8385 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8387 DECLARATOR is the function's name.
8388 VIRTUALP is truthvalue of whether the function is virtual or not.
8389 FLAGS are to be passed through to `grokclassfn'.
8390 QUALS are qualifiers indicating whether the function is `const'
8392 RAISES is a list of exceptions that this function can raise.
8393 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8394 not look, and -1 if we should not call `grokclassfn' at all.
8396 Returns `NULL_TREE' if something goes wrong, after issuing
8397 applicable error messages. */
8400 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8401 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8402 template_count
, in_namespace
)
8405 tree orig_declarator
;
8407 enum overload_flags flags
;
8409 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8413 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8414 int has_default_arg
= 0;
8418 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8419 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8425 type
= build_exception_variant (type
, raises
);
8428 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8429 /* Propagate volatile out from type to decl. */
8430 if (TYPE_VOLATILE (type
))
8431 TREE_THIS_VOLATILE (decl
) = 1;
8433 /* If this decl has namespace scope, set that up. */
8435 set_decl_namespace (decl
, in_namespace
, friendp
);
8436 else if (publicp
&& ! ctype
)
8437 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8439 /* `main' and builtins have implicit 'C' linkage. */
8440 if ((MAIN_NAME_P (declarator
)
8441 || (IDENTIFIER_LENGTH (declarator
) > 10
8442 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8443 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8444 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8445 && current_lang_name
== lang_name_cplusplus
8446 && ctype
== NULL_TREE
8447 /* NULL_TREE means global namespace. */
8448 && DECL_CONTEXT (decl
) == NULL_TREE
)
8449 DECL_LANGUAGE (decl
) = lang_c
;
8451 /* Should probably propagate const out from type to decl I bet (mrs). */
8454 DECL_STATIC_FUNCTION_P (decl
) = 1;
8455 DECL_CONTEXT (decl
) = ctype
;
8459 DECL_CLASS_CONTEXT (decl
) = ctype
;
8461 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8463 if (processing_template_decl
)
8464 error ("cannot declare `main' to be a template");
8466 error ("cannot declare `main' to be inline");
8468 error ("cannot declare `main' to be static");
8473 /* Members of anonymous types and local classes have no linkage; make
8475 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8476 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8481 /* [basic.link]: A name with no linkage (notably, the name of a class
8482 or enumeration declared in a local scope) shall not be used to
8483 declare an entity with linkage.
8485 Only check this for public decls for now. */
8486 t
= no_linkage_check (TREE_TYPE (decl
));
8489 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8491 if (DECL_LANGUAGE (decl
) == lang_c
)
8492 /* Allow this; it's pretty common in C. */;
8494 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8498 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8503 TREE_PUBLIC (decl
) = publicp
;
8506 DECL_INTERFACE_KNOWN (decl
) = 1;
8507 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8511 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8513 DECL_EXTERNAL (decl
) = 1;
8514 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8516 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8517 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8521 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8522 grok_op_properties (decl
, virtualp
, check
< 0);
8524 if (ctype
&& hack_decl_function_context (decl
))
8525 DECL_NO_STATIC_CHAIN (decl
) = 1;
8527 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8528 if (TREE_PURPOSE (t
)
8529 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8531 has_default_arg
= 1;
8536 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8540 ("defining explicit specialization `%D' in friend declaration",
8544 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8546 /* Something like `template <class T> friend void f<T>()'. */
8547 cp_error ("template-id `%D' in declaration of primary template",
8553 /* A friend declaration of the form friend void f<>(). Record
8554 the information in the TEMPLATE_ID_EXPR. */
8555 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8556 DECL_TEMPLATE_INFO (decl
)
8557 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8558 TREE_OPERAND (orig_declarator
, 1),
8561 if (has_default_arg
)
8563 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8570 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8577 if (has_default_arg
)
8578 add_defarg_fn (decl
);
8580 /* Plain overloading: will not be grok'd by grokclassfn. */
8581 if (! ctype
&& ! processing_template_decl
8582 && DECL_LANGUAGE (decl
) != lang_c
8583 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8584 set_mangled_name_for_decl (decl
);
8587 /* Make the init_value nonzero so pushdecl knows this is not
8588 tentative. error_mark_node is replaced later with the BLOCK. */
8589 DECL_INITIAL (decl
) = error_mark_node
;
8591 /* Caller will do the rest of this. */
8595 if (check
&& funcdef_flag
)
8596 DECL_INITIAL (decl
) = error_mark_node
;
8598 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8601 /* Just handle constructors here. We could do this
8602 inside the following if stmt, but I think
8603 that the code is more legible by breaking this
8604 case out. See comments below for what each of
8605 the following calls is supposed to do. */
8606 DECL_CONSTRUCTOR_P (decl
) = 1;
8608 grokclassfn (ctype
, decl
, flags
, quals
);
8610 decl
= check_explicit_specialization (orig_declarator
, decl
,
8612 2 * (funcdef_flag
!= 0) +
8613 4 * (friendp
!= 0));
8614 if (decl
== error_mark_node
)
8617 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8620 tmp
= check_classfn (ctype
, decl
);
8622 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8623 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8625 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8626 cp_error ("definition of implicitly-declared `%D'", tmp
);
8627 if (tmp
&& duplicate_decls (decl
, tmp
))
8630 if (! grok_ctor_properties (ctype
, decl
))
8637 /* Function gets the ugly name, field gets the nice one.
8638 This call may change the type of the function (because
8639 of default parameters)! */
8640 if (ctype
!= NULL_TREE
)
8641 grokclassfn (ctype
, decl
, flags
, quals
);
8643 decl
= check_explicit_specialization (orig_declarator
, decl
,
8645 2 * (funcdef_flag
!= 0) +
8646 4 * (friendp
!= 0));
8647 if (decl
== error_mark_node
)
8650 if (ctype
!= NULL_TREE
8651 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8654 tmp
= check_classfn (ctype
, decl
);
8656 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8657 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8659 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8660 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8662 /* Remove the `this' parm added by grokclassfn.
8663 XXX Isn't this done in start_function, too? */
8664 revert_static_member_fn (&decl
, NULL
, NULL
);
8665 last_function_parms
= TREE_CHAIN (last_function_parms
);
8667 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8668 cp_error ("definition of implicitly-declared `%D'", tmp
);
8671 /* Attempt to merge the declarations. This can fail, in
8672 the case of some illegal specialization declarations. */
8673 if (!duplicate_decls (decl
, tmp
))
8674 cp_error ("no `%#D' member function declared in class `%T'",
8680 if (ctype
== NULL_TREE
|| check
)
8685 DECL_VIRTUAL_P (decl
) = 1;
8686 if (DECL_VINDEX (decl
) == NULL_TREE
)
8687 DECL_VINDEX (decl
) = error_mark_node
;
8688 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8695 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8698 RID_BIT_TYPE
*specbits_in
;
8704 RID_BIT_TYPE specbits
;
8706 specbits
= *specbits_in
;
8708 if (TREE_CODE (type
) == OFFSET_TYPE
)
8710 /* If you declare a static member so that it
8711 can be initialized, the code will reach here. */
8712 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8713 type
= TREE_TYPE (type
);
8714 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8715 DECL_CONTEXT (decl
) = basetype
;
8716 DECL_CLASS_CONTEXT (decl
) = basetype
;
8717 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8724 context
= in_namespace
;
8725 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8726 context
= current_namespace
;
8728 context
= NULL_TREE
;
8730 if (processing_template_decl
)
8732 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8733 we can call push_template_decl. */
8734 push_permanent_obstack ();
8735 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8739 decl
= build_decl (VAR_DECL
, declarator
, type
);
8742 set_decl_namespace (decl
, context
, 0);
8744 context
= DECL_CONTEXT (decl
);
8745 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8746 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8750 set_decl_namespace (decl
, in_namespace
, 0);
8752 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8754 DECL_THIS_EXTERN (decl
) = 1;
8755 DECL_EXTERNAL (decl
) = !initialized
;
8758 /* In class context, static means one per class,
8759 public access, and static storage. */
8760 if (DECL_CLASS_SCOPE_P (decl
))
8762 TREE_PUBLIC (decl
) = 1;
8763 TREE_STATIC (decl
) = 1;
8764 DECL_EXTERNAL (decl
) = 0;
8766 /* At top level, either `static' or no s.c. makes a definition
8767 (perhaps tentative), and absence of `static' makes it public. */
8768 else if (toplevel_bindings_p ())
8770 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8771 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8772 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8774 /* Not at top level, only `static' makes a static definition. */
8777 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8778 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8781 if (TREE_PUBLIC (decl
))
8783 /* [basic.link]: A name with no linkage (notably, the name of a class
8784 or enumeration declared in a local scope) shall not be used to
8785 declare an entity with linkage.
8787 Only check this for public decls for now. */
8788 tree t
= no_linkage_check (TREE_TYPE (decl
));
8791 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8792 /* Ignore for now; `enum { foo } e' is pretty common. */;
8794 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8802 /* Create and return a canonical pointer to member function type, for
8803 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8806 build_ptrmemfunc_type (type
)
8812 tree unqualified_variant
= NULL_TREE
;
8814 /* If a canonical type already exists for this type, use it. We use
8815 this method instead of type_hash_canon, because it only does a
8816 simple equality check on the list of field members. */
8818 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8821 /* Make sure that we always have the unqualified pointer-to-member
8823 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8825 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8827 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8829 u
= make_lang_type (UNION_TYPE
);
8830 SET_IS_AGGR_TYPE (u
, 0);
8831 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8832 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8834 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8835 TYPE_NAME (u
) = NULL_TREE
;
8837 t
= make_lang_type (RECORD_TYPE
);
8839 /* Let the front-end know this is a pointer to member function... */
8840 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8841 /* ... and not really an aggregate. */
8842 SET_IS_AGGR_TYPE (t
, 0);
8844 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8846 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8848 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8849 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8853 /* Zap out the name so that the back-end will give us the debugging
8854 information for this anonymous RECORD_TYPE. */
8855 TYPE_NAME (t
) = NULL_TREE
;
8857 /* If this is not the unqualified form of this pointer-to-member
8858 type, set the TYPE_MAIN_VARIANT for this type to be the
8859 unqualified type. Since they are actually RECORD_TYPEs that are
8860 not variants of each other, we must do this manually. */
8861 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8863 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8864 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8865 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8866 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8869 /* Cache this pointer-to-member type so that we can find it again
8871 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8873 /* Seems to be wanted. */
8874 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8879 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8880 Check to see that the definition is valid. Issue appropriate error
8881 messages. Return 1 if the definition is particularly bad, or 0
8885 check_static_variable_definition (decl
, type
)
8889 /* Motion 10 at San Diego: If a static const integral data member is
8890 initialized with an integral constant expression, the initializer
8891 may appear either in the declaration (within the class), or in
8892 the definition, but not both. If it appears in the class, the
8893 member is a member constant. The file-scope definition is always
8895 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8897 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8899 /* If we just return the declaration, crashes will sometimes
8900 occur. We therefore return void_type_node, as if this was a
8901 friend declaration, to cause callers to completely ignore
8902 this declaration. */
8905 else if (!CP_TYPE_CONST_P (type
))
8906 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8908 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8909 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8914 /* Given declspecs and a declarator,
8915 determine the name and type of the object declared
8916 and construct a ..._DECL node for it.
8917 (In one case we can return a ..._TYPE node instead.
8918 For invalid input we sometimes return 0.)
8920 DECLSPECS is a chain of tree_list nodes whose value fields
8921 are the storage classes and type specifiers.
8923 DECL_CONTEXT says which syntactic context this declaration is in:
8924 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8925 FUNCDEF for a function definition. Like NORMAL but a few different
8926 error messages in each case. Return value may be zero meaning
8927 this definition is too screwy to try to parse.
8928 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8929 handle member functions (which have FIELD context).
8930 Return value may be zero meaning this definition is too screwy to
8932 PARM for a parameter declaration (either within a function prototype
8933 or before a function body). Make a PARM_DECL, or return void_type_node.
8934 CATCHPARM for a parameter declaration before a catch clause.
8935 TYPENAME if for a typename (in a cast or sizeof).
8936 Don't make a DECL node; just return the ..._TYPE node.
8937 FIELD for a struct or union field; make a FIELD_DECL.
8938 BITFIELD for a field with specified width.
8939 INITIALIZED is 1 if the decl has an initializer.
8941 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8942 normal attributes in TREE_PURPOSE, or NULL_TREE.
8944 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8945 It may also be so in the PARM case, for a prototype where the
8946 argument type is specified but not the name.
8948 This function is where the complicated C meanings of `static'
8949 and `extern' are interpreted.
8951 For C++, if there is any monkey business to do, the function which
8952 calls this one must do it, i.e., prepending instance variables,
8953 renaming overloaded function names, etc.
8955 Note that for this C++, it is an error to define a method within a class
8956 which does not belong to that class.
8958 Except in the case where SCOPE_REFs are implicitly known (such as
8959 methods within a class being redundantly qualified),
8960 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8961 (class_name::decl_name). The caller must also deal with this.
8963 If a constructor or destructor is seen, and the context is FIELD,
8964 then the type gains the attribute TREE_HAS_x. If such a declaration
8965 is erroneous, NULL_TREE is returned.
8967 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8968 function, these are the qualifiers to give to the `this' pointer.
8970 May return void_type_node if the declarator turned out to be a friend.
8971 See grokfield for details. */
8973 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8976 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8979 enum decl_context decl_context
;
8983 RID_BIT_TYPE specbits
;
8986 tree type
= NULL_TREE
;
8992 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8993 int explicit_int
= 0;
8994 int explicit_char
= 0;
8995 int defaulted_int
= 0;
8996 tree typedef_decl
= NULL_TREE
;
8998 tree typedef_type
= NULL_TREE
;
8999 int funcdef_flag
= 0;
9000 enum tree_code innermost_code
= ERROR_MARK
;
9003 /* See the code below that used this. */
9004 tree decl_machine_attr
= NULL_TREE
;
9006 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9007 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9008 tree init
= NULL_TREE
;
9010 /* Keep track of what sort of function is being processed
9011 so that we can warn about default return values, or explicit
9012 return values which do not match prescribed defaults. */
9013 enum return_types return_type
= return_normal
;
9015 tree dname
= NULL_TREE
;
9016 tree ctype
= current_class_type
;
9017 tree ctor_return_type
= NULL_TREE
;
9018 enum overload_flags flags
= NO_SPECIAL
;
9019 tree quals
= NULL_TREE
;
9020 tree raises
= NULL_TREE
;
9021 int template_count
= 0;
9022 tree in_namespace
= NULL_TREE
;
9026 RIDBIT_RESET_ALL (specbits
);
9027 if (decl_context
== FUNCDEF
)
9028 funcdef_flag
= 1, decl_context
= NORMAL
;
9029 else if (decl_context
== MEMFUNCDEF
)
9030 funcdef_flag
= -1, decl_context
= FIELD
;
9031 else if (decl_context
== BITFIELD
)
9032 bitfield
= 1, decl_context
= FIELD
;
9034 /* Look inside a declarator for the name being declared
9035 and get it as a string, for an error message. */
9037 tree
*next
= &declarator
;
9041 while (next
&& *next
)
9044 switch (TREE_CODE (decl
))
9047 /* For attributes. */
9048 next
= &TREE_VALUE (decl
);
9053 next
= &TREE_OPERAND (decl
, 0);
9056 case BIT_NOT_EXPR
: /* For C++ destructors! */
9058 tree name
= TREE_OPERAND (decl
, 0);
9059 tree rename
= NULL_TREE
;
9061 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9063 return_type
= return_dtor
;
9064 if (TREE_CODE (name
) == TYPE_DECL
)
9065 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9066 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9067 if (ctype
== NULL_TREE
)
9069 if (current_class_type
== NULL_TREE
)
9071 error ("destructors must be member functions");
9076 tree t
= constructor_name (current_class_name
);
9083 tree t
= constructor_name (ctype
);
9090 cp_error ("destructor `%T' must match class name `%T'",
9092 TREE_OPERAND (decl
, 0) = rename
;
9098 case ADDR_EXPR
: /* C++ reference declaration */
9103 innermost_code
= TREE_CODE (decl
);
9104 next
= &TREE_OPERAND (decl
, 0);
9108 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9110 /* This is actually a variable declaration using
9111 constructor syntax. We need to call start_decl and
9112 cp_finish_decl so we can get the variable
9115 tree attributes
, prefix_attributes
;
9117 *next
= TREE_OPERAND (decl
, 0);
9118 init
= CALL_DECLARATOR_PARMS (decl
);
9122 attributes
= TREE_PURPOSE (attrlist
);
9123 prefix_attributes
= TREE_VALUE (attrlist
);
9127 attributes
= NULL_TREE
;
9128 prefix_attributes
= NULL_TREE
;
9131 decl
= start_decl (declarator
, declspecs
, 1,
9132 attributes
, prefix_attributes
);
9135 /* Look for __unused__ attribute */
9136 if (TREE_USED (TREE_TYPE (decl
)))
9137 TREE_USED (decl
) = 1;
9138 finish_decl (decl
, init
, NULL_TREE
);
9141 cp_error ("invalid declarator");
9144 innermost_code
= TREE_CODE (decl
);
9145 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9146 ctype
= current_class_type
;
9148 && TREE_OPERAND (decl
, 0)
9149 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9150 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9151 == constructor_name_full (ctype
))
9152 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9153 == constructor_name (ctype
)))))
9154 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9155 next
= &TREE_OPERAND (decl
, 0);
9157 if (ctype
!= NULL_TREE
9158 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9159 && decl
== constructor_name (ctype
))
9161 return_type
= return_ctor
;
9162 ctor_return_type
= ctype
;
9167 case TEMPLATE_ID_EXPR
:
9169 tree fns
= TREE_OPERAND (decl
, 0);
9171 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9172 fns
= TREE_OPERAND (fns
, 0);
9175 if (TREE_CODE (dname
) == COMPONENT_REF
)
9176 dname
= TREE_OPERAND (dname
, 1);
9177 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9179 my_friendly_assert (is_overloaded_fn (dname
),
9181 dname
= DECL_NAME (get_first_fn (dname
));
9186 case IDENTIFIER_NODE
:
9187 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9194 cp_error ("declarator-id missing; using reserved word `%D'",
9196 name
= IDENTIFIER_POINTER (dname
);
9198 if (! IDENTIFIER_OPNAME_P (dname
)
9199 /* GNU/Linux headers use '__op'. Arrgh. */
9200 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9201 name
= IDENTIFIER_POINTER (dname
);
9204 if (IDENTIFIER_TYPENAME_P (dname
))
9206 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9207 flags
= TYPENAME_FLAG
;
9208 ctor_return_type
= TREE_TYPE (dname
);
9209 return_type
= return_conversion
;
9211 name
= operator_name_string (dname
);
9218 /* Perform error checking, and decide on a ctype. */
9219 tree cname
= TREE_OPERAND (decl
, 0);
9220 if (cname
== NULL_TREE
)
9222 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9225 in_namespace
= TREE_OPERAND (decl
, 0);
9226 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9228 else if (! is_aggr_type (cname
, 1))
9229 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9230 /* Must test TREE_OPERAND (decl, 1), in case user gives
9231 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9232 else if (TREE_OPERAND (decl
, 1)
9233 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9235 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9236 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9238 cp_error ("`%T::%D' is not a valid declarator", cname
,
9239 TREE_OPERAND (decl
, 1));
9240 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9241 cname
, TREE_OPERAND (decl
, 1));
9242 return void_type_node
;
9244 else if (ctype
== NULL_TREE
)
9246 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9247 TREE_OPERAND (decl
, 0) = ctype
;
9250 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9252 cp_error ("type `%T' is not derived from type `%T'",
9254 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9260 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9261 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9262 == constructor_name_full (ctype
))
9263 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9264 == constructor_name (ctype
))))
9265 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9266 next
= &TREE_OPERAND (decl
, 1);
9270 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9271 && constructor_name (ctype
) == decl
)
9273 return_type
= return_ctor
;
9274 ctor_return_type
= ctype
;
9276 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9277 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9278 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9279 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9281 return_type
= return_dtor
;
9282 ctor_return_type
= ctype
;
9284 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9285 next
= &TREE_OPERAND (decl
, 0);
9296 /* Parse error puts this typespec where
9297 a declarator should go. */
9298 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9299 if (TREE_TYPE (decl
) == current_class_type
)
9300 cp_error (" perhaps you want `%T' for a constructor",
9301 current_class_name
);
9302 dname
= DECL_NAME (decl
);
9303 name
= IDENTIFIER_POINTER (dname
);
9305 /* Avoid giving two errors for this. */
9306 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9308 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9315 cp_compiler_error ("`%D' as declarator", decl
);
9316 return 0; /* We used to do a 155 abort here. */
9323 /* A function definition's declarator must have the form of
9324 a function declarator. */
9326 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9329 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9330 && innermost_code
!= CALL_EXPR
9331 && ! (ctype
&& declspecs
== NULL_TREE
))
9333 cp_error ("declaration of `%D' as non-function", dname
);
9334 return void_type_node
;
9337 /* Anything declared one level down from the top level
9338 must be one of the parameters of a function
9339 (because the body is at least two levels down). */
9341 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9342 by not allowing C++ class definitions to specify their parameters
9343 with xdecls (must be spec.d in the parmlist).
9345 Since we now wait to push a class scope until we are sure that
9346 we are in a legitimate method context, we must set oldcname
9347 explicitly (since current_class_name is not yet alive).
9349 We also want to avoid calling this a PARM if it is in a namespace. */
9351 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9353 struct binding_level
*b
= current_binding_level
;
9354 current_binding_level
= b
->level_chain
;
9355 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9356 decl_context
= PARM
;
9357 current_binding_level
= b
;
9360 /* Look through the decl specs and record which ones appear.
9361 Some typespecs are defined as built-in typenames.
9362 Others, the ones that are modifiers of other types,
9363 are represented by bits in SPECBITS: set the bits for
9364 the modifiers that appear. Storage class keywords are also in SPECBITS.
9366 If there is a typedef name or a type, store the type in TYPE.
9367 This includes builtin typedefs such as `int'.
9369 Set EXPLICIT_INT if the type is `int' or `char' and did not
9370 come from a user typedef.
9372 Set LONGLONG if `long' is mentioned twice.
9374 For C++, constructors and destructors have their own fast treatment. */
9376 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9381 /* Certain parse errors slip through. For example,
9382 `int class;' is not caught by the parser. Try
9383 weakly to recover here. */
9384 if (TREE_CODE (spec
) != TREE_LIST
)
9387 id
= TREE_VALUE (spec
);
9389 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9391 if (id
== ridpointers
[(int) RID_INT
]
9392 || id
== ridpointers
[(int) RID_CHAR
]
9393 || id
== ridpointers
[(int) RID_BOOL
]
9394 || id
== ridpointers
[(int) RID_WCHAR
])
9398 if (id
== ridpointers
[(int) RID_BOOL
])
9399 error ("`bool' is now a keyword");
9401 cp_error ("extraneous `%T' ignored", id
);
9405 if (id
== ridpointers
[(int) RID_INT
])
9407 else if (id
== ridpointers
[(int) RID_CHAR
])
9409 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9413 /* C++ aggregate types. */
9414 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9417 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9419 type
= IDENTIFIER_TYPE_VALUE (id
);
9423 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9425 if (ridpointers
[i
] == id
)
9427 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9429 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9430 pedwarn ("ANSI C++ does not support `long long'");
9432 error ("`long long long' is too long for GCC");
9436 else if (RIDBIT_SETP (i
, specbits
))
9437 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9438 RIDBIT_SET (i
, specbits
);
9443 /* C++ aggregate types. */
9444 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9447 cp_error ("multiple declarations `%T' and `%T'", type
,
9451 type
= TREE_TYPE (id
);
9452 TREE_VALUE (spec
) = type
;
9457 error ("two or more data types in declaration of `%s'", name
);
9458 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9460 register tree t
= lookup_name (id
, 1);
9461 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9462 error ("`%s' fails to be a typedef or built in type",
9463 IDENTIFIER_POINTER (id
));
9466 type
= TREE_TYPE (t
);
9468 /* See the code below that used this. */
9469 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9474 else if (id
!= error_mark_node
)
9475 /* Can't change CLASS nodes into RECORD nodes here! */
9481 typedef_type
= type
;
9483 /* No type at all: default to `int', and set DEFAULTED_INT
9484 because it was not a user-defined typedef. */
9486 if (type
== NULL_TREE
9487 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9488 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9489 || RIDBIT_SETP (RID_LONG
, specbits
)
9490 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9492 /* These imply 'int'. */
9493 type
= integer_type_node
;
9497 if (type
== NULL_TREE
)
9500 if (return_type
== return_dtor
)
9501 type
= void_type_node
;
9502 else if (return_type
== return_ctor
)
9503 type
= build_pointer_type (ctor_return_type
);
9504 else if (return_type
== return_conversion
)
9505 type
= ctor_return_type
;
9508 /* We handle `main' specially here, because 'main () { }' is so
9509 common. With no options, it is allowed. With -Wreturn-type,
9510 it is a warning. It is only an error with -pedantic-errors. */
9511 int is_main
= (funcdef_flag
9512 && MAIN_NAME_P (dname
)
9513 && ctype
== NULL_TREE
9514 && in_namespace
== NULL_TREE
9515 && current_namespace
== global_namespace
);
9517 if (in_system_header
|| flag_ms_extensions
)
9518 /* Allow it, sigh. */;
9519 else if (pedantic
|| ! is_main
)
9520 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9522 else if (warn_return_type
)
9523 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9526 type
= integer_type_node
;
9529 else if (return_type
== return_dtor
)
9531 error ("return type specification for destructor invalid");
9532 type
= void_type_node
;
9534 else if (return_type
== return_ctor
)
9536 error ("return type specification for constructor invalid");
9537 type
= build_pointer_type (ctor_return_type
);
9539 else if (return_type
== return_conversion
)
9541 if (!same_type_p (type
, ctor_return_type
))
9542 cp_error ("operator `%T' declared to return `%T'",
9543 ctor_return_type
, type
);
9545 cp_pedwarn ("return type specified for `operator %T'",
9548 type
= ctor_return_type
;
9553 /* Now process the modifiers that were specified
9554 and check for invalid combinations. */
9556 /* Long double is a special combination. */
9558 if (RIDBIT_SETP (RID_LONG
, specbits
)
9559 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9561 RIDBIT_RESET (RID_LONG
, specbits
);
9562 type
= build_qualified_type (long_double_type_node
,
9563 CP_TYPE_QUALS (type
));
9566 /* Check all other uses of type modifiers. */
9568 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9569 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9570 || RIDBIT_SETP (RID_LONG
, specbits
)
9571 || RIDBIT_SETP (RID_SHORT
, specbits
))
9575 if (TREE_CODE (type
) == REAL_TYPE
)
9576 error ("short, signed or unsigned invalid for `%s'", name
);
9577 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9578 error ("long, short, signed or unsigned invalid for `%s'", name
);
9579 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9580 && RIDBIT_SETP (RID_SHORT
, specbits
))
9581 error ("long and short specified together for `%s'", name
);
9582 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9583 || RIDBIT_SETP (RID_SHORT
, specbits
))
9585 error ("long or short specified with char for `%s'", name
);
9586 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9587 || RIDBIT_SETP (RID_SHORT
, specbits
))
9588 && TREE_CODE (type
) == REAL_TYPE
)
9589 error ("long or short specified with floating type for `%s'", name
);
9590 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9591 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9592 error ("signed and unsigned given together for `%s'", name
);
9596 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9598 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9600 if (flag_pedantic_errors
)
9605 /* Discard the type modifiers if they are invalid. */
9608 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9609 RIDBIT_RESET (RID_SIGNED
, specbits
);
9610 RIDBIT_RESET (RID_LONG
, specbits
);
9611 RIDBIT_RESET (RID_SHORT
, specbits
);
9616 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9617 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9619 error ("complex invalid for `%s'", name
);
9620 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9623 /* Decide whether an integer type is signed or not.
9624 Optionally treat bitfields as signed by default. */
9625 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9628 It is implementation-defined whether a plain (neither
9629 explicitly signed or unsigned) char, short, int, or long
9630 bit-field is signed or unsigned.
9632 Naturally, we extend this to long long as well. Note that
9633 this does not include wchar_t. */
9634 || (bitfield
&& !flag_signed_bitfields
9635 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9636 /* A typedef for plain `int' without `signed' can be
9637 controlled just like plain `int', but a typedef for
9638 `signed int' cannot be so controlled. */
9640 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9641 && (TREE_CODE (type
) == INTEGER_TYPE
9642 || TREE_CODE (type
) == CHAR_TYPE
)
9643 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9646 type
= long_long_unsigned_type_node
;
9647 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9648 type
= long_unsigned_type_node
;
9649 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9650 type
= short_unsigned_type_node
;
9651 else if (type
== char_type_node
)
9652 type
= unsigned_char_type_node
;
9653 else if (typedef_decl
)
9654 type
= unsigned_type (type
);
9656 type
= unsigned_type_node
;
9658 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9659 && type
== char_type_node
)
9660 type
= signed_char_type_node
;
9662 type
= long_long_integer_type_node
;
9663 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9664 type
= long_integer_type_node
;
9665 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9666 type
= short_integer_type_node
;
9668 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9670 /* If we just have "complex", it is equivalent to
9671 "complex double", but if any modifiers at all are specified it is
9672 the complex form of TYPE. E.g, "complex short" is
9673 "complex short int". */
9675 if (defaulted_int
&& ! longlong
9676 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9677 || RIDBIT_SETP (RID_SHORT
, specbits
)
9678 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9679 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9680 type
= complex_double_type_node
;
9681 else if (type
== integer_type_node
)
9682 type
= complex_integer_type_node
;
9683 else if (type
== float_type_node
)
9684 type
= complex_float_type_node
;
9685 else if (type
== double_type_node
)
9686 type
= complex_double_type_node
;
9687 else if (type
== long_double_type_node
)
9688 type
= complex_long_double_type_node
;
9690 type
= build_complex_type (type
);
9693 if (return_type
== return_conversion
9694 && (RIDBIT_SETP (RID_CONST
, specbits
)
9695 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9696 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9697 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9700 /* Set CONSTP if this declaration is `const', whether by
9701 explicit specification or via a typedef.
9702 Likewise for VOLATILEP. */
9704 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9706 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9708 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9709 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9710 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9711 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9712 type
= cp_build_qualified_type (type
, type_quals
);
9714 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9715 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9716 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9717 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9718 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9720 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9721 staticp
= 1 + (decl_context
== FIELD
);
9723 if (virtualp
&& staticp
== 2)
9725 cp_error ("member `%D' cannot be declared both virtual and static",
9729 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9730 RIDBIT_RESET (RID_FRIEND
, specbits
);
9732 /* $7.1.2, Function specifiers */
9733 if (friendp
&& explicitp
)
9734 error ("only declarations of constructors can be `explicit'");
9736 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9738 if (decl_context
== PARM
)
9740 error ("non-member `%s' cannot be declared `mutable'", name
);
9741 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9743 else if (friendp
|| decl_context
== TYPENAME
)
9745 error ("non-object member `%s' cannot be declared `mutable'", name
);
9746 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9750 /* Warn if two storage classes are given. Default to `auto'. */
9752 if (RIDBIT_ANY_SET (specbits
))
9754 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9755 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9756 if (decl_context
== PARM
&& nclasses
> 0)
9757 error ("storage class specifiers invalid in parameter declarations");
9758 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9760 if (decl_context
== PARM
)
9761 error ("typedef declaration invalid in parameter declaration");
9764 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9765 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9768 /* Give error if `virtual' is used outside of class declaration. */
9770 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9772 error ("virtual outside class declaration");
9775 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9777 error ("only members can be declared mutable");
9778 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9781 /* Static anonymous unions are dealt with here. */
9782 if (staticp
&& decl_context
== TYPENAME
9783 && TREE_CODE (declspecs
) == TREE_LIST
9784 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9785 decl_context
= FIELD
;
9787 /* Warn about storage classes that are invalid for certain
9788 kinds of declarations (parameters, typenames, etc.). */
9791 error ("multiple storage classes in declaration of `%s'", name
);
9792 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9794 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9795 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9796 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9798 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9800 else if (decl_context
== FIELD
9801 /* C++ allows static class elements */
9802 && RIDBIT_SETP (RID_STATIC
, specbits
))
9803 /* C++ also allows inlines and signed and unsigned elements,
9804 but in those cases we don't come in here. */
9808 if (decl_context
== FIELD
)
9810 tree tmp
= NULL_TREE
;
9811 register int op
= 0;
9815 /* Avoid trying to get an operand off an identifier node. */
9816 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9819 tmp
= TREE_OPERAND (declarator
, 0);
9820 op
= IDENTIFIER_OPNAME_P (tmp
);
9822 error ("storage class specified for %s `%s'",
9823 op
? "member operator" : "field",
9824 op
? operator_name_string (tmp
) : name
);
9827 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9828 ? "storage class specified for parameter `%s'"
9829 : "storage class specified for typename"), name
);
9830 RIDBIT_RESET (RID_REGISTER
, specbits
);
9831 RIDBIT_RESET (RID_AUTO
, specbits
);
9832 RIDBIT_RESET (RID_EXTERN
, specbits
);
9835 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9837 if (toplevel_bindings_p ())
9839 /* It's common practice (and completely valid) to have a const
9840 be initialized and declared extern. */
9841 if (!(type_quals
& TYPE_QUAL_CONST
))
9842 warning ("`%s' initialized and declared `extern'", name
);
9845 error ("`%s' has both `extern' and initializer", name
);
9847 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9848 && ! toplevel_bindings_p ())
9849 error ("nested function `%s' declared `extern'", name
);
9850 else if (toplevel_bindings_p ())
9852 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9853 error ("top-level declaration of `%s' specifies `auto'", name
);
9856 if (nclasses
> 0 && friendp
)
9857 error ("storage class specifiers invalid in friend function declarations");
9859 /* Now figure out the structure of the declarator proper.
9860 Descend through it, creating more complex types, until we reach
9861 the declared identifier (or NULL_TREE, in an absolute declarator). */
9863 inner_attrs
= NULL_TREE
;
9866 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9867 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9869 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9870 an INDIRECT_REF (for *...),
9871 a CALL_EXPR (for ...(...)),
9872 an identifier (for the name being declared)
9873 or a null pointer (for the place in an absolute declarator
9874 where the name was omitted).
9875 For the last two cases, we have just exited the loop.
9877 For C++ it could also be
9878 a SCOPE_REF (for class :: ...). In this case, we have converted
9879 sensible names to types, and those are the values we use to
9880 qualify the member name.
9881 an ADDR_EXPR (for &...),
9882 a BIT_NOT_EXPR (for destructors)
9884 At this point, TYPE is the type of elements of an array,
9885 or for a function to return, or for a pointer to point to.
9886 After this sequence of ifs, TYPE is the type of the
9887 array or function or pointer, and DECLARATOR has had its
9888 outermost layer removed. */
9890 if (type
== error_mark_node
)
9892 if (TREE_CODE (declarator
) == SCOPE_REF
)
9893 declarator
= TREE_OPERAND (declarator
, 1);
9895 declarator
= TREE_OPERAND (declarator
, 0);
9898 if (quals
!= NULL_TREE
9899 && (declarator
== NULL_TREE
9900 || TREE_CODE (declarator
) != SCOPE_REF
))
9902 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9903 ctype
= TYPE_METHOD_BASETYPE (type
);
9904 if (ctype
!= NULL_TREE
)
9906 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9907 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9908 type
= TREE_TYPE (dummy
);
9913 /* See the comment for the TREE_LIST case, below. */
9916 else if (inner_attrs
)
9918 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9919 inner_attrs
= NULL_TREE
;
9922 switch (TREE_CODE (declarator
))
9926 /* We encode a declarator with embedded attributes using
9927 a TREE_LIST. The attributes apply to the declarator
9928 directly inside them, so we have to skip an iteration
9929 before applying them to the type. If the declarator just
9930 inside is the declarator-id, we apply the attrs to the
9932 inner_attrs
= TREE_PURPOSE (declarator
);
9934 declarator
= TREE_VALUE (declarator
);
9940 register tree itype
= NULL_TREE
;
9941 register tree size
= TREE_OPERAND (declarator
, 1);
9942 /* The index is a signed object `sizetype' bits wide. */
9943 tree index_type
= signed_type (sizetype
);
9945 declarator
= TREE_OPERAND (declarator
, 0);
9947 /* Check for some types that there cannot be arrays of. */
9949 if (TREE_CODE (type
) == VOID_TYPE
)
9951 cp_error ("declaration of `%D' as array of voids", dname
);
9952 type
= error_mark_node
;
9955 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9957 cp_error ("declaration of `%D' as array of functions", dname
);
9958 type
= error_mark_node
;
9961 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9962 you can't have arrays of references. If we allowed them,
9963 then we'd be saying x[i] is valid for an array x, but
9964 then you'd have to ask: what does `*(x + i)' mean? */
9965 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9967 if (decl_context
== TYPENAME
)
9968 cp_error ("cannot make arrays of references");
9970 cp_error ("declaration of `%D' as array of references",
9972 type
= error_mark_node
;
9975 if (TREE_CODE (type
) == OFFSET_TYPE
)
9977 cp_error ("declaration of `%D' as array of data members",
9979 type
= error_mark_node
;
9982 if (TREE_CODE (type
) == METHOD_TYPE
)
9984 cp_error ("declaration of `%D' as array of function members",
9986 type
= error_mark_node
;
9989 if (size
== error_mark_node
)
9990 type
= error_mark_node
;
9991 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9995 the constant expressions that specify the bounds of
9996 the arrays can be omitted only for the first member
9998 cp_error ("declaration of `%D' as multidimensional array",
10000 cp_error ("must have bounds for all dimensions except the first");
10001 type
= error_mark_node
;
10004 if (type
== error_mark_node
)
10007 /* VC++ spells a zero-sized array with []. */
10008 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10009 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10010 size
= integer_zero_node
;
10014 /* Must suspend_momentary here because the index
10015 type may need to live until the end of the function.
10016 For example, it is used in the declaration of a
10017 variable which requires destructing at the end of
10018 the function; then build_vec_delete will need this
10020 int yes
= suspend_momentary ();
10021 /* Might be a cast. */
10022 if (TREE_CODE (size
) == NOP_EXPR
10023 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
10024 size
= TREE_OPERAND (size
, 0);
10025 if (TREE_READONLY_DECL_P (size
))
10026 size
= decl_constant_value (size
);
10028 /* If this involves a template parameter, it will be a
10029 constant at instantiation time, but we don't know
10030 what the value is yet. Even if no template
10031 parameters are involved, we may an expression that
10032 is not a constant; we don't even simplify `1 + 2'
10033 when processing a template. */
10034 if (processing_template_decl
)
10036 /* Resolve a qualified reference to an enumerator or
10037 static const data member of ours. */
10038 if (TREE_CODE (size
) == SCOPE_REF
10039 && TREE_OPERAND (size
, 0) == current_class_type
)
10041 tree t
= lookup_field (current_class_type
,
10042 TREE_OPERAND (size
, 1), 0, 0);
10047 itype
= build_index_type (build_min
10048 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
10049 goto dont_grok_size
;
10052 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
10053 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
10054 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
10056 cp_error ("size of array `%D' has non-integer type",
10058 size
= integer_one_node
;
10060 if (pedantic
&& integer_zerop (size
))
10061 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
10062 if (TREE_CONSTANT (size
))
10064 int old_flag_pedantic_errors
= flag_pedantic_errors
;
10065 int old_pedantic
= pedantic
;
10066 pedantic
= flag_pedantic_errors
= 1;
10067 /* Always give overflow errors on array subscripts. */
10068 constant_expression_warning (size
);
10069 pedantic
= old_pedantic
;
10070 flag_pedantic_errors
= old_flag_pedantic_errors
;
10071 if (INT_CST_LT (size
, integer_zero_node
))
10073 cp_error ("size of array `%D' is negative", dname
);
10074 size
= integer_one_node
;
10082 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
10085 cp_pedwarn ("ANSI C++ forbids variable-size array");
10090 = fold (build_binary_op (MINUS_EXPR
,
10091 cp_convert (index_type
, size
),
10092 cp_convert (index_type
,
10093 integer_one_node
)));
10094 if (! TREE_CONSTANT (itype
))
10095 itype
= variable_size (itype
);
10096 else if (TREE_OVERFLOW (itype
))
10098 error ("overflow in array dimension");
10099 TREE_OVERFLOW (itype
) = 0;
10102 /* If we're a parm, we need to have a permanent type so
10103 mangling checks for re-use will work right. If both the
10104 element and index types are permanent, the array type
10106 if (decl_context
== PARM
10107 && allocation_temporary_p () && TREE_PERMANENT (type
))
10109 push_obstacks (&permanent_obstack
, &permanent_obstack
);
10110 itype
= build_index_type (itype
);
10114 itype
= build_index_type (itype
);
10117 resume_momentary (yes
);
10120 type
= build_cplus_array_type (type
, itype
);
10129 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10130 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10132 /* Declaring a function type.
10133 Make sure we have a valid type for the function to return. */
10135 /* We now know that the TYPE_QUALS don't apply to the
10136 decl, but to its return type. */
10137 type_quals
= TYPE_UNQUALIFIED
;
10139 /* Warn about some types functions can't return. */
10141 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10143 error ("`%s' declared as function returning a function", name
);
10144 type
= integer_type_node
;
10146 if (TREE_CODE (type
) == ARRAY_TYPE
)
10148 error ("`%s' declared as function returning an array", name
);
10149 type
= integer_type_node
;
10152 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10153 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10155 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10156 inner_decl
= dname
;
10158 /* Pick up type qualifiers which should be applied to `this'. */
10159 quals
= CALL_DECLARATOR_QUALS (declarator
);
10161 /* Pick up the exception specifications. */
10162 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10164 /* Say it's a definition only for the CALL_EXPR
10165 closest to the identifier. */
10168 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10169 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10170 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10172 if (ctype
== NULL_TREE
10173 && decl_context
== FIELD
10175 && (friendp
== 0 || dname
== current_class_name
))
10176 ctype
= current_class_type
;
10178 if (ctype
&& return_type
== return_conversion
)
10179 TYPE_HAS_CONVERSION (ctype
) = 1;
10180 if (ctype
&& constructor_name (ctype
) == dname
)
10182 /* We are within a class's scope. If our declarator name
10183 is the same as the class name, and we are defining
10184 a function, then it is a constructor/destructor, and
10185 therefore returns a void type. */
10187 if (flags
== DTOR_FLAG
)
10189 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10190 not be declared const or volatile. A destructor
10191 may not be static. */
10193 error ("destructor cannot be static member function");
10196 cp_error ("destructors may not be `%s'",
10197 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10200 if (decl_context
== FIELD
)
10202 if (! member_function_or_else (ctype
, current_class_type
,
10203 "destructor for alien class `%s' cannot be a member"))
10204 return void_type_node
;
10207 else /* It's a constructor. */
10209 if (explicitp
== 1)
10211 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10212 not be declared const or volatile. A constructor may
10213 not be virtual. A constructor may not be static. */
10215 error ("constructor cannot be static member function");
10218 pedwarn ("constructors cannot be declared virtual");
10223 cp_error ("constructors may not be `%s'",
10224 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10228 RID_BIT_TYPE tmp_bits
;
10229 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10230 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10231 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10232 if (RIDBIT_ANY_SET (tmp_bits
))
10233 error ("return value type specifier for constructor ignored");
10235 type
= build_pointer_type (ctype
);
10236 if (decl_context
== FIELD
)
10238 if (! member_function_or_else (ctype
, current_class_type
,
10239 "constructor for alien class `%s' cannot be member"))
10240 return void_type_node
;
10241 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10242 if (return_type
!= return_ctor
)
10246 if (decl_context
== FIELD
)
10252 error ("can't initialize friend function `%s'", name
);
10255 /* Cannot be both friend and virtual. */
10256 error ("virtual functions cannot be friends");
10257 RIDBIT_RESET (RID_FRIEND
, specbits
);
10260 if (decl_context
== NORMAL
)
10261 error ("friend declaration not in class definition");
10262 if (current_function_decl
&& funcdef_flag
)
10263 cp_error ("can't define friend function `%s' in a local class definition",
10267 /* Construct the function type and go to the next
10268 inner layer of declarator. */
10270 declarator
= TREE_OPERAND (declarator
, 0);
10272 /* FIXME: This is where default args should be fully
10275 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10277 if (declarator
&& flags
== DTOR_FLAG
)
10279 /* A destructor declared in the body of a class will
10280 be represented as a BIT_NOT_EXPR. But, we just
10281 want the underlying IDENTIFIER. */
10282 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10283 declarator
= TREE_OPERAND (declarator
, 0);
10285 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10286 arg_types
= void_list_node
;
10287 else if (arg_types
== NULL_TREE
10288 || arg_types
!= void_list_node
)
10290 cp_error ("destructors may not have parameters");
10291 arg_types
= void_list_node
;
10292 last_function_parms
= NULL_TREE
;
10296 /* ANSI says that `const int foo ();'
10297 does not make the function foo const. */
10298 type
= build_function_type (type
, arg_types
);
10302 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10303 if (TREE_PURPOSE (t
)
10304 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10306 add_defarg_fn (type
);
10315 /* Filter out pointers-to-references and references-to-references.
10316 We can get these if a TYPE_DECL is used. */
10318 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10320 error ("cannot declare %s to references",
10321 TREE_CODE (declarator
) == ADDR_EXPR
10322 ? "references" : "pointers");
10323 declarator
= TREE_OPERAND (declarator
, 0);
10327 if (TREE_CODE (type
) == OFFSET_TYPE
10328 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10329 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10331 cp_error ("cannot declare pointer to `%#T' member",
10333 type
= TREE_TYPE (type
);
10336 /* Merge any constancy or volatility into the target type
10337 for the pointer. */
10339 /* We now know that the TYPE_QUALS don't apply to the decl,
10340 but to the target of the pointer. */
10341 type_quals
= TYPE_UNQUALIFIED
;
10343 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10345 if (TREE_CODE (type
) == VOID_TYPE
)
10346 error ("invalid type: `void &'");
10348 type
= build_reference_type (type
);
10350 else if (TREE_CODE (type
) == METHOD_TYPE
)
10351 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10353 type
= build_pointer_type (type
);
10355 /* Process a list of type modifier keywords (such as
10356 const or volatile) that were given inside the `*' or `&'. */
10358 if (TREE_TYPE (declarator
))
10360 register tree typemodlist
;
10366 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10367 typemodlist
= TREE_CHAIN (typemodlist
))
10369 tree qualifier
= TREE_VALUE (typemodlist
);
10371 if (qualifier
== ridpointers
[(int) RID_CONST
])
10373 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10375 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10380 error ("invalid type modifier within pointer declarator");
10384 pedwarn ("duplicate `const'");
10386 pedwarn ("duplicate `volatile'");
10388 pedwarn ("duplicate `restrict'");
10390 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10391 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10392 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10393 if (TREE_CODE (declarator
) == ADDR_EXPR
10394 && (constp
|| volatilep
))
10397 pedwarn ("discarding `const' applied to a reference");
10399 pedwarn ("discarding `volatile' applied to a reference");
10400 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10402 type
= cp_build_qualified_type (type
, type_quals
);
10404 declarator
= TREE_OPERAND (declarator
, 0);
10410 /* We have converted type names to NULL_TREE if the
10411 name was bogus, or to a _TYPE node, if not.
10413 The variable CTYPE holds the type we will ultimately
10414 resolve to. The code here just needs to build
10415 up appropriate member types. */
10416 tree sname
= TREE_OPERAND (declarator
, 1);
10419 /* Destructors can have their visibilities changed as well. */
10420 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10421 sname
= TREE_OPERAND (sname
, 0);
10423 if (TREE_COMPLEXITY (declarator
) == 0)
10424 /* This needs to be here, in case we are called
10425 multiple times. */ ;
10426 else if (TREE_COMPLEXITY (declarator
) == -1)
10427 /* Namespace member. */
10428 pop_decl_namespace ();
10429 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10430 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10431 else if (! IS_AGGR_TYPE_CODE
10432 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10434 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10436 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10437 that refer to ctype. They couldn't be resolved earlier
10438 because we hadn't pushed into the class yet.
10439 Example: resolve 'B<T>::type' in
10440 'B<typename B<T>::type> B<T>::f () { }'. */
10441 if (current_template_parms
10442 && uses_template_parms (type
)
10443 && uses_template_parms (current_class_type
))
10445 tree args
= current_template_args ();
10446 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10449 /* This pop_nested_class corresponds to the
10450 push_nested_class used to push into class scope for
10451 parsing the argument list of a function decl, in
10453 pop_nested_class ();
10454 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10457 my_friendly_abort (16);
10459 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10461 /* We had a reference to a global decl, or
10462 perhaps we were given a non-aggregate typedef,
10463 in which case we cleared this out, and should just
10464 keep going as though it wasn't there. */
10465 declarator
= sname
;
10468 ctype
= TREE_OPERAND (declarator
, 0);
10471 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10473 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10474 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10475 template_count
+= 1;
10476 t
= TYPE_MAIN_DECL (t
);
10477 if (DECL_LANG_SPECIFIC (t
))
10478 t
= DECL_CLASS_CONTEXT (t
);
10483 if (sname
== NULL_TREE
)
10486 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10488 /* This is the `standard' use of the scoping operator:
10489 basetype :: member . */
10491 if (ctype
== current_class_type
)
10497 Is this ill-formed? */
10500 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10503 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10505 if (current_class_type
== NULL_TREE
10507 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10508 TYPE_ARG_TYPES (type
));
10511 cp_error ("cannot declare member function `%T::%s' within `%T'",
10512 ctype
, name
, current_class_type
);
10513 return void_type_node
;
10516 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10517 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10519 /* Have to move this code elsewhere in this function.
10520 this code is used for i.e., typedef int A::M; M *pm;
10522 It is? How? jason 10/2/94 */
10524 if (current_class_type
)
10526 cp_error ("cannot declare member `%T::%s' within `%T'",
10527 ctype
, name
, current_class_type
);
10528 return void_type_node
;
10530 type
= build_offset_type (ctype
, type
);
10532 else if (uses_template_parms (ctype
))
10534 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10536 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10537 TYPE_ARG_TYPES (type
));
10541 cp_error ("structure `%T' not yet defined", ctype
);
10542 return error_mark_node
;
10545 declarator
= sname
;
10547 else if (TREE_CODE (sname
) == SCOPE_REF
)
10548 my_friendly_abort (17);
10552 declarator
= TREE_OPERAND (declarator
, 1);
10553 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10554 /* In this case, we will deal with it later. */
10558 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10559 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10560 TYPE_ARG_TYPES (type
));
10562 type
= build_offset_type (ctype
, type
);
10569 declarator
= TREE_OPERAND (declarator
, 0);
10574 case ENUMERAL_TYPE
:
10575 declarator
= NULL_TREE
;
10579 declarator
= NULL_TREE
;
10583 my_friendly_abort (158);
10587 /* See the comment for the TREE_LIST case, above. */
10590 if (! ignore_attrs
)
10591 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10593 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10595 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10598 /* Now TYPE has the actual type. */
10600 if (explicitp
== 1)
10602 error ("only constructors can be declared `explicit'");
10606 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10608 if (type_quals
& TYPE_QUAL_CONST
)
10610 error ("const `%s' cannot be declared `mutable'", name
);
10611 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10615 error ("static `%s' cannot be declared `mutable'", name
);
10616 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10620 if (declarator
== NULL_TREE
10621 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10622 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10623 && (TREE_CODE (type
) == FUNCTION_TYPE
10624 || TREE_CODE (type
) == METHOD_TYPE
)))
10626 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10628 cp_error ("template-id `%D' used as a declarator", declarator
);
10629 declarator
= dname
;
10632 /* Unexpected declarator format. */
10633 my_friendly_abort (990210);
10635 /* If this is declaring a typedef name, return a TYPE_DECL. */
10637 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10641 /* Note that the grammar rejects storage classes
10642 in typenames, fields or parameters. */
10643 if (current_lang_name
== lang_name_java
)
10644 TYPE_FOR_JAVA (type
) = 1;
10646 if (decl_context
== FIELD
)
10648 if (declarator
== constructor_name (current_class_type
))
10649 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10651 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10655 /* Make sure this typedef lives as long as its type,
10656 since it might be used as a template parameter. */
10657 if (type
!= error_mark_node
)
10658 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10659 if (processing_template_decl
)
10660 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10662 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10663 if (type
!= error_mark_node
)
10667 /* If the user declares "typedef struct {...} foo" then the
10668 struct will have an anonymous name. Fill that name in now.
10669 Nothing can refer to it, so nothing needs know about the name
10671 if (type
!= error_mark_node
10672 && TYPE_NAME (type
)
10673 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10674 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10675 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10677 tree oldname
= TYPE_NAME (type
);
10680 /* Replace the anonymous name with the real name everywhere. */
10681 lookup_tag_reverse (type
, declarator
);
10682 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10683 if (TYPE_NAME (t
) == oldname
)
10684 TYPE_NAME (t
) = decl
;
10686 if (TYPE_LANG_SPECIFIC (type
))
10687 TYPE_WAS_ANONYMOUS (type
) = 1;
10689 /* If this is a typedef within a template class, the nested
10690 type is a (non-primary) template. The name for the
10691 template needs updating as well. */
10692 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10693 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10694 = TYPE_IDENTIFIER (type
);
10696 /* XXX Temporarily set the scope.
10697 When returning, start_decl expects it as NULL_TREE,
10698 and will then then set it using pushdecl. */
10699 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10700 if (current_class_type
)
10701 DECL_CONTEXT (decl
) = current_class_type
;
10703 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10705 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10706 DECL_ASSEMBLER_NAME (decl
)
10707 = get_identifier (build_overload_name (type
, 1, 1));
10708 DECL_CONTEXT (decl
) = NULL_TREE
;
10710 /* FIXME remangle member functions; member functions of a
10711 type with external linkage have external linkage. */
10714 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10716 cp_error_at ("typedef name may not be class-qualified", decl
);
10721 if (ctype
== NULL_TREE
)
10723 if (TREE_CODE (type
) != METHOD_TYPE
)
10724 cp_error_at ("invalid type qualifier for non-method type", decl
);
10726 ctype
= TYPE_METHOD_BASETYPE (type
);
10728 if (ctype
!= NULL_TREE
)
10729 grok_method_quals (ctype
, decl
, quals
);
10732 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10733 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10734 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10736 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10737 error ("non-object member `%s' cannot be declared mutable", name
);
10739 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10740 inlinep
, friendp
, raises
!= NULL_TREE
);
10743 error ("typedef declaration includes an initializer");
10748 /* Detect the case of an array type of unspecified size
10749 which came, as such, direct from a typedef name.
10750 We must copy the type, so that each identifier gets
10751 a distinct type, so that each identifier's size can be
10752 controlled separately by its own initializer. */
10754 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10755 && TYPE_DOMAIN (type
) == NULL_TREE
)
10757 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10760 /* If this is a type name (such as, in a cast or sizeof),
10761 compute the type and return it now. */
10763 if (decl_context
== TYPENAME
)
10765 /* Note that the grammar rejects storage classes
10766 in typenames, fields or parameters. */
10767 if (type_quals
!= TYPE_UNQUALIFIED
)
10768 type_quals
= TYPE_UNQUALIFIED
;
10770 /* Special case: "friend class foo" looks like a TYPENAME context. */
10773 if (type_quals
!= TYPE_UNQUALIFIED
)
10775 cp_error ("type qualifiers specified for friend class declaration");
10776 type_quals
= TYPE_UNQUALIFIED
;
10780 cp_error ("`inline' specified for friend class declaration");
10784 /* Only try to do this stuff if we didn't already give up. */
10785 if (type
!= integer_type_node
)
10787 /* A friendly class? */
10788 if (current_class_type
)
10789 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10791 error ("trying to make class `%s' a friend of global scope",
10792 TYPE_NAME_STRING (type
));
10793 type
= void_type_node
;
10798 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10799 if (ctype
== NULL_TREE
)
10801 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10802 ctype
= TYPE_METHOD_BASETYPE (type
);
10804 grok_method_quals (ctype
, dummy
, quals
);
10805 type
= TREE_TYPE (dummy
);
10810 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10811 && decl_context
!= CATCHPARM
10812 && TREE_CODE (type
) != UNION_TYPE
10815 cp_error ("abstract declarator `%T' used as declaration", type
);
10816 declarator
= make_anon_name ();
10819 /* `void' at top level (not within pointer)
10820 is allowed only in typedefs or type names.
10821 We don't complain about parms either, but that is because
10822 a better error message can be made later. */
10824 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10827 error ("unnamed variable or field declared void");
10828 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10830 if (IDENTIFIER_OPNAME_P (declarator
))
10831 my_friendly_abort (356);
10833 error ("variable or field `%s' declared void", name
);
10836 error ("variable or field declared void");
10837 type
= integer_type_node
;
10840 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10841 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10843 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10845 if (ctype
|| in_namespace
)
10846 error ("cannot use `::' in parameter declaration");
10848 /* A parameter declared as an array of T is really a pointer to T.
10849 One declared as a function is really a pointer to a function.
10850 One declared as a member is really a pointer to member. */
10852 if (TREE_CODE (type
) == ARRAY_TYPE
)
10854 /* Transfer const-ness of array into that of type pointed to. */
10855 type
= build_pointer_type (TREE_TYPE (type
));
10856 type_quals
= TYPE_UNQUALIFIED
;
10858 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10859 type
= build_pointer_type (type
);
10860 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10861 type
= build_pointer_type (type
);
10862 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10864 error ("declaration of `%s' as void", name
);
10870 register tree decl
;
10872 if (decl_context
== PARM
)
10874 decl
= build_decl (PARM_DECL
, declarator
, type
);
10876 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10877 inlinep
, friendp
, raises
!= NULL_TREE
);
10879 /* Compute the type actually passed in the parmlist,
10880 for the case where there is no prototype.
10881 (For example, shorts and chars are passed as ints.)
10882 When there is a prototype, this is overridden later. */
10884 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10886 else if (decl_context
== FIELD
)
10888 if (type
== error_mark_node
)
10890 /* Happens when declaring arrays of sizes which
10891 are error_mark_node, for example. */
10894 else if (in_namespace
&& !friendp
)
10896 /* Something like struct S { int N::j; }; */
10897 cp_error ("invalid use of `::'");
10900 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10903 tree function_context
;
10905 /* We catch the others as conflicts with the builtin
10907 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10909 cp_error ("function `%D' cannot be declared friend",
10916 if (ctype
== NULL_TREE
)
10917 ctype
= current_class_type
;
10919 if (ctype
== NULL_TREE
)
10921 cp_error ("can't make `%D' into a method -- not in a class",
10923 return void_type_node
;
10926 /* ``A union may [ ... ] not [ have ] virtual functions.''
10928 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10930 cp_error ("function `%D' declared virtual inside a union",
10932 return void_type_node
;
10935 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10936 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10937 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10938 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10942 cp_error ("`%D' cannot be declared virtual, since it is always static",
10947 else if (staticp
< 2)
10948 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10949 TYPE_ARG_TYPES (type
));
10952 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10953 function_context
= (ctype
!= NULL_TREE
) ?
10954 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10955 publicp
= (! friendp
|| ! staticp
)
10956 && function_context
== NULL_TREE
;
10957 decl
= grokfndecl (ctype
, type
,
10958 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10959 ? declarator
: dname
,
10961 virtualp
, flags
, quals
, raises
,
10962 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10963 funcdef_flag
, template_count
, in_namespace
);
10964 if (decl
== NULL_TREE
)
10967 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10968 /* The decl and setting of decl_machine_attr is also turned off. */
10969 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10972 /* [class.conv.ctor]
10974 A constructor declared without the function-specifier
10975 explicit that can be called with a single parameter
10976 specifies a conversion from the type of its first
10977 parameter to the type of its class. Such a constructor
10978 is called a converting constructor. */
10979 if (explicitp
== 2)
10980 DECL_NONCONVERTING_P (decl
) = 1;
10981 else if (DECL_CONSTRUCTOR_P (decl
))
10983 /* The constructor can be called with exactly one
10984 parameter if there is at least one parameter, and
10985 any subsequent parameters have default arguments.
10986 We don't look at the first parameter, which is
10987 really just the `this' parameter for the new
10990 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10992 /* Skip the `in_chrg' argument too, if present. */
10993 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10994 arg_types
= TREE_CHAIN (arg_types
);
10996 if (arg_types
== void_list_node
10998 && TREE_CHAIN (arg_types
)
10999 && TREE_CHAIN (arg_types
) != void_list_node
11000 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11001 DECL_NONCONVERTING_P (decl
) = 1;
11004 else if (TREE_CODE (type
) == METHOD_TYPE
)
11006 /* We only get here for friend declarations of
11007 members of other classes. */
11008 /* All method decls are public, so tell grokfndecl to set
11009 TREE_PUBLIC, also. */
11010 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11011 virtualp
, flags
, quals
, raises
,
11012 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11013 template_count
, in_namespace
);
11014 if (decl
== NULL_TREE
)
11017 else if (!staticp
&& ! processing_template_decl
11018 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
11019 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11022 cp_error ("field `%D' has incomplete type", declarator
);
11024 cp_error ("name `%T' has incomplete type", type
);
11026 /* If we're instantiating a template, tell them which
11027 instantiation made the field's type be incomplete. */
11028 if (current_class_type
11029 && TYPE_NAME (current_class_type
)
11030 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11031 && declspecs
&& TREE_VALUE (declspecs
)
11032 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11033 cp_error (" in instantiation of template `%T'",
11034 current_class_type
);
11036 type
= error_mark_node
;
11043 error ("`%s' is neither function nor method; cannot be declared friend",
11044 IDENTIFIER_POINTER (declarator
));
11052 /* Friends are treated specially. */
11053 if (ctype
== current_class_type
)
11054 warning ("member functions are implicitly friends of their class");
11057 tree t
= NULL_TREE
;
11058 if (decl
&& DECL_NAME (decl
))
11060 if (template_class_depth (current_class_type
) == 0)
11063 = check_explicit_specialization
11065 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11066 if (decl
== error_mark_node
)
11067 return error_mark_node
;
11070 t
= do_friend (ctype
, declarator
, decl
,
11071 last_function_parms
, attrlist
, flags
, quals
,
11074 if (t
&& funcdef_flag
)
11077 return void_type_node
;
11081 /* Structure field. It may not be a function, except for C++ */
11083 if (decl
== NULL_TREE
)
11089 /* An attempt is being made to initialize a non-static
11090 member. But, from [class.mem]:
11092 4 A member-declarator can contain a
11093 constant-initializer only if it declares a static
11094 member (_class.static_) of integral or enumeration
11095 type, see _class.static.data_.
11097 This used to be relatively common practice, but
11098 the rest of the compiler does not correctly
11099 handle the initialization unless the member is
11100 static so we make it static below. */
11101 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
11103 cp_pedwarn ("making `%D' static", declarator
);
11107 if (uses_template_parms (type
))
11108 /* We'll check at instantiation time. */
11110 else if (check_static_variable_definition (declarator
,
11112 /* If we just return the declaration, crashes
11113 will sometimes occur. We therefore return
11114 void_type_node, as if this was a friend
11115 declaration, to cause callers to completely
11116 ignore this declaration. */
11117 return void_type_node
;
11120 /* 9.2p13 [class.mem] */
11121 if (declarator
== constructor_name (current_class_type
)
11122 /* Divergence from the standard: In extern "C", we
11123 allow non-static data members here, because C does
11124 and /usr/include/netinet/in.h uses that. */
11125 && (staticp
|| ! in_system_header
))
11126 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
11131 /* C++ allows static class members. All other work
11132 for this is done by grokfield. */
11133 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11134 TREE_STATIC (decl
) = 1;
11135 /* In class context, 'static' means public access. */
11136 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11140 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
11141 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11143 DECL_MUTABLE_P (decl
) = 1;
11144 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11148 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11149 inlinep
, friendp
, raises
!= NULL_TREE
);
11152 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11154 tree original_name
;
11160 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11161 original_name
= dname
;
11163 original_name
= declarator
;
11165 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11166 error ("storage class `auto' invalid for function `%s'", name
);
11167 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11168 error ("storage class `register' invalid for function `%s'", name
);
11170 /* Function declaration not at top level.
11171 Storage classes other than `extern' are not allowed
11172 and `extern' makes no difference. */
11173 if (! toplevel_bindings_p ()
11174 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11175 || RIDBIT_SETP (RID_INLINE
, specbits
))
11178 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11179 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11181 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11184 if (ctype
== NULL_TREE
)
11188 error ("virtual non-class function `%s'", name
);
11192 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11193 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11194 TYPE_ARG_TYPES (type
));
11196 /* Record presence of `static'. */
11197 publicp
= (ctype
!= NULL_TREE
11198 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11199 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11201 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11202 virtualp
, flags
, quals
, raises
,
11204 publicp
, inlinep
, funcdef_flag
,
11205 template_count
, in_namespace
);
11206 if (decl
== NULL_TREE
)
11211 int illegal_static
= 0;
11213 /* Don't allow a static member function in a class, and forbid
11214 declaring main to be static. */
11215 if (TREE_CODE (type
) == METHOD_TYPE
)
11217 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11218 illegal_static
= 1;
11220 else if (current_function_decl
)
11222 /* FIXME need arm citation */
11223 error ("cannot declare static function inside another function");
11224 illegal_static
= 1;
11227 if (illegal_static
)
11230 RIDBIT_RESET (RID_STATIC
, specbits
);
11236 /* It's a variable. */
11238 /* An uninitialized decl with `extern' is a reference. */
11239 decl
= grokvardecl (type
, declarator
, &specbits
,
11241 (type_quals
& TYPE_QUAL_CONST
) != 0,
11243 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11244 inlinep
, friendp
, raises
!= NULL_TREE
);
11248 DECL_CONTEXT (decl
) = ctype
;
11251 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11253 RIDBIT_RESET (RID_STATIC
, specbits
);
11255 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11257 cp_error ("static member `%D' declared `register'", decl
);
11258 RIDBIT_RESET (RID_REGISTER
, specbits
);
11260 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11262 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11264 RIDBIT_RESET (RID_EXTERN
, specbits
);
11269 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11271 error ("`%s' cannot be declared mutable", name
);
11274 /* Record `register' declaration for warnings on &
11275 and in case doing stupid register allocation. */
11277 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11278 DECL_REGISTER (decl
) = 1;
11280 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11281 DECL_THIS_EXTERN (decl
) = 1;
11283 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11284 DECL_THIS_STATIC (decl
) = 1;
11286 /* Record constancy and volatility. There's no need to do this
11287 when processing a template; we'll do this for the instantiated
11288 declaration based on the type of DECL. */
11289 if (!processing_template_decl
)
11290 c_apply_type_quals_to_decl (type_quals
, decl
);
11296 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11297 An empty exprlist is a parmlist. An exprlist which
11298 contains only identifiers at the global level
11299 is a parmlist. Otherwise, it is an exprlist. */
11302 parmlist_is_exprlist (exprs
)
11305 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11308 if (toplevel_bindings_p ())
11310 /* At the global level, if these are all identifiers,
11311 then it is a parmlist. */
11314 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11316 exprs
= TREE_CHAIN (exprs
);
11323 /* Subroutine of start_function. Ensure that each of the parameter
11324 types (as listed in PARMS) is complete, as is required for a
11325 function definition. */
11328 require_complete_types_for_parms (parms
)
11333 tree type
= TREE_TYPE (parms
);
11334 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11336 if (DECL_NAME (parms
))
11337 error ("parameter `%s' has incomplete type",
11338 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11340 error ("parameter has incomplete type");
11341 TREE_TYPE (parms
) = error_mark_node
;
11344 layout_decl (parms
, 0);
11346 parms
= TREE_CHAIN (parms
);
11350 /* Returns DECL if DECL is a local variable (or parameter). Returns
11351 NULL_TREE otherwise. */
11354 local_variable_p (t
)
11357 if ((TREE_CODE (t
) == VAR_DECL
11358 /* A VAR_DECL with a context that is a _TYPE is a static data
11360 && !TYPE_P (CP_DECL_CONTEXT (t
))
11361 /* Any other non-local variable must be at namespace scope. */
11362 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11363 || (TREE_CODE (t
) == PARM_DECL
))
11369 /* Check that ARG, which is a default-argument expression for a
11370 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11371 something goes wrong. DECL may also be a _TYPE node, rather than a
11372 DECL, if there is no DECL available. */
11375 check_default_argument (decl
, arg
)
11382 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11383 /* We get a DEFAULT_ARG when looking at an in-class declaration
11384 with a default argument. Ignore the argument for now; we'll
11385 deal with it after the class is complete. */
11388 if (processing_template_decl
|| uses_template_parms (arg
))
11389 /* We don't do anything checking until instantiation-time. Note
11390 that there may be uninstantiated arguments even for an
11391 instantiated function, since default arguments are not
11392 instantiated until they are needed. */
11401 decl_type
= TREE_TYPE (decl
);
11403 if (arg
== error_mark_node
11404 || decl
== error_mark_node
11405 || TREE_TYPE (arg
) == error_mark_node
11406 || decl_type
== error_mark_node
)
11407 /* Something already went wrong. There's no need to check
11409 return error_mark_node
;
11411 /* [dcl.fct.default]
11413 A default argument expression is implicitly converted to the
11415 if (!TREE_TYPE (arg
)
11416 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11419 cp_error ("default argument for `%#D' has type `%T'",
11420 decl
, TREE_TYPE (arg
));
11422 cp_error ("default argument for parameter of type `%T' has type `%T'",
11423 decl_type
, TREE_TYPE (arg
));
11425 return error_mark_node
;
11428 /* [dcl.fct.default]
11430 Local variables shall not be used in default argument
11433 The keyword `this' shall not be used in a default argument of a
11434 member function. */
11435 var
= search_tree (arg
, local_variable_p
);
11438 cp_error ("default argument `%E' uses local variable `%D'",
11440 return error_mark_node
;
11447 /* Decode the list of parameter types for a function type.
11448 Given the list of things declared inside the parens,
11449 return a list of types.
11451 The list we receive can have three kinds of elements:
11452 an IDENTIFIER_NODE for names given without types,
11453 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11454 or void_type_node, to mark the end of an argument list
11455 when additional arguments are not permitted (... was not used).
11457 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11458 a mere declaration. A nonempty identifier-list gets an error message
11459 when FUNCDEF_FLAG is zero.
11460 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11461 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11463 If all elements of the input list contain types,
11464 we return a list of the types.
11465 If all elements contain no type (except perhaps a void_type_node
11466 at the end), we return a null list.
11467 If some have types and some do not, it is an error, and we
11468 return a null list.
11470 Also set last_function_parms to either
11471 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11472 A list of names is converted to a chain of PARM_DECLs
11473 by store_parm_decls so that ultimately it is always a chain of decls.
11475 Note that in C++, parameters can take default values. These default
11476 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11477 an error to specify default values which are followed by parameters
11478 that have no default values, or an ELLIPSES. For simplicities sake,
11479 only parameters which are specified with their types can take on
11483 grokparms (first_parm
, funcdef_flag
)
11487 tree result
= NULL_TREE
;
11488 tree decls
= NULL_TREE
;
11490 if (first_parm
!= NULL_TREE
11491 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11493 if (! funcdef_flag
)
11494 pedwarn ("parameter names (without types) in function declaration");
11495 last_function_parms
= first_parm
;
11498 else if (first_parm
!= NULL_TREE
11499 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11500 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11501 my_friendly_abort (145);
11504 /* Types were specified. This is a list of declarators
11505 each represented as a TREE_LIST node. */
11506 register tree parm
, chain
;
11507 int any_init
= 0, any_error
= 0;
11509 if (first_parm
!= NULL_TREE
)
11511 tree last_result
= NULL_TREE
;
11512 tree last_decl
= NULL_TREE
;
11514 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11516 tree type
= NULL_TREE
, list_node
= parm
;
11517 register tree decl
= TREE_VALUE (parm
);
11518 tree init
= TREE_PURPOSE (parm
);
11520 chain
= TREE_CHAIN (parm
);
11521 /* @@ weak defense against parse errors. */
11522 if (TREE_CODE (decl
) != VOID_TYPE
11523 && TREE_CODE (decl
) != TREE_LIST
)
11525 /* Give various messages as the need arises. */
11526 if (TREE_CODE (decl
) == STRING_CST
)
11527 cp_error ("invalid string constant `%E'", decl
);
11528 else if (TREE_CODE (decl
) == INTEGER_CST
)
11529 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11533 if (TREE_CODE (decl
) != VOID_TYPE
)
11535 decl
= grokdeclarator (TREE_VALUE (decl
),
11536 TREE_PURPOSE (decl
),
11537 PARM
, init
!= NULL_TREE
,
11539 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11542 /* Top-level qualifiers on the parameters are
11543 ignored for function types. */
11544 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11546 if (TREE_CODE (type
) == VOID_TYPE
)
11547 decl
= void_type_node
;
11548 else if (TREE_CODE (type
) == METHOD_TYPE
)
11550 if (DECL_NAME (decl
))
11551 /* Cannot use the decl here because
11552 we don't have DECL_CONTEXT set up yet. */
11553 cp_error ("parameter `%D' invalidly declared method type",
11556 error ("parameter invalidly declared method type");
11557 type
= build_pointer_type (type
);
11558 TREE_TYPE (decl
) = type
;
11560 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11562 if (DECL_NAME (decl
))
11563 cp_error ("parameter `%D' invalidly declared offset type",
11566 error ("parameter invalidly declared offset type");
11567 type
= build_pointer_type (type
);
11568 TREE_TYPE (decl
) = type
;
11570 else if (abstract_virtuals_error (decl
, type
))
11571 any_error
= 1; /* Seems like a good idea. */
11572 else if (POINTER_TYPE_P (type
))
11575 while (POINTER_TYPE_P (t
)
11576 || (TREE_CODE (t
) == ARRAY_TYPE
11577 && TYPE_DOMAIN (t
) != NULL_TREE
))
11579 if (TREE_CODE (t
) == ARRAY_TYPE
)
11580 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11582 TYPE_PTR_P (type
) ? "pointer" : "reference");
11586 if (TREE_CODE (decl
) == VOID_TYPE
)
11588 if (result
== NULL_TREE
)
11590 result
= void_list_node
;
11591 last_result
= result
;
11595 TREE_CHAIN (last_result
) = void_list_node
;
11596 last_result
= void_list_node
;
11599 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11600 error ("`void' in parameter list must be entire list");
11604 /* Since there is a prototype, args are passed in their own types. */
11605 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11606 if (PROMOTE_PROTOTYPES
11607 && (TREE_CODE (type
) == INTEGER_TYPE
11608 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11609 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11610 DECL_ARG_TYPE (decl
) = integer_type_node
;
11611 if (!any_error
&& init
)
11614 init
= check_default_argument (decl
, init
);
11619 if (decls
== NULL_TREE
)
11626 TREE_CHAIN (last_decl
) = decl
;
11629 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11631 TREE_PURPOSE (list_node
) = init
;
11632 TREE_VALUE (list_node
) = type
;
11633 TREE_CHAIN (list_node
) = NULL_TREE
;
11636 list_node
= tree_cons (init
, type
, NULL_TREE
);
11637 if (result
== NULL_TREE
)
11639 result
= list_node
;
11640 last_result
= result
;
11644 TREE_CHAIN (last_result
) = list_node
;
11645 last_result
= list_node
;
11649 TREE_CHAIN (last_result
) = NULL_TREE
;
11650 /* If there are no parameters, and the function does not end
11651 with `...', then last_decl will be NULL_TREE. */
11652 if (last_decl
!= NULL_TREE
)
11653 TREE_CHAIN (last_decl
) = NULL_TREE
;
11657 last_function_parms
= decls
;
11662 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11663 FUNCTION_TYPE with the newly parsed version of its default argument, which
11664 was previously digested as text. See snarf_defarg et al in lex.c. */
11667 replace_defarg (arg
, init
)
11670 if (! processing_template_decl
11671 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11672 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11673 TREE_TYPE (init
), TREE_VALUE (arg
));
11674 TREE_PURPOSE (arg
) = init
;
11681 tree t
= FUNCTION_ARG_CHAIN (d
);
11682 if (DECL_CONSTRUCTOR_P (d
)
11683 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11684 t
= TREE_CHAIN (t
);
11685 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11686 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11687 == DECL_CLASS_CONTEXT (d
))
11688 && (TREE_CHAIN (t
) == NULL_TREE
11689 || TREE_CHAIN (t
) == void_list_node
11690 || TREE_PURPOSE (TREE_CHAIN (t
))))
11695 /* These memoizing functions keep track of special properties which
11696 a class may have. `grok_ctor_properties' notices whether a class
11697 has a constructor of the form X(X&), and also complains
11698 if the class has a constructor of the form X(X).
11699 `grok_op_properties' takes notice of the various forms of
11700 operator= which are defined, as well as what sorts of type conversion
11701 may apply. Both functions take a FUNCTION_DECL as an argument. */
11704 grok_ctor_properties (ctype
, decl
)
11707 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11708 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11710 /* When a type has virtual baseclasses, a magical first int argument is
11711 added to any ctor so we can tell if the class has been initialized
11712 yet. This could screw things up in this function, so we deliberately
11713 ignore the leading int if we're in that situation. */
11714 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11716 my_friendly_assert (parmtypes
11717 && TREE_VALUE (parmtypes
) == integer_type_node
,
11719 parmtypes
= TREE_CHAIN (parmtypes
);
11720 parmtype
= TREE_VALUE (parmtypes
);
11725 A non-template constructor for class X is a copy constructor if
11726 its first parameter is of type X&, const X&, volatile X& or const
11727 volatile X&, and either there are no other parameters or else all
11728 other parameters have default arguments. */
11729 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11730 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11731 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11732 || TREE_CHAIN (parmtypes
) == void_list_node
11733 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11734 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11735 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11737 TYPE_HAS_INIT_REF (ctype
) = 1;
11738 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11739 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11743 A declaration of a constructor for a class X is ill-formed if its
11744 first parameter is of type (optionally cv-qualified) X and either
11745 there are no other parameters or else all other parameters have
11748 We *don't* complain about member template instantiations that
11749 have this form, though; they can occur as we try to decide what
11750 constructor to use during overload resolution. Since overload
11751 resolution will never prefer such a constructor to the
11752 non-template copy constructor (which is either explicitly or
11753 implicitly defined), there's no need to worry about their
11754 existence. Theoretically, they should never even be
11755 instantiated, but that's hard to forestall. */
11756 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11757 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11758 || TREE_CHAIN (parmtypes
) == void_list_node
11759 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11760 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11761 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11763 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11765 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11768 else if (TREE_CODE (parmtype
) == VOID_TYPE
11769 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11770 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11775 /* An operator with this name can be either unary or binary. */
11781 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11782 || name
== ansi_opname
[(int) ADDR_EXPR
]
11783 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11784 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11785 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11786 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11789 /* An operator with this name can only be unary. */
11795 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11796 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11797 || name
== ansi_opname
[(int) COMPONENT_REF
]
11798 || IDENTIFIER_TYPENAME_P (name
));
11801 /* Do a little sanity-checking on how they declared their operator. */
11804 grok_op_properties (decl
, virtualp
, friendp
)
11806 int virtualp
, friendp
;
11808 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11809 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11810 tree name
= DECL_NAME (decl
);
11812 if (current_class_type
== NULL_TREE
)
11819 A user-declared copy assignment operator X::operator= is a
11820 non-static non-template member function of class X with
11821 exactly one parameter of type X, X&, const X&, volatile X& or
11822 const volatile X&. */
11823 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11824 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11825 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11827 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11828 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11829 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11830 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11831 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11832 || name
== ansi_opname
[(int) MEMBER_REF
])
11833 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11834 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11835 TYPE_GETS_NEW (current_class_type
) |= 1;
11836 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11837 TYPE_GETS_DELETE (current_class_type
) |= 1;
11838 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11839 TYPE_GETS_NEW (current_class_type
) |= 2;
11840 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11841 TYPE_GETS_DELETE (current_class_type
) |= 2;
11844 if (name
== ansi_opname
[(int) NEW_EXPR
]
11845 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11847 /* When the compiler encounters the definition of A::operator new, it
11848 doesn't look at the class declaration to find out if it's static. */
11850 revert_static_member_fn (&decl
, NULL
, NULL
);
11852 /* Take care of function decl if we had syntax errors. */
11853 if (argtypes
== NULL_TREE
)
11855 = build_function_type (ptr_type_node
,
11856 hash_tree_chain (integer_type_node
,
11859 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11861 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11862 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11865 revert_static_member_fn (&decl
, NULL
, NULL
);
11867 if (argtypes
== NULL_TREE
)
11869 = build_function_type (void_type_node
,
11870 hash_tree_chain (ptr_type_node
,
11874 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11876 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11877 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11878 != void_list_node
))
11879 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11884 /* An operator function must either be a non-static member function
11885 or have at least one parameter of a class, a reference to a class,
11886 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11887 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11889 if (IDENTIFIER_TYPENAME_P (name
)
11890 || name
== ansi_opname
[(int) CALL_EXPR
]
11891 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11892 || name
== ansi_opname
[(int) COMPONENT_REF
]
11893 || name
== ansi_opname
[(int) ARRAY_REF
])
11894 cp_error ("`%D' must be a nonstatic member function", decl
);
11899 if (DECL_STATIC_FUNCTION_P (decl
))
11900 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11903 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11905 tree arg
= TREE_VALUE (p
);
11906 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11907 arg
= TREE_TYPE (arg
);
11909 /* This lets bad template code slip through. */
11910 if (IS_AGGR_TYPE (arg
)
11911 || TREE_CODE (arg
) == ENUMERAL_TYPE
11912 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11913 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11917 ("`%D' must have an argument of class or enumerated type",
11924 if (name
== ansi_opname
[(int) CALL_EXPR
])
11925 return; /* No restrictions on args. */
11927 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11929 tree t
= TREE_TYPE (name
);
11930 if (TREE_CODE (t
) == VOID_TYPE
)
11931 pedwarn ("void is not a valid type conversion operator");
11932 else if (! friendp
)
11934 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11935 const char *what
= 0;
11937 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11939 if (t
== current_class_type
)
11940 what
= "the same type";
11941 /* Don't force t to be complete here. */
11942 else if (IS_AGGR_TYPE (t
)
11944 && DERIVED_FROM_P (t
, current_class_type
))
11945 what
= "a base class";
11948 warning ("conversion to %s%s will never use a type conversion operator",
11949 ref
? "a reference to " : "", what
);
11953 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11957 if (list_length (argtypes
) != 3 && methodp
)
11959 cp_error ("`%D' must take exactly one argument", decl
);
11962 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11964 if (copy_assignment_arg_p (parmtype
, virtualp
)
11967 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11968 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11969 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11970 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11973 else if (name
== ansi_opname
[(int) COND_EXPR
])
11976 cp_error ("ANSI C++ prohibits overloading operator ?:");
11978 else if (ambi_op_p (name
))
11980 if (list_length (argtypes
) == 2)
11982 else if (list_length (argtypes
) == 3)
11984 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11985 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11986 && ! processing_template_decl
11987 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11990 cp_error ("postfix `%D' must take `int' as its argument",
11994 ("postfix `%D' must take `int' as its second argument",
12001 cp_error ("`%D' must take either zero or one argument", decl
);
12003 cp_error ("`%D' must take either one or two arguments", decl
);
12006 /* More Effective C++ rule 6. */
12008 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12009 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
12011 tree arg
= TREE_VALUE (argtypes
);
12012 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12013 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12014 arg
= TREE_TYPE (arg
);
12015 arg
= TYPE_MAIN_VARIANT (arg
);
12016 if (list_length (argtypes
) == 2)
12018 if (TREE_CODE (ret
) != REFERENCE_TYPE
12019 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12021 cp_warning ("prefix `%D' should return `%T'", decl
,
12022 build_reference_type (arg
));
12026 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12027 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12031 else if (unary_op_p (name
))
12033 if (list_length (argtypes
) != 2)
12036 cp_error ("`%D' must take `void'", decl
);
12038 cp_error ("`%D' must take exactly one argument", decl
);
12041 else /* if (binary_op_p (name)) */
12043 if (list_length (argtypes
) != 3)
12046 cp_error ("`%D' must take exactly one argument", decl
);
12048 cp_error ("`%D' must take exactly two arguments", decl
);
12051 /* More Effective C++ rule 7. */
12053 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
12054 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
12055 || name
== ansi_opname
[COMPOUND_EXPR
]))
12056 cp_warning ("user-defined `%D' always evaluates both arguments",
12060 /* Effective C++ rule 23. */
12062 && list_length (argtypes
) == 3
12063 && (name
== ansi_opname
[PLUS_EXPR
]
12064 || name
== ansi_opname
[MINUS_EXPR
]
12065 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
12066 || name
== ansi_opname
[MULT_EXPR
])
12067 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12068 cp_warning ("`%D' should return by value", decl
);
12072 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
12073 if (TREE_PURPOSE (argtypes
))
12075 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12076 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12077 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
12080 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12083 cp_error ("`%D' cannot have default arguments", decl
);
12088 static const char *
12090 enum tag_types code
;
12103 my_friendly_abort (981122);
12107 /* Get the struct, enum or union (CODE says which) with tag NAME.
12108 Define the tag as a forward-reference if it is not defined.
12110 C++: If a class derivation is given, process it here, and report
12111 an error if multiple derivation declarations are not identical.
12113 If this is a definition, come in through xref_tag and only look in
12114 the current frame for the name (since C++ allows new names in any
12118 xref_tag (code_type_node
, name
, globalize
)
12119 tree code_type_node
;
12123 enum tag_types tag_code
;
12124 enum tree_code code
;
12126 register tree ref
, t
;
12127 struct binding_level
*b
= current_binding_level
;
12129 tree attributes
= NULL_TREE
;
12130 tree context
= NULL_TREE
;
12132 /* If we are called from the parser, code_type_node will sometimes be a
12133 TREE_LIST. This indicates that the user wrote
12134 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12136 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12138 attributes
= TREE_PURPOSE (code_type_node
);
12139 code_type_node
= TREE_VALUE (code_type_node
);
12142 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12147 code
= RECORD_TYPE
;
12153 code
= ENUMERAL_TYPE
;
12156 my_friendly_abort (18);
12159 /* If a cross reference is requested, look up the type
12160 already defined for this tag and return it. */
12161 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
12164 name
= TYPE_IDENTIFIER (t
);
12168 t
= IDENTIFIER_TYPE_VALUE (name
);
12170 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12171 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12176 /* If we know we are defining this tag, only look it up in
12177 this scope and don't try to find it as a type. */
12178 ref
= lookup_tag (code
, name
, b
, 1);
12184 /* [dcl.type.elab] If the identifier resolves to a
12185 typedef-name or a template type-parameter, the
12186 elaborated-type-specifier is ill-formed. */
12187 if (t
!= TYPE_MAIN_VARIANT (t
)
12188 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12189 cp_pedwarn ("using typedef-name `%D' after `%s'",
12190 TYPE_NAME (t
), tag_name (tag_code
));
12191 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12192 cp_error ("using template type parameter `%T' after `%s'",
12193 t
, tag_name (tag_code
));
12198 ref
= lookup_tag (code
, name
, b
, 0);
12202 /* Try finding it as a type declaration. If that wins,
12204 ref
= lookup_name (name
, 1);
12206 if (ref
!= NULL_TREE
12207 && processing_template_decl
12208 && DECL_CLASS_TEMPLATE_P (ref
)
12209 && template_class_depth (current_class_type
) == 0)
12210 /* Since GLOBALIZE is true, we're declaring a global
12211 template, so we want this type. */
12212 ref
= DECL_RESULT (ref
);
12214 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12215 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12216 ref
= TREE_TYPE (ref
);
12221 if (ref
&& current_class_type
12222 && template_class_depth (current_class_type
)
12223 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12225 /* Since GLOBALIZE is non-zero, we are not looking at a
12226 definition of this tag. Since, in addition, we are currently
12227 processing a (member) template declaration of a template
12228 class, we must be very careful; consider:
12235 { template <class V>
12236 friend struct S1; };
12238 Here, the S2::S1 declaration should not be confused with the
12239 outer declaration. In particular, the inner version should
12240 have a template parameter of level 2, not level 1. This
12241 would be particularly important if the member declaration
12244 template <class V = U> friend struct S1;
12246 say, when we should tsubst into `U' when instantiating
12247 S2. On the other hand, when presented with:
12257 we must find the inner binding eventually. We
12258 accomplish this by making sure that the new type we
12259 create to represent this declaration has the right
12261 context
= TYPE_CONTEXT (ref
);
12266 push_obstacks_nochange ();
12270 /* If no such tag is yet defined, create a forward-reference node
12271 and record it as the "definition".
12272 When a real declaration of this type is found,
12273 the forward-reference will be altered into a real type. */
12275 /* In C++, since these migrate into the global scope, we must
12276 build them on the permanent obstack. */
12278 temp
= allocation_temporary_p ();
12280 end_temporary_allocation ();
12282 if (code
== ENUMERAL_TYPE
)
12284 cp_error ("use of enum `%#D' without previous declaration", name
);
12286 ref
= make_node (ENUMERAL_TYPE
);
12288 /* Give the type a default layout like unsigned int
12289 to avoid crashing if it does not get defined. */
12290 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12291 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12292 TREE_UNSIGNED (ref
) = 1;
12293 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12294 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12295 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12297 /* Enable us to recognize when a type is created in class context.
12298 To do nested classes correctly, this should probably be cleared
12299 out when we leave this classes scope. Currently this in only
12300 done in `start_enum'. */
12302 pushtag (name
, ref
, globalize
);
12306 struct binding_level
*old_b
= class_binding_level
;
12308 ref
= make_lang_type (code
);
12309 TYPE_CONTEXT (ref
) = context
;
12311 #ifdef NONNESTED_CLASSES
12312 /* Class types don't nest the way enums do. */
12313 class_binding_level
= (struct binding_level
*)0;
12315 pushtag (name
, ref
, globalize
);
12316 class_binding_level
= old_b
;
12321 /* If it no longer looks like a nested type, make sure it's
12323 If it is not an IDENTIFIER, this is not a declaration */
12324 if (b
->namespace_p
&& !class_binding_level
12325 && TREE_CODE (name
) == IDENTIFIER_NODE
)
12327 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12328 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12331 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12332 redeclare_class_template (ref
, current_template_parms
);
12335 /* Until the type is defined, tentatively accept whatever
12336 structure tag the user hands us. */
12337 if (TYPE_SIZE (ref
) == NULL_TREE
12338 && ref
!= current_class_type
12339 /* Have to check this, in case we have contradictory tag info. */
12340 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12342 if (tag_code
== class_type
)
12343 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12344 else if (tag_code
== record_type
)
12345 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12350 TREE_TYPE (ref
) = attributes
;
12356 xref_tag_from_type (old
, id
, globalize
)
12360 tree code_type_node
;
12362 if (TREE_CODE (old
) == RECORD_TYPE
)
12363 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12364 ? class_type_node
: record_type_node
);
12366 code_type_node
= union_type_node
;
12368 if (id
== NULL_TREE
)
12369 id
= TYPE_IDENTIFIER (old
);
12371 return xref_tag (code_type_node
, id
, globalize
);
12374 /* REF is a type (named NAME), for which we have just seen some
12375 baseclasses. BINFO is a list of those baseclasses; the
12376 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12377 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12378 struct, or union. */
12381 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12382 tree code_type_node
;
12386 /* In the declaration `A : X, Y, ... Z' we mark all the types
12387 (A, X, Y, ..., Z) so we can check for duplicates. */
12392 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12394 if (tag_code
== union_type
)
12396 cp_error ("derived union `%T' invalid", ref
);
12400 len
= list_length (binfo
);
12401 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12403 /* First, make sure that any templates in base-classes are
12404 instantiated. This ensures that if we call ourselves recursively
12405 we do not get confused about which classes are marked and which
12407 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12408 complete_type (TREE_VALUE (base
));
12410 SET_CLASSTYPE_MARKED (ref
);
12411 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12413 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12415 /* The base of a derived struct is public by default. */
12417 = (TREE_PURPOSE (binfo
) == access_public_node
12418 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12419 || (tag_code
!= class_type
12420 && (TREE_PURPOSE (binfo
) == access_default_node
12421 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12423 = (TREE_PURPOSE (binfo
) == access_protected_node
12424 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12426 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12427 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12428 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12429 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12430 tree basetype
= TREE_VALUE (binfo
);
12433 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12434 basetype
= TREE_TYPE (basetype
);
12436 || (TREE_CODE (basetype
) != RECORD_TYPE
12437 && TREE_CODE (basetype
) != TYPENAME_TYPE
12438 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12439 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12441 cp_error ("base type `%T' fails to be a struct or class type",
12442 TREE_VALUE (binfo
));
12446 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12448 /* This code replaces similar code in layout_basetypes.
12449 We put the complete_type first for implicit `typename'. */
12450 if (TYPE_SIZE (basetype
) == NULL_TREE
12451 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12453 cp_error ("base class `%T' has incomplete type", basetype
);
12458 if (CLASSTYPE_MARKED (basetype
))
12460 if (basetype
== ref
)
12461 cp_error ("recursive type `%T' undefined", basetype
);
12463 cp_error ("duplicate base type `%T' invalid", basetype
);
12467 if (TYPE_FOR_JAVA (basetype
)
12468 && (current_lang_stack
12469 == &VARRAY_TREE (current_lang_base
, 0)))
12470 TYPE_FOR_JAVA (ref
) = 1;
12472 /* Note that the BINFO records which describe individual
12473 inheritances are *not* shared in the lattice! They
12474 cannot be shared because a given baseclass may be
12475 inherited with different `accessibility' by different
12476 derived classes. (Each BINFO record describing an
12477 individual inheritance contains flags which say what
12478 the `accessibility' of that particular inheritance is.) */
12481 = make_binfo (integer_zero_node
, basetype
,
12482 CLASS_TYPE_P (basetype
)
12483 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12484 CLASS_TYPE_P (basetype
)
12485 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12487 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12488 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12489 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12490 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12491 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12493 /* We need to unshare the binfos now so that lookups during class
12494 definition work. */
12495 unshare_base_binfos (base_binfo
);
12497 SET_CLASSTYPE_MARKED (basetype
);
12499 /* We are free to modify these bits because they are meaningless
12500 at top level, and BASETYPE is a top-level type. */
12501 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12503 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12504 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12507 if (CLASS_TYPE_P (basetype
))
12509 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12510 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12517 TREE_VEC_LENGTH (binfos
) = i
;
12519 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12522 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12525 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12527 if (CLASS_TYPE_P (basetype
))
12528 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12529 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12532 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12533 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12535 /* Unmark all the types. */
12537 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12538 CLEAR_CLASSTYPE_MARKED (ref
);
12540 /* Now that we know all the base-classes, set up the list of virtual
12542 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12548 /* Begin compiling the definition of an enumeration type.
12549 NAME is its name (or null if anonymous).
12550 Returns the type object, as yet incomplete.
12551 Also records info about it so that build_enumerator
12552 may be used to declare the individual values as they are read. */
12558 register tree enumtype
= NULL_TREE
;
12559 struct binding_level
*b
= current_binding_level
;
12561 /* We are wasting space here and putting these on the permanent_obstack so
12562 that typeid(local enum) will work correctly. */
12563 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12565 /* If this is the real definition for a previous forward reference,
12566 fill in the contents in the same object that used to be the
12567 forward reference. */
12569 if (name
!= NULL_TREE
)
12570 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12572 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12574 cp_error ("multiple definition of `%#T'", enumtype
);
12575 cp_error_at ("previous definition here", enumtype
);
12579 enumtype
= make_node (ENUMERAL_TYPE
);
12580 pushtag (name
, enumtype
, 0);
12583 if (current_class_type
)
12584 TREE_ADDRESSABLE (b
->tags
) = 1;
12586 /* We don't copy this value because build_enumerator needs to do it. */
12587 enum_next_value
= integer_zero_node
;
12590 GNU_xref_decl (current_function_decl
, enumtype
);
12594 /* After processing and defining all the values of an enumeration type,
12595 install their decls in the enumeration type and finish it off.
12596 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12597 Returns ENUMTYPE. */
12600 finish_enum (enumtype
)
12603 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12604 /* Calculate the maximum value of any enumerator in this type. */
12606 tree values
= TYPE_VALUES (enumtype
);
12611 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12616 /* The TREE_VALUE is a CONST_DECL for this enumeration
12618 decl
= TREE_VALUE (pair
);
12620 /* The DECL_INITIAL will be NULL if we are processing a
12621 template declaration and this enumeration constant had no
12622 explicit initializer. */
12623 value
= DECL_INITIAL (decl
);
12624 if (value
&& !processing_template_decl
)
12626 /* Set the TREE_TYPE for the VALUE as well. That's so
12627 that when we call decl_constant_value we get an
12628 entity of the right type (but with the constant
12629 value). Since we shouldn't ever call
12630 decl_constant_value on a template type, there's no
12631 reason to do that when processing_template_decl.
12632 And, if the expression is something like a
12633 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12634 wreak havoc on the intended type of the expression.
12636 Of course, there's also no point in trying to compute
12637 minimum or maximum values if we're in a template. */
12638 TREE_TYPE (value
) = enumtype
;
12641 minnode
= maxnode
= value
;
12642 else if (tree_int_cst_lt (maxnode
, value
))
12644 else if (tree_int_cst_lt (value
, minnode
))
12648 if (processing_template_decl
)
12649 /* If this is just a template, leave the CONST_DECL
12650 alone. That way tsubst_copy will find CONST_DECLs for
12651 CONST_DECLs, and not INTEGER_CSTs. */
12654 /* In the list we're building up, we want the enumeration
12655 values, not the CONST_DECLs. */
12656 TREE_VALUE (pair
) = value
;
12660 maxnode
= minnode
= integer_zero_node
;
12662 TYPE_VALUES (enumtype
) = nreverse (values
);
12664 if (processing_template_decl
)
12666 tree scope
= current_scope ();
12667 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12668 add_tree (build_min (TAG_DEFN
, enumtype
));
12672 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12673 int lowprec
= min_precision (minnode
, unsignedp
);
12674 int highprec
= min_precision (maxnode
, unsignedp
);
12675 int precision
= MAX (lowprec
, highprec
);
12678 TYPE_SIZE (enumtype
) = NULL_TREE
;
12680 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12682 TYPE_PRECISION (enumtype
) = precision
;
12684 fixup_unsigned_type (enumtype
);
12686 fixup_signed_type (enumtype
);
12688 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12689 /* Use the width of the narrowest normal C type which is wide
12691 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12694 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12696 TYPE_SIZE (enumtype
) = 0;
12697 layout_type (enumtype
);
12699 /* Fix up all variant types of this enum type. */
12700 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12701 tem
= TYPE_NEXT_VARIANT (tem
))
12703 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12704 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12705 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12706 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12707 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12708 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12709 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12710 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12711 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12714 /* Finish debugging output for this type. */
12715 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12718 /* In start_enum we pushed obstacks. Here, we must pop them. */
12724 /* Build and install a CONST_DECL for an enumeration constant of the
12725 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12726 Assignment of sequential values by default is handled here. */
12729 build_enumerator (name
, value
, type
)
12737 /* Remove no-op casts from the value. */
12739 STRIP_TYPE_NOPS (value
);
12741 if (! processing_template_decl
)
12743 /* Validate and default VALUE. */
12744 if (value
!= NULL_TREE
)
12746 if (TREE_READONLY_DECL_P (value
))
12747 value
= decl_constant_value (value
);
12749 if (TREE_CODE (value
) == INTEGER_CST
)
12751 value
= default_conversion (value
);
12752 constant_expression_warning (value
);
12756 cp_error ("enumerator value for `%D' not integer constant", name
);
12761 /* Default based on previous value. */
12762 if (value
== NULL_TREE
&& ! processing_template_decl
)
12764 value
= enum_next_value
;
12766 cp_error ("overflow in enumeration values at `%D'", name
);
12769 /* Remove no-op casts from the value. */
12771 STRIP_TYPE_NOPS (value
);
12773 /* To fix MAX_VAL enum consts. (bkoz) */
12774 TREE_TYPE (value
) = integer_type_node
;
12778 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12779 Even in other cases, we will later (in finish_enum) be setting the
12781 if (value
!= NULL_TREE
)
12782 value
= copy_node (value
);
12784 /* C++ associates enums with global, function, or class declarations. */
12786 context
= current_scope ();
12787 if (context
&& context
== current_class_type
)
12788 /* This enum declaration is local to the class. */
12789 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12791 /* It's a global enum, or it's local to a function. (Note local to
12792 a function could mean local to a class method. */
12793 decl
= build_decl (CONST_DECL
, name
, type
);
12795 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12796 DECL_INITIAL (decl
) = value
;
12797 TREE_READONLY (decl
) = 1;
12799 if (context
&& context
== current_class_type
)
12800 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12801 on the TYPE_FIELDS list for `S'. (That's so that you can say
12802 things like `S::i' later.) */
12803 finish_member_declaration (decl
);
12807 GNU_xref_decl (current_function_decl
, decl
);
12810 if (! processing_template_decl
)
12812 /* Set basis for default for next value. */
12813 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12814 integer_one_node
, PLUS_EXPR
);
12815 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12818 result
= tree_cons (name
, decl
, NULL_TREE
);
12823 static int function_depth
;
12825 /* We're defining DECL. Make sure that it's type is OK. */
12828 check_function_type (decl
)
12831 tree fntype
= TREE_TYPE (decl
);
12833 /* In a function definition, arg types must be complete. */
12834 require_complete_types_for_parms (current_function_parms
);
12836 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12838 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12840 /* Make it return void instead, but don't change the
12841 type of the DECL_RESULT, in case we have a named return value. */
12842 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12844 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12846 = build_cplus_method_type (ctype
,
12848 FUNCTION_ARG_CHAIN (decl
));
12852 = build_function_type (void_type_node
,
12853 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12855 = build_exception_variant (fntype
,
12856 TYPE_RAISES_EXCEPTIONS (fntype
));
12859 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12862 /* Create the FUNCTION_DECL for a function definition.
12863 DECLSPECS and DECLARATOR are the parts of the declaration;
12864 they describe the function's name and the type it returns,
12865 but twisted together in a fashion that parallels the syntax of C.
12867 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12868 DECLARATOR is really the DECL for the function we are about to
12869 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12870 indicating that the function is an inline defined in-class, and
12871 SF_EXPAND indicating that we should generate RTL for this
12874 This function creates a binding context for the function body
12875 as well as setting up the FUNCTION_DECL in current_function_decl.
12877 Returns 1 on success. If the DECLARATOR is not suitable for a function
12878 (it defines a datum instead), we return 0, which tells
12879 yyparse to report a parse error.
12881 For C++, we must first check whether that datum makes any sense.
12882 For example, "class A local_a(1,2);" means that variable local_a
12883 is an aggregate of type A, which should have a constructor
12884 applied to it with the argument list [1, 2]. */
12887 start_function (declspecs
, declarator
, attrs
, flags
)
12888 tree declspecs
, declarator
, attrs
;
12892 tree ctype
= NULL_TREE
;
12895 extern int have_extern_spec
;
12896 extern int used_extern_spec
;
12897 int doing_friend
= 0;
12898 struct binding_level
*bl
;
12900 /* Sanity check. */
12901 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12902 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12904 /* This should only be done once on the top most decl. */
12905 if (have_extern_spec
&& !used_extern_spec
)
12907 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12908 used_extern_spec
= 1;
12911 if (flags
& SF_PRE_PARSED
)
12913 decl1
= declarator
;
12915 fntype
= TREE_TYPE (decl1
);
12916 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12917 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12919 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12920 class is in the (lexical) scope of the class in which it is
12922 if (!ctype
&& DECL_FRIEND_P (decl1
))
12924 ctype
= DECL_CLASS_CONTEXT (decl1
);
12926 /* CTYPE could be null here if we're dealing with a template;
12927 for example, `inline friend float foo()' inside a template
12928 will have no CTYPE set. */
12929 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12935 last_function_parms
= DECL_ARGUMENTS (decl1
);
12936 last_function_parm_tags
= NULL_TREE
;
12940 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12941 /* If the declarator is not suitable for a function definition,
12942 cause a syntax error. */
12943 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12945 fntype
= TREE_TYPE (decl1
);
12947 restype
= TREE_TYPE (fntype
);
12948 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12950 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12951 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12952 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12953 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12954 fntype
= build_function_type (integer_type_node
,
12955 TYPE_ARG_TYPES (fntype
));
12957 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12959 TYPE_ARG_TYPES (fntype
));
12960 TREE_TYPE (decl1
) = fntype
;
12963 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12964 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12965 else if (DECL_MAIN_P (decl1
))
12967 /* If this doesn't return integer_type, complain. */
12968 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12970 if (pedantic
|| warn_return_type
)
12971 pedwarn ("return type for `main' changed to `int'");
12972 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12977 /* Warn if function was previously implicitly declared
12978 (but not if we warned then). */
12979 if (! warn_implicit
12980 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12981 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12983 /* Set up current_class_type, and enter the scope of the class, if
12986 push_nested_class (ctype
, 1);
12987 else if (DECL_STATIC_FUNCTION_P (decl1
))
12988 push_nested_class (DECL_CONTEXT (decl1
), 2);
12990 /* Now that we have entered the scope of the class, we must restore
12991 the bindings for any template parameters surrounding DECL1, if it
12992 is an inline member template. (Order is important; consider the
12993 case where a template parameter has the same name as a field of
12994 the class.) It is not until after this point that
12995 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12996 if (flags
& SF_INCLASS_INLINE
)
12997 maybe_begin_member_template_processing (decl1
);
12999 /* Effective C++ rule 15. See also c_expand_return. */
13001 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
13002 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13003 cp_warning ("`operator=' should return a reference to `*this'");
13005 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13006 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13007 DECL_INITIAL (decl1
) = error_mark_node
;
13009 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13010 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13013 /* This function exists in static storage.
13014 (This does not mean `static' in the C sense!) */
13015 TREE_STATIC (decl1
) = 1;
13017 /* We must call push_template_decl after current_class_type is set
13018 up. (If we are processing inline definitions after exiting a
13019 class scope, current_class_type will be NULL_TREE until set above
13020 by push_nested_class.) */
13021 if (processing_template_decl
)
13022 decl1
= push_template_decl (decl1
);
13024 /* We are now in the scope of the function being defined. */
13025 current_function_decl
= decl1
;
13027 /* Save the parm names or decls from this function's declarator
13028 where store_parm_decls will find them. */
13029 current_function_parms
= last_function_parms
;
13030 current_function_parm_tags
= last_function_parm_tags
;
13032 /* Make sure the parameter and return types are reasonable. When
13033 you declare a function, these types can be incomplete, but they
13034 must be complete when you define the function. */
13035 if (! processing_template_decl
)
13036 check_function_type (decl1
);
13038 /* Build the return declaration for the function. */
13039 restype
= TREE_TYPE (fntype
);
13040 if (!processing_template_decl
)
13042 if (!DECL_RESULT (decl1
))
13044 DECL_RESULT (decl1
)
13045 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13046 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13047 DECL_RESULT (decl1
));
13051 /* Just use `void'. Nobody will ever look at this anyhow. */
13052 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13054 /* Initialize RTL machinery. We cannot do this until
13055 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13056 even when processing a template; this is how we get
13057 CURRENT_FUNCTION set up, and our per-function variables
13059 bl
= current_binding_level
;
13060 init_function_start (decl1
, input_filename
, lineno
);
13061 current_binding_level
= bl
;
13062 expanding_p
= (flags
& SF_EXPAND
) != 0;
13064 /* Even though we're inside a function body, we still don't want to
13065 call expand_expr to calculate the size of a variable-sized array.
13066 We haven't necessarily assigned RTL to all variables yet, so it's
13067 not safe to try to expand expressions involving them. */
13068 immediate_size_expand
= 0;
13069 get_pending_sizes ();
13071 /* Let the user know we're compiling this function. */
13072 if (!building_stmt_tree ())
13073 announce_function (decl1
);
13075 /* Record the decl so that the function name is defined.
13076 If we already have a decl for this name, and it is a FUNCTION_DECL,
13077 use the old decl. */
13078 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13080 /* A specialization is not used to guide overload resolution. */
13081 if ((flag_guiding_decls
13082 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
13083 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13084 decl1
= pushdecl (decl1
);
13087 /* We need to set the DECL_CONTEXT. */
13088 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13089 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13090 /* And make sure we have enough default args. */
13091 check_default_args (decl1
);
13093 DECL_MAIN_VARIANT (decl1
) = decl1
;
13094 fntype
= TREE_TYPE (decl1
);
13097 /* Reset these in case the call to pushdecl changed them. */
13098 current_function_decl
= decl1
;
13099 current_function
->decl
= decl1
;
13101 if (DECL_INTERFACE_KNOWN (decl1
))
13103 tree ctx
= hack_decl_function_context (decl1
);
13105 if (DECL_NOT_REALLY_EXTERN (decl1
))
13106 DECL_EXTERNAL (decl1
) = 0;
13108 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13109 && TREE_PUBLIC (ctx
))
13110 /* This is a function in a local class in an extern inline
13112 comdat_linkage (decl1
);
13114 /* If this function belongs to an interface, it is public.
13115 If it belongs to someone else's interface, it is also external.
13116 This only affects inlines and template instantiations. */
13117 else if (interface_unknown
== 0
13118 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13119 || flag_alt_external_templates
))
13121 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13122 || processing_template_decl
)
13124 DECL_EXTERNAL (decl1
)
13126 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13127 && !DECL_VINDEX (decl1
)));
13129 /* For WIN32 we also want to put these in linkonce sections. */
13130 maybe_make_one_only (decl1
);
13133 DECL_EXTERNAL (decl1
) = 0;
13134 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13135 DECL_INTERFACE_KNOWN (decl1
) = 1;
13137 else if (interface_unknown
&& interface_only
13138 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13139 || flag_alt_external_templates
))
13141 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13142 interface, we will have interface_only set but not
13143 interface_known. In that case, we don't want to use the normal
13144 heuristics because someone will supply a #pragma implementation
13145 elsewhere, and deducing it here would produce a conflict. */
13146 comdat_linkage (decl1
);
13147 DECL_EXTERNAL (decl1
) = 0;
13148 DECL_INTERFACE_KNOWN (decl1
) = 1;
13149 DECL_DEFER_OUTPUT (decl1
) = 1;
13153 /* This is a definition, not a reference.
13154 So clear DECL_EXTERNAL. */
13155 DECL_EXTERNAL (decl1
) = 0;
13157 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13158 && ! DECL_INTERFACE_KNOWN (decl1
)
13159 /* Don't try to defer nested functions for now. */
13160 && ! hack_decl_function_context (decl1
))
13161 DECL_DEFER_OUTPUT (decl1
) = 1;
13163 DECL_INTERFACE_KNOWN (decl1
) = 1;
13166 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
13168 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13169 TREE_TYPE (decl1
) = fntype
13170 = build_function_type (TREE_TYPE (fntype
),
13171 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
13172 current_function_parms
= TREE_CHAIN (current_function_parms
);
13173 DECL_ARGUMENTS (decl1
) = current_function_parms
;
13177 my_friendly_assert (current_class_ptr
== NULL_TREE
, 19990908);
13178 my_friendly_assert (current_class_ref
== NULL_TREE
, 19990908);
13181 /* If we're compiling a friend function, neither of the variables
13182 current_class_ptr nor current_class_type will have values. */
13183 if (! doing_friend
)
13185 /* We know that this was set up by `grokclassfn'.
13186 We do not wait until `store_parm_decls', since evil
13187 parse errors may never get us to that point. Here
13188 we keep the consistency between `current_class_type'
13189 and `current_class_ptr'. */
13190 tree t
= current_function_parms
;
13193 my_friendly_assert (t
!= NULL_TREE
13194 && TREE_CODE (t
) == PARM_DECL
, 162);
13195 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13198 if (! hack_decl_function_context (decl1
))
13199 temporary_allocation ();
13200 i
= suspend_momentary ();
13202 /* Normally, build_indirect_ref returns current_class_ref
13203 whenever current_class_ptr is dereferenced. This time,
13204 however, we want it to *create* current_class_ref, so we
13205 temporarily clear current_class_ptr to fool it. */
13206 cp_function_chain
->x_current_class_ref
13207 = build_indirect_ref (t
, NULL_PTR
);
13208 cp_function_chain
->x_current_class_ptr
= t
;
13210 resume_momentary (i
);
13211 if (! hack_decl_function_context (decl1
))
13212 end_temporary_allocation ();
13217 current_binding_level
->parm_flag
= 1;
13220 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13222 if (!building_stmt_tree ())
13224 GNU_xref_function (decl1
, current_function_parms
);
13225 make_function_rtl (decl1
);
13228 /* Promote the value to int before returning it. */
13229 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13230 restype
= type_promotes_to (restype
);
13232 /* If this fcn was already referenced via a block-scope `extern' decl
13233 (or an implicit decl), propagate certain information about the usage. */
13234 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13235 TREE_ADDRESSABLE (decl1
) = 1;
13237 if (DECL_RESULT (decl1
) == NULL_TREE
)
13239 DECL_RESULT (decl1
)
13240 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13241 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13242 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13245 /* Allocate further tree nodes temporarily during compilation
13246 of this function only. Tiemann moved up here from bottom of fn. */
13247 /* If this is a nested function, then we must continue to allocate RTL
13248 on the permanent obstack in case we need to inline it later. */
13249 if (! hack_decl_function_context (decl1
))
13250 temporary_allocation ();
13252 /* Make sure that we always have a momntary obstack while we're in a
13256 if (building_stmt_tree ())
13257 begin_stmt_tree (decl1
);
13261 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13262 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13264 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13265 ctor_label
= NULL_TREE
;
13269 dtor_label
= NULL_TREE
;
13270 if (DECL_CONSTRUCTOR_P (decl1
))
13271 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13277 /* Called after store_parm_decls for a function-try-block. We need to update
13278 last_parm_cleanup_insn so that the base initializers for a constructor
13279 are run within this block, not before it. */
13282 expand_start_early_try_stmts ()
13284 expand_start_try_stmts ();
13285 last_parm_cleanup_insn
= get_last_insn ();
13288 /* Store the parameter declarations into the current function declaration.
13289 This is called after parsing the parameter declarations, before
13290 digesting the body of the function.
13292 Also install to binding contour return value identifier, if any. */
13295 store_parm_decls ()
13297 register tree fndecl
= current_function_decl
;
13298 register tree parm
;
13299 int parms_have_cleanups
= 0;
13300 tree cleanups
= NULL_TREE
;
13302 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13303 tree specparms
= current_function_parms
;
13305 /* This is a list of types declared among parms in a prototype. */
13306 tree parmtags
= current_function_parm_tags
;
13308 /* This is a chain of any other decls that came in among the parm
13309 declarations. If a parm is declared with enum {foo, bar} x;
13310 then CONST_DECLs for foo and bar are put here. */
13311 tree nonparms
= NULL_TREE
;
13313 if (toplevel_bindings_p ())
13314 fatal ("parse errors have confused me too much");
13316 /* Create a binding level for the parms. */
13317 expand_start_bindings (0);
13319 if (specparms
!= NULL_TREE
)
13321 /* This case is when the function was defined with an ANSI prototype.
13322 The parms already have decls, so we need not do anything here
13323 except record them as in effect
13324 and complain if any redundant old-style parm decls were written. */
13326 register tree next
;
13328 /* Must clear this because it might contain TYPE_DECLs declared
13330 storedecls (NULL_TREE
);
13332 for (parm
= nreverse (specparms
); parm
; parm
= next
)
13334 next
= TREE_CHAIN (parm
);
13335 if (TREE_CODE (parm
) == PARM_DECL
)
13338 if (DECL_NAME (parm
) == NULL_TREE
)
13342 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
13343 cp_error ("parameter `%D' declared void", parm
);
13346 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
13347 A parameter is assumed not to have any side effects.
13348 If this should change for any reason, then this
13349 will have to wrap the bashed reference type in a save_expr.
13351 Also, if the parameter type is declared to be an X
13352 and there is an X(X&) constructor, we cannot lay it
13353 into the stack (any more), so we make this parameter
13354 look like it is really of reference type. Functions
13355 which pass parameters to this function will know to
13356 create a temporary in their frame, and pass a reference
13359 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
13360 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
13361 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
13365 if (! building_stmt_tree ()
13366 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13368 expand_decl (parm
);
13369 parms_have_cleanups
= 1;
13371 /* Keep track of the cleanups. */
13372 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13377 /* If we find an enum constant or a type tag,
13378 put it aside for the moment. */
13379 TREE_CHAIN (parm
) = NULL_TREE
;
13380 nonparms
= chainon (nonparms
, parm
);
13384 /* Get the decls in their original chain order
13385 and record in the function. This is all and only the
13386 PARM_DECLs that were pushed into scope by the loop above. */
13387 DECL_ARGUMENTS (fndecl
) = getdecls ();
13389 storetags (chainon (parmtags
, gettags ()));
13392 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13394 /* Now store the final chain of decls for the arguments
13395 as the decl-chain of the current lexical scope.
13396 Put the enumerators in as well, at the front so that
13397 DECL_ARGUMENTS is not modified. */
13399 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13401 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
13402 declare_function_name ();
13404 /* Initialize the RTL code for the function. */
13405 DECL_SAVED_INSNS (fndecl
) = 0;
13406 if (! building_stmt_tree ())
13407 expand_function_start (fndecl
, parms_have_cleanups
);
13409 current_function_parms_stored
= 1;
13411 /* If this function is `main', emit a call to `__main'
13412 to run global initializers, etc. */
13413 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13414 expand_main_function ();
13416 /* Now that we have initialized the parms, we can start their
13417 cleanups. We cannot do this before, since expand_decl_cleanup
13418 should not be called before the parm can be used. */
13419 if (cleanups
&& !building_stmt_tree ())
13421 for (cleanups
= nreverse (cleanups
); cleanups
; cleanups
= TREE_CHAIN (cleanups
))
13423 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
), TREE_VALUE (cleanups
)))
13424 cp_error ("parser lost in parsing declaration of `%D'",
13425 TREE_PURPOSE (cleanups
));
13429 /* Create a binding contour which can be used to catch
13430 cleanup-generated temporaries. Also, if the return value needs or
13431 has initialization, deal with that now. */
13432 if (parms_have_cleanups
)
13435 if (!building_stmt_tree ())
13436 expand_start_bindings (0);
13439 if (! building_stmt_tree () && flag_exceptions
)
13441 /* Do the starting of the exception specifications, if we have any. */
13442 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13443 expand_start_eh_spec ();
13446 last_parm_cleanup_insn
= get_last_insn ();
13447 last_dtor_insn
= get_last_insn ();
13450 /* Bind a name and initialization to the return value of
13451 the current function. */
13454 store_return_init (decl
)
13457 /* If this named return value comes in a register, put it in a
13458 pseudo-register. */
13459 if (DECL_REGISTER (decl
))
13461 original_result_rtx
= DECL_RTL (decl
);
13462 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13467 /* Finish up a function declaration and compile that function
13468 all the way to assembler language output. The free the storage
13469 for the function definition.
13471 This is called after parsing the body of the function definition.
13472 LINENO is the current line number.
13474 FLAGS is a bitwise or of the following values:
13476 An extra call to poplevel (and expand_end_bindings) must be
13477 made to take care of the binding contour for the base
13478 initializers. This is only relevant for constructors.
13480 We just finished processing the body of an in-class inline
13481 function definition. (This processing will have taken place
13482 after the class definition is complete.) */
13485 finish_function (lineno
, flags
)
13489 register tree fndecl
= current_function_decl
;
13490 tree fntype
, ctype
= NULL_TREE
;
13491 rtx fn_last_parm_insn
, insns
;
13492 /* Label to use if this function is supposed to return a value. */
13493 tree no_return_label
= NULL_TREE
;
13494 tree decls
= NULL_TREE
;
13495 int call_poplevel
= (flags
& 1) != 0;
13496 int inclass_inline
= (flags
& 2) != 0;
13500 /* When we get some parse errors, we can end up without a
13501 current_function_decl, so cope. */
13502 if (fndecl
== NULL_TREE
)
13505 nested
= function_depth
> 1;
13506 fntype
= TREE_TYPE (fndecl
);
13508 /* TREE_READONLY (fndecl) = 1;
13509 This caused &foo to be of type ptr-to-const-function
13510 which then got a warning when stored in a ptr-to-function variable. */
13512 /* This happens on strange parse errors. */
13513 if (! current_function_parms_stored
)
13516 store_parm_decls ();
13519 if (building_stmt_tree ())
13521 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13523 decls
= getdecls ();
13524 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13525 poplevel (decls
!= NULL_TREE
, 0, 0);
13528 /* Because we do not call expand_function_end, we won't call
13529 expand_end_bindings to match the call to
13530 expand_start_bindings we did in store_parm_decls. Therefore,
13531 we explicitly call expand_end_bindings here. However, we
13532 really shouldn't be calling expand_start_bindings at all when
13533 building_stmt_tree; it's conceptually an RTL-generation
13534 function, rather than a front-end function. */
13535 expand_end_bindings (0, 0, 0);
13539 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13541 tree ttype
= target_type (fntype
);
13544 if (IS_AGGR_TYPE (ttype
))
13545 /* Let debugger know it should output info for this type. */
13546 note_debug_info_needed (ttype
);
13548 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13550 ttype
= target_type (TREE_TYPE (parmdecl
));
13551 if (IS_AGGR_TYPE (ttype
))
13552 /* Let debugger know it should output info for this type. */
13553 note_debug_info_needed (ttype
);
13557 /* Clean house because we will need to reorder insns here. */
13558 do_pending_stack_adjust ();
13562 tree binfo
= TYPE_BINFO (current_class_type
);
13563 tree cond
= integer_one_node
;
13565 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13567 int ok_to_optimize_dtor
= 0;
13568 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13570 if (current_function_assigns_this
)
13571 cond
= build (NE_EXPR
, boolean_type_node
,
13572 current_class_ptr
, integer_zero_node
);
13575 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13577 /* If this destructor is empty, then we don't need to check
13578 whether `this' is NULL in some cases. */
13579 if ((flag_this_is_variable
& 1) == 0)
13580 ok_to_optimize_dtor
= 1;
13581 else if (empty_dtor
)
13582 ok_to_optimize_dtor
13583 = (n_baseclasses
== 0
13584 || (n_baseclasses
== 1
13585 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13588 /* These initializations might go inline. Protect
13589 the binding level of the parms. */
13591 expand_start_bindings (0);
13593 if (current_function_assigns_this
)
13595 current_function_assigns_this
= 0;
13596 current_function_just_assigned_this
= 0;
13599 /* Generate the code to call destructor on base class.
13600 If this destructor belongs to a class with virtual
13601 functions, then set the virtual function table
13602 pointer to represent the type of our base class. */
13604 /* This side-effect makes call to `build_delete' generate the
13605 code we have to have at the end of this destructor.
13606 `build_delete' will set the flag again. */
13607 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13609 /* These are two cases where we cannot delegate deletion. */
13610 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13611 || TYPE_GETS_REG_DELETE (current_class_type
))
13612 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
13613 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13615 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
13616 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13618 /* If we did not assign to this, then `this' is non-zero at
13619 the end of a destructor. As a special optimization, don't
13620 emit test if this is an empty destructor. If it does nothing,
13621 it does nothing. If it calls a base destructor, the base
13622 destructor will perform the test. */
13624 if (exprstmt
!= error_mark_node
13625 && (TREE_CODE (exprstmt
) != NOP_EXPR
13626 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13627 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13629 expand_label (dtor_label
);
13630 if (cond
!= integer_one_node
)
13631 expand_start_cond (cond
, 0);
13632 if (exprstmt
!= void_zero_node
)
13633 /* Don't call `expand_expr_stmt' if we're not going to do
13634 anything, since -Wall will give a diagnostic. */
13635 expand_expr_stmt (exprstmt
);
13637 /* Run destructor on all virtual baseclasses. */
13638 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13640 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13641 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13642 in_charge_node
, integer_two_node
), 0);
13645 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13647 tree vb
= get_vbase
13648 (BINFO_TYPE (vbases
),
13649 TYPE_BINFO (current_class_type
));
13651 (build_scoped_method_call
13652 (current_class_ref
, vb
, dtor_identifier
,
13653 build_expr_list (NULL_TREE
, integer_zero_node
)));
13655 vbases
= TREE_CHAIN (vbases
);
13657 expand_end_cond ();
13660 do_pending_stack_adjust ();
13661 if (cond
!= integer_one_node
)
13662 expand_end_cond ();
13665 virtual_size
= c_sizeof (current_class_type
);
13667 /* At the end, call delete if that's what's requested. */
13669 /* FDIS sez: At the point of definition of a virtual destructor
13670 (including an implicit definition), non-placement operator
13671 delete shall be looked up in the scope of the destructor's
13672 class and if found shall be accessible and unambiguous.
13674 This is somewhat unclear, but I take it to mean that if the
13675 class only defines placement deletes we don't do anything here.
13676 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13677 for us if they ever try to delete one of these. */
13679 if (TYPE_GETS_REG_DELETE (current_class_type
)
13680 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13681 exprstmt
= build_op_delete_call
13682 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13683 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13685 exprstmt
= NULL_TREE
;
13689 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13690 in_charge_node
, integer_one_node
);
13691 expand_start_cond (cond
, 0);
13692 expand_expr_stmt (exprstmt
);
13693 expand_end_cond ();
13696 /* End of destructor. */
13697 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13698 poplevel (getdecls () != NULL_TREE
, 0, 0);
13700 /* Back to the top of destructor. */
13701 /* Don't execute destructor code if `this' is NULL. */
13705 /* If the dtor is empty, and we know there is not possible way we
13706 could use any vtable entries, before they are possibly set by
13707 a base class dtor, we don't have to setup the vtables, as we
13708 know that any base class dtoring will set up any vtables it
13709 needs. We avoid MI, because one base class dtor can do a
13710 virtual dispatch to an overridden function that would need to
13711 have a non-related vtable set up, we cannot avoid setting up
13712 vtables in that case. We could change this to see if there is
13713 just one vtable. */
13714 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13716 /* Make all virtual function table pointers in non-virtual base
13717 classes point to CURRENT_CLASS_TYPE's virtual function
13719 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13721 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13722 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13725 if (! ok_to_optimize_dtor
)
13727 cond
= build_binary_op (NE_EXPR
,
13728 current_class_ptr
, integer_zero_node
);
13729 expand_start_cond (cond
, 0);
13732 insns
= get_insns ();
13735 fn_last_parm_insn
= get_first_nonparm_insn ();
13736 if (fn_last_parm_insn
== NULL_RTX
)
13737 fn_last_parm_insn
= get_last_insn ();
13739 fn_last_parm_insn
= previous_insn (fn_last_parm_insn
);
13741 emit_insns_after (insns
, fn_last_parm_insn
);
13743 if (! ok_to_optimize_dtor
)
13744 expand_end_cond ();
13746 else if (current_function_assigns_this
)
13748 /* Does not need to call emit_base_init, because
13749 that is done (if needed) just after assignment to this
13752 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13754 end_protect_partials ();
13755 expand_label (ctor_label
);
13756 ctor_label
= NULL_TREE
;
13760 decls
= getdecls ();
13761 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13762 poplevel (decls
!= NULL_TREE
, 0, 0);
13764 /* c_expand_return knows to return 'this' from a constructor. */
13765 c_expand_return (NULL_TREE
);
13767 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13768 && return_label
!= NULL_RTX
)
13769 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13771 current_function_assigns_this
= 0;
13772 current_function_just_assigned_this
= 0;
13773 base_init_expr
= NULL_TREE
;
13775 else if (DECL_CONSTRUCTOR_P (fndecl
))
13777 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13778 /* Allow constructor for a type to get a new instance of the object
13779 using `build_new'. */
13780 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13781 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13783 if (flag_this_is_variable
> 0)
13785 cond
= build_binary_op (EQ_EXPR
,
13786 current_class_ptr
, integer_zero_node
);
13787 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13788 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13791 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13795 if (flag_this_is_variable
> 0)
13797 expand_start_cond (cond
, 0);
13798 expand_expr_stmt (thenclause
);
13799 expand_end_cond ();
13802 /* Emit insns from `emit_base_init' which sets up virtual
13803 function table pointer(s). */
13804 if (base_init_expr
)
13806 expand_expr_stmt (base_init_expr
);
13807 base_init_expr
= NULL_TREE
;
13810 insns
= get_insns ();
13813 /* This is where the body of the constructor begins. */
13815 emit_insns_after (insns
, last_parm_cleanup_insn
);
13817 end_protect_partials ();
13819 /* This is where the body of the constructor ends. */
13820 expand_label (ctor_label
);
13821 ctor_label
= NULL_TREE
;
13825 decls
= getdecls ();
13826 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13827 poplevel (decls
!= NULL_TREE
, 1, 0);
13830 /* c_expand_return knows to return 'this' from a constructor. */
13831 c_expand_return (NULL_TREE
);
13833 current_function_assigns_this
= 0;
13834 current_function_just_assigned_this
= 0;
13836 else if (DECL_MAIN_P (fndecl
))
13838 /* Make it so that `main' always returns 0 by default. */
13840 c_expand_return (integer_one_node
);
13842 c_expand_return (integer_zero_node
);
13845 else if (return_label
!= NULL_RTX
13846 && current_function_return_value
== NULL_TREE
13847 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13848 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13850 if (flag_exceptions
)
13851 expand_exception_blocks ();
13853 /* If this function is supposed to return a value, ensure that
13854 we do not fall into the cleanups by mistake. The end of our
13855 function will look like this:
13857 user code (may have return stmt somewhere)
13858 goto no_return_label
13863 NOTE_INSN_FUNCTION_END
13867 If the user omits a return stmt in the USER CODE section, we
13868 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13869 Otherwise, we won't. */
13870 if (no_return_label
)
13872 DECL_CONTEXT (no_return_label
) = fndecl
;
13873 DECL_INITIAL (no_return_label
) = error_mark_node
;
13874 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13875 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13876 expand_goto (no_return_label
);
13881 /* Remove the binding contour which is used
13882 to catch cleanup-generated temporaries. */
13883 expand_end_bindings (0, 0, 0);
13884 poplevel (0, 0, 0);
13886 /* Emit label at beginning of cleanup code for parameters. */
13887 emit_label (cleanup_label
);
13890 /* Get return value into register if that's where it's supposed
13892 if (original_result_rtx
)
13893 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13895 /* Finish building code that will trigger warnings if users forget
13896 to make their functions return values. */
13897 if (no_return_label
|| cleanup_label
)
13898 emit_jump (return_label
);
13899 if (no_return_label
)
13901 /* We don't need to call `expand_*_return' here because we
13902 don't need any cleanups here--this path of code is only
13903 for error checking purposes. */
13904 expand_label (no_return_label
);
13907 /* We hard-wired immediate_size_expand to zero in
13908 start_function. Expand_function_end will decrement this
13909 variable. So, we set the variable to one here, so that after
13910 the decrement it will remain zero. */
13911 immediate_size_expand
= 1;
13913 /* Generate rtl for function exit. */
13914 expand_function_end (input_filename
, lineno
, 1);
13917 /* We have to save this value here in case
13918 maybe_end_member_template_processing decides to pop all the
13919 template parameters. */
13920 expand_p
= !building_stmt_tree ();
13922 /* If we're saving up tree structure, tie off the function now. */
13924 finish_stmt_tree (fndecl
);
13926 /* This must come after expand_function_end because cleanups might
13927 have declarations (from inline functions) that need to go into
13928 this function's blocks. */
13929 if (current_binding_level
->parm_flag
!= 1)
13930 my_friendly_abort (122);
13931 poplevel (1, 0, 1);
13933 /* Remember that we were in class scope. */
13934 if (current_class_name
)
13935 ctype
= current_class_type
;
13937 /* Must mark the RESULT_DECL as being in this function. */
13938 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13940 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13941 to the FUNCTION_DECL node itself. */
13942 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13944 /* Undo the call to push_momentary in start_function. */
13951 int saved_flag_keep_inline_functions
=
13952 flag_keep_inline_functions
;
13954 /* So we can tell if jump_optimize sets it to 1. */
13957 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13958 && hack_decl_function_context (fndecl
))
13959 /* Trick rest_of_compilation into not deferring output of this
13960 function, even if it is inline, since the rtl_obstack for
13961 this function is the function_obstack of the enclosing
13962 function and will be deallocated when the enclosing
13963 function is gone. See save_tree_status. */
13964 flag_keep_inline_functions
= 1;
13966 /* Before we call rest_of_compilation (which will pop the
13967 CURRENT_FUNCTION), we must save these values. */
13968 returns_null
= current_function_returns_null
;
13969 returns_value
= current_function_returns_value
;
13971 /* If this is a nested function (like a template instantiation
13972 that we're compiling in the midst of compiling something
13973 else), push a new GC context. That will keep local variables
13974 on the stack from being collected while we're doing the
13975 compilation of this function. */
13976 if (function_depth
> 1)
13977 ggc_push_context ();
13979 /* Run the optimizers and output the assembler code for this
13981 if (DECL_ARTIFICIAL (fndecl
))
13983 /* Do we really *want* to inline this synthesized method? */
13985 int save_fif
= flag_inline_functions
;
13986 flag_inline_functions
= 1;
13988 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13989 will check our size. */
13990 DECL_INLINE (fndecl
) = 0;
13992 rest_of_compilation (fndecl
);
13993 flag_inline_functions
= save_fif
;
13996 rest_of_compilation (fndecl
);
13998 /* Undo the call to ggc_push_context above. */
13999 if (function_depth
> 1)
14000 ggc_pop_context ();
14002 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
14004 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
14006 /* Set DECL_EXTERNAL so that assemble_external will be called as
14007 necessary. We'll clear it again in finish_file. */
14008 if (! DECL_EXTERNAL (fndecl
))
14009 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
14010 DECL_EXTERNAL (fndecl
) = 1;
14011 mark_inline_for_output (fndecl
);
14014 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
14015 note_debug_info_needed (ctype
);
14017 returns_null
|= can_reach_end
;
14019 /* Since we don't normally go through c_expand_return for constructors,
14020 this normally gets the wrong value.
14021 Also, named return values have their return codes emitted after
14022 NOTE_INSN_FUNCTION_END, confusing jump.c. */
14023 if (DECL_CONSTRUCTOR_P (fndecl
)
14024 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
14027 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
14028 cp_warning ("`noreturn' function `%D' does return", fndecl
);
14029 else if ((warn_return_type
|| pedantic
)
14031 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
14033 /* If this function returns non-void and control can drop through,
14035 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
14037 /* With just -W, complain only if function returns both with
14038 and without a value. */
14039 else if (extra_warnings
&& returns_value
&& returns_null
)
14040 warning ("this function may return with or without a value");
14044 /* Since we never call rest_of_compilation, we never clear
14045 CURRENT_FUNCTION. Do so explicitly. */
14046 free_after_compilation (current_function
);
14047 current_function
= NULL
;
14050 /* If this is a in-class inline definition, we may have to pop the
14051 bindings for the template parameters that we added in
14052 maybe_begin_member_template_processing when start_function was
14054 if (inclass_inline
)
14055 maybe_end_member_template_processing ();
14057 /* Leave the scope of the class. */
14059 pop_nested_class ();
14063 /* Free all the tree nodes making up this function. */
14064 /* Switch back to allocating nodes permanently
14065 until we start another function. */
14067 permanent_allocation (1);
14069 if (DECL_SAVED_INSNS (fndecl
) == 0)
14073 /* Stop pointing to the local nodes about to be freed. */
14074 /* But DECL_INITIAL must remain nonzero so we know this
14075 was an actual function definition. */
14076 DECL_INITIAL (fndecl
) = error_mark_node
;
14077 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
14078 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
14081 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
14082 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
14083 if (DECL_STATIC_DESTRUCTOR (fndecl
))
14084 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
14088 /* Let the error reporting routines know that we're outside a
14089 function. For a nested function, this value is used in
14090 pop_cp_function_context and then reset via pop_function_context. */
14091 current_function_decl
= NULL_TREE
;
14095 /* Create the FUNCTION_DECL for a function definition.
14096 DECLSPECS and DECLARATOR are the parts of the declaration;
14097 they describe the return type and the name of the function,
14098 but twisted together in a fashion that parallels the syntax of C.
14100 This function creates a binding context for the function body
14101 as well as setting up the FUNCTION_DECL in current_function_decl.
14103 Returns a FUNCTION_DECL on success.
14105 If the DECLARATOR is not suitable for a function (it defines a datum
14106 instead), we return 0, which tells yyparse to report a parse error.
14108 May return void_type_node indicating that this method is actually
14109 a friend. See grokfield for more details.
14111 Came here with a `.pushlevel' .
14113 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14114 CHANGES TO CODE IN `grokfield'. */
14117 start_method (declspecs
, declarator
, attrlist
)
14118 tree declarator
, declspecs
, attrlist
;
14120 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14123 /* Something too ugly to handle. */
14124 if (fndecl
== NULL_TREE
)
14127 /* Pass friends other than inline friend functions back. */
14128 if (fndecl
== void_type_node
)
14131 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14132 /* Not a function, tell parser to report parse error. */
14135 if (DECL_IN_AGGR_P (fndecl
))
14137 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14139 if (DECL_CONTEXT (fndecl
)
14140 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14141 cp_error ("`%D' is already defined in class %s", fndecl
,
14142 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
14144 return void_type_node
;
14147 check_template_shadow (fndecl
);
14149 DECL_THIS_INLINE (fndecl
) = 1;
14151 if (flag_default_inline
)
14152 DECL_INLINE (fndecl
) = 1;
14154 /* We process method specializations in finish_struct_1. */
14155 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14156 fndecl
= push_template_decl (fndecl
);
14158 /* We read in the parameters on the maybepermanent_obstack,
14159 but we won't be getting back to them until after we
14160 may have clobbered them. So the call to preserve_data
14161 will keep them safe. */
14164 if (! DECL_FRIEND_P (fndecl
))
14166 if (TREE_CHAIN (fndecl
))
14168 fndecl
= copy_node (fndecl
);
14169 TREE_CHAIN (fndecl
) = NULL_TREE
;
14172 if (DECL_CONSTRUCTOR_P (fndecl
))
14174 if (! grok_ctor_properties (current_class_type
, fndecl
))
14175 return void_type_node
;
14177 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14178 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14181 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
14183 /* Make a place for the parms */
14185 current_binding_level
->parm_flag
= 1;
14187 DECL_IN_AGGR_P (fndecl
) = 1;
14191 /* Go through the motions of finishing a function definition.
14192 We don't compile this method until after the whole class has
14195 FINISH_METHOD must return something that looks as though it
14196 came from GROKFIELD (since we are defining a method, after all).
14198 This is called after parsing the body of the function definition.
14199 STMTS is the chain of statements that makes up the function body.
14201 DECL is the ..._DECL that `start_method' provided. */
14204 finish_method (decl
)
14207 register tree fndecl
= decl
;
14210 register tree link
;
14212 if (decl
== void_type_node
)
14215 old_initial
= DECL_INITIAL (fndecl
);
14217 /* Undo the level for the parms (from start_method).
14218 This is like poplevel, but it causes nothing to be
14219 saved. Saving information here confuses symbol-table
14220 output routines. Besides, this information will
14221 be correctly output when this method is actually
14224 /* Clear out the meanings of the local variables of this level;
14225 also record in each decl which block it belongs to. */
14227 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14229 if (DECL_NAME (link
) != NULL_TREE
)
14230 pop_binding (DECL_NAME (link
), link
);
14231 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14232 DECL_CONTEXT (link
) = NULL_TREE
;
14235 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14236 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14237 current_binding_level
->parm_flag
,
14238 current_binding_level
->keep
);
14240 poplevel (0, 0, 0);
14242 DECL_INITIAL (fndecl
) = old_initial
;
14244 /* We used to check if the context of FNDECL was different from
14245 current_class_type as another way to get inside here. This didn't work
14246 for String.cc in libg++. */
14247 if (DECL_FRIEND_P (fndecl
))
14249 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14250 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14251 decl
= void_type_node
;
14257 /* Called when a new struct TYPE is defined.
14258 If this structure or union completes the type of any previous
14259 variable declaration, lay it out and output its rtl. */
14262 hack_incomplete_structures (type
)
14267 if (current_binding_level
->incomplete
== NULL_TREE
)
14270 if (!type
) /* Don't do this for class templates. */
14273 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14275 tree decl
= TREE_VALUE (*list
);
14276 if ((decl
&& TREE_TYPE (decl
) == type
)
14277 || (TREE_TYPE (decl
)
14278 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14279 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14281 int toplevel
= toplevel_bindings_p ();
14282 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14283 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14284 layout_type (TREE_TYPE (decl
));
14285 layout_decl (decl
, 0);
14286 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14290 expand_decl (decl
);
14291 cleanup
= maybe_build_cleanup (decl
);
14292 expand_decl_init (decl
);
14293 if (! expand_decl_cleanup (decl
, cleanup
))
14294 cp_error ("parser lost in parsing declaration of `%D'",
14297 *list
= TREE_CHAIN (*list
);
14300 list
= &TREE_CHAIN (*list
);
14304 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14305 See build_delete for information about AUTO_DELETE.
14307 Don't build these on the momentary obstack; they must live
14308 the life of the binding contour. */
14311 maybe_build_cleanup_1 (decl
, auto_delete
)
14312 tree decl
, auto_delete
;
14314 tree type
= TREE_TYPE (decl
);
14315 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14317 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14320 if (TREE_CODE (decl
) != PARM_DECL
)
14321 temp
= suspend_momentary ();
14323 if (TREE_CODE (type
) == ARRAY_TYPE
)
14327 mark_addressable (decl
);
14328 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14331 /* Optimize for space over speed here. */
14332 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14333 || flag_expensive_optimizations
)
14334 flags
|= LOOKUP_NONVIRTUAL
;
14336 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14338 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14339 && ! TYPE_HAS_DESTRUCTOR (type
))
14340 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14341 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14343 if (TREE_CODE (decl
) != PARM_DECL
)
14344 resume_momentary (temp
);
14351 /* If DECL is of a type which needs a cleanup, build that cleanup
14352 here. The cleanup does free the storage with a call to delete. */
14355 maybe_build_cleanup_and_delete (decl
)
14358 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14361 /* If DECL is of a type which needs a cleanup, build that cleanup
14362 here. The cleanup does not free the storage with a call a delete. */
14365 maybe_build_cleanup (decl
)
14368 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14371 /* Expand a C++ expression at the statement level.
14372 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14373 The C++ type checker should get all of these out when
14374 expressions are combined with other, type-providing, expressions,
14375 leaving only orphan expressions, such as:
14377 &class::bar; / / takes its address, but does nothing with it. */
14380 cplus_expand_expr_stmt (exp
)
14383 if (stmts_are_full_exprs_p
)
14384 exp
= convert_to_void (exp
, "statement");
14387 /* We should do this eventually, but right now this causes regex.o from
14388 libg++ to miscompile, and tString to core dump. */
14389 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14392 /* If we don't do this, we end up down inside expand_expr
14393 trying to do TYPE_MODE on the ERROR_MARK, and really
14394 go outside the bounds of the type. */
14395 if (exp
!= error_mark_node
)
14396 expand_expr_stmt (break_out_cleanups (exp
));
14399 /* When a stmt has been parsed, this function is called. */
14404 if (!current_function_assigns_this
14405 && current_function_just_assigned_this
)
14407 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14409 /* Constructors must wait until we are out of control
14410 zones before calling base constructors. */
14411 if (in_control_zone_p ())
14413 expand_expr_stmt (base_init_expr
);
14414 check_base_init (current_class_type
);
14416 current_function_assigns_this
= 1;
14419 /* Always assume this statement was not an expression statement. If
14420 it actually was an expression statement, its our callers
14421 responsibility to fix this up. */
14422 last_expr_type
= NULL_TREE
;
14425 /* Change a static member function definition into a FUNCTION_TYPE, instead
14426 of the METHOD_TYPE that we create when it's originally parsed.
14428 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14429 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14430 other decls. Either pass the addresses of local variables or NULL. */
14433 revert_static_member_fn (decl
, fn
, argtypes
)
14434 tree
*decl
, *fn
, *argtypes
;
14437 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14438 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14440 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14441 != TYPE_UNQUALIFIED
)
14442 cp_error ("static member function `%#D' declared with type qualifiers",
14445 args
= TREE_CHAIN (args
);
14446 tmp
= build_function_type (TREE_TYPE (function
), args
);
14447 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14448 tmp
= build_exception_variant (tmp
,
14449 TYPE_RAISES_EXCEPTIONS (function
));
14450 TREE_TYPE (*decl
) = tmp
;
14451 if (DECL_ARGUMENTS (*decl
))
14452 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14453 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14460 /* Initialize the variables used during compilation of a C++
14464 push_cp_function_context (f
)
14465 struct function
*f
;
14467 struct language_function
*p
14468 = ((struct language_function
*)
14469 xcalloc (1, sizeof (struct language_function
)));
14472 /* For now, we always assume we're expanding all the way to RTL
14473 unless we're explicitly doing otherwise. */
14476 /* Whenever we start a new function, we destroy temporaries in the
14478 stmts_are_full_exprs_p
= 1;
14481 /* Free the language-specific parts of F, now that we've finished
14482 compiling the function. */
14485 pop_cp_function_context (f
)
14486 struct function
*f
;
14488 free (f
->language
);
14493 mark_cp_function_context (f
)
14494 struct function
*f
;
14496 struct language_function
*p
= f
->language
;
14501 ggc_mark_tree (p
->x_named_labels
);
14502 ggc_mark_tree (p
->x_ctor_label
);
14503 ggc_mark_tree (p
->x_dtor_label
);
14504 ggc_mark_tree (p
->x_base_init_list
);
14505 ggc_mark_tree (p
->x_member_init_list
);
14506 ggc_mark_tree (p
->x_base_init_expr
);
14507 ggc_mark_tree (p
->x_current_class_ptr
);
14508 ggc_mark_tree (p
->x_current_class_ref
);
14509 ggc_mark_tree (p
->x_last_tree
);
14510 ggc_mark_tree (p
->x_last_expr_type
);
14512 ggc_mark_rtx (p
->x_last_dtor_insn
);
14513 ggc_mark_rtx (p
->x_last_parm_cleanup_insn
);
14514 ggc_mark_rtx (p
->x_result_rtx
);
14516 mark_binding_level (&p
->bindings
);
14523 return function_depth
!= 0;
14528 lang_mark_false_label_stack (l
)
14529 struct label_node
*l
;
14531 /* C++ doesn't use false_label_stack. It better be NULL. */
14532 my_friendly_assert (l
== NULL
, 19990904);
14539 enum tree_code code
= TREE_CODE (t
);
14540 if (code
== IDENTIFIER_NODE
)
14542 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14543 struct lang_id2
*li2
= li
->x
;
14544 ggc_mark_tree (li
->namespace_bindings
);
14545 ggc_mark_tree (li
->bindings
);
14546 ggc_mark_tree (li
->class_value
);
14547 ggc_mark_tree (li
->class_template_info
);
14551 ggc_mark_tree (li2
->label_value
);
14552 ggc_mark_tree (li2
->implicit_decl
);
14553 ggc_mark_tree (li2
->error_locus
);
14556 else if (code
== CPLUS_BINDING
)
14558 if (BINDING_HAS_LEVEL_P (t
))
14559 mark_binding_level (&BINDING_LEVEL (t
));
14561 ggc_mark_tree (BINDING_SCOPE (t
));
14562 ggc_mark_tree (BINDING_VALUE (t
));
14564 else if (code
== OVERLOAD
)
14565 ggc_mark_tree (OVL_FUNCTION (t
));
14566 else if (code
== TEMPLATE_PARM_INDEX
)
14567 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14568 else if (TREE_CODE_CLASS (code
) == 'd')
14570 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14575 ggc_mark_tree (ld
->decl_flags
.access
);
14576 ggc_mark_tree (ld
->decl_flags
.context
);
14577 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14578 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14579 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14581 ggc_mark_tree (ld
->main_decl_variant
);
14582 ggc_mark_tree (ld
->befriending_classes
);
14583 ggc_mark_tree (ld
->saved_tree
);
14584 if (TREE_CODE (t
) == TYPE_DECL
)
14585 ggc_mark_tree (ld
->u
.sorted_fields
);
14589 else if (TREE_CODE_CLASS (code
) == 't')
14591 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14593 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14594 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14597 ggc_mark_tree (lt
->vfields
);
14598 ggc_mark_tree (lt
->vbases
);
14599 ggc_mark_tree (lt
->tags
);
14600 ggc_mark_tree (lt
->search_slot
);
14601 ggc_mark_tree (lt
->size
);
14602 ggc_mark_tree (lt
->abstract_virtuals
);
14603 ggc_mark_tree (lt
->friend_classes
);
14604 ggc_mark_tree (lt
->rtti
);
14605 ggc_mark_tree (lt
->methods
);
14606 ggc_mark_tree (lt
->template_info
);
14607 ggc_mark_tree (lt
->befriending_classes
);
14610 /* In the case of pointer-to-member function types, the
14611 TYPE_LANG_SPECIFIC is really just a tree. */
14612 ggc_mark_tree ((tree
) lt
);