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));
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
) == FUNCTION_DECL
2515 && TREE_CODE (olddecl
) == FUNCTION_DECL
)
2517 tree f1
= TREE_TYPE (newdecl
);
2518 tree f2
= TREE_TYPE (olddecl
);
2519 tree p1
= TYPE_ARG_TYPES (f1
);
2520 tree p2
= TYPE_ARG_TYPES (f2
);
2522 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2523 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2524 && DECL_LANGUAGE (olddecl
) == lang_c
))
2527 /* When we parse a static member function definition,
2528 we put together a FUNCTION_DECL which thinks its type
2529 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2531 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2532 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2533 else if (TREE_CODE (f2
) == METHOD_TYPE
2534 && DECL_STATIC_FUNCTION_P (newdecl
))
2535 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2537 /* Here we must take care of the case where new default
2538 parameters are specified. Also, warn if an old
2539 declaration becomes ambiguous because default
2540 parameters may cause the two to be ambiguous. */
2541 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2543 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2544 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2546 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2550 if (comptypes (TREE_TYPE (f1
), TREE_TYPE (f2
), 1))
2552 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2555 types_match
= self_promoting_args_p (p1
);
2556 if (p1
== void_list_node
)
2557 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2559 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2560 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2562 types_match
= self_promoting_args_p (p2
);
2563 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2566 types_match
= compparms (p1
, p2
, 3);
2571 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
2572 && TREE_CODE (olddecl
) == TEMPLATE_DECL
)
2574 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2575 DECL_TEMPLATE_PARMS (olddecl
)))
2578 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2581 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2582 DECL_TEMPLATE_RESULT (newdecl
));
2586 if (TREE_TYPE (newdecl
) == error_mark_node
)
2587 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2588 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2589 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2590 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2593 types_match
= comptypes (TREE_TYPE (newdecl
),
2594 TREE_TYPE (olddecl
), 1);
2600 /* If NEWDECL is `static' and an `extern' was seen previously,
2601 warn about it. (OLDDECL may be NULL_TREE; NAME contains
2602 information about previous usage as an `extern'.)
2604 Note that this does not apply to the C++ case of declaring
2605 a variable `extern const' and then later `const'.
2607 Don't complain about built-in functions, since they are beyond
2608 the user's control. */
2611 warn_extern_redeclared_static (newdecl
, olddecl
)
2612 tree newdecl
, olddecl
;
2616 static char *explicit_extern_static_warning
2617 = "`%D' was declared `extern' and later `static'";
2618 static char *implicit_extern_static_warning
2619 = "`%D' was declared implicitly `extern' and later `static'";
2621 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2624 name
= DECL_ASSEMBLER_NAME (newdecl
);
2625 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
2627 /* It's okay to redeclare an ANSI built-in function as static,
2628 or to declare a non-ANSI built-in function as anything. */
2629 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
2630 && olddecl
!= NULL_TREE
2631 && TREE_CODE (olddecl
) == FUNCTION_DECL
2632 && (DECL_BUILT_IN (olddecl
)
2633 || DECL_BUILT_IN_NONANSI (olddecl
))))
2635 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2636 ? implicit_extern_static_warning
2637 : explicit_extern_static_warning
, newdecl
);
2638 if (olddecl
!= NULL_TREE
)
2639 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2644 /* Handle when a new declaration NEWDECL has the same name as an old
2645 one OLDDECL in the same binding contour. Prints an error message
2648 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2649 Otherwise, return 0. */
2652 duplicate_decls (newdecl
, olddecl
)
2653 tree newdecl
, olddecl
;
2655 extern struct obstack permanent_obstack
;
2656 unsigned olddecl_uid
= DECL_UID (olddecl
);
2657 int olddecl_friend
= 0, types_match
= 0;
2658 int new_defines_function
= 0;
2660 if (newdecl
== olddecl
)
2663 types_match
= decls_match (newdecl
, olddecl
);
2665 /* If either the type of the new decl or the type of the old decl is an
2666 error_mark_node, then that implies that we have already issued an
2667 error (earlier) for some bogus type specification, and in that case,
2668 it is rather pointless to harass the user with yet more error message
2669 about the same declaration, so just pretend the types match here. */
2670 if (TREE_TYPE (newdecl
) == error_mark_node
2671 || TREE_TYPE (olddecl
) == error_mark_node
)
2674 /* Check for redeclaration and other discrepancies. */
2675 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2676 && DECL_ARTIFICIAL (olddecl
)
2677 && (DECL_BUILT_IN (olddecl
) || DECL_BUILT_IN_NONANSI (olddecl
)))
2679 /* If you declare a built-in or predefined function name as static,
2680 the old definition is overridden, but optionally warn this was a
2681 bad choice of name. Ditto for overloads. */
2682 if (! TREE_PUBLIC (newdecl
)
2683 || (TREE_CODE (newdecl
) == FUNCTION_DECL
2684 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
)))
2687 cp_warning ("shadowing %s function `%#D'",
2688 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2690 /* Discard the old built-in function. */
2693 else if (! types_match
)
2695 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2697 /* If the built-in is not ansi, then programs can override
2698 it even globally without an error. */
2699 if (! DECL_BUILT_IN (olddecl
))
2700 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2704 cp_error ("declaration of `%#D'", newdecl
);
2705 cp_error ("conflicts with built-in declaration `%#D'",
2711 cp_warning ("declaration of `%#D'", newdecl
);
2712 cp_warning ("conflicts with built-in declaration `%#D'",
2716 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
2718 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
2719 && TREE_CODE (newdecl
) != TYPE_DECL
2720 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
2721 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
2722 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
2723 && TREE_CODE (olddecl
) != TYPE_DECL
2724 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
2725 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
2728 /* We do nothing special here, because C++ does such nasty
2729 things with TYPE_DECLs. Instead, just let the TYPE_DECL
2730 get shadowed, and know that if we need to find a TYPE_DECL
2731 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
2732 slot of the identifier. */
2736 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
2737 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
2738 || (TREE_CODE (olddecl
) == FUNCTION_DECL
2739 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
2742 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
2743 if (TREE_CODE (olddecl
) == TREE_LIST
)
2744 olddecl
= TREE_VALUE (olddecl
);
2745 cp_error_at ("previous declaration of `%#D'", olddecl
);
2747 /* New decl is completely inconsistent with the old one =>
2748 tell caller to replace the old one. */
2752 else if (!types_match
)
2754 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2756 /* The name of a class template may not be declared to refer to
2757 any other template, class, function, object, namespace, value,
2758 or type in the same scope. */
2759 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
2760 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2762 cp_error ("declaration of template `%#D'", newdecl
);
2763 cp_error_at ("conflicts with previous declaration `%#D'",
2766 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
2767 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
2768 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
2769 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))), 3)
2770 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2771 DECL_TEMPLATE_PARMS (olddecl
)))
2773 cp_error ("new declaration `%#D'", newdecl
);
2774 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
2778 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2780 if (DECL_LANGUAGE (newdecl
) == lang_c
2781 && DECL_LANGUAGE (olddecl
) == lang_c
)
2783 cp_error ("declaration of C function `%#D' conflicts with",
2785 cp_error_at ("previous declaration `%#D' here", olddecl
);
2787 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
2788 TYPE_ARG_TYPES (TREE_TYPE (olddecl
)), 3))
2790 cp_error ("new declaration `%#D'", newdecl
);
2791 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
2797 /* Already complained about this, so don't do so again. */
2798 else if (current_class_type
== NULL_TREE
2799 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
2801 cp_error ("conflicting types for `%#D'", newdecl
);
2802 cp_error_at ("previous declaration as `%#D'", olddecl
);
2805 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
2806 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
2807 && (!DECL_TEMPLATE_INFO (newdecl
)
2808 || (DECL_TI_TEMPLATE (newdecl
)
2809 != DECL_TI_TEMPLATE (olddecl
))))
2810 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
2811 && (!DECL_TEMPLATE_INFO (olddecl
)
2812 || (DECL_TI_TEMPLATE (olddecl
)
2813 != DECL_TI_TEMPLATE (newdecl
))))))
2814 /* It's OK to have a template specialization and a non-template
2815 with the same type, or to have specializations of two
2816 different templates with the same type. Note that if one is a
2817 specialization, and the other is an instantiation of the same
2818 template, that we do not exit at this point. That situation
2819 can occur if we instantiate a template class, and then
2820 specialize one of its methods. This situation is legal, but
2821 the declarations must be merged in the usual way. */
2823 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
2824 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
2825 && !DECL_USE_TEMPLATE (newdecl
))
2826 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
2827 && !DECL_USE_TEMPLATE (olddecl
))))
2828 /* One of the declarations is a template instantiation, and the
2829 other is not a template at all. That's OK. */
2831 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
2832 && DECL_NAMESPACE_ALIAS (newdecl
)
2833 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
2834 /* Redeclaration of namespace alias, ignore it. */
2838 char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
2841 cp_error (errmsg
, newdecl
);
2842 if (DECL_NAME (olddecl
) != NULL_TREE
)
2843 cp_error_at ((DECL_INITIAL (olddecl
)
2844 && namespace_bindings_p ())
2845 ? "`%#D' previously defined here"
2846 : "`%#D' previously declared here", olddecl
);
2848 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
2849 && DECL_INITIAL (olddecl
) != NULL_TREE
2850 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
2851 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
2853 /* Prototype decl follows defn w/o prototype. */
2854 cp_warning_at ("prototype for `%#D'", newdecl
);
2855 cp_warning_at ("follows non-prototype definition here", olddecl
);
2857 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
2858 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
2860 /* extern "C" int foo ();
2861 int foo () { bar (); }
2863 if (current_lang_stack
== current_lang_base
)
2864 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
2867 cp_error_at ("previous declaration of `%#D' with %L linkage",
2868 olddecl
, DECL_LANGUAGE (olddecl
));
2869 cp_error ("conflicts with new declaration with %L linkage",
2870 DECL_LANGUAGE (newdecl
));
2874 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
2876 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
2878 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
2879 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
2882 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
2883 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
2885 for (; t1
&& t1
!= void_list_node
;
2886 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
2887 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
2889 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
2894 cp_pedwarn ("default argument given for parameter %d of `%#D'",
2896 cp_pedwarn_at ("after previous specification in `%#D'",
2902 cp_error ("default argument given for parameter %d of `%#D'",
2904 cp_error_at ("after previous specification in `%#D'",
2909 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
2910 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
2912 cp_warning ("`%#D' was used before it was declared inline",
2914 cp_warning_at ("previous non-inline declaration here",
2920 /* If new decl is `static' and an `extern' was seen previously,
2922 warn_extern_redeclared_static (newdecl
, olddecl
);
2924 /* We have committed to returning 1 at this point. */
2925 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2927 /* Now that functions must hold information normally held
2928 by field decls, there is extra work to do so that
2929 declaration information does not get destroyed during
2931 if (DECL_VINDEX (olddecl
))
2932 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
2933 if (DECL_CONTEXT (olddecl
))
2934 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
2935 if (DECL_CLASS_CONTEXT (olddecl
))
2936 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
2937 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
2938 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
2939 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
2940 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
2941 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
2942 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
2943 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
2944 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
2946 /* Optionally warn about more than one declaration for the same
2947 name, but don't warn about a function declaration followed by a
2949 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
2950 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
2951 /* Don't warn about extern decl followed by definition. */
2952 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
2953 /* Don't warn about friends, let add_friend take care of it. */
2954 && ! DECL_FRIEND_P (newdecl
))
2956 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
2957 cp_warning_at ("previous declaration of `%D'", olddecl
);
2961 /* Deal with C++: must preserve virtual function table size. */
2962 if (TREE_CODE (olddecl
) == TYPE_DECL
)
2964 register tree newtype
= TREE_TYPE (newdecl
);
2965 register tree oldtype
= TREE_TYPE (olddecl
);
2967 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
2968 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
2970 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
2971 CLASSTYPE_FRIEND_CLASSES (newtype
)
2972 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
2976 /* Copy all the DECL_... slots specified in the new decl
2977 except for any that we copy here from the old type. */
2978 DECL_MACHINE_ATTRIBUTES (newdecl
)
2979 = merge_machine_decl_attributes (olddecl
, newdecl
);
2981 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2983 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
2984 DECL_TEMPLATE_RESULT (olddecl
)))
2985 cp_error ("invalid redeclaration of %D", newdecl
);
2986 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
2987 DECL_TEMPLATE_PARMS (olddecl
) = DECL_TEMPLATE_PARMS (newdecl
);
2988 if (DECL_TEMPLATE_INFO (newdecl
))
2989 DECL_TEMPLATE_INFO (olddecl
) = DECL_TEMPLATE_INFO (newdecl
);
2990 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
2991 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
2992 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
2999 /* Automatically handles default parameters. */
3000 tree oldtype
= TREE_TYPE (olddecl
);
3003 /* Make sure we put the new type in the same obstack as the old one. */
3005 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3008 push_obstacks_nochange ();
3009 end_temporary_allocation ();
3012 /* Merge the data types specified in the two decls. */
3013 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3015 if (TREE_CODE (newdecl
) == VAR_DECL
)
3016 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3017 /* Do this after calling `common_type' so that default
3018 parameters don't confuse us. */
3019 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3020 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3021 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3023 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3024 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3025 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3026 TYPE_RAISES_EXCEPTIONS (oldtype
));
3028 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3029 && DECL_SOURCE_LINE (olddecl
) != 0
3031 && ! compexcepttypes (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
3033 cp_pedwarn ("declaration of `%D' throws different exceptions",
3035 cp_pedwarn_at ("previous declaration here", olddecl
);
3038 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3040 /* Lay the type out, unless already done. */
3041 if (newtype
!= canonical_type_variant (oldtype
)
3042 && TREE_TYPE (newdecl
) != error_mark_node
3043 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3044 layout_type (TREE_TYPE (newdecl
));
3046 if ((TREE_CODE (newdecl
) == VAR_DECL
3047 || TREE_CODE (newdecl
) == PARM_DECL
3048 || TREE_CODE (newdecl
) == RESULT_DECL
3049 || TREE_CODE (newdecl
) == FIELD_DECL
3050 || TREE_CODE (newdecl
) == TYPE_DECL
)
3051 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3052 layout_decl (newdecl
, 0);
3054 /* Merge the type qualifiers. */
3055 if (TREE_READONLY (newdecl
))
3056 TREE_READONLY (olddecl
) = 1;
3057 if (TREE_THIS_VOLATILE (newdecl
))
3058 TREE_THIS_VOLATILE (olddecl
) = 1;
3060 /* Merge the initialization information. */
3061 if (DECL_INITIAL (newdecl
) == NULL_TREE
3062 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3064 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3065 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3066 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3067 if (DECL_LANG_SPECIFIC (newdecl
)
3068 && DECL_LANG_SPECIFIC (olddecl
))
3069 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3072 /* Merge the section attribute.
3073 We want to issue an error if the sections conflict but that must be
3074 done later in decl_attributes since we are called before attributes
3076 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3077 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3079 /* Keep the old rtl since we can safely use it, unless it's the
3080 call to abort() used for abstract virtuals. */
3081 if ((DECL_LANG_SPECIFIC (olddecl
)
3082 && !DECL_ABSTRACT_VIRTUAL_P (olddecl
))
3083 || DECL_RTL (olddecl
) != DECL_RTL (abort_fndecl
))
3084 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3088 /* If cannot merge, then use the new type and qualifiers,
3089 and don't preserve the old rtl. */
3092 /* Clean out any memory we had of the old declaration. */
3093 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3095 TREE_VALUE (oldstatic
) = error_mark_node
;
3097 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3098 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3099 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3100 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3103 /* Merge the storage class information. */
3104 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3105 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3106 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3107 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3108 if (! DECL_EXTERNAL (olddecl
))
3109 DECL_EXTERNAL (newdecl
) = 0;
3111 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3113 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3114 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3115 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3116 /* Don't really know how much of the language-specific
3117 values we should copy from old to new. */
3118 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3119 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3120 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3121 if (DECL_TEMPLATE_INFO (newdecl
) == NULL_TREE
)
3123 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3124 DECL_USE_TEMPLATE (newdecl
) = DECL_USE_TEMPLATE (olddecl
);
3126 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3129 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3131 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3132 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3134 /* If newdecl is not a specialization, then it is not a
3135 template-related function at all. And that means that we
3136 shoud have exited above, returning 0. */
3137 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3140 if (TREE_USED (olddecl
))
3141 /* From [temp.expl.spec]:
3143 If a template, a member template or the member of a class
3144 template is explicitly specialized then that
3145 specialization shall be declared before the first use of
3146 that specialization that would cause an implicit
3147 instantiation to take place, in every translation unit in
3148 which such a use occurs. */
3149 cp_error ("explicit specialization of %D after first use",
3152 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3154 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3156 /* If either decl says `inline', this fn is inline, unless its
3157 definition was passed already. */
3158 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3159 DECL_INLINE (olddecl
) = 1;
3160 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3164 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3165 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3166 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3168 if (! types_match
|| new_defines_function
)
3170 /* These need to be copied so that the names are available. */
3171 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3172 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3174 if (new_defines_function
)
3175 /* If defining a function declared with other language
3176 linkage, use the previously declared language linkage. */
3177 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3180 /* If redeclaring a builtin function, and not a definition,
3181 it stays built in. */
3182 if (DECL_BUILT_IN (olddecl
))
3184 DECL_BUILT_IN (newdecl
) = 1;
3185 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3186 /* If we're keeping the built-in definition, keep the rtl,
3187 regardless of declaration matches. */
3188 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3191 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3193 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3194 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3195 /* Previously saved insns go together with
3196 the function's previous definition. */
3197 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3198 /* Don't clear out the arguments if we're redefining a function. */
3199 if (DECL_ARGUMENTS (olddecl
))
3200 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3202 if (DECL_LANG_SPECIFIC (olddecl
))
3203 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3206 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3208 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3211 /* Now preserve various other info from the definition. */
3212 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3213 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3214 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3215 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3217 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3220 struct lang_decl
*ol
= DECL_LANG_SPECIFIC (olddecl
);
3221 struct lang_decl
*nl
= DECL_LANG_SPECIFIC (newdecl
);
3223 function_size
= sizeof (struct tree_decl
);
3225 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3226 (char *) olddecl
+ sizeof (struct tree_common
),
3227 function_size
- sizeof (struct tree_common
));
3229 /* Can we safely free the storage used by newdecl? */
3231 #define ROUND(x) ((x + obstack_alignment_mask (&permanent_obstack)) \
3232 & ~ obstack_alignment_mask (&permanent_obstack))
3234 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3236 /* If newdecl is a template instantiation, it is possible that
3237 the following sequence of events has occurred:
3239 o A friend function was declared in a class template. The
3240 class template was instantiated.
3242 o The instantiation of the friend declaration was
3243 recorded on the instantiation list, and is newdecl.
3245 o Later, however, instantiate_class_template called pushdecl
3246 on the newdecl to perform name injection. But, pushdecl in
3247 turn called duplicate_decls when it discovered that another
3248 declaration of a global function with the same name already
3251 o Here, in duplicate_decls, we decided to clobber newdecl.
3253 If we're going to do that, we'd better make sure that
3254 olddecl, and not newdecl, is on the list of
3255 instantiations so that if we try to do the instantiation
3256 again we won't get the clobbered declaration. */
3258 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3259 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3261 for (; decls
; decls
= TREE_CHAIN (decls
))
3262 if (TREE_VALUE (decls
) == newdecl
)
3263 TREE_VALUE (decls
) = olddecl
;
3266 if (((char *)newdecl
+ ROUND (function_size
) == (char *)nl
3267 && ((char *)newdecl
+ ROUND (function_size
)
3268 + ROUND (sizeof (struct lang_decl
))
3269 == obstack_next_free (&permanent_obstack
)))
3270 || ((char *)newdecl
+ ROUND (function_size
)
3271 == obstack_next_free (&permanent_obstack
)))
3273 DECL_MAIN_VARIANT (newdecl
) = olddecl
;
3274 DECL_LANG_SPECIFIC (olddecl
) = ol
;
3275 bcopy ((char *)nl
, (char *)ol
, sizeof (struct lang_decl
));
3277 obstack_free (&permanent_obstack
, newdecl
);
3279 else if (LANG_DECL_PERMANENT (ol
) && ol
!= nl
)
3281 if (DECL_MAIN_VARIANT (olddecl
) == olddecl
)
3283 /* Save these lang_decls that would otherwise be lost. */
3284 extern tree free_lang_decl_chain
;
3285 tree free_lang_decl
= (tree
) ol
;
3287 if (DECL_LANG_SPECIFIC (olddecl
) == ol
)
3290 TREE_CHAIN (free_lang_decl
) = free_lang_decl_chain
;
3291 free_lang_decl_chain
= free_lang_decl
;
3295 /* Storage leak. */;
3301 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3302 (char *) olddecl
+ sizeof (struct tree_common
),
3303 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3304 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3307 DECL_UID (olddecl
) = olddecl_uid
;
3309 DECL_FRIEND_P (olddecl
) = 1;
3311 /* NEWDECL contains the merged attribute lists.
3312 Update OLDDECL to be the same. */
3313 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3318 /* Record a decl-node X as belonging to the current lexical scope.
3319 Check for errors (such as an incompatible declaration for the same
3320 name already seen in the same scope).
3322 Returns either X or an old decl for the same name.
3323 If an old decl is returned, it may have been smashed
3324 to agree with what X says. */
3331 register tree name
= DECL_ASSEMBLER_NAME (x
);
3332 register struct binding_level
*b
= current_binding_level
;
3334 if (current_function_decl
&& x
!= current_function_decl
3335 /* A local declaration for a function doesn't constitute nesting. */
3336 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3337 /* Don't change DECL_CONTEXT of virtual methods. */
3338 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3339 && ! DECL_CONTEXT (x
))
3340 DECL_CONTEXT (x
) = current_function_decl
;
3341 if (!DECL_CONTEXT (x
))
3342 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3344 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3345 compiler wants to use. */
3346 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3347 || TREE_CODE (x
) == NAMESPACE_DECL
|| TREE_CODE (x
) == TEMPLATE_TYPE_PARM
3348 || TREE_CODE (x
) == TEMPLATE_TEMPLATE_PARM
)
3349 name
= DECL_NAME (x
);
3354 /* Not needed...see below. */
3358 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3359 name
= TREE_OPERAND (name
, 0);
3361 /* Namespace-scoped variables are not found in the current level. */
3362 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3363 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3365 t
= lookup_name_current_level (name
);
3366 if (t
== error_mark_node
)
3368 /* error_mark_node is 0 for a while during initialization! */
3370 cp_error_at ("`%#D' used prior to declaration", x
);
3373 else if (t
!= NULL_TREE
)
3376 /* This is turned off until I have time to do it right (bpk). */
3377 /* With the code below that uses it... */
3378 file
= DECL_SOURCE_FILE (t
);
3379 line
= DECL_SOURCE_LINE (t
);
3381 if (TREE_CODE (t
) == PARM_DECL
)
3383 if (DECL_CONTEXT (t
) == NULL_TREE
)
3384 fatal ("parse errors have confused me too much");
3386 /* Check for duplicate params. */
3387 if (duplicate_decls (x
, t
))
3390 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3391 || DECL_FUNCTION_TEMPLATE_P (x
))
3392 && is_overloaded_fn (t
))
3393 /* Don't do anything just yet. */;
3394 else if (t
== wchar_decl_node
)
3396 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3397 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3399 /* Throw away the redeclaration. */
3402 else if (TREE_CODE (t
) != TREE_CODE (x
))
3404 if (duplicate_decls (x
, t
))
3407 else if (duplicate_decls (x
, t
))
3410 /* This is turned off until I have time to do it right (bpk). */
3412 /* Also warn if they did a prototype with `static' on it, but
3413 then later left the `static' off. */
3414 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3416 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3421 cp_warning ("`static' missing from declaration of `%D'",
3423 warning_with_file_and_line (file
, line
,
3424 "previous declaration of `%s'",
3425 decl_as_string (t
, 0));
3428 /* Now fix things so it'll do what they expect. */
3429 if (current_function_decl
)
3430 TREE_PUBLIC (current_function_decl
) = 0;
3432 /* Due to interference in memory reclamation (X may be
3433 obstack-deallocated at this point), we must guard against
3434 one really special case. [jason: This should be handled
3435 by start_function] */
3436 if (current_function_decl
== x
)
3437 current_function_decl
= t
;
3439 if (TREE_CODE (t
) == TYPE_DECL
)
3440 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3441 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3442 check_default_args (t
);
3446 else if (DECL_MAIN_P (x
))
3448 /* A redeclaration of main, but not a duplicate of the
3453 This function shall not be overloaded. */
3454 cp_error_at ("invalid redeclaration of `%D'", t
);
3455 cp_error ("as `%D'", x
);
3456 /* We don't try to push this declaration since that
3462 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3464 t
= push_overloaded_decl (x
, 1);
3465 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3468 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3469 return push_overloaded_decl (x
, 0);
3471 /* If declaring a type as a typedef, copy the type (unless we're
3472 at line 0), and install this TYPE_DECL as the new type's typedef
3473 name. See the extensive comment in ../c-decl.c (pushdecl). */
3474 if (TREE_CODE (x
) == TYPE_DECL
)
3476 tree type
= TREE_TYPE (x
);
3477 if (DECL_SOURCE_LINE (x
) == 0)
3479 if (TYPE_NAME (type
) == 0)
3480 TYPE_NAME (type
) = x
;
3482 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3483 /* We don't want to copy the type when all we're
3484 doing is making a TYPE_DECL for the purposes of
3486 && (!TYPE_NAME (type
)
3487 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3489 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3491 DECL_ORIGINAL_TYPE (x
) = type
;
3492 type
= build_type_copy (type
);
3493 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3494 TYPE_NAME (type
) = x
;
3495 TREE_TYPE (x
) = type
;
3500 if (type
!= error_mark_node
3502 && TYPE_IDENTIFIER (type
))
3503 set_identifier_type_value_with_scope (DECL_NAME (x
), type
, b
);
3506 /* Multiple external decls of the same identifier ought to match.
3508 We get warnings about inline functions where they are defined.
3509 We get warnings about other functions from push_overloaded_decl.
3511 Avoid duplicate warnings where they are used. */
3512 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3516 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3517 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3518 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3519 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3524 /* If different sort of thing, we already gave an error. */
3525 && TREE_CODE (decl
) == TREE_CODE (x
)
3526 && ! comptypes (TREE_TYPE (x
), TREE_TYPE (decl
), 1))
3528 cp_pedwarn ("type mismatch with previous external decl", x
);
3529 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3533 /* This name is new in its binding level.
3534 Install the new declaration and return it. */
3535 if (namespace_bindings_p ())
3537 /* Install a global value. */
3539 /* If the first global decl has external linkage,
3540 warn if we later see static one. */
3541 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3542 TREE_PUBLIC (name
) = 1;
3544 /* Don't install an artificial TYPE_DECL if we already have
3545 another _DECL with that name. */
3546 if (TREE_CODE (x
) != TYPE_DECL
3548 || ! DECL_ARTIFICIAL (x
))
3550 if (TREE_CODE (x
) == FUNCTION_DECL
)
3552 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3553 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3554 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3557 /* Don't forget if the function was used via an implicit decl. */
3558 if (IDENTIFIER_IMPLICIT_DECL (name
)
3559 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3562 /* Don't forget if its address was taken in that way. */
3563 if (IDENTIFIER_IMPLICIT_DECL (name
)
3564 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3565 TREE_ADDRESSABLE (x
) = 1;
3567 /* Warn about mismatches against previous implicit decl. */
3568 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3569 /* If this real decl matches the implicit, don't complain. */
3570 && ! (TREE_CODE (x
) == FUNCTION_DECL
3571 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3573 ("`%D' was previously implicitly declared to return `int'", x
);
3575 /* If new decl is `static' and an `extern' was seen previously,
3577 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3578 warn_extern_redeclared_static (x
, t
);
3582 /* Here to install a non-global value. */
3583 tree oldlocal
= IDENTIFIER_LOCAL_VALUE (name
);
3584 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3586 /* Don't install an artificial TYPE_DECL if we already have
3587 another _DECL with that name. */
3588 if (TREE_CODE (x
) != TYPE_DECL
3590 || ! DECL_ARTIFICIAL (x
))
3591 set_identifier_local_value_with_scope (name
, x
, b
);
3593 /* If this is a TYPE_DECL, push it into the type value slot. */
3594 if (TREE_CODE (x
) == TYPE_DECL
)
3595 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
), b
);
3597 /* Clear out any TYPE_DECL shadowed by a namespace so that
3598 we won't think this is a type. The C struct hack doesn't
3599 go through namespaces. */
3600 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3601 set_identifier_type_value_with_scope (name
, NULL_TREE
, b
);
3603 /* If this is an extern function declaration, see if we
3604 have a global definition or declaration for the function. */
3605 if (oldlocal
== NULL_TREE
3606 && DECL_EXTERNAL (x
)
3607 && oldglobal
!= NULL_TREE
3608 && TREE_CODE (x
) == FUNCTION_DECL
3609 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3611 /* We have one. Their types must agree. */
3612 if (decls_match (x
, oldglobal
))
3616 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3617 cp_warning_at ("global declaration `%#D'", oldglobal
);
3620 /* If we have a local external declaration,
3621 and no file-scope declaration has yet been seen,
3622 then if we later have a file-scope decl it must not be static. */
3623 if (oldlocal
== NULL_TREE
3624 && oldglobal
== NULL_TREE
3625 && DECL_EXTERNAL (x
)
3628 TREE_PUBLIC (name
) = 1;
3631 if (DECL_FROM_INLINE (x
))
3632 /* Inline decls shadow nothing. */;
3634 /* Warn if shadowing an argument at the top level of the body. */
3635 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3636 && TREE_CODE (oldlocal
) == PARM_DECL
3637 && TREE_CODE (x
) != PARM_DECL
)
3639 /* Go to where the parms should be and see if we
3641 struct binding_level
*b
= current_binding_level
->level_chain
;
3647 if (b
->parm_flag
== 1)
3648 cp_error ("declaration of `%#D' shadows a parameter", name
);
3650 else if (warn_shadow
&& oldlocal
!= NULL_TREE
&& b
->is_for_scope
3651 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3653 warning ("variable `%s' shadows local",
3654 IDENTIFIER_POINTER (name
));
3655 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3657 /* Maybe warn if shadowing something else. */
3658 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
3659 /* No shadow warnings for internally generated vars. */
3660 && ! DECL_ARTIFICIAL (x
)
3661 /* No shadow warnings for vars made for inlining. */
3662 && ! DECL_FROM_INLINE (x
))
3664 char *warnstring
= NULL
;
3666 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
3667 warnstring
= "declaration of `%s' shadows a parameter";
3668 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
3669 && current_class_ptr
3670 && !TREE_STATIC (name
))
3671 warnstring
= "declaration of `%s' shadows a member of `this'";
3672 else if (oldlocal
!= NULL_TREE
)
3673 warnstring
= "declaration of `%s' shadows previous local";
3674 else if (oldglobal
!= NULL_TREE
)
3675 /* XXX shadow warnings in outer-more namespaces */
3676 warnstring
= "declaration of `%s' shadows global declaration";
3679 warning (warnstring
, IDENTIFIER_POINTER (name
));
3681 /* Check to see if decl redeclares a template parameter. */
3682 if (oldlocal
&& (current_class_type
|| current_function_decl
)
3683 && current_template_parms
)
3685 if (decl_template_parm_p (oldlocal
))
3687 cp_error ("re-using name of template parameter `%T' in this scope", name
);
3688 cp_error_at (" previously declared here `%#D'", oldlocal
);
3693 if (TREE_CODE (x
) == FUNCTION_DECL
)
3694 check_default_args (x
);
3696 /* Keep count of variables in this level with incomplete type. */
3697 if (TREE_CODE (x
) == VAR_DECL
3698 && TREE_TYPE (x
) != error_mark_node
3699 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
3700 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
3701 /* RTTI TD entries are created while defining the type_info. */
3702 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
3703 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
3704 b
->incomplete
= tree_cons (NULL_TREE
, x
, b
->incomplete
);
3707 /* Put decls on list in reverse order.
3708 We will reverse them later if necessary. */
3709 TREE_CHAIN (x
) = b
->names
;
3711 if (! (b
!= global_binding_level
|| TREE_PERMANENT (x
)))
3712 my_friendly_abort (124);
3717 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
3718 caller to set DECL_CONTEXT properly. */
3721 pushdecl_with_scope (x
, level
)
3723 struct binding_level
*level
;
3725 register struct binding_level
*b
;
3726 tree function_decl
= current_function_decl
;
3728 current_function_decl
= NULL_TREE
;
3729 if (level
->parm_flag
== 2)
3731 b
= class_binding_level
;
3732 class_binding_level
= level
;
3733 pushdecl_class_level (x
);
3734 class_binding_level
= b
;
3738 b
= current_binding_level
;
3739 current_binding_level
= level
;
3741 current_binding_level
= b
;
3743 current_function_decl
= function_decl
;
3747 /* Like pushdecl, only it places X in the current namespace,
3751 pushdecl_namespace_level (x
)
3754 register struct binding_level
*b
= inner_binding_level
;
3757 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
3759 /* Now, the type_shadowed stack may screw us. Munge it so it does
3761 if (TREE_CODE (x
) == TYPE_DECL
)
3763 tree name
= DECL_NAME (x
);
3765 tree
*ptr
= (tree
*)0;
3766 for (; b
!= global_binding_level
; b
= b
->level_chain
)
3768 tree shadowed
= b
->type_shadowed
;
3769 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
3770 if (TREE_PURPOSE (shadowed
) == name
)
3772 ptr
= &TREE_VALUE (shadowed
);
3773 /* Can't break out of the loop here because sometimes
3774 a binding level will have duplicate bindings for
3775 PT names. It's gross, but I haven't time to fix it. */
3778 newval
= TREE_TYPE (x
);
3779 if (ptr
== (tree
*)0)
3781 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
3782 up here if this is changed to an assertion. --KR */
3783 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
3793 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
3797 pushdecl_top_level (x
)
3800 tree cur_namespace
= current_namespace
;
3801 current_namespace
= global_namespace
;
3802 x
= pushdecl_namespace_level (x
);
3803 current_namespace
= cur_namespace
;
3807 /* Make the declaration of X appear in CLASS scope. */
3810 pushdecl_class_level (x
)
3813 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
3814 scope looks for the pre-mangled name. */
3815 register tree name
= DECL_NAME (x
);
3819 if (TYPE_BEING_DEFINED (current_class_type
))
3821 /* A name N used in a class S shall refer to the same declaration
3822 in its context and when re-evaluated in the completed scope of S.
3823 Types, enums, and static vars are checked here; other
3824 members are checked in finish_struct. */
3825 tree icv
= IDENTIFIER_CLASS_VALUE (name
);
3826 tree ilv
= IDENTIFIER_LOCAL_VALUE (name
);
3829 && flag_optional_diags
3830 /* Don't complain about inherited names. */
3831 && id_in_current_class (name
)
3832 /* Or shadowed tags. */
3833 && !(DECL_DECLARES_TYPE_P (icv
)
3834 && DECL_CONTEXT (icv
) == current_class_type
))
3836 cp_pedwarn ("declaration of identifier `%D' as `%#D'", name
, x
);
3837 cp_pedwarn_at ("conflicts with previous use in class as `%#D'",
3841 /* Check to see if decl redeclares a template parameter. */
3842 if (ilv
&& ! decls_match (ilv
, x
)
3843 && (current_class_type
|| current_function_decl
)
3844 && current_template_parms
)
3846 if (decl_template_parm_p (ilv
))
3848 cp_error ("re-using name of template parameter `%T' in this scope", name
);
3849 cp_error_at (" previously declared here `%#D'", ilv
);
3854 push_class_level_binding (name
, x
);
3855 if (TREE_CODE (x
) == TYPE_DECL
)
3857 set_identifier_type_value (name
, TREE_TYPE (x
));
3863 /* This function is used to push the mangled decls for nested types into
3864 the appropriate scope. Previously pushdecl_top_level was used, but that
3865 is incorrect for members of local classes. */
3868 pushdecl_nonclass_level (x
)
3871 struct binding_level
*b
= current_binding_level
;
3873 my_friendly_assert (b
->parm_flag
!= 2, 180);
3876 /* Get out of template binding levels */
3877 while (b
->pseudo_global
)
3881 pushdecl_with_scope (x
, b
);
3885 /* Make the declaration(s) of X appear in CLASS scope
3886 under the name NAME. */
3889 push_class_level_binding (name
, x
)
3893 /* The class_binding_level will be NULL if x is a template
3894 parameter name in a member template. */
3895 if (!class_binding_level
)
3898 if (TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3899 && purpose_member (name
, class_binding_level
->class_shadowed
))
3902 maybe_push_cache_obstack ();
3903 class_binding_level
->class_shadowed
3904 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
3905 class_binding_level
->class_shadowed
);
3907 IDENTIFIER_CLASS_VALUE (name
) = x
;
3908 obstack_ptr_grow (&decl_obstack
, x
);
3911 /* Insert another USING_DECL into the current binding level,
3912 returning this declaration. If this is a redeclaration,
3913 do nothing and return NULL_TREE. */
3916 push_using_decl (scope
, name
)
3922 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
3923 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
3924 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
3925 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
3929 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
3930 DECL_INITIAL (decl
) = scope
;
3931 TREE_CHAIN (decl
) = current_binding_level
->usings
;
3932 current_binding_level
->usings
= decl
;
3936 /* Add namespace to using_directives. Return NULL_TREE if nothing was
3937 changed (i.e. there was already a directive), or the fresh
3938 TREE_LIST otherwise. */
3941 push_using_directive (used
)
3944 tree ud
= current_binding_level
->using_directives
;
3945 tree iter
, ancestor
;
3947 /* Check if we already have this. */
3948 if (purpose_member (used
, ud
) != NULL_TREE
)
3951 /* Recursively add all namespaces used. */
3952 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
3953 push_using_directive (TREE_PURPOSE (iter
));
3955 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
3956 ud
= current_binding_level
->using_directives
;
3957 ud
= perm_tree_cons (used
, ancestor
, ud
);
3958 current_binding_level
->using_directives
= ud
;
3962 /* DECL is a FUNCTION_DECL which may have other definitions already in
3963 place. We get around this by making the value of the identifier point
3964 to a list of all the things that want to be referenced by that name. It
3965 is then up to the users of that name to decide what to do with that
3968 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
3969 slot. It is dealt with the same way.
3971 The value returned may be a previous declaration if we guessed wrong
3972 about what language DECL should belong to (C or C++). Otherwise,
3973 it's always DECL (and never something that's not a _DECL). */
3976 push_overloaded_decl (decl
, forgettable
)
3980 tree orig_name
= DECL_NAME (decl
);
3982 int doing_global
= (namespace_bindings_p () || ! forgettable
);
3986 old
= namespace_binding (orig_name
, DECL_CONTEXT (decl
));
3987 if (old
&& TREE_CODE (old
) == FUNCTION_DECL
3988 && DECL_ARTIFICIAL (old
)
3989 && (DECL_BUILT_IN (old
) || DECL_BUILT_IN_NONANSI (old
)))
3991 if (duplicate_decls (decl
, old
))
3998 old
= IDENTIFIER_LOCAL_VALUE (orig_name
);
4000 if (! purpose_member (orig_name
, current_binding_level
->shadowed
))
4002 current_binding_level
->shadowed
4003 = tree_cons (orig_name
, old
, current_binding_level
->shadowed
);
4010 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4012 tree t
= TREE_TYPE (old
);
4013 if (IS_AGGR_TYPE (t
) && warn_shadow
4014 && (! DECL_IN_SYSTEM_HEADER (decl
)
4015 || ! DECL_IN_SYSTEM_HEADER (old
)))
4016 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4019 else if (is_overloaded_fn (old
))
4023 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4024 if (decl
== OVL_CURRENT (tmp
)
4025 || duplicate_decls (decl
, OVL_CURRENT (tmp
)))
4026 return OVL_CURRENT (tmp
);
4030 cp_error_at ("previous non-function declaration `%#D'", old
);
4031 cp_error ("conflicts with function declaration `%#D'", decl
);
4036 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4038 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4039 old
= ovl_cons (old
, NULL_TREE
);
4040 old
= ovl_cons (decl
, old
);
4043 /* orig_name is not ambiguous. */
4047 set_namespace_binding (orig_name
, current_namespace
, old
);
4049 IDENTIFIER_LOCAL_VALUE (orig_name
) = old
;
4054 /* Generate an implicit declaration for identifier FUNCTIONID
4055 as a function of type int (). Print a warning if appropriate. */
4058 implicitly_declare (functionid
)
4062 int temp
= allocation_temporary_p ();
4064 push_obstacks_nochange ();
4066 /* Save the decl permanently so we can warn if definition follows.
4067 In ANSI C, warn_implicit is usually false, so the saves little space.
4068 But in C++, it's usually true, hence the extra code. */
4069 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4070 end_temporary_allocation ();
4072 /* We used to reuse an old implicit decl here,
4073 but this loses with inline functions because it can clobber
4074 the saved decl chains. */
4075 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4077 DECL_EXTERNAL (decl
) = 1;
4078 TREE_PUBLIC (decl
) = 1;
4080 /* ANSI standard says implicit declarations are in the innermost block.
4081 So we record the decl in the standard fashion. */
4083 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4086 /* Only one warning per identifier. */
4087 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4089 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4092 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4099 /* Return zero if the declaration NEWDECL is valid
4100 when the declaration OLDDECL (assumed to be for the same name)
4101 has already been seen.
4102 Otherwise return an error message format string with a %s
4103 where the identifier should go. */
4106 redeclaration_error_message (newdecl
, olddecl
)
4107 tree newdecl
, olddecl
;
4109 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4111 /* Because C++ can put things into name space for free,
4112 constructs like "typedef struct foo { ... } foo"
4113 would look like an erroneous redeclaration. */
4114 if (comptypes (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
), 0))
4117 return "redefinition of `%#D'";
4119 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4121 /* If this is a pure function, its olddecl will actually be
4122 the original initialization to `0' (which we force to call
4123 abort()). Don't complain about redefinition in this case. */
4124 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4127 /* If both functions come from different namespaces, this is not
4128 a redeclaration - this is a conflict with a used function. */
4129 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4130 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4131 return "`%D' conflicts with used function";
4133 /* We'll complain about linkage mismatches in
4134 warn_extern_redeclared_static. */
4136 /* Defining the same name twice is no good. */
4137 if (DECL_INITIAL (olddecl
) != NULL_TREE
4138 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4140 if (DECL_NAME (olddecl
) == NULL_TREE
)
4141 return "`%#D' not declared in class";
4143 return "redefinition of `%#D'";
4147 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4149 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4150 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4151 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4152 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4153 && TYPE_SIZE (TREE_TYPE (newdecl
))
4154 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4155 return "redefinition of `%#D'";
4158 else if (toplevel_bindings_p ())
4160 /* Objects declared at top level: */
4161 /* If at least one is a reference, it's ok. */
4162 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4164 /* Reject two definitions. */
4165 return "redefinition of `%#D'";
4169 /* Objects declared with block scope: */
4170 /* Reject two definitions, and reject a definition
4171 together with an external reference. */
4172 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4173 return "redeclaration of `%#D'";
4178 /* Get the LABEL_DECL corresponding to identifier ID as a label.
4179 Create one if none exists so far for the current function.
4180 This function is called for both label definitions and label references. */
4186 register tree decl
= IDENTIFIER_LABEL_VALUE (id
);
4188 if (current_function_decl
== NULL_TREE
)
4190 error ("label `%s' referenced outside of any function",
4191 IDENTIFIER_POINTER (id
));
4195 if ((decl
== NULL_TREE
4196 || DECL_SOURCE_LINE (decl
) == 0)
4197 && (named_label_uses
== NULL
4198 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4199 || named_label_uses
->label_decl
!= decl
))
4201 struct named_label_list
*new_ent
;
4203 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4204 new_ent
->label_decl
= decl
;
4205 new_ent
->names_in_scope
= current_binding_level
->names
;
4206 new_ent
->binding_level
= current_binding_level
;
4207 new_ent
->lineno_o_goto
= lineno
;
4208 new_ent
->filename_o_goto
= input_filename
;
4209 new_ent
->next
= named_label_uses
;
4210 named_label_uses
= new_ent
;
4213 /* Use a label already defined or ref'd with this name. */
4214 if (decl
!= NULL_TREE
)
4216 /* But not if it is inherited and wasn't declared to be inheritable. */
4217 if (DECL_CONTEXT (decl
) != current_function_decl
4218 && ! C_DECLARED_LABEL_FLAG (decl
))
4219 return shadow_label (id
);
4223 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4225 /* Make sure every label has an rtx. */
4228 /* A label not explicitly declared must be local to where it's ref'd. */
4229 DECL_CONTEXT (decl
) = current_function_decl
;
4231 DECL_MODE (decl
) = VOIDmode
;
4233 /* Say where one reference is to the label,
4234 for the sake of the error if it is not defined. */
4235 DECL_SOURCE_LINE (decl
) = lineno
;
4236 DECL_SOURCE_FILE (decl
) = input_filename
;
4238 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4240 named_labels
= tree_cons (NULL_TREE
, decl
, named_labels
);
4241 named_label_uses
->label_decl
= decl
;
4246 /* Make a label named NAME in the current function,
4247 shadowing silently any that may be inherited from containing functions
4248 or containing scopes.
4250 Note that valid use, if the label being shadowed
4251 comes from another scope in the same function,
4252 requires calling declare_nonlocal_label right away. */
4258 register tree decl
= IDENTIFIER_LABEL_VALUE (name
);
4260 if (decl
!= NULL_TREE
)
4262 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4263 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4266 return lookup_label (name
);
4269 /* Define a label, specifying the location in the source file.
4270 Return the LABEL_DECL node for the label, if the definition is valid.
4271 Otherwise return 0. */
4274 define_label (filename
, line
, name
)
4281 if (minimal_parse_mode
)
4283 push_obstacks (&permanent_obstack
, &permanent_obstack
);
4284 decl
= build_decl (LABEL_DECL
, name
, void_type_node
);
4286 DECL_SOURCE_LINE (decl
) = line
;
4287 DECL_SOURCE_FILE (decl
) = filename
;
4292 decl
= lookup_label (name
);
4294 /* After labels, make any new cleanups go into their
4295 own new (temporary) binding contour. */
4296 current_binding_level
->more_cleanups_ok
= 0;
4298 /* If label with this name is known from an outer context, shadow it. */
4299 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) != current_function_decl
)
4301 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4302 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4303 decl
= lookup_label (name
);
4306 if (name
== get_identifier ("wchar_t"))
4307 cp_pedwarn ("label named wchar_t");
4309 if (DECL_INITIAL (decl
) != NULL_TREE
)
4311 cp_error ("duplicate label `%D'", decl
);
4316 struct named_label_list
*uses
, *prev
;
4319 /* Mark label as having been defined. */
4320 DECL_INITIAL (decl
) = error_mark_node
;
4321 /* Say where in the source. */
4322 DECL_SOURCE_FILE (decl
) = filename
;
4323 DECL_SOURCE_LINE (decl
) = line
;
4326 uses
= named_label_uses
;
4327 while (uses
!= NULL
)
4328 if (uses
->label_decl
== decl
)
4330 struct binding_level
*b
= current_binding_level
;
4333 tree new_decls
= b
->names
;
4334 tree old_decls
= (b
== uses
->binding_level
)
4335 ? uses
->names_in_scope
: NULL_TREE
;
4336 while (new_decls
!= old_decls
)
4338 if (TREE_CODE (new_decls
) == VAR_DECL
4339 /* Don't complain about crossing initialization
4340 of internal entities. They can't be accessed,
4341 and they should be cleaned up
4342 by the time we get to the label. */
4343 && ! DECL_ARTIFICIAL (new_decls
)
4344 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4345 && DECL_INITIAL (new_decls
) != error_mark_node
)
4346 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4350 cp_error ("jump to label `%D'", decl
);
4351 error_with_file_and_line (uses
->filename_o_goto
,
4352 uses
->lineno_o_goto
,
4356 cp_error_at (" crosses initialization of `%#D'",
4359 new_decls
= TREE_CHAIN (new_decls
);
4361 if (b
== uses
->binding_level
)
4367 prev
->next
= uses
->next
;
4369 named_label_uses
= uses
->next
;
4378 current_function_return_value
= NULL_TREE
;
4385 struct binding_level
*level
;
4386 struct cp_switch
*next
;
4389 static struct cp_switch
*switch_stack
;
4395 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4396 p
->level
= current_binding_level
;
4397 p
->next
= switch_stack
;
4404 switch_stack
= switch_stack
->next
;
4407 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
4408 /* XXX Note decl is never actually used. (bpk) */
4411 define_case_label ()
4413 tree cleanup
= last_cleanup_this_contour ();
4414 struct binding_level
*b
= current_binding_level
;
4419 static int explained
= 0;
4420 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4421 warning ("where case label appears here");
4424 warning ("(enclose actions of previous case statements requiring");
4425 warning ("destructors in their own binding contours.)");
4430 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4432 tree new_decls
= b
->names
;
4433 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4435 if (TREE_CODE (new_decls
) == VAR_DECL
4436 /* Don't complain about crossing initialization
4437 of internal entities. They can't be accessed,
4438 and they should be cleaned up
4439 by the time we get to the label. */
4440 && ! DECL_ARTIFICIAL (new_decls
)
4441 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4442 && DECL_INITIAL (new_decls
) != error_mark_node
)
4443 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4446 error ("jump to case label");
4448 cp_error_at (" crosses initialization of `%#D'",
4454 /* After labels, make any new cleanups go into their
4455 own new (temporary) binding contour. */
4457 current_binding_level
->more_cleanups_ok
= 0;
4458 current_function_return_value
= NULL_TREE
;
4461 /* Return the list of declarations of the current level.
4462 Note that this list is in reverse order unless/until
4463 you nreverse it; and when you do nreverse it, you must
4464 store the result back using `storedecls' or you will lose. */
4469 return current_binding_level
->names
;
4472 /* Return the list of type-tags (for structs, etc) of the current level. */
4477 return current_binding_level
->tags
;
4480 /* Store the list of declarations of the current level.
4481 This is done for the parameter declarations of a function being defined,
4482 after they are modified in the light of any missing parameters. */
4488 current_binding_level
->names
= decls
;
4491 /* Similarly, store the list of tags of the current level. */
4497 current_binding_level
->tags
= tags
;
4500 /* Given NAME, an IDENTIFIER_NODE,
4501 return the structure (or union or enum) definition for that name.
4502 Searches binding levels from BINDING_LEVEL up to the global level.
4503 If THISLEVEL_ONLY is nonzero, searches only the specified context
4504 (but skips any tag-transparent contexts to find one that is
4505 meaningful for tags).
4506 FORM says which kind of type the caller wants;
4507 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4508 If the wrong kind of type is found, and it's not a template, an error is
4512 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4513 enum tree_code form
;
4515 struct binding_level
*binding_level
;
4518 register struct binding_level
*level
;
4519 /* Non-zero if, we should look past a pseudo-global level, even if
4521 int allow_pseudo_global
= 1;
4523 for (level
= binding_level
; level
; level
= level
->level_chain
)
4526 if (ANON_AGGRNAME_P (name
))
4527 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4529 /* There's no need for error checking here, because
4530 anon names are unique throughout the compilation. */
4531 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4532 return TREE_VALUE (tail
);
4534 else if (level
->namespace_p
)
4535 /* Do namespace lookup. */
4536 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
4538 tree old
= binding_for_name (name
, tail
);
4540 /* If we just skipped past a pseudo global level, even
4541 though THISLEVEL_ONLY, and we find a template class
4542 declaration, then we use the _TYPE node for the
4543 template. See the example below. */
4544 if (thislevel_only
&& !allow_pseudo_global
4545 && old
&& BINDING_VALUE (old
)
4546 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
4547 old
= TREE_TYPE (BINDING_VALUE (old
));
4549 old
= BINDING_TYPE (old
);
4551 /* If it has an original type, it is a typedef, and we
4552 should not return it. */
4553 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
4555 if (old
&& TREE_CODE (old
) != form
4556 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
4558 cp_error ("`%#D' redeclared as %C", old
, form
);
4563 if (thislevel_only
|| tail
== global_namespace
)
4567 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4569 if (TREE_PURPOSE (tail
) == name
)
4571 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
4572 /* Should tighten this up; it'll probably permit
4573 UNION_TYPE and a struct template, for example. */
4575 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
4577 /* Definition isn't the kind we were looking for. */
4578 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
4582 return TREE_VALUE (tail
);
4585 if (thislevel_only
&& ! level
->tag_transparent
)
4587 if (level
->pseudo_global
&& allow_pseudo_global
)
4589 /* We must deal with cases like this:
4591 template <class T> struct S;
4592 template <class T> struct S {};
4594 When looking up `S', for the second declaration, we
4595 would like to find the first declaration. But, we
4596 are in the pseudo-global level created for the
4597 template parameters, rather than the (surrounding)
4598 namespace level. Thus, we keep going one more level,
4599 even though THISLEVEL_ONLY is non-zero. */
4600 allow_pseudo_global
= 0;
4606 if (current_class_type
&& level
->level_chain
->namespace_p
)
4608 /* Try looking in this class's tags before heading into
4609 global binding level. */
4610 tree context
= current_class_type
;
4613 switch (TREE_CODE_CLASS (TREE_CODE (context
)))
4617 these_tags
= CLASSTYPE_TAGS (context
);
4618 if (ANON_AGGRNAME_P (name
))
4621 if (TYPE_IDENTIFIER (TREE_VALUE (these_tags
))
4623 return TREE_VALUE (tail
);
4624 these_tags
= TREE_CHAIN (these_tags
);
4629 if (TREE_PURPOSE (these_tags
) == name
)
4631 if (TREE_CODE (TREE_VALUE (these_tags
)) != form
)
4633 cp_error ("`%#D' redeclared as %C in class scope",
4634 TREE_VALUE (tail
), form
);
4637 return TREE_VALUE (tail
);
4639 these_tags
= TREE_CHAIN (these_tags
);
4641 /* If this type is not yet complete, then don't
4642 look at its context. */
4643 if (TYPE_SIZE (context
) == NULL_TREE
)
4645 /* Go to next enclosing type, if any. */
4646 context
= DECL_CONTEXT (TYPE_MAIN_DECL (context
));
4649 context
= DECL_CONTEXT (context
);
4652 my_friendly_abort (10);
4665 set_current_level_tags_transparency (tags_transparent
)
4666 int tags_transparent
;
4668 current_binding_level
->tag_transparent
= tags_transparent
;
4672 /* Given a type, find the tag that was defined for it and return the tag name.
4673 Otherwise return 0. However, the value can never be 0
4674 in the cases in which this is used.
4676 C++: If NAME is non-zero, this is the new name to install. This is
4677 done when replacing anonymous tags with real tag names. */
4680 lookup_tag_reverse (type
, name
)
4684 register struct binding_level
*level
;
4686 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
4689 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4691 if (TREE_VALUE (tail
) == type
)
4694 TREE_PURPOSE (tail
) = name
;
4695 return TREE_PURPOSE (tail
);
4702 /* Lookup TYPE in CONTEXT (a chain of nested types or a FUNCTION_DECL).
4703 Return the type value, or NULL_TREE if not found. */
4706 lookup_nested_type (type
, context
)
4710 if (context
== NULL_TREE
)
4714 switch (TREE_CODE (context
))
4718 tree ctype
= TREE_TYPE (context
);
4719 tree match
= value_member (type
, CLASSTYPE_TAGS (ctype
));
4721 return TREE_VALUE (match
);
4722 context
= DECL_CONTEXT (context
);
4724 /* When we have a nested class whose member functions have
4725 local types (e.g., a set of enums), we'll arrive here
4726 with the DECL_CONTEXT as the actual RECORD_TYPE node for
4727 the enclosing class. Instead, we want to make sure we
4728 come back in here with the TYPE_DECL, not the RECORD_TYPE. */
4729 if (context
&& TREE_CODE (context
) == RECORD_TYPE
)
4730 context
= TREE_CHAIN (context
);
4734 if (TYPE_NAME (type
) && TYPE_IDENTIFIER (type
))
4735 return lookup_name (TYPE_IDENTIFIER (type
), 1);
4738 my_friendly_abort (12);
4744 /* Look up NAME in the NAMESPACE. */
4747 lookup_namespace_name (namespace, name
)
4748 tree
namespace, name
;
4750 struct tree_binding _b
;
4753 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
4755 /* This happens for A::B<int> when B is a namespace. */
4756 if (TREE_CODE (name
) == NAMESPACE_DECL
)
4759 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
4761 val
= binding_init (&_b
);
4762 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
4763 return error_mark_node
;
4765 if (BINDING_VALUE (val
))
4767 val
= BINDING_VALUE (val
);
4769 /* If we have a single function from a using decl, pull it out. */
4770 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
4771 val
= OVL_FUNCTION (val
);
4775 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
4776 return error_mark_node
;
4779 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
4780 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
4781 is non-NULL, this type is being created by the implicit typename
4782 extension, and BASE_TYPE is a type named `t' in some base class of
4783 `T' which depends on template parameters.
4785 Returns the new TYPENAME_TYPE. */
4788 build_typename_type (context
, name
, fullname
, base_type
)
4797 if (processing_template_decl
)
4798 push_obstacks (&permanent_obstack
, &permanent_obstack
);
4800 /* Build the TYPENAME_TYPE. */
4801 t
= make_lang_type (TYPENAME_TYPE
);
4802 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4803 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
4804 TREE_TYPE (t
) = base_type
;
4805 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
4807 /* Build the corresponding TYPE_DECL. */
4808 d
= build_decl (TYPE_DECL
, name
, t
);
4809 TYPE_NAME (TREE_TYPE (d
)) = d
;
4810 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
4811 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
4813 if (processing_template_decl
)
4820 make_typename_type (context
, name
)
4826 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
4827 name
= TYPE_IDENTIFIER (name
);
4828 else if (TREE_CODE (name
) == TYPE_DECL
)
4829 name
= DECL_NAME (name
);
4833 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
4835 name
= TREE_OPERAND (name
, 0);
4836 if (TREE_CODE (name
) == TEMPLATE_DECL
)
4837 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
4839 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
4840 my_friendly_abort (2000);
4842 if (TREE_CODE (context
) == NAMESPACE_DECL
)
4844 /* We can get here from typename_sub0 in the explicit_template_type
4845 expansion. Just fail. */
4846 cp_error ("no class template named `%#T' in `%#T'",
4848 return error_mark_node
;
4851 if (! uses_template_parms (context
)
4852 || currently_open_class (context
))
4854 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
4856 if (IS_AGGR_TYPE (context
))
4857 t
= lookup_field (context
, name
, 0, 0);
4861 if (t
== NULL_TREE
|| TREE_CODE (t
) != TEMPLATE_DECL
4862 || TREE_CODE (DECL_RESULT (t
)) != TYPE_DECL
)
4864 cp_error ("no class template named `%#T' in `%#T'",
4866 return error_mark_node
;
4869 return lookup_template_class (t
, TREE_OPERAND (fullname
, 1),
4871 /*entering_scope=*/0);
4875 if (IS_AGGR_TYPE (context
))
4876 t
= lookup_field (context
, name
, 0, 1);
4882 cp_error ("no type named `%#T' in `%#T'", name
, context
);
4883 return error_mark_node
;
4886 return TREE_TYPE (t
);
4890 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
4893 /* Select the right _DECL from multiple choices. */
4896 select_decl (binding
, flags
)
4901 val
= BINDING_VALUE (binding
);
4902 if (LOOKUP_NAMESPACES_ONLY (flags
))
4904 /* We are not interested in types. */
4905 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
4910 /* If we could have a type and
4911 we have nothing or we need a type and have none. */
4912 if (BINDING_TYPE (binding
)
4913 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
4914 && TREE_CODE (val
) != TYPE_DECL
)))
4915 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
4916 /* Don't return non-types if we really prefer types. */
4917 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
4918 && (!looking_for_template
|| TREE_CODE (val
) != TEMPLATE_DECL
))
4924 /* Unscoped lookup of a global, iterate over namespaces, considering
4925 using namespace statements. */
4928 unqualified_namespace_lookup (name
, flags
)
4932 struct tree_binding _binding
;
4933 tree b
= binding_init (&_binding
);
4934 tree initial
= current_decl_namespace();
4935 tree scope
= initial
;
4937 struct binding_level
*level
;
4938 tree val
= NULL_TREE
;
4942 val
= binding_for_name (name
, scope
);
4944 /* Initialize binding for this context. */
4945 BINDING_VALUE (b
) = BINDING_VALUE (val
);
4946 BINDING_TYPE (b
) = BINDING_TYPE (val
);
4948 /* Add all _DECLs seen through local using-directives. */
4949 for (level
= current_binding_level
;
4950 !level
->namespace_p
;
4951 level
= level
->level_chain
)
4952 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
4954 /* Give up because of error. */
4957 /* Add all _DECLs seen through global using-directives. */
4958 /* XXX local and global using lists should work equally. */
4962 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
4964 /* Give up because of error. */
4966 if (siter
== scope
) break;
4967 siter
= CP_DECL_CONTEXT (siter
);
4970 val
= select_decl (b
, flags
);
4971 if (scope
== global_namespace
)
4973 scope
= CP_DECL_CONTEXT (scope
);
4978 /* Combine prefer_type and namespaces_only into flags. */
4981 lookup_flags (prefer_type
, namespaces_only
)
4982 int prefer_type
, namespaces_only
;
4984 if (namespaces_only
)
4985 return LOOKUP_PREFER_NAMESPACES
;
4986 if (prefer_type
> 1)
4987 return LOOKUP_PREFER_TYPES
;
4988 if (prefer_type
> 0)
4989 return LOOKUP_PREFER_BOTH
;
4993 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
4994 ignore it or not. Subroutine of lookup_name_real. */
4997 qualify_lookup (val
, flags
)
5001 if (val
== NULL_TREE
)
5003 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5005 if ((flags
& LOOKUP_PREFER_TYPES
)
5006 && (TREE_CODE (val
) == TYPE_DECL
5007 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5008 && DECL_CLASS_TEMPLATE_P (val
))))
5010 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5015 /* Look up NAME in the current binding level and its superiors in the
5016 namespace of variables, functions and typedefs. Return a ..._DECL
5017 node of some kind representing its definition if there is only one
5018 such declaration, or return a TREE_LIST with all the overloaded
5019 definitions if there are many, or return 0 if it is undefined.
5021 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5022 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5023 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5024 Otherwise we prefer non-TYPE_DECLs.
5026 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5027 using IDENTIFIER_CLASS_VALUE. */
5030 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5032 int prefer_type
, nonclass
, namespaces_only
;
5036 tree from_obj
= NULL_TREE
;
5037 tree locval
, classval
;
5040 /* Hack: copy flag set by parser, if set. */
5041 if (only_namespace_names
)
5042 namespaces_only
= 1;
5044 if (prefer_type
== -2)
5046 extern int looking_for_typename
;
5047 tree type
= NULL_TREE
;
5050 prefer_type
= looking_for_typename
;
5052 flags
= lookup_flags (prefer_type
, namespaces_only
);
5053 /* During parsing, we need to complain. */
5054 flags
|= LOOKUP_COMPLAIN
;
5055 /* If the next thing is '<', class templates are types. */
5056 if (looking_for_template
)
5057 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5059 /* std:: becomes :: for now. */
5060 if (got_scope
== std_node
)
5061 got_scope
= void_type_node
;
5065 else if (got_object
!= error_mark_node
)
5070 if (type
== error_mark_node
)
5071 return error_mark_node
;
5072 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5073 type
= TREE_TYPE (type
);
5076 type
= complete_type (type
);
5078 if (TREE_CODE (type
) == VOID_TYPE
)
5079 type
= global_namespace
;
5080 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5082 struct tree_binding b
;
5083 val
= binding_init (&b
);
5084 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5086 val
= select_decl (val
, flags
);
5088 else if (! IS_AGGR_TYPE (type
)
5089 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5090 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5091 || TREE_CODE (type
) == TYPENAME_TYPE
)
5092 /* Someone else will give an error about this if needed. */
5094 else if (TYPE_BEING_DEFINED (type
))
5096 val
= IDENTIFIER_CLASS_VALUE (name
);
5097 if (val
&& DECL_CONTEXT (val
) != type
)
5099 struct binding_level
*b
= class_binding_level
;
5100 for (val
= NULL_TREE
; b
; b
= b
->level_chain
)
5102 tree t
= purpose_member (name
, b
->class_shadowed
);
5103 if (t
&& TREE_VALUE (t
)
5104 && DECL_CONTEXT (TREE_VALUE (t
)) == type
)
5106 val
= TREE_VALUE (t
);
5111 if (val
== NULL_TREE
)
5112 val
= lookup_field (type
, name
, 0, 1);
5114 else if (type
== current_class_type
)
5115 val
= IDENTIFIER_CLASS_VALUE (name
);
5117 val
= lookup_member (type
, name
, 0, prefer_type
);
5124 else if (got_object
&& val
)
5128 flags
= lookup_flags (prefer_type
, namespaces_only
);
5130 locval
= classval
= NULL_TREE
;
5132 if (! namespace_bindings_p ())
5133 locval
= qualify_lookup (IDENTIFIER_LOCAL_VALUE (name
), flags
);
5135 /* In C++ class fields are between local and global scope,
5136 just before the global scope. */
5137 if (current_class_type
&& ! nonclass
)
5139 classval
= IDENTIFIER_CLASS_VALUE (name
);
5140 if (classval
== NULL_TREE
&& TYPE_BEING_DEFINED (current_class_type
))
5141 /* Try to find values from base classes if we are presently
5142 defining a type. We are presently only interested in
5144 classval
= lookup_field (current_class_type
, name
, 0, 1);
5146 /* Add implicit 'typename' to types from template bases. lookup_field
5147 will do this for us. If classval is actually from an enclosing
5148 scope, lookup_nested_field will get it for us. */
5149 else if (processing_template_decl
5150 && classval
&& TREE_CODE (classval
) == TYPE_DECL
5151 && ! currently_open_class (DECL_CONTEXT (classval
))
5152 && uses_template_parms (current_class_type
))
5153 classval
= lookup_field (current_class_type
, name
, 0, 1);
5155 /* yylex() calls this with -2, since we should never start digging for
5156 the nested name at the point where we haven't even, for example,
5157 created the COMPONENT_REF or anything like that. */
5158 if (classval
== NULL_TREE
)
5159 classval
= lookup_nested_field (name
, ! yylex
);
5161 classval
= qualify_lookup (classval
, flags
);
5164 if (locval
&& classval
)
5166 if (current_scope () == current_function_decl
5167 && ! hack_decl_function_context (current_function_decl
))
5168 /* Not in a nested function. */
5172 /* This is incredibly horrible. The whole concept of
5173 IDENTIFIER_LOCAL_VALUE / IDENTIFIER_CLASS_VALUE /
5174 IDENTIFIER_GLOBAL_VALUE needs to be scrapped for local
5176 tree lctx
= hack_decl_function_context (locval
);
5177 tree cctx
= hack_decl_function_context (classval
);
5179 if (lctx
== current_scope ())
5181 else if (lctx
== cctx
)
5184 /* I don't know which is right; let's just guess for now. */
5193 val
= unqualified_namespace_lookup (name
, flags
);
5195 /* Any other name takes precedence over an implicit typename. Warn the
5196 user about this potentially confusing lookup. */
5197 if (classval
&& TREE_CODE (val
) == TYPE_DECL
5198 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
5199 && TREE_TYPE (TREE_TYPE (val
)))
5201 if (locval
== NULL_TREE
)
5202 locval
= unqualified_namespace_lookup (name
, flags
);
5204 if (locval
&& val
!= locval
)
5210 /* To avoid redundant warnings, only warn when lexing, and the
5211 decls are significantly different. */
5212 subtype
= TREE_TYPE (TREE_TYPE (classval
));
5214 && ! (TREE_CODE (locval
) == TEMPLATE_DECL
5215 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5216 && CLASSTYPE_TI_TEMPLATE (subtype
) == locval
)
5217 && ! (TREE_CODE (locval
) == TYPE_DECL
5218 && comptypes (TREE_TYPE (locval
), subtype
, 1)))
5220 static int explained
;
5222 cp_warning ("lookup of `%D' finds `%#D'", name
, locval
);
5224 (" instead of `%D' from dependent base class", classval
);
5228 cp_warning (" (use `typename %D' if that's what you meant)",
5238 /* This should only warn about types used in qualified-ids. */
5239 if (from_obj
&& from_obj
!= val
)
5241 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5242 && TREE_CODE (val
) == TYPE_DECL
5243 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5245 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5246 name
, got_object
, TREE_TYPE (from_obj
));
5247 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5251 /* We don't change val to from_obj if got_object depends on
5252 template parms because that breaks implicit typename for
5253 destructor calls. */
5254 if (! uses_template_parms (got_object
))
5258 if ((TREE_CODE (val
) == TEMPLATE_DECL
&& looking_for_template
)
5259 || TREE_CODE (val
) == TYPE_DECL
|| prefer_type
<= 0)
5261 /* Caller wants a class-or-namespace-name. */
5262 else if (prefer_type
== 1 && TREE_CODE (val
) == NAMESPACE_DECL
)
5264 else if (IDENTIFIER_HAS_TYPE_VALUE (name
))
5265 val
= TYPE_MAIN_DECL (IDENTIFIER_TYPE_VALUE (name
));
5266 else if (TREE_TYPE (val
) == error_mark_node
)
5267 val
= error_mark_node
;
5269 /* If we have a single function from a using decl, pull it out. */
5270 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5271 val
= OVL_FUNCTION (val
);
5280 lookup_name_nonclass (name
)
5283 return lookup_name_real (name
, 0, 1, 0);
5287 lookup_function_nonclass (name
, args
)
5291 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5295 lookup_name_namespace_only (name
)
5298 /* type-or-namespace, nonclass, namespace_only */
5299 return lookup_name_real (name
, 1, 1, 1);
5303 lookup_name (name
, prefer_type
)
5307 return lookup_name_real (name
, prefer_type
, 0, 0);
5310 /* Similar to `lookup_name' but look only at current binding level. */
5313 lookup_name_current_level (name
)
5316 register tree t
= NULL_TREE
;
5318 if (current_binding_level
->namespace_p
)
5320 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5322 /* extern "C" function() */
5323 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5326 else if (IDENTIFIER_LOCAL_VALUE (name
) != NULL_TREE
)
5328 struct binding_level
*b
= current_binding_level
;
5331 if (purpose_member (name
, b
->shadowed
))
5332 return IDENTIFIER_LOCAL_VALUE (name
);
5343 /* Like lookup_name_current_level, but for types. */
5346 lookup_type_current_level (name
)
5349 register tree t
= NULL_TREE
;
5351 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5353 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5354 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5356 struct binding_level
*b
= current_binding_level
;
5359 if (purpose_member (name
, b
->type_shadowed
))
5360 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5372 begin_only_namespace_names ()
5374 only_namespace_names
= 1;
5378 end_only_namespace_names ()
5380 only_namespace_names
= 0;
5383 /* Arrange for the user to get a source line number, even when the
5384 compiler is going down in flames, so that she at least has a
5385 chance of working around problems in the compiler. We used to
5386 call error(), but that let the segmentation fault continue
5387 through; now, it's much more passive by asking them to send the
5388 maintainers mail about the problem. */
5392 int sig ATTRIBUTE_UNUSED
;
5394 signal (SIGSEGV
, SIG_DFL
);
5396 signal (SIGIOT
, SIG_DFL
);
5399 signal (SIGILL
, SIG_DFL
);
5402 signal (SIGABRT
, SIG_DFL
);
5405 signal (SIGBUS
, SIG_DFL
);
5407 my_friendly_abort (0);
5411 /* Unused -- brendan 970107 */
5412 /* Array for holding types considered "built-in". These types
5413 are output in the module in which `main' is defined. */
5414 static tree
*builtin_type_tdescs_arr
;
5415 static int builtin_type_tdescs_len
, builtin_type_tdescs_max
;
5418 /* Push the declarations of builtin types into the namespace.
5419 RID_INDEX, if < RID_MAX is the index of the builtin type
5420 in the array RID_POINTERS. NAME is the name used when looking
5421 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5424 record_builtin_type (rid_index
, name
, type
)
5429 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5430 tree tdecl
= NULL_TREE
;
5432 if ((int) rid_index
< (int) RID_MAX
)
5433 rname
= ridpointers
[(int) rid_index
];
5435 tname
= get_identifier (name
);
5437 TYPE_BUILT_IN (type
) = 1;
5441 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5442 set_identifier_type_value (tname
, NULL_TREE
);
5443 if ((int) rid_index
< (int) RID_MAX
)
5444 /* Built-in types live in the global namespace. */
5445 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5447 if (rname
!= NULL_TREE
)
5449 if (tname
!= NULL_TREE
)
5451 set_identifier_type_value (rname
, NULL_TREE
);
5452 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5456 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5457 set_identifier_type_value (rname
, NULL_TREE
);
5462 /* Record one of the standard Java types.
5463 * Declare it as having the given NAME.
5464 * If SIZE > 0, it is the size of one of the integral types;
5465 * otherwise it is the negative of the size of one of the other types. */
5468 record_builtin_java_type (name
, size
)
5474 type
= make_signed_type (size
);
5475 else if (size
> -32)
5476 { /* "__java_char" or ""__java_boolean". */
5477 type
= make_unsigned_type (-size
);
5478 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5481 { /* "__java_float" or ""__java_double". */
5482 type
= make_node (REAL_TYPE
);
5483 TYPE_PRECISION (type
) = - size
;
5486 record_builtin_type (RID_MAX
, name
, type
);
5487 decl
= TYPE_NAME (type
);
5488 DECL_IGNORED_P (decl
) = 1;
5489 TYPE_FOR_JAVA (type
) = 1;
5493 /* Push a type into the namespace so that the back-ends ignore it. */
5496 record_unknown_type (type
, name
)
5500 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5501 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5502 DECL_IGNORED_P (decl
) = 1;
5503 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5504 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5505 TYPE_ALIGN (type
) = 1;
5506 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5509 /* Push overloaded decl, in global scope, with one argument so it
5510 can be used as a callback from define_function. */
5513 push_overloaded_decl_1 (x
)
5516 push_overloaded_decl (x
, 0);
5523 auto_function (name
, type
, code
)
5525 enum built_in_function code
;
5527 return define_function
5528 (IDENTIFIER_POINTER (name
), type
, code
, push_overloaded_decl_1
,
5529 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5533 /* Create the predefined scalar types of C,
5534 and some nodes representing standard constants (0, 1, (void *)0).
5535 Initialize the global binding level.
5536 Make definitions for built-in primitive functions. */
5539 init_decl_processing ()
5541 register tree endlink
, int_endlink
, double_endlink
, unsigned_endlink
;
5543 /* Data type of memcpy. */
5544 tree memcpy_ftype
, strlen_ftype
;
5545 int wchar_type_size
;
5547 tree array_domain_type
;
5548 tree vb_off_identifier
= NULL_TREE
;
5549 /* Function type `char *(char *, char *)' and similar ones */
5550 tree string_ftype_ptr_ptr
, int_ftype_string_string
;
5551 tree sizetype_endlink
;
5552 tree ptr_ftype
, ptr_ftype_unsigned
, ptr_ftype_sizetype
;
5553 tree void_ftype
, void_ftype_int
, void_ftype_ptr
;
5555 /* Have to make these distinct before we try using them. */
5556 lang_name_cplusplus
= get_identifier ("C++");
5557 lang_name_c
= get_identifier ("C");
5558 lang_name_java
= get_identifier ("Java");
5560 /* Enter the global namespace. */
5561 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5562 my_friendly_assert (current_lang_name
== NULL_TREE
, 375);
5563 current_lang_name
= lang_name_cplusplus
;
5564 push_namespace (get_identifier ("::"));
5565 global_namespace
= current_namespace
;
5566 current_lang_name
= NULL_TREE
;
5568 if (flag_strict_prototype
== 2)
5569 flag_strict_prototype
= pedantic
;
5571 strict_prototypes_lang_c
= flag_strict_prototype
;
5574 current_lang_name
= lang_name_c
;
5576 current_function_decl
= NULL_TREE
;
5577 named_labels
= NULL_TREE
;
5578 named_label_uses
= NULL
;
5579 current_binding_level
= NULL_BINDING_LEVEL
;
5580 free_binding_level
= NULL_BINDING_LEVEL
;
5582 #ifndef __CYGWIN32__
5583 /* Because most segmentation signals can be traced back into user
5584 code, catch them and at least give the user a chance of working
5585 around compiler bugs. */
5586 signal (SIGSEGV
, signal_catch
);
5588 /* We will also catch aborts in the back-end through signal_catch and
5589 give the user a chance to see where the error might be, and to defeat
5590 aborts in the back-end when there have been errors previously in their
5593 signal (SIGIOT
, signal_catch
);
5596 signal (SIGILL
, signal_catch
);
5599 signal (SIGABRT
, signal_catch
);
5602 signal (SIGBUS
, signal_catch
);
5604 #else /* ndef __CYGWIN32__ */
5605 /* Cygwin32 cannot handle catching signals other than
5606 SIGABRT yet. We hope this will cease to be the case soon. */
5608 signal (SIGABRT
, signal_catch
);
5610 #endif /* ndef __CYGWIN32__ */
5612 gcc_obstack_init (&decl_obstack
);
5614 /* Must lay these out before anything else gets laid out. */
5615 error_mark_node
= make_node (ERROR_MARK
);
5616 TREE_PERMANENT (error_mark_node
) = 1;
5617 TREE_TYPE (error_mark_node
) = error_mark_node
;
5618 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
5619 TREE_TYPE (error_mark_list
) = error_mark_node
;
5621 /* Make the binding_level structure for global names. */
5623 global_binding_level
= current_binding_level
;
5624 /* The global level is the namespace level of ::. */
5625 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
5626 declare_namespace_level ();
5628 this_identifier
= get_identifier (THIS_NAME
);
5629 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
5630 ctor_identifier
= get_identifier (CTOR_NAME
);
5631 dtor_identifier
= get_identifier (DTOR_NAME
);
5632 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
5633 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
5634 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
5635 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
5636 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
5637 if (flag_handle_signatures
)
5639 tag_identifier
= get_identifier (SIGTABLE_TAG_NAME
);
5640 vb_off_identifier
= get_identifier (SIGTABLE_VB_OFF_NAME
);
5641 vt_off_identifier
= get_identifier (SIGTABLE_VT_OFF_NAME
);
5644 /* Define `int' and `char' first so that dbx will output them first. */
5646 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5647 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
5649 /* Define `char', which is like either `signed char' or `unsigned char'
5650 but not the same as either. */
5654 ? make_signed_type (CHAR_TYPE_SIZE
)
5655 : make_unsigned_type (CHAR_TYPE_SIZE
));
5656 record_builtin_type (RID_CHAR
, "char", char_type_node
);
5658 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5659 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
5661 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5662 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
5664 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5665 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
5666 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
5668 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5669 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
5671 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5672 record_builtin_type (RID_MAX
, "long long unsigned int",
5673 long_long_unsigned_type_node
);
5674 record_builtin_type (RID_MAX
, "long long unsigned",
5675 long_long_unsigned_type_node
);
5677 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5678 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
5679 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5680 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
5681 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
5683 /* `unsigned long' is the standard type for sizeof.
5684 Note that stddef.h uses `unsigned long',
5685 and this must agree, even if long and int are the same size. */
5687 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
5690 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
5692 /* Define both `signed char' and `unsigned char'. */
5693 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5694 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
5695 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5696 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
5698 /* These are types that type_for_size and type_for_mode use. */
5699 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
5700 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
5701 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
5702 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
5703 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
5704 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
5705 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
5706 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
5707 #if HOST_BITS_PER_WIDE_INT >= 64
5708 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
5709 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intTI_type_node
));
5711 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
5712 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
5713 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
5714 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
5715 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
5716 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
5717 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
5718 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
5719 #if HOST_BITS_PER_WIDE_INT >= 64
5720 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
5721 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intTI_type_node
));
5724 float_type_node
= make_node (REAL_TYPE
);
5725 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5726 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
5727 layout_type (float_type_node
);
5729 double_type_node
= make_node (REAL_TYPE
);
5730 if (flag_short_double
)
5731 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5733 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5734 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
5735 layout_type (double_type_node
);
5737 long_double_type_node
= make_node (REAL_TYPE
);
5738 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5739 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
5740 layout_type (long_double_type_node
);
5742 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5743 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
5744 complex_integer_type_node
));
5745 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5746 layout_type (complex_integer_type_node
);
5748 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5749 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
5750 complex_float_type_node
));
5751 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5752 layout_type (complex_float_type_node
);
5754 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5755 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
5756 complex_double_type_node
));
5757 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5758 layout_type (complex_double_type_node
);
5760 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5761 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
5762 complex_long_double_type_node
));
5763 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5764 layout_type (complex_long_double_type_node
);
5766 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
5767 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
5768 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
5769 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
5770 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
5771 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
5772 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
5773 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
5775 integer_zero_node
= build_int_2 (0, 0);
5776 TREE_TYPE (integer_zero_node
) = integer_type_node
;
5777 integer_one_node
= build_int_2 (1, 0);
5778 TREE_TYPE (integer_one_node
) = integer_type_node
;
5779 integer_two_node
= build_int_2 (2, 0);
5780 TREE_TYPE (integer_two_node
) = integer_type_node
;
5781 integer_three_node
= build_int_2 (3, 0);
5782 TREE_TYPE (integer_three_node
) = integer_type_node
;
5784 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5785 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5786 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
5787 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
5788 TYPE_PRECISION (boolean_type_node
) = 1;
5789 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
5790 boolean_false_node
= build_int_2 (0, 0);
5791 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
5792 boolean_true_node
= build_int_2 (1, 0);
5793 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
5795 /* These are needed by stor-layout.c. */
5796 size_zero_node
= size_int (0);
5797 size_one_node
= size_int (1);
5799 signed_size_zero_node
= build_int_2 (0, 0);
5800 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
5802 void_type_node
= make_node (VOID_TYPE
);
5803 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
5804 layout_type (void_type_node
); /* Uses integer_zero_node. */
5805 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
5806 TREE_PARMLIST (void_list_node
) = 1;
5808 null_pointer_node
= build_int_2 (0, 0);
5809 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
5810 layout_type (TREE_TYPE (null_pointer_node
));
5812 /* Used for expressions that do nothing, but are not errors. */
5813 void_zero_node
= build_int_2 (0, 0);
5814 TREE_TYPE (void_zero_node
) = void_type_node
;
5816 string_type_node
= build_pointer_type (char_type_node
);
5817 const_string_type_node
5818 = build_pointer_type (build_type_variant (char_type_node
, 1, 0));
5820 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
5823 /* Make a type to be the domain of a few array types
5824 whose domains don't really matter.
5825 200 is small enough that it always fits in size_t
5826 and large enough that it can hold most function names for the
5827 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5828 array_domain_type
= build_index_type (build_int_2 (200, 0));
5830 /* Make a type for arrays of characters.
5831 With luck nothing will ever really depend on the length of this
5833 char_array_type_node
5834 = build_array_type (char_type_node
, array_domain_type
);
5835 /* Likewise for arrays of ints. */
5837 = build_array_type (integer_type_node
, array_domain_type
);
5839 /* This is just some anonymous class type. Nobody should ever
5840 need to look inside this envelope. */
5841 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
5843 default_function_type
5844 = build_function_type (integer_type_node
, NULL_TREE
);
5846 ptr_type_node
= build_pointer_type (void_type_node
);
5848 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5850 record_builtin_type (RID_MAX
, NULL_PTR
, ptr_type_node
);
5852 endlink
= void_list_node
;
5853 int_endlink
= tree_cons (NULL_TREE
, integer_type_node
, endlink
);
5854 double_endlink
= tree_cons (NULL_TREE
, double_type_node
, endlink
);
5855 unsigned_endlink
= tree_cons (NULL_TREE
, unsigned_type_node
, endlink
);
5857 ptr_ftype
= build_function_type (ptr_type_node
, NULL_TREE
);
5858 ptr_ftype_unsigned
= build_function_type (ptr_type_node
, unsigned_endlink
);
5859 sizetype_endlink
= tree_cons (NULL_TREE
, sizetype
, endlink
);
5860 /* We realloc here because sizetype could be int or unsigned. S'ok. */
5861 ptr_ftype_sizetype
= build_function_type (ptr_type_node
, sizetype_endlink
);
5863 void_ftype
= build_function_type (void_type_node
, endlink
);
5864 void_ftype_int
= build_function_type (void_type_node
, int_endlink
);
5866 = build_function_type (void_type_node
,
5867 tree_cons (NULL_TREE
, ptr_type_node
, endlink
));
5869 = build_exception_variant (void_ftype_ptr
,
5870 tree_cons (NULL_TREE
, NULL_TREE
, NULL_TREE
));
5873 = build_function_type (float_type_node
,
5874 tree_cons (NULL_TREE
, float_type_node
, endlink
));
5877 = build_function_type (double_type_node
, double_endlink
);
5879 ldouble_ftype_ldouble
5880 = build_function_type (long_double_type_node
,
5881 tree_cons (NULL_TREE
, long_double_type_node
,
5884 double_ftype_double_double
5885 = build_function_type (double_type_node
,
5886 tree_cons (NULL_TREE
, double_type_node
,
5890 = build_function_type (integer_type_node
, int_endlink
);
5893 = build_function_type (long_integer_type_node
,
5894 tree_cons (NULL_TREE
, long_integer_type_node
,
5897 int_ftype_cptr_cptr_sizet
5898 = build_function_type (integer_type_node
,
5899 tree_cons (NULL_TREE
, const_ptr_type_node
,
5900 tree_cons (NULL_TREE
, const_ptr_type_node
,
5901 tree_cons (NULL_TREE
,
5905 string_ftype_ptr_ptr
/* strcpy prototype */
5906 = build_function_type (string_type_node
,
5907 tree_cons (NULL_TREE
, string_type_node
,
5908 tree_cons (NULL_TREE
,
5909 const_string_type_node
,
5912 int_ftype_string_string
/* strcmp prototype */
5913 = build_function_type (integer_type_node
,
5914 tree_cons (NULL_TREE
, const_string_type_node
,
5915 tree_cons (NULL_TREE
,
5916 const_string_type_node
,
5919 strlen_ftype
/* strlen prototype */
5920 = build_function_type (sizetype
,
5921 tree_cons (NULL_TREE
, const_string_type_node
,
5924 memcpy_ftype
/* memcpy prototype */
5925 = build_function_type (ptr_type_node
,
5926 tree_cons (NULL_TREE
, ptr_type_node
,
5927 tree_cons (NULL_TREE
, const_ptr_type_node
,
5928 sizetype_endlink
)));
5930 if (flag_huge_objects
)
5931 delta_type_node
= long_integer_type_node
;
5933 delta_type_node
= short_integer_type_node
;
5935 builtin_function ("__builtin_constant_p", default_function_type
,
5936 BUILT_IN_CONSTANT_P
, NULL_PTR
);
5938 builtin_return_address_fndecl
5939 = builtin_function ("__builtin_return_address", ptr_ftype_unsigned
,
5940 BUILT_IN_RETURN_ADDRESS
, NULL_PTR
);
5942 builtin_function ("__builtin_frame_address", ptr_ftype_unsigned
,
5943 BUILT_IN_FRAME_ADDRESS
, NULL_PTR
);
5945 builtin_function ("__builtin_alloca", ptr_ftype_sizetype
,
5946 BUILT_IN_ALLOCA
, "alloca");
5947 builtin_function ("__builtin_ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
5948 /* Define alloca, ffs as builtins.
5949 Declare _exit just to mark it as volatile. */
5950 if (! flag_no_builtin
&& !flag_no_nonansi_builtin
)
5952 temp
= builtin_function ("alloca", ptr_ftype_sizetype
,
5953 BUILT_IN_ALLOCA
, NULL_PTR
);
5954 /* Suppress error if redefined as a non-function. */
5955 DECL_BUILT_IN_NONANSI (temp
) = 1;
5956 temp
= builtin_function ("ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
5957 /* Suppress error if redefined as a non-function. */
5958 DECL_BUILT_IN_NONANSI (temp
) = 1;
5959 temp
= builtin_function ("_exit", void_ftype_int
,
5960 NOT_BUILT_IN
, NULL_PTR
);
5961 TREE_THIS_VOLATILE (temp
) = 1;
5962 TREE_SIDE_EFFECTS (temp
) = 1;
5963 /* Suppress error if redefined as a non-function. */
5964 DECL_BUILT_IN_NONANSI (temp
) = 1;
5967 builtin_function ("__builtin_abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
5968 builtin_function ("__builtin_fabsf", float_ftype_float
, BUILT_IN_FABS
,
5970 builtin_function ("__builtin_fabs", double_ftype_double
, BUILT_IN_FABS
,
5972 builtin_function ("__builtin_fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
5974 builtin_function ("__builtin_labs", long_ftype_long
,
5975 BUILT_IN_LABS
, NULL_PTR
);
5976 builtin_function ("__builtin_saveregs", ptr_ftype
,
5977 BUILT_IN_SAVEREGS
, NULL_PTR
);
5978 builtin_function ("__builtin_classify_type", default_function_type
,
5979 BUILT_IN_CLASSIFY_TYPE
, NULL_PTR
);
5980 builtin_function ("__builtin_next_arg", ptr_ftype
,
5981 BUILT_IN_NEXT_ARG
, NULL_PTR
);
5982 builtin_function ("__builtin_args_info", int_ftype_int
,
5983 BUILT_IN_ARGS_INFO
, NULL_PTR
);
5984 builtin_function ("__builtin_setjmp",
5985 build_function_type (integer_type_node
,
5986 tree_cons (NULL_TREE
, ptr_type_node
,
5988 BUILT_IN_SETJMP
, NULL_PTR
);
5989 builtin_function ("__builtin_longjmp",
5990 build_function_type (integer_type_node
,
5991 tree_cons (NULL_TREE
, ptr_type_node
,
5992 tree_cons (NULL_TREE
,
5995 BUILT_IN_LONGJMP
, NULL_PTR
);
5997 /* Untyped call and return. */
5998 builtin_function ("__builtin_apply_args", ptr_ftype
,
5999 BUILT_IN_APPLY_ARGS
, NULL_PTR
);
6001 temp
= tree_cons (NULL_TREE
,
6002 build_pointer_type (build_function_type (void_type_node
,
6004 tree_cons (NULL_TREE
, ptr_ftype_sizetype
, NULL_TREE
));
6005 builtin_function ("__builtin_apply",
6006 build_function_type (ptr_type_node
, temp
),
6007 BUILT_IN_APPLY
, NULL_PTR
);
6008 builtin_function ("__builtin_return", void_ftype_ptr
,
6009 BUILT_IN_RETURN
, NULL_PTR
);
6011 /* Currently under experimentation. */
6012 builtin_function ("__builtin_memcpy", memcpy_ftype
,
6013 BUILT_IN_MEMCPY
, "memcpy");
6014 builtin_function ("__builtin_memcmp", int_ftype_cptr_cptr_sizet
,
6015 BUILT_IN_MEMCMP
, "memcmp");
6016 builtin_function ("__builtin_strcmp", int_ftype_string_string
,
6017 BUILT_IN_STRCMP
, "strcmp");
6018 builtin_function ("__builtin_strcpy", string_ftype_ptr_ptr
,
6019 BUILT_IN_STRCPY
, "strcpy");
6020 builtin_function ("__builtin_strlen", strlen_ftype
,
6021 BUILT_IN_STRLEN
, "strlen");
6022 builtin_function ("__builtin_sqrtf", float_ftype_float
,
6023 BUILT_IN_FSQRT
, "sqrtf");
6024 builtin_function ("__builtin_fsqrt", double_ftype_double
,
6025 BUILT_IN_FSQRT
, NULL_PTR
);
6026 builtin_function ("__builtin_sqrtl", ldouble_ftype_ldouble
,
6027 BUILT_IN_FSQRT
, "sqrtl");
6028 builtin_function ("__builtin_sinf", float_ftype_float
,
6029 BUILT_IN_SIN
, "sinf");
6030 builtin_function ("__builtin_sin", double_ftype_double
,
6031 BUILT_IN_SIN
, "sin");
6032 builtin_function ("__builtin_sinl", ldouble_ftype_ldouble
,
6033 BUILT_IN_SIN
, "sinl");
6034 builtin_function ("__builtin_cosf", float_ftype_float
,
6035 BUILT_IN_COS
, "cosf");
6036 builtin_function ("__builtin_cos", double_ftype_double
,
6037 BUILT_IN_COS
, "cos");
6038 builtin_function ("__builtin_cosl", ldouble_ftype_ldouble
,
6039 BUILT_IN_COS
, "cosl");
6041 if (!flag_no_builtin
)
6043 builtin_function ("abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
6044 builtin_function ("fabs", double_ftype_double
, BUILT_IN_FABS
, NULL_PTR
);
6045 builtin_function ("labs", long_ftype_long
, BUILT_IN_LABS
, NULL_PTR
);
6046 builtin_function ("fabsf", float_ftype_float
, BUILT_IN_FABS
, NULL_PTR
);
6047 builtin_function ("fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
6049 builtin_function ("memcpy", memcpy_ftype
, BUILT_IN_MEMCPY
, NULL_PTR
);
6050 builtin_function ("memcmp", int_ftype_cptr_cptr_sizet
, BUILT_IN_MEMCMP
,
6052 builtin_function ("strcmp", int_ftype_string_string
, BUILT_IN_STRCMP
,
6054 builtin_function ("strcpy", string_ftype_ptr_ptr
, BUILT_IN_STRCPY
,
6056 builtin_function ("strlen", strlen_ftype
, BUILT_IN_STRLEN
, NULL_PTR
);
6057 builtin_function ("sqrtf", float_ftype_float
, BUILT_IN_FSQRT
, NULL_PTR
);
6058 builtin_function ("sqrt", double_ftype_double
, BUILT_IN_FSQRT
, NULL_PTR
);
6059 builtin_function ("sqrtl", ldouble_ftype_ldouble
, BUILT_IN_FSQRT
,
6061 builtin_function ("sinf", float_ftype_float
, BUILT_IN_SIN
, NULL_PTR
);
6062 builtin_function ("sin", double_ftype_double
, BUILT_IN_SIN
, NULL_PTR
);
6063 builtin_function ("sinl", ldouble_ftype_ldouble
, BUILT_IN_SIN
, NULL_PTR
);
6064 builtin_function ("cosf", float_ftype_float
, BUILT_IN_COS
, NULL_PTR
);
6065 builtin_function ("cos", double_ftype_double
, BUILT_IN_COS
, NULL_PTR
);
6066 builtin_function ("cosl", ldouble_ftype_ldouble
, BUILT_IN_COS
, NULL_PTR
);
6068 /* Declare these functions volatile
6069 to avoid spurious "control drops through" warnings. */
6070 temp
= builtin_function ("abort", void_ftype
,
6071 NOT_BUILT_IN
, NULL_PTR
);
6072 TREE_THIS_VOLATILE (temp
) = 1;
6073 TREE_SIDE_EFFECTS (temp
) = 1;
6074 /* Well, these are actually ANSI, but we can't set DECL_BUILT_IN on
6076 DECL_BUILT_IN_NONANSI (temp
) = 1;
6077 temp
= builtin_function ("exit", void_ftype_int
,
6078 NOT_BUILT_IN
, NULL_PTR
);
6079 TREE_THIS_VOLATILE (temp
) = 1;
6080 TREE_SIDE_EFFECTS (temp
) = 1;
6081 DECL_BUILT_IN_NONANSI (temp
) = 1;
6085 /* Support for these has not been written in either expand_builtin
6086 or build_function_call. */
6087 builtin_function ("__builtin_div", default_ftype
, BUILT_IN_DIV
, NULL_PTR
);
6088 builtin_function ("__builtin_ldiv", default_ftype
, BUILT_IN_LDIV
, NULL_PTR
);
6089 builtin_function ("__builtin_ffloor", double_ftype_double
, BUILT_IN_FFLOOR
,
6091 builtin_function ("__builtin_fceil", double_ftype_double
, BUILT_IN_FCEIL
,
6093 builtin_function ("__builtin_fmod", double_ftype_double_double
,
6094 BUILT_IN_FMOD
, NULL_PTR
);
6095 builtin_function ("__builtin_frem", double_ftype_double_double
,
6096 BUILT_IN_FREM
, NULL_PTR
);
6097 builtin_function ("__builtin_memset", ptr_ftype_ptr_int_int
,
6098 BUILT_IN_MEMSET
, NULL_PTR
);
6099 builtin_function ("__builtin_getexp", double_ftype_double
, BUILT_IN_GETEXP
,
6101 builtin_function ("__builtin_getman", double_ftype_double
, BUILT_IN_GETMAN
,
6105 /* C++ extensions */
6107 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6108 record_unknown_type (unknown_type_node
, "unknown type");
6110 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6111 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6113 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6115 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6117 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6118 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6120 /* This is for handling opaque types in signatures. */
6121 opaque_type_node
= copy_node (ptr_type_node
);
6122 TYPE_MAIN_VARIANT (opaque_type_node
) = opaque_type_node
;
6123 record_builtin_type (RID_MAX
, 0, opaque_type_node
);
6125 /* This is special for C++ so functions can be overloaded. */
6127 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6128 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6129 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6130 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6132 = TREE_UNSIGNED (wchar_type_node
)
6133 ? unsigned_wchar_type_node
6134 : signed_wchar_type_node
;
6135 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6137 /* Artificial declaration of wchar_t -- can be bashed */
6138 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6140 pushdecl (wchar_decl_node
);
6142 /* This is for wide string constants. */
6143 wchar_array_type_node
6144 = build_array_type (wchar_type_node
, array_domain_type
);
6146 if (flag_vtable_thunks
)
6148 /* Make sure we get a unique function type, so we can give
6149 its pointer type a name. (This wins for gdb.) */
6150 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6151 TREE_TYPE (vfunc_type
) = integer_type_node
;
6152 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6153 layout_type (vfunc_type
);
6155 vtable_entry_type
= build_pointer_type (vfunc_type
);
6159 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6160 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
6162 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
6164 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
6166 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6169 /* Make this part of an invisible union. */
6170 fields
[3] = copy_node (fields
[2]);
6171 TREE_TYPE (fields
[3]) = delta_type_node
;
6172 DECL_NAME (fields
[3]) = delta2_identifier
;
6173 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6174 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6175 TREE_UNSIGNED (fields
[3]) = 0;
6176 TREE_CHAIN (fields
[2]) = fields
[3];
6177 vtable_entry_type
= build_type_variant (vtable_entry_type
, 1, 0);
6179 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6182 = build_array_type (vtable_entry_type
, NULL_TREE
);
6183 layout_type (vtbl_type_node
);
6184 vtbl_type_node
= cp_build_type_variant (vtbl_type_node
, 1, 0);
6185 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6186 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6187 layout_type (vtbl_ptr_type_node
);
6188 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6190 /* Simplify life by making a "sigtable_entry_type". Give its
6191 fields names so that the debugger can use them. */
6193 if (flag_handle_signatures
)
6195 sigtable_entry_type
= make_lang_type (RECORD_TYPE
);
6196 fields
[0] = build_lang_field_decl (FIELD_DECL
, tag_identifier
,
6198 fields
[1] = build_lang_field_decl (FIELD_DECL
, vb_off_identifier
,
6200 fields
[2] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
6202 fields
[3] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
6204 fields
[4] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
6207 /* Set the alignment to the max of the alignment of ptr_type_node and
6208 delta_type_node. Double alignment wastes a word on the Sparc. */
6209 finish_builtin_type (sigtable_entry_type
, SIGTABLE_PTR_TYPE
, fields
, 4,
6210 (TYPE_ALIGN (ptr_type_node
) > TYPE_ALIGN (delta_type_node
))
6214 /* Make this part of an invisible union. */
6215 fields
[5] = copy_node (fields
[4]);
6216 TREE_TYPE (fields
[5]) = delta_type_node
;
6217 DECL_NAME (fields
[5]) = vt_off_identifier
;
6218 DECL_MODE (fields
[5]) = TYPE_MODE (delta_type_node
);
6219 DECL_SIZE (fields
[5]) = TYPE_SIZE (delta_type_node
);
6220 TREE_UNSIGNED (fields
[5]) = 0;
6221 TREE_CHAIN (fields
[4]) = fields
[5];
6223 sigtable_entry_type
= build_type_variant (sigtable_entry_type
, 1, 0);
6224 record_builtin_type (RID_MAX
, SIGTABLE_PTR_TYPE
, sigtable_entry_type
);
6227 std_node
= build_decl (NAMESPACE_DECL
,
6228 get_identifier (flag_honor_std
? "fake std":"std"),
6230 pushdecl (std_node
);
6232 global_type_node
= make_node (LANG_TYPE
);
6233 record_unknown_type (global_type_node
, "global type");
6236 current_lang_name
= lang_name_cplusplus
;
6239 tree bad_alloc_type_node
, newtype
, deltype
;
6241 push_namespace (get_identifier ("std"));
6242 bad_alloc_type_node
= xref_tag
6243 (class_type_node
, get_identifier ("bad_alloc"), 1);
6246 newtype
= build_exception_variant
6247 (ptr_ftype_sizetype
, build_tree_list (NULL_TREE
, bad_alloc_type_node
));
6248 deltype
= build_exception_variant
6249 (void_ftype_ptr
, build_tree_list (NULL_TREE
, NULL_TREE
));
6250 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6251 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6252 auto_function (ansi_opname
[(int) DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6253 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6257 = define_function ("__pure_virtual", void_ftype
,
6258 NOT_BUILT_IN
, 0, 0);
6260 /* Perform other language dependent initializations. */
6261 init_class_processing ();
6262 init_init_processing ();
6263 init_search_processing ();
6265 init_rtti_processing ();
6267 if (flag_exceptions
)
6268 init_exception_processing ();
6271 flag_inline_functions
= 0;
6274 if (! supports_one_only ())
6277 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6278 declare_function_name ();
6280 /* Prepare to check format strings against argument lists. */
6281 init_function_format_info ();
6283 /* Show we use EH for cleanups. */
6284 using_eh_for_cleanups ();
6286 print_error_function
= lang_print_error_function
;
6287 lang_get_alias_set
= &c_get_alias_set
;
6289 /* Maintain consistency. Perhaps we should just complain if they
6290 say -fwritable-strings? */
6291 if (flag_writable_strings
)
6292 flag_const_strings
= 0;
6295 /* Function to print any language-specific context for an error message. */
6298 lang_print_error_function (file
)
6301 default_print_error_function (file
);
6302 maybe_print_template_context ();
6305 /* Make a definition for a builtin function named NAME and whose data type
6306 is TYPE. TYPE should be a function type with argument types.
6307 FUNCTION_CODE tells later passes how to compile calls to this function.
6308 See tree.h for its possible values.
6310 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6311 the name to be called if we can't opencode the function. */
6314 define_function (name
, type
, function_code
, pfn
, library_name
)
6317 enum built_in_function function_code
;
6318 void (*pfn
) PROTO((tree
));
6321 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6322 DECL_EXTERNAL (decl
) = 1;
6323 TREE_PUBLIC (decl
) = 1;
6324 DECL_ARTIFICIAL (decl
) = 1;
6326 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6327 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6329 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6330 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6331 function in the namespace. */
6332 if (pfn
) (*pfn
) (decl
);
6334 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6335 make_function_rtl (decl
);
6336 if (function_code
!= NOT_BUILT_IN
)
6338 DECL_BUILT_IN (decl
) = 1;
6339 DECL_FUNCTION_CODE (decl
) = function_code
;
6344 /* When we call finish_struct for an anonymous union, we create
6345 default copy constructors and such. But, an anonymous union
6346 shouldn't have such things; this function undoes the damage to the
6347 anonymous union type T.
6349 (The reason that we create the synthesized methods is that we don't
6350 distinguish `union { int i; }' from `typedef union { int i; } U'.
6351 The first is an anonymous union; the second is just an ordinary
6355 fixup_anonymous_union (t
)
6360 /* Wipe out memory of synthesized methods */
6361 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6362 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6363 TYPE_HAS_INIT_REF (t
) = 0;
6364 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6365 TYPE_HAS_ASSIGN_REF (t
) = 0;
6366 TYPE_HAS_ASSIGNMENT (t
) = 0;
6367 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6369 /* Splice the implicitly generated functions out of the TYPE_METHODS
6371 q
= &TYPE_METHODS (t
);
6374 if (DECL_ARTIFICIAL (*q
))
6375 *q
= TREE_CHAIN (*q
);
6377 q
= &TREE_CHAIN (*q
);
6380 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6381 function members. */
6382 if (TYPE_METHODS (t
))
6383 error ("an anonymous union cannot have function members");
6386 /* Called when a declaration is seen that contains no names to declare.
6387 If its type is a reference to a structure, union or enum inherited
6388 from a containing scope, shadow that tag name for the current scope
6389 with a forward reference.
6390 If its type defines a new named structure or union
6391 or defines an enum, it is valid but we need not do anything here.
6392 Otherwise, it is an error.
6394 C++: may have to grok the declspecs to learn about static,
6395 complain for anonymous unions. */
6398 shadow_tag (declspecs
)
6402 tree ob_modifier
= NULL_TREE
;
6404 register enum tree_code code
, ok_code
= ERROR_MARK
;
6405 register tree t
= NULL_TREE
;
6407 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6409 register tree value
= TREE_VALUE (link
);
6411 code
= TREE_CODE (value
);
6412 if (IS_AGGR_TYPE_CODE (code
) || code
== ENUMERAL_TYPE
)
6414 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6416 maybe_process_partial_specialization (value
);
6422 else if (value
== ridpointers
[(int) RID_STATIC
]
6423 || value
== ridpointers
[(int) RID_EXTERN
]
6424 || value
== ridpointers
[(int) RID_AUTO
]
6425 || value
== ridpointers
[(int) RID_REGISTER
]
6426 || value
== ridpointers
[(int) RID_INLINE
]
6427 || value
== ridpointers
[(int) RID_VIRTUAL
]
6428 || value
== ridpointers
[(int) RID_EXPLICIT
])
6429 ob_modifier
= value
;
6432 /* This is where the variables in an anonymous union are
6433 declared. An anonymous union declaration looks like:
6435 because there is no declarator after the union, the parser
6436 sends that declaration here. */
6437 if (ok_code
== UNION_TYPE
6439 && ((TREE_CODE (TYPE_NAME (t
)) == IDENTIFIER_NODE
6440 && ANON_AGGRNAME_P (TYPE_NAME (t
)))
6441 || (TREE_CODE (TYPE_NAME (t
)) == TYPE_DECL
6442 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))))
6444 fixup_anonymous_union (t
);
6446 if (TYPE_FIELDS (t
))
6448 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6450 finish_anon_union (decl
);
6455 /* Anonymous unions are objects, that's why we only check for
6456 inappropriate specifiers in this branch. */
6460 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6461 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6462 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6463 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6464 cp_error ("`%D' can only be specified for constructors",
6467 cp_error ("`%D' can only be specified for objects and functions",
6472 cp_error ("abstract declarator used as declaration");
6473 else if (found_tag
> 1)
6474 pedwarn ("multiple types in one declaration");
6478 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6481 groktypename (typename
)
6484 if (TREE_CODE (typename
) != TREE_LIST
)
6486 return grokdeclarator (TREE_VALUE (typename
),
6487 TREE_PURPOSE (typename
),
6488 TYPENAME
, 0, NULL_TREE
);
6491 /* Decode a declarator in an ordinary declaration or data definition.
6492 This is called as soon as the type information and variable name
6493 have been parsed, before parsing the initializer if any.
6494 Here we create the ..._DECL node, fill in its type,
6495 and put it on the list of decls for the current context.
6496 The ..._DECL node is returned as the value.
6498 Exception: for arrays where the length is not specified,
6499 the type is left null, to be filled in by `cp_finish_decl'.
6501 Function definitions do not come here; they go to start_function
6502 instead. However, external and forward declarations of functions
6503 do go through here. Structure field declarations are done by
6504 grokfield and not through here. */
6506 /* Set this to zero to debug not using the temporary obstack
6507 to parse initializers. */
6508 int debug_temp_inits
= 1;
6511 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6512 tree declarator
, declspecs
;
6514 tree attributes
, prefix_attributes
;
6517 register tree type
, tem
;
6519 extern int have_extern_spec
;
6520 extern int used_extern_spec
;
6523 /* See code below that used this. */
6524 int init_written
= initialized
;
6527 /* This should only be done once on the top most decl. */
6528 if (have_extern_spec
&& !used_extern_spec
)
6530 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6532 used_extern_spec
= 1;
6535 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6537 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6540 type
= TREE_TYPE (decl
);
6542 /* Don't lose if destructors must be executed at file-level. */
6543 if (! processing_template_decl
&& TREE_STATIC (decl
)
6544 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
6545 && !TREE_PERMANENT (decl
))
6547 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6548 decl
= copy_node (decl
);
6549 if (TREE_CODE (type
) == ARRAY_TYPE
)
6551 tree itype
= TYPE_DOMAIN (type
);
6552 if (itype
&& ! TREE_PERMANENT (itype
))
6554 itype
= build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype
)));
6555 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
6556 TREE_TYPE (decl
) = type
;
6563 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6564 ? DECL_CLASS_CONTEXT (decl
)
6565 : DECL_CONTEXT (decl
);
6567 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6568 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6570 /* When parsing the initializer, lookup should use the object's
6572 push_decl_namespace (context
);
6575 /* We are only interested in class contexts, later. */
6576 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6577 context
= NULL_TREE
;
6580 /* Is it valid for this decl to have an initializer at all?
6581 If not, set INITIALIZED to zero, which will indirectly
6582 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6583 switch (TREE_CODE (decl
))
6586 /* typedef foo = bar means give foo the same type as bar.
6587 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6588 Any other case of an initialization in a TYPE_DECL is an error. */
6589 if (pedantic
|| list_length (declspecs
) > 1)
6591 cp_error ("typedef `%D' is initialized", decl
);
6597 cp_error ("function `%#D' is initialized like a variable", decl
);
6602 if (! processing_template_decl
)
6604 if (type
!= error_mark_node
)
6606 if (TYPE_SIZE (type
) != NULL_TREE
6607 && ! TREE_CONSTANT (TYPE_SIZE (type
)))
6610 ("variable-sized object `%D' may not be initialized",
6615 if (TREE_CODE (type
) == ARRAY_TYPE
6616 && TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6619 ("elements of array `%#D' have incomplete type", decl
);
6628 if (! toplevel_bindings_p ()
6629 && DECL_EXTERNAL (decl
))
6630 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6632 DECL_EXTERNAL (decl
) = 0;
6633 if (toplevel_bindings_p ())
6634 TREE_STATIC (decl
) = 1;
6636 /* Tell `pushdecl' this is an initialized decl
6637 even though we don't yet have the initializer expression.
6638 Also tell `cp_finish_decl' it may store the real initializer. */
6639 DECL_INITIAL (decl
) = error_mark_node
;
6642 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6644 if (TREE_CODE (decl
) == VAR_DECL
)
6646 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6647 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6648 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6651 if (DECL_CONTEXT (field
) != context
)
6653 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6654 DECL_CONTEXT (field
), DECL_NAME (decl
),
6655 context
, DECL_NAME (decl
));
6656 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6658 /* Static data member are tricky; an in-class initialization
6659 still doesn't provide a definition, so the in-class
6660 declaration will have DECL_EXTERNAL set, but will have an
6661 initialization. Thus, duplicate_decls won't warn
6662 about this situation, and so we check here. */
6663 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6664 cp_error ("duplicate initialization of %D", decl
);
6665 if (duplicate_decls (decl
, field
))
6671 tree field
= check_classfn (context
, decl
);
6672 if (field
&& duplicate_decls (decl
, field
))
6676 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6677 DECL_IN_AGGR_P (decl
) = 0;
6678 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6679 || CLASSTYPE_USE_TEMPLATE (context
))
6680 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6682 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6683 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6686 pushclass (context
, 2);
6689 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6690 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6693 /* Set attributes here so if duplicate decl, will have proper attributes. */
6694 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6696 /* Add this decl to the current binding level, but not if it
6697 comes from another scope, e.g. a static member variable.
6698 TEM may equal DECL or it may be a previous decl of the same name. */
6700 if ((TREE_CODE (decl
) != PARM_DECL
&& DECL_CONTEXT (decl
) != NULL_TREE
6701 /* Definitions of namespace members outside their namespace are
6703 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
6704 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
6705 || TREE_CODE (type
) == LANG_TYPE
6706 /* The declaration of template specializations does not affect
6707 the functions available for overload resolution, so we do not
6709 || (TREE_CODE (decl
) == FUNCTION_DECL
6710 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
6713 tem
= pushdecl (decl
);
6715 if (processing_template_decl
)
6717 if (! current_function_decl
)
6718 tem
= push_template_decl (tem
);
6719 else if (minimal_parse_mode
)
6721 = build_min_nt (DECL_STMT
, copy_to_permanent (declarator
),
6722 copy_to_permanent (declspecs
),
6727 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6728 /* Tell the back-end to use or not use .common as appropriate. If we say
6729 -fconserve-space, we want this to save .data space, at the expense of
6730 wrong semantics. If we say -fno-conserve-space, we want this to
6731 produce errors about redefs; to do this we force variables into the
6733 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6736 if (! processing_template_decl
)
6739 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6740 push_obstacks_nochange ();
6743 /* We have no way of knowing whether the initializer will need to be
6744 evaluated at run-time or not until we've parsed it, so let's just put
6745 it in the permanent obstack. (jason) */
6747 && ! (TREE_CODE (tem
) == PARM_DECL
6748 || (TREE_READONLY (tem
)
6749 && (TREE_CODE (tem
) == VAR_DECL
6750 || TREE_CODE (tem
) == FIELD_DECL
))))
6752 /* When parsing and digesting the initializer,
6753 use temporary storage. Do this even if we will ignore the value. */
6754 if (toplevel_bindings_p () && debug_temp_inits
)
6756 if (processing_template_decl
6757 || TYPE_NEEDS_CONSTRUCTING (type
)
6758 || TREE_CODE (type
) == REFERENCE_TYPE
)
6759 /* In this case, the initializer must lay down in permanent
6760 storage, since it will be saved until `finish_file' is run. */
6763 temporary_allocation ();
6775 tree type
= TREE_TYPE (decl
);
6776 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6778 /* If this type of object needs a cleanup, and control may
6779 jump past it, make a new binding level so that it is cleaned
6780 up only when it is initialized first. */
6781 if (TYPE_NEEDS_DESTRUCTOR (type
)
6782 && current_binding_level
->more_cleanups_ok
== 0)
6783 pushlevel_temporary (1);
6786 /* Is it valid for this decl to have an initializer at all?
6787 If not, set INITIALIZED to zero, which will indirectly
6788 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6790 /* Don't allow initializations for incomplete types except for
6791 arrays which might be completed by the initialization. */
6792 if (type
== error_mark_node
)
6793 ; /* Don't complain again. */
6794 else if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6795 ; /* A complete type is ok. */
6796 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6798 cp_error ("variable `%#D' has initializer but incomplete type",
6801 type
= TREE_TYPE (decl
) = error_mark_node
;
6803 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6805 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6806 cp_error ("elements of array `%#D' have incomplete type", decl
);
6807 /* else we already gave an error in start_decl. */
6813 && TREE_CODE (decl
) != TYPE_DECL
6814 && TREE_CODE (decl
) != TEMPLATE_DECL
6815 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6817 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6818 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6820 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6822 /* Change the type so that assemble_variable will give
6823 DECL an rtl we can live with: (mem (const_int 0)). */
6824 type
= TREE_TYPE (decl
) = error_mark_node
;
6828 /* If any base type in the hierarchy of TYPE needs a constructor,
6829 then we set initialized to 1. This way any nodes which are
6830 created for the purposes of initializing this aggregate
6831 will live as long as it does. This is necessary for global
6832 aggregates which do not have their initializers processed until
6833 the end of the file. */
6834 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6839 /* We don't do this yet for GNU C++. */
6840 /* For a local variable, define the RTL now. */
6841 if (! toplevel_bindings_p ()
6842 /* But not if this is a duplicate decl
6843 and we preserved the rtl from the previous one
6844 (which may or may not happen). */
6845 && DECL_RTL (tem
) == NULL_RTX
)
6847 if (TYPE_SIZE (TREE_TYPE (tem
)) != NULL_TREE
)
6849 else if (TREE_CODE (TREE_TYPE (tem
)) == ARRAY_TYPE
6850 && DECL_INITIAL (tem
) != NULL_TREE
)
6856 DECL_INITIAL (decl
) = NULL_TREE
;
6859 /* Handle initialization of references.
6860 These three arguments are from `cp_finish_decl', and have the
6861 same meaning here that they do there.
6863 Quotes on semantics can be found in ARM 8.4.3. */
6866 grok_reference_init (decl
, type
, init
)
6867 tree decl
, type
, init
;
6871 if (init
== NULL_TREE
)
6873 if ((DECL_LANG_SPECIFIC (decl
) == 0
6874 || DECL_IN_AGGR_P (decl
) == 0)
6875 && ! DECL_THIS_EXTERN (decl
))
6877 cp_error ("`%D' declared as reference but not initialized", decl
);
6878 if (TREE_CODE (decl
) == VAR_DECL
)
6879 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
6884 if (init
== error_mark_node
)
6887 if (TREE_CODE (type
) == REFERENCE_TYPE
6888 && TREE_CODE (init
) == CONSTRUCTOR
)
6890 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6894 if (TREE_TYPE (init
) && TREE_CODE (TREE_TYPE (init
)) == UNKNOWN_TYPE
)
6895 /* decay_conversion is probably wrong for references to functions. */
6896 init
= decay_conversion (instantiate_type (TREE_TYPE (type
), init
, 1));
6898 if (TREE_CODE (init
) == TREE_LIST
)
6899 init
= build_compound_expr (init
);
6901 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6902 init
= convert_from_reference (init
);
6904 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6905 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6907 /* Note: default conversion is only called in very special cases. */
6908 init
= default_conversion (init
);
6911 tmp
= convert_to_reference
6912 (type
, init
, CONV_IMPLICIT
,
6913 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6915 if (tmp
== error_mark_node
)
6917 else if (tmp
!= NULL_TREE
)
6920 DECL_INITIAL (decl
) = save_expr (init
);
6924 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
6928 /* ?? Can this be optimized in some cases to
6929 hand back the DECL_INITIAL slot?? */
6930 if (TYPE_SIZE (TREE_TYPE (type
)))
6932 init
= convert_from_reference (decl
);
6933 if (TREE_PERMANENT (decl
))
6934 init
= copy_to_permanent (init
);
6935 SET_DECL_REFERENCE_SLOT (decl
, init
);
6938 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
6940 expand_static_init (decl
, DECL_INITIAL (decl
));
6941 DECL_INITIAL (decl
) = NULL_TREE
;
6946 if (TREE_CODE (decl
) == VAR_DECL
)
6947 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
6951 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
6952 mucking with forces it does not comprehend (i.e. initialization with a
6953 constructor). If we are at global scope and won't go into COMMON, fill
6954 it in with a dummy CONSTRUCTOR to force the variable into .data;
6955 otherwise we can use error_mark_node. */
6958 obscure_complex_init (decl
, init
)
6961 if (! flag_no_inline
&& TREE_STATIC (decl
))
6963 if (extract_init (decl
, init
))
6967 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6968 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
6969 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
6973 DECL_INITIAL (decl
) = error_mark_node
;
6978 /* Finish processing of a declaration;
6979 install its line number and initial value.
6980 If the length of an array type is not known before,
6981 it must be determined now, from the initial value, or it is an error.
6983 Call `pop_obstacks' iff NEED_POP is nonzero.
6985 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
6986 for aggregates that have constructors alive on the permanent obstack,
6987 so that the global initializing functions can be written at the end.
6989 INIT0 holds the value of an initializer that should be allowed to escape
6992 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
6993 if the (init) syntax was used.
6995 For functions that take default parameters, DECL points to its
6996 "maximal" instantiation. `cp_finish_decl' must then also declared its
6997 subsequently lower and lower forms of instantiation, checking for
6998 ambiguity as it goes. This can be sped up later. */
7001 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7008 tree cleanup
= NULL_TREE
, ttype
= NULL_TREE
;
7010 int temporary
= allocation_temporary_p ();
7011 char *asmspec
= NULL
;
7012 int was_readonly
= 0;
7013 int already_used
= 0;
7015 /* If this is 0, then we did not change obstacks. */
7019 error ("assignment (not initialization) in declaration");
7023 /* If a name was specified, get the string. */
7025 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7027 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7029 cp_error ("Cannot initialize `%D' to namespace `%D'",
7034 if (TREE_CODE (decl
) == VAR_DECL
7035 && DECL_CONTEXT (decl
)
7036 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7037 && DECL_CONTEXT (decl
) != current_namespace
7040 /* Leave the namespace of the object. */
7041 pop_decl_namespace ();
7044 /* If the type of the thing we are declaring either has
7045 a constructor, or has a virtual function table pointer,
7046 AND its initialization was accepted by `start_decl',
7047 then we stayed on the permanent obstack through the
7048 declaration, otherwise, changed obstacks as GCC would. */
7050 type
= TREE_TYPE (decl
);
7052 if (type
== error_mark_node
)
7054 if (toplevel_bindings_p () && temporary
)
7055 end_temporary_allocation ();
7060 if (processing_template_decl
)
7062 if (init
&& DECL_INITIAL (decl
))
7063 DECL_INITIAL (decl
) = init
;
7064 if (minimal_parse_mode
&& ! DECL_ARTIFICIAL (decl
))
7066 tree stmt
= DECL_VINDEX (decl
);
7067 /* If the decl is declaring a member of a local class (in a
7068 template function), the DECL_VINDEX will either be NULL,
7069 or it will be an actual virtual function index, not a
7071 if (stmt
!= NULL_TREE
&& TREE_CODE (stmt
) == DECL_STMT
)
7073 DECL_VINDEX (decl
) = NULL_TREE
;
7074 TREE_OPERAND (stmt
, 2) = copy_to_permanent (init
);
7081 /* Take care of TYPE_DECLs up front. */
7082 if (TREE_CODE (decl
) == TYPE_DECL
)
7084 if (init
&& DECL_INITIAL (decl
))
7086 /* typedef foo = bar; store the type of bar as the type of foo. */
7087 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7088 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7090 if (type
!= error_mark_node
7091 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7093 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7094 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7095 set_identifier_type_value (DECL_NAME (decl
), type
);
7096 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7098 GNU_xref_decl (current_function_decl
, decl
);
7100 /* If we have installed this as the canonical typedef for this
7101 type, and that type has not been defined yet, delay emitting
7102 the debug information for it, as we will emit it later. */
7103 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7104 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7105 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7107 rest_of_decl_compilation (decl
, NULL_PTR
,
7108 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7111 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7113 ttype
= target_type (type
);
7116 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7117 && TYPE_NEEDS_CONSTRUCTING (type
))
7120 /* Currently, GNU C++ puts constants in text space, making them
7121 impossible to initialize. In the future, one would hope for
7122 an operating system which understood the difference between
7123 initialization and the running of a program. */
7125 TREE_READONLY (decl
) = 0;
7128 if (TREE_CODE (decl
) == FIELD_DECL
)
7130 if (init
&& init
!= error_mark_node
)
7131 my_friendly_assert (TREE_PERMANENT (init
), 147);
7135 /* This must override the asm specifier which was placed
7136 by grokclassfn. Lay this out fresh. */
7137 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7138 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7139 make_decl_rtl (decl
, asmspec
, 0);
7142 /* If `start_decl' didn't like having an initialization, ignore it now. */
7143 else if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7145 else if (DECL_EXTERNAL (decl
))
7147 else if (TREE_CODE (type
) == REFERENCE_TYPE
7148 || (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE_REFERENCE (type
)))
7150 if (TREE_STATIC (decl
))
7151 make_decl_rtl (decl
, NULL_PTR
,
7152 toplevel_bindings_p ()
7153 || pseudo_global_level_p ());
7154 grok_reference_init (decl
, type
, init
);
7158 GNU_xref_decl (current_function_decl
, decl
);
7160 if (TREE_CODE (decl
) == FIELD_DECL
)
7162 else if (TREE_CODE (decl
) == CONST_DECL
)
7164 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7166 DECL_INITIAL (decl
) = init
;
7168 /* This will keep us from needing to worry about our obstacks. */
7169 my_friendly_assert (init
!= NULL_TREE
, 149);
7174 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7176 if (TREE_CODE (type
) == ARRAY_TYPE
)
7177 init
= digest_init (type
, init
, (tree
*) 0);
7178 else if (TREE_CODE (init
) == CONSTRUCTOR
)
7180 if (TYPE_NON_AGGREGATE_CLASS (type
))
7182 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7184 init
= error_mark_node
;
7187 goto dont_use_constructor
;
7192 dont_use_constructor
:
7193 if (TREE_CODE (init
) != TREE_VEC
)
7194 init
= store_init_value (decl
, init
);
7198 /* We must hide the initializer so that expand_decl
7199 won't try to do something it does not understand. */
7200 init
= obscure_complex_init (decl
, init
);
7202 else if (DECL_EXTERNAL (decl
))
7204 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7205 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7208 while (TREE_CODE (ctype
) == ARRAY_TYPE
)
7209 ctype
= TREE_TYPE (ctype
);
7210 if (! TYPE_NEEDS_CONSTRUCTING (ctype
))
7212 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (ctype
))
7213 cp_error ("structure `%D' with uninitialized const members", decl
);
7214 if (CLASSTYPE_REF_FIELDS_NEED_INIT (ctype
))
7215 cp_error ("structure `%D' with uninitialized reference members",
7219 if (TREE_CODE (decl
) == VAR_DECL
7220 && !DECL_INITIAL (decl
)
7221 && !TYPE_NEEDS_CONSTRUCTING (type
)
7222 && (TYPE_READONLY (type
) || TREE_READONLY (decl
)))
7223 cp_error ("uninitialized const `%D'", decl
);
7225 if (TYPE_SIZE (type
) != NULL_TREE
7226 && TYPE_NEEDS_CONSTRUCTING (type
))
7227 init
= obscure_complex_init (decl
, NULL_TREE
);
7229 else if (TREE_CODE (decl
) == VAR_DECL
7230 && TREE_CODE (type
) != REFERENCE_TYPE
7231 && (TYPE_READONLY (type
) || TREE_READONLY (decl
)))
7233 /* ``Unless explicitly declared extern, a const object does not have
7234 external linkage and must be initialized. ($8.4; $12.1)'' ARM 7.1.6
7235 However, if it's `const int foo = 1; const int foo;', don't complain
7236 about the second decl, since it does have an initializer before.
7237 We deliberately don't complain about arrays, because they're
7238 supposed to be initialized by a constructor. */
7239 if (! DECL_INITIAL (decl
)
7240 && TREE_CODE (type
) != ARRAY_TYPE
7241 && (!pedantic
|| !current_class_type
))
7242 cp_error ("uninitialized const `%#D'", decl
);
7245 /* For top-level declaration, the initial value was read in
7246 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7247 must go in the permanent obstack; but don't discard the
7248 temporary data yet. */
7250 if (toplevel_bindings_p () && temporary
)
7251 end_temporary_allocation ();
7253 /* Deduce size of array from initialization, if not already known. */
7255 if (TREE_CODE (type
) == ARRAY_TYPE
7256 && TYPE_DOMAIN (type
) == NULL_TREE
7257 && TREE_CODE (decl
) != TYPE_DECL
)
7260 = (TREE_STATIC (decl
)
7261 /* Even if pedantic, an external linkage array
7262 may have incomplete type at first. */
7263 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7264 : !DECL_EXTERNAL (decl
));
7265 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7266 int failure
= complete_array_type (type
, initializer
, do_default
);
7269 cp_error ("initializer fails to determine size of `%D'", decl
);
7274 cp_error ("array size missing in `%D'", decl
);
7275 /* If a `static' var's size isn't known, make it extern as
7276 well as static, so it does not get allocated. If it's not
7277 `static', then don't mark it extern; finish_incomplete_decl
7278 will give it a default size and it will get allocated. */
7279 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7280 DECL_EXTERNAL (decl
) = 1;
7283 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7284 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7286 cp_error ("zero-size array `%D'", decl
);
7288 layout_decl (decl
, 0);
7291 if (TREE_CODE (decl
) == VAR_DECL
)
7293 if (DECL_SIZE (decl
) == NULL_TREE
7294 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7295 layout_decl (decl
, 0);
7297 if (TREE_STATIC (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7299 /* A static variable with an incomplete type:
7300 that is an error if it is initialized.
7301 Otherwise, let it through, but if it is not `extern'
7302 then it may cause an error message later. */
7303 if (DECL_INITIAL (decl
) != NULL_TREE
)
7304 cp_error ("storage size of `%D' isn't known", decl
);
7307 else if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7309 /* An automatic variable with an incomplete type: that is an error.
7310 Don't talk about array types here, since we took care of that
7311 message in grokdeclarator. */
7312 cp_error ("storage size of `%D' isn't known", decl
);
7313 TREE_TYPE (decl
) = error_mark_node
;
7315 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7316 /* Let debugger know it should output info for this type. */
7317 note_debug_info_needed (ttype
);
7319 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7320 note_debug_info_needed (DECL_CONTEXT (decl
));
7322 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7323 && DECL_SIZE (decl
) != NULL_TREE
7324 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7326 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7327 constant_expression_warning (DECL_SIZE (decl
));
7329 cp_error ("storage size of `%D' isn't constant", decl
);
7332 if (! DECL_EXTERNAL (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7333 /* Cleanups for static variables are handled by `finish_file'. */
7334 && ! TREE_STATIC (decl
))
7336 int yes
= suspend_momentary ();
7337 cleanup
= maybe_build_cleanup (decl
);
7338 resume_momentary (yes
);
7341 /* PARM_DECLs get cleanups, too. */
7342 else if (TREE_CODE (decl
) == PARM_DECL
&& TYPE_NEEDS_DESTRUCTOR (type
))
7345 end_temporary_allocation ();
7346 cleanup
= maybe_build_cleanup (decl
);
7348 resume_temporary_allocation ();
7351 /* Output the assembler code and/or RTL code for variables and functions,
7352 unless the type is an undefined structure or union.
7353 If not, it will get done when the type is completed. */
7355 was_incomplete
= (DECL_SIZE (decl
) == NULL_TREE
);
7357 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7358 || TREE_CODE (decl
) == RESULT_DECL
)
7360 /* ??? FIXME: What about nested classes? */
7361 int toplev
= toplevel_bindings_p () || pseudo_global_level_p ();
7363 = (TREE_STATIC (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7364 && allocation_temporary_p ());
7367 end_temporary_allocation ();
7369 /* Static data in a function with comdat linkage also has comdat
7371 if (TREE_CODE (decl
) == VAR_DECL
7372 && TREE_STATIC (decl
)
7373 /* Don't mess with __FUNCTION__. */
7374 && ! TREE_ASM_WRITTEN (decl
)
7375 && current_function_decl
7376 && DECL_CONTEXT (decl
) == current_function_decl
7377 && (DECL_THIS_INLINE (current_function_decl
)
7378 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7379 && TREE_PUBLIC (current_function_decl
))
7381 /* Rather than try to get this right with inlining, we suppress
7382 inlining of such functions. */
7383 current_function_cannot_inline
7384 = "function with static variable cannot be inline";
7386 /* If flag_weak, we don't need to mess with this, as we can just
7387 make the function weak, and let it refer to its unique local
7388 copy. This works because we don't allow the function to be
7392 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7394 TREE_PUBLIC (decl
) = 1;
7395 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7397 else if (DECL_INITIAL (decl
) == NULL_TREE
7398 || DECL_INITIAL (decl
) == error_mark_node
)
7400 TREE_PUBLIC (decl
) = 1;
7401 DECL_COMMON (decl
) = 1;
7403 /* else we lose. We can only do this if we can use common,
7404 which we can't if it has been initialized. */
7406 if (TREE_PUBLIC (decl
))
7407 DECL_ASSEMBLER_NAME (decl
)
7408 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7409 else if (! DECL_ARTIFICIAL (decl
))
7411 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7412 cp_warning_at (" you can work around this by removing the initializer"), decl
;
7417 else if (TREE_CODE (decl
) == VAR_DECL
7418 && DECL_LANG_SPECIFIC (decl
)
7419 && DECL_COMDAT (decl
))
7421 /* Dynamically initialized vars go into common. */
7422 if (DECL_INITIAL (decl
) == NULL_TREE
7423 || DECL_INITIAL (decl
) == error_mark_node
)
7424 DECL_COMMON (decl
) = 1;
7425 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7427 DECL_COMMON (decl
) = 1;
7428 DECL_INITIAL (decl
) = error_mark_node
;
7432 /* Statically initialized vars are weak or comdat, if
7435 make_decl_one_only (decl
);
7438 /* We can't do anything useful; leave vars for explicit
7440 DECL_EXTERNAL (decl
) = 1;
7441 DECL_NOT_REALLY_EXTERN (decl
) = 0;
7446 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7447 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7448 else if (TREE_CODE (decl
) == VAR_DECL
7449 && TREE_READONLY (decl
)
7450 && DECL_INITIAL (decl
) != NULL_TREE
7451 && DECL_INITIAL (decl
) != error_mark_node
7452 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7454 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7457 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7460 && TREE_STATIC (decl
)
7461 && ! TREE_SIDE_EFFECTS (decl
)
7462 && ! TREE_PUBLIC (decl
)
7463 && ! DECL_EXTERNAL (decl
)
7464 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7465 && DECL_MODE (decl
) != BLKmode
)
7467 /* If this variable is really a constant, then fill its DECL_RTL
7468 slot with something which won't take up storage.
7469 If something later should take its address, we can always give
7470 it legitimate RTL at that time. */
7471 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7472 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7473 TREE_ASM_WRITTEN (decl
) = 1;
7475 else if (toplev
&& ! TREE_PUBLIC (decl
))
7477 /* If this is a static const, change its apparent linkage
7478 if it belongs to a #pragma interface. */
7479 if (!interface_unknown
)
7481 TREE_PUBLIC (decl
) = 1;
7482 DECL_EXTERNAL (decl
) = interface_only
;
7484 make_decl_rtl (decl
, asmspec
, toplev
);
7487 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7489 else if (TREE_CODE (decl
) == VAR_DECL
7490 && DECL_LANG_SPECIFIC (decl
)
7491 && DECL_IN_AGGR_P (decl
))
7493 if (TREE_STATIC (decl
))
7495 if (init
== NULL_TREE
7496 #ifdef DEFAULT_STATIC_DEFS
7497 /* If this code is dead, then users must
7498 explicitly declare static member variables
7499 outside the class def'n as well. */
7500 && TYPE_NEEDS_CONSTRUCTING (type
)
7504 DECL_EXTERNAL (decl
) = 1;
7505 make_decl_rtl (decl
, asmspec
, 1);
7508 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7511 /* Just a constant field. Should not need any rtl. */
7515 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7518 resume_temporary_allocation ();
7520 if (type
!= error_mark_node
7521 && TYPE_LANG_SPECIFIC (type
)
7522 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
7523 abstract_virtuals_error (decl
, type
);
7524 else if ((TREE_CODE (type
) == FUNCTION_TYPE
7525 || TREE_CODE (type
) == METHOD_TYPE
)
7526 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
7527 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (type
)))
7528 abstract_virtuals_error (decl
, TREE_TYPE (type
));
7530 if (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE (type
))
7531 signature_error (decl
, type
);
7532 else if ((TREE_CODE (type
) == FUNCTION_TYPE
7533 || TREE_CODE (type
) == METHOD_TYPE
)
7534 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
7535 && IS_SIGNATURE (TREE_TYPE (type
)))
7536 signature_error (decl
, TREE_TYPE (type
));
7538 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7540 else if (DECL_EXTERNAL (decl
)
7541 && ! (DECL_LANG_SPECIFIC (decl
)
7542 && DECL_NOT_REALLY_EXTERN (decl
)))
7545 DECL_INITIAL (decl
) = init
;
7547 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7549 /* Cleanups for static variables are handled by `finish_file'. */
7550 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7551 || TYPE_NEEDS_DESTRUCTOR (type
))
7552 expand_static_init (decl
, init
);
7556 /* This is a declared decl which must live until the
7557 end of the binding contour. It may need a cleanup. */
7559 /* Recompute the RTL of a local array now
7560 if it used to be an incomplete type. */
7561 if (was_incomplete
&& ! TREE_STATIC (decl
))
7563 /* If we used it already as memory, it must stay in memory. */
7564 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7565 /* If it's still incomplete now, no init will save it. */
7566 if (DECL_SIZE (decl
) == NULL_TREE
)
7567 DECL_INITIAL (decl
) = NULL_TREE
;
7570 else if (! TREE_ASM_WRITTEN (decl
)
7571 && (TYPE_SIZE (type
) != NULL_TREE
7572 || TREE_CODE (type
) == ARRAY_TYPE
))
7574 /* Do this here, because we did not expand this decl's
7575 rtl in start_decl. */
7576 if (DECL_RTL (decl
) == NULL_RTX
)
7580 /* XXX: Why don't we use decl here? */
7581 /* Ans: Because it was already expanded? */
7582 if (! expand_decl_cleanup (NULL_TREE
, cleanup
))
7583 cp_error ("parser lost in parsing declaration of `%D'",
7585 /* Cleanup used up here. */
7586 cleanup
= NULL_TREE
;
7590 if (current_binding_level
->is_for_scope
)
7592 struct binding_level
*outer
= current_binding_level
->level_chain
;
7594 /* Check to see if the same name is already bound at
7595 the outer level, either because it was directly declared,
7596 or because a dead for-decl got preserved. In either case,
7597 the code would not have been valid under the ARM
7598 scope rules, so clear is_for_scope for the
7599 current_binding_level.
7601 Otherwise, we need to preserve the temp slot for decl
7602 to last into the outer binding level. */
7604 int handling_dead_for_vars
= 0;
7605 tree link
= outer
->names
;
7606 for (; ; link
= TREE_CHAIN (link
))
7608 if (link
== NULL
&& handling_dead_for_vars
== 0)
7610 link
= outer
->dead_vars_from_for
;
7611 handling_dead_for_vars
= 1;
7615 if (DECL_IN_MEMORY_P (decl
))
7616 preserve_temp_slots (DECL_RTL (decl
));
7619 if (DECL_NAME (link
) == DECL_NAME (decl
))
7621 if (handling_dead_for_vars
)
7624 = purpose_member (DECL_NAME (decl
),
7625 current_binding_level
->shadowed
);
7626 if (shadowing
&& TREE_VALUE (shadowing
) == link
)
7627 TREE_VALUE (shadowing
)
7628 = DECL_SHADOWED_FOR_VAR (link
);
7630 current_binding_level
->is_for_scope
= 0;
7636 expand_start_target_temps ();
7638 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7640 /* Compute and store the initial value. */
7641 expand_decl_init (decl
);
7642 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7644 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7646 emit_line_note (DECL_SOURCE_FILE (decl
),
7647 DECL_SOURCE_LINE (decl
));
7648 expand_aggr_init (decl
, init
, flags
);
7651 /* Set this to 0 so we can tell whether an aggregate which
7652 was initialized was ever used. Don't do this if it has a
7653 destructor, so we don't complain about the 'resource
7654 allocation is initialization' idiom. */
7655 /* Now set attribute((unused)) on types so decls of
7656 that type will be marked used. (see TREE_USED, above.)
7657 This avoids the warning problems this particular code
7658 tried to work around. */
7660 if (TYPE_NEEDS_CONSTRUCTING (type
)
7662 && cleanup
== NULL_TREE
7663 && DECL_NAME (decl
))
7664 TREE_USED (decl
) = 0;
7667 TREE_USED (decl
) = 1;
7670 /* Cleanup any temporaries needed for the initial value. */
7671 expand_end_target_temps ();
7673 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7675 /* Store the cleanup, if there was one. */
7678 if (! expand_decl_cleanup (decl
, cleanup
))
7679 cp_error ("parser lost in parsing declaration of `%D'",
7686 /* Undo call to `pushclass' that was done in `start_decl'
7687 due to initialization of qualified member variable.
7688 I.e., Foo::x = 10; */
7690 tree context
= DECL_REAL_CONTEXT (decl
);
7692 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7693 && (TREE_CODE (decl
) == VAR_DECL
7694 /* We also have a pushclass done that we need to undo here
7695 if we're at top level and declare a method. */
7696 || TREE_CODE (decl
) == FUNCTION_DECL
)
7697 /* If size hasn't been set, we're still defining it,
7698 and therefore inside the class body; don't pop
7699 the binding level.. */
7700 && TYPE_SIZE (context
) != NULL_TREE
7701 && context
== current_class_type
)
7708 /* If requested, warn about definitions of large data objects. */
7710 if (warn_larger_than
7711 && ! processing_template_decl
7712 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7713 && !DECL_EXTERNAL (decl
))
7715 register tree decl_size
= DECL_SIZE (decl
);
7717 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7719 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7721 if (units
> larger_than_size
)
7722 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7728 /* Resume permanent allocation, if not within a function. */
7729 /* The corresponding push_obstacks_nochange is in start_decl,
7730 start_method, groktypename, and in grokfield. */
7735 TREE_READONLY (decl
) = 1;
7738 /* This is here for a midend callback from c-common.c */
7741 finish_decl (decl
, init
, asmspec_tree
)
7745 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7749 expand_static_init (decl
, init
)
7753 tree oldstatic
= value_member (decl
, static_aggregates
);
7757 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7758 cp_error ("multiple initializations given for `%D'", decl
);
7760 else if (! toplevel_bindings_p () && ! pseudo_global_level_p ())
7762 /* Emit code to perform this initialization but once. */
7765 /* Remember this information until end of file. */
7766 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7768 /* Emit code to perform this initialization but once. */
7769 temp
= get_temp_name (integer_type_node
, 1);
7770 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
7771 expand_start_cond (build_binary_op (EQ_EXPR
, temp
,
7772 integer_zero_node
, 1), 0);
7773 expand_start_target_temps ();
7775 expand_assignment (temp
, integer_one_node
, 0, 0);
7776 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
7777 || (init
&& TREE_CODE (init
) == TREE_LIST
))
7779 expand_aggr_init (decl
, init
, 0);
7780 do_pending_stack_adjust ();
7783 expand_assignment (decl
, init
, 0, 0);
7785 /* Cleanup any temporaries needed for the initial value. */
7786 expand_end_target_temps ();
7788 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7790 tree cleanup
, fcall
;
7791 static tree Atexit
= 0;
7794 tree atexit_fndecl
, PFV
, pfvlist
;
7795 /* Remember this information until end of file. */
7796 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7797 PFV
= build_pointer_type (build_function_type
7798 (void_type_node
, void_list_node
));
7800 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7802 push_lang_context (lang_name_c
);
7804 = builtin_function ("atexit",
7805 build_function_type (void_type_node
,
7807 NOT_BUILT_IN
, NULL_PTR
);
7808 assemble_external (atexit_fndecl
);
7809 Atexit
= default_conversion (atexit_fndecl
);
7810 pop_lang_context ();
7814 cleanup
= start_anon_func ();
7815 expand_expr_stmt (build_cleanup (decl
));
7817 mark_addressable (cleanup
);
7818 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7819 fcall
= build_function_call (Atexit
, expr_tree_cons (NULL_TREE
, cleanup
, NULL_TREE
));
7820 expand_expr_stmt (fcall
);
7824 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7826 static_aggregates
= perm_tree_cons (temp
, decl
, static_aggregates
);
7827 TREE_STATIC (static_aggregates
) = 1;
7830 /* Resume old (possibly temporary) allocation. */
7835 /* This code takes into account memory allocation
7836 policy of `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING
7837 does not hold for this object, then we must make permanent
7838 the storage currently in the temporary obstack. */
7839 if (! TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
7840 preserve_initializer ();
7841 static_aggregates
= perm_tree_cons (init
, decl
, static_aggregates
);
7845 /* Make TYPE a complete type based on INITIAL_VALUE.
7846 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
7847 2 if there was no information (in which case assume 1 if DO_DEFAULT). */
7850 complete_array_type (type
, initial_value
, do_default
)
7851 tree type
, initial_value
;
7854 register tree maxindex
= NULL_TREE
;
7859 /* Note MAXINDEX is really the maximum index,
7860 one less than the size. */
7861 if (TREE_CODE (initial_value
) == STRING_CST
)
7864 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
7865 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
7868 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
7870 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
7871 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
7872 for (; elts
; elts
= TREE_CHAIN (elts
))
7874 if (TREE_PURPOSE (elts
))
7875 maxindex
= TREE_PURPOSE (elts
);
7877 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
7879 maxindex
= copy_node (maxindex
);
7883 /* Make an error message unless that happened already. */
7884 if (initial_value
!= error_mark_node
)
7887 /* Prevent further error messages. */
7888 maxindex
= build_int_2 (0, 0);
7895 maxindex
= build_int_2 (0, 0);
7903 TYPE_DOMAIN (type
) = build_index_type (maxindex
);
7904 if (! TREE_TYPE (maxindex
))
7905 TREE_TYPE (maxindex
) = TYPE_DOMAIN (type
);
7907 itype
= TREE_TYPE (initial_value
);
7910 if (itype
&& !TYPE_DOMAIN (itype
))
7911 TYPE_DOMAIN (itype
) = TYPE_DOMAIN (type
);
7912 /* The type of the main variant should never be used for arrays
7913 of different sizes. It should only ever be completed with the
7914 size of the array. */
7915 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
7916 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = TYPE_DOMAIN (type
);
7919 /* Lay out the type now that we can get the real answer. */
7926 /* Return zero if something is declared to be a member of type
7927 CTYPE when in the context of CUR_TYPE. STRING is the error
7928 message to print in that case. Otherwise, quietly return 1. */
7931 member_function_or_else (ctype
, cur_type
, string
)
7932 tree ctype
, cur_type
;
7935 if (ctype
&& ctype
!= cur_type
)
7937 error (string
, TYPE_NAME_STRING (ctype
));
7943 /* Subroutine of `grokdeclarator'. */
7945 /* Generate errors possibly applicable for a given set of specifiers.
7946 This is for ARM $7.1.2. */
7949 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
7952 int virtualp
, quals
, friendp
, raises
, inlinep
;
7955 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
7957 cp_error ("`%D' declared as an `inline' %s", object
, type
);
7959 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
7962 cp_error_at ("invalid friend declaration", object
);
7964 cp_error_at ("invalid exception specifications", object
);
7967 /* CTYPE is class type, or null if non-class.
7968 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
7970 DECLARATOR is the function's name.
7971 VIRTUALP is truthvalue of whether the function is virtual or not.
7972 FLAGS are to be passed through to `grokclassfn'.
7973 QUALS are qualifiers indicating whether the function is `const'
7975 RAISES is a list of exceptions that this function can raise.
7976 CHECK is 1 if we must find this method in CTYPE, 0 if we should
7977 not look, and -1 if we should not call `grokclassfn' at all.
7979 Returns `error_mark_node' if something goes wrong, after issuing
7980 applicable error messages. */
7983 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
7984 raises
, attrlist
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
7985 template_count
, in_namespace
)
7988 tree orig_declarator
;
7990 enum overload_flags flags
;
7991 tree quals
, raises
, attrlist
;
7992 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
7996 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8000 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8001 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8007 type
= build_exception_variant (type
, raises
);
8010 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8011 /* Propagate volatile out from type to decl. */
8012 if (TYPE_VOLATILE (type
))
8013 TREE_THIS_VOLATILE (decl
) = 1;
8015 /* This decl is not from the current namespace. */
8017 set_decl_namespace (decl
, in_namespace
);
8019 /* `main' and builtins have implicit 'C' linkage. */
8020 if ((MAIN_NAME_P (declarator
)
8021 || (IDENTIFIER_LENGTH (declarator
) > 10
8022 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8023 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8024 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8025 && current_lang_name
== lang_name_cplusplus
8026 /* context == 0 could mean global scope or not set yet; either is fine
8027 for us here, as we check current_namespace. */
8028 && DECL_CONTEXT (decl
) == NULL_TREE
8029 && ctype
== NULL_TREE
8030 && current_namespace
== global_namespace
)
8031 DECL_LANGUAGE (decl
) = lang_c
;
8033 /* Should probably propagate const out from type to decl I bet (mrs). */
8036 DECL_STATIC_FUNCTION_P (decl
) = 1;
8037 DECL_CONTEXT (decl
) = ctype
;
8041 DECL_CLASS_CONTEXT (decl
) = ctype
;
8043 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8046 error ("cannot declare `main' to be inline");
8048 error ("cannot declare `main' to be static");
8053 /* Members of anonymous types have no linkage; make them internal. */
8054 if (ctype
&& ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
)))
8059 /* [basic.link]: A name with no linkage (notably, the name of a class
8060 or enumeration declared in a local scope) shall not be used to
8061 declare an entity with linkage.
8063 Only check this for public decls for now. */
8064 t
= no_linkage_check (TREE_TYPE (decl
));
8067 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8069 if (DECL_LANGUAGE (decl
) == lang_c
)
8070 /* Allow this; it's pretty common in C. */;
8072 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8076 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8081 TREE_PUBLIC (decl
) = publicp
;
8084 DECL_INTERFACE_KNOWN (decl
) = 1;
8085 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8089 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8091 DECL_EXTERNAL (decl
) = 1;
8092 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8094 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8095 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8099 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8100 grok_op_properties (decl
, virtualp
, check
< 0);
8102 if (ctype
&& hack_decl_function_context (decl
))
8103 DECL_NO_STATIC_CHAIN (decl
) = 1;
8105 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8106 if (TREE_PURPOSE (t
)
8107 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8109 add_defarg_fn (decl
);
8114 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8118 ("defining explicit specialization `%D' in friend declaration",
8122 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8124 /* Something like `template <class T> friend void f<T>()'. */
8125 cp_error ("template-id `%D' in declaration of primary template",
8127 return error_mark_node
;
8130 /* A friend declaration of the form friend void f<>(). Record
8131 the information in the TEMPLATE_ID_EXPR. */
8132 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8133 DECL_TEMPLATE_INFO (decl
)
8134 = perm_tree_cons (TREE_OPERAND (orig_declarator
, 0),
8135 TREE_OPERAND (orig_declarator
, 1),
8140 /* Plain overloading: will not be grok'd by grokclassfn. */
8141 if (! ctype
&& ! processing_template_decl
8142 && DECL_LANGUAGE (decl
) != lang_c
8143 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8144 set_mangled_name_for_decl (decl
);
8146 /* Caller will do the rest of this. */
8150 if (check
&& funcdef_flag
)
8151 DECL_INITIAL (decl
) = error_mark_node
;
8153 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8156 /* Just handle constructors here. We could do this
8157 inside the following if stmt, but I think
8158 that the code is more legible by breaking this
8159 case out. See comments below for what each of
8160 the following calls is supposed to do. */
8161 DECL_CONSTRUCTOR_P (decl
) = 1;
8163 grokclassfn (ctype
, decl
, flags
, quals
);
8165 decl
= check_explicit_specialization (orig_declarator
, decl
,
8167 2 * (funcdef_flag
!= 0) +
8168 4 * (friendp
!= 0));
8169 if (decl
== error_mark_node
)
8170 return error_mark_node
;
8172 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8175 tmp
= check_classfn (ctype
, decl
);
8177 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8178 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8180 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8181 cp_error ("definition of implicitly-declared `%D'", tmp
);
8182 if (tmp
&& duplicate_decls (decl
, tmp
))
8185 if (! grok_ctor_properties (ctype
, decl
))
8186 return error_mark_node
;
8188 if (check
== 0 && ! current_function_decl
)
8190 /* Assembler names live in the global namespace. */
8191 tmp
= IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (decl
));
8192 if (tmp
== NULL_TREE
)
8193 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (decl
), decl
);
8194 else if (TREE_CODE (tmp
) != TREE_CODE (decl
))
8195 cp_error ("inconsistent declarations for `%D'", decl
);
8198 duplicate_decls (decl
, tmp
);
8201 make_decl_rtl (decl
, NULL_PTR
, 1);
8208 /* Function gets the ugly name, field gets the nice one.
8209 This call may change the type of the function (because
8210 of default parameters)! */
8211 if (ctype
!= NULL_TREE
)
8212 grokclassfn (ctype
, decl
, flags
, quals
);
8214 decl
= check_explicit_specialization (orig_declarator
, decl
,
8216 2 * (funcdef_flag
!= 0) +
8217 4 * (friendp
!= 0));
8218 if (decl
== error_mark_node
)
8219 return error_mark_node
;
8221 if (ctype
!= NULL_TREE
8222 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8225 tmp
= check_classfn (ctype
, decl
);
8227 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8228 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8230 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8231 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8233 /* Remove the `this' parm added by grokclassfn.
8234 XXX Isn't this done in start_function, too? */
8235 revert_static_member_fn (&decl
, NULL
, NULL
);
8236 last_function_parms
= TREE_CHAIN (last_function_parms
);
8238 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8239 cp_error ("definition of implicitly-declared `%D'", tmp
);
8242 if (!duplicate_decls (decl
, tmp
))
8243 my_friendly_abort (892);
8248 if (ctype
== NULL_TREE
|| check
)
8251 /* Now install the declaration of this function so that others may
8252 find it (esp. its DECL_FRIENDLIST). Don't do this for local class
8254 if (! current_function_decl
)
8256 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
8258 /* We don't do this for specializations since the
8259 equivalent checks will be done later. Also, at this
8260 point the DECL_ASSEMBLER_NAME is not yet fully
8263 /* FIXME: this should only need to look at
8264 IDENTIFIER_GLOBAL_VALUE. */
8265 tmp
= lookup_name (DECL_ASSEMBLER_NAME (decl
), 0);
8266 if (tmp
== NULL_TREE
)
8267 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (decl
), decl
);
8268 else if (TREE_CODE (tmp
) != TREE_CODE (decl
))
8269 cp_error ("inconsistent declarations for `%D'", decl
);
8272 duplicate_decls (decl
, tmp
);
8278 cplus_decl_attributes (decl
, TREE_PURPOSE (attrlist
),
8279 TREE_VALUE (attrlist
));
8280 make_decl_rtl (decl
, NULL_PTR
, 1);
8284 DECL_VIRTUAL_P (decl
) = 1;
8285 if (DECL_VINDEX (decl
) == NULL_TREE
)
8286 DECL_VINDEX (decl
) = error_mark_node
;
8287 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8294 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8297 RID_BIT_TYPE
*specbits_in
;
8303 RID_BIT_TYPE specbits
;
8305 specbits
= *specbits_in
;
8307 if (TREE_CODE (type
) == OFFSET_TYPE
)
8309 /* If you declare a static member so that it
8310 can be initialized, the code will reach here. */
8311 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8312 type
= TREE_TYPE (type
);
8313 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
8314 DECL_CONTEXT (decl
) = basetype
;
8315 DECL_CLASS_CONTEXT (decl
) = basetype
;
8316 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8320 tree context
= in_namespace
? in_namespace
: current_namespace
;
8321 decl
= build_decl (VAR_DECL
, declarator
, complete_type (type
));
8322 if (declarator
&& context
!= global_namespace
&& namespace_bindings_p ()
8323 && current_lang_name
!= lang_name_c
)
8324 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
,
8329 set_decl_namespace (decl
, in_namespace
);
8331 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8333 DECL_THIS_EXTERN (decl
) = 1;
8334 DECL_EXTERNAL (decl
) = !initialized
;
8337 /* In class context, static means one per class,
8338 public access, and static storage. */
8339 if (DECL_CLASS_SCOPE_P (decl
))
8341 TREE_PUBLIC (decl
) = 1;
8342 TREE_STATIC (decl
) = 1;
8343 DECL_EXTERNAL (decl
) = 0;
8345 /* At top level, either `static' or no s.c. makes a definition
8346 (perhaps tentative), and absence of `static' makes it public. */
8347 else if (toplevel_bindings_p ())
8349 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8350 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8351 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8353 /* Not at top level, only `static' makes a static definition. */
8356 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8357 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8360 if (TREE_PUBLIC (decl
))
8362 /* [basic.link]: A name with no linkage (notably, the name of a class
8363 or enumeration declared in a local scope) shall not be used to
8364 declare an entity with linkage.
8366 Only check this for public decls for now. */
8367 tree t
= no_linkage_check (TREE_TYPE (decl
));
8370 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8371 /* Ignore for now; `enum { foo } e' is pretty common. */;
8373 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8381 /* Create a canonical pointer to member function type. */
8384 build_ptrmemfunc_type (type
)
8391 /* If a canonical type already exists for this type, use it. We use
8392 this method instead of type_hash_canon, because it only does a
8393 simple equality check on the list of field members. */
8395 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8398 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8400 u
= make_lang_type (UNION_TYPE
);
8401 IS_AGGR_TYPE (u
) = 0;
8402 fields
[0] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
, type
);
8403 fields
[1] = build_lang_field_decl (FIELD_DECL
, delta2_identifier
,
8405 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8406 TYPE_NAME (u
) = NULL_TREE
;
8408 t
= make_lang_type (RECORD_TYPE
);
8410 /* Let the front-end know this is a pointer to member function... */
8411 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8412 /* ... and not really an aggregate. */
8413 IS_AGGR_TYPE (t
) = 0;
8415 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
8417 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
8419 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8420 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8424 /* Zap out the name so that the back-end will give us the debugging
8425 information for this anonymous RECORD_TYPE. */
8426 TYPE_NAME (t
) = NULL_TREE
;
8428 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8430 /* Seems to be wanted. */
8431 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8435 /* Given declspecs and a declarator,
8436 determine the name and type of the object declared
8437 and construct a ..._DECL node for it.
8438 (In one case we can return a ..._TYPE node instead.
8439 For invalid input we sometimes return 0.)
8441 DECLSPECS is a chain of tree_list nodes whose value fields
8442 are the storage classes and type specifiers.
8444 DECL_CONTEXT says which syntactic context this declaration is in:
8445 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8446 FUNCDEF for a function definition. Like NORMAL but a few different
8447 error messages in each case. Return value may be zero meaning
8448 this definition is too screwy to try to parse.
8449 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8450 handle member functions (which have FIELD context).
8451 Return value may be zero meaning this definition is too screwy to
8453 PARM for a parameter declaration (either within a function prototype
8454 or before a function body). Make a PARM_DECL, or return void_type_node.
8455 CATCHPARM for a parameter declaration before a catch clause.
8456 TYPENAME if for a typename (in a cast or sizeof).
8457 Don't make a DECL node; just return the ..._TYPE node.
8458 FIELD for a struct or union field; make a FIELD_DECL.
8459 BITFIELD for a field with specified width.
8460 INITIALIZED is 1 if the decl has an initializer.
8462 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8463 It may also be so in the PARM case, for a prototype where the
8464 argument type is specified but not the name.
8466 This function is where the complicated C meanings of `static'
8467 and `extern' are interpreted.
8469 For C++, if there is any monkey business to do, the function which
8470 calls this one must do it, i.e., prepending instance variables,
8471 renaming overloaded function names, etc.
8473 Note that for this C++, it is an error to define a method within a class
8474 which does not belong to that class.
8476 Except in the case where SCOPE_REFs are implicitly known (such as
8477 methods within a class being redundantly qualified),
8478 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8479 (class_name::decl_name). The caller must also deal with this.
8481 If a constructor or destructor is seen, and the context is FIELD,
8482 then the type gains the attribute TREE_HAS_x. If such a declaration
8483 is erroneous, NULL_TREE is returned.
8485 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8486 function, these are the qualifiers to give to the `this' pointer.
8488 May return void_type_node if the declarator turned out to be a friend.
8489 See grokfield for details. */
8491 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8494 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8497 enum decl_context decl_context
;
8501 RID_BIT_TYPE specbits
;
8504 tree type
= NULL_TREE
;
8508 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8509 int explicit_int
= 0;
8510 int explicit_char
= 0;
8511 int defaulted_int
= 0;
8512 int opaque_typedef
= 0;
8513 tree typedef_decl
= NULL_TREE
;
8515 tree typedef_type
= NULL_TREE
;
8516 int funcdef_flag
= 0;
8517 enum tree_code innermost_code
= ERROR_MARK
;
8520 /* See the code below that used this. */
8521 tree decl_machine_attr
= NULL_TREE
;
8523 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8524 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8525 tree init
= NULL_TREE
;
8527 /* Keep track of what sort of function is being processed
8528 so that we can warn about default return values, or explicit
8529 return values which do not match prescribed defaults. */
8530 enum return_types return_type
= return_normal
;
8532 tree dname
= NULL_TREE
;
8533 tree ctype
= current_class_type
;
8534 tree ctor_return_type
= NULL_TREE
;
8535 enum overload_flags flags
= NO_SPECIAL
;
8536 tree quals
= NULL_TREE
;
8537 tree raises
= NULL_TREE
;
8538 int template_count
= 0;
8539 tree in_namespace
= NULL_TREE
;
8541 RIDBIT_RESET_ALL (specbits
);
8542 if (decl_context
== FUNCDEF
)
8543 funcdef_flag
= 1, decl_context
= NORMAL
;
8544 else if (decl_context
== MEMFUNCDEF
)
8545 funcdef_flag
= -1, decl_context
= FIELD
;
8546 else if (decl_context
== BITFIELD
)
8547 bitfield
= 1, decl_context
= FIELD
;
8549 /* Look inside a declarator for the name being declared
8550 and get it as a string, for an error message. */
8552 tree
*next
= &declarator
;
8556 while (next
&& *next
)
8559 switch (TREE_CODE (decl
))
8563 next
= &TREE_OPERAND (decl
, 0);
8566 case BIT_NOT_EXPR
: /* For C++ destructors! */
8568 tree name
= TREE_OPERAND (decl
, 0);
8569 tree rename
= NULL_TREE
;
8571 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8573 return_type
= return_dtor
;
8574 if (TREE_CODE (name
) == TYPE_DECL
)
8575 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8576 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8577 if (ctype
== NULL_TREE
)
8579 if (current_class_type
== NULL_TREE
)
8581 error ("destructors must be member functions");
8586 tree t
= constructor_name (current_class_name
);
8593 tree t
= constructor_name (ctype
);
8600 cp_error ("destructor `%T' must match class name `%T'",
8602 TREE_OPERAND (decl
, 0) = rename
;
8608 case ADDR_EXPR
: /* C++ reference declaration */
8613 innermost_code
= TREE_CODE (decl
);
8614 next
= &TREE_OPERAND (decl
, 0);
8618 if (parmlist_is_exprlist (TREE_OPERAND (decl
, 1)))
8620 /* This is actually a variable declaration using constructor
8621 syntax. We need to call start_decl and cp_finish_decl so we
8622 can get the variable initialized... */
8624 *next
= TREE_OPERAND (decl
, 0);
8625 init
= TREE_OPERAND (decl
, 1);
8627 decl
= start_decl (declarator
, declspecs
, 1, NULL_TREE
, NULL_TREE
);
8628 /* Look for __unused__ attribute */
8629 if (TREE_USED (TREE_TYPE (decl
)))
8630 TREE_USED (decl
) = 1;
8631 finish_decl (decl
, init
, NULL_TREE
);
8634 innermost_code
= TREE_CODE (decl
);
8635 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8636 ctype
= current_class_type
;
8638 && TREE_OPERAND (decl
, 0)
8639 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
8640 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
8641 == constructor_name_full (ctype
))
8642 || (DECL_NAME (TREE_OPERAND (decl
, 0))
8643 == constructor_name (ctype
)))))
8644 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8645 next
= &TREE_OPERAND (decl
, 0);
8647 if (ctype
!= NULL_TREE
8648 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
8649 && decl
== constructor_name (ctype
))
8651 return_type
= return_ctor
;
8652 ctor_return_type
= ctype
;
8657 case TEMPLATE_ID_EXPR
:
8659 tree fns
= TREE_OPERAND (decl
, 0);
8661 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
8662 fns
= TREE_OPERAND (fns
, 0);
8664 if (TREE_CODE (fns
) == IDENTIFIER_NODE
)
8666 else if (is_overloaded_fn (fns
))
8667 dname
= DECL_NAME (get_first_fn (fns
));
8669 my_friendly_abort (0);
8673 case IDENTIFIER_NODE
:
8674 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
8681 cp_error ("declarator-id missing; using reserved word `%D'",
8683 name
= IDENTIFIER_POINTER (dname
);
8685 if (! IDENTIFIER_OPNAME_P (dname
)
8686 /* GNU/Linux headers use '__op'. Arrgh. */
8687 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
8688 name
= IDENTIFIER_POINTER (dname
);
8691 if (IDENTIFIER_TYPENAME_P (dname
))
8693 my_friendly_assert (flags
== NO_SPECIAL
, 154);
8694 flags
= TYPENAME_FLAG
;
8695 ctor_return_type
= TREE_TYPE (dname
);
8696 return_type
= return_conversion
;
8698 name
= operator_name_string (dname
);
8705 /* Perform error checking, and decide on a ctype. */
8706 tree cname
= TREE_OPERAND (decl
, 0);
8707 if (cname
== NULL_TREE
)
8709 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
8712 in_namespace
= TREE_OPERAND (decl
, 0);
8713 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8715 else if (! is_aggr_type (cname
, 1))
8716 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8717 /* Must test TREE_OPERAND (decl, 1), in case user gives
8718 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
8719 else if (TREE_OPERAND (decl
, 1)
8720 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
8722 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
8723 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
8725 cp_error ("`%T::%D' is not a valid declarator", cname
,
8726 TREE_OPERAND (decl
, 1));
8727 cp_error (" perhaps you want `typename %T::%D' to make it a type",
8728 cname
, TREE_OPERAND (decl
, 1));
8729 return void_type_node
;
8731 else if (ctype
== NULL_TREE
)
8733 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
8734 TREE_OPERAND (decl
, 0) = ctype
;
8737 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
8739 cp_error ("type `%T' is not derived from type `%T'",
8741 TREE_OPERAND (decl
, 0) = NULL_TREE
;
8747 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
8748 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
8749 == constructor_name_full (ctype
))
8750 || (DECL_NAME (TREE_OPERAND (decl
, 1))
8751 == constructor_name (ctype
))))
8752 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
8753 next
= &TREE_OPERAND (decl
, 1);
8757 if (TREE_CODE (decl
) == IDENTIFIER_NODE
8758 && constructor_name (ctype
) == decl
)
8760 return_type
= return_ctor
;
8761 ctor_return_type
= ctype
;
8763 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
8764 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
8765 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
8766 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
8768 return_type
= return_dtor
;
8769 ctor_return_type
= ctype
;
8771 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8772 next
= &TREE_OPERAND (decl
, 0);
8783 /* Parse error puts this typespec where
8784 a declarator should go. */
8785 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
8786 if (TREE_TYPE (decl
) == current_class_type
)
8787 cp_error (" perhaps you want `%T' for a constructor",
8788 current_class_name
);
8789 dname
= DECL_NAME (decl
);
8790 name
= IDENTIFIER_POINTER (dname
);
8792 /* Avoid giving two errors for this. */
8793 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
8795 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
8802 cp_compiler_error ("`%D' as declarator", decl
);
8803 return 0; /* We used to do a 155 abort here. */
8810 /* A function definition's declarator must have the form of
8811 a function declarator. */
8813 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
8816 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
8817 && innermost_code
!= CALL_EXPR
8818 && ! (ctype
&& declspecs
== NULL_TREE
))
8820 cp_error ("declaration of `%D' as non-function", dname
);
8821 return void_type_node
;
8824 /* Anything declared one level down from the top level
8825 must be one of the parameters of a function
8826 (because the body is at least two levels down). */
8828 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
8829 by not allowing C++ class definitions to specify their parameters
8830 with xdecls (must be spec.d in the parmlist).
8832 Since we now wait to push a class scope until we are sure that
8833 we are in a legitimate method context, we must set oldcname
8834 explicitly (since current_class_name is not yet alive).
8836 We also want to avoid calling this a PARM if it is in a namespace. */
8838 if (decl_context
== NORMAL
&& ! namespace_bindings_p ()
8839 && ! pseudo_global_level_p ())
8841 struct binding_level
*b
= current_binding_level
;
8842 current_binding_level
= b
->level_chain
;
8843 if (current_binding_level
!= 0 && toplevel_bindings_p ())
8844 decl_context
= PARM
;
8845 current_binding_level
= b
;
8848 /* Look through the decl specs and record which ones appear.
8849 Some typespecs are defined as built-in typenames.
8850 Others, the ones that are modifiers of other types,
8851 are represented by bits in SPECBITS: set the bits for
8852 the modifiers that appear. Storage class keywords are also in SPECBITS.
8854 If there is a typedef name or a type, store the type in TYPE.
8855 This includes builtin typedefs such as `int'.
8857 Set EXPLICIT_INT if the type is `int' or `char' and did not
8858 come from a user typedef.
8860 Set LONGLONG if `long' is mentioned twice.
8862 For C++, constructors and destructors have their own fast treatment. */
8864 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
8869 /* Certain parse errors slip through. For example,
8870 `int class;' is not caught by the parser. Try
8871 weakly to recover here. */
8872 if (TREE_CODE (spec
) != TREE_LIST
)
8875 id
= TREE_VALUE (spec
);
8877 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
8879 if (id
== ridpointers
[(int) RID_INT
]
8880 || id
== ridpointers
[(int) RID_CHAR
]
8881 || id
== ridpointers
[(int) RID_BOOL
]
8882 || id
== ridpointers
[(int) RID_WCHAR
])
8886 if (id
== ridpointers
[(int) RID_BOOL
])
8887 error ("`bool' is now a keyword");
8889 cp_error ("extraneous `%T' ignored", id
);
8893 if (id
== ridpointers
[(int) RID_INT
])
8895 else if (id
== ridpointers
[(int) RID_CHAR
])
8897 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
8901 /* C++ aggregate types. */
8902 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
8905 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
8907 type
= IDENTIFIER_TYPE_VALUE (id
);
8911 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
8913 if (ridpointers
[i
] == id
)
8915 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
8917 if (pedantic
&& ! in_system_header
&& warn_long_long
)
8918 pedwarn ("ANSI C++ does not support `long long'");
8920 error ("`long long long' is too long for GCC");
8924 else if (RIDBIT_SETP (i
, specbits
))
8925 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
8926 RIDBIT_SET (i
, specbits
);
8931 /* C++ aggregate types. */
8932 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
8935 cp_error ("multiple declarations `%T' and `%T'", type
,
8939 type
= TREE_TYPE (id
);
8940 TREE_VALUE (spec
) = type
;
8945 error ("two or more data types in declaration of `%s'", name
);
8946 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
8948 register tree t
= lookup_name (id
, 1);
8949 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
8950 error ("`%s' fails to be a typedef or built in type",
8951 IDENTIFIER_POINTER (id
));
8954 type
= TREE_TYPE (t
);
8956 /* See the code below that used this. */
8957 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
8962 else if (id
!= error_mark_node
)
8963 /* Can't change CLASS nodes into RECORD nodes here! */
8969 typedef_type
= type
;
8971 /* No type at all: default to `int', and set DEFAULTED_INT
8972 because it was not a user-defined typedef.
8973 Except when we have a `typedef' inside a signature, in
8974 which case the type defaults to `unknown type' and is
8975 instantiated when assigning to a signature pointer or ref. */
8977 if (type
== NULL_TREE
8978 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
8979 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
8980 || RIDBIT_SETP (RID_LONG
, specbits
)
8981 || RIDBIT_SETP (RID_SHORT
, specbits
)))
8983 /* These imply 'int'. */
8984 type
= integer_type_node
;
8988 if (type
== NULL_TREE
)
8991 if (return_type
== return_dtor
)
8992 type
= void_type_node
;
8993 else if (return_type
== return_ctor
)
8994 type
= build_pointer_type (ctor_return_type
);
8995 else if (return_type
== return_conversion
)
8996 type
= ctor_return_type
;
8997 else if (current_class_type
8998 && IS_SIGNATURE (current_class_type
)
8999 && RIDBIT_SETP (RID_TYPEDEF
, specbits
)
9000 && (decl_context
== FIELD
|| decl_context
== NORMAL
))
9004 type
= copy_node (opaque_type_node
);
9010 if (warn_return_type
9011 && return_type
== return_normal
)
9012 /* Save warning until we know what is really going on. */
9013 warn_about_return_type
= 1;
9015 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9016 pedwarn ("ANSI C++ forbids typedef which does not specify a type");
9017 else if (innermost_code
!= CALL_EXPR
|| pedantic
9018 || (warn_return_type
&& return_type
== return_normal
))
9020 if (innermost_code
== CALL_EXPR
)
9021 cp_pedwarn ("return-type of `%D' defaults to `int'", dname
);
9023 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9026 type
= integer_type_node
;
9029 else if (return_type
== return_dtor
)
9031 error ("return type specification for destructor invalid");
9032 type
= void_type_node
;
9034 else if (return_type
== return_ctor
)
9036 error ("return type specification for constructor invalid");
9037 type
= build_pointer_type (ctor_return_type
);
9039 else if (return_type
== return_conversion
)
9041 if (comptypes (type
, ctor_return_type
, 1) == 0)
9042 cp_error ("operator `%T' declared to return `%T'",
9043 ctor_return_type
, type
);
9045 cp_pedwarn ("return type specified for `operator %T'",
9048 type
= ctor_return_type
;
9053 /* Now process the modifiers that were specified
9054 and check for invalid combinations. */
9056 /* Long double is a special combination. */
9058 if (RIDBIT_SETP (RID_LONG
, specbits
)
9059 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9061 RIDBIT_RESET (RID_LONG
, specbits
);
9062 type
= build_type_variant (long_double_type_node
, TYPE_READONLY (type
),
9063 TYPE_VOLATILE (type
));
9066 /* Check all other uses of type modifiers. */
9068 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9069 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9070 || RIDBIT_SETP (RID_LONG
, specbits
)
9071 || RIDBIT_SETP (RID_SHORT
, specbits
))
9075 if (TREE_CODE (type
) == REAL_TYPE
)
9076 error ("short, signed or unsigned invalid for `%s'", name
);
9077 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9078 error ("long, short, signed or unsigned invalid for `%s'", name
);
9079 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9080 && RIDBIT_SETP (RID_SHORT
, specbits
))
9081 error ("long and short specified together for `%s'", name
);
9082 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9083 || RIDBIT_SETP (RID_SHORT
, specbits
))
9085 error ("long or short specified with char for `%s'", name
);
9086 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9087 || RIDBIT_SETP (RID_SHORT
, specbits
))
9088 && TREE_CODE (type
) == REAL_TYPE
)
9089 error ("long or short specified with floating type for `%s'", name
);
9090 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9091 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9092 error ("signed and unsigned given together for `%s'", name
);
9096 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9098 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9100 if (flag_pedantic_errors
)
9105 /* Discard the type modifiers if they are invalid. */
9108 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9109 RIDBIT_RESET (RID_SIGNED
, specbits
);
9110 RIDBIT_RESET (RID_LONG
, specbits
);
9111 RIDBIT_RESET (RID_SHORT
, specbits
);
9116 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9117 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9119 error ("complex invalid for `%s'", name
);
9120 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9123 /* Decide whether an integer type is signed or not.
9124 Optionally treat bitfields as signed by default. */
9125 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9126 || (bitfield
&& ! flag_signed_bitfields
9127 && (explicit_int
|| defaulted_int
|| explicit_char
9128 /* A typedef for plain `int' without `signed'
9129 can be controlled just like plain `int'. */
9130 || ! (typedef_decl
!= NULL_TREE
9131 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
9132 && TREE_CODE (type
) != ENUMERAL_TYPE
9133 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)))
9136 type
= long_long_unsigned_type_node
;
9137 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9138 type
= long_unsigned_type_node
;
9139 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9140 type
= short_unsigned_type_node
;
9141 else if (type
== char_type_node
)
9142 type
= unsigned_char_type_node
;
9143 else if (typedef_decl
)
9144 type
= unsigned_type (type
);
9146 type
= unsigned_type_node
;
9148 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9149 && type
== char_type_node
)
9150 type
= signed_char_type_node
;
9152 type
= long_long_integer_type_node
;
9153 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9154 type
= long_integer_type_node
;
9155 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9156 type
= short_integer_type_node
;
9158 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9160 /* If we just have "complex", it is equivalent to
9161 "complex double", but if any modifiers at all are specified it is
9162 the complex form of TYPE. E.g, "complex short" is
9163 "complex short int". */
9165 if (defaulted_int
&& ! longlong
9166 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9167 || RIDBIT_SETP (RID_SHORT
, specbits
)
9168 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9169 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9170 type
= complex_double_type_node
;
9171 else if (type
== integer_type_node
)
9172 type
= complex_integer_type_node
;
9173 else if (type
== float_type_node
)
9174 type
= complex_float_type_node
;
9175 else if (type
== double_type_node
)
9176 type
= complex_double_type_node
;
9177 else if (type
== long_double_type_node
)
9178 type
= complex_long_double_type_node
;
9180 type
= build_complex_type (type
);
9183 if (return_type
== return_conversion
9184 && (RIDBIT_SETP (RID_CONST
, specbits
)
9185 || RIDBIT_SETP (RID_VOLATILE
, specbits
)))
9186 cp_error ("`operator %T' cannot be cv-qualified",
9189 /* Set CONSTP if this declaration is `const', whether by
9190 explicit specification or via a typedef.
9191 Likewise for VOLATILEP. */
9193 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + TYPE_READONLY (type
);
9194 volatilep
= !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + TYPE_VOLATILE (type
);
9195 type
= cp_build_type_variant (type
, constp
, volatilep
);
9197 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9198 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9199 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9200 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9201 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9203 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9204 staticp
= 1 + (decl_context
== FIELD
);
9206 if (virtualp
&& staticp
== 2)
9208 cp_error ("member `%D' cannot be declared both virtual and static",
9212 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9213 RIDBIT_RESET (RID_FRIEND
, specbits
);
9215 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9217 if (decl_context
== PARM
)
9219 error ("non-member `%s' cannot be declared `mutable'", name
);
9220 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9222 else if (friendp
|| decl_context
== TYPENAME
)
9224 error ("non-object member `%s' cannot be declared `mutable'", name
);
9225 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9229 /* Warn if two storage classes are given. Default to `auto'. */
9231 if (RIDBIT_ANY_SET (specbits
))
9233 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9234 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9235 if (decl_context
== PARM
&& nclasses
> 0)
9236 error ("storage class specifiers invalid in parameter declarations");
9237 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9239 if (decl_context
== PARM
)
9240 error ("typedef declaration invalid in parameter declaration");
9243 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9244 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9247 /* Give error if `virtual' is used outside of class declaration. */
9249 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9251 error ("virtual outside class declaration");
9254 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9256 error ("only members can be declared mutable");
9257 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9260 /* Static anonymous unions are dealt with here. */
9261 if (staticp
&& decl_context
== TYPENAME
9262 && TREE_CODE (declspecs
) == TREE_LIST
9263 && ANON_UNION_TYPE_P (TREE_VALUE (declspecs
)))
9264 decl_context
= FIELD
;
9266 /* Give error if `const,' `volatile,' `inline,' `friend,' or `virtual'
9267 is used in a signature member function declaration. */
9268 if (decl_context
== FIELD
9269 && IS_SIGNATURE (current_class_type
)
9270 && RIDBIT_NOTSETP (RID_TYPEDEF
, specbits
))
9274 error ("`const' specified for signature member function `%s'", name
);
9279 error ("`volatile' specified for signature member function `%s'",
9285 error ("`inline' specified for signature member function `%s'", name
);
9286 /* Later, we'll make signature member functions inline. */
9291 error ("`friend' declaration in signature definition");
9296 error ("`virtual' specified for signature member function `%s'",
9298 /* Later, we'll make signature member functions virtual. */
9303 /* Warn about storage classes that are invalid for certain
9304 kinds of declarations (parameters, typenames, etc.). */
9307 error ("multiple storage classes in declaration of `%s'", name
);
9308 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9310 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9311 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9312 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9314 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9316 else if (decl_context
== FIELD
9317 && ! IS_SIGNATURE (current_class_type
)
9318 /* C++ allows static class elements */
9319 && RIDBIT_SETP (RID_STATIC
, specbits
))
9320 /* C++ also allows inlines and signed and unsigned elements,
9321 but in those cases we don't come in here. */
9325 if (decl_context
== FIELD
)
9327 tree tmp
= NULL_TREE
;
9328 register int op
= 0;
9332 /* Avoid trying to get an operand off an identifier node. */
9333 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9336 tmp
= TREE_OPERAND (declarator
, 0);
9337 op
= IDENTIFIER_OPNAME_P (tmp
);
9339 error ("storage class specified for %s `%s'",
9340 IS_SIGNATURE (current_class_type
)
9342 ? "signature member operator"
9343 : "signature member function")
9344 : (op
? "member operator" : "field"),
9345 op
? operator_name_string (tmp
) : name
);
9348 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9349 ? "storage class specified for parameter `%s'"
9350 : "storage class specified for typename"), name
);
9351 RIDBIT_RESET (RID_REGISTER
, specbits
);
9352 RIDBIT_RESET (RID_AUTO
, specbits
);
9353 RIDBIT_RESET (RID_EXTERN
, specbits
);
9355 if (decl_context
== FIELD
&& IS_SIGNATURE (current_class_type
))
9357 RIDBIT_RESET (RID_STATIC
, specbits
);
9362 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9364 if (toplevel_bindings_p ())
9366 /* It's common practice (and completely valid) to have a const
9367 be initialized and declared extern. */
9369 warning ("`%s' initialized and declared `extern'", name
);
9372 error ("`%s' has both `extern' and initializer", name
);
9374 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9375 && ! toplevel_bindings_p ())
9376 error ("nested function `%s' declared `extern'", name
);
9377 else if (toplevel_bindings_p ())
9379 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9380 error ("top-level declaration of `%s' specifies `auto'", name
);
9383 if (nclasses
> 0 && friendp
)
9384 error ("storage class specifiers invalid in friend function declarations");
9386 /* Now figure out the structure of the declarator proper.
9387 Descend through it, creating more complex types, until we reach
9388 the declared identifier (or NULL_TREE, in an absolute declarator). */
9390 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9391 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9393 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9394 an INDIRECT_REF (for *...),
9395 a CALL_EXPR (for ...(...)),
9396 an identifier (for the name being declared)
9397 or a null pointer (for the place in an absolute declarator
9398 where the name was omitted).
9399 For the last two cases, we have just exited the loop.
9401 For C++ it could also be
9402 a SCOPE_REF (for class :: ...). In this case, we have converted
9403 sensible names to types, and those are the values we use to
9404 qualify the member name.
9405 an ADDR_EXPR (for &...),
9406 a BIT_NOT_EXPR (for destructors)
9408 At this point, TYPE is the type of elements of an array,
9409 or for a function to return, or for a pointer to point to.
9410 After this sequence of ifs, TYPE is the type of the
9411 array or function or pointer, and DECLARATOR has had its
9412 outermost layer removed. */
9414 if (type
== error_mark_node
)
9416 if (TREE_CODE (declarator
) == SCOPE_REF
)
9417 declarator
= TREE_OPERAND (declarator
, 1);
9419 declarator
= TREE_OPERAND (declarator
, 0);
9422 if (quals
!= NULL_TREE
9423 && (declarator
== NULL_TREE
9424 || TREE_CODE (declarator
) != SCOPE_REF
))
9426 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9427 ctype
= TYPE_METHOD_BASETYPE (type
);
9428 if (ctype
!= NULL_TREE
)
9430 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9431 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9432 type
= TREE_TYPE (dummy
);
9436 switch (TREE_CODE (declarator
))
9440 register tree itype
= NULL_TREE
;
9441 register tree size
= TREE_OPERAND (declarator
, 1);
9442 /* The index is a signed object `sizetype' bits wide. */
9443 tree index_type
= signed_type (sizetype
);
9445 declarator
= TREE_OPERAND (declarator
, 0);
9447 /* Check for some types that there cannot be arrays of. */
9449 if (TREE_CODE (type
) == VOID_TYPE
)
9451 cp_error ("declaration of `%D' as array of voids", dname
);
9452 type
= error_mark_node
;
9455 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9457 cp_error ("declaration of `%D' as array of functions", dname
);
9458 type
= error_mark_node
;
9461 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9462 you can't have arrays of references. If we allowed them,
9463 then we'd be saying x[i] is valid for an array x, but
9464 then you'd have to ask: what does `*(x + i)' mean? */
9465 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9467 if (decl_context
== TYPENAME
)
9468 cp_error ("cannot make arrays of references");
9470 cp_error ("declaration of `%D' as array of references",
9472 type
= error_mark_node
;
9475 if (TREE_CODE (type
) == OFFSET_TYPE
)
9477 cp_error ("declaration of `%D' as array of data members",
9479 type
= error_mark_node
;
9482 if (TREE_CODE (type
) == METHOD_TYPE
)
9484 cp_error ("declaration of `%D' as array of function members",
9486 type
= error_mark_node
;
9489 if (size
== error_mark_node
)
9490 type
= error_mark_node
;
9492 if (type
== error_mark_node
)
9497 /* Must suspend_momentary here because the index
9498 type may need to live until the end of the function.
9499 For example, it is used in the declaration of a
9500 variable which requires destructing at the end of
9501 the function; then build_vec_delete will need this
9503 int yes
= suspend_momentary ();
9504 /* Might be a cast. */
9505 if (TREE_CODE (size
) == NOP_EXPR
9506 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9507 size
= TREE_OPERAND (size
, 0);
9509 /* If this involves a template parameter, it'll be
9510 constant, but we don't know what the value is yet. */
9511 if (processing_template_decl
)
9513 itype
= make_node (INTEGER_TYPE
);
9514 TYPE_MIN_VALUE (itype
) = size_zero_node
;
9515 TYPE_MAX_VALUE (itype
) = build_min
9516 (MINUS_EXPR
, sizetype
, size
, integer_one_node
);
9517 goto dont_grok_size
;
9520 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9521 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
)
9523 cp_error ("size of array `%D' has non-integer type",
9525 size
= integer_one_node
;
9527 if (TREE_READONLY_DECL_P (size
))
9528 size
= decl_constant_value (size
);
9529 if (pedantic
&& integer_zerop (size
))
9530 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9531 if (TREE_CONSTANT (size
))
9533 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9534 int old_pedantic
= pedantic
;
9535 pedantic
= flag_pedantic_errors
= 1;
9536 /* Always give overflow errors on array subscripts. */
9537 constant_expression_warning (size
);
9538 pedantic
= old_pedantic
;
9539 flag_pedantic_errors
= old_flag_pedantic_errors
;
9540 if (INT_CST_LT (size
, integer_zero_node
))
9542 cp_error ("size of array `%D' is negative", dname
);
9543 size
= integer_one_node
;
9551 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9554 cp_pedwarn ("ANSI C++ forbids variable-size array");
9559 = fold (build_binary_op (MINUS_EXPR
,
9560 cp_convert (index_type
, size
),
9561 cp_convert (index_type
,
9562 integer_one_node
), 1));
9563 if (! TREE_CONSTANT (itype
))
9564 itype
= variable_size (itype
);
9565 else if (TREE_OVERFLOW (itype
))
9567 error ("overflow in array dimension");
9568 TREE_OVERFLOW (itype
) = 0;
9571 /* If we're a parm, we need to have a permanent type so
9572 mangling checks for re-use will work right. If both the
9573 element and index types are permanent, the array type
9575 if (decl_context
== PARM
9576 && allocation_temporary_p () && TREE_PERMANENT (type
))
9578 push_obstacks (&permanent_obstack
, &permanent_obstack
);
9579 itype
= build_index_type (itype
);
9583 itype
= build_index_type (itype
);
9586 resume_momentary (yes
);
9589 type
= build_cplus_array_type (type
, itype
);
9598 tree inner_parms
= TREE_OPERAND (declarator
, 1);
9599 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9601 /* Declaring a function type.
9602 Make sure we have a valid type for the function to return. */
9604 /* We now know that constp and volatilep don't apply to the
9605 decl, but to its return type. */
9606 constp
= volatilep
= 0;
9608 /* Warn about some types functions can't return. */
9610 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9612 error ("`%s' declared as function returning a function", name
);
9613 type
= integer_type_node
;
9615 if (TREE_CODE (type
) == ARRAY_TYPE
)
9617 error ("`%s' declared as function returning an array", name
);
9618 type
= integer_type_node
;
9621 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9622 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9624 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9627 /* Pick up type qualifiers which should be applied to `this'. */
9628 quals
= TREE_OPERAND (declarator
, 2);
9630 /* Pick up the exception specifications. */
9631 raises
= TREE_TYPE (declarator
);
9633 /* Say it's a definition only for the CALL_EXPR
9634 closest to the identifier. */
9637 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9638 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9639 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9641 if (ctype
== NULL_TREE
9642 && decl_context
== FIELD
9644 && (friendp
== 0 || dname
== current_class_name
))
9645 ctype
= current_class_type
;
9647 if (ctype
&& return_type
== return_conversion
)
9648 TYPE_HAS_CONVERSION (ctype
) = 1;
9649 if (ctype
&& constructor_name (ctype
) == dname
)
9651 /* We are within a class's scope. If our declarator name
9652 is the same as the class name, and we are defining
9653 a function, then it is a constructor/destructor, and
9654 therefore returns a void type. */
9656 if (flags
== DTOR_FLAG
)
9658 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9659 not be declared const or volatile. A destructor
9660 may not be static. */
9662 error ("destructor cannot be static member function");
9665 cp_error ("destructors may not be `%s'",
9666 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9669 if (decl_context
== FIELD
)
9671 if (! member_function_or_else (ctype
, current_class_type
,
9672 "destructor for alien class `%s' cannot be a member"))
9673 return void_type_node
;
9676 else /* It's a constructor. */
9680 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
9681 not be declared const or volatile. A constructor may
9682 not be virtual. A constructor may not be static. */
9684 error ("constructor cannot be static member function");
9687 pedwarn ("constructors cannot be declared virtual");
9692 cp_error ("constructors may not be `%s'",
9693 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9697 RID_BIT_TYPE tmp_bits
;
9698 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
9699 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
9700 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
9701 if (RIDBIT_ANY_SET (tmp_bits
))
9702 error ("return value type specifier for constructor ignored");
9704 type
= build_pointer_type (ctype
);
9705 if (decl_context
== FIELD
9706 && IS_SIGNATURE (current_class_type
))
9708 error ("constructor not allowed in signature");
9709 return void_type_node
;
9711 else if (decl_context
== FIELD
)
9713 if (! member_function_or_else (ctype
, current_class_type
,
9714 "constructor for alien class `%s' cannot be member"))
9715 return void_type_node
;
9716 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
9717 if (return_type
!= return_ctor
)
9721 if (decl_context
== FIELD
)
9727 error ("can't initialize friend function `%s'", name
);
9730 /* Cannot be both friend and virtual. */
9731 error ("virtual functions cannot be friends");
9732 RIDBIT_RESET (RID_FRIEND
, specbits
);
9735 if (decl_context
== NORMAL
)
9736 error ("friend declaration not in class definition");
9737 if (current_function_decl
&& funcdef_flag
)
9738 cp_error ("can't define friend function `%s' in a local class definition",
9742 /* Construct the function type and go to the next
9743 inner layer of declarator. */
9745 declarator
= TREE_OPERAND (declarator
, 0);
9747 /* FIXME: This is where default args should be fully
9750 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
9752 if (declarator
&& flags
== DTOR_FLAG
)
9754 /* A destructor declared in the body of a class will
9755 be represented as a BIT_NOT_EXPR. But, we just
9756 want the underlying IDENTIFIER. */
9757 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
9758 declarator
= TREE_OPERAND (declarator
, 0);
9760 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
9761 arg_types
= void_list_node
;
9762 else if (arg_types
== NULL_TREE
9763 || arg_types
!= void_list_node
)
9765 cp_error ("destructors may not have parameters");
9766 arg_types
= void_list_node
;
9767 last_function_parms
= NULL_TREE
;
9771 /* ANSI says that `const int foo ();'
9772 does not make the function foo const. */
9773 type
= build_function_type (type
, arg_types
);
9777 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
9778 if (TREE_PURPOSE (t
)
9779 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
9781 add_defarg_fn (type
);
9790 /* Filter out pointers-to-references and references-to-references.
9791 We can get these if a TYPE_DECL is used. */
9793 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9795 error ("cannot declare %s to references",
9796 TREE_CODE (declarator
) == ADDR_EXPR
9797 ? "references" : "pointers");
9798 declarator
= TREE_OPERAND (declarator
, 0);
9802 if (TREE_CODE (type
) == OFFSET_TYPE
9803 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
9804 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
9806 cp_error ("cannot declare pointer to `%#T' member",
9808 type
= TREE_TYPE (type
);
9811 /* Merge any constancy or volatility into the target type
9814 /* We now know that constp and volatilep don't apply to the
9815 decl, but to the target of the pointer. */
9816 constp
= volatilep
= 0;
9818 if (IS_SIGNATURE (type
))
9820 if (TREE_CODE (declarator
) == ADDR_EXPR
)
9822 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
9823 && TYPE_SIZE (type
))
9824 cp_warning ("empty signature `%T' used in signature reference declaration",
9827 type
= build_signature_reference_type (type
);
9829 sorry ("signature reference");
9835 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
9836 && TYPE_SIZE (type
))
9837 cp_warning ("empty signature `%T' used in signature pointer declaration",
9839 type
= build_signature_pointer_type (type
);
9844 else if (TREE_CODE (declarator
) == ADDR_EXPR
)
9846 if (TREE_CODE (type
) == VOID_TYPE
)
9847 error ("invalid type: `void &'");
9849 type
= build_reference_type (type
);
9851 else if (TREE_CODE (type
) == METHOD_TYPE
)
9853 type
= build_ptrmemfunc_type (build_pointer_type (type
));
9856 type
= build_pointer_type (type
);
9858 /* Process a list of type modifier keywords (such as
9859 const or volatile) that were given inside the `*' or `&'. */
9861 if (TREE_TYPE (declarator
))
9863 register tree typemodlist
;
9865 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
9866 typemodlist
= TREE_CHAIN (typemodlist
))
9868 if (TREE_VALUE (typemodlist
) == ridpointers
[(int) RID_CONST
])
9870 else if (TREE_VALUE (typemodlist
) == ridpointers
[(int) RID_VOLATILE
])
9875 error ("invalid type modifier within %s declarator",
9876 TREE_CODE (declarator
) == ADDR_EXPR
9877 ? "reference" : "pointer");
9881 pedwarn ("duplicate `const'");
9883 pedwarn ("duplicate `volatile'");
9884 if (TREE_CODE (declarator
) == ADDR_EXPR
9885 && (constp
|| volatilep
))
9888 pedwarn ("discarding `const' applied to a reference");
9890 pedwarn ("discarding `volatile' applied to a reference");
9891 constp
= volatilep
= 0;
9893 type
= cp_build_type_variant (type
, constp
, volatilep
);
9895 declarator
= TREE_OPERAND (declarator
, 0);
9901 /* We have converted type names to NULL_TREE if the
9902 name was bogus, or to a _TYPE node, if not.
9904 The variable CTYPE holds the type we will ultimately
9905 resolve to. The code here just needs to build
9906 up appropriate member types. */
9907 tree sname
= TREE_OPERAND (declarator
, 1);
9910 /* Destructors can have their visibilities changed as well. */
9911 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
9912 sname
= TREE_OPERAND (sname
, 0);
9914 if (TREE_COMPLEXITY (declarator
) == 0)
9915 /* This needs to be here, in case we are called
9916 multiple times. */ ;
9917 else if (TREE_COMPLEXITY (declarator
) == -1)
9918 /* Namespace member. */
9919 pop_decl_namespace ();
9920 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
9921 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
9922 else if (! IS_AGGR_TYPE_CODE
9923 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
9925 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
9927 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
9928 that refer to ctype. They couldn't be resolved earlier
9929 because we hadn't pushed into the class yet.
9930 Example: resolve 'B<T>::type' in
9931 'B<typename B<T>::type> B<T>::f () { }'. */
9932 if (current_template_parms
9933 && uses_template_parms (type
)
9934 && uses_template_parms (current_class_type
))
9936 tree args
= current_template_args ();
9937 type
= tsubst (type
, args
, NULL_TREE
);
9940 /* This pop_nested_class corresponds to the
9941 push_nested_class used to push into class scope for
9942 parsing the argument list of a function decl, in
9944 pop_nested_class (1);
9945 TREE_COMPLEXITY (declarator
) = current_class_depth
;
9948 my_friendly_abort (16);
9950 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
9952 /* We had a reference to a global decl, or
9953 perhaps we were given a non-aggregate typedef,
9954 in which case we cleared this out, and should just
9955 keep going as though it wasn't there. */
9959 ctype
= TREE_OPERAND (declarator
, 0);
9962 while (t
!= NULL_TREE
)
9964 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
9965 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9966 template_count
+= 1;
9967 t
= TYPE_MAIN_DECL (t
);
9968 if (DECL_LANG_SPECIFIC (t
))
9969 t
= DECL_CLASS_CONTEXT (t
);
9974 if (sname
== NULL_TREE
)
9977 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
9979 /* This is the `standard' use of the scoping operator:
9980 basetype :: member . */
9982 if (ctype
== current_class_type
)
9988 Is this ill-formed? */
9991 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
9994 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9996 if (current_class_type
== NULL_TREE
9998 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
9999 TYPE_ARG_TYPES (type
));
10002 cp_error ("cannot declare member function `%T::%s' within `%T'",
10003 ctype
, name
, current_class_type
);
10004 return void_type_node
;
10007 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10008 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10010 /* Have to move this code elsewhere in this function.
10011 this code is used for i.e., typedef int A::M; M *pm;
10013 It is? How? jason 10/2/94 */
10015 if (current_class_type
)
10017 cp_error ("cannot declare member `%T::%s' within `%T'",
10018 ctype
, name
, current_class_type
);
10019 return void_type_node
;
10021 type
= build_offset_type (ctype
, type
);
10023 else if (uses_template_parms (ctype
))
10025 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10027 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10028 TYPE_ARG_TYPES (type
));
10032 cp_error ("structure `%T' not yet defined", ctype
);
10033 return error_mark_node
;
10036 declarator
= sname
;
10038 else if (TREE_CODE (sname
) == SCOPE_REF
)
10039 my_friendly_abort (17);
10043 declarator
= TREE_OPERAND (declarator
, 1);
10044 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10045 /* In this case, we will deal with it later. */
10049 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10050 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10051 TYPE_ARG_TYPES (type
));
10053 type
= build_offset_type (ctype
, type
);
10060 declarator
= TREE_OPERAND (declarator
, 0);
10065 case ENUMERAL_TYPE
:
10066 declarator
= NULL_TREE
;
10070 declarator
= NULL_TREE
;
10074 my_friendly_abort (158);
10078 if (explicitp
== 1)
10080 error ("only constructors can be declared `explicit'");
10084 /* Now TYPE has the actual type. */
10086 /* If this is declaring a typedef name, return a TYPE_DECL. */
10088 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10092 error ("const `%s' cannot be declared `mutable'", name
);
10093 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10097 error ("static `%s' cannot be declared `mutable'", name
);
10098 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10102 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10106 /* Note that the grammar rejects storage classes
10107 in typenames, fields or parameters. */
10108 if (current_lang_name
== lang_name_java
)
10109 TYPE_FOR_JAVA (type
) = 1;
10111 if (decl_context
== FIELD
)
10113 if (declarator
== current_class_name
)
10114 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10116 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10117 if (IS_SIGNATURE (current_class_type
) && opaque_typedef
)
10118 SIGNATURE_HAS_OPAQUE_TYPEDECLS (current_class_type
) = 1;
10122 /* Make sure this typedef lives as long as its type,
10123 since it might be used as a template parameter. */
10124 if (type
!= error_mark_node
)
10125 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10126 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10127 if (type
!= error_mark_node
)
10131 /* If the user declares "struct {...} foo" then `foo' will have
10132 an anonymous name. Fill that name in now. Nothing can
10133 refer to it, so nothing needs know about the name change.
10134 The TYPE_NAME field was filled in by build_struct_xref. */
10135 if (type
!= error_mark_node
10136 && TYPE_NAME (type
)
10137 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10138 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
)))
10140 /* FIXME: This is bogus; we should not be doing this for
10141 cv-qualified types. */
10143 /* For anonymous structs that are cv-qualified, need to use
10144 TYPE_MAIN_VARIANT so that name will mangle correctly. As
10145 type not referenced after this block, don't bother
10146 resetting type to original type, ie. TREE_TYPE (decl). */
10147 type
= TYPE_MAIN_VARIANT (type
);
10149 /* Replace the anonymous name with the real name everywhere. */
10150 lookup_tag_reverse (type
, declarator
);
10151 TYPE_NAME (type
) = decl
;
10153 if (TYPE_LANG_SPECIFIC (type
))
10154 TYPE_WAS_ANONYMOUS (type
) = 1;
10156 /* XXX Temporarily set the scope.
10157 When returning, start_decl expects it as NULL_TREE,
10158 and will then then set it using pushdecl. */
10159 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10160 if (current_class_type
)
10161 DECL_CONTEXT (decl
) = current_class_type
;
10163 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10165 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10166 DECL_ASSEMBLER_NAME (decl
)
10167 = get_identifier (build_overload_name (type
, 1, 1));
10168 DECL_CONTEXT (decl
) = NULL_TREE
;
10170 /* FIXME remangle member functions; member functions of a
10171 type with external linkage have external linkage. */
10174 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10176 cp_error_at ("typedef name may not be class-qualified", decl
);
10181 if (ctype
== NULL_TREE
)
10183 if (TREE_CODE (type
) != METHOD_TYPE
)
10184 cp_error_at ("invalid type qualifier for non-method type", decl
);
10186 ctype
= TYPE_METHOD_BASETYPE (type
);
10188 if (ctype
!= NULL_TREE
)
10189 grok_method_quals (ctype
, decl
, quals
);
10192 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10193 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10194 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10196 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10197 error ("non-object member `%s' cannot be declared mutable", name
);
10199 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10200 inlinep
, friendp
, raises
!= NULL_TREE
);
10203 error ("typedef declaration includes an initializer");
10208 /* Detect the case of an array type of unspecified size
10209 which came, as such, direct from a typedef name.
10210 We must copy the type, so that each identifier gets
10211 a distinct type, so that each identifier's size can be
10212 controlled separately by its own initializer. */
10214 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10215 && TYPE_DOMAIN (type
) == NULL_TREE
)
10217 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10220 /* If this is a type name (such as, in a cast or sizeof),
10221 compute the type and return it now. */
10223 if (decl_context
== TYPENAME
)
10225 /* Note that the grammar rejects storage classes
10226 in typenames, fields or parameters. */
10227 if (constp
|| volatilep
)
10229 if (IS_SIGNATURE (type
))
10230 error ("`const' or `volatile' specified with signature type");
10233 /* Special case: "friend class foo" looks like a TYPENAME context. */
10238 cp_error ("`volatile' specified for friend class declaration");
10243 cp_error ("`inline' specified for friend class declaration");
10247 /* Only try to do this stuff if we didn't already give up. */
10248 if (type
!= integer_type_node
)
10250 /* A friendly class? */
10251 if (current_class_type
)
10252 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10254 error ("trying to make class `%s' a friend of global scope",
10255 TYPE_NAME_STRING (type
));
10256 type
= void_type_node
;
10261 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10262 if (ctype
== NULL_TREE
)
10264 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10265 ctype
= TYPE_METHOD_BASETYPE (type
);
10267 grok_method_quals (ctype
, dummy
, quals
);
10268 type
= TREE_TYPE (dummy
);
10273 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10274 && decl_context
!= CATCHPARM
10275 && TREE_CODE (type
) != UNION_TYPE
10278 cp_error ("abstract declarator `%T' used as declaration", type
);
10279 declarator
= make_anon_name ();
10282 /* `void' at top level (not within pointer)
10283 is allowed only in typedefs or type names.
10284 We don't complain about parms either, but that is because
10285 a better error message can be made later. */
10287 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10290 error ("unnamed variable or field declared void");
10291 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10293 if (IDENTIFIER_OPNAME_P (declarator
))
10294 my_friendly_abort (356);
10296 error ("variable or field `%s' declared void", name
);
10299 error ("variable or field declared void");
10300 type
= integer_type_node
;
10303 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10304 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10306 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10308 if (ctype
|| in_namespace
)
10309 error ("cannot use `::' in parameter declaration");
10311 /* A parameter declared as an array of T is really a pointer to T.
10312 One declared as a function is really a pointer to a function.
10313 One declared as a member is really a pointer to member. */
10315 if (TREE_CODE (type
) == ARRAY_TYPE
)
10317 /* Transfer const-ness of array into that of type pointed to. */
10318 type
= build_pointer_type (TREE_TYPE (type
));
10319 volatilep
= constp
= 0;
10321 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10322 type
= build_pointer_type (type
);
10323 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10324 type
= build_pointer_type (type
);
10325 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10327 error ("declaration of `%s' as void", name
);
10333 register tree decl
;
10335 if (decl_context
== PARM
)
10337 decl
= build_decl (PARM_DECL
, declarator
, complete_type (type
));
10339 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10340 inlinep
, friendp
, raises
!= NULL_TREE
);
10341 if (current_class_type
10342 && IS_SIGNATURE (current_class_type
))
10345 error ("parameter of signature member function declared `inline'");
10346 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10347 error ("parameter of signature member function declared `auto'");
10348 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10349 error ("parameter of signature member function declared `register'");
10352 /* Compute the type actually passed in the parmlist,
10353 for the case where there is no prototype.
10354 (For example, shorts and chars are passed as ints.)
10355 When there is a prototype, this is overridden later. */
10357 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10359 else if (decl_context
== FIELD
)
10361 if (type
== error_mark_node
)
10363 /* Happens when declaring arrays of sizes which
10364 are error_mark_node, for example. */
10367 else if (in_namespace
)
10369 /* Something like struct S { int N::j; }; */
10370 cp_error ("invalid use of `::'");
10373 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10376 tree function_context
;
10378 /* We catch the others as conflicts with the builtin
10380 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10382 cp_error ("function `%D' cannot be declared friend",
10389 if (ctype
== NULL_TREE
)
10390 ctype
= current_class_type
;
10392 if (ctype
== NULL_TREE
)
10394 cp_error ("can't make `%D' into a method -- not in a class",
10396 return void_type_node
;
10399 /* ``A union may [ ... ] not [ have ] virtual functions.''
10401 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10403 cp_error ("function `%D' declared virtual inside a union",
10405 return void_type_node
;
10408 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10409 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10410 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10411 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10415 cp_error ("`%D' cannot be declared virtual, since it is always static",
10420 else if (staticp
< 2)
10421 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10422 TYPE_ARG_TYPES (type
));
10425 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10426 function_context
= (ctype
!= NULL_TREE
) ?
10427 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10428 publicp
= (! friendp
|| ! staticp
)
10429 && function_context
== NULL_TREE
;
10430 decl
= grokfndecl (ctype
, type
,
10431 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10432 ? declarator
: dname
,
10434 virtualp
, flags
, quals
, raises
, attrlist
,
10435 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10436 funcdef_flag
, template_count
, in_namespace
);
10437 if (decl
== NULL_TREE
|| decl
== error_mark_node
)
10440 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10441 /* The decl and setting of decl_machine_attr is also turned off. */
10442 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10445 if (explicitp
== 2)
10446 DECL_NONCONVERTING_P (decl
) = 1;
10448 else if (TREE_CODE (type
) == METHOD_TYPE
)
10450 /* We only get here for friend declarations of
10451 members of other classes. */
10452 /* All method decls are public, so tell grokfndecl to set
10453 TREE_PUBLIC, also. */
10454 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10455 virtualp
, flags
, quals
, raises
, attrlist
,
10456 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10457 template_count
, in_namespace
);
10458 if (decl
== NULL_TREE
)
10461 else if (!staticp
&& ! processing_template_decl
10462 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10463 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10466 cp_error ("field `%D' has incomplete type", declarator
);
10468 cp_error ("name `%T' has incomplete type", type
);
10470 /* If we're instantiating a template, tell them which
10471 instantiation made the field's type be incomplete. */
10472 if (current_class_type
10473 && TYPE_NAME (current_class_type
)
10474 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10475 && declspecs
&& TREE_VALUE (declspecs
)
10476 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10477 cp_error (" in instantiation of template `%T'",
10478 current_class_type
);
10480 type
= error_mark_node
;
10487 error ("`%s' is neither function nor method; cannot be declared friend",
10488 IDENTIFIER_POINTER (declarator
));
10496 /* Friends are treated specially. */
10497 if (ctype
== current_class_type
)
10498 warning ("member functions are implicitly friends of their class");
10501 tree t
= NULL_TREE
;
10502 if (decl
&& DECL_NAME (decl
))
10504 if (template_class_depth (current_class_type
) == 0)
10507 = check_explicit_specialization
10509 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10510 if (decl
== error_mark_node
)
10511 return error_mark_node
;
10514 t
= do_friend (ctype
, declarator
, decl
,
10515 last_function_parms
, flags
, quals
,
10518 if (t
&& funcdef_flag
)
10521 return void_type_node
;
10525 /* Structure field. It may not be a function, except for C++ */
10527 if (decl
== NULL_TREE
)
10533 /* An attempt is being made to initialize a non-static
10534 member. But, from [class.mem]:
10536 4 A member-declarator can contain a
10537 constant-initializer only if it declares a static
10538 member (_class.static_) of integral or enumeration
10539 type, see _class.static.data_.
10541 This used to be relatively common practice, but
10542 the rest of the compiler does not correctly
10543 handle the initialization unless the member is
10544 static so we make it static below. */
10545 cp_pedwarn ("ANSI C++ forbids initialization of %s `%D'",
10546 constp
? "const member" : "member",
10548 cp_pedwarn ("making `%D' static", declarator
);
10552 /* Motion 10 at San Diego: If a static const integral data
10553 member is initialized with an integral constant
10554 expression, the initializer may appear either in the
10555 declaration (within the class), or in the definition,
10556 but not both. If it appears in the class, the member is
10557 a member constant. The file-scope definition is always
10559 if (CLASS_TYPE_P (type
)
10560 || TREE_CODE (type
) == REFERENCE_TYPE
)
10562 cp_error ("in-class initialization of static data member of non-integral type `%T'",
10564 /* If we just return the declaration, crashes will
10565 sometimes occur. We therefore return
10566 void_type_node, as if this was a friend
10567 declaration, to cause callers to completely
10568 ignore this declaration. */
10569 return void_type_node
;
10572 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
10574 else if (pedantic
&& ! INTEGRAL_TYPE_P (type
)
10575 && !uses_template_parms (type
))
10576 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", declarator
, type
);
10581 /* ANSI C++ Apr '95 wp 9.2 */
10582 if (declarator
== current_class_name
)
10583 cp_pedwarn ("ANSI C++ forbids static member `%D' with same name as enclosing class",
10586 /* C++ allows static class members.
10587 All other work for this is done by grokfield.
10588 This VAR_DCL is built by build_lang_field_decl.
10589 All other VAR_DECLs are built by build_decl. */
10590 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
10591 TREE_STATIC (decl
) = 1;
10592 /* In class context, 'static' means public access. */
10593 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10597 decl
= build_lang_field_decl (FIELD_DECL
, declarator
, type
);
10598 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10600 DECL_MUTABLE_P (decl
) = 1;
10601 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10605 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10606 inlinep
, friendp
, raises
!= NULL_TREE
);
10609 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10611 tree original_name
;
10617 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10618 original_name
= dname
;
10620 original_name
= declarator
;
10622 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10623 error ("storage class `auto' invalid for function `%s'", name
);
10624 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10625 error ("storage class `register' invalid for function `%s'", name
);
10627 /* Function declaration not at top level.
10628 Storage classes other than `extern' are not allowed
10629 and `extern' makes no difference. */
10630 if (! toplevel_bindings_p ()
10631 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10632 || RIDBIT_SETP (RID_INLINE
, specbits
))
10635 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10636 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
10638 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
10641 if (ctype
== NULL_TREE
)
10645 error ("virtual non-class function `%s'", name
);
10649 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
10650 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10651 TYPE_ARG_TYPES (type
));
10653 /* Record presence of `static'. */
10654 publicp
= (ctype
!= NULL_TREE
10655 || RIDBIT_SETP (RID_EXTERN
, specbits
)
10656 || !RIDBIT_SETP (RID_STATIC
, specbits
));
10658 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
10659 virtualp
, flags
, quals
, raises
, attrlist
,
10661 publicp
, inlinep
, funcdef_flag
,
10662 template_count
, in_namespace
);
10663 if (decl
== NULL_TREE
)
10666 /* Among other times, could occur from check_explicit_specialization
10667 returning an error_mark_node. */
10668 if (decl
== error_mark_node
)
10669 return error_mark_node
;
10673 int illegal_static
= 0;
10675 /* Don't allow a static member function in a class, and forbid
10676 declaring main to be static. */
10677 if (TREE_CODE (type
) == METHOD_TYPE
)
10679 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
10680 illegal_static
= 1;
10682 else if (current_function_decl
)
10684 /* FIXME need arm citation */
10685 error ("cannot declare static function inside another function");
10686 illegal_static
= 1;
10689 if (illegal_static
)
10692 RIDBIT_RESET (RID_STATIC
, specbits
);
10698 /* It's a variable. */
10700 /* An uninitialized decl with `extern' is a reference. */
10701 decl
= grokvardecl (type
, declarator
, &specbits
,
10702 initialized
, constp
, in_namespace
);
10703 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
10704 inlinep
, friendp
, raises
!= NULL_TREE
);
10708 DECL_CONTEXT (decl
) = ctype
;
10711 cp_pedwarn ("static member `%D' re-declared as static", decl
);
10713 RIDBIT_RESET (RID_STATIC
, specbits
);
10715 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
10717 cp_error ("static member `%D' declared `register'", decl
);
10718 RIDBIT_RESET (RID_REGISTER
, specbits
);
10720 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
10722 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
10724 RIDBIT_RESET (RID_EXTERN
, specbits
);
10729 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10731 error ("`%s' cannot be declared mutable", name
);
10734 /* Record `register' declaration for warnings on &
10735 and in case doing stupid register allocation. */
10737 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10738 DECL_REGISTER (decl
) = 1;
10740 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
10741 DECL_THIS_EXTERN (decl
) = 1;
10743 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10744 DECL_THIS_STATIC (decl
) = 1;
10746 /* Record constancy and volatility. */
10749 TREE_READONLY (decl
) = TREE_CODE (type
) != REFERENCE_TYPE
;
10752 TREE_SIDE_EFFECTS (decl
) = 1;
10753 TREE_THIS_VOLATILE (decl
) = 1;
10760 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
10761 An empty exprlist is a parmlist. An exprlist which
10762 contains only identifiers at the global level
10763 is a parmlist. Otherwise, it is an exprlist. */
10766 parmlist_is_exprlist (exprs
)
10769 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
10772 if (toplevel_bindings_p ())
10774 /* At the global level, if these are all identifiers,
10775 then it is a parmlist. */
10778 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
10780 exprs
= TREE_CHAIN (exprs
);
10787 /* Subroutine of `grokparms'. In a fcn definition, arg types must
10790 C++: also subroutine of `start_function'. */
10793 require_complete_types_for_parms (parms
)
10796 if (processing_template_decl
)
10801 tree type
= TREE_TYPE (parms
);
10802 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
10804 if (DECL_NAME (parms
))
10805 error ("parameter `%s' has incomplete type",
10806 IDENTIFIER_POINTER (DECL_NAME (parms
)));
10808 error ("parameter has incomplete type");
10809 TREE_TYPE (parms
) = error_mark_node
;
10812 /* If the arg types are incomplete in a declaration,
10813 they must include undefined tags.
10814 These tags can never be defined in the scope of the declaration,
10815 so the types can never be completed,
10816 and no call can be compiled successfully. */
10817 /* This is not the right behavior for C++, but not having
10818 it is also probably wrong. */
10821 /* Now warn if is a pointer to an incomplete type. */
10822 while (TREE_CODE (type
) == POINTER_TYPE
10823 || TREE_CODE (type
) == REFERENCE_TYPE
)
10824 type
= TREE_TYPE (type
);
10825 type
= TYPE_MAIN_VARIANT (type
);
10826 if (TYPE_SIZE (type
) == NULL_TREE
)
10828 if (DECL_NAME (parm
) != NULL_TREE
)
10829 warning ("parameter `%s' points to incomplete type",
10830 IDENTIFIER_POINTER (DECL_NAME (parm
)));
10832 warning ("parameter points to incomplete type");
10836 parms
= TREE_CHAIN (parms
);
10840 /* Decode the list of parameter types for a function type.
10841 Given the list of things declared inside the parens,
10842 return a list of types.
10844 The list we receive can have three kinds of elements:
10845 an IDENTIFIER_NODE for names given without types,
10846 a TREE_LIST node for arguments given as typespecs or names with typespecs,
10847 or void_type_node, to mark the end of an argument list
10848 when additional arguments are not permitted (... was not used).
10850 FUNCDEF_FLAG is nonzero for a function definition, 0 for
10851 a mere declaration. A nonempty identifier-list gets an error message
10852 when FUNCDEF_FLAG is zero.
10853 If FUNCDEF_FLAG is 1, then parameter types must be complete.
10854 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
10856 If all elements of the input list contain types,
10857 we return a list of the types.
10858 If all elements contain no type (except perhaps a void_type_node
10859 at the end), we return a null list.
10860 If some have types and some do not, it is an error, and we
10861 return a null list.
10863 Also set last_function_parms to either
10864 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
10865 A list of names is converted to a chain of PARM_DECLs
10866 by store_parm_decls so that ultimately it is always a chain of decls.
10868 Note that in C++, parameters can take default values. These default
10869 values are in the TREE_PURPOSE field of the TREE_LIST. It is
10870 an error to specify default values which are followed by parameters
10871 that have no default values, or an ELLIPSES. For simplicities sake,
10872 only parameters which are specified with their types can take on
10876 grokparms (first_parm
, funcdef_flag
)
10880 tree result
= NULL_TREE
;
10881 tree decls
= NULL_TREE
;
10883 if (first_parm
!= NULL_TREE
10884 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
10886 if (! funcdef_flag
)
10887 pedwarn ("parameter names (without types) in function declaration");
10888 last_function_parms
= first_parm
;
10891 else if (first_parm
!= NULL_TREE
10892 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
10893 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
10894 my_friendly_abort (145);
10897 /* Types were specified. This is a list of declarators
10898 each represented as a TREE_LIST node. */
10899 register tree parm
, chain
;
10900 int any_init
= 0, any_error
= 0;
10902 if (first_parm
!= NULL_TREE
)
10904 tree last_result
= NULL_TREE
;
10905 tree last_decl
= NULL_TREE
;
10907 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
10909 tree type
= NULL_TREE
, list_node
= parm
;
10910 register tree decl
= TREE_VALUE (parm
);
10911 tree init
= TREE_PURPOSE (parm
);
10913 chain
= TREE_CHAIN (parm
);
10914 /* @@ weak defense against parse errors. */
10915 if (TREE_CODE (decl
) != VOID_TYPE
10916 && TREE_CODE (decl
) != TREE_LIST
)
10918 /* Give various messages as the need arises. */
10919 if (TREE_CODE (decl
) == STRING_CST
)
10920 cp_error ("invalid string constant `%E'", decl
);
10921 else if (TREE_CODE (decl
) == INTEGER_CST
)
10922 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
10926 if (TREE_CODE (decl
) != VOID_TYPE
)
10928 decl
= grokdeclarator (TREE_VALUE (decl
),
10929 TREE_PURPOSE (decl
),
10930 PARM
, init
!= NULL_TREE
,
10935 /* Top-level qualifiers on the parameters are
10936 ignored for function types. */
10937 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
10939 if (TREE_CODE (type
) == VOID_TYPE
)
10940 decl
= void_type_node
;
10941 else if (TREE_CODE (type
) == METHOD_TYPE
)
10943 if (DECL_NAME (decl
))
10944 /* Cannot use the decl here because
10945 we don't have DECL_CONTEXT set up yet. */
10946 cp_error ("parameter `%D' invalidly declared method type",
10949 error ("parameter invalidly declared method type");
10950 type
= build_pointer_type (type
);
10951 TREE_TYPE (decl
) = type
;
10953 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10955 if (DECL_NAME (decl
))
10956 cp_error ("parameter `%D' invalidly declared offset type",
10959 error ("parameter invalidly declared offset type");
10960 type
= build_pointer_type (type
);
10961 TREE_TYPE (decl
) = type
;
10963 else if (TREE_CODE (type
) == RECORD_TYPE
10964 && TYPE_LANG_SPECIFIC (type
)
10965 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
10967 abstract_virtuals_error (decl
, type
);
10968 any_error
= 1; /* Seems like a good idea. */
10970 else if (TREE_CODE (type
) == RECORD_TYPE
10971 && TYPE_LANG_SPECIFIC (type
)
10972 && IS_SIGNATURE (type
))
10974 signature_error (decl
, type
);
10975 any_error
= 1; /* Seems like a good idea. */
10977 else if (POINTER_TYPE_P (type
))
10980 while (POINTER_TYPE_P (t
)
10981 || (TREE_CODE (t
) == ARRAY_TYPE
10982 && TYPE_DOMAIN (t
) != NULL_TREE
))
10984 if (TREE_CODE (t
) == ARRAY_TYPE
)
10985 cp_error ("parameter type `%T' includes %s to array of unknown bound",
10987 TYPE_PTR_P (type
) ? "pointer" : "reference");
10991 if (TREE_CODE (decl
) == VOID_TYPE
)
10993 if (result
== NULL_TREE
)
10995 result
= void_list_node
;
10996 last_result
= result
;
11000 TREE_CHAIN (last_result
) = void_list_node
;
11001 last_result
= void_list_node
;
11004 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11005 error ("`void' in parameter list must be entire list");
11009 /* Since there is a prototype, args are passed in their own types. */
11010 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11011 #ifdef PROMOTE_PROTOTYPES
11012 if ((TREE_CODE (type
) == INTEGER_TYPE
11013 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11014 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11015 DECL_ARG_TYPE (decl
) = integer_type_node
;
11022 if (TREE_CODE (init
) == SAVE_EXPR
)
11023 PARM_DECL_EXPR (init
) = 1;
11024 else if (processing_template_decl
)
11026 /* Unparsed default arg from in-class decl. */
11027 else if (TREE_CODE (init
) == DEFAULT_ARG
)
11029 else if (TREE_CODE (init
) == VAR_DECL
11030 || TREE_CODE (init
) == PARM_DECL
)
11032 if (IDENTIFIER_LOCAL_VALUE (DECL_NAME (init
)))
11034 /* ``Local variables may not be used in default
11035 argument expressions.'' dpANSI C++ 8.2.6 */
11036 /* If extern int i; within a function is not
11037 considered a local variable, then this code is
11039 cp_error ("local variable `%D' may not be used as a default argument", init
);
11042 else if (TREE_READONLY_DECL_P (init
))
11043 init
= decl_constant_value (init
);
11046 init
= require_instantiated_type (type
, init
, integer_zero_node
);
11047 if (! processing_template_decl
11048 && init
!= error_mark_node
11049 && TREE_CODE (init
) != DEFAULT_ARG
11050 && ! can_convert_arg (type
, TREE_TYPE (init
), init
))
11051 cp_pedwarn ("invalid type `%T' for default argument to `%#D'",
11052 TREE_TYPE (init
), decl
);
11058 if (decls
== NULL_TREE
)
11065 TREE_CHAIN (last_decl
) = decl
;
11068 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11070 TREE_PURPOSE (list_node
) = init
;
11071 TREE_VALUE (list_node
) = type
;
11072 TREE_CHAIN (list_node
) = NULL_TREE
;
11075 list_node
= saveable_tree_cons (init
, type
, NULL_TREE
);
11076 if (result
== NULL_TREE
)
11078 result
= list_node
;
11079 last_result
= result
;
11083 TREE_CHAIN (last_result
) = list_node
;
11084 last_result
= list_node
;
11088 TREE_CHAIN (last_result
) = NULL_TREE
;
11089 /* If there are no parameters, and the function does not end
11090 with `...', then last_decl will be NULL_TREE. */
11091 if (last_decl
!= NULL_TREE
)
11092 TREE_CHAIN (last_decl
) = NULL_TREE
;
11096 last_function_parms
= decls
;
11098 /* In a fcn definition, arg types must be complete. */
11099 if (funcdef_flag
> 0)
11100 require_complete_types_for_parms (last_function_parms
);
11105 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11106 FUNCTION_TYPE with the newly parsed version of its default argument, which
11107 was previously digested as text. See snarf_defarg et al in lex.c. */
11110 replace_defarg (arg
, init
)
11113 if (! processing_template_decl
11114 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11115 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11116 TREE_TYPE (init
), TREE_VALUE (arg
));
11117 TREE_PURPOSE (arg
) = init
;
11124 tree t
= FUNCTION_ARG_CHAIN (d
);
11125 if (DECL_CONSTRUCTOR_P (d
)
11126 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11127 t
= TREE_CHAIN (t
);
11128 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11129 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11130 == DECL_CLASS_CONTEXT (d
))
11131 && (TREE_CHAIN (t
) == NULL_TREE
11132 || TREE_CHAIN (t
) == void_list_node
11133 || TREE_PURPOSE (TREE_CHAIN (t
))))
11138 /* These memoizing functions keep track of special properties which
11139 a class may have. `grok_ctor_properties' notices whether a class
11140 has a constructor of the form X(X&), and also complains
11141 if the class has a constructor of the form X(X).
11142 `grok_op_properties' takes notice of the various forms of
11143 operator= which are defined, as well as what sorts of type conversion
11144 may apply. Both functions take a FUNCTION_DECL as an argument. */
11147 grok_ctor_properties (ctype
, decl
)
11150 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11151 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11153 /* When a type has virtual baseclasses, a magical first int argument is
11154 added to any ctor so we can tell if the class has been initialized
11155 yet. This could screw things up in this function, so we deliberately
11156 ignore the leading int if we're in that situation. */
11157 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11159 my_friendly_assert (parmtypes
11160 && TREE_VALUE (parmtypes
) == integer_type_node
,
11162 parmtypes
= TREE_CHAIN (parmtypes
);
11163 parmtype
= TREE_VALUE (parmtypes
);
11166 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11167 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11168 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11169 || TREE_CHAIN (parmtypes
) == void_list_node
11170 || TREE_PURPOSE (TREE_CHAIN (parmtypes
))))
11172 TYPE_HAS_INIT_REF (ctype
) = 1;
11173 if (TYPE_READONLY (TREE_TYPE (parmtype
)))
11174 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11176 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11177 && TREE_CHAIN (parmtypes
) != NULL_TREE
11178 && TREE_CHAIN (parmtypes
) == void_list_node
)
11180 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11182 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11185 else if (TREE_CODE (parmtype
) == VOID_TYPE
11186 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11187 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11192 /* An operator with this name can be either unary or binary. */
11198 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11199 || name
== ansi_opname
[(int) ADDR_EXPR
]
11200 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11201 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11202 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11203 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11206 /* An operator with this name can only be unary. */
11212 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11213 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11214 || name
== ansi_opname
[(int) COMPONENT_REF
]
11215 || OPERATOR_TYPENAME_P (name
));
11218 /* Do a little sanity-checking on how they declared their operator. */
11221 grok_op_properties (decl
, virtualp
, friendp
)
11223 int virtualp
, friendp
;
11225 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11226 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11227 tree name
= DECL_NAME (decl
);
11229 if (current_class_type
== NULL_TREE
)
11234 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11235 TYPE_HAS_ASSIGNMENT (current_class_type
) = 1;
11236 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11237 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11238 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11239 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11240 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11241 || name
== ansi_opname
[(int) MEMBER_REF
])
11242 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11243 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11244 TYPE_GETS_NEW (current_class_type
) |= 1;
11245 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11246 TYPE_GETS_DELETE (current_class_type
) |= 1;
11247 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11248 TYPE_GETS_NEW (current_class_type
) |= 2;
11249 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11250 TYPE_GETS_DELETE (current_class_type
) |= 2;
11253 if (name
== ansi_opname
[(int) NEW_EXPR
]
11254 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11256 /* When the compiler encounters the definition of A::operator new, it
11257 doesn't look at the class declaration to find out if it's static. */
11259 revert_static_member_fn (&decl
, NULL
, NULL
);
11261 /* Take care of function decl if we had syntax errors. */
11262 if (argtypes
== NULL_TREE
)
11264 = build_function_type (ptr_type_node
,
11265 hash_tree_chain (integer_type_node
,
11268 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11270 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11271 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11274 revert_static_member_fn (&decl
, NULL
, NULL
);
11276 if (argtypes
== NULL_TREE
)
11278 = build_function_type (void_type_node
,
11279 hash_tree_chain (ptr_type_node
,
11283 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11285 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11286 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11287 != void_list_node
))
11288 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11293 /* An operator function must either be a non-static member function
11294 or have at least one parameter of a class, a reference to a class,
11295 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11296 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11298 if (OPERATOR_TYPENAME_P (name
)
11299 || name
== ansi_opname
[(int) CALL_EXPR
]
11300 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11301 || name
== ansi_opname
[(int) COMPONENT_REF
]
11302 || name
== ansi_opname
[(int) ARRAY_REF
])
11303 cp_error ("`%D' must be a nonstatic member function", decl
);
11308 if (DECL_STATIC_FUNCTION_P (decl
))
11309 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11312 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11314 tree arg
= TREE_VALUE (p
);
11315 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11316 arg
= TREE_TYPE (arg
);
11318 /* This lets bad template code slip through. */
11319 if (IS_AGGR_TYPE (arg
)
11320 || TREE_CODE (arg
) == ENUMERAL_TYPE
11321 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11322 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11326 ("`%D' must have an argument of class or enumerated type",
11333 if (name
== ansi_opname
[(int) CALL_EXPR
])
11334 return; /* No restrictions on args. */
11336 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11338 tree t
= TREE_TYPE (name
);
11339 if (TREE_CODE (t
) == VOID_TYPE
)
11340 pedwarn ("void is not a valid type conversion operator");
11341 else if (! friendp
)
11343 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11346 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11348 if (t
== current_class_type
)
11349 what
= "the same type";
11350 /* Don't force t to be complete here. */
11351 else if (IS_AGGR_TYPE (t
)
11353 && DERIVED_FROM_P (t
, current_class_type
))
11354 what
= "a base class";
11357 warning ("conversion to %s%s will never use a type conversion operator",
11358 ref
? "a reference to " : "", what
);
11362 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11366 if (list_length (argtypes
) != 3 && methodp
)
11368 cp_error ("`%D' must take exactly one argument", decl
);
11371 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11373 if (copy_assignment_arg_p (parmtype
, virtualp
)
11376 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11377 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11378 || TYPE_READONLY (TREE_TYPE (parmtype
)))
11379 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11382 else if (name
== ansi_opname
[(int) COND_EXPR
])
11385 pedwarn ("ANSI C++ prohibits overloading operator ?:");
11386 if (list_length (argtypes
) != 4)
11387 cp_error ("`%D' must take exactly three arguments", decl
);
11389 else if (ambi_op_p (name
))
11391 if (list_length (argtypes
) == 2)
11393 else if (list_length (argtypes
) == 3)
11395 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11396 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11397 && ! processing_template_decl
11398 && TREE_VALUE (TREE_CHAIN (argtypes
)) != integer_type_node
)
11401 cp_error ("postfix `%D' must take `int' as its argument",
11405 ("postfix `%D' must take `int' as its second argument",
11412 cp_error ("`%D' must take either zero or one argument", decl
);
11414 cp_error ("`%D' must take either one or two arguments", decl
);
11417 /* More Effective C++ rule 6. */
11419 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11420 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11422 tree arg
= TREE_VALUE (argtypes
);
11423 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11424 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11425 arg
= TREE_TYPE (arg
);
11426 arg
= TYPE_MAIN_VARIANT (arg
);
11427 if (list_length (argtypes
) == 2)
11429 if (TREE_CODE (ret
) != REFERENCE_TYPE
11430 || !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11432 cp_warning ("prefix `%D' should return `%T'", decl
,
11433 build_reference_type (arg
));
11437 if (!comptypes (TYPE_MAIN_VARIANT (ret
), arg
, 1))
11438 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11442 else if (unary_op_p (name
))
11444 if (list_length (argtypes
) != 2)
11447 cp_error ("`%D' must take `void'", decl
);
11449 cp_error ("`%D' must take exactly one argument", decl
);
11452 else /* if (binary_op_p (name)) */
11454 if (list_length (argtypes
) != 3)
11457 cp_error ("`%D' must take exactly one argument", decl
);
11459 cp_error ("`%D' must take exactly two arguments", decl
);
11462 /* More Effective C++ rule 7. */
11464 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11465 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11466 || name
== ansi_opname
[COMPOUND_EXPR
]))
11467 cp_warning ("user-defined `%D' always evaluates both arguments",
11471 /* Effective C++ rule 23. */
11473 && list_length (argtypes
) == 3
11474 && (name
== ansi_opname
[PLUS_EXPR
]
11475 || name
== ansi_opname
[MINUS_EXPR
]
11476 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11477 || name
== ansi_opname
[MULT_EXPR
])
11478 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11479 cp_warning ("`%D' should return by value", decl
);
11483 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11484 if (TREE_PURPOSE (argtypes
))
11486 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11487 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11488 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11491 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11494 cp_error ("`%D' cannot have default arguments", decl
);
11499 /* Get the struct, enum or union (CODE says which) with tag NAME.
11500 Define the tag as a forward-reference if it is not defined.
11502 C++: If a class derivation is given, process it here, and report
11503 an error if multiple derivation declarations are not identical.
11505 If this is a definition, come in through xref_tag and only look in
11506 the current frame for the name (since C++ allows new names in any
11510 xref_tag (code_type_node
, name
, globalize
)
11511 tree code_type_node
;
11515 enum tag_types tag_code
;
11516 enum tree_code code
;
11518 register tree ref
, t
;
11519 struct binding_level
*b
= inner_binding_level
;
11521 tree attributes
= NULL_TREE
;
11523 /* If we are called from the parser, code_type_node will sometimes be a
11524 TREE_LIST. This indicates that the user wrote
11525 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11527 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11529 attributes
= TREE_PURPOSE (code_type_node
);
11530 code_type_node
= TREE_VALUE (code_type_node
);
11533 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11538 case signature_type
:
11539 code
= RECORD_TYPE
;
11545 code
= ENUMERAL_TYPE
;
11548 my_friendly_abort (18);
11551 /* If a cross reference is requested, look up the type
11552 already defined for this tag and return it. */
11553 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11556 name
= TYPE_IDENTIFIER (t
);
11560 t
= IDENTIFIER_TYPE_VALUE (name
);
11562 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11563 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11568 if (t
&& (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
11569 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
))
11571 cp_error ("redeclaration of template type-parameter `%T'", name
);
11572 cp_error_at (" previously declared here `%#D'",
11573 TEMPLATE_TYPE_DECL (t
));
11575 if (t
&& TYPE_CONTEXT (t
) && got_type
)
11578 /* If we know we are defining this tag, only look it up in
11579 this scope and don't try to find it as a type. */
11580 ref
= lookup_tag (code
, name
, b
, 1);
11584 if (current_class_type
11585 && template_class_depth (current_class_type
)
11586 && PROCESSING_REAL_TEMPLATE_DECL_P ())
11587 /* Since GLOBALIZE is non-zero, we are not looking at a
11588 definition of this tag. Since, in addition, we are currently
11589 processing a (member) template declaration of a template
11590 class, we don't want to do any lookup at all; consider:
11597 { template <class V>
11598 friend struct S1; };
11600 Here, the S2::S1 declaration should not be confused with the
11601 outer declaration. In particular, the inner version should
11602 have a template parameter of level 2, not level 1. This
11603 would be particularly important if the member declaration
11606 template <class V = U> friend struct S1;
11608 say, when we should tsubst into `U' when instantiating S2. */
11615 ref
= lookup_tag (code
, name
, b
, 0);
11619 /* Try finding it as a type declaration. If that wins,
11621 ref
= lookup_name (name
, 1);
11623 if (ref
!= NULL_TREE
11624 && processing_template_decl
11625 && DECL_CLASS_TEMPLATE_P (ref
)
11626 && template_class_depth (current_class_type
) == 0)
11627 /* Since GLOBALIZE is true, we're declaring a global
11628 template, so we want this type. */
11629 ref
= DECL_RESULT (ref
);
11631 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
11632 && TREE_CODE (TREE_TYPE (ref
)) == code
)
11633 ref
= TREE_TYPE (ref
);
11640 push_obstacks_nochange ();
11644 /* If no such tag is yet defined, create a forward-reference node
11645 and record it as the "definition".
11646 When a real declaration of this type is found,
11647 the forward-reference will be altered into a real type. */
11649 /* In C++, since these migrate into the global scope, we must
11650 build them on the permanent obstack. */
11652 temp
= allocation_temporary_p ();
11654 end_temporary_allocation ();
11656 if (code
== ENUMERAL_TYPE
)
11658 cp_error ("use of enum `%#D' without previous declaration", name
);
11660 ref
= make_node (ENUMERAL_TYPE
);
11662 /* Give the type a default layout like unsigned int
11663 to avoid crashing if it does not get defined. */
11664 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
11665 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
11666 TREE_UNSIGNED (ref
) = 1;
11667 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
11668 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
11669 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
11671 /* Enable us to recognize when a type is created in class context.
11672 To do nested classes correctly, this should probably be cleared
11673 out when we leave this classes scope. Currently this in only
11674 done in `start_enum'. */
11676 pushtag (name
, ref
, globalize
);
11680 struct binding_level
*old_b
= class_binding_level
;
11682 ref
= make_lang_type (code
);
11684 if (tag_code
== signature_type
)
11686 SET_SIGNATURE (ref
);
11687 /* Since a signature type will be turned into the type
11688 of signature tables, it's not only an interface. */
11689 CLASSTYPE_INTERFACE_ONLY (ref
) = 0;
11690 SET_CLASSTYPE_INTERFACE_KNOWN (ref
);
11691 /* A signature doesn't have a vtable. */
11692 CLASSTYPE_VTABLE_NEEDS_WRITING (ref
) = 0;
11695 #ifdef NONNESTED_CLASSES
11696 /* Class types don't nest the way enums do. */
11697 class_binding_level
= (struct binding_level
*)0;
11699 pushtag (name
, ref
, globalize
);
11700 class_binding_level
= old_b
;
11705 /* If it no longer looks like a nested type, make sure it's
11707 If it is not an IDENTIFIER, this is not a declaration */
11708 if (b
->namespace_p
&& !class_binding_level
11709 && TREE_CODE (name
) == IDENTIFIER_NODE
)
11711 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
11712 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
11715 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
11716 redeclare_class_template (ref
, current_template_parms
);
11719 /* Until the type is defined, tentatively accept whatever
11720 structure tag the user hands us. */
11721 if (TYPE_SIZE (ref
) == NULL_TREE
11722 && ref
!= current_class_type
11723 /* Have to check this, in case we have contradictory tag info. */
11724 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
11726 if (tag_code
== class_type
)
11727 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
11728 else if (tag_code
== record_type
|| tag_code
== signature_type
)
11729 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
11734 TREE_TYPE (ref
) = attributes
;
11736 if (ref
&& TYPE_P (ref
))
11740 If the identifier resolves to a typedef-name or a template
11741 type-parameter, the elaborated-type-specifier is
11743 if (TYPE_LANG_SPECIFIC (ref
) && TYPE_WAS_ANONYMOUS (ref
))
11744 cp_error ("`%T' is a typedef name", ref
);
11745 else if (TREE_CODE (ref
) == TEMPLATE_TYPE_PARM
)
11746 cp_error ("`%T' is a template type paramter", ref
);
11753 xref_tag_from_type (old
, id
, globalize
)
11757 tree code_type_node
;
11759 if (TREE_CODE (old
) == RECORD_TYPE
)
11760 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
11761 ? class_type_node
: record_type_node
);
11763 code_type_node
= union_type_node
;
11765 if (id
== NULL_TREE
)
11766 id
= TYPE_IDENTIFIER (old
);
11768 return xref_tag (code_type_node
, id
, globalize
);
11772 xref_basetypes (code_type_node
, name
, ref
, binfo
)
11773 tree code_type_node
;
11777 /* In the declaration `A : X, Y, ... Z' we mark all the types
11778 (A, X, Y, ..., Z) so we can check for duplicates. */
11781 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11783 if (tag_code
== union_type
)
11785 cp_error ("derived union `%T' invalid", ref
);
11789 len
= list_length (binfo
);
11790 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
11792 SET_CLASSTYPE_MARKED (ref
);
11793 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
11795 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
11797 /* The base of a derived struct is public by default. */
11799 = (TREE_PURPOSE (binfo
) == access_public_node
11800 || TREE_PURPOSE (binfo
) == access_public_virtual_node
11801 || (tag_code
!= class_type
11802 && (TREE_PURPOSE (binfo
) == access_default_node
11803 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
11805 = (TREE_PURPOSE (binfo
) == access_protected_node
11806 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
11808 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
11809 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
11810 || TREE_PURPOSE (binfo
) == access_public_virtual_node
11811 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
11812 tree basetype
= TREE_VALUE (binfo
);
11815 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
11816 basetype
= TREE_TYPE (basetype
);
11818 || (TREE_CODE (basetype
) != RECORD_TYPE
11819 && TREE_CODE (basetype
) != TYPENAME_TYPE
11820 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
11821 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
11823 cp_error ("base type `%T' fails to be a struct or class type",
11824 TREE_VALUE (binfo
));
11828 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
11831 /* This code replaces similar code in layout_basetypes.
11832 We put the complete_type first for implicit `typename'. */
11833 if (TYPE_SIZE (complete_type (basetype
)) == NULL_TREE
11834 && ! (current_template_parms
&& uses_template_parms (basetype
)))
11836 cp_error ("base class `%T' has incomplete type", basetype
);
11842 if (CLASSTYPE_MARKED (basetype
))
11844 if (basetype
== ref
)
11845 cp_error ("recursive type `%T' undefined", basetype
);
11847 cp_error ("duplicate base type `%T' invalid", basetype
);
11851 if (TYPE_FOR_JAVA (basetype
)
11852 && current_lang_stack
== current_lang_base
)
11853 TYPE_FOR_JAVA (ref
) = 1;
11855 /* Note that the BINFO records which describe individual
11856 inheritances are *not* shared in the lattice! They
11857 cannot be shared because a given baseclass may be
11858 inherited with different `accessibility' by different
11859 derived classes. (Each BINFO record describing an
11860 individual inheritance contains flags which say what
11861 the `accessibility' of that particular inheritance is.) */
11863 base_binfo
= make_binfo (integer_zero_node
, basetype
,
11864 TYPE_BINFO_VTABLE (basetype
),
11865 TYPE_BINFO_VIRTUALS (basetype
));
11867 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
11868 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
11869 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
11870 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
11871 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
11873 /* We need to unshare the binfos now so that lookups during class
11874 definition work. */
11875 unshare_base_binfos (base_binfo
);
11877 SET_CLASSTYPE_MARKED (basetype
);
11879 /* We are free to modify these bits because they are meaningless
11880 at top level, and BASETYPE is a top-level type. */
11881 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
11883 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
11884 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
11887 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
11888 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
11893 TREE_VEC_LENGTH (binfos
) = i
;
11895 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
11898 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
11900 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
11901 = TYPE_USES_MULTIPLE_INHERITANCE (BINFO_TYPE (TREE_VEC_ELT (binfos
, 0)));
11902 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
11903 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
11905 /* Unmark all the types. */
11907 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
11908 CLEAR_CLASSTYPE_MARKED (ref
);
11914 /* Begin compiling the definition of an enumeration type.
11915 NAME is its name (or null if anonymous).
11916 Returns the type object, as yet incomplete.
11917 Also records info about it so that build_enumerator
11918 may be used to declare the individual values as they are read. */
11924 register tree enumtype
= NULL_TREE
;
11925 struct binding_level
*b
= inner_binding_level
;
11927 /* We are wasting space here and putting these on the permanent_obstack so
11928 that typeid(local enum) will work correctly. */
11930 if (processing_template_decl
&& current_function_decl
)
11933 end_temporary_allocation ();
11935 /* If this is the real definition for a previous forward reference,
11936 fill in the contents in the same object that used to be the
11937 forward reference. */
11939 if (name
!= NULL_TREE
)
11940 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
11942 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
11943 cp_error ("multiple definition of `%#T'", enumtype
);
11946 enumtype
= make_node (ENUMERAL_TYPE
);
11947 pushtag (name
, enumtype
, 0);
11950 if (current_class_type
)
11951 TREE_ADDRESSABLE (b
->tags
) = 1;
11953 /* We don't copy this value because build_enumerator needs to do it. */
11954 enum_next_value
= integer_zero_node
;
11957 GNU_xref_decl (current_function_decl
, enumtype
);
11961 /* After processing and defining all the values of an enumeration type,
11962 install their decls in the enumeration type and finish it off.
11963 ENUMTYPE is the type object and VALUES a list of name-value pairs.
11964 Returns ENUMTYPE. */
11967 finish_enum (enumtype
)
11970 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
11971 /* Calculate the maximum value of any enumerator in this type. */
11973 tree values
= TYPE_VALUES (enumtype
);
11978 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
11983 /* The TREE_VALUE is a CONST_DECL for this enumeration
11985 decl
= TREE_VALUE (pair
);
11987 /* The DECL_INITIAL will be NULL if we are processing a
11988 template declaration and this enumeration constant had no
11989 explicit initializer. */
11990 value
= DECL_INITIAL (decl
);
11991 if (value
&& !processing_template_decl
)
11993 /* Set the TREE_TYPE for the VALUE as well. That's so
11994 that when we call decl_constant_value we get an
11995 entity of the right type (but with the constant
11996 value). Since we shouldn't ever call
11997 decl_constant_value on a template type, there's no
11998 reason to do that when processing_template_decl.
11999 And, if the expression is something like a
12000 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12001 wreak havoc on the intended type of the expression.
12003 Of course, there's also no point in trying to compute
12004 minimum or maximum values if we're in a template. */
12005 TREE_TYPE (value
) = enumtype
;
12008 minnode
= maxnode
= value
;
12009 else if (tree_int_cst_lt (maxnode
, value
))
12011 else if (tree_int_cst_lt (value
, minnode
))
12015 if (processing_template_decl
)
12016 /* If this is just a template, leave the CONST_DECL
12017 alone. That way tsubst_copy will find CONST_DECLs for
12018 CONST_DECLs, and not INTEGER_CSTs. */
12021 /* In the list we're building up, we want the enumeration
12022 values, not the CONST_DECLs. */
12023 TREE_VALUE (pair
) = value
;
12027 maxnode
= minnode
= integer_zero_node
;
12029 TYPE_VALUES (enumtype
) = nreverse (values
);
12031 if (processing_template_decl
)
12033 tree scope
= current_scope ();
12034 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12036 add_tree (build_min (TAG_DEFN
, enumtype
));
12037 resume_temporary_allocation ();
12043 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12044 int lowprec
= min_precision (minnode
, unsignedp
);
12045 int highprec
= min_precision (maxnode
, unsignedp
);
12046 int precision
= MAX (lowprec
, highprec
);
12048 TYPE_SIZE (enumtype
) = NULL_TREE
;
12050 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12052 TYPE_PRECISION (enumtype
) = precision
;
12054 fixup_unsigned_type (enumtype
);
12056 fixup_signed_type (enumtype
);
12058 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12059 /* Use the width of the narrowest normal C type which is wide enough. */
12060 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12063 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12065 TYPE_SIZE (enumtype
) = 0;
12066 layout_type (enumtype
);
12072 /* Fix up all variant types of this enum type. */
12073 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12074 tem
= TYPE_NEXT_VARIANT (tem
))
12076 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12077 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12078 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12079 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12080 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12081 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12082 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12083 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12084 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12088 /* Finish debugging output for this type. */
12089 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12094 /* Build and install a CONST_DECL for an enumeration constant of the
12095 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12096 Assignment of sequential values by default is handled here. */
12099 build_enumerator (name
, value
, type
)
12107 /* Remove no-op casts from the value. */
12109 STRIP_TYPE_NOPS (value
);
12111 if (! processing_template_decl
)
12113 /* Validate and default VALUE. */
12114 if (value
!= NULL_TREE
)
12116 if (TREE_READONLY_DECL_P (value
))
12117 value
= decl_constant_value (value
);
12119 if (TREE_CODE (value
) == INTEGER_CST
)
12121 value
= default_conversion (value
);
12122 constant_expression_warning (value
);
12126 cp_error ("enumerator value for `%D' not integer constant", name
);
12131 /* Default based on previous value. */
12132 if (value
== NULL_TREE
&& ! processing_template_decl
)
12134 value
= enum_next_value
;
12136 cp_error ("overflow in enumeration values at `%D'", name
);
12139 /* Remove no-op casts from the value. */
12141 STRIP_TYPE_NOPS (value
);
12143 /* To fix MAX_VAL enum consts. (bkoz) */
12144 TREE_TYPE (value
) = integer_type_node
;
12148 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12149 Even in other cases, we will later (in finish_enum) be setting the
12151 if (value
!= NULL_TREE
)
12152 value
= copy_node (value
);
12154 /* C++ associates enums with global, function, or class declarations. */
12156 context
= current_scope ();
12157 if (context
&& context
== current_class_type
)
12158 /* This enum declaration is local to the class. */
12159 decl
= build_lang_field_decl (CONST_DECL
, name
, type
);
12161 /* It's a global enum, or it's local to a function. (Note local to
12162 a function could mean local to a class method. */
12163 decl
= build_decl (CONST_DECL
, name
, type
);
12165 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12166 DECL_INITIAL (decl
) = value
;
12167 TREE_READONLY (decl
) = 1;
12169 if (context
&& context
== current_class_type
)
12171 pushdecl_class_level (decl
);
12172 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12173 on the TYPE_FIELDS list for `S'. (That's so that you can say
12174 things like `S::i' later.) */
12175 finish_member_declaration (decl
);
12180 GNU_xref_decl (current_function_decl
, decl
);
12183 if (! processing_template_decl
)
12185 /* Set basis for default for next value. */
12186 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12187 integer_one_node
, PLUS_EXPR
);
12188 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12191 result
= saveable_tree_cons (name
, decl
, NULL_TREE
);
12196 static int function_depth
;
12198 /* Create the FUNCTION_DECL for a function definition.
12199 DECLSPECS and DECLARATOR are the parts of the declaration;
12200 they describe the function's name and the type it returns,
12201 but twisted together in a fashion that parallels the syntax of C.
12203 This function creates a binding context for the function body
12204 as well as setting up the FUNCTION_DECL in current_function_decl.
12206 Returns 1 on success. If the DECLARATOR is not suitable for a function
12207 (it defines a datum instead), we return 0, which tells
12208 yyparse to report a parse error.
12210 For C++, we must first check whether that datum makes any sense.
12211 For example, "class A local_a(1,2);" means that variable local_a
12212 is an aggregate of type A, which should have a constructor
12213 applied to it with the argument list [1, 2].
12215 @@ There is currently no way to retrieve the storage
12216 @@ allocated to FUNCTION (or all of its parms) if we return
12217 @@ something we had previously. */
12220 start_function (declspecs
, declarator
, attrs
, pre_parsed_p
)
12221 tree declspecs
, declarator
, attrs
;
12225 tree ctype
= NULL_TREE
;
12228 extern int have_extern_spec
;
12229 extern int used_extern_spec
;
12230 int doing_friend
= 0;
12232 /* Sanity check. */
12233 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12234 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12236 /* Assume, until we see it does. */
12237 current_function_returns_value
= 0;
12238 current_function_returns_null
= 0;
12239 warn_about_return_type
= 0;
12241 shadowed_labels
= 0;
12242 current_function_assigns_this
= 0;
12243 current_function_just_assigned_this
= 0;
12244 current_function_parms_stored
= 0;
12245 original_result_rtx
= NULL_RTX
;
12246 base_init_expr
= NULL_TREE
;
12247 current_base_init_list
= NULL_TREE
;
12248 current_member_init_list
= NULL_TREE
;
12249 ctor_label
= dtor_label
= NULL_TREE
;
12250 static_labelno
= 0;
12252 clear_temp_name ();
12254 /* This should only be done once on the top most decl. */
12255 if (have_extern_spec
&& !used_extern_spec
)
12257 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12258 used_extern_spec
= 1;
12263 decl1
= declarator
;
12266 /* What was this testing for, exactly? */
12267 if (! DECL_ARGUMENTS (decl1
)
12268 && !DECL_STATIC_FUNCTION_P (decl1
)
12269 && !DECL_ARTIFICIAL (decl1
)
12270 && DECL_CLASS_SCOPE_P (decl1
)
12271 && TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))
12272 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))))
12274 tree binding
= binding_for_name (DECL_NAME (decl1
),
12275 current_namespace
);
12276 cp_error ("redeclaration of `%#D'", decl1
);
12277 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)))
12278 cp_error_at ("previous declaration here", IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)));
12279 else if (BINDING_VALUE (binding
))
12280 cp_error_at ("previous declaration here", BINDING_VALUE (binding
));
12284 fntype
= TREE_TYPE (decl1
);
12285 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12286 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12288 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12289 class is in the (lexical) scope of the class in which it is
12291 if (!ctype
&& DECL_FRIEND_P (decl1
))
12293 ctype
= DECL_CLASS_CONTEXT (decl1
);
12295 /* CTYPE could be null here if we're dealing with a template;
12296 for example, `inline friend float foo()' inside a template
12297 will have no CTYPE set. */
12298 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12304 /* In a fcn definition, arg types must be complete. */
12305 require_complete_types_for_parms (DECL_ARGUMENTS (decl1
));
12307 /* In case some arg types were completed since the declaration was
12308 parsed, fix up the decls. */
12310 tree t
= DECL_ARGUMENTS (decl1
);
12311 for (; t
; t
= TREE_CHAIN (t
))
12312 layout_decl (t
, 0);
12315 last_function_parms
= DECL_ARGUMENTS (decl1
);
12316 last_function_parm_tags
= NULL_TREE
;
12320 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12321 /* If the declarator is not suitable for a function definition,
12322 cause a syntax error. */
12323 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12325 fntype
= TREE_TYPE (decl1
);
12327 restype
= TREE_TYPE (fntype
);
12328 if (IS_AGGR_TYPE (restype
) && ! TYPE_PTRMEMFUNC_P (restype
)
12329 && ! CLASSTYPE_GOT_SEMICOLON (restype
))
12331 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12332 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12333 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12334 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12335 fntype
= build_function_type (integer_type_node
,
12336 TYPE_ARG_TYPES (fntype
));
12338 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12340 TYPE_ARG_TYPES (fntype
));
12341 TREE_TYPE (decl1
) = fntype
;
12344 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12345 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12346 else if (DECL_MAIN_P (decl1
))
12348 /* If this doesn't return integer_type, complain. */
12349 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12351 if (pedantic
|| warn_return_type
)
12352 pedwarn ("return type for `main' changed to `int'");
12353 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12355 warn_about_return_type
= 0;
12359 /* Warn if function was previously implicitly declared
12360 (but not if we warned then). */
12361 if (! warn_implicit
12362 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12363 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12365 current_function_decl
= decl1
;
12366 /* Save the parm names or decls from this function's declarator
12367 where store_parm_decls will find them. */
12368 current_function_parms
= last_function_parms
;
12369 current_function_parm_tags
= last_function_parm_tags
;
12371 announce_function (decl1
);
12373 if (! processing_template_decl
)
12375 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12377 cp_error ("return-type `%#T' is an incomplete type",
12378 TREE_TYPE (fntype
));
12380 /* Make it return void instead, but don't change the
12381 type of the DECL_RESULT, in case we have a named return value. */
12384 = build_cplus_method_type (build_type_variant (ctype
,
12385 TREE_READONLY (decl1
),
12386 TREE_SIDE_EFFECTS (decl1
)),
12388 FUNCTION_ARG_CHAIN (decl1
));
12391 = build_function_type (void_type_node
,
12392 TYPE_ARG_TYPES (TREE_TYPE (decl1
)));
12393 DECL_RESULT (decl1
)
12394 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)));
12395 TREE_READONLY (DECL_RESULT (decl1
)) = TYPE_READONLY (TREE_TYPE (fntype
));
12396 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = TYPE_VOLATILE (TREE_TYPE (fntype
));
12399 if (TYPE_LANG_SPECIFIC (TREE_TYPE (fntype
))
12400 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (fntype
)))
12401 abstract_virtuals_error (decl1
, TREE_TYPE (fntype
));
12404 if (warn_about_return_type
)
12405 pedwarn ("return-type defaults to `int'");
12407 /* Effective C++ rule 15. See also c_expand_return. */
12409 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12410 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12411 cp_warning ("`operator=' should return a reference to `*this'");
12413 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12414 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12415 DECL_INITIAL (decl1
) = error_mark_node
;
12417 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12418 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12421 /* This function exists in static storage.
12422 (This does not mean `static' in the C sense!) */
12423 TREE_STATIC (decl1
) = 1;
12425 /* Set up current_class_type, and enter the scope of the class, if
12428 push_nested_class (ctype
, 1);
12429 else if (DECL_STATIC_FUNCTION_P (decl1
))
12430 push_nested_class (DECL_CONTEXT (decl1
), 2);
12432 /* We must call push_template_decl after current_class_type is set
12433 up. (If we are processing inline definitions after exiting a
12434 class scope, current_class_type will be NULL_TREE until set above
12435 by push_nested_class.) */
12436 if (processing_template_decl
)
12437 decl1
= push_template_decl (decl1
);
12439 /* Record the decl so that the function name is defined.
12440 If we already have a decl for this name, and it is a FUNCTION_DECL,
12441 use the old decl. */
12442 if (!processing_template_decl
&& pre_parsed_p
== 0)
12444 /* A specialization is not used to guide overload resolution. */
12445 if ((flag_guiding_decls
12446 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12447 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12448 decl1
= pushdecl (decl1
);
12451 /* We need to set the DECL_CONTEXT. */
12452 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12453 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12454 /* And make sure we have enough default args. */
12455 check_default_args (decl1
);
12457 DECL_MAIN_VARIANT (decl1
) = decl1
;
12458 fntype
= TREE_TYPE (decl1
);
12461 current_function_decl
= decl1
;
12463 if (DECL_INTERFACE_KNOWN (decl1
))
12465 tree ctx
= hack_decl_function_context (decl1
);
12467 if (DECL_NOT_REALLY_EXTERN (decl1
))
12468 DECL_EXTERNAL (decl1
) = 0;
12470 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12471 && TREE_PUBLIC (ctx
))
12472 /* This is a function in a local class in an extern inline
12474 comdat_linkage (decl1
);
12476 /* If this function belongs to an interface, it is public.
12477 If it belongs to someone else's interface, it is also external.
12478 It doesn't matter whether it's inline or not. */
12479 else if (interface_unknown
== 0
12480 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12481 || flag_alt_external_templates
))
12483 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12484 || processing_template_decl
)
12485 DECL_EXTERNAL (decl1
)
12487 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
));
12489 DECL_EXTERNAL (decl1
) = 0;
12490 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
12491 DECL_INTERFACE_KNOWN (decl1
) = 1;
12495 /* This is a definition, not a reference.
12496 So clear DECL_EXTERNAL. */
12497 DECL_EXTERNAL (decl1
) = 0;
12499 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
12500 && ! DECL_INTERFACE_KNOWN (decl1
)
12501 /* Don't try to defer nested functions for now. */
12502 && ! hack_decl_function_context (decl1
))
12503 DECL_DEFER_OUTPUT (decl1
) = 1;
12505 DECL_INTERFACE_KNOWN (decl1
) = 1;
12508 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
12510 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12511 TREE_TYPE (decl1
) = fntype
12512 = build_function_type (TREE_TYPE (fntype
),
12513 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
12514 current_function_parms
= TREE_CHAIN (current_function_parms
);
12515 DECL_ARGUMENTS (decl1
) = current_function_parms
;
12518 restype
= TREE_TYPE (fntype
);
12522 /* If we're compiling a friend function, neither of the variables
12523 current_class_ptr nor current_class_type will have values. */
12524 if (! doing_friend
)
12526 /* We know that this was set up by `grokclassfn'.
12527 We do not wait until `store_parm_decls', since evil
12528 parse errors may never get us to that point. Here
12529 we keep the consistency between `current_class_type'
12530 and `current_class_ptr'. */
12531 tree t
= current_function_parms
;
12533 my_friendly_assert (t
!= NULL_TREE
12534 && TREE_CODE (t
) == PARM_DECL
, 162);
12536 if (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
)
12538 int i
= suspend_momentary ();
12540 /* Fool build_indirect_ref. */
12541 current_class_ptr
= NULL_TREE
;
12542 current_class_ref
= build_indirect_ref (t
, NULL_PTR
);
12543 current_class_ptr
= t
;
12544 resume_momentary (i
);
12547 /* We're having a signature pointer here. */
12548 current_class_ref
= current_class_ptr
= t
;
12554 current_class_ptr
= current_class_ref
= NULL_TREE
;
12558 current_binding_level
->parm_flag
= 1;
12560 GNU_xref_function (decl1
, current_function_parms
);
12563 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
12565 make_function_rtl (decl1
);
12567 /* Promote the value to int before returning it. */
12568 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
12569 restype
= type_promotes_to (restype
);
12571 /* If this fcn was already referenced via a block-scope `extern' decl
12572 (or an implicit decl), propagate certain information about the usage. */
12573 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
12574 TREE_ADDRESSABLE (decl1
) = 1;
12576 if (DECL_RESULT (decl1
) == NULL_TREE
)
12578 DECL_RESULT (decl1
)
12579 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12580 TREE_READONLY (DECL_RESULT (decl1
)) = TYPE_READONLY (restype
);
12581 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = TYPE_VOLATILE (restype
);
12584 /* Allocate further tree nodes temporarily during compilation
12585 of this function only. Tiemann moved up here from bottom of fn. */
12586 /* If this is a nested function, then we must continue to allocate RTL
12587 on the permanent obstack in case we need to inline it later. */
12588 if (! hack_decl_function_context (decl1
))
12589 temporary_allocation ();
12591 if (processing_template_decl
)
12593 ++minimal_parse_mode
;
12594 last_tree
= DECL_SAVED_TREE (decl1
)
12595 = build_nt (EXPR_STMT
, void_zero_node
);
12600 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
12601 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
12603 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
12604 ctor_label
= NULL_TREE
;
12608 dtor_label
= NULL_TREE
;
12609 if (DECL_CONSTRUCTOR_P (decl1
))
12610 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
12616 /* Called after store_parm_decls for a function-try-block. We need to update
12617 last_parm_cleanup_insn so that the base initializers for a constructor
12618 are run within this block, not before it. */
12621 expand_start_early_try_stmts ()
12623 expand_start_try_stmts ();
12624 last_parm_cleanup_insn
= get_last_insn ();
12627 /* Store the parameter declarations into the current function declaration.
12628 This is called after parsing the parameter declarations, before
12629 digesting the body of the function.
12631 Also install to binding contour return value identifier, if any. */
12634 store_parm_decls ()
12636 register tree fndecl
= current_function_decl
;
12637 register tree parm
;
12638 int parms_have_cleanups
= 0;
12639 tree cleanups
= NULL_TREE
;
12641 /* This is either a chain of PARM_DECLs (when a prototype is used). */
12642 tree specparms
= current_function_parms
;
12644 /* This is a list of types declared among parms in a prototype. */
12645 tree parmtags
= current_function_parm_tags
;
12647 /* This is a chain of any other decls that came in among the parm
12648 declarations. If a parm is declared with enum {foo, bar} x;
12649 then CONST_DECLs for foo and bar are put here. */
12650 tree nonparms
= NULL_TREE
;
12652 if (toplevel_bindings_p ())
12653 fatal ("parse errors have confused me too much");
12655 /* Initialize RTL machinery. */
12656 init_function_start (fndecl
, input_filename
, lineno
);
12658 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
12659 declare_function_name ();
12661 /* Create a binding level for the parms. */
12662 expand_start_bindings (0);
12664 if (specparms
!= NULL_TREE
)
12666 /* This case is when the function was defined with an ANSI prototype.
12667 The parms already have decls, so we need not do anything here
12668 except record them as in effect
12669 and complain if any redundant old-style parm decls were written. */
12671 register tree next
;
12673 /* Must clear this because it might contain TYPE_DECLs declared
12675 storedecls (NULL_TREE
);
12677 for (parm
= nreverse (specparms
); parm
; parm
= next
)
12679 next
= TREE_CHAIN (parm
);
12680 if (TREE_CODE (parm
) == PARM_DECL
)
12683 if (DECL_NAME (parm
) == NULL_TREE
)
12687 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
12688 cp_error ("parameter `%D' declared void", parm
);
12691 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
12692 A parameter is assumed not to have any side effects.
12693 If this should change for any reason, then this
12694 will have to wrap the bashed reference type in a save_expr.
12696 Also, if the parameter type is declared to be an X
12697 and there is an X(X&) constructor, we cannot lay it
12698 into the stack (any more), so we make this parameter
12699 look like it is really of reference type. Functions
12700 which pass parameters to this function will know to
12701 create a temporary in their frame, and pass a reference
12704 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
12705 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
12706 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
12710 if (! processing_template_decl
12711 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
12713 expand_decl (parm
);
12714 parms_have_cleanups
= 1;
12716 /* Keep track of the cleanups. */
12717 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
12722 /* If we find an enum constant or a type tag,
12723 put it aside for the moment. */
12724 TREE_CHAIN (parm
) = NULL_TREE
;
12725 nonparms
= chainon (nonparms
, parm
);
12729 /* Get the decls in their original chain order
12730 and record in the function. This is all and only the
12731 PARM_DECLs that were pushed into scope by the loop above. */
12732 DECL_ARGUMENTS (fndecl
) = getdecls ();
12734 storetags (chainon (parmtags
, gettags ()));
12737 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
12739 /* Now store the final chain of decls for the arguments
12740 as the decl-chain of the current lexical scope.
12741 Put the enumerators in as well, at the front so that
12742 DECL_ARGUMENTS is not modified. */
12744 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
12746 /* Initialize the RTL code for the function. */
12747 DECL_SAVED_INSNS (fndecl
) = NULL_RTX
;
12748 if (! processing_template_decl
)
12749 expand_function_start (fndecl
, parms_have_cleanups
);
12751 current_function_parms_stored
= 1;
12753 /* If this function is `main', emit a call to `__main'
12754 to run global initializers, etc. */
12755 if (DECL_MAIN_P (fndecl
))
12756 expand_main_function ();
12758 /* Now that we have initialized the parms, we can start their
12759 cleanups. We cannot do this before, since expand_decl_cleanup
12760 should not be called before the parm can be used. */
12762 && ! processing_template_decl
)
12764 for (cleanups
= nreverse (cleanups
); cleanups
; cleanups
= TREE_CHAIN (cleanups
))
12766 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
), TREE_VALUE (cleanups
)))
12767 cp_error ("parser lost in parsing declaration of `%D'",
12768 TREE_PURPOSE (cleanups
));
12772 /* Create a binding contour which can be used to catch
12773 cleanup-generated temporaries. Also, if the return value needs or
12774 has initialization, deal with that now. */
12775 if (parms_have_cleanups
)
12778 expand_start_bindings (0);
12781 if (! processing_template_decl
&& flag_exceptions
)
12783 /* Do the starting of the exception specifications, if we have any. */
12784 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
12785 expand_start_eh_spec ();
12788 last_parm_cleanup_insn
= get_last_insn ();
12789 last_dtor_insn
= get_last_insn ();
12792 /* Bind a name and initialization to the return value of
12793 the current function. */
12796 store_return_init (return_id
, init
)
12797 tree return_id
, init
;
12799 tree decl
= DECL_RESULT (current_function_decl
);
12802 /* Give this error as many times as there are occurrences,
12803 so that users can use Emacs compilation buffers to find
12804 and fix all such places. */
12805 pedwarn ("ANSI C++ does not permit named return values");
12807 if (return_id
!= NULL_TREE
)
12809 if (DECL_NAME (decl
) == NULL_TREE
)
12811 DECL_NAME (decl
) = return_id
;
12812 DECL_ASSEMBLER_NAME (decl
) = return_id
;
12815 cp_error ("return identifier `%D' already in place", decl
);
12818 /* Can't let this happen for constructors. */
12819 if (DECL_CONSTRUCTOR_P (current_function_decl
))
12821 error ("can't redefine default return value for constructors");
12825 /* If we have a named return value, put that in our scope as well. */
12826 if (DECL_NAME (decl
) != NULL_TREE
)
12828 /* If this named return value comes in a register,
12829 put it in a pseudo-register. */
12830 if (DECL_REGISTER (decl
))
12832 original_result_rtx
= DECL_RTL (decl
);
12833 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
12836 /* Let `cp_finish_decl' know that this initializer is ok. */
12837 DECL_INITIAL (decl
) = init
;
12840 if (minimal_parse_mode
)
12841 add_tree (build_min_nt (RETURN_INIT
, return_id
,
12842 copy_to_permanent (init
)));
12844 cp_finish_decl (decl
, init
, NULL_TREE
, 0, 0);
12849 /* Finish up a function declaration and compile that function
12850 all the way to assembler language output. The free the storage
12851 for the function definition.
12853 This is called after parsing the body of the function definition.
12854 LINENO is the current line number.
12856 C++: CALL_POPLEVEL is non-zero if an extra call to poplevel
12857 (and expand_end_bindings) must be made to take care of the binding
12858 contour for the base initializers. This is only relevant for
12861 NESTED is nonzero if we were in the middle of compiling another function
12862 when we started on this one. */
12865 finish_function (lineno
, call_poplevel
, nested
)
12870 register tree fndecl
= current_function_decl
;
12871 tree fntype
, ctype
= NULL_TREE
;
12872 rtx last_parm_insn
, insns
;
12873 /* Label to use if this function is supposed to return a value. */
12874 tree no_return_label
= NULL_TREE
;
12875 tree decls
= NULL_TREE
;
12877 /* When we get some parse errors, we can end up without a
12878 current_function_decl, so cope. */
12879 if (fndecl
== NULL_TREE
)
12882 if (! nested
&& function_depth
> 1)
12885 fntype
= TREE_TYPE (fndecl
);
12887 /* TREE_READONLY (fndecl) = 1;
12888 This caused &foo to be of type ptr-to-const-function
12889 which then got a warning when stored in a ptr-to-function variable. */
12891 /* This happens on strange parse errors. */
12892 if (! current_function_parms_stored
)
12895 store_parm_decls ();
12898 if (processing_template_decl
)
12900 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
12902 decls
= getdecls ();
12903 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
12904 poplevel (decls
!= NULL_TREE
, 0, 0);
12909 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
12911 tree ttype
= target_type (fntype
);
12914 if (IS_AGGR_TYPE (ttype
))
12915 /* Let debugger know it should output info for this type. */
12916 note_debug_info_needed (ttype
);
12918 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
12920 ttype
= target_type (TREE_TYPE (parmdecl
));
12921 if (IS_AGGR_TYPE (ttype
))
12922 /* Let debugger know it should output info for this type. */
12923 note_debug_info_needed (ttype
);
12927 /* Clean house because we will need to reorder insns here. */
12928 do_pending_stack_adjust ();
12932 tree binfo
= TYPE_BINFO (current_class_type
);
12933 tree cond
= integer_one_node
;
12935 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
12937 int ok_to_optimize_dtor
= 0;
12938 int empty_dtor
= get_last_insn () == last_dtor_insn
;
12940 if (current_function_assigns_this
)
12941 cond
= build (NE_EXPR
, boolean_type_node
,
12942 current_class_ptr
, integer_zero_node
);
12945 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
12947 /* If this destructor is empty, then we don't need to check
12948 whether `this' is NULL in some cases. */
12949 if ((flag_this_is_variable
& 1) == 0)
12950 ok_to_optimize_dtor
= 1;
12951 else if (empty_dtor
)
12952 ok_to_optimize_dtor
12953 = (n_baseclasses
== 0
12954 || (n_baseclasses
== 1
12955 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
12958 /* These initializations might go inline. Protect
12959 the binding level of the parms. */
12961 expand_start_bindings (0);
12963 if (current_function_assigns_this
)
12965 current_function_assigns_this
= 0;
12966 current_function_just_assigned_this
= 0;
12969 /* Generate the code to call destructor on base class.
12970 If this destructor belongs to a class with virtual
12971 functions, then set the virtual function table
12972 pointer to represent the type of our base class. */
12974 /* This side-effect makes call to `build_delete' generate the
12975 code we have to have at the end of this destructor. */
12976 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
12978 /* These are two cases where we cannot delegate deletion. */
12979 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
12980 || TYPE_GETS_REG_DELETE (current_class_type
))
12981 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
12982 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
12984 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
12985 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
12987 /* If we did not assign to this, then `this' is non-zero at
12988 the end of a destructor. As a special optimization, don't
12989 emit test if this is an empty destructor. If it does nothing,
12990 it does nothing. If it calls a base destructor, the base
12991 destructor will perform the test. */
12993 if (exprstmt
!= error_mark_node
12994 && (TREE_CODE (exprstmt
) != NOP_EXPR
12995 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
12996 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
12998 expand_label (dtor_label
);
12999 if (cond
!= integer_one_node
)
13000 expand_start_cond (cond
, 0);
13001 if (exprstmt
!= void_zero_node
)
13002 /* Don't call `expand_expr_stmt' if we're not going to do
13003 anything, since -Wall will give a diagnostic. */
13004 expand_expr_stmt (exprstmt
);
13006 /* Run destructor on all virtual baseclasses. */
13007 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13009 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13010 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13011 in_charge_node
, integer_two_node
), 0);
13014 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13016 tree vb
= get_vbase
13017 (BINFO_TYPE (vbases
),
13018 TYPE_BINFO (current_class_type
));
13020 (build_scoped_method_call
13021 (current_class_ref
, vb
, dtor_identifier
,
13022 build_expr_list (NULL_TREE
, integer_zero_node
)));
13024 vbases
= TREE_CHAIN (vbases
);
13026 expand_end_cond ();
13029 do_pending_stack_adjust ();
13030 if (cond
!= integer_one_node
)
13031 expand_end_cond ();
13034 TYPE_HAS_DESTRUCTOR (current_class_type
) = 1;
13036 virtual_size
= c_sizeof (current_class_type
);
13038 /* At the end, call delete if that's what's requested. */
13040 /* FDIS sez: At the point of definition of a virtual destructor
13041 (including an implicit definition), non-placement operator
13042 delete shall be looked up in the scope of the destructor's
13043 class and if found shall be accessible and unambiguous.
13045 This is somewhat unclear, but I take it to mean that if the
13046 class only defines placement deletes we don't do anything here.
13047 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13048 for us if they ever try to delete one of these. */
13050 if (TYPE_GETS_REG_DELETE (current_class_type
)
13051 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13052 exprstmt
= build_op_delete_call
13053 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13054 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13056 exprstmt
= NULL_TREE
;
13060 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13061 in_charge_node
, integer_one_node
);
13062 expand_start_cond (cond
, 0);
13063 expand_expr_stmt (exprstmt
);
13064 expand_end_cond ();
13067 /* End of destructor. */
13068 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13069 poplevel (2, 0, 0); /* XXX change to 1 */
13071 /* Back to the top of destructor. */
13072 /* Don't execute destructor code if `this' is NULL. */
13076 /* If the dtor is empty, and we know there is not possible way we
13077 could use any vtable entries, before they are possibly set by
13078 a base class dtor, we don't have to setup the vtables, as we
13079 know that any base class dtoring will set up any vtables it
13080 needs. We avoid MI, because one base class dtor can do a
13081 virtual dispatch to an overridden function that would need to
13082 have a non-related vtable set up, we cannot avoid setting up
13083 vtables in that case. We could change this to see if there is
13084 just one vtable. */
13085 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13087 /* Make all virtual function table pointers in non-virtual base
13088 classes point to CURRENT_CLASS_TYPE's virtual function
13090 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13092 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13093 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13096 if (! ok_to_optimize_dtor
)
13098 cond
= build_binary_op (NE_EXPR
,
13099 current_class_ptr
, integer_zero_node
, 1);
13100 expand_start_cond (cond
, 0);
13103 insns
= get_insns ();
13106 last_parm_insn
= get_first_nonparm_insn ();
13107 if (last_parm_insn
== NULL_RTX
)
13108 last_parm_insn
= get_last_insn ();
13110 last_parm_insn
= previous_insn (last_parm_insn
);
13112 emit_insns_after (insns
, last_parm_insn
);
13114 if (! ok_to_optimize_dtor
)
13115 expand_end_cond ();
13117 else if (current_function_assigns_this
)
13119 /* Does not need to call emit_base_init, because
13120 that is done (if needed) just after assignment to this
13123 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13125 end_protect_partials ();
13126 expand_label (ctor_label
);
13127 ctor_label
= NULL_TREE
;
13131 decls
= getdecls ();
13132 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13133 poplevel (decls
!= NULL_TREE
, 0, 0);
13135 /* c_expand_return knows to return 'this' from a constructor. */
13136 c_expand_return (NULL_TREE
);
13138 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13139 && return_label
!= NULL_RTX
)
13140 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13142 current_function_assigns_this
= 0;
13143 current_function_just_assigned_this
= 0;
13144 base_init_expr
= NULL_TREE
;
13146 else if (DECL_CONSTRUCTOR_P (fndecl
))
13148 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13149 /* Allow constructor for a type to get a new instance of the object
13150 using `build_new'. */
13151 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13152 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13154 DECL_RETURNS_FIRST_ARG (fndecl
) = 1;
13156 if (flag_this_is_variable
> 0)
13158 cond
= build_binary_op (EQ_EXPR
,
13159 current_class_ptr
, integer_zero_node
, 1);
13160 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13161 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13164 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13168 if (flag_this_is_variable
> 0)
13170 expand_start_cond (cond
, 0);
13171 expand_expr_stmt (thenclause
);
13172 expand_end_cond ();
13175 /* Emit insns from `emit_base_init' which sets up virtual
13176 function table pointer(s). */
13177 if (base_init_expr
)
13179 expand_expr_stmt (base_init_expr
);
13180 base_init_expr
= NULL_TREE
;
13183 insns
= get_insns ();
13186 /* This is where the body of the constructor begins. */
13188 emit_insns_after (insns
, last_parm_cleanup_insn
);
13190 end_protect_partials ();
13192 /* This is where the body of the constructor ends. */
13193 expand_label (ctor_label
);
13194 ctor_label
= NULL_TREE
;
13198 decls
= getdecls ();
13199 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13200 poplevel (decls
!= NULL_TREE
, 1, 0);
13203 /* c_expand_return knows to return 'this' from a constructor. */
13204 c_expand_return (NULL_TREE
);
13206 current_function_assigns_this
= 0;
13207 current_function_just_assigned_this
= 0;
13209 else if (DECL_MAIN_P (fndecl
))
13211 /* Make it so that `main' always returns 0 by default. */
13213 c_expand_return (integer_one_node
);
13215 c_expand_return (integer_zero_node
);
13218 else if (return_label
!= NULL_RTX
13219 && current_function_return_value
== NULL_TREE
13220 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13221 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13223 if (flag_exceptions
)
13224 expand_exception_blocks ();
13226 /* If this function is supposed to return a value, ensure that
13227 we do not fall into the cleanups by mistake. The end of our
13228 function will look like this:
13230 user code (may have return stmt somewhere)
13231 goto no_return_label
13236 NOTE_INSN_FUNCTION_END
13240 If the user omits a return stmt in the USER CODE section, we
13241 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13242 Otherwise, we won't. */
13243 if (no_return_label
)
13245 DECL_CONTEXT (no_return_label
) = fndecl
;
13246 DECL_INITIAL (no_return_label
) = error_mark_node
;
13247 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13248 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13249 expand_goto (no_return_label
);
13254 /* Remove the binding contour which is used
13255 to catch cleanup-generated temporaries. */
13256 expand_end_bindings (0, 0, 0);
13257 poplevel (0, 0, 0);
13259 /* Emit label at beginning of cleanup code for parameters. */
13260 emit_label (cleanup_label
);
13263 /* Get return value into register if that's where it's supposed to be. */
13264 if (original_result_rtx
)
13265 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13267 /* Finish building code that will trigger warnings if users forget
13268 to make their functions return values. */
13269 if (no_return_label
|| cleanup_label
)
13270 emit_jump (return_label
);
13271 if (no_return_label
)
13273 /* We don't need to call `expand_*_return' here because we
13274 don't need any cleanups here--this path of code is only
13275 for error checking purposes. */
13276 expand_label (no_return_label
);
13279 /* Generate rtl for function exit. */
13280 expand_function_end (input_filename
, lineno
, 1);
13283 /* This must come after expand_function_end because cleanups might
13284 have declarations (from inline functions) that need to go into
13285 this function's blocks. */
13286 if (current_binding_level
->parm_flag
!= 1)
13287 my_friendly_abort (122);
13288 poplevel (1, 0, 1);
13290 /* Reset scope for C++: if we were in the scope of a class,
13291 then when we finish this function, we are not longer so.
13292 This cannot be done until we know for sure that no more
13293 class members will ever be referenced in this function
13294 (i.e., calls to destructors). */
13295 if (current_class_name
)
13297 ctype
= current_class_type
;
13298 pop_nested_class (1);
13301 /* Must mark the RESULT_DECL as being in this function. */
13302 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13304 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13305 to the FUNCTION_DECL node itself. */
13306 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13308 if (! processing_template_decl
)
13310 int saved_flag_keep_inline_functions
=
13311 flag_keep_inline_functions
;
13313 /* So we can tell if jump_optimize sets it to 1. */
13316 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13317 && hack_decl_function_context (fndecl
))
13318 /* Trick rest_of_compilation into not deferring output of this
13319 function, even if it is inline, since the rtl_obstack for
13320 this function is the function_obstack of the enclosing
13321 function and will be deallocated when the enclosing
13322 function is gone. See save_tree_status. */
13323 flag_keep_inline_functions
= 1;
13325 /* Run the optimizers and output the assembler code for this
13328 if (DECL_ARTIFICIAL (fndecl
))
13330 /* Do we really *want* to inline this synthesized method? */
13332 int save_fif
= flag_inline_functions
;
13333 flag_inline_functions
= 1;
13335 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13336 will check our size. */
13337 DECL_INLINE (fndecl
) = 0;
13339 rest_of_compilation (fndecl
);
13340 flag_inline_functions
= save_fif
;
13343 rest_of_compilation (fndecl
);
13345 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13347 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13349 /* Set DECL_EXTERNAL so that assemble_external will be called as
13350 necessary. We'll clear it again in finish_file. */
13351 if (! DECL_EXTERNAL (fndecl
))
13352 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13353 DECL_EXTERNAL (fndecl
) = 1;
13354 mark_inline_for_output (fndecl
);
13357 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13358 note_debug_info_needed (ctype
);
13360 current_function_returns_null
|= can_reach_end
;
13362 /* Since we don't normally go through c_expand_return for constructors,
13363 this normally gets the wrong value.
13364 Also, named return values have their return codes emitted after
13365 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13366 if (DECL_CONSTRUCTOR_P (fndecl
)
13367 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13368 current_function_returns_null
= 0;
13370 if (TREE_THIS_VOLATILE (fndecl
) && current_function_returns_null
)
13371 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13372 else if ((warn_return_type
|| pedantic
)
13373 && current_function_returns_null
13374 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13376 /* If this function returns non-void and control can drop through,
13378 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13380 /* With just -W, complain only if function returns both with
13381 and without a value. */
13382 else if (extra_warnings
13383 && current_function_returns_value
&& current_function_returns_null
)
13384 warning ("this function may return with or without a value");
13389 /* Free all the tree nodes making up this function. */
13390 /* Switch back to allocating nodes permanently
13391 until we start another function. */
13392 if (processing_template_decl
)
13394 --minimal_parse_mode
;
13395 DECL_SAVED_TREE (fndecl
) = TREE_CHAIN (DECL_SAVED_TREE (fndecl
));
13399 permanent_allocation (1);
13401 if (DECL_SAVED_INSNS (fndecl
) == NULL_RTX
)
13405 /* Stop pointing to the local nodes about to be freed. */
13406 /* But DECL_INITIAL must remain nonzero so we know this
13407 was an actual function definition. */
13408 DECL_INITIAL (fndecl
) = error_mark_node
;
13409 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13410 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13413 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13414 static_ctors
= perm_tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13415 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13416 static_dtors
= perm_tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13420 /* Let the error reporting routines know that we're outside a
13421 function. For a nested function, this value is used in
13422 pop_cp_function_context and then reset via pop_function_context. */
13423 current_function_decl
= NULL_TREE
;
13426 named_label_uses
= NULL
;
13427 current_class_ptr
= NULL_TREE
;
13428 current_class_ref
= NULL_TREE
;
13431 /* Create the FUNCTION_DECL for a function definition.
13432 LINE1 is the line number that the definition absolutely begins on.
13433 LINE2 is the line number that the name of the function appears on.
13434 DECLSPECS and DECLARATOR are the parts of the declaration;
13435 they describe the return type and the name of the function,
13436 but twisted together in a fashion that parallels the syntax of C.
13438 This function creates a binding context for the function body
13439 as well as setting up the FUNCTION_DECL in current_function_decl.
13441 Returns a FUNCTION_DECL on success.
13443 If the DECLARATOR is not suitable for a function (it defines a datum
13444 instead), we return 0, which tells yyparse to report a parse error.
13446 May return void_type_node indicating that this method is actually
13447 a friend. See grokfield for more details.
13449 Came here with a `.pushlevel' .
13451 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13452 CHANGES TO CODE IN `grokfield'. */
13455 start_method (declspecs
, declarator
, attrlist
)
13456 tree declarator
, declspecs
, attrlist
;
13458 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13461 /* Something too ugly to handle. */
13462 if (fndecl
== NULL_TREE
)
13465 /* Pass friends other than inline friend functions back. */
13466 if (fndecl
== void_type_node
)
13469 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13470 /* Not a function, tell parser to report parse error. */
13473 if (IS_SIGNATURE (current_class_type
))
13474 IS_DEFAULT_IMPLEMENTATION (fndecl
) = 1;
13476 if (DECL_IN_AGGR_P (fndecl
))
13478 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13480 if (DECL_CONTEXT (fndecl
)
13481 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13482 cp_error ("`%D' is already defined in class %s", fndecl
,
13483 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13485 return void_type_node
;
13488 DECL_THIS_INLINE (fndecl
) = 1;
13490 if (flag_default_inline
)
13491 DECL_INLINE (fndecl
) = 1;
13493 /* We process method specializations in finish_struct_1. */
13494 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13495 fndecl
= push_template_decl (fndecl
);
13497 /* We read in the parameters on the maybepermanent_obstack,
13498 but we won't be getting back to them until after we
13499 may have clobbered them. So the call to preserve_data
13500 will keep them safe. */
13503 if (! DECL_FRIEND_P (fndecl
))
13505 if (TREE_CHAIN (fndecl
))
13507 fndecl
= copy_node (fndecl
);
13508 TREE_CHAIN (fndecl
) = NULL_TREE
;
13511 if (DECL_CONSTRUCTOR_P (fndecl
))
13513 if (! grok_ctor_properties (current_class_type
, fndecl
))
13514 return void_type_node
;
13516 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13517 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13520 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13522 /* Make a place for the parms */
13524 current_binding_level
->parm_flag
= 1;
13526 DECL_IN_AGGR_P (fndecl
) = 1;
13530 /* Go through the motions of finishing a function definition.
13531 We don't compile this method until after the whole class has
13534 FINISH_METHOD must return something that looks as though it
13535 came from GROKFIELD (since we are defining a method, after all).
13537 This is called after parsing the body of the function definition.
13538 STMTS is the chain of statements that makes up the function body.
13540 DECL is the ..._DECL that `start_method' provided. */
13543 finish_method (decl
)
13546 register tree fndecl
= decl
;
13549 register tree link
;
13551 if (decl
== void_type_node
)
13554 old_initial
= DECL_INITIAL (fndecl
);
13556 /* Undo the level for the parms (from start_method).
13557 This is like poplevel, but it causes nothing to be
13558 saved. Saving information here confuses symbol-table
13559 output routines. Besides, this information will
13560 be correctly output when this method is actually
13563 /* Clear out the meanings of the local variables of this level;
13564 also record in each decl which block it belongs to. */
13566 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13568 if (DECL_NAME (link
) != NULL_TREE
)
13569 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = 0;
13570 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13571 DECL_CONTEXT (link
) = NULL_TREE
;
13574 /* Restore all name-meanings of the outer levels
13575 that were shadowed by this level. */
13577 for (link
= current_binding_level
->shadowed
; link
; link
= TREE_CHAIN (link
))
13578 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
13579 for (link
= current_binding_level
->class_shadowed
;
13580 link
; link
= TREE_CHAIN (link
))
13581 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
13582 for (link
= current_binding_level
->type_shadowed
;
13583 link
; link
= TREE_CHAIN (link
))
13584 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
13586 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13587 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13588 current_binding_level
->parm_flag
,
13589 current_binding_level
->keep
);
13591 poplevel (0, 0, 0);
13593 DECL_INITIAL (fndecl
) = old_initial
;
13595 /* We used to check if the context of FNDECL was different from
13596 current_class_type as another way to get inside here. This didn't work
13597 for String.cc in libg++. */
13598 if (DECL_FRIEND_P (fndecl
))
13600 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13601 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13602 decl
= void_type_node
;
13608 /* Called when a new struct TYPE is defined.
13609 If this structure or union completes the type of any previous
13610 variable declaration, lay it out and output its rtl. */
13613 hack_incomplete_structures (type
)
13618 if (current_binding_level
->incomplete
== NULL_TREE
)
13621 if (!type
) /* Don't do this for class templates. */
13624 for (list
= ¤t_binding_level
->incomplete
; *list
; )
13626 tree decl
= TREE_VALUE (*list
);
13627 if ((decl
&& TREE_TYPE (decl
) == type
)
13628 || (TREE_TYPE (decl
)
13629 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13630 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
13632 int toplevel
= toplevel_bindings_p ();
13633 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13634 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
13635 layout_type (TREE_TYPE (decl
));
13636 layout_decl (decl
, 0);
13637 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
13641 expand_decl (decl
);
13642 cleanup
= maybe_build_cleanup (decl
);
13643 expand_decl_init (decl
);
13644 if (! expand_decl_cleanup (decl
, cleanup
))
13645 cp_error ("parser lost in parsing declaration of `%D'",
13648 *list
= TREE_CHAIN (*list
);
13651 list
= &TREE_CHAIN (*list
);
13655 /* If DECL is of a type which needs a cleanup, build that cleanup here.
13656 See build_delete for information about AUTO_DELETE.
13658 Don't build these on the momentary obstack; they must live
13659 the life of the binding contour. */
13662 maybe_build_cleanup_1 (decl
, auto_delete
)
13663 tree decl
, auto_delete
;
13665 tree type
= TREE_TYPE (decl
);
13666 if (TYPE_NEEDS_DESTRUCTOR (type
))
13668 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
13671 if (TREE_CODE (decl
) != PARM_DECL
)
13672 temp
= suspend_momentary ();
13674 if (TREE_CODE (type
) == ARRAY_TYPE
)
13678 mark_addressable (decl
);
13679 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
13682 /* Optimize for space over speed here. */
13683 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
13684 || flag_expensive_optimizations
)
13685 flags
|= LOOKUP_NONVIRTUAL
;
13687 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
13689 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
13690 && ! TYPE_HAS_DESTRUCTOR (type
))
13691 rval
= build_compound_expr (expr_tree_cons (NULL_TREE
, rval
,
13692 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
13694 if (TREE_CODE (decl
) != PARM_DECL
)
13695 resume_momentary (temp
);
13702 /* If DECL is of a type which needs a cleanup, build that cleanup
13703 here. The cleanup does free the storage with a call to delete. */
13706 maybe_build_cleanup_and_delete (decl
)
13709 return maybe_build_cleanup_1 (decl
, integer_three_node
);
13712 /* If DECL is of a type which needs a cleanup, build that cleanup
13713 here. The cleanup does not free the storage with a call a delete. */
13716 maybe_build_cleanup (decl
)
13719 return maybe_build_cleanup_1 (decl
, integer_two_node
);
13722 /* Expand a C++ expression at the statement level.
13723 This is needed to ferret out nodes which have UNKNOWN_TYPE.
13724 The C++ type checker should get all of these out when
13725 expressions are combined with other, type-providing, expressions,
13726 leaving only orphan expressions, such as:
13728 &class::bar; / / takes its address, but does nothing with it. */
13731 cplus_expand_expr_stmt (exp
)
13734 if (processing_template_decl
)
13736 add_tree (build_min_nt (EXPR_STMT
, exp
));
13740 /* Arrange for all temps to disappear. */
13741 expand_start_target_temps ();
13743 if (TREE_TYPE (exp
) == unknown_type_node
)
13745 if (TREE_CODE (exp
) == ADDR_EXPR
|| TREE_CODE (exp
) == TREE_LIST
)
13746 error ("address of overloaded function with no contextual type information");
13747 else if (TREE_CODE (exp
) == COMPONENT_REF
)
13748 warning ("useless reference to a member function name, did you forget the ()?");
13752 if (TREE_CODE (exp
) == FUNCTION_DECL
)
13754 cp_warning ("reference, not call, to function `%D'", exp
);
13755 warning ("at this point in file");
13759 /* We should do this eventually, but right now this causes regex.o from
13760 libg++ to miscompile, and tString to core dump. */
13761 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
13764 /* Strip unused implicit INDIRECT_REFs of references. */
13765 if (TREE_CODE (exp
) == INDIRECT_REF
13766 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
13767 exp
= TREE_OPERAND (exp
, 0);
13769 /* If we don't do this, we end up down inside expand_expr
13770 trying to do TYPE_MODE on the ERROR_MARK, and really
13771 go outside the bounds of the type. */
13772 if (exp
!= error_mark_node
)
13773 expand_expr_stmt (break_out_cleanups (exp
));
13776 /* Clean up any pending cleanups. This happens when a function call
13777 returns a cleanup-needing value that nobody uses. */
13778 expand_end_target_temps ();
13781 /* When a stmt has been parsed, this function is called.
13783 Currently, this function only does something within a
13784 constructor's scope: if a stmt has just assigned to this,
13785 and we are in a derived class, we call `emit_base_init'. */
13790 extern struct nesting
*cond_stack
, *loop_stack
, *case_stack
;
13793 if (current_function_assigns_this
13794 || ! current_function_just_assigned_this
)
13796 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13798 /* Constructors must wait until we are out of control
13799 zones before calling base constructors. */
13800 if (cond_stack
|| loop_stack
|| case_stack
)
13802 expand_expr_stmt (base_init_expr
);
13803 check_base_init (current_class_type
);
13805 current_function_assigns_this
= 1;
13808 /* Change a static member function definition into a FUNCTION_TYPE, instead
13809 of the METHOD_TYPE that we create when it's originally parsed.
13811 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
13812 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
13813 other decls. Either pass the addresses of local variables or NULL. */
13816 revert_static_member_fn (decl
, fn
, argtypes
)
13817 tree
*decl
, *fn
, *argtypes
;
13820 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
13821 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
13823 if (TYPE_READONLY (TREE_TYPE (TREE_VALUE (args
))))
13824 cp_error ("static member function `%#D' declared const", *decl
);
13825 if (TYPE_VOLATILE (TREE_TYPE (TREE_VALUE (args
))))
13826 cp_error ("static member function `%#D' declared volatile", *decl
);
13828 args
= TREE_CHAIN (args
);
13829 tmp
= build_function_type (TREE_TYPE (function
), args
);
13830 tmp
= build_type_variant (tmp
, TYPE_READONLY (function
),
13831 TYPE_VOLATILE (function
));
13832 tmp
= build_exception_variant (tmp
,
13833 TYPE_RAISES_EXCEPTIONS (function
));
13834 TREE_TYPE (*decl
) = tmp
;
13835 if (DECL_ARGUMENTS (*decl
))
13836 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
13837 DECL_STATIC_FUNCTION_P (*decl
) = 1;
13845 id_in_current_class (id
)
13848 return !!purpose_member (id
, class_binding_level
->class_shadowed
);
13855 int warn_about_return_type
;
13857 int just_assigned_this
;
13859 int temp_name_counter
;
13861 tree shadowed_labels
;
13864 rtx last_dtor_insn
;
13865 rtx last_parm_cleanup_insn
;
13866 tree base_init_list
;
13867 tree member_init_list
;
13868 tree base_init_expr
;
13869 tree current_class_ptr
;
13870 tree current_class_ref
;
13872 struct cp_function
*next
;
13873 struct binding_level
*binding_level
;
13874 int static_labelno
;
13877 static struct cp_function
*cp_function_chain
;
13879 extern int temp_name_counter
;
13881 /* Save and reinitialize the variables
13882 used during compilation of a C++ function. */
13885 push_cp_function_context (context
)
13888 struct cp_function
*p
13889 = (struct cp_function
*) xmalloc (sizeof (struct cp_function
));
13891 push_function_context_to (context
);
13893 p
->next
= cp_function_chain
;
13894 cp_function_chain
= p
;
13896 p
->named_labels
= named_labels
;
13897 p
->shadowed_labels
= shadowed_labels
;
13898 p
->returns_value
= current_function_returns_value
;
13899 p
->returns_null
= current_function_returns_null
;
13900 p
->warn_about_return_type
= warn_about_return_type
;
13901 p
->binding_level
= current_binding_level
;
13902 p
->ctor_label
= ctor_label
;
13903 p
->dtor_label
= dtor_label
;
13904 p
->last_dtor_insn
= last_dtor_insn
;
13905 p
->last_parm_cleanup_insn
= last_parm_cleanup_insn
;
13906 p
->assigns_this
= current_function_assigns_this
;
13907 p
->just_assigned_this
= current_function_just_assigned_this
;
13908 p
->parms_stored
= current_function_parms_stored
;
13909 p
->result_rtx
= original_result_rtx
;
13910 p
->base_init_expr
= base_init_expr
;
13911 p
->temp_name_counter
= temp_name_counter
;
13912 p
->base_init_list
= current_base_init_list
;
13913 p
->member_init_list
= current_member_init_list
;
13914 p
->current_class_ptr
= current_class_ptr
;
13915 p
->current_class_ref
= current_class_ref
;
13916 p
->static_labelno
= static_labelno
;
13919 /* Restore the variables used during compilation of a C++ function. */
13922 pop_cp_function_context (context
)
13925 struct cp_function
*p
= cp_function_chain
;
13928 /* Bring back all the labels that were shadowed. */
13929 for (link
= shadowed_labels
; link
; link
= TREE_CHAIN (link
))
13930 if (DECL_NAME (TREE_VALUE (link
)) != 0)
13931 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link
)),
13932 TREE_VALUE (link
));
13934 pop_function_context_from (context
);
13936 cp_function_chain
= p
->next
;
13938 named_labels
= p
->named_labels
;
13939 shadowed_labels
= p
->shadowed_labels
;
13940 current_function_returns_value
= p
->returns_value
;
13941 current_function_returns_null
= p
->returns_null
;
13942 warn_about_return_type
= p
->warn_about_return_type
;
13943 current_binding_level
= p
->binding_level
;
13944 ctor_label
= p
->ctor_label
;
13945 dtor_label
= p
->dtor_label
;
13946 last_dtor_insn
= p
->last_dtor_insn
;
13947 last_parm_cleanup_insn
= p
->last_parm_cleanup_insn
;
13948 current_function_assigns_this
= p
->assigns_this
;
13949 current_function_just_assigned_this
= p
->just_assigned_this
;
13950 current_function_parms_stored
= p
->parms_stored
;
13951 original_result_rtx
= p
->result_rtx
;
13952 base_init_expr
= p
->base_init_expr
;
13953 temp_name_counter
= p
->temp_name_counter
;
13954 current_base_init_list
= p
->base_init_list
;
13955 current_member_init_list
= p
->member_init_list
;
13956 current_class_ptr
= p
->current_class_ptr
;
13957 current_class_ref
= p
->current_class_ref
;
13958 static_labelno
= p
->static_labelno
;
13966 return function_depth
!= 0;