1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-98, 1999 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Process declarations and symbol lookup for C front end.
24 Also constructs types; the standard scalar types at initialization,
25 and structure, union, array and enum types when they are declared. */
27 /* ??? not all decl nodes are given the most useful possible
28 line numbers. For example, the CONST_DECLs for enum values. */
48 #define obstack_chunk_alloc xmalloc
49 #define obstack_chunk_free free
51 extern struct obstack permanent_obstack
;
52 extern struct obstack
* saveable_obstack
;
54 extern int current_class_depth
;
56 extern tree static_ctors
, static_dtors
;
58 extern tree global_namespace
;
60 extern int (*valid_lang_attribute
) PROTO ((tree
, tree
, tree
, tree
));
62 /* Use garbage collection. */
66 #ifndef WCHAR_UNSIGNED
67 #define WCHAR_UNSIGNED 0
70 #ifndef CHAR_TYPE_SIZE
71 #define CHAR_TYPE_SIZE BITS_PER_UNIT
74 #ifndef BOOL_TYPE_SIZE
75 #ifdef SLOW_BYTE_ACCESS
76 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
78 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
82 /* We let tm.h override the types used here, to handle trivial differences
83 such as the choice of unsigned int or long unsigned int for size_t.
84 When machines start needing nontrivial differences in the size type,
85 it would be best to do something here to figure out automatically
86 from other information what type to use. */
89 #define SIZE_TYPE "long unsigned int"
93 #define PTRDIFF_TYPE "long int"
97 #define WCHAR_TYPE "int"
100 static tree grokparms
PROTO((tree
, int));
101 static const char *redeclaration_error_message
PROTO((tree
, tree
));
103 static void push_binding_level
PROTO((struct binding_level
*, int,
105 static void pop_binding_level
PROTO((void));
106 static void suspend_binding_level
PROTO((void));
107 static void resume_binding_level
PROTO((struct binding_level
*));
108 static struct binding_level
*make_binding_level
PROTO((void));
109 static void declare_namespace_level
PROTO((void));
110 static void signal_catch
PROTO((int)) ATTRIBUTE_NORETURN
;
111 static void storedecls
PROTO((tree
));
112 static void require_complete_types_for_parms
PROTO((tree
));
113 static void push_overloaded_decl_1
PROTO((tree
));
114 static int ambi_op_p
PROTO((tree
));
115 static int unary_op_p
PROTO((tree
));
116 static tree store_bindings
PROTO((tree
, tree
));
117 static tree lookup_tag_reverse
PROTO((tree
, tree
));
118 static tree obscure_complex_init
PROTO((tree
, tree
));
119 static tree maybe_build_cleanup_1
PROTO((tree
, tree
));
120 static tree lookup_name_real
PROTO((tree
, int, int, int));
121 static void warn_extern_redeclared_static
PROTO((tree
, tree
));
122 static void grok_reference_init
PROTO((tree
, tree
, tree
));
123 static tree grokfndecl
PROTO((tree
, tree
, tree
, tree
, int,
124 enum overload_flags
, tree
,
125 tree
, int, int, int, int, int, int, tree
));
126 static tree grokvardecl
PROTO((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
127 static tree lookup_tag
PROTO((enum tree_code
, tree
,
128 struct binding_level
*, int));
129 static void set_identifier_type_value_with_scope
130 PROTO((tree
, tree
, struct binding_level
*));
131 static void record_builtin_type
PROTO((enum rid
, const char *, tree
));
132 static void record_unknown_type
PROTO((tree
, const char *));
133 static int member_function_or_else
PROTO((tree
, tree
, const char *));
134 static void bad_specifiers
PROTO((tree
, const char *, int, int, int, int,
136 static void lang_print_error_function
PROTO((const char *));
137 static tree maybe_process_template_type_declaration
PROTO((tree
, int, struct binding_level
*));
138 static void check_for_uninitialized_const_var
PROTO((tree
));
139 static unsigned long typename_hash
PROTO((hash_table_key
));
140 static boolean typename_compare
PROTO((hash_table_key
, hash_table_key
));
141 static void push_binding
PROTO((tree
, tree
, struct binding_level
*));
142 static int add_binding
PROTO((tree
, tree
));
143 static void pop_binding
PROTO((tree
, tree
));
144 static tree local_variable_p
PROTO((tree
*));
145 static tree find_binding
PROTO((tree
, tree
));
146 static tree select_decl
PROTO((tree
, int));
147 static int lookup_flags
PROTO((int, int));
148 static tree qualify_lookup
PROTO((tree
, int));
149 static tree record_builtin_java_type
PROTO((const char *, int));
150 static const char *tag_name
PROTO((enum tag_types code
));
151 static void find_class_binding_level
PROTO((void));
152 static struct binding_level
*innermost_nonclass_level
PROTO((void));
153 static void warn_about_implicit_typename_lookup
PROTO((tree
, tree
));
154 static int walk_namespaces_r
PROTO((tree
, walk_namespaces_fn
, void *));
155 static int walk_globals_r
PROTO((tree
, void *));
156 static void add_decl_to_level
PROTO((tree
, struct binding_level
*));
157 static tree make_label_decl
PROTO((tree
, int));
158 static void pop_label
PROTO((tree
));
159 static void pop_labels
PROTO((tree
));
160 static void maybe_deduce_size_from_array_init
PROTO((tree
, tree
));
161 static void layout_var_decl
PROTO((tree
));
162 static void maybe_commonize_var
PROTO((tree
));
163 static tree check_initializer
PROTO((tree
, tree
));
164 static void make_rtl_for_nonlocal_decl
PROTO((tree
, tree
, const char *));
165 static void push_cp_function_context
PROTO((struct function
*));
166 static void pop_cp_function_context
PROTO((struct function
*));
167 static void mark_binding_level
PROTO((void *));
168 static void mark_cp_function_context
PROTO((struct function
*));
169 static void mark_saved_scope
PROTO((void *));
170 static void mark_lang_function
PROTO((struct language_function
*));
171 static void mark_stmt_tree
PROTO((struct stmt_tree
*));
172 static void save_function_data
PROTO((tree
));
173 static void check_function_type
PROTO((tree
));
174 static void destroy_local_static
PROTO((tree
));
175 static void destroy_local_var
PROTO((tree
));
176 static void finish_constructor_body
PROTO((void));
177 static void finish_destructor_body
PROTO((void));
179 #if defined (DEBUG_CP_BINDING_LEVELS)
180 static void indent
PROTO((void));
183 /* Erroneous argument lists can use this *IFF* they do not modify it. */
184 tree error_mark_list
;
186 /* The following symbols are subsumed in the cp_global_trees array, and
187 listed here individually for documentation purposes.
190 tree wchar_decl_node;
193 tree vtable_entry_type;
194 tree delta_type_node;
197 tree __baselist_desc_type_node;
198 tree __i_desc_type_node, __m_desc_type_node;
199 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
201 tree __t_desc_type_node;
203 tree __tp_desc_type_node;
205 tree __access_mode_type_node;
206 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
207 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
208 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
210 Not needed yet? May be needed one day?
211 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
212 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
213 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
216 tree class_star_type_node;
217 tree class_type_node, record_type_node, union_type_node, enum_type_node;
218 tree unknown_type_node;
220 Array type `vtable_entry_type[]'
223 tree vtbl_ptr_type_node;
229 A FUNCTION_DECL which can call `abort'. Not necessarily the
230 one that the user will declare, but sufficient to be called
231 by routines that want to abort the program.
235 The FUNCTION_DECL for the default `::operator delete'.
237 tree global_delete_fndecl;
240 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
244 tree cp_global_trees
[CPTI_MAX
];
246 /* Indicates that there is a type value in some namespace, although
247 that is not necessarily in scope at the moment. */
249 static tree global_type_node
;
254 /* Expect only namespace names now. */
255 static int only_namespace_names
;
257 /* In a destructor, the last insn emitted after the start of the
258 function and the parms. */
260 #define last_dtor_insn cp_function_chain->x_last_dtor_insn
262 /* In a constructor, the last insn emitted after the start of the
263 function and the parms, the exception specification and any
264 function-try-block. The constructor initializers are emitted after
267 #define last_parm_cleanup_insn cp_function_chain->x_last_parm_cleanup_insn
269 /* If original DECL_RESULT of current function was a register,
270 but due to being an addressable named return value, would up
271 on the stack, this variable holds the named return value's
272 original location. */
274 #define original_result_rtx cp_function_chain->x_result_rtx
276 struct named_label_list
278 struct binding_level
*binding_level
;
281 const char *filename_o_goto
;
283 struct named_label_list
*next
;
286 /* Used only for jumps to as-yet undefined labels, since jumps to
287 defined labels can have their validity checked by stmt.c. */
289 #define named_label_uses cp_function_chain->x_named_label_uses
291 /* A list of objects which have constructors or destructors
292 which reside in the global scope. The decl is stored in
293 the TREE_VALUE slot and the initializer is stored
294 in the TREE_PURPOSE slot. */
295 tree static_aggregates
;
299 /* A node for the integer constants 2, and 3. */
301 tree integer_two_node
, integer_three_node
;
303 /* While defining an enum type, this is 1 plus the last enumerator
306 static tree enum_next_value
;
308 /* Nonzero means that there was overflow computing enum_next_value. */
310 static int enum_overflow
;
312 /* Parsing a function declarator leaves here a chain of structure
313 and enum types declared in the parmlist. */
315 static tree last_function_parm_tags
;
317 /* Similar, for last_function_parm_tags. */
318 tree last_function_parms
;
319 static tree current_function_parm_tags
;
321 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
322 that have names. Here so we can clear out their names' definitions
323 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
324 TREE_PURPOSE is the previous binding of the label. */
326 #define named_labels cp_function_chain->x_named_labels
328 /* The FUNCTION_DECL for the function currently being compiled,
329 or 0 if between functions. */
330 tree current_function_decl
;
332 /* Set to 0 at beginning of a function definition, and whenever
333 a label (case or named) is defined. Set to value of expression
334 returned from function when that value can be transformed into
335 a named return value. */
337 tree current_function_return_value
;
339 /* Nonzero means give `double' the same size as `float'. */
341 extern int flag_short_double
;
343 /* Nonzero means don't recognize any builtin functions. */
345 extern int flag_no_builtin
;
347 /* Nonzero means don't recognize the non-ANSI builtin functions.
350 extern int flag_no_nonansi_builtin
;
352 /* Nonzero means enable obscure ANSI features and disable GNU extensions
353 that might cause ANSI-compliant code to be miscompiled. */
355 extern int flag_ansi
;
357 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
359 extern int flag_huge_objects
;
361 /* Nonzero if we want to conserve space in the .o files. We do this
362 by putting uninitialized data and runtime initialized data into
363 .common instead of .data at the expense of not flagging multiple
365 extern int flag_conserve_space
;
367 /* C and C++ flags are in decl2.c. */
369 /* Flag used when debugging spew.c */
371 extern int spew_debug
;
373 /* A expression of value 0 with the same precision as a sizetype
375 tree signed_size_zero_node
;
377 /* The name of the anonymous namespace, throughout this translation
379 tree anonymous_namespace_name
;
382 /* For each binding contour we allocate a binding_level structure
383 which records the names defined in that contour.
386 1) one for each function definition,
387 where internal declarations of the parameters appear.
388 2) one for each compound statement,
389 to record its declarations.
391 The current meaning of a name can be found by searching the levels
392 from the current one out to the global one.
394 Off to the side, may be the class_binding_level. This exists only
395 to catch class-local declarations. It is otherwise nonexistent.
397 Also there may be binding levels that catch cleanups that must be
398 run when exceptions occur. Thus, to see whether a name is bound in
399 the current scope, it is not enough to look in the
400 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
403 /* Note that the information in the `names' component of the global contour
404 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
408 /* A chain of _DECL nodes for all variables, constants, functions,
409 and typedef types. These are in the reverse of the order
410 supplied. There may be OVERLOADs on this list, too, but they
411 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
414 /* A list of structure, union and enum definitions, for looking up
416 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
417 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
418 or ENUMERAL_TYPE node.
420 C++: the TREE_VALUE nodes can be simple types for
421 component_bindings. */
424 /* A list of USING_DECL nodes. */
427 /* A list of used namespaces. PURPOSE is the namespace,
428 VALUE the common ancestor with this binding_level's namespace. */
429 tree using_directives
;
431 /* If this binding level is the binding level for a class, then
432 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
433 is the name of an entity bound in the class; the TREE_VALUE is
434 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
435 when leaving class scope, we can restore the
436 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
437 the DECL bound by this name in the class. */
440 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
441 is used for all binding levels. */
444 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
445 label in this scope. The TREE_PURPOSE is the previous value of
446 the IDENTIFIER_LABEL VALUE. */
447 tree shadowed_labels
;
449 /* For each level (except not the global one),
450 a chain of BLOCK nodes for all the levels
451 that were entered and exited one level down. */
454 /* The BLOCK node for this level, if one has been preallocated.
455 If 0, the BLOCK is allocated (if needed) when the level is popped. */
458 /* The binding level which this one is contained in (inherits from). */
459 struct binding_level
*level_chain
;
461 /* List of decls in `names' that have incomplete
462 structure or union types. */
465 /* List of VAR_DECLS saved from a previous for statement.
466 These would be dead in ANSI-conforming code, but might
467 be referenced in ARM-era code. These are stored in a
468 TREE_LIST; the TREE_VALUE is the actual declaration. */
469 tree dead_vars_from_for
;
471 /* 1 for the level that holds the parameters of a function.
472 2 for the level that holds a class declaration.
473 3 for levels that hold parameter declarations. */
474 unsigned parm_flag
: 4;
476 /* 1 means make a BLOCK for this level regardless of all else.
477 2 for temporary binding contours created by the compiler. */
480 /* Nonzero if this level "doesn't exist" for tags. */
481 unsigned tag_transparent
: 1;
483 /* Nonzero if this level can safely have additional
484 cleanup-needing variables added to it. */
485 unsigned more_cleanups_ok
: 1;
486 unsigned have_cleanups
: 1;
488 /* Nonzero if this level is for storing the decls for template
489 parameters and generic decls; these decls will be discarded and
490 replaced with a TEMPLATE_DECL. */
491 unsigned pseudo_global
: 1;
493 /* This is set for a namespace binding level. */
494 unsigned namespace_p
: 1;
496 /* True if this level is that of a for-statement where we need to
497 worry about ambiguous (ARM or ANSI) scope rules. */
498 unsigned is_for_scope
: 1;
500 /* True if this level corresponds to an EH region, as for a try block. */
501 unsigned eh_region
: 1;
503 /* One bit left for this word. */
505 #if defined(DEBUG_CP_BINDING_LEVELS)
506 /* Binding depth at which this level began. */
507 unsigned binding_depth
;
508 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
511 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
513 /* The binding level currently in effect. */
515 #define current_binding_level \
517 ? cp_function_chain->bindings \
518 : scope_chain->bindings)
520 /* The binding level of the current class, if any. */
522 #define class_binding_level scope_chain->class_bindings
524 /* A chain of binding_level structures awaiting reuse. */
526 static struct binding_level
*free_binding_level
;
528 /* The outermost binding level, for names of file scope.
529 This is created when the compiler is started and exists
530 through the entire run. */
532 static struct binding_level
*global_binding_level
;
534 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
536 static int keep_next_level_flag
;
538 #if defined(DEBUG_CP_BINDING_LEVELS)
539 static int binding_depth
= 0;
540 static int is_class_level
= 0;
547 for (i
= 0; i
< binding_depth
*2; i
++)
550 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
552 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
555 push_binding_level (newlevel
, tag_transparent
, keep
)
556 struct binding_level
*newlevel
;
557 int tag_transparent
, keep
;
559 /* Add this level to the front of the chain (stack) of levels that
561 bzero ((char*) newlevel
, sizeof (struct binding_level
));
562 newlevel
->level_chain
= current_binding_level
;
563 current_binding_level
= newlevel
;
564 newlevel
->tag_transparent
= tag_transparent
;
565 newlevel
->more_cleanups_ok
= 1;
567 /* We are called before expand_start_bindings, but after
568 expand_eh_region_start for a try block; so we check this now,
569 before the EH block is covered up. */
570 newlevel
->eh_region
= is_eh_region ();
572 newlevel
->keep
= keep
;
573 #if defined(DEBUG_CP_BINDING_LEVELS)
574 newlevel
->binding_depth
= binding_depth
;
576 fprintf (stderr
, "push %s level 0x%08x line %d\n",
577 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
580 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
583 /* Find the innermost enclosing class scope, and reset
584 CLASS_BINDING_LEVEL appropriately. */
587 find_class_binding_level ()
589 struct binding_level
*level
= current_binding_level
;
591 while (level
&& level
->parm_flag
!= 2)
592 level
= level
->level_chain
;
593 if (level
&& level
->parm_flag
== 2)
594 class_binding_level
= level
;
596 class_binding_level
= 0;
602 if (global_binding_level
)
604 /* Cannot pop a level, if there are none left to pop. */
605 if (current_binding_level
== global_binding_level
)
606 my_friendly_abort (123);
608 /* Pop the current level, and free the structure for reuse. */
609 #if defined(DEBUG_CP_BINDING_LEVELS)
612 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
613 (is_class_level
) ? "class" : "block",
614 current_binding_level
, lineno
);
615 if (is_class_level
!= (current_binding_level
== class_binding_level
))
618 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
621 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
623 register struct binding_level
*level
= current_binding_level
;
624 current_binding_level
= current_binding_level
->level_chain
;
625 level
->level_chain
= free_binding_level
;
626 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
627 if (level
->binding_depth
!= binding_depth
)
629 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
630 free_binding_level
= level
;
631 find_class_binding_level ();
636 suspend_binding_level ()
638 if (class_binding_level
)
639 current_binding_level
= class_binding_level
;
641 if (global_binding_level
)
643 /* Cannot suspend a level, if there are none left to suspend. */
644 if (current_binding_level
== global_binding_level
)
645 my_friendly_abort (123);
647 /* Suspend the current level. */
648 #if defined(DEBUG_CP_BINDING_LEVELS)
651 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
652 (is_class_level
) ? "class" : "block",
653 current_binding_level
, lineno
);
654 if (is_class_level
!= (current_binding_level
== class_binding_level
))
657 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
660 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
661 current_binding_level
= current_binding_level
->level_chain
;
662 find_class_binding_level ();
666 resume_binding_level (b
)
667 struct binding_level
*b
;
669 /* Resuming binding levels is meant only for namespaces,
670 and those cannot nest into classes. */
671 my_friendly_assert(!class_binding_level
, 386);
672 /* Also, resuming a non-directly nested namespace is a no-no. */
673 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
674 current_binding_level
= b
;
675 #if defined(DEBUG_CP_BINDING_LEVELS)
676 b
->binding_depth
= binding_depth
;
678 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
679 (is_class_level
) ? "class" : "block", b
, lineno
);
682 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
685 /* Create a new `struct binding_level'. */
688 struct binding_level
*
689 make_binding_level ()
692 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
695 /* Nonzero if we are currently in the global binding level. */
700 return current_binding_level
== global_binding_level
;
703 /* Return the innermost binding level that is not for a class scope. */
705 static struct binding_level
*
706 innermost_nonclass_level ()
708 struct binding_level
*b
;
710 b
= current_binding_level
;
711 while (b
->parm_flag
== 2)
717 /* Nonzero if we are currently in a toplevel binding level. This
718 means either the global binding level or a namespace in a toplevel
719 binding level. Since there are no non-toplevel namespace levels,
720 this really means any namespace or pseudo-global level. We also
721 include a class whose context is toplevel. */
724 toplevel_bindings_p ()
726 struct binding_level
*b
= innermost_nonclass_level ();
728 return b
->namespace_p
|| b
->pseudo_global
;
731 /* Nonzero if this is a namespace scope, or if we are defining a class
732 which is itself at namespace scope, or whose enclosing class is
733 such a class, etc. */
736 namespace_bindings_p ()
738 struct binding_level
*b
= innermost_nonclass_level ();
740 return b
->namespace_p
;
743 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
744 unconditionally. Otherwise, use the normal logic to decide whether
745 or not to create a BLOCK. */
748 keep_next_level (keep
)
751 keep_next_level_flag
= keep
;
754 /* Nonzero if the current level needs to have a BLOCK made. */
759 return (current_binding_level
->blocks
!= NULL_TREE
760 || current_binding_level
->keep
761 || current_binding_level
->names
!= NULL_TREE
762 || (current_binding_level
->tags
!= NULL_TREE
763 && !current_binding_level
->tag_transparent
));
767 declare_pseudo_global_level ()
769 current_binding_level
->pseudo_global
= 1;
773 declare_namespace_level ()
775 current_binding_level
->namespace_p
= 1;
779 pseudo_global_level_p ()
781 return current_binding_level
->pseudo_global
;
785 set_class_shadows (shadows
)
788 class_binding_level
->class_shadowed
= shadows
;
791 /* Enter a new binding level.
792 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
793 not for that of tags. */
796 pushlevel (tag_transparent
)
799 struct binding_level
*newlevel
;
801 if (current_function
&& !doing_semantic_analysis_p ())
804 /* Reuse or create a struct for this binding level. */
805 #if defined(DEBUG_CP_BINDING_LEVELS)
807 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
808 if (free_binding_level
)
809 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
811 newlevel
= free_binding_level
;
812 free_binding_level
= free_binding_level
->level_chain
;
815 newlevel
= make_binding_level ();
817 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
818 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
819 keep_next_level_flag
= 0;
823 note_level_for_for ()
825 current_binding_level
->is_for_scope
= 1;
829 pushlevel_temporary (tag_transparent
)
832 pushlevel (tag_transparent
);
833 current_binding_level
->keep
= 2;
836 /* Note we don't call push_momentary() here. Otherwise, it would cause
837 cleanups to be allocated on the momentary obstack, and they will be
838 overwritten by the next statement. */
840 expand_start_bindings (0);
843 /* For a binding between a name and an entity at a block scope,
844 this is the `struct binding_level' for the block. */
845 #define BINDING_LEVEL(NODE) \
846 (((struct tree_binding*)NODE)->scope.level)
848 /* Make DECL the innermost binding for ID. The LEVEL is the binding
849 level at which this declaration is being bound. */
852 push_binding (id
, decl
, level
)
855 struct binding_level
* level
;
859 binding
= make_node (CPLUS_BINDING
);
861 /* Now, fill in the binding information. */
862 BINDING_VALUE (binding
) = decl
;
863 BINDING_TYPE (binding
) = NULL_TREE
;
864 BINDING_LEVEL (binding
) = level
;
865 INHERITED_VALUE_BINDING_P (binding
) = 0;
866 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
867 BINDING_HAS_LEVEL_P (binding
) = 1;
869 /* And put it on the front of the list of bindings for ID. */
870 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
871 IDENTIFIER_BINDING (id
) = binding
;
874 /* ID is already bound in the current scope. But, DECL is an
875 additional binding for ID in the same scope. This is the `struct
876 stat' hack whereby a non-typedef class-name or enum-name can be
877 bound at the same level as some other kind of entity. It's the
878 responsibility of the caller to check that inserting this name is
879 legal here. Returns nonzero if the new binding was successful. */
881 add_binding (id
, decl
)
885 tree binding
= IDENTIFIER_BINDING (id
);
888 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
889 /* The new name is the type name. */
890 BINDING_TYPE (binding
) = decl
;
891 else if (!BINDING_VALUE (binding
))
892 /* This situation arises when push_class_level_binding moves an
893 inherited type-binding out of the way to make room for a new
895 BINDING_VALUE (binding
) = decl
;
896 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
897 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
899 /* The old binding was a type name. It was placed in
900 BINDING_VALUE because it was thought, at the point it was
901 declared, to be the only entity with such a name. Move the
902 type name into the type slot; it is now hidden by the new
904 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
905 BINDING_VALUE (binding
) = decl
;
906 INHERITED_VALUE_BINDING_P (binding
) = 0;
908 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
909 && TREE_CODE (decl
) == TYPE_DECL
910 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
911 && same_type_p (TREE_TYPE (decl
),
912 TREE_TYPE (BINDING_VALUE (binding
))))
913 /* We have two typedef-names, both naming the same type to have
914 the same name. This is OK because of:
918 In a given scope, a typedef specifier can be used to redefine
919 the name of any type declared in that scope to refer to the
920 type to which it already refers. */
924 cp_error ("declaration of `%#D'", decl
);
925 cp_error_at ("conflicts with previous declaration `%#D'",
926 BINDING_VALUE (binding
));
933 /* Add DECL to the list of things declared in B. */
936 add_decl_to_level (decl
, b
)
938 struct binding_level
*b
;
940 /* We build up the list in reverse order, and reverse it later if
942 TREE_CHAIN (decl
) = b
->names
;
946 /* Bind DECL to ID in the current_binding_level, assumed to be a local
947 binding level. If PUSH_USING is set in FLAGS, we know that DECL
948 doesn't really belong to this binding level, that it got here
949 through a using-declaration. */
952 push_local_binding (id
, decl
, flags
)
957 struct binding_level
*b
;
959 /* Skip over any local classes. This makes sense if we call
960 push_local_binding with a friend decl of a local class. */
961 b
= current_binding_level
;
962 while (b
->parm_flag
== 2)
965 if (lookup_name_current_level (id
))
967 /* Supplement the existing binding. */
968 if (!add_binding (id
, decl
))
969 /* It didn't work. Something else must be bound at this
970 level. Do not add DECL to the list of things to pop
975 /* Create a new binding. */
976 push_binding (id
, decl
, b
);
978 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
979 /* We must put the OVERLOAD into a TREE_LIST since the
980 TREE_CHAIN of an OVERLOAD is already used. Similarly for
981 decls that got here through a using-declaration. */
982 decl
= build_tree_list (NULL_TREE
, decl
);
984 /* And put DECL on the list of things declared by the current
986 add_decl_to_level (decl
, b
);
989 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
990 binding was successful. */
993 push_class_binding (id
, decl
)
998 tree binding
= IDENTIFIER_BINDING (id
);
1001 /* Note that we declared this value so that we can issue an error if
1002 this an illegal redeclaration of a name already used for some
1004 note_name_declared_in_class (id
, decl
);
1006 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1007 /* Supplement the existing binding. */
1008 result
= add_binding (id
, decl
);
1010 /* Create a new binding. */
1011 push_binding (id
, decl
, class_binding_level
);
1013 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1014 class-level declaration. Note that we do not use DECL here
1015 because of the possibility of the `struct stat' hack; if DECL is
1016 a class-name or enum-name we might prefer a field-name, or some
1018 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1020 /* If this is a binding from a base class, mark it as such. */
1021 binding
= IDENTIFIER_BINDING (id
);
1022 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1024 /* Any implicit typename must be from a base-class. The
1025 context for an implicit typename declaration is always
1026 the derived class in which the lookup was done, so the checks
1027 based on the context of DECL below will not trigger. */
1028 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1029 INHERITED_VALUE_BINDING_P (binding
) = 1;
1032 if (TREE_CODE (decl
) == OVERLOAD
)
1033 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
1036 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1038 context
= DECL_REAL_CONTEXT (decl
);
1041 if (is_properly_derived_from (current_class_type
, context
))
1042 INHERITED_VALUE_BINDING_P (binding
) = 1;
1044 INHERITED_VALUE_BINDING_P (binding
) = 0;
1047 else if (BINDING_VALUE (binding
) == decl
)
1048 /* We only encounter a TREE_LIST when push_class_decls detects an
1049 ambiguity. Such an ambiguity can be overridden by a definition
1051 INHERITED_VALUE_BINDING_P (binding
) = 1;
1056 /* Remove the binding for DECL which should be the innermost binding
1060 pop_binding (id
, decl
)
1066 if (id
== NULL_TREE
)
1067 /* It's easiest to write the loops that call this function without
1068 checking whether or not the entities involved have names. We
1069 get here for such an entity. */
1072 /* Get the innermost binding for ID. */
1073 binding
= IDENTIFIER_BINDING (id
);
1075 /* The name should be bound. */
1076 my_friendly_assert (binding
!= NULL_TREE
, 0);
1078 /* The DECL will be either the ordinary binding or the type
1079 binding for this identifier. Remove that binding. */
1080 if (BINDING_VALUE (binding
) == decl
)
1081 BINDING_VALUE (binding
) = NULL_TREE
;
1082 else if (BINDING_TYPE (binding
) == decl
)
1083 BINDING_TYPE (binding
) = NULL_TREE
;
1085 my_friendly_abort (0);
1087 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1088 /* We're completely done with the innermost binding for this
1089 identifier. Unhook it from the list of bindings. */
1090 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1093 /* When a label goes out of scope, check to see if that label was used
1094 in a valid manner, and issue any appropriate warnings or errors. */
1100 tree label
= TREE_VALUE (link
);
1102 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1104 if (DECL_INITIAL (label
) == NULL_TREE
)
1106 cp_error_at ("label `%D' used but not defined", label
);
1107 /* Avoid crashing later. */
1108 define_label (input_filename
, 1, DECL_NAME (label
));
1110 else if (warn_unused
&& !TREE_USED (label
))
1111 cp_warning_at ("label `%D' defined but not used", label
);
1114 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1117 /* At the end of a function, all labels declared within the fucntion
1118 go out of scope. BLOCK is the top-level block for the
1127 /* Clear out the definitions of all label names, since their scopes
1129 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1132 /* Put the labels into the "variables" of the top-level block,
1133 so debugger can see them. */
1134 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1135 BLOCK_VARS (block
) = TREE_VALUE (link
);
1138 named_labels
= NULL_TREE
;
1141 /* Exit a binding level.
1142 Pop the level off, and restore the state of the identifier-decl mappings
1143 that were in effect when this level was entered.
1145 If KEEP == 1, this level had explicit declarations, so
1146 and create a "block" (a BLOCK node) for the level
1147 to record its declarations and subblocks for symbol table output.
1149 If FUNCTIONBODY is nonzero, this level is the body of a function,
1150 so create a block as if KEEP were set and also clear out all
1153 If REVERSE is nonzero, reverse the order of decls before putting
1154 them into the BLOCK. */
1157 poplevel (keep
, reverse
, functionbody
)
1163 /* The chain of decls was accumulated in reverse order.
1164 Put it into forward order, just for cleanliness. */
1166 int tmp
= functionbody
;
1167 int real_functionbody
;
1170 tree block
= NULL_TREE
;
1172 int block_previously_created
;
1173 int leaving_for_scope
;
1175 if (current_function
&& !doing_semantic_analysis_p ())
1178 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1181 real_functionbody
= (current_binding_level
->keep
== 2
1182 ? ((functionbody
= 0), tmp
) : functionbody
);
1183 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1184 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1186 my_friendly_assert (!current_binding_level
->class_shadowed
,
1189 /* We used to use KEEP == 2 to indicate that the new block should go
1190 at the beginning of the list of blocks at this binding level,
1191 rather than the end. This hack is no longer used. */
1192 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1194 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1195 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1196 current_binding_level
->parm_flag
,
1197 current_binding_level
->keep
);
1199 if (current_binding_level
->keep
== 1)
1202 /* Get the decls in the order they were written.
1203 Usually current_binding_level->names is in reverse order.
1204 But parameter decls were previously put in forward order. */
1207 current_binding_level
->names
1208 = decls
= nreverse (current_binding_level
->names
);
1210 decls
= current_binding_level
->names
;
1212 /* Output any nested inline functions within this block
1213 if they weren't already output. */
1215 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1216 if (TREE_CODE (decl
) == FUNCTION_DECL
1217 && ! TREE_ASM_WRITTEN (decl
)
1218 && DECL_INITIAL (decl
) != NULL_TREE
1219 && TREE_ADDRESSABLE (decl
)
1220 && decl_function_context (decl
) == current_function_decl
)
1222 /* If this decl was copied from a file-scope decl
1223 on account of a block-scope extern decl,
1224 propagate TREE_ADDRESSABLE to the file-scope decl. */
1225 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1226 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1229 push_function_context ();
1230 output_inline_function (decl
);
1231 pop_function_context ();
1235 /* If there were any declarations or structure tags in that level,
1236 or if this level is a function body,
1237 create a BLOCK to record them for the life of this function. */
1240 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1241 if (block_previously_created
)
1242 block
= current_binding_level
->this_block
;
1243 else if (keep
== 1 || functionbody
)
1244 block
= make_node (BLOCK
);
1245 if (block
!= NULL_TREE
)
1247 if (block_previously_created
)
1249 if (decls
|| tags
|| subblocks
)
1251 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1252 warning ("internal compiler error: debugging info corrupted");
1254 BLOCK_VARS (block
) = decls
;
1255 BLOCK_TYPE_TAGS (block
) = tags
;
1257 /* We can have previous subblocks and new subblocks when
1258 doing fixup_gotos with complex cleanups. We chain the new
1259 subblocks onto the end of any pre-existing subblocks. */
1260 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1263 /* If we created the block earlier on, and we are just
1264 diddling it now, then it already should have a proper
1265 BLOCK_END_NOTE value associated with it. */
1269 BLOCK_VARS (block
) = decls
;
1270 BLOCK_TYPE_TAGS (block
) = tags
;
1271 BLOCK_SUBBLOCKS (block
) = subblocks
;
1272 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1274 remember_end_note (block
);
1278 /* In each subblock, record that this is its superior. */
1281 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1282 BLOCK_SUPERCONTEXT (link
) = block
;
1284 /* We still support the old for-scope rules, whereby the variables
1285 in a for-init statement were in scope after the for-statement
1286 ended. We only use the new rules in flag_new_for_scope is
1289 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1291 /* Remove declarations for all the DECLs in this level. */
1292 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1294 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1297 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1301 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1303 ns_binding
= NULL_TREE
;
1306 && (BINDING_LEVEL (outer_binding
)
1307 == current_binding_level
->level_chain
))
1308 /* We have something like:
1313 and we are leaving the `for' scope. There's no reason to
1314 keep the binding of the inner `i' in this case. */
1315 pop_binding (DECL_NAME (link
), link
);
1316 else if ((outer_binding
1317 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1320 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1321 /* Here, we have something like:
1329 We must pop the for-scope binding so we know what's a
1330 type and what isn't. */
1331 pop_binding (DECL_NAME (link
), link
);
1334 /* Mark this VAR_DECL as dead so that we can tell we left it
1335 there only for backward compatibility. */
1336 DECL_DEAD_FOR_LOCAL (link
) = 1;
1338 /* Keep track of what should of have happenned when we
1339 popped the binding. */
1340 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1341 DECL_SHADOWED_FOR_VAR (link
)
1342 = BINDING_VALUE (outer_binding
);
1344 /* Add it to the list of dead variables in the next
1345 outermost binding to that we can remove these when we
1346 leave that binding. */
1347 current_binding_level
->level_chain
->dead_vars_from_for
1348 = tree_cons (NULL_TREE
, link
,
1349 current_binding_level
->level_chain
->
1350 dead_vars_from_for
);
1352 /* Although we don't pop the CPLUS_BINDING, we do clear
1353 its BINDING_LEVEL since the level is going away now. */
1354 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1360 /* Remove the binding. */
1362 if (TREE_CODE (decl
) == TREE_LIST
)
1363 decl
= TREE_VALUE (decl
);
1364 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1365 pop_binding (DECL_NAME (decl
), decl
);
1366 else if (TREE_CODE (decl
) == OVERLOAD
)
1367 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1369 my_friendly_abort (0);
1373 /* Remove declarations for any `for' variables from inner scopes
1374 that we kept around. */
1375 for (link
= current_binding_level
->dead_vars_from_for
;
1376 link
; link
= TREE_CHAIN (link
))
1377 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1379 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1380 for (link
= current_binding_level
->type_shadowed
;
1381 link
; link
= TREE_CHAIN (link
))
1382 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1384 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1385 for (link
= current_binding_level
->shadowed_labels
;
1387 link
= TREE_CHAIN (link
))
1390 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1391 list if a `using' declaration put them there. The debugging
1392 back-ends won't understand OVERLOAD, so we remove them here.
1393 Because the BLOCK_VARS are (temporarily) shared with
1394 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1395 popped all the bindings. */
1400 for (d
= &BLOCK_VARS (block
); *d
; )
1402 if (TREE_CODE (*d
) == TREE_LIST
)
1403 *d
= TREE_CHAIN (*d
);
1405 d
= &TREE_CHAIN (*d
);
1409 /* If the level being exited is the top level of a function,
1410 check over all the labels. */
1413 /* Since this is the top level block of a function, the vars are
1414 the function's parameters. Don't leave them in the BLOCK
1415 because they are found in the FUNCTION_DECL instead. */
1416 BLOCK_VARS (block
) = 0;
1420 /* Any uses of undefined labels now operate under constraints
1421 of next binding contour. */
1422 if (current_function
)
1424 struct binding_level
*level_chain
;
1425 level_chain
= current_binding_level
->level_chain
;
1428 struct named_label_list
*labels
;
1429 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1430 if (labels
->binding_level
== current_binding_level
)
1432 labels
->binding_level
= level_chain
;
1433 labels
->names_in_scope
= level_chain
->names
;
1438 tmp
= current_binding_level
->keep
;
1440 pop_binding_level ();
1442 DECL_INITIAL (current_function_decl
) = block
;
1445 if (!block_previously_created
)
1446 current_binding_level
->blocks
1447 = chainon (current_binding_level
->blocks
, block
);
1449 /* If we did not make a block for the level just exited,
1450 any blocks made for inner levels
1451 (since they cannot be recorded as subblocks in that level)
1452 must be carried forward so they will later become subblocks
1453 of something else. */
1455 current_binding_level
->blocks
1456 = chainon (current_binding_level
->blocks
, subblocks
);
1458 /* Take care of compiler's internal binding structures. */
1461 expand_end_bindings (getdecls (), keep
, 1);
1462 /* Each and every BLOCK node created here in `poplevel' is important
1463 (e.g. for proper debugging information) so if we created one
1464 earlier, mark it as "used". */
1466 TREE_USED (block
) = 1;
1467 block
= poplevel (keep
, reverse
, real_functionbody
);
1470 /* Each and every BLOCK node created here in `poplevel' is important
1471 (e.g. for proper debugging information) so if we created one
1472 earlier, mark it as "used". */
1474 TREE_USED (block
) = 1;
1478 /* Delete the node BLOCK from the current binding level.
1479 This is used for the block inside a stmt expr ({...})
1480 so that the block can be reinserted where appropriate. */
1483 delete_block (block
)
1487 if (current_binding_level
->blocks
== block
)
1488 current_binding_level
->blocks
= TREE_CHAIN (block
);
1489 for (t
= current_binding_level
->blocks
; t
;)
1491 if (TREE_CHAIN (t
) == block
)
1492 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1496 TREE_CHAIN (block
) = NULL_TREE
;
1497 /* Clear TREE_USED which is always set by poplevel.
1498 The flag is set again if insert_block is called. */
1499 TREE_USED (block
) = 0;
1502 /* Insert BLOCK at the end of the list of subblocks of the
1503 current binding level. This is used when a BIND_EXPR is expanded,
1504 to handle the BLOCK node inside the BIND_EXPR. */
1507 insert_block (block
)
1510 TREE_USED (block
) = 1;
1511 current_binding_level
->blocks
1512 = chainon (current_binding_level
->blocks
, block
);
1515 /* Set the BLOCK node for the innermost scope
1516 (the one we are currently in). */
1520 register tree block
;
1522 current_binding_level
->this_block
= block
;
1525 /* Do a pushlevel for class declarations. */
1530 register struct binding_level
*newlevel
;
1532 /* Reuse or create a struct for this binding level. */
1533 #if defined(DEBUG_CP_BINDING_LEVELS)
1535 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1536 if (free_binding_level
)
1537 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1539 newlevel
= free_binding_level
;
1540 free_binding_level
= free_binding_level
->level_chain
;
1543 newlevel
= make_binding_level ();
1545 #if defined(DEBUG_CP_BINDING_LEVELS)
1547 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1549 push_binding_level (newlevel
, 0, 0);
1551 class_binding_level
= current_binding_level
;
1552 class_binding_level
->parm_flag
= 2;
1555 /* ...and a poplevel for class declarations. */
1560 register struct binding_level
*level
= class_binding_level
;
1563 my_friendly_assert (level
!= 0, 354);
1565 /* If we're leaving a toplevel class, don't bother to do the setting
1566 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1567 shouldn't even be used when current_class_type isn't set, and second,
1568 if we don't touch it here, we're able to use the cache effect if the
1569 next time we're entering a class scope, it is the same class. */
1570 if (current_class_depth
!= 1)
1572 struct binding_level
* b
;
1574 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1575 for (shadowed
= level
->class_shadowed
;
1577 shadowed
= TREE_CHAIN (shadowed
))
1578 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1580 /* Find the next enclosing class, and recreate
1581 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1582 b
= level
->level_chain
;
1583 while (b
&& b
->parm_flag
!= 2)
1587 for (shadowed
= b
->class_shadowed
;
1589 shadowed
= TREE_CHAIN (shadowed
))
1593 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1594 while (t
&& BINDING_LEVEL (t
) != b
)
1598 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1599 = BINDING_VALUE (t
);
1603 /* Remember to save what IDENTIFIER's were bound in this scope so we
1604 can recover from cache misses. */
1606 previous_class_type
= current_class_type
;
1607 previous_class_values
= class_binding_level
->class_shadowed
;
1609 for (shadowed
= level
->type_shadowed
;
1611 shadowed
= TREE_CHAIN (shadowed
))
1612 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1614 /* Remove the bindings for all of the class-level declarations. */
1615 for (shadowed
= level
->class_shadowed
;
1617 shadowed
= TREE_CHAIN (shadowed
))
1618 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1620 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1621 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1622 class_binding_level
->parm_flag
,
1623 class_binding_level
->keep
);
1625 /* Now, pop out of the binding level which we created up in the
1626 `pushlevel_class' routine. */
1627 #if defined(DEBUG_CP_BINDING_LEVELS)
1629 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1631 pop_binding_level ();
1634 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1635 for any names in enclosing classes. */
1638 clear_identifier_class_values ()
1642 if (!class_binding_level
)
1645 for (t
= class_binding_level
->class_shadowed
;
1648 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1651 /* Returns non-zero if T is a virtual function table. */
1654 vtable_decl_p (t
, data
)
1656 void *data ATTRIBUTE_UNUSED
;
1658 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1661 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1665 vtype_decl_p (t
, data
)
1667 void *data ATTRIBUTE_UNUSED
;
1669 return (TREE_CODE (t
) == TYPE_DECL
1670 && TREE_TYPE (t
) != error_mark_node
1671 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1672 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1675 /* Return the declarations that are members of the namespace NS. */
1678 cp_namespace_decls (ns
)
1681 return NAMESPACE_LEVEL (ns
)->names
;
1684 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1685 itself, calling F for each. The DATA is passed to F as well. */
1688 walk_namespaces_r (namespace, f
, data
)
1690 walk_namespaces_fn f
;
1696 result
|= (*f
) (namespace, data
);
1698 for (current
= cp_namespace_decls (namespace);
1700 current
= TREE_CHAIN (current
))
1702 if (TREE_CODE (current
) != NAMESPACE_DECL
1703 || DECL_NAMESPACE_ALIAS (current
))
1705 if (!DECL_LANG_SPECIFIC (current
))
1708 my_friendly_assert (current
== std_node
, 393);
1712 /* We found a namespace. */
1713 result
|= walk_namespaces_r (current
, f
, data
);
1719 /* Walk all the namespaces, calling F for each. The DATA is passed to
1723 walk_namespaces (f
, data
)
1724 walk_namespaces_fn f
;
1727 return walk_namespaces_r (global_namespace
, f
, data
);
1730 struct walk_globals_data
{
1731 walk_globals_pred p
;
1736 /* Walk the global declarations in NAMESPACE. Whenever one is found
1737 for which P returns non-zero, call F with its address. If any call
1738 to F returns a non-zero value, return a non-zero value. */
1741 walk_globals_r (namespace, data
)
1745 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1746 walk_globals_pred p
= wgd
->p
;
1747 walk_globals_fn f
= wgd
->f
;
1748 void *d
= wgd
->data
;
1752 t
= &NAMESPACE_LEVEL (namespace)->names
;
1759 result
|= (*f
) (t
, d
);
1761 /* If F changed *T, then *T still points at the next item to
1764 t
= &TREE_CHAIN (*t
);
1770 /* Walk the global declarations. Whenever one is found for which P
1771 returns non-zero, call F with its address. If any call to F
1772 returns a non-zero value, return a non-zero value. */
1775 walk_globals (p
, f
, data
)
1776 walk_globals_pred p
;
1780 struct walk_globals_data wgd
;
1785 return walk_namespaces (walk_globals_r
, &wgd
);
1788 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1789 DATA is non-NULL, this is the last time we will call
1790 wrapup_global_declarations for this NAMESPACE. */
1793 wrapup_globals_for_namespace (namespace, data
)
1797 tree globals
= cp_namespace_decls (namespace);
1798 int len
= list_length (globals
);
1799 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1803 int last_time
= (data
!= 0);
1805 if (last_time
&& namespace == global_namespace
)
1806 /* Let compile_file handle the global namespace. */
1809 /* Process the decls in reverse order--earliest first.
1810 Put them into VEC from back to front, then take out from front. */
1812 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1813 vec
[len
- i
- 1] = decl
;
1817 check_global_declarations (vec
, len
);
1821 /* Temporarily mark vtables as external. That prevents
1822 wrapup_global_declarations from writing them out; we must process
1823 them ourselves in finish_vtable_vardecl. */
1824 for (i
= 0; i
< len
; ++i
)
1825 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1827 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1828 DECL_EXTERNAL (vec
[i
]) = 1;
1831 /* Write out any globals that need to be output. */
1832 result
= wrapup_global_declarations (vec
, len
);
1834 /* Undo the hack to DECL_EXTERNAL above. */
1835 for (i
= 0; i
< len
; ++i
)
1836 if (vtable_decl_p (vec
[i
], /*data=*/0)
1837 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1839 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1840 DECL_EXTERNAL (vec
[i
]) = 0;
1847 /* Mark ARG (which is really a struct binding_level **) for GC. */
1850 mark_binding_level (arg
)
1853 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1857 ggc_mark_tree (lvl
->names
);
1858 ggc_mark_tree (lvl
->tags
);
1859 ggc_mark_tree (lvl
->usings
);
1860 ggc_mark_tree (lvl
->using_directives
);
1861 ggc_mark_tree (lvl
->class_shadowed
);
1862 ggc_mark_tree (lvl
->type_shadowed
);
1863 ggc_mark_tree (lvl
->shadowed_labels
);
1864 ggc_mark_tree (lvl
->blocks
);
1865 ggc_mark_tree (lvl
->this_block
);
1866 ggc_mark_tree (lvl
->incomplete
);
1867 ggc_mark_tree (lvl
->dead_vars_from_for
);
1869 lvl
= lvl
->level_chain
;
1873 /* For debugging. */
1874 static int no_print_functions
= 0;
1875 static int no_print_builtins
= 0;
1878 print_binding_level (lvl
)
1879 struct binding_level
*lvl
;
1883 fprintf (stderr
, " blocks=");
1884 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1885 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1886 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1887 if (lvl
->tag_transparent
)
1888 fprintf (stderr
, " tag-transparent");
1889 if (lvl
->more_cleanups_ok
)
1890 fprintf (stderr
, " more-cleanups-ok");
1891 if (lvl
->have_cleanups
)
1892 fprintf (stderr
, " have-cleanups");
1893 fprintf (stderr
, "\n");
1896 fprintf (stderr
, " names:\t");
1897 /* We can probably fit 3 names to a line? */
1898 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1900 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1902 if (no_print_builtins
1903 && (TREE_CODE (t
) == TYPE_DECL
)
1904 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1907 /* Function decls tend to have longer names. */
1908 if (TREE_CODE (t
) == FUNCTION_DECL
)
1915 fprintf (stderr
, "\n\t");
1918 print_node_brief (stderr
, "", t
, 0);
1919 if (t
== error_mark_node
)
1923 fprintf (stderr
, "\n");
1927 fprintf (stderr
, " tags:\t");
1929 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1931 if (TREE_PURPOSE (t
) == NULL_TREE
)
1933 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1940 fprintf (stderr
, "\n\t");
1943 if (TREE_PURPOSE (t
) == NULL_TREE
)
1945 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1946 fprintf (stderr
, ">");
1948 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1949 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1952 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1953 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1954 fprintf (stderr
, ">");
1958 fprintf (stderr
, "\n");
1960 if (lvl
->class_shadowed
)
1962 fprintf (stderr
, " class-shadowed:");
1963 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1965 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1967 fprintf (stderr
, "\n");
1969 if (lvl
->type_shadowed
)
1971 fprintf (stderr
, " type-shadowed:");
1972 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1974 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1976 fprintf (stderr
, "\n");
1981 print_other_binding_stack (stack
)
1982 struct binding_level
*stack
;
1984 struct binding_level
*level
;
1985 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1987 fprintf (stderr
, "binding level ");
1988 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1989 fprintf (stderr
, "\n");
1990 print_binding_level (level
);
1995 print_binding_stack ()
1997 struct binding_level
*b
;
1998 fprintf (stderr
, "current_binding_level=");
1999 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2000 fprintf (stderr
, "\nclass_binding_level=");
2001 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2002 fprintf (stderr
, "\nglobal_binding_level=");
2003 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2004 fprintf (stderr
, "\n");
2005 if (class_binding_level
)
2007 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2008 if (b
== current_binding_level
)
2011 b
= class_binding_level
;
2013 b
= current_binding_level
;
2016 b
= current_binding_level
;
2017 print_other_binding_stack (b
);
2018 fprintf (stderr
, "global:\n");
2019 print_binding_level (global_binding_level
);
2022 /* Namespace binding access routines: The namespace_bindings field of
2023 the identifier is polymorphic, with three possible values:
2024 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2025 indicating the BINDING_VALUE of global_namespace. */
2027 /* Check whether the a binding for the name to scope is known.
2028 Assumes that the bindings of the name are already a list
2029 of bindings. Returns the binding found, or NULL_TREE. */
2032 find_binding (name
, scope
)
2036 tree iter
, prev
= NULL_TREE
;
2038 scope
= ORIGINAL_NAMESPACE (scope
);
2040 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2041 iter
= TREE_CHAIN (iter
))
2043 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2044 if (BINDING_SCOPE (iter
) == scope
)
2046 /* Move binding found to the front of the list, so
2047 subsequent lookups will find it faster. */
2050 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2051 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2052 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2061 /* Always returns a binding for name in scope. If the
2062 namespace_bindings is not a list, convert it to one first.
2063 If no binding is found, make a new one. */
2066 binding_for_name (name
, scope
)
2070 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2073 scope
= ORIGINAL_NAMESPACE (scope
);
2075 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2077 /* Get rid of optimization for global scope. */
2078 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2079 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2080 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2082 if (b
&& (result
= find_binding (name
, scope
)))
2084 /* Not found, make a new permanent one. */
2085 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2086 result
= make_node (CPLUS_BINDING
);
2087 TREE_CHAIN (result
) = b
;
2088 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2089 BINDING_SCOPE (result
) = scope
;
2090 BINDING_TYPE (result
) = NULL_TREE
;
2091 BINDING_VALUE (result
) = NULL_TREE
;
2096 /* Return the binding value for name in scope, considering that
2097 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2100 namespace_binding (name
, scope
)
2104 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2107 if (scope
== NULL_TREE
)
2108 scope
= global_namespace
;
2109 if (TREE_CODE (b
) != CPLUS_BINDING
)
2110 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2111 name
= find_binding (name
,scope
);
2112 if (name
== NULL_TREE
)
2114 return BINDING_VALUE (name
);
2117 /* Set the binding value for name in scope. If modifying the binding
2118 of global_namespace is attempted, try to optimize it. */
2121 set_namespace_binding (name
, scope
, val
)
2128 if (scope
== NULL_TREE
)
2129 scope
= global_namespace
;
2131 if (scope
== global_namespace
)
2133 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2134 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2136 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2140 b
= binding_for_name (name
, scope
);
2141 BINDING_VALUE (b
) = val
;
2144 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2145 select a name that is unique to this compilation unit. */
2148 push_namespace (name
)
2153 int implicit_use
= 0;
2155 if (!global_namespace
)
2157 /* This must be ::. */
2158 my_friendly_assert (name
== get_identifier ("::"), 377);
2163 /* The name of anonymous namespace is unique for the translation
2165 if (!anonymous_namespace_name
)
2166 anonymous_namespace_name
= get_file_function_name ('N');
2167 name
= anonymous_namespace_name
;
2168 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2170 /* Reopening anonymous namespace. */
2174 else if (current_namespace
== global_namespace
2175 && name
== DECL_NAME (std_node
))
2182 /* Check whether this is an extended namespace definition. */
2183 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2184 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2187 if (DECL_NAMESPACE_ALIAS (d
))
2189 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2190 d
, DECL_NAMESPACE_ALIAS (d
));
2191 d
= DECL_NAMESPACE_ALIAS (d
);
2198 /* Make a new namespace, binding the name to it. */
2199 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2200 /* The global namespace is not pushed, and the global binding
2201 level is set elsewhere. */
2206 declare_namespace_level ();
2207 NAMESPACE_LEVEL (d
) = current_binding_level
;
2211 resume_binding_level (NAMESPACE_LEVEL (d
));
2214 do_using_directive (d
);
2215 /* Enter the name space. */
2216 current_namespace
= d
;
2219 /* Pop from the scope of the current namespace. */
2224 if (current_namespace
== global_namespace
)
2226 my_friendly_assert (in_std
>0, 980421);
2230 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2231 /* The binding level is not popped, as it might be re-opened later. */
2232 suspend_binding_level ();
2235 /* Push into the scope of the namespace NS, even if it is deeply
2236 nested within another namespace. */
2239 push_nested_namespace (ns
)
2242 if (ns
== global_namespace
)
2243 push_to_top_level ();
2246 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2247 push_namespace (DECL_NAME (ns
));
2251 /* Pop back from the scope of the namespace NS, which was previously
2252 entered with push_nested_namespace. */
2255 pop_nested_namespace (ns
)
2258 while (ns
!= global_namespace
)
2261 ns
= CP_DECL_CONTEXT (ns
);
2264 pop_from_top_level ();
2268 /* Subroutines for reverting temporarily to top-level for instantiation
2269 of templates and such. We actually need to clear out the class- and
2270 local-value slots of all identifiers, so that only the global values
2271 are at all visible. Simply setting current_binding_level to the global
2272 scope isn't enough, because more binding levels may be pushed. */
2273 struct saved_scope
*scope_chain
;
2275 /* Mark ST for GC. */
2279 struct stmt_tree
*st
;
2281 ggc_mark_tree (st
->x_last_stmt
);
2282 ggc_mark_tree (st
->x_last_expr_type
);
2285 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2288 mark_saved_scope (arg
)
2291 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2294 mark_binding_level (&t
->class_bindings
);
2295 ggc_mark_tree (t
->old_bindings
);
2296 ggc_mark_tree (t
->old_namespace
);
2297 ggc_mark_tree (t
->class_name
);
2298 ggc_mark_tree (t
->class_type
);
2299 ggc_mark_tree (t
->access_specifier
);
2300 ggc_mark_tree (t
->function_decl
);
2302 ggc_mark_tree_varray (t
->lang_base
);
2303 ggc_mark_tree (t
->lang_name
);
2304 ggc_mark_tree (t
->x_function_parms
);
2305 ggc_mark_tree (t
->template_parms
);
2306 ggc_mark_tree (t
->x_previous_class_type
);
2307 ggc_mark_tree (t
->x_previous_class_values
);
2308 ggc_mark_tree (t
->x_saved_tree
);
2310 mark_stmt_tree (&t
->x_stmt_tree
);
2311 mark_binding_level (&t
->bindings
);
2317 store_bindings (names
, old_bindings
)
2318 tree names
, old_bindings
;
2321 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2323 tree binding
, t1
, id
;
2325 if (TREE_CODE (t
) == TREE_LIST
)
2326 id
= TREE_PURPOSE (t
);
2331 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2332 we have no IDENTIFIER_BINDING if we have left the class
2333 scope, but cached the class-level declarations. */
2334 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2337 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2338 if (TREE_VEC_ELT (t1
, 0) == id
)
2341 binding
= make_tree_vec (4);
2345 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2346 TREE_VEC_ELT (binding
, 0) = id
;
2347 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2348 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2349 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2350 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2351 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2353 TREE_CHAIN (binding
) = old_bindings
;
2354 old_bindings
= binding
;
2358 return old_bindings
;
2362 maybe_push_to_top_level (pseudo
)
2365 struct saved_scope
*s
;
2366 struct binding_level
*b
;
2370 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2372 b
= scope_chain
? current_binding_level
: 0;
2374 /* If we're in the middle of some function, save our state. */
2375 if (current_function
)
2378 push_function_context_to (NULL_TREE
);
2383 old_bindings
= NULL_TREE
;
2384 if (scope_chain
&& previous_class_type
)
2385 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2387 /* Have to include global_binding_level, because class-level decls
2388 aren't listed anywhere useful. */
2389 for (; b
; b
= b
->level_chain
)
2393 /* Template IDs are inserted into the global level. If they were
2394 inserted into namespace level, finish_file wouldn't find them
2395 when doing pending instantiations. Therefore, don't stop at
2396 namespace level, but continue until :: . */
2397 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2400 old_bindings
= store_bindings (b
->names
, old_bindings
);
2401 /* We also need to check class_shadowed to save class-level type
2402 bindings, since pushclass doesn't fill in b->names. */
2403 if (b
->parm_flag
== 2)
2404 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2406 /* Unwind type-value slots back to top level. */
2407 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2408 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2410 s
->prev
= scope_chain
;
2411 s
->old_bindings
= old_bindings
;
2413 s
->need_pop_function_context
= need_pop
;
2414 s
->function_decl
= current_function_decl
;
2417 current_function_decl
= NULL_TREE
;
2418 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2419 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2420 current_lang_name
= lang_name_cplusplus
;
2421 strict_prototype
= strict_prototypes_lang_cplusplus
;
2422 current_namespace
= global_namespace
;
2424 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2428 push_to_top_level ()
2430 maybe_push_to_top_level (0);
2434 pop_from_top_level ()
2436 struct saved_scope
*s
= scope_chain
;
2439 /* Clear out class-level bindings cache. */
2440 if (previous_class_type
)
2441 invalidate_class_lookup_cache ();
2445 VARRAY_FREE (current_lang_base
);
2447 scope_chain
= s
->prev
;
2448 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2450 tree id
= TREE_VEC_ELT (t
, 0);
2453 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2454 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2455 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2459 if (current_lang_name
== lang_name_cplusplus
)
2460 strict_prototype
= strict_prototypes_lang_cplusplus
;
2461 else if (current_lang_name
== lang_name_c
)
2462 strict_prototype
= strict_prototypes_lang_c
;
2464 /* If we were in the middle of compiling a function, restore our
2466 if (s
->need_pop_function_context
)
2467 pop_function_context_from (NULL_TREE
);
2468 current_function_decl
= s
->function_decl
;
2473 /* Push a definition of struct, union or enum tag "name".
2474 into binding_level "b". "type" should be the type node,
2475 We assume that the tag "name" is not already defined.
2477 Note that the definition may really be just a forward reference.
2478 In that case, the TYPE_SIZE will be a NULL_TREE.
2480 C++ gratuitously puts all these tags in the name space. */
2482 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2483 record the shadowed value for this binding contour. TYPE is
2484 the type that ID maps to. */
2487 set_identifier_type_value_with_scope (id
, type
, b
)
2490 struct binding_level
*b
;
2492 if (!b
->namespace_p
)
2494 /* Shadow the marker, not the real thing, so that the marker
2495 gets restored later. */
2496 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2498 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2502 tree binding
= binding_for_name (id
, current_namespace
);
2503 BINDING_TYPE (binding
) = type
;
2504 /* Store marker instead of real type. */
2505 type
= global_type_node
;
2507 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2510 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2513 set_identifier_type_value (id
, type
)
2517 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2520 /* Return the type associated with id. */
2523 identifier_type_value (id
)
2526 /* There is no type with that name, anywhere. */
2527 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2529 /* This is not the type marker, but the real thing. */
2530 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2531 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2532 /* Have to search for it. It must be on the global level, now.
2533 Ask lookup_name not to return non-types. */
2534 id
= lookup_name_real (id
, 2, 1, 0);
2536 return TREE_TYPE (id
);
2540 /* Pop off extraneous binding levels left over due to syntax errors.
2542 We don't pop past namespaces, as they might be valid. */
2547 #ifdef DEBUG_CP_BINDING_LEVELS
2548 fprintf (stderr
, "XXX entering pop_everything ()\n");
2550 while (!toplevel_bindings_p ())
2552 if (current_binding_level
->parm_flag
== 2)
2553 pop_nested_class ();
2557 #ifdef DEBUG_CP_BINDING_LEVELS
2558 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2562 /* The type TYPE is being declared. If it is a class template, or a
2563 specialization of a class template, do any processing required and
2564 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2565 being declared a friend. B is the binding level at which this TYPE
2568 Returns the TYPE_DECL for TYPE, which may have been altered by this
2572 maybe_process_template_type_declaration (type
, globalize
, b
)
2575 struct binding_level
* b
;
2577 tree decl
= TYPE_NAME (type
);
2579 if (processing_template_parmlist
)
2580 /* You can't declare a new template type in a template parameter
2581 list. But, you can declare a non-template type:
2583 template <class A*> struct S;
2585 is a forward-declaration of `A'. */
2589 maybe_check_template_type (type
);
2591 my_friendly_assert (IS_AGGR_TYPE (type
)
2592 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2595 if (processing_template_decl
)
2597 /* This may change after the call to
2598 push_template_decl_real, but we want the original value. */
2599 tree name
= DECL_NAME (decl
);
2601 decl
= push_template_decl_real (decl
, globalize
);
2602 /* If the current binding level is the binding level for the
2603 template parameters (see the comment in
2604 begin_template_parm_list) and the enclosing level is a class
2605 scope, and we're not looking at a friend, push the
2606 declaration of the member class into the class scope. In the
2607 friend case, push_template_decl will already have put the
2608 friend into global scope, if appropriate. */
2609 if (TREE_CODE (type
) != ENUMERAL_TYPE
2610 && !globalize
&& b
->pseudo_global
2611 && b
->level_chain
->parm_flag
== 2)
2613 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2614 /* Put this tag on the list of tags for the class, since
2615 that won't happen below because B is not the class
2616 binding level, but is instead the pseudo-global level. */
2617 b
->level_chain
->tags
=
2618 tree_cons (name
, type
, b
->level_chain
->tags
);
2619 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2620 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2628 /* In C++, you don't have to write `struct S' to refer to `S'; you
2629 can just use `S'. We accomplish this by creating a TYPE_DECL as
2630 if the user had written `typedef struct S S'. Create and return
2631 the TYPE_DECL for TYPE. */
2634 create_implicit_typedef (name
, type
)
2640 decl
= build_decl (TYPE_DECL
, name
, type
);
2641 SET_DECL_ARTIFICIAL (decl
);
2642 /* There are other implicit type declarations, like the one *within*
2643 a class that allows you to write `S::S'. We must distinguish
2645 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2646 TYPE_NAME (type
) = decl
;
2651 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2652 Normally put it into the inner-most non-tag-transparent scope,
2653 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2654 The latter is needed for implicit declarations. */
2657 pushtag (name
, type
, globalize
)
2661 register struct binding_level
*b
;
2663 b
= current_binding_level
;
2664 while (b
->tag_transparent
2665 || (globalize
&& b
->parm_flag
== 2))
2668 b
->tags
= tree_cons (name
, type
, b
->tags
);
2672 /* Do C++ gratuitous typedefing. */
2673 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2675 register tree d
= NULL_TREE
;
2677 tree context
= TYPE_CONTEXT (type
);
2681 tree cs
= current_scope ();
2685 else if (cs
!= NULL_TREE
2686 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2687 /* When declaring a friend class of a local class, we want
2688 to inject the newly named class into the scope
2689 containing the local class, not the namespace scope. */
2690 context
= hack_decl_function_context (get_type_decl (cs
));
2693 context
= current_namespace
;
2695 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2696 || b
->parm_flag
== 2)
2699 if (current_lang_name
== lang_name_java
)
2700 TYPE_FOR_JAVA (type
) = 1;
2702 d
= create_implicit_typedef (name
, type
);
2703 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2705 set_identifier_type_value_with_scope (name
, type
, b
);
2707 d
= maybe_process_template_type_declaration (type
,
2710 if (b
->parm_flag
== 2)
2712 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2713 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2714 class. But if it's a member template class, we
2715 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2717 finish_member_declaration (d
);
2719 pushdecl_class_level (d
);
2722 d
= pushdecl_with_scope (d
, b
);
2724 if (ANON_AGGRNAME_P (name
))
2725 DECL_IGNORED_P (d
) = 1;
2727 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2728 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2729 if (!uses_template_parms (type
))
2730 DECL_ASSEMBLER_NAME (d
)
2731 = get_identifier (build_overload_name (type
, 1, 1));
2733 if (b
->parm_flag
== 2)
2735 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2736 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2740 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2741 /* Use the canonical TYPE_DECL for this node. */
2742 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2745 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2746 will be the tagged type we just added to the current
2747 binding level. This fake NULL-named TYPE_DECL node helps
2748 dwarfout.c to know when it needs to output a
2749 representation of a tagged type, and it also gives us a
2750 convenient place to record the "scope start" address for
2753 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2754 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2758 /* Counter used to create anonymous type names. */
2760 static int anon_cnt
= 0;
2762 /* Return an IDENTIFIER which can be used as a name for
2763 anonymous structs and unions. */
2770 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2771 return get_identifier (buf
);
2774 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2775 This keeps dbxout from getting confused. */
2780 register struct binding_level
*b
;
2782 static int last_cnt
= 0;
2784 /* Fast out if no new anon names were declared. */
2785 if (last_cnt
== anon_cnt
)
2788 b
= current_binding_level
;
2789 while (b
->tag_transparent
)
2794 /* A NULL purpose means we have already processed all tags
2795 from here to the end of the list. */
2796 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2798 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2799 TREE_PURPOSE (tags
) = NULL_TREE
;
2800 tags
= TREE_CHAIN (tags
);
2802 last_cnt
= anon_cnt
;
2805 /* Subroutine of duplicate_decls: return truthvalue of whether
2806 or not types of these decls match.
2808 For C++, we must compare the parameter list so that `int' can match
2809 `int&' in a parameter position, but `int&' is not confused with
2813 decls_match (newdecl
, olddecl
)
2814 tree newdecl
, olddecl
;
2818 if (newdecl
== olddecl
)
2821 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2822 /* If the two DECLs are not even the same kind of thing, we're not
2823 interested in their types. */
2826 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2828 tree f1
= TREE_TYPE (newdecl
);
2829 tree f2
= TREE_TYPE (olddecl
);
2830 tree p1
= TYPE_ARG_TYPES (f1
);
2831 tree p2
= TYPE_ARG_TYPES (f2
);
2833 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2834 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2835 && DECL_LANGUAGE (olddecl
) == lang_c
))
2838 /* When we parse a static member function definition,
2839 we put together a FUNCTION_DECL which thinks its type
2840 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2842 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2843 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2844 else if (TREE_CODE (f2
) == METHOD_TYPE
2845 && DECL_STATIC_FUNCTION_P (newdecl
))
2846 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2848 /* Here we must take care of the case where new default
2849 parameters are specified. Also, warn if an old
2850 declaration becomes ambiguous because default
2851 parameters may cause the two to be ambiguous. */
2852 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2854 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2855 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2857 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2861 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2863 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2866 types_match
= self_promoting_args_p (p1
);
2867 if (p1
== void_list_node
)
2868 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2870 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2871 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2873 types_match
= self_promoting_args_p (p2
);
2874 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2877 types_match
= compparms (p1
, p2
);
2882 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2884 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2885 DECL_TEMPLATE_PARMS (olddecl
)))
2888 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2891 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2892 DECL_TEMPLATE_RESULT (newdecl
));
2896 if (TREE_TYPE (newdecl
) == error_mark_node
)
2897 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2898 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2899 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2900 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2903 types_match
= comptypes (TREE_TYPE (newdecl
),
2904 TREE_TYPE (olddecl
),
2905 COMPARE_REDECLARATION
);
2911 /* If NEWDECL is `static' and an `extern' was seen previously,
2912 warn about it. OLDDECL is the previous declaration.
2914 Note that this does not apply to the C++ case of declaring
2915 a variable `extern const' and then later `const'.
2917 Don't complain about built-in functions, since they are beyond
2918 the user's control. */
2921 warn_extern_redeclared_static (newdecl
, olddecl
)
2922 tree newdecl
, olddecl
;
2924 static const char *explicit_extern_static_warning
2925 = "`%D' was declared `extern' and later `static'";
2926 static const char *implicit_extern_static_warning
2927 = "`%D' was declared implicitly `extern' and later `static'";
2931 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2934 /* Don't get confused by static member functions; that's a different
2936 if (TREE_CODE (newdecl
) == FUNCTION_DECL
2937 && DECL_STATIC_FUNCTION_P (newdecl
))
2940 /* If the old declaration was `static', or the new one isn't, then
2941 then everything is OK. */
2942 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
2945 /* It's OK to declare a builtin function as `static'. */
2946 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2947 && DECL_ARTIFICIAL (olddecl
))
2950 name
= DECL_ASSEMBLER_NAME (newdecl
);
2951 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2952 ? implicit_extern_static_warning
2953 : explicit_extern_static_warning
, newdecl
);
2954 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2957 /* Handle when a new declaration NEWDECL has the same name as an old
2958 one OLDDECL in the same binding contour. Prints an error message
2961 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2962 Otherwise, return 0. */
2965 duplicate_decls (newdecl
, olddecl
)
2966 tree newdecl
, olddecl
;
2968 unsigned olddecl_uid
= DECL_UID (olddecl
);
2969 int olddecl_friend
= 0, types_match
= 0;
2970 int new_defines_function
= 0;
2972 if (newdecl
== olddecl
)
2975 types_match
= decls_match (newdecl
, olddecl
);
2977 /* If either the type of the new decl or the type of the old decl is an
2978 error_mark_node, then that implies that we have already issued an
2979 error (earlier) for some bogus type specification, and in that case,
2980 it is rather pointless to harass the user with yet more error message
2981 about the same declaration, so just pretend the types match here. */
2982 if (TREE_TYPE (newdecl
) == error_mark_node
2983 || TREE_TYPE (olddecl
) == error_mark_node
)
2986 /* Check for redeclaration and other discrepancies. */
2987 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2988 && DECL_ARTIFICIAL (olddecl
))
2990 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2992 /* If you declare a built-in or predefined function name as static,
2993 the old definition is overridden, but optionally warn this was a
2994 bad choice of name. */
2995 if (! TREE_PUBLIC (newdecl
))
2998 cp_warning ("shadowing %s function `%#D'",
2999 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3001 /* Discard the old built-in function. */
3004 /* If the built-in is not ansi, then programs can override
3005 it even globally without an error. */
3006 else if (! DECL_BUILT_IN (olddecl
))
3007 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3011 cp_error ("declaration of `%#D'", newdecl
);
3012 cp_error ("conflicts with built-in declaration `%#D'",
3017 else if (!types_match
)
3019 if ((DECL_LANGUAGE (newdecl
) == lang_c
3020 && DECL_LANGUAGE (olddecl
) == lang_c
)
3021 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3022 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3024 /* A near match; override the builtin. */
3026 if (TREE_PUBLIC (newdecl
))
3028 cp_warning ("new declaration `%#D'", newdecl
);
3029 cp_warning ("ambiguates built-in declaration `%#D'",
3032 else if (warn_shadow
)
3033 cp_warning ("shadowing %s function `%#D'",
3034 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3038 /* Discard the old built-in function. */
3042 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3044 /* If a builtin function is redeclared as `static', merge
3045 the declarations, but make the original one static. */
3046 DECL_THIS_STATIC (olddecl
) = 1;
3047 TREE_PUBLIC (olddecl
) = 0;
3049 /* Make the olddeclaration consistent with the new one so that
3050 all remnants of the builtin-ness of this function will be
3052 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3053 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3054 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3055 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3059 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3061 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3062 && TREE_CODE (newdecl
) != TYPE_DECL
3063 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3064 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3065 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3066 && TREE_CODE (olddecl
) != TYPE_DECL
3067 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3068 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3071 /* We do nothing special here, because C++ does such nasty
3072 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3073 get shadowed, and know that if we need to find a TYPE_DECL
3074 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3075 slot of the identifier. */
3079 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3080 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3081 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3082 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3085 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3086 if (TREE_CODE (olddecl
) == TREE_LIST
)
3087 olddecl
= TREE_VALUE (olddecl
);
3088 cp_error_at ("previous declaration of `%#D'", olddecl
);
3090 /* New decl is completely inconsistent with the old one =>
3091 tell caller to replace the old one. */
3095 else if (!types_match
)
3097 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3098 /* These are certainly not duplicate declarations; they're
3099 from different scopes. */
3102 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3104 /* The name of a class template may not be declared to refer to
3105 any other template, class, function, object, namespace, value,
3106 or type in the same scope. */
3107 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3108 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3110 cp_error ("declaration of template `%#D'", newdecl
);
3111 cp_error_at ("conflicts with previous declaration `%#D'",
3114 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3115 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3116 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3117 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3118 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3119 DECL_TEMPLATE_PARMS (olddecl
)))
3121 cp_error ("new declaration `%#D'", newdecl
);
3122 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3126 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3128 if (DECL_LANGUAGE (newdecl
) == lang_c
3129 && DECL_LANGUAGE (olddecl
) == lang_c
)
3131 cp_error ("declaration of C function `%#D' conflicts with",
3133 cp_error_at ("previous declaration `%#D' here", olddecl
);
3135 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3136 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3138 cp_error ("new declaration `%#D'", newdecl
);
3139 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3145 /* Already complained about this, so don't do so again. */
3146 else if (current_class_type
== NULL_TREE
3147 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3149 cp_error ("conflicting types for `%#D'", newdecl
);
3150 cp_error_at ("previous declaration as `%#D'", olddecl
);
3153 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3154 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3155 && (!DECL_TEMPLATE_INFO (newdecl
)
3156 || (DECL_TI_TEMPLATE (newdecl
)
3157 != DECL_TI_TEMPLATE (olddecl
))))
3158 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3159 && (!DECL_TEMPLATE_INFO (olddecl
)
3160 || (DECL_TI_TEMPLATE (olddecl
)
3161 != DECL_TI_TEMPLATE (newdecl
))))))
3162 /* It's OK to have a template specialization and a non-template
3163 with the same type, or to have specializations of two
3164 different templates with the same type. Note that if one is a
3165 specialization, and the other is an instantiation of the same
3166 template, that we do not exit at this point. That situation
3167 can occur if we instantiate a template class, and then
3168 specialize one of its methods. This situation is legal, but
3169 the declarations must be merged in the usual way. */
3171 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3172 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3173 && !DECL_USE_TEMPLATE (newdecl
))
3174 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3175 && !DECL_USE_TEMPLATE (olddecl
))))
3176 /* One of the declarations is a template instantiation, and the
3177 other is not a template at all. That's OK. */
3179 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3180 && DECL_NAMESPACE_ALIAS (newdecl
)
3181 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3182 /* Redeclaration of namespace alias, ignore it. */
3186 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3189 cp_error (errmsg
, newdecl
);
3190 if (DECL_NAME (olddecl
) != NULL_TREE
)
3191 cp_error_at ((DECL_INITIAL (olddecl
)
3192 && namespace_bindings_p ())
3193 ? "`%#D' previously defined here"
3194 : "`%#D' previously declared here", olddecl
);
3196 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3197 && DECL_INITIAL (olddecl
) != NULL_TREE
3198 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3199 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3201 /* Prototype decl follows defn w/o prototype. */
3202 cp_warning_at ("prototype for `%#D'", newdecl
);
3203 cp_warning_at ("follows non-prototype definition here", olddecl
);
3205 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3206 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3208 /* extern "C" int foo ();
3209 int foo () { bar (); }
3211 if (current_lang_stack
3212 == &VARRAY_TREE (current_lang_base
, 0))
3213 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3216 cp_error_at ("previous declaration of `%#D' with %L linkage",
3217 olddecl
, DECL_LANGUAGE (olddecl
));
3218 cp_error ("conflicts with new declaration with %L linkage",
3219 DECL_LANGUAGE (newdecl
));
3223 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3225 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3227 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3228 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3231 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3232 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3234 for (; t1
&& t1
!= void_list_node
;
3235 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3236 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3238 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3243 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3245 cp_pedwarn_at ("after previous specification in `%#D'",
3251 cp_error ("default argument given for parameter %d of `%#D'",
3253 cp_error_at ("after previous specification in `%#D'",
3258 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3259 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3261 cp_warning ("`%#D' was used before it was declared inline",
3263 cp_warning_at ("previous non-inline declaration here",
3269 /* If new decl is `static' and an `extern' was seen previously,
3271 warn_extern_redeclared_static (newdecl
, olddecl
);
3273 /* We have committed to returning 1 at this point. */
3274 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3276 /* Now that functions must hold information normally held
3277 by field decls, there is extra work to do so that
3278 declaration information does not get destroyed during
3280 if (DECL_VINDEX (olddecl
))
3281 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3282 if (DECL_CONTEXT (olddecl
))
3283 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3284 if (DECL_CLASS_CONTEXT (olddecl
))
3285 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3286 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3287 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3288 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3289 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3290 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3291 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3292 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3293 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3294 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3296 /* Optionally warn about more than one declaration for the same
3297 name, but don't warn about a function declaration followed by a
3299 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3300 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3301 /* Don't warn about extern decl followed by definition. */
3302 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3303 /* Don't warn about friends, let add_friend take care of it. */
3304 && ! DECL_FRIEND_P (newdecl
))
3306 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3307 cp_warning_at ("previous declaration of `%D'", olddecl
);
3311 /* Deal with C++: must preserve virtual function table size. */
3312 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3314 register tree newtype
= TREE_TYPE (newdecl
);
3315 register tree oldtype
= TREE_TYPE (olddecl
);
3317 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3318 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3320 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3321 CLASSTYPE_FRIEND_CLASSES (newtype
)
3322 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3326 /* Copy all the DECL_... slots specified in the new decl
3327 except for any that we copy here from the old type. */
3328 DECL_MACHINE_ATTRIBUTES (newdecl
)
3329 = merge_machine_decl_attributes (olddecl
, newdecl
);
3331 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3333 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3334 DECL_TEMPLATE_RESULT (olddecl
)))
3335 cp_error ("invalid redeclaration of %D", newdecl
);
3336 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3337 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3338 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3339 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3346 /* Automatically handles default parameters. */
3347 tree oldtype
= TREE_TYPE (olddecl
);
3350 /* Make sure we put the new type in the same obstack as the old one. */
3352 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3354 push_permanent_obstack ();
3356 /* Merge the data types specified in the two decls. */
3357 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3359 if (TREE_CODE (newdecl
) == VAR_DECL
)
3360 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3361 /* Do this after calling `common_type' so that default
3362 parameters don't confuse us. */
3363 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3364 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3365 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3367 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3368 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3369 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3370 TYPE_RAISES_EXCEPTIONS (oldtype
));
3372 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3373 && DECL_SOURCE_LINE (olddecl
) != 0
3375 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3376 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3378 cp_error ("declaration of `%F' throws different exceptions",
3380 cp_error_at ("to previous declaration `%F'", olddecl
);
3383 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3385 /* Lay the type out, unless already done. */
3386 if (! same_type_p (newtype
, oldtype
)
3387 && TREE_TYPE (newdecl
) != error_mark_node
3388 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3389 layout_type (TREE_TYPE (newdecl
));
3391 if ((TREE_CODE (newdecl
) == VAR_DECL
3392 || TREE_CODE (newdecl
) == PARM_DECL
3393 || TREE_CODE (newdecl
) == RESULT_DECL
3394 || TREE_CODE (newdecl
) == FIELD_DECL
3395 || TREE_CODE (newdecl
) == TYPE_DECL
)
3396 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3397 layout_decl (newdecl
, 0);
3399 /* Merge the type qualifiers. */
3400 if (TREE_READONLY (newdecl
))
3401 TREE_READONLY (olddecl
) = 1;
3402 if (TREE_THIS_VOLATILE (newdecl
))
3403 TREE_THIS_VOLATILE (olddecl
) = 1;
3405 /* Merge the initialization information. */
3406 if (DECL_INITIAL (newdecl
) == NULL_TREE
3407 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3409 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3410 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3411 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3412 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3413 && DECL_LANG_SPECIFIC (newdecl
)
3414 && DECL_LANG_SPECIFIC (olddecl
))
3415 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3418 /* Merge the section attribute.
3419 We want to issue an error if the sections conflict but that must be
3420 done later in decl_attributes since we are called before attributes
3422 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3423 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3425 /* Keep the old rtl since we can safely use it. */
3426 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3430 /* If cannot merge, then use the new type and qualifiers,
3431 and don't preserve the old rtl. */
3434 /* Clean out any memory we had of the old declaration. */
3435 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3437 TREE_VALUE (oldstatic
) = error_mark_node
;
3439 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3440 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3441 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3442 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3445 /* Merge the storage class information. */
3446 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3447 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3448 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3449 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3450 if (! DECL_EXTERNAL (olddecl
))
3451 DECL_EXTERNAL (newdecl
) = 0;
3453 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3455 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3456 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3457 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3458 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3459 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3460 /* Don't really know how much of the language-specific
3461 values we should copy from old to new. */
3462 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3463 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3464 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3465 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3466 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3468 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3469 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3470 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3471 DECL_BEFRIENDING_CLASSES (newdecl
)
3472 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3473 DECL_BEFRIENDING_CLASSES (olddecl
));
3476 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3478 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3479 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3481 /* If newdecl is not a specialization, then it is not a
3482 template-related function at all. And that means that we
3483 shoud have exited above, returning 0. */
3484 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3487 if (TREE_USED (olddecl
))
3488 /* From [temp.expl.spec]:
3490 If a template, a member template or the member of a class
3491 template is explicitly specialized then that
3492 specialization shall be declared before the first use of
3493 that specialization that would cause an implicit
3494 instantiation to take place, in every translation unit in
3495 which such a use occurs. */
3496 cp_error ("explicit specialization of %D after first use",
3499 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3501 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3503 /* If either decl says `inline', this fn is inline, unless its
3504 definition was passed already. */
3505 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3506 DECL_INLINE (olddecl
) = 1;
3507 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3511 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3512 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3513 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3515 if (! types_match
|| new_defines_function
)
3517 /* These need to be copied so that the names are available.
3518 Note that if the types do match, we'll preserve inline
3519 info and other bits, but if not, we won't. */
3520 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3521 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3523 if (new_defines_function
)
3524 /* If defining a function declared with other language
3525 linkage, use the previously declared language linkage. */
3526 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3527 else if (types_match
)
3529 /* If redeclaring a builtin function, and not a definition,
3530 it stays built in. */
3531 if (DECL_BUILT_IN (olddecl
))
3533 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3534 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3535 /* If we're keeping the built-in definition, keep the rtl,
3536 regardless of declaration matches. */
3537 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3540 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3542 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3543 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3544 /* Previously saved insns go together with
3545 the function's previous definition. */
3546 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3547 /* Don't clear out the arguments if we're redefining a function. */
3548 if (DECL_ARGUMENTS (olddecl
))
3549 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3551 if (DECL_LANG_SPECIFIC (olddecl
))
3552 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3555 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3557 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3560 /* Now preserve various other info from the definition. */
3561 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3562 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3563 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3564 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3566 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3570 function_size
= sizeof (struct tree_decl
);
3572 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3573 (char *) olddecl
+ sizeof (struct tree_common
),
3574 function_size
- sizeof (struct tree_common
));
3576 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3578 /* If newdecl is a template instantiation, it is possible that
3579 the following sequence of events has occurred:
3581 o A friend function was declared in a class template. The
3582 class template was instantiated.
3584 o The instantiation of the friend declaration was
3585 recorded on the instantiation list, and is newdecl.
3587 o Later, however, instantiate_class_template called pushdecl
3588 on the newdecl to perform name injection. But, pushdecl in
3589 turn called duplicate_decls when it discovered that another
3590 declaration of a global function with the same name already
3593 o Here, in duplicate_decls, we decided to clobber newdecl.
3595 If we're going to do that, we'd better make sure that
3596 olddecl, and not newdecl, is on the list of
3597 instantiations so that if we try to do the instantiation
3598 again we won't get the clobbered declaration. */
3600 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3601 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3603 for (; decls
; decls
= TREE_CHAIN (decls
))
3604 if (TREE_VALUE (decls
) == newdecl
)
3605 TREE_VALUE (decls
) = olddecl
;
3610 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3611 (char *) olddecl
+ sizeof (struct tree_common
),
3612 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3613 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3616 DECL_UID (olddecl
) = olddecl_uid
;
3618 DECL_FRIEND_P (olddecl
) = 1;
3620 /* NEWDECL contains the merged attribute lists.
3621 Update OLDDECL to be the same. */
3622 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3627 /* Record a decl-node X as belonging to the current lexical scope.
3628 Check for errors (such as an incompatible declaration for the same
3629 name already seen in the same scope).
3631 Returns either X or an old decl for the same name.
3632 If an old decl is returned, it may have been smashed
3633 to agree with what X says. */
3641 int need_new_binding
;
3643 /* We shouldn't be calling pushdecl when we're generating RTL for a
3644 function that we already did semantic analysis on previously. */
3645 my_friendly_assert (!current_function
|| doing_semantic_analysis_p (),
3648 name
= DECL_ASSEMBLER_NAME (x
);
3649 need_new_binding
= 1;
3651 if (DECL_TEMPLATE_PARM_P (x
))
3652 /* Template parameters have no context; they are not X::T even
3653 when declared within a class or namespace. */
3657 if (current_function_decl
&& x
!= current_function_decl
3658 /* A local declaration for a function doesn't constitute
3660 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3661 /* A local declaration for an `extern' variable is in the
3662 scoped of the current namespace, not the current
3664 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3665 /* Don't change DECL_CONTEXT of virtual methods. */
3666 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3667 && !DECL_CONTEXT (x
))
3668 DECL_CONTEXT (x
) = current_function_decl
;
3669 if (!DECL_CONTEXT (x
))
3670 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3673 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3674 compiler wants to use. */
3675 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3676 || TREE_CODE (x
) == NAMESPACE_DECL
)
3677 name
= DECL_NAME (x
);
3682 /* Not needed...see below. */
3686 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3687 name
= TREE_OPERAND (name
, 0);
3689 /* Namespace-scoped variables are not found in the current level. */
3690 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3691 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3693 t
= lookup_name_current_level (name
);
3694 if (t
== error_mark_node
)
3696 /* error_mark_node is 0 for a while during initialization! */
3698 cp_error_at ("`%#D' used prior to declaration", x
);
3701 else if (t
!= NULL_TREE
)
3704 /* This is turned off until I have time to do it right (bpk). */
3705 /* With the code below that uses it... */
3706 file
= DECL_SOURCE_FILE (t
);
3707 line
= DECL_SOURCE_LINE (t
);
3709 if (TREE_CODE (t
) == PARM_DECL
)
3711 if (DECL_CONTEXT (t
) == NULL_TREE
)
3712 fatal ("parse errors have confused me too much");
3714 /* Check for duplicate params. */
3715 if (duplicate_decls (x
, t
))
3718 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3719 || DECL_FUNCTION_TEMPLATE_P (x
))
3720 && is_overloaded_fn (t
))
3721 /* Don't do anything just yet. */;
3722 else if (t
== wchar_decl_node
)
3724 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3725 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3727 /* Throw away the redeclaration. */
3730 else if (TREE_CODE (t
) != TREE_CODE (x
))
3732 if (duplicate_decls (x
, t
))
3735 else if (duplicate_decls (x
, t
))
3738 /* This is turned off until I have time to do it right (bpk). */
3740 /* Also warn if they did a prototype with `static' on it, but
3741 then later left the `static' off. */
3742 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3744 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3749 cp_warning ("`static' missing from declaration of `%D'",
3751 warning_with_file_and_line (file
, line
,
3752 "previous declaration of `%s'",
3753 decl_as_string (t
, 0));
3756 /* Now fix things so it'll do what they expect. */
3757 if (current_function_decl
)
3758 TREE_PUBLIC (current_function_decl
) = 0;
3760 /* Due to interference in memory reclamation (X may be
3761 obstack-deallocated at this point), we must guard against
3762 one really special case. [jason: This should be handled
3763 by start_function] */
3764 if (current_function_decl
== x
)
3765 current_function_decl
= t
;
3767 if (TREE_CODE (t
) == TYPE_DECL
)
3768 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3769 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3770 check_default_args (t
);
3774 else if (DECL_MAIN_P (x
))
3776 /* A redeclaration of main, but not a duplicate of the
3781 This function shall not be overloaded. */
3782 cp_error_at ("invalid redeclaration of `%D'", t
);
3783 cp_error ("as `%D'", x
);
3784 /* We don't try to push this declaration since that
3790 check_template_shadow (x
);
3792 /* If this is a function conjured up by the backend, massage it
3793 so it looks friendly. */
3794 if (TREE_CODE (x
) == FUNCTION_DECL
3795 && ! DECL_LANG_SPECIFIC (x
))
3797 retrofit_lang_decl (x
);
3798 DECL_LANGUAGE (x
) = lang_c
;
3801 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3803 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3806 if (!namespace_bindings_p ())
3807 /* We do not need to create a binding for this name;
3808 push_overloaded_decl will have already done so if
3810 need_new_binding
= 0;
3812 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3814 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3816 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3820 /* If declaring a type as a typedef, copy the type (unless we're
3821 at line 0), and install this TYPE_DECL as the new type's typedef
3822 name. See the extensive comment in ../c-decl.c (pushdecl). */
3823 if (TREE_CODE (x
) == TYPE_DECL
)
3825 tree type
= TREE_TYPE (x
);
3826 if (DECL_SOURCE_LINE (x
) == 0)
3828 if (TYPE_NAME (type
) == 0)
3829 TYPE_NAME (type
) = x
;
3831 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3832 /* We don't want to copy the type when all we're
3833 doing is making a TYPE_DECL for the purposes of
3835 && (!TYPE_NAME (type
)
3836 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3838 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3840 DECL_ORIGINAL_TYPE (x
) = type
;
3841 type
= build_type_copy (type
);
3842 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3843 TYPE_NAME (type
) = x
;
3844 TREE_TYPE (x
) = type
;
3849 if (type
!= error_mark_node
3851 && TYPE_IDENTIFIER (type
))
3852 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3853 current_binding_level
);
3857 /* Multiple external decls of the same identifier ought to match.
3859 We get warnings about inline functions where they are defined.
3860 We get warnings about other functions from push_overloaded_decl.
3862 Avoid duplicate warnings where they are used. */
3863 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3867 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3868 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3869 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3870 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3875 /* If different sort of thing, we already gave an error. */
3876 && TREE_CODE (decl
) == TREE_CODE (x
)
3877 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3879 cp_pedwarn ("type mismatch with previous external decl", x
);
3880 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3884 /* This name is new in its binding level.
3885 Install the new declaration and return it. */
3886 if (namespace_bindings_p ())
3888 /* Install a global value. */
3890 /* If the first global decl has external linkage,
3891 warn if we later see static one. */
3892 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3893 TREE_PUBLIC (name
) = 1;
3895 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3897 /* For an ordinary function, we create a binding from
3898 the mangled name (i.e., NAME) to the DECL. But, for
3899 an `extern "C"' function, the mangled name and the
3900 ordinary name are the same so we need not do this. */
3901 && !(TREE_CODE (x
) == FUNCTION_DECL
&&
3902 DECL_LANGUAGE (x
) == lang_c
))
3904 if (TREE_CODE (x
) == FUNCTION_DECL
)
3906 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3907 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3908 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3911 /* Don't forget if the function was used via an implicit decl. */
3912 if (IDENTIFIER_IMPLICIT_DECL (name
)
3913 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3916 /* Don't forget if its address was taken in that way. */
3917 if (IDENTIFIER_IMPLICIT_DECL (name
)
3918 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3919 TREE_ADDRESSABLE (x
) = 1;
3921 /* Warn about mismatches against previous implicit decl. */
3922 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3923 /* If this real decl matches the implicit, don't complain. */
3924 && ! (TREE_CODE (x
) == FUNCTION_DECL
3925 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3927 ("`%D' was previously implicitly declared to return `int'", x
);
3929 /* If new decl is `static' and an `extern' was seen previously,
3931 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3932 warn_extern_redeclared_static (x
, t
);
3936 /* Here to install a non-global value. */
3937 tree oldlocal
= IDENTIFIER_VALUE (name
);
3938 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3940 if (need_new_binding
)
3942 push_local_binding (name
, x
, 0);
3943 /* Because push_local_binding will hook X on to the
3944 current_binding_level's name list, we don't want to
3945 do that again below. */
3946 need_new_binding
= 0;
3949 /* If this is a TYPE_DECL, push it into the type value slot. */
3950 if (TREE_CODE (x
) == TYPE_DECL
)
3951 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3952 current_binding_level
);
3954 /* Clear out any TYPE_DECL shadowed by a namespace so that
3955 we won't think this is a type. The C struct hack doesn't
3956 go through namespaces. */
3957 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3958 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3959 current_binding_level
);
3961 /* If this is an extern function declaration, see if we
3962 have a global definition or declaration for the function. */
3963 if (oldlocal
== NULL_TREE
3964 && DECL_EXTERNAL (x
)
3965 && oldglobal
!= NULL_TREE
3966 && TREE_CODE (x
) == FUNCTION_DECL
3967 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3969 /* We have one. Their types must agree. */
3970 if (decls_match (x
, oldglobal
))
3974 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3975 cp_warning_at ("global declaration `%#D'", oldglobal
);
3978 /* If we have a local external declaration,
3979 and no file-scope declaration has yet been seen,
3980 then if we later have a file-scope decl it must not be static. */
3981 if (oldlocal
== NULL_TREE
3982 && oldglobal
== NULL_TREE
3983 && DECL_EXTERNAL (x
)
3985 TREE_PUBLIC (name
) = 1;
3987 if (DECL_FROM_INLINE (x
))
3988 /* Inline decls shadow nothing. */;
3990 /* Warn if shadowing an argument at the top level of the body. */
3991 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3992 && TREE_CODE (oldlocal
) == PARM_DECL
3993 /* Don't complain if it's from an enclosing function. */
3994 && DECL_CONTEXT (oldlocal
) == current_function_decl
3995 && TREE_CODE (x
) != PARM_DECL
)
3997 /* Go to where the parms should be and see if we
3999 struct binding_level
*b
= current_binding_level
->level_chain
;
4005 if (b
->parm_flag
== 1)
4006 cp_error ("declaration of `%#D' shadows a parameter", name
);
4008 else if (warn_shadow
&& oldlocal
!= NULL_TREE
4009 && current_binding_level
->is_for_scope
4010 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
4012 warning ("variable `%s' shadows local",
4013 IDENTIFIER_POINTER (name
));
4014 cp_warning_at (" this is the shadowed declaration", oldlocal
);
4016 /* Maybe warn if shadowing something else. */
4017 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4018 /* No shadow warnings for internally generated vars. */
4019 && ! DECL_ARTIFICIAL (x
)
4020 /* No shadow warnings for vars made for inlining. */
4021 && ! DECL_FROM_INLINE (x
))
4023 const char *warnstring
= NULL
;
4025 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4026 warnstring
= "declaration of `%s' shadows a parameter";
4027 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4028 && current_class_ptr
4029 && !TREE_STATIC (name
))
4030 warnstring
= "declaration of `%s' shadows a member of `this'";
4031 else if (oldlocal
!= NULL_TREE
)
4032 warnstring
= "declaration of `%s' shadows previous local";
4033 else if (oldglobal
!= NULL_TREE
)
4034 /* XXX shadow warnings in outer-more namespaces */
4035 warnstring
= "declaration of `%s' shadows global declaration";
4038 warning (warnstring
, IDENTIFIER_POINTER (name
));
4042 if (TREE_CODE (x
) == FUNCTION_DECL
)
4043 check_default_args (x
);
4045 /* Keep count of variables in this level with incomplete type. */
4046 if (TREE_CODE (x
) == VAR_DECL
4047 && TREE_TYPE (x
) != error_mark_node
4048 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4049 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4050 /* RTTI TD entries are created while defining the type_info. */
4051 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4052 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4053 current_binding_level
->incomplete
4054 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4057 if (need_new_binding
)
4058 add_decl_to_level (x
,
4059 DECL_NAMESPACE_SCOPE_P (x
)
4060 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4061 : current_binding_level
);
4066 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4067 caller to set DECL_CONTEXT properly. */
4070 pushdecl_with_scope (x
, level
)
4072 struct binding_level
*level
;
4074 register struct binding_level
*b
;
4075 tree function_decl
= current_function_decl
;
4077 current_function_decl
= NULL_TREE
;
4078 if (level
->parm_flag
== 2)
4080 b
= class_binding_level
;
4081 class_binding_level
= level
;
4082 pushdecl_class_level (x
);
4083 class_binding_level
= b
;
4087 b
= current_binding_level
;
4088 current_binding_level
= level
;
4090 current_binding_level
= b
;
4092 current_function_decl
= function_decl
;
4096 /* Like pushdecl, only it places X in the current namespace,
4100 pushdecl_namespace_level (x
)
4103 register struct binding_level
*b
= current_binding_level
;
4106 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4108 /* Now, the type_shadowed stack may screw us. Munge it so it does
4110 if (TREE_CODE (x
) == TYPE_DECL
)
4112 tree name
= DECL_NAME (x
);
4114 tree
*ptr
= (tree
*)0;
4115 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4117 tree shadowed
= b
->type_shadowed
;
4118 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4119 if (TREE_PURPOSE (shadowed
) == name
)
4121 ptr
= &TREE_VALUE (shadowed
);
4122 /* Can't break out of the loop here because sometimes
4123 a binding level will have duplicate bindings for
4124 PT names. It's gross, but I haven't time to fix it. */
4127 newval
= TREE_TYPE (x
);
4128 if (ptr
== (tree
*)0)
4130 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4131 up here if this is changed to an assertion. --KR */
4132 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4142 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4146 pushdecl_top_level (x
)
4149 push_to_top_level ();
4150 x
= pushdecl_namespace_level (x
);
4151 pop_from_top_level ();
4155 /* Make the declaration of X appear in CLASS scope. */
4158 pushdecl_class_level (x
)
4161 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4162 scope looks for the pre-mangled name. */
4165 if (TREE_CODE (x
) == OVERLOAD
)
4166 x
= OVL_CURRENT (x
);
4167 name
= DECL_NAME (x
);
4171 push_class_level_binding (name
, x
);
4172 if (TREE_CODE (x
) == TYPE_DECL
)
4173 set_identifier_type_value (name
, TREE_TYPE (x
));
4175 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4179 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4182 pushdecl_class_level (f
);
4186 /* Enter DECL into the symbol table, if that's appropriate. Returns
4187 DECL, or a modified version thereof. */
4190 maybe_push_decl (decl
)
4193 tree type
= TREE_TYPE (decl
);
4195 /* Add this decl to the current binding level, but not if it comes
4196 from another scope, e.g. a static member variable. TEM may equal
4197 DECL or it may be a previous decl of the same name. */
4198 if ((TREE_CODE (decl
) != PARM_DECL
4199 && DECL_CONTEXT (decl
) != NULL_TREE
4200 /* Definitions of namespace members outside their namespace are
4202 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4203 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4204 || TREE_CODE (type
) == UNKNOWN_TYPE
4205 /* The declaration of a template specialization does not affect
4206 the functions available for overload resolution, so we do not
4208 || (TREE_CODE (decl
) == FUNCTION_DECL
4209 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4212 return pushdecl (decl
);
4216 /* This function is used to push the mangled decls for nested types into
4217 the appropriate scope. Previously pushdecl_top_level was used, but that
4218 is incorrect for members of local classes. */
4221 pushdecl_nonclass_level (x
)
4224 struct binding_level
*b
= current_binding_level
;
4226 my_friendly_assert (b
->parm_flag
!= 2, 180);
4229 /* Get out of template binding levels */
4230 while (b
->pseudo_global
)
4234 pushdecl_with_scope (x
, b
);
4238 /* Make the declaration(s) of X appear in CLASS scope
4239 under the name NAME. */
4242 push_class_level_binding (name
, x
)
4247 /* The class_binding_level will be NULL if x is a template
4248 parameter name in a member template. */
4249 if (!class_binding_level
)
4252 /* Make sure that this new member does not have the same name
4253 as a template parameter. */
4254 if (TYPE_BEING_DEFINED (current_class_type
))
4255 check_template_shadow (x
);
4257 /* If this declaration shadows a declaration from an enclosing
4258 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4259 we leave this class. Record the shadowed declaration here. */
4260 binding
= IDENTIFIER_BINDING (name
);
4262 && ((TREE_CODE (x
) == OVERLOAD
4263 && BINDING_VALUE (binding
)
4264 && is_overloaded_fn (BINDING_VALUE (binding
)))
4265 || INHERITED_VALUE_BINDING_P (binding
)))
4270 /* If the old binding was from a base class, and was for a tag
4271 name, slide it over to make room for the new binding. The
4272 old binding is still visible if explicitly qualified with a
4274 if (INHERITED_VALUE_BINDING_P (binding
)
4275 && BINDING_VALUE (binding
)
4276 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4277 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4278 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4280 old_decl
= BINDING_TYPE (binding
);
4281 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4282 BINDING_VALUE (binding
) = NULL_TREE
;
4283 INHERITED_VALUE_BINDING_P (binding
) = 0;
4286 old_decl
= BINDING_VALUE (binding
);
4288 /* There was already a binding for X containing fewer
4289 functions than are named in X. Find the previous
4290 declaration of X on the class-shadowed list, and update it. */
4291 for (shadow
= class_binding_level
->class_shadowed
;
4293 shadow
= TREE_CHAIN (shadow
))
4294 if (TREE_PURPOSE (shadow
) == name
4295 && TREE_TYPE (shadow
) == old_decl
)
4297 BINDING_VALUE (binding
) = x
;
4298 INHERITED_VALUE_BINDING_P (binding
) = 0;
4299 TREE_TYPE (shadow
) = x
;
4304 /* If we didn't replace an existing binding, put the binding on the
4305 stack of bindings for the identifier, and update
4306 IDENTIFIER_CLASS_VALUE. */
4307 if (push_class_binding (name
, x
))
4309 class_binding_level
->class_shadowed
4310 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4311 class_binding_level
->class_shadowed
);
4312 /* Record the value we are binding NAME to so that we can know
4313 what to pop later. */
4314 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4318 /* Insert another USING_DECL into the current binding level,
4319 returning this declaration. If this is a redeclaration,
4320 do nothing and return NULL_TREE. */
4323 push_using_decl (scope
, name
)
4329 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4330 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4331 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4332 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4336 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4337 DECL_INITIAL (decl
) = scope
;
4338 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4339 current_binding_level
->usings
= decl
;
4343 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4344 changed (i.e. there was already a directive), or the fresh
4345 TREE_LIST otherwise. */
4348 push_using_directive (used
)
4351 tree ud
= current_binding_level
->using_directives
;
4352 tree iter
, ancestor
;
4354 /* Check if we already have this. */
4355 if (purpose_member (used
, ud
) != NULL_TREE
)
4358 /* Recursively add all namespaces used. */
4359 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4360 push_using_directive (TREE_PURPOSE (iter
));
4362 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4363 ud
= current_binding_level
->using_directives
;
4364 ud
= tree_cons (used
, ancestor
, ud
);
4365 current_binding_level
->using_directives
= ud
;
4369 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4370 other definitions already in place. We get around this by making
4371 the value of the identifier point to a list of all the things that
4372 want to be referenced by that name. It is then up to the users of
4373 that name to decide what to do with that list.
4375 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4376 slot. It is dealt with the same way.
4378 FLAGS is a bitwise-or of the following values:
4379 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4381 PUSH_USING: DECL is being pushed as the result of a using
4384 The value returned may be a previous declaration if we guessed wrong
4385 about what language DECL should belong to (C or C++). Otherwise,
4386 it's always DECL (and never something that's not a _DECL). */
4389 push_overloaded_decl (decl
, flags
)
4393 tree name
= DECL_NAME (decl
);
4396 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4399 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4401 old
= lookup_name_current_level (name
);
4405 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4407 tree t
= TREE_TYPE (old
);
4408 if (IS_AGGR_TYPE (t
) && warn_shadow
4409 && (! DECL_IN_SYSTEM_HEADER (decl
)
4410 || ! DECL_IN_SYSTEM_HEADER (old
)))
4411 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4414 else if (is_overloaded_fn (old
))
4418 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4420 tree fn
= OVL_CURRENT (tmp
);
4422 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4423 && !(flags
& PUSH_USING
)
4424 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4425 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4426 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4429 if (duplicate_decls (decl
, fn
))
4435 cp_error_at ("previous non-function declaration `%#D'", old
);
4436 cp_error ("conflicts with function declaration `%#D'", decl
);
4441 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4443 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4444 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4446 new_binding
= ovl_cons (decl
, old
);
4447 if (flags
& PUSH_USING
)
4448 OVL_USED (new_binding
) = 1;
4451 /* NAME is not ambiguous. */
4455 set_namespace_binding (name
, current_namespace
, new_binding
);
4458 /* We only create an OVERLOAD if there was a previous binding at
4459 this level, or if decl is a template. In the former case, we
4460 need to remove the old binding and replace it with the new
4461 binding. We must also run through the NAMES on the binding
4462 level where the name was bound to update the chain. */
4464 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4468 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4470 d
= &TREE_CHAIN (*d
))
4472 || (TREE_CODE (*d
) == TREE_LIST
4473 && TREE_VALUE (*d
) == old
))
4475 if (TREE_CODE (*d
) == TREE_LIST
)
4476 /* Just replace the old binding with the new. */
4477 TREE_VALUE (*d
) = new_binding
;
4479 /* Build a TREE_LIST to wrap the OVERLOAD. */
4480 *d
= tree_cons (NULL_TREE
, new_binding
,
4483 /* And update the CPLUS_BINDING node. */
4484 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4489 /* We should always find a previous binding in this case. */
4490 my_friendly_abort (0);
4493 /* Install the new binding. */
4494 push_local_binding (name
, new_binding
, flags
);
4500 /* Generate an implicit declaration for identifier FUNCTIONID
4501 as a function of type int (). Print a warning if appropriate. */
4504 implicitly_declare (functionid
)
4508 int temp
= allocation_temporary_p ();
4510 push_obstacks_nochange ();
4512 /* Save the decl permanently so we can warn if definition follows.
4513 In ANSI C, warn_implicit is usually false, so the saves little space.
4514 But in C++, it's usually true, hence the extra code. */
4515 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4516 end_temporary_allocation ();
4518 /* We used to reuse an old implicit decl here,
4519 but this loses with inline functions because it can clobber
4520 the saved decl chains. */
4521 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4523 DECL_EXTERNAL (decl
) = 1;
4524 TREE_PUBLIC (decl
) = 1;
4526 /* ANSI standard says implicit declarations are in the innermost block.
4527 So we record the decl in the standard fashion. */
4529 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4532 /* Only one warning per identifier. */
4533 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4535 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4538 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4545 /* Return zero if the declaration NEWDECL is valid
4546 when the declaration OLDDECL (assumed to be for the same name)
4547 has already been seen.
4548 Otherwise return an error message format string with a %s
4549 where the identifier should go. */
4552 redeclaration_error_message (newdecl
, olddecl
)
4553 tree newdecl
, olddecl
;
4555 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4557 /* Because C++ can put things into name space for free,
4558 constructs like "typedef struct foo { ... } foo"
4559 would look like an erroneous redeclaration. */
4560 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4563 return "redefinition of `%#D'";
4565 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4567 /* If this is a pure function, its olddecl will actually be
4568 the original initialization to `0' (which we force to call
4569 abort()). Don't complain about redefinition in this case. */
4570 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4573 /* If both functions come from different namespaces, this is not
4574 a redeclaration - this is a conflict with a used function. */
4575 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4576 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4577 return "`%D' conflicts with used function";
4579 /* We'll complain about linkage mismatches in
4580 warn_extern_redeclared_static. */
4582 /* Defining the same name twice is no good. */
4583 if (DECL_INITIAL (olddecl
) != NULL_TREE
4584 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4586 if (DECL_NAME (olddecl
) == NULL_TREE
)
4587 return "`%#D' not declared in class";
4589 return "redefinition of `%#D'";
4593 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4595 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4596 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4597 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4598 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4599 && TYPE_SIZE (TREE_TYPE (newdecl
))
4600 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4601 return "redefinition of `%#D'";
4604 else if (toplevel_bindings_p ())
4606 /* Objects declared at top level: */
4607 /* If at least one is a reference, it's ok. */
4608 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4610 /* Reject two definitions. */
4611 return "redefinition of `%#D'";
4615 /* Objects declared with block scope: */
4616 /* Reject two definitions, and reject a definition
4617 together with an external reference. */
4618 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4619 return "redeclaration of `%#D'";
4624 /* Create a new label, named ID. */
4627 make_label_decl (id
, local_p
)
4633 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4635 /* Make sure every label has an rtx. */
4638 DECL_CONTEXT (decl
) = current_function_decl
;
4639 DECL_MODE (decl
) = VOIDmode
;
4640 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4642 /* Say where one reference is to the label, for the sake of the
4643 error if it is not defined. */
4644 DECL_SOURCE_LINE (decl
) = lineno
;
4645 DECL_SOURCE_FILE (decl
) = input_filename
;
4647 /* Record the fact that this identifier is bound to this label. */
4648 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4650 /* Record this label on the list of used labels so that we can check
4651 at the end of the function to see whether or not the label was
4652 actually defined. */
4653 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4654 && (named_label_uses
== NULL
4655 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4656 || named_label_uses
->label_decl
!= decl
))
4658 struct named_label_list
*new_ent
;
4660 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4661 new_ent
->label_decl
= decl
;
4662 new_ent
->names_in_scope
= current_binding_level
->names
;
4663 new_ent
->binding_level
= current_binding_level
;
4664 new_ent
->lineno_o_goto
= lineno
;
4665 new_ent
->filename_o_goto
= input_filename
;
4666 new_ent
->next
= named_label_uses
;
4667 named_label_uses
= new_ent
;
4673 /* Look for a label named ID in the current function. If one cannot
4674 be found, create one. (We keep track of used, but undefined,
4675 labels, and complain about them at the end of a function.) */
4683 /* You can't use labels at global scope. */
4684 if (current_function_decl
== NULL_TREE
)
4686 error ("label `%s' referenced outside of any function",
4687 IDENTIFIER_POINTER (id
));
4691 /* See if we've already got this label. */
4692 decl
= IDENTIFIER_LABEL_VALUE (id
);
4693 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4696 /* Record this label on the list of labels used in this function.
4697 We do this before calling make_label_decl so that we get the
4698 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4699 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4701 /* We need a new label. */
4702 decl
= make_label_decl (id
, /*local_p=*/0);
4703 /* Now fill in the information we didn't have before. */
4704 TREE_VALUE (named_labels
) = decl
;
4709 /* Declare a local label named ID. */
4712 declare_local_label (id
)
4717 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4718 this scope we can restore the old value of
4719 IDENTIFIER_TYPE_VALUE. */
4720 current_binding_level
->shadowed_labels
4721 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4722 current_binding_level
->shadowed_labels
);
4723 /* Look for the label. */
4724 decl
= make_label_decl (id
, /*local_p=*/1);
4725 /* Now fill in the information we didn't have before. */
4726 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4731 /* Define a label, specifying the location in the source file.
4732 Return the LABEL_DECL node for the label, if the definition is valid.
4733 Otherwise return 0. */
4736 define_label (filename
, line
, name
)
4741 tree decl
= lookup_label (name
);
4743 /* After labels, make any new cleanups go into their
4744 own new (temporary) binding contour. */
4745 current_binding_level
->more_cleanups_ok
= 0;
4747 if (name
== get_identifier ("wchar_t"))
4748 cp_pedwarn ("label named wchar_t");
4750 if (DECL_INITIAL (decl
) != NULL_TREE
)
4752 cp_error ("duplicate label `%D'", decl
);
4757 struct named_label_list
*uses
, *prev
;
4761 /* Mark label as having been defined. */
4762 DECL_INITIAL (decl
) = error_mark_node
;
4763 /* Say where in the source. */
4764 DECL_SOURCE_FILE (decl
) = filename
;
4765 DECL_SOURCE_LINE (decl
) = line
;
4768 uses
= named_label_uses
;
4769 while (uses
!= NULL
)
4770 if (uses
->label_decl
== decl
)
4772 struct binding_level
*b
= current_binding_level
;
4775 tree new_decls
= b
->names
;
4776 tree old_decls
= (b
== uses
->binding_level
)
4777 ? uses
->names_in_scope
: NULL_TREE
;
4778 while (new_decls
!= old_decls
)
4780 if (TREE_CODE (new_decls
) == VAR_DECL
4781 /* Don't complain about crossing initialization
4782 of internal entities. They can't be accessed,
4783 and they should be cleaned up
4784 by the time we get to the label. */
4785 && ! DECL_ARTIFICIAL (new_decls
)
4786 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4787 && pod_type_p (TREE_TYPE (new_decls
))))
4789 /* This is really only important if we're crossing
4790 an initialization. The POD stuff is just
4791 pedantry; why should it matter if the class
4792 contains a field of pointer to member type? */
4793 int problem
= (DECL_INITIAL (new_decls
)
4794 || (TYPE_NEEDS_CONSTRUCTING
4795 (TREE_TYPE (new_decls
))));
4801 cp_error ("jump to label `%D'", decl
);
4802 error_with_file_and_line
4803 (uses
->filename_o_goto
,
4804 uses
->lineno_o_goto
, " from here");
4808 cp_pedwarn ("jump to label `%D'", decl
);
4809 pedwarn_with_file_and_line
4810 (uses
->filename_o_goto
,
4811 uses
->lineno_o_goto
, " from here");
4817 cp_error_at (" crosses initialization of `%#D'",
4820 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4823 new_decls
= TREE_CHAIN (new_decls
);
4825 if (b
== uses
->binding_level
)
4827 if (b
->eh_region
&& ! saw_eh
)
4831 cp_error ("jump to label `%D'", decl
);
4832 error_with_file_and_line
4833 (uses
->filename_o_goto
,
4834 uses
->lineno_o_goto
, " from here");
4837 error (" enters exception handling block");
4844 prev
->next
= uses
->next
;
4846 named_label_uses
= uses
->next
;
4855 current_function_return_value
= NULL_TREE
;
4862 struct binding_level
*level
;
4863 struct cp_switch
*next
;
4866 static struct cp_switch
*switch_stack
;
4872 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4873 p
->level
= current_binding_level
;
4874 p
->next
= switch_stack
;
4881 switch_stack
= switch_stack
->next
;
4884 /* Note that we've seen a definition of a case label, and complain if this
4885 is a bad place for one. */
4888 define_case_label ()
4890 tree cleanup
= last_cleanup_this_contour ();
4891 struct binding_level
*b
= current_binding_level
;
4895 /* Don't crash; we'll complain in do_case. */
4900 static int explained
= 0;
4901 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4902 warning ("where case label appears here");
4905 warning ("(enclose actions of previous case statements requiring");
4906 warning ("destructors in their own binding contours.)");
4911 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4913 tree new_decls
= b
->names
;
4914 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4916 if (TREE_CODE (new_decls
) == VAR_DECL
4917 /* Don't complain about crossing initialization
4918 of internal entities. They can't be accessed,
4919 and they should be cleaned up
4920 by the time we get to the label. */
4921 && ! DECL_ARTIFICIAL (new_decls
)
4922 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4923 && DECL_INITIAL (new_decls
) != error_mark_node
)
4924 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4927 error ("jump to case label");
4929 cp_error_at (" crosses initialization of `%#D'",
4935 /* After labels, make any new cleanups go into their
4936 own new (temporary) binding contour. */
4938 current_binding_level
->more_cleanups_ok
= 0;
4939 current_function_return_value
= NULL_TREE
;
4942 /* Return the list of declarations of the current level.
4943 Note that this list is in reverse order unless/until
4944 you nreverse it; and when you do nreverse it, you must
4945 store the result back using `storedecls' or you will lose. */
4950 return current_binding_level
->names
;
4953 /* Return the list of type-tags (for structs, etc) of the current level. */
4958 return current_binding_level
->tags
;
4961 /* Store the list of declarations of the current level.
4962 This is done for the parameter declarations of a function being defined,
4963 after they are modified in the light of any missing parameters. */
4969 current_binding_level
->names
= decls
;
4972 /* Similarly, store the list of tags of the current level. */
4978 current_binding_level
->tags
= tags
;
4981 /* Given NAME, an IDENTIFIER_NODE,
4982 return the structure (or union or enum) definition for that name.
4983 Searches binding levels from BINDING_LEVEL up to the global level.
4984 If THISLEVEL_ONLY is nonzero, searches only the specified context
4985 (but skips any tag-transparent contexts to find one that is
4986 meaningful for tags).
4987 FORM says which kind of type the caller wants;
4988 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4989 If the wrong kind of type is found, and it's not a template, an error is
4993 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4994 enum tree_code form
;
4996 struct binding_level
*binding_level
;
4999 register struct binding_level
*level
;
5000 /* Non-zero if, we should look past a pseudo-global level, even if
5002 int allow_pseudo_global
= 1;
5004 for (level
= binding_level
; level
; level
= level
->level_chain
)
5007 if (ANON_AGGRNAME_P (name
))
5008 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5010 /* There's no need for error checking here, because
5011 anon names are unique throughout the compilation. */
5012 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5013 return TREE_VALUE (tail
);
5015 else if (level
->namespace_p
)
5016 /* Do namespace lookup. */
5017 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5019 tree old
= binding_for_name (name
, tail
);
5021 /* If we just skipped past a pseudo global level, even
5022 though THISLEVEL_ONLY, and we find a template class
5023 declaration, then we use the _TYPE node for the
5024 template. See the example below. */
5025 if (thislevel_only
&& !allow_pseudo_global
5026 && old
&& BINDING_VALUE (old
)
5027 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5028 old
= TREE_TYPE (BINDING_VALUE (old
));
5030 old
= BINDING_TYPE (old
);
5032 /* If it has an original type, it is a typedef, and we
5033 should not return it. */
5034 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5036 if (old
&& TREE_CODE (old
) != form
5037 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5039 cp_error ("`%#D' redeclared as %C", old
, form
);
5044 if (thislevel_only
|| tail
== global_namespace
)
5048 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5050 if (TREE_PURPOSE (tail
) == name
)
5052 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5053 /* Should tighten this up; it'll probably permit
5054 UNION_TYPE and a struct template, for example. */
5056 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5058 /* Definition isn't the kind we were looking for. */
5059 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5063 return TREE_VALUE (tail
);
5066 if (thislevel_only
&& ! level
->tag_transparent
)
5068 if (level
->pseudo_global
&& allow_pseudo_global
)
5070 /* We must deal with cases like this:
5072 template <class T> struct S;
5073 template <class T> struct S {};
5075 When looking up `S', for the second declaration, we
5076 would like to find the first declaration. But, we
5077 are in the pseudo-global level created for the
5078 template parameters, rather than the (surrounding)
5079 namespace level. Thus, we keep going one more level,
5080 even though THISLEVEL_ONLY is non-zero. */
5081 allow_pseudo_global
= 0;
5093 set_current_level_tags_transparency (tags_transparent
)
5094 int tags_transparent
;
5096 current_binding_level
->tag_transparent
= tags_transparent
;
5100 /* Given a type, find the tag that was defined for it and return the tag name.
5101 Otherwise return 0. However, the value can never be 0
5102 in the cases in which this is used.
5104 C++: If NAME is non-zero, this is the new name to install. This is
5105 done when replacing anonymous tags with real tag names. */
5108 lookup_tag_reverse (type
, name
)
5112 register struct binding_level
*level
;
5114 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5117 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5119 if (TREE_VALUE (tail
) == type
)
5122 TREE_PURPOSE (tail
) = name
;
5123 return TREE_PURPOSE (tail
);
5130 /* Look up NAME in the NAMESPACE. */
5133 lookup_namespace_name (namespace, name
)
5134 tree
namespace, name
;
5137 tree template_id
= NULL_TREE
;
5139 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5141 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5142 /* This happens for A::B<int> when B is a namespace. */
5144 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5146 /* This happens for A::B where B is a template, and there are no
5147 template arguments. */
5148 cp_error ("invalid use of `%D'", name
);
5149 return error_mark_node
;
5152 namespace = ORIGINAL_NAMESPACE (namespace);
5154 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5157 name
= TREE_OPERAND (name
, 0);
5158 if (TREE_CODE (name
) == OVERLOAD
)
5159 name
= DECL_NAME (OVL_CURRENT (name
));
5160 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5161 name
= DECL_NAME (name
);
5164 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5166 val
= make_node (CPLUS_BINDING
);
5167 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5168 return error_mark_node
;
5170 if (BINDING_VALUE (val
))
5172 val
= BINDING_VALUE (val
);
5176 if (DECL_CLASS_TEMPLATE_P (val
))
5177 val
= lookup_template_class (val
,
5178 TREE_OPERAND (template_id
, 1),
5179 /*in_decl=*/NULL_TREE
,
5180 /*context=*/NULL_TREE
,
5181 /*entering_scope=*/0);
5182 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5183 || TREE_CODE (val
) == OVERLOAD
)
5184 val
= lookup_template_function (val
,
5185 TREE_OPERAND (template_id
, 1));
5188 cp_error ("`%D::%D' is not a template",
5190 return error_mark_node
;
5194 /* If we have a single function from a using decl, pull it out. */
5195 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5196 val
= OVL_FUNCTION (val
);
5200 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5201 return error_mark_node
;
5204 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5206 static unsigned long
5214 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5215 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5220 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5223 typename_compare (k1
, k2
)
5234 d1
= TYPE_NAME (t1
);
5235 d2
= TYPE_NAME (t2
);
5237 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5238 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5239 && ((TREE_TYPE (t1
) != NULL_TREE
)
5240 == (TREE_TYPE (t2
) != NULL_TREE
))
5241 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5242 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5245 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5246 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5247 is non-NULL, this type is being created by the implicit typename
5248 extension, and BASE_TYPE is a type named `t' in some base class of
5249 `T' which depends on template parameters.
5251 Returns the new TYPENAME_TYPE. */
5254 build_typename_type (context
, name
, fullname
, base_type
)
5262 struct hash_entry
* e
;
5264 static struct hash_table ht
;
5266 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5270 static struct hash_table
*h
= &ht
;
5271 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5273 fatal ("virtual memory exhausted");
5274 ggc_add_tree_hash_table_root (&h
, 1);
5277 /* Build the TYPENAME_TYPE. */
5278 t
= make_lang_type (TYPENAME_TYPE
);
5279 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5280 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5281 TREE_TYPE (t
) = base_type
;
5283 /* Build the corresponding TYPE_DECL. */
5284 d
= build_decl (TYPE_DECL
, name
, t
);
5285 TYPE_NAME (TREE_TYPE (d
)) = d
;
5286 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5287 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5288 DECL_ARTIFICIAL (d
) = 1;
5290 /* See if we already have this type. */
5291 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5295 /* Insert the type into the table. */
5296 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5304 make_typename_type (context
, name
)
5309 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5311 if (!(TYPE_LANG_SPECIFIC (name
)
5312 && (CLASSTYPE_IS_TEMPLATE (name
)
5313 || CLASSTYPE_USE_TEMPLATE (name
))))
5314 name
= TYPE_IDENTIFIER (name
);
5316 /* Create a TEMPLATE_ID_EXPR for the type. */
5317 name
= build_nt (TEMPLATE_ID_EXPR
,
5318 CLASSTYPE_TI_TEMPLATE (name
),
5319 CLASSTYPE_TI_ARGS (name
));
5321 else if (TREE_CODE (name
) == TYPE_DECL
)
5322 name
= DECL_NAME (name
);
5326 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5328 name
= TREE_OPERAND (name
, 0);
5329 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5330 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5332 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5333 my_friendly_abort (2000);
5335 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5337 /* We can get here from typename_sub0 in the explicit_template_type
5338 expansion. Just fail. */
5339 cp_error ("no class template named `%#T' in `%#T'",
5341 return error_mark_node
;
5344 if (! uses_template_parms (context
)
5345 || currently_open_class (context
))
5347 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5349 tree tmpl
= NULL_TREE
;
5350 if (IS_AGGR_TYPE (context
))
5351 tmpl
= lookup_field (context
, name
, 0, 0);
5352 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5354 cp_error ("no class template named `%#T' in `%#T'",
5356 return error_mark_node
;
5359 return lookup_template_class (tmpl
,
5360 TREE_OPERAND (fullname
, 1),
5362 /*entering_scope=*/0);
5368 if (!IS_AGGR_TYPE (context
))
5370 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5371 return error_mark_node
;
5374 t
= lookup_field (context
, name
, 0, 1);
5376 return TREE_TYPE (t
);
5380 /* If the CONTEXT is not a template type, then either the field is
5381 there now or its never going to be. */
5382 if (!uses_template_parms (context
))
5384 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5385 return error_mark_node
;
5389 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5392 /* Select the right _DECL from multiple choices. */
5395 select_decl (binding
, flags
)
5400 val
= BINDING_VALUE (binding
);
5401 if (LOOKUP_NAMESPACES_ONLY (flags
))
5403 /* We are not interested in types. */
5404 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5409 /* If we could have a type and
5410 we have nothing or we need a type and have none. */
5411 if (BINDING_TYPE (binding
)
5412 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5413 && TREE_CODE (val
) != TYPE_DECL
)))
5414 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5415 /* Don't return non-types if we really prefer types. */
5416 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5417 && (TREE_CODE (val
) != TEMPLATE_DECL
5418 || !DECL_CLASS_TEMPLATE_P (val
)))
5424 /* Unscoped lookup of a global: iterate over current namespaces,
5425 considering using-directives. If SPACESP is non-NULL, store a list
5426 of the namespaces we've considered in it. */
5429 unqualified_namespace_lookup (name
, flags
, spacesp
)
5434 tree b
= make_node (CPLUS_BINDING
);
5435 tree initial
= current_decl_namespace();
5436 tree scope
= initial
;
5438 struct binding_level
*level
;
5439 tree val
= NULL_TREE
;
5442 *spacesp
= NULL_TREE
;
5444 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5447 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5448 val
= binding_for_name (name
, scope
);
5450 /* Initialize binding for this context. */
5451 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5452 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5454 /* Add all _DECLs seen through local using-directives. */
5455 for (level
= current_binding_level
;
5456 !level
->namespace_p
;
5457 level
= level
->level_chain
)
5458 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5459 scope
, flags
, spacesp
))
5460 /* Give up because of error. */
5461 return error_mark_node
;
5463 /* Add all _DECLs seen through global using-directives. */
5464 /* XXX local and global using lists should work equally. */
5468 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5469 scope
, flags
, spacesp
))
5470 /* Give up because of error. */
5471 return error_mark_node
;
5472 if (siter
== scope
) break;
5473 siter
= CP_DECL_CONTEXT (siter
);
5476 val
= select_decl (b
, flags
);
5477 if (scope
== global_namespace
)
5483 /* Combine prefer_type and namespaces_only into flags. */
5486 lookup_flags (prefer_type
, namespaces_only
)
5487 int prefer_type
, namespaces_only
;
5489 if (namespaces_only
)
5490 return LOOKUP_PREFER_NAMESPACES
;
5491 if (prefer_type
> 1)
5492 return LOOKUP_PREFER_TYPES
;
5493 if (prefer_type
> 0)
5494 return LOOKUP_PREFER_BOTH
;
5498 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5499 ignore it or not. Subroutine of lookup_name_real. */
5502 qualify_lookup (val
, flags
)
5506 if (val
== NULL_TREE
)
5508 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5510 if ((flags
& LOOKUP_PREFER_TYPES
)
5511 && (TREE_CODE (val
) == TYPE_DECL
5512 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5513 && DECL_CLASS_TEMPLATE_P (val
))))
5515 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5520 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5524 warn_about_implicit_typename_lookup (typename
, binding
)
5528 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5529 tree name
= DECL_NAME (typename
);
5531 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5532 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5533 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5534 && ! (TREE_CODE (binding
) == TYPE_DECL
5535 && same_type_p (TREE_TYPE (binding
), subtype
)))
5537 cp_warning ("lookup of `%D' finds `%#D'",
5539 cp_warning (" instead of `%D' from dependent base class",
5541 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5542 constructor_name (current_class_type
), name
);
5546 /* Look up NAME in the current binding level and its superiors in the
5547 namespace of variables, functions and typedefs. Return a ..._DECL
5548 node of some kind representing its definition if there is only one
5549 such declaration, or return a TREE_LIST with all the overloaded
5550 definitions if there are many, or return 0 if it is undefined.
5552 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5553 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5554 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5555 Otherwise we prefer non-TYPE_DECLs.
5557 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5558 using IDENTIFIER_CLASS_VALUE. */
5561 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5563 int prefer_type
, nonclass
, namespaces_only
;
5566 tree val
= NULL_TREE
;
5568 tree from_obj
= NULL_TREE
;
5570 int val_is_implicit_typename
= 0;
5572 /* Hack: copy flag set by parser, if set. */
5573 if (only_namespace_names
)
5574 namespaces_only
= 1;
5576 if (prefer_type
== -2)
5578 extern int looking_for_typename
;
5579 tree type
= NULL_TREE
;
5582 prefer_type
= looking_for_typename
;
5584 flags
= lookup_flags (prefer_type
, namespaces_only
);
5585 /* If the next thing is '<', class templates are types. */
5586 if (looking_for_template
)
5587 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5589 /* std:: becomes :: for now. */
5590 if (got_scope
== std_node
)
5591 got_scope
= void_type_node
;
5595 else if (got_object
!= error_mark_node
)
5600 if (type
== error_mark_node
)
5601 return error_mark_node
;
5602 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5603 type
= TREE_TYPE (type
);
5606 type
= complete_type (type
);
5608 if (TREE_CODE (type
) == VOID_TYPE
)
5609 type
= global_namespace
;
5610 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5612 val
= make_node (CPLUS_BINDING
);
5613 flags
|= LOOKUP_COMPLAIN
;
5614 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5616 val
= select_decl (val
, flags
);
5618 else if (! IS_AGGR_TYPE (type
)
5619 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5620 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5621 || TREE_CODE (type
) == TYPENAME_TYPE
)
5622 /* Someone else will give an error about this if needed. */
5624 else if (type
== current_class_type
)
5625 val
= IDENTIFIER_CLASS_VALUE (name
);
5627 val
= lookup_member (type
, name
, 0, prefer_type
);
5634 else if (got_object
&& val
)
5639 flags
= lookup_flags (prefer_type
, namespaces_only
);
5640 /* If we're not parsing, we need to complain. */
5641 flags
|= LOOKUP_COMPLAIN
;
5644 /* First, look in non-namespace scopes. */
5646 if (current_class_type
== NULL_TREE
)
5649 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5653 if (!LOCAL_BINDING_P (t
) && nonclass
)
5654 /* We're not looking for class-scoped bindings, so keep going. */
5657 /* If this is the kind of thing we're looking for, we're done. */
5658 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5659 binding
= BINDING_VALUE (t
);
5660 else if ((flags
& LOOKUP_PREFER_TYPES
)
5661 && qualify_lookup (BINDING_TYPE (t
), flags
))
5662 binding
= BINDING_TYPE (t
);
5664 binding
= NULL_TREE
;
5667 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5669 if (val_is_implicit_typename
&& !yylex
)
5670 warn_about_implicit_typename_lookup (val
, binding
);
5672 val_is_implicit_typename
5673 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5674 if (!val_is_implicit_typename
)
5679 /* Now lookup in namespace scopes. */
5680 if (!val
|| val_is_implicit_typename
)
5682 t
= unqualified_namespace_lookup (name
, flags
, 0);
5685 if (val_is_implicit_typename
&& !yylex
)
5686 warn_about_implicit_typename_lookup (val
, t
);
5694 /* This should only warn about types used in qualified-ids. */
5695 if (from_obj
&& from_obj
!= val
)
5697 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5698 && TREE_CODE (val
) == TYPE_DECL
5699 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5701 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5702 name
, got_object
, TREE_TYPE (from_obj
));
5703 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5707 /* We don't change val to from_obj if got_object depends on
5708 template parms because that breaks implicit typename for
5709 destructor calls. */
5710 if (! uses_template_parms (got_object
))
5714 /* If we have a single function from a using decl, pull it out. */
5715 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5716 val
= OVL_FUNCTION (val
);
5725 lookup_name_nonclass (name
)
5728 return lookup_name_real (name
, 0, 1, 0);
5732 lookup_function_nonclass (name
, args
)
5736 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5740 lookup_name_namespace_only (name
)
5743 /* type-or-namespace, nonclass, namespace_only */
5744 return lookup_name_real (name
, 1, 1, 1);
5748 lookup_name (name
, prefer_type
)
5752 return lookup_name_real (name
, prefer_type
, 0, 0);
5755 /* Similar to `lookup_name' but look only in the innermost non-class
5759 lookup_name_current_level (name
)
5762 struct binding_level
*b
;
5765 b
= current_binding_level
;
5766 while (b
->parm_flag
== 2)
5771 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5773 /* extern "C" function() */
5774 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5777 else if (IDENTIFIER_BINDING (name
)
5778 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5782 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5783 return IDENTIFIER_VALUE (name
);
5795 /* Like lookup_name_current_level, but for types. */
5798 lookup_type_current_level (name
)
5801 register tree t
= NULL_TREE
;
5803 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5805 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5806 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5808 struct binding_level
*b
= current_binding_level
;
5811 if (purpose_member (name
, b
->type_shadowed
))
5812 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5824 begin_only_namespace_names ()
5826 only_namespace_names
= 1;
5830 end_only_namespace_names ()
5832 only_namespace_names
= 0;
5835 /* Arrange for the user to get a source line number, even when the
5836 compiler is going down in flames, so that she at least has a
5837 chance of working around problems in the compiler. We used to
5838 call error(), but that let the segmentation fault continue
5839 through; now, it's much more passive by asking them to send the
5840 maintainers mail about the problem. */
5844 int sig ATTRIBUTE_UNUSED
;
5846 signal (SIGSEGV
, SIG_DFL
);
5848 signal (SIGIOT
, SIG_DFL
);
5851 signal (SIGILL
, SIG_DFL
);
5854 signal (SIGABRT
, SIG_DFL
);
5857 signal (SIGBUS
, SIG_DFL
);
5859 my_friendly_abort (0);
5862 /* Push the declarations of builtin types into the namespace.
5863 RID_INDEX, if < RID_MAX is the index of the builtin type
5864 in the array RID_POINTERS. NAME is the name used when looking
5865 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5868 record_builtin_type (rid_index
, name
, type
)
5873 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5874 tree tdecl
= NULL_TREE
;
5876 if ((int) rid_index
< (int) RID_MAX
)
5877 rname
= ridpointers
[(int) rid_index
];
5879 tname
= get_identifier (name
);
5881 TYPE_BUILT_IN (type
) = 1;
5885 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5886 set_identifier_type_value (tname
, NULL_TREE
);
5887 if ((int) rid_index
< (int) RID_MAX
)
5888 /* Built-in types live in the global namespace. */
5889 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5891 if (rname
!= NULL_TREE
)
5893 if (tname
!= NULL_TREE
)
5895 set_identifier_type_value (rname
, NULL_TREE
);
5896 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5900 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5901 set_identifier_type_value (rname
, NULL_TREE
);
5906 /* Record one of the standard Java types.
5907 * Declare it as having the given NAME.
5908 * If SIZE > 0, it is the size of one of the integral types;
5909 * otherwise it is the negative of the size of one of the other types. */
5912 record_builtin_java_type (name
, size
)
5918 type
= make_signed_type (size
);
5919 else if (size
> -32)
5920 { /* "__java_char" or ""__java_boolean". */
5921 type
= make_unsigned_type (-size
);
5922 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5925 { /* "__java_float" or ""__java_double". */
5926 type
= make_node (REAL_TYPE
);
5927 TYPE_PRECISION (type
) = - size
;
5930 record_builtin_type (RID_MAX
, name
, type
);
5931 decl
= TYPE_NAME (type
);
5933 /* Suppress generate debug symbol entries for these types,
5934 since for normal C++ they are just clutter.
5935 However, push_lang_context undoes this if extern "Java" is seen. */
5936 DECL_IGNORED_P (decl
) = 1;
5938 TYPE_FOR_JAVA (type
) = 1;
5942 /* Push a type into the namespace so that the back-ends ignore it. */
5945 record_unknown_type (type
, name
)
5949 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5950 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5951 DECL_IGNORED_P (decl
) = 1;
5952 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5953 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5954 TYPE_ALIGN (type
) = 1;
5955 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5958 /* Push overloaded decl, in global scope, with one argument so it
5959 can be used as a callback from define_function. */
5962 push_overloaded_decl_1 (x
)
5965 push_overloaded_decl (x
, PUSH_GLOBAL
);
5972 auto_function (name
, type
)
5975 return define_function
5976 (IDENTIFIER_POINTER (name
), type
, push_overloaded_decl_1
,
5977 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5981 /* Create the predefined scalar types of C,
5982 and some nodes representing standard constants (0, 1, (void *)0).
5983 Initialize the global binding level.
5984 Make definitions for built-in primitive functions. */
5987 init_decl_processing ()
5990 int wchar_type_size
;
5991 tree array_domain_type
;
5993 /* Have to make these distinct before we try using them. */
5994 lang_name_cplusplus
= get_identifier ("C++");
5995 lang_name_c
= get_identifier ("C");
5996 lang_name_java
= get_identifier ("Java");
5998 /* Let the back-end now how to save and restore language-specific
5999 per-function globals. */
6000 init_lang_status
= &push_cp_function_context
;
6001 free_lang_status
= &pop_cp_function_context
;
6002 mark_lang_status
= &mark_cp_function_context
;
6008 /* Create the global variables. */
6009 push_to_top_level ();
6011 /* Enter the global namespace. */
6012 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6013 push_namespace (get_identifier ("::"));
6014 global_namespace
= current_namespace
;
6015 current_lang_name
= NULL_TREE
;
6017 if (flag_strict_prototype
== 2)
6018 flag_strict_prototype
= pedantic
;
6019 if (! flag_permissive
&& ! pedantic
)
6020 flag_pedantic_errors
= 1;
6022 strict_prototypes_lang_c
= flag_strict_prototype
;
6025 current_lang_name
= lang_name_c
;
6027 current_function_decl
= NULL_TREE
;
6028 current_binding_level
= NULL_BINDING_LEVEL
;
6029 free_binding_level
= NULL_BINDING_LEVEL
;
6031 /* Because most segmentation signals can be traced back into user
6032 code, catch them and at least give the user a chance of working
6033 around compiler bugs. */
6034 signal (SIGSEGV
, signal_catch
);
6036 /* We will also catch aborts in the back-end through signal_catch and
6037 give the user a chance to see where the error might be, and to defeat
6038 aborts in the back-end when there have been errors previously in their
6041 signal (SIGIOT
, signal_catch
);
6044 signal (SIGILL
, signal_catch
);
6047 signal (SIGABRT
, signal_catch
);
6050 signal (SIGBUS
, signal_catch
);
6053 build_common_tree_nodes (flag_signed_char
);
6055 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6056 TREE_TYPE (error_mark_list
) = error_mark_node
;
6058 /* Make the binding_level structure for global names. */
6060 global_binding_level
= current_binding_level
;
6061 /* The global level is the namespace level of ::. */
6062 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6063 declare_namespace_level ();
6065 this_identifier
= get_identifier (THIS_NAME
);
6066 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6067 ctor_identifier
= get_identifier (CTOR_NAME
);
6068 dtor_identifier
= get_identifier (DTOR_NAME
);
6069 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6070 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6071 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6072 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6073 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6075 /* Define `int' and `char' first so that dbx will output them first. */
6076 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6077 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6079 /* `signed' is the same as `int' */
6080 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6081 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6082 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6083 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6084 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6085 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6086 record_builtin_type (RID_MAX
, "long long unsigned int",
6087 long_long_unsigned_type_node
);
6088 record_builtin_type (RID_MAX
, "long long unsigned",
6089 long_long_unsigned_type_node
);
6090 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6091 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6092 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6095 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6097 /* Define both `signed char' and `unsigned char'. */
6098 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6099 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6101 /* `unsigned long' is the standard type for sizeof.
6102 Note that stddef.h uses `unsigned long',
6103 and this must agree, even if long and int are the same size. */
6105 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6107 /* Create the widest literal types. */
6108 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6109 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6110 widest_integer_literal_type_node
));
6112 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6113 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6114 widest_unsigned_literal_type_node
));
6116 /* These are types that type_for_size and type_for_mode use. */
6117 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6118 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6119 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6120 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6121 #if HOST_BITS_PER_WIDE_INT >= 64
6122 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6124 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6125 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6126 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6127 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6128 #if HOST_BITS_PER_WIDE_INT >= 64
6129 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6132 build_common_tree_nodes_2 (flag_short_double
);
6134 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6135 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6136 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6137 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6138 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6139 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6140 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6141 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6143 integer_two_node
= build_int_2 (2, 0);
6144 TREE_TYPE (integer_two_node
) = integer_type_node
;
6145 integer_three_node
= build_int_2 (3, 0);
6146 TREE_TYPE (integer_three_node
) = integer_type_node
;
6148 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6149 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6150 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6151 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6152 TYPE_PRECISION (boolean_type_node
) = 1;
6153 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6154 boolean_false_node
= build_int_2 (0, 0);
6155 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6156 boolean_true_node
= build_int_2 (1, 0);
6157 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6159 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6160 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6161 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6163 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6164 complex_integer_type_node
));
6165 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6166 complex_float_type_node
));
6167 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6168 complex_double_type_node
));
6169 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6170 complex_long_double_type_node
));
6172 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6174 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6175 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6176 TREE_PARMLIST (void_list_node
) = 1;
6178 /* Used for expressions that do nothing, but are not errors. */
6179 void_zero_node
= build_int_2 (0, 0);
6180 TREE_TYPE (void_zero_node
) = void_type_node
;
6182 string_type_node
= build_pointer_type (char_type_node
);
6183 const_string_type_node
6184 = build_pointer_type (build_qualified_type (char_type_node
,
6186 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6188 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6191 /* Make a type to be the domain of a few array types
6192 whose domains don't really matter.
6193 200 is small enough that it always fits in size_t
6194 and large enough that it can hold most function names for the
6195 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6196 array_domain_type
= build_index_type (build_int_2 (200, 0));
6198 /* Make a type for arrays of characters.
6199 With luck nothing will ever really depend on the length of this
6201 char_array_type_node
6202 = build_array_type (char_type_node
, array_domain_type
);
6203 /* Likewise for arrays of ints. */
6205 = build_array_type (integer_type_node
, array_domain_type
);
6207 /* This is just some anonymous class type. Nobody should ever
6208 need to look inside this envelope. */
6209 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6211 if (flag_huge_objects
)
6212 delta_type_node
= long_integer_type_node
;
6214 delta_type_node
= short_integer_type_node
;
6216 default_function_type
6217 = build_function_type (integer_type_node
, NULL_TREE
);
6219 ptr_type_node
= build_pointer_type (void_type_node
);
6221 = build_pointer_type (build_qualified_type (void_type_node
,
6223 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6226 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6228 /* C++ extensions */
6230 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6231 record_unknown_type (unknown_type_node
, "unknown type");
6233 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6234 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6236 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6238 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6240 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6241 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6243 /* This is special for C++ so functions can be overloaded. */
6244 wchar_type_node
= get_identifier (flag_short_wchar
6245 ? "short unsigned int"
6247 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6248 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6249 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6250 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6252 = TREE_UNSIGNED (wchar_type_node
)
6253 ? unsigned_wchar_type_node
6254 : signed_wchar_type_node
;
6255 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6257 /* Artificial declaration of wchar_t -- can be bashed */
6258 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6260 pushdecl (wchar_decl_node
);
6262 /* This is for wide string constants. */
6263 wchar_array_type_node
6264 = build_array_type (wchar_type_node
, array_domain_type
);
6266 if (flag_vtable_thunks
)
6268 /* Make sure we get a unique function type, so we can give
6269 its pointer type a name. (This wins for gdb.) */
6270 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6271 TREE_TYPE (vfunc_type
) = integer_type_node
;
6272 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6273 layout_type (vfunc_type
);
6275 vtable_entry_type
= build_pointer_type (vfunc_type
);
6279 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6280 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6282 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6284 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6286 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6289 /* Make this part of an invisible union. */
6290 fields
[3] = copy_node (fields
[2]);
6291 TREE_TYPE (fields
[3]) = delta_type_node
;
6292 DECL_NAME (fields
[3]) = delta2_identifier
;
6293 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6294 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6295 TREE_UNSIGNED (fields
[3]) = 0;
6296 TREE_CHAIN (fields
[2]) = fields
[3];
6297 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6300 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6303 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6304 layout_type (vtbl_type_node
);
6305 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6306 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6307 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6308 layout_type (vtbl_ptr_type_node
);
6309 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6311 std_node
= build_decl (NAMESPACE_DECL
,
6312 get_identifier (flag_honor_std
? "fake std":"std"),
6314 pushdecl (std_node
);
6316 global_type_node
= make_node (LANG_TYPE
);
6317 record_unknown_type (global_type_node
, "global type");
6320 current_lang_name
= lang_name_cplusplus
;
6323 tree bad_alloc_type_node
, newtype
, deltype
;
6325 push_namespace (get_identifier ("std"));
6326 bad_alloc_type_node
= xref_tag
6327 (class_type_node
, get_identifier ("bad_alloc"), 1);
6330 newtype
= build_exception_variant
6331 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6332 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6333 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
);
6334 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6335 global_delete_fndecl
= auto_function (ansi_opname
[(int) DELETE_EXPR
],
6337 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6341 = define_function ("__pure_virtual", void_ftype
, 0, 0);
6343 /* Perform other language dependent initializations. */
6344 init_class_processing ();
6345 init_init_processing ();
6346 init_search_processing ();
6347 init_rtti_processing ();
6349 if (flag_exceptions
)
6350 init_exception_processing ();
6353 flag_inline_functions
= 0;
6356 if (! supports_one_only ())
6359 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6360 declare_function_name ();
6362 /* Prepare to check format strings against argument lists. */
6363 init_function_format_info ();
6365 /* Show we use EH for cleanups. */
6366 using_eh_for_cleanups ();
6368 print_error_function
= lang_print_error_function
;
6369 lang_get_alias_set
= &c_get_alias_set
;
6370 valid_lang_attribute
= cp_valid_lang_attribute
;
6372 /* Maintain consistency. Perhaps we should just complain if they
6373 say -fwritable-strings? */
6374 if (flag_writable_strings
)
6375 flag_const_strings
= 0;
6377 /* Add GC roots for all of our global variables. */
6378 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6379 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6380 ggc_add_tree_root (&integer_three_node
, 1);
6381 ggc_add_tree_root (&integer_two_node
, 1);
6382 ggc_add_tree_root (&signed_size_zero_node
, 1);
6383 ggc_add_tree_root (&size_one_node
, 1);
6384 ggc_add_tree_root (&size_zero_node
, 1);
6385 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6386 mark_binding_level
);
6387 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6388 ggc_add_tree_root (&static_ctors
, 1);
6389 ggc_add_tree_root (&static_dtors
, 1);
6390 ggc_add_tree_root (&lastiddecl
, 1);
6392 ggc_add_tree_root (&enum_next_value
, 1);
6393 ggc_add_tree_root (&last_function_parm_tags
, 1);
6394 ggc_add_tree_root (¤t_function_return_value
, 1);
6395 ggc_add_tree_root (¤t_function_parms
, 1);
6396 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6397 ggc_add_tree_root (&last_function_parms
, 1);
6398 ggc_add_tree_root (&error_mark_list
, 1);
6400 ggc_add_tree_root (&global_namespace
, 1);
6401 ggc_add_tree_root (&global_type_node
, 1);
6402 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6404 ggc_add_tree_root (&got_object
, 1);
6405 ggc_add_tree_root (&got_scope
, 1);
6407 ggc_add_tree_root (¤t_lang_name
, 1);
6408 ggc_add_tree_root (&static_aggregates
, 1);
6411 /* Function to print any language-specific context for an error message. */
6414 lang_print_error_function (file
)
6417 default_print_error_function (file
);
6418 maybe_print_template_context ();
6421 /* Make a definition for a builtin function named NAME and whose data type
6422 is TYPE. TYPE should be a function type with argument types.
6424 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6425 the name to be called if we can't opencode the function. */
6428 define_function (name
, type
, pfn
, library_name
)
6431 void (*pfn
) PROTO((tree
));
6432 const char *library_name
;
6434 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6435 DECL_EXTERNAL (decl
) = 1;
6436 TREE_PUBLIC (decl
) = 1;
6437 DECL_ARTIFICIAL (decl
) = 1;
6439 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6440 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6442 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6443 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6444 function in the namespace. */
6445 if (pfn
) (*pfn
) (decl
);
6447 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6448 make_function_rtl (decl
);
6453 /* Wrapper around define_function, for the benefit of
6454 c_common_nodes_and_builtins.
6455 FUNCTION_CODE tells later passes how to compile calls to this function.
6456 See tree.h for its possible values. */
6459 builtin_function (name
, type
, code
, class, libname
)
6463 enum built_in_class
class;
6464 const char *libname
;
6466 tree decl
= define_function (name
, type
, (void (*) PROTO((tree
)))pushdecl
,
6468 DECL_BUILT_IN_CLASS (decl
) = class;
6469 DECL_FUNCTION_CODE (decl
) = code
;
6473 /* When we call finish_struct for an anonymous union, we create
6474 default copy constructors and such. But, an anonymous union
6475 shouldn't have such things; this function undoes the damage to the
6476 anonymous union type T.
6478 (The reason that we create the synthesized methods is that we don't
6479 distinguish `union { int i; }' from `typedef union { int i; } U'.
6480 The first is an anonymous union; the second is just an ordinary
6484 fixup_anonymous_aggr (t
)
6489 /* Wipe out memory of synthesized methods */
6490 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6491 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6492 TYPE_HAS_INIT_REF (t
) = 0;
6493 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6494 TYPE_HAS_ASSIGN_REF (t
) = 0;
6495 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6497 /* Splice the implicitly generated functions out of the TYPE_METHODS
6499 q
= &TYPE_METHODS (t
);
6502 if (DECL_ARTIFICIAL (*q
))
6503 *q
= TREE_CHAIN (*q
);
6505 q
= &TREE_CHAIN (*q
);
6508 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6509 function members. */
6510 if (TYPE_METHODS (t
))
6511 error ("an anonymous union cannot have function members");
6514 /* Make sure that a declaration with no declarator is well-formed, i.e.
6515 just defines a tagged type or anonymous union.
6517 Returns the type defined, if any. */
6520 check_tag_decl (declspecs
)
6524 tree ob_modifier
= NULL_TREE
;
6526 register tree t
= NULL_TREE
;
6528 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6530 register tree value
= TREE_VALUE (link
);
6536 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6538 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6542 else if (value
== ridpointers
[(int) RID_FRIEND
])
6544 if (current_class_type
== NULL_TREE
6545 || current_scope () != current_class_type
)
6546 ob_modifier
= value
;
6548 else if (value
== ridpointers
[(int) RID_STATIC
]
6549 || value
== ridpointers
[(int) RID_EXTERN
]
6550 || value
== ridpointers
[(int) RID_AUTO
]
6551 || value
== ridpointers
[(int) RID_REGISTER
]
6552 || value
== ridpointers
[(int) RID_INLINE
]
6553 || value
== ridpointers
[(int) RID_VIRTUAL
]
6554 || value
== ridpointers
[(int) RID_CONST
]
6555 || value
== ridpointers
[(int) RID_VOLATILE
]
6556 || value
== ridpointers
[(int) RID_EXPLICIT
])
6557 ob_modifier
= value
;
6561 error ("multiple types in one declaration");
6563 /* Inside a class, we might be in a friend or access declaration.
6564 Until we have a good way of detecting the latter, don't warn. */
6565 if (t
== NULL_TREE
&& ! current_class_type
)
6566 pedwarn ("declaration does not declare anything");
6568 /* Check for an anonymous union. We're careful
6569 accessing TYPE_IDENTIFIER because some built-in types, like
6570 pointer-to-member types, do not have TYPE_NAME. */
6571 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6573 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6575 /* Anonymous unions are objects, so they can have specifiers. */;
6576 SET_ANON_AGGR_TYPE_P (t
);
6578 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6579 pedwarn ("ISO C++ prohibits anonymous structs");
6582 else if (ob_modifier
)
6584 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6585 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6586 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6587 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6588 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6589 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6590 cp_error ("`%D' can only be specified for constructors",
6593 cp_error ("`%D' can only be specified for objects and functions",
6600 /* Called when a declaration is seen that contains no names to declare.
6601 If its type is a reference to a structure, union or enum inherited
6602 from a containing scope, shadow that tag name for the current scope
6603 with a forward reference.
6604 If its type defines a new named structure or union
6605 or defines an enum, it is valid but we need not do anything here.
6606 Otherwise, it is an error.
6608 C++: may have to grok the declspecs to learn about static,
6609 complain for anonymous unions. */
6612 shadow_tag (declspecs
)
6615 tree t
= check_tag_decl (declspecs
);
6618 maybe_process_partial_specialization (t
);
6620 /* This is where the variables in an anonymous union are
6621 declared. An anonymous union declaration looks like:
6623 because there is no declarator after the union, the parser
6624 sends that declaration here. */
6625 if (t
&& ANON_AGGR_TYPE_P (t
))
6627 fixup_anonymous_aggr (t
);
6629 if (TYPE_FIELDS (t
))
6631 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6633 finish_anon_union (decl
);
6638 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6641 groktypename (typename
)
6644 if (TREE_CODE (typename
) != TREE_LIST
)
6646 return grokdeclarator (TREE_VALUE (typename
),
6647 TREE_PURPOSE (typename
),
6648 TYPENAME
, 0, NULL_TREE
);
6651 /* Decode a declarator in an ordinary declaration or data definition.
6652 This is called as soon as the type information and variable name
6653 have been parsed, before parsing the initializer if any.
6654 Here we create the ..._DECL node, fill in its type,
6655 and put it on the list of decls for the current context.
6656 The ..._DECL node is returned as the value.
6658 Exception: for arrays where the length is not specified,
6659 the type is left null, to be filled in by `cp_finish_decl'.
6661 Function definitions do not come here; they go to start_function
6662 instead. However, external and forward declarations of functions
6663 do go through here. Structure field declarations are done by
6664 grokfield and not through here. */
6666 /* Set this to zero to debug not using the temporary obstack
6667 to parse initializers. */
6668 int debug_temp_inits
= 1;
6671 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6672 tree declarator
, declspecs
;
6674 tree attributes
, prefix_attributes
;
6677 register tree type
, tem
;
6679 extern int have_extern_spec
;
6680 extern int used_extern_spec
;
6684 /* See code below that used this. */
6685 int init_written
= initialized
;
6688 /* This should only be done once on the top most decl. */
6689 if (have_extern_spec
&& !used_extern_spec
)
6691 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6693 used_extern_spec
= 1;
6696 if (attributes
|| prefix_attributes
)
6697 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6699 attrlist
= NULL_TREE
;
6701 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6704 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6707 type
= TREE_TYPE (decl
);
6709 if (type
== error_mark_node
)
6713 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6714 ? DECL_CLASS_CONTEXT (decl
)
6715 : DECL_CONTEXT (decl
);
6717 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6718 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6720 /* When parsing the initializer, lookup should use the object's
6722 push_decl_namespace (context
);
6725 /* We are only interested in class contexts, later. */
6726 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6727 context
= NULL_TREE
;
6730 /* Is it valid for this decl to have an initializer at all?
6731 If not, set INITIALIZED to zero, which will indirectly
6732 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6733 switch (TREE_CODE (decl
))
6736 /* typedef foo = bar means give foo the same type as bar.
6737 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6738 Any other case of an initialization in a TYPE_DECL is an error. */
6739 if (pedantic
|| list_length (declspecs
) > 1)
6741 cp_error ("typedef `%D' is initialized", decl
);
6747 cp_error ("function `%#D' is initialized like a variable", decl
);
6757 if (! toplevel_bindings_p ()
6758 && DECL_EXTERNAL (decl
))
6759 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6761 DECL_EXTERNAL (decl
) = 0;
6762 if (toplevel_bindings_p ())
6763 TREE_STATIC (decl
) = 1;
6765 /* Tell `pushdecl' this is an initialized decl
6766 even though we don't yet have the initializer expression.
6767 Also tell `cp_finish_decl' it may store the real initializer. */
6768 DECL_INITIAL (decl
) = error_mark_node
;
6771 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6772 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6775 /* Set attributes here so if duplicate decl, will have proper attributes. */
6776 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6778 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6780 push_nested_class (context
, 2);
6782 if (TREE_CODE (decl
) == VAR_DECL
)
6784 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6785 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6786 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6789 if (DECL_CONTEXT (field
) != context
)
6791 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6792 DECL_CONTEXT (field
), DECL_NAME (decl
),
6793 context
, DECL_NAME (decl
));
6794 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6796 /* Static data member are tricky; an in-class initialization
6797 still doesn't provide a definition, so the in-class
6798 declaration will have DECL_EXTERNAL set, but will have an
6799 initialization. Thus, duplicate_decls won't warn
6800 about this situation, and so we check here. */
6801 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6802 cp_error ("duplicate initialization of %D", decl
);
6803 if (duplicate_decls (decl
, field
))
6809 tree field
= check_classfn (context
, decl
);
6810 if (field
&& duplicate_decls (decl
, field
))
6814 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6815 DECL_IN_AGGR_P (decl
) = 0;
6816 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6817 || CLASSTYPE_USE_TEMPLATE (context
))
6819 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6820 /* [temp.expl.spec] An explicit specialization of a static data
6821 member of a template is a definition if the declaration
6822 includes an initializer; otherwise, it is a declaration.
6824 We check for processing_specialization so this only applies
6825 to the new specialization syntax. */
6826 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6827 DECL_EXTERNAL (decl
) = 1;
6830 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6831 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6835 /* Enter this declaration into the symbol table. */
6836 tem
= maybe_push_decl (decl
);
6838 if (processing_template_decl
)
6840 if (at_function_scope_p ())
6841 push_permanent_obstack ();
6842 tem
= push_template_decl (tem
);
6843 if (at_function_scope_p ())
6848 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6849 /* Tell the back-end to use or not use .common as appropriate. If we say
6850 -fconserve-space, we want this to save .data space, at the expense of
6851 wrong semantics. If we say -fno-conserve-space, we want this to
6852 produce errors about redefs; to do this we force variables into the
6854 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6857 if (! processing_template_decl
)
6860 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6861 push_obstacks_nochange ();
6870 tree type
= TREE_TYPE (decl
);
6871 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6873 if (type
== error_mark_node
)
6876 /* If this type of object needs a cleanup, and control may
6877 jump past it, make a new binding level so that it is cleaned
6878 up only when it is initialized first. */
6879 if (TYPE_NEEDS_DESTRUCTOR (type
)
6880 && current_binding_level
->more_cleanups_ok
== 0)
6881 pushlevel_temporary (1);
6884 /* Is it valid for this decl to have an initializer at all?
6885 If not, set INITIALIZED to zero, which will indirectly
6886 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6888 /* Don't allow initializations for incomplete types except for
6889 arrays which might be completed by the initialization. */
6890 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6891 ; /* A complete type is ok. */
6892 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6894 cp_error ("variable `%#D' has initializer but incomplete type",
6897 type
= TREE_TYPE (decl
) = error_mark_node
;
6899 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6901 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6902 cp_error ("elements of array `%#D' have incomplete type", decl
);
6903 /* else we already gave an error in start_decl. */
6909 && TREE_CODE (decl
) != TYPE_DECL
6910 && TREE_CODE (decl
) != TEMPLATE_DECL
6911 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6913 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6914 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6916 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6918 /* Change the type so that assemble_variable will give
6919 DECL an rtl we can live with: (mem (const_int 0)). */
6920 type
= TREE_TYPE (decl
) = error_mark_node
;
6924 /* If any base type in the hierarchy of TYPE needs a constructor,
6925 then we set initialized to 1. This way any nodes which are
6926 created for the purposes of initializing this aggregate
6927 will live as long as it does. This is necessary for global
6928 aggregates which do not have their initializers processed until
6929 the end of the file. */
6930 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6935 DECL_INITIAL (decl
) = NULL_TREE
;
6938 /* Handle initialization of references.
6939 These three arguments are from `cp_finish_decl', and have the
6940 same meaning here that they do there.
6942 Quotes on semantics can be found in ARM 8.4.3. */
6945 grok_reference_init (decl
, type
, init
)
6946 tree decl
, type
, init
;
6950 if (init
== NULL_TREE
)
6952 if ((DECL_LANG_SPECIFIC (decl
) == 0
6953 || DECL_IN_AGGR_P (decl
) == 0)
6954 && ! DECL_THIS_EXTERN (decl
))
6955 cp_error ("`%D' declared as reference but not initialized", decl
);
6959 if (init
== error_mark_node
)
6962 if (TREE_CODE (init
) == CONSTRUCTOR
)
6964 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6968 if (TREE_CODE (init
) == TREE_LIST
)
6969 init
= build_compound_expr (init
);
6971 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6972 init
= convert_from_reference (init
);
6974 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6975 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6977 /* Note: default conversion is only called in very special cases. */
6978 init
= default_conversion (init
);
6981 /* Convert INIT to the reference type TYPE. This may involve the
6982 creation of a temporary, whose lifetime must be the same as that
6983 of the reference. If so, a DECL_STMT for the temporary will be
6984 added just after the DECL_STMT for DECL. That's why we don't set
6985 DECL_INITIAL for local references (instead assigning to them
6986 explicitly); we need to allow the temporary to be initialized
6988 tmp
= convert_to_reference
6989 (type
, init
, CONV_IMPLICIT
,
6990 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6992 if (tmp
== error_mark_node
)
6994 else if (tmp
!= NULL_TREE
)
6997 tmp
= save_expr (tmp
);
6998 if (building_stmt_tree ())
7000 /* Initialize the declaration. */
7001 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7002 finish_expr_stmt (tmp
);
7005 DECL_INITIAL (decl
) = tmp
;
7009 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7013 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7015 expand_static_init (decl
, DECL_INITIAL (decl
));
7016 DECL_INITIAL (decl
) = NULL_TREE
;
7021 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7022 mucking with forces it does not comprehend (i.e. initialization with a
7023 constructor). If we are at global scope and won't go into COMMON, fill
7024 it in with a dummy CONSTRUCTOR to force the variable into .data;
7025 otherwise we can use error_mark_node. */
7028 obscure_complex_init (decl
, init
)
7031 if (! flag_no_inline
&& TREE_STATIC (decl
))
7033 if (extract_init (decl
, init
))
7037 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7038 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7039 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7043 DECL_INITIAL (decl
) = error_mark_node
;
7048 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7049 array until we finish parsing the initializer. If that's the
7050 situation we're in, update DECL accordingly. */
7053 maybe_deduce_size_from_array_init (decl
, init
)
7057 tree type
= TREE_TYPE (decl
);
7059 if (TREE_CODE (type
) == ARRAY_TYPE
7060 && TYPE_DOMAIN (type
) == NULL_TREE
7061 && TREE_CODE (decl
) != TYPE_DECL
)
7064 = (TREE_STATIC (decl
)
7065 /* Even if pedantic, an external linkage array
7066 may have incomplete type at first. */
7067 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7068 : !DECL_EXTERNAL (decl
));
7069 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7070 int failure
= complete_array_type (type
, initializer
, do_default
);
7073 cp_error ("initializer fails to determine size of `%D'", decl
);
7078 cp_error ("array size missing in `%D'", decl
);
7079 /* If a `static' var's size isn't known, make it extern as
7080 well as static, so it does not get allocated. If it's not
7081 `static', then don't mark it extern; finish_incomplete_decl
7082 will give it a default size and it will get allocated. */
7083 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7084 DECL_EXTERNAL (decl
) = 1;
7087 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7088 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7090 cp_error ("zero-size array `%D'", decl
);
7092 layout_decl (decl
, 0);
7096 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7097 any appropriate error messages regarding the layout. */
7100 layout_var_decl (decl
)
7103 tree type
= TREE_TYPE (decl
);
7104 tree ttype
= target_type (type
);
7106 /* If we haven't already layed out this declaration, do so now.
7107 Note that we must not call complete type for an external object
7108 because it's type might involve templates that we are not
7109 supposed to isntantiate yet. (And it's perfectly legal to say
7110 `extern X x' for some incomplete type `X'.) */
7111 if (!DECL_EXTERNAL (decl
))
7112 complete_type (type
);
7113 if (!DECL_SIZE (decl
)&& TYPE_SIZE (type
))
7114 layout_decl (decl
, 0);
7116 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7118 /* An automatic variable with an incomplete type: that is an error.
7119 Don't talk about array types here, since we took care of that
7120 message in grokdeclarator. */
7121 cp_error ("storage size of `%D' isn't known", decl
);
7122 TREE_TYPE (decl
) = error_mark_node
;
7124 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7125 /* Let debugger know it should output info for this type. */
7126 note_debug_info_needed (ttype
);
7128 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7129 note_debug_info_needed (DECL_CONTEXT (decl
));
7131 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7132 && DECL_SIZE (decl
) != NULL_TREE
7133 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7135 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7136 constant_expression_warning (DECL_SIZE (decl
));
7138 cp_error ("storage size of `%D' isn't constant", decl
);
7142 /* If a local static variable is declared in an inline function, or if
7143 we have a weak definition, we must endeavor to create only one
7144 instance of the variable at link-time. */
7147 maybe_commonize_var (decl
)
7150 /* Static data in a function with comdat linkage also has comdat
7152 if (TREE_STATIC (decl
)
7153 /* Don't mess with __FUNCTION__. */
7154 && ! TREE_ASM_WRITTEN (decl
)
7155 && current_function_decl
7156 && DECL_CONTEXT (decl
) == current_function_decl
7157 && (DECL_THIS_INLINE (current_function_decl
)
7158 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7159 && TREE_PUBLIC (current_function_decl
))
7161 /* Rather than try to get this right with inlining, we suppress
7162 inlining of such functions. */
7163 current_function_cannot_inline
7164 = "function with static variable cannot be inline";
7166 /* If flag_weak, we don't need to mess with this, as we can just
7167 make the function weak, and let it refer to its unique local
7168 copy. This works because we don't allow the function to be
7172 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7174 TREE_PUBLIC (decl
) = 1;
7175 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7177 else if (DECL_INITIAL (decl
) == NULL_TREE
7178 || DECL_INITIAL (decl
) == error_mark_node
)
7180 TREE_PUBLIC (decl
) = 1;
7181 DECL_COMMON (decl
) = 1;
7183 /* else we lose. We can only do this if we can use common,
7184 which we can't if it has been initialized. */
7186 if (TREE_PUBLIC (decl
))
7187 DECL_ASSEMBLER_NAME (decl
)
7188 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7189 else if (! DECL_ARTIFICIAL (decl
))
7191 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7192 cp_warning_at (" you can work around this by removing the initializer", decl
);
7196 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7197 /* Set it up again; we might have set DECL_INITIAL since the last
7199 comdat_linkage (decl
);
7202 /* Issue an error message if DECL is an uninitialized const variable. */
7205 check_for_uninitialized_const_var (decl
)
7208 tree type
= TREE_TYPE (decl
);
7210 /* ``Unless explicitly declared extern, a const object does not have
7211 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7213 if (TREE_CODE (decl
) == VAR_DECL
7214 && TREE_CODE (type
) != REFERENCE_TYPE
7215 && CP_TYPE_CONST_P (type
)
7216 && !TYPE_NEEDS_CONSTRUCTING (type
)
7217 && !DECL_INITIAL (decl
))
7218 cp_error ("uninitialized const `%D'", decl
);
7221 /* Verify INIT (the initializer for DECL), and record the
7222 initialization in DECL_INITIAL, if appropriate. Returns a new
7226 check_initializer (decl
, init
)
7232 if (TREE_CODE (decl
) == FIELD_DECL
)
7235 type
= TREE_TYPE (decl
);
7237 /* If `start_decl' didn't like having an initialization, ignore it now. */
7238 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7241 /* Check the initializer. */
7244 /* Things that are going to be initialized need to have complete
7246 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7248 if (type
== error_mark_node
)
7249 /* We will have already complained. */
7251 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7253 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7256 else if (TREE_CODE (type
) == ARRAY_TYPE
7257 && !TYPE_SIZE (TREE_TYPE (type
)))
7259 cp_error ("elements of array `%#D' have incomplete type", decl
);
7262 else if (!TYPE_SIZE (type
))
7264 cp_error ("`%D' has incomplete type", decl
);
7265 TREE_TYPE (decl
) = error_mark_node
;
7270 if (TREE_CODE (decl
) == CONST_DECL
)
7272 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7274 DECL_INITIAL (decl
) = init
;
7276 /* This will keep us from needing to worry about our obstacks. */
7277 my_friendly_assert (init
!= NULL_TREE
, 149);
7280 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7282 if (TREE_STATIC (decl
))
7283 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7284 grok_reference_init (decl
, type
, init
);
7289 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7291 if (TREE_CODE (type
) == ARRAY_TYPE
)
7292 init
= digest_init (type
, init
, (tree
*) 0);
7293 else if (TREE_CODE (init
) == CONSTRUCTOR
7294 && TREE_HAS_CONSTRUCTOR (init
))
7296 if (TYPE_NON_AGGREGATE_CLASS (type
))
7298 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7300 init
= error_mark_node
;
7303 goto dont_use_constructor
;
7308 dont_use_constructor
:
7309 if (TREE_CODE (init
) != TREE_VEC
)
7310 init
= store_init_value (decl
, init
);
7314 /* We must hide the initializer so that expand_decl
7315 won't try to do something it does not understand. */
7316 init
= obscure_complex_init (decl
, init
);
7318 else if (DECL_EXTERNAL (decl
))
7320 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7321 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7323 tree core_type
= strip_array_types (type
);
7325 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7327 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7328 cp_error ("structure `%D' with uninitialized const members", decl
);
7329 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7330 cp_error ("structure `%D' with uninitialized reference members",
7334 check_for_uninitialized_const_var (decl
);
7336 if (TYPE_SIZE (type
) != NULL_TREE
7337 && TYPE_NEEDS_CONSTRUCTING (type
))
7338 init
= obscure_complex_init (decl
, NULL_TREE
);
7342 check_for_uninitialized_const_var (decl
);
7347 /* If DECL is not a local variable, give it RTL. */
7350 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7353 const char *asmspec
;
7358 type
= TREE_TYPE (decl
);
7359 toplev
= toplevel_bindings_p ();
7361 /* Handle non-variables up front. */
7362 if (TREE_CODE (decl
) != VAR_DECL
)
7364 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7368 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7370 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7372 if (DECL_VIRTUAL_P (decl
))
7373 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7374 else if (TREE_READONLY (decl
)
7375 && DECL_INITIAL (decl
) != NULL_TREE
7376 && DECL_INITIAL (decl
) != error_mark_node
7377 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7379 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7382 && TREE_STATIC (decl
)
7383 && ! TREE_SIDE_EFFECTS (decl
)
7384 && ! TREE_PUBLIC (decl
)
7385 && ! DECL_EXTERNAL (decl
)
7386 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7387 && DECL_MODE (decl
) != BLKmode
)
7389 /* If this variable is really a constant, then fill its DECL_RTL
7390 slot with something which won't take up storage.
7391 If something later should take its address, we can always give
7392 it legitimate RTL at that time. */
7393 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7394 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7395 TREE_ASM_WRITTEN (decl
) = 1;
7397 else if (toplev
&& ! TREE_PUBLIC (decl
))
7399 /* If this is a static const, change its apparent linkage
7400 if it belongs to a #pragma interface. */
7401 if (!interface_unknown
)
7403 TREE_PUBLIC (decl
) = 1;
7404 DECL_EXTERNAL (decl
) = interface_only
;
7406 make_decl_rtl (decl
, asmspec
, toplev
);
7409 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7411 else if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7413 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7415 if (init
== NULL_TREE
7416 #ifdef DEFAULT_STATIC_DEFS
7417 /* If this code is dead, then users must
7418 explicitly declare static member variables
7419 outside the class def'n as well. */
7420 && TYPE_NEEDS_CONSTRUCTING (type
)
7424 DECL_EXTERNAL (decl
) = 1;
7425 make_decl_rtl (decl
, asmspec
, 1);
7428 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7430 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7431 || (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
)))
7432 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7435 /* The old ARM scoping rules injected variables declared in the
7436 initialization statement of a for-statement into the surrounding
7437 scope. We support this usage, in order to be backward-compatible.
7438 DECL is a just-declared VAR_DECL; if necessary inject its
7439 declaration into the surrounding scope. */
7442 maybe_inject_for_scope_var (decl
)
7445 if (current_binding_level
->is_for_scope
)
7447 struct binding_level
*outer
7448 = current_binding_level
->level_chain
;
7450 /* Check to see if the same name is already bound at the outer
7451 level, either because it was directly declared, or because a
7452 dead for-decl got preserved. In either case, the code would
7453 not have been valid under the ARM scope rules, so clear
7454 is_for_scope for the current_binding_level.
7456 Otherwise, we need to preserve the temp slot for decl to last
7457 into the outer binding level. */
7460 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7462 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7463 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7465 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7467 BINDING_VALUE (outer_binding
)
7468 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7469 current_binding_level
->is_for_scope
= 0;
7471 else if (DECL_IN_MEMORY_P (decl
))
7472 preserve_temp_slots (DECL_RTL (decl
));
7476 /* Generate code to initialize DECL (a local variable). */
7479 initialize_local_var (decl
, init
, flags
)
7484 tree type
= TREE_TYPE (decl
);
7486 /* If the type is bogus, don't bother initializing the variable. */
7487 if (type
== error_mark_node
)
7490 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7492 /* If we used it already as memory, it must stay in memory. */
7493 DECL_INITIAL (decl
) = NULL_TREE
;
7494 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7497 /* Local statics are handled differently from ordinary automatic
7499 if (TREE_STATIC (decl
))
7501 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7502 || TYPE_NEEDS_DESTRUCTOR (type
))
7503 expand_static_init (decl
, init
);
7507 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7511 /* Compute and store the initial value. */
7512 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7514 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7516 int saved_stmts_are_full_exprs_p
;
7518 emit_line_note (DECL_SOURCE_FILE (decl
),
7519 DECL_SOURCE_LINE (decl
));
7520 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7521 stmts_are_full_exprs_p
= 1;
7522 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7523 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7526 /* Set this to 0 so we can tell whether an aggregate which was
7527 initialized was ever used. Don't do this if it has a
7528 destructor, so we don't complain about the 'resource
7529 allocation is initialization' idiom. Now set
7530 attribute((unused)) on types so decls of that type will be
7531 marked used. (see TREE_USED, above.) */
7532 if (TYPE_NEEDS_CONSTRUCTING (type
)
7534 && !TYPE_NEEDS_DESTRUCTOR (type
)
7535 && DECL_NAME (decl
))
7536 TREE_USED (decl
) = 0;
7537 else if (already_used
)
7538 TREE_USED (decl
) = 1;
7542 /* Generate code to destroy DECL (a local variable). */
7545 destroy_local_var (decl
)
7548 tree type
= TREE_TYPE (decl
);
7551 /* Only variables get cleaned up. */
7552 if (TREE_CODE (decl
) != VAR_DECL
)
7555 /* And only things with destructors need cleaning up. */
7556 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7559 if (TREE_CODE (decl
) == VAR_DECL
&&
7560 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7561 /* We don't clean up things that aren't defined in this
7562 translation unit, or that need a static cleanup. The latter
7563 are handled by finish_file. */
7566 /* Compute the cleanup. */
7567 cleanup
= maybe_build_cleanup (decl
);
7569 /* Record the cleanup required for this declaration. */
7570 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7572 finish_decl_cleanup (decl
, cleanup
);
7575 /* Let the back-end know about DECL. */
7578 emit_local_var (decl
)
7581 /* Create RTL for this variable. */
7582 if (DECL_RTL (decl
))
7583 /* Only a RESULT_DECL should have non-NULL RTL when
7584 arriving here. All other local variables are
7585 assigned RTL in this function. */
7586 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7590 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7591 /* The user must have specified an assembler name for this
7592 variable. Set that up now. */
7593 rest_of_decl_compilation
7594 (decl
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
7595 /*top_level=*/0, /*at_end=*/0);
7600 /* Actually do the initialization. */
7601 expand_start_target_temps ();
7602 expand_decl_init (decl
);
7603 expand_end_target_temps ();
7606 /* Finish processing of a declaration;
7607 install its line number and initial value.
7608 If the length of an array type is not known before,
7609 it must be determined now, from the initial value, or it is an error.
7611 Call `pop_obstacks' iff NEED_POP is nonzero.
7613 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7614 for aggregates that have constructors alive on the permanent obstack,
7615 so that the global initializing functions can be written at the end.
7617 INIT0 holds the value of an initializer that should be allowed to escape
7620 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7621 if the (init) syntax was used.
7623 For functions that take default parameters, DECL points to its
7624 "maximal" instantiation. `cp_finish_decl' must then also declared its
7625 subsequently lower and lower forms of instantiation, checking for
7626 ambiguity as it goes. This can be sped up later. */
7629 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7636 tree ttype
= NULL_TREE
;
7637 int temporary
= allocation_temporary_p ();
7638 const char *asmspec
= NULL
;
7639 int was_readonly
= 0;
7641 /* If this is 0, then we did not change obstacks. */
7645 error ("assignment (not initialization) in declaration");
7649 /* If a name was specified, get the string. */
7651 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7653 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7655 cp_error ("Cannot initialize `%D' to namespace `%D'",
7660 if (current_class_type
7661 && DECL_REAL_CONTEXT (decl
) == current_class_type
7662 && TYPE_BEING_DEFINED (current_class_type
)
7663 && (DECL_INITIAL (decl
) || init
))
7664 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7666 if (TREE_CODE (decl
) == VAR_DECL
7667 && DECL_CONTEXT (decl
)
7668 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7669 && DECL_CONTEXT (decl
) != current_namespace
7672 /* Leave the namespace of the object. */
7673 pop_decl_namespace ();
7676 type
= TREE_TYPE (decl
);
7678 if (type
== error_mark_node
)
7680 if (toplevel_bindings_p () && temporary
)
7681 end_temporary_allocation ();
7686 /* Add this declaration to the statement-tree. */
7687 if (building_stmt_tree ()
7688 && TREE_CODE (current_scope ()) == FUNCTION_DECL
)
7689 add_decl_stmt (decl
);
7691 if (TYPE_HAS_MUTABLE_P (type
))
7692 TREE_READONLY (decl
) = 0;
7694 if (processing_template_decl
)
7696 if (init
&& DECL_INITIAL (decl
))
7697 DECL_INITIAL (decl
) = init
;
7701 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7702 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7704 /* Take care of TYPE_DECLs up front. */
7705 if (TREE_CODE (decl
) == TYPE_DECL
)
7707 if (init
&& DECL_INITIAL (decl
))
7709 /* typedef foo = bar; store the type of bar as the type of foo. */
7710 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7711 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7713 if (type
!= error_mark_node
7714 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7716 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7717 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7718 set_identifier_type_value (DECL_NAME (decl
), type
);
7719 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7721 GNU_xref_decl (current_function_decl
, decl
);
7723 /* If we have installed this as the canonical typedef for this
7724 type, and that type has not been defined yet, delay emitting
7725 the debug information for it, as we will emit it later. */
7726 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7727 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7728 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7730 rest_of_decl_compilation (decl
, NULL_PTR
,
7731 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7735 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7736 ttype
= target_type (type
);
7738 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7739 && TYPE_NEEDS_CONSTRUCTING (type
))
7741 /* Currently, GNU C++ puts constants in text space, making them
7742 impossible to initialize. In the future, one would hope for
7743 an operating system which understood the difference between
7744 initialization and the running of a program. */
7746 TREE_READONLY (decl
) = 0;
7749 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7751 /* This must override the asm specifier which was placed by
7752 grokclassfn. Lay this out fresh. */
7753 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7754 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7755 make_decl_rtl (decl
, asmspec
, 0);
7758 /* Deduce size of array from initialization, if not already known. */
7759 maybe_deduce_size_from_array_init (decl
, init
);
7760 init
= check_initializer (decl
, init
);
7762 GNU_xref_decl (current_function_decl
, decl
);
7764 /* For top-level declaration, the initial value was read in
7765 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7766 must go in the permanent obstack; but don't discard the
7767 temporary data yet. */
7769 if (toplevel_bindings_p () && temporary
)
7770 end_temporary_allocation ();
7772 if (TREE_CODE (decl
) == VAR_DECL
)
7773 layout_var_decl (decl
);
7775 /* Output the assembler code and/or RTL code for variables and functions,
7776 unless the type is an undefined structure or union.
7777 If not, it will get done when the type is completed. */
7778 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7779 || TREE_CODE (decl
) == RESULT_DECL
)
7781 if (TREE_CODE (decl
) == VAR_DECL
)
7782 maybe_commonize_var (decl
);
7784 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7786 if (TREE_CODE (type
) == FUNCTION_TYPE
7787 || TREE_CODE (type
) == METHOD_TYPE
)
7788 abstract_virtuals_error (decl
,
7789 strip_array_types (TREE_TYPE (type
)));
7791 abstract_virtuals_error (decl
, strip_array_types (type
));
7793 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7795 else if (DECL_EXTERNAL (decl
)
7796 && ! (DECL_LANG_SPECIFIC (decl
)
7797 && DECL_NOT_REALLY_EXTERN (decl
)))
7800 DECL_INITIAL (decl
) = init
;
7802 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
7804 /* This is a local declaration. */
7805 if (doing_semantic_analysis_p ())
7806 maybe_inject_for_scope_var (decl
);
7807 /* Initialize the local variable. But, if we're building a
7808 statement-tree, we'll do the initialization when we
7810 if (processing_template_decl
)
7812 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7813 DECL_INITIAL (decl
) = init
;
7817 /* If we're not building RTL, then we need to do so
7819 if (!building_stmt_tree ())
7820 emit_local_var (decl
);
7821 /* Initialize the variable. */
7822 initialize_local_var (decl
, init
, flags
);
7823 /* Clean up the variable. */
7824 destroy_local_var (decl
);
7827 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7829 /* Cleanups for static variables are handled by `finish_file'. */
7830 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7831 || TYPE_NEEDS_DESTRUCTOR (type
))
7832 expand_static_init (decl
, init
);
7836 /* Undo call to `pushclass' that was done in `start_decl'
7837 due to initialization of qualified member variable.
7838 I.e., Foo::x = 10; */
7840 tree context
= DECL_REAL_CONTEXT (decl
);
7842 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7843 && (TREE_CODE (decl
) == VAR_DECL
7844 /* We also have a pushclass done that we need to undo here
7845 if we're at top level and declare a method. */
7846 || TREE_CODE (decl
) == FUNCTION_DECL
)
7847 /* If size hasn't been set, we're still defining it,
7848 and therefore inside the class body; don't pop
7849 the binding level.. */
7850 && TYPE_SIZE (context
) != NULL_TREE
7851 && context
== current_class_type
)
7852 pop_nested_class ();
7858 /* If requested, warn about definitions of large data objects. */
7860 if (warn_larger_than
7861 && ! processing_template_decl
7862 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7863 && !DECL_EXTERNAL (decl
))
7865 register tree decl_size
= DECL_SIZE (decl
);
7867 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7869 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7871 if (units
> larger_than_size
)
7872 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7877 /* Resume permanent allocation, if not within a function. The
7878 corresponding push_obstacks_nochange is in start_decl,
7879 start_method, groktypename, and in grokfield. */
7883 TREE_READONLY (decl
) = 1;
7886 /* This is here for a midend callback from c-common.c */
7889 finish_decl (decl
, init
, asmspec_tree
)
7893 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7896 /* Generate code to handle the destruction of the function-scoped
7897 static variable DECL. */
7900 destroy_local_static (decl
)
7903 tree cleanup
, fcall
;
7905 int saved_flag_access_control
;
7907 if (atexit_node
== 0)
7909 tree atexit_fndecl
, PFV
, pfvlist
;
7910 /* Remember this information until end of file. */
7911 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7912 PFV
= build_pointer_type (build_function_type
7913 (void_type_node
, void_list_node
));
7915 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7917 push_lang_context (lang_name_c
);
7918 /* Note that we do not call pushdecl for this function;
7919 there's no reason that this declaration should be
7920 accessible to anyone. */
7922 = define_function ("atexit",
7923 build_function_type (void_type_node
,
7925 /*pfn=*/0, NULL_PTR
);
7926 mark_used (atexit_fndecl
);
7927 atexit_node
= default_conversion (atexit_fndecl
);
7928 pop_lang_context ();
7932 /* Call build_cleanup before we enter the anonymous function so that
7933 any access checks will be done relative to the current scope,
7934 rather than the scope of the anonymous function. */
7935 build_cleanup (decl
);
7937 /* Now start the function. */
7938 cleanup
= start_anon_func ();
7940 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7941 to the original function, rather than the anonymous one. That
7942 will make the back-end think that nested functions are in use,
7943 which causes confusion. */
7944 saved_flag_access_control
= flag_access_control
;
7945 flag_access_control
= 0;
7946 fcall
= build_cleanup (decl
);
7947 flag_access_control
= saved_flag_access_control
;
7949 /* Create the body of the anonymous function. */
7950 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7951 finish_expr_stmt (fcall
);
7952 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7955 /* Call atexit with the cleanup function. */
7956 mark_addressable (cleanup
);
7957 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7958 fcall
= build_function_call (atexit_node
,
7959 tree_cons (NULL_TREE
,
7962 finish_expr_stmt (fcall
);
7966 expand_static_init (decl
, init
)
7970 tree oldstatic
= value_member (decl
, static_aggregates
);
7974 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7975 cp_error ("multiple initializations given for `%D'", decl
);
7977 else if (! toplevel_bindings_p ())
7979 /* Emit code to perform this initialization but once. */
7986 /* Remember this information until end of file. */
7987 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7989 /* Emit code to perform this initialization but once. This code
7992 static int temp = 0;
7994 // Do initialization.
7996 // Register variable for destruction at end of program.
7999 Note that the `temp' variable is only set to 1 *after* the
8000 initialization is complete. This ensures that an exception,
8001 thrown during the construction, will cause the variable to
8002 reinitialized when we pass through this code again, as per:
8006 If the initialization exits by throwing an exception, the
8007 initialization is not complete, so it will be tried again
8008 the next time control enters the declaration.
8010 In theory, this process should be thread-safe, too; multiple
8011 threads should not be able to initialize the variable more
8012 than once. We don't yet attempt to ensure thread-safety. */
8013 temp
= get_temp_name (integer_type_node
, 1);
8014 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8016 /* Begin the conditional initialization. */
8017 if_stmt
= begin_if_stmt ();
8018 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
8021 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8023 /* Do the initialization itself. */
8024 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8025 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8026 assignment
= build_aggr_init (decl
, init
, 0);
8028 /* The initialization we're doing here is just a bitwise
8030 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8032 assignment
= NULL_TREE
;
8034 /* Once the assignment is complete, set TEMP to 1. Since the
8035 construction of the static object is complete at this point,
8036 we want to make sure TEMP is set to 1 even if a temporary
8037 constructed during the initialization throws an exception
8038 when it is destroyed. So, we combine the initialization and
8039 the assignment to TEMP into a single expression, ensuring
8040 that when we call finish_expr_stmt the cleanups will not be
8041 run until after TEMP is set to 1. */
8042 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8045 assignment
= tree_cons (NULL_TREE
, assignment
,
8046 build_tree_list (NULL_TREE
,
8048 assignment
= build_compound_expr (assignment
);
8051 assignment
= temp_init
;
8052 finish_expr_stmt (assignment
);
8054 /* Use atexit to register a function for destroying this static
8056 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8057 destroy_local_static (decl
);
8059 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8060 finish_then_clause (if_stmt
);
8063 /* Resume old (possibly temporary) allocation. */
8068 /* This code takes into account memory allocation policy of
8069 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8070 hold for this object, then we must make permanent the storage
8071 currently in the temporary obstack. */
8072 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8073 preserve_initializer ();
8074 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8078 /* Finish the declaration of a catch-parameter. */
8081 start_handler_parms (declspecs
, declarator
)
8088 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8090 if (decl
== NULL_TREE
)
8091 error ("invalid catch parameter");
8100 /* Make TYPE a complete type based on INITIAL_VALUE.
8101 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8102 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8105 complete_array_type (type
, initial_value
, do_default
)
8106 tree type
, initial_value
;
8109 register tree maxindex
= NULL_TREE
;
8112 /* Allocate on the same obstack as TYPE. */
8113 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8117 /* Note MAXINDEX is really the maximum index,
8118 one less than the size. */
8119 if (TREE_CODE (initial_value
) == STRING_CST
)
8122 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8123 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8126 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8128 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8129 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8130 for (; elts
; elts
= TREE_CHAIN (elts
))
8132 if (TREE_PURPOSE (elts
))
8133 maxindex
= TREE_PURPOSE (elts
);
8135 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8137 maxindex
= copy_node (maxindex
);
8141 /* Make an error message unless that happened already. */
8142 if (initial_value
!= error_mark_node
)
8145 initial_value
= NULL_TREE
;
8147 /* Prevent further error messages. */
8148 maxindex
= build_int_2 (0, 0);
8155 maxindex
= build_int_2 (0, 0);
8164 domain
= build_index_type (maxindex
);
8165 TYPE_DOMAIN (type
) = domain
;
8167 if (! TREE_TYPE (maxindex
))
8168 TREE_TYPE (maxindex
) = domain
;
8170 itype
= TREE_TYPE (initial_value
);
8173 if (itype
&& !TYPE_DOMAIN (itype
))
8174 TYPE_DOMAIN (itype
) = domain
;
8175 /* The type of the main variant should never be used for arrays
8176 of different sizes. It should only ever be completed with the
8177 size of the array. */
8178 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8179 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8184 /* Lay out the type now that we can get the real answer. */
8191 /* Return zero if something is declared to be a member of type
8192 CTYPE when in the context of CUR_TYPE. STRING is the error
8193 message to print in that case. Otherwise, quietly return 1. */
8196 member_function_or_else (ctype
, cur_type
, string
)
8197 tree ctype
, cur_type
;
8200 if (ctype
&& ctype
!= cur_type
)
8202 error (string
, TYPE_NAME_STRING (ctype
));
8208 /* Subroutine of `grokdeclarator'. */
8210 /* Generate errors possibly applicable for a given set of specifiers.
8211 This is for ARM $7.1.2. */
8214 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8217 int virtualp
, quals
, friendp
, raises
, inlinep
;
8220 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8222 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8224 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8227 cp_error_at ("`%D' declared as a friend", object
);
8229 cp_error_at ("`%D' declared with an exception specification", object
);
8232 /* CTYPE is class type, or null if non-class.
8233 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8235 DECLARATOR is the function's name.
8236 VIRTUALP is truthvalue of whether the function is virtual or not.
8237 FLAGS are to be passed through to `grokclassfn'.
8238 QUALS are qualifiers indicating whether the function is `const'
8240 RAISES is a list of exceptions that this function can raise.
8241 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8242 not look, and -1 if we should not call `grokclassfn' at all.
8244 Returns `NULL_TREE' if something goes wrong, after issuing
8245 applicable error messages. */
8248 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8249 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8250 template_count
, in_namespace
)
8253 tree orig_declarator
;
8255 enum overload_flags flags
;
8257 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8261 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8262 int has_default_arg
= 0;
8266 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8267 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8273 type
= build_exception_variant (type
, raises
);
8276 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8277 /* Propagate volatile out from type to decl. */
8278 if (TYPE_VOLATILE (type
))
8279 TREE_THIS_VOLATILE (decl
) = 1;
8281 /* If this decl has namespace scope, set that up. */
8283 set_decl_namespace (decl
, in_namespace
, friendp
);
8284 else if (publicp
&& ! ctype
)
8285 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8287 /* `main' and builtins have implicit 'C' linkage. */
8288 if ((MAIN_NAME_P (declarator
)
8289 || (IDENTIFIER_LENGTH (declarator
) > 10
8290 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8291 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8292 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8293 && current_lang_name
== lang_name_cplusplus
8294 && ctype
== NULL_TREE
8295 /* NULL_TREE means global namespace. */
8296 && DECL_CONTEXT (decl
) == NULL_TREE
)
8297 DECL_LANGUAGE (decl
) = lang_c
;
8299 /* Should probably propagate const out from type to decl I bet (mrs). */
8302 DECL_STATIC_FUNCTION_P (decl
) = 1;
8303 DECL_CONTEXT (decl
) = ctype
;
8307 DECL_CLASS_CONTEXT (decl
) = ctype
;
8309 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8311 if (processing_template_decl
)
8312 error ("cannot declare `main' to be a template");
8314 error ("cannot declare `main' to be inline");
8316 error ("cannot declare `main' to be static");
8321 /* Members of anonymous types and local classes have no linkage; make
8323 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8324 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8329 /* [basic.link]: A name with no linkage (notably, the name of a class
8330 or enumeration declared in a local scope) shall not be used to
8331 declare an entity with linkage.
8333 Only check this for public decls for now. */
8334 t
= no_linkage_check (TREE_TYPE (decl
));
8337 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8339 if (DECL_LANGUAGE (decl
) == lang_c
)
8340 /* Allow this; it's pretty common in C. */;
8342 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8346 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8351 TREE_PUBLIC (decl
) = publicp
;
8354 DECL_INTERFACE_KNOWN (decl
) = 1;
8355 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8359 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8361 DECL_EXTERNAL (decl
) = 1;
8362 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8364 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8365 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8369 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8370 grok_op_properties (decl
, virtualp
, check
< 0);
8372 if (ctype
&& hack_decl_function_context (decl
))
8373 DECL_NO_STATIC_CHAIN (decl
) = 1;
8375 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8376 if (TREE_PURPOSE (t
)
8377 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8379 has_default_arg
= 1;
8384 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8388 ("defining explicit specialization `%D' in friend declaration",
8392 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8394 /* Something like `template <class T> friend void f<T>()'. */
8395 cp_error ("template-id `%D' in declaration of primary template",
8401 /* A friend declaration of the form friend void f<>(). Record
8402 the information in the TEMPLATE_ID_EXPR. */
8403 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8404 DECL_TEMPLATE_INFO (decl
)
8405 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8406 TREE_OPERAND (orig_declarator
, 1),
8409 if (has_default_arg
)
8411 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8418 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8425 if (has_default_arg
)
8426 add_defarg_fn (decl
);
8428 /* Plain overloading: will not be grok'd by grokclassfn. */
8429 if (! ctype
&& ! processing_template_decl
8430 && DECL_LANGUAGE (decl
) != lang_c
8431 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8432 set_mangled_name_for_decl (decl
);
8435 /* Make the init_value nonzero so pushdecl knows this is not
8436 tentative. error_mark_node is replaced later with the BLOCK. */
8437 DECL_INITIAL (decl
) = error_mark_node
;
8439 /* Caller will do the rest of this. */
8443 if (check
&& funcdef_flag
)
8444 DECL_INITIAL (decl
) = error_mark_node
;
8446 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8449 /* Just handle constructors here. We could do this
8450 inside the following if stmt, but I think
8451 that the code is more legible by breaking this
8452 case out. See comments below for what each of
8453 the following calls is supposed to do. */
8454 DECL_CONSTRUCTOR_P (decl
) = 1;
8456 grokclassfn (ctype
, decl
, flags
, quals
);
8458 decl
= check_explicit_specialization (orig_declarator
, decl
,
8460 2 * (funcdef_flag
!= 0) +
8461 4 * (friendp
!= 0));
8462 if (decl
== error_mark_node
)
8465 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8468 tmp
= check_classfn (ctype
, decl
);
8470 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8471 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8473 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8474 cp_error ("definition of implicitly-declared `%D'", tmp
);
8475 if (tmp
&& duplicate_decls (decl
, tmp
))
8478 if (! grok_ctor_properties (ctype
, decl
))
8485 /* Function gets the ugly name, field gets the nice one.
8486 This call may change the type of the function (because
8487 of default parameters)! */
8488 if (ctype
!= NULL_TREE
)
8489 grokclassfn (ctype
, decl
, flags
, quals
);
8491 decl
= check_explicit_specialization (orig_declarator
, decl
,
8493 2 * (funcdef_flag
!= 0) +
8494 4 * (friendp
!= 0));
8495 if (decl
== error_mark_node
)
8498 if (ctype
!= NULL_TREE
8499 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8502 tmp
= check_classfn (ctype
, decl
);
8504 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8505 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8507 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8508 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8510 /* Remove the `this' parm added by grokclassfn.
8511 XXX Isn't this done in start_function, too? */
8512 revert_static_member_fn (&decl
, NULL
, NULL
);
8513 last_function_parms
= TREE_CHAIN (last_function_parms
);
8515 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8516 cp_error ("definition of implicitly-declared `%D'", tmp
);
8519 /* Attempt to merge the declarations. This can fail, in
8520 the case of some illegal specialization declarations. */
8521 if (!duplicate_decls (decl
, tmp
))
8522 cp_error ("no `%#D' member function declared in class `%T'",
8528 if (ctype
== NULL_TREE
|| check
)
8533 DECL_VIRTUAL_P (decl
) = 1;
8534 if (DECL_VINDEX (decl
) == NULL_TREE
)
8535 DECL_VINDEX (decl
) = error_mark_node
;
8536 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8543 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8546 RID_BIT_TYPE
*specbits_in
;
8552 RID_BIT_TYPE specbits
;
8554 specbits
= *specbits_in
;
8556 if (TREE_CODE (type
) == OFFSET_TYPE
)
8558 /* If you declare a static member so that it
8559 can be initialized, the code will reach here. */
8560 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8561 type
= TREE_TYPE (type
);
8562 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8563 DECL_CONTEXT (decl
) = basetype
;
8564 DECL_CLASS_CONTEXT (decl
) = basetype
;
8565 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8572 context
= in_namespace
;
8573 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8574 context
= current_namespace
;
8576 context
= NULL_TREE
;
8578 if (processing_template_decl
)
8580 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8581 we can call push_template_decl. */
8582 push_permanent_obstack ();
8583 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8587 decl
= build_decl (VAR_DECL
, declarator
, type
);
8590 set_decl_namespace (decl
, context
, 0);
8592 context
= DECL_CONTEXT (decl
);
8593 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8594 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8598 set_decl_namespace (decl
, in_namespace
, 0);
8600 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8602 DECL_THIS_EXTERN (decl
) = 1;
8603 DECL_EXTERNAL (decl
) = !initialized
;
8606 /* In class context, static means one per class,
8607 public access, and static storage. */
8608 if (DECL_CLASS_SCOPE_P (decl
))
8610 TREE_PUBLIC (decl
) = 1;
8611 TREE_STATIC (decl
) = 1;
8612 DECL_EXTERNAL (decl
) = 0;
8614 /* At top level, either `static' or no s.c. makes a definition
8615 (perhaps tentative), and absence of `static' makes it public. */
8616 else if (toplevel_bindings_p ())
8618 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8619 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8620 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8622 /* Not at top level, only `static' makes a static definition. */
8625 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8626 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8629 if (TREE_PUBLIC (decl
))
8631 /* [basic.link]: A name with no linkage (notably, the name of a class
8632 or enumeration declared in a local scope) shall not be used to
8633 declare an entity with linkage.
8635 Only check this for public decls for now. */
8636 tree t
= no_linkage_check (TREE_TYPE (decl
));
8639 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8640 /* Ignore for now; `enum { foo } e' is pretty common. */;
8642 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8650 /* Create and return a canonical pointer to member function type, for
8651 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8654 build_ptrmemfunc_type (type
)
8660 tree unqualified_variant
= NULL_TREE
;
8662 /* If a canonical type already exists for this type, use it. We use
8663 this method instead of type_hash_canon, because it only does a
8664 simple equality check on the list of field members. */
8666 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8669 /* Make sure that we always have the unqualified pointer-to-member
8671 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8673 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8675 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8677 u
= make_lang_type (UNION_TYPE
);
8678 SET_IS_AGGR_TYPE (u
, 0);
8679 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8680 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8682 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8683 TYPE_NAME (u
) = NULL_TREE
;
8685 t
= make_lang_type (RECORD_TYPE
);
8687 /* Let the front-end know this is a pointer to member function... */
8688 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8689 /* ... and not really an aggregate. */
8690 SET_IS_AGGR_TYPE (t
, 0);
8692 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8694 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8696 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8697 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8701 /* Zap out the name so that the back-end will give us the debugging
8702 information for this anonymous RECORD_TYPE. */
8703 TYPE_NAME (t
) = NULL_TREE
;
8705 /* If this is not the unqualified form of this pointer-to-member
8706 type, set the TYPE_MAIN_VARIANT for this type to be the
8707 unqualified type. Since they are actually RECORD_TYPEs that are
8708 not variants of each other, we must do this manually. */
8709 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8711 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8712 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8713 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8714 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8717 /* Cache this pointer-to-member type so that we can find it again
8719 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8721 /* Seems to be wanted. */
8722 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8727 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8728 Check to see that the definition is valid. Issue appropriate error
8729 messages. Return 1 if the definition is particularly bad, or 0
8733 check_static_variable_definition (decl
, type
)
8737 /* Motion 10 at San Diego: If a static const integral data member is
8738 initialized with an integral constant expression, the initializer
8739 may appear either in the declaration (within the class), or in
8740 the definition, but not both. If it appears in the class, the
8741 member is a member constant. The file-scope definition is always
8743 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8745 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8747 /* If we just return the declaration, crashes will sometimes
8748 occur. We therefore return void_type_node, as if this was a
8749 friend declaration, to cause callers to completely ignore
8750 this declaration. */
8753 else if (!CP_TYPE_CONST_P (type
))
8754 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8756 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8757 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8762 /* Given declspecs and a declarator,
8763 determine the name and type of the object declared
8764 and construct a ..._DECL node for it.
8765 (In one case we can return a ..._TYPE node instead.
8766 For invalid input we sometimes return 0.)
8768 DECLSPECS is a chain of tree_list nodes whose value fields
8769 are the storage classes and type specifiers.
8771 DECL_CONTEXT says which syntactic context this declaration is in:
8772 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8773 FUNCDEF for a function definition. Like NORMAL but a few different
8774 error messages in each case. Return value may be zero meaning
8775 this definition is too screwy to try to parse.
8776 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8777 handle member functions (which have FIELD context).
8778 Return value may be zero meaning this definition is too screwy to
8780 PARM for a parameter declaration (either within a function prototype
8781 or before a function body). Make a PARM_DECL, or return void_type_node.
8782 CATCHPARM for a parameter declaration before a catch clause.
8783 TYPENAME if for a typename (in a cast or sizeof).
8784 Don't make a DECL node; just return the ..._TYPE node.
8785 FIELD for a struct or union field; make a FIELD_DECL.
8786 BITFIELD for a field with specified width.
8787 INITIALIZED is 1 if the decl has an initializer.
8789 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8790 normal attributes in TREE_PURPOSE, or NULL_TREE.
8792 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8793 It may also be so in the PARM case, for a prototype where the
8794 argument type is specified but not the name.
8796 This function is where the complicated C meanings of `static'
8797 and `extern' are interpreted.
8799 For C++, if there is any monkey business to do, the function which
8800 calls this one must do it, i.e., prepending instance variables,
8801 renaming overloaded function names, etc.
8803 Note that for this C++, it is an error to define a method within a class
8804 which does not belong to that class.
8806 Except in the case where SCOPE_REFs are implicitly known (such as
8807 methods within a class being redundantly qualified),
8808 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8809 (class_name::decl_name). The caller must also deal with this.
8811 If a constructor or destructor is seen, and the context is FIELD,
8812 then the type gains the attribute TREE_HAS_x. If such a declaration
8813 is erroneous, NULL_TREE is returned.
8815 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8816 function, these are the qualifiers to give to the `this' pointer.
8818 May return void_type_node if the declarator turned out to be a friend.
8819 See grokfield for details. */
8821 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8824 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8827 enum decl_context decl_context
;
8831 RID_BIT_TYPE specbits
;
8834 tree type
= NULL_TREE
;
8840 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8841 int explicit_int
= 0;
8842 int explicit_char
= 0;
8843 int defaulted_int
= 0;
8844 tree typedef_decl
= NULL_TREE
;
8846 tree typedef_type
= NULL_TREE
;
8847 int funcdef_flag
= 0;
8848 enum tree_code innermost_code
= ERROR_MARK
;
8851 /* See the code below that used this. */
8852 tree decl_machine_attr
= NULL_TREE
;
8854 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8855 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8856 tree init
= NULL_TREE
;
8858 /* Keep track of what sort of function is being processed
8859 so that we can warn about default return values, or explicit
8860 return values which do not match prescribed defaults. */
8861 enum return_types return_type
= return_normal
;
8863 tree dname
= NULL_TREE
;
8864 tree ctype
= current_class_type
;
8865 tree ctor_return_type
= NULL_TREE
;
8866 enum overload_flags flags
= NO_SPECIAL
;
8867 tree quals
= NULL_TREE
;
8868 tree raises
= NULL_TREE
;
8869 int template_count
= 0;
8870 tree in_namespace
= NULL_TREE
;
8874 RIDBIT_RESET_ALL (specbits
);
8875 if (decl_context
== FUNCDEF
)
8876 funcdef_flag
= 1, decl_context
= NORMAL
;
8877 else if (decl_context
== MEMFUNCDEF
)
8878 funcdef_flag
= -1, decl_context
= FIELD
;
8879 else if (decl_context
== BITFIELD
)
8880 bitfield
= 1, decl_context
= FIELD
;
8882 /* Look inside a declarator for the name being declared
8883 and get it as a string, for an error message. */
8885 tree
*next
= &declarator
;
8889 while (next
&& *next
)
8892 switch (TREE_CODE (decl
))
8895 /* For attributes. */
8896 next
= &TREE_VALUE (decl
);
8901 next
= &TREE_OPERAND (decl
, 0);
8904 case BIT_NOT_EXPR
: /* For C++ destructors! */
8906 tree name
= TREE_OPERAND (decl
, 0);
8907 tree rename
= NULL_TREE
;
8909 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8911 return_type
= return_dtor
;
8912 if (TREE_CODE (name
) == TYPE_DECL
)
8913 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8914 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8915 if (ctype
== NULL_TREE
)
8917 if (current_class_type
== NULL_TREE
)
8919 error ("destructors must be member functions");
8924 tree t
= constructor_name (current_class_name
);
8931 tree t
= constructor_name (ctype
);
8938 cp_error ("destructor `%T' must match class name `%T'",
8940 TREE_OPERAND (decl
, 0) = rename
;
8946 case ADDR_EXPR
: /* C++ reference declaration */
8951 innermost_code
= TREE_CODE (decl
);
8952 next
= &TREE_OPERAND (decl
, 0);
8956 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
8958 /* This is actually a variable declaration using
8959 constructor syntax. We need to call start_decl and
8960 cp_finish_decl so we can get the variable
8963 tree attributes
, prefix_attributes
;
8965 *next
= TREE_OPERAND (decl
, 0);
8966 init
= CALL_DECLARATOR_PARMS (decl
);
8970 attributes
= TREE_PURPOSE (attrlist
);
8971 prefix_attributes
= TREE_VALUE (attrlist
);
8975 attributes
= NULL_TREE
;
8976 prefix_attributes
= NULL_TREE
;
8979 decl
= start_decl (declarator
, declspecs
, 1,
8980 attributes
, prefix_attributes
);
8983 /* Look for __unused__ attribute */
8984 if (TREE_USED (TREE_TYPE (decl
)))
8985 TREE_USED (decl
) = 1;
8986 finish_decl (decl
, init
, NULL_TREE
);
8989 cp_error ("invalid declarator");
8992 innermost_code
= TREE_CODE (decl
);
8993 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8994 ctype
= current_class_type
;
8996 && TREE_OPERAND (decl
, 0)
8997 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
8998 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
8999 == constructor_name_full (ctype
))
9000 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9001 == constructor_name (ctype
)))))
9002 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9003 next
= &TREE_OPERAND (decl
, 0);
9005 if (ctype
!= NULL_TREE
9006 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9007 && decl
== constructor_name (ctype
))
9009 return_type
= return_ctor
;
9010 ctor_return_type
= ctype
;
9015 case TEMPLATE_ID_EXPR
:
9017 tree fns
= TREE_OPERAND (decl
, 0);
9019 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9020 fns
= TREE_OPERAND (fns
, 0);
9023 if (TREE_CODE (dname
) == COMPONENT_REF
)
9024 dname
= TREE_OPERAND (dname
, 1);
9025 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9027 my_friendly_assert (is_overloaded_fn (dname
),
9029 dname
= DECL_NAME (get_first_fn (dname
));
9034 case IDENTIFIER_NODE
:
9035 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9042 cp_error ("declarator-id missing; using reserved word `%D'",
9044 name
= IDENTIFIER_POINTER (dname
);
9046 if (! IDENTIFIER_OPNAME_P (dname
)
9047 /* GNU/Linux headers use '__op'. Arrgh. */
9048 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9049 name
= IDENTIFIER_POINTER (dname
);
9052 if (IDENTIFIER_TYPENAME_P (dname
))
9054 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9055 flags
= TYPENAME_FLAG
;
9056 ctor_return_type
= TREE_TYPE (dname
);
9057 return_type
= return_conversion
;
9059 name
= operator_name_string (dname
);
9066 /* Perform error checking, and decide on a ctype. */
9067 tree cname
= TREE_OPERAND (decl
, 0);
9068 if (cname
== NULL_TREE
)
9070 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9073 in_namespace
= TREE_OPERAND (decl
, 0);
9074 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9076 else if (! is_aggr_type (cname
, 1))
9077 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9078 /* Must test TREE_OPERAND (decl, 1), in case user gives
9079 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9080 else if (TREE_OPERAND (decl
, 1)
9081 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9083 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9084 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9086 cp_error ("`%T::%D' is not a valid declarator", cname
,
9087 TREE_OPERAND (decl
, 1));
9088 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9089 cname
, TREE_OPERAND (decl
, 1));
9090 return void_type_node
;
9092 else if (ctype
== NULL_TREE
)
9094 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9095 TREE_OPERAND (decl
, 0) = ctype
;
9098 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9100 cp_error ("type `%T' is not derived from type `%T'",
9102 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9108 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9109 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9110 == constructor_name_full (ctype
))
9111 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9112 == constructor_name (ctype
))))
9113 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9114 next
= &TREE_OPERAND (decl
, 1);
9118 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9119 && constructor_name (ctype
) == decl
)
9121 return_type
= return_ctor
;
9122 ctor_return_type
= ctype
;
9124 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9125 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9126 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9127 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9129 return_type
= return_dtor
;
9130 ctor_return_type
= ctype
;
9132 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9133 next
= &TREE_OPERAND (decl
, 0);
9144 /* Parse error puts this typespec where
9145 a declarator should go. */
9146 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9147 if (TREE_TYPE (decl
) == current_class_type
)
9148 cp_error (" perhaps you want `%T' for a constructor",
9149 current_class_name
);
9150 dname
= DECL_NAME (decl
);
9151 name
= IDENTIFIER_POINTER (dname
);
9153 /* Avoid giving two errors for this. */
9154 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9156 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9163 cp_compiler_error ("`%D' as declarator", decl
);
9164 return 0; /* We used to do a 155 abort here. */
9169 /* A function definition's declarator must have the form of
9170 a function declarator. */
9172 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9175 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9176 && innermost_code
!= CALL_EXPR
9177 && ! (ctype
&& declspecs
== NULL_TREE
))
9179 cp_error ("declaration of `%D' as non-function", dname
);
9180 return void_type_node
;
9183 /* Anything declared one level down from the top level
9184 must be one of the parameters of a function
9185 (because the body is at least two levels down). */
9187 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9188 by not allowing C++ class definitions to specify their parameters
9189 with xdecls (must be spec.d in the parmlist).
9191 Since we now wait to push a class scope until we are sure that
9192 we are in a legitimate method context, we must set oldcname
9193 explicitly (since current_class_name is not yet alive).
9195 We also want to avoid calling this a PARM if it is in a namespace. */
9197 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9199 struct binding_level
*b
= current_binding_level
;
9200 current_binding_level
= b
->level_chain
;
9201 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9202 decl_context
= PARM
;
9203 current_binding_level
= b
;
9207 name
= decl_context
== PARM
? "parameter" : "type name";
9209 /* Look through the decl specs and record which ones appear.
9210 Some typespecs are defined as built-in typenames.
9211 Others, the ones that are modifiers of other types,
9212 are represented by bits in SPECBITS: set the bits for
9213 the modifiers that appear. Storage class keywords are also in SPECBITS.
9215 If there is a typedef name or a type, store the type in TYPE.
9216 This includes builtin typedefs such as `int'.
9218 Set EXPLICIT_INT if the type is `int' or `char' and did not
9219 come from a user typedef.
9221 Set LONGLONG if `long' is mentioned twice.
9223 For C++, constructors and destructors have their own fast treatment. */
9225 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9230 /* Certain parse errors slip through. For example,
9231 `int class;' is not caught by the parser. Try
9232 weakly to recover here. */
9233 if (TREE_CODE (spec
) != TREE_LIST
)
9236 id
= TREE_VALUE (spec
);
9238 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9240 if (id
== ridpointers
[(int) RID_INT
]
9241 || id
== ridpointers
[(int) RID_CHAR
]
9242 || id
== ridpointers
[(int) RID_BOOL
]
9243 || id
== ridpointers
[(int) RID_WCHAR
])
9247 if (id
== ridpointers
[(int) RID_BOOL
])
9248 error ("`bool' is now a keyword");
9250 cp_error ("extraneous `%T' ignored", id
);
9254 if (id
== ridpointers
[(int) RID_INT
])
9256 else if (id
== ridpointers
[(int) RID_CHAR
])
9258 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9262 /* C++ aggregate types. */
9263 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9266 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9268 type
= IDENTIFIER_TYPE_VALUE (id
);
9272 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9274 if (ridpointers
[i
] == id
)
9276 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9278 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9279 pedwarn ("ANSI C++ does not support `long long'");
9281 error ("`long long long' is too long for GCC");
9285 else if (RIDBIT_SETP (i
, specbits
))
9286 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9287 RIDBIT_SET (i
, specbits
);
9292 /* C++ aggregate types. */
9293 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9296 cp_error ("multiple declarations `%T' and `%T'", type
,
9300 type
= TREE_TYPE (id
);
9301 TREE_VALUE (spec
) = type
;
9306 error ("two or more data types in declaration of `%s'", name
);
9307 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9309 register tree t
= lookup_name (id
, 1);
9310 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9311 error ("`%s' fails to be a typedef or built in type",
9312 IDENTIFIER_POINTER (id
));
9315 type
= TREE_TYPE (t
);
9317 /* See the code below that used this. */
9318 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9323 else if (id
!= error_mark_node
)
9324 /* Can't change CLASS nodes into RECORD nodes here! */
9330 typedef_type
= type
;
9332 /* No type at all: default to `int', and set DEFAULTED_INT
9333 because it was not a user-defined typedef. */
9335 if (type
== NULL_TREE
9336 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9337 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9338 || RIDBIT_SETP (RID_LONG
, specbits
)
9339 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9341 /* These imply 'int'. */
9342 type
= integer_type_node
;
9346 if (type
== NULL_TREE
)
9349 if (return_type
== return_dtor
)
9350 type
= void_type_node
;
9351 else if (return_type
== return_ctor
)
9352 type
= build_pointer_type (ctor_return_type
);
9353 else if (return_type
== return_conversion
)
9354 type
= ctor_return_type
;
9357 /* We handle `main' specially here, because 'main () { }' is so
9358 common. With no options, it is allowed. With -Wreturn-type,
9359 it is a warning. It is only an error with -pedantic-errors. */
9360 int is_main
= (funcdef_flag
9361 && MAIN_NAME_P (dname
)
9362 && ctype
== NULL_TREE
9363 && in_namespace
== NULL_TREE
9364 && current_namespace
== global_namespace
);
9366 if (in_system_header
|| flag_ms_extensions
)
9367 /* Allow it, sigh. */;
9368 else if (pedantic
|| ! is_main
)
9369 cp_pedwarn ("ANSI C++ forbids declaration of `%s' with no type",
9371 else if (warn_return_type
)
9372 cp_warning ("ANSI C++ forbids declaration of `%s' with no type",
9375 type
= integer_type_node
;
9378 else if (return_type
== return_dtor
)
9380 error ("return type specification for destructor invalid");
9381 type
= void_type_node
;
9383 else if (return_type
== return_ctor
)
9385 error ("return type specification for constructor invalid");
9386 type
= build_pointer_type (ctor_return_type
);
9388 else if (return_type
== return_conversion
)
9390 if (!same_type_p (type
, ctor_return_type
))
9391 cp_error ("operator `%T' declared to return `%T'",
9392 ctor_return_type
, type
);
9394 cp_pedwarn ("return type specified for `operator %T'",
9397 type
= ctor_return_type
;
9402 /* Now process the modifiers that were specified
9403 and check for invalid combinations. */
9405 /* Long double is a special combination. */
9407 if (RIDBIT_SETP (RID_LONG
, specbits
)
9408 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9410 RIDBIT_RESET (RID_LONG
, specbits
);
9411 type
= build_qualified_type (long_double_type_node
,
9412 CP_TYPE_QUALS (type
));
9415 /* Check all other uses of type modifiers. */
9417 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9418 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9419 || RIDBIT_SETP (RID_LONG
, specbits
)
9420 || RIDBIT_SETP (RID_SHORT
, specbits
))
9424 if (TREE_CODE (type
) == REAL_TYPE
)
9425 error ("short, signed or unsigned invalid for `%s'", name
);
9426 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9427 error ("long, short, signed or unsigned invalid for `%s'", name
);
9428 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9429 && RIDBIT_SETP (RID_SHORT
, specbits
))
9430 error ("long and short specified together for `%s'", name
);
9431 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9432 || RIDBIT_SETP (RID_SHORT
, specbits
))
9434 error ("long or short specified with char for `%s'", name
);
9435 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9436 || RIDBIT_SETP (RID_SHORT
, specbits
))
9437 && TREE_CODE (type
) == REAL_TYPE
)
9438 error ("long or short specified with floating type for `%s'", name
);
9439 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9440 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9441 error ("signed and unsigned given together for `%s'", name
);
9445 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9447 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9449 if (flag_pedantic_errors
)
9454 /* Discard the type modifiers if they are invalid. */
9457 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9458 RIDBIT_RESET (RID_SIGNED
, specbits
);
9459 RIDBIT_RESET (RID_LONG
, specbits
);
9460 RIDBIT_RESET (RID_SHORT
, specbits
);
9465 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9466 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9468 error ("complex invalid for `%s'", name
);
9469 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9472 /* Decide whether an integer type is signed or not.
9473 Optionally treat bitfields as signed by default. */
9474 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9477 It is implementation-defined whether a plain (neither
9478 explicitly signed or unsigned) char, short, int, or long
9479 bit-field is signed or unsigned.
9481 Naturally, we extend this to long long as well. Note that
9482 this does not include wchar_t. */
9483 || (bitfield
&& !flag_signed_bitfields
9484 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9485 /* A typedef for plain `int' without `signed' can be
9486 controlled just like plain `int', but a typedef for
9487 `signed int' cannot be so controlled. */
9489 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9490 && (TREE_CODE (type
) == INTEGER_TYPE
9491 || TREE_CODE (type
) == CHAR_TYPE
)
9492 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9495 type
= long_long_unsigned_type_node
;
9496 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9497 type
= long_unsigned_type_node
;
9498 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9499 type
= short_unsigned_type_node
;
9500 else if (type
== char_type_node
)
9501 type
= unsigned_char_type_node
;
9502 else if (typedef_decl
)
9503 type
= unsigned_type (type
);
9505 type
= unsigned_type_node
;
9507 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9508 && type
== char_type_node
)
9509 type
= signed_char_type_node
;
9511 type
= long_long_integer_type_node
;
9512 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9513 type
= long_integer_type_node
;
9514 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9515 type
= short_integer_type_node
;
9517 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9519 /* If we just have "complex", it is equivalent to
9520 "complex double", but if any modifiers at all are specified it is
9521 the complex form of TYPE. E.g, "complex short" is
9522 "complex short int". */
9524 if (defaulted_int
&& ! longlong
9525 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9526 || RIDBIT_SETP (RID_SHORT
, specbits
)
9527 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9528 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9529 type
= complex_double_type_node
;
9530 else if (type
== integer_type_node
)
9531 type
= complex_integer_type_node
;
9532 else if (type
== float_type_node
)
9533 type
= complex_float_type_node
;
9534 else if (type
== double_type_node
)
9535 type
= complex_double_type_node
;
9536 else if (type
== long_double_type_node
)
9537 type
= complex_long_double_type_node
;
9539 type
= build_complex_type (type
);
9542 if (return_type
== return_conversion
9543 && (RIDBIT_SETP (RID_CONST
, specbits
)
9544 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9545 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9546 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9549 /* Set CONSTP if this declaration is `const', whether by
9550 explicit specification or via a typedef.
9551 Likewise for VOLATILEP. */
9553 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9555 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9557 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9558 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9559 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9560 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9561 type
= cp_build_qualified_type (type
, type_quals
);
9563 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9564 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9565 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9566 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9567 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9569 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9570 staticp
= 1 + (decl_context
== FIELD
);
9572 if (virtualp
&& staticp
== 2)
9574 cp_error ("member `%D' cannot be declared both virtual and static",
9578 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9579 RIDBIT_RESET (RID_FRIEND
, specbits
);
9581 /* Warn if two storage classes are given. Default to `auto'. */
9583 if (RIDBIT_ANY_SET (specbits
))
9585 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9586 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9587 if (decl_context
== PARM
&& nclasses
> 0)
9588 error ("storage class specifiers invalid in parameter declarations");
9589 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9591 if (decl_context
== PARM
)
9592 error ("typedef declaration invalid in parameter declaration");
9595 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9596 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9599 /* Give error if `virtual' is used outside of class declaration. */
9601 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9603 error ("virtual outside class declaration");
9607 /* Static anonymous unions are dealt with here. */
9608 if (staticp
&& decl_context
== TYPENAME
9609 && TREE_CODE (declspecs
) == TREE_LIST
9610 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9611 decl_context
= FIELD
;
9613 /* Warn about storage classes that are invalid for certain
9614 kinds of declarations (parameters, typenames, etc.). */
9617 error ("multiple storage classes in declaration of `%s'", name
);
9618 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9620 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9621 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9622 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9624 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9626 else if (decl_context
== FIELD
9627 /* C++ allows static class elements */
9628 && RIDBIT_SETP (RID_STATIC
, specbits
))
9629 /* C++ also allows inlines and signed and unsigned elements,
9630 but in those cases we don't come in here. */
9634 if (decl_context
== FIELD
)
9636 tree tmp
= NULL_TREE
;
9637 register int op
= 0;
9641 /* Avoid trying to get an operand off an identifier node. */
9642 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9645 tmp
= TREE_OPERAND (declarator
, 0);
9646 op
= IDENTIFIER_OPNAME_P (tmp
);
9648 error ("storage class specified for %s `%s'",
9649 op
? "member operator" : "field",
9650 op
? operator_name_string (tmp
) : name
);
9653 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9654 ? "storage class specified for parameter `%s'"
9655 : "storage class specified for typename"), name
);
9656 RIDBIT_RESET (RID_REGISTER
, specbits
);
9657 RIDBIT_RESET (RID_AUTO
, specbits
);
9658 RIDBIT_RESET (RID_EXTERN
, specbits
);
9661 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9663 if (toplevel_bindings_p ())
9665 /* It's common practice (and completely valid) to have a const
9666 be initialized and declared extern. */
9667 if (!(type_quals
& TYPE_QUAL_CONST
))
9668 warning ("`%s' initialized and declared `extern'", name
);
9671 error ("`%s' has both `extern' and initializer", name
);
9673 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9674 && ! toplevel_bindings_p ())
9675 error ("nested function `%s' declared `extern'", name
);
9676 else if (toplevel_bindings_p ())
9678 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9679 error ("top-level declaration of `%s' specifies `auto'", name
);
9682 if (nclasses
> 0 && friendp
)
9683 error ("storage class specifiers invalid in friend function declarations");
9685 /* Now figure out the structure of the declarator proper.
9686 Descend through it, creating more complex types, until we reach
9687 the declared identifier (or NULL_TREE, in an absolute declarator). */
9689 inner_attrs
= NULL_TREE
;
9692 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9693 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9695 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9696 an INDIRECT_REF (for *...),
9697 a CALL_EXPR (for ...(...)),
9698 an identifier (for the name being declared)
9699 or a null pointer (for the place in an absolute declarator
9700 where the name was omitted).
9701 For the last two cases, we have just exited the loop.
9703 For C++ it could also be
9704 a SCOPE_REF (for class :: ...). In this case, we have converted
9705 sensible names to types, and those are the values we use to
9706 qualify the member name.
9707 an ADDR_EXPR (for &...),
9708 a BIT_NOT_EXPR (for destructors)
9710 At this point, TYPE is the type of elements of an array,
9711 or for a function to return, or for a pointer to point to.
9712 After this sequence of ifs, TYPE is the type of the
9713 array or function or pointer, and DECLARATOR has had its
9714 outermost layer removed. */
9716 if (type
== error_mark_node
)
9718 if (TREE_CODE (declarator
) == SCOPE_REF
)
9719 declarator
= TREE_OPERAND (declarator
, 1);
9721 declarator
= TREE_OPERAND (declarator
, 0);
9724 if (quals
!= NULL_TREE
9725 && (declarator
== NULL_TREE
9726 || TREE_CODE (declarator
) != SCOPE_REF
))
9728 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9729 ctype
= TYPE_METHOD_BASETYPE (type
);
9730 if (ctype
!= NULL_TREE
)
9732 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9733 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9734 type
= TREE_TYPE (dummy
);
9739 /* See the comment for the TREE_LIST case, below. */
9742 else if (inner_attrs
)
9744 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9745 inner_attrs
= NULL_TREE
;
9748 switch (TREE_CODE (declarator
))
9752 /* We encode a declarator with embedded attributes using
9753 a TREE_LIST. The attributes apply to the declarator
9754 directly inside them, so we have to skip an iteration
9755 before applying them to the type. If the declarator just
9756 inside is the declarator-id, we apply the attrs to the
9758 inner_attrs
= TREE_PURPOSE (declarator
);
9760 declarator
= TREE_VALUE (declarator
);
9766 register tree itype
= NULL_TREE
;
9767 register tree size
= TREE_OPERAND (declarator
, 1);
9768 /* The index is a signed object `sizetype' bits wide. */
9769 tree index_type
= signed_type (sizetype
);
9771 declarator
= TREE_OPERAND (declarator
, 0);
9773 /* Check for some types that there cannot be arrays of. */
9775 if (TREE_CODE (type
) == VOID_TYPE
)
9777 cp_error ("declaration of `%D' as array of voids", dname
);
9778 type
= error_mark_node
;
9781 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9783 cp_error ("declaration of `%D' as array of functions", dname
);
9784 type
= error_mark_node
;
9787 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9788 you can't have arrays of references. If we allowed them,
9789 then we'd be saying x[i] is valid for an array x, but
9790 then you'd have to ask: what does `*(x + i)' mean? */
9791 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9793 if (decl_context
== TYPENAME
)
9794 cp_error ("cannot make arrays of references");
9796 cp_error ("declaration of `%D' as array of references",
9798 type
= error_mark_node
;
9801 if (TREE_CODE (type
) == OFFSET_TYPE
)
9803 cp_error ("declaration of `%D' as array of data members",
9805 type
= error_mark_node
;
9808 if (TREE_CODE (type
) == METHOD_TYPE
)
9810 cp_error ("declaration of `%D' as array of function members",
9812 type
= error_mark_node
;
9815 if (size
== error_mark_node
)
9816 type
= error_mark_node
;
9817 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9821 the constant expressions that specify the bounds of
9822 the arrays can be omitted only for the first member
9824 cp_error ("declaration of `%D' as multidimensional array",
9826 cp_error ("must have bounds for all dimensions except the first");
9827 type
= error_mark_node
;
9830 if (type
== error_mark_node
)
9833 /* VC++ spells a zero-sized array with []. */
9834 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9835 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9836 size
= integer_zero_node
;
9840 /* Must suspend_momentary here because the index
9841 type may need to live until the end of the function.
9842 For example, it is used in the declaration of a
9843 variable which requires destructing at the end of
9844 the function; then build_vec_delete will need this
9846 int yes
= suspend_momentary ();
9847 /* Might be a cast. */
9848 if (TREE_CODE (size
) == NOP_EXPR
9849 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9850 size
= TREE_OPERAND (size
, 0);
9851 if (TREE_READONLY_DECL_P (size
))
9852 size
= decl_constant_value (size
);
9854 /* If this involves a template parameter, it will be a
9855 constant at instantiation time, but we don't know
9856 what the value is yet. Even if no template
9857 parameters are involved, we may an expression that
9858 is not a constant; we don't even simplify `1 + 2'
9859 when processing a template. */
9860 if (processing_template_decl
)
9862 /* Resolve a qualified reference to an enumerator or
9863 static const data member of ours. */
9864 if (TREE_CODE (size
) == SCOPE_REF
9865 && TREE_OPERAND (size
, 0) == current_class_type
)
9867 tree t
= lookup_field (current_class_type
,
9868 TREE_OPERAND (size
, 1), 0, 0);
9873 itype
= build_index_type (build_min
9874 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
9875 goto dont_grok_size
;
9878 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9879 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9880 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9882 cp_error ("size of array `%D' has non-integer type",
9884 size
= integer_one_node
;
9886 if (pedantic
&& integer_zerop (size
))
9887 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9888 if (TREE_CONSTANT (size
))
9890 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9891 int old_pedantic
= pedantic
;
9892 pedantic
= flag_pedantic_errors
= 1;
9893 /* Always give overflow errors on array subscripts. */
9894 constant_expression_warning (size
);
9895 pedantic
= old_pedantic
;
9896 flag_pedantic_errors
= old_flag_pedantic_errors
;
9897 if (INT_CST_LT (size
, integer_zero_node
))
9899 cp_error ("size of array `%D' is negative", dname
);
9900 size
= integer_one_node
;
9908 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9911 cp_pedwarn ("ANSI C++ forbids variable-size array");
9916 = fold (build_binary_op (MINUS_EXPR
,
9917 cp_convert (index_type
, size
),
9918 cp_convert (index_type
,
9919 integer_one_node
)));
9920 if (! TREE_CONSTANT (itype
))
9921 itype
= variable_size (itype
);
9922 else if (TREE_OVERFLOW (itype
))
9924 error ("overflow in array dimension");
9925 TREE_OVERFLOW (itype
) = 0;
9928 itype
= build_index_type (itype
);
9931 resume_momentary (yes
);
9934 type
= build_cplus_array_type (type
, itype
);
9943 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9944 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9946 /* Declaring a function type.
9947 Make sure we have a valid type for the function to return. */
9949 /* We now know that the TYPE_QUALS don't apply to the
9950 decl, but to its return type. */
9951 type_quals
= TYPE_UNQUALIFIED
;
9953 /* Warn about some types functions can't return. */
9955 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9957 error ("`%s' declared as function returning a function", name
);
9958 type
= integer_type_node
;
9960 if (TREE_CODE (type
) == ARRAY_TYPE
)
9962 error ("`%s' declared as function returning an array", name
);
9963 type
= integer_type_node
;
9966 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9967 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9969 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9972 /* Pick up type qualifiers which should be applied to `this'. */
9973 quals
= CALL_DECLARATOR_QUALS (declarator
);
9975 /* Pick up the exception specifications. */
9976 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
9978 /* Say it's a definition only for the CALL_EXPR
9979 closest to the identifier. */
9982 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9983 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9984 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9986 if (ctype
== NULL_TREE
9987 && decl_context
== FIELD
9989 && (friendp
== 0 || dname
== current_class_name
))
9990 ctype
= current_class_type
;
9992 if (ctype
&& return_type
== return_conversion
)
9993 TYPE_HAS_CONVERSION (ctype
) = 1;
9994 if (ctype
&& constructor_name (ctype
) == dname
)
9996 /* We are within a class's scope. If our declarator name
9997 is the same as the class name, and we are defining
9998 a function, then it is a constructor/destructor, and
9999 therefore returns a void type. */
10001 if (flags
== DTOR_FLAG
)
10003 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10004 not be declared const or volatile. A destructor
10005 may not be static. */
10007 error ("destructor cannot be static member function");
10010 cp_error ("destructors may not be `%s'",
10011 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10014 if (decl_context
== FIELD
)
10016 if (! member_function_or_else (ctype
, current_class_type
,
10017 "destructor for alien class `%s' cannot be a member"))
10018 return void_type_node
;
10021 else /* It's a constructor. */
10023 if (explicitp
== 1)
10025 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10026 not be declared const or volatile. A constructor may
10027 not be virtual. A constructor may not be static. */
10029 error ("constructor cannot be static member function");
10032 pedwarn ("constructors cannot be declared virtual");
10037 cp_error ("constructors may not be `%s'",
10038 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10042 RID_BIT_TYPE tmp_bits
;
10043 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10044 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10045 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10046 if (RIDBIT_ANY_SET (tmp_bits
))
10047 error ("return value type specifier for constructor ignored");
10049 type
= build_pointer_type (ctype
);
10050 if (decl_context
== FIELD
)
10052 if (! member_function_or_else (ctype
, current_class_type
,
10053 "constructor for alien class `%s' cannot be member"))
10054 return void_type_node
;
10055 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10056 if (return_type
!= return_ctor
)
10060 if (decl_context
== FIELD
)
10066 error ("can't initialize friend function `%s'", name
);
10069 /* Cannot be both friend and virtual. */
10070 error ("virtual functions cannot be friends");
10071 RIDBIT_RESET (RID_FRIEND
, specbits
);
10074 if (decl_context
== NORMAL
)
10075 error ("friend declaration not in class definition");
10076 if (current_function_decl
&& funcdef_flag
)
10077 cp_error ("can't define friend function `%s' in a local class definition",
10081 /* Construct the function type and go to the next
10082 inner layer of declarator. */
10084 declarator
= TREE_OPERAND (declarator
, 0);
10086 /* FIXME: This is where default args should be fully
10089 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10091 if (declarator
&& flags
== DTOR_FLAG
)
10093 /* A destructor declared in the body of a class will
10094 be represented as a BIT_NOT_EXPR. But, we just
10095 want the underlying IDENTIFIER. */
10096 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10097 declarator
= TREE_OPERAND (declarator
, 0);
10099 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10100 arg_types
= void_list_node
;
10101 else if (arg_types
== NULL_TREE
10102 || arg_types
!= void_list_node
)
10104 cp_error ("destructors may not have parameters");
10105 arg_types
= void_list_node
;
10106 last_function_parms
= NULL_TREE
;
10110 /* ANSI says that `const int foo ();'
10111 does not make the function foo const. */
10112 type
= build_function_type (type
, arg_types
);
10116 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10117 if (TREE_PURPOSE (t
)
10118 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10120 add_defarg_fn (type
);
10129 /* Filter out pointers-to-references and references-to-references.
10130 We can get these if a TYPE_DECL is used. */
10132 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10134 error ("cannot declare %s to references",
10135 TREE_CODE (declarator
) == ADDR_EXPR
10136 ? "references" : "pointers");
10137 declarator
= TREE_OPERAND (declarator
, 0);
10141 if (TREE_CODE (type
) == OFFSET_TYPE
10142 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10143 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10145 cp_error ("cannot declare pointer to `%#T' member",
10147 type
= TREE_TYPE (type
);
10150 /* Merge any constancy or volatility into the target type
10151 for the pointer. */
10153 /* We now know that the TYPE_QUALS don't apply to the decl,
10154 but to the target of the pointer. */
10155 type_quals
= TYPE_UNQUALIFIED
;
10157 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10159 if (TREE_CODE (type
) == VOID_TYPE
)
10160 error ("invalid type: `void &'");
10162 type
= build_reference_type (type
);
10164 else if (TREE_CODE (type
) == METHOD_TYPE
)
10165 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10167 type
= build_pointer_type (type
);
10169 /* Process a list of type modifier keywords (such as
10170 const or volatile) that were given inside the `*' or `&'. */
10172 if (TREE_TYPE (declarator
))
10174 register tree typemodlist
;
10180 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10181 typemodlist
= TREE_CHAIN (typemodlist
))
10183 tree qualifier
= TREE_VALUE (typemodlist
);
10185 if (qualifier
== ridpointers
[(int) RID_CONST
])
10187 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10189 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10194 error ("invalid type modifier within pointer declarator");
10198 pedwarn ("duplicate `const'");
10200 pedwarn ("duplicate `volatile'");
10202 pedwarn ("duplicate `restrict'");
10204 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10205 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10206 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10207 if (TREE_CODE (declarator
) == ADDR_EXPR
10208 && (constp
|| volatilep
))
10211 pedwarn ("discarding `const' applied to a reference");
10213 pedwarn ("discarding `volatile' applied to a reference");
10214 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10216 type
= cp_build_qualified_type (type
, type_quals
);
10218 declarator
= TREE_OPERAND (declarator
, 0);
10224 /* We have converted type names to NULL_TREE if the
10225 name was bogus, or to a _TYPE node, if not.
10227 The variable CTYPE holds the type we will ultimately
10228 resolve to. The code here just needs to build
10229 up appropriate member types. */
10230 tree sname
= TREE_OPERAND (declarator
, 1);
10233 /* Destructors can have their visibilities changed as well. */
10234 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10235 sname
= TREE_OPERAND (sname
, 0);
10237 if (TREE_COMPLEXITY (declarator
) == 0)
10238 /* This needs to be here, in case we are called
10239 multiple times. */ ;
10240 else if (TREE_COMPLEXITY (declarator
) == -1)
10241 /* Namespace member. */
10242 pop_decl_namespace ();
10243 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10244 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10245 else if (! IS_AGGR_TYPE_CODE
10246 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10248 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10250 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10251 that refer to ctype. They couldn't be resolved earlier
10252 because we hadn't pushed into the class yet.
10253 Example: resolve 'B<T>::type' in
10254 'B<typename B<T>::type> B<T>::f () { }'. */
10255 if (current_template_parms
10256 && uses_template_parms (type
)
10257 && uses_template_parms (current_class_type
))
10259 tree args
= current_template_args ();
10260 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10263 /* This pop_nested_class corresponds to the
10264 push_nested_class used to push into class scope for
10265 parsing the argument list of a function decl, in
10267 pop_nested_class ();
10268 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10271 my_friendly_abort (16);
10273 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10275 /* We had a reference to a global decl, or
10276 perhaps we were given a non-aggregate typedef,
10277 in which case we cleared this out, and should just
10278 keep going as though it wasn't there. */
10279 declarator
= sname
;
10282 ctype
= TREE_OPERAND (declarator
, 0);
10285 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10287 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10288 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10289 template_count
+= 1;
10290 t
= TYPE_MAIN_DECL (t
);
10291 if (DECL_LANG_SPECIFIC (t
))
10292 t
= DECL_CLASS_CONTEXT (t
);
10297 if (sname
== NULL_TREE
)
10300 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10302 /* This is the `standard' use of the scoping operator:
10303 basetype :: member . */
10305 if (ctype
== current_class_type
)
10311 Is this ill-formed? */
10314 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10317 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10319 if (current_class_type
== NULL_TREE
10321 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10322 TYPE_ARG_TYPES (type
));
10325 cp_error ("cannot declare member function `%T::%s' within `%T'",
10326 ctype
, name
, current_class_type
);
10327 return void_type_node
;
10330 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10331 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10333 /* Have to move this code elsewhere in this function.
10334 this code is used for i.e., typedef int A::M; M *pm;
10336 It is? How? jason 10/2/94 */
10338 if (current_class_type
)
10340 cp_error ("cannot declare member `%T::%s' within `%T'",
10341 ctype
, name
, current_class_type
);
10342 return void_type_node
;
10344 type
= build_offset_type (ctype
, type
);
10346 else if (uses_template_parms (ctype
))
10348 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10350 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10351 TYPE_ARG_TYPES (type
));
10355 cp_error ("structure `%T' not yet defined", ctype
);
10356 return error_mark_node
;
10359 declarator
= sname
;
10361 else if (TREE_CODE (sname
) == SCOPE_REF
)
10362 my_friendly_abort (17);
10366 declarator
= TREE_OPERAND (declarator
, 1);
10367 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10368 /* In this case, we will deal with it later. */
10372 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10373 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10374 TYPE_ARG_TYPES (type
));
10376 type
= build_offset_type (ctype
, type
);
10383 declarator
= TREE_OPERAND (declarator
, 0);
10388 case ENUMERAL_TYPE
:
10389 declarator
= NULL_TREE
;
10393 declarator
= NULL_TREE
;
10397 my_friendly_abort (158);
10401 /* See the comment for the TREE_LIST case, above. */
10404 if (! ignore_attrs
)
10405 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10407 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10409 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10412 /* Now TYPE has the actual type. */
10414 if (explicitp
== 1 || (explicitp
&& friendp
))
10416 /* [dcl.fct.spec] The explicit specifier shall only be used in
10417 declarations of constructors within a class definition. */
10418 error ("only declarations of constructors can be `explicit'");
10422 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10424 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10426 error ("non-member `%s' cannot be declared `mutable'", name
);
10427 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10429 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10431 error ("non-object member `%s' cannot be declared `mutable'", name
);
10432 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10434 else if (TREE_CODE (type
) == FUNCTION_TYPE
10435 || TREE_CODE (type
) == METHOD_TYPE
)
10437 error ("function `%s' cannot be declared `mutable'", name
);
10438 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10442 error ("static `%s' cannot be declared `mutable'", name
);
10443 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10445 else if (type_quals
& TYPE_QUAL_CONST
)
10447 error ("const `%s' cannot be declared `mutable'", name
);
10448 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10452 if (declarator
== NULL_TREE
10453 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10454 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10455 && (TREE_CODE (type
) == FUNCTION_TYPE
10456 || TREE_CODE (type
) == METHOD_TYPE
)))
10458 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10460 cp_error ("template-id `%D' used as a declarator", declarator
);
10461 declarator
= dname
;
10464 /* Unexpected declarator format. */
10465 my_friendly_abort (990210);
10467 /* If this is declaring a typedef name, return a TYPE_DECL. */
10469 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10473 /* Note that the grammar rejects storage classes
10474 in typenames, fields or parameters. */
10475 if (current_lang_name
== lang_name_java
)
10476 TYPE_FOR_JAVA (type
) = 1;
10478 if (decl_context
== FIELD
)
10480 if (declarator
== constructor_name (current_class_type
))
10481 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10483 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10487 /* Make sure this typedef lives as long as its type,
10488 since it might be used as a template parameter. */
10489 if (type
!= error_mark_node
)
10490 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10491 if (processing_template_decl
)
10492 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10494 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10495 if (type
!= error_mark_node
)
10499 /* If the user declares "typedef struct {...} foo" then the
10500 struct will have an anonymous name. Fill that name in now.
10501 Nothing can refer to it, so nothing needs know about the name
10503 if (type
!= error_mark_node
10504 && TYPE_NAME (type
)
10505 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10506 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10507 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10509 tree oldname
= TYPE_NAME (type
);
10512 /* Replace the anonymous name with the real name everywhere. */
10513 lookup_tag_reverse (type
, declarator
);
10514 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10515 if (TYPE_NAME (t
) == oldname
)
10516 TYPE_NAME (t
) = decl
;
10518 if (TYPE_LANG_SPECIFIC (type
))
10519 TYPE_WAS_ANONYMOUS (type
) = 1;
10521 /* If this is a typedef within a template class, the nested
10522 type is a (non-primary) template. The name for the
10523 template needs updating as well. */
10524 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10525 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10526 = TYPE_IDENTIFIER (type
);
10528 /* XXX Temporarily set the scope.
10529 When returning, start_decl expects it as NULL_TREE,
10530 and will then then set it using pushdecl. */
10531 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10532 if (current_class_type
)
10533 DECL_CONTEXT (decl
) = current_class_type
;
10535 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10537 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10538 DECL_ASSEMBLER_NAME (decl
)
10539 = get_identifier (build_overload_name (type
, 1, 1));
10540 DECL_CONTEXT (decl
) = NULL_TREE
;
10542 /* FIXME remangle member functions; member functions of a
10543 type with external linkage have external linkage. */
10546 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10548 cp_error_at ("typedef name may not be class-qualified", decl
);
10553 if (ctype
== NULL_TREE
)
10555 if (TREE_CODE (type
) != METHOD_TYPE
)
10556 cp_error_at ("invalid type qualifier for non-method type", decl
);
10558 ctype
= TYPE_METHOD_BASETYPE (type
);
10560 if (ctype
!= NULL_TREE
)
10561 grok_method_quals (ctype
, decl
, quals
);
10564 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10565 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10566 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10568 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10569 inlinep
, friendp
, raises
!= NULL_TREE
);
10572 error ("typedef declaration includes an initializer");
10577 /* Detect the case of an array type of unspecified size
10578 which came, as such, direct from a typedef name.
10579 We must copy the type, so that each identifier gets
10580 a distinct type, so that each identifier's size can be
10581 controlled separately by its own initializer. */
10583 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10584 && TYPE_DOMAIN (type
) == NULL_TREE
)
10586 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10589 /* If this is a type name (such as, in a cast or sizeof),
10590 compute the type and return it now. */
10592 if (decl_context
== TYPENAME
)
10594 /* Note that the grammar rejects storage classes
10595 in typenames, fields or parameters. */
10596 if (type_quals
!= TYPE_UNQUALIFIED
)
10597 type_quals
= TYPE_UNQUALIFIED
;
10599 /* Special case: "friend class foo" looks like a TYPENAME context. */
10602 if (type_quals
!= TYPE_UNQUALIFIED
)
10604 cp_error ("type qualifiers specified for friend class declaration");
10605 type_quals
= TYPE_UNQUALIFIED
;
10609 cp_error ("`inline' specified for friend class declaration");
10613 /* Only try to do this stuff if we didn't already give up. */
10614 if (type
!= integer_type_node
)
10616 /* A friendly class? */
10617 if (current_class_type
)
10618 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10620 error ("trying to make class `%s' a friend of global scope",
10621 TYPE_NAME_STRING (type
));
10622 type
= void_type_node
;
10627 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10628 if (ctype
== NULL_TREE
)
10630 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10631 ctype
= TYPE_METHOD_BASETYPE (type
);
10633 grok_method_quals (ctype
, dummy
, quals
);
10634 type
= TREE_TYPE (dummy
);
10639 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10640 && decl_context
!= CATCHPARM
10641 && TREE_CODE (type
) != UNION_TYPE
10644 cp_error ("abstract declarator `%T' used as declaration", type
);
10645 declarator
= make_anon_name ();
10648 /* `void' at top level (not within pointer)
10649 is allowed only in typedefs or type names.
10650 We don't complain about parms either, but that is because
10651 a better error message can be made later. */
10653 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10656 error ("unnamed variable or field declared void");
10657 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10659 if (IDENTIFIER_OPNAME_P (declarator
))
10660 my_friendly_abort (356);
10662 error ("variable or field `%s' declared void", name
);
10665 error ("variable or field declared void");
10666 type
= integer_type_node
;
10669 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10670 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10672 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10674 if (ctype
|| in_namespace
)
10675 error ("cannot use `::' in parameter declaration");
10677 /* A parameter declared as an array of T is really a pointer to T.
10678 One declared as a function is really a pointer to a function.
10679 One declared as a member is really a pointer to member. */
10681 if (TREE_CODE (type
) == ARRAY_TYPE
)
10683 /* Transfer const-ness of array into that of type pointed to. */
10684 type
= build_pointer_type (TREE_TYPE (type
));
10685 type_quals
= TYPE_UNQUALIFIED
;
10687 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10688 type
= build_pointer_type (type
);
10689 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10690 type
= build_pointer_type (type
);
10691 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10693 error ("declaration of `%s' as void", name
);
10699 register tree decl
;
10701 if (decl_context
== PARM
)
10703 decl
= build_decl (PARM_DECL
, declarator
, type
);
10705 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10706 inlinep
, friendp
, raises
!= NULL_TREE
);
10708 /* Compute the type actually passed in the parmlist,
10709 for the case where there is no prototype.
10710 (For example, shorts and chars are passed as ints.)
10711 When there is a prototype, this is overridden later. */
10713 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10715 else if (decl_context
== FIELD
)
10717 if (type
== error_mark_node
)
10719 /* Happens when declaring arrays of sizes which
10720 are error_mark_node, for example. */
10723 else if (in_namespace
&& !friendp
)
10725 /* Something like struct S { int N::j; }; */
10726 cp_error ("invalid use of `::'");
10729 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10732 tree function_context
;
10734 /* We catch the others as conflicts with the builtin
10736 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10738 cp_error ("function `%D' cannot be declared friend",
10745 if (ctype
== NULL_TREE
)
10746 ctype
= current_class_type
;
10748 if (ctype
== NULL_TREE
)
10750 cp_error ("can't make `%D' into a method -- not in a class",
10752 return void_type_node
;
10755 /* ``A union may [ ... ] not [ have ] virtual functions.''
10757 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10759 cp_error ("function `%D' declared virtual inside a union",
10761 return void_type_node
;
10764 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10765 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10766 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10767 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10771 cp_error ("`%D' cannot be declared virtual, since it is always static",
10776 else if (staticp
< 2)
10777 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10778 TYPE_ARG_TYPES (type
));
10781 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10782 function_context
= (ctype
!= NULL_TREE
) ?
10783 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10784 publicp
= (! friendp
|| ! staticp
)
10785 && function_context
== NULL_TREE
;
10786 decl
= grokfndecl (ctype
, type
,
10787 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10788 ? declarator
: dname
,
10790 virtualp
, flags
, quals
, raises
,
10791 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10792 funcdef_flag
, template_count
, in_namespace
);
10793 if (decl
== NULL_TREE
)
10796 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10797 /* The decl and setting of decl_machine_attr is also turned off. */
10798 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10801 /* [class.conv.ctor]
10803 A constructor declared without the function-specifier
10804 explicit that can be called with a single parameter
10805 specifies a conversion from the type of its first
10806 parameter to the type of its class. Such a constructor
10807 is called a converting constructor. */
10808 if (explicitp
== 2)
10809 DECL_NONCONVERTING_P (decl
) = 1;
10810 else if (DECL_CONSTRUCTOR_P (decl
))
10812 /* The constructor can be called with exactly one
10813 parameter if there is at least one parameter, and
10814 any subsequent parameters have default arguments.
10815 We don't look at the first parameter, which is
10816 really just the `this' parameter for the new
10819 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10821 /* Skip the `in_chrg' argument too, if present. */
10822 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10823 arg_types
= TREE_CHAIN (arg_types
);
10825 if (arg_types
== void_list_node
10827 && TREE_CHAIN (arg_types
)
10828 && TREE_CHAIN (arg_types
) != void_list_node
10829 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10830 DECL_NONCONVERTING_P (decl
) = 1;
10833 else if (TREE_CODE (type
) == METHOD_TYPE
)
10835 /* We only get here for friend declarations of
10836 members of other classes. */
10837 /* All method decls are public, so tell grokfndecl to set
10838 TREE_PUBLIC, also. */
10839 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10840 virtualp
, flags
, quals
, raises
,
10841 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10842 template_count
, in_namespace
);
10843 if (decl
== NULL_TREE
)
10846 else if (!staticp
&& ! processing_template_decl
10847 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10848 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10851 cp_error ("field `%D' has incomplete type", declarator
);
10853 cp_error ("name `%T' has incomplete type", type
);
10855 /* If we're instantiating a template, tell them which
10856 instantiation made the field's type be incomplete. */
10857 if (current_class_type
10858 && TYPE_NAME (current_class_type
)
10859 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10860 && declspecs
&& TREE_VALUE (declspecs
)
10861 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10862 cp_error (" in instantiation of template `%T'",
10863 current_class_type
);
10865 type
= error_mark_node
;
10872 error ("`%s' is neither function nor method; cannot be declared friend",
10873 IDENTIFIER_POINTER (declarator
));
10881 /* Friends are treated specially. */
10882 if (ctype
== current_class_type
)
10883 warning ("member functions are implicitly friends of their class");
10886 tree t
= NULL_TREE
;
10887 if (decl
&& DECL_NAME (decl
))
10889 if (template_class_depth (current_class_type
) == 0)
10892 = check_explicit_specialization
10894 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10895 if (decl
== error_mark_node
)
10896 return error_mark_node
;
10899 t
= do_friend (ctype
, declarator
, decl
,
10900 last_function_parms
, attrlist
, flags
, quals
,
10903 if (t
&& funcdef_flag
)
10906 return void_type_node
;
10910 /* Structure field. It may not be a function, except for C++ */
10912 if (decl
== NULL_TREE
)
10918 /* An attempt is being made to initialize a non-static
10919 member. But, from [class.mem]:
10921 4 A member-declarator can contain a
10922 constant-initializer only if it declares a static
10923 member (_class.static_) of integral or enumeration
10924 type, see _class.static.data_.
10926 This used to be relatively common practice, but
10927 the rest of the compiler does not correctly
10928 handle the initialization unless the member is
10929 static so we make it static below. */
10930 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10932 cp_pedwarn ("making `%D' static", declarator
);
10936 if (uses_template_parms (type
))
10937 /* We'll check at instantiation time. */
10939 else if (check_static_variable_definition (declarator
,
10941 /* If we just return the declaration, crashes
10942 will sometimes occur. We therefore return
10943 void_type_node, as if this was a friend
10944 declaration, to cause callers to completely
10945 ignore this declaration. */
10946 return void_type_node
;
10949 /* 9.2p13 [class.mem] */
10950 if (declarator
== constructor_name (current_class_type
)
10951 /* Divergence from the standard: In extern "C", we
10952 allow non-static data members here, because C does
10953 and /usr/include/netinet/in.h uses that. */
10954 && (staticp
|| ! in_system_header
))
10955 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10960 /* C++ allows static class members. All other work
10961 for this is done by grokfield. */
10962 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10963 TREE_STATIC (decl
) = 1;
10964 /* In class context, 'static' means public access. */
10965 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10969 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10970 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10972 DECL_MUTABLE_P (decl
) = 1;
10973 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10977 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10978 inlinep
, friendp
, raises
!= NULL_TREE
);
10981 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10983 tree original_name
;
10989 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10990 original_name
= dname
;
10992 original_name
= declarator
;
10994 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10995 error ("storage class `auto' invalid for function `%s'", name
);
10996 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10997 error ("storage class `register' invalid for function `%s'", name
);
10999 /* Function declaration not at top level.
11000 Storage classes other than `extern' are not allowed
11001 and `extern' makes no difference. */
11002 if (! toplevel_bindings_p ()
11003 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11004 || RIDBIT_SETP (RID_INLINE
, specbits
))
11007 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11008 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11010 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11013 if (ctype
== NULL_TREE
)
11017 error ("virtual non-class function `%s'", name
);
11021 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11022 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11023 TYPE_ARG_TYPES (type
));
11025 /* Record presence of `static'. */
11026 publicp
= (ctype
!= NULL_TREE
11027 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11028 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11030 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11031 virtualp
, flags
, quals
, raises
,
11033 publicp
, inlinep
, funcdef_flag
,
11034 template_count
, in_namespace
);
11035 if (decl
== NULL_TREE
)
11040 int illegal_static
= 0;
11042 /* Don't allow a static member function in a class, and forbid
11043 declaring main to be static. */
11044 if (TREE_CODE (type
) == METHOD_TYPE
)
11046 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11047 illegal_static
= 1;
11049 else if (current_function_decl
)
11051 /* FIXME need arm citation */
11052 error ("cannot declare static function inside another function");
11053 illegal_static
= 1;
11056 if (illegal_static
)
11059 RIDBIT_RESET (RID_STATIC
, specbits
);
11065 /* It's a variable. */
11067 /* An uninitialized decl with `extern' is a reference. */
11068 decl
= grokvardecl (type
, declarator
, &specbits
,
11070 (type_quals
& TYPE_QUAL_CONST
) != 0,
11072 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11073 inlinep
, friendp
, raises
!= NULL_TREE
);
11077 DECL_CONTEXT (decl
) = ctype
;
11080 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11082 RIDBIT_RESET (RID_STATIC
, specbits
);
11084 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11086 cp_error ("static member `%D' declared `register'", decl
);
11087 RIDBIT_RESET (RID_REGISTER
, specbits
);
11089 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11091 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11093 RIDBIT_RESET (RID_EXTERN
, specbits
);
11098 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11100 /* Record `register' declaration for warnings on &
11101 and in case doing stupid register allocation. */
11103 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11104 DECL_REGISTER (decl
) = 1;
11106 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11107 DECL_THIS_EXTERN (decl
) = 1;
11109 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11110 DECL_THIS_STATIC (decl
) = 1;
11112 /* Record constancy and volatility. There's no need to do this
11113 when processing a template; we'll do this for the instantiated
11114 declaration based on the type of DECL. */
11115 if (!processing_template_decl
)
11116 c_apply_type_quals_to_decl (type_quals
, decl
);
11122 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11123 An empty exprlist is a parmlist. An exprlist which
11124 contains only identifiers at the global level
11125 is a parmlist. Otherwise, it is an exprlist. */
11128 parmlist_is_exprlist (exprs
)
11131 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11134 if (toplevel_bindings_p ())
11136 /* At the global level, if these are all identifiers,
11137 then it is a parmlist. */
11140 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11142 exprs
= TREE_CHAIN (exprs
);
11149 /* Subroutine of start_function. Ensure that each of the parameter
11150 types (as listed in PARMS) is complete, as is required for a
11151 function definition. */
11154 require_complete_types_for_parms (parms
)
11159 tree type
= TREE_TYPE (parms
);
11160 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11162 if (DECL_NAME (parms
))
11163 error ("parameter `%s' has incomplete type",
11164 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11166 error ("parameter has incomplete type");
11167 TREE_TYPE (parms
) = error_mark_node
;
11170 layout_decl (parms
, 0);
11172 parms
= TREE_CHAIN (parms
);
11176 /* Returns *TP if *TP is a local variable (or parameter). Returns
11177 NULL_TREE otherwise. */
11180 local_variable_p (tp
)
11185 if ((TREE_CODE (t
) == VAR_DECL
11186 /* A VAR_DECL with a context that is a _TYPE is a static data
11188 && !TYPE_P (CP_DECL_CONTEXT (t
))
11189 /* Any other non-local variable must be at namespace scope. */
11190 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11191 || (TREE_CODE (t
) == PARM_DECL
))
11197 /* Check that ARG, which is a default-argument expression for a
11198 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11199 something goes wrong. DECL may also be a _TYPE node, rather than a
11200 DECL, if there is no DECL available. */
11203 check_default_argument (decl
, arg
)
11210 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11211 /* We get a DEFAULT_ARG when looking at an in-class declaration
11212 with a default argument. Ignore the argument for now; we'll
11213 deal with it after the class is complete. */
11216 if (processing_template_decl
|| uses_template_parms (arg
))
11217 /* We don't do anything checking until instantiation-time. Note
11218 that there may be uninstantiated arguments even for an
11219 instantiated function, since default arguments are not
11220 instantiated until they are needed. */
11229 decl_type
= TREE_TYPE (decl
);
11231 if (arg
== error_mark_node
11232 || decl
== error_mark_node
11233 || TREE_TYPE (arg
) == error_mark_node
11234 || decl_type
== error_mark_node
)
11235 /* Something already went wrong. There's no need to check
11237 return error_mark_node
;
11239 /* [dcl.fct.default]
11241 A default argument expression is implicitly converted to the
11243 if (!TREE_TYPE (arg
)
11244 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11247 cp_error ("default argument for `%#D' has type `%T'",
11248 decl
, TREE_TYPE (arg
));
11250 cp_error ("default argument for parameter of type `%T' has type `%T'",
11251 decl_type
, TREE_TYPE (arg
));
11253 return error_mark_node
;
11256 /* [dcl.fct.default]
11258 Local variables shall not be used in default argument
11261 The keyword `this' shall not be used in a default argument of a
11262 member function. */
11263 var
= search_tree (&arg
, local_variable_p
);
11266 cp_error ("default argument `%E' uses local variable `%D'",
11268 return error_mark_node
;
11275 /* Decode the list of parameter types for a function type.
11276 Given the list of things declared inside the parens,
11277 return a list of types.
11279 The list we receive can have three kinds of elements:
11280 an IDENTIFIER_NODE for names given without types,
11281 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11282 or void_type_node, to mark the end of an argument list
11283 when additional arguments are not permitted (... was not used).
11285 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11286 a mere declaration. A nonempty identifier-list gets an error message
11287 when FUNCDEF_FLAG is zero.
11288 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11289 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11291 If all elements of the input list contain types,
11292 we return a list of the types.
11293 If all elements contain no type (except perhaps a void_type_node
11294 at the end), we return a null list.
11295 If some have types and some do not, it is an error, and we
11296 return a null list.
11298 Also set last_function_parms to either
11299 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11300 A list of names is converted to a chain of PARM_DECLs
11301 by store_parm_decls so that ultimately it is always a chain of decls.
11303 Note that in C++, parameters can take default values. These default
11304 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11305 an error to specify default values which are followed by parameters
11306 that have no default values, or an ELLIPSES. For simplicities sake,
11307 only parameters which are specified with their types can take on
11311 grokparms (first_parm
, funcdef_flag
)
11315 tree result
= NULL_TREE
;
11316 tree decls
= NULL_TREE
;
11318 if (first_parm
!= NULL_TREE
11319 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11321 if (! funcdef_flag
)
11322 pedwarn ("parameter names (without types) in function declaration");
11323 last_function_parms
= first_parm
;
11326 else if (first_parm
!= NULL_TREE
11327 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11328 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11329 my_friendly_abort (145);
11332 /* Types were specified. This is a list of declarators
11333 each represented as a TREE_LIST node. */
11334 register tree parm
, chain
;
11335 int any_init
= 0, any_error
= 0;
11337 if (first_parm
!= NULL_TREE
)
11339 tree last_result
= NULL_TREE
;
11340 tree last_decl
= NULL_TREE
;
11342 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11344 tree type
= NULL_TREE
, list_node
= parm
;
11345 register tree decl
= TREE_VALUE (parm
);
11346 tree init
= TREE_PURPOSE (parm
);
11348 chain
= TREE_CHAIN (parm
);
11349 /* @@ weak defense against parse errors. */
11350 if (TREE_CODE (decl
) != VOID_TYPE
11351 && TREE_CODE (decl
) != TREE_LIST
)
11353 /* Give various messages as the need arises. */
11354 if (TREE_CODE (decl
) == STRING_CST
)
11355 cp_error ("invalid string constant `%E'", decl
);
11356 else if (TREE_CODE (decl
) == INTEGER_CST
)
11357 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11361 if (TREE_CODE (decl
) != VOID_TYPE
)
11363 decl
= grokdeclarator (TREE_VALUE (decl
),
11364 TREE_PURPOSE (decl
),
11365 PARM
, init
!= NULL_TREE
,
11367 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11370 /* Top-level qualifiers on the parameters are
11371 ignored for function types. */
11372 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11374 if (TREE_CODE (type
) == VOID_TYPE
)
11375 decl
= void_type_node
;
11376 else if (TREE_CODE (type
) == METHOD_TYPE
)
11378 if (DECL_NAME (decl
))
11379 /* Cannot use the decl here because
11380 we don't have DECL_CONTEXT set up yet. */
11381 cp_error ("parameter `%D' invalidly declared method type",
11384 error ("parameter invalidly declared method type");
11385 type
= build_pointer_type (type
);
11386 TREE_TYPE (decl
) = type
;
11388 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11390 if (DECL_NAME (decl
))
11391 cp_error ("parameter `%D' invalidly declared offset type",
11394 error ("parameter invalidly declared offset type");
11395 type
= build_pointer_type (type
);
11396 TREE_TYPE (decl
) = type
;
11398 else if (abstract_virtuals_error (decl
, type
))
11399 any_error
= 1; /* Seems like a good idea. */
11400 else if (POINTER_TYPE_P (type
))
11403 while (POINTER_TYPE_P (t
)
11404 || (TREE_CODE (t
) == ARRAY_TYPE
11405 && TYPE_DOMAIN (t
) != NULL_TREE
))
11407 if (TREE_CODE (t
) == ARRAY_TYPE
)
11408 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11410 TYPE_PTR_P (type
) ? "pointer" : "reference");
11414 if (TREE_CODE (decl
) == VOID_TYPE
)
11416 if (result
== NULL_TREE
)
11418 result
= void_list_node
;
11419 last_result
= result
;
11423 TREE_CHAIN (last_result
) = void_list_node
;
11424 last_result
= void_list_node
;
11427 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11428 error ("`void' in parameter list must be entire list");
11432 /* Since there is a prototype, args are passed in their own types. */
11433 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11434 if (PROMOTE_PROTOTYPES
11435 && (TREE_CODE (type
) == INTEGER_TYPE
11436 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11437 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11438 DECL_ARG_TYPE (decl
) = integer_type_node
;
11439 if (!any_error
&& init
)
11442 init
= check_default_argument (decl
, init
);
11447 if (decls
== NULL_TREE
)
11454 TREE_CHAIN (last_decl
) = decl
;
11457 list_node
= tree_cons (init
, type
, NULL_TREE
);
11458 if (result
== NULL_TREE
)
11460 result
= list_node
;
11461 last_result
= result
;
11465 TREE_CHAIN (last_result
) = list_node
;
11466 last_result
= list_node
;
11470 TREE_CHAIN (last_result
) = NULL_TREE
;
11471 /* If there are no parameters, and the function does not end
11472 with `...', then last_decl will be NULL_TREE. */
11473 if (last_decl
!= NULL_TREE
)
11474 TREE_CHAIN (last_decl
) = NULL_TREE
;
11478 last_function_parms
= decls
;
11483 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11484 FUNCTION_TYPE with the newly parsed version of its default argument, which
11485 was previously digested as text. See snarf_defarg et al in lex.c. */
11488 replace_defarg (arg
, init
)
11491 if (! processing_template_decl
11492 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11493 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11494 TREE_TYPE (init
), TREE_VALUE (arg
));
11495 TREE_PURPOSE (arg
) = init
;
11502 tree t
= FUNCTION_ARG_CHAIN (d
);
11503 if (DECL_CONSTRUCTOR_P (d
)
11504 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11505 t
= TREE_CHAIN (t
);
11506 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11507 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11508 == DECL_CLASS_CONTEXT (d
))
11509 && (TREE_CHAIN (t
) == NULL_TREE
11510 || TREE_CHAIN (t
) == void_list_node
11511 || TREE_PURPOSE (TREE_CHAIN (t
))))
11516 /* These memoizing functions keep track of special properties which
11517 a class may have. `grok_ctor_properties' notices whether a class
11518 has a constructor of the form X(X&), and also complains
11519 if the class has a constructor of the form X(X).
11520 `grok_op_properties' takes notice of the various forms of
11521 operator= which are defined, as well as what sorts of type conversion
11522 may apply. Both functions take a FUNCTION_DECL as an argument. */
11525 grok_ctor_properties (ctype
, decl
)
11528 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11529 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11531 /* When a type has virtual baseclasses, a magical first int argument is
11532 added to any ctor so we can tell if the class has been initialized
11533 yet. This could screw things up in this function, so we deliberately
11534 ignore the leading int if we're in that situation. */
11535 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11537 my_friendly_assert (parmtypes
11538 && TREE_VALUE (parmtypes
) == integer_type_node
,
11540 parmtypes
= TREE_CHAIN (parmtypes
);
11541 parmtype
= TREE_VALUE (parmtypes
);
11546 A non-template constructor for class X is a copy constructor if
11547 its first parameter is of type X&, const X&, volatile X& or const
11548 volatile X&, and either there are no other parameters or else all
11549 other parameters have default arguments. */
11550 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11551 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11552 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11553 || TREE_CHAIN (parmtypes
) == void_list_node
11554 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11555 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11556 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11558 TYPE_HAS_INIT_REF (ctype
) = 1;
11559 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11560 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11564 A declaration of a constructor for a class X is ill-formed if its
11565 first parameter is of type (optionally cv-qualified) X and either
11566 there are no other parameters or else all other parameters have
11569 We *don't* complain about member template instantiations that
11570 have this form, though; they can occur as we try to decide what
11571 constructor to use during overload resolution. Since overload
11572 resolution will never prefer such a constructor to the
11573 non-template copy constructor (which is either explicitly or
11574 implicitly defined), there's no need to worry about their
11575 existence. Theoretically, they should never even be
11576 instantiated, but that's hard to forestall. */
11577 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11578 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11579 || TREE_CHAIN (parmtypes
) == void_list_node
11580 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11581 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11582 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11584 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11586 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11589 else if (TREE_CODE (parmtype
) == VOID_TYPE
11590 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11591 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11596 /* An operator with this name can be either unary or binary. */
11602 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11603 || name
== ansi_opname
[(int) ADDR_EXPR
]
11604 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11605 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11606 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11607 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11610 /* An operator with this name can only be unary. */
11616 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11617 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11618 || name
== ansi_opname
[(int) COMPONENT_REF
]
11619 || IDENTIFIER_TYPENAME_P (name
));
11622 /* Do a little sanity-checking on how they declared their operator. */
11625 grok_op_properties (decl
, virtualp
, friendp
)
11627 int virtualp
, friendp
;
11629 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11630 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11631 tree name
= DECL_NAME (decl
);
11633 if (current_class_type
== NULL_TREE
)
11640 A user-declared copy assignment operator X::operator= is a
11641 non-static non-template member function of class X with
11642 exactly one parameter of type X, X&, const X&, volatile X& or
11643 const volatile X&. */
11644 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11645 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11646 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11648 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11649 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11650 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11651 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11652 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11653 || name
== ansi_opname
[(int) MEMBER_REF
])
11654 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11655 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11656 TYPE_GETS_NEW (current_class_type
) |= 1;
11657 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11658 TYPE_GETS_DELETE (current_class_type
) |= 1;
11659 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11660 TYPE_GETS_NEW (current_class_type
) |= 2;
11661 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11662 TYPE_GETS_DELETE (current_class_type
) |= 2;
11665 if (name
== ansi_opname
[(int) NEW_EXPR
]
11666 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11668 /* When the compiler encounters the definition of A::operator new, it
11669 doesn't look at the class declaration to find out if it's static. */
11671 revert_static_member_fn (&decl
, NULL
, NULL
);
11673 /* Take care of function decl if we had syntax errors. */
11674 if (argtypes
== NULL_TREE
)
11676 = build_function_type (ptr_type_node
,
11677 hash_tree_chain (integer_type_node
,
11680 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11682 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11683 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11686 revert_static_member_fn (&decl
, NULL
, NULL
);
11688 if (argtypes
== NULL_TREE
)
11690 = build_function_type (void_type_node
,
11691 hash_tree_chain (ptr_type_node
,
11695 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11697 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11698 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11699 != void_list_node
))
11700 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11705 /* An operator function must either be a non-static member function
11706 or have at least one parameter of a class, a reference to a class,
11707 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11708 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11710 if (IDENTIFIER_TYPENAME_P (name
)
11711 || name
== ansi_opname
[(int) CALL_EXPR
]
11712 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11713 || name
== ansi_opname
[(int) COMPONENT_REF
]
11714 || name
== ansi_opname
[(int) ARRAY_REF
])
11715 cp_error ("`%D' must be a nonstatic member function", decl
);
11720 if (DECL_STATIC_FUNCTION_P (decl
))
11721 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11724 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11726 tree arg
= TREE_VALUE (p
);
11727 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11728 arg
= TREE_TYPE (arg
);
11730 /* This lets bad template code slip through. */
11731 if (IS_AGGR_TYPE (arg
)
11732 || TREE_CODE (arg
) == ENUMERAL_TYPE
11733 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11734 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11738 ("`%D' must have an argument of class or enumerated type",
11745 if (name
== ansi_opname
[(int) CALL_EXPR
])
11746 return; /* No restrictions on args. */
11748 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11750 tree t
= TREE_TYPE (name
);
11751 if (TREE_CODE (t
) == VOID_TYPE
)
11752 pedwarn ("void is not a valid type conversion operator");
11753 else if (! friendp
)
11755 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11756 const char *what
= 0;
11758 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11760 if (t
== current_class_type
)
11761 what
= "the same type";
11762 /* Don't force t to be complete here. */
11763 else if (IS_AGGR_TYPE (t
)
11765 && DERIVED_FROM_P (t
, current_class_type
))
11766 what
= "a base class";
11769 warning ("conversion to %s%s will never use a type conversion operator",
11770 ref
? "a reference to " : "", what
);
11774 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11778 if (list_length (argtypes
) != 3 && methodp
)
11780 cp_error ("`%D' must take exactly one argument", decl
);
11783 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11785 if (copy_assignment_arg_p (parmtype
, virtualp
)
11788 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11789 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11790 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11791 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11794 else if (name
== ansi_opname
[(int) COND_EXPR
])
11797 cp_error ("ANSI C++ prohibits overloading operator ?:");
11799 else if (ambi_op_p (name
))
11801 if (list_length (argtypes
) == 2)
11803 else if (list_length (argtypes
) == 3)
11805 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11806 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11807 && ! processing_template_decl
11808 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11811 cp_error ("postfix `%D' must take `int' as its argument",
11815 ("postfix `%D' must take `int' as its second argument",
11822 cp_error ("`%D' must take either zero or one argument", decl
);
11824 cp_error ("`%D' must take either one or two arguments", decl
);
11827 /* More Effective C++ rule 6. */
11829 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11830 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11832 tree arg
= TREE_VALUE (argtypes
);
11833 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11834 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11835 arg
= TREE_TYPE (arg
);
11836 arg
= TYPE_MAIN_VARIANT (arg
);
11837 if (list_length (argtypes
) == 2)
11839 if (TREE_CODE (ret
) != REFERENCE_TYPE
11840 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11842 cp_warning ("prefix `%D' should return `%T'", decl
,
11843 build_reference_type (arg
));
11847 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11848 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11852 else if (unary_op_p (name
))
11854 if (list_length (argtypes
) != 2)
11857 cp_error ("`%D' must take `void'", decl
);
11859 cp_error ("`%D' must take exactly one argument", decl
);
11862 else /* if (binary_op_p (name)) */
11864 if (list_length (argtypes
) != 3)
11867 cp_error ("`%D' must take exactly one argument", decl
);
11869 cp_error ("`%D' must take exactly two arguments", decl
);
11872 /* More Effective C++ rule 7. */
11874 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11875 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11876 || name
== ansi_opname
[COMPOUND_EXPR
]))
11877 cp_warning ("user-defined `%D' always evaluates both arguments",
11881 /* Effective C++ rule 23. */
11883 && list_length (argtypes
) == 3
11884 && (name
== ansi_opname
[PLUS_EXPR
]
11885 || name
== ansi_opname
[MINUS_EXPR
]
11886 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11887 || name
== ansi_opname
[MULT_EXPR
])
11888 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11889 cp_warning ("`%D' should return by value", decl
);
11893 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11894 if (TREE_PURPOSE (argtypes
))
11896 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11897 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11898 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11901 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11904 cp_error ("`%D' cannot have default arguments", decl
);
11909 static const char *
11911 enum tag_types code
;
11924 my_friendly_abort (981122);
11928 /* Get the struct, enum or union (CODE says which) with tag NAME.
11929 Define the tag as a forward-reference if it is not defined.
11931 C++: If a class derivation is given, process it here, and report
11932 an error if multiple derivation declarations are not identical.
11934 If this is a definition, come in through xref_tag and only look in
11935 the current frame for the name (since C++ allows new names in any
11939 xref_tag (code_type_node
, name
, globalize
)
11940 tree code_type_node
;
11944 enum tag_types tag_code
;
11945 enum tree_code code
;
11947 register tree ref
, t
;
11948 struct binding_level
*b
= current_binding_level
;
11950 tree attributes
= NULL_TREE
;
11951 tree context
= NULL_TREE
;
11953 /* If we are called from the parser, code_type_node will sometimes be a
11954 TREE_LIST. This indicates that the user wrote
11955 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11957 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11959 attributes
= TREE_PURPOSE (code_type_node
);
11960 code_type_node
= TREE_VALUE (code_type_node
);
11963 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11968 code
= RECORD_TYPE
;
11974 code
= ENUMERAL_TYPE
;
11977 my_friendly_abort (18);
11980 /* If a cross reference is requested, look up the type
11981 already defined for this tag and return it. */
11982 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11985 name
= TYPE_IDENTIFIER (t
);
11989 t
= IDENTIFIER_TYPE_VALUE (name
);
11991 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11992 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11997 /* If we know we are defining this tag, only look it up in
11998 this scope and don't try to find it as a type. */
11999 ref
= lookup_tag (code
, name
, b
, 1);
12005 /* [dcl.type.elab] If the identifier resolves to a
12006 typedef-name or a template type-parameter, the
12007 elaborated-type-specifier is ill-formed. */
12008 if (t
!= TYPE_MAIN_VARIANT (t
)
12009 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12010 cp_pedwarn ("using typedef-name `%D' after `%s'",
12011 TYPE_NAME (t
), tag_name (tag_code
));
12012 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12013 cp_error ("using template type parameter `%T' after `%s'",
12014 t
, tag_name (tag_code
));
12019 ref
= lookup_tag (code
, name
, b
, 0);
12023 /* Try finding it as a type declaration. If that wins,
12025 ref
= lookup_name (name
, 1);
12027 if (ref
!= NULL_TREE
12028 && processing_template_decl
12029 && DECL_CLASS_TEMPLATE_P (ref
)
12030 && template_class_depth (current_class_type
) == 0)
12031 /* Since GLOBALIZE is true, we're declaring a global
12032 template, so we want this type. */
12033 ref
= DECL_RESULT (ref
);
12035 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12036 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12037 ref
= TREE_TYPE (ref
);
12042 if (ref
&& current_class_type
12043 && template_class_depth (current_class_type
)
12044 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12046 /* Since GLOBALIZE is non-zero, we are not looking at a
12047 definition of this tag. Since, in addition, we are currently
12048 processing a (member) template declaration of a template
12049 class, we must be very careful; consider:
12056 { template <class V>
12057 friend struct S1; };
12059 Here, the S2::S1 declaration should not be confused with the
12060 outer declaration. In particular, the inner version should
12061 have a template parameter of level 2, not level 1. This
12062 would be particularly important if the member declaration
12065 template <class V = U> friend struct S1;
12067 say, when we should tsubst into `U' when instantiating
12068 S2. On the other hand, when presented with:
12078 we must find the inner binding eventually. We
12079 accomplish this by making sure that the new type we
12080 create to represent this declaration has the right
12082 context
= TYPE_CONTEXT (ref
);
12087 push_obstacks_nochange ();
12091 /* If no such tag is yet defined, create a forward-reference node
12092 and record it as the "definition".
12093 When a real declaration of this type is found,
12094 the forward-reference will be altered into a real type. */
12096 /* In C++, since these migrate into the global scope, we must
12097 build them on the permanent obstack. */
12099 temp
= allocation_temporary_p ();
12101 end_temporary_allocation ();
12103 if (code
== ENUMERAL_TYPE
)
12105 cp_error ("use of enum `%#D' without previous declaration", name
);
12107 ref
= make_node (ENUMERAL_TYPE
);
12109 /* Give the type a default layout like unsigned int
12110 to avoid crashing if it does not get defined. */
12111 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12112 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12113 TREE_UNSIGNED (ref
) = 1;
12114 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12115 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12116 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12118 /* Enable us to recognize when a type is created in class context.
12119 To do nested classes correctly, this should probably be cleared
12120 out when we leave this classes scope. Currently this in only
12121 done in `start_enum'. */
12123 pushtag (name
, ref
, globalize
);
12127 struct binding_level
*old_b
= class_binding_level
;
12129 ref
= make_lang_type (code
);
12130 TYPE_CONTEXT (ref
) = context
;
12132 #ifdef NONNESTED_CLASSES
12133 /* Class types don't nest the way enums do. */
12134 class_binding_level
= (struct binding_level
*)0;
12136 pushtag (name
, ref
, globalize
);
12137 class_binding_level
= old_b
;
12142 /* If it no longer looks like a nested type, make sure it's
12144 If it is not an IDENTIFIER, this is not a declaration */
12145 if (b
->namespace_p
&& !class_binding_level
12146 && TREE_CODE (name
) == IDENTIFIER_NODE
12147 && IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12148 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12150 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12151 redeclare_class_template (ref
, current_template_parms
);
12154 /* Until the type is defined, tentatively accept whatever
12155 structure tag the user hands us. */
12156 if (TYPE_SIZE (ref
) == NULL_TREE
12157 && ref
!= current_class_type
12158 /* Have to check this, in case we have contradictory tag info. */
12159 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12161 if (tag_code
== class_type
)
12162 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12163 else if (tag_code
== record_type
)
12164 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12169 TREE_TYPE (ref
) = attributes
;
12175 xref_tag_from_type (old
, id
, globalize
)
12179 tree code_type_node
;
12181 if (TREE_CODE (old
) == RECORD_TYPE
)
12182 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12183 ? class_type_node
: record_type_node
);
12185 code_type_node
= union_type_node
;
12187 if (id
== NULL_TREE
)
12188 id
= TYPE_IDENTIFIER (old
);
12190 return xref_tag (code_type_node
, id
, globalize
);
12193 /* REF is a type (named NAME), for which we have just seen some
12194 baseclasses. BINFO is a list of those baseclasses; the
12195 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12196 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12197 struct, or union. */
12200 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12201 tree code_type_node
;
12205 /* In the declaration `A : X, Y, ... Z' we mark all the types
12206 (A, X, Y, ..., Z) so we can check for duplicates. */
12211 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12213 if (tag_code
== union_type
)
12215 cp_error ("derived union `%T' invalid", ref
);
12219 len
= list_length (binfo
);
12220 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12222 /* First, make sure that any templates in base-classes are
12223 instantiated. This ensures that if we call ourselves recursively
12224 we do not get confused about which classes are marked and which
12226 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12227 complete_type (TREE_VALUE (base
));
12229 SET_CLASSTYPE_MARKED (ref
);
12230 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12232 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12234 /* The base of a derived struct is public by default. */
12236 = (TREE_PURPOSE (binfo
) == access_public_node
12237 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12238 || (tag_code
!= class_type
12239 && (TREE_PURPOSE (binfo
) == access_default_node
12240 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12242 = (TREE_PURPOSE (binfo
) == access_protected_node
12243 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12245 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12246 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12247 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12248 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12249 tree basetype
= TREE_VALUE (binfo
);
12252 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12253 basetype
= TREE_TYPE (basetype
);
12255 || (TREE_CODE (basetype
) != RECORD_TYPE
12256 && TREE_CODE (basetype
) != TYPENAME_TYPE
12257 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12258 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12260 cp_error ("base type `%T' fails to be a struct or class type",
12261 TREE_VALUE (binfo
));
12265 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12267 /* This code replaces similar code in layout_basetypes.
12268 We put the complete_type first for implicit `typename'. */
12269 if (TYPE_SIZE (basetype
) == NULL_TREE
12270 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12272 cp_error ("base class `%T' has incomplete type", basetype
);
12277 if (CLASSTYPE_MARKED (basetype
))
12279 if (basetype
== ref
)
12280 cp_error ("recursive type `%T' undefined", basetype
);
12282 cp_error ("duplicate base type `%T' invalid", basetype
);
12286 if (TYPE_FOR_JAVA (basetype
)
12287 && (current_lang_stack
12288 == &VARRAY_TREE (current_lang_base
, 0)))
12289 TYPE_FOR_JAVA (ref
) = 1;
12291 /* Note that the BINFO records which describe individual
12292 inheritances are *not* shared in the lattice! They
12293 cannot be shared because a given baseclass may be
12294 inherited with different `accessibility' by different
12295 derived classes. (Each BINFO record describing an
12296 individual inheritance contains flags which say what
12297 the `accessibility' of that particular inheritance is.) */
12300 = make_binfo (integer_zero_node
, basetype
,
12301 CLASS_TYPE_P (basetype
)
12302 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12303 CLASS_TYPE_P (basetype
)
12304 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12306 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12307 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12308 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12309 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12310 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12312 /* We need to unshare the binfos now so that lookups during class
12313 definition work. */
12314 unshare_base_binfos (base_binfo
);
12316 SET_CLASSTYPE_MARKED (basetype
);
12318 /* We are free to modify these bits because they are meaningless
12319 at top level, and BASETYPE is a top-level type. */
12320 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12322 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12323 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12326 if (CLASS_TYPE_P (basetype
))
12328 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12329 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12336 TREE_VEC_LENGTH (binfos
) = i
;
12338 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12341 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12344 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12346 if (CLASS_TYPE_P (basetype
))
12347 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12348 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12351 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12352 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12354 /* Unmark all the types. */
12356 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12357 CLEAR_CLASSTYPE_MARKED (ref
);
12359 /* Now that we know all the base-classes, set up the list of virtual
12361 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12367 /* Begin compiling the definition of an enumeration type.
12368 NAME is its name (or null if anonymous).
12369 Returns the type object, as yet incomplete.
12370 Also records info about it so that build_enumerator
12371 may be used to declare the individual values as they are read. */
12377 register tree enumtype
= NULL_TREE
;
12378 struct binding_level
*b
= current_binding_level
;
12380 /* We are wasting space here and putting these on the permanent_obstack so
12381 that typeid(local enum) will work correctly. */
12382 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12384 /* If this is the real definition for a previous forward reference,
12385 fill in the contents in the same object that used to be the
12386 forward reference. */
12388 if (name
!= NULL_TREE
)
12389 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12391 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12393 cp_error ("multiple definition of `%#T'", enumtype
);
12394 cp_error_at ("previous definition here", enumtype
);
12398 enumtype
= make_node (ENUMERAL_TYPE
);
12399 pushtag (name
, enumtype
, 0);
12402 if (current_class_type
)
12403 TREE_ADDRESSABLE (b
->tags
) = 1;
12405 /* We don't copy this value because build_enumerator needs to do it. */
12406 enum_next_value
= integer_zero_node
;
12409 GNU_xref_decl (current_function_decl
, enumtype
);
12413 /* After processing and defining all the values of an enumeration type,
12414 install their decls in the enumeration type and finish it off.
12415 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12416 Returns ENUMTYPE. */
12419 finish_enum (enumtype
)
12422 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12423 /* Calculate the maximum value of any enumerator in this type. */
12425 tree values
= TYPE_VALUES (enumtype
);
12430 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12435 /* The TREE_VALUE is a CONST_DECL for this enumeration
12437 decl
= TREE_VALUE (pair
);
12439 /* The DECL_INITIAL will be NULL if we are processing a
12440 template declaration and this enumeration constant had no
12441 explicit initializer. */
12442 value
= DECL_INITIAL (decl
);
12443 if (value
&& !processing_template_decl
)
12445 /* Set the TREE_TYPE for the VALUE as well. That's so
12446 that when we call decl_constant_value we get an
12447 entity of the right type (but with the constant
12448 value). Since we shouldn't ever call
12449 decl_constant_value on a template type, there's no
12450 reason to do that when processing_template_decl.
12451 And, if the expression is something like a
12452 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12453 wreak havoc on the intended type of the expression.
12455 Of course, there's also no point in trying to compute
12456 minimum or maximum values if we're in a template. */
12457 TREE_TYPE (value
) = enumtype
;
12460 minnode
= maxnode
= value
;
12461 else if (tree_int_cst_lt (maxnode
, value
))
12463 else if (tree_int_cst_lt (value
, minnode
))
12467 if (processing_template_decl
)
12468 /* If this is just a template, leave the CONST_DECL
12469 alone. That way tsubst_copy will find CONST_DECLs for
12470 CONST_DECLs, and not INTEGER_CSTs. */
12473 /* In the list we're building up, we want the enumeration
12474 values, not the CONST_DECLs. */
12475 TREE_VALUE (pair
) = value
;
12479 maxnode
= minnode
= integer_zero_node
;
12481 TYPE_VALUES (enumtype
) = nreverse (values
);
12483 if (processing_template_decl
)
12485 tree scope
= current_scope ();
12486 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12487 add_tree (build_min (TAG_DEFN
, enumtype
));
12491 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12492 int lowprec
= min_precision (minnode
, unsignedp
);
12493 int highprec
= min_precision (maxnode
, unsignedp
);
12494 int precision
= MAX (lowprec
, highprec
);
12497 TYPE_SIZE (enumtype
) = NULL_TREE
;
12499 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12501 TYPE_PRECISION (enumtype
) = precision
;
12503 fixup_unsigned_type (enumtype
);
12505 fixup_signed_type (enumtype
);
12507 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12508 /* Use the width of the narrowest normal C type which is wide
12510 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12513 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12515 TYPE_SIZE (enumtype
) = 0;
12516 layout_type (enumtype
);
12518 /* Fix up all variant types of this enum type. */
12519 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12520 tem
= TYPE_NEXT_VARIANT (tem
))
12522 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12523 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12524 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12525 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12526 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12527 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12528 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12529 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12530 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12533 /* Finish debugging output for this type. */
12534 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12537 /* In start_enum we pushed obstacks. Here, we must pop them. */
12543 /* Build and install a CONST_DECL for an enumeration constant of the
12544 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12545 Assignment of sequential values by default is handled here. */
12548 build_enumerator (name
, value
, type
)
12556 /* Remove no-op casts from the value. */
12558 STRIP_TYPE_NOPS (value
);
12560 if (! processing_template_decl
)
12562 /* Validate and default VALUE. */
12563 if (value
!= NULL_TREE
)
12565 if (TREE_READONLY_DECL_P (value
))
12566 value
= decl_constant_value (value
);
12568 if (TREE_CODE (value
) == INTEGER_CST
)
12570 value
= default_conversion (value
);
12571 constant_expression_warning (value
);
12575 cp_error ("enumerator value for `%D' not integer constant", name
);
12580 /* Default based on previous value. */
12581 if (value
== NULL_TREE
&& ! processing_template_decl
)
12583 value
= enum_next_value
;
12585 cp_error ("overflow in enumeration values at `%D'", name
);
12588 /* Remove no-op casts from the value. */
12590 STRIP_TYPE_NOPS (value
);
12592 /* To fix MAX_VAL enum consts. (bkoz) */
12593 TREE_TYPE (value
) = integer_type_node
;
12597 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12598 Even in other cases, we will later (in finish_enum) be setting the
12600 if (value
!= NULL_TREE
)
12601 value
= copy_node (value
);
12603 /* C++ associates enums with global, function, or class declarations. */
12605 context
= current_scope ();
12606 if (context
&& context
== current_class_type
)
12607 /* This enum declaration is local to the class. */
12608 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12610 /* It's a global enum, or it's local to a function. (Note local to
12611 a function could mean local to a class method. */
12612 decl
= build_decl (CONST_DECL
, name
, type
);
12614 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12615 DECL_INITIAL (decl
) = value
;
12616 TREE_READONLY (decl
) = 1;
12618 if (context
&& context
== current_class_type
)
12619 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12620 on the TYPE_FIELDS list for `S'. (That's so that you can say
12621 things like `S::i' later.) */
12622 finish_member_declaration (decl
);
12626 GNU_xref_decl (current_function_decl
, decl
);
12629 if (! processing_template_decl
)
12631 /* Set basis for default for next value. */
12632 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12633 integer_one_node
, PLUS_EXPR
);
12634 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12637 result
= tree_cons (name
, decl
, NULL_TREE
);
12642 static int function_depth
;
12644 /* We're defining DECL. Make sure that it's type is OK. */
12647 check_function_type (decl
)
12650 tree fntype
= TREE_TYPE (decl
);
12652 /* In a function definition, arg types must be complete. */
12653 require_complete_types_for_parms (current_function_parms
);
12655 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12657 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12659 /* Make it return void instead, but don't change the
12660 type of the DECL_RESULT, in case we have a named return value. */
12661 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12663 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12665 = build_cplus_method_type (ctype
,
12667 FUNCTION_ARG_CHAIN (decl
));
12671 = build_function_type (void_type_node
,
12672 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12674 = build_exception_variant (fntype
,
12675 TYPE_RAISES_EXCEPTIONS (fntype
));
12678 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12681 /* Create the FUNCTION_DECL for a function definition.
12682 DECLSPECS and DECLARATOR are the parts of the declaration;
12683 they describe the function's name and the type it returns,
12684 but twisted together in a fashion that parallels the syntax of C.
12686 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12687 DECLARATOR is really the DECL for the function we are about to
12688 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12689 indicating that the function is an inline defined in-class, and
12690 SF_EXPAND indicating that we should generate RTL for this
12693 This function creates a binding context for the function body
12694 as well as setting up the FUNCTION_DECL in current_function_decl.
12696 Returns 1 on success. If the DECLARATOR is not suitable for a function
12697 (it defines a datum instead), we return 0, which tells
12698 yyparse to report a parse error.
12700 For C++, we must first check whether that datum makes any sense.
12701 For example, "class A local_a(1,2);" means that variable local_a
12702 is an aggregate of type A, which should have a constructor
12703 applied to it with the argument list [1, 2]. */
12706 start_function (declspecs
, declarator
, attrs
, flags
)
12707 tree declspecs
, declarator
, attrs
;
12711 tree ctype
= NULL_TREE
;
12714 extern int have_extern_spec
;
12715 extern int used_extern_spec
;
12716 int doing_friend
= 0;
12717 struct binding_level
*bl
;
12719 /* Sanity check. */
12720 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12721 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12723 /* This should only be done once on the top most decl. */
12724 if (have_extern_spec
&& !used_extern_spec
)
12726 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12727 used_extern_spec
= 1;
12730 if (flags
& SF_PRE_PARSED
)
12732 decl1
= declarator
;
12734 fntype
= TREE_TYPE (decl1
);
12735 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12736 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12738 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12739 class is in the (lexical) scope of the class in which it is
12741 if (!ctype
&& DECL_FRIEND_P (decl1
))
12743 ctype
= DECL_CLASS_CONTEXT (decl1
);
12745 /* CTYPE could be null here if we're dealing with a template;
12746 for example, `inline friend float foo()' inside a template
12747 will have no CTYPE set. */
12748 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12754 last_function_parms
= DECL_ARGUMENTS (decl1
);
12755 last_function_parm_tags
= NULL_TREE
;
12759 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12760 /* If the declarator is not suitable for a function definition,
12761 cause a syntax error. */
12762 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12764 fntype
= TREE_TYPE (decl1
);
12766 restype
= TREE_TYPE (fntype
);
12767 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12769 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12770 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12771 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12772 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12773 fntype
= build_function_type (integer_type_node
,
12774 TYPE_ARG_TYPES (fntype
));
12776 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12778 TYPE_ARG_TYPES (fntype
));
12779 TREE_TYPE (decl1
) = fntype
;
12782 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12783 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12784 else if (DECL_MAIN_P (decl1
))
12786 /* If this doesn't return integer_type, complain. */
12787 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12789 if (pedantic
|| warn_return_type
)
12790 pedwarn ("return type for `main' changed to `int'");
12791 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12796 /* Sometimes we don't notice that a function is a static member, and
12797 build a METHOD_TYPE for it. Fix that up now. */
12798 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
12799 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
12801 revert_static_member_fn (&decl1
, NULL
, NULL
);
12802 last_function_parms
= TREE_CHAIN (last_function_parms
);
12806 /* Warn if function was previously implicitly declared
12807 (but not if we warned then). */
12808 if (! warn_implicit
12809 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12810 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12812 /* Set up current_class_type, and enter the scope of the class, if
12815 push_nested_class (ctype
, 1);
12816 else if (DECL_STATIC_FUNCTION_P (decl1
))
12817 push_nested_class (DECL_CONTEXT (decl1
), 2);
12819 /* Now that we have entered the scope of the class, we must restore
12820 the bindings for any template parameters surrounding DECL1, if it
12821 is an inline member template. (Order is important; consider the
12822 case where a template parameter has the same name as a field of
12823 the class.) It is not until after this point that
12824 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12825 if (flags
& SF_INCLASS_INLINE
)
12826 maybe_begin_member_template_processing (decl1
);
12828 /* Effective C++ rule 15. See also c_expand_return. */
12830 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12831 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12832 cp_warning ("`operator=' should return a reference to `*this'");
12834 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12835 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12836 if (!DECL_INITIAL (decl1
))
12837 DECL_INITIAL (decl1
) = error_mark_node
;
12839 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12840 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12843 /* This function exists in static storage.
12844 (This does not mean `static' in the C sense!) */
12845 TREE_STATIC (decl1
) = 1;
12847 /* We must call push_template_decl after current_class_type is set
12848 up. (If we are processing inline definitions after exiting a
12849 class scope, current_class_type will be NULL_TREE until set above
12850 by push_nested_class.) */
12851 if (processing_template_decl
)
12852 decl1
= push_template_decl (decl1
);
12854 /* We are now in the scope of the function being defined. */
12855 current_function_decl
= decl1
;
12857 /* Save the parm names or decls from this function's declarator
12858 where store_parm_decls will find them. */
12859 current_function_parms
= last_function_parms
;
12860 current_function_parm_tags
= last_function_parm_tags
;
12862 /* Make sure the parameter and return types are reasonable. When
12863 you declare a function, these types can be incomplete, but they
12864 must be complete when you define the function. */
12865 if (! processing_template_decl
)
12866 check_function_type (decl1
);
12868 /* Build the return declaration for the function. */
12869 restype
= TREE_TYPE (fntype
);
12870 if (!processing_template_decl
)
12872 if (!DECL_RESULT (decl1
))
12874 DECL_RESULT (decl1
)
12875 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12876 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12877 DECL_RESULT (decl1
));
12881 /* Just use `void'. Nobody will ever look at this anyhow. */
12882 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12884 /* Initialize RTL machinery. We cannot do this until
12885 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12886 even when processing a template; this is how we get
12887 CURRENT_FUNCTION set up, and our per-function variables
12889 bl
= current_binding_level
;
12890 init_function_start (decl1
, input_filename
, lineno
);
12891 current_binding_level
= bl
;
12892 expanding_p
= (flags
& SF_EXPAND
) != 0;
12894 /* Even though we're inside a function body, we still don't want to
12895 call expand_expr to calculate the size of a variable-sized array.
12896 We haven't necessarily assigned RTL to all variables yet, so it's
12897 not safe to try to expand expressions involving them. */
12898 immediate_size_expand
= 0;
12899 current_function
->x_dont_save_pending_sizes_p
= 1;
12901 /* If we're building a statement-tree, start the tree now. */
12902 if (processing_template_decl
|| !expanding_p
)
12903 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
12905 /* Let the user know we're compiling this function. */
12906 if (processing_template_decl
|| !building_stmt_tree ())
12907 announce_function (decl1
);
12909 /* Record the decl so that the function name is defined.
12910 If we already have a decl for this name, and it is a FUNCTION_DECL,
12911 use the old decl. */
12912 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12914 /* A specialization is not used to guide overload resolution. */
12915 if ((flag_guiding_decls
12916 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12917 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12918 decl1
= pushdecl (decl1
);
12921 /* We need to set the DECL_CONTEXT. */
12922 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12923 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12924 /* And make sure we have enough default args. */
12925 check_default_args (decl1
);
12927 DECL_MAIN_VARIANT (decl1
) = decl1
;
12928 fntype
= TREE_TYPE (decl1
);
12931 /* Reset these in case the call to pushdecl changed them. */
12932 current_function_decl
= decl1
;
12933 current_function
->decl
= decl1
;
12935 /* Initialize the per-function data. */
12936 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
12938 /* If we already parsed this function, and we're just expanding it
12939 now, restore saved state. */
12940 struct binding_level
*bl
= current_binding_level
;
12941 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
12942 current_binding_level
= bl
;
12944 /* This function is being processed in whole-function mode; we
12945 already did semantic analysis. */
12946 current_function
->x_whole_function_mode_p
= 1;
12948 /* If we decided that we didn't want to inline this function,
12949 make sure the back-end knows that. */
12950 if (!current_function_cannot_inline
)
12951 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
12953 /* We don't need the saved data anymore. */
12954 free (DECL_SAVED_FUNCTION_DATA (decl1
));
12955 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
12957 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
12959 /* We know that this was set up by `grokclassfn'. We do not
12960 wait until `store_parm_decls', since evil parse errors may
12961 never get us to that point. Here we keep the consistency
12962 between `current_class_type' and `current_class_ptr'. */
12963 tree t
= DECL_ARGUMENTS (decl1
);
12965 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
12967 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
12970 cp_function_chain
->x_current_class_ref
12971 = build_indirect_ref (t
, NULL_PTR
);
12972 cp_function_chain
->x_current_class_ptr
= t
;
12974 if (DECL_DESTRUCTOR_P (decl1
))
12975 current_in_charge_parm
= TREE_CHAIN (t
);
12978 if (DECL_INTERFACE_KNOWN (decl1
))
12980 tree ctx
= hack_decl_function_context (decl1
);
12982 if (DECL_NOT_REALLY_EXTERN (decl1
))
12983 DECL_EXTERNAL (decl1
) = 0;
12985 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12986 && TREE_PUBLIC (ctx
))
12987 /* This is a function in a local class in an extern inline
12989 comdat_linkage (decl1
);
12991 /* If this function belongs to an interface, it is public.
12992 If it belongs to someone else's interface, it is also external.
12993 This only affects inlines and template instantiations. */
12994 else if (interface_unknown
== 0
12995 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12996 || flag_alt_external_templates
))
12998 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12999 || processing_template_decl
)
13001 DECL_EXTERNAL (decl1
)
13003 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13004 && !DECL_VINDEX (decl1
)));
13006 /* For WIN32 we also want to put these in linkonce sections. */
13007 maybe_make_one_only (decl1
);
13010 DECL_EXTERNAL (decl1
) = 0;
13011 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13012 DECL_INTERFACE_KNOWN (decl1
) = 1;
13014 else if (interface_unknown
&& interface_only
13015 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13016 || flag_alt_external_templates
))
13018 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13019 interface, we will have interface_only set but not
13020 interface_known. In that case, we don't want to use the normal
13021 heuristics because someone will supply a #pragma implementation
13022 elsewhere, and deducing it here would produce a conflict. */
13023 comdat_linkage (decl1
);
13024 DECL_EXTERNAL (decl1
) = 0;
13025 DECL_INTERFACE_KNOWN (decl1
) = 1;
13026 DECL_DEFER_OUTPUT (decl1
) = 1;
13030 /* This is a definition, not a reference.
13031 So clear DECL_EXTERNAL. */
13032 DECL_EXTERNAL (decl1
) = 0;
13034 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13035 && ! DECL_INTERFACE_KNOWN (decl1
)
13036 /* Don't try to defer nested functions for now. */
13037 && ! hack_decl_function_context (decl1
))
13038 DECL_DEFER_OUTPUT (decl1
) = 1;
13040 DECL_INTERFACE_KNOWN (decl1
) = 1;
13043 if (doing_semantic_analysis_p ())
13046 current_binding_level
->parm_flag
= 1;
13050 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13052 if (!building_stmt_tree ())
13054 GNU_xref_function (decl1
, current_function_parms
);
13055 make_function_rtl (decl1
);
13058 /* Promote the value to int before returning it. */
13059 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13060 restype
= type_promotes_to (restype
);
13062 /* If this fcn was already referenced via a block-scope `extern' decl
13063 (or an implicit decl), propagate certain information about the usage. */
13064 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13065 TREE_ADDRESSABLE (decl1
) = 1;
13067 if (DECL_RESULT (decl1
) == NULL_TREE
)
13069 DECL_RESULT (decl1
)
13070 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13071 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13072 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13075 /* Allocate further tree nodes temporarily during compilation
13076 of this function only. Tiemann moved up here from bottom of fn. */
13077 /* If this is a nested function, then we must continue to allocate RTL
13078 on the permanent obstack in case we need to inline it later. */
13079 if (! hack_decl_function_context (decl1
))
13080 temporary_allocation ();
13082 /* Make sure that we always have a momntary obstack while we're in a
13088 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13089 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13090 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13091 else if (DECL_CONSTRUCTOR_P (decl1
))
13092 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13097 /* Called after store_parm_decls for a function-try-block. We need to update
13098 last_parm_cleanup_insn so that the base initializers for a constructor
13099 are run within this block, not before it. */
13102 expand_start_early_try_stmts ()
13104 expand_start_try_stmts ();
13105 last_parm_cleanup_insn
= get_last_insn ();
13108 /* Store the parameter declarations into the current function declaration.
13109 This is called after parsing the parameter declarations, before
13110 digesting the body of the function.
13112 Also install to binding contour return value identifier, if any. */
13115 store_parm_decls ()
13117 register tree fndecl
= current_function_decl
;
13118 register tree parm
;
13119 int parms_have_cleanups
= 0;
13120 tree cleanups
= NULL_TREE
;
13122 /* This is a list of types declared among parms in a prototype. */
13123 tree parmtags
= current_function_parm_tags
;
13125 /* This is a chain of any other decls that came in among the parm
13126 declarations. If a parm is declared with enum {foo, bar} x;
13127 then CONST_DECLs for foo and bar are put here. */
13128 tree nonparms
= NULL_TREE
;
13130 /* Create a binding level for the parms. */
13131 if (!building_stmt_tree ())
13132 expand_start_bindings (2);
13134 if (current_function_parms
)
13136 /* This case is when the function was defined with an ANSI prototype.
13137 The parms already have decls, so we need not do anything here
13138 except record them as in effect
13139 and complain if any redundant old-style parm decls were written. */
13141 tree specparms
= current_function_parms
;
13144 if (doing_semantic_analysis_p ())
13146 /* Must clear this because it might contain TYPE_DECLs declared
13148 storedecls (NULL_TREE
);
13150 /* If we're doing semantic analysis, then we'll call pushdecl
13151 for each of these. We must do them in reverse order so that
13152 they end in the correct forward order. */
13153 specparms
= nreverse (specparms
);
13156 for (parm
= specparms
; parm
; parm
= next
)
13158 next
= TREE_CHAIN (parm
);
13159 if (TREE_CODE (parm
) == PARM_DECL
)
13163 if (doing_semantic_analysis_p ())
13165 if (DECL_NAME (parm
) == NULL_TREE
13166 || TREE_CODE (TREE_TYPE (parm
)) != VOID_TYPE
)
13169 cp_error ("parameter `%D' declared void", parm
);
13172 if (! building_stmt_tree ()
13173 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13175 expand_decl (parm
);
13176 parms_have_cleanups
= 1;
13178 /* Keep track of the cleanups. */
13179 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13184 /* If we find an enum constant or a type tag,
13185 put it aside for the moment. */
13186 TREE_CHAIN (parm
) = NULL_TREE
;
13187 nonparms
= chainon (nonparms
, parm
);
13191 if (doing_semantic_analysis_p ())
13193 /* Get the decls in their original chain order
13194 and record in the function. This is all and only the
13195 PARM_DECLs that were pushed into scope by the loop above. */
13196 DECL_ARGUMENTS (fndecl
) = getdecls ();
13197 storetags (chainon (parmtags
, gettags ()));
13199 /* We built up the cleanups in reversed order. */
13200 cleanups
= nreverse (cleanups
);
13204 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13206 /* Now store the final chain of decls for the arguments
13207 as the decl-chain of the current lexical scope.
13208 Put the enumerators in as well, at the front so that
13209 DECL_ARGUMENTS is not modified. */
13210 if (doing_semantic_analysis_p ())
13211 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13213 /* Initialize the RTL code for the function. */
13214 DECL_SAVED_INSNS (fndecl
) = 0;
13215 if (! building_stmt_tree ())
13216 expand_function_start (fndecl
, parms_have_cleanups
);
13218 current_function_parms_stored
= 1;
13220 /* If this function is `main', emit a call to `__main'
13221 to run global initializers, etc. */
13222 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13223 expand_main_function ();
13225 /* Now that we have initialized the parms, we can start their
13226 cleanups. We cannot do this before, since expand_decl_cleanup
13227 should not be called before the parm can be used. */
13228 if (cleanups
&& !building_stmt_tree ())
13231 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
),
13232 TREE_VALUE (cleanups
)))
13233 cp_error ("parser lost in parsing declaration of `%D'",
13234 TREE_PURPOSE (cleanups
));
13236 cleanups
= TREE_CHAIN (cleanups
);
13239 /* Create a binding contour which can be used to catch
13240 cleanup-generated temporaries. Also, if the return value needs or
13241 has initialization, deal with that now. */
13242 if (parms_have_cleanups
)
13245 if (!building_stmt_tree ())
13246 expand_start_bindings (2);
13249 /* Do the starting of the exception specifications, if we have any. */
13250 if (flag_exceptions
&& !processing_template_decl
13251 && building_stmt_tree ()
13252 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13253 current_eh_spec_try_block
= expand_start_eh_spec ();
13255 last_parm_cleanup_insn
= get_last_insn ();
13256 last_dtor_insn
= get_last_insn ();
13259 /* Bind a name and initialization to the return value of
13260 the current function. */
13263 store_return_init (decl
)
13266 /* If this named return value comes in a register, put it in a
13267 pseudo-register. */
13268 if (DECL_REGISTER (decl
))
13270 original_result_rtx
= DECL_RTL (decl
);
13271 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13276 /* We have finished doing semantic analysis on DECL, but have not yet
13277 generated RTL for its body. Save away our current state, so that
13278 when we want to generate RTL later we know what to do. */
13281 save_function_data (decl
)
13284 struct language_function
*f
;
13286 /* Save the language-specific per-function data so that we can
13287 get it back when we really expand this function. */
13288 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13292 f
= ((struct language_function
*)
13293 xmalloc (sizeof (struct language_function
)));
13294 bcopy ((char *) cp_function_chain
, (char *) f
,
13295 sizeof (struct language_function
));
13296 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13298 /* Clear out the bits we don't need. */
13299 f
->x_base_init_list
= NULL_TREE
;
13300 f
->x_member_init_list
= NULL_TREE
;
13301 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13302 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13303 f
->x_last_dtor_insn
= NULL_RTX
;
13304 f
->x_last_parm_cleanup_insn
= NULL_RTX
;
13305 f
->x_result_rtx
= NULL_RTX
;
13306 f
->x_named_label_uses
= NULL
;
13307 f
->bindings
= NULL
;
13309 /* When we get back here again, we will be expanding. */
13310 f
->x_expanding_p
= 1;
13312 /* If we've already decided that we cannot inline this function, we
13313 must remember that fact when we actually go to expand the
13315 f
->cannot_inline
= current_function_cannot_inline
;
13318 /* At the end of every constructor we generate to code to return
13319 `this'. Do that now. */
13322 finish_constructor_body ()
13324 /* Any return from a constructor will end up here. */
13325 add_tree (build_min_nt (LABEL_STMT
, ctor_label
));
13327 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13328 generate the return, rather than a goto to CTOR_LABEL. */
13329 ctor_label
= NULL_TREE
;
13330 /* In check_return_expr we translate an empty return from a
13331 constructor to a return of `this'. */
13332 finish_return_stmt (NULL_TREE
);
13335 /* At the end of every destructor we generate code to restore virtual
13336 function tables to the values desired by base classes and to call
13337 to base class destructors. Do that now. */
13340 finish_destructor_body ()
13342 tree compound_stmt
;
13347 /* Create a block to contain all the extra code. */
13348 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13350 /* Any return from a destructor will end up here. */
13351 add_tree (build_min_nt (LABEL_STMT
, dtor_label
));
13353 /* Generate the code to call destructor on base class. If this
13354 destructor belongs to a class with virtual functions, then set
13355 the virtual function table pointer to represent the type of our
13358 /* This side-effect makes call to `build_delete' generate the code
13359 we have to have at the end of this destructor. `build_delete'
13360 will set the flag again. */
13361 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13363 /* These are two cases where we cannot delegate deletion. */
13364 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13365 || TYPE_GETS_REG_DELETE (current_class_type
))
13366 in_charge
= integer_zero_node
;
13368 in_charge
= current_in_charge_parm
;
13370 exprstmt
= build_delete (current_class_type
,
13373 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13376 if (exprstmt
!= error_mark_node
13377 && (TREE_CODE (exprstmt
) != NOP_EXPR
13378 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13379 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13381 if (exprstmt
!= void_zero_node
)
13382 /* Don't call `expand_expr_stmt' if we're not going to do
13383 anything, since -Wall will give a diagnostic. */
13384 finish_expr_stmt (exprstmt
);
13386 /* Run destructors for all virtual baseclasses. */
13387 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13389 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13390 tree if_stmt
= begin_if_stmt ();
13391 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13392 current_in_charge_parm
,
13398 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13400 tree vb
= get_vbase
13401 (BINFO_TYPE (vbases
),
13402 TYPE_BINFO (current_class_type
));
13404 (build_scoped_method_call
13405 (current_class_ref
, vb
, dtor_identifier
,
13406 build_expr_list (NULL_TREE
, integer_zero_node
)));
13408 vbases
= TREE_CHAIN (vbases
);
13411 finish_then_clause (if_stmt
);
13416 virtual_size
= c_sizeof (current_class_type
);
13418 /* At the end, call delete if that's what's requested. */
13420 /* FDIS sez: At the point of definition of a virtual destructor
13421 (including an implicit definition), non-placement operator delete
13422 shall be looked up in the scope of the destructor's class and if
13423 found shall be accessible and unambiguous.
13425 This is somewhat unclear, but I take it to mean that if the class
13426 only defines placement deletes we don't do anything here. So we
13427 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13428 they ever try to delete one of these. */
13429 if (TYPE_GETS_REG_DELETE (current_class_type
)
13430 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13434 exprstmt
= build_op_delete_call
13435 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13436 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13438 if_stmt
= begin_if_stmt ();
13439 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13440 current_in_charge_parm
,
13443 finish_expr_stmt (exprstmt
);
13444 finish_then_clause (if_stmt
);
13448 /* Close the block we started above. */
13449 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13452 /* Finish up a function declaration and compile that function
13453 all the way to assembler language output. The free the storage
13454 for the function definition.
13456 This is called after parsing the body of the function definition.
13457 LINENO is the current line number.
13459 FLAGS is a bitwise or of the following values:
13461 An extra call to poplevel (and expand_end_bindings) must be
13462 made to take care of the binding contour for the base
13463 initializers. This is only relevant for constructors.
13465 We just finished processing the body of an in-class inline
13466 function definition. (This processing will have taken place
13467 after the class definition is complete.) */
13470 finish_function (lineno
, flags
)
13474 register tree fndecl
= current_function_decl
;
13475 tree fntype
, ctype
= NULL_TREE
;
13476 /* Label to use if this function is supposed to return a value. */
13477 tree no_return_label
= NULL_TREE
;
13478 int call_poplevel
= (flags
& 1) != 0;
13479 int inclass_inline
= (flags
& 2) != 0;
13483 /* When we get some parse errors, we can end up without a
13484 current_function_decl, so cope. */
13485 if (fndecl
== NULL_TREE
)
13486 return error_mark_node
;
13488 nested
= function_depth
> 1;
13489 fntype
= TREE_TYPE (fndecl
);
13491 /* TREE_READONLY (fndecl) = 1;
13492 This caused &foo to be of type ptr-to-const-function
13493 which then got a warning when stored in a ptr-to-function variable. */
13495 /* This happens on strange parse errors. */
13496 if (! current_function_parms_stored
)
13499 store_parm_decls ();
13502 if (building_stmt_tree ())
13504 if (DECL_CONSTRUCTOR_P (fndecl
))
13506 finish_constructor_body ();
13510 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13511 finish_destructor_body ();
13512 else if (DECL_MAIN_P (fndecl
))
13514 /* Make it so that `main' always returns 0 by default. */
13516 finish_return_stmt (integer_one_node
);
13518 finish_return_stmt (integer_zero_node
);
13522 /* Finish dealing with exception specifiers. */
13523 if (flag_exceptions
&& !processing_template_decl
13524 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13525 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13526 (TREE_TYPE (current_function_decl
)),
13527 current_eh_spec_try_block
);
13531 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13533 tree ttype
= target_type (fntype
);
13536 if (IS_AGGR_TYPE (ttype
))
13537 /* Let debugger know it should output info for this type. */
13538 note_debug_info_needed (ttype
);
13540 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13542 ttype
= target_type (TREE_TYPE (parmdecl
));
13543 if (IS_AGGR_TYPE (ttype
))
13544 /* Let debugger know it should output info for this type. */
13545 note_debug_info_needed (ttype
);
13549 /* Clean house because we will need to reorder insns here. */
13550 do_pending_stack_adjust ();
13554 else if (DECL_CONSTRUCTOR_P (fndecl
))
13556 /* All subobjects have been fully constructed at this point. */
13557 end_protect_partials ();
13562 else if (return_label
!= NULL_RTX
13563 && flag_this_is_variable
<= 0
13564 && current_function_return_value
== NULL_TREE
13565 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13566 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13568 if (flag_exceptions
)
13569 expand_exception_blocks ();
13571 /* If this function is supposed to return a value, ensure that
13572 we do not fall into the cleanups by mistake. The end of our
13573 function will look like this:
13575 user code (may have return stmt somewhere)
13576 goto no_return_label
13581 NOTE_INSN_FUNCTION_END
13585 If the user omits a return stmt in the USER CODE section, we
13586 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13587 Otherwise, we won't. */
13588 if (no_return_label
)
13590 DECL_CONTEXT (no_return_label
) = fndecl
;
13591 DECL_INITIAL (no_return_label
) = error_mark_node
;
13592 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13593 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13594 expand_goto (no_return_label
);
13599 /* Remove the binding contour which is used
13600 to catch cleanup-generated temporaries. */
13601 expand_end_bindings (0, 0, 0);
13602 poplevel (0, 0, 0);
13604 /* Emit label at beginning of cleanup code for parameters. */
13605 emit_label (cleanup_label
);
13608 /* Get return value into register if that's where it's supposed
13610 if (original_result_rtx
)
13611 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13613 /* Finish building code that will trigger warnings if users forget
13614 to make their functions return values. */
13615 if (no_return_label
|| cleanup_label
)
13616 emit_jump (return_label
);
13617 if (no_return_label
)
13619 /* We don't need to call `expand_*_return' here because we
13620 don't need any cleanups here--this path of code is only
13621 for error checking purposes. */
13622 expand_label (no_return_label
);
13625 /* We hard-wired immediate_size_expand to zero in
13626 start_function. Expand_function_end will decrement this
13627 variable. So, we set the variable to one here, so that after
13628 the decrement it will remain zero. */
13629 immediate_size_expand
= 1;
13631 /* Generate rtl for function exit. */
13632 expand_function_end (input_filename
, lineno
, 1);
13635 /* We have to save this value here in case
13636 maybe_end_member_template_processing decides to pop all the
13637 template parameters. */
13638 expand_p
= !building_stmt_tree ();
13640 /* If we're saving up tree structure, tie off the function now. */
13642 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13644 /* This must come after expand_function_end because cleanups might
13645 have declarations (from inline functions) that need to go into
13646 this function's blocks. */
13647 if (doing_semantic_analysis_p ())
13649 if (current_binding_level
->parm_flag
!= 1)
13650 my_friendly_abort (122);
13651 poplevel (1, 0, 1);
13654 /* Remember that we were in class scope. */
13655 if (current_class_name
)
13656 ctype
= current_class_type
;
13658 /* Must mark the RESULT_DECL as being in this function. */
13659 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13661 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13662 to the FUNCTION_DECL node itself. */
13663 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13665 /* Undo the call to push_momentary in start_function. */
13668 /* Save away current state, if appropriate. */
13669 if (!expanding_p
&& !processing_template_decl
)
13670 save_function_data (fndecl
);
13676 int saved_flag_keep_inline_functions
=
13677 flag_keep_inline_functions
;
13679 /* So we can tell if jump_optimize sets it to 1. */
13682 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13683 && hack_decl_function_context (fndecl
))
13684 /* Trick rest_of_compilation into not deferring output of this
13685 function, even if it is inline, since the rtl_obstack for
13686 this function is the function_obstack of the enclosing
13687 function and will be deallocated when the enclosing
13688 function is gone. See save_tree_status. */
13689 flag_keep_inline_functions
= 1;
13691 /* Before we call rest_of_compilation (which will pop the
13692 CURRENT_FUNCTION), we must save these values. */
13693 returns_null
= current_function_returns_null
;
13694 returns_value
= current_function_returns_value
;
13696 /* If this is a nested function (like a template instantiation
13697 that we're compiling in the midst of compiling something
13698 else), push a new GC context. That will keep local variables
13699 on the stack from being collected while we're doing the
13700 compilation of this function. */
13701 if (function_depth
> 1)
13702 ggc_push_context ();
13704 /* Run the optimizers and output the assembler code for this
13706 if (DECL_ARTIFICIAL (fndecl
))
13708 /* Do we really *want* to inline this synthesized method? */
13710 int save_fif
= flag_inline_functions
;
13711 flag_inline_functions
= 1;
13713 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13714 will check our size. */
13715 DECL_INLINE (fndecl
) = 0;
13717 rest_of_compilation (fndecl
);
13718 flag_inline_functions
= save_fif
;
13721 rest_of_compilation (fndecl
);
13723 /* Undo the call to ggc_push_context above. */
13724 if (function_depth
> 1)
13725 ggc_pop_context ();
13727 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13729 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13731 /* Set DECL_EXTERNAL so that assemble_external will be called as
13732 necessary. We'll clear it again in finish_file. */
13733 if (! DECL_EXTERNAL (fndecl
))
13734 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13735 DECL_EXTERNAL (fndecl
) = 1;
13736 mark_inline_for_output (fndecl
);
13739 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13740 note_debug_info_needed (ctype
);
13742 returns_null
|= can_reach_end
;
13744 /* Since we don't normally go through c_expand_return for constructors,
13745 this normally gets the wrong value.
13746 Also, named return values have their return codes emitted after
13747 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13748 if (DECL_CONSTRUCTOR_P (fndecl
)
13749 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13752 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13753 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13754 else if ((warn_return_type
|| pedantic
)
13756 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13758 /* If this function returns non-void and control can drop through,
13760 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13762 /* With just -W, complain only if function returns both with
13763 and without a value. */
13764 else if (extra_warnings
&& returns_value
&& returns_null
)
13765 warning ("this function may return with or without a value");
13769 /* Since we never call rest_of_compilation, we never clear
13770 CURRENT_FUNCTION. Do so explicitly. */
13771 free_after_compilation (current_function
);
13772 current_function
= NULL
;
13775 /* If this is a in-class inline definition, we may have to pop the
13776 bindings for the template parameters that we added in
13777 maybe_begin_member_template_processing when start_function was
13779 if (inclass_inline
)
13780 maybe_end_member_template_processing ();
13782 /* Leave the scope of the class. */
13784 pop_nested_class ();
13788 /* Free all the tree nodes making up this function. */
13789 /* Switch back to allocating nodes permanently
13790 until we start another function. */
13792 permanent_allocation (1);
13794 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
))
13798 /* Stop pointing to the local nodes about to be freed. */
13799 /* But DECL_INITIAL must remain nonzero so we know this
13800 was an actual function definition. */
13801 DECL_INITIAL (fndecl
) = error_mark_node
;
13802 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13803 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13806 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13807 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13808 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13809 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13814 /* Let the error reporting routines know that we're outside a
13815 function. For a nested function, this value is used in
13816 pop_cp_function_context and then reset via pop_function_context. */
13817 current_function_decl
= NULL_TREE
;
13823 /* Create the FUNCTION_DECL for a function definition.
13824 DECLSPECS and DECLARATOR are the parts of the declaration;
13825 they describe the return type and the name of the function,
13826 but twisted together in a fashion that parallels the syntax of C.
13828 This function creates a binding context for the function body
13829 as well as setting up the FUNCTION_DECL in current_function_decl.
13831 Returns a FUNCTION_DECL on success.
13833 If the DECLARATOR is not suitable for a function (it defines a datum
13834 instead), we return 0, which tells yyparse to report a parse error.
13836 May return void_type_node indicating that this method is actually
13837 a friend. See grokfield for more details.
13839 Came here with a `.pushlevel' .
13841 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13842 CHANGES TO CODE IN `grokfield'. */
13845 start_method (declspecs
, declarator
, attrlist
)
13846 tree declarator
, declspecs
, attrlist
;
13848 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13851 /* Something too ugly to handle. */
13852 if (fndecl
== NULL_TREE
)
13855 /* Pass friends other than inline friend functions back. */
13856 if (fndecl
== void_type_node
)
13859 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13860 /* Not a function, tell parser to report parse error. */
13863 if (DECL_IN_AGGR_P (fndecl
))
13865 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13867 if (DECL_CONTEXT (fndecl
)
13868 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13869 cp_error ("`%D' is already defined in class %s", fndecl
,
13870 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13872 return void_type_node
;
13875 check_template_shadow (fndecl
);
13877 DECL_THIS_INLINE (fndecl
) = 1;
13879 if (flag_default_inline
)
13880 DECL_INLINE (fndecl
) = 1;
13882 /* We process method specializations in finish_struct_1. */
13883 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13884 fndecl
= push_template_decl (fndecl
);
13886 /* We read in the parameters on the maybepermanent_obstack,
13887 but we won't be getting back to them until after we
13888 may have clobbered them. So the call to preserve_data
13889 will keep them safe. */
13892 if (! DECL_FRIEND_P (fndecl
))
13894 if (TREE_CHAIN (fndecl
))
13896 fndecl
= copy_node (fndecl
);
13897 TREE_CHAIN (fndecl
) = NULL_TREE
;
13900 if (DECL_CONSTRUCTOR_P (fndecl
))
13902 if (! grok_ctor_properties (current_class_type
, fndecl
))
13903 return void_type_node
;
13905 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13906 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13909 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13911 /* Make a place for the parms */
13913 current_binding_level
->parm_flag
= 1;
13915 DECL_IN_AGGR_P (fndecl
) = 1;
13919 /* Go through the motions of finishing a function definition.
13920 We don't compile this method until after the whole class has
13923 FINISH_METHOD must return something that looks as though it
13924 came from GROKFIELD (since we are defining a method, after all).
13926 This is called after parsing the body of the function definition.
13927 STMTS is the chain of statements that makes up the function body.
13929 DECL is the ..._DECL that `start_method' provided. */
13932 finish_method (decl
)
13935 register tree fndecl
= decl
;
13938 register tree link
;
13940 if (decl
== void_type_node
)
13943 old_initial
= DECL_INITIAL (fndecl
);
13945 /* Undo the level for the parms (from start_method).
13946 This is like poplevel, but it causes nothing to be
13947 saved. Saving information here confuses symbol-table
13948 output routines. Besides, this information will
13949 be correctly output when this method is actually
13952 /* Clear out the meanings of the local variables of this level;
13953 also record in each decl which block it belongs to. */
13955 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13957 if (DECL_NAME (link
) != NULL_TREE
)
13958 pop_binding (DECL_NAME (link
), link
);
13959 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13960 DECL_CONTEXT (link
) = NULL_TREE
;
13963 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13964 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13965 current_binding_level
->parm_flag
,
13966 current_binding_level
->keep
);
13968 poplevel (0, 0, 0);
13970 DECL_INITIAL (fndecl
) = old_initial
;
13972 /* We used to check if the context of FNDECL was different from
13973 current_class_type as another way to get inside here. This didn't work
13974 for String.cc in libg++. */
13975 if (DECL_FRIEND_P (fndecl
))
13977 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13978 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13979 decl
= void_type_node
;
13985 /* Called when a new struct TYPE is defined.
13986 If this structure or union completes the type of any previous
13987 variable declaration, lay it out and output its rtl. */
13990 hack_incomplete_structures (type
)
13995 if (current_binding_level
->incomplete
== NULL_TREE
)
13998 if (!type
) /* Don't do this for class templates. */
14001 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14003 tree decl
= TREE_VALUE (*list
);
14004 if ((decl
&& TREE_TYPE (decl
) == type
)
14005 || (TREE_TYPE (decl
)
14006 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14007 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14009 int toplevel
= toplevel_bindings_p ();
14010 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14011 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14012 layout_type (TREE_TYPE (decl
));
14013 layout_decl (decl
, 0);
14014 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14018 expand_decl (decl
);
14019 cleanup
= maybe_build_cleanup (decl
);
14020 expand_decl_init (decl
);
14021 if (! expand_decl_cleanup (decl
, cleanup
))
14022 cp_error ("parser lost in parsing declaration of `%D'",
14025 *list
= TREE_CHAIN (*list
);
14028 list
= &TREE_CHAIN (*list
);
14032 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14033 See build_delete for information about AUTO_DELETE.
14035 Don't build these on the momentary obstack; they must live
14036 the life of the binding contour. */
14039 maybe_build_cleanup_1 (decl
, auto_delete
)
14040 tree decl
, auto_delete
;
14042 tree type
= TREE_TYPE (decl
);
14043 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14045 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14048 if (TREE_CODE (decl
) != PARM_DECL
)
14049 temp
= suspend_momentary ();
14051 if (TREE_CODE (type
) == ARRAY_TYPE
)
14055 mark_addressable (decl
);
14056 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14059 /* Optimize for space over speed here. */
14060 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14061 || flag_expensive_optimizations
)
14062 flags
|= LOOKUP_NONVIRTUAL
;
14064 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14066 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14067 && ! TYPE_HAS_DESTRUCTOR (type
))
14068 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14069 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14071 if (TREE_CODE (decl
) != PARM_DECL
)
14072 resume_momentary (temp
);
14079 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
14082 build_target_expr (decl
, value
)
14088 t
= build (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
14089 maybe_build_cleanup (decl
), NULL_TREE
);
14090 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
14091 ignore the TARGET_EXPR. If there really turn out to be no
14092 side-effects, then the optimizer should be able to get rid of
14093 whatever code is generated anyhow. */
14094 TREE_SIDE_EFFECTS (t
) = 1;
14099 /* If DECL is of a type which needs a cleanup, build that cleanup
14100 here. The cleanup does free the storage with a call to delete. */
14103 maybe_build_cleanup_and_delete (decl
)
14106 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14109 /* If DECL is of a type which needs a cleanup, build that cleanup
14110 here. The cleanup does not free the storage with a call a delete. */
14113 maybe_build_cleanup (decl
)
14116 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14119 /* Expand a C++ expression at the statement level.
14120 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14121 The C++ type checker should get all of these out when
14122 expressions are combined with other, type-providing, expressions,
14123 leaving only orphan expressions, such as:
14125 &class::bar; / / takes its address, but does nothing with it. */
14128 cplus_expand_expr_stmt (exp
)
14131 if (stmts_are_full_exprs_p
)
14132 exp
= convert_to_void (exp
, "statement");
14135 /* We should do this eventually, but right now this causes regex.o from
14136 libg++ to miscompile, and tString to core dump. */
14137 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14140 /* If we don't do this, we end up down inside expand_expr
14141 trying to do TYPE_MODE on the ERROR_MARK, and really
14142 go outside the bounds of the type. */
14143 if (exp
!= error_mark_node
)
14144 expand_expr_stmt (break_out_cleanups (exp
));
14147 /* When a stmt has been parsed, this function is called. */
14152 /* Always assume this statement was not an expression statement. If
14153 it actually was an expression statement, its our callers
14154 responsibility to fix this up. */
14155 last_expr_type
= NULL_TREE
;
14158 /* Change a static member function definition into a FUNCTION_TYPE, instead
14159 of the METHOD_TYPE that we create when it's originally parsed.
14161 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14162 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14163 other decls. Either pass the addresses of local variables or NULL. */
14166 revert_static_member_fn (decl
, fn
, argtypes
)
14167 tree
*decl
, *fn
, *argtypes
;
14170 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14171 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14173 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14174 != TYPE_UNQUALIFIED
)
14175 cp_error ("static member function `%#D' declared with type qualifiers",
14178 args
= TREE_CHAIN (args
);
14179 tmp
= build_function_type (TREE_TYPE (function
), args
);
14180 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14181 tmp
= build_exception_variant (tmp
,
14182 TYPE_RAISES_EXCEPTIONS (function
));
14183 TREE_TYPE (*decl
) = tmp
;
14184 if (DECL_ARGUMENTS (*decl
))
14185 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14186 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14193 /* Initialize the variables used during compilation of a C++
14197 push_cp_function_context (f
)
14198 struct function
*f
;
14200 struct language_function
*p
14201 = ((struct language_function
*)
14202 xcalloc (1, sizeof (struct language_function
)));
14205 /* It takes an explicit call to expand_body to generate RTL for a
14209 /* Whenever we start a new function, we destroy temporaries in the
14211 stmts_are_full_exprs_p
= 1;
14214 /* Free the language-specific parts of F, now that we've finished
14215 compiling the function. */
14218 pop_cp_function_context (f
)
14219 struct function
*f
;
14221 free (f
->language
);
14225 /* Mark P for GC. */
14228 mark_lang_function (p
)
14229 struct language_function
*p
;
14234 ggc_mark_tree (p
->x_named_labels
);
14235 ggc_mark_tree (p
->x_ctor_label
);
14236 ggc_mark_tree (p
->x_dtor_label
);
14237 ggc_mark_tree (p
->x_base_init_list
);
14238 ggc_mark_tree (p
->x_member_init_list
);
14239 ggc_mark_tree (p
->x_current_class_ptr
);
14240 ggc_mark_tree (p
->x_current_class_ref
);
14241 ggc_mark_tree (p
->x_eh_spec_try_block
);
14242 ggc_mark_tree (p
->x_scope_stmt_stack
);
14244 ggc_mark_rtx (p
->x_last_dtor_insn
);
14245 ggc_mark_rtx (p
->x_last_parm_cleanup_insn
);
14246 ggc_mark_rtx (p
->x_result_rtx
);
14248 mark_stmt_tree (&p
->x_stmt_tree
);
14249 mark_binding_level (&p
->bindings
);
14252 /* Mark the language-specific data in F for GC. */
14255 mark_cp_function_context (f
)
14256 struct function
*f
;
14258 mark_lang_function (f
->language
);
14264 return function_depth
!= 0;
14269 lang_mark_false_label_stack (l
)
14270 struct label_node
*l
;
14272 /* C++ doesn't use false_label_stack. It better be NULL. */
14273 my_friendly_assert (l
== NULL
, 19990904);
14280 enum tree_code code
= TREE_CODE (t
);
14281 if (code
== IDENTIFIER_NODE
)
14283 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14284 struct lang_id2
*li2
= li
->x
;
14285 ggc_mark_tree (li
->namespace_bindings
);
14286 ggc_mark_tree (li
->bindings
);
14287 ggc_mark_tree (li
->class_value
);
14288 ggc_mark_tree (li
->class_template_info
);
14292 ggc_mark_tree (li2
->label_value
);
14293 ggc_mark_tree (li2
->implicit_decl
);
14294 ggc_mark_tree (li2
->error_locus
);
14297 else if (code
== CPLUS_BINDING
)
14299 if (BINDING_HAS_LEVEL_P (t
))
14300 mark_binding_level (&BINDING_LEVEL (t
));
14302 ggc_mark_tree (BINDING_SCOPE (t
));
14303 ggc_mark_tree (BINDING_VALUE (t
));
14305 else if (code
== OVERLOAD
)
14306 ggc_mark_tree (OVL_FUNCTION (t
));
14307 else if (code
== TEMPLATE_PARM_INDEX
)
14308 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14309 else if (TREE_CODE_CLASS (code
) == 'd')
14311 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14316 if (!DECL_GLOBAL_CTOR_P (t
) && !DECL_GLOBAL_DTOR_P (t
))
14317 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14318 ggc_mark_tree (ld
->decl_flags
.context
);
14319 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14320 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14321 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14323 ggc_mark_tree (ld
->main_decl_variant
);
14324 ggc_mark_tree (ld
->befriending_classes
);
14325 ggc_mark_tree (ld
->saved_tree
);
14326 if (TREE_CODE (t
) == TYPE_DECL
)
14327 ggc_mark_tree (ld
->u
.sorted_fields
);
14328 else if (TREE_CODE (t
) == FUNCTION_DECL
14329 && !DECL_PENDING_INLINE_P (t
))
14330 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14334 else if (TREE_CODE_CLASS (code
) == 't')
14336 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14338 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14339 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14342 ggc_mark_tree (lt
->vfields
);
14343 ggc_mark_tree (lt
->vbases
);
14344 ggc_mark_tree (lt
->tags
);
14345 ggc_mark_tree (lt
->search_slot
);
14346 ggc_mark_tree (lt
->size
);
14347 ggc_mark_tree (lt
->abstract_virtuals
);
14348 ggc_mark_tree (lt
->friend_classes
);
14349 ggc_mark_tree (lt
->rtti
);
14350 ggc_mark_tree (lt
->methods
);
14351 ggc_mark_tree (lt
->template_info
);
14352 ggc_mark_tree (lt
->befriending_classes
);
14355 /* In the case of pointer-to-member function types, the
14356 TYPE_LANG_SPECIFIC is really just a tree. */
14357 ggc_mark_tree ((tree
) lt
);