1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92, 93, 94, 95, 1996 Free Software Foundation, Inc.
3 Hacked 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. */
38 #include <sys/types.h>
43 #define obstack_chunk_alloc xmalloc
44 #define obstack_chunk_free free
46 extern tree builtin_return_address_fndecl
;
48 extern struct obstack permanent_obstack
;
50 extern int current_class_depth
;
52 extern tree cleanups_this_call
;
54 extern tree static_ctors
, static_dtors
;
56 /* Stack of places to restore the search obstack back to. */
58 /* Obstack used for remembering local class declarations (like
59 enums and static (const) members. */
61 struct obstack decl_obstack
;
62 static struct stack_level
*decl_stack
;
64 #ifndef CHAR_TYPE_SIZE
65 #define CHAR_TYPE_SIZE BITS_PER_UNIT
68 #ifndef SHORT_TYPE_SIZE
69 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
73 #define INT_TYPE_SIZE BITS_PER_WORD
76 #ifndef LONG_TYPE_SIZE
77 #define LONG_TYPE_SIZE BITS_PER_WORD
80 #ifndef LONG_LONG_TYPE_SIZE
81 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
84 #ifndef WCHAR_UNSIGNED
85 #define WCHAR_UNSIGNED 0
88 #ifndef FLOAT_TYPE_SIZE
89 #define FLOAT_TYPE_SIZE BITS_PER_WORD
92 #ifndef DOUBLE_TYPE_SIZE
93 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
96 #ifndef LONG_DOUBLE_TYPE_SIZE
97 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
100 #ifndef BOOL_TYPE_SIZE
101 #ifdef SLOW_BYTE_ACCESS
102 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
104 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
108 /* We let tm.h override the types used here, to handle trivial differences
109 such as the choice of unsigned int or long unsigned int for size_t.
110 When machines start needing nontrivial differences in the size type,
111 it would be best to do something here to figure out automatically
112 from other information what type to use. */
115 #define SIZE_TYPE "long unsigned int"
119 #define PTRDIFF_TYPE "long int"
123 #define WCHAR_TYPE "int"
126 static tree grokparms
PROTO((tree
, int));
127 static tree lookup_nested_type
PROTO((tree
, tree
));
128 static char *redeclaration_error_message
PROTO((tree
, tree
));
131 PROTO((char *, tree
, enum built_in_function
, void (*)(), char *));
133 /* a node which has tree code ERROR_MARK, and whose type is itself.
134 All erroneous expressions are replaced with this node. All functions
135 that accept nodes as arguments should avoid generating error messages
136 if this node is one of the arguments, since it is undesirable to get
137 multiple error messages from one error in the input. */
139 tree error_mark_node
;
141 /* Erroneous argument lists can use this *IFF* they do not modify it. */
142 tree error_mark_list
;
144 /* INTEGER_TYPE and REAL_TYPE nodes for the standard data types */
146 tree short_integer_type_node
;
147 tree integer_type_node
;
148 tree long_integer_type_node
;
149 tree long_long_integer_type_node
;
151 tree short_unsigned_type_node
;
152 tree unsigned_type_node
;
153 tree long_unsigned_type_node
;
154 tree long_long_unsigned_type_node
;
156 tree ptrdiff_type_node
;
158 tree unsigned_char_type_node
;
159 tree signed_char_type_node
;
161 tree wchar_type_node
;
162 tree signed_wchar_type_node
;
163 tree unsigned_wchar_type_node
;
165 tree wchar_decl_node
;
167 tree float_type_node
;
168 tree double_type_node
;
169 tree long_double_type_node
;
171 tree intQI_type_node
;
172 tree intHI_type_node
;
173 tree intSI_type_node
;
174 tree intDI_type_node
;
176 tree unsigned_intQI_type_node
;
177 tree unsigned_intHI_type_node
;
178 tree unsigned_intSI_type_node
;
179 tree unsigned_intDI_type_node
;
181 /* a VOID_TYPE node, and the same, packaged in a TREE_LIST. */
183 tree void_type_node
, void_list_node
;
186 /* Nodes for types `void *' and `const void *'. */
188 tree ptr_type_node
, const_ptr_type_node
;
190 /* Nodes for types `char *' and `const char *'. */
192 tree string_type_node
, const_string_type_node
;
194 /* Type `char[256]' or something like it.
195 Used when an array of char is needed and the size is irrelevant. */
197 tree char_array_type_node
;
199 /* Type `int[256]' or something like it.
200 Used when an array of int needed and the size is irrelevant. */
202 tree int_array_type_node
;
204 /* Type `wchar_t[256]' or something like it.
205 Used when a wide string literal is created. */
207 tree wchar_array_type_node
;
209 /* The bool data type, and constants */
210 tree boolean_type_node
, boolean_true_node
, boolean_false_node
;
212 /* type `int ()' -- used for implicit declaration of functions. */
214 tree default_function_type
;
216 /* function types `double (double)' and `double (double, double)', etc. */
218 tree double_ftype_double
, double_ftype_double_double
;
219 tree int_ftype_int
, long_ftype_long
;
220 tree float_ftype_float
;
221 tree ldouble_ftype_ldouble
;
223 /* Function type `int (const void *, const void *, size_t)' */
224 static tree int_ftype_cptr_cptr_sizet
;
227 tree vtable_entry_type
;
228 tree delta_type_node
;
230 /* Old rtti stuff. */
231 tree __baselist_desc_type_node
;
232 tree __i_desc_type_node
, __m_desc_type_node
;
233 tree __t_desc_array_type
, __i_desc_array_type
, __m_desc_array_type
;
235 tree __t_desc_type_node
;
237 tree __tp_desc_type_node
;
239 tree __access_mode_type_node
;
240 tree __bltn_desc_type_node
, __user_desc_type_node
, __class_desc_type_node
;
241 tree __ptr_desc_type_node
, __attr_desc_type_node
, __func_desc_type_node
;
242 tree __ptmf_desc_type_node
, __ptmd_desc_type_node
;
244 /* Not needed yet? May be needed one day? */
245 tree __bltn_desc_array_type
, __user_desc_array_type
, __class_desc_array_type
;
246 tree __ptr_desc_array_type
, __attr_dec_array_type
, __func_desc_array_type
;
247 tree __ptmf_desc_array_type
, __ptmd_desc_array_type
;
250 tree class_star_type_node
;
251 tree class_type_node
, record_type_node
, union_type_node
, enum_type_node
;
252 tree unknown_type_node
;
253 tree opaque_type_node
, signature_type_node
;
254 tree sigtable_entry_type
;
256 /* Array type `vtable_entry_type[]' */
259 /* In a destructor, the point at which all derived class destroying
260 has been done, just before any base class destroying will be done. */
264 /* In a destructor, the last insn emitted after the start of the
265 function and the parms. */
269 /* In a constructor, the point at which we are ready to return
270 the pointer to the initialized object. */
274 /* A FUNCTION_DECL which can call `abort'. Not necessarily the
275 one that the user will declare, but sufficient to be called
276 by routines that want to abort the program. */
280 extern rtx cleanup_label
, return_label
;
282 /* If original DECL_RESULT of current function was a register,
283 but due to being an addressable named return value, would up
284 on the stack, this variable holds the named return value's
285 original location. */
286 rtx original_result_rtx
;
288 /* Sequence of insns which represents base initialization. */
291 /* C++: Keep these around to reduce calls to `get_identifier'.
292 Identifiers for `this' in member functions and the auto-delete
293 parameter for destructors. */
294 tree this_identifier
, in_charge_identifier
;
295 tree ctor_identifier
, dtor_identifier
;
296 /* Used in pointer to member functions, in vtables, and in sigtables. */
297 tree pfn_identifier
, index_identifier
, delta_identifier
, delta2_identifier
;
298 tree pfn_or_delta2_identifier
, tag_identifier
;
299 tree vt_off_identifier
;
301 struct named_label_list
303 struct binding_level
*binding_level
;
306 char *filename_o_goto
;
308 struct named_label_list
*next
;
311 /* A list (chain of TREE_LIST nodes) of named label uses.
312 The TREE_PURPOSE field is the list of variables defined
313 the the label's scope defined at the point of use.
314 The TREE_VALUE field is the LABEL_DECL used.
315 The TREE_TYPE field holds `current_binding_level' at the
316 point of the label's use.
318 BWAHAHAAHAHahhahahahaah. No, no, no, said the little chicken.
320 Look at the pretty struct named_label_list. See the pretty struct
321 with the pretty named fields that describe what they do. See the
322 pretty lack of gratuitous casts. Notice the code got a lot cleaner.
324 Used only for jumps to as-yet undefined labels, since
325 jumps to defined labels can have their validity checked
328 static struct named_label_list
*named_label_uses
= NULL
;
330 /* A list of objects which have constructors or destructors
331 which reside in the global scope. The decl is stored in
332 the TREE_VALUE slot and the initializer is stored
333 in the TREE_PURPOSE slot. */
334 tree static_aggregates
;
338 /* Two expressions that are constants with value zero.
339 The first is of type `int', the second of type `void *'. */
341 tree integer_zero_node
;
342 tree null_pointer_node
;
344 /* The value for __null (NULL), either of type `void *' or, with -ansi,
345 an integer type of the same size. */
349 /* A node for the integer constants 1, 2, and 3. */
351 tree integer_one_node
, integer_two_node
, integer_three_node
;
353 /* Nonzero if we have seen an invalid cross reference
354 to a struct, union, or enum, but not yet printed the message. */
356 tree pending_invalid_xref
;
357 /* File and line to appear in the eventual error message. */
358 char *pending_invalid_xref_file
;
359 int pending_invalid_xref_line
;
361 /* While defining an enum type, this is 1 plus the last enumerator
364 static tree enum_next_value
;
366 /* Nonzero means that there was overflow computing enum_next_value. */
368 static int enum_overflow
;
370 /* Parsing a function declarator leaves a list of parameter names
371 or a chain or parameter decls here. */
373 tree last_function_parms
;
375 /* Parsing a function declarator leaves here a chain of structure
376 and enum types declared in the parmlist. */
378 static tree last_function_parm_tags
;
380 /* After parsing the declarator that starts a function definition,
381 `start_function' puts here the list of parameter names or chain of decls.
382 `store_parm_decls' finds it here. */
384 static tree current_function_parms
;
386 /* Similar, for last_function_parm_tags. */
387 static tree current_function_parm_tags
;
389 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
390 that have names. Here so we can clear out their names' definitions
391 at the end of the function. */
393 static tree named_labels
;
395 /* A list of LABEL_DECLs from outer contexts that are currently shadowed. */
397 static tree shadowed_labels
;
399 /* The FUNCTION_DECL for the function currently being compiled,
400 or 0 if between functions. */
401 tree current_function_decl
;
403 /* Set to 0 at beginning of a function definition, set to 1 if
404 a return statement that specifies a return value is seen. */
406 int current_function_returns_value
;
408 /* Set to 0 at beginning of a function definition, set to 1 if
409 a return statement with no argument is seen. */
411 int current_function_returns_null
;
413 /* Set to 0 at beginning of a function definition, and whenever
414 a label (case or named) is defined. Set to value of expression
415 returned from function when that value can be transformed into
416 a named return value. */
418 tree current_function_return_value
;
420 /* Set to nonzero by `grokdeclarator' for a function
421 whose return type is defaulted, if warnings for this are desired. */
423 static int warn_about_return_type
;
425 /* Nonzero means give `double' the same size as `float'. */
427 extern int flag_short_double
;
429 /* Nonzero means don't recognize any builtin functions. */
431 extern int flag_no_builtin
;
433 /* Nonzero means don't recognize the non-ANSI builtin functions.
436 extern int flag_no_nonansi_builtin
;
438 /* Nonzero means enable obscure ANSI features and disable GNU extensions
439 that might cause ANSI-compliant code to be miscompiled. */
441 extern int flag_ansi
;
443 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
445 extern int flag_huge_objects
;
447 /* Nonzero if we want to conserve space in the .o files. We do this
448 by putting uninitialized data and runtime initialized data into
449 .common instead of .data at the expense of not flagging multiple
451 extern int flag_conserve_space
;
453 /* Pointers to the base and current top of the language name stack. */
455 extern tree
*current_lang_base
, *current_lang_stack
;
457 /* C and C++ flags are in decl2.c. */
459 /* Set to 0 at beginning of a constructor, set to 1
460 if that function does an allocation before referencing its
461 instance variable. */
462 static int current_function_assigns_this
;
463 int current_function_just_assigned_this
;
465 /* Set to 0 at beginning of a function. Set non-zero when
466 store_parm_decls is called. Don't call store_parm_decls
467 if this flag is non-zero! */
468 int current_function_parms_stored
;
470 /* Flag used when debugging spew.c */
472 extern int spew_debug
;
474 /* This is a copy of the class_shadowed list of the previous class binding
475 contour when at global scope. It's used to reset IDENTIFIER_CLASS_VALUEs
476 when entering another class scope (i.e. a cache miss). */
477 extern tree previous_class_values
;
479 /* A expression of value 0 with the same precision as a sizetype
481 tree signed_size_zero_node
;
484 /* Allocate a level of searching. */
488 push_decl_level (stack
, obstack
)
489 struct stack_level
*stack
;
490 struct obstack
*obstack
;
492 struct stack_level tem
;
495 return push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
498 /* For each binding contour we allocate a binding_level structure
499 which records the names defined in that contour.
502 1) one for each function definition,
503 where internal declarations of the parameters appear.
504 2) one for each compound statement,
505 to record its declarations.
507 The current meaning of a name can be found by searching the levels
508 from the current one out to the global one.
510 Off to the side, may be the class_binding_level. This exists only
511 to catch class-local declarations. It is otherwise nonexistent.
513 Also there may be binding levels that catch cleanups that must be
514 run when exceptions occur. */
516 /* Note that the information in the `names' component of the global contour
517 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
521 /* A chain of _DECL nodes for all variables, constants, functions,
522 and typedef types. These are in the reverse of the order
526 /* A list of structure, union and enum definitions, for looking up
528 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
529 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
530 or ENUMERAL_TYPE node.
532 C++: the TREE_VALUE nodes can be simple types for
533 component_bindings. */
536 /* For each level, a list of shadowed outer-level local definitions
537 to be restored when this level is popped.
538 Each link is a TREE_LIST whose TREE_PURPOSE is an identifier and
539 whose TREE_VALUE is its old definition (a kind of ..._DECL node). */
542 /* Same, for IDENTIFIER_CLASS_VALUE. */
545 /* Same, for IDENTIFIER_TYPE_VALUE. */
548 /* For each level (except not the global one),
549 a chain of BLOCK nodes for all the levels
550 that were entered and exited one level down. */
553 /* The BLOCK node for this level, if one has been preallocated.
554 If 0, the BLOCK is allocated (if needed) when the level is popped. */
557 /* The binding level which this one is contained in (inherits from). */
558 struct binding_level
*level_chain
;
560 /* List of decls in `names' that have incomplete
561 structure or union types. */
564 /* List of VAR_DECLS saved from a previous for statement.
565 These would be dead in ANSI-conforming code, but might
566 be referenced in ARM-era code. */
567 tree dead_vars_from_for
;
569 /* 1 for the level that holds the parameters of a function.
570 2 for the level that holds a class declaration.
571 3 for levels that hold parameter declarations. */
572 unsigned parm_flag
: 4;
574 /* 1 means make a BLOCK for this level regardless of all else.
575 2 for temporary binding contours created by the compiler. */
578 /* Nonzero if this level "doesn't exist" for tags. */
579 unsigned tag_transparent
: 1;
581 /* Nonzero if this level can safely have additional
582 cleanup-needing variables added to it. */
583 unsigned more_cleanups_ok
: 1;
584 unsigned have_cleanups
: 1;
586 /* Nonzero if this level is for storing the decls for template
587 parameters and generic decls; these decls will be discarded and
588 replaced with a TEMPLATE_DECL. */
589 unsigned pseudo_global
: 1;
591 /* This is set for a namespace binding level. */
592 unsigned namespace_p
: 1;
594 /* True if this level is that of a for-statement where we need to
595 worry about ambiguous (ARM or ANSI) scope rules. */
596 unsigned is_for_scope
: 1;
598 /* Two bits left for this word. */
600 #if defined(DEBUG_CP_BINDING_LEVELS)
601 /* Binding depth at which this level began. */
602 unsigned binding_depth
;
603 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
606 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
608 /* The (non-class) binding level currently in effect. */
610 static struct binding_level
*current_binding_level
;
612 /* The binding level of the current class, if any. */
614 static struct binding_level
*class_binding_level
;
616 /* The current (class or non-class) binding level currently in effect. */
618 #define inner_binding_level \
619 (class_binding_level ? class_binding_level : current_binding_level)
621 /* A chain of binding_level structures awaiting reuse. */
623 static struct binding_level
*free_binding_level
;
625 /* The outermost binding level, for names of file scope.
626 This is created when the compiler is started and exists
627 through the entire run. */
629 static struct binding_level
*global_binding_level
;
631 /* Binding level structures are initialized by copying this one. */
633 static struct binding_level clear_binding_level
;
635 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
637 static int keep_next_level_flag
;
639 #if defined(DEBUG_CP_BINDING_LEVELS)
640 static int binding_depth
= 0;
641 static int is_class_level
= 0;
648 for (i
= 0; i
< binding_depth
*2; i
++)
651 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
653 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
656 push_binding_level (newlevel
, tag_transparent
, keep
)
657 struct binding_level
*newlevel
;
658 int tag_transparent
, keep
;
660 /* Add this level to the front of the chain (stack) of levels that
662 *newlevel
= clear_binding_level
;
663 if (class_binding_level
)
665 newlevel
->level_chain
= class_binding_level
;
666 class_binding_level
= (struct binding_level
*)0;
670 newlevel
->level_chain
= current_binding_level
;
672 current_binding_level
= newlevel
;
673 newlevel
->tag_transparent
= tag_transparent
;
674 newlevel
->more_cleanups_ok
= 1;
675 newlevel
->keep
= keep
;
676 #if defined(DEBUG_CP_BINDING_LEVELS)
677 newlevel
->binding_depth
= binding_depth
;
679 fprintf (stderr
, "push %s level 0x%08x line %d\n",
680 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
683 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
689 if (class_binding_level
)
690 current_binding_level
= class_binding_level
;
692 if (global_binding_level
)
694 /* cannot pop a level, if there are none left to pop. */
695 if (current_binding_level
== global_binding_level
)
696 my_friendly_abort (123);
698 /* Pop the current level, and free the structure for reuse. */
699 #if defined(DEBUG_CP_BINDING_LEVELS)
702 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
703 (is_class_level
) ? "class" : "block",
704 current_binding_level
, lineno
);
705 if (is_class_level
!= (current_binding_level
== class_binding_level
))
708 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
711 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
713 register struct binding_level
*level
= current_binding_level
;
714 current_binding_level
= current_binding_level
->level_chain
;
715 level
->level_chain
= free_binding_level
;
716 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
717 if (level
->binding_depth
!= binding_depth
)
719 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
720 free_binding_level
= level
;
722 class_binding_level
= current_binding_level
;
723 if (class_binding_level
->parm_flag
!= 2)
724 class_binding_level
= 0;
725 while (current_binding_level
->parm_flag
== 2)
726 current_binding_level
= current_binding_level
->level_chain
;
731 suspend_binding_level ()
733 if (class_binding_level
)
734 current_binding_level
= class_binding_level
;
736 if (global_binding_level
)
738 /* cannot suspend a level, if there are none left to suspend. */
739 if (current_binding_level
== global_binding_level
)
740 my_friendly_abort (123);
742 /* Suspend the current level. */
743 #if defined(DEBUG_CP_BINDING_LEVELS)
746 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
747 (is_class_level
) ? "class" : "block",
748 current_binding_level
, lineno
);
749 if (is_class_level
!= (current_binding_level
== class_binding_level
))
752 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
755 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
757 current_binding_level
= current_binding_level
->level_chain
;
758 class_binding_level
= current_binding_level
;
759 if (class_binding_level
->parm_flag
!= 2)
760 class_binding_level
= 0;
761 while (current_binding_level
->parm_flag
== 2)
762 current_binding_level
= current_binding_level
->level_chain
;
767 resume_binding_level (b
)
768 struct binding_level
*b
;
770 if (class_binding_level
)
773 /* These are here because we cannot deal with shadows yet. */
774 sorry ("cannot resume a namespace inside class");
777 b
->level_chain
= class_binding_level
;
778 class_binding_level
= (struct binding_level
*)0;
784 /* These are here because we cannot deal with shadows yet. */
785 if (b
->level_chain
!= current_binding_level
)
787 sorry ("cannot resume a namespace inside a different namespace");
791 b
->level_chain
= current_binding_level
;
793 current_binding_level
= b
;
794 #if defined(DEBUG_CP_BINDING_LEVELS)
795 b
->binding_depth
= binding_depth
;
797 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
798 (is_class_level
) ? "class" : "block", b
, lineno
);
801 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
804 /* Create a new `struct binding_level'. */
807 struct binding_level
*
808 make_binding_level ()
811 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
814 /* Nonzero if we are currently in the global binding level. */
819 return current_binding_level
== global_binding_level
;
822 /* Nonzero if we are currently in a toplevel binding level. This
823 means either the global binding level or a namespace in a toplevel
827 toplevel_bindings_p ()
829 struct binding_level
*b
= current_binding_level
;
833 if (b
== global_binding_level
)
835 if (b
->pseudo_global
)
837 if (! b
->namespace_p
)
843 /* Nonzero if this is a namespace scope. */
846 namespace_bindings_p ()
848 return current_binding_level
->namespace_p
;
854 keep_next_level_flag
= 1;
857 /* Nonzero if the current level needs to have a BLOCK made. */
862 return (current_binding_level
->blocks
!= NULL_TREE
863 || current_binding_level
->keep
864 || current_binding_level
->names
!= NULL_TREE
865 || (current_binding_level
->tags
!= NULL_TREE
866 && !current_binding_level
->tag_transparent
));
869 /* Identify this binding level as a level of parameters. */
872 declare_parm_level ()
874 current_binding_level
->parm_flag
= 1;
878 declare_pseudo_global_level ()
880 current_binding_level
->pseudo_global
= 1;
884 declare_namespace_level ()
886 current_binding_level
->namespace_p
= 1;
890 pseudo_global_level_p ()
892 return current_binding_level
->pseudo_global
;
896 set_class_shadows (shadows
)
899 class_binding_level
->class_shadowed
= shadows
;
902 /* Enter a new binding level.
903 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
904 not for that of tags. */
907 pushlevel (tag_transparent
)
910 register struct binding_level
*newlevel
= NULL_BINDING_LEVEL
;
912 /* If this is the top level of a function,
913 just make sure that NAMED_LABELS is 0.
914 They should have been set to 0 at the end of the previous function. */
916 if (current_binding_level
== global_binding_level
)
917 my_friendly_assert (named_labels
== NULL_TREE
, 134);
919 /* Reuse or create a struct for this binding level. */
921 #if defined(DEBUG_CP_BINDING_LEVELS)
923 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
924 if (free_binding_level
)
925 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
927 newlevel
= free_binding_level
;
928 free_binding_level
= free_binding_level
->level_chain
;
932 newlevel
= make_binding_level ();
935 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
936 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
937 keep_next_level_flag
= 0;
941 note_level_for_for ()
943 current_binding_level
->is_for_scope
= 1;
947 pushlevel_temporary (tag_transparent
)
950 pushlevel (tag_transparent
);
951 current_binding_level
->keep
= 2;
954 /* Note we don't call push_momentary() here. Otherwise, it would cause
955 cleanups to be allocated on the momentary obstack, and they will be
956 overwritten by the next statement. */
958 expand_start_bindings (0);
961 /* Exit a binding level.
962 Pop the level off, and restore the state of the identifier-decl mappings
963 that were in effect when this level was entered.
965 If KEEP == 1, this level had explicit declarations, so
966 and create a "block" (a BLOCK node) for the level
967 to record its declarations and subblocks for symbol table output.
969 If KEEP == 2, this level's subblocks go to the front,
970 not the back of the current binding level. This happens,
971 for instance, when code for constructors and destructors
972 need to generate code at the end of a function which must
973 be moved up to the front of the function.
975 If FUNCTIONBODY is nonzero, this level is the body of a function,
976 so create a block as if KEEP were set and also clear out all
979 If REVERSE is nonzero, reverse the order of decls before putting
980 them into the BLOCK. */
983 poplevel (keep
, reverse
, functionbody
)
989 /* The chain of decls was accumulated in reverse order.
990 Put it into forward order, just for cleanliness. */
992 int tmp
= functionbody
;
993 int real_functionbody
= current_binding_level
->keep
== 2
994 ? ((functionbody
= 0), tmp
) : functionbody
;
995 tree tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
996 tree subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
997 tree block
= NULL_TREE
;
999 int block_previously_created
;
1001 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1002 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1003 current_binding_level
->parm_flag
,
1004 current_binding_level
->keep
);
1006 if (current_binding_level
->keep
== 1)
1009 /* Get the decls in the order they were written.
1010 Usually current_binding_level->names is in reverse order.
1011 But parameter decls were previously put in forward order. */
1014 current_binding_level
->names
1015 = decls
= nreverse (current_binding_level
->names
);
1017 decls
= current_binding_level
->names
;
1019 /* Output any nested inline functions within this block
1020 if they weren't already output. */
1022 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1023 if (TREE_CODE (decl
) == FUNCTION_DECL
1024 && ! TREE_ASM_WRITTEN (decl
)
1025 && DECL_INITIAL (decl
) != NULL_TREE
1026 && TREE_ADDRESSABLE (decl
)
1027 && decl_function_context (decl
) == current_function_decl
)
1029 /* If this decl was copied from a file-scope decl
1030 on account of a block-scope extern decl,
1031 propagate TREE_ADDRESSABLE to the file-scope decl. */
1032 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1033 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1036 push_function_context ();
1037 output_inline_function (decl
);
1038 pop_function_context ();
1042 /* If there were any declarations or structure tags in that level,
1043 or if this level is a function body,
1044 create a BLOCK to record them for the life of this function. */
1047 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1048 if (block_previously_created
)
1049 block
= current_binding_level
->this_block
;
1050 else if (keep
== 1 || functionbody
)
1051 block
= make_node (BLOCK
);
1052 if (block
!= NULL_TREE
)
1054 if (block_previously_created
)
1056 if (decls
|| tags
|| subblocks
)
1058 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1060 warning ("internal compiler error: debugging info corrupted");
1062 BLOCK_VARS (block
) = decls
;
1063 BLOCK_TYPE_TAGS (block
) = tags
;
1065 /* We can have previous subblocks and new subblocks when
1066 doing fixup_gotos with complex cleanups. We chain the new
1067 subblocks onto the end of any pre-existing subblocks. */
1068 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1071 /* If we created the block earlier on, and we are just
1072 diddling it now, then it already should have a proper
1073 BLOCK_END_NOTE value associated with it. */
1077 BLOCK_VARS (block
) = decls
;
1078 BLOCK_TYPE_TAGS (block
) = tags
;
1079 BLOCK_SUBBLOCKS (block
) = subblocks
;
1080 /* Otherwise, for a new block, install a new BLOCK_END_NOTE value. */
1081 remember_end_note (block
);
1085 /* In each subblock, record that this is its superior. */
1088 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1089 BLOCK_SUPERCONTEXT (link
) = block
;
1091 /* Clear out the meanings of the local variables of this level. */
1093 if (current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1)
1095 struct binding_level
*outer
= current_binding_level
->level_chain
;
1096 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1098 if (TREE_CODE (link
) == VAR_DECL
)
1099 DECL_DEAD_FOR_LOCAL (link
) = 1;
1101 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = NULL_TREE
;
1104 /* Save declarations made in a 'for' statement so we can support pre-ANSI
1105 'for' scoping semantics. */
1107 for (link
= current_binding_level
->shadowed
; link
; link
= TREE_CHAIN (link
))
1109 tree id
= TREE_PURPOSE (link
);
1110 tree decl
= IDENTIFIER_LOCAL_VALUE (id
);
1112 if (decl
&& DECL_DEAD_FOR_LOCAL (decl
))
1114 /* In this case keep the dead for-decl visible,
1115 but remember what (if anything) it shadowed. */
1116 DECL_SHADOWED_FOR_VAR (decl
) = TREE_VALUE (link
);
1117 TREE_CHAIN (decl
) = outer
->dead_vars_from_for
;
1118 outer
->dead_vars_from_for
= decl
;
1121 IDENTIFIER_LOCAL_VALUE (id
) = TREE_VALUE (link
);
1124 else /* Not special for scope. */
1126 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1128 if (DECL_NAME (link
) != NULL_TREE
)
1130 /* If the ident. was used or addressed via a local extern decl,
1131 don't forget that fact. */
1132 if (DECL_EXTERNAL (link
))
1134 if (TREE_USED (link
))
1135 TREE_USED (DECL_ASSEMBLER_NAME (link
)) = 1;
1136 if (TREE_ADDRESSABLE (link
))
1137 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (link
)) = 1;
1139 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = NULL_TREE
;
1143 /* Restore all name-meanings of the outer levels
1144 that were shadowed by this level. */
1146 for (link
= current_binding_level
->shadowed
;
1147 link
; link
= TREE_CHAIN (link
))
1148 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1150 /* We first restore the regular decls and *then* the dead_vars_from_for
1151 to handle this case:
1155 for (int i; ; ) { ...} // i#2
1159 In this case, we want remove the binding for i#3, restoring
1160 that of i#2. Then we want to remove the binding for i#2,
1161 and restore that of i#1. */
1163 link
= current_binding_level
->dead_vars_from_for
;
1164 for (; link
!= NULL_TREE
; link
= TREE_CHAIN (link
))
1166 tree id
= DECL_NAME (link
);
1167 if (IDENTIFIER_LOCAL_VALUE (id
) == link
)
1168 IDENTIFIER_LOCAL_VALUE (id
) = DECL_SHADOWED_FOR_VAR (link
);
1171 for (link
= current_binding_level
->class_shadowed
;
1172 link
; link
= TREE_CHAIN (link
))
1173 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1174 for (link
= current_binding_level
->type_shadowed
;
1175 link
; link
= TREE_CHAIN (link
))
1176 IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1179 /* If the level being exited is the top level of a function,
1180 check over all the labels. */
1184 /* If this is the top level block of a function,
1185 the vars are the function's parameters.
1186 Don't leave them in the BLOCK because they are
1187 found in the FUNCTION_DECL instead. */
1189 BLOCK_VARS (block
) = 0;
1191 /* Clear out the definitions of all label names,
1192 since their scopes end here. */
1194 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1196 register tree label
= TREE_VALUE (link
);
1198 if (DECL_INITIAL (label
) == NULL_TREE
)
1200 cp_error_at ("label `%D' used but not defined", label
);
1201 /* Avoid crashing later. */
1202 define_label (input_filename
, 1, DECL_NAME (label
));
1204 else if (warn_unused
&& !TREE_USED (label
))
1205 cp_warning_at ("label `%D' defined but not used", label
);
1206 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), NULL_TREE
);
1208 /* Put the labels into the "variables" of the
1209 top-level block, so debugger can see them. */
1210 TREE_CHAIN (label
) = BLOCK_VARS (block
);
1211 BLOCK_VARS (block
) = label
;
1214 named_labels
= NULL_TREE
;
1217 /* Any uses of undefined labels now operate under constraints
1218 of next binding contour. */
1220 struct binding_level
*level_chain
;
1221 level_chain
= current_binding_level
->level_chain
;
1224 struct named_label_list
*labels
;
1225 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1226 if (labels
->binding_level
== current_binding_level
)
1228 labels
->binding_level
= level_chain
;
1229 labels
->names_in_scope
= level_chain
->names
;
1234 tmp
= current_binding_level
->keep
;
1236 pop_binding_level ();
1238 DECL_INITIAL (current_function_decl
) = block
;
1241 if (!block_previously_created
)
1242 current_binding_level
->blocks
1243 = chainon (current_binding_level
->blocks
, block
);
1245 /* If we did not make a block for the level just exited,
1246 any blocks made for inner levels
1247 (since they cannot be recorded as subblocks in that level)
1248 must be carried forward so they will later become subblocks
1249 of something else. */
1253 current_binding_level
->blocks
1254 = chainon (subblocks
, current_binding_level
->blocks
);
1256 current_binding_level
->blocks
1257 = chainon (current_binding_level
->blocks
, subblocks
);
1260 /* Take care of compiler's internal binding structures. */
1263 expand_end_bindings (getdecls (), keep
, 1);
1264 /* Each and every BLOCK node created here in `poplevel' is important
1265 (e.g. for proper debugging information) so if we created one
1266 earlier, mark it as "used". */
1268 TREE_USED (block
) = 1;
1269 block
= poplevel (keep
, reverse
, real_functionbody
);
1272 /* Each and every BLOCK node created here in `poplevel' is important
1273 (e.g. for proper debugging information) so if we created one
1274 earlier, mark it as "used". */
1276 TREE_USED (block
) = 1;
1280 /* Resume a binding level for a namespace. */
1284 struct binding_level
*b
;
1288 resume_binding_level (b
);
1290 /* Resume the variable caches. */
1291 decls
= current_binding_level
->names
;
1293 /* Restore the meanings of the local variables of this level. */
1295 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1297 /* If it doesn't have a name, there is nothing left to do with it. */
1298 if (DECL_NAME (link
) == NULL_TREE
)
1301 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = link
;
1303 /* If this is a TYPE_DECL, push it into the type value slot. */
1304 if (TREE_CODE (link
) == TYPE_DECL
)
1305 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (link
), TREE_TYPE (link
));
1309 /* Delete the node BLOCK from the current binding level.
1310 This is used for the block inside a stmt expr ({...})
1311 so that the block can be reinserted where appropriate. */
1314 delete_block (block
)
1318 if (current_binding_level
->blocks
== block
)
1319 current_binding_level
->blocks
= TREE_CHAIN (block
);
1320 for (t
= current_binding_level
->blocks
; t
;)
1322 if (TREE_CHAIN (t
) == block
)
1323 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1327 TREE_CHAIN (block
) = NULL_TREE
;
1328 /* Clear TREE_USED which is always set by poplevel.
1329 The flag is set again if insert_block is called. */
1330 TREE_USED (block
) = 0;
1333 /* Insert BLOCK at the end of the list of subblocks of the
1334 current binding level. This is used when a BIND_EXPR is expanded,
1335 to handle the BLOCK node inside the BIND_EXPR. */
1338 insert_block (block
)
1341 TREE_USED (block
) = 1;
1342 current_binding_level
->blocks
1343 = chainon (current_binding_level
->blocks
, block
);
1346 /* Add BLOCK to the current list of blocks for this binding contour. */
1349 add_block_current_level (block
)
1352 current_binding_level
->blocks
1353 = chainon (current_binding_level
->blocks
, block
);
1356 /* Set the BLOCK node for the innermost scope
1357 (the one we are currently in). */
1361 register tree block
;
1363 current_binding_level
->this_block
= block
;
1366 /* Do a pushlevel for class declarations. */
1371 register struct binding_level
*newlevel
;
1373 /* Reuse or create a struct for this binding level. */
1374 #if defined(DEBUG_CP_BINDING_LEVELS)
1376 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1377 if (free_binding_level
)
1378 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1380 newlevel
= free_binding_level
;
1381 free_binding_level
= free_binding_level
->level_chain
;
1385 newlevel
= make_binding_level ();
1388 #if defined(DEBUG_CP_BINDING_LEVELS)
1390 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1392 push_binding_level (newlevel
, 0, 0);
1394 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1395 class_binding_level
= current_binding_level
;
1396 class_binding_level
->parm_flag
= 2;
1397 /* We have just pushed into a new binding level. Now, fake out the rest
1398 of the compiler. Set the `current_binding_level' back to point to
1399 the most closely containing non-class binding level. */
1402 current_binding_level
= current_binding_level
->level_chain
;
1404 while (current_binding_level
->parm_flag
== 2);
1407 /* ...and a poplevel for class declarations. FORCE is used to force
1408 clearing out of CLASS_VALUEs after a class definition. */
1411 poplevel_class (force
)
1414 register struct binding_level
*level
= class_binding_level
;
1415 tree block
= NULL_TREE
;
1418 my_friendly_assert (level
!= 0, 354);
1420 decl_stack
= pop_stack_level (decl_stack
);
1421 for (shadowed
= level
->shadowed
; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
1422 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (shadowed
)) = TREE_VALUE (shadowed
);
1423 /* If we're leaving a toplevel class, don't bother to do the setting
1424 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1425 shouldn't even be used when current_class_type isn't set, and second,
1426 if we don't touch it here, we're able to use the cache effect if the
1427 next time we're entering a class scope, it is the same class. */
1428 if (current_class_depth
!= 1 || force
)
1429 for (shadowed
= level
->class_shadowed
;
1431 shadowed
= TREE_CHAIN (shadowed
))
1432 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = TREE_VALUE (shadowed
);
1434 /* Remember to save what IDENTIFIER's were bound in this scope so we
1435 can recover from cache misses. */
1437 previous_class_type
= current_class_type
;
1438 previous_class_values
= class_binding_level
->class_shadowed
;
1440 for (shadowed
= level
->type_shadowed
;
1442 shadowed
= TREE_CHAIN (shadowed
))
1443 IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
)) = TREE_VALUE (shadowed
);
1445 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1446 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1447 class_binding_level
->parm_flag
,
1448 class_binding_level
->keep
);
1450 if (class_binding_level
->parm_flag
!= 2)
1451 class_binding_level
= (struct binding_level
*)0;
1453 /* Now, pop out of the the binding level which we created up in the
1454 `pushlevel_class' routine. */
1455 #if defined(DEBUG_CP_BINDING_LEVELS)
1457 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1459 pop_binding_level ();
1464 /* For debugging. */
1465 static int no_print_functions
= 0;
1466 static int no_print_builtins
= 0;
1469 print_binding_level (lvl
)
1470 struct binding_level
*lvl
;
1474 fprintf (stderr
, " blocks=");
1475 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1476 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1477 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1478 if (lvl
->tag_transparent
)
1479 fprintf (stderr
, " tag-transparent");
1480 if (lvl
->more_cleanups_ok
)
1481 fprintf (stderr
, " more-cleanups-ok");
1482 if (lvl
->have_cleanups
)
1483 fprintf (stderr
, " have-cleanups");
1484 fprintf (stderr
, "\n");
1487 fprintf (stderr
, " names:\t");
1488 /* We can probably fit 3 names to a line? */
1489 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1491 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1493 if (no_print_builtins
1494 && (TREE_CODE (t
) == TYPE_DECL
)
1495 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1498 /* Function decls tend to have longer names. */
1499 if (TREE_CODE (t
) == FUNCTION_DECL
)
1506 fprintf (stderr
, "\n\t");
1509 print_node_brief (stderr
, "", t
, 0);
1510 if (TREE_CODE (t
) == ERROR_MARK
)
1514 fprintf (stderr
, "\n");
1518 fprintf (stderr
, " tags:\t");
1520 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1522 if (TREE_PURPOSE (t
) == NULL_TREE
)
1524 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1531 fprintf (stderr
, "\n\t");
1534 if (TREE_PURPOSE (t
) == NULL_TREE
)
1536 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1537 fprintf (stderr
, ">");
1539 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1540 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1543 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1544 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1545 fprintf (stderr
, ">");
1549 fprintf (stderr
, "\n");
1553 fprintf (stderr
, " shadowed:");
1554 for (t
= lvl
->shadowed
; t
; t
= TREE_CHAIN (t
))
1556 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1558 fprintf (stderr
, "\n");
1560 if (lvl
->class_shadowed
)
1562 fprintf (stderr
, " class-shadowed:");
1563 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1565 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1567 fprintf (stderr
, "\n");
1569 if (lvl
->type_shadowed
)
1571 fprintf (stderr
, " type-shadowed:");
1572 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1574 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1576 fprintf (stderr
, "\n");
1581 print_other_binding_stack (stack
)
1582 struct binding_level
*stack
;
1584 struct binding_level
*level
;
1585 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1587 fprintf (stderr
, "binding level ");
1588 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1589 fprintf (stderr
, "\n");
1590 print_binding_level (level
);
1595 print_binding_stack ()
1597 struct binding_level
*b
;
1598 fprintf (stderr
, "current_binding_level=");
1599 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
1600 fprintf (stderr
, "\nclass_binding_level=");
1601 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
1602 fprintf (stderr
, "\nglobal_binding_level=");
1603 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
1604 fprintf (stderr
, "\n");
1605 if (class_binding_level
)
1607 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1608 if (b
== current_binding_level
)
1611 b
= class_binding_level
;
1613 b
= current_binding_level
;
1616 b
= current_binding_level
;
1617 print_other_binding_stack (b
);
1618 fprintf (stderr
, "global:\n");
1619 print_binding_level (global_binding_level
);
1622 extern char * first_global_object_name
;
1624 /* Get a unique name for each call to this routine for unnamed namespaces.
1625 Mostly copied from get_file_function_name. */
1630 static int temp_name_counter
= 0;
1634 if (first_global_object_name
)
1635 p
= first_global_object_name
;
1636 else if (main_input_filename
)
1637 p
= main_input_filename
;
1641 #define UNNAMED_NAMESPACE_FORMAT "__%s_%d"
1643 buf
= (char *) alloca (sizeof (UNNAMED_NAMESPACE_FORMAT
) + strlen (p
));
1645 sprintf (buf
, UNNAMED_NAMESPACE_FORMAT
, p
, temp_name_counter
++);
1647 /* Don't need to pull weird characters out of global names. */
1648 if (p
!= first_global_object_name
)
1650 for (p
= buf
+11; *p
; p
++)
1651 if (! ((*p
>= '0' && *p
<= '9')
1652 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
1655 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
1658 || (*p
>= 'A' && *p
<= 'Z')
1659 || (*p
>= 'a' && *p
<= 'z')))
1663 return get_identifier (buf
);
1666 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
1667 select a name that is unique to this compilation unit. */
1670 push_namespace (name
)
1673 extern tree current_namespace
;
1674 tree old_id
= get_namespace_id ();
1680 /* Create a truly ugly name! */
1681 name
= get_unique_name ();
1684 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
1686 /* Mark them as external, so redeclaration_error_message doesn't think
1687 they are duplicates. */
1689 DECL_EXTERNAL (d
) = 1;
1692 if (NAMESPACE_LEVEL (d
) == 0)
1694 /* This is new for this compilation unit. */
1696 declare_namespace_level ();
1697 NAMESPACE_LEVEL (d
) = current_binding_level
;
1700 resume_level (NAMESPACE_LEVEL (d
));
1702 /* This code is just is bit old now... */
1703 current_namespace
= tree_cons (NULL_TREE
, name
, current_namespace
);
1704 buf
= (char *) alloca (4 + (old_id
? IDENTIFIER_LENGTH (old_id
) : 0)
1705 + IDENTIFIER_LENGTH (name
));
1706 sprintf (buf
, "%s%s", old_id
? IDENTIFIER_POINTER (old_id
) : "",
1707 IDENTIFIER_POINTER (name
));
1708 TREE_PURPOSE (current_namespace
) = get_identifier (buf
);
1711 /* Pop from the scope of the current namespace. */
1716 extern tree current_namespace
;
1718 current_namespace
= TREE_CHAIN (current_namespace
);
1720 /* Just in case we get out of sync. */
1721 if (! namespace_bindings_p ())
1724 decls
= current_binding_level
->names
;
1726 /* Clear out the meanings of the local variables of this level. */
1728 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1730 if (DECL_NAME (link
) != NULL_TREE
)
1732 /* If the ident. was used or addressed via a local extern decl,
1733 don't forget that fact. */
1734 if (DECL_EXTERNAL (link
))
1736 if (TREE_USED (link
))
1737 TREE_USED (DECL_ASSEMBLER_NAME (link
)) = 1;
1738 if (TREE_ADDRESSABLE (link
))
1739 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (link
)) = 1;
1741 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = NULL_TREE
;
1745 /* Restore all name-meanings of the outer levels
1746 that were shadowed by this level. */
1748 for (link
= current_binding_level
->shadowed
; link
; link
= TREE_CHAIN (link
))
1749 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1750 for (link
= current_binding_level
->class_shadowed
;
1751 link
; link
= TREE_CHAIN (link
))
1752 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1753 for (link
= current_binding_level
->type_shadowed
;
1754 link
; link
= TREE_CHAIN (link
))
1755 IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
1757 /* suspend a level. */
1758 suspend_binding_level ();
1761 /* Subroutines for reverting temporarily to top-level for instantiation
1762 of templates and such. We actually need to clear out the class- and
1763 local-value slots of all identifiers, so that only the global values
1764 are at all visible. Simply setting current_binding_level to the global
1765 scope isn't enough, because more binding levels may be pushed. */
1766 struct saved_scope
{
1767 struct binding_level
*old_binding_level
;
1769 struct saved_scope
*prev
;
1770 tree class_name
, class_type
, function_decl
;
1771 struct binding_level
*class_bindings
;
1772 tree
*lang_base
, *lang_stack
, lang_name
;
1774 int minimal_parse_mode
;
1775 tree last_function_parms
;
1776 tree template_parms
;
1777 HOST_WIDE_INT processing_template_decl
;
1778 tree previous_class_type
, previous_class_values
;
1780 static struct saved_scope
*current_saved_scope
;
1783 store_bindings (names
, old_bindings
)
1784 tree names
, old_bindings
;
1787 for (t
= names
; t
; t
= TREE_CHAIN (t
))
1789 tree binding
, t1
, id
;
1791 if (TREE_CODE (t
) == TREE_LIST
)
1792 id
= TREE_PURPOSE (t
);
1797 || (!IDENTIFIER_LOCAL_VALUE (id
)
1798 && !IDENTIFIER_CLASS_VALUE (id
)))
1801 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
1802 if (TREE_VEC_ELT (t1
, 0) == id
)
1805 binding
= make_tree_vec (4);
1808 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
1809 TREE_VEC_ELT (binding
, 0) = id
;
1810 TREE_VEC_ELT (binding
, 1) = IDENTIFIER_TYPE_VALUE (id
);
1811 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_LOCAL_VALUE (id
);
1812 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
1813 IDENTIFIER_LOCAL_VALUE (id
) = NULL_TREE
;
1814 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
1816 TREE_CHAIN (binding
) = old_bindings
;
1817 old_bindings
= binding
;
1821 return old_bindings
;
1825 maybe_push_to_top_level (pseudo
)
1828 extern int current_lang_stacksize
;
1829 struct saved_scope
*s
=
1830 (struct saved_scope
*) xmalloc (sizeof (struct saved_scope
));
1831 struct binding_level
*b
= inner_binding_level
;
1832 tree old_bindings
= NULL_TREE
;
1834 if (current_function_decl
)
1835 push_cp_function_context (NULL_TREE
);
1837 if (previous_class_type
)
1838 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
1840 /* Have to include global_binding_level, because class-level decls
1841 aren't listed anywhere useful. */
1842 for (; b
; b
= b
->level_chain
)
1846 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
1849 old_bindings
= store_bindings (b
->names
, old_bindings
);
1850 /* We also need to check class_shadowed to save class-level type
1851 bindings, since pushclass doesn't fill in b->names. */
1852 if (b
->parm_flag
== 2)
1853 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
1855 /* Unwind type-value slots back to top level. */
1856 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1857 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
1860 s
->old_binding_level
= current_binding_level
;
1861 current_binding_level
= b
;
1863 s
->class_name
= current_class_name
;
1864 s
->class_type
= current_class_type
;
1865 s
->function_decl
= current_function_decl
;
1866 s
->class_bindings
= class_binding_level
;
1867 s
->lang_stack
= current_lang_stack
;
1868 s
->lang_base
= current_lang_base
;
1869 s
->lang_stacksize
= current_lang_stacksize
;
1870 s
->lang_name
= current_lang_name
;
1871 s
->minimal_parse_mode
= minimal_parse_mode
;
1872 s
->last_function_parms
= last_function_parms
;
1873 s
->template_parms
= current_template_parms
;
1874 s
->processing_template_decl
= processing_template_decl
;
1875 s
->previous_class_type
= previous_class_type
;
1876 s
->previous_class_values
= previous_class_values
;
1878 current_class_name
= current_class_type
= NULL_TREE
;
1879 current_function_decl
= NULL_TREE
;
1880 class_binding_level
= (struct binding_level
*)0;
1881 current_lang_stacksize
= 10;
1882 current_lang_stack
= current_lang_base
1883 = (tree
*) xmalloc (current_lang_stacksize
* sizeof (tree
));
1884 current_lang_name
= lang_name_cplusplus
;
1885 strict_prototype
= strict_prototypes_lang_cplusplus
;
1886 named_labels
= NULL_TREE
;
1887 minimal_parse_mode
= 0;
1888 previous_class_type
= previous_class_values
= NULL_TREE
;
1891 current_template_parms
= NULL_TREE
;
1892 processing_template_decl
= 0;
1895 s
->prev
= current_saved_scope
;
1896 s
->old_bindings
= old_bindings
;
1897 current_saved_scope
= s
;
1899 push_obstacks (&permanent_obstack
, &permanent_obstack
);
1903 push_to_top_level ()
1905 maybe_push_to_top_level (0);
1909 pop_from_top_level ()
1911 extern int current_lang_stacksize
;
1912 struct saved_scope
*s
= current_saved_scope
;
1915 /* Clear out class-level bindings cache. */
1916 if (previous_class_type
)
1919 previous_class_type
= NULL_TREE
;
1924 current_binding_level
= s
->old_binding_level
;
1925 current_saved_scope
= s
->prev
;
1926 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
1928 tree id
= TREE_VEC_ELT (t
, 0);
1931 IDENTIFIER_TYPE_VALUE (id
) = TREE_VEC_ELT (t
, 1);
1932 IDENTIFIER_LOCAL_VALUE (id
) = TREE_VEC_ELT (t
, 2);
1933 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
1936 current_class_name
= s
->class_name
;
1937 current_class_type
= s
->class_type
;
1938 current_function_decl
= s
->function_decl
;
1939 class_binding_level
= s
->class_bindings
;
1940 free (current_lang_base
);
1941 current_lang_base
= s
->lang_base
;
1942 current_lang_stack
= s
->lang_stack
;
1943 current_lang_name
= s
->lang_name
;
1944 current_lang_stacksize
= s
->lang_stacksize
;
1945 if (current_lang_name
== lang_name_cplusplus
)
1946 strict_prototype
= strict_prototypes_lang_cplusplus
;
1947 else if (current_lang_name
== lang_name_c
)
1948 strict_prototype
= strict_prototypes_lang_c
;
1949 minimal_parse_mode
= s
->minimal_parse_mode
;
1950 last_function_parms
= s
->last_function_parms
;
1951 current_template_parms
= s
->template_parms
;
1952 processing_template_decl
= s
->processing_template_decl
;
1953 previous_class_type
= s
->previous_class_type
;
1954 previous_class_values
= s
->previous_class_values
;
1958 if (current_function_decl
)
1959 pop_cp_function_context (NULL_TREE
);
1962 /* Push a definition of struct, union or enum tag "name".
1963 into binding_level "b". "type" should be the type node,
1964 We assume that the tag "name" is not already defined.
1966 Note that the definition may really be just a forward reference.
1967 In that case, the TYPE_SIZE will be a NULL_TREE.
1969 C++ gratuitously puts all these tags in the name space. */
1971 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
1972 record the shadowed value for this binding contour. TYPE is
1973 the type that ID maps to. */
1976 set_identifier_type_value_with_scope (id
, type
, b
)
1979 struct binding_level
*b
;
1981 if (b
!= global_binding_level
)
1983 tree old_type_value
= IDENTIFIER_TYPE_VALUE (id
);
1985 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
1987 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
1990 /* As set_identifier_type_value_with_scope, but using inner_binding_level. */
1993 set_identifier_type_value (id
, type
)
1997 set_identifier_type_value_with_scope (id
, type
, inner_binding_level
);
2000 /* Pop off extraneous binding levels left over due to syntax errors.
2002 We don't pop past namespaces, as they might be valid. */
2007 #ifdef DEBUG_CP_BINDING_LEVELS
2008 fprintf (stderr
, "XXX entering pop_everything ()\n");
2010 while (! toplevel_bindings_p () && ! pseudo_global_level_p ())
2012 if (class_binding_level
)
2013 pop_nested_class (1);
2017 #ifdef DEBUG_CP_BINDING_LEVELS
2018 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2022 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2023 Normally put into into the inner-most non-tag-transparent scope,
2024 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2025 The latter is needed for implicit declarations. */
2028 pushtag (name
, type
, globalize
)
2032 register struct binding_level
*b
;
2036 b
= inner_binding_level
;
2037 while (b
->tag_transparent
2038 || (globalize
&& b
->parm_flag
== 2))
2041 if (toplevel_bindings_p ())
2042 b
->tags
= perm_tree_cons (name
, type
, b
->tags
);
2044 b
->tags
= saveable_tree_cons (name
, type
, b
->tags
);
2048 context
= type
? TYPE_CONTEXT (type
) : NULL_TREE
;
2049 if (! context
&& ! globalize
)
2050 context
= current_scope ();
2052 c_decl
= TREE_CODE (context
) == FUNCTION_DECL
2053 ? context
: TYPE_MAIN_DECL (context
);
2055 /* Do C++ gratuitous typedefing. */
2056 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2061 if (b
->parm_flag
!= 2
2062 || TYPE_SIZE (current_class_type
) != NULL_TREE
)
2064 d
= lookup_nested_type (type
, c_decl
);
2069 d
= build_decl (TYPE_DECL
, name
, type
);
2070 SET_DECL_ARTIFICIAL (d
);
2071 set_identifier_type_value_with_scope (name
, type
, b
);
2074 d
= TYPE_MAIN_DECL (d
);
2076 TYPE_NAME (type
) = d
;
2077 DECL_CONTEXT (d
) = context
;
2078 if (! globalize
&& processing_template_decl
&& IS_AGGR_TYPE (type
))
2079 push_template_decl (d
);
2081 if (b
->parm_flag
== 2)
2082 d
= pushdecl_class_level (d
);
2084 d
= pushdecl_with_scope (d
, b
);
2088 /* Make nested declarations go into class-level scope. */
2090 d
= build_decl (TYPE_DECL
, name
, type
);
2091 SET_DECL_ARTIFICIAL (d
);
2092 TYPE_NAME (type
) = d
;
2093 DECL_CONTEXT (d
) = context
;
2094 if (! globalize
&& processing_template_decl
&& IS_AGGR_TYPE (type
))
2095 push_template_decl (d
);
2097 d
= pushdecl_class_level (d
);
2101 if (ANON_AGGRNAME_P (name
))
2102 DECL_IGNORED_P (d
) = 1;
2104 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2105 DECL_ASSEMBLER_NAME (d
)
2106 = get_identifier (build_overload_name (type
, 1, 1));
2109 if (b
->parm_flag
== 2)
2111 TREE_NONLOCAL_FLAG (type
) = 1;
2112 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2113 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2117 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2118 /* Use the canonical TYPE_DECL for this node. */
2119 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2122 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2123 will be the tagged type we just added to the current
2124 binding level. This fake NULL-named TYPE_DECL node helps
2125 dwarfout.c to know when it needs to output a
2126 representation of a tagged type, and it also gives us a
2127 convenient place to record the "scope start" address for
2130 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2131 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2135 /* Counter used to create anonymous type names. */
2137 static int anon_cnt
= 0;
2139 /* Return an IDENTIFIER which can be used as a name for
2140 anonymous structs and unions. */
2147 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2148 return get_identifier (buf
);
2151 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2152 This keeps dbxout from getting confused. */
2157 register struct binding_level
*b
;
2159 static int last_cnt
= 0;
2161 /* Fast out if no new anon names were declared. */
2162 if (last_cnt
== anon_cnt
)
2165 b
= current_binding_level
;
2166 while (b
->tag_transparent
)
2171 /* A NULL purpose means we have already processed all tags
2172 from here to the end of the list. */
2173 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2175 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2176 TREE_PURPOSE (tags
) = NULL_TREE
;
2177 tags
= TREE_CHAIN (tags
);
2179 last_cnt
= anon_cnt
;
2182 /* Subroutine of duplicate_decls: return truthvalue of whether
2183 or not types of these decls match.
2185 For C++, we must compare the parameter list so that `int' can match
2186 `int&' in a parameter position, but `int&' is not confused with
2190 decls_match (newdecl
, olddecl
)
2191 tree newdecl
, olddecl
;
2195 if (TREE_CODE (newdecl
) == FUNCTION_DECL
2196 && TREE_CODE (olddecl
) == FUNCTION_DECL
)
2198 tree f1
= TREE_TYPE (newdecl
);
2199 tree f2
= TREE_TYPE (olddecl
);
2200 tree p1
= TYPE_ARG_TYPES (f1
);
2201 tree p2
= TYPE_ARG_TYPES (f2
);
2203 /* When we parse a static member function definition,
2204 we put together a FUNCTION_DECL which thinks its type
2205 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2207 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2208 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2209 else if (TREE_CODE (f2
) == METHOD_TYPE
2210 && DECL_STATIC_FUNCTION_P (newdecl
))
2211 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2213 /* Here we must take care of the case where new default
2214 parameters are specified. Also, warn if an old
2215 declaration becomes ambiguous because default
2216 parameters may cause the two to be ambiguous. */
2217 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2219 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2220 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2222 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2226 if (comptypes (TREE_TYPE (f1
), TREE_TYPE (f2
), 1))
2228 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2231 types_match
= self_promoting_args_p (p1
);
2232 if (p1
== void_list_node
)
2233 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2235 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2236 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2238 types_match
= self_promoting_args_p (p2
);
2239 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2242 types_match
= compparms (p1
, p2
, 3);
2247 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
2248 && TREE_CODE (olddecl
) == TEMPLATE_DECL
)
2250 tree newargs
= DECL_TEMPLATE_PARMS (newdecl
);
2251 tree oldargs
= DECL_TEMPLATE_PARMS (olddecl
);
2252 int i
, len
= TREE_VEC_LENGTH (newargs
);
2254 if (TREE_VEC_LENGTH (oldargs
) != len
)
2257 for (i
= 0; i
< len
; i
++)
2259 tree newarg
= TREE_VALUE (TREE_VEC_ELT (newargs
, i
));
2260 tree oldarg
= TREE_VALUE (TREE_VEC_ELT (oldargs
, i
));
2261 if (TREE_CODE (newarg
) != TREE_CODE (oldarg
))
2263 else if (TREE_CODE (newarg
) == TYPE_DECL
)
2265 else if (! comptypes (TREE_TYPE (newarg
), TREE_TYPE (oldarg
), 1))
2269 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2272 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2273 DECL_TEMPLATE_RESULT (newdecl
));
2277 if (TREE_TYPE (newdecl
) == error_mark_node
)
2278 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2279 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2280 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2281 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2283 /* Qualifiers must match, and they may be present on either, the type
2285 else if ((TREE_READONLY (newdecl
)
2286 || TYPE_READONLY (TREE_TYPE (newdecl
)))
2287 == (TREE_READONLY (olddecl
)
2288 || TYPE_READONLY (TREE_TYPE (olddecl
)))
2289 && (TREE_THIS_VOLATILE (newdecl
)
2290 || TYPE_VOLATILE (TREE_TYPE (newdecl
)))
2291 == (TREE_THIS_VOLATILE (olddecl
)
2292 || TYPE_VOLATILE (TREE_TYPE (olddecl
))))
2293 types_match
= comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (newdecl
)),
2294 TYPE_MAIN_VARIANT (TREE_TYPE (olddecl
)), 1);
2302 /* If NEWDECL is `static' and an `extern' was seen previously,
2303 warn about it. (OLDDECL may be NULL_TREE; NAME contains
2304 information about previous usage as an `extern'.)
2306 Note that this does not apply to the C++ case of declaring
2307 a variable `extern const' and then later `const'.
2309 Don't complain about built-in functions, since they are beyond
2310 the user's control. */
2313 warn_extern_redeclared_static (newdecl
, olddecl
)
2314 tree newdecl
, olddecl
;
2318 static char *explicit_extern_static_warning
2319 = "`%D' was declared `extern' and later `static'";
2320 static char *implicit_extern_static_warning
2321 = "`%D' was declared implicitly `extern' and later `static'";
2323 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2326 name
= DECL_ASSEMBLER_NAME (newdecl
);
2327 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
2329 /* It's okay to redeclare an ANSI built-in function as static,
2330 or to declare a non-ANSI built-in function as anything. */
2331 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
2332 && olddecl
!= NULL_TREE
2333 && TREE_CODE (olddecl
) == FUNCTION_DECL
2334 && (DECL_BUILT_IN (olddecl
)
2335 || DECL_BUILT_IN_NONANSI (olddecl
))))
2337 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2338 ? implicit_extern_static_warning
2339 : explicit_extern_static_warning
, newdecl
);
2340 if (olddecl
!= NULL_TREE
)
2341 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2346 /* Handle when a new declaration NEWDECL has the same name as an old
2347 one OLDDECL in the same binding contour. Prints an error message
2350 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2351 Otherwise, return 0. */
2354 duplicate_decls (newdecl
, olddecl
)
2355 tree newdecl
, olddecl
;
2357 extern struct obstack permanent_obstack
;
2358 unsigned olddecl_uid
= DECL_UID (olddecl
);
2359 int olddecl_friend
= 0, types_match
= 0;
2360 int new_defines_function
;
2362 if (newdecl
== olddecl
)
2365 if (TREE_CODE_CLASS (TREE_CODE (olddecl
)) == 'd')
2366 DECL_MACHINE_ATTRIBUTES (newdecl
) = DECL_MACHINE_ATTRIBUTES (olddecl
);
2368 types_match
= decls_match (newdecl
, olddecl
);
2370 if (TREE_CODE (olddecl
) != TREE_LIST
)
2371 olddecl_friend
= DECL_LANG_SPECIFIC (olddecl
) && DECL_FRIEND_P (olddecl
);
2373 /* If either the type of the new decl or the type of the old decl is an
2374 error_mark_node, then that implies that we have already issued an
2375 error (earlier) for some bogus type specification, and in that case,
2376 it is rather pointless to harass the user with yet more error message
2377 about the same declaration, so well just pretent the types match here. */
2378 if ((TREE_TYPE (newdecl
)
2379 && TREE_CODE (TREE_TYPE (newdecl
)) == ERROR_MARK
)
2380 || (TREE_TYPE (olddecl
)
2381 && TREE_CODE (TREE_TYPE (olddecl
)) == ERROR_MARK
))
2384 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2385 && DECL_ARTIFICIAL (olddecl
)
2386 && (DECL_BUILT_IN (olddecl
) || DECL_BUILT_IN_NONANSI (olddecl
)))
2388 /* If you declare a built-in or predefined function name as static,
2389 the old definition is overridden, but optionally warn this was a
2390 bad choice of name. Ditto for overloads. */
2391 if (! DECL_PUBLIC (newdecl
)
2392 || (TREE_CODE (newdecl
) == FUNCTION_DECL
2393 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
)))
2396 cp_warning ("shadowing %s function `%#D'",
2397 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2399 /* Discard the old built-in function. */
2402 else if (! types_match
)
2404 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2406 /* If the built-in is not ansi, then programs can override
2407 it even globally without an error. */
2408 if (! DECL_BUILT_IN (olddecl
))
2409 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2413 cp_error ("declaration of `%#D'", newdecl
);
2414 cp_error ("conflicts with built-in declaration `%#D'",
2420 cp_warning ("declaration of `%#D'", newdecl
);
2421 cp_warning ("conflicts with built-in declaration `%#D'",
2425 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
2427 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
2428 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
2429 || (TREE_CODE (olddecl
) == FUNCTION_DECL
2430 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
2433 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
2434 if (TREE_CODE (olddecl
) == TREE_LIST
)
2435 olddecl
= TREE_VALUE (olddecl
);
2436 cp_error_at ("previous declaration of `%#D'", olddecl
);
2438 /* New decl is completely inconsistent with the old one =>
2439 tell caller to replace the old one. */
2443 else if (!types_match
)
2445 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2447 /* The name of a class template may not be declared to refer to
2448 any other template, class, function, object, namespace, value,
2449 or type in the same scope. */
2450 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
2451 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2453 cp_error ("declaration of template `%#D'", newdecl
);
2454 cp_error_at ("conflicts with previous declaration `%#D'",
2457 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
2458 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
2459 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
2460 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))), 3))
2462 cp_error ("new declaration `%#D'", newdecl
);
2463 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
2467 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2469 if (DECL_LANGUAGE (newdecl
) == lang_c
2470 && DECL_LANGUAGE (olddecl
) == lang_c
)
2472 cp_error ("declaration of C function `%#D' conflicts with",
2474 cp_error_at ("previous declaration `%#D' here", olddecl
);
2476 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
2477 TYPE_ARG_TYPES (TREE_TYPE (olddecl
)), 3))
2479 cp_error ("new declaration `%#D'", newdecl
);
2480 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
2486 /* Already complained about this, so don't do so again. */
2487 else if (current_class_type
== NULL_TREE
2488 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
2490 cp_error ("conflicting types for `%#D'", newdecl
);
2491 cp_error_at ("previous declaration as `%#D'", olddecl
);
2496 char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
2499 cp_error (errmsg
, newdecl
);
2500 if (DECL_NAME (olddecl
) != NULL_TREE
)
2501 cp_error_at ((DECL_INITIAL (olddecl
)
2502 && current_binding_level
== global_binding_level
)
2503 ? "`%#D' previously defined here"
2504 : "`%#D' previously declared here", olddecl
);
2506 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
2507 && DECL_INITIAL (olddecl
) != NULL_TREE
2508 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
2509 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
2511 /* Prototype decl follows defn w/o prototype. */
2512 cp_warning_at ("prototype for `%#D'", newdecl
);
2513 cp_warning_at ("follows non-prototype definition here", olddecl
);
2515 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
2516 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
2518 /* extern "C" int foo ();
2519 int foo () { bar (); }
2521 if (current_lang_stack
== current_lang_base
)
2522 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
2525 cp_error_at ("previous declaration of `%#D' with %L linkage",
2526 olddecl
, DECL_LANGUAGE (olddecl
));
2527 cp_error ("conflicts with new declaration with %L linkage",
2528 DECL_LANGUAGE (newdecl
));
2532 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2533 && ! DECL_USE_TEMPLATE (olddecl
))
2535 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
2536 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
2539 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
2540 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
2542 for (; t1
&& t1
!= void_list_node
;
2543 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
2544 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
2546 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
2551 cp_pedwarn ("default argument given for parameter %d of `%#D'",
2553 cp_pedwarn_at ("after previous specification in `%#D'",
2559 cp_error ("default argument given for parameter %d of `%#D'",
2561 cp_error_at ("conflicts with previous specification in `%#D'",
2566 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
2567 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
2569 cp_warning ("`%#D' was used before it was declared inline",
2571 cp_warning_at ("previous non-inline declaration here",
2575 /* These bits are logically part of the type for non-functions. */
2576 else if (TREE_READONLY (newdecl
) != TREE_READONLY (olddecl
)
2577 || TREE_THIS_VOLATILE (newdecl
) != TREE_THIS_VOLATILE (olddecl
))
2579 cp_pedwarn ("type qualifiers for `%#D'", newdecl
);
2580 cp_pedwarn_at ("conflict with previous decl `%#D'", olddecl
);
2584 /* If new decl is `static' and an `extern' was seen previously,
2586 warn_extern_redeclared_static (newdecl
, olddecl
);
2588 /* We have committed to returning 1 at this point. */
2589 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2591 /* Now that functions must hold information normally held
2592 by field decls, there is extra work to do so that
2593 declaration information does not get destroyed during
2595 if (DECL_VINDEX (olddecl
))
2596 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
2597 if (DECL_CONTEXT (olddecl
))
2598 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
2599 if (DECL_CLASS_CONTEXT (olddecl
))
2600 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
2601 if (DECL_CHAIN (newdecl
) == NULL_TREE
)
2602 DECL_CHAIN (newdecl
) = DECL_CHAIN (olddecl
);
2603 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
2604 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
2605 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
2606 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
2607 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
2610 /* Deal with C++: must preserve virtual function table size. */
2611 if (TREE_CODE (olddecl
) == TYPE_DECL
)
2613 register tree newtype
= TREE_TYPE (newdecl
);
2614 register tree oldtype
= TREE_TYPE (olddecl
);
2616 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
2617 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
2619 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
2620 CLASSTYPE_FRIEND_CLASSES (newtype
)
2621 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
2625 /* Special handling ensues if new decl is a function definition. */
2626 new_defines_function
= (TREE_CODE (newdecl
) == FUNCTION_DECL
2627 && DECL_INITIAL (newdecl
) != NULL_TREE
);
2629 /* Optionally warn about more than one declaration for the same name,
2630 but don't warn about a function declaration followed by a definition. */
2631 if (warn_redundant_decls
2632 && ! DECL_ARTIFICIAL (olddecl
)
2633 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
2634 /* Don't warn about extern decl followed by (tentative) definition. */
2635 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
)))
2637 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
2638 cp_warning_at ("previous declaration of `%D'", olddecl
);
2641 /* Copy all the DECL_... slots specified in the new decl
2642 except for any that we copy here from the old type. */
2644 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2646 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
2647 DECL_TEMPLATE_RESULT (olddecl
) = DECL_TEMPLATE_RESULT (newdecl
);
2648 DECL_TEMPLATE_PARMS (olddecl
) = DECL_TEMPLATE_PARMS (newdecl
);
2654 /* Automatically handles default parameters. */
2655 tree oldtype
= TREE_TYPE (olddecl
);
2658 /* Make sure we put the new type in the same obstack as the old one. */
2660 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
2663 push_obstacks_nochange ();
2664 end_temporary_allocation ();
2667 /* Merge the data types specified in the two decls. */
2668 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
2670 if (TREE_CODE (newdecl
) == VAR_DECL
)
2671 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
2672 /* Do this after calling `common_type' so that default
2673 parameters don't confuse us. */
2674 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
2675 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
2676 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
2678 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
2679 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
2680 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
2681 TYPE_RAISES_EXCEPTIONS (oldtype
));
2683 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
2684 && ! compexcepttypes (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
2686 cp_pedwarn ("declaration of `%D' throws different exceptions",
2688 cp_pedwarn_at ("previous declaration here", olddecl
);
2691 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
2693 /* Lay the type out, unless already done. */
2694 if (oldtype
!= TREE_TYPE (newdecl
)
2695 && TREE_TYPE (newdecl
) != error_mark_node
2696 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
2697 layout_type (TREE_TYPE (newdecl
));
2699 if ((TREE_CODE (newdecl
) == VAR_DECL
2700 || TREE_CODE (newdecl
) == PARM_DECL
2701 || TREE_CODE (newdecl
) == RESULT_DECL
2702 || TREE_CODE (newdecl
) == FIELD_DECL
2703 || TREE_CODE (newdecl
) == TYPE_DECL
)
2704 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
2705 layout_decl (newdecl
, 0);
2707 /* Merge the type qualifiers. */
2708 if (TREE_READONLY (newdecl
))
2709 TREE_READONLY (olddecl
) = 1;
2710 if (TREE_THIS_VOLATILE (newdecl
))
2711 TREE_THIS_VOLATILE (olddecl
) = 1;
2713 /* Merge the initialization information. */
2714 if (DECL_INITIAL (newdecl
) == NULL_TREE
2715 && DECL_INITIAL (olddecl
) != NULL_TREE
)
2717 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
2718 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
2719 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
2722 /* Merge the section attribute.
2723 We want to issue an error if the sections conflict but that must be
2724 done later in decl_attributes since we are called before attributes
2726 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
2727 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
2729 /* Keep the old rtl since we can safely use it, unless it's the
2730 call to abort() used for abstract virtuals. */
2731 if ((DECL_LANG_SPECIFIC (olddecl
)
2732 && !DECL_ABSTRACT_VIRTUAL_P (olddecl
))
2733 || DECL_RTL (olddecl
) != DECL_RTL (abort_fndecl
))
2734 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
2738 /* If cannot merge, then use the new type and qualifiers,
2739 and don't preserve the old rtl. */
2742 /* Clean out any memory we had of the old declaration. */
2743 tree oldstatic
= value_member (olddecl
, static_aggregates
);
2745 TREE_VALUE (oldstatic
) = error_mark_node
;
2747 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
2748 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
2749 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
2750 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
2753 /* Merge the storage class information. */
2754 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
2755 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
2756 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
2757 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
2758 if (! DECL_EXTERNAL (olddecl
))
2759 DECL_EXTERNAL (newdecl
) = 0;
2761 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2762 DECL_C_STATIC (newdecl
) |= DECL_C_STATIC (olddecl
);
2764 if (DECL_LANG_SPECIFIC (newdecl
))
2766 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
2767 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
2770 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2772 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
2774 /* If either decl says `inline', this fn is inline, unless its
2775 definition was passed already. */
2776 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
2777 DECL_INLINE (olddecl
) = 1;
2778 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
2782 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
2783 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
2784 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
2786 if (! types_match
|| new_defines_function
)
2788 /* These need to be copied so that the names are available. */
2789 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
2790 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
2792 if (new_defines_function
)
2793 /* If defining a function declared with other language
2794 linkage, use the previously declared language linkage. */
2795 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
2798 /* If redeclaring a builtin function, and not a definition,
2799 it stays built in. */
2800 if (DECL_BUILT_IN (olddecl
))
2802 DECL_BUILT_IN (newdecl
) = 1;
2803 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
2804 /* If we're keeping the built-in definition, keep the rtl,
2805 regardless of declaration matches. */
2806 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
2809 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
2811 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
2812 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
2813 /* Previously saved insns go together with
2814 the function's previous definition. */
2815 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
2816 /* Don't clear out the arguments if we're redefining a function. */
2817 if (DECL_ARGUMENTS (olddecl
))
2818 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
2820 if (DECL_LANG_SPECIFIC (olddecl
))
2821 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
2824 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
2826 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
2829 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2831 DECL_TEMPLATE_INSTANTIATIONS (newdecl
)
2832 = DECL_TEMPLATE_INSTANTIATIONS (olddecl
);
2833 if (DECL_CHAIN (newdecl
) == NULL_TREE
)
2834 DECL_CHAIN (newdecl
) = DECL_CHAIN (olddecl
);
2837 /* Now preserve various other info from the definition. */
2838 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
2839 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
2840 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
2841 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
2843 /* Don't really know how much of the language-specific
2844 values we should copy from old to new. */
2845 if (DECL_LANG_SPECIFIC (olddecl
))
2847 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
2848 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
2849 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
2850 if (DECL_TEMPLATE_INFO (newdecl
) == NULL_TREE
)
2852 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
2853 DECL_USE_TEMPLATE (newdecl
) = DECL_USE_TEMPLATE (olddecl
);
2857 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2860 struct lang_decl
*ol
= DECL_LANG_SPECIFIC (olddecl
);
2861 struct lang_decl
*nl
= DECL_LANG_SPECIFIC (newdecl
);
2863 function_size
= sizeof (struct tree_decl
);
2865 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
2866 (char *) olddecl
+ sizeof (struct tree_common
),
2867 function_size
- sizeof (struct tree_common
));
2869 /* Can we safely free the storage used by newdecl? */
2871 #define ROUND(x) ((x + obstack_alignment_mask (&permanent_obstack)) \
2872 & ~ obstack_alignment_mask (&permanent_obstack))
2874 if ((char *)newdecl
+ ROUND (function_size
)
2875 + ROUND (sizeof (struct lang_decl
))
2876 == obstack_next_free (&permanent_obstack
))
2878 DECL_MAIN_VARIANT (newdecl
) = olddecl
;
2879 DECL_LANG_SPECIFIC (olddecl
) = ol
;
2880 bcopy ((char *)nl
, (char *)ol
, sizeof (struct lang_decl
));
2882 obstack_free (&permanent_obstack
, newdecl
);
2884 else if (LANG_DECL_PERMANENT (ol
) && ol
!= nl
)
2886 if (DECL_MAIN_VARIANT (olddecl
) == olddecl
)
2888 /* Save these lang_decls that would otherwise be lost. */
2889 extern tree free_lang_decl_chain
;
2890 tree free_lang_decl
= (tree
) ol
;
2892 if (DECL_LANG_SPECIFIC (olddecl
) == ol
)
2895 TREE_CHAIN (free_lang_decl
) = free_lang_decl_chain
;
2896 free_lang_decl_chain
= free_lang_decl
;
2906 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
2907 (char *) olddecl
+ sizeof (struct tree_common
),
2908 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
2909 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
2912 DECL_UID (olddecl
) = olddecl_uid
;
2914 DECL_FRIEND_P (olddecl
) = 1;
2919 /* Record a decl-node X as belonging to the current lexical scope.
2920 Check for errors (such as an incompatible declaration for the same
2921 name already seen in the same scope).
2923 Returns either X or an old decl for the same name.
2924 If an old decl is returned, it may have been smashed
2925 to agree with what X says. */
2932 register tree name
= DECL_ASSEMBLER_NAME (x
);
2933 register struct binding_level
*b
= current_binding_level
;
2935 if (x
!= current_function_decl
2936 /* Don't change DECL_CONTEXT of virtual methods. */
2937 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
2938 && ! DECL_CONTEXT (x
))
2939 DECL_CONTEXT (x
) = current_function_decl
;
2940 /* A local declaration for a function doesn't constitute nesting. */
2941 if (TREE_CODE (x
) == FUNCTION_DECL
&& DECL_INITIAL (x
) == 0)
2942 DECL_CONTEXT (x
) = 0;
2944 /* Type are looked up using the DECL_NAME, as that is what the rest of the
2945 compiler wants to use. */
2946 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
2947 || TREE_CODE (x
) == NAMESPACE_DECL
)
2948 name
= DECL_NAME (x
);
2953 /* Not needed...see below. */
2958 t
= lookup_name_current_level (name
);
2959 if (t
== error_mark_node
)
2961 /* error_mark_node is 0 for a while during initialization! */
2963 cp_error_at ("`%#D' used prior to declaration", x
);
2966 else if (t
!= NULL_TREE
)
2969 /* This is turned off until I have time to do it right (bpk). */
2970 /* With the code below that uses it... */
2971 file
= DECL_SOURCE_FILE (t
);
2972 line
= DECL_SOURCE_LINE (t
);
2974 if (TREE_CODE (t
) == PARM_DECL
)
2976 if (DECL_CONTEXT (t
) == NULL_TREE
)
2977 fatal ("parse errors have confused me too much");
2979 /* Check for duplicate params. */
2980 if (duplicate_decls (x
, t
))
2983 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
2984 || DECL_FUNCTION_TEMPLATE_P (x
))
2985 && is_overloaded_fn (t
))
2986 /* don't do anything just yet */;
2987 else if (t
== wchar_decl_node
)
2989 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
2990 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
2992 /* Throw away the redeclaration. */
2995 else if (TREE_CODE (t
) != TREE_CODE (x
))
2997 if ((TREE_CODE (t
) == TYPE_DECL
&& DECL_ARTIFICIAL (t
)
2998 && TREE_CODE (x
) != TYPE_DECL
2999 && ! (TREE_CODE (x
) == TEMPLATE_DECL
3000 && TREE_CODE (DECL_TEMPLATE_RESULT (x
)) == TYPE_DECL
))
3001 || (TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3002 && TREE_CODE (t
) != TYPE_DECL
3003 && ! (TREE_CODE (t
) == TEMPLATE_DECL
3004 && (TREE_CODE (DECL_TEMPLATE_RESULT (t
))
3007 /* We do nothing special here, because C++ does such nasty
3008 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3009 get shadowed, and know that if we need to find a TYPE_DECL
3010 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3011 slot of the identifier. */
3014 else if (duplicate_decls (x
, t
))
3017 else if (duplicate_decls (x
, t
))
3020 /* This is turned off until I have time to do it right (bpk). */
3022 /* Also warn if they did a prototype with `static' on it, but
3023 then later left the `static' off. */
3024 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3026 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3031 cp_warning ("`static' missing from declaration of `%D'",
3033 warning_with_file_and_line (file
, line
,
3034 "previous declaration of `%s'",
3035 decl_as_string (t
, 0));
3038 /* Now fix things so it'll do what they expect. */
3039 if (current_function_decl
)
3040 TREE_PUBLIC (current_function_decl
) = 0;
3042 /* Due to interference in memory reclamation (X may be
3043 obstack-deallocated at this point), we must guard against
3044 one really special case. [jason: This should be handled
3045 by start_function] */
3046 if (current_function_decl
== x
)
3047 current_function_decl
= t
;
3049 if (TREE_CODE (t
) == TYPE_DECL
)
3050 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3051 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3052 check_default_args (t
);
3058 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3060 t
= push_overloaded_decl (x
, 1);
3061 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3064 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_CONTEXT (x
) == NULL_TREE
)
3065 return push_overloaded_decl (x
, 0);
3067 /* If declaring a type as a typedef, and the type has no known
3068 typedef name, install this TYPE_DECL as its typedef name. */
3069 if (TREE_CODE (x
) == TYPE_DECL
)
3071 tree type
= TREE_TYPE (x
);
3072 tree name
= (type
!= error_mark_node
) ? TYPE_NAME (type
) : x
;
3074 if (name
== NULL_TREE
|| TREE_CODE (name
) != TYPE_DECL
)
3076 /* If these are different names, and we're at the global
3077 binding level, make two equivalent definitions. */
3079 if (global_bindings_p ())
3080 TYPE_NAME (type
) = x
;
3082 my_friendly_assert (TREE_CODE (name
) == TYPE_DECL
, 140);
3084 if (type
!= error_mark_node
3086 && TYPE_IDENTIFIER (type
))
3087 set_identifier_type_value_with_scope (DECL_NAME (x
), type
, b
);
3090 /* Multiple external decls of the same identifier ought to match.
3092 We get warnings about inline functions where they are defined.
3093 We get warnings about other functions from push_overloaded_decl.
3095 Avoid duplicate warnings where they are used. */
3096 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3100 if (IDENTIFIER_GLOBAL_VALUE (name
) != NULL_TREE
3101 && (DECL_EXTERNAL (IDENTIFIER_GLOBAL_VALUE (name
))
3102 || TREE_PUBLIC (IDENTIFIER_GLOBAL_VALUE (name
))))
3103 decl
= IDENTIFIER_GLOBAL_VALUE (name
);
3108 /* If different sort of thing, we already gave an error. */
3109 && TREE_CODE (decl
) == TREE_CODE (x
)
3110 && ! comptypes (TREE_TYPE (x
), TREE_TYPE (decl
), 1))
3112 cp_pedwarn ("type mismatch with previous external decl", x
);
3113 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3117 /* This name is new in its binding level.
3118 Install the new declaration and return it. */
3119 if (b
== global_binding_level
)
3121 /* Install a global value. */
3123 /* If the first global decl has external linkage,
3124 warn if we later see static one. */
3125 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& DECL_PUBLIC (x
))
3126 TREE_PUBLIC (name
) = 1;
3128 /* Don't install an artificial TYPE_DECL if we already have
3129 another _DECL with that name. */
3130 if (TREE_CODE (x
) != TYPE_DECL
3132 || ! DECL_ARTIFICIAL (x
))
3133 IDENTIFIER_GLOBAL_VALUE (name
) = x
;
3135 /* Don't forget if the function was used via an implicit decl. */
3136 if (IDENTIFIER_IMPLICIT_DECL (name
)
3137 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3140 /* Don't forget if its address was taken in that way. */
3141 if (IDENTIFIER_IMPLICIT_DECL (name
)
3142 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3143 TREE_ADDRESSABLE (x
) = 1;
3145 /* Warn about mismatches against previous implicit decl. */
3146 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3147 /* If this real decl matches the implicit, don't complain. */
3148 && ! (TREE_CODE (x
) == FUNCTION_DECL
3149 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3151 ("`%D' was previously implicitly declared to return `int'", x
);
3153 /* If new decl is `static' and an `extern' was seen previously,
3155 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3156 warn_extern_redeclared_static (x
, t
);
3160 /* Here to install a non-global value. */
3161 tree oldlocal
= IDENTIFIER_LOCAL_VALUE (name
);
3162 tree oldglobal
= IDENTIFIER_GLOBAL_VALUE (name
);
3164 /* Don't install an artificial TYPE_DECL if we already have
3165 another _DECL with that name. */
3166 if (TREE_CODE (x
) != TYPE_DECL
3168 || ! DECL_ARTIFICIAL (x
))
3170 b
->shadowed
= tree_cons (name
, oldlocal
, b
->shadowed
);
3171 IDENTIFIER_LOCAL_VALUE (name
) = x
;
3174 /* If this is a TYPE_DECL, push it into the type value slot. */
3175 if (TREE_CODE (x
) == TYPE_DECL
)
3176 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
), b
);
3178 /* Clear out any TYPE_DECL shadowed by a namespace so that
3179 we won't think this is a type. The C struct hack doesn't
3180 go through namespaces. */
3181 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3182 set_identifier_type_value_with_scope (name
, NULL_TREE
, b
);
3184 /* If this is an extern function declaration, see if we
3185 have a global definition or declaration for the function. */
3186 if (oldlocal
== NULL_TREE
3187 && DECL_EXTERNAL (x
)
3188 && oldglobal
!= NULL_TREE
3189 && TREE_CODE (x
) == FUNCTION_DECL
3190 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3192 /* We have one. Their types must agree. */
3193 if (decls_match (x
, oldglobal
))
3197 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3198 cp_warning_at ("global declaration `%#D'", oldglobal
);
3201 /* If we have a local external declaration,
3202 and no file-scope declaration has yet been seen,
3203 then if we later have a file-scope decl it must not be static. */
3204 if (oldlocal
== NULL_TREE
3205 && oldglobal
== NULL_TREE
3206 && DECL_EXTERNAL (x
)
3209 TREE_PUBLIC (name
) = 1;
3212 if (DECL_FROM_INLINE (x
))
3213 /* Inline decls shadow nothing. */;
3215 /* Warn if shadowing an argument at the top level of the body. */
3216 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3217 && TREE_CODE (oldlocal
) == PARM_DECL
3218 && TREE_CODE (x
) != PARM_DECL
)
3220 /* Go to where the parms should be and see if we
3222 struct binding_level
*b
= current_binding_level
->level_chain
;
3228 if (b
->parm_flag
== 1)
3229 cp_error ("declaration of `%#D' shadows a parameter", name
);
3231 else if (warn_shadow
&& oldlocal
!= NULL_TREE
&& b
->is_for_scope
3232 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3234 warning ("variable `%s' shadows local",
3235 IDENTIFIER_POINTER (name
));
3236 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3238 /* Maybe warn if shadowing something else. */
3239 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
3240 /* No shadow warnings for internally generated vars. */
3241 && ! DECL_ARTIFICIAL (x
)
3242 /* No shadow warnings for vars made for inlining. */
3243 && ! DECL_FROM_INLINE (x
))
3245 char *warnstring
= NULL
;
3247 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
3248 warnstring
= "declaration of `%s' shadows a parameter";
3249 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
3250 && current_class_ptr
3251 && !TREE_STATIC (name
))
3252 warnstring
= "declaration of `%s' shadows a member of `this'";
3253 else if (oldlocal
!= NULL_TREE
)
3254 warnstring
= "declaration of `%s' shadows previous local";
3255 else if (oldglobal
!= NULL_TREE
)
3256 warnstring
= "declaration of `%s' shadows global declaration";
3259 warning (warnstring
, IDENTIFIER_POINTER (name
));
3263 if (TREE_CODE (x
) == FUNCTION_DECL
)
3264 check_default_args (x
);
3266 /* Keep count of variables in this level with incomplete type. */
3267 if (TREE_CODE (x
) == VAR_DECL
3268 && TREE_TYPE (x
) != error_mark_node
3269 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
3270 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
3271 /* RTTI TD entries are created while defining the type_info. */
3272 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
3273 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
3274 b
->incomplete
= tree_cons (NULL_TREE
, x
, b
->incomplete
);
3277 /* Put decls on list in reverse order.
3278 We will reverse them later if necessary. */
3279 TREE_CHAIN (x
) = b
->names
;
3281 if (! (b
!= global_binding_level
|| TREE_PERMANENT (x
)))
3282 my_friendly_abort (124);
3287 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
3288 caller to set DECL_CONTEXT properly. */
3291 pushdecl_with_scope (x
, level
)
3293 struct binding_level
*level
;
3295 register struct binding_level
*b
= current_binding_level
;
3296 tree function_decl
= current_function_decl
;
3298 current_function_decl
= NULL_TREE
;
3299 current_binding_level
= level
;
3301 current_binding_level
= b
;
3302 current_function_decl
= function_decl
;
3306 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
3310 pushdecl_top_level (x
)
3313 register struct binding_level
*b
= inner_binding_level
;
3314 register tree t
= pushdecl_with_scope (x
, global_binding_level
);
3316 /* Now, the type_shadowed stack may screw us. Munge it so it does
3318 if (TREE_CODE (x
) == TYPE_DECL
)
3320 tree name
= DECL_NAME (x
);
3322 tree
*ptr
= (tree
*)0;
3323 for (; b
!= global_binding_level
; b
= b
->level_chain
)
3325 tree shadowed
= b
->type_shadowed
;
3326 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
3327 if (TREE_PURPOSE (shadowed
) == name
)
3329 ptr
= &TREE_VALUE (shadowed
);
3330 /* Can't break out of the loop here because sometimes
3331 a binding level will have duplicate bindings for
3332 PT names. It's gross, but I haven't time to fix it. */
3335 newval
= TREE_TYPE (x
);
3336 if (ptr
== (tree
*)0)
3338 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
3339 up here if this is changed to an assertion. --KR */
3340 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
3350 /* Like push_overloaded_decl, only it places X in GLOBAL_BINDING_LEVEL,
3354 push_overloaded_decl_top_level (x
, forget
)
3358 struct binding_level
*b
= current_binding_level
;
3360 current_binding_level
= global_binding_level
;
3361 push_overloaded_decl (x
, forget
);
3362 current_binding_level
= b
;
3365 /* Make the declaration of X appear in CLASS scope. */
3368 pushdecl_class_level (x
)
3371 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
3372 scope looks for the pre-mangled name. */
3373 register tree name
= DECL_NAME (x
);
3377 if (TYPE_BEING_DEFINED (current_class_type
))
3379 /* Check for inconsistent use of this name in the class body.
3380 Types, enums, and static vars are checked here; other
3381 members are checked in finish_struct. */
3382 tree icv
= IDENTIFIER_CLASS_VALUE (name
);
3385 /* Don't complain about inherited names. */
3386 && id_in_current_class (name
)
3387 /* Or shadowed tags. */
3388 && !(TREE_CODE (icv
) == TYPE_DECL
3389 && DECL_CONTEXT (icv
) == current_class_type
))
3391 cp_error ("declaration of identifier `%D' as `%#D'", name
, x
);
3392 cp_error_at ("conflicts with previous use in class as `%#D'",
3397 push_class_level_binding (name
, x
);
3398 if (TREE_CODE (x
) == TYPE_DECL
)
3400 set_identifier_type_value (name
, TREE_TYPE (x
));
3406 /* This function is used to push the mangled decls for nested types into
3407 the appropriate scope. Previously pushdecl_top_level was used, but that
3408 is incorrect for members of local classes. */
3411 pushdecl_nonclass_level (x
)
3414 struct binding_level
*b
= current_binding_level
;
3416 my_friendly_assert (b
->parm_flag
!= 2, 180);
3419 /* Get out of template binding levels */
3420 while (b
->pseudo_global
)
3424 pushdecl_with_scope (x
, b
);
3427 /* Make the declaration(s) of X appear in CLASS scope
3428 under the name NAME. */
3431 push_class_level_binding (name
, x
)
3435 if (TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3436 && purpose_member (name
, class_binding_level
->class_shadowed
))
3439 maybe_push_cache_obstack ();
3440 class_binding_level
->class_shadowed
3441 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
3442 class_binding_level
->class_shadowed
);
3444 IDENTIFIER_CLASS_VALUE (name
) = x
;
3445 obstack_ptr_grow (&decl_obstack
, x
);
3448 /* Tell caller how to interpret a TREE_LIST which contains
3449 chains of FUNCTION_DECLS. */
3452 overloaded_globals_p (list
)
3455 my_friendly_assert (TREE_CODE (list
) == TREE_LIST
, 142);
3457 /* Don't commit caller to seeing them as globals. */
3458 if (TREE_NONLOCAL_FLAG (list
))
3460 /* Do commit caller to not seeing them as globals. */
3461 if (TREE_CODE (TREE_VALUE (list
)) == TREE_LIST
)
3463 /* Do commit caller to seeing them as globals. */
3467 /* DECL is a FUNCTION_DECL which may have other definitions already in
3468 place. We get around this by making the value of the identifier point
3469 to a list of all the things that want to be referenced by that name. It
3470 is then up to the users of that name to decide what to do with that
3473 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
3474 slot. It is dealt with the same way.
3476 The value returned may be a previous declaration if we guessed wrong
3477 about what language DECL should belong to (C or C++). Otherwise,
3478 it's always DECL (and never something that's not a _DECL). */
3481 push_overloaded_decl (decl
, forgettable
)
3485 tree orig_name
= DECL_NAME (decl
);
3487 int doing_global
= (global_bindings_p () || ! forgettable
);
3491 old
= IDENTIFIER_GLOBAL_VALUE (orig_name
);
3492 if (old
&& TREE_CODE (old
) == FUNCTION_DECL
3493 && DECL_ARTIFICIAL (old
)
3494 && (DECL_BUILT_IN (old
) || DECL_BUILT_IN_NONANSI (old
)))
3496 if (duplicate_decls (decl
, old
))
3503 old
= IDENTIFIER_LOCAL_VALUE (orig_name
);
3505 if (! purpose_member (orig_name
, current_binding_level
->shadowed
))
3507 current_binding_level
->shadowed
3508 = tree_cons (orig_name
, old
, current_binding_level
->shadowed
);
3515 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
3517 tree t
= TREE_TYPE (old
);
3518 if (IS_AGGR_TYPE (t
) && warn_shadow
3519 && (! DECL_IN_SYSTEM_HEADER (decl
)
3520 || ! DECL_IN_SYSTEM_HEADER (old
)))
3521 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
3524 else if (is_overloaded_fn (old
))
3528 for (tmp
= get_first_fn (old
); tmp
; tmp
= DECL_CHAIN (tmp
))
3529 if (decl
== tmp
|| duplicate_decls (decl
, tmp
))
3534 cp_error_at ("previous non-function declaration `%#D'", old
);
3535 cp_error ("conflicts with function declaration `%#D'", decl
);
3540 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
3542 if (old
&& is_overloaded_fn (old
))
3543 DECL_CHAIN (decl
) = get_first_fn (old
);
3545 DECL_CHAIN (decl
) = NULL_TREE
;
3546 old
= tree_cons (orig_name
, decl
, NULL_TREE
);
3547 TREE_TYPE (old
) = unknown_type_node
;
3550 /* orig_name is not ambiguous. */
3554 IDENTIFIER_GLOBAL_VALUE (orig_name
) = old
;
3556 IDENTIFIER_LOCAL_VALUE (orig_name
) = old
;
3561 /* Generate an implicit declaration for identifier FUNCTIONID
3562 as a function of type int (). Print a warning if appropriate. */
3565 implicitly_declare (functionid
)
3569 int temp
= allocation_temporary_p ();
3571 push_obstacks_nochange ();
3573 /* Save the decl permanently so we can warn if definition follows.
3574 In ANSI C, warn_implicit is usually false, so the saves little space.
3575 But in C++, it's usually true, hence the extra code. */
3576 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
3577 end_temporary_allocation ();
3579 /* We used to reuse an old implicit decl here,
3580 but this loses with inline functions because it can clobber
3581 the saved decl chains. */
3582 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
3584 DECL_EXTERNAL (decl
) = 1;
3585 TREE_PUBLIC (decl
) = 1;
3586 DECL_ARTIFICIAL (decl
) = 1;
3588 /* ANSI standard says implicit declarations are in the innermost block.
3589 So we record the decl in the standard fashion. */
3591 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
3594 /* Only one warning per identifier. */
3595 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
3597 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
3600 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
3607 /* Return zero if the declaration NEWDECL is valid
3608 when the declaration OLDDECL (assumed to be for the same name)
3609 has already been seen.
3610 Otherwise return an error message format string with a %s
3611 where the identifier should go. */
3614 redeclaration_error_message (newdecl
, olddecl
)
3615 tree newdecl
, olddecl
;
3617 if (TREE_CODE (newdecl
) == TYPE_DECL
)
3619 /* Because C++ can put things into name space for free,
3620 constructs like "typedef struct foo { ... } foo"
3621 would look like an erroneous redeclaration. */
3622 if (comptypes (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
), 0))
3625 return "redefinition of `%#D'";
3627 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3629 /* If this is a pure function, its olddecl will actually be
3630 the original initialization to `0' (which we force to call
3631 abort()). Don't complain about redefinition in this case. */
3632 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
3635 /* We'll complain about linkage mismatches in
3636 warn_extern_redeclared_static. */
3638 /* defining the same name twice is no good. */
3639 if (DECL_INITIAL (olddecl
) != NULL_TREE
3640 && DECL_INITIAL (newdecl
) != NULL_TREE
)
3642 if (DECL_NAME (olddecl
) == NULL_TREE
)
3643 return "`%#D' not declared in class";
3645 return "redefinition of `%#D'";
3649 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3651 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3652 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
3653 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
3654 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
3655 && TYPE_SIZE (TREE_TYPE (newdecl
))
3656 && TYPE_SIZE (TREE_TYPE (olddecl
))))
3657 return "redefinition of `%#D'";
3660 else if (toplevel_bindings_p ())
3662 /* Objects declared at top level: */
3663 /* If at least one is a reference, it's ok. */
3664 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
3666 /* Reject two definitions. */
3667 return "redefinition of `%#D'";
3671 /* Objects declared with block scope: */
3672 /* Reject two definitions, and reject a definition
3673 together with an external reference. */
3674 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
3675 return "redeclaration of `%#D'";
3680 /* Get the LABEL_DECL corresponding to identifier ID as a label.
3681 Create one if none exists so far for the current function.
3682 This function is called for both label definitions and label references. */
3688 register tree decl
= IDENTIFIER_LABEL_VALUE (id
);
3690 if (current_function_decl
== NULL_TREE
)
3692 error ("label `%s' referenced outside of any function",
3693 IDENTIFIER_POINTER (id
));
3697 if ((decl
== NULL_TREE
3698 || DECL_SOURCE_LINE (decl
) == 0)
3699 && (named_label_uses
== NULL
3700 || named_label_uses
->names_in_scope
!= current_binding_level
->names
3701 || named_label_uses
->label_decl
!= decl
))
3703 struct named_label_list
*new_ent
;
3705 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
3706 new_ent
->label_decl
= decl
;
3707 new_ent
->names_in_scope
= current_binding_level
->names
;
3708 new_ent
->binding_level
= current_binding_level
;
3709 new_ent
->lineno_o_goto
= lineno
;
3710 new_ent
->filename_o_goto
= input_filename
;
3711 new_ent
->next
= named_label_uses
;
3712 named_label_uses
= new_ent
;
3715 /* Use a label already defined or ref'd with this name. */
3716 if (decl
!= NULL_TREE
)
3718 /* But not if it is inherited and wasn't declared to be inheritable. */
3719 if (DECL_CONTEXT (decl
) != current_function_decl
3720 && ! C_DECLARED_LABEL_FLAG (decl
))
3721 return shadow_label (id
);
3725 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
3727 /* Make sure every label has an rtx. */
3730 /* A label not explicitly declared must be local to where it's ref'd. */
3731 DECL_CONTEXT (decl
) = current_function_decl
;
3733 DECL_MODE (decl
) = VOIDmode
;
3735 /* Say where one reference is to the label,
3736 for the sake of the error if it is not defined. */
3737 DECL_SOURCE_LINE (decl
) = lineno
;
3738 DECL_SOURCE_FILE (decl
) = input_filename
;
3740 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
3742 named_labels
= tree_cons (NULL_TREE
, decl
, named_labels
);
3743 named_label_uses
->label_decl
= decl
;
3748 /* Make a label named NAME in the current function,
3749 shadowing silently any that may be inherited from containing functions
3750 or containing scopes.
3752 Note that valid use, if the label being shadowed
3753 comes from another scope in the same function,
3754 requires calling declare_nonlocal_label right away. */
3760 register tree decl
= IDENTIFIER_LABEL_VALUE (name
);
3762 if (decl
!= NULL_TREE
)
3764 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
3765 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
3766 SET_IDENTIFIER_LABEL_VALUE (decl
, NULL_TREE
);
3769 return lookup_label (name
);
3772 /* Define a label, specifying the location in the source file.
3773 Return the LABEL_DECL node for the label, if the definition is valid.
3774 Otherwise return 0. */
3777 define_label (filename
, line
, name
)
3784 if (minimal_parse_mode
)
3786 push_obstacks (&permanent_obstack
, &permanent_obstack
);
3787 decl
= build_decl (LABEL_DECL
, name
, void_type_node
);
3789 DECL_SOURCE_LINE (decl
) = line
;
3790 DECL_SOURCE_FILE (decl
) = filename
;
3795 decl
= lookup_label (name
);
3797 /* After labels, make any new cleanups go into their
3798 own new (temporary) binding contour. */
3799 current_binding_level
->more_cleanups_ok
= 0;
3801 /* If label with this name is known from an outer context, shadow it. */
3802 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) != current_function_decl
)
3804 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
3805 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
3806 decl
= lookup_label (name
);
3809 if (name
== get_identifier ("wchar_t"))
3810 cp_pedwarn ("label named wchar_t");
3812 if (DECL_INITIAL (decl
) != NULL_TREE
)
3814 cp_error ("duplicate label `%D'", decl
);
3819 struct named_label_list
*uses
, *prev
;
3822 /* Mark label as having been defined. */
3823 DECL_INITIAL (decl
) = error_mark_node
;
3824 /* Say where in the source. */
3825 DECL_SOURCE_FILE (decl
) = filename
;
3826 DECL_SOURCE_LINE (decl
) = line
;
3829 uses
= named_label_uses
;
3830 while (uses
!= NULL
)
3831 if (uses
->label_decl
== decl
)
3833 struct binding_level
*b
= current_binding_level
;
3836 tree new_decls
= b
->names
;
3837 tree old_decls
= (b
== uses
->binding_level
)
3838 ? uses
->names_in_scope
: NULL_TREE
;
3839 while (new_decls
!= old_decls
)
3841 if (TREE_CODE (new_decls
) == VAR_DECL
3842 /* Don't complain about crossing initialization
3843 of internal entities. They can't be accessed,
3844 and they should be cleaned up
3845 by the time we get to the label. */
3846 && ! DECL_ARTIFICIAL (new_decls
)
3847 && ((DECL_INITIAL (new_decls
) != NULL_TREE
3848 && DECL_INITIAL (new_decls
) != error_mark_node
)
3849 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
3853 cp_error ("jump to label `%D'", decl
);
3854 error_with_file_and_line (uses
->filename_o_goto
,
3855 uses
->lineno_o_goto
,
3859 cp_error_at (" crosses initialization of `%#D'",
3862 new_decls
= TREE_CHAIN (new_decls
);
3864 if (b
== uses
->binding_level
)
3870 prev
->next
= uses
->next
;
3872 named_label_uses
= uses
->next
;
3881 current_function_return_value
= NULL_TREE
;
3888 struct binding_level
*level
;
3889 struct cp_switch
*next
;
3892 static struct cp_switch
*switch_stack
;
3898 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
3899 p
->level
= current_binding_level
;
3900 p
->next
= switch_stack
;
3907 switch_stack
= switch_stack
->next
;
3910 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
3911 /* XXX Note decl is never actually used. (bpk) */
3914 define_case_label (decl
)
3917 tree cleanup
= last_cleanup_this_contour ();
3918 struct binding_level
*b
= current_binding_level
;
3923 static int explained
= 0;
3924 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
3925 warning ("where case label appears here");
3928 warning ("(enclose actions of previous case statements requiring");
3929 warning ("destructors in their own binding contours.)");
3934 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
3936 tree new_decls
= b
->names
;
3937 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
3939 if (TREE_CODE (new_decls
) == VAR_DECL
3940 /* Don't complain about crossing initialization
3941 of internal entities. They can't be accessed,
3942 and they should be cleaned up
3943 by the time we get to the label. */
3944 && ! DECL_ARTIFICIAL (new_decls
)
3945 && ((DECL_INITIAL (new_decls
) != NULL_TREE
3946 && DECL_INITIAL (new_decls
) != error_mark_node
)
3947 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
3950 error ("jump to case label");
3952 cp_error_at (" crosses initialization of `%#D'",
3958 /* After labels, make any new cleanups go into their
3959 own new (temporary) binding contour. */
3961 current_binding_level
->more_cleanups_ok
= 0;
3962 current_function_return_value
= NULL_TREE
;
3965 /* Return the list of declarations of the current level.
3966 Note that this list is in reverse order unless/until
3967 you nreverse it; and when you do nreverse it, you must
3968 store the result back using `storedecls' or you will lose. */
3973 return current_binding_level
->names
;
3976 /* Return the list of type-tags (for structs, etc) of the current level. */
3981 return current_binding_level
->tags
;
3984 /* Store the list of declarations of the current level.
3985 This is done for the parameter declarations of a function being defined,
3986 after they are modified in the light of any missing parameters. */
3992 current_binding_level
->names
= decls
;
3995 /* Similarly, store the list of tags of the current level. */
4001 current_binding_level
->tags
= tags
;
4004 /* Given NAME, an IDENTIFIER_NODE,
4005 return the structure (or union or enum) definition for that name.
4006 Searches binding levels from BINDING_LEVEL up to the global level.
4007 If THISLEVEL_ONLY is nonzero, searches only the specified context
4008 (but skips any tag-transparent contexts to find one that is
4009 meaningful for tags).
4010 FORM says which kind of type the caller wants;
4011 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4012 If the wrong kind of type is found, and it's not a template, an error is
4016 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4017 enum tree_code form
;
4019 struct binding_level
*binding_level
;
4022 register struct binding_level
*level
;
4024 for (level
= binding_level
; level
; level
= level
->level_chain
)
4027 if (ANON_AGGRNAME_P (name
))
4028 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4030 /* There's no need for error checking here, because
4031 anon names are unique throughout the compilation. */
4032 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4033 return TREE_VALUE (tail
);
4036 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4038 if (TREE_PURPOSE (tail
) == name
)
4040 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
4041 /* Should tighten this up; it'll probably permit
4042 UNION_TYPE and a struct template, for example. */
4044 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
4046 /* Definition isn't the kind we were looking for. */
4047 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
4051 return TREE_VALUE (tail
);
4054 if (thislevel_only
&& ! level
->tag_transparent
)
4056 if (level
->pseudo_global
)
4058 tree t
= IDENTIFIER_GLOBAL_VALUE (name
);
4059 if (t
&& TREE_CODE (t
) == TEMPLATE_DECL
4060 && TREE_CODE (DECL_TEMPLATE_RESULT (t
)) == TYPE_DECL
)
4061 return TREE_TYPE (t
);
4065 if (current_class_type
&& level
->level_chain
== global_binding_level
)
4067 /* Try looking in this class's tags before heading into
4068 global binding level. */
4069 tree context
= current_class_type
;
4072 switch (TREE_CODE_CLASS (TREE_CODE (context
)))
4076 these_tags
= CLASSTYPE_TAGS (context
);
4077 if (ANON_AGGRNAME_P (name
))
4080 if (TYPE_IDENTIFIER (TREE_VALUE (these_tags
))
4082 return TREE_VALUE (tail
);
4083 these_tags
= TREE_CHAIN (these_tags
);
4088 if (TREE_PURPOSE (these_tags
) == name
)
4090 if (TREE_CODE (TREE_VALUE (these_tags
)) != form
)
4092 cp_error ("`%#D' redeclared as %C in class scope",
4093 TREE_VALUE (tail
), form
);
4096 return TREE_VALUE (tail
);
4098 these_tags
= TREE_CHAIN (these_tags
);
4100 /* If this type is not yet complete, then don't
4101 look at its context. */
4102 if (TYPE_SIZE (context
) == NULL_TREE
)
4104 /* Go to next enclosing type, if any. */
4105 context
= DECL_CONTEXT (TYPE_MAIN_DECL (context
));
4108 context
= DECL_CONTEXT (context
);
4111 my_friendly_abort (10);
4123 set_current_level_tags_transparency (tags_transparent
)
4124 int tags_transparent
;
4126 current_binding_level
->tag_transparent
= tags_transparent
;
4129 /* Given a type, find the tag that was defined for it and return the tag name.
4130 Otherwise return 0. However, the value can never be 0
4131 in the cases in which this is used.
4133 C++: If NAME is non-zero, this is the new name to install. This is
4134 done when replacing anonymous tags with real tag names. */
4137 lookup_tag_reverse (type
, name
)
4141 register struct binding_level
*level
;
4143 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
4146 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4148 if (TREE_VALUE (tail
) == type
)
4151 TREE_PURPOSE (tail
) = name
;
4152 return TREE_PURPOSE (tail
);
4159 /* Lookup TYPE in CONTEXT (a chain of nested types or a FUNCTION_DECL).
4160 Return the type value, or NULL_TREE if not found. */
4163 lookup_nested_type (type
, context
)
4167 if (context
== NULL_TREE
)
4171 switch (TREE_CODE (context
))
4175 tree ctype
= TREE_TYPE (context
);
4176 tree match
= value_member (type
, CLASSTYPE_TAGS (ctype
));
4178 return TREE_VALUE (match
);
4179 context
= DECL_CONTEXT (context
);
4181 /* When we have a nested class whose member functions have
4182 local types (e.g., a set of enums), we'll arrive here
4183 with the DECL_CONTEXT as the actual RECORD_TYPE node for
4184 the enclosing class. Instead, we want to make sure we
4185 come back in here with the TYPE_DECL, not the RECORD_TYPE. */
4186 if (context
&& TREE_CODE (context
) == RECORD_TYPE
)
4187 context
= TREE_CHAIN (context
);
4191 if (TYPE_NAME (type
) && TYPE_IDENTIFIER (type
))
4192 return lookup_name (TYPE_IDENTIFIER (type
), 1);
4195 my_friendly_abort (12);
4201 /* Look up NAME in the NAMESPACE. */
4204 lookup_namespace_name (namespace, name
)
4205 tree
namespace, name
;
4207 struct binding_level
*b
= (struct binding_level
*)NAMESPACE_LEVEL (namespace);
4211 /* This searches just one level. */
4214 for (x
= b
->names
; x
; x
= TREE_CHAIN (x
))
4215 if (DECL_NAME (x
) == name
|| DECL_ASSEMBLER_NAME (x
) == name
)
4219 /* This searches all levels. */
4220 for (; b
&& !x
; b
= b
->level_chain
)
4222 for (x
= b
->names
; x
; x
= TREE_CHAIN (x
))
4223 if (DECL_NAME (x
) == name
|| DECL_ASSEMBLER_NAME (x
) == name
)
4231 make_typename_type (context
, name
)
4236 if (TREE_CODE (name
) == TYPE_DECL
)
4237 name
= DECL_NAME (name
);
4238 else if (TREE_CODE (name
) != IDENTIFIER_NODE
)
4239 my_friendly_abort (2000);
4241 if (! processing_template_decl
4242 || ! uses_template_parms (context
)
4243 || context
== current_class_type
)
4245 t
= lookup_field (context
, name
, 0, 1);
4248 cp_error ("no type named `%#T' in `%#T'", name
, context
);
4249 return error_mark_node
;
4251 return TREE_TYPE (t
);
4254 if (processing_template_decl
)
4255 push_obstacks (&permanent_obstack
, &permanent_obstack
);
4256 t
= make_lang_type (TYPENAME_TYPE
);
4257 d
= build_decl (TYPE_DECL
, name
, t
);
4258 if (processing_template_decl
)
4261 TYPE_CONTEXT (t
) = context
;
4262 TYPE_NAME (TREE_TYPE (d
)) = d
;
4263 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
4264 DECL_CONTEXT (d
) = context
;
4265 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
4270 /* Look up NAME in the current binding level and its superiors in the
4271 namespace of variables, functions and typedefs. Return a ..._DECL
4272 node of some kind representing its definition if there is only one
4273 such declaration, or return a TREE_LIST with all the overloaded
4274 definitions if there are many, or return 0 if it is undefined.
4276 If PREFER_TYPE is > 0, we prefer TYPE_DECLs.
4277 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
4278 Otherwise we prefer non-TYPE_DECLs. */
4281 lookup_name_real (name
, prefer_type
, nonclass
)
4283 int prefer_type
, nonclass
;
4287 tree from_obj
= NULL_TREE
;
4288 tree locval
, classval
;
4290 if (prefer_type
== -2)
4292 extern int looking_for_typename
;
4293 tree type
= NULL_TREE
;
4296 prefer_type
= looking_for_typename
;
4300 else if (got_object
!= error_mark_node
)
4305 if (type
== error_mark_node
)
4306 return error_mark_node
;
4307 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
4308 type
= TREE_TYPE (type
);
4310 type
= complete_type (type
);
4312 if (type
== void_type_node
)
4313 val
= IDENTIFIER_GLOBAL_VALUE (name
);
4314 else if (TREE_CODE (type
) == NAMESPACE_DECL
)
4316 val
= lookup_namespace_name (type
, name
);
4318 else if (! IS_AGGR_TYPE (type
)
4319 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
4320 || TREE_CODE (type
) == TYPENAME_TYPE
)
4321 /* Someone else will give an error about this if needed. */
4323 else if (TYPE_BEING_DEFINED (type
))
4325 val
= IDENTIFIER_CLASS_VALUE (name
);
4326 if (val
&& DECL_CONTEXT (val
) != type
)
4328 struct binding_level
*b
= class_binding_level
;
4329 for (val
= NULL_TREE
; b
; b
= b
->level_chain
)
4331 tree t
= purpose_member (name
, b
->class_shadowed
);
4332 if (t
&& TREE_VALUE (t
)
4333 && DECL_CONTEXT (TREE_VALUE (t
)) == type
)
4335 val
= TREE_VALUE (t
);
4340 if (val
== NULL_TREE
)
4341 val
= lookup_field (type
, name
, 0, 1);
4343 else if (type
== current_class_type
)
4344 val
= IDENTIFIER_CLASS_VALUE (name
);
4346 val
= lookup_field (type
, name
, 0, prefer_type
);
4352 if (got_scope
&& processing_template_decl
4353 && got_scope
!= current_class_type
4354 && uses_template_parms (got_scope
)
4355 && val
&& TREE_CODE (val
) == TYPE_DECL
4356 && ! DECL_ARTIFICIAL (val
))
4358 tree t
= make_typename_type (got_scope
, DECL_NAME (val
));
4359 TREE_TYPE (t
) = TREE_TYPE (val
);
4360 val
= TYPE_MAIN_DECL (t
);
4366 else if (got_object
&& val
)
4370 locval
= classval
= NULL_TREE
;
4372 if (current_binding_level
!= global_binding_level
4373 && IDENTIFIER_LOCAL_VALUE (name
))
4374 locval
= IDENTIFIER_LOCAL_VALUE (name
);
4376 /* In C++ class fields are between local and global scope,
4377 just before the global scope. */
4378 if (current_class_type
&& ! nonclass
)
4380 classval
= IDENTIFIER_CLASS_VALUE (name
);
4381 if (classval
== NULL_TREE
&& TYPE_BEING_DEFINED (current_class_type
))
4382 /* Try to find values from base classes if we are presently
4383 defining a type. We are presently only interested in
4385 classval
= lookup_field (current_class_type
, name
, 0, 1);
4387 /* yylex() calls this with -2, since we should never start digging for
4388 the nested name at the point where we haven't even, for example,
4389 created the COMPONENT_REF or anything like that. */
4390 if (classval
== NULL_TREE
)
4391 classval
= lookup_nested_field (name
, ! yylex
);
4394 if (locval
&& classval
)
4396 if (current_scope () == current_function_decl
4397 && ! hack_decl_function_context (current_function_decl
))
4398 /* Not in a nested function. */
4402 /* This is incredibly horrible. The whole concept of
4403 IDENTIFIER_LOCAL_VALUE / IDENTIFIER_CLASS_VALUE /
4404 IDENTIFIER_GLOBAL_VALUE needs to be scrapped for local
4406 tree lctx
= hack_decl_function_context (locval
);
4407 tree cctx
= hack_decl_function_context (classval
);
4409 if (lctx
== current_scope ())
4411 else if (lctx
== cctx
)
4414 /* I don't know which is right; let's just guess for now. */
4423 val
= IDENTIFIER_GLOBAL_VALUE (name
);
4428 /* This should only warn about types used in qualified-ids. */
4429 if (from_obj
&& from_obj
!= val
)
4431 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
4432 && TREE_CODE (val
) == TYPE_DECL
4433 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
4435 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
4436 name
, got_object
, TREE_TYPE (from_obj
));
4437 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
4444 if ((TREE_CODE (val
) == TEMPLATE_DECL
&& looking_for_template
)
4445 || TREE_CODE (val
) == TYPE_DECL
|| prefer_type
<= 0)
4447 else if (IDENTIFIER_HAS_TYPE_VALUE (name
))
4448 val
= TYPE_MAIN_DECL (IDENTIFIER_TYPE_VALUE (name
));
4449 else if (TREE_TYPE (val
) == error_mark_node
)
4450 val
= error_mark_node
;
4459 lookup_name_nonclass (name
)
4462 return lookup_name_real (name
, 0, 1);
4466 lookup_name (name
, prefer_type
)
4470 return lookup_name_real (name
, prefer_type
, 0);
4473 /* Similar to `lookup_name' but look only at current binding level. */
4476 lookup_name_current_level (name
)
4479 register tree t
= NULL_TREE
;
4481 if (current_binding_level
== global_binding_level
)
4483 t
= IDENTIFIER_GLOBAL_VALUE (name
);
4485 /* extern "C" function() */
4486 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
4489 else if (IDENTIFIER_LOCAL_VALUE (name
) != NULL_TREE
)
4491 struct binding_level
*b
= current_binding_level
;
4494 for (t
= b
->names
; t
; t
= TREE_CHAIN (t
))
4495 if (DECL_NAME (t
) == name
|| DECL_ASSEMBLER_NAME (t
) == name
)
4509 /* Arrange for the user to get a source line number, even when the
4510 compiler is going down in flames, so that she at least has a
4511 chance of working around problems in the compiler. We used to
4512 call error(), but that let the segmentation fault continue
4513 through; now, it's much more passive by asking them to send the
4514 maintainers mail about the problem. */
4520 signal (SIGSEGV
, SIG_DFL
);
4522 signal (SIGIOT
, SIG_DFL
);
4525 signal (SIGILL
, SIG_DFL
);
4528 signal (SIGABRT
, SIG_DFL
);
4531 signal (SIGBUS
, SIG_DFL
);
4533 my_friendly_abort (0);
4537 /* Unused -- brendan 970107 */
4538 /* Array for holding types considered "built-in". These types
4539 are output in the module in which `main' is defined. */
4540 static tree
*builtin_type_tdescs_arr
;
4541 static int builtin_type_tdescs_len
, builtin_type_tdescs_max
;
4544 /* Push the declarations of builtin types into the namespace.
4545 RID_INDEX, if < RID_MAX is the index of the builtin type
4546 in the array RID_POINTERS. NAME is the name used when looking
4547 up the builtin type. TYPE is the _TYPE node for the builtin type. */
4550 record_builtin_type (rid_index
, name
, type
)
4555 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
4558 if ((int) rid_index
< (int) RID_MAX
)
4559 rname
= ridpointers
[(int) rid_index
];
4561 tname
= get_identifier (name
);
4563 TYPE_BUILT_IN (type
) = 1;
4567 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
4568 set_identifier_type_value (tname
, NULL_TREE
);
4569 if ((int) rid_index
< (int) RID_MAX
)
4570 IDENTIFIER_GLOBAL_VALUE (tname
) = tdecl
;
4572 if (rname
!= NULL_TREE
)
4574 if (tname
!= NULL_TREE
)
4576 set_identifier_type_value (rname
, NULL_TREE
);
4577 IDENTIFIER_GLOBAL_VALUE (rname
) = tdecl
;
4581 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
4582 set_identifier_type_value (rname
, NULL_TREE
);
4587 /* Push overloaded decl, in global scope, with one argument so it
4588 can be used as a callback from define_function. */
4591 push_overloaded_decl_1 (x
)
4594 push_overloaded_decl (x
, 0);
4601 auto_function (name
, type
, code
)
4603 enum built_in_function code
;
4605 return define_function
4606 (IDENTIFIER_POINTER (name
), type
, code
, (void (*)())push_overloaded_decl_1
,
4607 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
4611 /* Create the predefined scalar types of C,
4612 and some nodes representing standard constants (0, 1, (void *)0).
4613 Initialize the global binding level.
4614 Make definitions for built-in primitive functions. */
4617 init_decl_processing ()
4620 register tree endlink
, int_endlink
, double_endlink
, unsigned_endlink
;
4622 /* Data type of memcpy. */
4623 tree memcpy_ftype
, strlen_ftype
;
4624 int wchar_type_size
;
4626 tree array_domain_type
;
4627 extern int flag_strict_prototype
;
4628 tree vb_off_identifier
;
4629 /* Function type `char *(char *, char *)' and similar ones */
4630 tree string_ftype_ptr_ptr
, int_ftype_string_string
;
4631 tree sizetype_endlink
;
4632 tree ptr_ftype
, ptr_ftype_unsigned
, ptr_ftype_sizetype
;
4633 tree void_ftype
, void_ftype_int
, void_ftype_ptr
;
4635 /* Have to make these distinct before we try using them. */
4636 lang_name_cplusplus
= get_identifier ("C++");
4637 lang_name_c
= get_identifier ("C");
4639 if (flag_strict_prototype
== 2)
4642 strict_prototypes_lang_c
= strict_prototypes_lang_cplusplus
;
4645 strict_prototypes_lang_c
= flag_strict_prototype
;
4648 current_lang_name
= lang_name_c
;
4650 current_function_decl
= NULL_TREE
;
4651 named_labels
= NULL_TREE
;
4652 named_label_uses
= NULL
;
4653 current_binding_level
= NULL_BINDING_LEVEL
;
4654 free_binding_level
= NULL_BINDING_LEVEL
;
4656 /* Because most segmentation signals can be traced back into user
4657 code, catch them and at least give the user a chance of working
4658 around compiler bugs. */
4659 signal (SIGSEGV
, signal_catch
);
4661 /* We will also catch aborts in the back-end through signal_catch and
4662 give the user a chance to see where the error might be, and to defeat
4663 aborts in the back-end when there have been errors previously in their
4666 signal (SIGIOT
, signal_catch
);
4669 signal (SIGILL
, signal_catch
);
4672 signal (SIGABRT
, signal_catch
);
4675 signal (SIGBUS
, signal_catch
);
4678 gcc_obstack_init (&decl_obstack
);
4680 /* Must lay these out before anything else gets laid out. */
4681 error_mark_node
= make_node (ERROR_MARK
);
4682 TREE_PERMANENT (error_mark_node
) = 1;
4683 TREE_TYPE (error_mark_node
) = error_mark_node
;
4684 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
4685 TREE_TYPE (error_mark_list
) = error_mark_node
;
4687 /* Make the binding_level structure for global names. */
4689 global_binding_level
= current_binding_level
;
4691 this_identifier
= get_identifier (THIS_NAME
);
4692 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
4693 ctor_identifier
= get_identifier (CTOR_NAME
);
4694 dtor_identifier
= get_identifier (DTOR_NAME
);
4695 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
4696 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
4697 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
4698 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
4699 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
4700 if (flag_handle_signatures
)
4702 tag_identifier
= get_identifier (SIGTABLE_TAG_NAME
);
4703 vb_off_identifier
= get_identifier (SIGTABLE_VB_OFF_NAME
);
4704 vt_off_identifier
= get_identifier (SIGTABLE_VT_OFF_NAME
);
4707 /* Define `int' and `char' first so that dbx will output them first. */
4709 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
4710 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
4712 /* Define `char', which is like either `signed char' or `unsigned char'
4713 but not the same as either. */
4717 ? make_signed_type (CHAR_TYPE_SIZE
)
4718 : make_unsigned_type (CHAR_TYPE_SIZE
));
4719 record_builtin_type (RID_CHAR
, "char", char_type_node
);
4721 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
4722 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
4724 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
4725 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
4727 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
4728 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
4729 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
4731 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
4732 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
4734 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
4735 record_builtin_type (RID_MAX
, "long long unsigned int",
4736 long_long_unsigned_type_node
);
4737 record_builtin_type (RID_MAX
, "long long unsigned",
4738 long_long_unsigned_type_node
);
4740 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
4741 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
4742 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
4743 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
4744 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
4746 /* `unsigned long' is the standard type for sizeof.
4747 Note that stddef.h uses `unsigned long',
4748 and this must agree, even of long and int are the same size. */
4750 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
)));
4753 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
4755 TREE_TYPE (TYPE_SIZE (integer_type_node
)) = sizetype
;
4756 TREE_TYPE (TYPE_SIZE (char_type_node
)) = sizetype
;
4757 TREE_TYPE (TYPE_SIZE (unsigned_type_node
)) = sizetype
;
4758 TREE_TYPE (TYPE_SIZE (long_unsigned_type_node
)) = sizetype
;
4759 TREE_TYPE (TYPE_SIZE (long_integer_type_node
)) = sizetype
;
4760 TREE_TYPE (TYPE_SIZE (long_long_integer_type_node
)) = sizetype
;
4761 TREE_TYPE (TYPE_SIZE (long_long_unsigned_type_node
)) = sizetype
;
4762 TREE_TYPE (TYPE_SIZE (short_integer_type_node
)) = sizetype
;
4763 TREE_TYPE (TYPE_SIZE (short_unsigned_type_node
)) = sizetype
;
4765 /* Define both `signed char' and `unsigned char'. */
4766 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
4767 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
4768 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
4769 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
4771 /* These are types that type_for_size and type_for_mode use. */
4772 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
4773 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
4774 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
4775 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
4776 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
4777 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
4778 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
4779 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
4780 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
4781 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
4782 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
4783 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
4784 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
4785 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
4786 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
4787 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
4789 float_type_node
= make_node (REAL_TYPE
);
4790 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
4791 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
4792 layout_type (float_type_node
);
4794 double_type_node
= make_node (REAL_TYPE
);
4795 if (flag_short_double
)
4796 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
4798 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
4799 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
4800 layout_type (double_type_node
);
4802 long_double_type_node
= make_node (REAL_TYPE
);
4803 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
4804 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
4805 layout_type (long_double_type_node
);
4807 integer_zero_node
= build_int_2 (0, 0);
4808 TREE_TYPE (integer_zero_node
) = integer_type_node
;
4809 integer_one_node
= build_int_2 (1, 0);
4810 TREE_TYPE (integer_one_node
) = integer_type_node
;
4811 integer_two_node
= build_int_2 (2, 0);
4812 TREE_TYPE (integer_two_node
) = integer_type_node
;
4813 integer_three_node
= build_int_2 (3, 0);
4814 TREE_TYPE (integer_three_node
) = integer_type_node
;
4816 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
4817 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
4818 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
4819 boolean_false_node
= build_int_2 (0, 0);
4820 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
4821 boolean_true_node
= build_int_2 (1, 0);
4822 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
4824 /* These are needed by stor-layout.c. */
4825 size_zero_node
= size_int (0);
4826 size_one_node
= size_int (1);
4828 signed_size_zero_node
= build_int_2 (0, 0);
4829 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
4831 void_type_node
= make_node (VOID_TYPE
);
4832 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
4833 layout_type (void_type_node
); /* Uses integer_zero_node. */
4834 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
4835 TREE_PARMLIST (void_list_node
) = 1;
4837 null_pointer_node
= build_int_2 (0, 0);
4838 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
4839 layout_type (TREE_TYPE (null_pointer_node
));
4842 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
4844 TREE_TYPE (null_node
) = build_pointer_type (void_type_node
);
4846 /* Used for expressions that do nothing, but are not errors. */
4847 void_zero_node
= build_int_2 (0, 0);
4848 TREE_TYPE (void_zero_node
) = void_type_node
;
4850 string_type_node
= build_pointer_type (char_type_node
);
4851 const_string_type_node
=
4852 build_pointer_type (build_type_variant (char_type_node
, 1, 0));
4854 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
4857 /* Make a type to be the domain of a few array types
4858 whose domains don't really matter.
4859 200 is small enough that it always fits in size_t
4860 and large enough that it can hold most function names for the
4861 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4862 array_domain_type
= build_index_type (build_int_2 (200, 0));
4864 /* make a type for arrays of characters.
4865 With luck nothing will ever really depend on the length of this
4867 char_array_type_node
4868 = build_array_type (char_type_node
, array_domain_type
);
4869 /* Likewise for arrays of ints. */
4871 = build_array_type (integer_type_node
, array_domain_type
);
4873 /* This is just some anonymous class type. Nobody should ever
4874 need to look inside this envelope. */
4875 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
4877 default_function_type
4878 = build_function_type (integer_type_node
, NULL_TREE
);
4880 ptr_type_node
= build_pointer_type (void_type_node
);
4881 const_ptr_type_node
=
4882 build_pointer_type (build_type_variant (void_type_node
, 1, 0));
4884 record_builtin_type (RID_MAX
, NULL_PTR
, ptr_type_node
);
4886 endlink
= void_list_node
;
4887 int_endlink
= tree_cons (NULL_TREE
, integer_type_node
, endlink
);
4888 double_endlink
= tree_cons (NULL_TREE
, double_type_node
, endlink
);
4889 unsigned_endlink
= tree_cons (NULL_TREE
, unsigned_type_node
, endlink
);
4891 ptr_ftype
= build_function_type (ptr_type_node
, NULL_TREE
);
4892 ptr_ftype_unsigned
= build_function_type (ptr_type_node
, unsigned_endlink
);
4893 sizetype_endlink
= tree_cons (NULL_TREE
, sizetype
, endlink
);
4894 /* We realloc here because sizetype could be int or unsigned. S'ok. */
4895 ptr_ftype_sizetype
= build_function_type (ptr_type_node
, sizetype_endlink
);
4897 void_ftype
= build_function_type (void_type_node
, endlink
);
4898 void_ftype_int
= build_function_type (void_type_node
, int_endlink
);
4900 = build_function_type (void_type_node
,
4901 tree_cons (NULL_TREE
, ptr_type_node
, endlink
));
4903 = build_exception_variant (void_ftype_ptr
,
4904 tree_cons (NULL_TREE
, NULL_TREE
, NULL_TREE
));
4907 = build_function_type (float_type_node
,
4908 tree_cons (NULL_TREE
, float_type_node
, endlink
));
4911 = build_function_type (double_type_node
, double_endlink
);
4913 ldouble_ftype_ldouble
4914 = build_function_type (long_double_type_node
,
4915 tree_cons (NULL_TREE
, long_double_type_node
,
4918 double_ftype_double_double
4919 = build_function_type (double_type_node
,
4920 tree_cons (NULL_TREE
, double_type_node
,
4924 = build_function_type (integer_type_node
, int_endlink
);
4927 = build_function_type (long_integer_type_node
,
4928 tree_cons (NULL_TREE
, long_integer_type_node
,
4931 int_ftype_cptr_cptr_sizet
4932 = build_function_type (integer_type_node
,
4933 tree_cons (NULL_TREE
, const_ptr_type_node
,
4934 tree_cons (NULL_TREE
, const_ptr_type_node
,
4935 tree_cons (NULL_TREE
,
4939 string_ftype_ptr_ptr
/* strcpy prototype */
4940 = build_function_type (string_type_node
,
4941 tree_cons (NULL_TREE
, string_type_node
,
4942 tree_cons (NULL_TREE
,
4943 const_string_type_node
,
4946 int_ftype_string_string
/* strcmp prototype */
4947 = build_function_type (integer_type_node
,
4948 tree_cons (NULL_TREE
, const_string_type_node
,
4949 tree_cons (NULL_TREE
,
4950 const_string_type_node
,
4953 strlen_ftype
/* strlen prototype */
4954 = build_function_type (sizetype
,
4955 tree_cons (NULL_TREE
, const_string_type_node
,
4958 memcpy_ftype
/* memcpy prototype */
4959 = build_function_type (ptr_type_node
,
4960 tree_cons (NULL_TREE
, ptr_type_node
,
4961 tree_cons (NULL_TREE
, const_ptr_type_node
,
4962 sizetype_endlink
)));
4964 if (flag_huge_objects
)
4965 delta_type_node
= long_integer_type_node
;
4967 delta_type_node
= short_integer_type_node
;
4969 builtin_function ("__builtin_constant_p", int_ftype_int
,
4970 BUILT_IN_CONSTANT_P
, NULL_PTR
);
4972 builtin_return_address_fndecl
=
4973 builtin_function ("__builtin_return_address", ptr_ftype_unsigned
,
4974 BUILT_IN_RETURN_ADDRESS
, NULL_PTR
);
4976 builtin_function ("__builtin_frame_address", ptr_ftype_unsigned
,
4977 BUILT_IN_FRAME_ADDRESS
, NULL_PTR
);
4979 builtin_function ("__builtin_alloca", ptr_ftype_sizetype
,
4980 BUILT_IN_ALLOCA
, "alloca");
4981 builtin_function ("__builtin_ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
4982 /* Define alloca, ffs as builtins.
4983 Declare _exit just to mark it as volatile. */
4984 if (! flag_no_builtin
&& !flag_no_nonansi_builtin
)
4986 temp
= builtin_function ("alloca", ptr_ftype_sizetype
,
4987 BUILT_IN_ALLOCA
, NULL_PTR
);
4988 /* Suppress error if redefined as a non-function. */
4989 DECL_BUILT_IN_NONANSI (temp
) = 1;
4990 temp
= builtin_function ("ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
4991 /* Suppress error if redefined as a non-function. */
4992 DECL_BUILT_IN_NONANSI (temp
) = 1;
4993 temp
= builtin_function ("_exit", void_ftype_int
,
4994 NOT_BUILT_IN
, NULL_PTR
);
4995 TREE_THIS_VOLATILE (temp
) = 1;
4996 TREE_SIDE_EFFECTS (temp
) = 1;
4997 /* Suppress error if redefined as a non-function. */
4998 DECL_BUILT_IN_NONANSI (temp
) = 1;
5001 builtin_function ("__builtin_abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
5002 builtin_function ("__builtin_fabsf", float_ftype_float
, BUILT_IN_FABS
,
5004 builtin_function ("__builtin_fabs", double_ftype_double
, BUILT_IN_FABS
,
5006 builtin_function ("__builtin_fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
5008 builtin_function ("__builtin_labs", long_ftype_long
,
5009 BUILT_IN_LABS
, NULL_PTR
);
5010 builtin_function ("__builtin_saveregs", ptr_ftype
,
5011 BUILT_IN_SAVEREGS
, NULL_PTR
);
5012 builtin_function ("__builtin_classify_type", default_function_type
,
5013 BUILT_IN_CLASSIFY_TYPE
, NULL_PTR
);
5014 builtin_function ("__builtin_next_arg", ptr_ftype
,
5015 BUILT_IN_NEXT_ARG
, NULL_PTR
);
5016 builtin_function ("__builtin_args_info", int_ftype_int
,
5017 BUILT_IN_ARGS_INFO
, NULL_PTR
);
5019 /* Untyped call and return. */
5020 builtin_function ("__builtin_apply_args", ptr_ftype
,
5021 BUILT_IN_APPLY_ARGS
, NULL_PTR
);
5023 temp
= tree_cons (NULL_TREE
,
5024 build_pointer_type (build_function_type (void_type_node
,
5026 ptr_ftype_sizetype
);
5027 builtin_function ("__builtin_apply",
5028 build_function_type (ptr_type_node
, temp
),
5029 BUILT_IN_APPLY
, NULL_PTR
);
5030 builtin_function ("__builtin_return", void_ftype_ptr
,
5031 BUILT_IN_RETURN
, NULL_PTR
);
5033 /* Currently under experimentation. */
5034 builtin_function ("__builtin_memcpy", memcpy_ftype
,
5035 BUILT_IN_MEMCPY
, "memcpy");
5036 builtin_function ("__builtin_memcmp", int_ftype_cptr_cptr_sizet
,
5037 BUILT_IN_MEMCMP
, "memcmp");
5038 builtin_function ("__builtin_strcmp", int_ftype_string_string
,
5039 BUILT_IN_STRCMP
, "strcmp");
5040 builtin_function ("__builtin_strcpy", string_ftype_ptr_ptr
,
5041 BUILT_IN_STRCPY
, "strcpy");
5042 builtin_function ("__builtin_strlen", strlen_ftype
,
5043 BUILT_IN_STRLEN
, "strlen");
5044 builtin_function ("__builtin_sqrtf", float_ftype_float
,
5045 BUILT_IN_FSQRT
, "sqrtf");
5046 builtin_function ("__builtin_fsqrt", double_ftype_double
,
5047 BUILT_IN_FSQRT
, NULL_PTR
);
5048 builtin_function ("__builtin_sqrtl", ldouble_ftype_ldouble
,
5049 BUILT_IN_FSQRT
, "sqrtl");
5050 builtin_function ("__builtin_sinf", float_ftype_float
,
5051 BUILT_IN_SIN
, "sinf");
5052 builtin_function ("__builtin_sin", double_ftype_double
,
5053 BUILT_IN_SIN
, "sin");
5054 builtin_function ("__builtin_sinl", ldouble_ftype_ldouble
,
5055 BUILT_IN_SIN
, "sinl");
5056 builtin_function ("__builtin_cosf", float_ftype_float
,
5057 BUILT_IN_COS
, "cosf");
5058 builtin_function ("__builtin_cos", double_ftype_double
,
5059 BUILT_IN_COS
, "cos");
5060 builtin_function ("__builtin_cosl", ldouble_ftype_ldouble
,
5061 BUILT_IN_COS
, "cosl");
5063 if (!flag_no_builtin
)
5065 #if 0 /* These do not work well with libg++. */
5066 builtin_function ("abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
5067 builtin_function ("fabs", double_ftype_double
, BUILT_IN_FABS
, NULL_PTR
);
5068 builtin_function ("labs", long_ftype_long
, BUILT_IN_LABS
, NULL_PTR
);
5070 builtin_function ("fabsf", float_ftype_float
, BUILT_IN_FABS
, NULL_PTR
);
5071 builtin_function ("fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
5073 builtin_function ("memcpy", memcpy_ftype
, BUILT_IN_MEMCPY
, NULL_PTR
);
5074 builtin_function ("memcmp", int_ftype_cptr_cptr_sizet
, BUILT_IN_MEMCMP
,
5076 builtin_function ("strcmp", int_ftype_string_string
, BUILT_IN_STRCMP
,
5078 builtin_function ("strcpy", string_ftype_ptr_ptr
, BUILT_IN_STRCPY
,
5080 builtin_function ("strlen", strlen_ftype
, BUILT_IN_STRLEN
, NULL_PTR
);
5081 builtin_function ("sqrtf", float_ftype_float
, BUILT_IN_FSQRT
, NULL_PTR
);
5082 builtin_function ("sqrt", double_ftype_double
, BUILT_IN_FSQRT
, NULL_PTR
);
5083 builtin_function ("sqrtl", ldouble_ftype_ldouble
, BUILT_IN_FSQRT
,
5085 builtin_function ("sinf", float_ftype_float
, BUILT_IN_SIN
, NULL_PTR
);
5086 builtin_function ("sin", double_ftype_double
, BUILT_IN_SIN
, NULL_PTR
);
5087 builtin_function ("sinl", ldouble_ftype_ldouble
, BUILT_IN_SIN
, NULL_PTR
);
5088 builtin_function ("cosf", float_ftype_float
, BUILT_IN_COS
, NULL_PTR
);
5089 builtin_function ("cos", double_ftype_double
, BUILT_IN_COS
, NULL_PTR
);
5090 builtin_function ("cosl", ldouble_ftype_ldouble
, BUILT_IN_COS
, NULL_PTR
);
5092 /* Declare these functions volatile
5093 to avoid spurious "control drops through" warnings. */
5094 temp
= builtin_function ("abort", void_ftype
,
5095 NOT_BUILT_IN
, NULL_PTR
);
5096 TREE_THIS_VOLATILE (temp
) = 1;
5097 TREE_SIDE_EFFECTS (temp
) = 1;
5098 /* Well, these are actually ANSI, but we can't set DECL_BUILT_IN on
5100 DECL_BUILT_IN_NONANSI (temp
) = 1;
5101 temp
= builtin_function ("exit", void_ftype_int
,
5102 NOT_BUILT_IN
, NULL_PTR
);
5103 TREE_THIS_VOLATILE (temp
) = 1;
5104 TREE_SIDE_EFFECTS (temp
) = 1;
5105 DECL_BUILT_IN_NONANSI (temp
) = 1;
5109 /* Support for these has not been written in either expand_builtin
5110 or build_function_call. */
5111 builtin_function ("__builtin_div", default_ftype
, BUILT_IN_DIV
, NULL_PTR
);
5112 builtin_function ("__builtin_ldiv", default_ftype
, BUILT_IN_LDIV
, NULL_PTR
);
5113 builtin_function ("__builtin_ffloor", double_ftype_double
, BUILT_IN_FFLOOR
,
5115 builtin_function ("__builtin_fceil", double_ftype_double
, BUILT_IN_FCEIL
,
5117 builtin_function ("__builtin_fmod", double_ftype_double_double
,
5118 BUILT_IN_FMOD
, NULL_PTR
);
5119 builtin_function ("__builtin_frem", double_ftype_double_double
,
5120 BUILT_IN_FREM
, NULL_PTR
);
5121 builtin_function ("__builtin_memset", ptr_ftype_ptr_int_int
,
5122 BUILT_IN_MEMSET
, NULL_PTR
);
5123 builtin_function ("__builtin_getexp", double_ftype_double
, BUILT_IN_GETEXP
,
5125 builtin_function ("__builtin_getman", double_ftype_double
, BUILT_IN_GETMAN
,
5129 /* C++ extensions */
5131 unknown_type_node
= make_node (UNKNOWN_TYPE
);
5132 decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier ("unknown type"),
5133 unknown_type_node
));
5134 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5135 DECL_IGNORED_P (decl
) = 1;
5136 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5137 TYPE_SIZE (unknown_type_node
) = TYPE_SIZE (void_type_node
);
5138 TYPE_ALIGN (unknown_type_node
) = 1;
5139 TYPE_MODE (unknown_type_node
) = TYPE_MODE (void_type_node
);
5140 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
5141 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
5142 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same result. */
5143 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
5144 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
5146 /* This is for handling opaque types in signatures. */
5147 opaque_type_node
= copy_node (ptr_type_node
);
5148 TYPE_MAIN_VARIANT (opaque_type_node
) = opaque_type_node
;
5149 record_builtin_type (RID_MAX
, 0, opaque_type_node
);
5151 /* This is special for C++ so functions can be overloaded. */
5153 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
5154 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
5155 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
5156 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
5158 = TREE_UNSIGNED (wchar_type_node
)
5159 ? unsigned_wchar_type_node
5160 : signed_wchar_type_node
;
5161 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
5163 /* Artificial declaration of wchar_t -- can be bashed */
5164 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
5166 pushdecl (wchar_decl_node
);
5168 /* This is for wide string constants. */
5169 wchar_array_type_node
5170 = build_array_type (wchar_type_node
, array_domain_type
);
5172 if (flag_vtable_thunks
)
5174 /* Make sure we get a unique function type, so we can give
5175 its pointer type a name. (This wins for gdb.) */
5176 tree vfunc_type
= make_node (FUNCTION_TYPE
);
5177 TREE_TYPE (vfunc_type
) = integer_type_node
;
5178 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
5179 layout_type (vfunc_type
);
5181 vtable_entry_type
= build_pointer_type (vfunc_type
);
5185 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
5186 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
5188 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
5190 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
5192 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
5195 /* Make this part of an invisible union. */
5196 fields
[3] = copy_node (fields
[2]);
5197 TREE_TYPE (fields
[3]) = delta_type_node
;
5198 DECL_NAME (fields
[3]) = delta2_identifier
;
5199 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
5200 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
5201 TREE_UNSIGNED (fields
[3]) = 0;
5202 TREE_CHAIN (fields
[2]) = fields
[3];
5203 vtable_entry_type
= build_type_variant (vtable_entry_type
, 1, 0);
5205 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
5208 = build_array_type (vtable_entry_type
, NULL_TREE
);
5209 layout_type (vtbl_type_node
);
5210 vtbl_type_node
= cp_build_type_variant (vtbl_type_node
, 1, 0);
5211 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
5213 /* Simplify life by making a "sigtable_entry_type". Give its
5214 fields names so that the debugger can use them. */
5216 if (flag_handle_signatures
)
5218 sigtable_entry_type
= make_lang_type (RECORD_TYPE
);
5219 fields
[0] = build_lang_field_decl (FIELD_DECL
, tag_identifier
,
5221 fields
[1] = build_lang_field_decl (FIELD_DECL
, vb_off_identifier
,
5223 fields
[2] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
5225 fields
[3] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
5227 fields
[4] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
5230 /* Set the alignment to the max of the alignment of ptr_type_node and
5231 delta_type_node. Double alignment wastes a word on the Sparc. */
5232 finish_builtin_type (sigtable_entry_type
, SIGTABLE_PTR_TYPE
, fields
, 4,
5233 (TYPE_ALIGN (ptr_type_node
) > TYPE_ALIGN (delta_type_node
))
5237 /* Make this part of an invisible union. */
5238 fields
[5] = copy_node (fields
[4]);
5239 TREE_TYPE (fields
[5]) = delta_type_node
;
5240 DECL_NAME (fields
[5]) = vt_off_identifier
;
5241 DECL_MODE (fields
[5]) = TYPE_MODE (delta_type_node
);
5242 DECL_SIZE (fields
[5]) = TYPE_SIZE (delta_type_node
);
5243 TREE_UNSIGNED (fields
[5]) = 0;
5244 TREE_CHAIN (fields
[4]) = fields
[5];
5246 sigtable_entry_type
= build_type_variant (sigtable_entry_type
, 1, 0);
5247 record_builtin_type (RID_MAX
, SIGTABLE_PTR_TYPE
, sigtable_entry_type
);
5253 /* Must build __t_desc type. Currently, type descriptors look like this:
5260 struct __t_desc *points_to;
5261 int ivars_count, meths_count;
5262 struct __i_desc *ivars[];
5263 struct __m_desc *meths[];
5264 struct __t_desc *parents[];
5265 struct __t_desc *vbases[];
5269 ...as per Linton's paper. */
5271 __t_desc_type_node
= make_lang_type (RECORD_TYPE
);
5272 __i_desc_type_node
= make_lang_type (RECORD_TYPE
);
5273 __m_desc_type_node
= make_lang_type (RECORD_TYPE
);
5274 __t_desc_array_type
=
5275 build_array_type (build_pointer_type (__t_desc_type_node
), NULL_TREE
);
5276 __i_desc_array_type
=
5277 build_array_type (build_pointer_type (__i_desc_type_node
), NULL_TREE
);
5278 __m_desc_array_type
=
5279 build_array_type (build_pointer_type (__m_desc_type_node
), NULL_TREE
);
5281 fields
[0] = build_lang_field_decl (FIELD_DECL
, get_identifier ("name"),
5283 fields
[1] = build_lang_field_decl (FIELD_DECL
, get_identifier ("size"),
5284 unsigned_type_node
);
5285 fields
[2] = build_lang_field_decl (FIELD_DECL
, get_identifier ("bits"),
5286 unsigned_type_node
);
5287 fields
[3] = build_lang_field_decl (FIELD_DECL
,
5288 get_identifier ("points_to"),
5289 build_pointer_type (__t_desc_type_node
));
5290 fields
[4] = build_lang_field_decl (FIELD_DECL
,
5291 get_identifier ("ivars_count"),
5293 fields
[5] = build_lang_field_decl (FIELD_DECL
,
5294 get_identifier ("meths_count"),
5296 fields
[6] = build_lang_field_decl (FIELD_DECL
, get_identifier ("ivars"),
5297 build_pointer_type (__i_desc_array_type
));
5298 fields
[7] = build_lang_field_decl (FIELD_DECL
, get_identifier ("meths"),
5299 build_pointer_type (__m_desc_array_type
));
5300 fields
[8] = build_lang_field_decl (FIELD_DECL
, get_identifier ("parents"),
5301 build_pointer_type (__t_desc_array_type
));
5302 fields
[9] = build_lang_field_decl (FIELD_DECL
, get_identifier ("vbases"),
5303 build_pointer_type (__t_desc_array_type
));
5304 fields
[10] = build_lang_field_decl (FIELD_DECL
, get_identifier ("offsets"),
5305 build_pointer_type (integer_type_node
));
5306 finish_builtin_type (__t_desc_type_node
, "__t_desc", fields
, 10, integer_type_node
);
5308 /* ivar descriptors look like this:
5314 struct __t_desc *type;
5318 fields
[0] = build_lang_field_decl (FIELD_DECL
, get_identifier ("name"),
5320 fields
[1] = build_lang_field_decl (FIELD_DECL
, get_identifier ("offset"),
5322 fields
[2] = build_lang_field_decl (FIELD_DECL
, get_identifier ("type"),
5323 build_pointer_type (__t_desc_type_node
));
5324 finish_builtin_type (__i_desc_type_node
, "__i_desc", fields
, 2,
5327 /* method descriptors look like this:
5333 struct __t_desc *vcontext;
5334 struct __t_desc *return_type;
5337 short required_parms;
5338 struct __t_desc *parm_types[];
5342 fields
[0] = build_lang_field_decl (FIELD_DECL
, get_identifier ("name"),
5344 fields
[1] = build_lang_field_decl (FIELD_DECL
, get_identifier ("vindex"),
5346 fields
[2] = build_lang_field_decl (FIELD_DECL
, get_identifier ("vcontext"),
5347 build_pointer_type (__t_desc_type_node
));
5348 fields
[3] = build_lang_field_decl (FIELD_DECL
, get_identifier ("return_type"),
5349 build_pointer_type (__t_desc_type_node
));
5350 fields
[4] = build_lang_field_decl (FIELD_DECL
, get_identifier ("address"),
5351 build_pointer_type (default_function_type
));
5352 fields
[5] = build_lang_field_decl (FIELD_DECL
, get_identifier ("parm_count"),
5353 short_integer_type_node
);
5354 fields
[6] = build_lang_field_decl (FIELD_DECL
, get_identifier ("required_parms"),
5355 short_integer_type_node
);
5356 fields
[7] = build_lang_field_decl (FIELD_DECL
, get_identifier ("parm_types"),
5357 build_pointer_type (build_array_type (build_pointer_type (__t_desc_type_node
), NULL_TREE
)));
5358 finish_builtin_type (__m_desc_type_node
, "__m_desc", fields
, 7,
5361 #endif /*flag_rtti*/
5364 current_lang_name
= lang_name_cplusplus
;
5366 auto_function (ansi_opname
[(int) NEW_EXPR
], ptr_ftype_sizetype
,
5368 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], ptr_ftype_sizetype
,
5370 auto_function (ansi_opname
[(int) DELETE_EXPR
], void_ftype_ptr
,
5372 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], void_ftype_ptr
,
5376 = define_function ("__pure_virtual", void_ftype
,
5377 NOT_BUILT_IN
, 0, 0);
5379 /* Perform other language dependent initializations. */
5380 init_class_processing ();
5381 init_init_processing ();
5382 init_search_processing ();
5383 init_rtti_processing ();
5385 if (flag_exceptions
)
5386 init_exception_processing ();
5389 flag_inline_functions
= 0;
5392 if (! supports_one_only ())
5395 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
5396 declare_function_name ();
5398 /* Prepare to check format strings against argument lists. */
5399 init_function_format_info ();
5402 /* initialize type descriptor type node of various rtti type. */
5409 tdecl
= lookup_name (get_identifier ("type_info"), 0);
5410 if (tdecl
== NULL_TREE
)
5412 __t_desc_type_node
= TREE_TYPE (tdecl
);
5414 __tp_desc_type_node
= build_pointer_type (__t_desc_type_node
);
5418 tdecl
= lookup_name (get_identifier ("__baselist_type_info"), 0);
5419 if (tdecl
== NULL_TREE
)
5421 __baselist_desc_type_node
= TREE_TYPE (tdecl
);
5424 tdecl
= lookup_name (get_identifier ("__builtin_type_info"), 0);
5425 if (tdecl
== NULL_TREE
)
5427 __bltn_desc_type_node
= TREE_TYPE (tdecl
);
5429 tdecl
= lookup_name (get_identifier ("__user_type_info"), 0);
5430 if (tdecl
== NULL_TREE
)
5432 __user_desc_type_node
= TREE_TYPE (tdecl
);
5434 tdecl
= lookup_name (get_identifier ("__class_type_info"), 0);
5435 if (tdecl
== NULL_TREE
)
5437 __class_desc_type_node
= TREE_TYPE (tdecl
);
5439 tdecl
= lookup_field (__class_desc_type_node
,
5440 get_identifier ("access_mode"), 0, 0);
5441 if (tdecl
== NULL_TREE
)
5443 __access_mode_type_node
= TREE_TYPE (tdecl
);
5445 tdecl
= lookup_name (get_identifier ("__attr_type_info"), 0);
5446 if (tdecl
== NULL_TREE
)
5448 __attr_desc_type_node
= TREE_TYPE (tdecl
);
5450 tdecl
= lookup_name (get_identifier ("__pointer_type_info"), 0);
5451 if (tdecl
== NULL_TREE
)
5453 __ptr_desc_type_node
= TREE_TYPE (tdecl
);
5455 tdecl
= lookup_name (get_identifier ("__func_type_info"), 0);
5456 if (tdecl
== NULL_TREE
)
5458 __func_desc_type_node
= TREE_TYPE (tdecl
);
5460 tdecl
= lookup_name (get_identifier ("__ptmf_type_info"), 0);
5461 if (tdecl
== NULL_TREE
)
5463 __ptmf_desc_type_node
= TREE_TYPE (tdecl
);
5465 tdecl
= lookup_name (get_identifier ("__ptmd_type_info"), 0);
5466 if (tdecl
== NULL_TREE
)
5468 __ptmd_desc_type_node
= TREE_TYPE (tdecl
);
5472 /* Make a definition for a builtin function named NAME and whose data type
5473 is TYPE. TYPE should be a function type with argument types.
5474 FUNCTION_CODE tells later passes how to compile calls to this function.
5475 See tree.h for its possible values.
5477 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
5478 the name to be called if we can't opencode the function. */
5481 define_function (name
, type
, function_code
, pfn
, library_name
)
5484 enum built_in_function function_code
;
5488 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
5489 DECL_EXTERNAL (decl
) = 1;
5490 TREE_PUBLIC (decl
) = 1;
5491 DECL_ARTIFICIAL (decl
) = 1;
5493 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
5494 we cannot change DECL_ASSEMBLER_NAME until we have installed this
5495 function in the namespace. */
5496 if (pfn
) (*pfn
) (decl
);
5498 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
5499 make_function_rtl (decl
);
5500 if (function_code
!= NOT_BUILT_IN
)
5502 DECL_BUILT_IN (decl
) = 1;
5503 DECL_FUNCTION_CODE (decl
) = function_code
;
5508 /* Called when a declaration is seen that contains no names to declare.
5509 If its type is a reference to a structure, union or enum inherited
5510 from a containing scope, shadow that tag name for the current scope
5511 with a forward reference.
5512 If its type defines a new named structure or union
5513 or defines an enum, it is valid but we need not do anything here.
5514 Otherwise, it is an error.
5516 C++: may have to grok the declspecs to learn about static,
5517 complain for anonymous unions. */
5520 shadow_tag (declspecs
)
5524 tree ob_modifier
= NULL_TREE
;
5526 register enum tree_code code
, ok_code
= ERROR_MARK
;
5527 register tree t
= NULL_TREE
;
5529 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
5531 register tree value
= TREE_VALUE (link
);
5533 code
= TREE_CODE (value
);
5534 if (IS_AGGR_TYPE_CODE (code
) || code
== ENUMERAL_TYPE
)
5536 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
5538 if (IS_AGGR_TYPE (value
) && CLASSTYPE_USE_TEMPLATE (value
))
5540 if (CLASSTYPE_IMPLICIT_INSTANTIATION (value
)
5541 && TYPE_SIZE (value
) == NULL_TREE
)
5543 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (value
);
5544 if (processing_template_decl
)
5545 push_template_decl (TYPE_MAIN_DECL (value
));
5547 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (value
))
5548 cp_error ("specialization after instantiation of `%T'", value
);
5555 else if (value
== ridpointers
[(int) RID_STATIC
]
5556 || value
== ridpointers
[(int) RID_EXTERN
]
5557 || value
== ridpointers
[(int) RID_AUTO
]
5558 || value
== ridpointers
[(int) RID_REGISTER
]
5559 || value
== ridpointers
[(int) RID_INLINE
]
5560 || value
== ridpointers
[(int) RID_VIRTUAL
]
5561 || value
== ridpointers
[(int) RID_EXPLICIT
])
5562 ob_modifier
= value
;
5565 /* This is where the variables in an anonymous union are
5566 declared. An anonymous union declaration looks like:
5568 because there is no declarator after the union, the parser
5569 sends that declaration here. */
5570 if (ok_code
== UNION_TYPE
5572 && ((TREE_CODE (TYPE_NAME (t
)) == IDENTIFIER_NODE
5573 && ANON_AGGRNAME_P (TYPE_NAME (t
)))
5574 || (TREE_CODE (TYPE_NAME (t
)) == TYPE_DECL
5575 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))))
5577 /* See also grok_x_components. */
5580 /* Wipe out memory of synthesized methods */
5581 TYPE_HAS_CONSTRUCTOR (t
) = 0;
5582 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
5583 TYPE_HAS_INIT_REF (t
) = 0;
5584 TYPE_HAS_CONST_INIT_REF (t
) = 0;
5585 TYPE_HAS_ASSIGN_REF (t
) = 0;
5586 TYPE_HAS_ASSIGNMENT (t
) = 0;
5587 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
5589 q
= &TYPE_METHODS (t
);
5592 if (DECL_ARTIFICIAL (*q
))
5593 *q
= TREE_CHAIN (*q
);
5595 q
= &TREE_CHAIN (*q
);
5598 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
5599 function members. */
5600 if (TYPE_METHODS (t
))
5601 error ("an anonymous union cannot have function members");
5603 if (TYPE_FIELDS (t
))
5605 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
5607 finish_anon_union (decl
);
5612 /* Anonymous unions are objects, that's why we only check for
5613 inappropriate specifiers in this branch. */
5617 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
5618 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
5619 cp_error ("`%D' can only be specified for functions", ob_modifier
);
5620 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
5621 cp_error ("`%D' can only be specified for constructors",
5624 cp_error ("`%D' can only be specified for objects and functions",
5629 pedwarn ("abstract declarator used as declaration");
5630 else if (found_tag
> 1)
5631 pedwarn ("multiple types in one declaration");
5635 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
5638 groktypename (typename
)
5641 if (TREE_CODE (typename
) != TREE_LIST
)
5643 return grokdeclarator (TREE_VALUE (typename
),
5644 TREE_PURPOSE (typename
),
5645 TYPENAME
, 0, NULL_TREE
);
5648 /* Decode a declarator in an ordinary declaration or data definition.
5649 This is called as soon as the type information and variable name
5650 have been parsed, before parsing the initializer if any.
5651 Here we create the ..._DECL node, fill in its type,
5652 and put it on the list of decls for the current context.
5653 The ..._DECL node is returned as the value.
5655 Exception: for arrays where the length is not specified,
5656 the type is left null, to be filled in by `cp_finish_decl'.
5658 Function definitions do not come here; they go to start_function
5659 instead. However, external and forward declarations of functions
5660 do go through here. Structure field declarations are done by
5661 grokfield and not through here. */
5663 /* Set this to zero to debug not using the temporary obstack
5664 to parse initializers. */
5665 int debug_temp_inits
= 1;
5668 start_decl (declarator
, declspecs
, initialized
)
5669 tree declarator
, declspecs
;
5673 register tree type
, tem
;
5675 extern int have_extern_spec
;
5676 extern int used_extern_spec
;
5679 /* See code below that used this. */
5680 int init_written
= initialized
;
5683 /* This should only be done once on the top most decl. */
5684 if (have_extern_spec
&& !used_extern_spec
)
5686 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
5688 used_extern_spec
= 1;
5691 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
5693 if (decl
== NULL_TREE
|| decl
== void_type_node
)
5696 type
= TREE_TYPE (decl
);
5698 /* Don't lose if destructors must be executed at file-level. */
5699 if (! processing_template_decl
&& TREE_STATIC (decl
)
5700 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
5701 && !TREE_PERMANENT (decl
))
5703 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5704 decl
= copy_node (decl
);
5705 if (TREE_CODE (type
) == ARRAY_TYPE
)
5707 tree itype
= TYPE_DOMAIN (type
);
5708 if (itype
&& ! TREE_PERMANENT (itype
))
5710 itype
= build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype
)));
5711 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
5712 TREE_TYPE (decl
) = type
;
5719 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
5720 ? DECL_CLASS_CONTEXT (decl
)
5721 : DECL_CONTEXT (decl
);
5724 /* Is it valid for this decl to have an initializer at all?
5725 If not, set INITIALIZED to zero, which will indirectly
5726 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
5727 switch (TREE_CODE (decl
))
5730 /* typedef foo = bar means give foo the same type as bar.
5731 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
5732 Any other case of an initialization in a TYPE_DECL is an error. */
5733 if (pedantic
|| list_length (declspecs
) > 1)
5735 cp_error ("typedef `%D' is initialized", decl
);
5741 cp_error ("function `%#D' is initialized like a variable", decl
);
5746 if (! processing_template_decl
)
5748 if (TYPE_SIZE (type
) != NULL_TREE
5749 && ! TREE_CONSTANT (TYPE_SIZE (type
)))
5752 ("variable-sized object `%D' may not be initialized", decl
);
5756 if (TREE_CODE (type
) == ARRAY_TYPE
5757 && TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
5760 ("elements of array `%#D' have incomplete type", decl
);
5768 if (! toplevel_bindings_p ()
5769 && DECL_EXTERNAL (decl
))
5770 cp_warning ("declaration of `%#D' has `extern' and is initialized",
5772 DECL_EXTERNAL (decl
) = 0;
5773 if (toplevel_bindings_p ())
5774 TREE_STATIC (decl
) = 1;
5776 /* Tell `pushdecl' this is an initialized decl
5777 even though we don't yet have the initializer expression.
5778 Also tell `cp_finish_decl' it may store the real initializer. */
5779 DECL_INITIAL (decl
) = error_mark_node
;
5782 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
5784 if (TREE_CODE (decl
) == VAR_DECL
)
5786 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
5787 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
5788 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
5791 if (DECL_CONTEXT (field
) != context
)
5792 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'", DECL_CONTEXT (field
), DECL_NAME (decl
), context
, DECL_NAME (decl
));
5793 if (duplicate_decls (decl
, field
))
5799 tree field
= check_classfn (context
, decl
);
5800 if (field
&& duplicate_decls (decl
, field
))
5804 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
5805 if (DECL_LANG_SPECIFIC (decl
))
5806 DECL_IN_AGGR_P (decl
) = 0;
5807 if (DECL_USE_TEMPLATE (decl
) || CLASSTYPE_USE_TEMPLATE (context
))
5808 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
5810 /* Stupid stupid stupid stupid (jason 7/21/95) */
5811 if (pedantic
&& DECL_EXTERNAL (decl
)
5812 && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
5813 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
5816 pushclass (context
, 2);
5819 /* Add this decl to the current binding level, but not if it
5820 comes from another scope, e.g. a static member variable.
5821 TEM may equal DECL or it may be a previous decl of the same name. */
5823 if ((TREE_CODE (decl
) != PARM_DECL
&& DECL_CONTEXT (decl
) != NULL_TREE
)
5824 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !global_bindings_p ())
5825 || TREE_CODE (type
) == LANG_TYPE
)
5828 tem
= pushdecl (decl
);
5830 if (processing_template_decl
)
5832 if (! current_function_decl
)
5833 push_template_decl (tem
);
5834 else if (minimal_parse_mode
)
5836 = build_min_nt (DECL_STMT
, copy_to_permanent (declarator
),
5837 copy_to_permanent (declspecs
),
5842 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
5843 /* Tell the back-end to use or not use .common as appropriate. If we say
5844 -fconserve-space, we want this to save .data space, at the expense of
5845 wrong semantics. If we say -fno-conserve-space, we want this to
5846 produce errors about redefs; to do this we force variables into the
5848 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
5851 if (! processing_template_decl
)
5854 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
5855 push_obstacks_nochange ();
5858 /* We have no way of knowing whether the initializer will need to be
5859 evaluated at run-time or not until we've parsed it, so let's just put
5860 it in the permanent obstack. (jason) */
5862 && ! (TREE_CODE (tem
) == PARM_DECL
5863 || (TREE_READONLY (tem
)
5864 && (TREE_CODE (tem
) == VAR_DECL
5865 || TREE_CODE (tem
) == FIELD_DECL
))))
5867 /* When parsing and digesting the initializer,
5868 use temporary storage. Do this even if we will ignore the value. */
5869 if (toplevel_bindings_p () && debug_temp_inits
)
5871 if (processing_template_decl
5872 || TYPE_NEEDS_CONSTRUCTING (type
)
5873 || TREE_CODE (type
) == REFERENCE_TYPE
)
5874 /* In this case, the initializer must lay down in permanent
5875 storage, since it will be saved until `finish_file' is run. */
5878 temporary_allocation ();
5890 tree type
= TREE_TYPE (decl
);
5891 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
5893 /* If this type of object needs a cleanup, and control may
5894 jump past it, make a new binding level so that it is cleaned
5895 up only when it is initialized first. */
5896 if (TYPE_NEEDS_DESTRUCTOR (type
)
5897 && current_binding_level
->more_cleanups_ok
== 0)
5898 pushlevel_temporary (1);
5901 /* Is it valid for this decl to have an initializer at all?
5902 If not, set INITIALIZED to zero, which will indirectly
5903 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
5905 /* Don't allow initializations for incomplete types except for
5906 arrays which might be completed by the initialization. */
5907 if (type
== error_mark_node
)
5908 ; /* Don't complain again. */
5909 else if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
5910 ; /* A complete type is ok. */
5911 else if (TREE_CODE (type
) != ARRAY_TYPE
)
5913 cp_error ("variable `%#D' has initializer but incomplete type",
5917 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
5919 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
5920 cp_error ("elements of array `%#D' have incomplete type", decl
);
5921 /* else we already gave an error in start_decl. */
5927 && TREE_CODE (decl
) != TYPE_DECL
5928 && TREE_CODE (decl
) != TEMPLATE_DECL
5929 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
5931 if ((! processing_template_decl
|| ! uses_template_parms (type
))
5932 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
5934 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
5936 /* Change the type so that assemble_variable will give
5937 DECL an rtl we can live with: (mem (const_int 0)). */
5938 TREE_TYPE (decl
) = error_mark_node
;
5939 type
= error_mark_node
;
5943 /* If any base type in the hierarchy of TYPE needs a constructor,
5944 then we set initialized to 1. This way any nodes which are
5945 created for the purposes of initializing this aggregate
5946 will live as long as it does. This is necessary for global
5947 aggregates which do not have their initializers processed until
5948 the end of the file. */
5949 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
5954 /* We don't do this yet for GNU C++. */
5955 /* For a local variable, define the RTL now. */
5956 if (! toplevel_bindings_p ()
5957 /* But not if this is a duplicate decl
5958 and we preserved the rtl from the previous one
5959 (which may or may not happen). */
5960 && DECL_RTL (tem
) == NULL_RTX
)
5962 if (TYPE_SIZE (TREE_TYPE (tem
)) != NULL_TREE
)
5964 else if (TREE_CODE (TREE_TYPE (tem
)) == ARRAY_TYPE
5965 && DECL_INITIAL (tem
) != NULL_TREE
)
5971 DECL_INITIAL (decl
) = NULL_TREE
;
5974 /* Handle initialization of references.
5975 These three arguments from from `cp_finish_decl', and have the
5976 same meaning here that they do there.
5978 Quotes on semantics can be found in ARM 8.4.3. */
5981 grok_reference_init (decl
, type
, init
, cleanupp
)
5982 tree decl
, type
, init
;
5987 if (init
== NULL_TREE
)
5989 if ((DECL_LANG_SPECIFIC (decl
) == 0
5990 || DECL_IN_AGGR_P (decl
) == 0)
5991 && ! DECL_THIS_EXTERN (decl
))
5993 cp_error ("`%D' declared as reference but not initialized", decl
);
5994 if (TREE_CODE (decl
) == VAR_DECL
)
5995 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
6000 if (init
== error_mark_node
)
6003 if (TREE_CODE (type
) == REFERENCE_TYPE
6004 && TREE_CODE (init
) == CONSTRUCTOR
)
6006 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6010 if (TREE_TYPE (init
) && TREE_CODE (TREE_TYPE (init
)) == UNKNOWN_TYPE
)
6011 /* decay_conversion is probably wrong for references to functions. */
6012 init
= decay_conversion (instantiate_type (TREE_TYPE (type
), init
, 1));
6014 if (TREE_CODE (init
) == TREE_LIST
)
6015 init
= build_compound_expr (init
);
6017 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6018 init
= convert_from_reference (init
);
6020 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6021 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6023 /* Note: default conversion is only called in very special cases. */
6024 init
= default_conversion (init
);
6027 tmp
= convert_to_reference
6028 (type
, init
, CONV_IMPLICIT
,
6029 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6031 if (tmp
== error_mark_node
)
6033 else if (tmp
!= NULL_TREE
)
6036 DECL_INITIAL (decl
) = save_expr (init
);
6040 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
6044 /* ?? Can this be optimized in some cases to
6045 hand back the DECL_INITIAL slot?? */
6046 if (TYPE_SIZE (TREE_TYPE (type
)))
6048 init
= convert_from_reference (decl
);
6049 if (TREE_PERMANENT (decl
))
6050 init
= copy_to_permanent (init
);
6051 SET_DECL_REFERENCE_SLOT (decl
, init
);
6054 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
6056 expand_static_init (decl
, DECL_INITIAL (decl
));
6057 DECL_INITIAL (decl
) = NULL_TREE
;
6062 if (TREE_CODE (decl
) == VAR_DECL
)
6063 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
6067 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
6068 mucking with forces it does not comprehend (i.e. initialization with a
6069 constructor). If we are at global scope and won't go into COMMON, fill
6070 it in with a dummy CONSTRUCTOR to force the variable into .data;
6071 otherwise we can use error_mark_node. */
6074 obscure_complex_init (decl
, init
)
6077 if (! flag_no_inline
&& TREE_STATIC (decl
))
6079 if (extract_init (decl
, init
))
6083 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6084 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
6085 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
6089 DECL_INITIAL (decl
) = error_mark_node
;
6094 /* Finish processing of a declaration;
6095 install its line number and initial value.
6096 If the length of an array type is not known before,
6097 it must be determined now, from the initial value, or it is an error.
6099 Call `pop_obstacks' iff NEED_POP is nonzero.
6101 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
6102 for aggregates that have constructors alive on the permanent obstack,
6103 so that the global initializing functions can be written at the end.
6105 INIT0 holds the value of an initializer that should be allowed to escape
6108 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
6109 if the (init) syntax was used.
6111 For functions that take default parameters, DECL points to its
6112 "maximal" instantiation. `cp_finish_decl' must then also declared its
6113 subsequently lower and lower forms of instantiation, checking for
6114 ambiguity as it goes. This can be sped up later. */
6117 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
6124 tree cleanup
= NULL_TREE
, ttype
;
6126 int temporary
= allocation_temporary_p ();
6127 char *asmspec
= NULL
;
6128 int was_readonly
= 0;
6130 /* If this is 0, then we did not change obstacks. */
6134 error ("assignment (not initialization) in declaration");
6138 /* If a name was specified, get the string. */
6140 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
6142 /* If the type of the thing we are declaring either has
6143 a constructor, or has a virtual function table pointer,
6144 AND its initialization was accepted by `start_decl',
6145 then we stayed on the permanent obstack through the
6146 declaration, otherwise, changed obstacks as GCC would. */
6148 type
= TREE_TYPE (decl
);
6150 if (type
== error_mark_node
)
6152 if (toplevel_bindings_p () && temporary
)
6153 end_temporary_allocation ();
6158 if (processing_template_decl
)
6160 if (init
&& DECL_INITIAL (decl
))
6161 DECL_INITIAL (decl
) = init
;
6162 if (minimal_parse_mode
&& ! DECL_ARTIFICIAL (decl
))
6164 tree stmt
= DECL_VINDEX (decl
);
6165 DECL_VINDEX (decl
) = NULL_TREE
;
6166 TREE_OPERAND (stmt
, 2) = copy_to_permanent (init
);
6172 /* Take care of TYPE_DECLs up front. */
6173 if (TREE_CODE (decl
) == TYPE_DECL
)
6175 if (init
&& DECL_INITIAL (decl
))
6177 /* typedef foo = bar; store the type of bar as the type of foo. */
6178 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
6179 DECL_INITIAL (decl
) = init
= NULL_TREE
;
6181 if (type
!= error_mark_node
6182 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
6184 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
6185 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
6186 set_identifier_type_value (DECL_NAME (decl
), type
);
6187 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
6189 GNU_xref_decl (current_function_decl
, decl
);
6191 /* If we have installed this as the canonical typedef for this
6192 type, and that type has not been defined yet, delay emitting
6193 the debug informaion for it, as we will emit it later. */
6194 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
6195 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
6196 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6198 rest_of_decl_compilation (decl
, NULL_PTR
,
6199 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
6202 if (TREE_CODE (decl
) != FUNCTION_DECL
)
6204 ttype
= target_type (type
);
6207 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
6208 && TYPE_NEEDS_CONSTRUCTING (type
))
6211 /* Currently, GNU C++ puts constants in text space, making them
6212 impossible to initialize. In the future, one would hope for
6213 an operating system which understood the difference between
6214 initialization and the running of a program. */
6216 TREE_READONLY (decl
) = 0;
6219 if (TREE_CODE (decl
) == FIELD_DECL
)
6221 if (init
&& init
!= error_mark_node
)
6222 my_friendly_assert (TREE_PERMANENT (init
), 147);
6226 /* This must override the asm specifier which was placed
6227 by grokclassfn. Lay this out fresh. */
6228 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
6229 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
6230 make_decl_rtl (decl
, asmspec
, 0);
6233 /* If `start_decl' didn't like having an initialization, ignore it now. */
6234 else if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
6236 else if (DECL_EXTERNAL (decl
))
6238 else if (TREE_CODE (type
) == REFERENCE_TYPE
6239 || (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE_REFERENCE (type
)))
6241 if (TREE_STATIC (decl
))
6242 make_decl_rtl (decl
, NULL_PTR
,
6243 toplevel_bindings_p ()
6244 || pseudo_global_level_p ());
6245 grok_reference_init (decl
, type
, init
, &cleanup
);
6249 GNU_xref_decl (current_function_decl
, decl
);
6251 if (TREE_CODE (decl
) == FIELD_DECL
)
6253 else if (TREE_CODE (decl
) == CONST_DECL
)
6255 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
6257 DECL_INITIAL (decl
) = init
;
6259 /* This will keep us from needing to worry about our obstacks. */
6260 my_friendly_assert (init
!= NULL_TREE
, 149);
6265 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
6267 if (TREE_CODE (type
) == ARRAY_TYPE
)
6268 init
= digest_init (type
, init
, (tree
*) 0);
6269 else if (TREE_CODE (init
) == CONSTRUCTOR
)
6271 if (TYPE_NON_AGGREGATE_CLASS (type
))
6273 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
6275 init
= error_mark_node
;
6278 goto dont_use_constructor
;
6283 dont_use_constructor
:
6284 if (TREE_CODE (init
) != TREE_VEC
)
6285 init
= store_init_value (decl
, init
);
6289 /* We must hide the initializer so that expand_decl
6290 won't try to do something it does not understand. */
6291 init
= obscure_complex_init (decl
, init
);
6293 else if (DECL_EXTERNAL (decl
))
6295 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
6296 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
6299 while (TREE_CODE (ctype
) == ARRAY_TYPE
)
6300 ctype
= TREE_TYPE (ctype
);
6301 if (! TYPE_NEEDS_CONSTRUCTING (ctype
))
6303 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (ctype
))
6304 cp_error ("structure `%D' with uninitialized const members", decl
);
6305 if (CLASSTYPE_REF_FIELDS_NEED_INIT (ctype
))
6306 cp_error ("structure `%D' with uninitialized reference members",
6310 if (TREE_CODE (decl
) == VAR_DECL
6311 && !DECL_INITIAL (decl
)
6312 && !TYPE_NEEDS_CONSTRUCTING (type
)
6313 && (TYPE_READONLY (type
) || TREE_READONLY (decl
)))
6314 cp_error ("uninitialized const `%D'", decl
);
6316 if (TYPE_SIZE (type
) != NULL_TREE
6317 && TYPE_NEEDS_CONSTRUCTING (type
))
6318 init
= obscure_complex_init (decl
, NULL_TREE
);
6320 else if (TREE_CODE (decl
) == VAR_DECL
6321 && TREE_CODE (type
) != REFERENCE_TYPE
6322 && (TYPE_READONLY (type
) || TREE_READONLY (decl
)))
6324 /* ``Unless explicitly declared extern, a const object does not have
6325 external linkage and must be initialized. ($8.4; $12.1)'' ARM 7.1.6
6326 However, if it's `const int foo = 1; const int foo;', don't complain
6327 about the second decl, since it does have an initializer before.
6328 We deliberately don't complain about arrays, because they're
6329 supposed to be initialized by a constructor. */
6330 if (! DECL_INITIAL (decl
)
6331 && TREE_CODE (type
) != ARRAY_TYPE
6332 && (!pedantic
|| !current_class_type
))
6333 cp_error ("uninitialized const `%#D'", decl
);
6336 /* For top-level declaration, the initial value was read in
6337 the temporary obstack. MAXINDEX, rtl, etc. to be made below
6338 must go in the permanent obstack; but don't discard the
6339 temporary data yet. */
6341 if (toplevel_bindings_p () && temporary
)
6342 end_temporary_allocation ();
6344 /* Deduce size of array from initialization, if not already known. */
6346 if (TREE_CODE (type
) == ARRAY_TYPE
6347 && TYPE_DOMAIN (type
) == NULL_TREE
6348 && TREE_CODE (decl
) != TYPE_DECL
)
6351 = (TREE_STATIC (decl
)
6352 /* Even if pedantic, an external linkage array
6353 may have incomplete type at first. */
6354 ? pedantic
&& ! DECL_EXTERNAL (decl
)
6355 : !DECL_EXTERNAL (decl
));
6356 tree initializer
= init
? init
: DECL_INITIAL (decl
);
6357 int failure
= complete_array_type (type
, initializer
, do_default
);
6360 cp_error ("initializer fails to determine size of `%D'", decl
);
6365 cp_error ("array size missing in `%D'", decl
);
6366 /* If a `static' var's size isn't known, make it extern as
6367 well as static, so it does not get allocated. If it's not
6368 `static', then don't mark it extern; finish_incomplete_decl
6369 will give it a default size and it will get allocated. */
6370 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
6371 DECL_EXTERNAL (decl
) = 1;
6374 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
6375 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
6377 cp_error ("zero-size array `%D'", decl
);
6379 layout_decl (decl
, 0);
6382 if (TREE_CODE (decl
) == VAR_DECL
)
6384 if (DECL_SIZE (decl
) == NULL_TREE
6385 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
6386 layout_decl (decl
, 0);
6388 if (TREE_STATIC (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
6390 /* A static variable with an incomplete type:
6391 that is an error if it is initialized.
6392 Otherwise, let it through, but if it is not `extern'
6393 then it may cause an error message later. */
6394 if (DECL_INITIAL (decl
) != NULL_TREE
)
6395 cp_error ("storage size of `%D' isn't known", decl
);
6398 else if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
6400 /* An automatic variable with an incomplete type: that is an error.
6401 Don't talk about array types here, since we took care of that
6402 message in grokdeclarator. */
6403 cp_error ("storage size of `%D' isn't known", decl
);
6404 TREE_TYPE (decl
) = error_mark_node
;
6406 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
6407 /* Let debugger know it should output info for this type. */
6408 note_debug_info_needed (ttype
);
6410 if (TREE_STATIC (decl
) && DECL_CONTEXT (decl
)
6411 && TREE_CODE_CLASS (TREE_CODE (DECL_CONTEXT (decl
))) == 't')
6412 note_debug_info_needed (DECL_CONTEXT (decl
));
6414 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
6415 && DECL_SIZE (decl
) != NULL_TREE
6416 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
6418 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
6419 constant_expression_warning (DECL_SIZE (decl
));
6421 cp_error ("storage size of `%D' isn't constant", decl
);
6424 if (! DECL_EXTERNAL (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
6425 /* Cleanups for static variables are handled by `finish_file'. */
6426 && ! TREE_STATIC (decl
))
6428 int yes
= suspend_momentary ();
6429 cleanup
= maybe_build_cleanup (decl
);
6430 resume_momentary (yes
);
6433 /* PARM_DECLs get cleanups, too. */
6434 else if (TREE_CODE (decl
) == PARM_DECL
&& TYPE_NEEDS_DESTRUCTOR (type
))
6437 end_temporary_allocation ();
6438 cleanup
= maybe_build_cleanup (decl
);
6440 resume_temporary_allocation ();
6443 /* Output the assembler code and/or RTL code for variables and functions,
6444 unless the type is an undefined structure or union.
6445 If not, it will get done when the type is completed. */
6447 was_incomplete
= (DECL_SIZE (decl
) == NULL_TREE
);
6449 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
6450 || TREE_CODE (decl
) == RESULT_DECL
)
6452 /* ??? FIXME: What about nested classes? */
6453 int toplev
= toplevel_bindings_p () || pseudo_global_level_p ();
6455 = (TREE_STATIC (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
6456 && allocation_temporary_p ());
6459 end_temporary_allocation ();
6461 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
6462 make_decl_rtl (decl
, NULL_PTR
, toplev
);
6463 else if (TREE_CODE (decl
) == VAR_DECL
6464 && TREE_READONLY (decl
)
6465 && DECL_INITIAL (decl
) != NULL_TREE
6466 && DECL_INITIAL (decl
) != error_mark_node
6467 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
6469 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
6472 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
6475 && TREE_STATIC (decl
)
6476 && ! TREE_SIDE_EFFECTS (decl
)
6477 && ! TREE_PUBLIC (decl
)
6478 && ! DECL_EXTERNAL (decl
)
6479 && ! TYPE_NEEDS_DESTRUCTOR (type
)
6480 && DECL_MODE (decl
) != BLKmode
)
6482 /* If this variable is really a constant, then fill its DECL_RTL
6483 slot with something which won't take up storage.
6484 If something later should take its address, we can always give
6485 it legitimate RTL at that time. */
6486 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
6487 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
6488 TREE_ASM_WRITTEN (decl
) = 1;
6490 else if (toplev
&& ! TREE_PUBLIC (decl
))
6492 /* If this is a static const, change its apparent linkage
6493 if it belongs to a #pragma interface. */
6494 if (!interface_unknown
)
6496 TREE_PUBLIC (decl
) = 1;
6497 DECL_EXTERNAL (decl
) = interface_only
;
6499 make_decl_rtl (decl
, asmspec
, toplev
);
6502 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
6504 else if (TREE_CODE (decl
) == VAR_DECL
6505 && DECL_LANG_SPECIFIC (decl
)
6506 && DECL_IN_AGGR_P (decl
))
6508 if (TREE_STATIC (decl
))
6510 if (init
== NULL_TREE
6511 #ifdef DEFAULT_STATIC_DEFS
6512 /* If this code is dead, then users must
6513 explicitly declare static member variables
6514 outside the class def'n as well. */
6515 && TYPE_NEEDS_CONSTRUCTING (type
)
6519 DECL_EXTERNAL (decl
) = 1;
6520 make_decl_rtl (decl
, asmspec
, 1);
6523 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
6526 /* Just a constant field. Should not need any rtl. */
6530 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
6533 resume_temporary_allocation ();
6535 if (type
!= error_mark_node
6536 && TYPE_LANG_SPECIFIC (type
)
6537 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
6538 abstract_virtuals_error (decl
, type
);
6539 else if ((TREE_CODE (type
) == FUNCTION_TYPE
6540 || TREE_CODE (type
) == METHOD_TYPE
)
6541 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
6542 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (type
)))
6543 abstract_virtuals_error (decl
, TREE_TYPE (type
));
6545 if (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE (type
))
6546 signature_error (decl
, type
);
6547 else if ((TREE_CODE (type
) == FUNCTION_TYPE
6548 || TREE_CODE (type
) == METHOD_TYPE
)
6549 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
6550 && IS_SIGNATURE (TREE_TYPE (type
)))
6551 signature_error (decl
, TREE_TYPE (type
));
6553 if (TREE_CODE (decl
) == FUNCTION_DECL
)
6555 else if (DECL_EXTERNAL (decl
)
6556 && ! (DECL_LANG_SPECIFIC (decl
)
6557 && DECL_NOT_REALLY_EXTERN (decl
)))
6560 DECL_INITIAL (decl
) = init
;
6562 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
6564 /* Cleanups for static variables are handled by `finish_file'. */
6565 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
6566 || TYPE_NEEDS_DESTRUCTOR (type
))
6567 expand_static_init (decl
, init
);
6571 extern int temp_slot_level
;
6572 extern int target_temp_slot_level
;
6573 tree old_cleanups
= cleanups_this_call
;
6574 int old_temp_level
= target_temp_slot_level
;
6576 /* This is a declared decl which must live until the
6577 end of the binding contour. It may need a cleanup. */
6579 /* Recompute the RTL of a local array now
6580 if it used to be an incomplete type. */
6581 if (was_incomplete
&& ! TREE_STATIC (decl
))
6583 /* If we used it already as memory, it must stay in memory. */
6584 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
6585 /* If it's still incomplete now, no init will save it. */
6586 if (DECL_SIZE (decl
) == NULL_TREE
)
6587 DECL_INITIAL (decl
) = NULL_TREE
;
6590 else if (! TREE_ASM_WRITTEN (decl
)
6591 && (TYPE_SIZE (type
) != NULL_TREE
6592 || TREE_CODE (type
) == ARRAY_TYPE
))
6594 /* Do this here, because we did not expand this decl's
6595 rtl in start_decl. */
6596 if (DECL_RTL (decl
) == NULL_RTX
)
6600 /* XXX: Why don't we use decl here? */
6601 /* Ans: Because it was already expanded? */
6602 if (! expand_decl_cleanup (NULL_TREE
, cleanup
))
6603 cp_error ("parser lost in parsing declaration of `%D'",
6605 /* Cleanup used up here. */
6606 cleanup
= NULL_TREE
;
6610 if (current_binding_level
->is_for_scope
)
6612 struct binding_level
*outer
= current_binding_level
->level_chain
;
6614 /* Check to see if the same name is already bound at
6615 the outer level, either because it was directly declared,
6616 or because a dead for-decl got preserved. In either case,
6617 the code would not have been valid under the ARM
6618 scope rules, so clear is_for_scope for the
6619 current_binding_level.
6621 Otherwise, we need to preserve the temp slot for decl
6622 to last into the outer binding level. */
6624 int handling_dead_for_vars
= 0;
6625 tree link
= outer
->names
;
6626 for (; ; link
= TREE_CHAIN (link
))
6628 if (link
== NULL
&& handling_dead_for_vars
== 0)
6630 link
= outer
->dead_vars_from_for
;
6631 handling_dead_for_vars
= 1;
6635 if (DECL_IN_MEMORY_P (decl
))
6636 preserve_temp_slots (DECL_RTL (decl
));
6639 if (DECL_NAME (link
) == DECL_NAME (decl
))
6641 if (handling_dead_for_vars
)
6644 = purpose_member (DECL_NAME (decl
),
6645 current_binding_level
->shadowed
);
6646 if (shadowing
&& TREE_VALUE (shadowing
) == link
)
6647 TREE_VALUE (shadowing
)
6648 = DECL_SHADOWED_FOR_VAR (link
);
6650 current_binding_level
->is_for_scope
= 0;
6658 target_temp_slot_level
= temp_slot_level
;
6660 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
6662 /* Compute and store the initial value. */
6663 expand_decl_init (decl
);
6665 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
6667 emit_line_note (DECL_SOURCE_FILE (decl
),
6668 DECL_SOURCE_LINE (decl
));
6669 expand_aggr_init (decl
, init
, 0, flags
);
6672 /* Set this to 0 so we can tell whether an aggregate which
6673 was initialized was ever used. Don't do this if it has a
6674 destructor, so we don't complain about the 'resource
6675 allocation is initialization' idiom. */
6676 if (TYPE_NEEDS_CONSTRUCTING (type
)
6677 && cleanup
== NULL_TREE
6678 && DECL_NAME (decl
))
6679 TREE_USED (decl
) = 0;
6681 /* Cleanup any temporaries needed for the initial value. */
6682 expand_cleanups_to (old_cleanups
);
6685 target_temp_slot_level
= old_temp_level
;
6687 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
6689 /* Store the cleanup, if there was one. */
6692 if (! expand_decl_cleanup (decl
, cleanup
))
6693 cp_error ("parser lost in parsing declaration of `%D'",
6700 /* Undo call to `pushclass' that was done in `start_decl'
6701 due to initialization of qualified member variable.
6702 I.e., Foo::x = 10; */
6704 tree context
= DECL_REAL_CONTEXT (decl
);
6706 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
6707 && (TREE_CODE (decl
) == VAR_DECL
6708 /* We also have a pushclass done that we need to undo here
6709 if we're at top level and declare a method. */
6710 || TREE_CODE (decl
) == FUNCTION_DECL
)
6711 /* If size hasn't been set, we're still defining it,
6712 and therefore inside the class body; don't pop
6713 the binding level.. */
6714 && TYPE_SIZE (context
) != NULL_TREE
6715 && context
== current_class_type
)
6722 /* If requested, warn about definitions of large data objects. */
6724 if (warn_larger_than
6725 && ! processing_template_decl
6726 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
6727 && !DECL_EXTERNAL (decl
))
6729 register tree decl_size
= DECL_SIZE (decl
);
6731 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
6733 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
6735 if (units
> larger_than_size
)
6736 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
6742 /* Resume permanent allocation, if not within a function. */
6743 /* The corresponding push_obstacks_nochange is in start_decl,
6744 start_method, groktypename, and in grokfield. */
6749 TREE_READONLY (decl
) = 1;
6752 /* This is here for a midend callback from c-common.c */
6755 finish_decl (decl
, init
, asmspec_tree
)
6759 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
6763 expand_static_init (decl
, init
)
6767 tree oldstatic
= value_member (decl
, static_aggregates
);
6771 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
6772 cp_error ("multiple initializations given for `%D'", decl
);
6774 else if (! toplevel_bindings_p () && ! pseudo_global_level_p ())
6776 /* Emit code to perform this initialization but once. */
6779 extern int temp_slot_level
;
6780 extern int target_temp_slot_level
;
6784 /* Remember this information until end of file. */
6785 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6787 /* Emit code to perform this initialization but once. */
6788 temp
= get_temp_name (integer_type_node
, 1);
6789 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
6790 expand_start_cond (build_binary_op (EQ_EXPR
, temp
,
6791 integer_zero_node
, 1), 0);
6792 old_cleanups
= cleanups_this_call
;
6793 old_temp_level
= target_temp_slot_level
;
6796 target_temp_slot_level
= temp_slot_level
;
6798 expand_assignment (temp
, integer_one_node
, 0, 0);
6799 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
6800 || (init
&& TREE_CODE (init
) == TREE_LIST
))
6802 expand_aggr_init (decl
, init
, 0, 0);
6803 do_pending_stack_adjust ();
6806 expand_assignment (decl
, init
, 0, 0);
6808 /* Cleanup any temporaries needed for the initial value. */
6809 expand_cleanups_to (old_cleanups
);
6812 target_temp_slot_level
= old_temp_level
;
6814 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
6816 tree cleanup
, fcall
;
6817 static tree Atexit
= 0;
6820 tree atexit_fndecl
, PFV
, pfvlist
;
6821 /* Remember this information until end of file. */
6822 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6823 PFV
= build_pointer_type (build_function_type
6824 (void_type_node
, void_list_node
));
6826 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
6828 push_lang_context (lang_name_c
);
6830 builtin_function ("atexit",
6831 build_function_type (void_type_node
,
6833 NOT_BUILT_IN
, NULL_PTR
);
6834 assemble_external (atexit_fndecl
);
6835 Atexit
= default_conversion (atexit_fndecl
);
6836 pop_lang_context ();
6840 cleanup
= start_anon_func ();
6841 expand_expr_stmt (build_cleanup (decl
));
6843 mark_addressable (cleanup
);
6844 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
6845 fcall
= build_function_call (Atexit
, tree_cons (NULL_TREE
, cleanup
, NULL_TREE
));
6846 expand_expr_stmt (fcall
);
6850 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
6852 static_aggregates
= perm_tree_cons (temp
, decl
, static_aggregates
);
6853 TREE_STATIC (static_aggregates
) = 1;
6856 /* Resume old (possibly temporary) allocation. */
6861 /* This code takes into account memory allocation
6862 policy of `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING
6863 does not hold for this object, then we must make permanent
6864 the storage currently in the temporary obstack. */
6865 if (! TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
6866 preserve_initializer ();
6867 static_aggregates
= perm_tree_cons (init
, decl
, static_aggregates
);
6871 /* Make TYPE a complete type based on INITIAL_VALUE.
6872 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6873 2 if there was no information (in which case assume 1 if DO_DEFAULT). */
6876 complete_array_type (type
, initial_value
, do_default
)
6877 tree type
, initial_value
;
6880 register tree maxindex
= NULL_TREE
;
6885 /* Note MAXINDEX is really the maximum index,
6886 one less than the size. */
6887 if (TREE_CODE (initial_value
) == STRING_CST
)
6890 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
6891 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
6894 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
6896 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
6897 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
6898 for (; elts
; elts
= TREE_CHAIN (elts
))
6900 if (TREE_PURPOSE (elts
))
6901 maxindex
= TREE_PURPOSE (elts
);
6903 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
6905 maxindex
= copy_node (maxindex
);
6909 /* Make an error message unless that happened already. */
6910 if (initial_value
!= error_mark_node
)
6913 /* Prevent further error messages. */
6914 maxindex
= build_int_2 (0, 0);
6921 maxindex
= build_int_2 (0, 0);
6929 TYPE_DOMAIN (type
) = build_index_type (maxindex
);
6930 if (! TREE_TYPE (maxindex
))
6931 TREE_TYPE (maxindex
) = TYPE_DOMAIN (type
);
6933 itype
= TREE_TYPE (initial_value
);
6936 if (itype
&& !TYPE_DOMAIN (itype
))
6937 TYPE_DOMAIN (itype
) = TYPE_DOMAIN (type
);
6938 /* The type of the main variant should never be used for arrays
6939 of different sizes. It should only ever be completed with the
6940 size of the array. */
6941 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
6942 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = TYPE_DOMAIN (type
);
6945 /* Lay out the type now that we can get the real answer. */
6952 /* Return zero if something is declared to be a member of type
6953 CTYPE when in the context of CUR_TYPE. STRING is the error
6954 message to print in that case. Otherwise, quietly return 1. */
6957 member_function_or_else (ctype
, cur_type
, string
)
6958 tree ctype
, cur_type
;
6961 if (ctype
&& ctype
!= cur_type
)
6963 error (string
, TYPE_NAME_STRING (ctype
));
6969 /* Subroutine of `grokdeclarator'. */
6971 /* Generate errors possibly applicable for a given set of specifiers.
6972 This is for ARM $7.1.2. */
6975 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
6978 int virtualp
, quals
, friendp
, raises
, inlinep
;
6981 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
6983 cp_error ("`%D' declared as an `inline' %s", object
, type
);
6985 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
6988 cp_error_at ("invalid friend declaration", object
);
6990 cp_error_at ("invalid exception specifications", object
);
6993 /* CTYPE is class type, or null if non-class.
6994 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
6996 DECLARATOR is the function's name.
6997 VIRTUALP is truthvalue of whether the function is virtual or not.
6998 FLAGS are to be passed through to `grokclassfn'.
6999 QUALS are qualifiers indicating whether the function is `const'
7001 RAISES is a list of exceptions that this function can raise.
7002 CHECK is 1 if we must find this method in CTYPE, 0 if we should
7003 not look, and -1 if we should not call `grokclassfn' at all. */
7006 grokfndecl (ctype
, type
, declarator
, virtualp
, flags
, quals
,
7007 raises
, attrlist
, check
, publicp
, inlinep
, funcdef_flag
)
7011 enum overload_flags flags
;
7012 tree quals
, raises
, attrlist
;
7013 int check
, publicp
, inlinep
, funcdef_flag
;
7016 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
7019 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
7020 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
7026 type
= build_exception_variant (type
, raises
);
7029 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
7030 /* propagate volatile out from type to decl */
7031 if (TYPE_VOLATILE (type
))
7032 TREE_THIS_VOLATILE (decl
) = 1;
7034 /* Should probably propagate const out from type to decl I bet (mrs). */
7037 DECL_STATIC_FUNCTION_P (decl
) = 1;
7038 DECL_CONTEXT (decl
) = ctype
;
7042 DECL_CLASS_CONTEXT (decl
) = ctype
;
7044 /* All function decls start out public; we'll fix their linkage later (at
7045 definition or EOF) if appropriate. */
7046 TREE_PUBLIC (decl
) = 1;
7048 if (ctype
== NULL_TREE
&& ! strcmp (IDENTIFIER_POINTER (declarator
), "main"))
7051 error ("cannot declare `main' to be inline");
7053 error ("cannot declare `main' to be static");
7059 DECL_C_STATIC (decl
) = 1;
7062 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
7064 DECL_EXTERNAL (decl
) = 1;
7065 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
7067 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
7068 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
7072 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
7073 grok_op_properties (decl
, virtualp
, check
< 0);
7075 if (ctype
&& hack_decl_function_context (decl
))
7076 DECL_NO_STATIC_CHAIN (decl
) = 1;
7078 /* Caller will do the rest of this. */
7082 if (check
&& funcdef_flag
)
7083 DECL_INITIAL (decl
) = error_mark_node
;
7085 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
7088 /* Just handle constructors here. We could do this
7089 inside the following if stmt, but I think
7090 that the code is more legible by breaking this
7091 case out. See comments below for what each of
7092 the following calls is supposed to do. */
7093 DECL_CONSTRUCTOR_P (decl
) = 1;
7095 grokclassfn (ctype
, declarator
, decl
, flags
, quals
);
7098 tmp
= check_classfn (ctype
, decl
);
7099 if (tmp
&& DECL_ARTIFICIAL (tmp
))
7100 cp_error ("definition of implicitly-declared `%D'", tmp
);
7101 if (tmp
&& duplicate_decls (decl
, tmp
))
7104 if (! grok_ctor_properties (ctype
, decl
))
7107 if (check
== 0 && ! current_function_decl
)
7109 /* FIXME: this should only need to look at
7110 IDENTIFIER_GLOBAL_VALUE. */
7111 tmp
= lookup_name (DECL_ASSEMBLER_NAME (decl
), 0);
7112 if (tmp
== NULL_TREE
)
7113 IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (decl
)) = decl
;
7114 else if (TREE_CODE (tmp
) != TREE_CODE (decl
))
7115 cp_error ("inconsistent declarations for `%D'", decl
);
7118 duplicate_decls (decl
, tmp
);
7120 /* avoid creating circularities. */
7121 DECL_CHAIN (decl
) = NULL_TREE
;
7123 make_decl_rtl (decl
, NULL_PTR
, 1);
7130 /* Function gets the ugly name, field gets the nice one.
7131 This call may change the type of the function (because
7132 of default parameters)! */
7133 if (ctype
!= NULL_TREE
)
7134 grokclassfn (ctype
, cname
, decl
, flags
, quals
);
7136 if (ctype
!= NULL_TREE
&& check
)
7138 tmp
= check_classfn (ctype
, decl
);
7139 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
7140 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
7142 /* Remove the `this' parm added by grokclassfn.
7143 XXX Isn't this done in start_function, too? */
7144 revert_static_member_fn (&decl
, NULL
, NULL
);
7145 last_function_parms
= TREE_CHAIN (last_function_parms
);
7147 if (tmp
&& DECL_ARTIFICIAL (tmp
))
7148 cp_error ("definition of implicitly-declared `%D'", tmp
);
7149 if (tmp
&& duplicate_decls (decl
, tmp
))
7153 if (ctype
== NULL_TREE
|| check
)
7156 /* Now install the declaration of this function so that others may
7157 find it (esp. its DECL_FRIENDLIST). Don't do this for local class
7159 if (! current_function_decl
)
7161 /* FIXME: this should only need to look at
7162 IDENTIFIER_GLOBAL_VALUE. */
7163 tmp
= lookup_name (DECL_ASSEMBLER_NAME (decl
), 0);
7164 if (tmp
== NULL_TREE
)
7165 IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (decl
)) = decl
;
7166 else if (TREE_CODE (tmp
) != TREE_CODE (decl
))
7167 cp_error ("inconsistent declarations for `%D'", decl
);
7170 duplicate_decls (decl
, tmp
);
7172 /* avoid creating circularities. */
7173 DECL_CHAIN (decl
) = NULL_TREE
;
7177 cplus_decl_attributes (decl
, TREE_PURPOSE (attrlist
),
7178 TREE_VALUE (attrlist
));
7179 make_decl_rtl (decl
, NULL_PTR
, 1);
7183 DECL_VIRTUAL_P (decl
) = 1;
7184 if (DECL_VINDEX (decl
) == NULL_TREE
)
7185 DECL_VINDEX (decl
) = error_mark_node
;
7186 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
7193 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
)
7196 RID_BIT_TYPE
*specbits_in
;
7201 RID_BIT_TYPE specbits
;
7203 specbits
= *specbits_in
;
7205 if (TREE_CODE (type
) == OFFSET_TYPE
)
7207 /* If you declare a static member so that it
7208 can be initialized, the code will reach here. */
7209 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
7210 type
= TREE_TYPE (type
);
7211 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
7212 DECL_CONTEXT (decl
) = basetype
;
7213 DECL_CLASS_CONTEXT (decl
) = basetype
;
7214 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
7217 decl
= build_decl (VAR_DECL
, declarator
, complete_type (type
));
7219 DECL_ASSEMBLER_NAME (decl
) = current_namespace_id (DECL_ASSEMBLER_NAME (decl
));
7221 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
7223 DECL_THIS_EXTERN (decl
) = 1;
7224 DECL_EXTERNAL (decl
) = !initialized
;
7227 /* In class context, static means one per class,
7228 public access, and static storage. */
7229 if (DECL_FIELD_CONTEXT (decl
) != NULL_TREE
7230 && IS_AGGR_TYPE (DECL_FIELD_CONTEXT (decl
)))
7232 TREE_PUBLIC (decl
) = 1;
7233 TREE_STATIC (decl
) = 1;
7234 DECL_EXTERNAL (decl
) = 0;
7236 /* At top level, either `static' or no s.c. makes a definition
7237 (perhaps tentative), and absence of `static' makes it public. */
7238 else if (toplevel_bindings_p ())
7240 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
7241 && (DECL_THIS_EXTERN (decl
) || ! constp
));
7242 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
7244 /* Not at top level, only `static' makes a static definition. */
7247 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
7248 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
7253 /* Create a canonical pointer to member function type. */
7256 build_ptrmemfunc_type (type
)
7263 /* If a canonical type already exists for this type, use it. We use
7264 this method instead of type_hash_canon, because it only does a
7265 simple equality check on the list of field members. */
7267 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
7270 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
7272 u
= make_lang_type (UNION_TYPE
);
7273 IS_AGGR_TYPE (u
) = 0;
7274 fields
[0] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
, type
);
7275 fields
[1] = build_lang_field_decl (FIELD_DECL
, delta2_identifier
,
7277 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
7278 TYPE_NAME (u
) = NULL_TREE
;
7280 t
= make_lang_type (RECORD_TYPE
);
7282 /* Let the front-end know this is a pointer to member function. */
7283 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
7284 /* and not really an aggregate. */
7285 IS_AGGR_TYPE (t
) = 0;
7287 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
7289 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
7291 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
7292 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
7296 /* Zap out the name so that the back-end will give us the debugging
7297 information for this anonymous RECORD_TYPE. */
7298 TYPE_NAME (t
) = NULL_TREE
;
7300 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
7302 /* Seems to be wanted. */
7303 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
7307 /* Given declspecs and a declarator,
7308 determine the name and type of the object declared
7309 and construct a ..._DECL node for it.
7310 (In one case we can return a ..._TYPE node instead.
7311 For invalid input we sometimes return 0.)
7313 DECLSPECS is a chain of tree_list nodes whose value fields
7314 are the storage classes and type specifiers.
7316 DECL_CONTEXT says which syntactic context this declaration is in:
7317 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
7318 FUNCDEF for a function definition. Like NORMAL but a few different
7319 error messages in each case. Return value may be zero meaning
7320 this definition is too screwy to try to parse.
7321 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
7322 handle member functions (which have FIELD context).
7323 Return value may be zero meaning this definition is too screwy to
7325 PARM for a parameter declaration (either within a function prototype
7326 or before a function body). Make a PARM_DECL, or return void_type_node.
7327 CATCHPARM for a parameter declaration before a catch clause.
7328 TYPENAME if for a typename (in a cast or sizeof).
7329 Don't make a DECL node; just return the ..._TYPE node.
7330 FIELD for a struct or union field; make a FIELD_DECL.
7331 BITFIELD for a field with specified width.
7332 INITIALIZED is 1 if the decl has an initializer.
7334 In the TYPENAME case, DECLARATOR is really an absolute declarator.
7335 It may also be so in the PARM case, for a prototype where the
7336 argument type is specified but not the name.
7338 This function is where the complicated C meanings of `static'
7339 and `extern' are interpreted.
7341 For C++, if there is any monkey business to do, the function which
7342 calls this one must do it, i.e., prepending instance variables,
7343 renaming overloaded function names, etc.
7345 Note that for this C++, it is an error to define a method within a class
7346 which does not belong to that class.
7348 Except in the case where SCOPE_REFs are implicitly known (such as
7349 methods within a class being redundantly qualified),
7350 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
7351 (class_name::decl_name). The caller must also deal with this.
7353 If a constructor or destructor is seen, and the context is FIELD,
7354 then the type gains the attribute TREE_HAS_x. If such a declaration
7355 is erroneous, NULL_TREE is returned.
7357 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
7358 function, these are the qualifiers to give to the `this' pointer.
7360 May return void_type_node if the declarator turned out to be a friend.
7361 See grokfield for details. */
7363 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
7366 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
7369 enum decl_context decl_context
;
7373 RID_BIT_TYPE specbits
;
7376 tree type
= NULL_TREE
;
7380 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
7381 int explicit_int
= 0;
7382 int explicit_char
= 0;
7383 int opaque_typedef
= 0;
7384 tree typedef_decl
= NULL_TREE
;
7386 tree typedef_type
= NULL_TREE
;
7387 int funcdef_flag
= 0;
7388 enum tree_code innermost_code
= ERROR_MARK
;
7391 /* See the code below that used this. */
7392 tree decl_machine_attr
= NULL_TREE
;
7394 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
7395 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
7396 tree init
= NULL_TREE
;
7398 /* Keep track of what sort of function is being processed
7399 so that we can warn about default return values, or explicit
7400 return values which do not match prescribed defaults. */
7401 enum return_types return_type
= return_normal
;
7403 tree dname
= NULL_TREE
;
7404 tree ctype
= current_class_type
;
7405 tree ctor_return_type
= NULL_TREE
;
7406 enum overload_flags flags
= NO_SPECIAL
;
7407 tree quals
= NULL_TREE
;
7408 tree raises
= NULL_TREE
;
7410 RIDBIT_RESET_ALL (specbits
);
7411 if (decl_context
== FUNCDEF
)
7412 funcdef_flag
= 1, decl_context
= NORMAL
;
7413 else if (decl_context
== MEMFUNCDEF
)
7414 funcdef_flag
= -1, decl_context
= FIELD
;
7415 else if (decl_context
== BITFIELD
)
7416 bitfield
= 1, decl_context
= FIELD
;
7418 /* Look inside a declarator for the name being declared
7419 and get it as a string, for an error message. */
7421 tree
*next
= &declarator
;
7425 while (next
&& *next
)
7428 switch (TREE_CODE (decl
))
7432 next
= &TREE_OPERAND (decl
, 0);
7435 case BIT_NOT_EXPR
: /* for C++ destructors! */
7437 tree name
= TREE_OPERAND (decl
, 0);
7438 tree rename
= NULL_TREE
;
7440 my_friendly_assert (flags
== NO_SPECIAL
, 152);
7442 return_type
= return_dtor
;
7443 if (TREE_CODE (name
) == TYPE_DECL
)
7444 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
7445 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
7446 if (ctype
== NULL_TREE
)
7448 if (current_class_type
== NULL_TREE
)
7450 error ("destructors must be member functions");
7455 tree t
= constructor_name (current_class_name
);
7462 tree t
= constructor_name (ctype
);
7469 cp_error ("destructor `%T' must match class name `%T'",
7471 TREE_OPERAND (decl
, 0) = rename
;
7477 case ADDR_EXPR
: /* C++ reference declaration */
7482 innermost_code
= TREE_CODE (decl
);
7483 next
= &TREE_OPERAND (decl
, 0);
7487 if (parmlist_is_exprlist (TREE_OPERAND (decl
, 1)))
7489 /* This is actually a variable declaration using constructor
7490 syntax. We need to call start_decl and cp_finish_decl so we
7491 can get the variable initialized... */
7493 *next
= TREE_OPERAND (decl
, 0);
7494 init
= TREE_OPERAND (decl
, 1);
7496 decl
= start_decl (declarator
, declspecs
, 1);
7497 finish_decl (decl
, init
, NULL_TREE
);
7500 innermost_code
= TREE_CODE (decl
);
7501 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
7502 ctype
= current_class_type
;
7504 && TREE_OPERAND (decl
, 0)
7505 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
7506 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
7507 == constructor_name_full (ctype
))
7508 || (DECL_NAME (TREE_OPERAND (decl
, 0))
7509 == constructor_name (ctype
)))))
7510 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
7511 next
= &TREE_OPERAND (decl
, 0);
7513 if (ctype
!= NULL_TREE
7514 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
7515 && decl
== constructor_name (ctype
))
7517 return_type
= return_ctor
;
7518 ctor_return_type
= ctype
;
7523 case IDENTIFIER_NODE
:
7529 cp_error ("declarator-id missing; using reserved word `%D'",
7531 name
= IDENTIFIER_POINTER (dname
);
7533 if (! IDENTIFIER_OPNAME_P (dname
)
7534 /* Linux headers use '__op'. Arrgh. */
7535 || IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
))
7536 name
= IDENTIFIER_POINTER (dname
);
7539 if (IDENTIFIER_TYPENAME_P (dname
))
7541 my_friendly_assert (flags
== NO_SPECIAL
, 154);
7542 flags
= TYPENAME_FLAG
;
7543 ctor_return_type
= TREE_TYPE (dname
);
7544 return_type
= return_conversion
;
7546 name
= operator_name_string (dname
);
7553 /* Perform error checking, and decide on a ctype. */
7554 tree cname
= TREE_OPERAND (decl
, 0);
7555 if (cname
== NULL_TREE
)
7557 else if (! is_aggr_type (cname
, 1))
7558 TREE_OPERAND (decl
, 0) = NULL_TREE
;
7559 /* Must test TREE_OPERAND (decl, 1), in case user gives
7560 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
7561 else if (TREE_OPERAND (decl
, 1)
7562 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
7564 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
)
7566 cp_error ("`%T::%D' is not a valid declarator", cname
,
7567 TREE_OPERAND (decl
, 1));
7568 cp_error (" perhaps you want `typename %T::%D' to make it a type",
7569 cname
, TREE_OPERAND (decl
, 1));
7570 return void_type_node
;
7572 else if (ctype
== NULL_TREE
)
7574 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
7575 TREE_OPERAND (decl
, 0) = ctype
;
7578 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
7580 cp_error ("type `%T' is not derived from type `%T'",
7582 TREE_OPERAND (decl
, 0) = NULL_TREE
;
7588 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
7589 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
7590 == constructor_name_full (ctype
))
7591 || (DECL_NAME (TREE_OPERAND (decl
, 1))
7592 == constructor_name (ctype
))))
7593 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
7594 next
= &TREE_OPERAND (decl
, 1);
7598 if (TREE_CODE (decl
) == IDENTIFIER_NODE
7599 && constructor_name (ctype
) == decl
)
7601 return_type
= return_ctor
;
7602 ctor_return_type
= ctype
;
7604 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
7605 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
7606 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
7607 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
7609 return_type
= return_dtor
;
7610 ctor_return_type
= ctype
;
7612 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
7613 next
= &TREE_OPERAND (decl
, 0);
7624 /* Parse error puts this typespec where
7625 a declarator should go. */
7626 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
7627 if (TREE_TYPE (decl
) == current_class_type
)
7628 cp_error (" perhaps you want `%T' for a constructor",
7629 current_class_name
);
7630 dname
= DECL_NAME (decl
);
7631 name
= IDENTIFIER_POINTER (dname
);
7633 /* Avoid giving two errors for this. */
7634 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
7636 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
7643 cp_compiler_error ("`%D' as declarator", decl
);
7644 return 0; /* We used to do a 155 abort here. */
7651 /* A function definition's declarator must have the form of
7652 a function declarator. */
7654 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
7657 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
7658 && innermost_code
!= CALL_EXPR
7659 && ! (ctype
&& declspecs
== NULL_TREE
))
7661 cp_error ("declaration of `%D' as non-function", dname
);
7662 return void_type_node
;
7665 /* Anything declared one level down from the top level
7666 must be one of the parameters of a function
7667 (because the body is at least two levels down). */
7669 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
7670 by not allowing C++ class definitions to specify their parameters
7671 with xdecls (must be spec.d in the parmlist).
7673 Since we now wait to push a class scope until we are sure that
7674 we are in a legitimate method context, we must set oldcname
7675 explicitly (since current_class_name is not yet alive).
7677 We also want to avoid calling this a PARM if it is in a namespace. */
7679 if (decl_context
== NORMAL
&& ! namespace_bindings_p ()
7680 && ! pseudo_global_level_p ())
7682 struct binding_level
*b
= current_binding_level
;
7683 current_binding_level
= b
->level_chain
;
7684 if (current_binding_level
!= 0 && toplevel_bindings_p ())
7685 decl_context
= PARM
;
7686 current_binding_level
= b
;
7689 /* Look through the decl specs and record which ones appear.
7690 Some typespecs are defined as built-in typenames.
7691 Others, the ones that are modifiers of other types,
7692 are represented by bits in SPECBITS: set the bits for
7693 the modifiers that appear. Storage class keywords are also in SPECBITS.
7695 If there is a typedef name or a type, store the type in TYPE.
7696 This includes builtin typedefs such as `int'.
7698 Set EXPLICIT_INT if the type is `int' or `char' and did not
7699 come from a user typedef.
7701 Set LONGLONG if `long' is mentioned twice.
7703 For C++, constructors and destructors have their own fast treatment. */
7705 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
7710 /* Certain parse errors slip through. For example,
7711 `int class;' is not caught by the parser. Try
7712 weakly to recover here. */
7713 if (TREE_CODE (spec
) != TREE_LIST
)
7716 id
= TREE_VALUE (spec
);
7718 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
7720 if (id
== ridpointers
[(int) RID_INT
]
7721 || id
== ridpointers
[(int) RID_CHAR
]
7722 || id
== ridpointers
[(int) RID_BOOL
]
7723 || id
== ridpointers
[(int) RID_WCHAR
])
7727 if (id
== ridpointers
[(int) RID_BOOL
])
7728 error ("`bool' is now a keyword");
7730 cp_error ("extraneous `%T' ignored", id
);
7734 if (id
== ridpointers
[(int) RID_INT
])
7736 else if (id
== ridpointers
[(int) RID_CHAR
])
7738 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
7742 /* C++ aggregate types. */
7743 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
7746 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
7748 type
= IDENTIFIER_TYPE_VALUE (id
);
7752 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
7754 if (ridpointers
[i
] == id
)
7756 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
7758 if (pedantic
&& ! in_system_header
)
7759 pedwarn ("ANSI C++ does not support `long long'");
7761 error ("`long long long' is too long for GCC");
7765 else if (RIDBIT_SETP (i
, specbits
))
7766 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
7767 RIDBIT_SET (i
, specbits
);
7772 /* C++ aggregate types. */
7773 else if (TREE_CODE (id
) == TYPE_DECL
)
7776 cp_error ("multiple declarations `%T' and `%T'", type
,
7780 type
= TREE_TYPE (id
);
7781 TREE_VALUE (spec
) = type
;
7786 error ("two or more data types in declaration of `%s'", name
);
7787 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
7789 register tree t
= lookup_name (id
, 1);
7790 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
7791 error ("`%s' fails to be a typedef or built in type",
7792 IDENTIFIER_POINTER (id
));
7795 type
= TREE_TYPE (t
);
7797 /* See the code below that used this. */
7798 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
7803 else if (TREE_CODE (id
) != ERROR_MARK
)
7804 /* Can't change CLASS nodes into RECORD nodes here! */
7810 typedef_type
= type
;
7812 /* No type at all: default to `int', and set EXPLICIT_INT
7813 because it was not a user-defined typedef.
7814 Except when we have a `typedef' inside a signature, in
7815 which case the type defaults to `unknown type' and is
7816 instantiated when assigning to a signature pointer or ref. */
7818 if (type
== NULL_TREE
7819 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
7820 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
7821 || RIDBIT_SETP (RID_LONG
, specbits
)
7822 || RIDBIT_SETP (RID_SHORT
, specbits
)))
7824 /* These imply 'int'. */
7825 type
= integer_type_node
;
7829 if (type
== NULL_TREE
)
7832 if (return_type
== return_dtor
)
7833 type
= void_type_node
;
7834 else if (return_type
== return_ctor
)
7835 type
= build_pointer_type (ctor_return_type
);
7836 else if (return_type
== return_conversion
)
7837 type
= ctor_return_type
;
7838 else if (current_class_type
7839 && IS_SIGNATURE (current_class_type
)
7840 && RIDBIT_SETP (RID_TYPEDEF
, specbits
)
7841 && (decl_context
== FIELD
|| decl_context
== NORMAL
))
7845 type
= copy_node (opaque_type_node
);
7851 if (warn_return_type
7852 && return_type
== return_normal
)
7853 /* Save warning until we know what is really going on. */
7854 warn_about_return_type
= 1;
7856 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
7857 pedwarn ("ANSI C++ forbids typedef which does not specify a type");
7858 else if (declspecs
== NULL_TREE
&&
7859 (innermost_code
!= CALL_EXPR
|| pedantic
))
7860 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type or storage class",
7862 type
= integer_type_node
;
7865 else if (return_type
== return_dtor
)
7867 error ("return type specification for destructor invalid");
7868 type
= void_type_node
;
7870 else if (return_type
== return_ctor
)
7872 error ("return type specification for constructor invalid");
7873 type
= build_pointer_type (ctor_return_type
);
7875 else if (return_type
== return_conversion
)
7877 if (comptypes (type
, ctor_return_type
, 1) == 0)
7878 cp_error ("operator `%T' declared to return `%T'",
7879 ctor_return_type
, type
);
7881 cp_pedwarn ("return type specified for `operator %T'",
7884 type
= ctor_return_type
;
7889 /* Now process the modifiers that were specified
7890 and check for invalid combinations. */
7892 /* Long double is a special combination. */
7894 if (RIDBIT_SETP (RID_LONG
, specbits
)
7895 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
7897 RIDBIT_RESET (RID_LONG
, specbits
);
7898 type
= build_type_variant (long_double_type_node
, TYPE_READONLY (type
),
7899 TYPE_VOLATILE (type
));
7902 /* Check all other uses of type modifiers. */
7904 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
7905 || RIDBIT_SETP (RID_SIGNED
, specbits
)
7906 || RIDBIT_SETP (RID_LONG
, specbits
)
7907 || RIDBIT_SETP (RID_SHORT
, specbits
))
7911 if (TREE_CODE (type
) == REAL_TYPE
)
7912 error ("short, signed or unsigned invalid for `%s'", name
);
7913 else if (TREE_CODE (type
) != INTEGER_TYPE
)
7914 error ("long, short, signed or unsigned invalid for `%s'", name
);
7915 else if (RIDBIT_SETP (RID_LONG
, specbits
)
7916 && RIDBIT_SETP (RID_SHORT
, specbits
))
7917 error ("long and short specified together for `%s'", name
);
7918 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
7919 || RIDBIT_SETP (RID_SHORT
, specbits
))
7921 error ("long or short specified with char for `%s'", name
);
7922 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
7923 || RIDBIT_SETP (RID_SHORT
, specbits
))
7924 && TREE_CODE (type
) == REAL_TYPE
)
7925 error ("long or short specified with floating type for `%s'", name
);
7926 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
7927 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
7928 error ("signed and unsigned given together for `%s'", name
);
7932 if (!explicit_int
&& !explicit_char
&& pedantic
)
7934 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
7936 if (flag_pedantic_errors
)
7941 /* Discard the type modifiers if they are invalid. */
7944 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
7945 RIDBIT_RESET (RID_SIGNED
, specbits
);
7946 RIDBIT_RESET (RID_LONG
, specbits
);
7947 RIDBIT_RESET (RID_SHORT
, specbits
);
7952 /* Decide whether an integer type is signed or not.
7953 Optionally treat bitfields as signed by default. */
7954 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
7955 || (bitfield
&& ! flag_signed_bitfields
7956 && (explicit_int
|| explicit_char
7957 /* A typedef for plain `int' without `signed'
7958 can be controlled just like plain `int'. */
7959 || ! (typedef_decl
!= NULL_TREE
7960 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
7961 && TREE_CODE (type
) != ENUMERAL_TYPE
7962 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)))
7965 type
= long_long_unsigned_type_node
;
7966 else if (RIDBIT_SETP (RID_LONG
, specbits
))
7967 type
= long_unsigned_type_node
;
7968 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
7969 type
= short_unsigned_type_node
;
7970 else if (type
== char_type_node
)
7971 type
= unsigned_char_type_node
;
7972 else if (typedef_decl
)
7973 type
= unsigned_type (type
);
7975 type
= unsigned_type_node
;
7977 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
7978 && type
== char_type_node
)
7979 type
= signed_char_type_node
;
7981 type
= long_long_integer_type_node
;
7982 else if (RIDBIT_SETP (RID_LONG
, specbits
))
7983 type
= long_integer_type_node
;
7984 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
7985 type
= short_integer_type_node
;
7987 /* Set CONSTP if this declaration is `const', whether by
7988 explicit specification or via a typedef.
7989 Likewise for VOLATILEP. */
7991 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + TYPE_READONLY (type
);
7992 volatilep
= !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + TYPE_VOLATILE (type
);
7994 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
7995 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
7996 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
7997 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
7998 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
8000 if (RIDBIT_SETP (RID_STATIC
, specbits
))
8001 staticp
= 1 + (decl_context
== FIELD
);
8003 if (virtualp
&& staticp
== 2)
8005 cp_error ("member `%D' cannot be declared both virtual and static",
8009 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
8010 RIDBIT_RESET (RID_FRIEND
, specbits
);
8012 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
8014 if (decl_context
== PARM
)
8016 error ("non-member `%s' cannot be declared `mutable'", name
);
8017 RIDBIT_RESET (RID_MUTABLE
, specbits
);
8019 else if (friendp
|| decl_context
== TYPENAME
)
8021 error ("non-object member `%s' cannot be declared `mutable'", name
);
8022 RIDBIT_RESET (RID_MUTABLE
, specbits
);
8026 /* Warn if two storage classes are given. Default to `auto'. */
8028 if (RIDBIT_ANY_SET (specbits
))
8030 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
8031 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
8032 if (decl_context
== PARM
&& nclasses
> 0)
8033 error ("storage class specifiers invalid in parameter declarations");
8034 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
8036 if (decl_context
== PARM
)
8037 error ("typedef declaration invalid in parameter declaration");
8040 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
8041 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
8044 /* Give error if `virtual' is used outside of class declaration. */
8046 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
8048 error ("virtual outside class declaration");
8051 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
8053 error ("only members can be declared mutable");
8054 RIDBIT_RESET (RID_MUTABLE
, specbits
);
8057 /* Static anonymous unions are dealt with here. */
8058 if (staticp
&& decl_context
== TYPENAME
8059 && TREE_CODE (declspecs
) == TREE_LIST
8060 && TREE_CODE (TREE_VALUE (declspecs
)) == UNION_TYPE
8061 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (TREE_VALUE (declspecs
))))
8062 decl_context
= FIELD
;
8064 /* Give error if `const,' `volatile,' `inline,' `friend,' or `virtual'
8065 is used in a signature member function declaration. */
8066 if (decl_context
== FIELD
8067 && IS_SIGNATURE (current_class_type
)
8068 && RIDBIT_NOTSETP (RID_TYPEDEF
, specbits
))
8072 error ("`const' specified for signature member function `%s'", name
);
8077 error ("`volatile' specified for signature member function `%s'",
8083 error ("`inline' specified for signature member function `%s'", name
);
8084 /* Later, we'll make signature member functions inline. */
8089 error ("`friend' declaration in signature definition");
8094 error ("`virtual' specified for signature member function `%s'",
8096 /* Later, we'll make signature member functions virtual. */
8101 /* Warn about storage classes that are invalid for certain
8102 kinds of declarations (parameters, typenames, etc.). */
8105 error ("multiple storage classes in declaration of `%s'", name
);
8106 else if (decl_context
!= NORMAL
&& nclasses
> 0)
8108 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
8109 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
8110 || RIDBIT_SETP (RID_AUTO
, specbits
)))
8112 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
8114 else if (decl_context
== FIELD
8115 && ! IS_SIGNATURE (current_class_type
)
8116 /* C++ allows static class elements */
8117 && RIDBIT_SETP (RID_STATIC
, specbits
))
8118 /* C++ also allows inlines and signed and unsigned elements,
8119 but in those cases we don't come in here. */
8123 if (decl_context
== FIELD
)
8125 tree tmp
= NULL_TREE
;
8126 register int op
= 0;
8130 /* Avoid trying to get an operand off an identifier node. */
8131 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
8134 tmp
= TREE_OPERAND (declarator
, 0);
8135 op
= IDENTIFIER_OPNAME_P (tmp
);
8137 error ("storage class specified for %s `%s'",
8138 IS_SIGNATURE (current_class_type
)
8140 ? "signature member operator"
8141 : "signature member function")
8142 : (op
? "member operator" : "field"),
8143 op
? operator_name_string (tmp
) : name
);
8146 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
8147 ? "storage class specified for parameter `%s'"
8148 : "storage class specified for typename"), name
);
8149 RIDBIT_RESET (RID_REGISTER
, specbits
);
8150 RIDBIT_RESET (RID_AUTO
, specbits
);
8151 RIDBIT_RESET (RID_EXTERN
, specbits
);
8153 if (decl_context
== FIELD
&& IS_SIGNATURE (current_class_type
))
8155 RIDBIT_RESET (RID_STATIC
, specbits
);
8160 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
8162 if (toplevel_bindings_p ())
8164 /* It's common practice (and completely valid) to have a const
8165 be initialized and declared extern. */
8167 warning ("`%s' initialized and declared `extern'", name
);
8170 error ("`%s' has both `extern' and initializer", name
);
8172 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
8173 && ! toplevel_bindings_p ())
8174 error ("nested function `%s' declared `extern'", name
);
8175 else if (toplevel_bindings_p ())
8177 if (RIDBIT_SETP (RID_AUTO
, specbits
))
8178 error ("top-level declaration of `%s' specifies `auto'", name
);
8181 if (nclasses
> 0 && friendp
)
8182 error ("storage class specifiers invalid in friend function declarations");
8184 /* Now figure out the structure of the declarator proper.
8185 Descend through it, creating more complex types, until we reach
8186 the declared identifier (or NULL_TREE, in an absolute declarator). */
8188 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
)
8190 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
8191 an INDIRECT_REF (for *...),
8192 a CALL_EXPR (for ...(...)),
8193 an identifier (for the name being declared)
8194 or a null pointer (for the place in an absolute declarator
8195 where the name was omitted).
8196 For the last two cases, we have just exited the loop.
8198 For C++ it could also be
8199 a SCOPE_REF (for class :: ...). In this case, we have converted
8200 sensible names to types, and those are the values we use to
8201 qualify the member name.
8202 an ADDR_EXPR (for &...),
8203 a BIT_NOT_EXPR (for destructors)
8205 At this point, TYPE is the type of elements of an array,
8206 or for a function to return, or for a pointer to point to.
8207 After this sequence of ifs, TYPE is the type of the
8208 array or function or pointer, and DECLARATOR has had its
8209 outermost layer removed. */
8211 if (TREE_CODE (type
) == ERROR_MARK
)
8213 if (TREE_CODE (declarator
) == SCOPE_REF
)
8214 declarator
= TREE_OPERAND (declarator
, 1);
8216 declarator
= TREE_OPERAND (declarator
, 0);
8219 if (quals
!= NULL_TREE
8220 && (declarator
== NULL_TREE
8221 || TREE_CODE (declarator
) != SCOPE_REF
))
8223 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
8224 ctype
= TYPE_METHOD_BASETYPE (type
);
8225 if (ctype
!= NULL_TREE
)
8227 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
8228 ctype
= grok_method_quals (ctype
, dummy
, quals
);
8229 type
= TREE_TYPE (dummy
);
8233 switch (TREE_CODE (declarator
))
8237 register tree itype
= NULL_TREE
;
8238 register tree size
= TREE_OPERAND (declarator
, 1);
8239 /* The index is a signed object `sizetype' bits wide. */
8240 tree index_type
= signed_type (sizetype
);
8242 declarator
= TREE_OPERAND (declarator
, 0);
8244 /* Check for some types that there cannot be arrays of. */
8246 if (TYPE_MAIN_VARIANT (type
) == void_type_node
)
8248 cp_error ("declaration of `%D' as array of voids", dname
);
8249 type
= error_mark_node
;
8252 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8254 cp_error ("declaration of `%D' as array of functions", dname
);
8255 type
= error_mark_node
;
8258 /* ARM $8.4.3: Since you can't have a pointer to a reference,
8259 you can't have arrays of references. If we allowed them,
8260 then we'd be saying x[i] is valid for an array x, but
8261 then you'd have to ask: what does `*(x + i)' mean? */
8262 if (TREE_CODE (type
) == REFERENCE_TYPE
)
8264 if (decl_context
== TYPENAME
)
8265 cp_error ("cannot make arrays of references");
8267 cp_error ("declaration of `%D' as array of references",
8269 type
= error_mark_node
;
8272 if (TREE_CODE (type
) == OFFSET_TYPE
)
8274 cp_error ("declaration of `%D' as array of data members",
8276 type
= error_mark_node
;
8279 if (TREE_CODE (type
) == METHOD_TYPE
)
8281 cp_error ("declaration of `%D' as array of function members",
8283 type
= error_mark_node
;
8286 if (size
== error_mark_node
)
8287 type
= error_mark_node
;
8289 if (type
== error_mark_node
)
8294 /* Must suspend_momentary here because the index
8295 type may need to live until the end of the function.
8296 For example, it is used in the declaration of a
8297 variable which requires destructing at the end of
8298 the function; then build_vec_delete will need this
8300 int yes
= suspend_momentary ();
8301 /* might be a cast */
8302 if (TREE_CODE (size
) == NOP_EXPR
8303 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
8304 size
= TREE_OPERAND (size
, 0);
8306 /* If this involves a template parameter, it'll be
8307 constant, but we don't know what the value is yet. */
8308 if (processing_template_decl
)
8310 itype
= make_node (INTEGER_TYPE
);
8311 TYPE_MIN_VALUE (itype
) = size_zero_node
;
8312 TYPE_MAX_VALUE (itype
) = build_min
8313 (MINUS_EXPR
, sizetype
, size
, integer_one_node
);
8314 goto dont_grok_size
;
8317 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
8318 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
)
8320 cp_error ("size of array `%D' has non-integer type",
8322 size
= integer_one_node
;
8324 if (TREE_READONLY_DECL_P (size
))
8325 size
= decl_constant_value (size
);
8326 if (pedantic
&& integer_zerop (size
))
8327 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
8328 if (TREE_CONSTANT (size
))
8330 int old_flag_pedantic_errors
= flag_pedantic_errors
;
8331 int old_pedantic
= pedantic
;
8332 pedantic
= flag_pedantic_errors
= 1;
8333 /* Always give overflow errors on array subscripts. */
8334 constant_expression_warning (size
);
8335 pedantic
= old_pedantic
;
8336 flag_pedantic_errors
= old_flag_pedantic_errors
;
8337 if (INT_CST_LT (size
, integer_zero_node
))
8339 cp_error ("size of array `%D' is negative", dname
);
8340 size
= integer_one_node
;
8348 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
8351 cp_pedwarn ("ANSI C++ forbids variable-size array");
8356 fold (build_binary_op (MINUS_EXPR
,
8357 convert (index_type
, size
),
8358 convert (index_type
,
8359 integer_one_node
), 1));
8360 if (! TREE_CONSTANT (itype
))
8361 itype
= variable_size (itype
);
8362 else if (TREE_OVERFLOW (itype
))
8364 error ("overflow in array dimension");
8365 TREE_OVERFLOW (itype
) = 0;
8368 /* If we're a parm, we need to have a permanent type so
8369 mangling checks for re-use will work right. If both the
8370 element and index types are permanent, the array type
8372 if (decl_context
== PARM
8373 && allocation_temporary_p () && TREE_PERMANENT (type
))
8375 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8376 itype
= build_index_type (itype
);
8380 itype
= build_index_type (itype
);
8383 resume_momentary (yes
);
8386 /* Build the array type itself, then merge any constancy or
8387 volatility into the target type. We must do it in this order
8388 to ensure that the TYPE_MAIN_VARIANT field of the array type
8389 is set correctly. */
8391 type
= build_cplus_array_type (type
, itype
);
8392 if (constp
|| volatilep
)
8393 type
= cp_build_type_variant (type
, constp
, volatilep
);
8403 tree inner_parms
= TREE_OPERAND (declarator
, 1);
8404 tree inner_decl
= TREE_OPERAND (declarator
, 0);
8406 /* Declaring a function type.
8407 Make sure we have a valid type for the function to return. */
8409 /* Is this an error? Should they be merged into TYPE here? */
8410 if (pedantic
&& (constp
|| volatilep
))
8411 pedwarn ("function declared to return const or volatile result");
8413 /* Merge any constancy or volatility into the function return
8416 if (constp
|| volatilep
)
8418 type
= cp_build_type_variant (type
, constp
, volatilep
);
8419 if (IS_AGGR_TYPE (type
))
8420 build_pointer_type (type
);
8426 /* Warn about some types functions can't return. */
8428 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8430 error ("`%s' declared as function returning a function", name
);
8431 type
= integer_type_node
;
8433 if (TREE_CODE (type
) == ARRAY_TYPE
)
8435 error ("`%s' declared as function returning an array", name
);
8436 type
= integer_type_node
;
8439 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
8440 inner_decl
= TREE_OPERAND (inner_decl
, 1);
8442 /* Pick up type qualifiers which should be applied to `this'. */
8443 quals
= TREE_OPERAND (declarator
, 2);
8445 /* Pick up the exception specifications. */
8446 raises
= TREE_TYPE (declarator
);
8448 /* Say it's a definition only for the CALL_EXPR
8449 closest to the identifier. */
8451 inner_decl
&& (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
8452 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
8454 if (ctype
== NULL_TREE
8455 && decl_context
== FIELD
8457 && (friendp
== 0 || dname
== current_class_name
))
8458 ctype
= current_class_type
;
8460 if (ctype
&& return_type
== return_conversion
)
8461 TYPE_HAS_CONVERSION (ctype
) = 1;
8462 if (ctype
&& constructor_name (ctype
) == dname
)
8464 /* We are within a class's scope. If our declarator name
8465 is the same as the class name, and we are defining
8466 a function, then it is a constructor/destructor, and
8467 therefore returns a void type. */
8469 if (flags
== DTOR_FLAG
)
8471 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
8472 not be declared const or volatile. A destructor
8473 may not be static. */
8475 error ("destructor cannot be static member function");
8478 error ("destructors cannot be declared `const' or `volatile'");
8479 return void_type_node
;
8481 if (decl_context
== FIELD
)
8483 if (! member_function_or_else (ctype
, current_class_type
,
8484 "destructor for alien class `%s' cannot be a member"))
8485 return void_type_node
;
8488 else /* it's a constructor. */
8492 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
8493 not be declared const or volatile. A constructor may
8494 not be virtual. A constructor may not be static. */
8496 error ("constructor cannot be static member function");
8499 pedwarn ("constructors cannot be declared virtual");
8504 error ("constructors cannot be declared `const' or `volatile'");
8505 return void_type_node
;
8508 RID_BIT_TYPE tmp_bits
;
8509 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
8510 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
8511 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
8512 if (RIDBIT_ANY_SET (tmp_bits
))
8513 error ("return value type specifier for constructor ignored");
8515 type
= build_pointer_type (ctype
);
8516 if (decl_context
== FIELD
&&
8517 IS_SIGNATURE (current_class_type
))
8519 error ("constructor not allowed in signature");
8520 return void_type_node
;
8522 else if (decl_context
== FIELD
)
8524 if (! member_function_or_else (ctype
, current_class_type
,
8525 "constructor for alien class `%s' cannot be member"))
8526 return void_type_node
;
8527 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
8528 if (return_type
!= return_ctor
)
8532 if (decl_context
== FIELD
)
8538 error ("can't initialize friend function `%s'", name
);
8541 /* Cannot be both friend and virtual. */
8542 error ("virtual functions cannot be friends");
8543 RIDBIT_RESET (RID_FRIEND
, specbits
);
8546 if (decl_context
== NORMAL
)
8547 error ("friend declaration not in class definition");
8548 if (current_function_decl
&& funcdef_flag
)
8549 cp_error ("can't define friend function `%s' in a local class definition",
8553 /* Construct the function type and go to the next
8554 inner layer of declarator. */
8556 declarator
= TREE_OPERAND (declarator
, 0);
8558 /* FIXME: This is where default args should be fully
8561 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
8565 /* Get past destructors, etc.
8566 We know we have one because FLAGS will be non-zero.
8568 Complain about improper parameter lists here. */
8569 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
8571 declarator
= TREE_OPERAND (declarator
, 0);
8573 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
8574 arg_types
= void_list_node
;
8575 else if (arg_types
== NULL_TREE
8576 || arg_types
!= void_list_node
)
8578 error ("destructors cannot be specified with parameters");
8579 arg_types
= void_list_node
;
8584 /* ANSI says that `const int foo ();'
8585 does not make the function foo const. */
8586 type
= build_function_type (type
, arg_types
);
8592 /* Filter out pointers-to-references and references-to-references.
8593 We can get these if a TYPE_DECL is used. */
8595 if (TREE_CODE (type
) == REFERENCE_TYPE
)
8597 error ("cannot declare %s to references",
8598 TREE_CODE (declarator
) == ADDR_EXPR
8599 ? "references" : "pointers");
8600 declarator
= TREE_OPERAND (declarator
, 0);
8604 if (TREE_CODE (type
) == OFFSET_TYPE
8605 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
8606 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
8608 cp_error ("cannot declare pointer to `%#T' member",
8610 type
= TREE_TYPE (type
);
8613 /* Merge any constancy or volatility into the target type
8616 if (constp
|| volatilep
)
8618 /* A const or volatile signature pointer/reference is
8619 pointing to a const or volatile object, i.e., the
8620 `optr' is const or volatile, respectively, not the
8621 signature pointer/reference itself. */
8622 if (! IS_SIGNATURE (type
))
8624 type
= cp_build_type_variant (type
, constp
, volatilep
);
8625 if (IS_AGGR_TYPE (type
))
8626 build_pointer_type (type
);
8632 if (IS_SIGNATURE (type
))
8634 if (TREE_CODE (declarator
) == ADDR_EXPR
)
8636 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
8637 && TYPE_SIZE (type
))
8638 cp_warning ("empty signature `%T' used in signature reference declaration",
8641 type
= build_signature_reference_type (type
,
8644 sorry ("signature reference");
8650 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
8651 && TYPE_SIZE (type
))
8652 cp_warning ("empty signature `%T' used in signature pointer declaration",
8654 type
= build_signature_pointer_type (type
,
8660 else if (TREE_CODE (declarator
) == ADDR_EXPR
)
8662 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8664 error ("cannot declare references to functions; use pointer to function instead");
8665 type
= build_pointer_type (type
);
8669 if (TYPE_MAIN_VARIANT (type
) == void_type_node
)
8670 error ("invalid type: `void &'");
8672 type
= build_reference_type (type
);
8675 else if (TREE_CODE (type
) == METHOD_TYPE
)
8677 type
= build_ptrmemfunc_type (build_pointer_type (type
));
8680 type
= build_pointer_type (type
);
8682 /* Process a list of type modifier keywords (such as
8683 const or volatile) that were given inside the `*' or `&'. */
8685 if (TREE_TYPE (declarator
))
8687 register tree typemodlist
;
8689 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
8690 typemodlist
= TREE_CHAIN (typemodlist
))
8692 if (TREE_VALUE (typemodlist
) == ridpointers
[(int) RID_CONST
])
8694 else if (TREE_VALUE (typemodlist
) == ridpointers
[(int) RID_VOLATILE
])
8699 error ("invalid type modifier within %s declarator",
8700 TREE_CODE (declarator
) == ADDR_EXPR
8701 ? "reference" : "pointer");
8705 pedwarn ("duplicate `const'");
8707 pedwarn ("duplicate `volatile'");
8708 if (TREE_CODE (declarator
) == ADDR_EXPR
8709 && (constp
|| volatilep
))
8712 pedwarn ("discarding `const' applied to a reference");
8714 pedwarn ("discarding `volatile' applied to a reference");
8715 constp
= volatilep
= 0;
8718 declarator
= TREE_OPERAND (declarator
, 0);
8724 /* We have converted type names to NULL_TREE if the
8725 name was bogus, or to a _TYPE node, if not.
8727 The variable CTYPE holds the type we will ultimately
8728 resolve to. The code here just needs to build
8729 up appropriate member types. */
8730 tree sname
= TREE_OPERAND (declarator
, 1);
8731 /* Destructors can have their visibilities changed as well. */
8732 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
8733 sname
= TREE_OPERAND (sname
, 0);
8735 if (TREE_COMPLEXITY (declarator
) == 0)
8736 /* This needs to be here, in case we are called
8737 multiple times. */ ;
8738 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
8739 /* don't fall out into global scope. Hides real bug? --eichin */ ;
8740 else if (! IS_AGGR_TYPE_CODE
8741 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
8743 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
8745 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
8746 that refer to ctype. They couldn't be resolved earlier
8747 because we hadn't pushed into the class yet.
8748 Example: resolve 'B<T>::type' in
8749 'B<typename B<T>::type> B<T>::f () { }'. */
8750 if (current_template_parms
8751 && uses_template_parms (type
)
8752 && uses_template_parms (current_class_type
))
8754 tree args
= current_template_args ();
8755 type
= tsubst (type
, &TREE_VEC_ELT (args
, 0),
8756 TREE_VEC_LENGTH (args
), NULL_TREE
);
8759 /* This pop_nested_class corresponds to the
8760 push_nested_class used to push into class scope for
8761 parsing the argument list of a function decl, in
8763 pop_nested_class (1);
8764 TREE_COMPLEXITY (declarator
) = current_class_depth
;
8767 my_friendly_abort (16);
8769 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
8771 /* We had a reference to a global decl, or
8772 perhaps we were given a non-aggregate typedef,
8773 in which case we cleared this out, and should just
8774 keep going as though it wasn't there. */
8778 ctype
= TREE_OPERAND (declarator
, 0);
8780 if (sname
== NULL_TREE
)
8783 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
8785 /* This is the `standard' use of the scoping operator:
8786 basetype :: member . */
8788 if (ctype
== current_class_type
)
8794 Is this ill-formed? */
8797 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
8800 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
8802 if (current_class_type
== NULL_TREE
8804 type
= build_cplus_method_type (build_type_variant (ctype
, constp
, volatilep
),
8805 TREE_TYPE (type
), TYPE_ARG_TYPES (type
));
8808 cp_error ("cannot declare member function `%T::%s' within `%T'",
8809 ctype
, name
, current_class_type
);
8810 return void_type_node
;
8813 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
8814 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
8816 /* have to move this code elsewhere in this function.
8817 this code is used for i.e., typedef int A::M; M *pm;
8819 It is? How? jason 10/2/94 */
8821 if (current_class_type
)
8823 cp_error ("cannot declare member `%T::%s' within `%T'",
8824 ctype
, name
, current_class_type
);
8825 return void_type_node
;
8827 type
= build_offset_type (ctype
, type
);
8829 else if (uses_template_parms (ctype
))
8831 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8833 build_cplus_method_type (build_type_variant (ctype
,
8837 TYPE_ARG_TYPES (type
));
8841 cp_error ("structure `%T' not yet defined", ctype
);
8842 return error_mark_node
;
8847 else if (TREE_CODE (sname
) == SCOPE_REF
)
8848 my_friendly_abort (17);
8852 declarator
= TREE_OPERAND (declarator
, 1);
8853 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
8854 /* In this case, we will deal with it later. */
8858 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8859 type
= build_cplus_method_type (build_type_variant (ctype
, constp
, volatilep
), TREE_TYPE (type
), TYPE_ARG_TYPES (type
));
8861 type
= build_offset_type (ctype
, type
);
8868 declarator
= TREE_OPERAND (declarator
, 0);
8874 declarator
= NULL_TREE
;
8878 declarator
= NULL_TREE
;
8882 my_friendly_abort (158);
8888 error ("only constructors can be declared `explicit'");
8892 /* Now TYPE has the actual type. */
8894 /* If this is declaring a typedef name, return a TYPE_DECL. */
8896 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
8900 error ("const `%s' cannot be declared `mutable'", name
);
8901 RIDBIT_RESET (RID_MUTABLE
, specbits
);
8905 error ("static `%s' cannot be declared `mutable'", name
);
8906 RIDBIT_RESET (RID_MUTABLE
, specbits
);
8910 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
8914 /* Note that the grammar rejects storage classes
8915 in typenames, fields or parameters. */
8916 if (constp
|| volatilep
)
8917 type
= cp_build_type_variant (type
, constp
, volatilep
);
8919 if (decl_context
== FIELD
)
8921 if (declarator
== current_class_name
)
8922 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
8924 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
8925 if (IS_SIGNATURE (current_class_type
) && opaque_typedef
)
8926 SIGNATURE_HAS_OPAQUE_TYPEDECLS (current_class_type
) = 1;
8929 decl
= build_decl (TYPE_DECL
, declarator
, type
);
8931 /* If the user declares "struct {...} foo" then `foo' will have
8932 an anonymous name. Fill that name in now. Nothing can
8933 refer to it, so nothing needs know about the name change.
8934 The TYPE_NAME field was filled in by build_struct_xref. */
8935 if (type
!= error_mark_node
8937 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
8938 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
)))
8940 /* replace the anonymous name with the real name everywhere. */
8941 lookup_tag_reverse (type
, declarator
);
8942 TYPE_NAME (type
) = decl
;
8944 if (TYPE_LANG_SPECIFIC (type
))
8945 TYPE_WAS_ANONYMOUS (type
) = 1;
8947 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
8948 DECL_ASSEMBLER_NAME (decl
)
8949 = get_identifier (build_overload_name (type
, 1, 1));
8952 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
8954 cp_error_at ("typedef name may not be class-qualified", decl
);
8959 if (ctype
== NULL_TREE
)
8961 if (TREE_CODE (type
) != METHOD_TYPE
)
8962 cp_error_at ("invalid type qualifier for non-method type", decl
);
8964 ctype
= TYPE_METHOD_BASETYPE (type
);
8966 if (ctype
!= NULL_TREE
)
8967 grok_method_quals (ctype
, decl
, quals
);
8970 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
8971 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
8972 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
8974 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
8976 error ("non-object member `%s' cannot be declared mutable", name
);
8979 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
8980 inlinep
, friendp
, raises
!= NULL_TREE
);
8983 error ("typedef declaration includes an initializer");
8988 /* Detect the case of an array type of unspecified size
8989 which came, as such, direct from a typedef name.
8990 We must copy the type, so that each identifier gets
8991 a distinct type, so that each identifier's size can be
8992 controlled separately by its own initializer. */
8994 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
8995 && TYPE_DOMAIN (type
) == NULL_TREE
)
8997 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
9000 /* If this is a type name (such as, in a cast or sizeof),
9001 compute the type and return it now. */
9003 if (decl_context
== TYPENAME
)
9005 /* Note that the grammar rejects storage classes
9006 in typenames, fields or parameters. */
9007 if (constp
|| volatilep
)
9008 if (IS_SIGNATURE (type
))
9009 error ("`const' or `volatile' specified with signature type");
9011 type
= cp_build_type_variant (type
, constp
, volatilep
);
9013 /* Special case: "friend class foo" looks like a TYPENAME context. */
9018 cp_error ("`volatile' specified for friend class declaration");
9023 cp_error ("`inline' specified for friend class declaration");
9027 /* Only try to do this stuff if we didn't already give up. */
9028 if (type
!= integer_type_node
)
9030 /* A friendly class? */
9031 if (current_class_type
)
9032 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
9034 error ("trying to make class `%s' a friend of global scope",
9035 TYPE_NAME_STRING (type
));
9036 type
= void_type_node
;
9041 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
9042 if (ctype
== NULL_TREE
)
9044 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
9045 ctype
= TYPE_METHOD_BASETYPE (type
);
9047 grok_method_quals (ctype
, dummy
, quals
);
9048 type
= TREE_TYPE (dummy
);
9053 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
9054 && decl_context
!= CATCHPARM
9055 && TREE_CODE (type
) != UNION_TYPE
9058 cp_error ("abstract declarator `%T' used as declaration", type
);
9059 declarator
= make_anon_name ();
9062 /* `void' at top level (not within pointer)
9063 is allowed only in typedefs or type names.
9064 We don't complain about parms either, but that is because
9065 a better error message can be made later. */
9067 if (TYPE_MAIN_VARIANT (type
) == void_type_node
&& decl_context
!= PARM
)
9070 error ("unnamed variable or field declared void");
9071 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9073 if (IDENTIFIER_OPNAME_P (declarator
))
9074 my_friendly_abort (356);
9076 error ("variable or field `%s' declared void", name
);
9079 error ("variable or field declared void");
9080 type
= integer_type_node
;
9083 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
9084 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
9089 if (decl_context
== PARM
)
9092 error ("cannot use `::' in parameter declaration");
9094 /* A parameter declared as an array of T is really a pointer to T.
9095 One declared as a function is really a pointer to a function.
9096 One declared as a member is really a pointer to member. */
9098 if (TREE_CODE (type
) == ARRAY_TYPE
)
9100 /* Transfer const-ness of array into that of type pointed to. */
9101 type
= build_pointer_type
9102 (cp_build_type_variant (TREE_TYPE (type
), constp
, volatilep
));
9103 volatilep
= constp
= 0;
9105 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9106 type
= build_pointer_type (type
);
9107 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9108 type
= build_pointer_type (type
);
9109 else if (type
== void_type_node
&& declarator
)
9111 error ("declaration of `%s' as void", name
);
9115 decl
= build_decl (PARM_DECL
, declarator
, complete_type (type
));
9117 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
9118 inlinep
, friendp
, raises
!= NULL_TREE
);
9119 if (current_class_type
9120 && IS_SIGNATURE (current_class_type
))
9123 error ("parameter of signature member function declared `inline'");
9124 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9125 error ("parameter of signature member function declared `auto'");
9126 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
9127 error ("parameter of signature member function declared `register'");
9130 /* Compute the type actually passed in the parmlist,
9131 for the case where there is no prototype.
9132 (For example, shorts and chars are passed as ints.)
9133 When there is a prototype, this is overridden later. */
9135 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
9137 else if (decl_context
== FIELD
)
9139 if (type
== error_mark_node
)
9141 /* Happens when declaring arrays of sizes which
9142 are error_mark_node, for example. */
9145 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9149 /* We catch the others as conflicts with the builtin
9151 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
9153 cp_error ("function `%D' cannot be declared friend",
9160 if (ctype
== NULL_TREE
)
9161 ctype
= current_class_type
;
9163 if (ctype
== NULL_TREE
)
9165 cp_error ("can't make `%D' into a method -- not in a class",
9167 return void_type_node
;
9170 /* ``A union may [ ... ] not [ have ] virtual functions.''
9172 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
9174 cp_error ("function `%D' declared virtual inside a union",
9176 return void_type_node
;
9179 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
9180 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
9181 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
9182 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
9186 cp_error ("`%D' cannot be declared virtual, since it is always static",
9191 else if (staticp
< 2)
9192 type
= build_cplus_method_type (build_type_variant (ctype
, constp
, volatilep
),
9193 TREE_TYPE (type
), TYPE_ARG_TYPES (type
));
9196 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
9197 publicp
= (! friendp
9198 || RIDBIT_SETP (RID_EXTERN
, specbits
)
9199 || ! (funcdef_flag
< 0 || inlinep
));
9200 decl
= grokfndecl (ctype
, type
, declarator
,
9201 virtualp
, flags
, quals
, raises
, attrlist
,
9202 friendp
? -1 : 0, publicp
, inlinep
,
9204 if (decl
== NULL_TREE
)
9207 /* This clobbers the attrs stored in `decl' from `attrlist'. */
9208 /* The decl and setting of decl_machine_attr is also turned off. */
9209 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
9213 DECL_NONCONVERTING_P (decl
) = 1;
9215 else if (TREE_CODE (type
) == METHOD_TYPE
)
9217 /* We only get here for friend declarations of
9218 members of other classes. */
9219 /* All method decls are public, so tell grokfndecl to set
9220 TREE_PUBLIC, also. */
9221 decl
= grokfndecl (ctype
, type
, declarator
,
9222 virtualp
, flags
, quals
, raises
, attrlist
,
9223 friendp
? -1 : 0, 1, 0, funcdef_flag
);
9224 if (decl
== NULL_TREE
)
9227 else if (!staticp
&& ! processing_template_decl
9228 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
9229 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
9232 cp_error ("field `%D' has incomplete type", declarator
);
9234 cp_error ("name `%T' has incomplete type", type
);
9236 /* If we're instantiating a template, tell them which
9237 instantiation made the field's type be incomplete. */
9238 if (current_class_type
9239 && TYPE_NAME (current_class_type
)
9240 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
9241 && declspecs
&& TREE_VALUE (declspecs
)
9242 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
9243 cp_error (" in instantiation of template `%T'",
9244 current_class_type
);
9246 type
= error_mark_node
;
9253 error ("`%s' is neither function nor method; cannot be declared friend",
9254 IDENTIFIER_POINTER (declarator
));
9262 /* Friends are treated specially. */
9263 if (ctype
== current_class_type
)
9264 warning ("member functions are implicitly friends of their class");
9268 if (decl
&& DECL_NAME (decl
))
9269 t
= do_friend (ctype
, declarator
, decl
,
9270 last_function_parms
, flags
, quals
,
9272 if (t
&& funcdef_flag
)
9275 return void_type_node
;
9279 /* Structure field. It may not be a function, except for C++ */
9281 if (decl
== NULL_TREE
)
9285 /* Motion 10 at San Diego: If a static const integral data
9286 member is initialized with an integral constant
9287 expression, the initializer may appear either in the
9288 declaration (within the class), or in the definition,
9289 but not both. If it appears in the class, the member is
9290 a member constant. The file-scope definition is always
9297 cp_pedwarn ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
9300 else if (! INTEGRAL_TYPE_P (type
))
9301 cp_pedwarn ("ANSI C++ forbids member constant `%D' of non-integral type `%T'", declarator
, type
);
9305 /* Note that initialization of const members is prohibited
9306 by the draft ANSI standard, though it appears to be in
9307 common practice. 12.6.2: The argument list is used to
9308 initialize the named nonstatic member.... This (or an
9309 initializer list) is the only way to initialize
9310 nonstatic const and reference members. */
9311 else if (pedantic
|| ! constp
)
9312 cp_pedwarn ("ANSI C++ forbids initialization of %s `%D'",
9313 constp
? "const member" : "member", declarator
);
9316 if (staticp
|| (constp
&& initialized
))
9318 /* ANSI C++ Apr '95 wp 9.2 */
9319 if (staticp
&& declarator
== current_class_name
)
9320 cp_pedwarn ("ANSI C++ forbids static member `%D' with same name as enclosing class",
9323 /* C++ allows static class members.
9324 All other work for this is done by grokfield.
9325 This VAR_DECL is built by build_lang_field_decl.
9326 All other VAR_DECLs are built by build_decl. */
9327 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
9328 TREE_STATIC (decl
) = 1;
9329 /* In class context, 'static' means public access. */
9330 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = !!staticp
;
9334 decl
= build_lang_field_decl (FIELD_DECL
, declarator
, type
);
9335 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9337 DECL_MUTABLE_P (decl
) = 1;
9338 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9342 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
9343 inlinep
, friendp
, raises
!= NULL_TREE
);
9346 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
9348 tree original_name
= declarator
;
9354 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9355 error ("storage class `auto' invalid for function `%s'", name
);
9356 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
9357 error ("storage class `register' invalid for function `%s'", name
);
9359 /* Function declaration not at top level.
9360 Storage classes other than `extern' are not allowed
9361 and `extern' makes no difference. */
9362 if (! toplevel_bindings_p ()
9363 && (RIDBIT_SETP (RID_STATIC
, specbits
)
9364 || RIDBIT_SETP (RID_INLINE
, specbits
))
9367 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9368 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
9370 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
9373 if (ctype
== NULL_TREE
)
9377 error ("virtual non-class function `%s'", name
);
9381 if (current_lang_name
== lang_name_cplusplus
9382 && ! processing_template_decl
9383 && ! (IDENTIFIER_LENGTH (original_name
) == 4
9384 && IDENTIFIER_POINTER (original_name
)[0] == 'm'
9385 && strcmp (IDENTIFIER_POINTER (original_name
), "main") == 0)
9386 && ! (IDENTIFIER_LENGTH (original_name
) > 10
9387 && IDENTIFIER_POINTER (original_name
)[0] == '_'
9388 && IDENTIFIER_POINTER (original_name
)[1] == '_'
9389 && strncmp (IDENTIFIER_POINTER (original_name
)+2, "builtin_", 8) == 0))
9390 /* Plain overloading: will not be grok'd by grokclassfn. */
9391 declarator
= build_decl_overload (dname
, TYPE_ARG_TYPES (type
), 0);
9393 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
9394 type
= build_cplus_method_type (build_type_variant (ctype
, constp
, volatilep
),
9395 TREE_TYPE (type
), TYPE_ARG_TYPES (type
));
9397 /* Record presence of `static'. In C++, `inline' implies `static'. */
9398 publicp
= (ctype
!= NULL_TREE
9399 || RIDBIT_SETP (RID_EXTERN
, specbits
)
9400 || (!RIDBIT_SETP (RID_STATIC
, specbits
)
9401 && !RIDBIT_SETP (RID_INLINE
, specbits
)));
9403 decl
= grokfndecl (ctype
, type
, original_name
,
9404 virtualp
, flags
, quals
, raises
, attrlist
,
9406 publicp
, inlinep
, funcdef_flag
);
9407 if (decl
== NULL_TREE
)
9410 if (ctype
== NULL_TREE
&& DECL_LANGUAGE (decl
) != lang_c
)
9411 DECL_ASSEMBLER_NAME (decl
) = current_namespace_id (declarator
);
9415 int illegal_static
= 0;
9417 /* Don't allow a static member function in a class, and forbid
9418 declaring main to be static. */
9419 if (TREE_CODE (type
) == METHOD_TYPE
)
9421 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
9424 else if (current_function_decl
)
9426 /* FIXME need arm citation */
9427 error ("cannot declare static function inside another function");
9434 RIDBIT_RESET (RID_STATIC
, specbits
);
9440 /* It's a variable. */
9442 if (decl_context
== CATCHPARM
)
9447 error ("cannot use `::' in parameter declaration");
9450 /* A parameter declared as an array of T is really a pointer to T.
9451 One declared as a function is really a pointer to a function.
9452 One declared as a member is really a pointer to member. */
9454 if (TREE_CODE (type
) == ARRAY_TYPE
)
9456 /* Transfer const-ness of array into that of type
9458 type
= build_pointer_type
9459 (cp_build_type_variant (TREE_TYPE (type
), constp
, volatilep
));
9460 volatilep
= constp
= 0;
9462 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9463 type
= build_pointer_type (type
);
9464 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9465 type
= build_pointer_type (type
);
9468 /* An uninitialized decl with `extern' is a reference. */
9469 decl
= grokvardecl (type
, declarator
, &specbits
, initialized
, constp
);
9470 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
9471 inlinep
, friendp
, raises
!= NULL_TREE
);
9475 DECL_CONTEXT (decl
) = ctype
;
9478 cp_pedwarn ("static member `%D' re-declared as static", decl
);
9480 RIDBIT_RESET (RID_STATIC
, specbits
);
9482 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
9484 cp_error ("static member `%D' declared `register'", decl
);
9485 RIDBIT_RESET (RID_REGISTER
, specbits
);
9487 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
9489 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
9491 RIDBIT_RESET (RID_EXTERN
, specbits
);
9496 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9498 error ("`%s' cannot be declared mutable", name
);
9501 /* Record `register' declaration for warnings on &
9502 and in case doing stupid register allocation. */
9504 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
9505 DECL_REGISTER (decl
) = 1;
9507 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9508 DECL_THIS_EXTERN (decl
) = 1;
9510 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9511 DECL_THIS_STATIC (decl
) = 1;
9513 /* Record constancy and volatility. */
9516 TREE_READONLY (decl
) = TREE_CODE (type
) != REFERENCE_TYPE
;
9519 TREE_SIDE_EFFECTS (decl
) = 1;
9520 TREE_THIS_VOLATILE (decl
) = 1;
9527 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
9528 An empty exprlist is a parmlist. An exprlist which
9529 contains only identifiers at the global level
9530 is a parmlist. Otherwise, it is an exprlist. */
9533 parmlist_is_exprlist (exprs
)
9536 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
9539 if (toplevel_bindings_p ())
9541 /* At the global level, if these are all identifiers,
9542 then it is a parmlist. */
9545 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
9547 exprs
= TREE_CHAIN (exprs
);
9554 /* Subroutine of `grokparms'. In a fcn definition, arg types must
9557 C++: also subroutine of `start_function'. */
9560 require_complete_types_for_parms (parms
)
9563 if (processing_template_decl
)
9568 tree type
= TREE_TYPE (parms
);
9569 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
9571 if (DECL_NAME (parms
))
9572 error ("parameter `%s' has incomplete type",
9573 IDENTIFIER_POINTER (DECL_NAME (parms
)));
9575 error ("parameter has incomplete type");
9576 TREE_TYPE (parms
) = error_mark_node
;
9579 /* If the arg types are incomplete in a declaration,
9580 they must include undefined tags.
9581 These tags can never be defined in the scope of the declaration,
9582 so the types can never be completed,
9583 and no call can be compiled successfully. */
9584 /* This is not the right behavior for C++, but not having
9585 it is also probably wrong. */
9588 /* Now warn if is a pointer to an incomplete type. */
9589 while (TREE_CODE (type
) == POINTER_TYPE
9590 || TREE_CODE (type
) == REFERENCE_TYPE
)
9591 type
= TREE_TYPE (type
);
9592 type
= TYPE_MAIN_VARIANT (type
);
9593 if (TYPE_SIZE (type
) == NULL_TREE
)
9595 if (DECL_NAME (parm
) != NULL_TREE
)
9596 warning ("parameter `%s' points to incomplete type",
9597 IDENTIFIER_POINTER (DECL_NAME (parm
)));
9599 warning ("parameter points to incomplete type");
9603 parms
= TREE_CHAIN (parms
);
9607 /* Decode the list of parameter types for a function type.
9608 Given the list of things declared inside the parens,
9609 return a list of types.
9611 The list we receive can have three kinds of elements:
9612 an IDENTIFIER_NODE for names given without types,
9613 a TREE_LIST node for arguments given as typespecs or names with typespecs,
9614 or void_type_node, to mark the end of an argument list
9615 when additional arguments are not permitted (... was not used).
9617 FUNCDEF_FLAG is nonzero for a function definition, 0 for
9618 a mere declaration. A nonempty identifier-list gets an error message
9619 when FUNCDEF_FLAG is zero.
9620 If FUNCDEF_FLAG is 1, then parameter types must be complete.
9621 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
9623 If all elements of the input list contain types,
9624 we return a list of the types.
9625 If all elements contain no type (except perhaps a void_type_node
9626 at the end), we return a null list.
9627 If some have types and some do not, it is an error, and we
9630 Also set last_function_parms to either
9631 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
9632 A list of names is converted to a chain of PARM_DECLs
9633 by store_parm_decls so that ultimately it is always a chain of decls.
9635 Note that in C++, parameters can take default values. These default
9636 values are in the TREE_PURPOSE field of the TREE_LIST. It is
9637 an error to specify default values which are followed by parameters
9638 that have no default values, or an ELLIPSES. For simplicities sake,
9639 only parameters which are specified with their types can take on
9643 grokparms (first_parm
, funcdef_flag
)
9647 tree result
= NULL_TREE
;
9648 tree decls
= NULL_TREE
;
9650 if (first_parm
!= NULL_TREE
9651 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
9654 pedwarn ("parameter names (without types) in function declaration");
9655 last_function_parms
= first_parm
;
9658 else if (first_parm
!= NULL_TREE
9659 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
9660 && TREE_VALUE (first_parm
) != void_type_node
)
9661 my_friendly_abort (145);
9664 /* Types were specified. This is a list of declarators
9665 each represented as a TREE_LIST node. */
9666 register tree parm
, chain
;
9667 int any_init
= 0, any_error
= 0;
9669 if (first_parm
!= NULL_TREE
)
9671 tree last_result
= NULL_TREE
;
9672 tree last_decl
= NULL_TREE
;
9674 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
9676 tree type
, list_node
= parm
;
9677 register tree decl
= TREE_VALUE (parm
);
9678 tree init
= TREE_PURPOSE (parm
);
9680 chain
= TREE_CHAIN (parm
);
9681 /* @@ weak defense against parse errors. */
9682 if (decl
!= void_type_node
&& TREE_CODE (decl
) != TREE_LIST
)
9684 /* Give various messages as the need arises. */
9685 if (TREE_CODE (decl
) == STRING_CST
)
9686 cp_error ("invalid string constant `%E'", decl
);
9687 else if (TREE_CODE (decl
) == INTEGER_CST
)
9688 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
9692 if (decl
!= void_type_node
)
9694 decl
= grokdeclarator (TREE_VALUE (decl
),
9695 TREE_PURPOSE (decl
),
9696 PARM
, init
!= NULL_TREE
,
9700 type
= TREE_TYPE (decl
);
9701 if (TYPE_MAIN_VARIANT (type
) == void_type_node
)
9702 decl
= void_type_node
;
9703 else if (TREE_CODE (type
) == METHOD_TYPE
)
9705 if (DECL_NAME (decl
))
9706 /* Cannot use the decl here because
9707 we don't have DECL_CONTEXT set up yet. */
9708 cp_error ("parameter `%D' invalidly declared method type",
9711 error ("parameter invalidly declared method type");
9712 type
= build_pointer_type (type
);
9713 TREE_TYPE (decl
) = type
;
9715 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9717 if (DECL_NAME (decl
))
9718 cp_error ("parameter `%D' invalidly declared offset type",
9721 error ("parameter invalidly declared offset type");
9722 type
= build_pointer_type (type
);
9723 TREE_TYPE (decl
) = type
;
9725 else if (TREE_CODE (type
) == RECORD_TYPE
9726 && TYPE_LANG_SPECIFIC (type
)
9727 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
9729 abstract_virtuals_error (decl
, type
);
9730 any_error
= 1; /* seems like a good idea */
9732 else if (TREE_CODE (type
) == RECORD_TYPE
9733 && TYPE_LANG_SPECIFIC (type
)
9734 && IS_SIGNATURE (type
))
9736 signature_error (decl
, type
);
9737 any_error
= 1; /* seems like a good idea */
9741 if (decl
== void_type_node
)
9743 if (result
== NULL_TREE
)
9745 result
= void_list_node
;
9746 last_result
= result
;
9750 TREE_CHAIN (last_result
) = void_list_node
;
9751 last_result
= void_list_node
;
9754 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
9755 error ("`void' in parameter list must be entire list");
9759 /* Since there is a prototype, args are passed in their own types. */
9760 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
9761 #ifdef PROMOTE_PROTOTYPES
9762 if ((TREE_CODE (type
) == INTEGER_TYPE
9763 || TREE_CODE (type
) == ENUMERAL_TYPE
)
9764 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
9765 DECL_ARG_TYPE (decl
) = integer_type_node
;
9772 if (TREE_CODE (init
) == SAVE_EXPR
)
9773 PARM_DECL_EXPR (init
) = 1;
9774 else if (processing_template_decl
)
9776 else if (TREE_CODE (init
) == VAR_DECL
9777 || TREE_CODE (init
) == PARM_DECL
)
9779 if (IDENTIFIER_LOCAL_VALUE (DECL_NAME (init
)))
9781 /* ``Local variables may not be used in default
9782 argument expressions.'' dpANSI C++ 8.2.6 */
9783 /* If extern int i; within a function is not
9784 considered a local variable, then this code is
9786 cp_error ("local variable `%D' may not be used as a default argument", init
);
9789 else if (TREE_READONLY_DECL_P (init
))
9790 init
= decl_constant_value (init
);
9793 init
= require_instantiated_type (type
, init
, integer_zero_node
);
9794 if (! processing_template_decl
9795 && ! can_convert_arg (type
, TREE_TYPE (init
), init
))
9796 cp_pedwarn ("invalid type `%T' for default argument to `%#D'",
9797 TREE_TYPE (init
), decl
);
9803 if (decls
== NULL_TREE
)
9810 TREE_CHAIN (last_decl
) = decl
;
9813 if (TREE_PERMANENT (list_node
))
9815 TREE_PURPOSE (list_node
) = init
;
9816 TREE_VALUE (list_node
) = type
;
9817 TREE_CHAIN (list_node
) = NULL_TREE
;
9820 list_node
= saveable_tree_cons (init
, type
, NULL_TREE
);
9821 if (result
== NULL_TREE
)
9824 last_result
= result
;
9828 TREE_CHAIN (last_result
) = list_node
;
9829 last_result
= list_node
;
9833 TREE_CHAIN (last_result
) = NULL_TREE
;
9834 /* If there are no parameters, and the function does not end
9835 with `...', then last_decl will be NULL_TREE. */
9836 if (last_decl
!= NULL_TREE
)
9837 TREE_CHAIN (last_decl
) = NULL_TREE
;
9841 last_function_parms
= decls
;
9843 /* In a fcn definition, arg types must be complete. */
9844 if (funcdef_flag
> 0)
9845 require_complete_types_for_parms (last_function_parms
);
9854 tree t
= FUNCTION_ARG_CHAIN (d
);
9855 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
9856 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
9857 == DECL_CLASS_CONTEXT (d
))
9858 && (TREE_CHAIN (t
) == NULL_TREE
9859 || TREE_CHAIN (t
) == void_list_node
9860 || TREE_PURPOSE (TREE_CHAIN (t
))))
9865 /* These memoizing functions keep track of special properties which
9866 a class may have. `grok_ctor_properties' notices whether a class
9867 has a constructor of the form X(X&), and also complains
9868 if the class has a constructor of the form X(X).
9869 `grok_op_properties' takes notice of the various forms of
9870 operator= which are defined, as well as what sorts of type conversion
9871 may apply. Both functions take a FUNCTION_DECL as an argument. */
9874 grok_ctor_properties (ctype
, decl
)
9877 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
9878 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
9880 /* When a type has virtual baseclasses, a magical first int argument is
9881 added to any ctor so we can tell if the class has been initialized
9882 yet. This could screw things up in this function, so we deliberately
9883 ignore the leading int if we're in that situation. */
9885 && TREE_VALUE (parmtypes
) == integer_type_node
9886 && TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
9888 parmtypes
= TREE_CHAIN (parmtypes
);
9889 parmtype
= TREE_VALUE (parmtypes
);
9892 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
9893 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
)
9895 if (TREE_CHAIN (parmtypes
) == NULL_TREE
9896 || TREE_CHAIN (parmtypes
) == void_list_node
9897 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
9899 TYPE_HAS_INIT_REF (ctype
) = 1;
9900 if (TYPE_READONLY (TREE_TYPE (parmtype
)))
9901 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
9904 TYPE_GETS_INIT_AGGR (ctype
) = 1;
9906 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
)
9908 if (TREE_CHAIN (parmtypes
) != NULL_TREE
9909 && TREE_CHAIN (parmtypes
) == void_list_node
)
9911 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
9913 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
9918 TYPE_GETS_INIT_AGGR (ctype
) = 1;
9920 else if (TREE_CODE (parmtype
) == VOID_TYPE
9921 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
9922 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
9927 /* An operator with this name can be either unary or binary. */
9933 return (name
== ansi_opname
[(int) INDIRECT_REF
]
9934 || name
== ansi_opname
[(int) ADDR_EXPR
]
9935 || name
== ansi_opname
[(int) NEGATE_EXPR
]
9936 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
9937 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
9938 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
9941 /* An operator with this name can only be unary. */
9947 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
9948 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
9949 || name
== ansi_opname
[(int) COMPONENT_REF
]
9950 || OPERATOR_TYPENAME_P (name
));
9953 /* Do a little sanity-checking on how they declared their operator. */
9956 grok_op_properties (decl
, virtualp
, friendp
)
9958 int virtualp
, friendp
;
9960 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9961 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
9962 tree name
= DECL_NAME (decl
);
9964 if (current_class_type
== NULL_TREE
)
9969 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
9970 TYPE_HAS_ASSIGNMENT (current_class_type
) = 1;
9971 else if (name
== ansi_opname
[(int) CALL_EXPR
])
9972 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
9973 else if (name
== ansi_opname
[(int) ARRAY_REF
])
9974 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
9975 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
9976 || name
== ansi_opname
[(int) MEMBER_REF
])
9977 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
9978 else if (name
== ansi_opname
[(int) NEW_EXPR
])
9979 TYPE_GETS_NEW (current_class_type
) |= 1;
9980 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
9981 TYPE_GETS_DELETE (current_class_type
) |= 1;
9982 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
9983 TYPE_GETS_NEW (current_class_type
) |= 2;
9984 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
9985 TYPE_GETS_DELETE (current_class_type
) |= 2;
9988 if (name
== ansi_opname
[(int) NEW_EXPR
]
9989 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
9991 /* When the compiler encounters the definition of A::operator new, it
9992 doesn't look at the class declaration to find out if it's static. */
9994 revert_static_member_fn (&decl
, NULL
, NULL
);
9996 /* Take care of function decl if we had syntax errors. */
9997 if (argtypes
== NULL_TREE
)
9999 build_function_type (ptr_type_node
,
10000 hash_tree_chain (integer_type_node
,
10003 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
10005 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
10006 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10009 revert_static_member_fn (&decl
, NULL
, NULL
);
10011 if (argtypes
== NULL_TREE
)
10013 build_function_type (void_type_node
,
10014 hash_tree_chain (ptr_type_node
,
10018 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
10020 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
10021 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
10022 != void_list_node
))
10023 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
10028 /* An operator function must either be a non-static member function
10029 or have at least one parameter of a class, a reference to a class,
10030 an enumeration, or a reference to an enumeration. 13.4.0.6 */
10031 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
10033 if (OPERATOR_TYPENAME_P (name
)
10034 || name
== ansi_opname
[(int) CALL_EXPR
]
10035 || name
== ansi_opname
[(int) MODIFY_EXPR
]
10036 || name
== ansi_opname
[(int) COMPONENT_REF
]
10037 || name
== ansi_opname
[(int) ARRAY_REF
])
10038 cp_error ("`%D' must be a nonstatic member function", decl
);
10043 if (DECL_STATIC_FUNCTION_P (decl
))
10044 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
10047 for (; TREE_VALUE (p
) != void_type_node
; p
= TREE_CHAIN (p
))
10049 tree arg
= TREE_VALUE (p
);
10050 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
10051 arg
= TREE_TYPE (arg
);
10053 /* This lets bad template code slip through. */
10054 if (IS_AGGR_TYPE (arg
)
10055 || TREE_CODE (arg
) == ENUMERAL_TYPE
10056 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
)
10060 ("`%D' must have an argument of class or enumerated type",
10067 if (name
== ansi_opname
[(int) CALL_EXPR
]
10068 || name
== ansi_opname
[(int) METHOD_CALL_EXPR
])
10069 return; /* no restrictions on args */
10071 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
10073 tree t
= TREE_TYPE (name
);
10074 if (TREE_CODE (t
) == VOID_TYPE
)
10075 pedwarn ("void is not a valid type conversion operator");
10076 else if (! friendp
)
10078 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
10081 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
10083 if (t
== current_class_type
)
10084 what
= "the same type";
10085 /* Don't force t to be complete here. */
10086 else if (IS_AGGR_TYPE (t
)
10088 && DERIVED_FROM_P (t
, current_class_type
))
10089 what
= "a base class";
10092 warning ("conversion to %s%s will never use a type conversion operator",
10093 ref
? "a reference to " : "", what
);
10097 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
10101 if (list_length (argtypes
) != 3 && methodp
)
10103 cp_error ("`%D' must take exactly one argument", decl
);
10106 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
10108 if (copy_assignment_arg_p (parmtype
, virtualp
)
10111 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
10112 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
10113 || TYPE_READONLY (TREE_TYPE (parmtype
)))
10114 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
10117 else if (name
== ansi_opname
[(int) COND_EXPR
])
10120 pedwarn ("ANSI C++ prohibits overloading operator ?:");
10121 if (list_length (argtypes
) != 4)
10122 cp_error ("`%D' must take exactly three arguments", decl
);
10124 else if (ambi_op_p (name
))
10126 if (list_length (argtypes
) == 2)
10128 else if (list_length (argtypes
) == 3)
10130 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
10131 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
10132 && ! processing_template_decl
10133 && TREE_VALUE (TREE_CHAIN (argtypes
)) != integer_type_node
)
10136 cp_error ("postfix `%D' must take `int' as its argument",
10140 ("postfix `%D' must take `int' as its second argument",
10147 cp_error ("`%D' must take either zero or one argument", decl
);
10149 cp_error ("`%D' must take either one or two arguments", decl
);
10152 /* More Effective C++ rule 6. */
10154 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
10155 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
10157 tree arg
= TREE_VALUE (argtypes
);
10158 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
10159 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
10160 arg
= TREE_TYPE (arg
);
10161 arg
= TYPE_MAIN_VARIANT (arg
);
10162 if (list_length (argtypes
) == 2)
10164 if (TREE_CODE (ret
) != REFERENCE_TYPE
10165 || !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
10167 cp_warning ("prefix `%D' should return `%T'", decl
,
10168 build_reference_type (arg
));
10172 if (!comptypes (TYPE_MAIN_VARIANT (ret
), arg
, 1))
10173 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
10177 else if (unary_op_p (name
))
10179 if (list_length (argtypes
) != 2)
10182 cp_error ("`%D' must take `void'", decl
);
10184 cp_error ("`%D' must take exactly one argument", decl
);
10187 else /* if (binary_op_p (name)) */
10189 if (list_length (argtypes
) != 3)
10192 cp_error ("`%D' must take exactly one argument", decl
);
10194 cp_error ("`%D' must take exactly two arguments", decl
);
10197 /* More Effective C++ rule 7. */
10199 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
10200 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
10201 || name
== ansi_opname
[COMPOUND_EXPR
]))
10202 cp_warning ("user-defined `%D' always evaluates both arguments",
10206 /* Effective C++ rule 23. */
10208 && list_length (argtypes
) == 3
10209 && (name
== ansi_opname
[PLUS_EXPR
]
10210 || name
== ansi_opname
[MINUS_EXPR
]
10211 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
10212 || name
== ansi_opname
[MULT_EXPR
])
10213 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
10214 cp_warning ("`%D' should return by value", decl
);
10218 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
10219 if (TREE_PURPOSE (argtypes
))
10221 TREE_PURPOSE (argtypes
) = NULL_TREE
;
10222 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
10223 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
10226 cp_pedwarn ("`%D' cannot have default arguments", decl
);
10229 cp_error ("`%D' cannot have default arguments", decl
);
10234 /* Get the struct, enum or union (CODE says which) with tag NAME.
10235 Define the tag as a forward-reference if it is not defined.
10237 C++: If a class derivation is given, process it here, and report
10238 an error if multiple derivation declarations are not identical.
10240 If this is a definition, come in through xref_tag and only look in
10241 the current frame for the name (since C++ allows new names in any
10245 xref_tag (code_type_node
, name
, binfo
, globalize
)
10246 tree code_type_node
;
10250 enum tag_types tag_code
;
10251 enum tree_code code
;
10253 register tree ref
, t
;
10254 struct binding_level
*b
= inner_binding_level
;
10257 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
10262 case signature_type
:
10263 code
= RECORD_TYPE
;
10269 code
= ENUMERAL_TYPE
;
10272 my_friendly_abort (18);
10275 /* If a cross reference is requested, look up the type
10276 already defined for this tag and return it. */
10277 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
10280 name
= TYPE_IDENTIFIER (t
);
10284 t
= IDENTIFIER_TYPE_VALUE (name
);
10285 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
)
10290 if (pedantic
&& t
&& TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
10292 cp_pedwarn ("redeclaration of template type-parameter `%T'", name
);
10293 cp_pedwarn_at (" previously declared here", t
);
10295 if (t
&& TYPE_CONTEXT (t
) && got_type
)
10299 /* If we know we are defining this tag, only look it up in
10300 this scope and don't try to find it as a type. */
10301 ref
= lookup_tag (code
, name
, b
, 1);
10309 ref
= lookup_tag (code
, name
, b
, 0);
10313 /* Try finding it as a type declaration. If that wins, use it. */
10314 ref
= lookup_name (name
, 1);
10315 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
10316 && TREE_CODE (TREE_TYPE (ref
)) == code
)
10317 ref
= TREE_TYPE (ref
);
10323 push_obstacks_nochange ();
10327 /* If no such tag is yet defined, create a forward-reference node
10328 and record it as the "definition".
10329 When a real declaration of this type is found,
10330 the forward-reference will be altered into a real type. */
10332 /* In C++, since these migrate into the global scope, we must
10333 build them on the permanent obstack. */
10335 temp
= allocation_temporary_p ();
10337 end_temporary_allocation ();
10339 if (code
== ENUMERAL_TYPE
)
10341 cp_error ("use of enum `%#D' without previous declaration", name
);
10343 ref
= make_node (ENUMERAL_TYPE
);
10345 /* Give the type a default layout like unsigned int
10346 to avoid crashing if it does not get defined. */
10347 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
10348 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
10349 TREE_UNSIGNED (ref
) = 1;
10350 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
10351 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
10352 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
10354 /* Enable us to recognize when a type is created in class context.
10355 To do nested classes correctly, this should probably be cleared
10356 out when we leave this classes scope. Currently this in only
10357 done in `start_enum'. */
10359 pushtag (name
, ref
, globalize
);
10363 struct binding_level
*old_b
= class_binding_level
;
10365 ref
= make_lang_type (code
);
10367 if (tag_code
== signature_type
)
10369 SET_SIGNATURE (ref
);
10370 /* Since a signature type will be turned into the type
10371 of signature tables, it's not only an interface. */
10372 CLASSTYPE_INTERFACE_ONLY (ref
) = 0;
10373 SET_CLASSTYPE_INTERFACE_KNOWN (ref
);
10374 /* A signature doesn't have a vtable. */
10375 CLASSTYPE_VTABLE_NEEDS_WRITING (ref
) = 0;
10378 #ifdef NONNESTED_CLASSES
10379 /* Class types don't nest the way enums do. */
10380 class_binding_level
= (struct binding_level
*)0;
10382 pushtag (name
, ref
, globalize
);
10383 class_binding_level
= old_b
;
10388 /* If it no longer looks like a nested type, make sure it's
10389 in global scope. */
10390 if (b
== global_binding_level
&& !class_binding_level
10391 && IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
10392 IDENTIFIER_GLOBAL_VALUE (name
) = TYPE_NAME (ref
);
10396 xref_basetypes (code_type_node
, name
, ref
, binfo
);
10400 /* Until the type is defined, tentatively accept whatever
10401 structure tag the user hands us. */
10402 if (TYPE_SIZE (ref
) == NULL_TREE
10403 && ref
!= current_class_type
10404 /* Have to check this, in case we have contradictory tag info. */
10405 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
10407 if (tag_code
== class_type
)
10408 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
10409 else if (tag_code
== record_type
|| tag_code
== signature_type
)
10410 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
10419 xref_tag_from_type (old
, id
, globalize
)
10423 tree code_type_node
;
10425 if (TREE_CODE (old
) == RECORD_TYPE
)
10426 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
10427 ? class_type_node
: record_type_node
);
10429 code_type_node
= union_type_node
;
10431 if (id
== NULL_TREE
)
10432 id
= TYPE_IDENTIFIER (old
);
10434 return xref_tag (code_type_node
, id
, NULL_TREE
, globalize
);
10438 xref_basetypes (code_type_node
, name
, ref
, binfo
)
10439 tree code_type_node
;
10443 /* In the declaration `A : X, Y, ... Z' we mark all the types
10444 (A, X, Y, ..., Z) so we can check for duplicates. */
10447 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
10449 if (tag_code
== union_type
)
10451 cp_error ("derived union `%T' invalid", ref
);
10455 len
= list_length (binfo
);
10456 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
10458 SET_CLASSTYPE_MARKED (ref
);
10459 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
10461 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
10463 /* The base of a derived struct is public by default. */
10465 = (TREE_PURPOSE (binfo
) == access_public_node
10466 || TREE_PURPOSE (binfo
) == access_public_virtual_node
10467 || (tag_code
!= class_type
10468 && (TREE_PURPOSE (binfo
) == access_default_node
10469 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
10470 int via_protected
= TREE_PURPOSE (binfo
) == access_protected_node
;
10472 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
10473 || TREE_PURPOSE (binfo
) == access_public_virtual_node
10474 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
10475 tree basetype
= TREE_VALUE (binfo
);
10478 GNU_xref_hier (IDENTIFIER_POINTER (name
),
10479 IDENTIFIER_POINTER (TREE_VALUE (binfo
)),
10480 via_public
, via_virtual
, 0);
10482 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
10483 basetype
= TREE_TYPE (basetype
);
10485 || (TREE_CODE (basetype
) != RECORD_TYPE
10486 && TREE_CODE (basetype
) != TYPENAME_TYPE
10487 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
))
10489 cp_error ("base type `%T' fails to be a struct or class type",
10490 TREE_VALUE (binfo
));
10494 /* This code replaces similar code in layout_basetypes. */
10495 else if (TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
10496 && TREE_CODE (basetype
) != TYPENAME_TYPE
10497 && TYPE_SIZE (complete_type (basetype
)) == NULL_TREE
)
10499 cp_error ("base class `%T' has incomplete type", basetype
);
10505 if (CLASSTYPE_MARKED (basetype
))
10507 if (basetype
== ref
)
10508 cp_error ("recursive type `%T' undefined", basetype
);
10510 cp_error ("duplicate base type `%T' invalid", basetype
);
10514 /* Effective C++ rule 14. The case of virtual functions but
10515 non-virtual dtor is handled in finish_struct_1. */
10516 if (warn_nonvdtor
&& ! TYPE_VIRTUAL_P (basetype
)
10517 && TYPE_HAS_DESTRUCTOR (basetype
))
10518 cp_warning ("base class `%#T' has a non-virtual destructor",
10521 /* Note that the BINFO records which describe individual
10522 inheritances are *not* shared in the lattice! They
10523 cannot be shared because a given baseclass may be
10524 inherited with different `accessibility' by different
10525 derived classes. (Each BINFO record describing an
10526 individual inheritance contains flags which say what
10527 the `accessibility' of that particular inheritance is.) */
10529 base_binfo
= make_binfo (integer_zero_node
, basetype
,
10530 TYPE_BINFO_VTABLE (basetype
),
10531 TYPE_BINFO_VIRTUALS (basetype
), NULL_TREE
);
10533 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
10534 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
10535 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
10536 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
10537 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
10539 SET_CLASSTYPE_MARKED (basetype
);
10541 /* We are free to modify these bits because they are meaningless
10542 at top level, and BASETYPE is a top-level type. */
10543 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
10545 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
10546 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
10549 TYPE_OVERLOADS_METHOD_CALL_EXPR (ref
) |= TYPE_OVERLOADS_METHOD_CALL_EXPR (basetype
);
10550 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
10551 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
10552 CLASSTYPE_LOCAL_TYPEDECLS (ref
) |= CLASSTYPE_LOCAL_TYPEDECLS (basetype
);
10557 TREE_VEC_LENGTH (binfos
) = i
;
10559 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
10562 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
10564 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
10565 = TYPE_USES_MULTIPLE_INHERITANCE (BINFO_TYPE (TREE_VEC_ELT (binfos
, 0)));
10566 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
10567 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
10569 /* Unmark all the types. */
10571 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
10572 CLEAR_CLASSTYPE_MARKED (ref
);
10578 static tree current_local_enum
= NULL_TREE
;
10580 /* Begin compiling the definition of an enumeration type.
10581 NAME is its name (or null if anonymous).
10582 Returns the type object, as yet incomplete.
10583 Also records info about it so that build_enumerator
10584 may be used to declare the individual values as they are read. */
10590 register tree enumtype
= NULL_TREE
;
10591 struct binding_level
*b
= inner_binding_level
;
10593 /* If this is the real definition for a previous forward reference,
10594 fill in the contents in the same object that used to be the
10595 forward reference. */
10597 if (name
!= NULL_TREE
)
10598 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
10600 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
10601 cp_error ("multiple definition of `%#T'", enumtype
);
10604 enumtype
= make_node (ENUMERAL_TYPE
);
10605 pushtag (name
, enumtype
, 0);
10608 if (b
->pseudo_global
)
10609 cp_error ("template declaration of `%#T'", enumtype
);
10611 if (current_class_type
)
10612 TREE_ADDRESSABLE (b
->tags
) = 1;
10614 current_local_enum
= NULL_TREE
;
10616 /* We don't copy this value because build_enumerator needs to do it. */
10617 enum_next_value
= integer_zero_node
;
10620 GNU_xref_decl (current_function_decl
, enumtype
);
10624 /* After processing and defining all the values of an enumeration type,
10625 install their decls in the enumeration type and finish it off.
10626 ENUMTYPE is the type object and VALUES a list of name-value pairs.
10627 Returns ENUMTYPE. */
10630 finish_enum (enumtype
, values
)
10631 register tree enumtype
, values
;
10633 register tree minnode
, maxnode
;
10634 /* Calculate the maximum value of any enumerator in this type. */
10638 register tree pair
;
10639 register tree value
= DECL_INITIAL (TREE_VALUE (values
));
10641 if (! processing_template_decl
)
10643 /* Speed up the main loop by performing some precalculations */
10644 TREE_TYPE (TREE_VALUE (values
)) = enumtype
;
10645 TREE_TYPE (value
) = enumtype
;
10646 minnode
= maxnode
= value
;
10648 TREE_VALUE (values
) = value
;
10650 for (pair
= TREE_CHAIN (values
); pair
; pair
= TREE_CHAIN (pair
))
10652 value
= DECL_INITIAL (TREE_VALUE (pair
));
10653 if (! processing_template_decl
)
10655 TREE_TYPE (TREE_VALUE (pair
)) = enumtype
;
10656 TREE_TYPE (value
) = enumtype
;
10657 if (tree_int_cst_lt (maxnode
, value
))
10659 else if (tree_int_cst_lt (value
, minnode
))
10662 TREE_VALUE (pair
) = value
;
10666 maxnode
= minnode
= integer_zero_node
;
10668 TYPE_VALUES (enumtype
) = nreverse (values
);
10670 if (processing_template_decl
)
10674 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
10675 int lowprec
= min_precision (minnode
, unsignedp
);
10676 int highprec
= min_precision (maxnode
, unsignedp
);
10677 int precision
= MAX (lowprec
, highprec
);
10679 TYPE_SIZE (enumtype
) = NULL_TREE
;
10681 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
10683 TYPE_PRECISION (enumtype
) = precision
;
10685 fixup_unsigned_type (enumtype
);
10687 fixup_signed_type (enumtype
);
10689 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
10690 /* Use the width of the narrowest normal C type which is wide enough. */
10691 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
10694 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
10696 TYPE_SIZE (enumtype
) = 0;
10697 layout_type (enumtype
);
10703 /* Fix up all variant types of this enum type. */
10704 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
10705 tem
= TYPE_NEXT_VARIANT (tem
))
10707 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
10708 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
10709 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
10710 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
10711 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
10712 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
10713 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
10714 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
10718 /* Finish debugging output for this type. */
10719 rest_of_type_compilation (enumtype
, global_bindings_p ());
10724 /* Build and install a CONST_DECL for one value of the
10725 current enumeration type (one that was begun with start_enum).
10726 Return a tree-list containing the name and its value.
10727 Assignment of sequential values by default is handled here. */
10730 build_enumerator (name
, value
)
10735 /* Remove no-op casts from the value. */
10737 STRIP_TYPE_NOPS (value
);
10739 if (! processing_template_decl
)
10741 /* Validate and default VALUE. */
10742 if (value
!= NULL_TREE
)
10744 if (TREE_READONLY_DECL_P (value
))
10745 value
= decl_constant_value (value
);
10747 if (TREE_CODE (value
) == INTEGER_CST
)
10749 value
= default_conversion (value
);
10750 constant_expression_warning (value
);
10754 cp_error ("enumerator value for `%D' not integer constant", name
);
10759 /* Default based on previous value. */
10760 if (value
== NULL_TREE
&& ! processing_template_decl
)
10762 value
= enum_next_value
;
10764 cp_error ("overflow in enumeration values at `%D'", name
);
10767 /* Remove no-op casts from the value. */
10769 STRIP_TYPE_NOPS (value
);
10771 /* We have to always copy here; not all INTEGER_CSTs are unshared,
10772 and there's no wedding ring. Look at size_int()...*/
10773 value
= copy_node (value
);
10774 TREE_TYPE (value
) = integer_type_node
;
10777 /* C++ associates enums with global, function, or class declarations. */
10779 decl
= current_scope ();
10780 if (decl
&& decl
== current_class_type
)
10782 /* This enum declaration is local to the class, so we must put
10783 it in that class's list of decls. */
10784 decl
= build_lang_field_decl (CONST_DECL
, name
, integer_type_node
);
10785 DECL_INITIAL (decl
) = value
;
10786 TREE_READONLY (decl
) = 1;
10787 pushdecl_class_level (decl
);
10788 TREE_CHAIN (decl
) = current_local_enum
;
10789 current_local_enum
= decl
;
10793 /* It's a global enum, or it's local to a function. (Note local to
10794 a function could mean local to a class method. */
10795 decl
= build_decl (CONST_DECL
, name
, integer_type_node
);
10796 DECL_INITIAL (decl
) = value
;
10799 GNU_xref_decl (current_function_decl
, decl
);
10802 if (! processing_template_decl
)
10804 /* Set basis for default for next value. */
10805 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
10806 integer_one_node
, PLUS_EXPR
);
10807 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
10810 result
= saveable_tree_cons (name
, decl
, NULL_TREE
);
10815 grok_enum_decls (type
, decl
)
10818 tree d
= current_local_enum
;
10820 if (d
== NULL_TREE
)
10825 TREE_TYPE (d
) = type
;
10826 if (TREE_CHAIN (d
) == NULL_TREE
)
10828 TREE_CHAIN (d
) = decl
;
10831 d
= TREE_CHAIN (d
);
10834 decl
= current_local_enum
;
10835 current_local_enum
= NULL_TREE
;
10840 static int function_depth
;
10842 /* Create the FUNCTION_DECL for a function definition.
10843 DECLSPECS and DECLARATOR are the parts of the declaration;
10844 they describe the function's name and the type it returns,
10845 but twisted together in a fashion that parallels the syntax of C.
10847 This function creates a binding context for the function body
10848 as well as setting up the FUNCTION_DECL in current_function_decl.
10850 Returns 1 on success. If the DECLARATOR is not suitable for a function
10851 (it defines a datum instead), we return 0, which tells
10852 yyparse to report a parse error.
10854 For C++, we must first check whether that datum makes any sense.
10855 For example, "class A local_a(1,2);" means that variable local_a
10856 is an aggregate of type A, which should have a constructor
10857 applied to it with the argument list [1, 2].
10859 @@ There is currently no way to retrieve the storage
10860 @@ allocated to FUNCTION (or all of its parms) if we return
10861 @@ something we had previously. */
10864 start_function (declspecs
, declarator
, attrs
, pre_parsed_p
)
10865 tree declspecs
, declarator
, attrs
;
10869 tree ctype
= NULL_TREE
;
10872 extern int have_extern_spec
;
10873 extern int used_extern_spec
;
10874 int doing_friend
= 0;
10876 /* Sanity check. */
10877 my_friendly_assert (TREE_VALUE (void_list_node
) == void_type_node
, 160);
10878 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
10880 /* Assume, until we see it does. */
10881 current_function_returns_value
= 0;
10882 current_function_returns_null
= 0;
10883 warn_about_return_type
= 0;
10885 shadowed_labels
= 0;
10886 current_function_assigns_this
= 0;
10887 current_function_just_assigned_this
= 0;
10888 current_function_parms_stored
= 0;
10889 original_result_rtx
= NULL_RTX
;
10890 base_init_expr
= NULL_TREE
;
10891 current_base_init_list
= NULL_TREE
;
10892 current_member_init_list
= NULL_TREE
;
10893 ctor_label
= dtor_label
= NULL_TREE
;
10895 clear_temp_name ();
10897 /* This should only be done once on the top most decl. */
10898 if (have_extern_spec
&& !used_extern_spec
)
10900 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
10901 used_extern_spec
= 1;
10906 decl1
= declarator
;
10908 if (! DECL_ARGUMENTS (decl1
)
10909 && !DECL_STATIC_FUNCTION_P (decl1
)
10910 && DECL_CONTEXT (decl1
)
10911 && TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))
10912 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))))
10914 cp_error ("redeclaration of `%#D'", decl1
);
10915 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)))
10916 cp_error_at ("previous declaration here", IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)));
10917 else if (IDENTIFIER_GLOBAL_VALUE (DECL_NAME (decl1
)))
10918 cp_error_at ("previous declaration here", IDENTIFIER_GLOBAL_VALUE (DECL_NAME (decl1
)));
10921 fntype
= TREE_TYPE (decl1
);
10922 if (TREE_CODE (fntype
) == METHOD_TYPE
)
10923 ctype
= TYPE_METHOD_BASETYPE (fntype
);
10925 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
10926 class is in the (lexical) scope of the class in which it is
10928 if (!ctype
&& DECL_FRIEND_P (decl1
))
10930 ctype
= DECL_CLASS_CONTEXT (decl1
);
10932 /* CTYPE could be null here if we're dealing with a template;
10933 for example, `inline friend float foo()' inside a template
10934 will have no CTYPE set. */
10935 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
10941 /* In a fcn definition, arg types must be complete. */
10942 require_complete_types_for_parms (DECL_ARGUMENTS (decl1
));
10944 /* In case some arg types were completed since the declaration was
10945 parsed, fix up the decls. */
10947 tree t
= DECL_ARGUMENTS (decl1
);
10948 for (; t
; t
= TREE_CHAIN (t
))
10949 layout_decl (t
, 0);
10952 last_function_parms
= DECL_ARGUMENTS (decl1
);
10953 last_function_parm_tags
= NULL_TREE
;
10957 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
10958 /* If the declarator is not suitable for a function definition,
10959 cause a syntax error. */
10960 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
10962 fntype
= TREE_TYPE (decl1
);
10964 restype
= TREE_TYPE (fntype
);
10965 if (IS_AGGR_TYPE (restype
) && ! TYPE_PTRMEMFUNC_P (restype
)
10966 && ! CLASSTYPE_GOT_SEMICOLON (restype
))
10968 cp_error ("semicolon missing after declaration of `%#T'", restype
);
10969 shadow_tag (build_tree_list (NULL_TREE
, restype
));
10970 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
10971 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
10972 fntype
= build_function_type (integer_type_node
,
10973 TYPE_ARG_TYPES (fntype
));
10975 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
10977 TYPE_ARG_TYPES (fntype
));
10978 TREE_TYPE (decl1
) = fntype
;
10981 if (TREE_CODE (fntype
) == METHOD_TYPE
)
10982 ctype
= TYPE_METHOD_BASETYPE (fntype
);
10983 else if (IDENTIFIER_LENGTH (DECL_NAME (decl1
)) == 4
10984 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (decl1
)), "main")
10985 && DECL_CONTEXT (decl1
) == NULL_TREE
)
10987 /* If this doesn't return integer_type, complain. */
10988 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
10990 if (pedantic
|| warn_return_type
)
10991 pedwarn ("return type for `main' changed to `int'");
10992 TREE_TYPE (decl1
) = fntype
= default_function_type
;
10994 warn_about_return_type
= 0;
10998 /* Warn if function was previously implicitly declared
10999 (but not if we warned then). */
11000 if (! warn_implicit
11001 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
11002 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
11004 current_function_decl
= decl1
;
11005 /* Save the parm names or decls from this function's declarator
11006 where store_parm_decls will find them. */
11007 current_function_parms
= last_function_parms
;
11008 current_function_parm_tags
= last_function_parm_tags
;
11010 announce_function (decl1
);
11012 if (! processing_template_decl
)
11014 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
11016 cp_error ("return-type `%#T' is an incomplete type",
11017 TREE_TYPE (fntype
));
11019 /* Make it return void instead, but don't change the
11020 type of the DECL_RESULT, in case we have a named return value. */
11023 = build_cplus_method_type (build_type_variant (ctype
,
11024 TREE_READONLY (decl1
),
11025 TREE_SIDE_EFFECTS (decl1
)),
11027 FUNCTION_ARG_CHAIN (decl1
));
11030 = build_function_type (void_type_node
,
11031 TYPE_ARG_TYPES (TREE_TYPE (decl1
)));
11032 DECL_RESULT (decl1
)
11033 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)));
11034 TREE_READONLY (DECL_RESULT (decl1
)) = TYPE_READONLY (TREE_TYPE (fntype
));
11035 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = TYPE_VOLATILE (TREE_TYPE (fntype
));
11038 if (TYPE_LANG_SPECIFIC (TREE_TYPE (fntype
))
11039 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (fntype
)))
11040 abstract_virtuals_error (decl1
, TREE_TYPE (fntype
));
11043 if (warn_about_return_type
)
11044 warning ("return-type defaults to `int'");
11046 /* Effective C++ rule 15. See also c_expand_return. */
11048 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
11049 && TREE_TYPE (fntype
) == void_type_node
)
11050 cp_warning ("`operator=' should return a reference to `*this'");
11052 /* Make the init_value nonzero so pushdecl knows this is not tentative.
11053 error_mark_node is replaced below (in poplevel) with the BLOCK. */
11054 DECL_INITIAL (decl1
) = error_mark_node
;
11056 /* This function exists in static storage.
11057 (This does not mean `static' in the C sense!) */
11058 TREE_STATIC (decl1
) = 1;
11060 /* Record the decl so that the function name is defined.
11061 If we already have a decl for this name, and it is a FUNCTION_DECL,
11062 use the old decl. */
11064 if (processing_template_decl
)
11065 push_template_decl (decl1
);
11066 else if (pre_parsed_p
== 0)
11068 decl1
= pushdecl (decl1
);
11069 DECL_MAIN_VARIANT (decl1
) = decl1
;
11070 fntype
= TREE_TYPE (decl1
);
11073 current_function_decl
= decl1
;
11075 if (DECL_INTERFACE_KNOWN (decl1
))
11077 if (DECL_NOT_REALLY_EXTERN (decl1
))
11078 DECL_EXTERNAL (decl1
) = 0;
11080 /* If this function belongs to an interface, it is public.
11081 If it belongs to someone else's interface, it is also external.
11082 It doesn't matter whether it's inline or not. */
11083 else if (interface_unknown
== 0
11084 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
11085 || flag_alt_external_templates
))
11087 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
11088 || processing_template_decl
)
11089 DECL_EXTERNAL (decl1
)
11091 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
));
11094 DECL_EXTERNAL (decl1
) = 0;
11095 if (DECL_C_STATIC (decl1
))
11096 TREE_PUBLIC (decl1
) = 0;
11098 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
11099 DECL_INTERFACE_KNOWN (decl1
) = 1;
11103 /* This is a definition, not a reference.
11104 So clear DECL_EXTERNAL. */
11105 DECL_EXTERNAL (decl1
) = 0;
11107 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
11108 && ! DECL_INTERFACE_KNOWN (decl1
)
11109 /* Don't try to defer nested functions for now. */
11110 && ! hack_decl_function_context (decl1
))
11111 DECL_DEFER_OUTPUT (decl1
) = 1;
11114 DECL_INTERFACE_KNOWN (decl1
) = 1;
11115 if (DECL_C_STATIC (decl1
))
11116 TREE_PUBLIC (decl1
) = 0;
11120 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
11122 if (TREE_CODE (fntype
) == METHOD_TYPE
)
11123 TREE_TYPE (decl1
) = fntype
11124 = build_function_type (TREE_TYPE (fntype
),
11125 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
11126 current_function_parms
= TREE_CHAIN (current_function_parms
);
11127 DECL_ARGUMENTS (decl1
) = current_function_parms
;
11130 restype
= TREE_TYPE (fntype
);
11134 push_nested_class (ctype
, 1);
11136 /* If we're compiling a friend function, neither of the variables
11137 current_class_ptr nor current_class_type will have values. */
11138 if (! doing_friend
)
11140 /* We know that this was set up by `grokclassfn'.
11141 We do not wait until `store_parm_decls', since evil
11142 parse errors may never get us to that point. Here
11143 we keep the consistency between `current_class_type'
11144 and `current_class_ptr'. */
11145 tree t
= current_function_parms
;
11147 my_friendly_assert (t
!= NULL_TREE
11148 && TREE_CODE (t
) == PARM_DECL
, 162);
11150 if (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
)
11152 int i
= suspend_momentary ();
11154 /* Fool build_indirect_ref. */
11155 current_class_ptr
= NULL_TREE
;
11156 current_class_ref
= build_indirect_ref (t
, NULL_PTR
);
11157 current_class_ptr
= t
;
11158 resume_momentary (i
);
11161 /* We're having a signature pointer here. */
11162 current_class_ref
= current_class_ptr
= t
;
11168 if (DECL_STATIC_FUNCTION_P (decl1
))
11169 push_nested_class (DECL_CONTEXT (decl1
), 2);
11171 push_memoized_context (0, 1);
11172 current_class_ptr
= current_class_ref
= NULL_TREE
;
11176 current_binding_level
->parm_flag
= 1;
11178 GNU_xref_function (decl1
, current_function_parms
);
11181 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
11182 make_function_rtl (decl1
);
11184 /* Promote the value to int before returning it. */
11185 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
11186 restype
= type_promotes_to (restype
);
11188 /* If this fcn was already referenced via a block-scope `extern' decl
11189 (or an implicit decl), propagate certain information about the usage. */
11190 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
11191 TREE_ADDRESSABLE (decl1
) = 1;
11193 if (DECL_RESULT (decl1
) == NULL_TREE
)
11195 DECL_RESULT (decl1
)
11196 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
11197 TREE_READONLY (DECL_RESULT (decl1
)) = TYPE_READONLY (restype
);
11198 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = TYPE_VOLATILE (restype
);
11201 /* Allocate further tree nodes temporarily during compilation
11202 of this function only. Tiemann moved up here from bottom of fn. */
11203 temporary_allocation ();
11205 if (processing_template_decl
)
11207 extern tree last_tree
;
11208 ++minimal_parse_mode
;
11209 last_tree
= DECL_SAVED_TREE (decl1
)
11210 = build_nt (EXPR_STMT
, void_zero_node
);
11215 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
11216 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
11218 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
11219 ctor_label
= NULL_TREE
;
11223 dtor_label
= NULL_TREE
;
11224 if (DECL_CONSTRUCTOR_P (decl1
))
11225 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
11232 store_after_parms (insns
)
11237 for (x
= get_insns (); x
; x
= next_insn (x
))
11239 if (GET_CODE (x
) == NOTE
&& NOTE_LINE_NUMBER (x
) == NOTE_INSN_FUNCTION_BEG
)
11241 emit_insns_after (insns
, x
);
11246 /* This doesn't work, because the inline output routine doesn't reset
11247 last_parm_insn correctly for get_first_nonparm_insn () to work. */
11249 last_parm_insn
= get_first_nonparm_insn ();
11250 if (last_parm_insn
== NULL_RTX
)
11251 emit_insns (insns
);
11253 emit_insns_before (insns
, last_parm_insn
);
11258 expand_start_early_try_stmts ()
11262 expand_start_try_stmts ();
11263 insns
= get_insns ();
11266 emit_insns_after (insns
, get_insns ());
11268 store_after_parms (insns
);
11272 /* Store the parameter declarations into the current function declaration.
11273 This is called after parsing the parameter declarations, before
11274 digesting the body of the function.
11276 Also install to binding contour return value identifier, if any. */
11279 store_parm_decls ()
11281 register tree fndecl
= current_function_decl
;
11282 register tree parm
;
11283 int parms_have_cleanups
= 0;
11285 /* This is either a chain of PARM_DECLs (when a prototype is used). */
11286 tree specparms
= current_function_parms
;
11288 /* This is a list of types declared among parms in a prototype. */
11289 tree parmtags
= current_function_parm_tags
;
11291 /* This is a chain of any other decls that came in among the parm
11292 declarations. If a parm is declared with enum {foo, bar} x;
11293 then CONST_DECLs for foo and bar are put here. */
11294 tree nonparms
= NULL_TREE
;
11296 if (toplevel_bindings_p ())
11297 fatal ("parse errors have confused me too much");
11299 /* Initialize RTL machinery. */
11300 init_function_start (fndecl
, input_filename
, lineno
);
11302 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
11303 declare_function_name ();
11305 /* Create a binding level for the parms. */
11306 expand_start_bindings (0);
11308 if (specparms
!= NULL_TREE
)
11310 /* This case is when the function was defined with an ANSI prototype.
11311 The parms already have decls, so we need not do anything here
11312 except record them as in effect
11313 and complain if any redundant old-style parm decls were written. */
11315 register tree next
;
11317 /* Must clear this because it might contain TYPE_DECLs declared
11319 storedecls (NULL_TREE
);
11321 for (parm
= nreverse (specparms
); parm
; parm
= next
)
11323 next
= TREE_CHAIN (parm
);
11324 if (TREE_CODE (parm
) == PARM_DECL
)
11327 if (DECL_NAME (parm
) == NULL_TREE
)
11331 else if (TYPE_MAIN_VARIANT (TREE_TYPE (parm
)) == void_type_node
)
11332 cp_error ("parameter `%D' declared void", parm
);
11335 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
11336 A parameter is assumed not to have any side effects.
11337 If this should change for any reason, then this
11338 will have to wrap the bashed reference type in a save_expr.
11340 Also, if the parameter type is declared to be an X
11341 and there is an X(X&) constructor, we cannot lay it
11342 into the stack (any more), so we make this parameter
11343 look like it is really of reference type. Functions
11344 which pass parameters to this function will know to
11345 create a temporary in their frame, and pass a reference
11348 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
11349 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
11350 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
11354 if (! processing_template_decl
11355 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
11357 expand_decl (parm
);
11358 if (! expand_decl_cleanup (parm
, cleanup
))
11359 cp_error ("parser lost in parsing declaration of `%D'",
11361 parms_have_cleanups
= 1;
11366 /* If we find an enum constant or a type tag,
11367 put it aside for the moment. */
11368 TREE_CHAIN (parm
) = NULL_TREE
;
11369 nonparms
= chainon (nonparms
, parm
);
11373 /* Get the decls in their original chain order
11374 and record in the function. This is all and only the
11375 PARM_DECLs that were pushed into scope by the loop above. */
11376 DECL_ARGUMENTS (fndecl
) = getdecls ();
11378 storetags (chainon (parmtags
, gettags ()));
11381 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
11383 /* Now store the final chain of decls for the arguments
11384 as the decl-chain of the current lexical scope.
11385 Put the enumerators in as well, at the front so that
11386 DECL_ARGUMENTS is not modified. */
11388 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
11390 /* Initialize the RTL code for the function. */
11391 DECL_SAVED_INSNS (fndecl
) = NULL_RTX
;
11392 if (! processing_template_decl
)
11393 expand_function_start (fndecl
, parms_have_cleanups
);
11395 /* Create a binding contour which can be used to catch
11396 cleanup-generated temporaries. Also, if the return value needs or
11397 has initialization, deal with that now. */
11398 if (parms_have_cleanups
)
11401 expand_start_bindings (0);
11404 current_function_parms_stored
= 1;
11406 /* If this function is `main', emit a call to `__main'
11407 to run global initializers, etc. */
11408 if (DECL_NAME (fndecl
)
11409 && IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 4
11410 && strcmp (IDENTIFIER_POINTER (DECL_NAME (fndecl
)), "main") == 0
11411 && DECL_CONTEXT (fndecl
) == NULL_TREE
)
11413 expand_main_function ();
11416 /* Take care of exception handling things. */
11417 if (! processing_template_decl
&& flag_exceptions
)
11423 /* Mark the start of a stack unwinder if we need one. */
11424 start_eh_unwinder ();
11428 /* Do the starting of the exception specifications, if we have any. */
11429 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
11430 expand_start_eh_spec ();
11433 insns
= get_insns ();
11437 store_after_parms (insns
);
11439 last_dtor_insn
= get_last_insn ();
11442 /* Bind a name and initialization to the return value of
11443 the current function. */
11446 store_return_init (return_id
, init
)
11447 tree return_id
, init
;
11449 tree decl
= DECL_RESULT (current_function_decl
);
11452 /* Give this error as many times as there are occurrences,
11453 so that users can use Emacs compilation buffers to find
11454 and fix all such places. */
11455 pedwarn ("ANSI C++ does not permit named return values");
11457 if (return_id
!= NULL_TREE
)
11459 if (DECL_NAME (decl
) == NULL_TREE
)
11461 DECL_NAME (decl
) = return_id
;
11462 DECL_ASSEMBLER_NAME (decl
) = return_id
;
11465 cp_error ("return identifier `%D' already in place", decl
);
11468 /* Can't let this happen for constructors. */
11469 if (DECL_CONSTRUCTOR_P (current_function_decl
))
11471 error ("can't redefine default return value for constructors");
11475 /* If we have a named return value, put that in our scope as well. */
11476 if (DECL_NAME (decl
) != NULL_TREE
)
11478 /* If this named return value comes in a register,
11479 put it in a pseudo-register. */
11480 if (DECL_REGISTER (decl
))
11482 original_result_rtx
= DECL_RTL (decl
);
11483 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
11486 /* Let `cp_finish_decl' know that this initializer is ok. */
11487 DECL_INITIAL (decl
) = init
;
11490 if (minimal_parse_mode
)
11491 add_tree (build_min_nt (RETURN_INIT
, return_id
,
11492 copy_to_permanent (init
)));
11494 cp_finish_decl (decl
, init
, NULL_TREE
, 0, LOOKUP_ONLYCONVERTING
);
11499 /* Finish up a function declaration and compile that function
11500 all the way to assembler language output. The free the storage
11501 for the function definition.
11503 This is called after parsing the body of the function definition.
11504 LINENO is the current line number.
11506 C++: CALL_POPLEVEL is non-zero if an extra call to poplevel
11507 (and expand_end_bindings) must be made to take care of the binding
11508 contour for the base initializers. This is only relevant for
11511 NESTED is nonzero if we were in the middle of compiling another function
11512 when we started on this one. */
11515 finish_function (lineno
, call_poplevel
, nested
)
11520 register tree fndecl
= current_function_decl
;
11521 tree fntype
, ctype
= NULL_TREE
;
11522 rtx last_parm_insn
, insns
;
11523 /* Label to use if this function is supposed to return a value. */
11524 tree no_return_label
= NULL_TREE
;
11525 tree decls
= NULL_TREE
;
11527 /* When we get some parse errors, we can end up without a
11528 current_function_decl, so cope. */
11529 if (fndecl
== NULL_TREE
)
11532 if (! nested
&& function_depth
> 1)
11535 fntype
= TREE_TYPE (fndecl
);
11537 /* TREE_READONLY (fndecl) = 1;
11538 This caused &foo to be of type ptr-to-const-function
11539 which then got a warning when stored in a ptr-to-function variable. */
11541 /* This happens on strange parse errors. */
11542 if (! current_function_parms_stored
)
11545 store_parm_decls ();
11548 if (processing_template_decl
)
11550 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
11552 decls
= getdecls ();
11553 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
11554 poplevel (decls
!= NULL_TREE
, 0, 0);
11559 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
11561 tree ttype
= target_type (fntype
);
11564 if (IS_AGGR_TYPE (ttype
))
11565 /* Let debugger know it should output info for this type. */
11566 note_debug_info_needed (ttype
);
11568 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
11570 ttype
= target_type (TREE_TYPE (parmdecl
));
11571 if (IS_AGGR_TYPE (ttype
))
11572 /* Let debugger know it should output info for this type. */
11573 note_debug_info_needed (ttype
);
11577 /* Clean house because we will need to reorder insns here. */
11578 do_pending_stack_adjust ();
11582 tree binfo
= TYPE_BINFO (current_class_type
);
11583 tree cond
= integer_one_node
;
11585 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
11587 int ok_to_optimize_dtor
= 0;
11588 int empty_dtor
= get_last_insn () == last_dtor_insn
;
11590 if (current_function_assigns_this
)
11591 cond
= build (NE_EXPR
, boolean_type_node
,
11592 current_class_ptr
, integer_zero_node
);
11595 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
11597 /* If this destructor is empty, then we don't need to check
11598 whether `this' is NULL in some cases. */
11599 if ((flag_this_is_variable
& 1) == 0)
11600 ok_to_optimize_dtor
= 1;
11601 else if (empty_dtor
)
11602 ok_to_optimize_dtor
11603 = (n_baseclasses
== 0
11604 || (n_baseclasses
== 1
11605 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
11608 /* These initializations might go inline. Protect
11609 the binding level of the parms. */
11611 expand_start_bindings (0);
11613 if (current_function_assigns_this
)
11615 current_function_assigns_this
= 0;
11616 current_function_just_assigned_this
= 0;
11619 /* Generate the code to call destructor on base class.
11620 If this destructor belongs to a class with virtual
11621 functions, then set the virtual function table
11622 pointer to represent the type of our base class. */
11624 /* This side-effect makes call to `build_delete' generate the
11625 code we have to have at the end of this destructor. */
11626 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
11628 /* These are two cases where we cannot delegate deletion. */
11629 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
11630 || TYPE_GETS_REG_DELETE (current_class_type
))
11631 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
11632 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
11634 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
11635 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
11637 /* If we did not assign to this, then `this' is non-zero at
11638 the end of a destructor. As a special optimization, don't
11639 emit test if this is an empty destructor. If it does nothing,
11640 it does nothing. If it calls a base destructor, the base
11641 destructor will perform the test. */
11643 if (exprstmt
!= error_mark_node
11644 && (TREE_CODE (exprstmt
) != NOP_EXPR
11645 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
11646 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
11648 expand_label (dtor_label
);
11649 if (cond
!= integer_one_node
)
11650 expand_start_cond (cond
, 0);
11651 if (exprstmt
!= void_zero_node
)
11652 /* Don't call `expand_expr_stmt' if we're not going to do
11653 anything, since -Wall will give a diagnostic. */
11654 expand_expr_stmt (exprstmt
);
11656 /* Run destructor on all virtual baseclasses. */
11657 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
11659 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
11660 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
11661 in_charge_node
, integer_two_node
), 0);
11664 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
11666 tree ptr
= convert_pointer_to_vbase (BINFO_TYPE (vbases
), current_class_ptr
);
11669 (build_pointer_type (BINFO_TYPE (vbases
)),
11670 ptr
, integer_zero_node
,
11671 (LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
11672 |LOOKUP_HAS_IN_CHARGE
|LOOKUP_NORMAL
),
11675 vbases
= TREE_CHAIN (vbases
);
11677 expand_end_cond ();
11680 do_pending_stack_adjust ();
11681 if (cond
!= integer_one_node
)
11682 expand_end_cond ();
11685 TYPE_HAS_DESTRUCTOR (current_class_type
) = 1;
11687 virtual_size
= c_sizeof (current_class_type
);
11689 /* At the end, call delete if that's what's requested. */
11690 if (TYPE_GETS_REG_DELETE (current_class_type
))
11691 /* This NOP_EXPR means we are in a static call context. */
11694 (build_indirect_ref
11695 (build1 (NOP_EXPR
, build_pointer_type (current_class_type
),
11698 ansi_opname
[(int) DELETE_EXPR
],
11699 tree_cons (NULL_TREE
, current_class_ptr
,
11700 build_tree_list (NULL_TREE
, virtual_size
)),
11701 NULL_TREE
, LOOKUP_NORMAL
);
11702 else if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
11703 exprstmt
= build_x_delete (ptr_type_node
, current_class_ptr
, 0,
11706 exprstmt
= NULL_TREE
;
11710 cond
= build (BIT_AND_EXPR
, integer_type_node
,
11711 in_charge_node
, integer_one_node
);
11712 expand_start_cond (cond
, 0);
11713 expand_expr_stmt (exprstmt
);
11714 expand_end_cond ();
11717 /* End of destructor. */
11718 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
11719 poplevel (2, 0, 0); /* XXX change to 1 */
11721 /* Back to the top of destructor. */
11722 /* Dont execute destructor code if `this' is NULL. */
11726 /* If the dtor is empty, and we know there is not possible way we
11727 could use any vtable entries, before they are possibly set by
11728 a base class dtor, we don't have to setup the vtables, as we
11729 know that any base class dtoring will set up any vtables it
11730 needs. We avoid MI, because one base class dtor can do a
11731 virtual dispatch to an overridden function that would need to
11732 have a non-related vtable set up, we cannot avoid setting up
11733 vtables in that case. We could change this to see if there is
11734 just one vtable. */
11735 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
11737 /* Make all virtual function table pointers in non-virtual base
11738 classes point to CURRENT_CLASS_TYPE's virtual function
11740 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
11742 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
11743 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
11746 if (! ok_to_optimize_dtor
)
11748 cond
= build_binary_op (NE_EXPR
,
11749 current_class_ptr
, integer_zero_node
, 1);
11750 expand_start_cond (cond
, 0);
11753 insns
= get_insns ();
11756 last_parm_insn
= get_first_nonparm_insn ();
11757 if (last_parm_insn
== NULL_RTX
)
11758 last_parm_insn
= get_last_insn ();
11760 last_parm_insn
= previous_insn (last_parm_insn
);
11762 emit_insns_after (insns
, last_parm_insn
);
11764 if (! ok_to_optimize_dtor
)
11765 expand_end_cond ();
11767 else if (current_function_assigns_this
)
11769 /* Does not need to call emit_base_init, because
11770 that is done (if needed) just after assignment to this
11773 if (DECL_CONSTRUCTOR_P (current_function_decl
))
11775 end_protect_partials ();
11776 expand_label (ctor_label
);
11777 ctor_label
= NULL_TREE
;
11781 decls
= getdecls ();
11782 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
11783 poplevel (decls
!= NULL_TREE
, 0, 0);
11785 c_expand_return (current_class_ptr
);
11787 else if (TYPE_MAIN_VARIANT (TREE_TYPE (
11788 DECL_RESULT (current_function_decl
))) != void_type_node
11789 && return_label
!= NULL_RTX
)
11790 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
11792 current_function_assigns_this
= 0;
11793 current_function_just_assigned_this
= 0;
11794 base_init_expr
= NULL_TREE
;
11796 else if (DECL_CONSTRUCTOR_P (fndecl
))
11798 tree cond
, thenclause
;
11799 /* Allow constructor for a type to get a new instance of the object
11800 using `build_new'. */
11801 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
11802 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
11804 DECL_RETURNS_FIRST_ARG (fndecl
) = 1;
11806 if (flag_this_is_variable
> 0)
11808 cond
= build_binary_op (EQ_EXPR
,
11809 current_class_ptr
, integer_zero_node
, 1);
11810 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
11811 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
11814 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
11818 if (flag_this_is_variable
> 0)
11820 expand_start_cond (cond
, 0);
11821 expand_expr_stmt (thenclause
);
11822 expand_end_cond ();
11825 /* Emit insns from `emit_base_init' which sets up virtual
11826 function table pointer(s). */
11827 if (base_init_expr
)
11829 expand_expr_stmt (base_init_expr
);
11830 base_init_expr
= NULL_TREE
;
11833 insns
= get_insns ();
11836 /* This is where the body of the constructor begins.
11837 If there were no insns in this function body, then the
11838 last_parm_insn is also the last insn.
11840 If optimization is enabled, last_parm_insn may move, so
11841 we don't hold on to it (across emit_base_init). */
11842 last_parm_insn
= get_first_nonparm_insn ();
11843 if (last_parm_insn
== NULL_RTX
)
11844 last_parm_insn
= get_last_insn ();
11846 last_parm_insn
= previous_insn (last_parm_insn
);
11848 emit_insns_after (insns
, last_parm_insn
);
11850 end_protect_partials ();
11852 /* This is where the body of the constructor ends. */
11853 expand_label (ctor_label
);
11854 ctor_label
= NULL_TREE
;
11858 decls
= getdecls ();
11859 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
11860 poplevel (decls
!= NULL_TREE
, 1, 0);
11863 c_expand_return (current_class_ptr
);
11865 current_function_assigns_this
= 0;
11866 current_function_just_assigned_this
= 0;
11868 else if (IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 4
11869 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (fndecl
)), "main")
11870 && DECL_CONTEXT (fndecl
) == NULL_TREE
)
11872 /* Make it so that `main' always returns 0 by default. */
11874 c_expand_return (integer_one_node
);
11876 c_expand_return (integer_zero_node
);
11879 else if (return_label
!= NULL_RTX
11880 && current_function_return_value
== NULL_TREE
11881 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
11882 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
11884 /* If this function is supposed to return a value, ensure that
11885 we do not fall into the cleanups by mistake. The end of our
11886 function will look like this:
11888 user code (may have return stmt somewhere)
11889 goto no_return_label
11894 NOTE_INSN_FUNCTION_END
11898 If the user omits a return stmt in the USER CODE section, we
11899 will have a control path which reaches NOTE_INSN_FUNCTION_END.
11900 Otherwise, we won't. */
11901 if (no_return_label
)
11903 DECL_CONTEXT (no_return_label
) = fndecl
;
11904 DECL_INITIAL (no_return_label
) = error_mark_node
;
11905 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
11906 DECL_SOURCE_LINE (no_return_label
) = lineno
;
11907 expand_goto (no_return_label
);
11912 /* remove the binding contour which is used
11913 to catch cleanup-generated temporaries. */
11914 expand_end_bindings (0, 0, 0);
11915 poplevel (0, 0, 0);
11919 /* Emit label at beginning of cleanup code for parameters. */
11920 emit_label (cleanup_label
);
11922 /* Get return value into register if that's where it's supposed to be. */
11923 if (original_result_rtx
)
11924 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
11926 /* Finish building code that will trigger warnings if users forget
11927 to make their functions return values. */
11928 if (no_return_label
|| cleanup_label
)
11929 emit_jump (return_label
);
11930 if (no_return_label
)
11932 /* We don't need to call `expand_*_return' here because we
11933 don't need any cleanups here--this path of code is only
11934 for error checking purposes. */
11935 expand_label (no_return_label
);
11938 /* Generate rtl for function exit. */
11939 expand_function_end (input_filename
, lineno
, 1);
11941 if (flag_exceptions
)
11942 expand_exception_blocks ();
11945 /* This must come after expand_function_end because cleanups might
11946 have declarations (from inline functions) that need to go into
11947 this function's blocks. */
11948 if (current_binding_level
->parm_flag
!= 1)
11949 my_friendly_abort (122);
11950 poplevel (1, 0, 1);
11952 /* reset scope for C++: if we were in the scope of a class,
11953 then when we finish this function, we are not longer so.
11954 This cannot be done until we know for sure that no more
11955 class members will ever be referenced in this function
11956 (i.e., calls to destructors). */
11957 if (current_class_name
)
11959 ctype
= current_class_type
;
11960 pop_nested_class (1);
11963 pop_memoized_context (1);
11965 /* Must mark the RESULT_DECL as being in this function. */
11966 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
11968 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
11969 to the FUNCTION_DECL node itself. */
11970 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
11972 if (! processing_template_decl
)
11974 /* So we can tell if jump_optimize sets it to 1. */
11977 /* Run the optimizers and output the assembler code for this function. */
11978 rest_of_compilation (fndecl
);
11980 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
11982 /* Set DECL_EXTERNAL so that assemble_external will be called as
11983 necessary. We'll clear it again in finish_file. */
11984 if (! DECL_EXTERNAL (fndecl
))
11985 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
11986 DECL_EXTERNAL (fndecl
) = 1;
11987 mark_inline_for_output (fndecl
);
11990 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
11991 note_debug_info_needed (ctype
);
11993 current_function_returns_null
|= can_reach_end
;
11995 /* Since we don't normally go through c_expand_return for constructors,
11996 this normally gets the wrong value.
11997 Also, named return values have their return codes emitted after
11998 NOTE_INSN_FUNCTION_END, confusing jump.c. */
11999 if (DECL_CONSTRUCTOR_P (fndecl
)
12000 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
12001 current_function_returns_null
= 0;
12003 if (TREE_THIS_VOLATILE (fndecl
) && current_function_returns_null
)
12004 cp_warning ("`noreturn' function `%D' does return", fndecl
);
12005 else if ((warn_return_type
|| pedantic
)
12006 && current_function_returns_null
12007 && TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)) != void_type_node
)
12009 /* If this function returns non-void and control can drop through,
12011 cp_pedwarn ("control reaches end of non-void function `%D'", fndecl
);
12013 /* With just -W, complain only if function returns both with
12014 and without a value. */
12015 else if (extra_warnings
12016 && current_function_returns_value
&& current_function_returns_null
)
12017 warning ("this function may return with or without a value");
12022 /* Free all the tree nodes making up this function. */
12023 /* Switch back to allocating nodes permanently
12024 until we start another function. */
12025 if (processing_template_decl
)
12027 --minimal_parse_mode
;
12028 DECL_SAVED_TREE (fndecl
) = TREE_CHAIN (DECL_SAVED_TREE (fndecl
));
12032 permanent_allocation (1);
12034 if (DECL_SAVED_INSNS (fndecl
) == NULL_RTX
)
12038 /* Stop pointing to the local nodes about to be freed. */
12039 /* But DECL_INITIAL must remain nonzero so we know this
12040 was an actual function definition. */
12041 DECL_INITIAL (fndecl
) = error_mark_node
;
12042 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
12043 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
12046 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
12047 static_ctors
= perm_tree_cons (NULL_TREE
, fndecl
, static_ctors
);
12048 if (DECL_STATIC_DESTRUCTOR (fndecl
))
12049 static_dtors
= perm_tree_cons (NULL_TREE
, fndecl
, static_dtors
);
12053 /* Let the error reporting routines know that we're outside a
12054 function. For a nested function, this value is used in
12055 pop_cp_function_context and then reset via pop_function_context. */
12056 current_function_decl
= NULL_TREE
;
12059 named_label_uses
= NULL
;
12060 current_class_ptr
= NULL_TREE
;
12061 current_class_ref
= NULL_TREE
;
12064 /* Create the FUNCTION_DECL for a function definition.
12065 LINE1 is the line number that the definition absolutely begins on.
12066 LINE2 is the line number that the name of the function appears on.
12067 DECLSPECS and DECLARATOR are the parts of the declaration;
12068 they describe the return type and the name of the function,
12069 but twisted together in a fashion that parallels the syntax of C.
12071 This function creates a binding context for the function body
12072 as well as setting up the FUNCTION_DECL in current_function_decl.
12074 Returns a FUNCTION_DECL on success.
12076 If the DECLARATOR is not suitable for a function (it defines a datum
12077 instead), we return 0, which tells yyparse to report a parse error.
12079 May return void_type_node indicating that this method is actually
12080 a friend. See grokfield for more details.
12082 Came here with a `.pushlevel' .
12084 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
12085 CHANGES TO CODE IN `grokfield'. */
12088 start_method (declspecs
, declarator
)
12089 tree declarator
, declspecs
;
12091 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
12094 /* Something too ugly to handle. */
12095 if (fndecl
== NULL_TREE
)
12098 /* Pass friends other than inline friend functions back. */
12099 if (TYPE_MAIN_VARIANT (fndecl
) == void_type_node
)
12102 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
12103 /* Not a function, tell parser to report parse error. */
12106 if (IS_SIGNATURE (current_class_type
))
12107 IS_DEFAULT_IMPLEMENTATION (fndecl
) = 1;
12109 if (DECL_IN_AGGR_P (fndecl
))
12111 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
12113 if (DECL_CONTEXT (fndecl
))
12114 cp_error ("`%D' is already defined in class %s", fndecl
,
12115 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
12117 return void_type_node
;
12120 DECL_THIS_INLINE (fndecl
) = 1;
12122 if (flag_default_inline
)
12123 DECL_INLINE (fndecl
) = 1;
12125 if (processing_template_decl
&& ! current_function_decl
)
12126 push_template_decl (fndecl
);
12128 /* We read in the parameters on the maybepermanent_obstack,
12129 but we won't be getting back to them until after we
12130 may have clobbered them. So the call to preserve_data
12131 will keep them safe. */
12134 if (! DECL_FRIEND_P (fndecl
))
12136 if (DECL_CHAIN (fndecl
) != NULL_TREE
)
12138 /* Need a fresh node here so that we don't get circularity
12139 when we link these together. If FNDECL was a friend, then
12140 `pushdecl' does the right thing, which is nothing wrt its
12141 current value of DECL_CHAIN. */
12142 fndecl
= copy_node (fndecl
);
12144 if (TREE_CHAIN (fndecl
))
12146 fndecl
= copy_node (fndecl
);
12147 TREE_CHAIN (fndecl
) = NULL_TREE
;
12150 if (DECL_CONSTRUCTOR_P (fndecl
))
12152 if (! grok_ctor_properties (current_class_type
, fndecl
))
12153 return void_type_node
;
12155 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
12156 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
12159 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
12161 /* Make a place for the parms */
12163 current_binding_level
->parm_flag
= 1;
12165 DECL_IN_AGGR_P (fndecl
) = 1;
12169 /* Go through the motions of finishing a function definition.
12170 We don't compile this method until after the whole class has
12173 FINISH_METHOD must return something that looks as though it
12174 came from GROKFIELD (since we are defining a method, after all).
12176 This is called after parsing the body of the function definition.
12177 STMTS is the chain of statements that makes up the function body.
12179 DECL is the ..._DECL that `start_method' provided. */
12182 finish_method (decl
)
12185 register tree fndecl
= decl
;
12188 register tree link
;
12190 if (TYPE_MAIN_VARIANT (decl
) == void_type_node
)
12193 old_initial
= DECL_INITIAL (fndecl
);
12195 /* Undo the level for the parms (from start_method).
12196 This is like poplevel, but it causes nothing to be
12197 saved. Saving information here confuses symbol-table
12198 output routines. Besides, this information will
12199 be correctly output when this method is actually
12202 /* Clear out the meanings of the local variables of this level;
12203 also record in each decl which block it belongs to. */
12205 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
12207 if (DECL_NAME (link
) != NULL_TREE
)
12208 IDENTIFIER_LOCAL_VALUE (DECL_NAME (link
)) = 0;
12209 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
12210 DECL_CONTEXT (link
) = NULL_TREE
;
12213 /* Restore all name-meanings of the outer levels
12214 that were shadowed by this level. */
12216 for (link
= current_binding_level
->shadowed
; link
; link
= TREE_CHAIN (link
))
12217 IDENTIFIER_LOCAL_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
12218 for (link
= current_binding_level
->class_shadowed
;
12219 link
; link
= TREE_CHAIN (link
))
12220 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
12221 for (link
= current_binding_level
->type_shadowed
;
12222 link
; link
= TREE_CHAIN (link
))
12223 IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
)) = TREE_VALUE (link
);
12225 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
12226 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
12227 current_binding_level
->parm_flag
,
12228 current_binding_level
->keep
);
12230 poplevel (0, 0, 0);
12232 DECL_INITIAL (fndecl
) = old_initial
;
12234 /* We used to check if the context of FNDECL was different from
12235 current_class_type as another way to get inside here. This didn't work
12236 for String.cc in libg++. */
12237 if (DECL_FRIEND_P (fndecl
))
12239 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
12240 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
12241 decl
= void_type_node
;
12247 /* Called when a new struct TYPE is defined.
12248 If this structure or union completes the type of any previous
12249 variable declaration, lay it out and output its rtl. */
12252 hack_incomplete_structures (type
)
12257 if (current_binding_level
->incomplete
== NULL_TREE
)
12260 if (!type
) /* Don't do this for class templates. */
12263 for (list
= ¤t_binding_level
->incomplete
; *list
; )
12265 tree decl
= TREE_VALUE (*list
);
12266 if (decl
&& TREE_TYPE (decl
) == type
12267 || (TREE_TYPE (decl
)
12268 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
12269 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
12271 int toplevel
= toplevel_bindings_p ();
12272 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
12273 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
12274 layout_type (TREE_TYPE (decl
));
12275 layout_decl (decl
, 0);
12276 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
12280 expand_decl (decl
);
12281 cleanup
= maybe_build_cleanup (decl
);
12282 expand_decl_init (decl
);
12283 if (! expand_decl_cleanup (decl
, cleanup
))
12284 cp_error ("parser lost in parsing declaration of `%D'",
12287 *list
= TREE_CHAIN (*list
);
12290 list
= &TREE_CHAIN (*list
);
12294 /* If DECL is of a type which needs a cleanup, build that cleanup here.
12295 See build_delete for information about AUTO_DELETE.
12297 Don't build these on the momentary obstack; they must live
12298 the life of the binding contour. */
12301 maybe_build_cleanup_1 (decl
, auto_delete
)
12302 tree decl
, auto_delete
;
12304 tree type
= TREE_TYPE (decl
);
12305 if (TYPE_NEEDS_DESTRUCTOR (type
))
12307 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
12310 if (TREE_CODE (decl
) != PARM_DECL
)
12311 temp
= suspend_momentary ();
12313 if (TREE_CODE (type
) == ARRAY_TYPE
)
12317 mark_addressable (decl
);
12318 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
12321 /* Optimize for space over speed here. */
12322 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
12323 || flag_expensive_optimizations
)
12324 flags
|= LOOKUP_NONVIRTUAL
;
12326 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
12328 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
12329 && ! TYPE_HAS_DESTRUCTOR (type
))
12330 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
12331 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
12333 /* Since this is a cleanup, UNSAVE it now. */
12334 rval
= unsave_expr (rval
);
12336 if (TREE_CODE (decl
) != PARM_DECL
)
12337 resume_momentary (temp
);
12344 /* If DECL is of a type which needs a cleanup, build that cleanup
12345 here. The cleanup does free the storage with a call to delete. */
12348 maybe_build_cleanup_and_delete (decl
)
12351 return maybe_build_cleanup_1 (decl
, integer_three_node
);
12354 /* If DECL is of a type which needs a cleanup, build that cleanup
12355 here. The cleanup does not free the storage with a call a delete. */
12358 maybe_build_cleanup (decl
)
12361 return maybe_build_cleanup_1 (decl
, integer_two_node
);
12364 /* Expand a C++ expression at the statement level.
12365 This is needed to ferret out nodes which have UNKNOWN_TYPE.
12366 The C++ type checker should get all of these out when
12367 expressions are combined with other, type-providing, expressions,
12368 leaving only orphan expressions, such as:
12370 &class::bar; / / takes its address, but does nothing with it. */
12373 cplus_expand_expr_stmt (exp
)
12376 extern int temp_slot_level
;
12377 extern int target_temp_slot_level
;
12378 tree old_cleanups
= cleanups_this_call
;
12379 int old_temp_level
= target_temp_slot_level
;
12380 push_temp_slots ();
12381 push_temp_slots ();
12382 target_temp_slot_level
= temp_slot_level
;
12384 if (processing_template_decl
)
12386 add_tree (build_min_nt (EXPR_STMT
, exp
));
12390 if (TREE_TYPE (exp
) == unknown_type_node
)
12392 if (TREE_CODE (exp
) == ADDR_EXPR
|| TREE_CODE (exp
) == TREE_LIST
)
12393 error ("address of overloaded function with no contextual type information");
12394 else if (TREE_CODE (exp
) == COMPONENT_REF
)
12395 warning ("useless reference to a member function name, did you forget the ()?");
12399 if (TREE_CODE (exp
) == FUNCTION_DECL
)
12401 cp_warning ("reference, not call, to function `%D'", exp
);
12402 warning ("at this point in file");
12406 /* We should do this eventually, but right now this causes regex.o from
12407 libg++ to miscompile, and tString to core dump. */
12408 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
12410 /* If we don't do this, we end up down inside expand_expr
12411 trying to do TYPE_MODE on the ERROR_MARK, and really
12412 go outside the bounds of the type. */
12413 if (exp
!= error_mark_node
)
12414 expand_expr_stmt (break_out_cleanups (exp
));
12417 /* Clean up any pending cleanups. This happens when a function call
12418 returns a cleanup-needing value that nobody uses. */
12419 expand_cleanups_to (old_cleanups
);
12422 target_temp_slot_level
= old_temp_level
;
12423 /* There might something left from building the trees. */
12424 if (cleanups_this_call
)
12426 expand_cleanups_to (NULL_TREE
);
12428 free_temp_slots ();
12431 /* When a stmt has been parsed, this function is called.
12433 Currently, this function only does something within a
12434 constructor's scope: if a stmt has just assigned to this,
12435 and we are in a derived class, we call `emit_base_init'. */
12440 extern struct nesting
*cond_stack
, *loop_stack
, *case_stack
;
12443 if (current_function_assigns_this
12444 || ! current_function_just_assigned_this
)
12446 if (DECL_CONSTRUCTOR_P (current_function_decl
))
12448 /* Constructors must wait until we are out of control
12449 zones before calling base constructors. */
12450 if (cond_stack
|| loop_stack
|| case_stack
)
12452 expand_expr_stmt (base_init_expr
);
12453 check_base_init (current_class_type
);
12455 current_function_assigns_this
= 1;
12458 /* Change a static member function definition into a FUNCTION_TYPE, instead
12459 of the METHOD_TYPE that we create when it's originally parsed.
12461 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
12462 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
12463 other decls. Either pass the addresses of local variables or NULL. */
12466 revert_static_member_fn (decl
, fn
, argtypes
)
12467 tree
*decl
, *fn
, *argtypes
;
12470 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
12471 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
12473 if (TYPE_READONLY (TREE_TYPE (TREE_VALUE (args
))))
12474 cp_error ("static member function `%#D' declared const", *decl
);
12475 if (TYPE_VOLATILE (TREE_TYPE (TREE_VALUE (args
))))
12476 cp_error ("static member function `%#D' declared volatile", *decl
);
12478 args
= TREE_CHAIN (args
);
12479 tmp
= build_function_type (TREE_TYPE (function
), args
);
12480 tmp
= build_type_variant (tmp
, TYPE_READONLY (function
),
12481 TYPE_VOLATILE (function
));
12482 tmp
= build_exception_variant (tmp
,
12483 TYPE_RAISES_EXCEPTIONS (function
));
12484 TREE_TYPE (*decl
) = tmp
;
12485 if (DECL_ARGUMENTS (*decl
))
12486 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
12487 DECL_STATIC_FUNCTION_P (*decl
) = 1;
12495 id_in_current_class (id
)
12498 return !!purpose_member (id
, class_binding_level
->class_shadowed
);
12505 int warn_about_return_type
;
12507 int just_assigned_this
;
12509 int temp_name_counter
;
12511 tree shadowed_labels
;
12514 rtx last_dtor_insn
;
12515 tree base_init_list
;
12516 tree member_init_list
;
12517 tree base_init_expr
;
12518 tree current_class_ptr
;
12519 tree current_class_ref
;
12521 struct cp_function
*next
;
12522 struct binding_level
*binding_level
;
12527 struct cp_function
*cp_function_chain
;
12529 extern int temp_name_counter
;
12531 /* Save and reinitialize the variables
12532 used during compilation of a C++ function. */
12535 push_cp_function_context (context
)
12538 struct cp_function
*p
12539 = (struct cp_function
*) xmalloc (sizeof (struct cp_function
));
12541 push_function_context_to (context
);
12543 p
->next
= cp_function_chain
;
12544 cp_function_chain
= p
;
12546 p
->named_labels
= named_labels
;
12547 p
->shadowed_labels
= shadowed_labels
;
12548 p
->returns_value
= current_function_returns_value
;
12549 p
->returns_null
= current_function_returns_null
;
12550 p
->warn_about_return_type
= warn_about_return_type
;
12551 p
->binding_level
= current_binding_level
;
12552 p
->ctor_label
= ctor_label
;
12553 p
->dtor_label
= dtor_label
;
12554 p
->last_dtor_insn
= last_dtor_insn
;
12555 p
->assigns_this
= current_function_assigns_this
;
12556 p
->just_assigned_this
= current_function_just_assigned_this
;
12557 p
->parms_stored
= current_function_parms_stored
;
12558 p
->result_rtx
= original_result_rtx
;
12559 p
->base_init_expr
= base_init_expr
;
12560 p
->temp_name_counter
= temp_name_counter
;
12561 p
->base_init_list
= current_base_init_list
;
12562 p
->member_init_list
= current_member_init_list
;
12563 p
->current_class_ptr
= current_class_ptr
;
12564 p
->current_class_ref
= current_class_ref
;
12567 /* Restore the variables used during compilation of a C++ function. */
12570 pop_cp_function_context (context
)
12573 struct cp_function
*p
= cp_function_chain
;
12576 /* Bring back all the labels that were shadowed. */
12577 for (link
= shadowed_labels
; link
; link
= TREE_CHAIN (link
))
12578 if (DECL_NAME (TREE_VALUE (link
)) != 0)
12579 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link
)),
12580 TREE_VALUE (link
));
12582 pop_function_context_from (context
);
12584 cp_function_chain
= p
->next
;
12586 named_labels
= p
->named_labels
;
12587 shadowed_labels
= p
->shadowed_labels
;
12588 current_function_returns_value
= p
->returns_value
;
12589 current_function_returns_null
= p
->returns_null
;
12590 warn_about_return_type
= p
->warn_about_return_type
;
12591 current_binding_level
= p
->binding_level
;
12592 ctor_label
= p
->ctor_label
;
12593 dtor_label
= p
->dtor_label
;
12594 last_dtor_insn
= p
->last_dtor_insn
;
12595 current_function_assigns_this
= p
->assigns_this
;
12596 current_function_just_assigned_this
= p
->just_assigned_this
;
12597 current_function_parms_stored
= p
->parms_stored
;
12598 original_result_rtx
= p
->result_rtx
;
12599 base_init_expr
= p
->base_init_expr
;
12600 temp_name_counter
= p
->temp_name_counter
;
12601 current_base_init_list
= p
->base_init_list
;
12602 current_member_init_list
= p
->member_init_list
;
12603 current_class_ptr
= p
->current_class_ptr
;
12604 current_class_ref
= p
->current_class_ref
;
12612 return function_depth
!= 0;
12615 /* FSF LOCAL dje prefix attributes */
12616 /* Strip attributes from SPECS_ATTRS, a list of declspecs and attributes.
12617 This function is used by the parser when a rule will accept attributes
12618 in a particular position, but we don't want to support that just yet.
12620 A warning is issued for every ignored attribute. */
12623 strip_attrs (specs_attrs
)
12628 split_specs_attrs (specs_attrs
, &specs
, &attrs
);
12632 warning ("`%s' attribute ignored",
12633 IDENTIFIER_POINTER (TREE_PURPOSE (attrs
)));
12634 attrs
= TREE_CHAIN (attrs
);
12639 /* END FSF LOCAL */