1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-97, 1998 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. */
45 #define obstack_chunk_alloc xmalloc
46 #define obstack_chunk_free free
48 extern tree builtin_return_address_fndecl
;
50 extern struct obstack permanent_obstack
;
51 extern struct obstack
* saveable_obstack
;
53 extern int current_class_depth
;
55 extern tree static_ctors
, static_dtors
;
57 extern int static_labelno
;
59 extern tree current_namespace
;
60 extern tree global_namespace
;
62 extern void (*print_error_function
) PROTO((char *));
64 /* Stack of places to restore the search obstack back to. */
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 tree lookup_nested_type
PROTO((tree
, tree
));
136 static char *redeclaration_error_message
PROTO((tree
, tree
));
137 static tree push_overloaded_decl
PROTO((tree
, int));
139 static struct stack_level
*push_decl_level
PROTO((struct stack_level
*,
141 static void push_binding_level
PROTO((struct binding_level
*, int,
143 static void pop_binding_level
PROTO((void));
144 static void suspend_binding_level
PROTO((void));
145 static void resume_binding_level
PROTO((struct binding_level
*));
146 static struct binding_level
*make_binding_level
PROTO((void));
147 static int namespace_bindings_p
PROTO((void));
148 static void declare_namespace_level
PROTO((void));
149 static void signal_catch
PROTO((int)) ATTRIBUTE_NORETURN
;
150 static void storedecls
PROTO((tree
));
151 static void storetags
PROTO((tree
));
152 static void require_complete_types_for_parms
PROTO((tree
));
153 static void push_overloaded_decl_1
PROTO((tree
));
154 static int ambi_op_p
PROTO((tree
));
155 static int unary_op_p
PROTO((tree
));
156 static tree store_bindings
PROTO((tree
, tree
));
157 static tree lookup_tag_reverse
PROTO((tree
, tree
));
158 static tree obscure_complex_init
PROTO((tree
, tree
));
159 static tree maybe_build_cleanup_1
PROTO((tree
, tree
));
160 static tree lookup_name_real
PROTO((tree
, int, int, int));
161 static void warn_extern_redeclared_static
PROTO((tree
, tree
));
162 static void grok_reference_init
PROTO((tree
, tree
, tree
));
163 static tree grokfndecl
PROTO((tree
, tree
, tree
, tree
, int,
164 enum overload_flags
, tree
,
165 tree
, tree
, int, int, int, int, int, int, tree
));
166 static tree grokvardecl
PROTO((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
167 static tree lookup_tag
PROTO((enum tree_code
, tree
,
168 struct binding_level
*, int));
169 static void set_identifier_type_value_with_scope
170 PROTO((tree
, tree
, struct binding_level
*));
171 static void set_identifier_local_value_with_scope
172 PROTO((tree
, tree
, struct binding_level
*));
173 static void record_builtin_type
PROTO((enum rid
, char *, tree
));
174 static void record_unknown_type
PROTO((tree
, char *));
175 static int member_function_or_else
PROTO((tree
, tree
, char *));
176 static void bad_specifiers
PROTO((tree
, char *, int, int, int, int,
178 static void lang_print_error_function
PROTO((char *));
179 static tree maybe_process_template_type_declaration
PROTO((tree
, int, struct binding_level
*));
181 #if defined (DEBUG_CP_BINDING_LEVELS)
182 static void indent
PROTO((void));
185 /* A node which has tree code ERROR_MARK, and whose type is itself.
186 All erroneous expressions are replaced with this node. All functions
187 that accept nodes as arguments should avoid generating error messages
188 if this node is one of the arguments, since it is undesirable to get
189 multiple error messages from one error in the input. */
191 tree error_mark_node
;
193 /* Erroneous argument lists can use this *IFF* they do not modify it. */
194 tree error_mark_list
;
196 /* INTEGER_TYPE and REAL_TYPE nodes for the standard data types */
198 tree short_integer_type_node
;
199 tree integer_type_node
;
200 tree long_integer_type_node
;
201 tree long_long_integer_type_node
;
203 tree short_unsigned_type_node
;
204 tree unsigned_type_node
;
205 tree long_unsigned_type_node
;
206 tree long_long_unsigned_type_node
;
208 tree ptrdiff_type_node
;
210 tree unsigned_char_type_node
;
211 tree signed_char_type_node
;
213 tree wchar_type_node
;
214 tree signed_wchar_type_node
;
215 tree unsigned_wchar_type_node
;
217 tree wchar_decl_node
;
219 tree float_type_node
;
220 tree double_type_node
;
221 tree long_double_type_node
;
223 tree complex_integer_type_node
;
224 tree complex_float_type_node
;
225 tree complex_double_type_node
;
226 tree complex_long_double_type_node
;
228 tree intQI_type_node
;
229 tree intHI_type_node
;
230 tree intSI_type_node
;
231 tree intDI_type_node
;
232 #if HOST_BITS_PER_WIDE_INT >= 64
233 tree intTI_type_node
;
236 tree unsigned_intQI_type_node
;
237 tree unsigned_intHI_type_node
;
238 tree unsigned_intSI_type_node
;
239 tree unsigned_intDI_type_node
;
240 #if HOST_BITS_PER_WIDE_INT >= 64
241 tree unsigned_intTI_type_node
;
244 tree java_byte_type_node
;
245 tree java_short_type_node
;
246 tree java_int_type_node
;
247 tree java_long_type_node
;
248 tree java_float_type_node
;
249 tree java_double_type_node
;
250 tree java_char_type_node
;
251 tree java_boolean_type_node
;
253 /* A VOID_TYPE node, and the same, packaged in a TREE_LIST. */
255 tree void_type_node
, void_list_node
;
258 /* Nodes for types `void *' and `const void *'. */
261 tree const_ptr_type_node
;
263 /* Nodes for types `char *' and `const char *'. */
265 tree string_type_node
, const_string_type_node
;
267 /* Type `char[256]' or something like it.
268 Used when an array of char is needed and the size is irrelevant. */
270 tree char_array_type_node
;
272 /* Type `int[256]' or something like it.
273 Used when an array of int needed and the size is irrelevant. */
275 tree int_array_type_node
;
277 /* Type `wchar_t[256]' or something like it.
278 Used when a wide string literal is created. */
280 tree wchar_array_type_node
;
282 /* The bool data type, and constants */
283 tree boolean_type_node
, boolean_true_node
, boolean_false_node
;
285 /* Type `int ()' -- used for implicit declaration of functions. */
287 tree default_function_type
;
289 /* Function types `double (double)' and `double (double, double)', etc. */
291 static tree double_ftype_double
, double_ftype_double_double
;
292 static tree int_ftype_int
, long_ftype_long
;
293 static tree float_ftype_float
;
294 static tree ldouble_ftype_ldouble
;
296 /* Function type `int (const void *, const void *, size_t)' */
297 static tree int_ftype_cptr_cptr_sizet
;
300 tree vtable_entry_type
;
301 tree delta_type_node
;
303 /* Old rtti stuff. */
304 tree __baselist_desc_type_node
;
305 tree __i_desc_type_node
, __m_desc_type_node
;
306 tree __t_desc_array_type
, __i_desc_array_type
, __m_desc_array_type
;
308 tree __t_desc_type_node
;
310 tree __tp_desc_type_node
;
312 tree __access_mode_type_node
;
313 tree __bltn_desc_type_node
, __user_desc_type_node
, __class_desc_type_node
;
314 tree __ptr_desc_type_node
, __attr_desc_type_node
, __func_desc_type_node
;
315 tree __ptmf_desc_type_node
, __ptmd_desc_type_node
;
317 /* Not needed yet? May be needed one day? */
318 tree __bltn_desc_array_type
, __user_desc_array_type
, __class_desc_array_type
;
319 tree __ptr_desc_array_type
, __attr_dec_array_type
, __func_desc_array_type
;
320 tree __ptmf_desc_array_type
, __ptmd_desc_array_type
;
323 /* Indicates that there is a type value in some namespace, although
324 that is not necessarily in scope at the moment. */
326 static tree global_type_node
;
328 tree class_star_type_node
;
329 tree class_type_node
, record_type_node
, union_type_node
, enum_type_node
;
330 tree unknown_type_node
;
331 tree opaque_type_node
, signature_type_node
;
332 tree sigtable_entry_type
;
334 /* Array type `vtable_entry_type[]' */
336 tree vtbl_ptr_type_node
;
342 /* Expect only namespace names now. */
343 static int only_namespace_names
;
345 /* In a destructor, the point at which all derived class destroying
346 has been done, just before any base class destroying will be done. */
350 /* In a destructor, the last insn emitted after the start of the
351 function and the parms. */
353 static rtx last_dtor_insn
;
355 /* In a constructor, the last insn emitted after the start of the
356 function and the parms, the exception specification and any
357 function-try-block. The constructor initializers are emitted after
360 static rtx last_parm_cleanup_insn
;
362 /* In a constructor, the point at which we are ready to return
363 the pointer to the initialized object. */
367 /* A FUNCTION_DECL which can call `abort'. Not necessarily the
368 one that the user will declare, but sufficient to be called
369 by routines that want to abort the program. */
373 extern rtx cleanup_label
, return_label
;
375 /* If original DECL_RESULT of current function was a register,
376 but due to being an addressable named return value, would up
377 on the stack, this variable holds the named return value's
378 original location. */
379 static rtx original_result_rtx
;
381 /* Sequence of insns which represents base initialization. */
384 /* C++: Keep these around to reduce calls to `get_identifier'.
385 Identifiers for `this' in member functions and the auto-delete
386 parameter for destructors. */
387 tree this_identifier
, in_charge_identifier
;
388 tree ctor_identifier
, dtor_identifier
;
389 /* Used in pointer to member functions, in vtables, and in sigtables. */
390 tree pfn_identifier
, index_identifier
, delta_identifier
, delta2_identifier
;
391 tree pfn_or_delta2_identifier
, tag_identifier
;
392 tree vt_off_identifier
;
394 struct named_label_list
396 struct binding_level
*binding_level
;
399 char *filename_o_goto
;
401 struct named_label_list
*next
;
404 /* A list (chain of TREE_LIST nodes) of named label uses.
405 The TREE_PURPOSE field is the list of variables defined
406 in the label's scope defined at the point of use.
407 The TREE_VALUE field is the LABEL_DECL used.
408 The TREE_TYPE field holds `current_binding_level' at the
409 point of the label's use.
411 BWAHAHAAHAHahhahahahaah. No, no, no, said the little chicken.
413 Look at the pretty struct named_label_list. See the pretty struct
414 with the pretty named fields that describe what they do. See the
415 pretty lack of gratuitous casts. Notice the code got a lot cleaner.
417 Used only for jumps to as-yet undefined labels, since
418 jumps to defined labels can have their validity checked
421 static struct named_label_list
*named_label_uses
= NULL
;
423 /* A list of objects which have constructors or destructors
424 which reside in the global scope. The decl is stored in
425 the TREE_VALUE slot and the initializer is stored
426 in the TREE_PURPOSE slot. */
427 tree static_aggregates
;
431 /* Two expressions that are constants with value zero.
432 The first is of type `int', the second of type `void *'. */
434 tree integer_zero_node
;
435 tree null_pointer_node
;
437 /* The value for __null (NULL), namely, a zero of an integer type with
438 the same number of bits as a pointer. */
441 /* A node for the integer constants 1, 2, and 3. */
443 tree integer_one_node
, integer_two_node
, integer_three_node
;
445 /* While defining an enum type, this is 1 plus the last enumerator
448 static tree enum_next_value
;
450 /* Nonzero means that there was overflow computing enum_next_value. */
452 static int enum_overflow
;
454 /* Parsing a function declarator leaves a list of parameter names
455 or a chain or parameter decls here. */
457 tree last_function_parms
;
459 /* Parsing a function declarator leaves here a chain of structure
460 and enum types declared in the parmlist. */
462 static tree last_function_parm_tags
;
464 /* After parsing the declarator that starts a function definition,
465 `start_function' puts here the list of parameter names or chain of decls.
466 `store_parm_decls' finds it here. */
468 static tree current_function_parms
;
470 /* Similar, for last_function_parm_tags. */
471 static tree current_function_parm_tags
;
473 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
474 that have names. Here so we can clear out their names' definitions
475 at the end of the function. */
477 static tree named_labels
;
479 /* A list of LABEL_DECLs from outer contexts that are currently shadowed. */
481 static tree shadowed_labels
;
483 /* The FUNCTION_DECL for the function currently being compiled,
484 or 0 if between functions. */
485 tree current_function_decl
;
487 /* Set to 0 at beginning of a function definition, set to 1 if
488 a return statement that specifies a return value is seen. */
490 int current_function_returns_value
;
492 /* Set to 0 at beginning of a function definition, set to 1 if
493 a return statement with no argument is seen. */
495 int current_function_returns_null
;
497 /* Set to 0 at beginning of a function definition, and whenever
498 a label (case or named) is defined. Set to value of expression
499 returned from function when that value can be transformed into
500 a named return value. */
502 tree current_function_return_value
;
504 /* Set to nonzero by `grokdeclarator' for a function
505 whose return type is defaulted, if warnings for this are desired. */
507 static int warn_about_return_type
;
509 /* Nonzero means give `double' the same size as `float'. */
511 extern int flag_short_double
;
513 /* Nonzero means don't recognize any builtin functions. */
515 extern int flag_no_builtin
;
517 /* Nonzero means don't recognize the non-ANSI builtin functions.
520 extern int flag_no_nonansi_builtin
;
522 /* Nonzero means enable obscure ANSI features and disable GNU extensions
523 that might cause ANSI-compliant code to be miscompiled. */
525 extern int flag_ansi
;
527 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
529 extern int flag_huge_objects
;
531 /* Nonzero if we want to conserve space in the .o files. We do this
532 by putting uninitialized data and runtime initialized data into
533 .common instead of .data at the expense of not flagging multiple
535 extern int flag_conserve_space
;
537 /* Pointers to the base and current top of the language name stack. */
539 extern tree
*current_lang_base
, *current_lang_stack
;
541 /* C and C++ flags are in decl2.c. */
543 /* Set to 0 at beginning of a constructor, set to 1
544 if that function does an allocation before referencing its
545 instance variable. */
546 static int current_function_assigns_this
;
547 int current_function_just_assigned_this
;
549 /* Set to 0 at beginning of a function. Set non-zero when
550 store_parm_decls is called. Don't call store_parm_decls
551 if this flag is non-zero! */
552 int current_function_parms_stored
;
554 /* Flag used when debugging spew.c */
556 extern int spew_debug
;
558 /* This is a copy of the class_shadowed list of the previous class binding
559 contour when at global scope. It's used to reset IDENTIFIER_CLASS_VALUEs
560 when entering another class scope (i.e. a cache miss). */
561 extern tree previous_class_values
;
563 /* A expression of value 0 with the same precision as a sizetype
565 tree signed_size_zero_node
;
567 /* The name of the anonymous namespace, throughout this translation
569 tree anonymous_namespace_name
;
572 /* Allocate a level of searching. */
576 push_decl_level (stack
, obstack
)
577 struct stack_level
*stack
;
578 struct obstack
*obstack
;
580 struct stack_level tem
;
583 return push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
586 /* For each binding contour we allocate a binding_level structure
587 which records the names defined in that contour.
590 1) one for each function definition,
591 where internal declarations of the parameters appear.
592 2) one for each compound statement,
593 to record its declarations.
595 The current meaning of a name can be found by searching the levels
596 from the current one out to the global one.
598 Off to the side, may be the class_binding_level. This exists only
599 to catch class-local declarations. It is otherwise nonexistent.
601 Also there may be binding levels that catch cleanups that must be
602 run when exceptions occur. */
604 /* Note that the information in the `names' component of the global contour
605 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
609 /* A chain of _DECL nodes for all variables, constants, functions,
610 and typedef types. These are in the reverse of the order
614 /* A list of structure, union and enum definitions, for looking up
616 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
617 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
618 or ENUMERAL_TYPE node.
620 C++: the TREE_VALUE nodes can be simple types for
621 component_bindings. */
624 /* A list of USING_DECL nodes. */
627 /* A list of used namespaces. PURPOSE is the namespace,
628 VALUE the common ancestor with this binding_level's namespace. */
629 tree using_directives
;
631 /* For each level, a list of shadowed outer-level local definitions
632 to be restored when this level is popped.
633 Each link is a TREE_LIST whose TREE_PURPOSE is an identifier and
634 whose TREE_VALUE is its old definition (a kind of ..._DECL node). */
637 /* Same, for IDENTIFIER_CLASS_VALUE. */
640 /* Same, for IDENTIFIER_TYPE_VALUE. */
643 /* For each level (except not the global one),
644 a chain of BLOCK nodes for all the levels
645 that were entered and exited one level down. */
648 /* The BLOCK node for this level, if one has been preallocated.
649 If 0, the BLOCK is allocated (if needed) when the level is popped. */
652 /* The binding level which this one is contained in (inherits from). */
653 struct binding_level
*level_chain
;
655 /* List of decls in `names' that have incomplete
656 structure or union types. */
659 /* List of VAR_DECLS saved from a previous for statement.
660 These would be dead in ANSI-conforming code, but might
661 be referenced in ARM-era code. */
662 tree dead_vars_from_for
;
664 /* 1 for the level that holds the parameters of a function.
665 2 for the level that holds a class declaration.
666 3 for levels that hold parameter declarations. */
667 unsigned parm_flag
: 4;
669 /* 1 means make a BLOCK for this level regardless of all else.
670 2 for temporary binding contours created by the compiler. */
673 /* Nonzero if this level "doesn't exist" for tags. */
674 unsigned tag_transparent
: 1;
676 /* Nonzero if this level can safely have additional
677 cleanup-needing variables added to it. */
678 unsigned more_cleanups_ok
: 1;
679 unsigned have_cleanups
: 1;
681 /* Nonzero if this level is for storing the decls for template
682 parameters and generic decls; these decls will be discarded and
683 replaced with a TEMPLATE_DECL. */
684 unsigned pseudo_global
: 1;
686 /* This is set for a namespace binding level. */
687 unsigned namespace_p
: 1;
689 /* True if this level is that of a for-statement where we need to
690 worry about ambiguous (ARM or ANSI) scope rules. */
691 unsigned is_for_scope
: 1;
693 /* Two bits left for this word. */
695 #if defined(DEBUG_CP_BINDING_LEVELS)
696 /* Binding depth at which this level began. */
697 unsigned binding_depth
;
698 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
701 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
703 /* The (non-class) binding level currently in effect. */
705 static struct binding_level
*current_binding_level
;
707 /* The binding level of the current class, if any. */
709 static struct binding_level
*class_binding_level
;
711 /* The current (class or non-class) binding level currently in effect. */
713 #define inner_binding_level \
714 (class_binding_level ? class_binding_level : current_binding_level)
716 /* A chain of binding_level structures awaiting reuse. */
718 static struct binding_level
*free_binding_level
;
720 /* The outermost binding level, for names of file scope.
721 This is created when the compiler is started and exists
722 through the entire run. */
724 static struct binding_level
*global_binding_level
;
726 /* Binding level structures are initialized by copying this one. */
728 static struct binding_level clear_binding_level
;
730 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
732 static int keep_next_level_flag
;
734 #if defined(DEBUG_CP_BINDING_LEVELS)
735 static int binding_depth
= 0;
736 static int is_class_level
= 0;
743 for (i
= 0; i
< binding_depth
*2; i
++)
746 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
748 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
751 push_binding_level (newlevel
, tag_transparent
, keep
)
752 struct binding_level
*newlevel
;
753 int tag_transparent
, keep
;
755 /* Add this level to the front of the chain (stack) of levels that
757 *newlevel
= clear_binding_level
;
758 if (class_binding_level
)
760 newlevel
->level_chain
= class_binding_level
;
761 class_binding_level
= (struct binding_level
*)0;
765 newlevel
->level_chain
= current_binding_level
;
767 current_binding_level
= newlevel
;
768 newlevel
->tag_transparent
= tag_transparent
;
769 newlevel
->more_cleanups_ok
= 1;
770 newlevel
->keep
= keep
;
771 #if defined(DEBUG_CP_BINDING_LEVELS)
772 newlevel
->binding_depth
= binding_depth
;
774 fprintf (stderr
, "push %s level 0x%08x line %d\n",
775 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
778 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
784 if (class_binding_level
)
785 current_binding_level
= class_binding_level
;
787 if (global_binding_level
)
789 /* Cannot pop a level, if there are none left to pop. */
790 if (current_binding_level
== global_binding_level
)
791 my_friendly_abort (123);
793 /* Pop the current level, and free the structure for reuse. */
794 #if defined(DEBUG_CP_BINDING_LEVELS)
797 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
798 (is_class_level
) ? "class" : "block",
799 current_binding_level
, lineno
);
800 if (is_class_level
!= (current_binding_level
== class_binding_level
))
803 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
806 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
808 register struct binding_level
*level
= current_binding_level
;
809 current_binding_level
= current_binding_level
->level_chain
;
810 level
->level_chain
= free_binding_level
;
811 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
812 if (level
->binding_depth
!= binding_depth
)
814 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
815 free_binding_level
= level
;
817 class_binding_level
= current_binding_level
;
818 if (class_binding_level
->parm_flag
!= 2)
819 class_binding_level
= 0;
820 while (current_binding_level
->parm_flag
== 2)
821 current_binding_level
= current_binding_level
->level_chain
;
826 suspend_binding_level ()
828 if (class_binding_level
)
829 current_binding_level
= class_binding_level
;
831 if (global_binding_level
)
833 /* Cannot suspend a level, if there are none left to suspend. */
834 if (current_binding_level
== global_binding_level
)
835 my_friendly_abort (123);
837 /* Suspend the current level. */
838 #if defined(DEBUG_CP_BINDING_LEVELS)
841 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
842 (is_class_level
) ? "class" : "block",
843 current_binding_level
, lineno
);
844 if (is_class_level
!= (current_binding_level
== class_binding_level
))
847 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
850 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
852 current_binding_level
= current_binding_level
->level_chain
;
853 class_binding_level
= current_binding_level
;
854 if (class_binding_level
->parm_flag
!= 2)
855 class_binding_level
= 0;
856 while (current_binding_level
->parm_flag
== 2)
857 current_binding_level
= current_binding_level
->level_chain
;
862 resume_binding_level (b
)
863 struct binding_level
*b
;
865 /* Resuming binding levels is meant only for namespaces,
866 and those cannot nest into classes. */
867 my_friendly_assert(!class_binding_level
, 386);
868 /* Also, resuming a non-directly nested namespace is a no-no. */
869 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
870 current_binding_level
= b
;
871 #if defined(DEBUG_CP_BINDING_LEVELS)
872 b
->binding_depth
= binding_depth
;
874 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
875 (is_class_level
) ? "class" : "block", b
, lineno
);
878 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
881 /* Create a new `struct binding_level'. */
884 struct binding_level
*
885 make_binding_level ()
888 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
891 /* Nonzero if we are currently in the global binding level. */
896 return current_binding_level
== global_binding_level
;
899 /* Nonzero if we are currently in a toplevel binding level. This
900 means either the global binding level or a namespace in a toplevel
902 Since there are no non-toplevel namespace levels, this really
903 means any namespace or pseudo-global level. */
906 toplevel_bindings_p ()
908 return current_binding_level
->namespace_p
909 || current_binding_level
->pseudo_global
;
912 /* Nonzero if this is a namespace scope. */
915 namespace_bindings_p ()
917 return current_binding_level
->namespace_p
;
923 keep_next_level_flag
= 1;
926 /* Nonzero if the current level needs to have a BLOCK made. */
931 return (current_binding_level
->blocks
!= NULL_TREE
932 || current_binding_level
->keep
933 || current_binding_level
->names
!= NULL_TREE
934 || (current_binding_level
->tags
!= NULL_TREE
935 && !current_binding_level
->tag_transparent
));
938 /* Identify this binding level as a level of parameters. */
941 declare_parm_level ()
943 current_binding_level
->parm_flag
= 1;
947 declare_pseudo_global_level ()
949 current_binding_level
->pseudo_global
= 1;
953 declare_namespace_level ()
955 current_binding_level
->namespace_p
= 1;
959 pseudo_global_level_p ()
961 return current_binding_level
->pseudo_global
;
965 set_class_shadows (shadows
)
968 class_binding_level
->class_shadowed
= shadows
;
971 /* Enter a new binding level.
972 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
973 not for that of tags. */
976 pushlevel (tag_transparent
)
979 register struct binding_level
*newlevel
= NULL_BINDING_LEVEL
;
981 /* If this is the top level of a function,
982 just make sure that NAMED_LABELS is 0.
983 They should have been set to 0 at the end of the previous function. */
985 if (current_binding_level
== global_binding_level
)
986 my_friendly_assert (named_labels
== NULL_TREE
, 134);
988 /* Reuse or create a struct for this binding level. */
990 #if defined(DEBUG_CP_BINDING_LEVELS)
992 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
993 if (free_binding_level
)
994 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
996 newlevel
= free_binding_level
;
997 free_binding_level
= free_binding_level
->level_chain
;
1001 newlevel
= make_binding_level ();
1004 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
1005 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
1006 keep_next_level_flag
= 0;
1010 note_level_for_for ()
1012 current_binding_level
->is_for_scope
= 1;
1016 pushlevel_temporary (tag_transparent
)
1017 int tag_transparent
;
1019 pushlevel (tag_transparent
);
1020 current_binding_level
->keep
= 2;
1023 /* Note we don't call push_momentary() here. Otherwise, it would cause
1024 cleanups to be allocated on the momentary obstack, and they will be
1025 overwritten by the next statement. */
1027 expand_start_bindings (0);
1030 /* Exit a binding level.
1031 Pop the level off, and restore the state of the identifier-decl mappings
1032 that were in effect when this level was entered.
1034 If KEEP == 1, this level had explicit declarations, so
1035 and create a "block" (a BLOCK node) for the level
1036 to record its declarations and subblocks for symbol table output.
1038 If KEEP == 2, this level's subblocks go to the front,
1039 not the back of the current binding level. This happens,
1040 for instance, when code for constructors and destructors
1041 need to generate code at the end of a function which must
1042 be moved up to the front of the function.
1044 If FUNCTIONBODY is nonzero, this level is the body of a function,
1045 so create a block as if KEEP were set and also clear out all
1048 If REVERSE is nonzero, reverse the order of decls before putting
1049 them into the BLOCK. */
1052 poplevel (keep
, reverse
, functionbody
)
1058 /* The chain of decls was accumulated in reverse order.
1059 Put it into forward order, just for cleanliness. */
1061 int tmp
= functionbody
;
1062 int real_functionbody
= current_binding_level
->keep
== 2
1063 ? ((functionbody
= 0), tmp
) : functionbody
;
1064 tree tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1065 tree subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1066 tree block
= NULL_TREE
;
1068 int block_previously_created
;
1070 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1071 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1072 current_binding_level
->parm_flag
,
1073 current_binding_level
->keep
);
1075 if (current_binding_level
->keep
== 1)
1078 /* Get the decls in the order they were written.
1079 Usually current_binding_level->names is in reverse order.
1080 But parameter decls were previously put in forward order. */
1083 current_binding_level
->names
1084 = decls
= nreverse (current_binding_level
->names
);
1086 decls
= current_binding_level
->names
;
1088 /* Output any nested inline functions within this block
1089 if they weren't already output. */
1091 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1092 if (TREE_CODE (decl
) == FUNCTION_DECL
1093 && ! TREE_ASM_WRITTEN (decl
)
1094 && DECL_INITIAL (decl
) != NULL_TREE
1095 && TREE_ADDRESSABLE (decl
)
1096 && decl_function_context (decl
) == current_function_decl
)
1098 /* If this decl was copied from a file-scope decl
1099 on account of a block-scope extern decl,
1100 propagate TREE_ADDRESSABLE to the file-scope decl. */
1101 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1102 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1105 push_function_context ();
1106 output_inline_function (decl
);
1107 pop_function_context ();
1111 /* If there were any declarations or structure tags in that level,
1112 or if this level is a function body,
1113 create a BLOCK to record them for the life of this function. */
1116 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1117 if (block_previously_created
)
1118 block
= current_binding_level
->this_block
;
1119 else if (keep
== 1 || functionbody
)
1120 block
= make_node (BLOCK
);
1121 if (block
!= NULL_TREE
)
1123 if (block_previously_created
)
1125 if (decls
|| tags
|| subblocks
)
1127 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1129 warning ("internal compiler error: debugging info corrupted");
1131 BLOCK_VARS (block
) = decls
;
1132 BLOCK_TYPE_TAGS (block
) = tags
;
1134 /* We can have previous subblocks and new subblocks when
1135 doing fixup_gotos with complex cleanups. We chain the new
1136 subblocks onto the end of any pre-existing subblocks. */
1137 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1140 /* If we created the block earlier on, and we are just
1141 diddling it now, then it already should have a proper
1142 BLOCK_END_NOTE value associated with it. */
1146 BLOCK_VARS (block
) = decls
;
1147 BLOCK_TYPE_TAGS (block
) = tags
;
1148 BLOCK_SUBBLOCKS (block
) = subblocks
;
1149 /* Otherwise, for a new block, install a new BLOCK_END_NOTE value. */
1150 remember_end_note (block
);
1154 /* In each subblock, record that this is its superior. */
1157 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1158 BLOCK_SUPERCONTEXT (link
) = block
;
1160 /* Clear out the meanings of the local variables of this level. */
1162 if (current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1)
1164 struct binding_level
*outer
= current_binding_level
->level_chain
;
1165 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1167 if (TREE_CODE (link
) == VAR_DECL
)
1168 DECL_DEAD_FOR_LOCAL (link
) = 1;
1170 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = NULL_TREE
;
1173 /* Save declarations made in a 'for' statement so we can support pre-ANSI
1174 'for' scoping semantics. */
1176 for (link
= current_binding_level
->shadowed
; link
; link
= TREE_CHAIN (link
))
1178 tree id
= TREE_PURPOSE (link
);
1179 tree decl
= IDENTIFIER_LOCAL_VALUE (id
);
1181 if (decl
&& DECL_DEAD_FOR_LOCAL (decl
))
1183 /* In this case keep the dead for-decl visible,
1184 but remember what (if anything) it shadowed. */
1185 DECL_SHADOWED_FOR_VAR (decl
) = TREE_VALUE (link
);
1186 TREE_CHAIN (decl
) = outer
->dead_vars_from_for
;
1187 outer
->dead_vars_from_for
= decl
;
1190 IDENTIFIER_LOCAL_VALUE (id
) = TREE_VALUE (link
);
1193 else /* Not special for scope. */
1195 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1197 if (DECL_NAME (link
) != NULL_TREE
)
1199 /* If the ident. was used or addressed via a local extern decl,
1200 don't forget that fact. */
1201 if (DECL_EXTERNAL (link
))
1203 if (TREE_USED (link
))
1204 TREE_USED (DECL_ASSEMBLER_NAME (link
)) = 1;
1205 if (TREE_ADDRESSABLE (link
))
1206 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (link
)) = 1;
1208 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = NULL_TREE
;
1212 /* Restore all name-meanings of the outer levels
1213 that were shadowed by this level. */
1215 for (link
= current_binding_level
->shadowed
;
1216 link
; link
= TREE_CHAIN (link
))
1217 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1219 /* We first restore the regular decls and *then* the dead_vars_from_for
1220 to handle this case:
1224 for (int i; ; ) { ...} // i#2
1228 In this case, we want remove the binding for i#3, restoring
1229 that of i#2. Then we want to remove the binding for i#2,
1230 and restore that of i#1. */
1232 link
= current_binding_level
->dead_vars_from_for
;
1233 for (; link
!= NULL_TREE
; link
= TREE_CHAIN (link
))
1235 tree id
= DECL_NAME (link
);
1236 if (IDENTIFIER_LOCAL_VALUE (id
) == link
)
1237 IDENTIFIER_LOCAL_VALUE (id
) = DECL_SHADOWED_FOR_VAR (link
);
1240 for (link
= current_binding_level
->class_shadowed
;
1241 link
; link
= TREE_CHAIN (link
))
1242 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1243 for (link
= current_binding_level
->type_shadowed
;
1244 link
; link
= TREE_CHAIN (link
))
1245 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1248 /* If the level being exited is the top level of a function,
1249 check over all the labels. */
1253 /* If this is the top level block of a function,
1254 the vars are the function's parameters.
1255 Don't leave them in the BLOCK because they are
1256 found in the FUNCTION_DECL instead. */
1258 BLOCK_VARS (block
) = 0;
1260 /* Clear out the definitions of all label names,
1261 since their scopes end here. */
1263 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1265 register tree label
= TREE_VALUE (link
);
1267 if (DECL_INITIAL (label
) == NULL_TREE
)
1269 cp_error_at ("label `%D' used but not defined", label
);
1270 /* Avoid crashing later. */
1271 define_label (input_filename
, 1, DECL_NAME (label
));
1273 else if (warn_unused
&& !TREE_USED (label
))
1274 cp_warning_at ("label `%D' defined but not used", label
);
1275 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), NULL_TREE
);
1277 /* Put the labels into the "variables" of the
1278 top-level block, so debugger can see them. */
1279 TREE_CHAIN (label
) = BLOCK_VARS (block
);
1280 BLOCK_VARS (block
) = label
;
1283 named_labels
= NULL_TREE
;
1286 /* Any uses of undefined labels now operate under constraints
1287 of next binding contour. */
1289 struct binding_level
*level_chain
;
1290 level_chain
= current_binding_level
->level_chain
;
1293 struct named_label_list
*labels
;
1294 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1295 if (labels
->binding_level
== current_binding_level
)
1297 labels
->binding_level
= level_chain
;
1298 labels
->names_in_scope
= level_chain
->names
;
1303 tmp
= current_binding_level
->keep
;
1305 pop_binding_level ();
1307 DECL_INITIAL (current_function_decl
) = block
;
1310 if (!block_previously_created
)
1311 current_binding_level
->blocks
1312 = chainon (current_binding_level
->blocks
, block
);
1314 /* If we did not make a block for the level just exited,
1315 any blocks made for inner levels
1316 (since they cannot be recorded as subblocks in that level)
1317 must be carried forward so they will later become subblocks
1318 of something else. */
1322 current_binding_level
->blocks
1323 = chainon (subblocks
, current_binding_level
->blocks
);
1325 current_binding_level
->blocks
1326 = chainon (current_binding_level
->blocks
, subblocks
);
1329 /* Take care of compiler's internal binding structures. */
1332 expand_end_bindings (getdecls (), keep
, 1);
1333 /* Each and every BLOCK node created here in `poplevel' is important
1334 (e.g. for proper debugging information) so if we created one
1335 earlier, mark it as "used". */
1337 TREE_USED (block
) = 1;
1338 block
= poplevel (keep
, reverse
, real_functionbody
);
1341 /* Each and every BLOCK node created here in `poplevel' is important
1342 (e.g. for proper debugging information) so if we created one
1343 earlier, mark it as "used". */
1345 TREE_USED (block
) = 1;
1349 /* Delete the node BLOCK from the current binding level.
1350 This is used for the block inside a stmt expr ({...})
1351 so that the block can be reinserted where appropriate. */
1354 delete_block (block
)
1358 if (current_binding_level
->blocks
== block
)
1359 current_binding_level
->blocks
= TREE_CHAIN (block
);
1360 for (t
= current_binding_level
->blocks
; t
;)
1362 if (TREE_CHAIN (t
) == block
)
1363 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1367 TREE_CHAIN (block
) = NULL_TREE
;
1368 /* Clear TREE_USED which is always set by poplevel.
1369 The flag is set again if insert_block is called. */
1370 TREE_USED (block
) = 0;
1373 /* Insert BLOCK at the end of the list of subblocks of the
1374 current binding level. This is used when a BIND_EXPR is expanded,
1375 to handle the BLOCK node inside the BIND_EXPR. */
1378 insert_block (block
)
1381 TREE_USED (block
) = 1;
1382 current_binding_level
->blocks
1383 = chainon (current_binding_level
->blocks
, block
);
1386 /* Set the BLOCK node for the innermost scope
1387 (the one we are currently in). */
1391 register tree block
;
1393 current_binding_level
->this_block
= block
;
1396 /* Do a pushlevel for class declarations. */
1401 register struct binding_level
*newlevel
;
1403 /* Reuse or create a struct for this binding level. */
1404 #if defined(DEBUG_CP_BINDING_LEVELS)
1406 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1407 if (free_binding_level
)
1408 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1410 newlevel
= free_binding_level
;
1411 free_binding_level
= free_binding_level
->level_chain
;
1415 newlevel
= make_binding_level ();
1418 #if defined(DEBUG_CP_BINDING_LEVELS)
1420 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1422 push_binding_level (newlevel
, 0, 0);
1424 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1425 class_binding_level
= current_binding_level
;
1426 class_binding_level
->parm_flag
= 2;
1427 /* We have just pushed into a new binding level. Now, fake out the rest
1428 of the compiler. Set the `current_binding_level' back to point to
1429 the most closely containing non-class binding level. */
1432 current_binding_level
= current_binding_level
->level_chain
;
1434 while (current_binding_level
->parm_flag
== 2);
1437 /* ...and a poplevel for class declarations. FORCE is used to force
1438 clearing out of CLASS_VALUEs after a class definition. */
1441 poplevel_class (force
)
1444 register struct binding_level
*level
= class_binding_level
;
1445 tree block
= NULL_TREE
;
1448 my_friendly_assert (level
!= 0, 354);
1450 decl_stack
= pop_stack_level (decl_stack
);
1451 for (shadowed
= level
->shadowed
; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
1452 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (shadowed
)) = TREE_VALUE (shadowed
);
1453 /* If we're leaving a toplevel class, don't bother to do the setting
1454 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1455 shouldn't even be used when current_class_type isn't set, and second,
1456 if we don't touch it here, we're able to use the cache effect if the
1457 next time we're entering a class scope, it is the same class. */
1458 if (current_class_depth
!= 1 || force
)
1459 for (shadowed
= level
->class_shadowed
;
1461 shadowed
= TREE_CHAIN (shadowed
))
1462 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = TREE_VALUE (shadowed
);
1464 /* Remember to save what IDENTIFIER's were bound in this scope so we
1465 can recover from cache misses. */
1467 previous_class_type
= current_class_type
;
1468 previous_class_values
= class_binding_level
->class_shadowed
;
1470 for (shadowed
= level
->type_shadowed
;
1472 shadowed
= TREE_CHAIN (shadowed
))
1473 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1475 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1476 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1477 class_binding_level
->parm_flag
,
1478 class_binding_level
->keep
);
1480 if (class_binding_level
->parm_flag
!= 2)
1481 class_binding_level
= (struct binding_level
*)0;
1483 /* Now, pop out of the binding level which we created up in the
1484 `pushlevel_class' routine. */
1485 #if defined(DEBUG_CP_BINDING_LEVELS)
1487 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1489 pop_binding_level ();
1494 /* For debugging. */
1495 static int no_print_functions
= 0;
1496 static int no_print_builtins
= 0;
1499 print_binding_level (lvl
)
1500 struct binding_level
*lvl
;
1504 fprintf (stderr
, " blocks=");
1505 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1506 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1507 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1508 if (lvl
->tag_transparent
)
1509 fprintf (stderr
, " tag-transparent");
1510 if (lvl
->more_cleanups_ok
)
1511 fprintf (stderr
, " more-cleanups-ok");
1512 if (lvl
->have_cleanups
)
1513 fprintf (stderr
, " have-cleanups");
1514 fprintf (stderr
, "\n");
1517 fprintf (stderr
, " names:\t");
1518 /* We can probably fit 3 names to a line? */
1519 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1521 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1523 if (no_print_builtins
1524 && (TREE_CODE (t
) == TYPE_DECL
)
1525 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1528 /* Function decls tend to have longer names. */
1529 if (TREE_CODE (t
) == FUNCTION_DECL
)
1536 fprintf (stderr
, "\n\t");
1539 print_node_brief (stderr
, "", t
, 0);
1540 if (t
== error_mark_node
)
1544 fprintf (stderr
, "\n");
1548 fprintf (stderr
, " tags:\t");
1550 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1552 if (TREE_PURPOSE (t
) == NULL_TREE
)
1554 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1561 fprintf (stderr
, "\n\t");
1564 if (TREE_PURPOSE (t
) == NULL_TREE
)
1566 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1567 fprintf (stderr
, ">");
1569 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1570 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1573 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1574 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1575 fprintf (stderr
, ">");
1579 fprintf (stderr
, "\n");
1583 fprintf (stderr
, " shadowed:");
1584 for (t
= lvl
->shadowed
; t
; t
= TREE_CHAIN (t
))
1586 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1588 fprintf (stderr
, "\n");
1590 if (lvl
->class_shadowed
)
1592 fprintf (stderr
, " class-shadowed:");
1593 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1595 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1597 fprintf (stderr
, "\n");
1599 if (lvl
->type_shadowed
)
1601 fprintf (stderr
, " type-shadowed:");
1602 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1604 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1606 fprintf (stderr
, "\n");
1611 print_other_binding_stack (stack
)
1612 struct binding_level
*stack
;
1614 struct binding_level
*level
;
1615 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1617 fprintf (stderr
, "binding level ");
1618 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1619 fprintf (stderr
, "\n");
1620 print_binding_level (level
);
1625 print_binding_stack ()
1627 struct binding_level
*b
;
1628 fprintf (stderr
, "current_binding_level=");
1629 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
1630 fprintf (stderr
, "\nclass_binding_level=");
1631 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
1632 fprintf (stderr
, "\nglobal_binding_level=");
1633 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
1634 fprintf (stderr
, "\n");
1635 if (class_binding_level
)
1637 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1638 if (b
== current_binding_level
)
1641 b
= class_binding_level
;
1643 b
= current_binding_level
;
1646 b
= current_binding_level
;
1647 print_other_binding_stack (b
);
1648 fprintf (stderr
, "global:\n");
1649 print_binding_level (global_binding_level
);
1652 /* Namespace binding access routines: The namespace_bindings field of
1653 the identifier is polymorphic, with three possible values:
1654 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
1655 indicating the BINDING_VALUE of global_namespace. */
1657 /* Check whether the a binding for the name to scope is known.
1658 Assumes that the bindings of the name are already a list
1659 of bindings. Returns the binding found, or NULL_TREE. */
1662 find_binding (name
, scope
)
1666 tree iter
, prev
= NULL_TREE
;
1668 scope
= ORIGINAL_NAMESPACE (scope
);
1670 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
1671 iter
= TREE_CHAIN (iter
))
1673 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
1674 if (BINDING_SCOPE (iter
) == scope
)
1676 /* Move binding found to the fron of the list, so
1677 subsequent lookups will find it faster. */
1680 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
1681 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
1682 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
1691 /* Always returns a binding for name in scope. If the
1692 namespace_bindings is not a list, convert it to one first.
1693 If no binding is found, make a new one. */
1696 binding_for_name (name
, scope
)
1700 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1703 scope
= ORIGINAL_NAMESPACE (scope
);
1705 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
1707 /* Get rid of optimization for global scope. */
1708 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
1709 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
1710 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1712 if (b
&& (result
= find_binding (name
, scope
)))
1714 /* Not found, make a new permanent one. */
1715 push_obstacks (&permanent_obstack
, &permanent_obstack
);
1716 result
= make_node (CPLUS_BINDING
);
1717 TREE_CHAIN (result
) = b
;
1718 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
1719 BINDING_SCOPE (result
) = scope
;
1720 BINDING_TYPE (result
) = NULL_TREE
;
1721 BINDING_VALUE (result
) = NULL_TREE
;
1726 /* Return the binding value for name in scope, considering that
1727 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
1730 namespace_binding (name
, scope
)
1734 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1737 if (scope
== NULL_TREE
)
1738 scope
= global_namespace
;
1739 if (TREE_CODE (b
) != CPLUS_BINDING
)
1740 return (scope
== global_namespace
) ? b
: NULL_TREE
;
1741 name
= find_binding (name
,scope
);
1742 if (name
== NULL_TREE
)
1744 return BINDING_VALUE (name
);
1747 /* Set the binding value for name in scope. If modifying the binding
1748 of global_namespace is attempted, try to optimize it. */
1751 set_namespace_binding (name
, scope
, val
)
1758 if (scope
== NULL_TREE
)
1759 scope
= global_namespace
;
1761 if (scope
== global_namespace
)
1763 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
1764 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
1766 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
1770 b
= binding_for_name (name
, scope
);
1771 BINDING_VALUE (b
) = val
;
1774 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
1775 select a name that is unique to this compilation unit. */
1778 push_namespace (name
)
1783 int implicit_use
= 0;
1785 if (!global_namespace
)
1787 /* This must be ::. */
1788 my_friendly_assert (name
== get_identifier ("::"), 377);
1793 /* The name of anonymous namespace is unique for the translation
1795 if (!anonymous_namespace_name
)
1796 anonymous_namespace_name
= get_file_function_name ('N');
1797 name
= anonymous_namespace_name
;
1798 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
1800 /* Reopening anonymous namespace. */
1804 else if (current_namespace
== global_namespace
1805 && name
== DECL_NAME (std_node
))
1812 /* Check whether this is an extended namespace definition. */
1813 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
1814 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
1817 if (DECL_NAMESPACE_ALIAS (d
))
1819 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
1820 d
, DECL_NAMESPACE_ALIAS (d
));
1821 d
= DECL_NAMESPACE_ALIAS (d
);
1828 /* Make a new namespace, binding the name to it. */
1829 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
1830 /* The global namespace is not pushed, and the global binding
1831 level is set elsewhere. */
1836 declare_namespace_level ();
1837 NAMESPACE_LEVEL (d
) = current_binding_level
;
1841 resume_binding_level (NAMESPACE_LEVEL (d
));
1844 do_using_directive (d
);
1845 /* Enter the name space. */
1846 current_namespace
= d
;
1849 /* Pop from the scope of the current namespace. */
1854 if (current_namespace
== global_namespace
)
1856 my_friendly_assert (in_std
>0, 980421);
1860 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
1861 /* The binding level is not popped, as it might be re-opened later. */
1862 suspend_binding_level ();
1865 /* Concatenate the binding levels of all namespaces. */
1868 cat_namespace_levels()
1872 struct binding_level
*b
;
1874 last
= NAMESPACE_LEVEL (global_namespace
) -> names
;
1875 /* The nested namespaces appear in the names list of their ancestors. */
1876 for (current
= last
; current
; current
= TREE_CHAIN (current
))
1878 if (TREE_CODE (current
) != NAMESPACE_DECL
1879 || DECL_NAMESPACE_ALIAS (current
))
1881 if (!DECL_LANG_SPECIFIC (current
))
1884 my_friendly_assert (current
== std_node
, 393);
1887 b
= NAMESPACE_LEVEL (current
);
1888 while (TREE_CHAIN (last
))
1889 last
= TREE_CHAIN (last
);
1890 TREE_CHAIN (last
) = NAMESPACE_LEVEL (current
) -> names
;
1894 /* Subroutines for reverting temporarily to top-level for instantiation
1895 of templates and such. We actually need to clear out the class- and
1896 local-value slots of all identifiers, so that only the global values
1897 are at all visible. Simply setting current_binding_level to the global
1898 scope isn't enough, because more binding levels may be pushed. */
1899 struct saved_scope
{
1900 struct binding_level
*old_binding_level
;
1903 struct saved_scope
*prev
;
1904 tree class_name
, class_type
;
1905 tree access_specifier
;
1907 struct binding_level
*class_bindings
;
1908 tree
*lang_base
, *lang_stack
, lang_name
;
1910 int minimal_parse_mode
;
1911 tree last_function_parms
;
1912 tree template_parms
;
1913 HOST_WIDE_INT processing_template_decl
;
1914 tree previous_class_type
, previous_class_values
;
1915 int processing_specialization
;
1916 int processing_explicit_instantiation
;
1918 static struct saved_scope
*current_saved_scope
;
1920 /* A chain of the binding vecs created by store_bindings. We create a
1921 whole bunch of these during compilation, on permanent_obstack, so we
1922 can't just throw them away. */
1923 static tree free_binding_vecs
;
1926 store_bindings (names
, old_bindings
)
1927 tree names
, old_bindings
;
1930 for (t
= names
; t
; t
= TREE_CHAIN (t
))
1932 tree binding
, t1
, id
;
1934 if (TREE_CODE (t
) == TREE_LIST
)
1935 id
= TREE_PURPOSE (t
);
1940 || (!IDENTIFIER_LOCAL_VALUE (id
)
1941 && !IDENTIFIER_CLASS_VALUE (id
)))
1944 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
1945 if (TREE_VEC_ELT (t1
, 0) == id
)
1948 if (free_binding_vecs
)
1950 binding
= free_binding_vecs
;
1951 free_binding_vecs
= TREE_CHAIN (free_binding_vecs
);
1954 binding
= make_tree_vec (4);
1958 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
1959 TREE_VEC_ELT (binding
, 0) = id
;
1960 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
1961 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_LOCAL_VALUE (id
);
1962 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
1963 IDENTIFIER_LOCAL_VALUE (id
) = NULL_TREE
;
1964 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
1966 TREE_CHAIN (binding
) = old_bindings
;
1967 old_bindings
= binding
;
1971 return old_bindings
;
1975 maybe_push_to_top_level (pseudo
)
1978 extern int current_lang_stacksize
;
1979 struct saved_scope
*s
1980 = (struct saved_scope
*) xmalloc (sizeof (struct saved_scope
));
1981 struct binding_level
*b
= inner_binding_level
;
1982 tree old_bindings
= NULL_TREE
;
1984 if (current_function_decl
)
1985 push_cp_function_context (NULL_TREE
);
1987 if (previous_class_type
)
1988 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
1990 /* Have to include global_binding_level, because class-level decls
1991 aren't listed anywhere useful. */
1992 for (; b
; b
= b
->level_chain
)
1996 /* Template IDs are inserted into the global level. If they were
1997 inserted into namespace level, finish_file wouldn't find them
1998 when doing pending instantiations. Therefore, don't stop at
1999 namespace level, but continue until :: . */
2000 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2003 old_bindings
= store_bindings (b
->names
, old_bindings
);
2004 /* We also need to check class_shadowed to save class-level type
2005 bindings, since pushclass doesn't fill in b->names. */
2006 if (b
->parm_flag
== 2)
2007 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2009 /* Unwind type-value slots back to top level. */
2010 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2011 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2014 s
->old_binding_level
= current_binding_level
;
2015 current_binding_level
= b
;
2017 s
->old_namespace
= current_namespace
;
2018 s
->class_name
= current_class_name
;
2019 s
->class_type
= current_class_type
;
2020 s
->access_specifier
= current_access_specifier
;
2021 s
->function_decl
= current_function_decl
;
2022 s
->class_bindings
= class_binding_level
;
2023 s
->lang_stack
= current_lang_stack
;
2024 s
->lang_base
= current_lang_base
;
2025 s
->lang_stacksize
= current_lang_stacksize
;
2026 s
->lang_name
= current_lang_name
;
2027 s
->minimal_parse_mode
= minimal_parse_mode
;
2028 s
->last_function_parms
= last_function_parms
;
2029 s
->template_parms
= current_template_parms
;
2030 s
->processing_template_decl
= processing_template_decl
;
2031 s
->previous_class_type
= previous_class_type
;
2032 s
->previous_class_values
= previous_class_values
;
2033 s
->processing_specialization
= processing_specialization
;
2034 s
->processing_explicit_instantiation
= processing_explicit_instantiation
;
2036 current_class_name
= current_class_type
= NULL_TREE
;
2037 current_function_decl
= NULL_TREE
;
2038 class_binding_level
= (struct binding_level
*)0;
2039 current_lang_stacksize
= 10;
2040 current_lang_stack
= current_lang_base
2041 = (tree
*) xmalloc (current_lang_stacksize
* sizeof (tree
));
2042 current_lang_name
= lang_name_cplusplus
;
2043 strict_prototype
= strict_prototypes_lang_cplusplus
;
2044 named_labels
= NULL_TREE
;
2045 shadowed_labels
= NULL_TREE
;
2046 minimal_parse_mode
= 0;
2047 previous_class_type
= previous_class_values
= NULL_TREE
;
2048 processing_specialization
= 0;
2049 processing_explicit_instantiation
= 0;
2050 current_template_parms
= NULL_TREE
;
2051 processing_template_decl
= 0;
2052 current_namespace
= global_namespace
;
2054 s
->prev
= current_saved_scope
;
2055 s
->old_bindings
= old_bindings
;
2056 current_saved_scope
= s
;
2058 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2062 push_to_top_level ()
2064 maybe_push_to_top_level (0);
2068 pop_from_top_level ()
2070 extern int current_lang_stacksize
;
2071 struct saved_scope
*s
= current_saved_scope
;
2074 /* Clear out class-level bindings cache. */
2075 if (previous_class_type
)
2078 previous_class_type
= NULL_TREE
;
2083 current_binding_level
= s
->old_binding_level
;
2084 current_saved_scope
= s
->prev
;
2085 for (t
= s
->old_bindings
; t
; )
2088 tree id
= TREE_VEC_ELT (t
, 0);
2091 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2092 IDENTIFIER_LOCAL_VALUE (id
) = TREE_VEC_ELT (t
, 2);
2093 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2096 TREE_CHAIN (save
) = free_binding_vecs
;
2097 free_binding_vecs
= save
;
2099 current_namespace
= s
->old_namespace
;
2100 current_class_name
= s
->class_name
;
2101 current_class_type
= s
->class_type
;
2102 current_access_specifier
= s
->access_specifier
;
2103 current_function_decl
= s
->function_decl
;
2104 class_binding_level
= s
->class_bindings
;
2105 free (current_lang_base
);
2106 current_lang_base
= s
->lang_base
;
2107 current_lang_stack
= s
->lang_stack
;
2108 current_lang_name
= s
->lang_name
;
2109 current_lang_stacksize
= s
->lang_stacksize
;
2110 if (current_lang_name
== lang_name_cplusplus
)
2111 strict_prototype
= strict_prototypes_lang_cplusplus
;
2112 else if (current_lang_name
== lang_name_c
)
2113 strict_prototype
= strict_prototypes_lang_c
;
2114 minimal_parse_mode
= s
->minimal_parse_mode
;
2115 last_function_parms
= s
->last_function_parms
;
2116 current_template_parms
= s
->template_parms
;
2117 processing_template_decl
= s
->processing_template_decl
;
2118 previous_class_type
= s
->previous_class_type
;
2119 previous_class_values
= s
->previous_class_values
;
2120 processing_specialization
= s
->processing_specialization
;
2121 processing_explicit_instantiation
= s
->processing_explicit_instantiation
;
2125 if (current_function_decl
)
2126 pop_cp_function_context (NULL_TREE
);
2129 /* Push a definition of struct, union or enum tag "name".
2130 into binding_level "b". "type" should be the type node,
2131 We assume that the tag "name" is not already defined.
2133 Note that the definition may really be just a forward reference.
2134 In that case, the TYPE_SIZE will be a NULL_TREE.
2136 C++ gratuitously puts all these tags in the name space. */
2138 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2139 record the shadowed value for this binding contour. TYPE is
2140 the type that ID maps to. */
2143 set_identifier_type_value_with_scope (id
, type
, b
)
2146 struct binding_level
*b
;
2148 if (!b
->namespace_p
)
2150 /* Shadow the marker, not the real thing, so that the marker
2151 gets restored later. */
2152 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2154 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2158 tree binding
= binding_for_name (id
, current_namespace
);
2159 BINDING_TYPE (binding
) = type
;
2160 /* Store marker instead of real type. */
2161 type
= global_type_node
;
2163 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2166 /* As set_identifier_type_value_with_scope, but using inner_binding_level. */
2169 set_identifier_type_value (id
, type
)
2173 set_identifier_type_value_with_scope (id
, type
, inner_binding_level
);
2177 set_identifier_local_value_with_scope (id
, val
, b
)
2179 struct binding_level
*b
;
2182 my_friendly_assert (! b
->namespace_p
, 980716);
2184 oldlocal
= IDENTIFIER_LOCAL_VALUE (id
);
2185 b
->shadowed
= tree_cons (id
, oldlocal
, b
->shadowed
);
2186 IDENTIFIER_LOCAL_VALUE (id
) = val
;
2190 set_identifier_local_value (id
, val
)
2193 set_identifier_local_value_with_scope (id
, val
, current_binding_level
);
2196 /* Return the type associated with id. */
2199 identifier_type_value (id
)
2202 /* There is no type with that name, anywhere. */
2203 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2205 /* This is not the type marker, but the real thing. */
2206 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2207 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2208 /* Have to search for it. It must be on the global level, now.
2209 Ask lookup_name not to return non-types. */
2210 id
= lookup_name_real (id
, 2, 1, 0);
2212 return TREE_TYPE (id
);
2216 /* Pop off extraneous binding levels left over due to syntax errors.
2218 We don't pop past namespaces, as they might be valid. */
2223 #ifdef DEBUG_CP_BINDING_LEVELS
2224 fprintf (stderr
, "XXX entering pop_everything ()\n");
2226 while (! toplevel_bindings_p () && ! pseudo_global_level_p ())
2228 if (class_binding_level
)
2229 pop_nested_class (1);
2233 #ifdef DEBUG_CP_BINDING_LEVELS
2234 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2238 /* The type TYPE is being declared. If it is a class template, or a
2239 specialization of a class template, do any processing required and
2240 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2241 being declared a friend. B is the binding level at which this TYPE
2244 Returns the TYPE_DECL for TYPE, which may have been altered by this
2248 maybe_process_template_type_declaration (type
, globalize
, b
)
2251 struct binding_level
* b
;
2253 tree decl
= TYPE_NAME (type
);
2255 if (processing_template_parmlist
)
2256 /* You can't declare a new template type in a template parameter
2257 list. But, you can declare a non-template type:
2259 template <class A*> struct S;
2261 is a forward-declaration of `A'. */
2265 maybe_check_template_type (type
);
2267 my_friendly_assert (IS_AGGR_TYPE (type
)
2268 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2271 if (/* If !GLOBALIZE then we are looking at a definition.
2272 It may not be a primary template. (For example, in:
2275 struct S1 { class S2 {}; }
2277 we have to push_template_decl for S2.) */
2278 (processing_template_decl
&& !globalize
)
2279 /* If we are declaring a friend template class, we will
2280 have GLOBALIZE set, since something like:
2288 declares S2 to be at global scope. */
2289 || PROCESSING_REAL_TEMPLATE_DECL_P ())
2291 /* This may change after the call to
2292 push_template_decl_real, but we want the original value. */
2293 tree name
= DECL_NAME (decl
);
2295 decl
= push_template_decl_real (decl
, globalize
);
2296 /* If the current binding level is the binding level for the
2297 template parameters (see the comment in
2298 begin_template_parm_list) and the enclosing level is a class
2299 scope, and we're not looking at a friend, push the
2300 declaration of the member class into the class scope. In the
2301 friend case, push_template_decl will already have put the
2302 friend into global scope, if appropriate. */
2303 if (TREE_CODE (type
) != ENUMERAL_TYPE
2304 && !globalize
&& b
->pseudo_global
2305 && b
->level_chain
->parm_flag
== 2)
2307 pushdecl_with_scope (CLASSTYPE_TI_TEMPLATE (type
),
2309 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2310 /* Put this tag on the list of tags for the class, since
2311 that won't happen below because B is not the class
2312 binding level, but is instead the pseudo-global level. */
2313 b
->level_chain
->tags
=
2314 saveable_tree_cons (name
, type
, b
->level_chain
->tags
);
2315 TREE_NONLOCAL_FLAG (type
) = 1;
2316 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2317 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2325 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2326 Normally put it into the inner-most non-tag-transparent scope,
2327 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2328 The latter is needed for implicit declarations. */
2331 pushtag (name
, type
, globalize
)
2335 register struct binding_level
*b
;
2339 b
= inner_binding_level
;
2340 while (b
->tag_transparent
2341 || (globalize
&& b
->parm_flag
== 2))
2344 if (toplevel_bindings_p ())
2345 b
->tags
= perm_tree_cons (name
, type
, b
->tags
);
2347 b
->tags
= saveable_tree_cons (name
, type
, b
->tags
);
2351 context
= type
? TYPE_CONTEXT (type
) : NULL_TREE
;
2354 tree cs
= current_scope ();
2358 else if (cs
!= NULL_TREE
2359 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2360 /* When declaring a friend class of a local class, we want
2361 to inject the newly named class into the scope
2362 containing the local class, not the namespace scope. */
2363 context
= hack_decl_function_context (get_type_decl (cs
));
2366 c_decl
= TREE_CODE (context
) == FUNCTION_DECL
2367 ? context
: TYPE_MAIN_DECL (context
);
2370 context
= current_namespace
;
2372 /* Do C++ gratuitous typedefing. */
2373 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2375 register tree d
= NULL_TREE
;
2376 int newdecl
= 0, in_class
= 0;
2378 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2379 || b
->parm_flag
== 2)
2382 d
= lookup_nested_type (type
, c_decl
);
2387 d
= build_decl (TYPE_DECL
, name
, type
);
2388 if (current_lang_name
== lang_name_java
)
2389 TYPE_FOR_JAVA (type
) = 1;
2390 SET_DECL_ARTIFICIAL (d
);
2392 set_identifier_type_value_with_scope (name
, type
, b
);
2395 d
= TYPE_MAIN_DECL (d
);
2397 TYPE_NAME (type
) = d
;
2398 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2400 d
= maybe_process_template_type_declaration (type
,
2403 if (b
->parm_flag
== 2)
2405 pushdecl_class_level (d
);
2406 if (newdecl
&& !PROCESSING_REAL_TEMPLATE_DECL_P ())
2407 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2408 class. But if it's a member template class, we
2409 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2411 finish_member_declaration (d
);
2414 d
= pushdecl_with_scope (d
, b
);
2418 if (ANON_AGGRNAME_P (name
))
2419 DECL_IGNORED_P (d
) = 1;
2421 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2422 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2423 if (!uses_template_parms (type
))
2424 DECL_ASSEMBLER_NAME (d
)
2425 = get_identifier (build_overload_name (type
, 1, 1));
2428 if (b
->parm_flag
== 2)
2430 TREE_NONLOCAL_FLAG (type
) = 1;
2431 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2432 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2436 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2437 /* Use the canonical TYPE_DECL for this node. */
2438 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2441 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2442 will be the tagged type we just added to the current
2443 binding level. This fake NULL-named TYPE_DECL node helps
2444 dwarfout.c to know when it needs to output a
2445 representation of a tagged type, and it also gives us a
2446 convenient place to record the "scope start" address for
2449 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2450 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2454 /* Counter used to create anonymous type names. */
2456 static int anon_cnt
= 0;
2458 /* Return an IDENTIFIER which can be used as a name for
2459 anonymous structs and unions. */
2466 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2467 return get_identifier (buf
);
2470 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2471 This keeps dbxout from getting confused. */
2476 register struct binding_level
*b
;
2478 static int last_cnt
= 0;
2480 /* Fast out if no new anon names were declared. */
2481 if (last_cnt
== anon_cnt
)
2484 b
= current_binding_level
;
2485 while (b
->tag_transparent
)
2490 /* A NULL purpose means we have already processed all tags
2491 from here to the end of the list. */
2492 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2494 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2495 TREE_PURPOSE (tags
) = NULL_TREE
;
2496 tags
= TREE_CHAIN (tags
);
2498 last_cnt
= anon_cnt
;
2501 /* Subroutine of duplicate_decls: return truthvalue of whether
2502 or not types of these decls match.
2504 For C++, we must compare the parameter list so that `int' can match
2505 `int&' in a parameter position, but `int&' is not confused with
2509 decls_match (newdecl
, olddecl
)
2510 tree newdecl
, olddecl
;
2514 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2515 /* If the two DECLs are not even the same kind of thing, we're not
2516 interested in their types. */
2519 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2521 tree f1
= TREE_TYPE (newdecl
);
2522 tree f2
= TREE_TYPE (olddecl
);
2523 tree p1
= TYPE_ARG_TYPES (f1
);
2524 tree p2
= TYPE_ARG_TYPES (f2
);
2526 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2527 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2528 && DECL_LANGUAGE (olddecl
) == lang_c
))
2531 /* When we parse a static member function definition,
2532 we put together a FUNCTION_DECL which thinks its type
2533 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2535 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2536 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2537 else if (TREE_CODE (f2
) == METHOD_TYPE
2538 && DECL_STATIC_FUNCTION_P (newdecl
))
2539 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2541 /* Here we must take care of the case where new default
2542 parameters are specified. Also, warn if an old
2543 declaration becomes ambiguous because default
2544 parameters may cause the two to be ambiguous. */
2545 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2547 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2548 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2550 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2554 if (comptypes (TREE_TYPE (f1
), TREE_TYPE (f2
), 1))
2556 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2559 types_match
= self_promoting_args_p (p1
);
2560 if (p1
== void_list_node
)
2561 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2563 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2564 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2566 types_match
= self_promoting_args_p (p2
);
2567 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2570 types_match
= compparms (p1
, p2
, 3);
2575 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2577 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2578 DECL_TEMPLATE_PARMS (olddecl
)))
2581 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2584 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2585 DECL_TEMPLATE_RESULT (newdecl
));
2589 if (TREE_TYPE (newdecl
) == error_mark_node
)
2590 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2591 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2592 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2593 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2596 types_match
= comptypes (TREE_TYPE (newdecl
),
2597 TREE_TYPE (olddecl
), 1);
2603 /* If NEWDECL is `static' and an `extern' was seen previously,
2604 warn about it. (OLDDECL may be NULL_TREE; NAME contains
2605 information about previous usage as an `extern'.)
2607 Note that this does not apply to the C++ case of declaring
2608 a variable `extern const' and then later `const'.
2610 Don't complain about built-in functions, since they are beyond
2611 the user's control. */
2614 warn_extern_redeclared_static (newdecl
, olddecl
)
2615 tree newdecl
, olddecl
;
2619 static char *explicit_extern_static_warning
2620 = "`%D' was declared `extern' and later `static'";
2621 static char *implicit_extern_static_warning
2622 = "`%D' was declared implicitly `extern' and later `static'";
2624 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2627 name
= DECL_ASSEMBLER_NAME (newdecl
);
2628 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
2630 /* It's okay to redeclare an ANSI built-in function as static,
2631 or to declare a non-ANSI built-in function as anything. */
2632 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
2633 && olddecl
!= NULL_TREE
2634 && TREE_CODE (olddecl
) == FUNCTION_DECL
2635 && (DECL_BUILT_IN (olddecl
)
2636 || DECL_BUILT_IN_NONANSI (olddecl
))))
2638 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2639 ? implicit_extern_static_warning
2640 : explicit_extern_static_warning
, newdecl
);
2641 if (olddecl
!= NULL_TREE
)
2642 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2647 /* Handle when a new declaration NEWDECL has the same name as an old
2648 one OLDDECL in the same binding contour. Prints an error message
2651 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2652 Otherwise, return 0. */
2655 duplicate_decls (newdecl
, olddecl
)
2656 tree newdecl
, olddecl
;
2658 extern struct obstack permanent_obstack
;
2659 unsigned olddecl_uid
= DECL_UID (olddecl
);
2660 int olddecl_friend
= 0, types_match
= 0;
2661 int new_defines_function
= 0;
2663 if (newdecl
== olddecl
)
2666 types_match
= decls_match (newdecl
, olddecl
);
2668 /* If either the type of the new decl or the type of the old decl is an
2669 error_mark_node, then that implies that we have already issued an
2670 error (earlier) for some bogus type specification, and in that case,
2671 it is rather pointless to harass the user with yet more error message
2672 about the same declaration, so just pretend the types match here. */
2673 if (TREE_TYPE (newdecl
) == error_mark_node
2674 || TREE_TYPE (olddecl
) == error_mark_node
)
2677 /* Check for redeclaration and other discrepancies. */
2678 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2679 && DECL_ARTIFICIAL (olddecl
)
2680 && (DECL_BUILT_IN (olddecl
) || DECL_BUILT_IN_NONANSI (olddecl
)))
2682 /* If you declare a built-in or predefined function name as static,
2683 the old definition is overridden, but optionally warn this was a
2684 bad choice of name. Ditto for overloads. */
2685 if (! TREE_PUBLIC (newdecl
)
2686 || (TREE_CODE (newdecl
) == FUNCTION_DECL
2687 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
)))
2690 cp_warning ("shadowing %s function `%#D'",
2691 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2693 /* Discard the old built-in function. */
2696 else if (! types_match
)
2698 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2700 /* If the built-in is not ansi, then programs can override
2701 it even globally without an error. */
2702 if (! DECL_BUILT_IN (olddecl
))
2703 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2707 cp_error ("declaration of `%#D'", newdecl
);
2708 cp_error ("conflicts with built-in declaration `%#D'",
2714 cp_warning ("declaration of `%#D'", newdecl
);
2715 cp_warning ("conflicts with built-in declaration `%#D'",
2719 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
2721 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
2722 && TREE_CODE (newdecl
) != TYPE_DECL
2723 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
2724 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
2725 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
2726 && TREE_CODE (olddecl
) != TYPE_DECL
2727 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
2728 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
2731 /* We do nothing special here, because C++ does such nasty
2732 things with TYPE_DECLs. Instead, just let the TYPE_DECL
2733 get shadowed, and know that if we need to find a TYPE_DECL
2734 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
2735 slot of the identifier. */
2739 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
2740 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
2741 || (TREE_CODE (olddecl
) == FUNCTION_DECL
2742 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
2745 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
2746 if (TREE_CODE (olddecl
) == TREE_LIST
)
2747 olddecl
= TREE_VALUE (olddecl
);
2748 cp_error_at ("previous declaration of `%#D'", olddecl
);
2750 /* New decl is completely inconsistent with the old one =>
2751 tell caller to replace the old one. */
2755 else if (!types_match
)
2757 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2759 /* The name of a class template may not be declared to refer to
2760 any other template, class, function, object, namespace, value,
2761 or type in the same scope. */
2762 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
2763 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2765 cp_error ("declaration of template `%#D'", newdecl
);
2766 cp_error_at ("conflicts with previous declaration `%#D'",
2769 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
2770 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
2771 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
2772 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))), 3)
2773 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2774 DECL_TEMPLATE_PARMS (olddecl
)))
2776 cp_error ("new declaration `%#D'", newdecl
);
2777 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
2781 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2783 if (DECL_LANGUAGE (newdecl
) == lang_c
2784 && DECL_LANGUAGE (olddecl
) == lang_c
)
2786 cp_error ("declaration of C function `%#D' conflicts with",
2788 cp_error_at ("previous declaration `%#D' here", olddecl
);
2790 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
2791 TYPE_ARG_TYPES (TREE_TYPE (olddecl
)), 3))
2793 cp_error ("new declaration `%#D'", newdecl
);
2794 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
2800 /* Already complained about this, so don't do so again. */
2801 else if (current_class_type
== NULL_TREE
2802 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
2804 cp_error ("conflicting types for `%#D'", newdecl
);
2805 cp_error_at ("previous declaration as `%#D'", olddecl
);
2808 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
2809 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
2810 && (!DECL_TEMPLATE_INFO (newdecl
)
2811 || (DECL_TI_TEMPLATE (newdecl
)
2812 != DECL_TI_TEMPLATE (olddecl
))))
2813 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
2814 && (!DECL_TEMPLATE_INFO (olddecl
)
2815 || (DECL_TI_TEMPLATE (olddecl
)
2816 != DECL_TI_TEMPLATE (newdecl
))))))
2817 /* It's OK to have a template specialization and a non-template
2818 with the same type, or to have specializations of two
2819 different templates with the same type. Note that if one is a
2820 specialization, and the other is an instantiation of the same
2821 template, that we do not exit at this point. That situation
2822 can occur if we instantiate a template class, and then
2823 specialize one of its methods. This situation is legal, but
2824 the declarations must be merged in the usual way. */
2826 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
2827 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
2828 && !DECL_USE_TEMPLATE (newdecl
))
2829 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
2830 && !DECL_USE_TEMPLATE (olddecl
))))
2831 /* One of the declarations is a template instantiation, and the
2832 other is not a template at all. That's OK. */
2834 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
2835 && DECL_NAMESPACE_ALIAS (newdecl
)
2836 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
2837 /* Redeclaration of namespace alias, ignore it. */
2841 char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
2844 cp_error (errmsg
, newdecl
);
2845 if (DECL_NAME (olddecl
) != NULL_TREE
)
2846 cp_error_at ((DECL_INITIAL (olddecl
)
2847 && namespace_bindings_p ())
2848 ? "`%#D' previously defined here"
2849 : "`%#D' previously declared here", olddecl
);
2851 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
2852 && DECL_INITIAL (olddecl
) != NULL_TREE
2853 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
2854 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
2856 /* Prototype decl follows defn w/o prototype. */
2857 cp_warning_at ("prototype for `%#D'", newdecl
);
2858 cp_warning_at ("follows non-prototype definition here", olddecl
);
2860 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
2861 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
2863 /* extern "C" int foo ();
2864 int foo () { bar (); }
2866 if (current_lang_stack
== current_lang_base
)
2867 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
2870 cp_error_at ("previous declaration of `%#D' with %L linkage",
2871 olddecl
, DECL_LANGUAGE (olddecl
));
2872 cp_error ("conflicts with new declaration with %L linkage",
2873 DECL_LANGUAGE (newdecl
));
2877 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
2879 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
2881 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
2882 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
2885 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
2886 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
2888 for (; t1
&& t1
!= void_list_node
;
2889 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
2890 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
2892 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
2897 cp_pedwarn ("default argument given for parameter %d of `%#D'",
2899 cp_pedwarn_at ("after previous specification in `%#D'",
2905 cp_error ("default argument given for parameter %d of `%#D'",
2907 cp_error_at ("after previous specification in `%#D'",
2912 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
2913 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
2915 cp_warning ("`%#D' was used before it was declared inline",
2917 cp_warning_at ("previous non-inline declaration here",
2923 /* If new decl is `static' and an `extern' was seen previously,
2925 warn_extern_redeclared_static (newdecl
, olddecl
);
2927 /* We have committed to returning 1 at this point. */
2928 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2930 /* Now that functions must hold information normally held
2931 by field decls, there is extra work to do so that
2932 declaration information does not get destroyed during
2934 if (DECL_VINDEX (olddecl
))
2935 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
2936 if (DECL_CONTEXT (olddecl
))
2937 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
2938 if (DECL_CLASS_CONTEXT (olddecl
))
2939 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
2940 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
2941 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
2942 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
2943 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
2944 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
2945 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
2946 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
2947 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
2949 /* Optionally warn about more than one declaration for the same
2950 name, but don't warn about a function declaration followed by a
2952 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
2953 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
2954 /* Don't warn about extern decl followed by definition. */
2955 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
2956 /* Don't warn about friends, let add_friend take care of it. */
2957 && ! DECL_FRIEND_P (newdecl
))
2959 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
2960 cp_warning_at ("previous declaration of `%D'", olddecl
);
2964 /* Deal with C++: must preserve virtual function table size. */
2965 if (TREE_CODE (olddecl
) == TYPE_DECL
)
2967 register tree newtype
= TREE_TYPE (newdecl
);
2968 register tree oldtype
= TREE_TYPE (olddecl
);
2970 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
2971 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
2973 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
2974 CLASSTYPE_FRIEND_CLASSES (newtype
)
2975 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
2979 /* Copy all the DECL_... slots specified in the new decl
2980 except for any that we copy here from the old type. */
2981 DECL_MACHINE_ATTRIBUTES (newdecl
)
2982 = merge_machine_decl_attributes (olddecl
, newdecl
);
2984 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2986 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
2987 DECL_TEMPLATE_RESULT (olddecl
)))
2988 cp_error ("invalid redeclaration of %D", newdecl
);
2989 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
2990 DECL_TEMPLATE_PARMS (olddecl
) = DECL_TEMPLATE_PARMS (newdecl
);
2991 if (DECL_TEMPLATE_INFO (newdecl
))
2992 DECL_TEMPLATE_INFO (olddecl
) = DECL_TEMPLATE_INFO (newdecl
);
2993 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
2994 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
2995 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3002 /* Automatically handles default parameters. */
3003 tree oldtype
= TREE_TYPE (olddecl
);
3006 /* Make sure we put the new type in the same obstack as the old one. */
3008 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3011 push_obstacks_nochange ();
3012 end_temporary_allocation ();
3015 /* Merge the data types specified in the two decls. */
3016 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3018 if (TREE_CODE (newdecl
) == VAR_DECL
)
3019 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3020 /* Do this after calling `common_type' so that default
3021 parameters don't confuse us. */
3022 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3023 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3024 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3026 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3027 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3028 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3029 TYPE_RAISES_EXCEPTIONS (oldtype
));
3031 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3032 && DECL_SOURCE_LINE (olddecl
) != 0
3034 && ! compexcepttypes (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
3036 cp_pedwarn ("declaration of `%D' throws different exceptions",
3038 cp_pedwarn_at ("previous declaration here", olddecl
);
3041 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3043 /* Lay the type out, unless already done. */
3044 if (newtype
!= canonical_type_variant (oldtype
)
3045 && TREE_TYPE (newdecl
) != error_mark_node
3046 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3047 layout_type (TREE_TYPE (newdecl
));
3049 if ((TREE_CODE (newdecl
) == VAR_DECL
3050 || TREE_CODE (newdecl
) == PARM_DECL
3051 || TREE_CODE (newdecl
) == RESULT_DECL
3052 || TREE_CODE (newdecl
) == FIELD_DECL
3053 || TREE_CODE (newdecl
) == TYPE_DECL
)
3054 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3055 layout_decl (newdecl
, 0);
3057 /* Merge the type qualifiers. */
3058 if (TREE_READONLY (newdecl
))
3059 TREE_READONLY (olddecl
) = 1;
3060 if (TREE_THIS_VOLATILE (newdecl
))
3061 TREE_THIS_VOLATILE (olddecl
) = 1;
3063 /* Merge the initialization information. */
3064 if (DECL_INITIAL (newdecl
) == NULL_TREE
3065 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3067 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3068 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3069 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3070 if (DECL_LANG_SPECIFIC (newdecl
)
3071 && DECL_LANG_SPECIFIC (olddecl
))
3072 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3075 /* Merge the section attribute.
3076 We want to issue an error if the sections conflict but that must be
3077 done later in decl_attributes since we are called before attributes
3079 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3080 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3082 /* Keep the old rtl since we can safely use it, unless it's the
3083 call to abort() used for abstract virtuals. */
3084 if ((DECL_LANG_SPECIFIC (olddecl
)
3085 && !DECL_ABSTRACT_VIRTUAL_P (olddecl
))
3086 || DECL_RTL (olddecl
) != DECL_RTL (abort_fndecl
))
3087 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3091 /* If cannot merge, then use the new type and qualifiers,
3092 and don't preserve the old rtl. */
3095 /* Clean out any memory we had of the old declaration. */
3096 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3098 TREE_VALUE (oldstatic
) = error_mark_node
;
3100 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3101 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3102 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3103 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3106 /* Merge the storage class information. */
3107 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3108 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3109 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3110 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3111 if (! DECL_EXTERNAL (olddecl
))
3112 DECL_EXTERNAL (newdecl
) = 0;
3114 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3116 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3117 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3118 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3119 /* Don't really know how much of the language-specific
3120 values we should copy from old to new. */
3121 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3122 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3123 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3124 if (DECL_TEMPLATE_INFO (newdecl
) == NULL_TREE
)
3126 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3127 DECL_USE_TEMPLATE (newdecl
) = DECL_USE_TEMPLATE (olddecl
);
3129 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3132 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3134 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3135 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3137 /* If newdecl is not a specialization, then it is not a
3138 template-related function at all. And that means that we
3139 shoud have exited above, returning 0. */
3140 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3143 if (TREE_USED (olddecl
))
3144 /* From [temp.expl.spec]:
3146 If a template, a member template or the member of a class
3147 template is explicitly specialized then that
3148 specialization shall be declared before the first use of
3149 that specialization that would cause an implicit
3150 instantiation to take place, in every translation unit in
3151 which such a use occurs. */
3152 cp_error ("explicit specialization of %D after first use",
3155 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3157 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3159 /* If either decl says `inline', this fn is inline, unless its
3160 definition was passed already. */
3161 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3162 DECL_INLINE (olddecl
) = 1;
3163 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3167 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3168 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3169 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3171 if (! types_match
|| new_defines_function
)
3173 /* These need to be copied so that the names are available. */
3174 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3175 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3177 if (new_defines_function
)
3178 /* If defining a function declared with other language
3179 linkage, use the previously declared language linkage. */
3180 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3183 /* If redeclaring a builtin function, and not a definition,
3184 it stays built in. */
3185 if (DECL_BUILT_IN (olddecl
))
3187 DECL_BUILT_IN (newdecl
) = 1;
3188 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3189 /* If we're keeping the built-in definition, keep the rtl,
3190 regardless of declaration matches. */
3191 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3194 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3196 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3197 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3198 /* Previously saved insns go together with
3199 the function's previous definition. */
3200 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3201 /* Don't clear out the arguments if we're redefining a function. */
3202 if (DECL_ARGUMENTS (olddecl
))
3203 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3205 if (DECL_LANG_SPECIFIC (olddecl
))
3206 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3209 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3211 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3214 /* Now preserve various other info from the definition. */
3215 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3216 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3217 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3218 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3220 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3223 struct lang_decl
*ol
= DECL_LANG_SPECIFIC (olddecl
);
3224 struct lang_decl
*nl
= DECL_LANG_SPECIFIC (newdecl
);
3226 function_size
= sizeof (struct tree_decl
);
3228 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3229 (char *) olddecl
+ sizeof (struct tree_common
),
3230 function_size
- sizeof (struct tree_common
));
3232 /* Can we safely free the storage used by newdecl? */
3234 #define ROUND(x) ((x + obstack_alignment_mask (&permanent_obstack)) \
3235 & ~ obstack_alignment_mask (&permanent_obstack))
3237 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3239 /* If newdecl is a template instantiation, it is possible that
3240 the following sequence of events has occurred:
3242 o A friend function was declared in a class template. The
3243 class template was instantiated.
3245 o The instantiation of the friend declaration was
3246 recorded on the instantiation list, and is newdecl.
3248 o Later, however, instantiate_class_template called pushdecl
3249 on the newdecl to perform name injection. But, pushdecl in
3250 turn called duplicate_decls when it discovered that another
3251 declaration of a global function with the same name already
3254 o Here, in duplicate_decls, we decided to clobber newdecl.
3256 If we're going to do that, we'd better make sure that
3257 olddecl, and not newdecl, is on the list of
3258 instantiations so that if we try to do the instantiation
3259 again we won't get the clobbered declaration. */
3261 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3262 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3264 for (; decls
; decls
= TREE_CHAIN (decls
))
3265 if (TREE_VALUE (decls
) == newdecl
)
3266 TREE_VALUE (decls
) = olddecl
;
3269 if (((char *)newdecl
+ ROUND (function_size
) == (char *)nl
3270 && ((char *)newdecl
+ ROUND (function_size
)
3271 + ROUND (sizeof (struct lang_decl
))
3272 == obstack_next_free (&permanent_obstack
)))
3273 || ((char *)newdecl
+ ROUND (function_size
)
3274 == obstack_next_free (&permanent_obstack
)))
3276 DECL_MAIN_VARIANT (newdecl
) = olddecl
;
3277 DECL_LANG_SPECIFIC (olddecl
) = ol
;
3278 bcopy ((char *)nl
, (char *)ol
, sizeof (struct lang_decl
));
3280 obstack_free (&permanent_obstack
, newdecl
);
3282 else if (LANG_DECL_PERMANENT (ol
) && ol
!= nl
)
3284 if (DECL_MAIN_VARIANT (olddecl
) == olddecl
)
3286 /* Save these lang_decls that would otherwise be lost. */
3287 extern tree free_lang_decl_chain
;
3288 tree free_lang_decl
= (tree
) ol
;
3290 if (DECL_LANG_SPECIFIC (olddecl
) == ol
)
3293 TREE_CHAIN (free_lang_decl
) = free_lang_decl_chain
;
3294 free_lang_decl_chain
= free_lang_decl
;
3298 /* Storage leak. */;
3304 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3305 (char *) olddecl
+ sizeof (struct tree_common
),
3306 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3307 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3310 DECL_UID (olddecl
) = olddecl_uid
;
3312 DECL_FRIEND_P (olddecl
) = 1;
3314 /* NEWDECL contains the merged attribute lists.
3315 Update OLDDECL to be the same. */
3316 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3321 /* Record a decl-node X as belonging to the current lexical scope.
3322 Check for errors (such as an incompatible declaration for the same
3323 name already seen in the same scope).
3325 Returns either X or an old decl for the same name.
3326 If an old decl is returned, it may have been smashed
3327 to agree with what X says. */
3334 register tree name
= DECL_ASSEMBLER_NAME (x
);
3335 register struct binding_level
*b
= current_binding_level
;
3337 if (current_function_decl
&& x
!= current_function_decl
3338 /* A local declaration for a function doesn't constitute nesting. */
3339 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3340 /* Don't change DECL_CONTEXT of virtual methods. */
3341 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3342 && ! DECL_CONTEXT (x
))
3343 DECL_CONTEXT (x
) = current_function_decl
;
3344 if (!DECL_CONTEXT (x
))
3345 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3347 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3348 compiler wants to use. */
3349 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3350 || TREE_CODE (x
) == NAMESPACE_DECL
|| TREE_CODE (x
) == TEMPLATE_TYPE_PARM
3351 || TREE_CODE (x
) == TEMPLATE_TEMPLATE_PARM
)
3352 name
= DECL_NAME (x
);
3357 /* Not needed...see below. */
3361 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3362 name
= TREE_OPERAND (name
, 0);
3364 /* Namespace-scoped variables are not found in the current level. */
3365 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3366 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3368 t
= lookup_name_current_level (name
);
3369 if (t
== error_mark_node
)
3371 /* error_mark_node is 0 for a while during initialization! */
3373 cp_error_at ("`%#D' used prior to declaration", x
);
3376 else if (t
!= NULL_TREE
)
3379 /* This is turned off until I have time to do it right (bpk). */
3380 /* With the code below that uses it... */
3381 file
= DECL_SOURCE_FILE (t
);
3382 line
= DECL_SOURCE_LINE (t
);
3384 if (TREE_CODE (t
) == PARM_DECL
)
3386 if (DECL_CONTEXT (t
) == NULL_TREE
)
3387 fatal ("parse errors have confused me too much");
3389 /* Check for duplicate params. */
3390 if (duplicate_decls (x
, t
))
3393 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3394 || DECL_FUNCTION_TEMPLATE_P (x
))
3395 && is_overloaded_fn (t
))
3396 /* Don't do anything just yet. */;
3397 else if (t
== wchar_decl_node
)
3399 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3400 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3402 /* Throw away the redeclaration. */
3405 else if (TREE_CODE (t
) != TREE_CODE (x
))
3407 if (duplicate_decls (x
, t
))
3410 else if (duplicate_decls (x
, t
))
3413 /* This is turned off until I have time to do it right (bpk). */
3415 /* Also warn if they did a prototype with `static' on it, but
3416 then later left the `static' off. */
3417 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3419 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3424 cp_warning ("`static' missing from declaration of `%D'",
3426 warning_with_file_and_line (file
, line
,
3427 "previous declaration of `%s'",
3428 decl_as_string (t
, 0));
3431 /* Now fix things so it'll do what they expect. */
3432 if (current_function_decl
)
3433 TREE_PUBLIC (current_function_decl
) = 0;
3435 /* Due to interference in memory reclamation (X may be
3436 obstack-deallocated at this point), we must guard against
3437 one really special case. [jason: This should be handled
3438 by start_function] */
3439 if (current_function_decl
== x
)
3440 current_function_decl
= t
;
3442 if (TREE_CODE (t
) == TYPE_DECL
)
3443 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3444 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3445 check_default_args (t
);
3449 else if (DECL_MAIN_P (x
))
3451 /* A redeclaration of main, but not a duplicate of the
3456 This function shall not be overloaded. */
3457 cp_error_at ("invalid redeclaration of `%D'", t
);
3458 cp_error ("as `%D'", x
);
3459 /* We don't try to push this declaration since that
3465 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3467 t
= push_overloaded_decl (x
, 1);
3468 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3471 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3472 return push_overloaded_decl (x
, 0);
3474 /* If declaring a type as a typedef, copy the type (unless we're
3475 at line 0), and install this TYPE_DECL as the new type's typedef
3476 name. See the extensive comment in ../c-decl.c (pushdecl). */
3477 if (TREE_CODE (x
) == TYPE_DECL
)
3479 tree type
= TREE_TYPE (x
);
3480 if (DECL_SOURCE_LINE (x
) == 0)
3482 if (TYPE_NAME (type
) == 0)
3483 TYPE_NAME (type
) = x
;
3485 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3486 /* We don't want to copy the type when all we're
3487 doing is making a TYPE_DECL for the purposes of
3489 && (!TYPE_NAME (type
)
3490 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3492 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3494 DECL_ORIGINAL_TYPE (x
) = type
;
3495 type
= build_type_copy (type
);
3496 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3497 TYPE_NAME (type
) = x
;
3498 TREE_TYPE (x
) = type
;
3503 if (type
!= error_mark_node
3505 && TYPE_IDENTIFIER (type
))
3506 set_identifier_type_value_with_scope (DECL_NAME (x
), type
, b
);
3509 /* Multiple external decls of the same identifier ought to match.
3511 We get warnings about inline functions where they are defined.
3512 We get warnings about other functions from push_overloaded_decl.
3514 Avoid duplicate warnings where they are used. */
3515 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3519 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3520 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3521 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3522 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3527 /* If different sort of thing, we already gave an error. */
3528 && TREE_CODE (decl
) == TREE_CODE (x
)
3529 && ! comptypes (TREE_TYPE (x
), TREE_TYPE (decl
), 1))
3531 cp_pedwarn ("type mismatch with previous external decl", x
);
3532 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3536 /* This name is new in its binding level.
3537 Install the new declaration and return it. */
3538 if (namespace_bindings_p ())
3540 /* Install a global value. */
3542 /* If the first global decl has external linkage,
3543 warn if we later see static one. */
3544 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3545 TREE_PUBLIC (name
) = 1;
3547 /* Don't install an artificial TYPE_DECL if we already have
3548 another _DECL with that name. */
3549 if (TREE_CODE (x
) != TYPE_DECL
3551 || ! DECL_ARTIFICIAL (x
))
3553 if (TREE_CODE (x
) == FUNCTION_DECL
)
3555 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3556 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3557 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3560 /* Don't forget if the function was used via an implicit decl. */
3561 if (IDENTIFIER_IMPLICIT_DECL (name
)
3562 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3565 /* Don't forget if its address was taken in that way. */
3566 if (IDENTIFIER_IMPLICIT_DECL (name
)
3567 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3568 TREE_ADDRESSABLE (x
) = 1;
3570 /* Warn about mismatches against previous implicit decl. */
3571 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3572 /* If this real decl matches the implicit, don't complain. */
3573 && ! (TREE_CODE (x
) == FUNCTION_DECL
3574 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3576 ("`%D' was previously implicitly declared to return `int'", x
);
3578 /* If new decl is `static' and an `extern' was seen previously,
3580 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3581 warn_extern_redeclared_static (x
, t
);
3585 /* Here to install a non-global value. */
3586 tree oldlocal
= IDENTIFIER_LOCAL_VALUE (name
);
3587 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3589 /* Don't install an artificial TYPE_DECL if we already have
3590 another _DECL with that name. */
3591 if (TREE_CODE (x
) != TYPE_DECL
3593 || ! DECL_ARTIFICIAL (x
))
3594 set_identifier_local_value_with_scope (name
, x
, b
);
3596 /* If this is a TYPE_DECL, push it into the type value slot. */
3597 if (TREE_CODE (x
) == TYPE_DECL
)
3598 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
), b
);
3600 /* Clear out any TYPE_DECL shadowed by a namespace so that
3601 we won't think this is a type. The C struct hack doesn't
3602 go through namespaces. */
3603 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3604 set_identifier_type_value_with_scope (name
, NULL_TREE
, b
);
3606 /* If this is an extern function declaration, see if we
3607 have a global definition or declaration for the function. */
3608 if (oldlocal
== NULL_TREE
3609 && DECL_EXTERNAL (x
)
3610 && oldglobal
!= NULL_TREE
3611 && TREE_CODE (x
) == FUNCTION_DECL
3612 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3614 /* We have one. Their types must agree. */
3615 if (decls_match (x
, oldglobal
))
3619 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3620 cp_warning_at ("global declaration `%#D'", oldglobal
);
3623 /* If we have a local external declaration,
3624 and no file-scope declaration has yet been seen,
3625 then if we later have a file-scope decl it must not be static. */
3626 if (oldlocal
== NULL_TREE
3627 && oldglobal
== NULL_TREE
3628 && DECL_EXTERNAL (x
)
3631 TREE_PUBLIC (name
) = 1;
3634 if (DECL_FROM_INLINE (x
))
3635 /* Inline decls shadow nothing. */;
3637 /* Warn if shadowing an argument at the top level of the body. */
3638 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3639 && TREE_CODE (oldlocal
) == PARM_DECL
3640 && TREE_CODE (x
) != PARM_DECL
)
3642 /* Go to where the parms should be and see if we
3644 struct binding_level
*b
= current_binding_level
->level_chain
;
3650 if (b
->parm_flag
== 1)
3651 cp_error ("declaration of `%#D' shadows a parameter", name
);
3653 else if (warn_shadow
&& oldlocal
!= NULL_TREE
&& b
->is_for_scope
3654 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3656 warning ("variable `%s' shadows local",
3657 IDENTIFIER_POINTER (name
));
3658 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3660 /* Maybe warn if shadowing something else. */
3661 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
3662 /* No shadow warnings for internally generated vars. */
3663 && ! DECL_ARTIFICIAL (x
)
3664 /* No shadow warnings for vars made for inlining. */
3665 && ! DECL_FROM_INLINE (x
))
3667 char *warnstring
= NULL
;
3669 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
3670 warnstring
= "declaration of `%s' shadows a parameter";
3671 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
3672 && current_class_ptr
3673 && !TREE_STATIC (name
))
3674 warnstring
= "declaration of `%s' shadows a member of `this'";
3675 else if (oldlocal
!= NULL_TREE
)
3676 warnstring
= "declaration of `%s' shadows previous local";
3677 else if (oldglobal
!= NULL_TREE
)
3678 /* XXX shadow warnings in outer-more namespaces */
3679 warnstring
= "declaration of `%s' shadows global declaration";
3682 warning (warnstring
, IDENTIFIER_POINTER (name
));
3684 /* Check to see if decl redeclares a template parameter. */
3685 if (oldlocal
&& (current_class_type
|| current_function_decl
)
3686 && current_template_parms
)
3688 if (decl_template_parm_p (oldlocal
))
3690 cp_error ("re-using name of template parameter `%T' in this scope", name
);
3691 cp_error_at (" previously declared here `%#D'", oldlocal
);
3696 if (TREE_CODE (x
) == FUNCTION_DECL
)
3697 check_default_args (x
);
3699 /* Keep count of variables in this level with incomplete type. */
3700 if (TREE_CODE (x
) == VAR_DECL
3701 && TREE_TYPE (x
) != error_mark_node
3702 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
3703 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
3704 /* RTTI TD entries are created while defining the type_info. */
3705 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
3706 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
3707 b
->incomplete
= tree_cons (NULL_TREE
, x
, b
->incomplete
);
3710 /* Put decls on list in reverse order.
3711 We will reverse them later if necessary. */
3712 TREE_CHAIN (x
) = b
->names
;
3714 if (! (b
!= global_binding_level
|| TREE_PERMANENT (x
)))
3715 my_friendly_abort (124);
3720 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
3721 caller to set DECL_CONTEXT properly. */
3724 pushdecl_with_scope (x
, level
)
3726 struct binding_level
*level
;
3728 register struct binding_level
*b
;
3729 tree function_decl
= current_function_decl
;
3731 current_function_decl
= NULL_TREE
;
3732 if (level
->parm_flag
== 2)
3734 b
= class_binding_level
;
3735 class_binding_level
= level
;
3736 pushdecl_class_level (x
);
3737 class_binding_level
= b
;
3741 b
= current_binding_level
;
3742 current_binding_level
= level
;
3744 current_binding_level
= b
;
3746 current_function_decl
= function_decl
;
3750 /* Like pushdecl, only it places X in the current namespace,
3754 pushdecl_namespace_level (x
)
3757 register struct binding_level
*b
= inner_binding_level
;
3760 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
3762 /* Now, the type_shadowed stack may screw us. Munge it so it does
3764 if (TREE_CODE (x
) == TYPE_DECL
)
3766 tree name
= DECL_NAME (x
);
3768 tree
*ptr
= (tree
*)0;
3769 for (; b
!= global_binding_level
; b
= b
->level_chain
)
3771 tree shadowed
= b
->type_shadowed
;
3772 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
3773 if (TREE_PURPOSE (shadowed
) == name
)
3775 ptr
= &TREE_VALUE (shadowed
);
3776 /* Can't break out of the loop here because sometimes
3777 a binding level will have duplicate bindings for
3778 PT names. It's gross, but I haven't time to fix it. */
3781 newval
= TREE_TYPE (x
);
3782 if (ptr
== (tree
*)0)
3784 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
3785 up here if this is changed to an assertion. --KR */
3786 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
3796 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
3800 pushdecl_top_level (x
)
3803 tree cur_namespace
= current_namespace
;
3804 current_namespace
= global_namespace
;
3805 x
= pushdecl_namespace_level (x
);
3806 current_namespace
= cur_namespace
;
3810 /* Make the declaration of X appear in CLASS scope. */
3813 pushdecl_class_level (x
)
3816 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
3817 scope looks for the pre-mangled name. */
3818 register tree name
= DECL_NAME (x
);
3822 if (TYPE_BEING_DEFINED (current_class_type
))
3824 /* A name N used in a class S shall refer to the same declaration
3825 in its context and when re-evaluated in the completed scope of S.
3826 Types, enums, and static vars are checked here; other
3827 members are checked in finish_struct. */
3828 tree icv
= IDENTIFIER_CLASS_VALUE (name
);
3829 tree ilv
= IDENTIFIER_LOCAL_VALUE (name
);
3832 && flag_optional_diags
3833 /* Don't complain about inherited names. */
3834 && id_in_current_class (name
)
3835 /* Or shadowed tags. */
3836 && !(DECL_DECLARES_TYPE_P (icv
)
3837 && DECL_CONTEXT (icv
) == current_class_type
))
3839 cp_pedwarn ("declaration of identifier `%D' as `%#D'", name
, x
);
3840 cp_pedwarn_at ("conflicts with previous use in class as `%#D'",
3844 /* Check to see if decl redeclares a template parameter. */
3845 if (ilv
&& ! decls_match (ilv
, x
)
3846 && (current_class_type
|| current_function_decl
)
3847 && current_template_parms
)
3849 if (decl_template_parm_p (ilv
))
3851 cp_error ("re-using name of template parameter `%T' in this scope", name
);
3852 cp_error_at (" previously declared here `%#D'", ilv
);
3857 push_class_level_binding (name
, x
);
3858 if (TREE_CODE (x
) == TYPE_DECL
)
3860 set_identifier_type_value (name
, TREE_TYPE (x
));
3866 /* This function is used to push the mangled decls for nested types into
3867 the appropriate scope. Previously pushdecl_top_level was used, but that
3868 is incorrect for members of local classes. */
3871 pushdecl_nonclass_level (x
)
3874 struct binding_level
*b
= current_binding_level
;
3876 my_friendly_assert (b
->parm_flag
!= 2, 180);
3879 /* Get out of template binding levels */
3880 while (b
->pseudo_global
)
3884 pushdecl_with_scope (x
, b
);
3888 /* Make the declaration(s) of X appear in CLASS scope
3889 under the name NAME. */
3892 push_class_level_binding (name
, x
)
3896 /* The class_binding_level will be NULL if x is a template
3897 parameter name in a member template. */
3898 if (!class_binding_level
)
3901 if (TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3902 && purpose_member (name
, class_binding_level
->class_shadowed
))
3905 maybe_push_cache_obstack ();
3906 class_binding_level
->class_shadowed
3907 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
3908 class_binding_level
->class_shadowed
);
3910 IDENTIFIER_CLASS_VALUE (name
) = x
;
3911 obstack_ptr_grow (&decl_obstack
, x
);
3914 /* Insert another USING_DECL into the current binding level,
3915 returning this declaration. If this is a redeclaration,
3916 do nothing and return NULL_TREE. */
3919 push_using_decl (scope
, name
)
3925 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
3926 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
3927 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
3928 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
3932 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
3933 DECL_INITIAL (decl
) = scope
;
3934 TREE_CHAIN (decl
) = current_binding_level
->usings
;
3935 current_binding_level
->usings
= decl
;
3939 /* Add namespace to using_directives. Return NULL_TREE if nothing was
3940 changed (i.e. there was already a directive), or the fresh
3941 TREE_LIST otherwise. */
3944 push_using_directive (used
)
3947 tree ud
= current_binding_level
->using_directives
;
3948 tree iter
, ancestor
;
3950 /* Check if we already have this. */
3951 if (purpose_member (used
, ud
) != NULL_TREE
)
3954 /* Recursively add all namespaces used. */
3955 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
3956 push_using_directive (TREE_PURPOSE (iter
));
3958 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
3959 ud
= current_binding_level
->using_directives
;
3960 ud
= perm_tree_cons (used
, ancestor
, ud
);
3961 current_binding_level
->using_directives
= ud
;
3965 /* DECL is a FUNCTION_DECL which may have other definitions already in
3966 place. We get around this by making the value of the identifier point
3967 to a list of all the things that want to be referenced by that name. It
3968 is then up to the users of that name to decide what to do with that
3971 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
3972 slot. It is dealt with the same way.
3974 The value returned may be a previous declaration if we guessed wrong
3975 about what language DECL should belong to (C or C++). Otherwise,
3976 it's always DECL (and never something that's not a _DECL). */
3979 push_overloaded_decl (decl
, forgettable
)
3983 tree orig_name
= DECL_NAME (decl
);
3985 int doing_global
= (namespace_bindings_p () || ! forgettable
);
3989 old
= namespace_binding (orig_name
, DECL_CONTEXT (decl
));
3990 if (old
&& TREE_CODE (old
) == FUNCTION_DECL
3991 && DECL_ARTIFICIAL (old
)
3992 && (DECL_BUILT_IN (old
) || DECL_BUILT_IN_NONANSI (old
)))
3994 if (duplicate_decls (decl
, old
))
4001 old
= IDENTIFIER_LOCAL_VALUE (orig_name
);
4003 if (! purpose_member (orig_name
, current_binding_level
->shadowed
))
4005 current_binding_level
->shadowed
4006 = tree_cons (orig_name
, old
, current_binding_level
->shadowed
);
4013 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4015 tree t
= TREE_TYPE (old
);
4016 if (IS_AGGR_TYPE (t
) && warn_shadow
4017 && (! DECL_IN_SYSTEM_HEADER (decl
)
4018 || ! DECL_IN_SYSTEM_HEADER (old
)))
4019 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4022 else if (is_overloaded_fn (old
))
4026 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4027 if (decl
== OVL_CURRENT (tmp
)
4028 || duplicate_decls (decl
, OVL_CURRENT (tmp
)))
4029 return OVL_CURRENT (tmp
);
4033 cp_error_at ("previous non-function declaration `%#D'", old
);
4034 cp_error ("conflicts with function declaration `%#D'", decl
);
4039 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4041 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4042 old
= ovl_cons (old
, NULL_TREE
);
4043 old
= ovl_cons (decl
, old
);
4046 /* orig_name is not ambiguous. */
4050 set_namespace_binding (orig_name
, current_namespace
, old
);
4052 IDENTIFIER_LOCAL_VALUE (orig_name
) = old
;
4057 /* Generate an implicit declaration for identifier FUNCTIONID
4058 as a function of type int (). Print a warning if appropriate. */
4061 implicitly_declare (functionid
)
4065 int temp
= allocation_temporary_p ();
4067 push_obstacks_nochange ();
4069 /* Save the decl permanently so we can warn if definition follows.
4070 In ANSI C, warn_implicit is usually false, so the saves little space.
4071 But in C++, it's usually true, hence the extra code. */
4072 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4073 end_temporary_allocation ();
4075 /* We used to reuse an old implicit decl here,
4076 but this loses with inline functions because it can clobber
4077 the saved decl chains. */
4078 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4080 DECL_EXTERNAL (decl
) = 1;
4081 TREE_PUBLIC (decl
) = 1;
4083 /* ANSI standard says implicit declarations are in the innermost block.
4084 So we record the decl in the standard fashion. */
4086 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4089 /* Only one warning per identifier. */
4090 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4092 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4095 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4102 /* Return zero if the declaration NEWDECL is valid
4103 when the declaration OLDDECL (assumed to be for the same name)
4104 has already been seen.
4105 Otherwise return an error message format string with a %s
4106 where the identifier should go. */
4109 redeclaration_error_message (newdecl
, olddecl
)
4110 tree newdecl
, olddecl
;
4112 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4114 /* Because C++ can put things into name space for free,
4115 constructs like "typedef struct foo { ... } foo"
4116 would look like an erroneous redeclaration. */
4117 if (comptypes (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
), 0))
4120 return "redefinition of `%#D'";
4122 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4124 /* If this is a pure function, its olddecl will actually be
4125 the original initialization to `0' (which we force to call
4126 abort()). Don't complain about redefinition in this case. */
4127 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4130 /* If both functions come from different namespaces, this is not
4131 a redeclaration - this is a conflict with a used function. */
4132 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4133 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4134 return "`%D' conflicts with used function";
4136 /* We'll complain about linkage mismatches in
4137 warn_extern_redeclared_static. */
4139 /* Defining the same name twice is no good. */
4140 if (DECL_INITIAL (olddecl
) != NULL_TREE
4141 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4143 if (DECL_NAME (olddecl
) == NULL_TREE
)
4144 return "`%#D' not declared in class";
4146 return "redefinition of `%#D'";
4150 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4152 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4153 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4154 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4155 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4156 && TYPE_SIZE (TREE_TYPE (newdecl
))
4157 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4158 return "redefinition of `%#D'";
4161 else if (toplevel_bindings_p ())
4163 /* Objects declared at top level: */
4164 /* If at least one is a reference, it's ok. */
4165 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4167 /* Reject two definitions. */
4168 return "redefinition of `%#D'";
4172 /* Objects declared with block scope: */
4173 /* Reject two definitions, and reject a definition
4174 together with an external reference. */
4175 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4176 return "redeclaration of `%#D'";
4181 /* Get the LABEL_DECL corresponding to identifier ID as a label.
4182 Create one if none exists so far for the current function.
4183 This function is called for both label definitions and label references. */
4189 register tree decl
= IDENTIFIER_LABEL_VALUE (id
);
4191 if (current_function_decl
== NULL_TREE
)
4193 error ("label `%s' referenced outside of any function",
4194 IDENTIFIER_POINTER (id
));
4198 if ((decl
== NULL_TREE
4199 || DECL_SOURCE_LINE (decl
) == 0)
4200 && (named_label_uses
== NULL
4201 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4202 || named_label_uses
->label_decl
!= decl
))
4204 struct named_label_list
*new_ent
;
4206 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4207 new_ent
->label_decl
= decl
;
4208 new_ent
->names_in_scope
= current_binding_level
->names
;
4209 new_ent
->binding_level
= current_binding_level
;
4210 new_ent
->lineno_o_goto
= lineno
;
4211 new_ent
->filename_o_goto
= input_filename
;
4212 new_ent
->next
= named_label_uses
;
4213 named_label_uses
= new_ent
;
4216 /* Use a label already defined or ref'd with this name. */
4217 if (decl
!= NULL_TREE
)
4219 /* But not if it is inherited and wasn't declared to be inheritable. */
4220 if (DECL_CONTEXT (decl
) != current_function_decl
4221 && ! C_DECLARED_LABEL_FLAG (decl
))
4222 return shadow_label (id
);
4226 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4228 /* Make sure every label has an rtx. */
4231 /* A label not explicitly declared must be local to where it's ref'd. */
4232 DECL_CONTEXT (decl
) = current_function_decl
;
4234 DECL_MODE (decl
) = VOIDmode
;
4236 /* Say where one reference is to the label,
4237 for the sake of the error if it is not defined. */
4238 DECL_SOURCE_LINE (decl
) = lineno
;
4239 DECL_SOURCE_FILE (decl
) = input_filename
;
4241 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4243 named_labels
= tree_cons (NULL_TREE
, decl
, named_labels
);
4244 named_label_uses
->label_decl
= decl
;
4249 /* Make a label named NAME in the current function,
4250 shadowing silently any that may be inherited from containing functions
4251 or containing scopes.
4253 Note that valid use, if the label being shadowed
4254 comes from another scope in the same function,
4255 requires calling declare_nonlocal_label right away. */
4261 register tree decl
= IDENTIFIER_LABEL_VALUE (name
);
4263 if (decl
!= NULL_TREE
)
4265 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4266 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4269 return lookup_label (name
);
4272 /* Define a label, specifying the location in the source file.
4273 Return the LABEL_DECL node for the label, if the definition is valid.
4274 Otherwise return 0. */
4277 define_label (filename
, line
, name
)
4284 if (minimal_parse_mode
)
4286 push_obstacks (&permanent_obstack
, &permanent_obstack
);
4287 decl
= build_decl (LABEL_DECL
, name
, void_type_node
);
4289 DECL_SOURCE_LINE (decl
) = line
;
4290 DECL_SOURCE_FILE (decl
) = filename
;
4295 decl
= lookup_label (name
);
4297 /* After labels, make any new cleanups go into their
4298 own new (temporary) binding contour. */
4299 current_binding_level
->more_cleanups_ok
= 0;
4301 /* If label with this name is known from an outer context, shadow it. */
4302 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) != current_function_decl
)
4304 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4305 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4306 decl
= lookup_label (name
);
4309 if (name
== get_identifier ("wchar_t"))
4310 cp_pedwarn ("label named wchar_t");
4312 if (DECL_INITIAL (decl
) != NULL_TREE
)
4314 cp_error ("duplicate label `%D'", decl
);
4319 struct named_label_list
*uses
, *prev
;
4322 /* Mark label as having been defined. */
4323 DECL_INITIAL (decl
) = error_mark_node
;
4324 /* Say where in the source. */
4325 DECL_SOURCE_FILE (decl
) = filename
;
4326 DECL_SOURCE_LINE (decl
) = line
;
4329 uses
= named_label_uses
;
4330 while (uses
!= NULL
)
4331 if (uses
->label_decl
== decl
)
4333 struct binding_level
*b
= current_binding_level
;
4336 tree new_decls
= b
->names
;
4337 tree old_decls
= (b
== uses
->binding_level
)
4338 ? uses
->names_in_scope
: NULL_TREE
;
4339 while (new_decls
!= old_decls
)
4341 if (TREE_CODE (new_decls
) == VAR_DECL
4342 /* Don't complain about crossing initialization
4343 of internal entities. They can't be accessed,
4344 and they should be cleaned up
4345 by the time we get to the label. */
4346 && ! DECL_ARTIFICIAL (new_decls
)
4347 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4348 && DECL_INITIAL (new_decls
) != error_mark_node
)
4349 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4353 cp_error ("jump to label `%D'", decl
);
4354 error_with_file_and_line (uses
->filename_o_goto
,
4355 uses
->lineno_o_goto
,
4359 cp_error_at (" crosses initialization of `%#D'",
4362 new_decls
= TREE_CHAIN (new_decls
);
4364 if (b
== uses
->binding_level
)
4370 prev
->next
= uses
->next
;
4372 named_label_uses
= uses
->next
;
4381 current_function_return_value
= NULL_TREE
;
4388 struct binding_level
*level
;
4389 struct cp_switch
*next
;
4392 static struct cp_switch
*switch_stack
;
4398 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4399 p
->level
= current_binding_level
;
4400 p
->next
= switch_stack
;
4407 switch_stack
= switch_stack
->next
;
4410 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4411 /* XXX Note decl is never actually used. (bpk) */
4414 define_case_label ()
4416 tree cleanup
= last_cleanup_this_contour ();
4417 struct binding_level
*b
= current_binding_level
;
4422 static int explained
= 0;
4423 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4424 warning ("where case label appears here");
4427 warning ("(enclose actions of previous case statements requiring");
4428 warning ("destructors in their own binding contours.)");
4433 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4435 tree new_decls
= b
->names
;
4436 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4438 if (TREE_CODE (new_decls
) == VAR_DECL
4439 /* Don't complain about crossing initialization
4440 of internal entities. They can't be accessed,
4441 and they should be cleaned up
4442 by the time we get to the label. */
4443 && ! DECL_ARTIFICIAL (new_decls
)
4444 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4445 && DECL_INITIAL (new_decls
) != error_mark_node
)
4446 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4449 error ("jump to case label");
4451 cp_error_at (" crosses initialization of `%#D'",
4457 /* After labels, make any new cleanups go into their
4458 own new (temporary) binding contour. */
4460 current_binding_level
->more_cleanups_ok
= 0;
4461 current_function_return_value
= NULL_TREE
;
4464 /* Return the list of declarations of the current level.
4465 Note that this list is in reverse order unless/until
4466 you nreverse it; and when you do nreverse it, you must
4467 store the result back using `storedecls' or you will lose. */
4472 return current_binding_level
->names
;
4475 /* Return the list of type-tags (for structs, etc) of the current level. */
4480 return current_binding_level
->tags
;
4483 /* Store the list of declarations of the current level.
4484 This is done for the parameter declarations of a function being defined,
4485 after they are modified in the light of any missing parameters. */
4491 current_binding_level
->names
= decls
;
4494 /* Similarly, store the list of tags of the current level. */
4500 current_binding_level
->tags
= tags
;
4503 /* Given NAME, an IDENTIFIER_NODE,
4504 return the structure (or union or enum) definition for that name.
4505 Searches binding levels from BINDING_LEVEL up to the global level.
4506 If THISLEVEL_ONLY is nonzero, searches only the specified context
4507 (but skips any tag-transparent contexts to find one that is
4508 meaningful for tags).
4509 FORM says which kind of type the caller wants;
4510 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4511 If the wrong kind of type is found, and it's not a template, an error is
4515 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4516 enum tree_code form
;
4518 struct binding_level
*binding_level
;
4521 register struct binding_level
*level
;
4522 /* Non-zero if, we should look past a pseudo-global level, even if
4524 int allow_pseudo_global
= 1;
4526 for (level
= binding_level
; level
; level
= level
->level_chain
)
4529 if (ANON_AGGRNAME_P (name
))
4530 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4532 /* There's no need for error checking here, because
4533 anon names are unique throughout the compilation. */
4534 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4535 return TREE_VALUE (tail
);
4537 else if (level
->namespace_p
)
4538 /* Do namespace lookup. */
4539 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
4541 tree old
= binding_for_name (name
, tail
);
4543 /* If we just skipped past a pseudo global level, even
4544 though THISLEVEL_ONLY, and we find a template class
4545 declaration, then we use the _TYPE node for the
4546 template. See the example below. */
4547 if (thislevel_only
&& !allow_pseudo_global
4548 && old
&& BINDING_VALUE (old
)
4549 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
4550 old
= TREE_TYPE (BINDING_VALUE (old
));
4552 old
= BINDING_TYPE (old
);
4554 /* If it has an original type, it is a typedef, and we
4555 should not return it. */
4556 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
4558 if (old
&& TREE_CODE (old
) != form
4559 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
4561 cp_error ("`%#D' redeclared as %C", old
, form
);
4566 if (thislevel_only
|| tail
== global_namespace
)
4570 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4572 if (TREE_PURPOSE (tail
) == name
)
4574 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
4575 /* Should tighten this up; it'll probably permit
4576 UNION_TYPE and a struct template, for example. */
4578 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
4580 /* Definition isn't the kind we were looking for. */
4581 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
4585 return TREE_VALUE (tail
);
4588 if (thislevel_only
&& ! level
->tag_transparent
)
4590 if (level
->pseudo_global
&& allow_pseudo_global
)
4592 /* We must deal with cases like this:
4594 template <class T> struct S;
4595 template <class T> struct S {};
4597 When looking up `S', for the second declaration, we
4598 would like to find the first declaration. But, we
4599 are in the pseudo-global level created for the
4600 template parameters, rather than the (surrounding)
4601 namespace level. Thus, we keep going one more level,
4602 even though THISLEVEL_ONLY is non-zero. */
4603 allow_pseudo_global
= 0;
4609 if (current_class_type
&& level
->level_chain
->namespace_p
)
4611 /* Try looking in this class's tags before heading into
4612 global binding level. */
4613 tree context
= current_class_type
;
4616 switch (TREE_CODE_CLASS (TREE_CODE (context
)))
4620 these_tags
= CLASSTYPE_TAGS (context
);
4621 if (ANON_AGGRNAME_P (name
))
4624 if (TYPE_IDENTIFIER (TREE_VALUE (these_tags
))
4626 return TREE_VALUE (tail
);
4627 these_tags
= TREE_CHAIN (these_tags
);
4632 if (TREE_PURPOSE (these_tags
) == name
)
4634 if (TREE_CODE (TREE_VALUE (these_tags
)) != form
)
4636 cp_error ("`%#D' redeclared as %C in class scope",
4637 TREE_VALUE (tail
), form
);
4640 return TREE_VALUE (tail
);
4642 these_tags
= TREE_CHAIN (these_tags
);
4644 /* If this type is not yet complete, then don't
4645 look at its context. */
4646 if (TYPE_SIZE (context
) == NULL_TREE
)
4648 /* Go to next enclosing type, if any. */
4649 context
= DECL_CONTEXT (TYPE_MAIN_DECL (context
));
4652 context
= DECL_CONTEXT (context
);
4655 my_friendly_abort (10);
4668 set_current_level_tags_transparency (tags_transparent
)
4669 int tags_transparent
;
4671 current_binding_level
->tag_transparent
= tags_transparent
;
4675 /* Given a type, find the tag that was defined for it and return the tag name.
4676 Otherwise return 0. However, the value can never be 0
4677 in the cases in which this is used.
4679 C++: If NAME is non-zero, this is the new name to install. This is
4680 done when replacing anonymous tags with real tag names. */
4683 lookup_tag_reverse (type
, name
)
4687 register struct binding_level
*level
;
4689 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
4692 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4694 if (TREE_VALUE (tail
) == type
)
4697 TREE_PURPOSE (tail
) = name
;
4698 return TREE_PURPOSE (tail
);
4705 /* Lookup TYPE in CONTEXT (a chain of nested types or a FUNCTION_DECL).
4706 Return the type value, or NULL_TREE if not found. */
4709 lookup_nested_type (type
, context
)
4713 if (context
== NULL_TREE
)
4717 switch (TREE_CODE (context
))
4721 tree ctype
= TREE_TYPE (context
);
4722 tree match
= value_member (type
, CLASSTYPE_TAGS (ctype
));
4724 return TREE_VALUE (match
);
4725 context
= DECL_CONTEXT (context
);
4727 /* When we have a nested class whose member functions have
4728 local types (e.g., a set of enums), we'll arrive here
4729 with the DECL_CONTEXT as the actual RECORD_TYPE node for
4730 the enclosing class. Instead, we want to make sure we
4731 come back in here with the TYPE_DECL, not the RECORD_TYPE. */
4732 if (context
&& TREE_CODE (context
) == RECORD_TYPE
)
4733 context
= TREE_CHAIN (context
);
4737 if (TYPE_NAME (type
) && TYPE_IDENTIFIER (type
))
4738 return lookup_name (TYPE_IDENTIFIER (type
), 1);
4741 my_friendly_abort (12);
4747 /* Look up NAME in the NAMESPACE. */
4750 lookup_namespace_name (namespace, name
)
4751 tree
namespace, name
;
4753 struct tree_binding _b
;
4756 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
4758 /* This happens for A::B<int> when B is a namespace. */
4759 if (TREE_CODE (name
) == NAMESPACE_DECL
)
4762 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
4764 val
= binding_init (&_b
);
4765 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
4766 return error_mark_node
;
4768 if (BINDING_VALUE (val
))
4770 val
= BINDING_VALUE (val
);
4772 /* If we have a single function from a using decl, pull it out. */
4773 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
4774 val
= OVL_FUNCTION (val
);
4778 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
4779 return error_mark_node
;
4782 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
4783 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
4784 is non-NULL, this type is being created by the implicit typename
4785 extension, and BASE_TYPE is a type named `t' in some base class of
4786 `T' which depends on template parameters.
4788 Returns the new TYPENAME_TYPE. */
4791 build_typename_type (context
, name
, fullname
, base_type
)
4800 if (processing_template_decl
)
4801 push_obstacks (&permanent_obstack
, &permanent_obstack
);
4803 /* Build the TYPENAME_TYPE. */
4804 t
= make_lang_type (TYPENAME_TYPE
);
4805 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4806 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
4807 TREE_TYPE (t
) = base_type
;
4808 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
4810 /* Build the corresponding TYPE_DECL. */
4811 d
= build_decl (TYPE_DECL
, name
, t
);
4812 TYPE_NAME (TREE_TYPE (d
)) = d
;
4813 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
4814 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
4816 if (processing_template_decl
)
4823 make_typename_type (context
, name
)
4829 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
4830 name
= TYPE_IDENTIFIER (name
);
4831 else if (TREE_CODE (name
) == TYPE_DECL
)
4832 name
= DECL_NAME (name
);
4836 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
4838 name
= TREE_OPERAND (name
, 0);
4839 if (TREE_CODE (name
) == TEMPLATE_DECL
)
4840 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
4842 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
4843 my_friendly_abort (2000);
4845 if (TREE_CODE (context
) == NAMESPACE_DECL
)
4847 /* We can get here from typename_sub0 in the explicit_template_type
4848 expansion. Just fail. */
4849 cp_error ("no class template named `%#T' in `%#T'",
4851 return error_mark_node
;
4854 if (! uses_template_parms (context
)
4855 || currently_open_class (context
))
4857 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
4859 if (IS_AGGR_TYPE (context
))
4860 t
= lookup_field (context
, name
, 0, 0);
4864 if (t
== NULL_TREE
|| TREE_CODE (t
) != TEMPLATE_DECL
4865 || TREE_CODE (DECL_RESULT (t
)) != TYPE_DECL
)
4867 cp_error ("no class template named `%#T' in `%#T'",
4869 return error_mark_node
;
4872 return lookup_template_class (t
, TREE_OPERAND (fullname
, 1),
4874 /*entering_scope=*/0);
4878 if (IS_AGGR_TYPE (context
))
4879 t
= lookup_field (context
, name
, 0, 1);
4885 cp_error ("no type named `%#T' in `%#T'", name
, context
);
4886 return error_mark_node
;
4889 return TREE_TYPE (t
);
4893 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
4896 /* Select the right _DECL from multiple choices. */
4899 select_decl (binding
, flags
)
4904 val
= BINDING_VALUE (binding
);
4905 if (LOOKUP_NAMESPACES_ONLY (flags
))
4907 /* We are not interested in types. */
4908 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
4913 /* If we could have a type and
4914 we have nothing or we need a type and have none. */
4915 if (BINDING_TYPE (binding
)
4916 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
4917 && TREE_CODE (val
) != TYPE_DECL
)))
4918 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
4919 /* Don't return non-types if we really prefer types. */
4920 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
4921 && (!looking_for_template
|| TREE_CODE (val
) != TEMPLATE_DECL
))
4927 /* Unscoped lookup of a global, iterate over namespaces, considering
4928 using namespace statements. */
4931 unqualified_namespace_lookup (name
, flags
)
4935 struct tree_binding _binding
;
4936 tree b
= binding_init (&_binding
);
4937 tree initial
= current_decl_namespace();
4938 tree scope
= initial
;
4940 struct binding_level
*level
;
4941 tree val
= NULL_TREE
;
4945 val
= binding_for_name (name
, scope
);
4947 /* Initialize binding for this context. */
4948 BINDING_VALUE (b
) = BINDING_VALUE (val
);
4949 BINDING_TYPE (b
) = BINDING_TYPE (val
);
4951 /* Add all _DECLs seen through local using-directives. */
4952 for (level
= current_binding_level
;
4953 !level
->namespace_p
;
4954 level
= level
->level_chain
)
4955 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
4957 /* Give up because of error. */
4960 /* Add all _DECLs seen through global using-directives. */
4961 /* XXX local and global using lists should work equally. */
4965 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
4967 /* Give up because of error. */
4969 if (siter
== scope
) break;
4970 siter
= CP_DECL_CONTEXT (siter
);
4973 val
= select_decl (b
, flags
);
4974 if (scope
== global_namespace
)
4976 scope
= CP_DECL_CONTEXT (scope
);
4981 /* Combine prefer_type and namespaces_only into flags. */
4984 lookup_flags (prefer_type
, namespaces_only
)
4985 int prefer_type
, namespaces_only
;
4987 if (namespaces_only
)
4988 return LOOKUP_PREFER_NAMESPACES
;
4989 if (prefer_type
> 1)
4990 return LOOKUP_PREFER_TYPES
;
4991 if (prefer_type
> 0)
4992 return LOOKUP_PREFER_BOTH
;
4996 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
4997 ignore it or not. Subroutine of lookup_name_real. */
5000 qualify_lookup (val
, flags
)
5004 if (val
== NULL_TREE
)
5006 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5008 if ((flags
& LOOKUP_PREFER_TYPES
)
5009 && (TREE_CODE (val
) == TYPE_DECL
5010 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5011 && DECL_CLASS_TEMPLATE_P (val
))))
5013 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5018 /* Look up NAME in the current binding level and its superiors in the
5019 namespace of variables, functions and typedefs. Return a ..._DECL
5020 node of some kind representing its definition if there is only one
5021 such declaration, or return a TREE_LIST with all the overloaded
5022 definitions if there are many, or return 0 if it is undefined.
5024 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5025 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5026 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5027 Otherwise we prefer non-TYPE_DECLs.
5029 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5030 using IDENTIFIER_CLASS_VALUE. */
5033 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5035 int prefer_type
, nonclass
, namespaces_only
;
5039 tree from_obj
= NULL_TREE
;
5040 tree locval
, classval
;
5043 /* Hack: copy flag set by parser, if set. */
5044 if (only_namespace_names
)
5045 namespaces_only
= 1;
5047 if (prefer_type
== -2)
5049 extern int looking_for_typename
;
5050 tree type
= NULL_TREE
;
5053 prefer_type
= looking_for_typename
;
5055 flags
= lookup_flags (prefer_type
, namespaces_only
);
5056 /* During parsing, we need to complain. */
5057 flags
|= LOOKUP_COMPLAIN
;
5058 /* If the next thing is '<', class templates are types. */
5059 if (looking_for_template
)
5060 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5062 /* std:: becomes :: for now. */
5063 if (got_scope
== std_node
)
5064 got_scope
= void_type_node
;
5068 else if (got_object
!= error_mark_node
)
5073 if (type
== error_mark_node
)
5074 return error_mark_node
;
5075 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5076 type
= TREE_TYPE (type
);
5079 type
= complete_type (type
);
5081 if (TREE_CODE (type
) == VOID_TYPE
)
5082 type
= global_namespace
;
5083 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5085 struct tree_binding b
;
5086 val
= binding_init (&b
);
5087 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5089 val
= select_decl (val
, flags
);
5091 else if (! IS_AGGR_TYPE (type
)
5092 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5093 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5094 || TREE_CODE (type
) == TYPENAME_TYPE
)
5095 /* Someone else will give an error about this if needed. */
5097 else if (TYPE_BEING_DEFINED (type
))
5099 val
= IDENTIFIER_CLASS_VALUE (name
);
5100 if (val
&& DECL_CONTEXT (val
) != type
)
5102 struct binding_level
*b
= class_binding_level
;
5103 for (val
= NULL_TREE
; b
; b
= b
->level_chain
)
5105 tree t
= purpose_member (name
, b
->class_shadowed
);
5106 if (t
&& TREE_VALUE (t
)
5107 && DECL_CONTEXT (TREE_VALUE (t
)) == type
)
5109 val
= TREE_VALUE (t
);
5114 if (val
== NULL_TREE
)
5115 val
= lookup_field (type
, name
, 0, 1);
5117 else if (type
== current_class_type
)
5118 val
= IDENTIFIER_CLASS_VALUE (name
);
5120 val
= lookup_member (type
, name
, 0, prefer_type
);
5127 else if (got_object
&& val
)
5131 flags
= lookup_flags (prefer_type
, namespaces_only
);
5133 locval
= classval
= NULL_TREE
;
5135 if (! namespace_bindings_p ())
5136 locval
= qualify_lookup (IDENTIFIER_LOCAL_VALUE (name
), flags
);
5138 /* In C++ class fields are between local and global scope,
5139 just before the global scope. */
5140 if (current_class_type
&& ! nonclass
)
5142 classval
= IDENTIFIER_CLASS_VALUE (name
);
5143 if (classval
== NULL_TREE
&& TYPE_BEING_DEFINED (current_class_type
))
5144 /* Try to find values from base classes if we are presently
5145 defining a type. We are presently only interested in
5147 classval
= lookup_field (current_class_type
, name
, 0, 1);
5149 /* Add implicit 'typename' to types from template bases. lookup_field
5150 will do this for us. If classval is actually from an enclosing
5151 scope, lookup_nested_field will get it for us. */
5152 else if (processing_template_decl
5153 && classval
&& TREE_CODE (classval
) == TYPE_DECL
5154 && ! currently_open_class (DECL_CONTEXT (classval
))
5155 && uses_template_parms (current_class_type
))
5156 classval
= lookup_field (current_class_type
, name
, 0, 1);
5158 /* yylex() calls this with -2, since we should never start digging for
5159 the nested name at the point where we haven't even, for example,
5160 created the COMPONENT_REF or anything like that. */
5161 if (classval
== NULL_TREE
)
5162 classval
= lookup_nested_field (name
, ! yylex
);
5164 classval
= qualify_lookup (classval
, flags
);
5167 if (locval
&& classval
)
5169 /* We have both a local binding and a class-level binding. This
5170 can happen in two ways:
5172 o We are in a member function of a class.
5173 o We are in a local class within a function.
5175 We need to determine which one of these situations is
5176 occuring, and give the innermost binding. One tricky bit is
5177 that with member templates we can be in the first case
5178 without CURRENT_FUNCTION_DECL being set. Consider
5180 struct A { template <class A> void f(A); };
5182 Here, when we look at the `A' in the parameter declaration
5183 for `f' we have a local binding (the template parameter) and
5184 a class-level binding (the TYPE_DECL for the class).
5185 Fortunately, if LOCVAL is a template parameter it is safe to
5186 take it; nothing within the scope of the template parameter
5187 is allowed to have the same name. */
5189 if (decl_template_parm_p (locval
))
5191 else if (current_scope () == current_function_decl
5192 && ! hack_decl_function_context (current_function_decl
))
5193 /* Not in a nested function. */
5197 /* This is incredibly horrible. The whole concept of
5198 IDENTIFIER_LOCAL_VALUE / IDENTIFIER_CLASS_VALUE /
5199 IDENTIFIER_GLOBAL_VALUE needs to be scrapped for local
5201 tree lctx
= hack_decl_function_context (locval
);
5202 tree cctx
= hack_decl_function_context (classval
);
5204 if (lctx
== current_scope ())
5206 else if (lctx
== cctx
)
5209 /* I don't know which is right; let's just guess for now. */
5218 val
= unqualified_namespace_lookup (name
, flags
);
5220 /* Any other name takes precedence over an implicit typename. Warn the
5221 user about this potentially confusing lookup. */
5222 if (classval
&& TREE_CODE (val
) == TYPE_DECL
5223 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
5224 && TREE_TYPE (TREE_TYPE (val
)))
5226 if (locval
== NULL_TREE
)
5227 locval
= unqualified_namespace_lookup (name
, flags
);
5229 if (locval
&& val
!= locval
)
5235 /* To avoid redundant warnings, only warn when lexing, and the
5236 decls are significantly different. */
5237 subtype
= TREE_TYPE (TREE_TYPE (classval
));
5239 && ! (TREE_CODE (locval
) == TEMPLATE_DECL
5240 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5241 && CLASSTYPE_TI_TEMPLATE (subtype
) == locval
)
5242 && ! (TREE_CODE (locval
) == TYPE_DECL
5243 && comptypes (TREE_TYPE (locval
), subtype
, 1)))
5245 static int explained
;
5247 cp_warning ("lookup of `%D' finds `%#D'", name
, locval
);
5249 (" instead of `%D' from dependent base class", classval
);
5253 cp_warning (" (use `typename %D' if that's what you meant)",
5263 /* This should only warn about types used in qualified-ids. */
5264 if (from_obj
&& from_obj
!= val
)
5266 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5267 && TREE_CODE (val
) == TYPE_DECL
5268 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5270 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5271 name
, got_object
, TREE_TYPE (from_obj
));
5272 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5276 /* We don't change val to from_obj if got_object depends on
5277 template parms because that breaks implicit typename for
5278 destructor calls. */
5279 if (! uses_template_parms (got_object
))
5283 if ((TREE_CODE (val
) == TEMPLATE_DECL
&& looking_for_template
)
5284 || TREE_CODE (val
) == TYPE_DECL
|| prefer_type
<= 0)
5286 /* Caller wants a class-or-namespace-name. */
5287 else if (prefer_type
== 1 && TREE_CODE (val
) == NAMESPACE_DECL
)
5289 else if (IDENTIFIER_HAS_TYPE_VALUE (name
))
5290 val
= TYPE_MAIN_DECL (IDENTIFIER_TYPE_VALUE (name
));
5291 else if (TREE_TYPE (val
) == error_mark_node
)
5292 val
= error_mark_node
;
5294 /* If we have a single function from a using decl, pull it out. */
5295 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5296 val
= OVL_FUNCTION (val
);
5305 lookup_name_nonclass (name
)
5308 return lookup_name_real (name
, 0, 1, 0);
5312 lookup_function_nonclass (name
, args
)
5316 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5320 lookup_name_namespace_only (name
)
5323 /* type-or-namespace, nonclass, namespace_only */
5324 return lookup_name_real (name
, 1, 1, 1);
5328 lookup_name (name
, prefer_type
)
5332 return lookup_name_real (name
, prefer_type
, 0, 0);
5335 /* Similar to `lookup_name' but look only at current binding level. */
5338 lookup_name_current_level (name
)
5341 register tree t
= NULL_TREE
;
5343 if (current_binding_level
->namespace_p
)
5345 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5347 /* extern "C" function() */
5348 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5351 else if (IDENTIFIER_LOCAL_VALUE (name
) != NULL_TREE
)
5353 struct binding_level
*b
= current_binding_level
;
5356 if (purpose_member (name
, b
->shadowed
))
5357 return IDENTIFIER_LOCAL_VALUE (name
);
5368 /* Like lookup_name_current_level, but for types. */
5371 lookup_type_current_level (name
)
5374 register tree t
= NULL_TREE
;
5376 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5378 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5379 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5381 struct binding_level
*b
= current_binding_level
;
5384 if (purpose_member (name
, b
->type_shadowed
))
5385 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5397 begin_only_namespace_names ()
5399 only_namespace_names
= 1;
5403 end_only_namespace_names ()
5405 only_namespace_names
= 0;
5408 /* Arrange for the user to get a source line number, even when the
5409 compiler is going down in flames, so that she at least has a
5410 chance of working around problems in the compiler. We used to
5411 call error(), but that let the segmentation fault continue
5412 through; now, it's much more passive by asking them to send the
5413 maintainers mail about the problem. */
5417 int sig ATTRIBUTE_UNUSED
;
5419 signal (SIGSEGV
, SIG_DFL
);
5421 signal (SIGIOT
, SIG_DFL
);
5424 signal (SIGILL
, SIG_DFL
);
5427 signal (SIGABRT
, SIG_DFL
);
5430 signal (SIGBUS
, SIG_DFL
);
5432 my_friendly_abort (0);
5436 /* Unused -- brendan 970107 */
5437 /* Array for holding types considered "built-in". These types
5438 are output in the module in which `main' is defined. */
5439 static tree
*builtin_type_tdescs_arr
;
5440 static int builtin_type_tdescs_len
, builtin_type_tdescs_max
;
5443 /* Push the declarations of builtin types into the namespace.
5444 RID_INDEX, if < RID_MAX is the index of the builtin type
5445 in the array RID_POINTERS. NAME is the name used when looking
5446 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5449 record_builtin_type (rid_index
, name
, type
)
5454 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5455 tree tdecl
= NULL_TREE
;
5457 if ((int) rid_index
< (int) RID_MAX
)
5458 rname
= ridpointers
[(int) rid_index
];
5460 tname
= get_identifier (name
);
5462 TYPE_BUILT_IN (type
) = 1;
5466 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5467 set_identifier_type_value (tname
, NULL_TREE
);
5468 if ((int) rid_index
< (int) RID_MAX
)
5469 /* Built-in types live in the global namespace. */
5470 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5472 if (rname
!= NULL_TREE
)
5474 if (tname
!= NULL_TREE
)
5476 set_identifier_type_value (rname
, NULL_TREE
);
5477 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5481 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5482 set_identifier_type_value (rname
, NULL_TREE
);
5487 /* Record one of the standard Java types.
5488 * Declare it as having the given NAME.
5489 * If SIZE > 0, it is the size of one of the integral types;
5490 * otherwise it is the negative of the size of one of the other types. */
5493 record_builtin_java_type (name
, size
)
5499 type
= make_signed_type (size
);
5500 else if (size
> -32)
5501 { /* "__java_char" or ""__java_boolean". */
5502 type
= make_unsigned_type (-size
);
5503 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5506 { /* "__java_float" or ""__java_double". */
5507 type
= make_node (REAL_TYPE
);
5508 TYPE_PRECISION (type
) = - size
;
5511 record_builtin_type (RID_MAX
, name
, type
);
5512 decl
= TYPE_NAME (type
);
5513 DECL_IGNORED_P (decl
) = 1;
5514 TYPE_FOR_JAVA (type
) = 1;
5518 /* Push a type into the namespace so that the back-ends ignore it. */
5521 record_unknown_type (type
, name
)
5525 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5526 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5527 DECL_IGNORED_P (decl
) = 1;
5528 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5529 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5530 TYPE_ALIGN (type
) = 1;
5531 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5534 /* Push overloaded decl, in global scope, with one argument so it
5535 can be used as a callback from define_function. */
5538 push_overloaded_decl_1 (x
)
5541 push_overloaded_decl (x
, 0);
5548 auto_function (name
, type
, code
)
5550 enum built_in_function code
;
5552 return define_function
5553 (IDENTIFIER_POINTER (name
), type
, code
, push_overloaded_decl_1
,
5554 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5558 /* Create the predefined scalar types of C,
5559 and some nodes representing standard constants (0, 1, (void *)0).
5560 Initialize the global binding level.
5561 Make definitions for built-in primitive functions. */
5564 init_decl_processing ()
5566 register tree endlink
, int_endlink
, double_endlink
, unsigned_endlink
;
5568 /* Data type of memcpy. */
5569 tree memcpy_ftype
, strlen_ftype
;
5570 int wchar_type_size
;
5572 tree array_domain_type
;
5573 tree vb_off_identifier
= NULL_TREE
;
5574 /* Function type `char *(char *, char *)' and similar ones */
5575 tree string_ftype_ptr_ptr
, int_ftype_string_string
;
5576 tree sizetype_endlink
;
5577 tree ptr_ftype
, ptr_ftype_unsigned
, ptr_ftype_sizetype
;
5578 tree void_ftype
, void_ftype_int
, void_ftype_ptr
;
5580 /* Have to make these distinct before we try using them. */
5581 lang_name_cplusplus
= get_identifier ("C++");
5582 lang_name_c
= get_identifier ("C");
5583 lang_name_java
= get_identifier ("Java");
5585 /* Enter the global namespace. */
5586 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5587 my_friendly_assert (current_lang_name
== NULL_TREE
, 375);
5588 current_lang_name
= lang_name_cplusplus
;
5589 push_namespace (get_identifier ("::"));
5590 global_namespace
= current_namespace
;
5591 current_lang_name
= NULL_TREE
;
5593 if (flag_strict_prototype
== 2)
5594 flag_strict_prototype
= pedantic
;
5596 strict_prototypes_lang_c
= flag_strict_prototype
;
5599 current_lang_name
= lang_name_c
;
5601 current_function_decl
= NULL_TREE
;
5602 named_labels
= NULL_TREE
;
5603 named_label_uses
= NULL
;
5604 current_binding_level
= NULL_BINDING_LEVEL
;
5605 free_binding_level
= NULL_BINDING_LEVEL
;
5607 #ifndef __CYGWIN32__
5608 /* Because most segmentation signals can be traced back into user
5609 code, catch them and at least give the user a chance of working
5610 around compiler bugs. */
5611 signal (SIGSEGV
, signal_catch
);
5613 /* We will also catch aborts in the back-end through signal_catch and
5614 give the user a chance to see where the error might be, and to defeat
5615 aborts in the back-end when there have been errors previously in their
5618 signal (SIGIOT
, signal_catch
);
5621 signal (SIGILL
, signal_catch
);
5624 signal (SIGABRT
, signal_catch
);
5627 signal (SIGBUS
, signal_catch
);
5629 #else /* ndef __CYGWIN32__ */
5630 /* Cygwin32 cannot handle catching signals other than
5631 SIGABRT yet. We hope this will cease to be the case soon. */
5633 signal (SIGABRT
, signal_catch
);
5635 #endif /* ndef __CYGWIN32__ */
5637 gcc_obstack_init (&decl_obstack
);
5639 /* Must lay these out before anything else gets laid out. */
5640 error_mark_node
= make_node (ERROR_MARK
);
5641 TREE_PERMANENT (error_mark_node
) = 1;
5642 TREE_TYPE (error_mark_node
) = error_mark_node
;
5643 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
5644 TREE_TYPE (error_mark_list
) = error_mark_node
;
5646 /* Make the binding_level structure for global names. */
5648 global_binding_level
= current_binding_level
;
5649 /* The global level is the namespace level of ::. */
5650 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
5651 declare_namespace_level ();
5653 this_identifier
= get_identifier (THIS_NAME
);
5654 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
5655 ctor_identifier
= get_identifier (CTOR_NAME
);
5656 dtor_identifier
= get_identifier (DTOR_NAME
);
5657 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
5658 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
5659 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
5660 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
5661 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
5662 if (flag_handle_signatures
)
5664 tag_identifier
= get_identifier (SIGTABLE_TAG_NAME
);
5665 vb_off_identifier
= get_identifier (SIGTABLE_VB_OFF_NAME
);
5666 vt_off_identifier
= get_identifier (SIGTABLE_VT_OFF_NAME
);
5669 /* Define `int' and `char' first so that dbx will output them first. */
5671 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5672 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
5674 /* Define `char', which is like either `signed char' or `unsigned char'
5675 but not the same as either. */
5679 ? make_signed_type (CHAR_TYPE_SIZE
)
5680 : make_unsigned_type (CHAR_TYPE_SIZE
));
5681 record_builtin_type (RID_CHAR
, "char", char_type_node
);
5683 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5684 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
5686 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5687 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
5689 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5690 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
5691 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
5693 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5694 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
5696 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5697 record_builtin_type (RID_MAX
, "long long unsigned int",
5698 long_long_unsigned_type_node
);
5699 record_builtin_type (RID_MAX
, "long long unsigned",
5700 long_long_unsigned_type_node
);
5702 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5703 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
5704 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5705 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
5706 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
5708 /* `unsigned long' is the standard type for sizeof.
5709 Note that stddef.h uses `unsigned long',
5710 and this must agree, even if long and int are the same size. */
5712 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
5715 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
5717 /* Define both `signed char' and `unsigned char'. */
5718 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5719 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
5720 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5721 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
5723 /* These are types that type_for_size and type_for_mode use. */
5724 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
5725 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
5726 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
5727 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
5728 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
5729 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
5730 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
5731 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
5732 #if HOST_BITS_PER_WIDE_INT >= 64
5733 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
5734 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intTI_type_node
));
5736 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
5737 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
5738 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
5739 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
5740 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
5741 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
5742 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
5743 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
5744 #if HOST_BITS_PER_WIDE_INT >= 64
5745 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
5746 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intTI_type_node
));
5749 float_type_node
= make_node (REAL_TYPE
);
5750 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5751 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
5752 layout_type (float_type_node
);
5754 double_type_node
= make_node (REAL_TYPE
);
5755 if (flag_short_double
)
5756 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5758 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5759 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
5760 layout_type (double_type_node
);
5762 long_double_type_node
= make_node (REAL_TYPE
);
5763 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5764 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
5765 layout_type (long_double_type_node
);
5767 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5768 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
5769 complex_integer_type_node
));
5770 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5771 layout_type (complex_integer_type_node
);
5773 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5774 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
5775 complex_float_type_node
));
5776 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5777 layout_type (complex_float_type_node
);
5779 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5780 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
5781 complex_double_type_node
));
5782 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5783 layout_type (complex_double_type_node
);
5785 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5786 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
5787 complex_long_double_type_node
));
5788 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5789 layout_type (complex_long_double_type_node
);
5791 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
5792 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
5793 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
5794 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
5795 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
5796 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
5797 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
5798 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
5800 integer_zero_node
= build_int_2 (0, 0);
5801 TREE_TYPE (integer_zero_node
) = integer_type_node
;
5802 integer_one_node
= build_int_2 (1, 0);
5803 TREE_TYPE (integer_one_node
) = integer_type_node
;
5804 integer_two_node
= build_int_2 (2, 0);
5805 TREE_TYPE (integer_two_node
) = integer_type_node
;
5806 integer_three_node
= build_int_2 (3, 0);
5807 TREE_TYPE (integer_three_node
) = integer_type_node
;
5809 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5810 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5811 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
5812 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
5813 TYPE_PRECISION (boolean_type_node
) = 1;
5814 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
5815 boolean_false_node
= build_int_2 (0, 0);
5816 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
5817 boolean_true_node
= build_int_2 (1, 0);
5818 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
5820 /* These are needed by stor-layout.c. */
5821 size_zero_node
= size_int (0);
5822 size_one_node
= size_int (1);
5824 signed_size_zero_node
= build_int_2 (0, 0);
5825 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
5827 void_type_node
= make_node (VOID_TYPE
);
5828 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
5829 layout_type (void_type_node
); /* Uses integer_zero_node. */
5830 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
5831 TREE_PARMLIST (void_list_node
) = 1;
5833 null_pointer_node
= build_int_2 (0, 0);
5834 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
5835 layout_type (TREE_TYPE (null_pointer_node
));
5837 /* Used for expressions that do nothing, but are not errors. */
5838 void_zero_node
= build_int_2 (0, 0);
5839 TREE_TYPE (void_zero_node
) = void_type_node
;
5841 string_type_node
= build_pointer_type (char_type_node
);
5842 const_string_type_node
5843 = build_pointer_type (build_type_variant (char_type_node
, 1, 0));
5845 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
5848 /* Make a type to be the domain of a few array types
5849 whose domains don't really matter.
5850 200 is small enough that it always fits in size_t
5851 and large enough that it can hold most function names for the
5852 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5853 array_domain_type
= build_index_type (build_int_2 (200, 0));
5855 /* Make a type for arrays of characters.
5856 With luck nothing will ever really depend on the length of this
5858 char_array_type_node
5859 = build_array_type (char_type_node
, array_domain_type
);
5860 /* Likewise for arrays of ints. */
5862 = build_array_type (integer_type_node
, array_domain_type
);
5864 /* This is just some anonymous class type. Nobody should ever
5865 need to look inside this envelope. */
5866 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
5868 default_function_type
5869 = build_function_type (integer_type_node
, NULL_TREE
);
5871 ptr_type_node
= build_pointer_type (void_type_node
);
5873 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5875 record_builtin_type (RID_MAX
, NULL_PTR
, ptr_type_node
);
5877 endlink
= void_list_node
;
5878 int_endlink
= tree_cons (NULL_TREE
, integer_type_node
, endlink
);
5879 double_endlink
= tree_cons (NULL_TREE
, double_type_node
, endlink
);
5880 unsigned_endlink
= tree_cons (NULL_TREE
, unsigned_type_node
, endlink
);
5882 ptr_ftype
= build_function_type (ptr_type_node
, NULL_TREE
);
5883 ptr_ftype_unsigned
= build_function_type (ptr_type_node
, unsigned_endlink
);
5884 sizetype_endlink
= tree_cons (NULL_TREE
, sizetype
, endlink
);
5885 /* We realloc here because sizetype could be int or unsigned. S'ok. */
5886 ptr_ftype_sizetype
= build_function_type (ptr_type_node
, sizetype_endlink
);
5888 void_ftype
= build_function_type (void_type_node
, endlink
);
5889 void_ftype_int
= build_function_type (void_type_node
, int_endlink
);
5891 = build_function_type (void_type_node
,
5892 tree_cons (NULL_TREE
, ptr_type_node
, endlink
));
5894 = build_exception_variant (void_ftype_ptr
,
5895 tree_cons (NULL_TREE
, NULL_TREE
, NULL_TREE
));
5898 = build_function_type (float_type_node
,
5899 tree_cons (NULL_TREE
, float_type_node
, endlink
));
5902 = build_function_type (double_type_node
, double_endlink
);
5904 ldouble_ftype_ldouble
5905 = build_function_type (long_double_type_node
,
5906 tree_cons (NULL_TREE
, long_double_type_node
,
5909 double_ftype_double_double
5910 = build_function_type (double_type_node
,
5911 tree_cons (NULL_TREE
, double_type_node
,
5915 = build_function_type (integer_type_node
, int_endlink
);
5918 = build_function_type (long_integer_type_node
,
5919 tree_cons (NULL_TREE
, long_integer_type_node
,
5922 int_ftype_cptr_cptr_sizet
5923 = build_function_type (integer_type_node
,
5924 tree_cons (NULL_TREE
, const_ptr_type_node
,
5925 tree_cons (NULL_TREE
, const_ptr_type_node
,
5926 tree_cons (NULL_TREE
,
5930 string_ftype_ptr_ptr
/* strcpy prototype */
5931 = build_function_type (string_type_node
,
5932 tree_cons (NULL_TREE
, string_type_node
,
5933 tree_cons (NULL_TREE
,
5934 const_string_type_node
,
5937 int_ftype_string_string
/* strcmp prototype */
5938 = build_function_type (integer_type_node
,
5939 tree_cons (NULL_TREE
, const_string_type_node
,
5940 tree_cons (NULL_TREE
,
5941 const_string_type_node
,
5944 strlen_ftype
/* strlen prototype */
5945 = build_function_type (sizetype
,
5946 tree_cons (NULL_TREE
, const_string_type_node
,
5949 memcpy_ftype
/* memcpy prototype */
5950 = build_function_type (ptr_type_node
,
5951 tree_cons (NULL_TREE
, ptr_type_node
,
5952 tree_cons (NULL_TREE
, const_ptr_type_node
,
5953 sizetype_endlink
)));
5955 if (flag_huge_objects
)
5956 delta_type_node
= long_integer_type_node
;
5958 delta_type_node
= short_integer_type_node
;
5960 builtin_function ("__builtin_constant_p", default_function_type
,
5961 BUILT_IN_CONSTANT_P
, NULL_PTR
);
5963 builtin_return_address_fndecl
5964 = builtin_function ("__builtin_return_address", ptr_ftype_unsigned
,
5965 BUILT_IN_RETURN_ADDRESS
, NULL_PTR
);
5967 builtin_function ("__builtin_frame_address", ptr_ftype_unsigned
,
5968 BUILT_IN_FRAME_ADDRESS
, NULL_PTR
);
5970 builtin_function ("__builtin_alloca", ptr_ftype_sizetype
,
5971 BUILT_IN_ALLOCA
, "alloca");
5972 builtin_function ("__builtin_ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
5973 /* Define alloca, ffs as builtins.
5974 Declare _exit just to mark it as volatile. */
5975 if (! flag_no_builtin
&& !flag_no_nonansi_builtin
)
5977 temp
= builtin_function ("alloca", ptr_ftype_sizetype
,
5978 BUILT_IN_ALLOCA
, NULL_PTR
);
5979 /* Suppress error if redefined as a non-function. */
5980 DECL_BUILT_IN_NONANSI (temp
) = 1;
5981 temp
= builtin_function ("ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
5982 /* Suppress error if redefined as a non-function. */
5983 DECL_BUILT_IN_NONANSI (temp
) = 1;
5984 temp
= builtin_function ("_exit", void_ftype_int
,
5985 NOT_BUILT_IN
, NULL_PTR
);
5986 TREE_THIS_VOLATILE (temp
) = 1;
5987 TREE_SIDE_EFFECTS (temp
) = 1;
5988 /* Suppress error if redefined as a non-function. */
5989 DECL_BUILT_IN_NONANSI (temp
) = 1;
5992 builtin_function ("__builtin_abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
5993 builtin_function ("__builtin_fabsf", float_ftype_float
, BUILT_IN_FABS
,
5995 builtin_function ("__builtin_fabs", double_ftype_double
, BUILT_IN_FABS
,
5997 builtin_function ("__builtin_fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
5999 builtin_function ("__builtin_labs", long_ftype_long
,
6000 BUILT_IN_LABS
, NULL_PTR
);
6001 builtin_function ("__builtin_saveregs", ptr_ftype
,
6002 BUILT_IN_SAVEREGS
, NULL_PTR
);
6003 builtin_function ("__builtin_classify_type", default_function_type
,
6004 BUILT_IN_CLASSIFY_TYPE
, NULL_PTR
);
6005 builtin_function ("__builtin_next_arg", ptr_ftype
,
6006 BUILT_IN_NEXT_ARG
, NULL_PTR
);
6007 builtin_function ("__builtin_args_info", int_ftype_int
,
6008 BUILT_IN_ARGS_INFO
, NULL_PTR
);
6009 builtin_function ("__builtin_setjmp",
6010 build_function_type (integer_type_node
,
6011 tree_cons (NULL_TREE
, ptr_type_node
,
6013 BUILT_IN_SETJMP
, NULL_PTR
);
6014 builtin_function ("__builtin_longjmp",
6015 build_function_type (integer_type_node
,
6016 tree_cons (NULL_TREE
, ptr_type_node
,
6017 tree_cons (NULL_TREE
,
6020 BUILT_IN_LONGJMP
, NULL_PTR
);
6022 /* Untyped call and return. */
6023 builtin_function ("__builtin_apply_args", ptr_ftype
,
6024 BUILT_IN_APPLY_ARGS
, NULL_PTR
);
6026 temp
= tree_cons (NULL_TREE
,
6027 build_pointer_type (build_function_type (void_type_node
,
6029 tree_cons (NULL_TREE
, ptr_ftype_sizetype
, NULL_TREE
));
6030 builtin_function ("__builtin_apply",
6031 build_function_type (ptr_type_node
, temp
),
6032 BUILT_IN_APPLY
, NULL_PTR
);
6033 builtin_function ("__builtin_return", void_ftype_ptr
,
6034 BUILT_IN_RETURN
, NULL_PTR
);
6036 /* Currently under experimentation. */
6037 builtin_function ("__builtin_memcpy", memcpy_ftype
,
6038 BUILT_IN_MEMCPY
, "memcpy");
6039 builtin_function ("__builtin_memcmp", int_ftype_cptr_cptr_sizet
,
6040 BUILT_IN_MEMCMP
, "memcmp");
6041 builtin_function ("__builtin_strcmp", int_ftype_string_string
,
6042 BUILT_IN_STRCMP
, "strcmp");
6043 builtin_function ("__builtin_strcpy", string_ftype_ptr_ptr
,
6044 BUILT_IN_STRCPY
, "strcpy");
6045 builtin_function ("__builtin_strlen", strlen_ftype
,
6046 BUILT_IN_STRLEN
, "strlen");
6047 builtin_function ("__builtin_sqrtf", float_ftype_float
,
6048 BUILT_IN_FSQRT
, "sqrtf");
6049 builtin_function ("__builtin_fsqrt", double_ftype_double
,
6050 BUILT_IN_FSQRT
, NULL_PTR
);
6051 builtin_function ("__builtin_sqrtl", ldouble_ftype_ldouble
,
6052 BUILT_IN_FSQRT
, "sqrtl");
6053 builtin_function ("__builtin_sinf", float_ftype_float
,
6054 BUILT_IN_SIN
, "sinf");
6055 builtin_function ("__builtin_sin", double_ftype_double
,
6056 BUILT_IN_SIN
, "sin");
6057 builtin_function ("__builtin_sinl", ldouble_ftype_ldouble
,
6058 BUILT_IN_SIN
, "sinl");
6059 builtin_function ("__builtin_cosf", float_ftype_float
,
6060 BUILT_IN_COS
, "cosf");
6061 builtin_function ("__builtin_cos", double_ftype_double
,
6062 BUILT_IN_COS
, "cos");
6063 builtin_function ("__builtin_cosl", ldouble_ftype_ldouble
,
6064 BUILT_IN_COS
, "cosl");
6066 if (!flag_no_builtin
)
6068 builtin_function ("abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
6069 builtin_function ("fabs", double_ftype_double
, BUILT_IN_FABS
, NULL_PTR
);
6070 builtin_function ("labs", long_ftype_long
, BUILT_IN_LABS
, NULL_PTR
);
6071 builtin_function ("fabsf", float_ftype_float
, BUILT_IN_FABS
, NULL_PTR
);
6072 builtin_function ("fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
6074 builtin_function ("memcpy", memcpy_ftype
, BUILT_IN_MEMCPY
, NULL_PTR
);
6075 builtin_function ("memcmp", int_ftype_cptr_cptr_sizet
, BUILT_IN_MEMCMP
,
6077 builtin_function ("strcmp", int_ftype_string_string
, BUILT_IN_STRCMP
,
6079 builtin_function ("strcpy", string_ftype_ptr_ptr
, BUILT_IN_STRCPY
,
6081 builtin_function ("strlen", strlen_ftype
, BUILT_IN_STRLEN
, NULL_PTR
);
6082 builtin_function ("sqrtf", float_ftype_float
, BUILT_IN_FSQRT
, NULL_PTR
);
6083 builtin_function ("sqrt", double_ftype_double
, BUILT_IN_FSQRT
, NULL_PTR
);
6084 builtin_function ("sqrtl", ldouble_ftype_ldouble
, BUILT_IN_FSQRT
,
6086 builtin_function ("sinf", float_ftype_float
, BUILT_IN_SIN
, NULL_PTR
);
6087 builtin_function ("sin", double_ftype_double
, BUILT_IN_SIN
, NULL_PTR
);
6088 builtin_function ("sinl", ldouble_ftype_ldouble
, BUILT_IN_SIN
, NULL_PTR
);
6089 builtin_function ("cosf", float_ftype_float
, BUILT_IN_COS
, NULL_PTR
);
6090 builtin_function ("cos", double_ftype_double
, BUILT_IN_COS
, NULL_PTR
);
6091 builtin_function ("cosl", ldouble_ftype_ldouble
, BUILT_IN_COS
, NULL_PTR
);
6093 /* Declare these functions volatile
6094 to avoid spurious "control drops through" warnings. */
6095 temp
= builtin_function ("abort", void_ftype
,
6096 NOT_BUILT_IN
, NULL_PTR
);
6097 TREE_THIS_VOLATILE (temp
) = 1;
6098 TREE_SIDE_EFFECTS (temp
) = 1;
6099 /* Well, these are actually ANSI, but we can't set DECL_BUILT_IN on
6101 DECL_BUILT_IN_NONANSI (temp
) = 1;
6102 temp
= builtin_function ("exit", void_ftype_int
,
6103 NOT_BUILT_IN
, NULL_PTR
);
6104 TREE_THIS_VOLATILE (temp
) = 1;
6105 TREE_SIDE_EFFECTS (temp
) = 1;
6106 DECL_BUILT_IN_NONANSI (temp
) = 1;
6110 /* Support for these has not been written in either expand_builtin
6111 or build_function_call. */
6112 builtin_function ("__builtin_div", default_ftype
, BUILT_IN_DIV
, NULL_PTR
);
6113 builtin_function ("__builtin_ldiv", default_ftype
, BUILT_IN_LDIV
, NULL_PTR
);
6114 builtin_function ("__builtin_ffloor", double_ftype_double
, BUILT_IN_FFLOOR
,
6116 builtin_function ("__builtin_fceil", double_ftype_double
, BUILT_IN_FCEIL
,
6118 builtin_function ("__builtin_fmod", double_ftype_double_double
,
6119 BUILT_IN_FMOD
, NULL_PTR
);
6120 builtin_function ("__builtin_frem", double_ftype_double_double
,
6121 BUILT_IN_FREM
, NULL_PTR
);
6122 builtin_function ("__builtin_memset", ptr_ftype_ptr_int_int
,
6123 BUILT_IN_MEMSET
, NULL_PTR
);
6124 builtin_function ("__builtin_getexp", double_ftype_double
, BUILT_IN_GETEXP
,
6126 builtin_function ("__builtin_getman", double_ftype_double
, BUILT_IN_GETMAN
,
6130 /* C++ extensions */
6132 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6133 record_unknown_type (unknown_type_node
, "unknown type");
6135 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6136 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6138 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6140 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6142 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6143 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6145 /* This is for handling opaque types in signatures. */
6146 opaque_type_node
= copy_node (ptr_type_node
);
6147 TYPE_MAIN_VARIANT (opaque_type_node
) = opaque_type_node
;
6148 record_builtin_type (RID_MAX
, 0, opaque_type_node
);
6150 /* This is special for C++ so functions can be overloaded. */
6152 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6153 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6154 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6155 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6157 = TREE_UNSIGNED (wchar_type_node
)
6158 ? unsigned_wchar_type_node
6159 : signed_wchar_type_node
;
6160 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6162 /* Artificial declaration of wchar_t -- can be bashed */
6163 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6165 pushdecl (wchar_decl_node
);
6167 /* This is for wide string constants. */
6168 wchar_array_type_node
6169 = build_array_type (wchar_type_node
, array_domain_type
);
6171 if (flag_vtable_thunks
)
6173 /* Make sure we get a unique function type, so we can give
6174 its pointer type a name. (This wins for gdb.) */
6175 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6176 TREE_TYPE (vfunc_type
) = integer_type_node
;
6177 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6178 layout_type (vfunc_type
);
6180 vtable_entry_type
= build_pointer_type (vfunc_type
);
6184 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6185 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
6187 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
6189 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
6191 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6194 /* Make this part of an invisible union. */
6195 fields
[3] = copy_node (fields
[2]);
6196 TREE_TYPE (fields
[3]) = delta_type_node
;
6197 DECL_NAME (fields
[3]) = delta2_identifier
;
6198 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6199 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6200 TREE_UNSIGNED (fields
[3]) = 0;
6201 TREE_CHAIN (fields
[2]) = fields
[3];
6202 vtable_entry_type
= build_type_variant (vtable_entry_type
, 1, 0);
6204 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6207 = build_array_type (vtable_entry_type
, NULL_TREE
);
6208 layout_type (vtbl_type_node
);
6209 vtbl_type_node
= cp_build_type_variant (vtbl_type_node
, 1, 0);
6210 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6211 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6212 layout_type (vtbl_ptr_type_node
);
6213 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6215 /* Simplify life by making a "sigtable_entry_type". Give its
6216 fields names so that the debugger can use them. */
6218 if (flag_handle_signatures
)
6220 sigtable_entry_type
= make_lang_type (RECORD_TYPE
);
6221 fields
[0] = build_lang_field_decl (FIELD_DECL
, tag_identifier
,
6223 fields
[1] = build_lang_field_decl (FIELD_DECL
, vb_off_identifier
,
6225 fields
[2] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
6227 fields
[3] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
6229 fields
[4] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
6232 /* Set the alignment to the max of the alignment of ptr_type_node and
6233 delta_type_node. Double alignment wastes a word on the Sparc. */
6234 finish_builtin_type (sigtable_entry_type
, SIGTABLE_PTR_TYPE
, fields
, 4,
6235 (TYPE_ALIGN (ptr_type_node
) > TYPE_ALIGN (delta_type_node
))
6239 /* Make this part of an invisible union. */
6240 fields
[5] = copy_node (fields
[4]);
6241 TREE_TYPE (fields
[5]) = delta_type_node
;
6242 DECL_NAME (fields
[5]) = vt_off_identifier
;
6243 DECL_MODE (fields
[5]) = TYPE_MODE (delta_type_node
);
6244 DECL_SIZE (fields
[5]) = TYPE_SIZE (delta_type_node
);
6245 TREE_UNSIGNED (fields
[5]) = 0;
6246 TREE_CHAIN (fields
[4]) = fields
[5];
6248 sigtable_entry_type
= build_type_variant (sigtable_entry_type
, 1, 0);
6249 record_builtin_type (RID_MAX
, SIGTABLE_PTR_TYPE
, sigtable_entry_type
);
6252 std_node
= build_decl (NAMESPACE_DECL
,
6253 get_identifier (flag_honor_std
? "fake std":"std"),
6255 pushdecl (std_node
);
6257 global_type_node
= make_node (LANG_TYPE
);
6258 record_unknown_type (global_type_node
, "global type");
6261 current_lang_name
= lang_name_cplusplus
;
6264 tree bad_alloc_type_node
, newtype
, deltype
;
6266 push_namespace (get_identifier ("std"));
6267 bad_alloc_type_node
= xref_tag
6268 (class_type_node
, get_identifier ("bad_alloc"), 1);
6271 newtype
= build_exception_variant
6272 (ptr_ftype_sizetype
, build_tree_list (NULL_TREE
, bad_alloc_type_node
));
6273 deltype
= build_exception_variant
6274 (void_ftype_ptr
, build_tree_list (NULL_TREE
, NULL_TREE
));
6275 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6276 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6277 auto_function (ansi_opname
[(int) DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6278 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6282 = define_function ("__pure_virtual", void_ftype
,
6283 NOT_BUILT_IN
, 0, 0);
6285 /* Perform other language dependent initializations. */
6286 init_class_processing ();
6287 init_init_processing ();
6288 init_search_processing ();
6290 init_rtti_processing ();
6292 if (flag_exceptions
)
6293 init_exception_processing ();
6296 flag_inline_functions
= 0;
6299 if (! supports_one_only ())
6302 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6303 declare_function_name ();
6305 /* Prepare to check format strings against argument lists. */
6306 init_function_format_info ();
6308 /* Show we use EH for cleanups. */
6309 using_eh_for_cleanups ();
6311 print_error_function
= lang_print_error_function
;
6312 lang_get_alias_set
= &c_get_alias_set
;
6314 /* Maintain consistency. Perhaps we should just complain if they
6315 say -fwritable-strings? */
6316 if (flag_writable_strings
)
6317 flag_const_strings
= 0;
6320 /* Function to print any language-specific context for an error message. */
6323 lang_print_error_function (file
)
6326 default_print_error_function (file
);
6327 maybe_print_template_context ();
6330 /* Make a definition for a builtin function named NAME and whose data type
6331 is TYPE. TYPE should be a function type with argument types.
6332 FUNCTION_CODE tells later passes how to compile calls to this function.
6333 See tree.h for its possible values.
6335 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6336 the name to be called if we can't opencode the function. */
6339 define_function (name
, type
, function_code
, pfn
, library_name
)
6342 enum built_in_function function_code
;
6343 void (*pfn
) PROTO((tree
));
6346 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6347 DECL_EXTERNAL (decl
) = 1;
6348 TREE_PUBLIC (decl
) = 1;
6349 DECL_ARTIFICIAL (decl
) = 1;
6351 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6352 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6354 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6355 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6356 function in the namespace. */
6357 if (pfn
) (*pfn
) (decl
);
6359 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6360 make_function_rtl (decl
);
6361 if (function_code
!= NOT_BUILT_IN
)
6363 DECL_BUILT_IN (decl
) = 1;
6364 DECL_FUNCTION_CODE (decl
) = function_code
;
6369 /* When we call finish_struct for an anonymous union, we create
6370 default copy constructors and such. But, an anonymous union
6371 shouldn't have such things; this function undoes the damage to the
6372 anonymous union type T.
6374 (The reason that we create the synthesized methods is that we don't
6375 distinguish `union { int i; }' from `typedef union { int i; } U'.
6376 The first is an anonymous union; the second is just an ordinary
6380 fixup_anonymous_union (t
)
6385 /* Wipe out memory of synthesized methods */
6386 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6387 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6388 TYPE_HAS_INIT_REF (t
) = 0;
6389 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6390 TYPE_HAS_ASSIGN_REF (t
) = 0;
6391 TYPE_HAS_ASSIGNMENT (t
) = 0;
6392 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6394 /* Splice the implicitly generated functions out of the TYPE_METHODS
6396 q
= &TYPE_METHODS (t
);
6399 if (DECL_ARTIFICIAL (*q
))
6400 *q
= TREE_CHAIN (*q
);
6402 q
= &TREE_CHAIN (*q
);
6405 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6406 function members. */
6407 if (TYPE_METHODS (t
))
6408 error ("an anonymous union cannot have function members");
6411 /* Called when a declaration is seen that contains no names to declare.
6412 If its type is a reference to a structure, union or enum inherited
6413 from a containing scope, shadow that tag name for the current scope
6414 with a forward reference.
6415 If its type defines a new named structure or union
6416 or defines an enum, it is valid but we need not do anything here.
6417 Otherwise, it is an error.
6419 C++: may have to grok the declspecs to learn about static,
6420 complain for anonymous unions. */
6423 shadow_tag (declspecs
)
6427 tree ob_modifier
= NULL_TREE
;
6429 register enum tree_code code
, ok_code
= ERROR_MARK
;
6430 register tree t
= NULL_TREE
;
6432 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6434 register tree value
= TREE_VALUE (link
);
6436 code
= TREE_CODE (value
);
6437 if (IS_AGGR_TYPE_CODE (code
) || code
== ENUMERAL_TYPE
)
6439 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6441 maybe_process_partial_specialization (value
);
6447 else if (value
== ridpointers
[(int) RID_STATIC
]
6448 || value
== ridpointers
[(int) RID_EXTERN
]
6449 || value
== ridpointers
[(int) RID_AUTO
]
6450 || value
== ridpointers
[(int) RID_REGISTER
]
6451 || value
== ridpointers
[(int) RID_INLINE
]
6452 || value
== ridpointers
[(int) RID_VIRTUAL
]
6453 || value
== ridpointers
[(int) RID_EXPLICIT
])
6454 ob_modifier
= value
;
6457 /* This is where the variables in an anonymous union are
6458 declared. An anonymous union declaration looks like:
6460 because there is no declarator after the union, the parser
6461 sends that declaration here. */
6462 if (ok_code
== UNION_TYPE
6464 && ((TREE_CODE (TYPE_NAME (t
)) == IDENTIFIER_NODE
6465 && ANON_AGGRNAME_P (TYPE_NAME (t
)))
6466 || (TREE_CODE (TYPE_NAME (t
)) == TYPE_DECL
6467 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))))
6469 fixup_anonymous_union (t
);
6471 if (TYPE_FIELDS (t
))
6473 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6475 finish_anon_union (decl
);
6480 /* Anonymous unions are objects, that's why we only check for
6481 inappropriate specifiers in this branch. */
6485 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6486 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6487 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6488 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6489 cp_error ("`%D' can only be specified for constructors",
6492 cp_error ("`%D' can only be specified for objects and functions",
6497 cp_error ("abstract declarator used as declaration");
6498 else if (found_tag
> 1)
6499 pedwarn ("multiple types in one declaration");
6503 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6506 groktypename (typename
)
6509 if (TREE_CODE (typename
) != TREE_LIST
)
6511 return grokdeclarator (TREE_VALUE (typename
),
6512 TREE_PURPOSE (typename
),
6513 TYPENAME
, 0, NULL_TREE
);
6516 /* Decode a declarator in an ordinary declaration or data definition.
6517 This is called as soon as the type information and variable name
6518 have been parsed, before parsing the initializer if any.
6519 Here we create the ..._DECL node, fill in its type,
6520 and put it on the list of decls for the current context.
6521 The ..._DECL node is returned as the value.
6523 Exception: for arrays where the length is not specified,
6524 the type is left null, to be filled in by `cp_finish_decl'.
6526 Function definitions do not come here; they go to start_function
6527 instead. However, external and forward declarations of functions
6528 do go through here. Structure field declarations are done by
6529 grokfield and not through here. */
6531 /* Set this to zero to debug not using the temporary obstack
6532 to parse initializers. */
6533 int debug_temp_inits
= 1;
6536 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6537 tree declarator
, declspecs
;
6539 tree attributes
, prefix_attributes
;
6542 register tree type
, tem
;
6544 extern int have_extern_spec
;
6545 extern int used_extern_spec
;
6548 /* See code below that used this. */
6549 int init_written
= initialized
;
6552 /* This should only be done once on the top most decl. */
6553 if (have_extern_spec
&& !used_extern_spec
)
6555 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6557 used_extern_spec
= 1;
6560 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6562 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6565 type
= TREE_TYPE (decl
);
6567 /* Don't lose if destructors must be executed at file-level. */
6568 if (! processing_template_decl
&& TREE_STATIC (decl
)
6569 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
6570 && !TREE_PERMANENT (decl
))
6572 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6573 decl
= copy_node (decl
);
6574 if (TREE_CODE (type
) == ARRAY_TYPE
)
6576 tree itype
= TYPE_DOMAIN (type
);
6577 if (itype
&& ! TREE_PERMANENT (itype
))
6579 itype
= build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype
)));
6580 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
6581 TREE_TYPE (decl
) = type
;
6588 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6589 ? DECL_CLASS_CONTEXT (decl
)
6590 : DECL_CONTEXT (decl
);
6592 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6593 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6595 /* When parsing the initializer, lookup should use the object's
6597 push_decl_namespace (context
);
6600 /* We are only interested in class contexts, later. */
6601 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6602 context
= NULL_TREE
;
6605 /* Is it valid for this decl to have an initializer at all?
6606 If not, set INITIALIZED to zero, which will indirectly
6607 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6608 switch (TREE_CODE (decl
))
6611 /* typedef foo = bar means give foo the same type as bar.
6612 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6613 Any other case of an initialization in a TYPE_DECL is an error. */
6614 if (pedantic
|| list_length (declspecs
) > 1)
6616 cp_error ("typedef `%D' is initialized", decl
);
6622 cp_error ("function `%#D' is initialized like a variable", decl
);
6627 if (! processing_template_decl
)
6629 if (type
!= error_mark_node
)
6631 if (TYPE_SIZE (type
) != NULL_TREE
6632 && ! TREE_CONSTANT (TYPE_SIZE (type
)))
6635 ("variable-sized object `%D' may not be initialized",
6640 if (TREE_CODE (type
) == ARRAY_TYPE
6641 && TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6644 ("elements of array `%#D' have incomplete type", decl
);
6653 if (! toplevel_bindings_p ()
6654 && DECL_EXTERNAL (decl
))
6655 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6657 DECL_EXTERNAL (decl
) = 0;
6658 if (toplevel_bindings_p ())
6659 TREE_STATIC (decl
) = 1;
6661 /* Tell `pushdecl' this is an initialized decl
6662 even though we don't yet have the initializer expression.
6663 Also tell `cp_finish_decl' it may store the real initializer. */
6664 DECL_INITIAL (decl
) = error_mark_node
;
6667 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6669 if (TREE_CODE (decl
) == VAR_DECL
)
6671 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6672 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6673 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6676 if (DECL_CONTEXT (field
) != context
)
6678 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6679 DECL_CONTEXT (field
), DECL_NAME (decl
),
6680 context
, DECL_NAME (decl
));
6681 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6683 /* Static data member are tricky; an in-class initialization
6684 still doesn't provide a definition, so the in-class
6685 declaration will have DECL_EXTERNAL set, but will have an
6686 initialization. Thus, duplicate_decls won't warn
6687 about this situation, and so we check here. */
6688 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6689 cp_error ("duplicate initialization of %D", decl
);
6690 if (duplicate_decls (decl
, field
))
6696 tree field
= check_classfn (context
, decl
);
6697 if (field
&& duplicate_decls (decl
, field
))
6701 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6702 DECL_IN_AGGR_P (decl
) = 0;
6703 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6704 || CLASSTYPE_USE_TEMPLATE (context
))
6705 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6707 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6708 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6711 pushclass (context
, 2);
6714 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6715 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6718 /* Set attributes here so if duplicate decl, will have proper attributes. */
6719 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6721 /* Add this decl to the current binding level, but not if it
6722 comes from another scope, e.g. a static member variable.
6723 TEM may equal DECL or it may be a previous decl of the same name. */
6725 if ((TREE_CODE (decl
) != PARM_DECL
&& DECL_CONTEXT (decl
) != NULL_TREE
6726 /* Definitions of namespace members outside their namespace are
6728 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
6729 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
6730 || TREE_CODE (type
) == LANG_TYPE
6731 /* The declaration of template specializations does not affect
6732 the functions available for overload resolution, so we do not
6734 || (TREE_CODE (decl
) == FUNCTION_DECL
6735 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
6738 tem
= pushdecl (decl
);
6740 if (processing_template_decl
)
6742 if (! current_function_decl
)
6743 tem
= push_template_decl (tem
);
6744 else if (minimal_parse_mode
)
6746 = build_min_nt (DECL_STMT
, copy_to_permanent (declarator
),
6747 copy_to_permanent (declspecs
),
6752 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6753 /* Tell the back-end to use or not use .common as appropriate. If we say
6754 -fconserve-space, we want this to save .data space, at the expense of
6755 wrong semantics. If we say -fno-conserve-space, we want this to
6756 produce errors about redefs; to do this we force variables into the
6758 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6761 if (! processing_template_decl
)
6764 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6765 push_obstacks_nochange ();
6768 /* We have no way of knowing whether the initializer will need to be
6769 evaluated at run-time or not until we've parsed it, so let's just put
6770 it in the permanent obstack. (jason) */
6772 && ! (TREE_CODE (tem
) == PARM_DECL
6773 || (TREE_READONLY (tem
)
6774 && (TREE_CODE (tem
) == VAR_DECL
6775 || TREE_CODE (tem
) == FIELD_DECL
))))
6777 /* When parsing and digesting the initializer,
6778 use temporary storage. Do this even if we will ignore the value. */
6779 if (toplevel_bindings_p () && debug_temp_inits
)
6781 if (processing_template_decl
6782 || TYPE_NEEDS_CONSTRUCTING (type
)
6783 || TREE_CODE (type
) == REFERENCE_TYPE
)
6784 /* In this case, the initializer must lay down in permanent
6785 storage, since it will be saved until `finish_file' is run. */
6788 temporary_allocation ();
6800 tree type
= TREE_TYPE (decl
);
6801 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6803 /* If this type of object needs a cleanup, and control may
6804 jump past it, make a new binding level so that it is cleaned
6805 up only when it is initialized first. */
6806 if (TYPE_NEEDS_DESTRUCTOR (type
)
6807 && current_binding_level
->more_cleanups_ok
== 0)
6808 pushlevel_temporary (1);
6811 /* Is it valid for this decl to have an initializer at all?
6812 If not, set INITIALIZED to zero, which will indirectly
6813 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6815 /* Don't allow initializations for incomplete types except for
6816 arrays which might be completed by the initialization. */
6817 if (type
== error_mark_node
)
6818 ; /* Don't complain again. */
6819 else if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6820 ; /* A complete type is ok. */
6821 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6823 cp_error ("variable `%#D' has initializer but incomplete type",
6826 type
= TREE_TYPE (decl
) = error_mark_node
;
6828 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6830 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6831 cp_error ("elements of array `%#D' have incomplete type", decl
);
6832 /* else we already gave an error in start_decl. */
6838 && TREE_CODE (decl
) != TYPE_DECL
6839 && TREE_CODE (decl
) != TEMPLATE_DECL
6840 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6842 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6843 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6845 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6847 /* Change the type so that assemble_variable will give
6848 DECL an rtl we can live with: (mem (const_int 0)). */
6849 type
= TREE_TYPE (decl
) = error_mark_node
;
6853 /* If any base type in the hierarchy of TYPE needs a constructor,
6854 then we set initialized to 1. This way any nodes which are
6855 created for the purposes of initializing this aggregate
6856 will live as long as it does. This is necessary for global
6857 aggregates which do not have their initializers processed until
6858 the end of the file. */
6859 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6864 /* We don't do this yet for GNU C++. */
6865 /* For a local variable, define the RTL now. */
6866 if (! toplevel_bindings_p ()
6867 /* But not if this is a duplicate decl
6868 and we preserved the rtl from the previous one
6869 (which may or may not happen). */
6870 && DECL_RTL (tem
) == NULL_RTX
)
6872 if (TYPE_SIZE (TREE_TYPE (tem
)) != NULL_TREE
)
6874 else if (TREE_CODE (TREE_TYPE (tem
)) == ARRAY_TYPE
6875 && DECL_INITIAL (tem
) != NULL_TREE
)
6881 DECL_INITIAL (decl
) = NULL_TREE
;
6884 /* Handle initialization of references.
6885 These three arguments are from `cp_finish_decl', and have the
6886 same meaning here that they do there.
6888 Quotes on semantics can be found in ARM 8.4.3. */
6891 grok_reference_init (decl
, type
, init
)
6892 tree decl
, type
, init
;
6896 if (init
== NULL_TREE
)
6898 if ((DECL_LANG_SPECIFIC (decl
) == 0
6899 || DECL_IN_AGGR_P (decl
) == 0)
6900 && ! DECL_THIS_EXTERN (decl
))
6902 cp_error ("`%D' declared as reference but not initialized", decl
);
6903 if (TREE_CODE (decl
) == VAR_DECL
)
6904 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
6909 if (init
== error_mark_node
)
6912 if (TREE_CODE (type
) == REFERENCE_TYPE
6913 && TREE_CODE (init
) == CONSTRUCTOR
)
6915 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6919 if (TREE_TYPE (init
) && TREE_CODE (TREE_TYPE (init
)) == UNKNOWN_TYPE
)
6920 /* decay_conversion is probably wrong for references to functions. */
6921 init
= decay_conversion (instantiate_type (TREE_TYPE (type
), init
, 1));
6923 if (TREE_CODE (init
) == TREE_LIST
)
6924 init
= build_compound_expr (init
);
6926 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6927 init
= convert_from_reference (init
);
6929 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6930 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6932 /* Note: default conversion is only called in very special cases. */
6933 init
= default_conversion (init
);
6936 tmp
= convert_to_reference
6937 (type
, init
, CONV_IMPLICIT
,
6938 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6940 if (tmp
== error_mark_node
)
6942 else if (tmp
!= NULL_TREE
)
6945 DECL_INITIAL (decl
) = save_expr (init
);
6949 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
6953 /* ?? Can this be optimized in some cases to
6954 hand back the DECL_INITIAL slot?? */
6955 if (TYPE_SIZE (TREE_TYPE (type
)))
6957 init
= convert_from_reference (decl
);
6958 if (TREE_PERMANENT (decl
))
6959 init
= copy_to_permanent (init
);
6960 SET_DECL_REFERENCE_SLOT (decl
, init
);
6963 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
6965 expand_static_init (decl
, DECL_INITIAL (decl
));
6966 DECL_INITIAL (decl
) = NULL_TREE
;
6971 if (TREE_CODE (decl
) == VAR_DECL
)
6972 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
6976 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
6977 mucking with forces it does not comprehend (i.e. initialization with a
6978 constructor). If we are at global scope and won't go into COMMON, fill
6979 it in with a dummy CONSTRUCTOR to force the variable into .data;
6980 otherwise we can use error_mark_node. */
6983 obscure_complex_init (decl
, init
)
6986 if (! flag_no_inline
&& TREE_STATIC (decl
))
6988 if (extract_init (decl
, init
))
6992 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6993 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
6994 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
6998 DECL_INITIAL (decl
) = error_mark_node
;
7003 /* Finish processing of a declaration;
7004 install its line number and initial value.
7005 If the length of an array type is not known before,
7006 it must be determined now, from the initial value, or it is an error.
7008 Call `pop_obstacks' iff NEED_POP is nonzero.
7010 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7011 for aggregates that have constructors alive on the permanent obstack,
7012 so that the global initializing functions can be written at the end.
7014 INIT0 holds the value of an initializer that should be allowed to escape
7017 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7018 if the (init) syntax was used.
7020 For functions that take default parameters, DECL points to its
7021 "maximal" instantiation. `cp_finish_decl' must then also declared its
7022 subsequently lower and lower forms of instantiation, checking for
7023 ambiguity as it goes. This can be sped up later. */
7026 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7033 tree cleanup
= NULL_TREE
, ttype
= NULL_TREE
;
7035 int temporary
= allocation_temporary_p ();
7036 char *asmspec
= NULL
;
7037 int was_readonly
= 0;
7038 int already_used
= 0;
7040 /* If this is 0, then we did not change obstacks. */
7044 error ("assignment (not initialization) in declaration");
7048 /* If a name was specified, get the string. */
7050 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7052 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7054 cp_error ("Cannot initialize `%D' to namespace `%D'",
7059 if (TREE_CODE (decl
) == VAR_DECL
7060 && DECL_CONTEXT (decl
)
7061 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7062 && DECL_CONTEXT (decl
) != current_namespace
7065 /* Leave the namespace of the object. */
7066 pop_decl_namespace ();
7069 /* If the type of the thing we are declaring either has
7070 a constructor, or has a virtual function table pointer,
7071 AND its initialization was accepted by `start_decl',
7072 then we stayed on the permanent obstack through the
7073 declaration, otherwise, changed obstacks as GCC would. */
7075 type
= TREE_TYPE (decl
);
7077 if (type
== error_mark_node
)
7079 if (toplevel_bindings_p () && temporary
)
7080 end_temporary_allocation ();
7085 if (processing_template_decl
)
7087 if (init
&& DECL_INITIAL (decl
))
7088 DECL_INITIAL (decl
) = init
;
7089 if (minimal_parse_mode
&& ! DECL_ARTIFICIAL (decl
))
7091 tree stmt
= DECL_VINDEX (decl
);
7092 /* If the decl is declaring a member of a local class (in a
7093 template function), the DECL_VINDEX will either be NULL,
7094 or it will be an actual virtual function index, not a
7096 if (stmt
!= NULL_TREE
&& TREE_CODE (stmt
) == DECL_STMT
)
7098 DECL_VINDEX (decl
) = NULL_TREE
;
7099 TREE_OPERAND (stmt
, 2) = copy_to_permanent (init
);
7106 /* Take care of TYPE_DECLs up front. */
7107 if (TREE_CODE (decl
) == TYPE_DECL
)
7109 if (init
&& DECL_INITIAL (decl
))
7111 /* typedef foo = bar; store the type of bar as the type of foo. */
7112 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7113 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7115 if (type
!= error_mark_node
7116 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7118 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7119 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7120 set_identifier_type_value (DECL_NAME (decl
), type
);
7121 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7123 GNU_xref_decl (current_function_decl
, decl
);
7125 /* If we have installed this as the canonical typedef for this
7126 type, and that type has not been defined yet, delay emitting
7127 the debug information for it, as we will emit it later. */
7128 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7129 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7130 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7132 rest_of_decl_compilation (decl
, NULL_PTR
,
7133 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7136 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7138 ttype
= target_type (type
);
7141 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7142 && TYPE_NEEDS_CONSTRUCTING (type
))
7145 /* Currently, GNU C++ puts constants in text space, making them
7146 impossible to initialize. In the future, one would hope for
7147 an operating system which understood the difference between
7148 initialization and the running of a program. */
7150 TREE_READONLY (decl
) = 0;
7153 if (TREE_CODE (decl
) == FIELD_DECL
)
7155 if (init
&& init
!= error_mark_node
)
7156 my_friendly_assert (TREE_PERMANENT (init
), 147);
7160 /* This must override the asm specifier which was placed
7161 by grokclassfn. Lay this out fresh. */
7162 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7163 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7164 make_decl_rtl (decl
, asmspec
, 0);
7167 /* If `start_decl' didn't like having an initialization, ignore it now. */
7168 else if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7170 else if (DECL_EXTERNAL (decl
))
7172 else if (TREE_CODE (type
) == REFERENCE_TYPE
7173 || (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE_REFERENCE (type
)))
7175 if (TREE_STATIC (decl
))
7176 make_decl_rtl (decl
, NULL_PTR
,
7177 toplevel_bindings_p ()
7178 || pseudo_global_level_p ());
7179 grok_reference_init (decl
, type
, init
);
7183 GNU_xref_decl (current_function_decl
, decl
);
7185 if (TREE_CODE (decl
) == FIELD_DECL
)
7187 else if (TREE_CODE (decl
) == CONST_DECL
)
7189 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7191 DECL_INITIAL (decl
) = init
;
7193 /* This will keep us from needing to worry about our obstacks. */
7194 my_friendly_assert (init
!= NULL_TREE
, 149);
7199 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7201 if (TREE_CODE (type
) == ARRAY_TYPE
)
7202 init
= digest_init (type
, init
, (tree
*) 0);
7203 else if (TREE_CODE (init
) == CONSTRUCTOR
)
7205 if (TYPE_NON_AGGREGATE_CLASS (type
))
7207 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7209 init
= error_mark_node
;
7212 goto dont_use_constructor
;
7217 dont_use_constructor
:
7218 if (TREE_CODE (init
) != TREE_VEC
)
7219 init
= store_init_value (decl
, init
);
7223 /* We must hide the initializer so that expand_decl
7224 won't try to do something it does not understand. */
7225 init
= obscure_complex_init (decl
, init
);
7227 else if (DECL_EXTERNAL (decl
))
7229 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7230 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7233 while (TREE_CODE (ctype
) == ARRAY_TYPE
)
7234 ctype
= TREE_TYPE (ctype
);
7235 if (! TYPE_NEEDS_CONSTRUCTING (ctype
))
7237 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (ctype
))
7238 cp_error ("structure `%D' with uninitialized const members", decl
);
7239 if (CLASSTYPE_REF_FIELDS_NEED_INIT (ctype
))
7240 cp_error ("structure `%D' with uninitialized reference members",
7244 if (TREE_CODE (decl
) == VAR_DECL
7245 && !DECL_INITIAL (decl
)
7246 && !TYPE_NEEDS_CONSTRUCTING (type
)
7247 && (TYPE_READONLY (type
) || TREE_READONLY (decl
)))
7248 cp_error ("uninitialized const `%D'", decl
);
7250 if (TYPE_SIZE (type
) != NULL_TREE
7251 && TYPE_NEEDS_CONSTRUCTING (type
))
7252 init
= obscure_complex_init (decl
, NULL_TREE
);
7254 else if (TREE_CODE (decl
) == VAR_DECL
7255 && TREE_CODE (type
) != REFERENCE_TYPE
7256 && (TYPE_READONLY (type
) || TREE_READONLY (decl
)))
7258 /* ``Unless explicitly declared extern, a const object does not have
7259 external linkage and must be initialized. ($8.4; $12.1)'' ARM 7.1.6
7260 However, if it's `const int foo = 1; const int foo;', don't complain
7261 about the second decl, since it does have an initializer before.
7262 We deliberately don't complain about arrays, because they're
7263 supposed to be initialized by a constructor. */
7264 if (! DECL_INITIAL (decl
)
7265 && TREE_CODE (type
) != ARRAY_TYPE
7266 && (!pedantic
|| !current_class_type
))
7267 cp_error ("uninitialized const `%#D'", decl
);
7270 /* For top-level declaration, the initial value was read in
7271 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7272 must go in the permanent obstack; but don't discard the
7273 temporary data yet. */
7275 if (toplevel_bindings_p () && temporary
)
7276 end_temporary_allocation ();
7278 /* Deduce size of array from initialization, if not already known. */
7280 if (TREE_CODE (type
) == ARRAY_TYPE
7281 && TYPE_DOMAIN (type
) == NULL_TREE
7282 && TREE_CODE (decl
) != TYPE_DECL
)
7285 = (TREE_STATIC (decl
)
7286 /* Even if pedantic, an external linkage array
7287 may have incomplete type at first. */
7288 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7289 : !DECL_EXTERNAL (decl
));
7290 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7291 int failure
= complete_array_type (type
, initializer
, do_default
);
7294 cp_error ("initializer fails to determine size of `%D'", decl
);
7299 cp_error ("array size missing in `%D'", decl
);
7300 /* If a `static' var's size isn't known, make it extern as
7301 well as static, so it does not get allocated. If it's not
7302 `static', then don't mark it extern; finish_incomplete_decl
7303 will give it a default size and it will get allocated. */
7304 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7305 DECL_EXTERNAL (decl
) = 1;
7308 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7309 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7311 cp_error ("zero-size array `%D'", decl
);
7313 layout_decl (decl
, 0);
7316 if (TREE_CODE (decl
) == VAR_DECL
)
7318 if (DECL_SIZE (decl
) == NULL_TREE
7319 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7320 layout_decl (decl
, 0);
7322 if (TREE_STATIC (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7324 /* A static variable with an incomplete type:
7325 that is an error if it is initialized.
7326 Otherwise, let it through, but if it is not `extern'
7327 then it may cause an error message later. */
7328 if (DECL_INITIAL (decl
) != NULL_TREE
)
7329 cp_error ("storage size of `%D' isn't known", decl
);
7332 else if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7334 /* An automatic variable with an incomplete type: that is an error.
7335 Don't talk about array types here, since we took care of that
7336 message in grokdeclarator. */
7337 cp_error ("storage size of `%D' isn't known", decl
);
7338 TREE_TYPE (decl
) = error_mark_node
;
7340 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7341 /* Let debugger know it should output info for this type. */
7342 note_debug_info_needed (ttype
);
7344 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7345 note_debug_info_needed (DECL_CONTEXT (decl
));
7347 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7348 && DECL_SIZE (decl
) != NULL_TREE
7349 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7351 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7352 constant_expression_warning (DECL_SIZE (decl
));
7354 cp_error ("storage size of `%D' isn't constant", decl
);
7357 if (! DECL_EXTERNAL (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7358 /* Cleanups for static variables are handled by `finish_file'. */
7359 && ! TREE_STATIC (decl
))
7361 int yes
= suspend_momentary ();
7362 cleanup
= maybe_build_cleanup (decl
);
7363 resume_momentary (yes
);
7366 /* PARM_DECLs get cleanups, too. */
7367 else if (TREE_CODE (decl
) == PARM_DECL
&& TYPE_NEEDS_DESTRUCTOR (type
))
7370 end_temporary_allocation ();
7371 cleanup
= maybe_build_cleanup (decl
);
7373 resume_temporary_allocation ();
7376 /* Output the assembler code and/or RTL code for variables and functions,
7377 unless the type is an undefined structure or union.
7378 If not, it will get done when the type is completed. */
7380 was_incomplete
= (DECL_SIZE (decl
) == NULL_TREE
);
7382 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7383 || TREE_CODE (decl
) == RESULT_DECL
)
7385 /* ??? FIXME: What about nested classes? */
7386 int toplev
= toplevel_bindings_p () || pseudo_global_level_p ();
7388 = (TREE_STATIC (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7389 && allocation_temporary_p ());
7392 end_temporary_allocation ();
7394 /* Static data in a function with comdat linkage also has comdat
7396 if (TREE_CODE (decl
) == VAR_DECL
7397 && TREE_STATIC (decl
)
7398 /* Don't mess with __FUNCTION__. */
7399 && ! TREE_ASM_WRITTEN (decl
)
7400 && current_function_decl
7401 && DECL_CONTEXT (decl
) == current_function_decl
7402 && (DECL_THIS_INLINE (current_function_decl
)
7403 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7404 && TREE_PUBLIC (current_function_decl
))
7406 /* Rather than try to get this right with inlining, we suppress
7407 inlining of such functions. */
7408 current_function_cannot_inline
7409 = "function with static variable cannot be inline";
7411 /* If flag_weak, we don't need to mess with this, as we can just
7412 make the function weak, and let it refer to its unique local
7413 copy. This works because we don't allow the function to be
7417 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7419 TREE_PUBLIC (decl
) = 1;
7420 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7422 else if (DECL_INITIAL (decl
) == NULL_TREE
7423 || DECL_INITIAL (decl
) == error_mark_node
)
7425 TREE_PUBLIC (decl
) = 1;
7426 DECL_COMMON (decl
) = 1;
7428 /* else we lose. We can only do this if we can use common,
7429 which we can't if it has been initialized. */
7431 if (TREE_PUBLIC (decl
))
7432 DECL_ASSEMBLER_NAME (decl
)
7433 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7434 else if (! DECL_ARTIFICIAL (decl
))
7436 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7437 cp_warning_at (" you can work around this by removing the initializer"), decl
;
7442 else if (TREE_CODE (decl
) == VAR_DECL
7443 && DECL_LANG_SPECIFIC (decl
)
7444 && DECL_COMDAT (decl
))
7446 /* Dynamically initialized vars go into common. */
7447 if (DECL_INITIAL (decl
) == NULL_TREE
7448 || DECL_INITIAL (decl
) == error_mark_node
)
7449 DECL_COMMON (decl
) = 1;
7450 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7452 DECL_COMMON (decl
) = 1;
7453 DECL_INITIAL (decl
) = error_mark_node
;
7457 /* Statically initialized vars are weak or comdat, if
7460 make_decl_one_only (decl
);
7463 /* We can't do anything useful; leave vars for explicit
7465 DECL_EXTERNAL (decl
) = 1;
7466 DECL_NOT_REALLY_EXTERN (decl
) = 0;
7471 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7472 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7473 else if (TREE_CODE (decl
) == VAR_DECL
7474 && TREE_READONLY (decl
)
7475 && DECL_INITIAL (decl
) != NULL_TREE
7476 && DECL_INITIAL (decl
) != error_mark_node
7477 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7479 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7482 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7485 && TREE_STATIC (decl
)
7486 && ! TREE_SIDE_EFFECTS (decl
)
7487 && ! TREE_PUBLIC (decl
)
7488 && ! DECL_EXTERNAL (decl
)
7489 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7490 && DECL_MODE (decl
) != BLKmode
)
7492 /* If this variable is really a constant, then fill its DECL_RTL
7493 slot with something which won't take up storage.
7494 If something later should take its address, we can always give
7495 it legitimate RTL at that time. */
7496 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7497 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7498 TREE_ASM_WRITTEN (decl
) = 1;
7500 else if (toplev
&& ! TREE_PUBLIC (decl
))
7502 /* If this is a static const, change its apparent linkage
7503 if it belongs to a #pragma interface. */
7504 if (!interface_unknown
)
7506 TREE_PUBLIC (decl
) = 1;
7507 DECL_EXTERNAL (decl
) = interface_only
;
7509 make_decl_rtl (decl
, asmspec
, toplev
);
7512 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7514 else if (TREE_CODE (decl
) == VAR_DECL
7515 && DECL_LANG_SPECIFIC (decl
)
7516 && DECL_IN_AGGR_P (decl
))
7518 if (TREE_STATIC (decl
))
7520 if (init
== NULL_TREE
7521 #ifdef DEFAULT_STATIC_DEFS
7522 /* If this code is dead, then users must
7523 explicitly declare static member variables
7524 outside the class def'n as well. */
7525 && TYPE_NEEDS_CONSTRUCTING (type
)
7529 DECL_EXTERNAL (decl
) = 1;
7530 make_decl_rtl (decl
, asmspec
, 1);
7533 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7536 /* Just a constant field. Should not need any rtl. */
7540 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7543 resume_temporary_allocation ();
7545 if (type
!= error_mark_node
7546 && TYPE_LANG_SPECIFIC (type
)
7547 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
7548 abstract_virtuals_error (decl
, type
);
7549 else if ((TREE_CODE (type
) == FUNCTION_TYPE
7550 || TREE_CODE (type
) == METHOD_TYPE
)
7551 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
7552 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (type
)))
7553 abstract_virtuals_error (decl
, TREE_TYPE (type
));
7555 if (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE (type
))
7556 signature_error (decl
, type
);
7557 else if ((TREE_CODE (type
) == FUNCTION_TYPE
7558 || TREE_CODE (type
) == METHOD_TYPE
)
7559 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
7560 && IS_SIGNATURE (TREE_TYPE (type
)))
7561 signature_error (decl
, TREE_TYPE (type
));
7563 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7565 else if (DECL_EXTERNAL (decl
)
7566 && ! (DECL_LANG_SPECIFIC (decl
)
7567 && DECL_NOT_REALLY_EXTERN (decl
)))
7570 DECL_INITIAL (decl
) = init
;
7572 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7574 /* Cleanups for static variables are handled by `finish_file'. */
7575 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7576 || TYPE_NEEDS_DESTRUCTOR (type
))
7577 expand_static_init (decl
, init
);
7581 /* This is a declared decl which must live until the
7582 end of the binding contour. It may need a cleanup. */
7584 /* Recompute the RTL of a local array now
7585 if it used to be an incomplete type. */
7586 if (was_incomplete
&& ! TREE_STATIC (decl
))
7588 /* If we used it already as memory, it must stay in memory. */
7589 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7590 /* If it's still incomplete now, no init will save it. */
7591 if (DECL_SIZE (decl
) == NULL_TREE
)
7592 DECL_INITIAL (decl
) = NULL_TREE
;
7595 else if (! TREE_ASM_WRITTEN (decl
)
7596 && (TYPE_SIZE (type
) != NULL_TREE
7597 || TREE_CODE (type
) == ARRAY_TYPE
))
7599 /* Do this here, because we did not expand this decl's
7600 rtl in start_decl. */
7601 if (DECL_RTL (decl
) == NULL_RTX
)
7605 /* XXX: Why don't we use decl here? */
7606 /* Ans: Because it was already expanded? */
7607 if (! expand_decl_cleanup (NULL_TREE
, cleanup
))
7608 cp_error ("parser lost in parsing declaration of `%D'",
7610 /* Cleanup used up here. */
7611 cleanup
= NULL_TREE
;
7615 if (current_binding_level
->is_for_scope
)
7617 struct binding_level
*outer
= current_binding_level
->level_chain
;
7619 /* Check to see if the same name is already bound at
7620 the outer level, either because it was directly declared,
7621 or because a dead for-decl got preserved. In either case,
7622 the code would not have been valid under the ARM
7623 scope rules, so clear is_for_scope for the
7624 current_binding_level.
7626 Otherwise, we need to preserve the temp slot for decl
7627 to last into the outer binding level. */
7629 int handling_dead_for_vars
= 0;
7630 tree link
= outer
->names
;
7631 for (; ; link
= TREE_CHAIN (link
))
7633 if (link
== NULL
&& handling_dead_for_vars
== 0)
7635 link
= outer
->dead_vars_from_for
;
7636 handling_dead_for_vars
= 1;
7640 if (DECL_IN_MEMORY_P (decl
))
7641 preserve_temp_slots (DECL_RTL (decl
));
7644 if (DECL_NAME (link
) == DECL_NAME (decl
))
7646 if (handling_dead_for_vars
)
7649 = purpose_member (DECL_NAME (decl
),
7650 current_binding_level
->shadowed
);
7651 if (shadowing
&& TREE_VALUE (shadowing
) == link
)
7652 TREE_VALUE (shadowing
)
7653 = DECL_SHADOWED_FOR_VAR (link
);
7655 current_binding_level
->is_for_scope
= 0;
7661 expand_start_target_temps ();
7663 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7665 /* Compute and store the initial value. */
7666 expand_decl_init (decl
);
7667 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7669 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7671 emit_line_note (DECL_SOURCE_FILE (decl
),
7672 DECL_SOURCE_LINE (decl
));
7673 expand_aggr_init (decl
, init
, flags
);
7676 /* Set this to 0 so we can tell whether an aggregate which
7677 was initialized was ever used. Don't do this if it has a
7678 destructor, so we don't complain about the 'resource
7679 allocation is initialization' idiom. */
7680 /* Now set attribute((unused)) on types so decls of
7681 that type will be marked used. (see TREE_USED, above.)
7682 This avoids the warning problems this particular code
7683 tried to work around. */
7685 if (TYPE_NEEDS_CONSTRUCTING (type
)
7687 && cleanup
== NULL_TREE
7688 && DECL_NAME (decl
))
7689 TREE_USED (decl
) = 0;
7692 TREE_USED (decl
) = 1;
7695 /* Cleanup any temporaries needed for the initial value. */
7696 expand_end_target_temps ();
7698 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7700 /* Store the cleanup, if there was one. */
7703 if (! expand_decl_cleanup (decl
, cleanup
))
7704 cp_error ("parser lost in parsing declaration of `%D'",
7711 /* Undo call to `pushclass' that was done in `start_decl'
7712 due to initialization of qualified member variable.
7713 I.e., Foo::x = 10; */
7715 tree context
= DECL_REAL_CONTEXT (decl
);
7717 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7718 && (TREE_CODE (decl
) == VAR_DECL
7719 /* We also have a pushclass done that we need to undo here
7720 if we're at top level and declare a method. */
7721 || TREE_CODE (decl
) == FUNCTION_DECL
)
7722 /* If size hasn't been set, we're still defining it,
7723 and therefore inside the class body; don't pop
7724 the binding level.. */
7725 && TYPE_SIZE (context
) != NULL_TREE
7726 && context
== current_class_type
)
7733 /* If requested, warn about definitions of large data objects. */
7735 if (warn_larger_than
7736 && ! processing_template_decl
7737 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7738 && !DECL_EXTERNAL (decl
))
7740 register tree decl_size
= DECL_SIZE (decl
);
7742 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7744 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7746 if (units
> larger_than_size
)
7747 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7753 /* Resume permanent allocation, if not within a function. */
7754 /* The corresponding push_obstacks_nochange is in start_decl,
7755 start_method, groktypename, and in grokfield. */
7760 TREE_READONLY (decl
) = 1;
7763 /* This is here for a midend callback from c-common.c */
7766 finish_decl (decl
, init
, asmspec_tree
)
7770 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7774 expand_static_init (decl
, init
)
7778 tree oldstatic
= value_member (decl
, static_aggregates
);
7782 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7783 cp_error ("multiple initializations given for `%D'", decl
);
7785 else if (! toplevel_bindings_p () && ! pseudo_global_level_p ())
7787 /* Emit code to perform this initialization but once. */
7790 /* Remember this information until end of file. */
7791 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7793 /* Emit code to perform this initialization but once. */
7794 temp
= get_temp_name (integer_type_node
, 1);
7795 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
7796 expand_start_cond (build_binary_op (EQ_EXPR
, temp
,
7797 integer_zero_node
, 1), 0);
7798 expand_start_target_temps ();
7800 expand_assignment (temp
, integer_one_node
, 0, 0);
7801 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
7802 || (init
&& TREE_CODE (init
) == TREE_LIST
))
7804 expand_aggr_init (decl
, init
, 0);
7805 do_pending_stack_adjust ();
7808 expand_assignment (decl
, init
, 0, 0);
7810 /* Cleanup any temporaries needed for the initial value. */
7811 expand_end_target_temps ();
7813 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7815 tree cleanup
, fcall
;
7816 static tree Atexit
= 0;
7819 tree atexit_fndecl
, PFV
, pfvlist
;
7820 /* Remember this information until end of file. */
7821 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7822 PFV
= build_pointer_type (build_function_type
7823 (void_type_node
, void_list_node
));
7825 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7827 push_lang_context (lang_name_c
);
7829 = builtin_function ("atexit",
7830 build_function_type (void_type_node
,
7832 NOT_BUILT_IN
, NULL_PTR
);
7833 assemble_external (atexit_fndecl
);
7834 Atexit
= default_conversion (atexit_fndecl
);
7835 pop_lang_context ();
7839 /* Call build_cleanup before we enter the anonymous function
7840 so that any access checks will be done relative to the
7841 current scope, rather than the scope of the anonymous
7843 fcall
= build_cleanup (decl
);
7844 cleanup
= start_anon_func ();
7845 expand_expr_stmt (fcall
);
7847 mark_addressable (cleanup
);
7848 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7849 fcall
= build_function_call (Atexit
, expr_tree_cons (NULL_TREE
, cleanup
, NULL_TREE
));
7850 expand_expr_stmt (fcall
);
7854 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7856 static_aggregates
= perm_tree_cons (temp
, decl
, static_aggregates
);
7857 TREE_STATIC (static_aggregates
) = 1;
7860 /* Resume old (possibly temporary) allocation. */
7865 /* This code takes into account memory allocation
7866 policy of `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING
7867 does not hold for this object, then we must make permanent
7868 the storage currently in the temporary obstack. */
7869 if (! TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
7870 preserve_initializer ();
7871 static_aggregates
= perm_tree_cons (init
, decl
, static_aggregates
);
7875 /* Make TYPE a complete type based on INITIAL_VALUE.
7876 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
7877 2 if there was no information (in which case assume 1 if DO_DEFAULT). */
7880 complete_array_type (type
, initial_value
, do_default
)
7881 tree type
, initial_value
;
7884 register tree maxindex
= NULL_TREE
;
7889 /* Note MAXINDEX is really the maximum index,
7890 one less than the size. */
7891 if (TREE_CODE (initial_value
) == STRING_CST
)
7894 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
7895 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
7898 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
7900 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
7901 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
7902 for (; elts
; elts
= TREE_CHAIN (elts
))
7904 if (TREE_PURPOSE (elts
))
7905 maxindex
= TREE_PURPOSE (elts
);
7907 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
7909 maxindex
= copy_node (maxindex
);
7913 /* Make an error message unless that happened already. */
7914 if (initial_value
!= error_mark_node
)
7917 /* Prevent further error messages. */
7918 maxindex
= build_int_2 (0, 0);
7925 maxindex
= build_int_2 (0, 0);
7933 TYPE_DOMAIN (type
) = build_index_type (maxindex
);
7934 if (! TREE_TYPE (maxindex
))
7935 TREE_TYPE (maxindex
) = TYPE_DOMAIN (type
);
7937 itype
= TREE_TYPE (initial_value
);
7940 if (itype
&& !TYPE_DOMAIN (itype
))
7941 TYPE_DOMAIN (itype
) = TYPE_DOMAIN (type
);
7942 /* The type of the main variant should never be used for arrays
7943 of different sizes. It should only ever be completed with the
7944 size of the array. */
7945 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
7946 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = TYPE_DOMAIN (type
);
7949 /* Lay out the type now that we can get the real answer. */
7956 /* Return zero if something is declared to be a member of type
7957 CTYPE when in the context of CUR_TYPE. STRING is the error
7958 message to print in that case. Otherwise, quietly return 1. */
7961 member_function_or_else (ctype
, cur_type
, string
)
7962 tree ctype
, cur_type
;
7965 if (ctype
&& ctype
!= cur_type
)
7967 error (string
, TYPE_NAME_STRING (ctype
));
7973 /* Subroutine of `grokdeclarator'. */
7975 /* Generate errors possibly applicable for a given set of specifiers.
7976 This is for ARM $7.1.2. */
7979 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
7982 int virtualp
, quals
, friendp
, raises
, inlinep
;
7985 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
7987 cp_error ("`%D' declared as an `inline' %s", object
, type
);
7989 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
7992 cp_error_at ("invalid friend declaration", object
);
7994 cp_error_at ("invalid exception specifications", object
);
7997 /* CTYPE is class type, or null if non-class.
7998 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8000 DECLARATOR is the function's name.
8001 VIRTUALP is truthvalue of whether the function is virtual or not.
8002 FLAGS are to be passed through to `grokclassfn'.
8003 QUALS are qualifiers indicating whether the function is `const'
8005 RAISES is a list of exceptions that this function can raise.
8006 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8007 not look, and -1 if we should not call `grokclassfn' at all.
8009 Returns `error_mark_node' if something goes wrong, after issuing
8010 applicable error messages. */
8013 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8014 raises
, attrlist
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8015 template_count
, in_namespace
)
8018 tree orig_declarator
;
8020 enum overload_flags flags
;
8021 tree quals
, raises
, attrlist
;
8022 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8026 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8030 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8031 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8037 type
= build_exception_variant (type
, raises
);
8040 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8041 /* Propagate volatile out from type to decl. */
8042 if (TYPE_VOLATILE (type
))
8043 TREE_THIS_VOLATILE (decl
) = 1;
8045 /* If this decl has namespace scope, set that up. */
8047 set_decl_namespace (decl
, in_namespace
);
8048 else if (publicp
&& ! ctype
)
8049 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8051 /* `main' and builtins have implicit 'C' linkage. */
8052 if ((MAIN_NAME_P (declarator
)
8053 || (IDENTIFIER_LENGTH (declarator
) > 10
8054 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8055 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8056 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8057 && current_lang_name
== lang_name_cplusplus
8058 && ctype
== NULL_TREE
8059 /* NULL_TREE means global namespace. */
8060 && DECL_CONTEXT (decl
) == NULL_TREE
)
8061 DECL_LANGUAGE (decl
) = lang_c
;
8063 /* Should probably propagate const out from type to decl I bet (mrs). */
8066 DECL_STATIC_FUNCTION_P (decl
) = 1;
8067 DECL_CONTEXT (decl
) = ctype
;
8071 DECL_CLASS_CONTEXT (decl
) = ctype
;
8073 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8076 error ("cannot declare `main' to be inline");
8078 error ("cannot declare `main' to be static");
8083 /* Members of anonymous types have no linkage; make them internal. */
8084 if (ctype
&& ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
)))
8089 /* [basic.link]: A name with no linkage (notably, the name of a class
8090 or enumeration declared in a local scope) shall not be used to
8091 declare an entity with linkage.
8093 Only check this for public decls for now. */
8094 t
= no_linkage_check (TREE_TYPE (decl
));
8097 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8099 if (DECL_LANGUAGE (decl
) == lang_c
)
8100 /* Allow this; it's pretty common in C. */;
8102 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8106 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8111 TREE_PUBLIC (decl
) = publicp
;
8114 DECL_INTERFACE_KNOWN (decl
) = 1;
8115 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8119 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8121 DECL_EXTERNAL (decl
) = 1;
8122 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8124 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8125 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8129 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8130 grok_op_properties (decl
, virtualp
, check
< 0);
8132 if (ctype
&& hack_decl_function_context (decl
))
8133 DECL_NO_STATIC_CHAIN (decl
) = 1;
8135 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8136 if (TREE_PURPOSE (t
)
8137 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8139 add_defarg_fn (decl
);
8144 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8148 ("defining explicit specialization `%D' in friend declaration",
8152 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8154 /* Something like `template <class T> friend void f<T>()'. */
8155 cp_error ("template-id `%D' in declaration of primary template",
8157 return error_mark_node
;
8160 /* A friend declaration of the form friend void f<>(). Record
8161 the information in the TEMPLATE_ID_EXPR. */
8162 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8163 DECL_TEMPLATE_INFO (decl
)
8164 = perm_tree_cons (TREE_OPERAND (orig_declarator
, 0),
8165 TREE_OPERAND (orig_declarator
, 1),
8170 /* Plain overloading: will not be grok'd by grokclassfn. */
8171 if (! ctype
&& ! processing_template_decl
8172 && DECL_LANGUAGE (decl
) != lang_c
8173 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8174 set_mangled_name_for_decl (decl
);
8176 /* Caller will do the rest of this. */
8180 if (check
&& funcdef_flag
)
8181 DECL_INITIAL (decl
) = error_mark_node
;
8183 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8186 /* Just handle constructors here. We could do this
8187 inside the following if stmt, but I think
8188 that the code is more legible by breaking this
8189 case out. See comments below for what each of
8190 the following calls is supposed to do. */
8191 DECL_CONSTRUCTOR_P (decl
) = 1;
8193 grokclassfn (ctype
, decl
, flags
, quals
);
8195 decl
= check_explicit_specialization (orig_declarator
, decl
,
8197 2 * (funcdef_flag
!= 0) +
8198 4 * (friendp
!= 0));
8199 if (decl
== error_mark_node
)
8200 return error_mark_node
;
8202 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8205 tmp
= check_classfn (ctype
, decl
);
8207 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8208 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8210 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8211 cp_error ("definition of implicitly-declared `%D'", tmp
);
8212 if (tmp
&& duplicate_decls (decl
, tmp
))
8215 if (! grok_ctor_properties (ctype
, decl
))
8216 return error_mark_node
;
8222 /* Function gets the ugly name, field gets the nice one.
8223 This call may change the type of the function (because
8224 of default parameters)! */
8225 if (ctype
!= NULL_TREE
)
8226 grokclassfn (ctype
, decl
, flags
, quals
);
8228 decl
= check_explicit_specialization (orig_declarator
, decl
,
8230 2 * (funcdef_flag
!= 0) +
8231 4 * (friendp
!= 0));
8232 if (decl
== error_mark_node
)
8233 return error_mark_node
;
8235 if (ctype
!= NULL_TREE
8236 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8239 tmp
= check_classfn (ctype
, decl
);
8241 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8242 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8244 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8245 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8247 /* Remove the `this' parm added by grokclassfn.
8248 XXX Isn't this done in start_function, too? */
8249 revert_static_member_fn (&decl
, NULL
, NULL
);
8250 last_function_parms
= TREE_CHAIN (last_function_parms
);
8252 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8253 cp_error ("definition of implicitly-declared `%D'", tmp
);
8256 if (!duplicate_decls (decl
, tmp
))
8257 my_friendly_abort (892);
8262 if (ctype
== NULL_TREE
|| check
)
8266 cplus_decl_attributes (decl
, TREE_PURPOSE (attrlist
),
8267 TREE_VALUE (attrlist
));
8268 make_decl_rtl (decl
, NULL_PTR
, 1);
8272 DECL_VIRTUAL_P (decl
) = 1;
8273 if (DECL_VINDEX (decl
) == NULL_TREE
)
8274 DECL_VINDEX (decl
) = error_mark_node
;
8275 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8282 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8285 RID_BIT_TYPE
*specbits_in
;
8291 RID_BIT_TYPE specbits
;
8293 specbits
= *specbits_in
;
8295 if (TREE_CODE (type
) == OFFSET_TYPE
)
8297 /* If you declare a static member so that it
8298 can be initialized, the code will reach here. */
8299 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8300 type
= TREE_TYPE (type
);
8301 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
8302 DECL_CONTEXT (decl
) = basetype
;
8303 DECL_CLASS_CONTEXT (decl
) = basetype
;
8304 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8311 context
= in_namespace
;
8312 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8313 context
= current_namespace
;
8315 decl
= build_decl (VAR_DECL
, declarator
, complete_type (type
));
8318 set_decl_namespace (decl
, context
);
8320 context
= DECL_CONTEXT (decl
);
8321 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8322 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8326 set_decl_namespace (decl
, in_namespace
);
8328 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8330 DECL_THIS_EXTERN (decl
) = 1;
8331 DECL_EXTERNAL (decl
) = !initialized
;
8334 /* In class context, static means one per class,
8335 public access, and static storage. */
8336 if (DECL_CLASS_SCOPE_P (decl
))
8338 TREE_PUBLIC (decl
) = 1;
8339 TREE_STATIC (decl
) = 1;
8340 DECL_EXTERNAL (decl
) = 0;
8342 /* At top level, either `static' or no s.c. makes a definition
8343 (perhaps tentative), and absence of `static' makes it public. */
8344 else if (toplevel_bindings_p ())
8346 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8347 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8348 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8350 /* Not at top level, only `static' makes a static definition. */
8353 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8354 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8357 if (TREE_PUBLIC (decl
))
8359 /* [basic.link]: A name with no linkage (notably, the name of a class
8360 or enumeration declared in a local scope) shall not be used to
8361 declare an entity with linkage.
8363 Only check this for public decls for now. */
8364 tree t
= no_linkage_check (TREE_TYPE (decl
));
8367 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8368 /* Ignore for now; `enum { foo } e' is pretty common. */;
8370 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8378 /* Create a canonical pointer to member function type. */
8381 build_ptrmemfunc_type (type
)
8388 /* If a canonical type already exists for this type, use it. We use
8389 this method instead of type_hash_canon, because it only does a
8390 simple equality check on the list of field members. */
8392 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8395 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8397 u
= make_lang_type (UNION_TYPE
);
8398 IS_AGGR_TYPE (u
) = 0;
8399 fields
[0] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
, type
);
8400 fields
[1] = build_lang_field_decl (FIELD_DECL
, delta2_identifier
,
8402 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8403 TYPE_NAME (u
) = NULL_TREE
;
8405 t
= make_lang_type (RECORD_TYPE
);
8407 /* Let the front-end know this is a pointer to member function... */
8408 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8409 /* ... and not really an aggregate. */
8410 IS_AGGR_TYPE (t
) = 0;
8412 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
8414 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
8416 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8417 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8421 /* Zap out the name so that the back-end will give us the debugging
8422 information for this anonymous RECORD_TYPE. */
8423 TYPE_NAME (t
) = NULL_TREE
;
8425 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8427 /* Seems to be wanted. */
8428 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8432 /* Given declspecs and a declarator,
8433 determine the name and type of the object declared
8434 and construct a ..._DECL node for it.
8435 (In one case we can return a ..._TYPE node instead.
8436 For invalid input we sometimes return 0.)
8438 DECLSPECS is a chain of tree_list nodes whose value fields
8439 are the storage classes and type specifiers.
8441 DECL_CONTEXT says which syntactic context this declaration is in:
8442 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8443 FUNCDEF for a function definition. Like NORMAL but a few different
8444 error messages in each case. Return value may be zero meaning
8445 this definition is too screwy to try to parse.
8446 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8447 handle member functions (which have FIELD context).
8448 Return value may be zero meaning this definition is too screwy to
8450 PARM for a parameter declaration (either within a function prototype
8451 or before a function body). Make a PARM_DECL, or return void_type_node.
8452 CATCHPARM for a parameter declaration before a catch clause.
8453 TYPENAME if for a typename (in a cast or sizeof).
8454 Don't make a DECL node; just return the ..._TYPE node.
8455 FIELD for a struct or union field; make a FIELD_DECL.
8456 BITFIELD for a field with specified width.
8457 INITIALIZED is 1 if the decl has an initializer.
8459 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8460 It may also be so in the PARM case, for a prototype where the
8461 argument type is specified but not the name.
8463 This function is where the complicated C meanings of `static'
8464 and `extern' are interpreted.
8466 For C++, if there is any monkey business to do, the function which
8467 calls this one must do it, i.e., prepending instance variables,
8468 renaming overloaded function names, etc.
8470 Note that for this C++, it is an error to define a method within a class
8471 which does not belong to that class.
8473 Except in the case where SCOPE_REFs are implicitly known (such as
8474 methods within a class being redundantly qualified),
8475 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8476 (class_name::decl_name). The caller must also deal with this.
8478 If a constructor or destructor is seen, and the context is FIELD,
8479 then the type gains the attribute TREE_HAS_x. If such a declaration
8480 is erroneous, NULL_TREE is returned.
8482 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8483 function, these are the qualifiers to give to the `this' pointer.
8485 May return void_type_node if the declarator turned out to be a friend.
8486 See grokfield for details. */
8488 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8491 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8494 enum decl_context decl_context
;
8498 RID_BIT_TYPE specbits
;
8501 tree type
= NULL_TREE
;
8505 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8506 int explicit_int
= 0;
8507 int explicit_char
= 0;
8508 int defaulted_int
= 0;
8509 int opaque_typedef
= 0;
8510 tree typedef_decl
= NULL_TREE
;
8512 tree typedef_type
= NULL_TREE
;
8513 int funcdef_flag
= 0;
8514 enum tree_code innermost_code
= ERROR_MARK
;
8517 /* See the code below that used this. */
8518 tree decl_machine_attr
= NULL_TREE
;
8520 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8521 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8522 tree init
= NULL_TREE
;
8524 /* Keep track of what sort of function is being processed
8525 so that we can warn about default return values, or explicit
8526 return values which do not match prescribed defaults. */
8527 enum return_types return_type
= return_normal
;
8529 tree dname
= NULL_TREE
;
8530 tree ctype
= current_class_type
;
8531 tree ctor_return_type
= NULL_TREE
;
8532 enum overload_flags flags
= NO_SPECIAL
;
8533 tree quals
= NULL_TREE
;
8534 tree raises
= NULL_TREE
;
8535 int template_count
= 0;
8536 tree in_namespace
= NULL_TREE
;
8538 RIDBIT_RESET_ALL (specbits
);
8539 if (decl_context
== FUNCDEF
)
8540 funcdef_flag
= 1, decl_context
= NORMAL
;
8541 else if (decl_context
== MEMFUNCDEF
)
8542 funcdef_flag
= -1, decl_context
= FIELD
;
8543 else if (decl_context
== BITFIELD
)
8544 bitfield
= 1, decl_context
= FIELD
;
8546 /* Look inside a declarator for the name being declared
8547 and get it as a string, for an error message. */
8549 tree
*next
= &declarator
;
8553 while (next
&& *next
)
8556 switch (TREE_CODE (decl
))
8559 /* For attributes. */
8560 next
= &TREE_VALUE (decl
);
8565 next
= &TREE_OPERAND (decl
, 0);
8568 case BIT_NOT_EXPR
: /* For C++ destructors! */
8570 tree name
= TREE_OPERAND (decl
, 0);
8571 tree rename
= NULL_TREE
;
8573 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8575 return_type
= return_dtor
;
8576 if (TREE_CODE (name
) == TYPE_DECL
)
8577 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8578 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8579 if (ctype
== NULL_TREE
)
8581 if (current_class_type
== NULL_TREE
)
8583 error ("destructors must be member functions");
8588 tree t
= constructor_name (current_class_name
);
8595 tree t
= constructor_name (ctype
);
8602 cp_error ("destructor `%T' must match class name `%T'",
8604 TREE_OPERAND (decl
, 0) = rename
;
8610 case ADDR_EXPR
: /* C++ reference declaration */
8615 innermost_code
= TREE_CODE (decl
);
8616 next
= &TREE_OPERAND (decl
, 0);
8620 if (parmlist_is_exprlist (TREE_OPERAND (decl
, 1)))
8622 /* This is actually a variable declaration using constructor
8623 syntax. We need to call start_decl and cp_finish_decl so we
8624 can get the variable initialized... */
8626 *next
= TREE_OPERAND (decl
, 0);
8627 init
= TREE_OPERAND (decl
, 1);
8629 decl
= start_decl (declarator
, declspecs
, 1, NULL_TREE
, NULL_TREE
);
8630 /* Look for __unused__ attribute */
8631 if (TREE_USED (TREE_TYPE (decl
)))
8632 TREE_USED (decl
) = 1;
8633 finish_decl (decl
, init
, NULL_TREE
);
8636 innermost_code
= TREE_CODE (decl
);
8637 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8638 ctype
= current_class_type
;
8640 && TREE_OPERAND (decl
, 0)
8641 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
8642 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
8643 == constructor_name_full (ctype
))
8644 || (DECL_NAME (TREE_OPERAND (decl
, 0))
8645 == constructor_name (ctype
)))))
8646 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8647 next
= &TREE_OPERAND (decl
, 0);
8649 if (ctype
!= NULL_TREE
8650 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
8651 && decl
== constructor_name (ctype
))
8653 return_type
= return_ctor
;
8654 ctor_return_type
= ctype
;
8659 case TEMPLATE_ID_EXPR
:
8661 tree fns
= TREE_OPERAND (decl
, 0);
8663 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
8664 fns
= TREE_OPERAND (fns
, 0);
8666 if (TREE_CODE (fns
) == IDENTIFIER_NODE
)
8668 else if (is_overloaded_fn (fns
))
8669 dname
= DECL_NAME (get_first_fn (fns
));
8671 my_friendly_abort (0);
8675 case IDENTIFIER_NODE
:
8676 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
8683 cp_error ("declarator-id missing; using reserved word `%D'",
8685 name
= IDENTIFIER_POINTER (dname
);
8687 if (! IDENTIFIER_OPNAME_P (dname
)
8688 /* GNU/Linux headers use '__op'. Arrgh. */
8689 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
8690 name
= IDENTIFIER_POINTER (dname
);
8693 if (IDENTIFIER_TYPENAME_P (dname
))
8695 my_friendly_assert (flags
== NO_SPECIAL
, 154);
8696 flags
= TYPENAME_FLAG
;
8697 ctor_return_type
= TREE_TYPE (dname
);
8698 return_type
= return_conversion
;
8700 name
= operator_name_string (dname
);
8707 /* Perform error checking, and decide on a ctype. */
8708 tree cname
= TREE_OPERAND (decl
, 0);
8709 if (cname
== NULL_TREE
)
8711 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
8714 in_namespace
= TREE_OPERAND (decl
, 0);
8715 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8717 else if (! is_aggr_type (cname
, 1))
8718 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8719 /* Must test TREE_OPERAND (decl, 1), in case user gives
8720 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
8721 else if (TREE_OPERAND (decl
, 1)
8722 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
8724 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
8725 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
8727 cp_error ("`%T::%D' is not a valid declarator", cname
,
8728 TREE_OPERAND (decl
, 1));
8729 cp_error (" perhaps you want `typename %T::%D' to make it a type",
8730 cname
, TREE_OPERAND (decl
, 1));
8731 return void_type_node
;
8733 else if (ctype
== NULL_TREE
)
8735 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
8736 TREE_OPERAND (decl
, 0) = ctype
;
8739 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
8741 cp_error ("type `%T' is not derived from type `%T'",
8743 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8749 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
8750 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
8751 == constructor_name_full (ctype
))
8752 || (DECL_NAME (TREE_OPERAND (decl
, 1))
8753 == constructor_name (ctype
))))
8754 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
8755 next
= &TREE_OPERAND (decl
, 1);
8759 if (TREE_CODE (decl
) == IDENTIFIER_NODE
8760 && constructor_name (ctype
) == decl
)
8762 return_type
= return_ctor
;
8763 ctor_return_type
= ctype
;
8765 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
8766 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
8767 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
8768 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
8770 return_type
= return_dtor
;
8771 ctor_return_type
= ctype
;
8773 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8774 next
= &TREE_OPERAND (decl
, 0);
8785 /* Parse error puts this typespec where
8786 a declarator should go. */
8787 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
8788 if (TREE_TYPE (decl
) == current_class_type
)
8789 cp_error (" perhaps you want `%T' for a constructor",
8790 current_class_name
);
8791 dname
= DECL_NAME (decl
);
8792 name
= IDENTIFIER_POINTER (dname
);
8794 /* Avoid giving two errors for this. */
8795 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
8797 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
8804 cp_compiler_error ("`%D' as declarator", decl
);
8805 return 0; /* We used to do a 155 abort here. */
8812 /* A function definition's declarator must have the form of
8813 a function declarator. */
8815 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
8818 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
8819 && innermost_code
!= CALL_EXPR
8820 && ! (ctype
&& declspecs
== NULL_TREE
))
8822 cp_error ("declaration of `%D' as non-function", dname
);
8823 return void_type_node
;
8826 /* Anything declared one level down from the top level
8827 must be one of the parameters of a function
8828 (because the body is at least two levels down). */
8830 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
8831 by not allowing C++ class definitions to specify their parameters
8832 with xdecls (must be spec.d in the parmlist).
8834 Since we now wait to push a class scope until we are sure that
8835 we are in a legitimate method context, we must set oldcname
8836 explicitly (since current_class_name is not yet alive).
8838 We also want to avoid calling this a PARM if it is in a namespace. */
8840 if (decl_context
== NORMAL
&& ! namespace_bindings_p ()
8841 && ! pseudo_global_level_p ())
8843 struct binding_level
*b
= current_binding_level
;
8844 current_binding_level
= b
->level_chain
;
8845 if (current_binding_level
!= 0 && toplevel_bindings_p ())
8846 decl_context
= PARM
;
8847 current_binding_level
= b
;
8850 /* Look through the decl specs and record which ones appear.
8851 Some typespecs are defined as built-in typenames.
8852 Others, the ones that are modifiers of other types,
8853 are represented by bits in SPECBITS: set the bits for
8854 the modifiers that appear. Storage class keywords are also in SPECBITS.
8856 If there is a typedef name or a type, store the type in TYPE.
8857 This includes builtin typedefs such as `int'.
8859 Set EXPLICIT_INT if the type is `int' or `char' and did not
8860 come from a user typedef.
8862 Set LONGLONG if `long' is mentioned twice.
8864 For C++, constructors and destructors have their own fast treatment. */
8866 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
8871 /* Certain parse errors slip through. For example,
8872 `int class;' is not caught by the parser. Try
8873 weakly to recover here. */
8874 if (TREE_CODE (spec
) != TREE_LIST
)
8877 id
= TREE_VALUE (spec
);
8879 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
8881 if (id
== ridpointers
[(int) RID_INT
]
8882 || id
== ridpointers
[(int) RID_CHAR
]
8883 || id
== ridpointers
[(int) RID_BOOL
]
8884 || id
== ridpointers
[(int) RID_WCHAR
])
8888 if (id
== ridpointers
[(int) RID_BOOL
])
8889 error ("`bool' is now a keyword");
8891 cp_error ("extraneous `%T' ignored", id
);
8895 if (id
== ridpointers
[(int) RID_INT
])
8897 else if (id
== ridpointers
[(int) RID_CHAR
])
8899 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
8903 /* C++ aggregate types. */
8904 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
8907 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
8909 type
= IDENTIFIER_TYPE_VALUE (id
);
8913 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
8915 if (ridpointers
[i
] == id
)
8917 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
8919 if (pedantic
&& ! in_system_header
&& warn_long_long
)
8920 pedwarn ("ANSI C++ does not support `long long'");
8922 error ("`long long long' is too long for GCC");
8926 else if (RIDBIT_SETP (i
, specbits
))
8927 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
8928 RIDBIT_SET (i
, specbits
);
8933 /* C++ aggregate types. */
8934 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
8937 cp_error ("multiple declarations `%T' and `%T'", type
,
8941 type
= TREE_TYPE (id
);
8942 TREE_VALUE (spec
) = type
;
8947 error ("two or more data types in declaration of `%s'", name
);
8948 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
8950 register tree t
= lookup_name (id
, 1);
8951 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
8952 error ("`%s' fails to be a typedef or built in type",
8953 IDENTIFIER_POINTER (id
));
8956 type
= TREE_TYPE (t
);
8958 /* See the code below that used this. */
8959 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
8964 else if (id
!= error_mark_node
)
8965 /* Can't change CLASS nodes into RECORD nodes here! */
8971 typedef_type
= type
;
8973 /* No type at all: default to `int', and set DEFAULTED_INT
8974 because it was not a user-defined typedef.
8975 Except when we have a `typedef' inside a signature, in
8976 which case the type defaults to `unknown type' and is
8977 instantiated when assigning to a signature pointer or ref. */
8979 if (type
== NULL_TREE
8980 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
8981 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
8982 || RIDBIT_SETP (RID_LONG
, specbits
)
8983 || RIDBIT_SETP (RID_SHORT
, specbits
)))
8985 /* These imply 'int'. */
8986 type
= integer_type_node
;
8990 if (type
== NULL_TREE
)
8993 if (return_type
== return_dtor
)
8994 type
= void_type_node
;
8995 else if (return_type
== return_ctor
)
8996 type
= build_pointer_type (ctor_return_type
);
8997 else if (return_type
== return_conversion
)
8998 type
= ctor_return_type
;
8999 else if (current_class_type
9000 && IS_SIGNATURE (current_class_type
)
9001 && RIDBIT_SETP (RID_TYPEDEF
, specbits
)
9002 && (decl_context
== FIELD
|| decl_context
== NORMAL
))
9006 type
= copy_node (opaque_type_node
);
9012 if (warn_return_type
9013 && return_type
== return_normal
)
9014 /* Save warning until we know what is really going on. */
9015 warn_about_return_type
= 1;
9017 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9018 pedwarn ("ANSI C++ forbids typedef which does not specify a type");
9019 else if (innermost_code
!= CALL_EXPR
|| pedantic
9020 || (warn_return_type
&& return_type
== return_normal
))
9022 if (innermost_code
== CALL_EXPR
)
9023 cp_pedwarn ("return-type of `%D' defaults to `int'", dname
);
9025 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9028 type
= integer_type_node
;
9031 else if (return_type
== return_dtor
)
9033 error ("return type specification for destructor invalid");
9034 type
= void_type_node
;
9036 else if (return_type
== return_ctor
)
9038 error ("return type specification for constructor invalid");
9039 type
= build_pointer_type (ctor_return_type
);
9041 else if (return_type
== return_conversion
)
9043 if (comptypes (type
, ctor_return_type
, 1) == 0)
9044 cp_error ("operator `%T' declared to return `%T'",
9045 ctor_return_type
, type
);
9047 cp_pedwarn ("return type specified for `operator %T'",
9050 type
= ctor_return_type
;
9055 /* Now process the modifiers that were specified
9056 and check for invalid combinations. */
9058 /* Long double is a special combination. */
9060 if (RIDBIT_SETP (RID_LONG
, specbits
)
9061 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9063 RIDBIT_RESET (RID_LONG
, specbits
);
9064 type
= build_type_variant (long_double_type_node
, TYPE_READONLY (type
),
9065 TYPE_VOLATILE (type
));
9068 /* Check all other uses of type modifiers. */
9070 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9071 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9072 || RIDBIT_SETP (RID_LONG
, specbits
)
9073 || RIDBIT_SETP (RID_SHORT
, specbits
))
9077 if (TREE_CODE (type
) == REAL_TYPE
)
9078 error ("short, signed or unsigned invalid for `%s'", name
);
9079 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9080 error ("long, short, signed or unsigned invalid for `%s'", name
);
9081 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9082 && RIDBIT_SETP (RID_SHORT
, specbits
))
9083 error ("long and short specified together for `%s'", name
);
9084 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9085 || RIDBIT_SETP (RID_SHORT
, specbits
))
9087 error ("long or short specified with char for `%s'", name
);
9088 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9089 || RIDBIT_SETP (RID_SHORT
, specbits
))
9090 && TREE_CODE (type
) == REAL_TYPE
)
9091 error ("long or short specified with floating type for `%s'", name
);
9092 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9093 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9094 error ("signed and unsigned given together for `%s'", name
);
9098 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9100 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9102 if (flag_pedantic_errors
)
9107 /* Discard the type modifiers if they are invalid. */
9110 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9111 RIDBIT_RESET (RID_SIGNED
, specbits
);
9112 RIDBIT_RESET (RID_LONG
, specbits
);
9113 RIDBIT_RESET (RID_SHORT
, specbits
);
9118 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9119 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9121 error ("complex invalid for `%s'", name
);
9122 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9125 /* Decide whether an integer type is signed or not.
9126 Optionally treat bitfields as signed by default. */
9127 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9128 || (bitfield
&& ! flag_signed_bitfields
9129 && (explicit_int
|| defaulted_int
|| explicit_char
9130 /* A typedef for plain `int' without `signed'
9131 can be controlled just like plain `int'. */
9132 || ! (typedef_decl
!= NULL_TREE
9133 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
9134 && TREE_CODE (type
) != ENUMERAL_TYPE
9135 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)))
9138 type
= long_long_unsigned_type_node
;
9139 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9140 type
= long_unsigned_type_node
;
9141 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9142 type
= short_unsigned_type_node
;
9143 else if (type
== char_type_node
)
9144 type
= unsigned_char_type_node
;
9145 else if (typedef_decl
)
9146 type
= unsigned_type (type
);
9148 type
= unsigned_type_node
;
9150 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9151 && type
== char_type_node
)
9152 type
= signed_char_type_node
;
9154 type
= long_long_integer_type_node
;
9155 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9156 type
= long_integer_type_node
;
9157 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9158 type
= short_integer_type_node
;
9160 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9162 /* If we just have "complex", it is equivalent to
9163 "complex double", but if any modifiers at all are specified it is
9164 the complex form of TYPE. E.g, "complex short" is
9165 "complex short int". */
9167 if (defaulted_int
&& ! longlong
9168 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9169 || RIDBIT_SETP (RID_SHORT
, specbits
)
9170 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9171 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9172 type
= complex_double_type_node
;
9173 else if (type
== integer_type_node
)
9174 type
= complex_integer_type_node
;
9175 else if (type
== float_type_node
)
9176 type
= complex_float_type_node
;
9177 else if (type
== double_type_node
)
9178 type
= complex_double_type_node
;
9179 else if (type
== long_double_type_node
)
9180 type
= complex_long_double_type_node
;
9182 type
= build_complex_type (type
);
9185 if (return_type
== return_conversion
9186 && (RIDBIT_SETP (RID_CONST
, specbits
)
9187 || RIDBIT_SETP (RID_VOLATILE
, specbits
)))
9188 cp_error ("`operator %T' cannot be cv-qualified",
9191 /* Set CONSTP if this declaration is `const', whether by
9192 explicit specification or via a typedef.
9193 Likewise for VOLATILEP. */
9195 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + TYPE_READONLY (type
);
9196 volatilep
= !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + TYPE_VOLATILE (type
);
9197 type
= cp_build_type_variant (type
, constp
, volatilep
);
9199 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9200 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9201 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9202 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9203 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9205 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9206 staticp
= 1 + (decl_context
== FIELD
);
9208 if (virtualp
&& staticp
== 2)
9210 cp_error ("member `%D' cannot be declared both virtual and static",
9214 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9215 RIDBIT_RESET (RID_FRIEND
, specbits
);
9217 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9219 if (decl_context
== PARM
)
9221 error ("non-member `%s' cannot be declared `mutable'", name
);
9222 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9224 else if (friendp
|| decl_context
== TYPENAME
)
9226 error ("non-object member `%s' cannot be declared `mutable'", name
);
9227 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9231 /* Warn if two storage classes are given. Default to `auto'. */
9233 if (RIDBIT_ANY_SET (specbits
))
9235 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9236 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9237 if (decl_context
== PARM
&& nclasses
> 0)
9238 error ("storage class specifiers invalid in parameter declarations");
9239 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9241 if (decl_context
== PARM
)
9242 error ("typedef declaration invalid in parameter declaration");
9245 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9246 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9249 /* Give error if `virtual' is used outside of class declaration. */
9251 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9253 error ("virtual outside class declaration");
9256 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9258 error ("only members can be declared mutable");
9259 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9262 /* Static anonymous unions are dealt with here. */
9263 if (staticp
&& decl_context
== TYPENAME
9264 && TREE_CODE (declspecs
) == TREE_LIST
9265 && ANON_UNION_TYPE_P (TREE_VALUE (declspecs
)))
9266 decl_context
= FIELD
;
9268 /* Give error if `const,' `volatile,' `inline,' `friend,' or `virtual'
9269 is used in a signature member function declaration. */
9270 if (decl_context
== FIELD
9271 && IS_SIGNATURE (current_class_type
)
9272 && RIDBIT_NOTSETP (RID_TYPEDEF
, specbits
))
9276 error ("`const' specified for signature member function `%s'", name
);
9281 error ("`volatile' specified for signature member function `%s'",
9287 error ("`inline' specified for signature member function `%s'", name
);
9288 /* Later, we'll make signature member functions inline. */
9293 error ("`friend' declaration in signature definition");
9298 error ("`virtual' specified for signature member function `%s'",
9300 /* Later, we'll make signature member functions virtual. */
9305 /* Warn about storage classes that are invalid for certain
9306 kinds of declarations (parameters, typenames, etc.). */
9309 error ("multiple storage classes in declaration of `%s'", name
);
9310 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9312 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9313 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9314 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9316 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9318 else if (decl_context
== FIELD
9319 && ! IS_SIGNATURE (current_class_type
)
9320 /* C++ allows static class elements */
9321 && RIDBIT_SETP (RID_STATIC
, specbits
))
9322 /* C++ also allows inlines and signed and unsigned elements,
9323 but in those cases we don't come in here. */
9327 if (decl_context
== FIELD
)
9329 tree tmp
= NULL_TREE
;
9330 register int op
= 0;
9334 /* Avoid trying to get an operand off an identifier node. */
9335 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9338 tmp
= TREE_OPERAND (declarator
, 0);
9339 op
= IDENTIFIER_OPNAME_P (tmp
);
9341 error ("storage class specified for %s `%s'",
9342 IS_SIGNATURE (current_class_type
)
9344 ? "signature member operator"
9345 : "signature member function")
9346 : (op
? "member operator" : "field"),
9347 op
? operator_name_string (tmp
) : name
);
9350 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9351 ? "storage class specified for parameter `%s'"
9352 : "storage class specified for typename"), name
);
9353 RIDBIT_RESET (RID_REGISTER
, specbits
);
9354 RIDBIT_RESET (RID_AUTO
, specbits
);
9355 RIDBIT_RESET (RID_EXTERN
, specbits
);
9357 if (decl_context
== FIELD
&& IS_SIGNATURE (current_class_type
))
9359 RIDBIT_RESET (RID_STATIC
, specbits
);
9364 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9366 if (toplevel_bindings_p ())
9368 /* It's common practice (and completely valid) to have a const
9369 be initialized and declared extern. */
9371 warning ("`%s' initialized and declared `extern'", name
);
9374 error ("`%s' has both `extern' and initializer", name
);
9376 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9377 && ! toplevel_bindings_p ())
9378 error ("nested function `%s' declared `extern'", name
);
9379 else if (toplevel_bindings_p ())
9381 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9382 error ("top-level declaration of `%s' specifies `auto'", name
);
9385 if (nclasses
> 0 && friendp
)
9386 error ("storage class specifiers invalid in friend function declarations");
9388 /* Now figure out the structure of the declarator proper.
9389 Descend through it, creating more complex types, until we reach
9390 the declared identifier (or NULL_TREE, in an absolute declarator). */
9392 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9393 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9395 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9396 an INDIRECT_REF (for *...),
9397 a CALL_EXPR (for ...(...)),
9398 an identifier (for the name being declared)
9399 or a null pointer (for the place in an absolute declarator
9400 where the name was omitted).
9401 For the last two cases, we have just exited the loop.
9403 For C++ it could also be
9404 a SCOPE_REF (for class :: ...). In this case, we have converted
9405 sensible names to types, and those are the values we use to
9406 qualify the member name.
9407 an ADDR_EXPR (for &...),
9408 a BIT_NOT_EXPR (for destructors)
9410 At this point, TYPE is the type of elements of an array,
9411 or for a function to return, or for a pointer to point to.
9412 After this sequence of ifs, TYPE is the type of the
9413 array or function or pointer, and DECLARATOR has had its
9414 outermost layer removed. */
9416 if (type
== error_mark_node
)
9418 if (TREE_CODE (declarator
) == SCOPE_REF
)
9419 declarator
= TREE_OPERAND (declarator
, 1);
9421 declarator
= TREE_OPERAND (declarator
, 0);
9424 if (quals
!= NULL_TREE
9425 && (declarator
== NULL_TREE
9426 || TREE_CODE (declarator
) != SCOPE_REF
))
9428 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9429 ctype
= TYPE_METHOD_BASETYPE (type
);
9430 if (ctype
!= NULL_TREE
)
9432 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9433 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9434 type
= TREE_TYPE (dummy
);
9438 switch (TREE_CODE (declarator
))
9442 /* We encode a declarator with embedded attributes using
9444 tree attrs
= TREE_PURPOSE (declarator
);
9445 declarator
= TREE_VALUE (declarator
);
9446 decl_attributes (type
, attrs
, NULL_TREE
);
9452 register tree itype
= NULL_TREE
;
9453 register tree size
= TREE_OPERAND (declarator
, 1);
9454 /* The index is a signed object `sizetype' bits wide. */
9455 tree index_type
= signed_type (sizetype
);
9457 declarator
= TREE_OPERAND (declarator
, 0);
9459 /* Check for some types that there cannot be arrays of. */
9461 if (TREE_CODE (type
) == VOID_TYPE
)
9463 cp_error ("declaration of `%D' as array of voids", dname
);
9464 type
= error_mark_node
;
9467 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9469 cp_error ("declaration of `%D' as array of functions", dname
);
9470 type
= error_mark_node
;
9473 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9474 you can't have arrays of references. If we allowed them,
9475 then we'd be saying x[i] is valid for an array x, but
9476 then you'd have to ask: what does `*(x + i)' mean? */
9477 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9479 if (decl_context
== TYPENAME
)
9480 cp_error ("cannot make arrays of references");
9482 cp_error ("declaration of `%D' as array of references",
9484 type
= error_mark_node
;
9487 if (TREE_CODE (type
) == OFFSET_TYPE
)
9489 cp_error ("declaration of `%D' as array of data members",
9491 type
= error_mark_node
;
9494 if (TREE_CODE (type
) == METHOD_TYPE
)
9496 cp_error ("declaration of `%D' as array of function members",
9498 type
= error_mark_node
;
9501 if (size
== error_mark_node
)
9502 type
= error_mark_node
;
9504 if (type
== error_mark_node
)
9509 /* Must suspend_momentary here because the index
9510 type may need to live until the end of the function.
9511 For example, it is used in the declaration of a
9512 variable which requires destructing at the end of
9513 the function; then build_vec_delete will need this
9515 int yes
= suspend_momentary ();
9516 /* Might be a cast. */
9517 if (TREE_CODE (size
) == NOP_EXPR
9518 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9519 size
= TREE_OPERAND (size
, 0);
9521 /* If this involves a template parameter, it'll be
9522 constant, but we don't know what the value is yet. */
9523 if (processing_template_decl
)
9525 itype
= make_node (INTEGER_TYPE
);
9526 TYPE_MIN_VALUE (itype
) = size_zero_node
;
9527 TYPE_MAX_VALUE (itype
) = build_min
9528 (MINUS_EXPR
, sizetype
, size
, integer_one_node
);
9529 goto dont_grok_size
;
9532 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9533 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
)
9535 cp_error ("size of array `%D' has non-integer type",
9537 size
= integer_one_node
;
9539 if (TREE_READONLY_DECL_P (size
))
9540 size
= decl_constant_value (size
);
9541 if (pedantic
&& integer_zerop (size
))
9542 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9543 if (TREE_CONSTANT (size
))
9545 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9546 int old_pedantic
= pedantic
;
9547 pedantic
= flag_pedantic_errors
= 1;
9548 /* Always give overflow errors on array subscripts. */
9549 constant_expression_warning (size
);
9550 pedantic
= old_pedantic
;
9551 flag_pedantic_errors
= old_flag_pedantic_errors
;
9552 if (INT_CST_LT (size
, integer_zero_node
))
9554 cp_error ("size of array `%D' is negative", dname
);
9555 size
= integer_one_node
;
9563 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9566 cp_pedwarn ("ANSI C++ forbids variable-size array");
9571 = fold (build_binary_op (MINUS_EXPR
,
9572 cp_convert (index_type
, size
),
9573 cp_convert (index_type
,
9574 integer_one_node
), 1));
9575 if (! TREE_CONSTANT (itype
))
9576 itype
= variable_size (itype
);
9577 else if (TREE_OVERFLOW (itype
))
9579 error ("overflow in array dimension");
9580 TREE_OVERFLOW (itype
) = 0;
9583 /* If we're a parm, we need to have a permanent type so
9584 mangling checks for re-use will work right. If both the
9585 element and index types are permanent, the array type
9587 if (decl_context
== PARM
9588 && allocation_temporary_p () && TREE_PERMANENT (type
))
9590 push_obstacks (&permanent_obstack
, &permanent_obstack
);
9591 itype
= build_index_type (itype
);
9595 itype
= build_index_type (itype
);
9598 resume_momentary (yes
);
9601 type
= build_cplus_array_type (type
, itype
);
9610 tree inner_parms
= TREE_OPERAND (declarator
, 1);
9611 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9613 /* Declaring a function type.
9614 Make sure we have a valid type for the function to return. */
9616 /* We now know that constp and volatilep don't apply to the
9617 decl, but to its return type. */
9618 constp
= volatilep
= 0;
9620 /* Warn about some types functions can't return. */
9622 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9624 error ("`%s' declared as function returning a function", name
);
9625 type
= integer_type_node
;
9627 if (TREE_CODE (type
) == ARRAY_TYPE
)
9629 error ("`%s' declared as function returning an array", name
);
9630 type
= integer_type_node
;
9633 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9634 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9636 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9639 /* Pick up type qualifiers which should be applied to `this'. */
9640 quals
= TREE_OPERAND (declarator
, 2);
9642 /* Pick up the exception specifications. */
9643 raises
= TREE_TYPE (declarator
);
9645 /* Say it's a definition only for the CALL_EXPR
9646 closest to the identifier. */
9649 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9650 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9651 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9653 if (ctype
== NULL_TREE
9654 && decl_context
== FIELD
9656 && (friendp
== 0 || dname
== current_class_name
))
9657 ctype
= current_class_type
;
9659 if (ctype
&& return_type
== return_conversion
)
9660 TYPE_HAS_CONVERSION (ctype
) = 1;
9661 if (ctype
&& constructor_name (ctype
) == dname
)
9663 /* We are within a class's scope. If our declarator name
9664 is the same as the class name, and we are defining
9665 a function, then it is a constructor/destructor, and
9666 therefore returns a void type. */
9668 if (flags
== DTOR_FLAG
)
9670 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9671 not be declared const or volatile. A destructor
9672 may not be static. */
9674 error ("destructor cannot be static member function");
9677 cp_error ("destructors may not be `%s'",
9678 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9681 if (decl_context
== FIELD
)
9683 if (! member_function_or_else (ctype
, current_class_type
,
9684 "destructor for alien class `%s' cannot be a member"))
9685 return void_type_node
;
9688 else /* It's a constructor. */
9692 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
9693 not be declared const or volatile. A constructor may
9694 not be virtual. A constructor may not be static. */
9696 error ("constructor cannot be static member function");
9699 pedwarn ("constructors cannot be declared virtual");
9704 cp_error ("constructors may not be `%s'",
9705 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9709 RID_BIT_TYPE tmp_bits
;
9710 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
9711 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
9712 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
9713 if (RIDBIT_ANY_SET (tmp_bits
))
9714 error ("return value type specifier for constructor ignored");
9716 type
= build_pointer_type (ctype
);
9717 if (decl_context
== FIELD
9718 && IS_SIGNATURE (current_class_type
))
9720 error ("constructor not allowed in signature");
9721 return void_type_node
;
9723 else if (decl_context
== FIELD
)
9725 if (! member_function_or_else (ctype
, current_class_type
,
9726 "constructor for alien class `%s' cannot be member"))
9727 return void_type_node
;
9728 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
9729 if (return_type
!= return_ctor
)
9733 if (decl_context
== FIELD
)
9739 error ("can't initialize friend function `%s'", name
);
9742 /* Cannot be both friend and virtual. */
9743 error ("virtual functions cannot be friends");
9744 RIDBIT_RESET (RID_FRIEND
, specbits
);
9747 if (decl_context
== NORMAL
)
9748 error ("friend declaration not in class definition");
9749 if (current_function_decl
&& funcdef_flag
)
9750 cp_error ("can't define friend function `%s' in a local class definition",
9754 /* Construct the function type and go to the next
9755 inner layer of declarator. */
9757 declarator
= TREE_OPERAND (declarator
, 0);
9759 /* FIXME: This is where default args should be fully
9762 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
9764 if (declarator
&& flags
== DTOR_FLAG
)
9766 /* A destructor declared in the body of a class will
9767 be represented as a BIT_NOT_EXPR. But, we just
9768 want the underlying IDENTIFIER. */
9769 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
9770 declarator
= TREE_OPERAND (declarator
, 0);
9772 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
9773 arg_types
= void_list_node
;
9774 else if (arg_types
== NULL_TREE
9775 || arg_types
!= void_list_node
)
9777 cp_error ("destructors may not have parameters");
9778 arg_types
= void_list_node
;
9779 last_function_parms
= NULL_TREE
;
9783 /* ANSI says that `const int foo ();'
9784 does not make the function foo const. */
9785 type
= build_function_type (type
, arg_types
);
9789 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
9790 if (TREE_PURPOSE (t
)
9791 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
9793 add_defarg_fn (type
);
9802 /* Filter out pointers-to-references and references-to-references.
9803 We can get these if a TYPE_DECL is used. */
9805 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9807 error ("cannot declare %s to references",
9808 TREE_CODE (declarator
) == ADDR_EXPR
9809 ? "references" : "pointers");
9810 declarator
= TREE_OPERAND (declarator
, 0);
9814 if (TREE_CODE (type
) == OFFSET_TYPE
9815 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
9816 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
9818 cp_error ("cannot declare pointer to `%#T' member",
9820 type
= TREE_TYPE (type
);
9823 /* Merge any constancy or volatility into the target type
9826 /* We now know that constp and volatilep don't apply to the
9827 decl, but to the target of the pointer. */
9828 constp
= volatilep
= 0;
9830 if (IS_SIGNATURE (type
))
9832 if (TREE_CODE (declarator
) == ADDR_EXPR
)
9834 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
9835 && TYPE_SIZE (type
))
9836 cp_warning ("empty signature `%T' used in signature reference declaration",
9839 type
= build_signature_reference_type (type
);
9841 sorry ("signature reference");
9847 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
9848 && TYPE_SIZE (type
))
9849 cp_warning ("empty signature `%T' used in signature pointer declaration",
9851 type
= build_signature_pointer_type (type
);
9856 else if (TREE_CODE (declarator
) == ADDR_EXPR
)
9858 if (TREE_CODE (type
) == VOID_TYPE
)
9859 error ("invalid type: `void &'");
9861 type
= build_reference_type (type
);
9863 else if (TREE_CODE (type
) == METHOD_TYPE
)
9865 type
= build_ptrmemfunc_type (build_pointer_type (type
));
9868 type
= build_pointer_type (type
);
9870 /* Process a list of type modifier keywords (such as
9871 const or volatile) that were given inside the `*' or `&'. */
9873 if (TREE_TYPE (declarator
))
9875 register tree typemodlist
;
9877 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
9878 typemodlist
= TREE_CHAIN (typemodlist
))
9880 if (TREE_VALUE (typemodlist
) == ridpointers
[(int) RID_CONST
])
9882 else if (TREE_VALUE (typemodlist
) == ridpointers
[(int) RID_VOLATILE
])
9887 error ("invalid type modifier within %s declarator",
9888 TREE_CODE (declarator
) == ADDR_EXPR
9889 ? "reference" : "pointer");
9893 pedwarn ("duplicate `const'");
9895 pedwarn ("duplicate `volatile'");
9896 if (TREE_CODE (declarator
) == ADDR_EXPR
9897 && (constp
|| volatilep
))
9900 pedwarn ("discarding `const' applied to a reference");
9902 pedwarn ("discarding `volatile' applied to a reference");
9903 constp
= volatilep
= 0;
9905 type
= cp_build_type_variant (type
, constp
, volatilep
);
9907 declarator
= TREE_OPERAND (declarator
, 0);
9913 /* We have converted type names to NULL_TREE if the
9914 name was bogus, or to a _TYPE node, if not.
9916 The variable CTYPE holds the type we will ultimately
9917 resolve to. The code here just needs to build
9918 up appropriate member types. */
9919 tree sname
= TREE_OPERAND (declarator
, 1);
9922 /* Destructors can have their visibilities changed as well. */
9923 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
9924 sname
= TREE_OPERAND (sname
, 0);
9926 if (TREE_COMPLEXITY (declarator
) == 0)
9927 /* This needs to be here, in case we are called
9928 multiple times. */ ;
9929 else if (TREE_COMPLEXITY (declarator
) == -1)
9930 /* Namespace member. */
9931 pop_decl_namespace ();
9932 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
9933 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
9934 else if (! IS_AGGR_TYPE_CODE
9935 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
9937 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
9939 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
9940 that refer to ctype. They couldn't be resolved earlier
9941 because we hadn't pushed into the class yet.
9942 Example: resolve 'B<T>::type' in
9943 'B<typename B<T>::type> B<T>::f () { }'. */
9944 if (current_template_parms
9945 && uses_template_parms (type
)
9946 && uses_template_parms (current_class_type
))
9948 tree args
= current_template_args ();
9949 type
= tsubst (type
, args
, NULL_TREE
);
9952 /* This pop_nested_class corresponds to the
9953 push_nested_class used to push into class scope for
9954 parsing the argument list of a function decl, in
9956 pop_nested_class (1);
9957 TREE_COMPLEXITY (declarator
) = current_class_depth
;
9960 my_friendly_abort (16);
9962 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
9964 /* We had a reference to a global decl, or
9965 perhaps we were given a non-aggregate typedef,
9966 in which case we cleared this out, and should just
9967 keep going as though it wasn't there. */
9971 ctype
= TREE_OPERAND (declarator
, 0);
9974 while (t
!= NULL_TREE
)
9976 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
9977 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9978 template_count
+= 1;
9979 t
= TYPE_MAIN_DECL (t
);
9980 if (DECL_LANG_SPECIFIC (t
))
9981 t
= DECL_CLASS_CONTEXT (t
);
9986 if (sname
== NULL_TREE
)
9989 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
9991 /* This is the `standard' use of the scoping operator:
9992 basetype :: member . */
9994 if (ctype
== current_class_type
)
10000 Is this ill-formed? */
10003 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10006 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10008 if (current_class_type
== NULL_TREE
10010 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10011 TYPE_ARG_TYPES (type
));
10014 cp_error ("cannot declare member function `%T::%s' within `%T'",
10015 ctype
, name
, current_class_type
);
10016 return void_type_node
;
10019 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10020 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10022 /* Have to move this code elsewhere in this function.
10023 this code is used for i.e., typedef int A::M; M *pm;
10025 It is? How? jason 10/2/94 */
10027 if (current_class_type
)
10029 cp_error ("cannot declare member `%T::%s' within `%T'",
10030 ctype
, name
, current_class_type
);
10031 return void_type_node
;
10033 type
= build_offset_type (ctype
, type
);
10035 else if (uses_template_parms (ctype
))
10037 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10039 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10040 TYPE_ARG_TYPES (type
));
10044 cp_error ("structure `%T' not yet defined", ctype
);
10045 return error_mark_node
;
10048 declarator
= sname
;
10050 else if (TREE_CODE (sname
) == SCOPE_REF
)
10051 my_friendly_abort (17);
10055 declarator
= TREE_OPERAND (declarator
, 1);
10056 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10057 /* In this case, we will deal with it later. */
10061 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10062 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10063 TYPE_ARG_TYPES (type
));
10065 type
= build_offset_type (ctype
, type
);
10072 declarator
= TREE_OPERAND (declarator
, 0);
10077 case ENUMERAL_TYPE
:
10078 declarator
= NULL_TREE
;
10082 declarator
= NULL_TREE
;
10086 my_friendly_abort (158);
10090 if (explicitp
== 1)
10092 error ("only constructors can be declared `explicit'");
10096 /* Now TYPE has the actual type. */
10098 /* If this is declaring a typedef name, return a TYPE_DECL. */
10100 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10104 error ("const `%s' cannot be declared `mutable'", name
);
10105 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10109 error ("static `%s' cannot be declared `mutable'", name
);
10110 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10114 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10118 /* Note that the grammar rejects storage classes
10119 in typenames, fields or parameters. */
10120 if (current_lang_name
== lang_name_java
)
10121 TYPE_FOR_JAVA (type
) = 1;
10123 if (decl_context
== FIELD
)
10125 if (declarator
== current_class_name
)
10126 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10128 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10129 if (IS_SIGNATURE (current_class_type
) && opaque_typedef
)
10130 SIGNATURE_HAS_OPAQUE_TYPEDECLS (current_class_type
) = 1;
10134 /* Make sure this typedef lives as long as its type,
10135 since it might be used as a template parameter. */
10136 if (type
!= error_mark_node
)
10137 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10138 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10139 if (type
!= error_mark_node
)
10143 /* If the user declares "struct {...} foo" then `foo' will have
10144 an anonymous name. Fill that name in now. Nothing can
10145 refer to it, so nothing needs know about the name change.
10146 The TYPE_NAME field was filled in by build_struct_xref. */
10147 if (type
!= error_mark_node
10148 && TYPE_NAME (type
)
10149 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10150 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
)))
10152 /* FIXME: This is bogus; we should not be doing this for
10153 cv-qualified types. */
10155 /* For anonymous structs that are cv-qualified, need to use
10156 TYPE_MAIN_VARIANT so that name will mangle correctly. As
10157 type not referenced after this block, don't bother
10158 resetting type to original type, ie. TREE_TYPE (decl). */
10159 type
= TYPE_MAIN_VARIANT (type
);
10161 /* Replace the anonymous name with the real name everywhere. */
10162 lookup_tag_reverse (type
, declarator
);
10163 TYPE_NAME (type
) = decl
;
10165 if (TYPE_LANG_SPECIFIC (type
))
10166 TYPE_WAS_ANONYMOUS (type
) = 1;
10168 /* XXX Temporarily set the scope.
10169 When returning, start_decl expects it as NULL_TREE,
10170 and will then then set it using pushdecl. */
10171 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10172 if (current_class_type
)
10173 DECL_CONTEXT (decl
) = current_class_type
;
10175 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10177 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10178 DECL_ASSEMBLER_NAME (decl
)
10179 = get_identifier (build_overload_name (type
, 1, 1));
10180 DECL_CONTEXT (decl
) = NULL_TREE
;
10182 /* FIXME remangle member functions; member functions of a
10183 type with external linkage have external linkage. */
10186 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10188 cp_error_at ("typedef name may not be class-qualified", decl
);
10193 if (ctype
== NULL_TREE
)
10195 if (TREE_CODE (type
) != METHOD_TYPE
)
10196 cp_error_at ("invalid type qualifier for non-method type", decl
);
10198 ctype
= TYPE_METHOD_BASETYPE (type
);
10200 if (ctype
!= NULL_TREE
)
10201 grok_method_quals (ctype
, decl
, quals
);
10204 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10205 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10206 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10208 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10209 error ("non-object member `%s' cannot be declared mutable", name
);
10211 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10212 inlinep
, friendp
, raises
!= NULL_TREE
);
10215 error ("typedef declaration includes an initializer");
10220 /* Detect the case of an array type of unspecified size
10221 which came, as such, direct from a typedef name.
10222 We must copy the type, so that each identifier gets
10223 a distinct type, so that each identifier's size can be
10224 controlled separately by its own initializer. */
10226 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10227 && TYPE_DOMAIN (type
) == NULL_TREE
)
10229 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10232 /* If this is a type name (such as, in a cast or sizeof),
10233 compute the type and return it now. */
10235 if (decl_context
== TYPENAME
)
10237 /* Note that the grammar rejects storage classes
10238 in typenames, fields or parameters. */
10239 if (constp
|| volatilep
)
10241 if (IS_SIGNATURE (type
))
10242 error ("`const' or `volatile' specified with signature type");
10245 /* Special case: "friend class foo" looks like a TYPENAME context. */
10250 cp_error ("`volatile' specified for friend class declaration");
10255 cp_error ("`inline' specified for friend class declaration");
10259 /* Only try to do this stuff if we didn't already give up. */
10260 if (type
!= integer_type_node
)
10262 /* A friendly class? */
10263 if (current_class_type
)
10264 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10266 error ("trying to make class `%s' a friend of global scope",
10267 TYPE_NAME_STRING (type
));
10268 type
= void_type_node
;
10273 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10274 if (ctype
== NULL_TREE
)
10276 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10277 ctype
= TYPE_METHOD_BASETYPE (type
);
10279 grok_method_quals (ctype
, dummy
, quals
);
10280 type
= TREE_TYPE (dummy
);
10285 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10286 && decl_context
!= CATCHPARM
10287 && TREE_CODE (type
) != UNION_TYPE
10290 cp_error ("abstract declarator `%T' used as declaration", type
);
10291 declarator
= make_anon_name ();
10294 /* `void' at top level (not within pointer)
10295 is allowed only in typedefs or type names.
10296 We don't complain about parms either, but that is because
10297 a better error message can be made later. */
10299 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10302 error ("unnamed variable or field declared void");
10303 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10305 if (IDENTIFIER_OPNAME_P (declarator
))
10306 my_friendly_abort (356);
10308 error ("variable or field `%s' declared void", name
);
10311 error ("variable or field declared void");
10312 type
= integer_type_node
;
10315 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10316 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10318 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10320 if (ctype
|| in_namespace
)
10321 error ("cannot use `::' in parameter declaration");
10323 /* A parameter declared as an array of T is really a pointer to T.
10324 One declared as a function is really a pointer to a function.
10325 One declared as a member is really a pointer to member. */
10327 if (TREE_CODE (type
) == ARRAY_TYPE
)
10329 /* Transfer const-ness of array into that of type pointed to. */
10330 type
= build_pointer_type (TREE_TYPE (type
));
10331 volatilep
= constp
= 0;
10333 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10334 type
= build_pointer_type (type
);
10335 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10336 type
= build_pointer_type (type
);
10337 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10339 error ("declaration of `%s' as void", name
);
10345 register tree decl
;
10347 if (decl_context
== PARM
)
10349 decl
= build_decl (PARM_DECL
, declarator
, complete_type (type
));
10351 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10352 inlinep
, friendp
, raises
!= NULL_TREE
);
10353 if (current_class_type
10354 && IS_SIGNATURE (current_class_type
))
10357 error ("parameter of signature member function declared `inline'");
10358 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10359 error ("parameter of signature member function declared `auto'");
10360 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10361 error ("parameter of signature member function declared `register'");
10364 /* Compute the type actually passed in the parmlist,
10365 for the case where there is no prototype.
10366 (For example, shorts and chars are passed as ints.)
10367 When there is a prototype, this is overridden later. */
10369 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10371 else if (decl_context
== FIELD
)
10373 if (type
== error_mark_node
)
10375 /* Happens when declaring arrays of sizes which
10376 are error_mark_node, for example. */
10379 else if (in_namespace
)
10381 /* Something like struct S { int N::j; }; */
10382 cp_error ("invalid use of `::'");
10385 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10388 tree function_context
;
10390 /* We catch the others as conflicts with the builtin
10392 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10394 cp_error ("function `%D' cannot be declared friend",
10401 if (ctype
== NULL_TREE
)
10402 ctype
= current_class_type
;
10404 if (ctype
== NULL_TREE
)
10406 cp_error ("can't make `%D' into a method -- not in a class",
10408 return void_type_node
;
10411 /* ``A union may [ ... ] not [ have ] virtual functions.''
10413 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10415 cp_error ("function `%D' declared virtual inside a union",
10417 return void_type_node
;
10420 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10421 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10422 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10423 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10427 cp_error ("`%D' cannot be declared virtual, since it is always static",
10432 else if (staticp
< 2)
10433 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10434 TYPE_ARG_TYPES (type
));
10437 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10438 function_context
= (ctype
!= NULL_TREE
) ?
10439 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10440 publicp
= (! friendp
|| ! staticp
)
10441 && function_context
== NULL_TREE
;
10442 decl
= grokfndecl (ctype
, type
,
10443 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10444 ? declarator
: dname
,
10446 virtualp
, flags
, quals
, raises
, attrlist
,
10447 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10448 funcdef_flag
, template_count
, in_namespace
);
10449 if (decl
== NULL_TREE
|| decl
== error_mark_node
)
10452 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10453 /* The decl and setting of decl_machine_attr is also turned off. */
10454 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10457 if (explicitp
== 2)
10458 DECL_NONCONVERTING_P (decl
) = 1;
10460 else if (TREE_CODE (type
) == METHOD_TYPE
)
10462 /* We only get here for friend declarations of
10463 members of other classes. */
10464 /* All method decls are public, so tell grokfndecl to set
10465 TREE_PUBLIC, also. */
10466 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10467 virtualp
, flags
, quals
, raises
, attrlist
,
10468 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10469 template_count
, in_namespace
);
10470 if (decl
== NULL_TREE
)
10473 else if (!staticp
&& ! processing_template_decl
10474 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10475 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10478 cp_error ("field `%D' has incomplete type", declarator
);
10480 cp_error ("name `%T' has incomplete type", type
);
10482 /* If we're instantiating a template, tell them which
10483 instantiation made the field's type be incomplete. */
10484 if (current_class_type
10485 && TYPE_NAME (current_class_type
)
10486 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10487 && declspecs
&& TREE_VALUE (declspecs
)
10488 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10489 cp_error (" in instantiation of template `%T'",
10490 current_class_type
);
10492 type
= error_mark_node
;
10499 error ("`%s' is neither function nor method; cannot be declared friend",
10500 IDENTIFIER_POINTER (declarator
));
10508 /* Friends are treated specially. */
10509 if (ctype
== current_class_type
)
10510 warning ("member functions are implicitly friends of their class");
10513 tree t
= NULL_TREE
;
10514 if (decl
&& DECL_NAME (decl
))
10516 if (template_class_depth (current_class_type
) == 0)
10519 = check_explicit_specialization
10521 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10522 if (decl
== error_mark_node
)
10523 return error_mark_node
;
10526 t
= do_friend (ctype
, declarator
, decl
,
10527 last_function_parms
, flags
, quals
,
10530 if (t
&& funcdef_flag
)
10533 return void_type_node
;
10537 /* Structure field. It may not be a function, except for C++ */
10539 if (decl
== NULL_TREE
)
10545 /* An attempt is being made to initialize a non-static
10546 member. But, from [class.mem]:
10548 4 A member-declarator can contain a
10549 constant-initializer only if it declares a static
10550 member (_class.static_) of integral or enumeration
10551 type, see _class.static.data_.
10553 This used to be relatively common practice, but
10554 the rest of the compiler does not correctly
10555 handle the initialization unless the member is
10556 static so we make it static below. */
10557 cp_pedwarn ("ANSI C++ forbids initialization of %s `%D'",
10558 constp
? "const member" : "member",
10560 cp_pedwarn ("making `%D' static", declarator
);
10564 /* Motion 10 at San Diego: If a static const integral data
10565 member is initialized with an integral constant
10566 expression, the initializer may appear either in the
10567 declaration (within the class), or in the definition,
10568 but not both. If it appears in the class, the member is
10569 a member constant. The file-scope definition is always
10571 if (CLASS_TYPE_P (type
)
10572 || TREE_CODE (type
) == REFERENCE_TYPE
)
10574 cp_error ("in-class initialization of static data member of non-integral type `%T'",
10576 /* If we just return the declaration, crashes will
10577 sometimes occur. We therefore return
10578 void_type_node, as if this was a friend
10579 declaration, to cause callers to completely
10580 ignore this declaration. */
10581 return void_type_node
;
10584 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
10586 else if (pedantic
&& ! INTEGRAL_TYPE_P (type
)
10587 && !uses_template_parms (type
))
10588 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", declarator
, type
);
10593 /* ANSI C++ Apr '95 wp 9.2 */
10594 if (declarator
== current_class_name
)
10595 cp_pedwarn ("ANSI C++ forbids static member `%D' with same name as enclosing class",
10598 /* C++ allows static class members.
10599 All other work for this is done by grokfield.
10600 This VAR_DCL is built by build_lang_field_decl.
10601 All other VAR_DECLs are built by build_decl. */
10602 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
10603 TREE_STATIC (decl
) = 1;
10604 /* In class context, 'static' means public access. */
10605 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10609 decl
= build_lang_field_decl (FIELD_DECL
, declarator
, type
);
10610 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10612 DECL_MUTABLE_P (decl
) = 1;
10613 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10617 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10618 inlinep
, friendp
, raises
!= NULL_TREE
);
10621 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10623 tree original_name
;
10629 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10630 original_name
= dname
;
10632 original_name
= declarator
;
10634 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10635 error ("storage class `auto' invalid for function `%s'", name
);
10636 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10637 error ("storage class `register' invalid for function `%s'", name
);
10639 /* Function declaration not at top level.
10640 Storage classes other than `extern' are not allowed
10641 and `extern' makes no difference. */
10642 if (! toplevel_bindings_p ()
10643 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10644 || RIDBIT_SETP (RID_INLINE
, specbits
))
10647 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10648 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
10650 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
10653 if (ctype
== NULL_TREE
)
10657 error ("virtual non-class function `%s'", name
);
10661 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
10662 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10663 TYPE_ARG_TYPES (type
));
10665 /* Record presence of `static'. */
10666 publicp
= (ctype
!= NULL_TREE
10667 || RIDBIT_SETP (RID_EXTERN
, specbits
)
10668 || !RIDBIT_SETP (RID_STATIC
, specbits
));
10670 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
10671 virtualp
, flags
, quals
, raises
, attrlist
,
10673 publicp
, inlinep
, funcdef_flag
,
10674 template_count
, in_namespace
);
10675 if (decl
== NULL_TREE
)
10678 /* Among other times, could occur from check_explicit_specialization
10679 returning an error_mark_node. */
10680 if (decl
== error_mark_node
)
10681 return error_mark_node
;
10685 int illegal_static
= 0;
10687 /* Don't allow a static member function in a class, and forbid
10688 declaring main to be static. */
10689 if (TREE_CODE (type
) == METHOD_TYPE
)
10691 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
10692 illegal_static
= 1;
10694 else if (current_function_decl
)
10696 /* FIXME need arm citation */
10697 error ("cannot declare static function inside another function");
10698 illegal_static
= 1;
10701 if (illegal_static
)
10704 RIDBIT_RESET (RID_STATIC
, specbits
);
10710 /* It's a variable. */
10712 /* An uninitialized decl with `extern' is a reference. */
10713 decl
= grokvardecl (type
, declarator
, &specbits
,
10714 initialized
, constp
, in_namespace
);
10715 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
10716 inlinep
, friendp
, raises
!= NULL_TREE
);
10720 DECL_CONTEXT (decl
) = ctype
;
10723 cp_pedwarn ("static member `%D' re-declared as static", decl
);
10725 RIDBIT_RESET (RID_STATIC
, specbits
);
10727 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
10729 cp_error ("static member `%D' declared `register'", decl
);
10730 RIDBIT_RESET (RID_REGISTER
, specbits
);
10732 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
10734 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
10736 RIDBIT_RESET (RID_EXTERN
, specbits
);
10741 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10743 error ("`%s' cannot be declared mutable", name
);
10746 /* Record `register' declaration for warnings on &
10747 and in case doing stupid register allocation. */
10749 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10750 DECL_REGISTER (decl
) = 1;
10752 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
10753 DECL_THIS_EXTERN (decl
) = 1;
10755 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10756 DECL_THIS_STATIC (decl
) = 1;
10758 /* Record constancy and volatility. */
10761 TREE_READONLY (decl
) = TREE_CODE (type
) != REFERENCE_TYPE
;
10764 TREE_SIDE_EFFECTS (decl
) = 1;
10765 TREE_THIS_VOLATILE (decl
) = 1;
10772 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
10773 An empty exprlist is a parmlist. An exprlist which
10774 contains only identifiers at the global level
10775 is a parmlist. Otherwise, it is an exprlist. */
10778 parmlist_is_exprlist (exprs
)
10781 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
10784 if (toplevel_bindings_p ())
10786 /* At the global level, if these are all identifiers,
10787 then it is a parmlist. */
10790 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
10792 exprs
= TREE_CHAIN (exprs
);
10799 /* Subroutine of `grokparms'. In a fcn definition, arg types must
10802 C++: also subroutine of `start_function'. */
10805 require_complete_types_for_parms (parms
)
10808 if (processing_template_decl
)
10813 tree type
= TREE_TYPE (parms
);
10814 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
10816 if (DECL_NAME (parms
))
10817 error ("parameter `%s' has incomplete type",
10818 IDENTIFIER_POINTER (DECL_NAME (parms
)));
10820 error ("parameter has incomplete type");
10821 TREE_TYPE (parms
) = error_mark_node
;
10824 /* If the arg types are incomplete in a declaration,
10825 they must include undefined tags.
10826 These tags can never be defined in the scope of the declaration,
10827 so the types can never be completed,
10828 and no call can be compiled successfully. */
10829 /* This is not the right behavior for C++, but not having
10830 it is also probably wrong. */
10833 /* Now warn if is a pointer to an incomplete type. */
10834 while (TREE_CODE (type
) == POINTER_TYPE
10835 || TREE_CODE (type
) == REFERENCE_TYPE
)
10836 type
= TREE_TYPE (type
);
10837 type
= TYPE_MAIN_VARIANT (type
);
10838 if (TYPE_SIZE (type
) == NULL_TREE
)
10840 if (DECL_NAME (parm
) != NULL_TREE
)
10841 warning ("parameter `%s' points to incomplete type",
10842 IDENTIFIER_POINTER (DECL_NAME (parm
)));
10844 warning ("parameter points to incomplete type");
10848 parms
= TREE_CHAIN (parms
);
10852 /* Decode the list of parameter types for a function type.
10853 Given the list of things declared inside the parens,
10854 return a list of types.
10856 The list we receive can have three kinds of elements:
10857 an IDENTIFIER_NODE for names given without types,
10858 a TREE_LIST node for arguments given as typespecs or names with typespecs,
10859 or void_type_node, to mark the end of an argument list
10860 when additional arguments are not permitted (... was not used).
10862 FUNCDEF_FLAG is nonzero for a function definition, 0 for
10863 a mere declaration. A nonempty identifier-list gets an error message
10864 when FUNCDEF_FLAG is zero.
10865 If FUNCDEF_FLAG is 1, then parameter types must be complete.
10866 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
10868 If all elements of the input list contain types,
10869 we return a list of the types.
10870 If all elements contain no type (except perhaps a void_type_node
10871 at the end), we return a null list.
10872 If some have types and some do not, it is an error, and we
10873 return a null list.
10875 Also set last_function_parms to either
10876 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
10877 A list of names is converted to a chain of PARM_DECLs
10878 by store_parm_decls so that ultimately it is always a chain of decls.
10880 Note that in C++, parameters can take default values. These default
10881 values are in the TREE_PURPOSE field of the TREE_LIST. It is
10882 an error to specify default values which are followed by parameters
10883 that have no default values, or an ELLIPSES. For simplicities sake,
10884 only parameters which are specified with their types can take on
10888 grokparms (first_parm
, funcdef_flag
)
10892 tree result
= NULL_TREE
;
10893 tree decls
= NULL_TREE
;
10895 if (first_parm
!= NULL_TREE
10896 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
10898 if (! funcdef_flag
)
10899 pedwarn ("parameter names (without types) in function declaration");
10900 last_function_parms
= first_parm
;
10903 else if (first_parm
!= NULL_TREE
10904 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
10905 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
10906 my_friendly_abort (145);
10909 /* Types were specified. This is a list of declarators
10910 each represented as a TREE_LIST node. */
10911 register tree parm
, chain
;
10912 int any_init
= 0, any_error
= 0;
10914 if (first_parm
!= NULL_TREE
)
10916 tree last_result
= NULL_TREE
;
10917 tree last_decl
= NULL_TREE
;
10919 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
10921 tree type
= NULL_TREE
, list_node
= parm
;
10922 register tree decl
= TREE_VALUE (parm
);
10923 tree init
= TREE_PURPOSE (parm
);
10925 chain
= TREE_CHAIN (parm
);
10926 /* @@ weak defense against parse errors. */
10927 if (TREE_CODE (decl
) != VOID_TYPE
10928 && TREE_CODE (decl
) != TREE_LIST
)
10930 /* Give various messages as the need arises. */
10931 if (TREE_CODE (decl
) == STRING_CST
)
10932 cp_error ("invalid string constant `%E'", decl
);
10933 else if (TREE_CODE (decl
) == INTEGER_CST
)
10934 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
10938 if (TREE_CODE (decl
) != VOID_TYPE
)
10940 decl
= grokdeclarator (TREE_VALUE (decl
),
10941 TREE_PURPOSE (decl
),
10942 PARM
, init
!= NULL_TREE
,
10947 /* Top-level qualifiers on the parameters are
10948 ignored for function types. */
10949 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
10951 if (TREE_CODE (type
) == VOID_TYPE
)
10952 decl
= void_type_node
;
10953 else if (TREE_CODE (type
) == METHOD_TYPE
)
10955 if (DECL_NAME (decl
))
10956 /* Cannot use the decl here because
10957 we don't have DECL_CONTEXT set up yet. */
10958 cp_error ("parameter `%D' invalidly declared method type",
10961 error ("parameter invalidly declared method type");
10962 type
= build_pointer_type (type
);
10963 TREE_TYPE (decl
) = type
;
10965 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10967 if (DECL_NAME (decl
))
10968 cp_error ("parameter `%D' invalidly declared offset type",
10971 error ("parameter invalidly declared offset type");
10972 type
= build_pointer_type (type
);
10973 TREE_TYPE (decl
) = type
;
10975 else if (TREE_CODE (type
) == RECORD_TYPE
10976 && TYPE_LANG_SPECIFIC (type
)
10977 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
10979 abstract_virtuals_error (decl
, type
);
10980 any_error
= 1; /* Seems like a good idea. */
10982 else if (TREE_CODE (type
) == RECORD_TYPE
10983 && TYPE_LANG_SPECIFIC (type
)
10984 && IS_SIGNATURE (type
))
10986 signature_error (decl
, type
);
10987 any_error
= 1; /* Seems like a good idea. */
10989 else if (POINTER_TYPE_P (type
))
10992 while (POINTER_TYPE_P (t
)
10993 || (TREE_CODE (t
) == ARRAY_TYPE
10994 && TYPE_DOMAIN (t
) != NULL_TREE
))
10996 if (TREE_CODE (t
) == ARRAY_TYPE
)
10997 cp_error ("parameter type `%T' includes %s to array of unknown bound",
10999 TYPE_PTR_P (type
) ? "pointer" : "reference");
11003 if (TREE_CODE (decl
) == VOID_TYPE
)
11005 if (result
== NULL_TREE
)
11007 result
= void_list_node
;
11008 last_result
= result
;
11012 TREE_CHAIN (last_result
) = void_list_node
;
11013 last_result
= void_list_node
;
11016 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11017 error ("`void' in parameter list must be entire list");
11021 /* Since there is a prototype, args are passed in their own types. */
11022 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11023 #ifdef PROMOTE_PROTOTYPES
11024 if ((TREE_CODE (type
) == INTEGER_TYPE
11025 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11026 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11027 DECL_ARG_TYPE (decl
) = integer_type_node
;
11034 if (TREE_CODE (init
) == SAVE_EXPR
)
11035 PARM_DECL_EXPR (init
) = 1;
11036 else if (processing_template_decl
)
11038 /* Unparsed default arg from in-class decl. */
11039 else if (TREE_CODE (init
) == DEFAULT_ARG
)
11041 else if (TREE_CODE (init
) == VAR_DECL
11042 || TREE_CODE (init
) == PARM_DECL
)
11044 if (IDENTIFIER_LOCAL_VALUE (DECL_NAME (init
)))
11046 /* ``Local variables may not be used in default
11047 argument expressions.'' dpANSI C++ 8.2.6 */
11048 /* If extern int i; within a function is not
11049 considered a local variable, then this code is
11051 cp_error ("local variable `%D' may not be used as a default argument", init
);
11054 else if (TREE_READONLY_DECL_P (init
))
11055 init
= decl_constant_value (init
);
11058 init
= require_instantiated_type (type
, init
, integer_zero_node
);
11059 if (! processing_template_decl
11060 && init
!= error_mark_node
11061 && TREE_CODE (init
) != DEFAULT_ARG
11062 && ! can_convert_arg (type
, TREE_TYPE (init
), init
))
11063 cp_pedwarn ("invalid type `%T' for default argument to `%#D'",
11064 TREE_TYPE (init
), decl
);
11070 if (decls
== NULL_TREE
)
11077 TREE_CHAIN (last_decl
) = decl
;
11080 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11082 TREE_PURPOSE (list_node
) = init
;
11083 TREE_VALUE (list_node
) = type
;
11084 TREE_CHAIN (list_node
) = NULL_TREE
;
11087 list_node
= saveable_tree_cons (init
, type
, NULL_TREE
);
11088 if (result
== NULL_TREE
)
11090 result
= list_node
;
11091 last_result
= result
;
11095 TREE_CHAIN (last_result
) = list_node
;
11096 last_result
= list_node
;
11100 TREE_CHAIN (last_result
) = NULL_TREE
;
11101 /* If there are no parameters, and the function does not end
11102 with `...', then last_decl will be NULL_TREE. */
11103 if (last_decl
!= NULL_TREE
)
11104 TREE_CHAIN (last_decl
) = NULL_TREE
;
11108 last_function_parms
= decls
;
11110 /* In a fcn definition, arg types must be complete. */
11111 if (funcdef_flag
> 0)
11112 require_complete_types_for_parms (last_function_parms
);
11117 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11118 FUNCTION_TYPE with the newly parsed version of its default argument, which
11119 was previously digested as text. See snarf_defarg et al in lex.c. */
11122 replace_defarg (arg
, init
)
11125 if (! processing_template_decl
11126 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11127 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11128 TREE_TYPE (init
), TREE_VALUE (arg
));
11129 TREE_PURPOSE (arg
) = init
;
11136 tree t
= FUNCTION_ARG_CHAIN (d
);
11137 if (DECL_CONSTRUCTOR_P (d
)
11138 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11139 t
= TREE_CHAIN (t
);
11140 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11141 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11142 == DECL_CLASS_CONTEXT (d
))
11143 && (TREE_CHAIN (t
) == NULL_TREE
11144 || TREE_CHAIN (t
) == void_list_node
11145 || TREE_PURPOSE (TREE_CHAIN (t
))))
11150 /* These memoizing functions keep track of special properties which
11151 a class may have. `grok_ctor_properties' notices whether a class
11152 has a constructor of the form X(X&), and also complains
11153 if the class has a constructor of the form X(X).
11154 `grok_op_properties' takes notice of the various forms of
11155 operator= which are defined, as well as what sorts of type conversion
11156 may apply. Both functions take a FUNCTION_DECL as an argument. */
11159 grok_ctor_properties (ctype
, decl
)
11162 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11163 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11165 /* When a type has virtual baseclasses, a magical first int argument is
11166 added to any ctor so we can tell if the class has been initialized
11167 yet. This could screw things up in this function, so we deliberately
11168 ignore the leading int if we're in that situation. */
11169 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11171 my_friendly_assert (parmtypes
11172 && TREE_VALUE (parmtypes
) == integer_type_node
,
11174 parmtypes
= TREE_CHAIN (parmtypes
);
11175 parmtype
= TREE_VALUE (parmtypes
);
11178 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11179 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11180 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11181 || TREE_CHAIN (parmtypes
) == void_list_node
11182 || TREE_PURPOSE (TREE_CHAIN (parmtypes
))))
11184 TYPE_HAS_INIT_REF (ctype
) = 1;
11185 if (TYPE_READONLY (TREE_TYPE (parmtype
)))
11186 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11188 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11189 && TREE_CHAIN (parmtypes
) != NULL_TREE
11190 && TREE_CHAIN (parmtypes
) == void_list_node
)
11192 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11194 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11197 else if (TREE_CODE (parmtype
) == VOID_TYPE
11198 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11199 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11204 /* An operator with this name can be either unary or binary. */
11210 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11211 || name
== ansi_opname
[(int) ADDR_EXPR
]
11212 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11213 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11214 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11215 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11218 /* An operator with this name can only be unary. */
11224 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11225 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11226 || name
== ansi_opname
[(int) COMPONENT_REF
]
11227 || OPERATOR_TYPENAME_P (name
));
11230 /* Do a little sanity-checking on how they declared their operator. */
11233 grok_op_properties (decl
, virtualp
, friendp
)
11235 int virtualp
, friendp
;
11237 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11238 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11239 tree name
= DECL_NAME (decl
);
11241 if (current_class_type
== NULL_TREE
)
11246 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11247 TYPE_HAS_ASSIGNMENT (current_class_type
) = 1;
11248 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11249 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11250 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11251 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11252 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11253 || name
== ansi_opname
[(int) MEMBER_REF
])
11254 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11255 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11256 TYPE_GETS_NEW (current_class_type
) |= 1;
11257 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11258 TYPE_GETS_DELETE (current_class_type
) |= 1;
11259 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11260 TYPE_GETS_NEW (current_class_type
) |= 2;
11261 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11262 TYPE_GETS_DELETE (current_class_type
) |= 2;
11265 if (name
== ansi_opname
[(int) NEW_EXPR
]
11266 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11268 /* When the compiler encounters the definition of A::operator new, it
11269 doesn't look at the class declaration to find out if it's static. */
11271 revert_static_member_fn (&decl
, NULL
, NULL
);
11273 /* Take care of function decl if we had syntax errors. */
11274 if (argtypes
== NULL_TREE
)
11276 = build_function_type (ptr_type_node
,
11277 hash_tree_chain (integer_type_node
,
11280 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11282 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11283 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11286 revert_static_member_fn (&decl
, NULL
, NULL
);
11288 if (argtypes
== NULL_TREE
)
11290 = build_function_type (void_type_node
,
11291 hash_tree_chain (ptr_type_node
,
11295 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11297 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11298 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11299 != void_list_node
))
11300 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11305 /* An operator function must either be a non-static member function
11306 or have at least one parameter of a class, a reference to a class,
11307 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11308 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11310 if (OPERATOR_TYPENAME_P (name
)
11311 || name
== ansi_opname
[(int) CALL_EXPR
]
11312 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11313 || name
== ansi_opname
[(int) COMPONENT_REF
]
11314 || name
== ansi_opname
[(int) ARRAY_REF
])
11315 cp_error ("`%D' must be a nonstatic member function", decl
);
11320 if (DECL_STATIC_FUNCTION_P (decl
))
11321 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11324 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11326 tree arg
= TREE_VALUE (p
);
11327 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11328 arg
= TREE_TYPE (arg
);
11330 /* This lets bad template code slip through. */
11331 if (IS_AGGR_TYPE (arg
)
11332 || TREE_CODE (arg
) == ENUMERAL_TYPE
11333 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11334 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11338 ("`%D' must have an argument of class or enumerated type",
11345 if (name
== ansi_opname
[(int) CALL_EXPR
])
11346 return; /* No restrictions on args. */
11348 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11350 tree t
= TREE_TYPE (name
);
11351 if (TREE_CODE (t
) == VOID_TYPE
)
11352 pedwarn ("void is not a valid type conversion operator");
11353 else if (! friendp
)
11355 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11358 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11360 if (t
== current_class_type
)
11361 what
= "the same type";
11362 /* Don't force t to be complete here. */
11363 else if (IS_AGGR_TYPE (t
)
11365 && DERIVED_FROM_P (t
, current_class_type
))
11366 what
= "a base class";
11369 warning ("conversion to %s%s will never use a type conversion operator",
11370 ref
? "a reference to " : "", what
);
11374 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11378 if (list_length (argtypes
) != 3 && methodp
)
11380 cp_error ("`%D' must take exactly one argument", decl
);
11383 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11385 if (copy_assignment_arg_p (parmtype
, virtualp
)
11388 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11389 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11390 || TYPE_READONLY (TREE_TYPE (parmtype
)))
11391 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11394 else if (name
== ansi_opname
[(int) COND_EXPR
])
11397 pedwarn ("ANSI C++ prohibits overloading operator ?:");
11398 if (list_length (argtypes
) != 4)
11399 cp_error ("`%D' must take exactly three arguments", decl
);
11401 else if (ambi_op_p (name
))
11403 if (list_length (argtypes
) == 2)
11405 else if (list_length (argtypes
) == 3)
11407 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11408 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11409 && ! processing_template_decl
11410 && TREE_VALUE (TREE_CHAIN (argtypes
)) != integer_type_node
)
11413 cp_error ("postfix `%D' must take `int' as its argument",
11417 ("postfix `%D' must take `int' as its second argument",
11424 cp_error ("`%D' must take either zero or one argument", decl
);
11426 cp_error ("`%D' must take either one or two arguments", decl
);
11429 /* More Effective C++ rule 6. */
11431 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11432 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11434 tree arg
= TREE_VALUE (argtypes
);
11435 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11436 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11437 arg
= TREE_TYPE (arg
);
11438 arg
= TYPE_MAIN_VARIANT (arg
);
11439 if (list_length (argtypes
) == 2)
11441 if (TREE_CODE (ret
) != REFERENCE_TYPE
11442 || !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11444 cp_warning ("prefix `%D' should return `%T'", decl
,
11445 build_reference_type (arg
));
11449 if (!comptypes (TYPE_MAIN_VARIANT (ret
), arg
, 1))
11450 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11454 else if (unary_op_p (name
))
11456 if (list_length (argtypes
) != 2)
11459 cp_error ("`%D' must take `void'", decl
);
11461 cp_error ("`%D' must take exactly one argument", decl
);
11464 else /* if (binary_op_p (name)) */
11466 if (list_length (argtypes
) != 3)
11469 cp_error ("`%D' must take exactly one argument", decl
);
11471 cp_error ("`%D' must take exactly two arguments", decl
);
11474 /* More Effective C++ rule 7. */
11476 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11477 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11478 || name
== ansi_opname
[COMPOUND_EXPR
]))
11479 cp_warning ("user-defined `%D' always evaluates both arguments",
11483 /* Effective C++ rule 23. */
11485 && list_length (argtypes
) == 3
11486 && (name
== ansi_opname
[PLUS_EXPR
]
11487 || name
== ansi_opname
[MINUS_EXPR
]
11488 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11489 || name
== ansi_opname
[MULT_EXPR
])
11490 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11491 cp_warning ("`%D' should return by value", decl
);
11495 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11496 if (TREE_PURPOSE (argtypes
))
11498 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11499 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11500 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11503 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11506 cp_error ("`%D' cannot have default arguments", decl
);
11511 /* Get the struct, enum or union (CODE says which) with tag NAME.
11512 Define the tag as a forward-reference if it is not defined.
11514 C++: If a class derivation is given, process it here, and report
11515 an error if multiple derivation declarations are not identical.
11517 If this is a definition, come in through xref_tag and only look in
11518 the current frame for the name (since C++ allows new names in any
11522 xref_tag (code_type_node
, name
, globalize
)
11523 tree code_type_node
;
11527 enum tag_types tag_code
;
11528 enum tree_code code
;
11530 register tree ref
, t
;
11531 struct binding_level
*b
= inner_binding_level
;
11533 tree attributes
= NULL_TREE
;
11535 /* If we are called from the parser, code_type_node will sometimes be a
11536 TREE_LIST. This indicates that the user wrote
11537 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11539 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11541 attributes
= TREE_PURPOSE (code_type_node
);
11542 code_type_node
= TREE_VALUE (code_type_node
);
11545 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11550 case signature_type
:
11551 code
= RECORD_TYPE
;
11557 code
= ENUMERAL_TYPE
;
11560 my_friendly_abort (18);
11563 /* If a cross reference is requested, look up the type
11564 already defined for this tag and return it. */
11565 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11568 name
= TYPE_IDENTIFIER (t
);
11572 t
= IDENTIFIER_TYPE_VALUE (name
);
11574 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11575 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11580 if (t
&& (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
11581 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
))
11583 cp_error ("redeclaration of template type-parameter `%T'", name
);
11584 cp_error_at (" previously declared here `%#D'",
11585 TEMPLATE_TYPE_DECL (t
));
11587 if (t
&& TYPE_CONTEXT (t
) && got_type
)
11590 /* If we know we are defining this tag, only look it up in
11591 this scope and don't try to find it as a type. */
11592 ref
= lookup_tag (code
, name
, b
, 1);
11596 if (current_class_type
11597 && template_class_depth (current_class_type
)
11598 && PROCESSING_REAL_TEMPLATE_DECL_P ())
11599 /* Since GLOBALIZE is non-zero, we are not looking at a
11600 definition of this tag. Since, in addition, we are currently
11601 processing a (member) template declaration of a template
11602 class, we don't want to do any lookup at all; consider:
11609 { template <class V>
11610 friend struct S1; };
11612 Here, the S2::S1 declaration should not be confused with the
11613 outer declaration. In particular, the inner version should
11614 have a template parameter of level 2, not level 1. This
11615 would be particularly important if the member declaration
11618 template <class V = U> friend struct S1;
11620 say, when we should tsubst into `U' when instantiating S2. */
11627 ref
= lookup_tag (code
, name
, b
, 0);
11631 /* Try finding it as a type declaration. If that wins,
11633 ref
= lookup_name (name
, 1);
11635 if (ref
!= NULL_TREE
11636 && processing_template_decl
11637 && DECL_CLASS_TEMPLATE_P (ref
)
11638 && template_class_depth (current_class_type
) == 0)
11639 /* Since GLOBALIZE is true, we're declaring a global
11640 template, so we want this type. */
11641 ref
= DECL_RESULT (ref
);
11643 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
11644 && TREE_CODE (TREE_TYPE (ref
)) == code
)
11645 ref
= TREE_TYPE (ref
);
11652 push_obstacks_nochange ();
11656 /* If no such tag is yet defined, create a forward-reference node
11657 and record it as the "definition".
11658 When a real declaration of this type is found,
11659 the forward-reference will be altered into a real type. */
11661 /* In C++, since these migrate into the global scope, we must
11662 build them on the permanent obstack. */
11664 temp
= allocation_temporary_p ();
11666 end_temporary_allocation ();
11668 if (code
== ENUMERAL_TYPE
)
11670 cp_error ("use of enum `%#D' without previous declaration", name
);
11672 ref
= make_node (ENUMERAL_TYPE
);
11674 /* Give the type a default layout like unsigned int
11675 to avoid crashing if it does not get defined. */
11676 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
11677 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
11678 TREE_UNSIGNED (ref
) = 1;
11679 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
11680 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
11681 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
11683 /* Enable us to recognize when a type is created in class context.
11684 To do nested classes correctly, this should probably be cleared
11685 out when we leave this classes scope. Currently this in only
11686 done in `start_enum'. */
11688 pushtag (name
, ref
, globalize
);
11692 struct binding_level
*old_b
= class_binding_level
;
11694 ref
= make_lang_type (code
);
11696 if (tag_code
== signature_type
)
11698 SET_SIGNATURE (ref
);
11699 /* Since a signature type will be turned into the type
11700 of signature tables, it's not only an interface. */
11701 CLASSTYPE_INTERFACE_ONLY (ref
) = 0;
11702 SET_CLASSTYPE_INTERFACE_KNOWN (ref
);
11703 /* A signature doesn't have a vtable. */
11704 CLASSTYPE_VTABLE_NEEDS_WRITING (ref
) = 0;
11707 #ifdef NONNESTED_CLASSES
11708 /* Class types don't nest the way enums do. */
11709 class_binding_level
= (struct binding_level
*)0;
11711 pushtag (name
, ref
, globalize
);
11712 class_binding_level
= old_b
;
11717 /* If it no longer looks like a nested type, make sure it's
11719 If it is not an IDENTIFIER, this is not a declaration */
11720 if (b
->namespace_p
&& !class_binding_level
11721 && TREE_CODE (name
) == IDENTIFIER_NODE
)
11723 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
11724 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
11727 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
11728 redeclare_class_template (ref
, current_template_parms
);
11731 /* Until the type is defined, tentatively accept whatever
11732 structure tag the user hands us. */
11733 if (TYPE_SIZE (ref
) == NULL_TREE
11734 && ref
!= current_class_type
11735 /* Have to check this, in case we have contradictory tag info. */
11736 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
11738 if (tag_code
== class_type
)
11739 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
11740 else if (tag_code
== record_type
|| tag_code
== signature_type
)
11741 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
11746 TREE_TYPE (ref
) = attributes
;
11748 if (ref
&& TYPE_P (ref
))
11752 If the identifier resolves to a typedef-name or a template
11753 type-parameter, the elaborated-type-specifier is
11755 if (TYPE_LANG_SPECIFIC (ref
) && TYPE_WAS_ANONYMOUS (ref
))
11756 cp_error ("`%T' is a typedef name", ref
);
11757 else if (TREE_CODE (ref
) == TEMPLATE_TYPE_PARM
)
11758 cp_error ("`%T' is a template type paramter", ref
);
11765 xref_tag_from_type (old
, id
, globalize
)
11769 tree code_type_node
;
11771 if (TREE_CODE (old
) == RECORD_TYPE
)
11772 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
11773 ? class_type_node
: record_type_node
);
11775 code_type_node
= union_type_node
;
11777 if (id
== NULL_TREE
)
11778 id
= TYPE_IDENTIFIER (old
);
11780 return xref_tag (code_type_node
, id
, globalize
);
11784 xref_basetypes (code_type_node
, name
, ref
, binfo
)
11785 tree code_type_node
;
11789 /* In the declaration `A : X, Y, ... Z' we mark all the types
11790 (A, X, Y, ..., Z) so we can check for duplicates. */
11793 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11795 if (tag_code
== union_type
)
11797 cp_error ("derived union `%T' invalid", ref
);
11801 len
= list_length (binfo
);
11802 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
11804 SET_CLASSTYPE_MARKED (ref
);
11805 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
11807 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
11809 /* The base of a derived struct is public by default. */
11811 = (TREE_PURPOSE (binfo
) == access_public_node
11812 || TREE_PURPOSE (binfo
) == access_public_virtual_node
11813 || (tag_code
!= class_type
11814 && (TREE_PURPOSE (binfo
) == access_default_node
11815 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
11817 = (TREE_PURPOSE (binfo
) == access_protected_node
11818 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
11820 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
11821 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
11822 || TREE_PURPOSE (binfo
) == access_public_virtual_node
11823 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
11824 tree basetype
= TREE_VALUE (binfo
);
11827 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
11828 basetype
= TREE_TYPE (basetype
);
11830 || (TREE_CODE (basetype
) != RECORD_TYPE
11831 && TREE_CODE (basetype
) != TYPENAME_TYPE
11832 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
11833 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
11835 cp_error ("base type `%T' fails to be a struct or class type",
11836 TREE_VALUE (binfo
));
11840 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
11843 /* This code replaces similar code in layout_basetypes.
11844 We put the complete_type first for implicit `typename'. */
11845 if (TYPE_SIZE (complete_type (basetype
)) == NULL_TREE
11846 && ! (current_template_parms
&& uses_template_parms (basetype
)))
11848 cp_error ("base class `%T' has incomplete type", basetype
);
11854 if (CLASSTYPE_MARKED (basetype
))
11856 if (basetype
== ref
)
11857 cp_error ("recursive type `%T' undefined", basetype
);
11859 cp_error ("duplicate base type `%T' invalid", basetype
);
11863 if (TYPE_FOR_JAVA (basetype
)
11864 && current_lang_stack
== current_lang_base
)
11865 TYPE_FOR_JAVA (ref
) = 1;
11867 /* Note that the BINFO records which describe individual
11868 inheritances are *not* shared in the lattice! They
11869 cannot be shared because a given baseclass may be
11870 inherited with different `accessibility' by different
11871 derived classes. (Each BINFO record describing an
11872 individual inheritance contains flags which say what
11873 the `accessibility' of that particular inheritance is.) */
11875 base_binfo
= make_binfo (integer_zero_node
, basetype
,
11876 TYPE_BINFO_VTABLE (basetype
),
11877 TYPE_BINFO_VIRTUALS (basetype
));
11879 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
11880 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
11881 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
11882 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
11883 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
11885 /* We need to unshare the binfos now so that lookups during class
11886 definition work. */
11887 unshare_base_binfos (base_binfo
);
11889 SET_CLASSTYPE_MARKED (basetype
);
11891 /* We are free to modify these bits because they are meaningless
11892 at top level, and BASETYPE is a top-level type. */
11893 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
11895 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
11896 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
11899 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
11900 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
11905 TREE_VEC_LENGTH (binfos
) = i
;
11907 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
11910 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
11912 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
11913 = TYPE_USES_MULTIPLE_INHERITANCE (BINFO_TYPE (TREE_VEC_ELT (binfos
, 0)));
11914 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
11915 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
11917 /* Unmark all the types. */
11919 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
11920 CLEAR_CLASSTYPE_MARKED (ref
);
11926 /* Begin compiling the definition of an enumeration type.
11927 NAME is its name (or null if anonymous).
11928 Returns the type object, as yet incomplete.
11929 Also records info about it so that build_enumerator
11930 may be used to declare the individual values as they are read. */
11936 register tree enumtype
= NULL_TREE
;
11937 struct binding_level
*b
= inner_binding_level
;
11939 /* We are wasting space here and putting these on the permanent_obstack so
11940 that typeid(local enum) will work correctly. */
11942 if (processing_template_decl
&& current_function_decl
)
11945 end_temporary_allocation ();
11947 /* If this is the real definition for a previous forward reference,
11948 fill in the contents in the same object that used to be the
11949 forward reference. */
11951 if (name
!= NULL_TREE
)
11952 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
11954 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
11955 cp_error ("multiple definition of `%#T'", enumtype
);
11958 enumtype
= make_node (ENUMERAL_TYPE
);
11959 pushtag (name
, enumtype
, 0);
11962 if (current_class_type
)
11963 TREE_ADDRESSABLE (b
->tags
) = 1;
11965 /* We don't copy this value because build_enumerator needs to do it. */
11966 enum_next_value
= integer_zero_node
;
11969 GNU_xref_decl (current_function_decl
, enumtype
);
11973 /* After processing and defining all the values of an enumeration type,
11974 install their decls in the enumeration type and finish it off.
11975 ENUMTYPE is the type object and VALUES a list of name-value pairs.
11976 Returns ENUMTYPE. */
11979 finish_enum (enumtype
)
11982 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
11983 /* Calculate the maximum value of any enumerator in this type. */
11985 tree values
= TYPE_VALUES (enumtype
);
11990 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
11995 /* The TREE_VALUE is a CONST_DECL for this enumeration
11997 decl
= TREE_VALUE (pair
);
11999 /* The DECL_INITIAL will be NULL if we are processing a
12000 template declaration and this enumeration constant had no
12001 explicit initializer. */
12002 value
= DECL_INITIAL (decl
);
12003 if (value
&& !processing_template_decl
)
12005 /* Set the TREE_TYPE for the VALUE as well. That's so
12006 that when we call decl_constant_value we get an
12007 entity of the right type (but with the constant
12008 value). Since we shouldn't ever call
12009 decl_constant_value on a template type, there's no
12010 reason to do that when processing_template_decl.
12011 And, if the expression is something like a
12012 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12013 wreak havoc on the intended type of the expression.
12015 Of course, there's also no point in trying to compute
12016 minimum or maximum values if we're in a template. */
12017 TREE_TYPE (value
) = enumtype
;
12020 minnode
= maxnode
= value
;
12021 else if (tree_int_cst_lt (maxnode
, value
))
12023 else if (tree_int_cst_lt (value
, minnode
))
12027 if (processing_template_decl
)
12028 /* If this is just a template, leave the CONST_DECL
12029 alone. That way tsubst_copy will find CONST_DECLs for
12030 CONST_DECLs, and not INTEGER_CSTs. */
12033 /* In the list we're building up, we want the enumeration
12034 values, not the CONST_DECLs. */
12035 TREE_VALUE (pair
) = value
;
12039 maxnode
= minnode
= integer_zero_node
;
12041 TYPE_VALUES (enumtype
) = nreverse (values
);
12043 if (processing_template_decl
)
12045 tree scope
= current_scope ();
12046 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12048 add_tree (build_min (TAG_DEFN
, enumtype
));
12049 resume_temporary_allocation ();
12055 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12056 int lowprec
= min_precision (minnode
, unsignedp
);
12057 int highprec
= min_precision (maxnode
, unsignedp
);
12058 int precision
= MAX (lowprec
, highprec
);
12060 TYPE_SIZE (enumtype
) = NULL_TREE
;
12062 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12064 TYPE_PRECISION (enumtype
) = precision
;
12066 fixup_unsigned_type (enumtype
);
12068 fixup_signed_type (enumtype
);
12070 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12071 /* Use the width of the narrowest normal C type which is wide enough. */
12072 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12075 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12077 TYPE_SIZE (enumtype
) = 0;
12078 layout_type (enumtype
);
12084 /* Fix up all variant types of this enum type. */
12085 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12086 tem
= TYPE_NEXT_VARIANT (tem
))
12088 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12089 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12090 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12091 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12092 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12093 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12094 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12095 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12096 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12100 /* Finish debugging output for this type. */
12101 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12106 /* Build and install a CONST_DECL for an enumeration constant of the
12107 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12108 Assignment of sequential values by default is handled here. */
12111 build_enumerator (name
, value
, type
)
12119 /* Remove no-op casts from the value. */
12121 STRIP_TYPE_NOPS (value
);
12123 if (! processing_template_decl
)
12125 /* Validate and default VALUE. */
12126 if (value
!= NULL_TREE
)
12128 if (TREE_READONLY_DECL_P (value
))
12129 value
= decl_constant_value (value
);
12131 if (TREE_CODE (value
) == INTEGER_CST
)
12133 value
= default_conversion (value
);
12134 constant_expression_warning (value
);
12138 cp_error ("enumerator value for `%D' not integer constant", name
);
12143 /* Default based on previous value. */
12144 if (value
== NULL_TREE
&& ! processing_template_decl
)
12146 value
= enum_next_value
;
12148 cp_error ("overflow in enumeration values at `%D'", name
);
12151 /* Remove no-op casts from the value. */
12153 STRIP_TYPE_NOPS (value
);
12155 /* To fix MAX_VAL enum consts. (bkoz) */
12156 TREE_TYPE (value
) = integer_type_node
;
12160 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12161 Even in other cases, we will later (in finish_enum) be setting the
12163 if (value
!= NULL_TREE
)
12164 value
= copy_node (value
);
12166 /* C++ associates enums with global, function, or class declarations. */
12168 context
= current_scope ();
12169 if (context
&& context
== current_class_type
)
12170 /* This enum declaration is local to the class. */
12171 decl
= build_lang_field_decl (CONST_DECL
, name
, type
);
12173 /* It's a global enum, or it's local to a function. (Note local to
12174 a function could mean local to a class method. */
12175 decl
= build_decl (CONST_DECL
, name
, type
);
12177 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12178 DECL_INITIAL (decl
) = value
;
12179 TREE_READONLY (decl
) = 1;
12181 if (context
&& context
== current_class_type
)
12183 pushdecl_class_level (decl
);
12184 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12185 on the TYPE_FIELDS list for `S'. (That's so that you can say
12186 things like `S::i' later.) */
12187 finish_member_declaration (decl
);
12192 GNU_xref_decl (current_function_decl
, decl
);
12195 if (! processing_template_decl
)
12197 /* Set basis for default for next value. */
12198 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12199 integer_one_node
, PLUS_EXPR
);
12200 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12203 result
= saveable_tree_cons (name
, decl
, NULL_TREE
);
12208 static int function_depth
;
12210 /* Create the FUNCTION_DECL for a function definition.
12211 DECLSPECS and DECLARATOR are the parts of the declaration;
12212 they describe the function's name and the type it returns,
12213 but twisted together in a fashion that parallels the syntax of C.
12215 This function creates a binding context for the function body
12216 as well as setting up the FUNCTION_DECL in current_function_decl.
12218 Returns 1 on success. If the DECLARATOR is not suitable for a function
12219 (it defines a datum instead), we return 0, which tells
12220 yyparse to report a parse error.
12222 For C++, we must first check whether that datum makes any sense.
12223 For example, "class A local_a(1,2);" means that variable local_a
12224 is an aggregate of type A, which should have a constructor
12225 applied to it with the argument list [1, 2].
12227 @@ There is currently no way to retrieve the storage
12228 @@ allocated to FUNCTION (or all of its parms) if we return
12229 @@ something we had previously. */
12232 start_function (declspecs
, declarator
, attrs
, pre_parsed_p
)
12233 tree declspecs
, declarator
, attrs
;
12237 tree ctype
= NULL_TREE
;
12240 extern int have_extern_spec
;
12241 extern int used_extern_spec
;
12242 int doing_friend
= 0;
12244 /* Sanity check. */
12245 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12246 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12248 /* Assume, until we see it does. */
12249 current_function_returns_value
= 0;
12250 current_function_returns_null
= 0;
12251 warn_about_return_type
= 0;
12253 shadowed_labels
= 0;
12254 current_function_assigns_this
= 0;
12255 current_function_just_assigned_this
= 0;
12256 current_function_parms_stored
= 0;
12257 original_result_rtx
= NULL_RTX
;
12258 base_init_expr
= NULL_TREE
;
12259 current_base_init_list
= NULL_TREE
;
12260 current_member_init_list
= NULL_TREE
;
12261 ctor_label
= dtor_label
= NULL_TREE
;
12262 static_labelno
= 0;
12264 clear_temp_name ();
12266 /* This should only be done once on the top most decl. */
12267 if (have_extern_spec
&& !used_extern_spec
)
12269 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12270 used_extern_spec
= 1;
12275 decl1
= declarator
;
12278 /* What was this testing for, exactly? */
12279 if (! DECL_ARGUMENTS (decl1
)
12280 && !DECL_STATIC_FUNCTION_P (decl1
)
12281 && !DECL_ARTIFICIAL (decl1
)
12282 && DECL_CLASS_SCOPE_P (decl1
)
12283 && TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))
12284 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))))
12286 tree binding
= binding_for_name (DECL_NAME (decl1
),
12287 current_namespace
);
12288 cp_error ("redeclaration of `%#D'", decl1
);
12289 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)))
12290 cp_error_at ("previous declaration here", IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)));
12291 else if (BINDING_VALUE (binding
))
12292 cp_error_at ("previous declaration here", BINDING_VALUE (binding
));
12296 fntype
= TREE_TYPE (decl1
);
12297 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12298 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12300 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12301 class is in the (lexical) scope of the class in which it is
12303 if (!ctype
&& DECL_FRIEND_P (decl1
))
12305 ctype
= DECL_CLASS_CONTEXT (decl1
);
12307 /* CTYPE could be null here if we're dealing with a template;
12308 for example, `inline friend float foo()' inside a template
12309 will have no CTYPE set. */
12310 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12316 /* In a fcn definition, arg types must be complete. */
12317 require_complete_types_for_parms (DECL_ARGUMENTS (decl1
));
12319 /* In case some arg types were completed since the declaration was
12320 parsed, fix up the decls. */
12322 tree t
= DECL_ARGUMENTS (decl1
);
12323 for (; t
; t
= TREE_CHAIN (t
))
12324 layout_decl (t
, 0);
12327 last_function_parms
= DECL_ARGUMENTS (decl1
);
12328 last_function_parm_tags
= NULL_TREE
;
12332 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12333 /* If the declarator is not suitable for a function definition,
12334 cause a syntax error. */
12335 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12337 fntype
= TREE_TYPE (decl1
);
12339 restype
= TREE_TYPE (fntype
);
12340 if (IS_AGGR_TYPE (restype
) && ! TYPE_PTRMEMFUNC_P (restype
)
12341 && ! CLASSTYPE_GOT_SEMICOLON (restype
))
12343 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12344 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12345 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12346 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12347 fntype
= build_function_type (integer_type_node
,
12348 TYPE_ARG_TYPES (fntype
));
12350 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12352 TYPE_ARG_TYPES (fntype
));
12353 TREE_TYPE (decl1
) = fntype
;
12356 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12357 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12358 else if (DECL_MAIN_P (decl1
))
12360 /* If this doesn't return integer_type, complain. */
12361 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12363 if (pedantic
|| warn_return_type
)
12364 pedwarn ("return type for `main' changed to `int'");
12365 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12367 warn_about_return_type
= 0;
12371 /* Warn if function was previously implicitly declared
12372 (but not if we warned then). */
12373 if (! warn_implicit
12374 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12375 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12377 current_function_decl
= decl1
;
12378 /* Save the parm names or decls from this function's declarator
12379 where store_parm_decls will find them. */
12380 current_function_parms
= last_function_parms
;
12381 current_function_parm_tags
= last_function_parm_tags
;
12383 announce_function (decl1
);
12385 if (! processing_template_decl
)
12387 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12389 cp_error ("return-type `%#T' is an incomplete type",
12390 TREE_TYPE (fntype
));
12392 /* Make it return void instead, but don't change the
12393 type of the DECL_RESULT, in case we have a named return value. */
12396 = build_cplus_method_type (build_type_variant (ctype
,
12397 TREE_READONLY (decl1
),
12398 TREE_SIDE_EFFECTS (decl1
)),
12400 FUNCTION_ARG_CHAIN (decl1
));
12403 = build_function_type (void_type_node
,
12404 TYPE_ARG_TYPES (TREE_TYPE (decl1
)));
12405 DECL_RESULT (decl1
)
12406 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)));
12407 TREE_READONLY (DECL_RESULT (decl1
)) = TYPE_READONLY (TREE_TYPE (fntype
));
12408 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = TYPE_VOLATILE (TREE_TYPE (fntype
));
12411 if (TYPE_LANG_SPECIFIC (TREE_TYPE (fntype
))
12412 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (fntype
)))
12413 abstract_virtuals_error (decl1
, TREE_TYPE (fntype
));
12416 if (warn_about_return_type
)
12417 pedwarn ("return-type defaults to `int'");
12419 /* Effective C++ rule 15. See also c_expand_return. */
12421 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12422 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12423 cp_warning ("`operator=' should return a reference to `*this'");
12425 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12426 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12427 DECL_INITIAL (decl1
) = error_mark_node
;
12429 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12430 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12433 /* This function exists in static storage.
12434 (This does not mean `static' in the C sense!) */
12435 TREE_STATIC (decl1
) = 1;
12437 /* Set up current_class_type, and enter the scope of the class, if
12440 push_nested_class (ctype
, 1);
12441 else if (DECL_STATIC_FUNCTION_P (decl1
))
12442 push_nested_class (DECL_CONTEXT (decl1
), 2);
12444 /* We must call push_template_decl after current_class_type is set
12445 up. (If we are processing inline definitions after exiting a
12446 class scope, current_class_type will be NULL_TREE until set above
12447 by push_nested_class.) */
12448 if (processing_template_decl
)
12449 decl1
= push_template_decl (decl1
);
12451 /* Record the decl so that the function name is defined.
12452 If we already have a decl for this name, and it is a FUNCTION_DECL,
12453 use the old decl. */
12454 if (!processing_template_decl
&& pre_parsed_p
== 0)
12456 /* A specialization is not used to guide overload resolution. */
12457 if ((flag_guiding_decls
12458 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12459 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12460 decl1
= pushdecl (decl1
);
12463 /* We need to set the DECL_CONTEXT. */
12464 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12465 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12466 /* And make sure we have enough default args. */
12467 check_default_args (decl1
);
12469 DECL_MAIN_VARIANT (decl1
) = decl1
;
12470 fntype
= TREE_TYPE (decl1
);
12473 current_function_decl
= decl1
;
12475 if (DECL_INTERFACE_KNOWN (decl1
))
12477 tree ctx
= hack_decl_function_context (decl1
);
12479 if (DECL_NOT_REALLY_EXTERN (decl1
))
12480 DECL_EXTERNAL (decl1
) = 0;
12482 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12483 && TREE_PUBLIC (ctx
))
12484 /* This is a function in a local class in an extern inline
12486 comdat_linkage (decl1
);
12488 /* If this function belongs to an interface, it is public.
12489 If it belongs to someone else's interface, it is also external.
12490 It doesn't matter whether it's inline or not. */
12491 else if (interface_unknown
== 0
12492 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12493 || flag_alt_external_templates
))
12495 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12496 || processing_template_decl
)
12497 DECL_EXTERNAL (decl1
)
12499 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
));
12501 DECL_EXTERNAL (decl1
) = 0;
12502 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
12503 DECL_INTERFACE_KNOWN (decl1
) = 1;
12507 /* This is a definition, not a reference.
12508 So clear DECL_EXTERNAL. */
12509 DECL_EXTERNAL (decl1
) = 0;
12511 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
12512 && ! DECL_INTERFACE_KNOWN (decl1
)
12513 /* Don't try to defer nested functions for now. */
12514 && ! hack_decl_function_context (decl1
))
12515 DECL_DEFER_OUTPUT (decl1
) = 1;
12517 DECL_INTERFACE_KNOWN (decl1
) = 1;
12520 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
12522 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12523 TREE_TYPE (decl1
) = fntype
12524 = build_function_type (TREE_TYPE (fntype
),
12525 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
12526 current_function_parms
= TREE_CHAIN (current_function_parms
);
12527 DECL_ARGUMENTS (decl1
) = current_function_parms
;
12530 restype
= TREE_TYPE (fntype
);
12534 /* If we're compiling a friend function, neither of the variables
12535 current_class_ptr nor current_class_type will have values. */
12536 if (! doing_friend
)
12538 /* We know that this was set up by `grokclassfn'.
12539 We do not wait until `store_parm_decls', since evil
12540 parse errors may never get us to that point. Here
12541 we keep the consistency between `current_class_type'
12542 and `current_class_ptr'. */
12543 tree t
= current_function_parms
;
12545 my_friendly_assert (t
!= NULL_TREE
12546 && TREE_CODE (t
) == PARM_DECL
, 162);
12548 if (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
)
12550 int i
= suspend_momentary ();
12552 /* Fool build_indirect_ref. */
12553 current_class_ptr
= NULL_TREE
;
12554 current_class_ref
= build_indirect_ref (t
, NULL_PTR
);
12555 current_class_ptr
= t
;
12556 resume_momentary (i
);
12559 /* We're having a signature pointer here. */
12560 current_class_ref
= current_class_ptr
= t
;
12566 current_class_ptr
= current_class_ref
= NULL_TREE
;
12570 current_binding_level
->parm_flag
= 1;
12572 GNU_xref_function (decl1
, current_function_parms
);
12575 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
12577 make_function_rtl (decl1
);
12579 /* Promote the value to int before returning it. */
12580 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
12581 restype
= type_promotes_to (restype
);
12583 /* If this fcn was already referenced via a block-scope `extern' decl
12584 (or an implicit decl), propagate certain information about the usage. */
12585 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
12586 TREE_ADDRESSABLE (decl1
) = 1;
12588 if (DECL_RESULT (decl1
) == NULL_TREE
)
12590 DECL_RESULT (decl1
)
12591 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12592 TREE_READONLY (DECL_RESULT (decl1
)) = TYPE_READONLY (restype
);
12593 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = TYPE_VOLATILE (restype
);
12596 /* Allocate further tree nodes temporarily during compilation
12597 of this function only. Tiemann moved up here from bottom of fn. */
12598 /* If this is a nested function, then we must continue to allocate RTL
12599 on the permanent obstack in case we need to inline it later. */
12600 if (! hack_decl_function_context (decl1
))
12601 temporary_allocation ();
12603 if (processing_template_decl
)
12605 ++minimal_parse_mode
;
12606 last_tree
= DECL_SAVED_TREE (decl1
)
12607 = build_nt (EXPR_STMT
, void_zero_node
);
12612 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
12613 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
12615 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
12616 ctor_label
= NULL_TREE
;
12620 dtor_label
= NULL_TREE
;
12621 if (DECL_CONSTRUCTOR_P (decl1
))
12622 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
12628 /* Called after store_parm_decls for a function-try-block. We need to update
12629 last_parm_cleanup_insn so that the base initializers for a constructor
12630 are run within this block, not before it. */
12633 expand_start_early_try_stmts ()
12635 expand_start_try_stmts ();
12636 last_parm_cleanup_insn
= get_last_insn ();
12639 /* Store the parameter declarations into the current function declaration.
12640 This is called after parsing the parameter declarations, before
12641 digesting the body of the function.
12643 Also install to binding contour return value identifier, if any. */
12646 store_parm_decls ()
12648 register tree fndecl
= current_function_decl
;
12649 register tree parm
;
12650 int parms_have_cleanups
= 0;
12651 tree cleanups
= NULL_TREE
;
12653 /* This is either a chain of PARM_DECLs (when a prototype is used). */
12654 tree specparms
= current_function_parms
;
12656 /* This is a list of types declared among parms in a prototype. */
12657 tree parmtags
= current_function_parm_tags
;
12659 /* This is a chain of any other decls that came in among the parm
12660 declarations. If a parm is declared with enum {foo, bar} x;
12661 then CONST_DECLs for foo and bar are put here. */
12662 tree nonparms
= NULL_TREE
;
12664 if (toplevel_bindings_p ())
12665 fatal ("parse errors have confused me too much");
12667 /* Initialize RTL machinery. */
12668 init_function_start (fndecl
, input_filename
, lineno
);
12670 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
12671 declare_function_name ();
12673 /* Create a binding level for the parms. */
12674 expand_start_bindings (0);
12676 if (specparms
!= NULL_TREE
)
12678 /* This case is when the function was defined with an ANSI prototype.
12679 The parms already have decls, so we need not do anything here
12680 except record them as in effect
12681 and complain if any redundant old-style parm decls were written. */
12683 register tree next
;
12685 /* Must clear this because it might contain TYPE_DECLs declared
12687 storedecls (NULL_TREE
);
12689 for (parm
= nreverse (specparms
); parm
; parm
= next
)
12691 next
= TREE_CHAIN (parm
);
12692 if (TREE_CODE (parm
) == PARM_DECL
)
12695 if (DECL_NAME (parm
) == NULL_TREE
)
12699 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
12700 cp_error ("parameter `%D' declared void", parm
);
12703 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
12704 A parameter is assumed not to have any side effects.
12705 If this should change for any reason, then this
12706 will have to wrap the bashed reference type in a save_expr.
12708 Also, if the parameter type is declared to be an X
12709 and there is an X(X&) constructor, we cannot lay it
12710 into the stack (any more), so we make this parameter
12711 look like it is really of reference type. Functions
12712 which pass parameters to this function will know to
12713 create a temporary in their frame, and pass a reference
12716 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
12717 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
12718 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
12722 if (! processing_template_decl
12723 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
12725 expand_decl (parm
);
12726 parms_have_cleanups
= 1;
12728 /* Keep track of the cleanups. */
12729 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
12734 /* If we find an enum constant or a type tag,
12735 put it aside for the moment. */
12736 TREE_CHAIN (parm
) = NULL_TREE
;
12737 nonparms
= chainon (nonparms
, parm
);
12741 /* Get the decls in their original chain order
12742 and record in the function. This is all and only the
12743 PARM_DECLs that were pushed into scope by the loop above. */
12744 DECL_ARGUMENTS (fndecl
) = getdecls ();
12746 storetags (chainon (parmtags
, gettags ()));
12749 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
12751 /* Now store the final chain of decls for the arguments
12752 as the decl-chain of the current lexical scope.
12753 Put the enumerators in as well, at the front so that
12754 DECL_ARGUMENTS is not modified. */
12756 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
12758 /* Initialize the RTL code for the function. */
12759 DECL_SAVED_INSNS (fndecl
) = NULL_RTX
;
12760 if (! processing_template_decl
)
12761 expand_function_start (fndecl
, parms_have_cleanups
);
12763 current_function_parms_stored
= 1;
12765 /* If this function is `main', emit a call to `__main'
12766 to run global initializers, etc. */
12767 if (DECL_MAIN_P (fndecl
))
12768 expand_main_function ();
12770 /* Now that we have initialized the parms, we can start their
12771 cleanups. We cannot do this before, since expand_decl_cleanup
12772 should not be called before the parm can be used. */
12774 && ! processing_template_decl
)
12776 for (cleanups
= nreverse (cleanups
); cleanups
; cleanups
= TREE_CHAIN (cleanups
))
12778 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
), TREE_VALUE (cleanups
)))
12779 cp_error ("parser lost in parsing declaration of `%D'",
12780 TREE_PURPOSE (cleanups
));
12784 /* Create a binding contour which can be used to catch
12785 cleanup-generated temporaries. Also, if the return value needs or
12786 has initialization, deal with that now. */
12787 if (parms_have_cleanups
)
12790 expand_start_bindings (0);
12793 if (! processing_template_decl
&& flag_exceptions
)
12795 /* Do the starting of the exception specifications, if we have any. */
12796 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
12797 expand_start_eh_spec ();
12800 last_parm_cleanup_insn
= get_last_insn ();
12801 last_dtor_insn
= get_last_insn ();
12804 /* Bind a name and initialization to the return value of
12805 the current function. */
12808 store_return_init (return_id
, init
)
12809 tree return_id
, init
;
12811 tree decl
= DECL_RESULT (current_function_decl
);
12814 /* Give this error as many times as there are occurrences,
12815 so that users can use Emacs compilation buffers to find
12816 and fix all such places. */
12817 pedwarn ("ANSI C++ does not permit named return values");
12819 if (return_id
!= NULL_TREE
)
12821 if (DECL_NAME (decl
) == NULL_TREE
)
12823 DECL_NAME (decl
) = return_id
;
12824 DECL_ASSEMBLER_NAME (decl
) = return_id
;
12827 cp_error ("return identifier `%D' already in place", decl
);
12830 /* Can't let this happen for constructors. */
12831 if (DECL_CONSTRUCTOR_P (current_function_decl
))
12833 error ("can't redefine default return value for constructors");
12837 /* If we have a named return value, put that in our scope as well. */
12838 if (DECL_NAME (decl
) != NULL_TREE
)
12840 /* If this named return value comes in a register,
12841 put it in a pseudo-register. */
12842 if (DECL_REGISTER (decl
))
12844 original_result_rtx
= DECL_RTL (decl
);
12845 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
12848 /* Let `cp_finish_decl' know that this initializer is ok. */
12849 DECL_INITIAL (decl
) = init
;
12852 if (minimal_parse_mode
)
12853 add_tree (build_min_nt (RETURN_INIT
, return_id
,
12854 copy_to_permanent (init
)));
12856 cp_finish_decl (decl
, init
, NULL_TREE
, 0, 0);
12861 /* Finish up a function declaration and compile that function
12862 all the way to assembler language output. The free the storage
12863 for the function definition.
12865 This is called after parsing the body of the function definition.
12866 LINENO is the current line number.
12868 C++: CALL_POPLEVEL is non-zero if an extra call to poplevel
12869 (and expand_end_bindings) must be made to take care of the binding
12870 contour for the base initializers. This is only relevant for
12873 NESTED is nonzero if we were in the middle of compiling another function
12874 when we started on this one. */
12877 finish_function (lineno
, call_poplevel
, nested
)
12882 register tree fndecl
= current_function_decl
;
12883 tree fntype
, ctype
= NULL_TREE
;
12884 rtx last_parm_insn
, insns
;
12885 /* Label to use if this function is supposed to return a value. */
12886 tree no_return_label
= NULL_TREE
;
12887 tree decls
= NULL_TREE
;
12889 /* When we get some parse errors, we can end up without a
12890 current_function_decl, so cope. */
12891 if (fndecl
== NULL_TREE
)
12894 if (! nested
&& function_depth
> 1)
12897 fntype
= TREE_TYPE (fndecl
);
12899 /* TREE_READONLY (fndecl) = 1;
12900 This caused &foo to be of type ptr-to-const-function
12901 which then got a warning when stored in a ptr-to-function variable. */
12903 /* This happens on strange parse errors. */
12904 if (! current_function_parms_stored
)
12907 store_parm_decls ();
12910 if (processing_template_decl
)
12912 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
12914 decls
= getdecls ();
12915 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
12916 poplevel (decls
!= NULL_TREE
, 0, 0);
12921 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
12923 tree ttype
= target_type (fntype
);
12926 if (IS_AGGR_TYPE (ttype
))
12927 /* Let debugger know it should output info for this type. */
12928 note_debug_info_needed (ttype
);
12930 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
12932 ttype
= target_type (TREE_TYPE (parmdecl
));
12933 if (IS_AGGR_TYPE (ttype
))
12934 /* Let debugger know it should output info for this type. */
12935 note_debug_info_needed (ttype
);
12939 /* Clean house because we will need to reorder insns here. */
12940 do_pending_stack_adjust ();
12944 tree binfo
= TYPE_BINFO (current_class_type
);
12945 tree cond
= integer_one_node
;
12947 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
12949 int ok_to_optimize_dtor
= 0;
12950 int empty_dtor
= get_last_insn () == last_dtor_insn
;
12952 if (current_function_assigns_this
)
12953 cond
= build (NE_EXPR
, boolean_type_node
,
12954 current_class_ptr
, integer_zero_node
);
12957 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
12959 /* If this destructor is empty, then we don't need to check
12960 whether `this' is NULL in some cases. */
12961 if ((flag_this_is_variable
& 1) == 0)
12962 ok_to_optimize_dtor
= 1;
12963 else if (empty_dtor
)
12964 ok_to_optimize_dtor
12965 = (n_baseclasses
== 0
12966 || (n_baseclasses
== 1
12967 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
12970 /* These initializations might go inline. Protect
12971 the binding level of the parms. */
12973 expand_start_bindings (0);
12975 if (current_function_assigns_this
)
12977 current_function_assigns_this
= 0;
12978 current_function_just_assigned_this
= 0;
12981 /* Generate the code to call destructor on base class.
12982 If this destructor belongs to a class with virtual
12983 functions, then set the virtual function table
12984 pointer to represent the type of our base class. */
12986 /* This side-effect makes call to `build_delete' generate the
12987 code we have to have at the end of this destructor. */
12988 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
12990 /* These are two cases where we cannot delegate deletion. */
12991 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
12992 || TYPE_GETS_REG_DELETE (current_class_type
))
12993 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
12994 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
12996 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
12997 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
12999 /* If we did not assign to this, then `this' is non-zero at
13000 the end of a destructor. As a special optimization, don't
13001 emit test if this is an empty destructor. If it does nothing,
13002 it does nothing. If it calls a base destructor, the base
13003 destructor will perform the test. */
13005 if (exprstmt
!= error_mark_node
13006 && (TREE_CODE (exprstmt
) != NOP_EXPR
13007 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13008 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13010 expand_label (dtor_label
);
13011 if (cond
!= integer_one_node
)
13012 expand_start_cond (cond
, 0);
13013 if (exprstmt
!= void_zero_node
)
13014 /* Don't call `expand_expr_stmt' if we're not going to do
13015 anything, since -Wall will give a diagnostic. */
13016 expand_expr_stmt (exprstmt
);
13018 /* Run destructor on all virtual baseclasses. */
13019 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13021 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13022 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13023 in_charge_node
, integer_two_node
), 0);
13026 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13028 tree vb
= get_vbase
13029 (BINFO_TYPE (vbases
),
13030 TYPE_BINFO (current_class_type
));
13032 (build_scoped_method_call
13033 (current_class_ref
, vb
, dtor_identifier
,
13034 build_expr_list (NULL_TREE
, integer_zero_node
)));
13036 vbases
= TREE_CHAIN (vbases
);
13038 expand_end_cond ();
13041 do_pending_stack_adjust ();
13042 if (cond
!= integer_one_node
)
13043 expand_end_cond ();
13046 TYPE_HAS_DESTRUCTOR (current_class_type
) = 1;
13048 virtual_size
= c_sizeof (current_class_type
);
13050 /* At the end, call delete if that's what's requested. */
13052 /* FDIS sez: At the point of definition of a virtual destructor
13053 (including an implicit definition), non-placement operator
13054 delete shall be looked up in the scope of the destructor's
13055 class and if found shall be accessible and unambiguous.
13057 This is somewhat unclear, but I take it to mean that if the
13058 class only defines placement deletes we don't do anything here.
13059 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13060 for us if they ever try to delete one of these. */
13062 if (TYPE_GETS_REG_DELETE (current_class_type
)
13063 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13064 exprstmt
= build_op_delete_call
13065 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13066 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13068 exprstmt
= NULL_TREE
;
13072 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13073 in_charge_node
, integer_one_node
);
13074 expand_start_cond (cond
, 0);
13075 expand_expr_stmt (exprstmt
);
13076 expand_end_cond ();
13079 /* End of destructor. */
13080 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13081 poplevel (2, 0, 0); /* XXX change to 1 */
13083 /* Back to the top of destructor. */
13084 /* Don't execute destructor code if `this' is NULL. */
13088 /* If the dtor is empty, and we know there is not possible way we
13089 could use any vtable entries, before they are possibly set by
13090 a base class dtor, we don't have to setup the vtables, as we
13091 know that any base class dtoring will set up any vtables it
13092 needs. We avoid MI, because one base class dtor can do a
13093 virtual dispatch to an overridden function that would need to
13094 have a non-related vtable set up, we cannot avoid setting up
13095 vtables in that case. We could change this to see if there is
13096 just one vtable. */
13097 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13099 /* Make all virtual function table pointers in non-virtual base
13100 classes point to CURRENT_CLASS_TYPE's virtual function
13102 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13104 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13105 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13108 if (! ok_to_optimize_dtor
)
13110 cond
= build_binary_op (NE_EXPR
,
13111 current_class_ptr
, integer_zero_node
, 1);
13112 expand_start_cond (cond
, 0);
13115 insns
= get_insns ();
13118 last_parm_insn
= get_first_nonparm_insn ();
13119 if (last_parm_insn
== NULL_RTX
)
13120 last_parm_insn
= get_last_insn ();
13122 last_parm_insn
= previous_insn (last_parm_insn
);
13124 emit_insns_after (insns
, last_parm_insn
);
13126 if (! ok_to_optimize_dtor
)
13127 expand_end_cond ();
13129 else if (current_function_assigns_this
)
13131 /* Does not need to call emit_base_init, because
13132 that is done (if needed) just after assignment to this
13135 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13137 end_protect_partials ();
13138 expand_label (ctor_label
);
13139 ctor_label
= NULL_TREE
;
13143 decls
= getdecls ();
13144 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13145 poplevel (decls
!= NULL_TREE
, 0, 0);
13147 /* c_expand_return knows to return 'this' from a constructor. */
13148 c_expand_return (NULL_TREE
);
13150 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13151 && return_label
!= NULL_RTX
)
13152 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13154 current_function_assigns_this
= 0;
13155 current_function_just_assigned_this
= 0;
13156 base_init_expr
= NULL_TREE
;
13158 else if (DECL_CONSTRUCTOR_P (fndecl
))
13160 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13161 /* Allow constructor for a type to get a new instance of the object
13162 using `build_new'. */
13163 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13164 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13166 DECL_RETURNS_FIRST_ARG (fndecl
) = 1;
13168 if (flag_this_is_variable
> 0)
13170 cond
= build_binary_op (EQ_EXPR
,
13171 current_class_ptr
, integer_zero_node
, 1);
13172 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13173 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13176 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13180 if (flag_this_is_variable
> 0)
13182 expand_start_cond (cond
, 0);
13183 expand_expr_stmt (thenclause
);
13184 expand_end_cond ();
13187 /* Emit insns from `emit_base_init' which sets up virtual
13188 function table pointer(s). */
13189 if (base_init_expr
)
13191 expand_expr_stmt (base_init_expr
);
13192 base_init_expr
= NULL_TREE
;
13195 insns
= get_insns ();
13198 /* This is where the body of the constructor begins. */
13200 emit_insns_after (insns
, last_parm_cleanup_insn
);
13202 end_protect_partials ();
13204 /* This is where the body of the constructor ends. */
13205 expand_label (ctor_label
);
13206 ctor_label
= NULL_TREE
;
13210 decls
= getdecls ();
13211 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13212 poplevel (decls
!= NULL_TREE
, 1, 0);
13215 /* c_expand_return knows to return 'this' from a constructor. */
13216 c_expand_return (NULL_TREE
);
13218 current_function_assigns_this
= 0;
13219 current_function_just_assigned_this
= 0;
13221 else if (DECL_MAIN_P (fndecl
))
13223 /* Make it so that `main' always returns 0 by default. */
13225 c_expand_return (integer_one_node
);
13227 c_expand_return (integer_zero_node
);
13230 else if (return_label
!= NULL_RTX
13231 && current_function_return_value
== NULL_TREE
13232 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13233 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13235 if (flag_exceptions
)
13236 expand_exception_blocks ();
13238 /* If this function is supposed to return a value, ensure that
13239 we do not fall into the cleanups by mistake. The end of our
13240 function will look like this:
13242 user code (may have return stmt somewhere)
13243 goto no_return_label
13248 NOTE_INSN_FUNCTION_END
13252 If the user omits a return stmt in the USER CODE section, we
13253 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13254 Otherwise, we won't. */
13255 if (no_return_label
)
13257 DECL_CONTEXT (no_return_label
) = fndecl
;
13258 DECL_INITIAL (no_return_label
) = error_mark_node
;
13259 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13260 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13261 expand_goto (no_return_label
);
13266 /* Remove the binding contour which is used
13267 to catch cleanup-generated temporaries. */
13268 expand_end_bindings (0, 0, 0);
13269 poplevel (0, 0, 0);
13271 /* Emit label at beginning of cleanup code for parameters. */
13272 emit_label (cleanup_label
);
13275 /* Get return value into register if that's where it's supposed to be. */
13276 if (original_result_rtx
)
13277 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13279 /* Finish building code that will trigger warnings if users forget
13280 to make their functions return values. */
13281 if (no_return_label
|| cleanup_label
)
13282 emit_jump (return_label
);
13283 if (no_return_label
)
13285 /* We don't need to call `expand_*_return' here because we
13286 don't need any cleanups here--this path of code is only
13287 for error checking purposes. */
13288 expand_label (no_return_label
);
13291 /* Generate rtl for function exit. */
13292 expand_function_end (input_filename
, lineno
, 1);
13295 /* This must come after expand_function_end because cleanups might
13296 have declarations (from inline functions) that need to go into
13297 this function's blocks. */
13298 if (current_binding_level
->parm_flag
!= 1)
13299 my_friendly_abort (122);
13300 poplevel (1, 0, 1);
13302 /* Reset scope for C++: if we were in the scope of a class,
13303 then when we finish this function, we are not longer so.
13304 This cannot be done until we know for sure that no more
13305 class members will ever be referenced in this function
13306 (i.e., calls to destructors). */
13307 if (current_class_name
)
13309 ctype
= current_class_type
;
13310 pop_nested_class (1);
13313 /* Must mark the RESULT_DECL as being in this function. */
13314 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13316 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13317 to the FUNCTION_DECL node itself. */
13318 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13320 if (! processing_template_decl
)
13322 int saved_flag_keep_inline_functions
=
13323 flag_keep_inline_functions
;
13325 /* So we can tell if jump_optimize sets it to 1. */
13328 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13329 && hack_decl_function_context (fndecl
))
13330 /* Trick rest_of_compilation into not deferring output of this
13331 function, even if it is inline, since the rtl_obstack for
13332 this function is the function_obstack of the enclosing
13333 function and will be deallocated when the enclosing
13334 function is gone. See save_tree_status. */
13335 flag_keep_inline_functions
= 1;
13337 /* Run the optimizers and output the assembler code for this
13340 if (DECL_ARTIFICIAL (fndecl
))
13342 /* Do we really *want* to inline this synthesized method? */
13344 int save_fif
= flag_inline_functions
;
13345 flag_inline_functions
= 1;
13347 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13348 will check our size. */
13349 DECL_INLINE (fndecl
) = 0;
13351 rest_of_compilation (fndecl
);
13352 flag_inline_functions
= save_fif
;
13355 rest_of_compilation (fndecl
);
13357 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13359 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13361 /* Set DECL_EXTERNAL so that assemble_external will be called as
13362 necessary. We'll clear it again in finish_file. */
13363 if (! DECL_EXTERNAL (fndecl
))
13364 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13365 DECL_EXTERNAL (fndecl
) = 1;
13366 mark_inline_for_output (fndecl
);
13369 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13370 note_debug_info_needed (ctype
);
13372 current_function_returns_null
|= can_reach_end
;
13374 /* Since we don't normally go through c_expand_return for constructors,
13375 this normally gets the wrong value.
13376 Also, named return values have their return codes emitted after
13377 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13378 if (DECL_CONSTRUCTOR_P (fndecl
)
13379 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13380 current_function_returns_null
= 0;
13382 if (TREE_THIS_VOLATILE (fndecl
) && current_function_returns_null
)
13383 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13384 else if ((warn_return_type
|| pedantic
)
13385 && current_function_returns_null
13386 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13388 /* If this function returns non-void and control can drop through,
13390 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13392 /* With just -W, complain only if function returns both with
13393 and without a value. */
13394 else if (extra_warnings
13395 && current_function_returns_value
&& current_function_returns_null
)
13396 warning ("this function may return with or without a value");
13401 /* Free all the tree nodes making up this function. */
13402 /* Switch back to allocating nodes permanently
13403 until we start another function. */
13404 if (processing_template_decl
)
13406 --minimal_parse_mode
;
13407 DECL_SAVED_TREE (fndecl
) = TREE_CHAIN (DECL_SAVED_TREE (fndecl
));
13411 permanent_allocation (1);
13413 if (DECL_SAVED_INSNS (fndecl
) == NULL_RTX
)
13417 /* Stop pointing to the local nodes about to be freed. */
13418 /* But DECL_INITIAL must remain nonzero so we know this
13419 was an actual function definition. */
13420 DECL_INITIAL (fndecl
) = error_mark_node
;
13421 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13422 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13425 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13426 static_ctors
= perm_tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13427 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13428 static_dtors
= perm_tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13432 /* Let the error reporting routines know that we're outside a
13433 function. For a nested function, this value is used in
13434 pop_cp_function_context and then reset via pop_function_context. */
13435 current_function_decl
= NULL_TREE
;
13438 named_label_uses
= NULL
;
13439 current_class_ptr
= NULL_TREE
;
13440 current_class_ref
= NULL_TREE
;
13443 /* Create the FUNCTION_DECL for a function definition.
13444 LINE1 is the line number that the definition absolutely begins on.
13445 LINE2 is the line number that the name of the function appears on.
13446 DECLSPECS and DECLARATOR are the parts of the declaration;
13447 they describe the return type and the name of the function,
13448 but twisted together in a fashion that parallels the syntax of C.
13450 This function creates a binding context for the function body
13451 as well as setting up the FUNCTION_DECL in current_function_decl.
13453 Returns a FUNCTION_DECL on success.
13455 If the DECLARATOR is not suitable for a function (it defines a datum
13456 instead), we return 0, which tells yyparse to report a parse error.
13458 May return void_type_node indicating that this method is actually
13459 a friend. See grokfield for more details.
13461 Came here with a `.pushlevel' .
13463 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13464 CHANGES TO CODE IN `grokfield'. */
13467 start_method (declspecs
, declarator
, attrlist
)
13468 tree declarator
, declspecs
, attrlist
;
13470 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13473 /* Something too ugly to handle. */
13474 if (fndecl
== NULL_TREE
)
13477 /* Pass friends other than inline friend functions back. */
13478 if (fndecl
== void_type_node
)
13481 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13482 /* Not a function, tell parser to report parse error. */
13485 if (IS_SIGNATURE (current_class_type
))
13486 IS_DEFAULT_IMPLEMENTATION (fndecl
) = 1;
13488 if (DECL_IN_AGGR_P (fndecl
))
13490 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13492 if (DECL_CONTEXT (fndecl
)
13493 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13494 cp_error ("`%D' is already defined in class %s", fndecl
,
13495 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13497 return void_type_node
;
13500 DECL_THIS_INLINE (fndecl
) = 1;
13502 if (flag_default_inline
)
13503 DECL_INLINE (fndecl
) = 1;
13505 /* We process method specializations in finish_struct_1. */
13506 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13507 fndecl
= push_template_decl (fndecl
);
13509 /* We read in the parameters on the maybepermanent_obstack,
13510 but we won't be getting back to them until after we
13511 may have clobbered them. So the call to preserve_data
13512 will keep them safe. */
13515 if (! DECL_FRIEND_P (fndecl
))
13517 if (TREE_CHAIN (fndecl
))
13519 fndecl
= copy_node (fndecl
);
13520 TREE_CHAIN (fndecl
) = NULL_TREE
;
13523 if (DECL_CONSTRUCTOR_P (fndecl
))
13525 if (! grok_ctor_properties (current_class_type
, fndecl
))
13526 return void_type_node
;
13528 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13529 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13532 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13534 /* Make a place for the parms */
13536 current_binding_level
->parm_flag
= 1;
13538 DECL_IN_AGGR_P (fndecl
) = 1;
13542 /* Go through the motions of finishing a function definition.
13543 We don't compile this method until after the whole class has
13546 FINISH_METHOD must return something that looks as though it
13547 came from GROKFIELD (since we are defining a method, after all).
13549 This is called after parsing the body of the function definition.
13550 STMTS is the chain of statements that makes up the function body.
13552 DECL is the ..._DECL that `start_method' provided. */
13555 finish_method (decl
)
13558 register tree fndecl
= decl
;
13561 register tree link
;
13563 if (decl
== void_type_node
)
13566 old_initial
= DECL_INITIAL (fndecl
);
13568 /* Undo the level for the parms (from start_method).
13569 This is like poplevel, but it causes nothing to be
13570 saved. Saving information here confuses symbol-table
13571 output routines. Besides, this information will
13572 be correctly output when this method is actually
13575 /* Clear out the meanings of the local variables of this level;
13576 also record in each decl which block it belongs to. */
13578 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13580 if (DECL_NAME (link
) != NULL_TREE
)
13581 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = 0;
13582 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13583 DECL_CONTEXT (link
) = NULL_TREE
;
13586 /* Restore all name-meanings of the outer levels
13587 that were shadowed by this level. */
13589 for (link
= current_binding_level
->shadowed
; link
; link
= TREE_CHAIN (link
))
13590 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
13591 for (link
= current_binding_level
->class_shadowed
;
13592 link
; link
= TREE_CHAIN (link
))
13593 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
13594 for (link
= current_binding_level
->type_shadowed
;
13595 link
; link
= TREE_CHAIN (link
))
13596 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
13598 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13599 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13600 current_binding_level
->parm_flag
,
13601 current_binding_level
->keep
);
13603 poplevel (0, 0, 0);
13605 DECL_INITIAL (fndecl
) = old_initial
;
13607 /* We used to check if the context of FNDECL was different from
13608 current_class_type as another way to get inside here. This didn't work
13609 for String.cc in libg++. */
13610 if (DECL_FRIEND_P (fndecl
))
13612 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13613 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13614 decl
= void_type_node
;
13620 /* Called when a new struct TYPE is defined.
13621 If this structure or union completes the type of any previous
13622 variable declaration, lay it out and output its rtl. */
13625 hack_incomplete_structures (type
)
13630 if (current_binding_level
->incomplete
== NULL_TREE
)
13633 if (!type
) /* Don't do this for class templates. */
13636 for (list
= ¤t_binding_level
->incomplete
; *list
; )
13638 tree decl
= TREE_VALUE (*list
);
13639 if ((decl
&& TREE_TYPE (decl
) == type
)
13640 || (TREE_TYPE (decl
)
13641 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13642 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
13644 int toplevel
= toplevel_bindings_p ();
13645 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13646 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
13647 layout_type (TREE_TYPE (decl
));
13648 layout_decl (decl
, 0);
13649 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
13653 expand_decl (decl
);
13654 cleanup
= maybe_build_cleanup (decl
);
13655 expand_decl_init (decl
);
13656 if (! expand_decl_cleanup (decl
, cleanup
))
13657 cp_error ("parser lost in parsing declaration of `%D'",
13660 *list
= TREE_CHAIN (*list
);
13663 list
= &TREE_CHAIN (*list
);
13667 /* If DECL is of a type which needs a cleanup, build that cleanup here.
13668 See build_delete for information about AUTO_DELETE.
13670 Don't build these on the momentary obstack; they must live
13671 the life of the binding contour. */
13674 maybe_build_cleanup_1 (decl
, auto_delete
)
13675 tree decl
, auto_delete
;
13677 tree type
= TREE_TYPE (decl
);
13678 if (TYPE_NEEDS_DESTRUCTOR (type
))
13680 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
13683 if (TREE_CODE (decl
) != PARM_DECL
)
13684 temp
= suspend_momentary ();
13686 if (TREE_CODE (type
) == ARRAY_TYPE
)
13690 mark_addressable (decl
);
13691 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
13694 /* Optimize for space over speed here. */
13695 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
13696 || flag_expensive_optimizations
)
13697 flags
|= LOOKUP_NONVIRTUAL
;
13699 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
13701 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
13702 && ! TYPE_HAS_DESTRUCTOR (type
))
13703 rval
= build_compound_expr (expr_tree_cons (NULL_TREE
, rval
,
13704 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
13706 if (TREE_CODE (decl
) != PARM_DECL
)
13707 resume_momentary (temp
);
13714 /* If DECL is of a type which needs a cleanup, build that cleanup
13715 here. The cleanup does free the storage with a call to delete. */
13718 maybe_build_cleanup_and_delete (decl
)
13721 return maybe_build_cleanup_1 (decl
, integer_three_node
);
13724 /* If DECL is of a type which needs a cleanup, build that cleanup
13725 here. The cleanup does not free the storage with a call a delete. */
13728 maybe_build_cleanup (decl
)
13731 return maybe_build_cleanup_1 (decl
, integer_two_node
);
13734 /* Expand a C++ expression at the statement level.
13735 This is needed to ferret out nodes which have UNKNOWN_TYPE.
13736 The C++ type checker should get all of these out when
13737 expressions are combined with other, type-providing, expressions,
13738 leaving only orphan expressions, such as:
13740 &class::bar; / / takes its address, but does nothing with it. */
13743 cplus_expand_expr_stmt (exp
)
13746 if (processing_template_decl
)
13748 add_tree (build_min_nt (EXPR_STMT
, exp
));
13752 /* Arrange for all temps to disappear. */
13753 expand_start_target_temps ();
13755 if (TREE_TYPE (exp
) == unknown_type_node
)
13757 if (TREE_CODE (exp
) == ADDR_EXPR
|| TREE_CODE (exp
) == TREE_LIST
)
13758 error ("address of overloaded function with no contextual type information");
13759 else if (TREE_CODE (exp
) == COMPONENT_REF
)
13760 warning ("useless reference to a member function name, did you forget the ()?");
13764 if (TREE_CODE (exp
) == FUNCTION_DECL
)
13766 cp_warning ("reference, not call, to function `%D'", exp
);
13767 warning ("at this point in file");
13771 /* We should do this eventually, but right now this causes regex.o from
13772 libg++ to miscompile, and tString to core dump. */
13773 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
13776 /* Strip unused implicit INDIRECT_REFs of references. */
13777 if (TREE_CODE (exp
) == INDIRECT_REF
13778 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
13779 exp
= TREE_OPERAND (exp
, 0);
13781 /* If we don't do this, we end up down inside expand_expr
13782 trying to do TYPE_MODE on the ERROR_MARK, and really
13783 go outside the bounds of the type. */
13784 if (exp
!= error_mark_node
)
13785 expand_expr_stmt (break_out_cleanups (exp
));
13788 /* Clean up any pending cleanups. This happens when a function call
13789 returns a cleanup-needing value that nobody uses. */
13790 expand_end_target_temps ();
13793 /* When a stmt has been parsed, this function is called.
13795 Currently, this function only does something within a
13796 constructor's scope: if a stmt has just assigned to this,
13797 and we are in a derived class, we call `emit_base_init'. */
13802 extern struct nesting
*cond_stack
, *loop_stack
, *case_stack
;
13805 if (current_function_assigns_this
13806 || ! current_function_just_assigned_this
)
13808 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13810 /* Constructors must wait until we are out of control
13811 zones before calling base constructors. */
13812 if (cond_stack
|| loop_stack
|| case_stack
)
13814 expand_expr_stmt (base_init_expr
);
13815 check_base_init (current_class_type
);
13817 current_function_assigns_this
= 1;
13820 /* Change a static member function definition into a FUNCTION_TYPE, instead
13821 of the METHOD_TYPE that we create when it's originally parsed.
13823 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
13824 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
13825 other decls. Either pass the addresses of local variables or NULL. */
13828 revert_static_member_fn (decl
, fn
, argtypes
)
13829 tree
*decl
, *fn
, *argtypes
;
13832 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
13833 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
13835 if (TYPE_READONLY (TREE_TYPE (TREE_VALUE (args
))))
13836 cp_error ("static member function `%#D' declared const", *decl
);
13837 if (TYPE_VOLATILE (TREE_TYPE (TREE_VALUE (args
))))
13838 cp_error ("static member function `%#D' declared volatile", *decl
);
13840 args
= TREE_CHAIN (args
);
13841 tmp
= build_function_type (TREE_TYPE (function
), args
);
13842 tmp
= build_type_variant (tmp
, TYPE_READONLY (function
),
13843 TYPE_VOLATILE (function
));
13844 tmp
= build_exception_variant (tmp
,
13845 TYPE_RAISES_EXCEPTIONS (function
));
13846 TREE_TYPE (*decl
) = tmp
;
13847 if (DECL_ARGUMENTS (*decl
))
13848 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
13849 DECL_STATIC_FUNCTION_P (*decl
) = 1;
13857 id_in_current_class (id
)
13860 return !!purpose_member (id
, class_binding_level
->class_shadowed
);
13867 int warn_about_return_type
;
13869 int just_assigned_this
;
13871 int temp_name_counter
;
13873 tree shadowed_labels
;
13876 rtx last_dtor_insn
;
13877 rtx last_parm_cleanup_insn
;
13878 tree base_init_list
;
13879 tree member_init_list
;
13880 tree base_init_expr
;
13881 tree current_class_ptr
;
13882 tree current_class_ref
;
13884 struct cp_function
*next
;
13885 struct binding_level
*binding_level
;
13886 int static_labelno
;
13889 static struct cp_function
*cp_function_chain
;
13891 extern int temp_name_counter
;
13893 /* Save and reinitialize the variables
13894 used during compilation of a C++ function. */
13897 push_cp_function_context (context
)
13900 struct cp_function
*p
13901 = (struct cp_function
*) xmalloc (sizeof (struct cp_function
));
13903 push_function_context_to (context
);
13905 p
->next
= cp_function_chain
;
13906 cp_function_chain
= p
;
13908 p
->named_labels
= named_labels
;
13909 p
->shadowed_labels
= shadowed_labels
;
13910 p
->returns_value
= current_function_returns_value
;
13911 p
->returns_null
= current_function_returns_null
;
13912 p
->warn_about_return_type
= warn_about_return_type
;
13913 p
->binding_level
= current_binding_level
;
13914 p
->ctor_label
= ctor_label
;
13915 p
->dtor_label
= dtor_label
;
13916 p
->last_dtor_insn
= last_dtor_insn
;
13917 p
->last_parm_cleanup_insn
= last_parm_cleanup_insn
;
13918 p
->assigns_this
= current_function_assigns_this
;
13919 p
->just_assigned_this
= current_function_just_assigned_this
;
13920 p
->parms_stored
= current_function_parms_stored
;
13921 p
->result_rtx
= original_result_rtx
;
13922 p
->base_init_expr
= base_init_expr
;
13923 p
->temp_name_counter
= temp_name_counter
;
13924 p
->base_init_list
= current_base_init_list
;
13925 p
->member_init_list
= current_member_init_list
;
13926 p
->current_class_ptr
= current_class_ptr
;
13927 p
->current_class_ref
= current_class_ref
;
13928 p
->static_labelno
= static_labelno
;
13931 /* Restore the variables used during compilation of a C++ function. */
13934 pop_cp_function_context (context
)
13937 struct cp_function
*p
= cp_function_chain
;
13940 /* Bring back all the labels that were shadowed. */
13941 for (link
= shadowed_labels
; link
; link
= TREE_CHAIN (link
))
13942 if (DECL_NAME (TREE_VALUE (link
)) != 0)
13943 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link
)),
13944 TREE_VALUE (link
));
13946 pop_function_context_from (context
);
13948 cp_function_chain
= p
->next
;
13950 named_labels
= p
->named_labels
;
13951 shadowed_labels
= p
->shadowed_labels
;
13952 current_function_returns_value
= p
->returns_value
;
13953 current_function_returns_null
= p
->returns_null
;
13954 warn_about_return_type
= p
->warn_about_return_type
;
13955 current_binding_level
= p
->binding_level
;
13956 ctor_label
= p
->ctor_label
;
13957 dtor_label
= p
->dtor_label
;
13958 last_dtor_insn
= p
->last_dtor_insn
;
13959 last_parm_cleanup_insn
= p
->last_parm_cleanup_insn
;
13960 current_function_assigns_this
= p
->assigns_this
;
13961 current_function_just_assigned_this
= p
->just_assigned_this
;
13962 current_function_parms_stored
= p
->parms_stored
;
13963 original_result_rtx
= p
->result_rtx
;
13964 base_init_expr
= p
->base_init_expr
;
13965 temp_name_counter
= p
->temp_name_counter
;
13966 current_base_init_list
= p
->base_init_list
;
13967 current_member_init_list
= p
->member_init_list
;
13968 current_class_ptr
= p
->current_class_ptr
;
13969 current_class_ref
= p
->current_class_ref
;
13970 static_labelno
= p
->static_labelno
;
13978 return function_depth
!= 0;