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;
828 /* For a binding between a name and an entity at a block scope,
829 this is the `struct binding_level' for the block. */
830 #define BINDING_LEVEL(NODE) \
831 (((struct tree_binding*)NODE)->scope.level)
833 /* Make DECL the innermost binding for ID. The LEVEL is the binding
834 level at which this declaration is being bound. */
837 push_binding (id
, decl
, level
)
840 struct binding_level
* level
;
844 binding
= make_node (CPLUS_BINDING
);
846 /* Now, fill in the binding information. */
847 BINDING_VALUE (binding
) = decl
;
848 BINDING_TYPE (binding
) = NULL_TREE
;
849 BINDING_LEVEL (binding
) = level
;
850 INHERITED_VALUE_BINDING_P (binding
) = 0;
851 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
852 BINDING_HAS_LEVEL_P (binding
) = 1;
854 /* And put it on the front of the list of bindings for ID. */
855 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
856 IDENTIFIER_BINDING (id
) = binding
;
859 /* ID is already bound in the current scope. But, DECL is an
860 additional binding for ID in the same scope. This is the `struct
861 stat' hack whereby a non-typedef class-name or enum-name can be
862 bound at the same level as some other kind of entity. It's the
863 responsibility of the caller to check that inserting this name is
864 legal here. Returns nonzero if the new binding was successful. */
866 add_binding (id
, decl
)
870 tree binding
= IDENTIFIER_BINDING (id
);
873 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
874 /* The new name is the type name. */
875 BINDING_TYPE (binding
) = decl
;
876 else if (!BINDING_VALUE (binding
))
877 /* This situation arises when push_class_level_binding moves an
878 inherited type-binding out of the way to make room for a new
880 BINDING_VALUE (binding
) = decl
;
881 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
882 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
884 /* The old binding was a type name. It was placed in
885 BINDING_VALUE because it was thought, at the point it was
886 declared, to be the only entity with such a name. Move the
887 type name into the type slot; it is now hidden by the new
889 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
890 BINDING_VALUE (binding
) = decl
;
891 INHERITED_VALUE_BINDING_P (binding
) = 0;
893 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
894 && TREE_CODE (decl
) == TYPE_DECL
895 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
896 && same_type_p (TREE_TYPE (decl
),
897 TREE_TYPE (BINDING_VALUE (binding
))))
898 /* We have two typedef-names, both naming the same type to have
899 the same name. This is OK because of:
903 In a given scope, a typedef specifier can be used to redefine
904 the name of any type declared in that scope to refer to the
905 type to which it already refers. */
909 cp_error ("declaration of `%#D'", decl
);
910 cp_error_at ("conflicts with previous declaration `%#D'",
911 BINDING_VALUE (binding
));
918 /* Add DECL to the list of things declared in B. */
921 add_decl_to_level (decl
, b
)
923 struct binding_level
*b
;
925 /* We build up the list in reverse order, and reverse it later if
927 TREE_CHAIN (decl
) = b
->names
;
931 /* Bind DECL to ID in the current_binding_level, assumed to be a local
932 binding level. If PUSH_USING is set in FLAGS, we know that DECL
933 doesn't really belong to this binding level, that it got here
934 through a using-declaration. */
937 push_local_binding (id
, decl
, flags
)
942 struct binding_level
*b
;
944 /* Skip over any local classes. This makes sense if we call
945 push_local_binding with a friend decl of a local class. */
946 b
= current_binding_level
;
947 while (b
->parm_flag
== 2)
950 if (lookup_name_current_level (id
))
952 /* Supplement the existing binding. */
953 if (!add_binding (id
, decl
))
954 /* It didn't work. Something else must be bound at this
955 level. Do not add DECL to the list of things to pop
960 /* Create a new binding. */
961 push_binding (id
, decl
, b
);
963 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
964 /* We must put the OVERLOAD into a TREE_LIST since the
965 TREE_CHAIN of an OVERLOAD is already used. Similarly for
966 decls that got here through a using-declaration. */
967 decl
= build_tree_list (NULL_TREE
, decl
);
969 /* And put DECL on the list of things declared by the current
971 add_decl_to_level (decl
, b
);
974 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
975 binding was successful. */
978 push_class_binding (id
, decl
)
983 tree binding
= IDENTIFIER_BINDING (id
);
986 /* Note that we declared this value so that we can issue an error if
987 this an illegal redeclaration of a name already used for some
989 note_name_declared_in_class (id
, decl
);
991 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
992 /* Supplement the existing binding. */
993 result
= add_binding (id
, decl
);
995 /* Create a new binding. */
996 push_binding (id
, decl
, class_binding_level
);
998 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
999 class-level declaration. Note that we do not use DECL here
1000 because of the possibility of the `struct stat' hack; if DECL is
1001 a class-name or enum-name we might prefer a field-name, or some
1003 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1005 /* If this is a binding from a base class, mark it as such. */
1006 binding
= IDENTIFIER_BINDING (id
);
1007 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1009 /* Any implicit typename must be from a base-class. The
1010 context for an implicit typename declaration is always
1011 the derived class in which the lookup was done, so the checks
1012 based on the context of DECL below will not trigger. */
1013 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1014 INHERITED_VALUE_BINDING_P (binding
) = 1;
1017 if (TREE_CODE (decl
) == OVERLOAD
)
1018 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
1021 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1023 context
= DECL_REAL_CONTEXT (decl
);
1026 if (is_properly_derived_from (current_class_type
, context
))
1027 INHERITED_VALUE_BINDING_P (binding
) = 1;
1029 INHERITED_VALUE_BINDING_P (binding
) = 0;
1032 else if (BINDING_VALUE (binding
) == decl
)
1033 /* We only encounter a TREE_LIST when push_class_decls detects an
1034 ambiguity. Such an ambiguity can be overridden by a definition
1036 INHERITED_VALUE_BINDING_P (binding
) = 1;
1041 /* Remove the binding for DECL which should be the innermost binding
1045 pop_binding (id
, decl
)
1051 if (id
== NULL_TREE
)
1052 /* It's easiest to write the loops that call this function without
1053 checking whether or not the entities involved have names. We
1054 get here for such an entity. */
1057 /* Get the innermost binding for ID. */
1058 binding
= IDENTIFIER_BINDING (id
);
1060 /* The name should be bound. */
1061 my_friendly_assert (binding
!= NULL_TREE
, 0);
1063 /* The DECL will be either the ordinary binding or the type
1064 binding for this identifier. Remove that binding. */
1065 if (BINDING_VALUE (binding
) == decl
)
1066 BINDING_VALUE (binding
) = NULL_TREE
;
1067 else if (BINDING_TYPE (binding
) == decl
)
1068 BINDING_TYPE (binding
) = NULL_TREE
;
1070 my_friendly_abort (0);
1072 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1073 /* We're completely done with the innermost binding for this
1074 identifier. Unhook it from the list of bindings. */
1075 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1078 /* When a label goes out of scope, check to see if that label was used
1079 in a valid manner, and issue any appropriate warnings or errors. */
1085 tree label
= TREE_VALUE (link
);
1087 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1089 if (DECL_INITIAL (label
) == NULL_TREE
)
1091 cp_error_at ("label `%D' used but not defined", label
);
1092 /* Avoid crashing later. */
1093 define_label (input_filename
, 1, DECL_NAME (label
));
1095 else if (warn_unused
&& !TREE_USED (label
))
1096 cp_warning_at ("label `%D' defined but not used", label
);
1099 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1102 /* At the end of a function, all labels declared within the fucntion
1103 go out of scope. BLOCK is the top-level block for the
1112 /* Clear out the definitions of all label names, since their scopes
1114 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1117 /* Put the labels into the "variables" of the top-level block,
1118 so debugger can see them. */
1119 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1120 BLOCK_VARS (block
) = TREE_VALUE (link
);
1123 named_labels
= NULL_TREE
;
1126 /* Exit a binding level.
1127 Pop the level off, and restore the state of the identifier-decl mappings
1128 that were in effect when this level was entered.
1130 If KEEP == 1, this level had explicit declarations, so
1131 and create a "block" (a BLOCK node) for the level
1132 to record its declarations and subblocks for symbol table output.
1134 If FUNCTIONBODY is nonzero, this level is the body of a function,
1135 so create a block as if KEEP were set and also clear out all
1138 If REVERSE is nonzero, reverse the order of decls before putting
1139 them into the BLOCK. */
1142 poplevel (keep
, reverse
, functionbody
)
1148 /* The chain of decls was accumulated in reverse order.
1149 Put it into forward order, just for cleanliness. */
1151 int tmp
= functionbody
;
1152 int real_functionbody
;
1155 tree block
= NULL_TREE
;
1157 int block_previously_created
;
1158 int leaving_for_scope
;
1160 if (current_function
&& !doing_semantic_analysis_p ())
1163 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1166 real_functionbody
= (current_binding_level
->keep
== 2
1167 ? ((functionbody
= 0), tmp
) : functionbody
);
1168 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1169 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1171 my_friendly_assert (!current_binding_level
->class_shadowed
,
1174 /* We used to use KEEP == 2 to indicate that the new block should go
1175 at the beginning of the list of blocks at this binding level,
1176 rather than the end. This hack is no longer used. */
1177 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1179 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1180 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1181 current_binding_level
->parm_flag
,
1182 current_binding_level
->keep
);
1184 if (current_binding_level
->keep
== 1)
1187 /* Get the decls in the order they were written.
1188 Usually current_binding_level->names is in reverse order.
1189 But parameter decls were previously put in forward order. */
1192 current_binding_level
->names
1193 = decls
= nreverse (current_binding_level
->names
);
1195 decls
= current_binding_level
->names
;
1197 /* Output any nested inline functions within this block
1198 if they weren't already output. */
1200 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1201 if (TREE_CODE (decl
) == FUNCTION_DECL
1202 && ! TREE_ASM_WRITTEN (decl
)
1203 && DECL_INITIAL (decl
) != NULL_TREE
1204 && TREE_ADDRESSABLE (decl
)
1205 && decl_function_context (decl
) == current_function_decl
)
1207 /* If this decl was copied from a file-scope decl
1208 on account of a block-scope extern decl,
1209 propagate TREE_ADDRESSABLE to the file-scope decl. */
1210 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1211 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1214 push_function_context ();
1215 output_inline_function (decl
);
1216 pop_function_context ();
1220 /* If there were any declarations or structure tags in that level,
1221 or if this level is a function body,
1222 create a BLOCK to record them for the life of this function. */
1225 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1226 if (block_previously_created
)
1227 block
= current_binding_level
->this_block
;
1228 else if (keep
== 1 || functionbody
)
1229 block
= make_node (BLOCK
);
1230 if (block
!= NULL_TREE
)
1232 if (block_previously_created
)
1234 if (decls
|| tags
|| subblocks
)
1236 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1237 warning ("internal compiler error: debugging info corrupted");
1239 BLOCK_VARS (block
) = decls
;
1240 BLOCK_TYPE_TAGS (block
) = tags
;
1242 /* We can have previous subblocks and new subblocks when
1243 doing fixup_gotos with complex cleanups. We chain the new
1244 subblocks onto the end of any pre-existing subblocks. */
1245 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1248 /* If we created the block earlier on, and we are just
1249 diddling it now, then it already should have a proper
1250 BLOCK_END_NOTE value associated with it. */
1254 BLOCK_VARS (block
) = decls
;
1255 BLOCK_TYPE_TAGS (block
) = tags
;
1256 BLOCK_SUBBLOCKS (block
) = subblocks
;
1257 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1259 remember_end_note (block
);
1263 /* In each subblock, record that this is its superior. */
1266 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1267 BLOCK_SUPERCONTEXT (link
) = block
;
1269 /* We still support the old for-scope rules, whereby the variables
1270 in a for-init statement were in scope after the for-statement
1271 ended. We only use the new rules in flag_new_for_scope is
1274 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1276 /* Remove declarations for all the DECLs in this level. */
1277 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1279 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1282 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1286 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1288 ns_binding
= NULL_TREE
;
1291 && (BINDING_LEVEL (outer_binding
)
1292 == current_binding_level
->level_chain
))
1293 /* We have something like:
1298 and we are leaving the `for' scope. There's no reason to
1299 keep the binding of the inner `i' in this case. */
1300 pop_binding (DECL_NAME (link
), link
);
1301 else if ((outer_binding
1302 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1305 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1306 /* Here, we have something like:
1314 We must pop the for-scope binding so we know what's a
1315 type and what isn't. */
1316 pop_binding (DECL_NAME (link
), link
);
1319 /* Mark this VAR_DECL as dead so that we can tell we left it
1320 there only for backward compatibility. */
1321 DECL_DEAD_FOR_LOCAL (link
) = 1;
1323 /* Keep track of what should of have happenned when we
1324 popped the binding. */
1325 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1326 DECL_SHADOWED_FOR_VAR (link
)
1327 = BINDING_VALUE (outer_binding
);
1329 /* Add it to the list of dead variables in the next
1330 outermost binding to that we can remove these when we
1331 leave that binding. */
1332 current_binding_level
->level_chain
->dead_vars_from_for
1333 = tree_cons (NULL_TREE
, link
,
1334 current_binding_level
->level_chain
->
1335 dead_vars_from_for
);
1337 /* Although we don't pop the CPLUS_BINDING, we do clear
1338 its BINDING_LEVEL since the level is going away now. */
1339 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1345 /* Remove the binding. */
1347 if (TREE_CODE (decl
) == TREE_LIST
)
1348 decl
= TREE_VALUE (decl
);
1349 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1350 pop_binding (DECL_NAME (decl
), decl
);
1351 else if (TREE_CODE (decl
) == OVERLOAD
)
1352 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1354 my_friendly_abort (0);
1358 /* Remove declarations for any `for' variables from inner scopes
1359 that we kept around. */
1360 for (link
= current_binding_level
->dead_vars_from_for
;
1361 link
; link
= TREE_CHAIN (link
))
1362 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1364 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1365 for (link
= current_binding_level
->type_shadowed
;
1366 link
; link
= TREE_CHAIN (link
))
1367 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1369 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1370 for (link
= current_binding_level
->shadowed_labels
;
1372 link
= TREE_CHAIN (link
))
1375 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1376 list if a `using' declaration put them there. The debugging
1377 back-ends won't understand OVERLOAD, so we remove them here.
1378 Because the BLOCK_VARS are (temporarily) shared with
1379 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1380 popped all the bindings. */
1385 for (d
= &BLOCK_VARS (block
); *d
; )
1387 if (TREE_CODE (*d
) == TREE_LIST
)
1388 *d
= TREE_CHAIN (*d
);
1390 d
= &TREE_CHAIN (*d
);
1394 /* If the level being exited is the top level of a function,
1395 check over all the labels. */
1398 /* Since this is the top level block of a function, the vars are
1399 the function's parameters. Don't leave them in the BLOCK
1400 because they are found in the FUNCTION_DECL instead. */
1401 BLOCK_VARS (block
) = 0;
1405 /* Any uses of undefined labels now operate under constraints
1406 of next binding contour. */
1407 if (current_function
)
1409 struct binding_level
*level_chain
;
1410 level_chain
= current_binding_level
->level_chain
;
1413 struct named_label_list
*labels
;
1414 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1415 if (labels
->binding_level
== current_binding_level
)
1417 labels
->binding_level
= level_chain
;
1418 labels
->names_in_scope
= level_chain
->names
;
1423 tmp
= current_binding_level
->keep
;
1425 pop_binding_level ();
1427 DECL_INITIAL (current_function_decl
) = block
;
1430 if (!block_previously_created
)
1431 current_binding_level
->blocks
1432 = chainon (current_binding_level
->blocks
, block
);
1434 /* If we did not make a block for the level just exited,
1435 any blocks made for inner levels
1436 (since they cannot be recorded as subblocks in that level)
1437 must be carried forward so they will later become subblocks
1438 of something else. */
1440 current_binding_level
->blocks
1441 = chainon (current_binding_level
->blocks
, subblocks
);
1443 /* Take care of compiler's internal binding structures. */
1446 add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1447 /* Each and every BLOCK node created here in `poplevel' is important
1448 (e.g. for proper debugging information) so if we created one
1449 earlier, mark it as "used". */
1451 TREE_USED (block
) = 1;
1452 block
= poplevel (keep
, reverse
, functionbody
);
1455 /* Each and every BLOCK node created here in `poplevel' is important
1456 (e.g. for proper debugging information) so if we created one
1457 earlier, mark it as "used". */
1459 TREE_USED (block
) = 1;
1463 /* Delete the node BLOCK from the current binding level.
1464 This is used for the block inside a stmt expr ({...})
1465 so that the block can be reinserted where appropriate. */
1468 delete_block (block
)
1472 if (current_binding_level
->blocks
== block
)
1473 current_binding_level
->blocks
= TREE_CHAIN (block
);
1474 for (t
= current_binding_level
->blocks
; t
;)
1476 if (TREE_CHAIN (t
) == block
)
1477 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1481 TREE_CHAIN (block
) = NULL_TREE
;
1482 /* Clear TREE_USED which is always set by poplevel.
1483 The flag is set again if insert_block is called. */
1484 TREE_USED (block
) = 0;
1487 /* Insert BLOCK at the end of the list of subblocks of the
1488 current binding level. This is used when a BIND_EXPR is expanded,
1489 to handle the BLOCK node inside the BIND_EXPR. */
1492 insert_block (block
)
1495 TREE_USED (block
) = 1;
1496 current_binding_level
->blocks
1497 = chainon (current_binding_level
->blocks
, block
);
1500 /* Set the BLOCK node for the innermost scope
1501 (the one we are currently in). */
1505 register tree block
;
1507 current_binding_level
->this_block
= block
;
1510 /* Do a pushlevel for class declarations. */
1515 register struct binding_level
*newlevel
;
1517 /* Reuse or create a struct for this binding level. */
1518 #if defined(DEBUG_CP_BINDING_LEVELS)
1520 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1521 if (free_binding_level
)
1522 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1524 newlevel
= free_binding_level
;
1525 free_binding_level
= free_binding_level
->level_chain
;
1528 newlevel
= make_binding_level ();
1530 #if defined(DEBUG_CP_BINDING_LEVELS)
1532 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1534 push_binding_level (newlevel
, 0, 0);
1536 class_binding_level
= current_binding_level
;
1537 class_binding_level
->parm_flag
= 2;
1540 /* ...and a poplevel for class declarations. */
1545 register struct binding_level
*level
= class_binding_level
;
1548 my_friendly_assert (level
!= 0, 354);
1550 /* If we're leaving a toplevel class, don't bother to do the setting
1551 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1552 shouldn't even be used when current_class_type isn't set, and second,
1553 if we don't touch it here, we're able to use the cache effect if the
1554 next time we're entering a class scope, it is the same class. */
1555 if (current_class_depth
!= 1)
1557 struct binding_level
* b
;
1559 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1560 for (shadowed
= level
->class_shadowed
;
1562 shadowed
= TREE_CHAIN (shadowed
))
1563 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1565 /* Find the next enclosing class, and recreate
1566 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1567 b
= level
->level_chain
;
1568 while (b
&& b
->parm_flag
!= 2)
1572 for (shadowed
= b
->class_shadowed
;
1574 shadowed
= TREE_CHAIN (shadowed
))
1578 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1579 while (t
&& BINDING_LEVEL (t
) != b
)
1583 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1584 = BINDING_VALUE (t
);
1588 /* Remember to save what IDENTIFIER's were bound in this scope so we
1589 can recover from cache misses. */
1591 previous_class_type
= current_class_type
;
1592 previous_class_values
= class_binding_level
->class_shadowed
;
1594 for (shadowed
= level
->type_shadowed
;
1596 shadowed
= TREE_CHAIN (shadowed
))
1597 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1599 /* Remove the bindings for all of the class-level declarations. */
1600 for (shadowed
= level
->class_shadowed
;
1602 shadowed
= TREE_CHAIN (shadowed
))
1603 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1605 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1606 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1607 class_binding_level
->parm_flag
,
1608 class_binding_level
->keep
);
1610 /* Now, pop out of the binding level which we created up in the
1611 `pushlevel_class' routine. */
1612 #if defined(DEBUG_CP_BINDING_LEVELS)
1614 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1616 pop_binding_level ();
1619 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1620 for any names in enclosing classes. */
1623 clear_identifier_class_values ()
1627 if (!class_binding_level
)
1630 for (t
= class_binding_level
->class_shadowed
;
1633 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1636 /* Returns non-zero if T is a virtual function table. */
1639 vtable_decl_p (t
, data
)
1641 void *data ATTRIBUTE_UNUSED
;
1643 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1646 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1650 vtype_decl_p (t
, data
)
1652 void *data ATTRIBUTE_UNUSED
;
1654 return (TREE_CODE (t
) == TYPE_DECL
1655 && TREE_TYPE (t
) != error_mark_node
1656 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1657 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1660 /* Return the declarations that are members of the namespace NS. */
1663 cp_namespace_decls (ns
)
1666 return NAMESPACE_LEVEL (ns
)->names
;
1669 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1670 itself, calling F for each. The DATA is passed to F as well. */
1673 walk_namespaces_r (namespace, f
, data
)
1675 walk_namespaces_fn f
;
1681 result
|= (*f
) (namespace, data
);
1683 for (current
= cp_namespace_decls (namespace);
1685 current
= TREE_CHAIN (current
))
1687 if (TREE_CODE (current
) != NAMESPACE_DECL
1688 || DECL_NAMESPACE_ALIAS (current
))
1690 if (!DECL_LANG_SPECIFIC (current
))
1693 my_friendly_assert (current
== std_node
, 393);
1697 /* We found a namespace. */
1698 result
|= walk_namespaces_r (current
, f
, data
);
1704 /* Walk all the namespaces, calling F for each. The DATA is passed to
1708 walk_namespaces (f
, data
)
1709 walk_namespaces_fn f
;
1712 return walk_namespaces_r (global_namespace
, f
, data
);
1715 struct walk_globals_data
{
1716 walk_globals_pred p
;
1721 /* Walk the global declarations in NAMESPACE. Whenever one is found
1722 for which P returns non-zero, call F with its address. If any call
1723 to F returns a non-zero value, return a non-zero value. */
1726 walk_globals_r (namespace, data
)
1730 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1731 walk_globals_pred p
= wgd
->p
;
1732 walk_globals_fn f
= wgd
->f
;
1733 void *d
= wgd
->data
;
1737 t
= &NAMESPACE_LEVEL (namespace)->names
;
1744 result
|= (*f
) (t
, d
);
1746 /* If F changed *T, then *T still points at the next item to
1749 t
= &TREE_CHAIN (*t
);
1755 /* Walk the global declarations. Whenever one is found for which P
1756 returns non-zero, call F with its address. If any call to F
1757 returns a non-zero value, return a non-zero value. */
1760 walk_globals (p
, f
, data
)
1761 walk_globals_pred p
;
1765 struct walk_globals_data wgd
;
1770 return walk_namespaces (walk_globals_r
, &wgd
);
1773 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1774 DATA is non-NULL, this is the last time we will call
1775 wrapup_global_declarations for this NAMESPACE. */
1778 wrapup_globals_for_namespace (namespace, data
)
1782 tree globals
= cp_namespace_decls (namespace);
1783 int len
= list_length (globals
);
1784 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1788 int last_time
= (data
!= 0);
1790 if (last_time
&& namespace == global_namespace
)
1791 /* Let compile_file handle the global namespace. */
1794 /* Process the decls in reverse order--earliest first.
1795 Put them into VEC from back to front, then take out from front. */
1797 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1798 vec
[len
- i
- 1] = decl
;
1802 check_global_declarations (vec
, len
);
1806 /* Temporarily mark vtables as external. That prevents
1807 wrapup_global_declarations from writing them out; we must process
1808 them ourselves in finish_vtable_vardecl. */
1809 for (i
= 0; i
< len
; ++i
)
1810 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1812 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1813 DECL_EXTERNAL (vec
[i
]) = 1;
1816 /* Write out any globals that need to be output. */
1817 result
= wrapup_global_declarations (vec
, len
);
1819 /* Undo the hack to DECL_EXTERNAL above. */
1820 for (i
= 0; i
< len
; ++i
)
1821 if (vtable_decl_p (vec
[i
], /*data=*/0)
1822 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1824 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1825 DECL_EXTERNAL (vec
[i
]) = 0;
1832 /* Mark ARG (which is really a struct binding_level **) for GC. */
1835 mark_binding_level (arg
)
1838 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1842 ggc_mark_tree (lvl
->names
);
1843 ggc_mark_tree (lvl
->tags
);
1844 ggc_mark_tree (lvl
->usings
);
1845 ggc_mark_tree (lvl
->using_directives
);
1846 ggc_mark_tree (lvl
->class_shadowed
);
1847 ggc_mark_tree (lvl
->type_shadowed
);
1848 ggc_mark_tree (lvl
->shadowed_labels
);
1849 ggc_mark_tree (lvl
->blocks
);
1850 ggc_mark_tree (lvl
->this_block
);
1851 ggc_mark_tree (lvl
->incomplete
);
1852 ggc_mark_tree (lvl
->dead_vars_from_for
);
1854 lvl
= lvl
->level_chain
;
1858 /* For debugging. */
1859 static int no_print_functions
= 0;
1860 static int no_print_builtins
= 0;
1863 print_binding_level (lvl
)
1864 struct binding_level
*lvl
;
1868 fprintf (stderr
, " blocks=");
1869 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1870 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1871 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1872 if (lvl
->tag_transparent
)
1873 fprintf (stderr
, " tag-transparent");
1874 if (lvl
->more_cleanups_ok
)
1875 fprintf (stderr
, " more-cleanups-ok");
1876 if (lvl
->have_cleanups
)
1877 fprintf (stderr
, " have-cleanups");
1878 fprintf (stderr
, "\n");
1881 fprintf (stderr
, " names:\t");
1882 /* We can probably fit 3 names to a line? */
1883 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1885 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1887 if (no_print_builtins
1888 && (TREE_CODE (t
) == TYPE_DECL
)
1889 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1892 /* Function decls tend to have longer names. */
1893 if (TREE_CODE (t
) == FUNCTION_DECL
)
1900 fprintf (stderr
, "\n\t");
1903 print_node_brief (stderr
, "", t
, 0);
1904 if (t
== error_mark_node
)
1908 fprintf (stderr
, "\n");
1912 fprintf (stderr
, " tags:\t");
1914 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1916 if (TREE_PURPOSE (t
) == NULL_TREE
)
1918 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1925 fprintf (stderr
, "\n\t");
1928 if (TREE_PURPOSE (t
) == NULL_TREE
)
1930 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1931 fprintf (stderr
, ">");
1933 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1934 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1937 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1938 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1939 fprintf (stderr
, ">");
1943 fprintf (stderr
, "\n");
1945 if (lvl
->class_shadowed
)
1947 fprintf (stderr
, " class-shadowed:");
1948 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1950 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1952 fprintf (stderr
, "\n");
1954 if (lvl
->type_shadowed
)
1956 fprintf (stderr
, " type-shadowed:");
1957 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1959 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1961 fprintf (stderr
, "\n");
1966 print_other_binding_stack (stack
)
1967 struct binding_level
*stack
;
1969 struct binding_level
*level
;
1970 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1972 fprintf (stderr
, "binding level ");
1973 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1974 fprintf (stderr
, "\n");
1975 print_binding_level (level
);
1980 print_binding_stack ()
1982 struct binding_level
*b
;
1983 fprintf (stderr
, "current_binding_level=");
1984 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
1985 fprintf (stderr
, "\nclass_binding_level=");
1986 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
1987 fprintf (stderr
, "\nglobal_binding_level=");
1988 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
1989 fprintf (stderr
, "\n");
1990 if (class_binding_level
)
1992 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1993 if (b
== current_binding_level
)
1996 b
= class_binding_level
;
1998 b
= current_binding_level
;
2001 b
= current_binding_level
;
2002 print_other_binding_stack (b
);
2003 fprintf (stderr
, "global:\n");
2004 print_binding_level (global_binding_level
);
2007 /* Namespace binding access routines: The namespace_bindings field of
2008 the identifier is polymorphic, with three possible values:
2009 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2010 indicating the BINDING_VALUE of global_namespace. */
2012 /* Check whether the a binding for the name to scope is known.
2013 Assumes that the bindings of the name are already a list
2014 of bindings. Returns the binding found, or NULL_TREE. */
2017 find_binding (name
, scope
)
2021 tree iter
, prev
= NULL_TREE
;
2023 scope
= ORIGINAL_NAMESPACE (scope
);
2025 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2026 iter
= TREE_CHAIN (iter
))
2028 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2029 if (BINDING_SCOPE (iter
) == scope
)
2031 /* Move binding found to the front of the list, so
2032 subsequent lookups will find it faster. */
2035 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2036 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2037 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2046 /* Always returns a binding for name in scope. If the
2047 namespace_bindings is not a list, convert it to one first.
2048 If no binding is found, make a new one. */
2051 binding_for_name (name
, scope
)
2055 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2058 scope
= ORIGINAL_NAMESPACE (scope
);
2060 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2062 /* Get rid of optimization for global scope. */
2063 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2064 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2065 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2067 if (b
&& (result
= find_binding (name
, scope
)))
2069 /* Not found, make a new permanent one. */
2070 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2071 result
= make_node (CPLUS_BINDING
);
2072 TREE_CHAIN (result
) = b
;
2073 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2074 BINDING_SCOPE (result
) = scope
;
2075 BINDING_TYPE (result
) = NULL_TREE
;
2076 BINDING_VALUE (result
) = NULL_TREE
;
2081 /* Return the binding value for name in scope, considering that
2082 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2085 namespace_binding (name
, scope
)
2089 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2092 if (scope
== NULL_TREE
)
2093 scope
= global_namespace
;
2094 if (TREE_CODE (b
) != CPLUS_BINDING
)
2095 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2096 name
= find_binding (name
,scope
);
2097 if (name
== NULL_TREE
)
2099 return BINDING_VALUE (name
);
2102 /* Set the binding value for name in scope. If modifying the binding
2103 of global_namespace is attempted, try to optimize it. */
2106 set_namespace_binding (name
, scope
, val
)
2113 if (scope
== NULL_TREE
)
2114 scope
= global_namespace
;
2116 if (scope
== global_namespace
)
2118 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2119 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2121 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2125 b
= binding_for_name (name
, scope
);
2126 BINDING_VALUE (b
) = val
;
2129 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2130 select a name that is unique to this compilation unit. */
2133 push_namespace (name
)
2138 int implicit_use
= 0;
2140 if (!global_namespace
)
2142 /* This must be ::. */
2143 my_friendly_assert (name
== get_identifier ("::"), 377);
2148 /* The name of anonymous namespace is unique for the translation
2150 if (!anonymous_namespace_name
)
2151 anonymous_namespace_name
= get_file_function_name ('N');
2152 name
= anonymous_namespace_name
;
2153 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2155 /* Reopening anonymous namespace. */
2159 else if (current_namespace
== global_namespace
2160 && name
== DECL_NAME (std_node
))
2167 /* Check whether this is an extended namespace definition. */
2168 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2169 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2172 if (DECL_NAMESPACE_ALIAS (d
))
2174 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2175 d
, DECL_NAMESPACE_ALIAS (d
));
2176 d
= DECL_NAMESPACE_ALIAS (d
);
2183 /* Make a new namespace, binding the name to it. */
2184 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2185 /* The global namespace is not pushed, and the global binding
2186 level is set elsewhere. */
2191 declare_namespace_level ();
2192 NAMESPACE_LEVEL (d
) = current_binding_level
;
2196 resume_binding_level (NAMESPACE_LEVEL (d
));
2199 do_using_directive (d
);
2200 /* Enter the name space. */
2201 current_namespace
= d
;
2204 /* Pop from the scope of the current namespace. */
2209 if (current_namespace
== global_namespace
)
2211 my_friendly_assert (in_std
>0, 980421);
2215 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2216 /* The binding level is not popped, as it might be re-opened later. */
2217 suspend_binding_level ();
2220 /* Push into the scope of the namespace NS, even if it is deeply
2221 nested within another namespace. */
2224 push_nested_namespace (ns
)
2227 if (ns
== global_namespace
)
2228 push_to_top_level ();
2231 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2232 push_namespace (DECL_NAME (ns
));
2236 /* Pop back from the scope of the namespace NS, which was previously
2237 entered with push_nested_namespace. */
2240 pop_nested_namespace (ns
)
2243 while (ns
!= global_namespace
)
2246 ns
= CP_DECL_CONTEXT (ns
);
2249 pop_from_top_level ();
2253 /* Subroutines for reverting temporarily to top-level for instantiation
2254 of templates and such. We actually need to clear out the class- and
2255 local-value slots of all identifiers, so that only the global values
2256 are at all visible. Simply setting current_binding_level to the global
2257 scope isn't enough, because more binding levels may be pushed. */
2258 struct saved_scope
*scope_chain
;
2260 /* Mark ST for GC. */
2264 struct stmt_tree
*st
;
2266 ggc_mark_tree (st
->x_last_stmt
);
2267 ggc_mark_tree (st
->x_last_expr_type
);
2270 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2273 mark_saved_scope (arg
)
2276 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2279 mark_binding_level (&t
->class_bindings
);
2280 ggc_mark_tree (t
->old_bindings
);
2281 ggc_mark_tree (t
->old_namespace
);
2282 ggc_mark_tree (t
->class_name
);
2283 ggc_mark_tree (t
->class_type
);
2284 ggc_mark_tree (t
->access_specifier
);
2285 ggc_mark_tree (t
->function_decl
);
2287 ggc_mark_tree_varray (t
->lang_base
);
2288 ggc_mark_tree (t
->lang_name
);
2289 ggc_mark_tree (t
->x_function_parms
);
2290 ggc_mark_tree (t
->template_parms
);
2291 ggc_mark_tree (t
->x_previous_class_type
);
2292 ggc_mark_tree (t
->x_previous_class_values
);
2293 ggc_mark_tree (t
->x_saved_tree
);
2295 mark_stmt_tree (&t
->x_stmt_tree
);
2296 mark_binding_level (&t
->bindings
);
2302 store_bindings (names
, old_bindings
)
2303 tree names
, old_bindings
;
2306 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2308 tree binding
, t1
, id
;
2310 if (TREE_CODE (t
) == TREE_LIST
)
2311 id
= TREE_PURPOSE (t
);
2316 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2317 we have no IDENTIFIER_BINDING if we have left the class
2318 scope, but cached the class-level declarations. */
2319 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2322 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2323 if (TREE_VEC_ELT (t1
, 0) == id
)
2326 binding
= make_tree_vec (4);
2330 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2331 TREE_VEC_ELT (binding
, 0) = id
;
2332 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2333 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2334 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2335 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2336 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2338 TREE_CHAIN (binding
) = old_bindings
;
2339 old_bindings
= binding
;
2343 return old_bindings
;
2347 maybe_push_to_top_level (pseudo
)
2350 struct saved_scope
*s
;
2351 struct binding_level
*b
;
2355 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2357 b
= scope_chain
? current_binding_level
: 0;
2359 /* If we're in the middle of some function, save our state. */
2360 if (current_function
)
2363 push_function_context_to (NULL_TREE
);
2368 old_bindings
= NULL_TREE
;
2369 if (scope_chain
&& previous_class_type
)
2370 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2372 /* Have to include global_binding_level, because class-level decls
2373 aren't listed anywhere useful. */
2374 for (; b
; b
= b
->level_chain
)
2378 /* Template IDs are inserted into the global level. If they were
2379 inserted into namespace level, finish_file wouldn't find them
2380 when doing pending instantiations. Therefore, don't stop at
2381 namespace level, but continue until :: . */
2382 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2385 old_bindings
= store_bindings (b
->names
, old_bindings
);
2386 /* We also need to check class_shadowed to save class-level type
2387 bindings, since pushclass doesn't fill in b->names. */
2388 if (b
->parm_flag
== 2)
2389 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2391 /* Unwind type-value slots back to top level. */
2392 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2393 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2395 s
->prev
= scope_chain
;
2396 s
->old_bindings
= old_bindings
;
2398 s
->need_pop_function_context
= need_pop
;
2399 s
->function_decl
= current_function_decl
;
2402 current_function_decl
= NULL_TREE
;
2403 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2404 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2405 current_lang_name
= lang_name_cplusplus
;
2406 strict_prototype
= strict_prototypes_lang_cplusplus
;
2407 current_namespace
= global_namespace
;
2409 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2413 push_to_top_level ()
2415 maybe_push_to_top_level (0);
2419 pop_from_top_level ()
2421 struct saved_scope
*s
= scope_chain
;
2424 /* Clear out class-level bindings cache. */
2425 if (previous_class_type
)
2426 invalidate_class_lookup_cache ();
2430 VARRAY_FREE (current_lang_base
);
2432 scope_chain
= s
->prev
;
2433 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2435 tree id
= TREE_VEC_ELT (t
, 0);
2438 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2439 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2440 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2444 if (current_lang_name
== lang_name_cplusplus
)
2445 strict_prototype
= strict_prototypes_lang_cplusplus
;
2446 else if (current_lang_name
== lang_name_c
)
2447 strict_prototype
= strict_prototypes_lang_c
;
2449 /* If we were in the middle of compiling a function, restore our
2451 if (s
->need_pop_function_context
)
2452 pop_function_context_from (NULL_TREE
);
2453 current_function_decl
= s
->function_decl
;
2458 /* Push a definition of struct, union or enum tag "name".
2459 into binding_level "b". "type" should be the type node,
2460 We assume that the tag "name" is not already defined.
2462 Note that the definition may really be just a forward reference.
2463 In that case, the TYPE_SIZE will be a NULL_TREE.
2465 C++ gratuitously puts all these tags in the name space. */
2467 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2468 record the shadowed value for this binding contour. TYPE is
2469 the type that ID maps to. */
2472 set_identifier_type_value_with_scope (id
, type
, b
)
2475 struct binding_level
*b
;
2477 if (!b
->namespace_p
)
2479 /* Shadow the marker, not the real thing, so that the marker
2480 gets restored later. */
2481 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2483 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2487 tree binding
= binding_for_name (id
, current_namespace
);
2488 BINDING_TYPE (binding
) = type
;
2489 /* Store marker instead of real type. */
2490 type
= global_type_node
;
2492 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2495 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2498 set_identifier_type_value (id
, type
)
2502 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2505 /* Return the type associated with id. */
2508 identifier_type_value (id
)
2511 /* There is no type with that name, anywhere. */
2512 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2514 /* This is not the type marker, but the real thing. */
2515 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2516 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2517 /* Have to search for it. It must be on the global level, now.
2518 Ask lookup_name not to return non-types. */
2519 id
= lookup_name_real (id
, 2, 1, 0);
2521 return TREE_TYPE (id
);
2525 /* Pop off extraneous binding levels left over due to syntax errors.
2527 We don't pop past namespaces, as they might be valid. */
2532 #ifdef DEBUG_CP_BINDING_LEVELS
2533 fprintf (stderr
, "XXX entering pop_everything ()\n");
2535 while (!toplevel_bindings_p ())
2537 if (current_binding_level
->parm_flag
== 2)
2538 pop_nested_class ();
2542 #ifdef DEBUG_CP_BINDING_LEVELS
2543 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2547 /* The type TYPE is being declared. If it is a class template, or a
2548 specialization of a class template, do any processing required and
2549 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2550 being declared a friend. B is the binding level at which this TYPE
2553 Returns the TYPE_DECL for TYPE, which may have been altered by this
2557 maybe_process_template_type_declaration (type
, globalize
, b
)
2560 struct binding_level
* b
;
2562 tree decl
= TYPE_NAME (type
);
2564 if (processing_template_parmlist
)
2565 /* You can't declare a new template type in a template parameter
2566 list. But, you can declare a non-template type:
2568 template <class A*> struct S;
2570 is a forward-declaration of `A'. */
2574 maybe_check_template_type (type
);
2576 my_friendly_assert (IS_AGGR_TYPE (type
)
2577 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2580 if (processing_template_decl
)
2582 /* This may change after the call to
2583 push_template_decl_real, but we want the original value. */
2584 tree name
= DECL_NAME (decl
);
2586 decl
= push_template_decl_real (decl
, globalize
);
2587 /* If the current binding level is the binding level for the
2588 template parameters (see the comment in
2589 begin_template_parm_list) and the enclosing level is a class
2590 scope, and we're not looking at a friend, push the
2591 declaration of the member class into the class scope. In the
2592 friend case, push_template_decl will already have put the
2593 friend into global scope, if appropriate. */
2594 if (TREE_CODE (type
) != ENUMERAL_TYPE
2595 && !globalize
&& b
->pseudo_global
2596 && b
->level_chain
->parm_flag
== 2)
2598 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2599 /* Put this tag on the list of tags for the class, since
2600 that won't happen below because B is not the class
2601 binding level, but is instead the pseudo-global level. */
2602 b
->level_chain
->tags
=
2603 tree_cons (name
, type
, b
->level_chain
->tags
);
2604 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2605 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2613 /* In C++, you don't have to write `struct S' to refer to `S'; you
2614 can just use `S'. We accomplish this by creating a TYPE_DECL as
2615 if the user had written `typedef struct S S'. Create and return
2616 the TYPE_DECL for TYPE. */
2619 create_implicit_typedef (name
, type
)
2625 decl
= build_decl (TYPE_DECL
, name
, type
);
2626 SET_DECL_ARTIFICIAL (decl
);
2627 /* There are other implicit type declarations, like the one *within*
2628 a class that allows you to write `S::S'. We must distinguish
2630 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2631 TYPE_NAME (type
) = decl
;
2636 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2637 Normally put it into the inner-most non-tag-transparent scope,
2638 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2639 The latter is needed for implicit declarations. */
2642 pushtag (name
, type
, globalize
)
2646 register struct binding_level
*b
;
2648 b
= current_binding_level
;
2649 while (b
->tag_transparent
2650 || (globalize
&& b
->parm_flag
== 2))
2653 b
->tags
= tree_cons (name
, type
, b
->tags
);
2657 /* Do C++ gratuitous typedefing. */
2658 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2660 register tree d
= NULL_TREE
;
2662 tree context
= TYPE_CONTEXT (type
);
2666 tree cs
= current_scope ();
2670 else if (cs
!= NULL_TREE
2671 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2672 /* When declaring a friend class of a local class, we want
2673 to inject the newly named class into the scope
2674 containing the local class, not the namespace scope. */
2675 context
= hack_decl_function_context (get_type_decl (cs
));
2678 context
= current_namespace
;
2680 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2681 || b
->parm_flag
== 2)
2684 if (current_lang_name
== lang_name_java
)
2685 TYPE_FOR_JAVA (type
) = 1;
2687 d
= create_implicit_typedef (name
, type
);
2688 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2690 set_identifier_type_value_with_scope (name
, type
, b
);
2692 d
= maybe_process_template_type_declaration (type
,
2695 if (b
->parm_flag
== 2)
2697 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2698 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2699 class. But if it's a member template class, we
2700 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2702 finish_member_declaration (d
);
2704 pushdecl_class_level (d
);
2707 d
= pushdecl_with_scope (d
, b
);
2709 if (ANON_AGGRNAME_P (name
))
2710 DECL_IGNORED_P (d
) = 1;
2712 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2713 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2714 if (!uses_template_parms (type
))
2715 DECL_ASSEMBLER_NAME (d
)
2716 = get_identifier (build_overload_name (type
, 1, 1));
2718 if (b
->parm_flag
== 2)
2720 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2721 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2725 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2726 /* Use the canonical TYPE_DECL for this node. */
2727 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2730 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2731 will be the tagged type we just added to the current
2732 binding level. This fake NULL-named TYPE_DECL node helps
2733 dwarfout.c to know when it needs to output a
2734 representation of a tagged type, and it also gives us a
2735 convenient place to record the "scope start" address for
2738 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2739 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2743 /* Counter used to create anonymous type names. */
2745 static int anon_cnt
= 0;
2747 /* Return an IDENTIFIER which can be used as a name for
2748 anonymous structs and unions. */
2755 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2756 return get_identifier (buf
);
2759 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2760 This keeps dbxout from getting confused. */
2765 register struct binding_level
*b
;
2767 static int last_cnt
= 0;
2769 /* Fast out if no new anon names were declared. */
2770 if (last_cnt
== anon_cnt
)
2773 b
= current_binding_level
;
2774 while (b
->tag_transparent
)
2779 /* A NULL purpose means we have already processed all tags
2780 from here to the end of the list. */
2781 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2783 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2784 TREE_PURPOSE (tags
) = NULL_TREE
;
2785 tags
= TREE_CHAIN (tags
);
2787 last_cnt
= anon_cnt
;
2790 /* Subroutine of duplicate_decls: return truthvalue of whether
2791 or not types of these decls match.
2793 For C++, we must compare the parameter list so that `int' can match
2794 `int&' in a parameter position, but `int&' is not confused with
2798 decls_match (newdecl
, olddecl
)
2799 tree newdecl
, olddecl
;
2803 if (newdecl
== olddecl
)
2806 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2807 /* If the two DECLs are not even the same kind of thing, we're not
2808 interested in their types. */
2811 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2813 tree f1
= TREE_TYPE (newdecl
);
2814 tree f2
= TREE_TYPE (olddecl
);
2815 tree p1
= TYPE_ARG_TYPES (f1
);
2816 tree p2
= TYPE_ARG_TYPES (f2
);
2818 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2819 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2820 && DECL_LANGUAGE (olddecl
) == lang_c
))
2823 /* When we parse a static member function definition,
2824 we put together a FUNCTION_DECL which thinks its type
2825 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2827 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2828 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2829 else if (TREE_CODE (f2
) == METHOD_TYPE
2830 && DECL_STATIC_FUNCTION_P (newdecl
))
2831 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2833 /* Here we must take care of the case where new default
2834 parameters are specified. Also, warn if an old
2835 declaration becomes ambiguous because default
2836 parameters may cause the two to be ambiguous. */
2837 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2839 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2840 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2842 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2846 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2848 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2851 types_match
= self_promoting_args_p (p1
);
2852 if (p1
== void_list_node
)
2853 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2855 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2856 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2858 types_match
= self_promoting_args_p (p2
);
2859 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2862 types_match
= compparms (p1
, p2
);
2867 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2869 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2870 DECL_TEMPLATE_PARMS (olddecl
)))
2873 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2876 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2877 DECL_TEMPLATE_RESULT (newdecl
));
2881 if (TREE_TYPE (newdecl
) == error_mark_node
)
2882 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2883 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2884 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2885 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2888 types_match
= comptypes (TREE_TYPE (newdecl
),
2889 TREE_TYPE (olddecl
),
2890 COMPARE_REDECLARATION
);
2896 /* If NEWDECL is `static' and an `extern' was seen previously,
2897 warn about it. OLDDECL is the previous declaration.
2899 Note that this does not apply to the C++ case of declaring
2900 a variable `extern const' and then later `const'.
2902 Don't complain about built-in functions, since they are beyond
2903 the user's control. */
2906 warn_extern_redeclared_static (newdecl
, olddecl
)
2907 tree newdecl
, olddecl
;
2909 static const char *explicit_extern_static_warning
2910 = "`%D' was declared `extern' and later `static'";
2911 static const char *implicit_extern_static_warning
2912 = "`%D' was declared implicitly `extern' and later `static'";
2916 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2919 /* Don't get confused by static member functions; that's a different
2921 if (TREE_CODE (newdecl
) == FUNCTION_DECL
2922 && DECL_STATIC_FUNCTION_P (newdecl
))
2925 /* If the old declaration was `static', or the new one isn't, then
2926 then everything is OK. */
2927 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
2930 /* It's OK to declare a builtin function as `static'. */
2931 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2932 && DECL_ARTIFICIAL (olddecl
))
2935 name
= DECL_ASSEMBLER_NAME (newdecl
);
2936 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2937 ? implicit_extern_static_warning
2938 : explicit_extern_static_warning
, newdecl
);
2939 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2942 /* Handle when a new declaration NEWDECL has the same name as an old
2943 one OLDDECL in the same binding contour. Prints an error message
2946 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2947 Otherwise, return 0. */
2950 duplicate_decls (newdecl
, olddecl
)
2951 tree newdecl
, olddecl
;
2953 unsigned olddecl_uid
= DECL_UID (olddecl
);
2954 int olddecl_friend
= 0, types_match
= 0;
2955 int new_defines_function
= 0;
2957 if (newdecl
== olddecl
)
2960 types_match
= decls_match (newdecl
, olddecl
);
2962 /* If either the type of the new decl or the type of the old decl is an
2963 error_mark_node, then that implies that we have already issued an
2964 error (earlier) for some bogus type specification, and in that case,
2965 it is rather pointless to harass the user with yet more error message
2966 about the same declaration, so just pretend the types match here. */
2967 if (TREE_TYPE (newdecl
) == error_mark_node
2968 || TREE_TYPE (olddecl
) == error_mark_node
)
2971 /* Check for redeclaration and other discrepancies. */
2972 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2973 && DECL_ARTIFICIAL (olddecl
))
2975 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2977 /* If you declare a built-in or predefined function name as static,
2978 the old definition is overridden, but optionally warn this was a
2979 bad choice of name. */
2980 if (! TREE_PUBLIC (newdecl
))
2983 cp_warning ("shadowing %s function `%#D'",
2984 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2986 /* Discard the old built-in function. */
2989 /* If the built-in is not ansi, then programs can override
2990 it even globally without an error. */
2991 else if (! DECL_BUILT_IN (olddecl
))
2992 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2996 cp_error ("declaration of `%#D'", newdecl
);
2997 cp_error ("conflicts with built-in declaration `%#D'",
3002 else if (!types_match
)
3004 if ((DECL_LANGUAGE (newdecl
) == lang_c
3005 && DECL_LANGUAGE (olddecl
) == lang_c
)
3006 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3007 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3009 /* A near match; override the builtin. */
3011 if (TREE_PUBLIC (newdecl
))
3013 cp_warning ("new declaration `%#D'", newdecl
);
3014 cp_warning ("ambiguates built-in declaration `%#D'",
3017 else if (warn_shadow
)
3018 cp_warning ("shadowing %s function `%#D'",
3019 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3023 /* Discard the old built-in function. */
3027 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3029 /* If a builtin function is redeclared as `static', merge
3030 the declarations, but make the original one static. */
3031 DECL_THIS_STATIC (olddecl
) = 1;
3032 TREE_PUBLIC (olddecl
) = 0;
3034 /* Make the olddeclaration consistent with the new one so that
3035 all remnants of the builtin-ness of this function will be
3037 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3038 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3039 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3040 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3044 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3046 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3047 && TREE_CODE (newdecl
) != TYPE_DECL
3048 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3049 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3050 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3051 && TREE_CODE (olddecl
) != TYPE_DECL
3052 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3053 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3056 /* We do nothing special here, because C++ does such nasty
3057 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3058 get shadowed, and know that if we need to find a TYPE_DECL
3059 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3060 slot of the identifier. */
3064 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3065 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3066 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3067 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3070 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3071 if (TREE_CODE (olddecl
) == TREE_LIST
)
3072 olddecl
= TREE_VALUE (olddecl
);
3073 cp_error_at ("previous declaration of `%#D'", olddecl
);
3075 /* New decl is completely inconsistent with the old one =>
3076 tell caller to replace the old one. */
3080 else if (!types_match
)
3082 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3083 /* These are certainly not duplicate declarations; they're
3084 from different scopes. */
3087 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3089 /* The name of a class template may not be declared to refer to
3090 any other template, class, function, object, namespace, value,
3091 or type in the same scope. */
3092 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3093 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3095 cp_error ("declaration of template `%#D'", newdecl
);
3096 cp_error_at ("conflicts with previous declaration `%#D'",
3099 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3100 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3101 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3102 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3103 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3104 DECL_TEMPLATE_PARMS (olddecl
)))
3106 cp_error ("new declaration `%#D'", newdecl
);
3107 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3111 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3113 if (DECL_LANGUAGE (newdecl
) == lang_c
3114 && DECL_LANGUAGE (olddecl
) == lang_c
)
3116 cp_error ("declaration of C function `%#D' conflicts with",
3118 cp_error_at ("previous declaration `%#D' here", olddecl
);
3120 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3121 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3123 cp_error ("new declaration `%#D'", newdecl
);
3124 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3130 /* Already complained about this, so don't do so again. */
3131 else if (current_class_type
== NULL_TREE
3132 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3134 cp_error ("conflicting types for `%#D'", newdecl
);
3135 cp_error_at ("previous declaration as `%#D'", olddecl
);
3138 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3139 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3140 && (!DECL_TEMPLATE_INFO (newdecl
)
3141 || (DECL_TI_TEMPLATE (newdecl
)
3142 != DECL_TI_TEMPLATE (olddecl
))))
3143 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3144 && (!DECL_TEMPLATE_INFO (olddecl
)
3145 || (DECL_TI_TEMPLATE (olddecl
)
3146 != DECL_TI_TEMPLATE (newdecl
))))))
3147 /* It's OK to have a template specialization and a non-template
3148 with the same type, or to have specializations of two
3149 different templates with the same type. Note that if one is a
3150 specialization, and the other is an instantiation of the same
3151 template, that we do not exit at this point. That situation
3152 can occur if we instantiate a template class, and then
3153 specialize one of its methods. This situation is legal, but
3154 the declarations must be merged in the usual way. */
3156 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3157 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3158 && !DECL_USE_TEMPLATE (newdecl
))
3159 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3160 && !DECL_USE_TEMPLATE (olddecl
))))
3161 /* One of the declarations is a template instantiation, and the
3162 other is not a template at all. That's OK. */
3164 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3165 && DECL_NAMESPACE_ALIAS (newdecl
)
3166 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3167 /* Redeclaration of namespace alias, ignore it. */
3171 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3174 cp_error (errmsg
, newdecl
);
3175 if (DECL_NAME (olddecl
) != NULL_TREE
)
3176 cp_error_at ((DECL_INITIAL (olddecl
)
3177 && namespace_bindings_p ())
3178 ? "`%#D' previously defined here"
3179 : "`%#D' previously declared here", olddecl
);
3181 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3182 && DECL_INITIAL (olddecl
) != NULL_TREE
3183 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3184 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3186 /* Prototype decl follows defn w/o prototype. */
3187 cp_warning_at ("prototype for `%#D'", newdecl
);
3188 cp_warning_at ("follows non-prototype definition here", olddecl
);
3190 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3191 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3193 /* extern "C" int foo ();
3194 int foo () { bar (); }
3196 if (current_lang_stack
3197 == &VARRAY_TREE (current_lang_base
, 0))
3198 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3201 cp_error_at ("previous declaration of `%#D' with %L linkage",
3202 olddecl
, DECL_LANGUAGE (olddecl
));
3203 cp_error ("conflicts with new declaration with %L linkage",
3204 DECL_LANGUAGE (newdecl
));
3208 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3210 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3212 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3213 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3216 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3217 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3219 for (; t1
&& t1
!= void_list_node
;
3220 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3221 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3223 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3228 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3230 cp_pedwarn_at ("after previous specification in `%#D'",
3236 cp_error ("default argument given for parameter %d of `%#D'",
3238 cp_error_at ("after previous specification in `%#D'",
3243 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3244 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3246 cp_warning ("`%#D' was used before it was declared inline",
3248 cp_warning_at ("previous non-inline declaration here",
3254 /* If new decl is `static' and an `extern' was seen previously,
3256 warn_extern_redeclared_static (newdecl
, olddecl
);
3258 /* We have committed to returning 1 at this point. */
3259 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3261 /* Now that functions must hold information normally held
3262 by field decls, there is extra work to do so that
3263 declaration information does not get destroyed during
3265 if (DECL_VINDEX (olddecl
))
3266 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3267 if (DECL_CONTEXT (olddecl
))
3268 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3269 if (DECL_CLASS_CONTEXT (olddecl
))
3270 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3271 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3272 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3273 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3274 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3275 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3276 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3277 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3278 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3279 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3281 /* Optionally warn about more than one declaration for the same
3282 name, but don't warn about a function declaration followed by a
3284 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3285 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3286 /* Don't warn about extern decl followed by definition. */
3287 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3288 /* Don't warn about friends, let add_friend take care of it. */
3289 && ! DECL_FRIEND_P (newdecl
))
3291 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3292 cp_warning_at ("previous declaration of `%D'", olddecl
);
3296 /* Deal with C++: must preserve virtual function table size. */
3297 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3299 register tree newtype
= TREE_TYPE (newdecl
);
3300 register tree oldtype
= TREE_TYPE (olddecl
);
3302 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3303 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3305 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3306 CLASSTYPE_FRIEND_CLASSES (newtype
)
3307 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3311 /* Copy all the DECL_... slots specified in the new decl
3312 except for any that we copy here from the old type. */
3313 DECL_MACHINE_ATTRIBUTES (newdecl
)
3314 = merge_machine_decl_attributes (olddecl
, newdecl
);
3316 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3318 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3319 DECL_TEMPLATE_RESULT (olddecl
)))
3320 cp_error ("invalid redeclaration of %D", newdecl
);
3321 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3322 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3323 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3324 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3331 /* Automatically handles default parameters. */
3332 tree oldtype
= TREE_TYPE (olddecl
);
3335 /* Make sure we put the new type in the same obstack as the old one. */
3337 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3339 push_permanent_obstack ();
3341 /* Merge the data types specified in the two decls. */
3342 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3344 if (TREE_CODE (newdecl
) == VAR_DECL
)
3345 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3346 /* Do this after calling `common_type' so that default
3347 parameters don't confuse us. */
3348 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3349 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3350 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3352 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3353 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3354 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3355 TYPE_RAISES_EXCEPTIONS (oldtype
));
3357 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3358 && DECL_SOURCE_LINE (olddecl
) != 0
3360 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3361 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3363 cp_error ("declaration of `%F' throws different exceptions",
3365 cp_error_at ("to previous declaration `%F'", olddecl
);
3368 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3370 /* Lay the type out, unless already done. */
3371 if (! same_type_p (newtype
, oldtype
)
3372 && TREE_TYPE (newdecl
) != error_mark_node
3373 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3374 layout_type (TREE_TYPE (newdecl
));
3376 if ((TREE_CODE (newdecl
) == VAR_DECL
3377 || TREE_CODE (newdecl
) == PARM_DECL
3378 || TREE_CODE (newdecl
) == RESULT_DECL
3379 || TREE_CODE (newdecl
) == FIELD_DECL
3380 || TREE_CODE (newdecl
) == TYPE_DECL
)
3381 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3382 layout_decl (newdecl
, 0);
3384 /* Merge the type qualifiers. */
3385 if (TREE_READONLY (newdecl
))
3386 TREE_READONLY (olddecl
) = 1;
3387 if (TREE_THIS_VOLATILE (newdecl
))
3388 TREE_THIS_VOLATILE (olddecl
) = 1;
3390 /* Merge the initialization information. */
3391 if (DECL_INITIAL (newdecl
) == NULL_TREE
3392 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3394 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3395 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3396 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3397 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3398 && DECL_LANG_SPECIFIC (newdecl
)
3399 && DECL_LANG_SPECIFIC (olddecl
))
3400 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3403 /* Merge the section attribute.
3404 We want to issue an error if the sections conflict but that must be
3405 done later in decl_attributes since we are called before attributes
3407 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3408 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3410 /* Keep the old rtl since we can safely use it. */
3411 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3415 /* If cannot merge, then use the new type and qualifiers,
3416 and don't preserve the old rtl. */
3419 /* Clean out any memory we had of the old declaration. */
3420 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3422 TREE_VALUE (oldstatic
) = error_mark_node
;
3424 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3425 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3426 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3427 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3430 /* Merge the storage class information. */
3431 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3432 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3433 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3434 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3435 if (! DECL_EXTERNAL (olddecl
))
3436 DECL_EXTERNAL (newdecl
) = 0;
3438 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3440 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3441 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3442 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3443 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3444 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3445 /* Don't really know how much of the language-specific
3446 values we should copy from old to new. */
3447 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3448 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3449 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3450 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3451 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3453 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3454 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3455 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3456 DECL_BEFRIENDING_CLASSES (newdecl
)
3457 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3458 DECL_BEFRIENDING_CLASSES (olddecl
));
3461 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3463 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3464 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3466 /* If newdecl is not a specialization, then it is not a
3467 template-related function at all. And that means that we
3468 shoud have exited above, returning 0. */
3469 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3472 if (TREE_USED (olddecl
))
3473 /* From [temp.expl.spec]:
3475 If a template, a member template or the member of a class
3476 template is explicitly specialized then that
3477 specialization shall be declared before the first use of
3478 that specialization that would cause an implicit
3479 instantiation to take place, in every translation unit in
3480 which such a use occurs. */
3481 cp_error ("explicit specialization of %D after first use",
3484 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3486 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3488 /* If either decl says `inline', this fn is inline, unless its
3489 definition was passed already. */
3490 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3491 DECL_INLINE (olddecl
) = 1;
3492 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3496 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3497 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3498 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3500 if (! types_match
|| new_defines_function
)
3502 /* These need to be copied so that the names are available.
3503 Note that if the types do match, we'll preserve inline
3504 info and other bits, but if not, we won't. */
3505 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3506 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3508 if (new_defines_function
)
3509 /* If defining a function declared with other language
3510 linkage, use the previously declared language linkage. */
3511 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3512 else if (types_match
)
3514 /* If redeclaring a builtin function, and not a definition,
3515 it stays built in. */
3516 if (DECL_BUILT_IN (olddecl
))
3518 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3519 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3520 /* If we're keeping the built-in definition, keep the rtl,
3521 regardless of declaration matches. */
3522 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3525 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3527 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3528 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3529 /* Previously saved insns go together with
3530 the function's previous definition. */
3531 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3532 /* Don't clear out the arguments if we're redefining a function. */
3533 if (DECL_ARGUMENTS (olddecl
))
3534 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3536 if (DECL_LANG_SPECIFIC (olddecl
))
3537 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3540 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3542 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3545 /* Now preserve various other info from the definition. */
3546 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3547 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3548 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3549 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3551 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3555 function_size
= sizeof (struct tree_decl
);
3557 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3558 (char *) olddecl
+ sizeof (struct tree_common
),
3559 function_size
- sizeof (struct tree_common
));
3561 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3563 /* If newdecl is a template instantiation, it is possible that
3564 the following sequence of events has occurred:
3566 o A friend function was declared in a class template. The
3567 class template was instantiated.
3569 o The instantiation of the friend declaration was
3570 recorded on the instantiation list, and is newdecl.
3572 o Later, however, instantiate_class_template called pushdecl
3573 on the newdecl to perform name injection. But, pushdecl in
3574 turn called duplicate_decls when it discovered that another
3575 declaration of a global function with the same name already
3578 o Here, in duplicate_decls, we decided to clobber newdecl.
3580 If we're going to do that, we'd better make sure that
3581 olddecl, and not newdecl, is on the list of
3582 instantiations so that if we try to do the instantiation
3583 again we won't get the clobbered declaration. */
3585 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3586 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3588 for (; decls
; decls
= TREE_CHAIN (decls
))
3589 if (TREE_VALUE (decls
) == newdecl
)
3590 TREE_VALUE (decls
) = olddecl
;
3595 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3596 (char *) olddecl
+ sizeof (struct tree_common
),
3597 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3598 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3601 DECL_UID (olddecl
) = olddecl_uid
;
3603 DECL_FRIEND_P (olddecl
) = 1;
3605 /* NEWDECL contains the merged attribute lists.
3606 Update OLDDECL to be the same. */
3607 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3612 /* Record a decl-node X as belonging to the current lexical scope.
3613 Check for errors (such as an incompatible declaration for the same
3614 name already seen in the same scope).
3616 Returns either X or an old decl for the same name.
3617 If an old decl is returned, it may have been smashed
3618 to agree with what X says. */
3626 int need_new_binding
;
3628 /* We shouldn't be calling pushdecl when we're generating RTL for a
3629 function that we already did semantic analysis on previously. */
3630 my_friendly_assert (!current_function
|| doing_semantic_analysis_p (),
3633 name
= DECL_ASSEMBLER_NAME (x
);
3634 need_new_binding
= 1;
3636 if (DECL_TEMPLATE_PARM_P (x
))
3637 /* Template parameters have no context; they are not X::T even
3638 when declared within a class or namespace. */
3642 if (current_function_decl
&& x
!= current_function_decl
3643 /* A local declaration for a function doesn't constitute
3645 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3646 /* A local declaration for an `extern' variable is in the
3647 scoped of the current namespace, not the current
3649 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3650 /* Don't change DECL_CONTEXT of virtual methods. */
3651 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3652 && !DECL_CONTEXT (x
))
3653 DECL_CONTEXT (x
) = current_function_decl
;
3654 if (!DECL_CONTEXT (x
))
3655 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3658 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3659 compiler wants to use. */
3660 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3661 || TREE_CODE (x
) == NAMESPACE_DECL
)
3662 name
= DECL_NAME (x
);
3667 /* Not needed...see below. */
3671 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3672 name
= TREE_OPERAND (name
, 0);
3674 /* Namespace-scoped variables are not found in the current level. */
3675 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3676 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3678 t
= lookup_name_current_level (name
);
3679 if (t
== error_mark_node
)
3681 /* error_mark_node is 0 for a while during initialization! */
3683 cp_error_at ("`%#D' used prior to declaration", x
);
3686 else if (t
!= NULL_TREE
)
3689 /* This is turned off until I have time to do it right (bpk). */
3690 /* With the code below that uses it... */
3691 file
= DECL_SOURCE_FILE (t
);
3692 line
= DECL_SOURCE_LINE (t
);
3694 if (TREE_CODE (t
) == PARM_DECL
)
3696 if (DECL_CONTEXT (t
) == NULL_TREE
)
3697 fatal ("parse errors have confused me too much");
3699 /* Check for duplicate params. */
3700 if (duplicate_decls (x
, t
))
3703 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3704 || DECL_FUNCTION_TEMPLATE_P (x
))
3705 && is_overloaded_fn (t
))
3706 /* Don't do anything just yet. */;
3707 else if (t
== wchar_decl_node
)
3709 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3710 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3712 /* Throw away the redeclaration. */
3715 else if (TREE_CODE (t
) != TREE_CODE (x
))
3717 if (duplicate_decls (x
, t
))
3720 else if (duplicate_decls (x
, t
))
3723 /* This is turned off until I have time to do it right (bpk). */
3725 /* Also warn if they did a prototype with `static' on it, but
3726 then later left the `static' off. */
3727 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3729 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3734 cp_warning ("`static' missing from declaration of `%D'",
3736 warning_with_file_and_line (file
, line
,
3737 "previous declaration of `%s'",
3738 decl_as_string (t
, 0));
3741 /* Now fix things so it'll do what they expect. */
3742 if (current_function_decl
)
3743 TREE_PUBLIC (current_function_decl
) = 0;
3745 /* Due to interference in memory reclamation (X may be
3746 obstack-deallocated at this point), we must guard against
3747 one really special case. [jason: This should be handled
3748 by start_function] */
3749 if (current_function_decl
== x
)
3750 current_function_decl
= t
;
3752 if (TREE_CODE (t
) == TYPE_DECL
)
3753 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3754 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3755 check_default_args (t
);
3759 else if (DECL_MAIN_P (x
))
3761 /* A redeclaration of main, but not a duplicate of the
3766 This function shall not be overloaded. */
3767 cp_error_at ("invalid redeclaration of `%D'", t
);
3768 cp_error ("as `%D'", x
);
3769 /* We don't try to push this declaration since that
3775 check_template_shadow (x
);
3777 /* If this is a function conjured up by the backend, massage it
3778 so it looks friendly. */
3779 if (TREE_CODE (x
) == FUNCTION_DECL
3780 && ! DECL_LANG_SPECIFIC (x
))
3782 retrofit_lang_decl (x
);
3783 DECL_LANGUAGE (x
) = lang_c
;
3786 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3788 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3791 if (!namespace_bindings_p ())
3792 /* We do not need to create a binding for this name;
3793 push_overloaded_decl will have already done so if
3795 need_new_binding
= 0;
3797 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3799 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3801 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3805 /* If declaring a type as a typedef, copy the type (unless we're
3806 at line 0), and install this TYPE_DECL as the new type's typedef
3807 name. See the extensive comment in ../c-decl.c (pushdecl). */
3808 if (TREE_CODE (x
) == TYPE_DECL
)
3810 tree type
= TREE_TYPE (x
);
3811 if (DECL_SOURCE_LINE (x
) == 0)
3813 if (TYPE_NAME (type
) == 0)
3814 TYPE_NAME (type
) = x
;
3816 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3817 /* We don't want to copy the type when all we're
3818 doing is making a TYPE_DECL for the purposes of
3820 && (!TYPE_NAME (type
)
3821 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3823 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3825 DECL_ORIGINAL_TYPE (x
) = type
;
3826 type
= build_type_copy (type
);
3827 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3828 TYPE_NAME (type
) = x
;
3829 TREE_TYPE (x
) = type
;
3834 if (type
!= error_mark_node
3836 && TYPE_IDENTIFIER (type
))
3837 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3838 current_binding_level
);
3842 /* Multiple external decls of the same identifier ought to match.
3844 We get warnings about inline functions where they are defined.
3845 We get warnings about other functions from push_overloaded_decl.
3847 Avoid duplicate warnings where they are used. */
3848 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3852 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3853 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3854 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3855 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3860 /* If different sort of thing, we already gave an error. */
3861 && TREE_CODE (decl
) == TREE_CODE (x
)
3862 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3864 cp_pedwarn ("type mismatch with previous external decl", x
);
3865 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3869 /* This name is new in its binding level.
3870 Install the new declaration and return it. */
3871 if (namespace_bindings_p ())
3873 /* Install a global value. */
3875 /* If the first global decl has external linkage,
3876 warn if we later see static one. */
3877 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3878 TREE_PUBLIC (name
) = 1;
3880 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3882 /* For an ordinary function, we create a binding from
3883 the mangled name (i.e., NAME) to the DECL. But, for
3884 an `extern "C"' function, the mangled name and the
3885 ordinary name are the same so we need not do this. */
3886 && !(TREE_CODE (x
) == FUNCTION_DECL
&&
3887 DECL_LANGUAGE (x
) == lang_c
))
3889 if (TREE_CODE (x
) == FUNCTION_DECL
)
3891 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3892 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3893 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3896 /* Don't forget if the function was used via an implicit decl. */
3897 if (IDENTIFIER_IMPLICIT_DECL (name
)
3898 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3901 /* Don't forget if its address was taken in that way. */
3902 if (IDENTIFIER_IMPLICIT_DECL (name
)
3903 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3904 TREE_ADDRESSABLE (x
) = 1;
3906 /* Warn about mismatches against previous implicit decl. */
3907 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3908 /* If this real decl matches the implicit, don't complain. */
3909 && ! (TREE_CODE (x
) == FUNCTION_DECL
3910 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3912 ("`%D' was previously implicitly declared to return `int'", x
);
3914 /* If new decl is `static' and an `extern' was seen previously,
3916 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3917 warn_extern_redeclared_static (x
, t
);
3921 /* Here to install a non-global value. */
3922 tree oldlocal
= IDENTIFIER_VALUE (name
);
3923 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3925 if (need_new_binding
)
3927 push_local_binding (name
, x
, 0);
3928 /* Because push_local_binding will hook X on to the
3929 current_binding_level's name list, we don't want to
3930 do that again below. */
3931 need_new_binding
= 0;
3934 /* If this is a TYPE_DECL, push it into the type value slot. */
3935 if (TREE_CODE (x
) == TYPE_DECL
)
3936 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3937 current_binding_level
);
3939 /* Clear out any TYPE_DECL shadowed by a namespace so that
3940 we won't think this is a type. The C struct hack doesn't
3941 go through namespaces. */
3942 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3943 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3944 current_binding_level
);
3946 /* If this is an extern function declaration, see if we
3947 have a global definition or declaration for the function. */
3948 if (oldlocal
== NULL_TREE
3949 && DECL_EXTERNAL (x
)
3950 && oldglobal
!= NULL_TREE
3951 && TREE_CODE (x
) == FUNCTION_DECL
3952 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3954 /* We have one. Their types must agree. */
3955 if (decls_match (x
, oldglobal
))
3959 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3960 cp_warning_at ("global declaration `%#D'", oldglobal
);
3963 /* If we have a local external declaration,
3964 and no file-scope declaration has yet been seen,
3965 then if we later have a file-scope decl it must not be static. */
3966 if (oldlocal
== NULL_TREE
3967 && oldglobal
== NULL_TREE
3968 && DECL_EXTERNAL (x
)
3970 TREE_PUBLIC (name
) = 1;
3972 if (DECL_FROM_INLINE (x
))
3973 /* Inline decls shadow nothing. */;
3975 /* Warn if shadowing an argument at the top level of the body. */
3976 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3977 && TREE_CODE (oldlocal
) == PARM_DECL
3978 /* Don't complain if it's from an enclosing function. */
3979 && DECL_CONTEXT (oldlocal
) == current_function_decl
3980 && TREE_CODE (x
) != PARM_DECL
)
3982 /* Go to where the parms should be and see if we
3984 struct binding_level
*b
= current_binding_level
->level_chain
;
3990 if (b
->parm_flag
== 1)
3991 cp_error ("declaration of `%#D' shadows a parameter", name
);
3993 else if (warn_shadow
&& oldlocal
!= NULL_TREE
3994 && current_binding_level
->is_for_scope
3995 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3997 warning ("variable `%s' shadows local",
3998 IDENTIFIER_POINTER (name
));
3999 cp_warning_at (" this is the shadowed declaration", oldlocal
);
4001 /* Maybe warn if shadowing something else. */
4002 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4003 /* No shadow warnings for internally generated vars. */
4004 && ! DECL_ARTIFICIAL (x
)
4005 /* No shadow warnings for vars made for inlining. */
4006 && ! DECL_FROM_INLINE (x
))
4008 const char *warnstring
= NULL
;
4010 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4011 warnstring
= "declaration of `%s' shadows a parameter";
4012 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4013 && current_class_ptr
4014 && !TREE_STATIC (name
))
4015 warnstring
= "declaration of `%s' shadows a member of `this'";
4016 else if (oldlocal
!= NULL_TREE
)
4017 warnstring
= "declaration of `%s' shadows previous local";
4018 else if (oldglobal
!= NULL_TREE
)
4019 /* XXX shadow warnings in outer-more namespaces */
4020 warnstring
= "declaration of `%s' shadows global declaration";
4023 warning (warnstring
, IDENTIFIER_POINTER (name
));
4027 if (TREE_CODE (x
) == FUNCTION_DECL
)
4028 check_default_args (x
);
4030 /* Keep count of variables in this level with incomplete type. */
4031 if (TREE_CODE (x
) == VAR_DECL
4032 && TREE_TYPE (x
) != error_mark_node
4033 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4034 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4035 /* RTTI TD entries are created while defining the type_info. */
4036 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4037 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4038 current_binding_level
->incomplete
4039 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4042 if (need_new_binding
)
4043 add_decl_to_level (x
,
4044 DECL_NAMESPACE_SCOPE_P (x
)
4045 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4046 : current_binding_level
);
4051 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4052 caller to set DECL_CONTEXT properly. */
4055 pushdecl_with_scope (x
, level
)
4057 struct binding_level
*level
;
4059 register struct binding_level
*b
;
4060 tree function_decl
= current_function_decl
;
4062 current_function_decl
= NULL_TREE
;
4063 if (level
->parm_flag
== 2)
4065 b
= class_binding_level
;
4066 class_binding_level
= level
;
4067 pushdecl_class_level (x
);
4068 class_binding_level
= b
;
4072 b
= current_binding_level
;
4073 current_binding_level
= level
;
4075 current_binding_level
= b
;
4077 current_function_decl
= function_decl
;
4081 /* Like pushdecl, only it places X in the current namespace,
4085 pushdecl_namespace_level (x
)
4088 register struct binding_level
*b
= current_binding_level
;
4091 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4093 /* Now, the type_shadowed stack may screw us. Munge it so it does
4095 if (TREE_CODE (x
) == TYPE_DECL
)
4097 tree name
= DECL_NAME (x
);
4099 tree
*ptr
= (tree
*)0;
4100 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4102 tree shadowed
= b
->type_shadowed
;
4103 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4104 if (TREE_PURPOSE (shadowed
) == name
)
4106 ptr
= &TREE_VALUE (shadowed
);
4107 /* Can't break out of the loop here because sometimes
4108 a binding level will have duplicate bindings for
4109 PT names. It's gross, but I haven't time to fix it. */
4112 newval
= TREE_TYPE (x
);
4113 if (ptr
== (tree
*)0)
4115 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4116 up here if this is changed to an assertion. --KR */
4117 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4127 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4131 pushdecl_top_level (x
)
4134 push_to_top_level ();
4135 x
= pushdecl_namespace_level (x
);
4136 pop_from_top_level ();
4140 /* Make the declaration of X appear in CLASS scope. */
4143 pushdecl_class_level (x
)
4146 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4147 scope looks for the pre-mangled name. */
4150 if (TREE_CODE (x
) == OVERLOAD
)
4151 x
= OVL_CURRENT (x
);
4152 name
= DECL_NAME (x
);
4156 push_class_level_binding (name
, x
);
4157 if (TREE_CODE (x
) == TYPE_DECL
)
4158 set_identifier_type_value (name
, TREE_TYPE (x
));
4160 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4164 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4167 pushdecl_class_level (f
);
4171 /* Enter DECL into the symbol table, if that's appropriate. Returns
4172 DECL, or a modified version thereof. */
4175 maybe_push_decl (decl
)
4178 tree type
= TREE_TYPE (decl
);
4180 /* Add this decl to the current binding level, but not if it comes
4181 from another scope, e.g. a static member variable. TEM may equal
4182 DECL or it may be a previous decl of the same name. */
4183 if ((TREE_CODE (decl
) != PARM_DECL
4184 && DECL_CONTEXT (decl
) != NULL_TREE
4185 /* Definitions of namespace members outside their namespace are
4187 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4188 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4189 || TREE_CODE (type
) == UNKNOWN_TYPE
4190 /* The declaration of a template specialization does not affect
4191 the functions available for overload resolution, so we do not
4193 || (TREE_CODE (decl
) == FUNCTION_DECL
4194 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4197 return pushdecl (decl
);
4201 /* This function is used to push the mangled decls for nested types into
4202 the appropriate scope. Previously pushdecl_top_level was used, but that
4203 is incorrect for members of local classes. */
4206 pushdecl_nonclass_level (x
)
4209 struct binding_level
*b
= current_binding_level
;
4211 my_friendly_assert (b
->parm_flag
!= 2, 180);
4214 /* Get out of template binding levels */
4215 while (b
->pseudo_global
)
4219 pushdecl_with_scope (x
, b
);
4223 /* Make the declaration(s) of X appear in CLASS scope
4224 under the name NAME. */
4227 push_class_level_binding (name
, x
)
4232 /* The class_binding_level will be NULL if x is a template
4233 parameter name in a member template. */
4234 if (!class_binding_level
)
4237 /* Make sure that this new member does not have the same name
4238 as a template parameter. */
4239 if (TYPE_BEING_DEFINED (current_class_type
))
4240 check_template_shadow (x
);
4242 /* If this declaration shadows a declaration from an enclosing
4243 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4244 we leave this class. Record the shadowed declaration here. */
4245 binding
= IDENTIFIER_BINDING (name
);
4247 && ((TREE_CODE (x
) == OVERLOAD
4248 && BINDING_VALUE (binding
)
4249 && is_overloaded_fn (BINDING_VALUE (binding
)))
4250 || INHERITED_VALUE_BINDING_P (binding
)))
4255 /* If the old binding was from a base class, and was for a tag
4256 name, slide it over to make room for the new binding. The
4257 old binding is still visible if explicitly qualified with a
4259 if (INHERITED_VALUE_BINDING_P (binding
)
4260 && BINDING_VALUE (binding
)
4261 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4262 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4263 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4265 old_decl
= BINDING_TYPE (binding
);
4266 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4267 BINDING_VALUE (binding
) = NULL_TREE
;
4268 INHERITED_VALUE_BINDING_P (binding
) = 0;
4271 old_decl
= BINDING_VALUE (binding
);
4273 /* There was already a binding for X containing fewer
4274 functions than are named in X. Find the previous
4275 declaration of X on the class-shadowed list, and update it. */
4276 for (shadow
= class_binding_level
->class_shadowed
;
4278 shadow
= TREE_CHAIN (shadow
))
4279 if (TREE_PURPOSE (shadow
) == name
4280 && TREE_TYPE (shadow
) == old_decl
)
4282 BINDING_VALUE (binding
) = x
;
4283 INHERITED_VALUE_BINDING_P (binding
) = 0;
4284 TREE_TYPE (shadow
) = x
;
4289 /* If we didn't replace an existing binding, put the binding on the
4290 stack of bindings for the identifier, and update
4291 IDENTIFIER_CLASS_VALUE. */
4292 if (push_class_binding (name
, x
))
4294 class_binding_level
->class_shadowed
4295 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4296 class_binding_level
->class_shadowed
);
4297 /* Record the value we are binding NAME to so that we can know
4298 what to pop later. */
4299 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4303 /* Insert another USING_DECL into the current binding level,
4304 returning this declaration. If this is a redeclaration,
4305 do nothing and return NULL_TREE. */
4308 push_using_decl (scope
, name
)
4314 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4315 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4316 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4317 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4321 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4322 DECL_INITIAL (decl
) = scope
;
4323 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4324 current_binding_level
->usings
= decl
;
4328 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4329 changed (i.e. there was already a directive), or the fresh
4330 TREE_LIST otherwise. */
4333 push_using_directive (used
)
4336 tree ud
= current_binding_level
->using_directives
;
4337 tree iter
, ancestor
;
4339 /* Check if we already have this. */
4340 if (purpose_member (used
, ud
) != NULL_TREE
)
4343 /* Recursively add all namespaces used. */
4344 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4345 push_using_directive (TREE_PURPOSE (iter
));
4347 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4348 ud
= current_binding_level
->using_directives
;
4349 ud
= tree_cons (used
, ancestor
, ud
);
4350 current_binding_level
->using_directives
= ud
;
4354 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4355 other definitions already in place. We get around this by making
4356 the value of the identifier point to a list of all the things that
4357 want to be referenced by that name. It is then up to the users of
4358 that name to decide what to do with that list.
4360 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4361 slot. It is dealt with the same way.
4363 FLAGS is a bitwise-or of the following values:
4364 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4366 PUSH_USING: DECL is being pushed as the result of a using
4369 The value returned may be a previous declaration if we guessed wrong
4370 about what language DECL should belong to (C or C++). Otherwise,
4371 it's always DECL (and never something that's not a _DECL). */
4374 push_overloaded_decl (decl
, flags
)
4378 tree name
= DECL_NAME (decl
);
4381 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4384 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4386 old
= lookup_name_current_level (name
);
4390 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4392 tree t
= TREE_TYPE (old
);
4393 if (IS_AGGR_TYPE (t
) && warn_shadow
4394 && (! DECL_IN_SYSTEM_HEADER (decl
)
4395 || ! DECL_IN_SYSTEM_HEADER (old
)))
4396 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4399 else if (is_overloaded_fn (old
))
4403 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4405 tree fn
= OVL_CURRENT (tmp
);
4407 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4408 && !(flags
& PUSH_USING
)
4409 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4410 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4411 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4414 if (duplicate_decls (decl
, fn
))
4420 cp_error_at ("previous non-function declaration `%#D'", old
);
4421 cp_error ("conflicts with function declaration `%#D'", decl
);
4426 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4428 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4429 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4431 new_binding
= ovl_cons (decl
, old
);
4432 if (flags
& PUSH_USING
)
4433 OVL_USED (new_binding
) = 1;
4436 /* NAME is not ambiguous. */
4440 set_namespace_binding (name
, current_namespace
, new_binding
);
4443 /* We only create an OVERLOAD if there was a previous binding at
4444 this level, or if decl is a template. In the former case, we
4445 need to remove the old binding and replace it with the new
4446 binding. We must also run through the NAMES on the binding
4447 level where the name was bound to update the chain. */
4449 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4453 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4455 d
= &TREE_CHAIN (*d
))
4457 || (TREE_CODE (*d
) == TREE_LIST
4458 && TREE_VALUE (*d
) == old
))
4460 if (TREE_CODE (*d
) == TREE_LIST
)
4461 /* Just replace the old binding with the new. */
4462 TREE_VALUE (*d
) = new_binding
;
4464 /* Build a TREE_LIST to wrap the OVERLOAD. */
4465 *d
= tree_cons (NULL_TREE
, new_binding
,
4468 /* And update the CPLUS_BINDING node. */
4469 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4474 /* We should always find a previous binding in this case. */
4475 my_friendly_abort (0);
4478 /* Install the new binding. */
4479 push_local_binding (name
, new_binding
, flags
);
4485 /* Generate an implicit declaration for identifier FUNCTIONID
4486 as a function of type int (). Print a warning if appropriate. */
4489 implicitly_declare (functionid
)
4493 int temp
= allocation_temporary_p ();
4495 push_obstacks_nochange ();
4497 /* Save the decl permanently so we can warn if definition follows.
4498 In ANSI C, warn_implicit is usually false, so the saves little space.
4499 But in C++, it's usually true, hence the extra code. */
4500 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4501 end_temporary_allocation ();
4503 /* We used to reuse an old implicit decl here,
4504 but this loses with inline functions because it can clobber
4505 the saved decl chains. */
4506 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4508 DECL_EXTERNAL (decl
) = 1;
4509 TREE_PUBLIC (decl
) = 1;
4511 /* ANSI standard says implicit declarations are in the innermost block.
4512 So we record the decl in the standard fashion. */
4514 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4517 /* Only one warning per identifier. */
4518 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4520 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4523 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4530 /* Return zero if the declaration NEWDECL is valid
4531 when the declaration OLDDECL (assumed to be for the same name)
4532 has already been seen.
4533 Otherwise return an error message format string with a %s
4534 where the identifier should go. */
4537 redeclaration_error_message (newdecl
, olddecl
)
4538 tree newdecl
, olddecl
;
4540 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4542 /* Because C++ can put things into name space for free,
4543 constructs like "typedef struct foo { ... } foo"
4544 would look like an erroneous redeclaration. */
4545 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4548 return "redefinition of `%#D'";
4550 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4552 /* If this is a pure function, its olddecl will actually be
4553 the original initialization to `0' (which we force to call
4554 abort()). Don't complain about redefinition in this case. */
4555 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4558 /* If both functions come from different namespaces, this is not
4559 a redeclaration - this is a conflict with a used function. */
4560 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4561 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4562 return "`%D' conflicts with used function";
4564 /* We'll complain about linkage mismatches in
4565 warn_extern_redeclared_static. */
4567 /* Defining the same name twice is no good. */
4568 if (DECL_INITIAL (olddecl
) != NULL_TREE
4569 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4571 if (DECL_NAME (olddecl
) == NULL_TREE
)
4572 return "`%#D' not declared in class";
4574 return "redefinition of `%#D'";
4578 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4580 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4581 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4582 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4583 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4584 && TYPE_SIZE (TREE_TYPE (newdecl
))
4585 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4586 return "redefinition of `%#D'";
4589 else if (toplevel_bindings_p ())
4591 /* Objects declared at top level: */
4592 /* If at least one is a reference, it's ok. */
4593 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4595 /* Reject two definitions. */
4596 return "redefinition of `%#D'";
4600 /* Objects declared with block scope: */
4601 /* Reject two definitions, and reject a definition
4602 together with an external reference. */
4603 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4604 return "redeclaration of `%#D'";
4609 /* Create a new label, named ID. */
4612 make_label_decl (id
, local_p
)
4618 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4620 /* Make sure every label has an rtx. */
4623 DECL_CONTEXT (decl
) = current_function_decl
;
4624 DECL_MODE (decl
) = VOIDmode
;
4625 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4627 /* Say where one reference is to the label, for the sake of the
4628 error if it is not defined. */
4629 DECL_SOURCE_LINE (decl
) = lineno
;
4630 DECL_SOURCE_FILE (decl
) = input_filename
;
4632 /* Record the fact that this identifier is bound to this label. */
4633 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4635 /* Record this label on the list of used labels so that we can check
4636 at the end of the function to see whether or not the label was
4637 actually defined. */
4638 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4639 && (named_label_uses
== NULL
4640 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4641 || named_label_uses
->label_decl
!= decl
))
4643 struct named_label_list
*new_ent
;
4645 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4646 new_ent
->label_decl
= decl
;
4647 new_ent
->names_in_scope
= current_binding_level
->names
;
4648 new_ent
->binding_level
= current_binding_level
;
4649 new_ent
->lineno_o_goto
= lineno
;
4650 new_ent
->filename_o_goto
= input_filename
;
4651 new_ent
->next
= named_label_uses
;
4652 named_label_uses
= new_ent
;
4658 /* Look for a label named ID in the current function. If one cannot
4659 be found, create one. (We keep track of used, but undefined,
4660 labels, and complain about them at the end of a function.) */
4668 /* You can't use labels at global scope. */
4669 if (current_function_decl
== NULL_TREE
)
4671 error ("label `%s' referenced outside of any function",
4672 IDENTIFIER_POINTER (id
));
4676 /* See if we've already got this label. */
4677 decl
= IDENTIFIER_LABEL_VALUE (id
);
4678 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4681 /* Record this label on the list of labels used in this function.
4682 We do this before calling make_label_decl so that we get the
4683 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4684 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4686 /* We need a new label. */
4687 decl
= make_label_decl (id
, /*local_p=*/0);
4688 /* Now fill in the information we didn't have before. */
4689 TREE_VALUE (named_labels
) = decl
;
4694 /* Declare a local label named ID. */
4697 declare_local_label (id
)
4702 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4703 this scope we can restore the old value of
4704 IDENTIFIER_TYPE_VALUE. */
4705 current_binding_level
->shadowed_labels
4706 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4707 current_binding_level
->shadowed_labels
);
4708 /* Look for the label. */
4709 decl
= make_label_decl (id
, /*local_p=*/1);
4710 /* Now fill in the information we didn't have before. */
4711 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4716 /* Define a label, specifying the location in the source file.
4717 Return the LABEL_DECL node for the label, if the definition is valid.
4718 Otherwise return 0. */
4721 define_label (filename
, line
, name
)
4726 tree decl
= lookup_label (name
);
4728 /* After labels, make any new cleanups go into their
4729 own new (temporary) binding contour. */
4730 current_binding_level
->more_cleanups_ok
= 0;
4732 if (name
== get_identifier ("wchar_t"))
4733 cp_pedwarn ("label named wchar_t");
4735 if (DECL_INITIAL (decl
) != NULL_TREE
)
4737 cp_error ("duplicate label `%D'", decl
);
4742 struct named_label_list
*uses
, *prev
;
4746 /* Mark label as having been defined. */
4747 DECL_INITIAL (decl
) = error_mark_node
;
4748 /* Say where in the source. */
4749 DECL_SOURCE_FILE (decl
) = filename
;
4750 DECL_SOURCE_LINE (decl
) = line
;
4753 uses
= named_label_uses
;
4754 while (uses
!= NULL
)
4755 if (uses
->label_decl
== decl
)
4757 struct binding_level
*b
= current_binding_level
;
4760 tree new_decls
= b
->names
;
4761 tree old_decls
= (b
== uses
->binding_level
)
4762 ? uses
->names_in_scope
: NULL_TREE
;
4763 while (new_decls
!= old_decls
)
4765 if (TREE_CODE (new_decls
) == VAR_DECL
4766 /* Don't complain about crossing initialization
4767 of internal entities. They can't be accessed,
4768 and they should be cleaned up
4769 by the time we get to the label. */
4770 && ! DECL_ARTIFICIAL (new_decls
)
4771 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4772 && pod_type_p (TREE_TYPE (new_decls
))))
4774 /* This is really only important if we're crossing
4775 an initialization. The POD stuff is just
4776 pedantry; why should it matter if the class
4777 contains a field of pointer to member type? */
4778 int problem
= (DECL_INITIAL (new_decls
)
4779 || (TYPE_NEEDS_CONSTRUCTING
4780 (TREE_TYPE (new_decls
))));
4786 cp_error ("jump to label `%D'", decl
);
4787 error_with_file_and_line
4788 (uses
->filename_o_goto
,
4789 uses
->lineno_o_goto
, " from here");
4793 cp_pedwarn ("jump to label `%D'", decl
);
4794 pedwarn_with_file_and_line
4795 (uses
->filename_o_goto
,
4796 uses
->lineno_o_goto
, " from here");
4802 cp_error_at (" crosses initialization of `%#D'",
4805 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4808 new_decls
= TREE_CHAIN (new_decls
);
4810 if (b
== uses
->binding_level
)
4812 if (b
->eh_region
&& ! saw_eh
)
4816 cp_error ("jump to label `%D'", decl
);
4817 error_with_file_and_line
4818 (uses
->filename_o_goto
,
4819 uses
->lineno_o_goto
, " from here");
4822 error (" enters exception handling block");
4829 prev
->next
= uses
->next
;
4831 named_label_uses
= uses
->next
;
4840 current_function_return_value
= NULL_TREE
;
4847 struct binding_level
*level
;
4848 struct cp_switch
*next
;
4851 static struct cp_switch
*switch_stack
;
4857 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4858 p
->level
= current_binding_level
;
4859 p
->next
= switch_stack
;
4866 switch_stack
= switch_stack
->next
;
4869 /* Note that we've seen a definition of a case label, and complain if this
4870 is a bad place for one. */
4873 define_case_label ()
4875 tree cleanup
= last_cleanup_this_contour ();
4876 struct binding_level
*b
= current_binding_level
;
4880 /* Don't crash; we'll complain in do_case. */
4885 static int explained
= 0;
4886 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4887 warning ("where case label appears here");
4890 warning ("(enclose actions of previous case statements requiring");
4891 warning ("destructors in their own binding contours.)");
4896 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4898 tree new_decls
= b
->names
;
4899 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4901 if (TREE_CODE (new_decls
) == VAR_DECL
4902 /* Don't complain about crossing initialization
4903 of internal entities. They can't be accessed,
4904 and they should be cleaned up
4905 by the time we get to the label. */
4906 && ! DECL_ARTIFICIAL (new_decls
)
4907 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4908 && DECL_INITIAL (new_decls
) != error_mark_node
)
4909 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4912 error ("jump to case label");
4914 cp_error_at (" crosses initialization of `%#D'",
4920 /* After labels, make any new cleanups go into their
4921 own new (temporary) binding contour. */
4923 current_binding_level
->more_cleanups_ok
= 0;
4924 current_function_return_value
= NULL_TREE
;
4927 /* Return the list of declarations of the current level.
4928 Note that this list is in reverse order unless/until
4929 you nreverse it; and when you do nreverse it, you must
4930 store the result back using `storedecls' or you will lose. */
4935 return current_binding_level
->names
;
4938 /* Return the list of type-tags (for structs, etc) of the current level. */
4943 return current_binding_level
->tags
;
4946 /* Store the list of declarations of the current level.
4947 This is done for the parameter declarations of a function being defined,
4948 after they are modified in the light of any missing parameters. */
4954 current_binding_level
->names
= decls
;
4957 /* Similarly, store the list of tags of the current level. */
4963 current_binding_level
->tags
= tags
;
4966 /* Given NAME, an IDENTIFIER_NODE,
4967 return the structure (or union or enum) definition for that name.
4968 Searches binding levels from BINDING_LEVEL up to the global level.
4969 If THISLEVEL_ONLY is nonzero, searches only the specified context
4970 (but skips any tag-transparent contexts to find one that is
4971 meaningful for tags).
4972 FORM says which kind of type the caller wants;
4973 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4974 If the wrong kind of type is found, and it's not a template, an error is
4978 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4979 enum tree_code form
;
4981 struct binding_level
*binding_level
;
4984 register struct binding_level
*level
;
4985 /* Non-zero if, we should look past a pseudo-global level, even if
4987 int allow_pseudo_global
= 1;
4989 for (level
= binding_level
; level
; level
= level
->level_chain
)
4992 if (ANON_AGGRNAME_P (name
))
4993 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4995 /* There's no need for error checking here, because
4996 anon names are unique throughout the compilation. */
4997 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4998 return TREE_VALUE (tail
);
5000 else if (level
->namespace_p
)
5001 /* Do namespace lookup. */
5002 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5004 tree old
= binding_for_name (name
, tail
);
5006 /* If we just skipped past a pseudo global level, even
5007 though THISLEVEL_ONLY, and we find a template class
5008 declaration, then we use the _TYPE node for the
5009 template. See the example below. */
5010 if (thislevel_only
&& !allow_pseudo_global
5011 && old
&& BINDING_VALUE (old
)
5012 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5013 old
= TREE_TYPE (BINDING_VALUE (old
));
5015 old
= BINDING_TYPE (old
);
5017 /* If it has an original type, it is a typedef, and we
5018 should not return it. */
5019 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5021 if (old
&& TREE_CODE (old
) != form
5022 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5024 cp_error ("`%#D' redeclared as %C", old
, form
);
5029 if (thislevel_only
|| tail
== global_namespace
)
5033 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5035 if (TREE_PURPOSE (tail
) == name
)
5037 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5038 /* Should tighten this up; it'll probably permit
5039 UNION_TYPE and a struct template, for example. */
5041 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5043 /* Definition isn't the kind we were looking for. */
5044 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5048 return TREE_VALUE (tail
);
5051 if (thislevel_only
&& ! level
->tag_transparent
)
5053 if (level
->pseudo_global
&& allow_pseudo_global
)
5055 /* We must deal with cases like this:
5057 template <class T> struct S;
5058 template <class T> struct S {};
5060 When looking up `S', for the second declaration, we
5061 would like to find the first declaration. But, we
5062 are in the pseudo-global level created for the
5063 template parameters, rather than the (surrounding)
5064 namespace level. Thus, we keep going one more level,
5065 even though THISLEVEL_ONLY is non-zero. */
5066 allow_pseudo_global
= 0;
5078 set_current_level_tags_transparency (tags_transparent
)
5079 int tags_transparent
;
5081 current_binding_level
->tag_transparent
= tags_transparent
;
5085 /* Given a type, find the tag that was defined for it and return the tag name.
5086 Otherwise return 0. However, the value can never be 0
5087 in the cases in which this is used.
5089 C++: If NAME is non-zero, this is the new name to install. This is
5090 done when replacing anonymous tags with real tag names. */
5093 lookup_tag_reverse (type
, name
)
5097 register struct binding_level
*level
;
5099 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5102 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5104 if (TREE_VALUE (tail
) == type
)
5107 TREE_PURPOSE (tail
) = name
;
5108 return TREE_PURPOSE (tail
);
5115 /* Look up NAME in the NAMESPACE. */
5118 lookup_namespace_name (namespace, name
)
5119 tree
namespace, name
;
5122 tree template_id
= NULL_TREE
;
5124 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5126 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5127 /* This happens for A::B<int> when B is a namespace. */
5129 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5131 /* This happens for A::B where B is a template, and there are no
5132 template arguments. */
5133 cp_error ("invalid use of `%D'", name
);
5134 return error_mark_node
;
5137 namespace = ORIGINAL_NAMESPACE (namespace);
5139 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5142 name
= TREE_OPERAND (name
, 0);
5143 if (TREE_CODE (name
) == OVERLOAD
)
5144 name
= DECL_NAME (OVL_CURRENT (name
));
5145 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5146 name
= DECL_NAME (name
);
5149 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5151 val
= make_node (CPLUS_BINDING
);
5152 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5153 return error_mark_node
;
5155 if (BINDING_VALUE (val
))
5157 val
= BINDING_VALUE (val
);
5161 if (DECL_CLASS_TEMPLATE_P (val
))
5162 val
= lookup_template_class (val
,
5163 TREE_OPERAND (template_id
, 1),
5164 /*in_decl=*/NULL_TREE
,
5165 /*context=*/NULL_TREE
,
5166 /*entering_scope=*/0);
5167 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5168 || TREE_CODE (val
) == OVERLOAD
)
5169 val
= lookup_template_function (val
,
5170 TREE_OPERAND (template_id
, 1));
5173 cp_error ("`%D::%D' is not a template",
5175 return error_mark_node
;
5179 /* If we have a single function from a using decl, pull it out. */
5180 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5181 val
= OVL_FUNCTION (val
);
5185 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5186 return error_mark_node
;
5189 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5191 static unsigned long
5199 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5200 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5205 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5208 typename_compare (k1
, k2
)
5219 d1
= TYPE_NAME (t1
);
5220 d2
= TYPE_NAME (t2
);
5222 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5223 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5224 && ((TREE_TYPE (t1
) != NULL_TREE
)
5225 == (TREE_TYPE (t2
) != NULL_TREE
))
5226 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5227 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5230 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5231 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5232 is non-NULL, this type is being created by the implicit typename
5233 extension, and BASE_TYPE is a type named `t' in some base class of
5234 `T' which depends on template parameters.
5236 Returns the new TYPENAME_TYPE. */
5239 build_typename_type (context
, name
, fullname
, base_type
)
5247 struct hash_entry
* e
;
5249 static struct hash_table ht
;
5251 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5255 static struct hash_table
*h
= &ht
;
5256 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5258 fatal ("virtual memory exhausted");
5259 ggc_add_tree_hash_table_root (&h
, 1);
5262 /* Build the TYPENAME_TYPE. */
5263 t
= make_lang_type (TYPENAME_TYPE
);
5264 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5265 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5266 TREE_TYPE (t
) = base_type
;
5268 /* Build the corresponding TYPE_DECL. */
5269 d
= build_decl (TYPE_DECL
, name
, t
);
5270 TYPE_NAME (TREE_TYPE (d
)) = d
;
5271 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5272 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5273 DECL_ARTIFICIAL (d
) = 1;
5275 /* See if we already have this type. */
5276 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5280 /* Insert the type into the table. */
5281 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5289 make_typename_type (context
, name
)
5294 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5296 if (!(TYPE_LANG_SPECIFIC (name
)
5297 && (CLASSTYPE_IS_TEMPLATE (name
)
5298 || CLASSTYPE_USE_TEMPLATE (name
))))
5299 name
= TYPE_IDENTIFIER (name
);
5301 /* Create a TEMPLATE_ID_EXPR for the type. */
5302 name
= build_nt (TEMPLATE_ID_EXPR
,
5303 CLASSTYPE_TI_TEMPLATE (name
),
5304 CLASSTYPE_TI_ARGS (name
));
5306 else if (TREE_CODE (name
) == TYPE_DECL
)
5307 name
= DECL_NAME (name
);
5311 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5313 name
= TREE_OPERAND (name
, 0);
5314 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5315 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5317 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5318 my_friendly_abort (2000);
5320 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5322 /* We can get here from typename_sub0 in the explicit_template_type
5323 expansion. Just fail. */
5324 cp_error ("no class template named `%#T' in `%#T'",
5326 return error_mark_node
;
5329 if (! uses_template_parms (context
)
5330 || currently_open_class (context
))
5332 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5334 tree tmpl
= NULL_TREE
;
5335 if (IS_AGGR_TYPE (context
))
5336 tmpl
= lookup_field (context
, name
, 0, 0);
5337 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5339 cp_error ("no class template named `%#T' in `%#T'",
5341 return error_mark_node
;
5344 return lookup_template_class (tmpl
,
5345 TREE_OPERAND (fullname
, 1),
5347 /*entering_scope=*/0);
5353 if (!IS_AGGR_TYPE (context
))
5355 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5356 return error_mark_node
;
5359 t
= lookup_field (context
, name
, 0, 1);
5361 return TREE_TYPE (t
);
5365 /* If the CONTEXT is not a template type, then either the field is
5366 there now or its never going to be. */
5367 if (!uses_template_parms (context
))
5369 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5370 return error_mark_node
;
5374 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5377 /* Select the right _DECL from multiple choices. */
5380 select_decl (binding
, flags
)
5385 val
= BINDING_VALUE (binding
);
5386 if (LOOKUP_NAMESPACES_ONLY (flags
))
5388 /* We are not interested in types. */
5389 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5394 /* If we could have a type and
5395 we have nothing or we need a type and have none. */
5396 if (BINDING_TYPE (binding
)
5397 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5398 && TREE_CODE (val
) != TYPE_DECL
)))
5399 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5400 /* Don't return non-types if we really prefer types. */
5401 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5402 && (TREE_CODE (val
) != TEMPLATE_DECL
5403 || !DECL_CLASS_TEMPLATE_P (val
)))
5409 /* Unscoped lookup of a global: iterate over current namespaces,
5410 considering using-directives. If SPACESP is non-NULL, store a list
5411 of the namespaces we've considered in it. */
5414 unqualified_namespace_lookup (name
, flags
, spacesp
)
5419 tree b
= make_node (CPLUS_BINDING
);
5420 tree initial
= current_decl_namespace();
5421 tree scope
= initial
;
5423 struct binding_level
*level
;
5424 tree val
= NULL_TREE
;
5427 *spacesp
= NULL_TREE
;
5429 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5432 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5433 val
= binding_for_name (name
, scope
);
5435 /* Initialize binding for this context. */
5436 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5437 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5439 /* Add all _DECLs seen through local using-directives. */
5440 for (level
= current_binding_level
;
5441 !level
->namespace_p
;
5442 level
= level
->level_chain
)
5443 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5444 scope
, flags
, spacesp
))
5445 /* Give up because of error. */
5446 return error_mark_node
;
5448 /* Add all _DECLs seen through global using-directives. */
5449 /* XXX local and global using lists should work equally. */
5453 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5454 scope
, flags
, spacesp
))
5455 /* Give up because of error. */
5456 return error_mark_node
;
5457 if (siter
== scope
) break;
5458 siter
= CP_DECL_CONTEXT (siter
);
5461 val
= select_decl (b
, flags
);
5462 if (scope
== global_namespace
)
5468 /* Combine prefer_type and namespaces_only into flags. */
5471 lookup_flags (prefer_type
, namespaces_only
)
5472 int prefer_type
, namespaces_only
;
5474 if (namespaces_only
)
5475 return LOOKUP_PREFER_NAMESPACES
;
5476 if (prefer_type
> 1)
5477 return LOOKUP_PREFER_TYPES
;
5478 if (prefer_type
> 0)
5479 return LOOKUP_PREFER_BOTH
;
5483 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5484 ignore it or not. Subroutine of lookup_name_real. */
5487 qualify_lookup (val
, flags
)
5491 if (val
== NULL_TREE
)
5493 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5495 if ((flags
& LOOKUP_PREFER_TYPES
)
5496 && (TREE_CODE (val
) == TYPE_DECL
5497 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5498 && DECL_CLASS_TEMPLATE_P (val
))))
5500 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5505 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5509 warn_about_implicit_typename_lookup (typename
, binding
)
5513 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5514 tree name
= DECL_NAME (typename
);
5516 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5517 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5518 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5519 && ! (TREE_CODE (binding
) == TYPE_DECL
5520 && same_type_p (TREE_TYPE (binding
), subtype
)))
5522 cp_warning ("lookup of `%D' finds `%#D'",
5524 cp_warning (" instead of `%D' from dependent base class",
5526 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5527 constructor_name (current_class_type
), name
);
5531 /* Look up NAME in the current binding level and its superiors in the
5532 namespace of variables, functions and typedefs. Return a ..._DECL
5533 node of some kind representing its definition if there is only one
5534 such declaration, or return a TREE_LIST with all the overloaded
5535 definitions if there are many, or return 0 if it is undefined.
5537 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5538 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5539 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5540 Otherwise we prefer non-TYPE_DECLs.
5542 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5543 using IDENTIFIER_CLASS_VALUE. */
5546 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5548 int prefer_type
, nonclass
, namespaces_only
;
5551 tree val
= NULL_TREE
;
5553 tree from_obj
= NULL_TREE
;
5555 int val_is_implicit_typename
= 0;
5557 /* Hack: copy flag set by parser, if set. */
5558 if (only_namespace_names
)
5559 namespaces_only
= 1;
5561 if (prefer_type
== -2)
5563 extern int looking_for_typename
;
5564 tree type
= NULL_TREE
;
5567 prefer_type
= looking_for_typename
;
5569 flags
= lookup_flags (prefer_type
, namespaces_only
);
5570 /* If the next thing is '<', class templates are types. */
5571 if (looking_for_template
)
5572 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5574 /* std:: becomes :: for now. */
5575 if (got_scope
== std_node
)
5576 got_scope
= void_type_node
;
5580 else if (got_object
!= error_mark_node
)
5585 if (type
== error_mark_node
)
5586 return error_mark_node
;
5587 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5588 type
= TREE_TYPE (type
);
5591 type
= complete_type (type
);
5593 if (TREE_CODE (type
) == VOID_TYPE
)
5594 type
= global_namespace
;
5595 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5597 val
= make_node (CPLUS_BINDING
);
5598 flags
|= LOOKUP_COMPLAIN
;
5599 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5601 val
= select_decl (val
, flags
);
5603 else if (! IS_AGGR_TYPE (type
)
5604 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5605 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5606 || TREE_CODE (type
) == TYPENAME_TYPE
)
5607 /* Someone else will give an error about this if needed. */
5609 else if (type
== current_class_type
)
5610 val
= IDENTIFIER_CLASS_VALUE (name
);
5612 val
= lookup_member (type
, name
, 0, prefer_type
);
5619 else if (got_object
&& val
)
5624 flags
= lookup_flags (prefer_type
, namespaces_only
);
5625 /* If we're not parsing, we need to complain. */
5626 flags
|= LOOKUP_COMPLAIN
;
5629 /* First, look in non-namespace scopes. */
5631 if (current_class_type
== NULL_TREE
)
5634 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5638 if (!LOCAL_BINDING_P (t
) && nonclass
)
5639 /* We're not looking for class-scoped bindings, so keep going. */
5642 /* If this is the kind of thing we're looking for, we're done. */
5643 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5644 binding
= BINDING_VALUE (t
);
5645 else if ((flags
& LOOKUP_PREFER_TYPES
)
5646 && qualify_lookup (BINDING_TYPE (t
), flags
))
5647 binding
= BINDING_TYPE (t
);
5649 binding
= NULL_TREE
;
5652 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5654 if (val_is_implicit_typename
&& !yylex
)
5655 warn_about_implicit_typename_lookup (val
, binding
);
5657 val_is_implicit_typename
5658 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5659 if (!val_is_implicit_typename
)
5664 /* Now lookup in namespace scopes. */
5665 if (!val
|| val_is_implicit_typename
)
5667 t
= unqualified_namespace_lookup (name
, flags
, 0);
5670 if (val_is_implicit_typename
&& !yylex
)
5671 warn_about_implicit_typename_lookup (val
, t
);
5679 /* This should only warn about types used in qualified-ids. */
5680 if (from_obj
&& from_obj
!= val
)
5682 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5683 && TREE_CODE (val
) == TYPE_DECL
5684 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5686 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5687 name
, got_object
, TREE_TYPE (from_obj
));
5688 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5692 /* We don't change val to from_obj if got_object depends on
5693 template parms because that breaks implicit typename for
5694 destructor calls. */
5695 if (! uses_template_parms (got_object
))
5699 /* If we have a single function from a using decl, pull it out. */
5700 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5701 val
= OVL_FUNCTION (val
);
5710 lookup_name_nonclass (name
)
5713 return lookup_name_real (name
, 0, 1, 0);
5717 lookup_function_nonclass (name
, args
)
5721 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5725 lookup_name_namespace_only (name
)
5728 /* type-or-namespace, nonclass, namespace_only */
5729 return lookup_name_real (name
, 1, 1, 1);
5733 lookup_name (name
, prefer_type
)
5737 return lookup_name_real (name
, prefer_type
, 0, 0);
5740 /* Similar to `lookup_name' but look only in the innermost non-class
5744 lookup_name_current_level (name
)
5747 struct binding_level
*b
;
5750 b
= current_binding_level
;
5751 while (b
->parm_flag
== 2)
5756 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5758 /* extern "C" function() */
5759 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5762 else if (IDENTIFIER_BINDING (name
)
5763 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5767 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5768 return IDENTIFIER_VALUE (name
);
5780 /* Like lookup_name_current_level, but for types. */
5783 lookup_type_current_level (name
)
5786 register tree t
= NULL_TREE
;
5788 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5790 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5791 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5793 struct binding_level
*b
= current_binding_level
;
5796 if (purpose_member (name
, b
->type_shadowed
))
5797 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5809 begin_only_namespace_names ()
5811 only_namespace_names
= 1;
5815 end_only_namespace_names ()
5817 only_namespace_names
= 0;
5820 /* Arrange for the user to get a source line number, even when the
5821 compiler is going down in flames, so that she at least has a
5822 chance of working around problems in the compiler. We used to
5823 call error(), but that let the segmentation fault continue
5824 through; now, it's much more passive by asking them to send the
5825 maintainers mail about the problem. */
5829 int sig ATTRIBUTE_UNUSED
;
5831 signal (SIGSEGV
, SIG_DFL
);
5833 signal (SIGIOT
, SIG_DFL
);
5836 signal (SIGILL
, SIG_DFL
);
5839 signal (SIGABRT
, SIG_DFL
);
5842 signal (SIGBUS
, SIG_DFL
);
5844 my_friendly_abort (0);
5847 /* Push the declarations of builtin types into the namespace.
5848 RID_INDEX, if < RID_MAX is the index of the builtin type
5849 in the array RID_POINTERS. NAME is the name used when looking
5850 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5853 record_builtin_type (rid_index
, name
, type
)
5858 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5859 tree tdecl
= NULL_TREE
;
5861 if ((int) rid_index
< (int) RID_MAX
)
5862 rname
= ridpointers
[(int) rid_index
];
5864 tname
= get_identifier (name
);
5866 TYPE_BUILT_IN (type
) = 1;
5870 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5871 set_identifier_type_value (tname
, NULL_TREE
);
5872 if ((int) rid_index
< (int) RID_MAX
)
5873 /* Built-in types live in the global namespace. */
5874 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5876 if (rname
!= NULL_TREE
)
5878 if (tname
!= NULL_TREE
)
5880 set_identifier_type_value (rname
, NULL_TREE
);
5881 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5885 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5886 set_identifier_type_value (rname
, NULL_TREE
);
5891 /* Record one of the standard Java types.
5892 * Declare it as having the given NAME.
5893 * If SIZE > 0, it is the size of one of the integral types;
5894 * otherwise it is the negative of the size of one of the other types. */
5897 record_builtin_java_type (name
, size
)
5903 type
= make_signed_type (size
);
5904 else if (size
> -32)
5905 { /* "__java_char" or ""__java_boolean". */
5906 type
= make_unsigned_type (-size
);
5907 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5910 { /* "__java_float" or ""__java_double". */
5911 type
= make_node (REAL_TYPE
);
5912 TYPE_PRECISION (type
) = - size
;
5915 record_builtin_type (RID_MAX
, name
, type
);
5916 decl
= TYPE_NAME (type
);
5918 /* Suppress generate debug symbol entries for these types,
5919 since for normal C++ they are just clutter.
5920 However, push_lang_context undoes this if extern "Java" is seen. */
5921 DECL_IGNORED_P (decl
) = 1;
5923 TYPE_FOR_JAVA (type
) = 1;
5927 /* Push a type into the namespace so that the back-ends ignore it. */
5930 record_unknown_type (type
, name
)
5934 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5935 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5936 DECL_IGNORED_P (decl
) = 1;
5937 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5938 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5939 TYPE_ALIGN (type
) = 1;
5940 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5943 /* Push overloaded decl, in global scope, with one argument so it
5944 can be used as a callback from define_function. */
5947 push_overloaded_decl_1 (x
)
5950 push_overloaded_decl (x
, PUSH_GLOBAL
);
5957 auto_function (name
, type
)
5960 return define_function
5961 (IDENTIFIER_POINTER (name
), type
, push_overloaded_decl_1
,
5962 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5966 /* Create the predefined scalar types of C,
5967 and some nodes representing standard constants (0, 1, (void *)0).
5968 Initialize the global binding level.
5969 Make definitions for built-in primitive functions. */
5972 init_decl_processing ()
5975 int wchar_type_size
;
5976 tree array_domain_type
;
5978 /* Have to make these distinct before we try using them. */
5979 lang_name_cplusplus
= get_identifier ("C++");
5980 lang_name_c
= get_identifier ("C");
5981 lang_name_java
= get_identifier ("Java");
5983 /* Let the back-end now how to save and restore language-specific
5984 per-function globals. */
5985 init_lang_status
= &push_cp_function_context
;
5986 free_lang_status
= &pop_cp_function_context
;
5987 mark_lang_status
= &mark_cp_function_context
;
5993 /* Create the global variables. */
5994 push_to_top_level ();
5996 /* Enter the global namespace. */
5997 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5998 push_namespace (get_identifier ("::"));
5999 global_namespace
= current_namespace
;
6000 current_lang_name
= NULL_TREE
;
6002 if (flag_strict_prototype
== 2)
6003 flag_strict_prototype
= pedantic
;
6004 if (! flag_permissive
&& ! pedantic
)
6005 flag_pedantic_errors
= 1;
6007 strict_prototypes_lang_c
= flag_strict_prototype
;
6010 current_lang_name
= lang_name_c
;
6012 current_function_decl
= NULL_TREE
;
6013 current_binding_level
= NULL_BINDING_LEVEL
;
6014 free_binding_level
= NULL_BINDING_LEVEL
;
6016 /* Because most segmentation signals can be traced back into user
6017 code, catch them and at least give the user a chance of working
6018 around compiler bugs. */
6019 signal (SIGSEGV
, signal_catch
);
6021 /* We will also catch aborts in the back-end through signal_catch and
6022 give the user a chance to see where the error might be, and to defeat
6023 aborts in the back-end when there have been errors previously in their
6026 signal (SIGIOT
, signal_catch
);
6029 signal (SIGILL
, signal_catch
);
6032 signal (SIGABRT
, signal_catch
);
6035 signal (SIGBUS
, signal_catch
);
6038 build_common_tree_nodes (flag_signed_char
);
6040 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6041 TREE_TYPE (error_mark_list
) = error_mark_node
;
6043 /* Make the binding_level structure for global names. */
6045 global_binding_level
= current_binding_level
;
6046 /* The global level is the namespace level of ::. */
6047 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6048 declare_namespace_level ();
6050 this_identifier
= get_identifier (THIS_NAME
);
6051 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6052 ctor_identifier
= get_identifier (CTOR_NAME
);
6053 dtor_identifier
= get_identifier (DTOR_NAME
);
6054 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6055 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6056 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6057 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6058 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6060 /* Define `int' and `char' first so that dbx will output them first. */
6061 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6062 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6064 /* `signed' is the same as `int' */
6065 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6066 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6067 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6068 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6069 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6070 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6071 record_builtin_type (RID_MAX
, "long long unsigned int",
6072 long_long_unsigned_type_node
);
6073 record_builtin_type (RID_MAX
, "long long unsigned",
6074 long_long_unsigned_type_node
);
6075 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6076 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6077 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6080 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6082 /* Define both `signed char' and `unsigned char'. */
6083 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6084 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6086 /* `unsigned long' is the standard type for sizeof.
6087 Note that stddef.h uses `unsigned long',
6088 and this must agree, even if long and int are the same size. */
6090 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6092 /* Create the widest literal types. */
6093 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6094 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6095 widest_integer_literal_type_node
));
6097 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6098 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6099 widest_unsigned_literal_type_node
));
6101 /* These are types that type_for_size and type_for_mode use. */
6102 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6103 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6104 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6105 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6106 #if HOST_BITS_PER_WIDE_INT >= 64
6107 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6109 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6110 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6111 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6112 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6113 #if HOST_BITS_PER_WIDE_INT >= 64
6114 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6117 build_common_tree_nodes_2 (flag_short_double
);
6119 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6120 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6121 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6122 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6123 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6124 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6125 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6126 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6128 integer_two_node
= build_int_2 (2, 0);
6129 TREE_TYPE (integer_two_node
) = integer_type_node
;
6130 integer_three_node
= build_int_2 (3, 0);
6131 TREE_TYPE (integer_three_node
) = integer_type_node
;
6133 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6134 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6135 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6136 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6137 TYPE_PRECISION (boolean_type_node
) = 1;
6138 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6139 boolean_false_node
= build_int_2 (0, 0);
6140 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6141 boolean_true_node
= build_int_2 (1, 0);
6142 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6144 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6145 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6146 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6148 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6149 complex_integer_type_node
));
6150 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6151 complex_float_type_node
));
6152 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6153 complex_double_type_node
));
6154 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6155 complex_long_double_type_node
));
6157 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6159 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6160 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6161 TREE_PARMLIST (void_list_node
) = 1;
6163 /* Used for expressions that do nothing, but are not errors. */
6164 void_zero_node
= build_int_2 (0, 0);
6165 TREE_TYPE (void_zero_node
) = void_type_node
;
6167 string_type_node
= build_pointer_type (char_type_node
);
6168 const_string_type_node
6169 = build_pointer_type (build_qualified_type (char_type_node
,
6171 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6173 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6176 /* Make a type to be the domain of a few array types
6177 whose domains don't really matter.
6178 200 is small enough that it always fits in size_t
6179 and large enough that it can hold most function names for the
6180 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6181 array_domain_type
= build_index_type (build_int_2 (200, 0));
6183 /* Make a type for arrays of characters.
6184 With luck nothing will ever really depend on the length of this
6186 char_array_type_node
6187 = build_array_type (char_type_node
, array_domain_type
);
6188 /* Likewise for arrays of ints. */
6190 = build_array_type (integer_type_node
, array_domain_type
);
6192 /* This is just some anonymous class type. Nobody should ever
6193 need to look inside this envelope. */
6194 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6196 if (flag_huge_objects
)
6197 delta_type_node
= long_integer_type_node
;
6199 delta_type_node
= short_integer_type_node
;
6201 default_function_type
6202 = build_function_type (integer_type_node
, NULL_TREE
);
6204 ptr_type_node
= build_pointer_type (void_type_node
);
6206 = build_pointer_type (build_qualified_type (void_type_node
,
6208 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6209 lang_type_promotes_to
= convert_type_from_ellipsis
;
6212 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6214 /* C++ extensions */
6216 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6217 record_unknown_type (unknown_type_node
, "unknown type");
6219 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6220 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6222 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6224 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6226 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6227 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6229 /* This is special for C++ so functions can be overloaded. */
6230 wchar_type_node
= get_identifier (flag_short_wchar
6231 ? "short unsigned int"
6233 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6234 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6235 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6236 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6238 = TREE_UNSIGNED (wchar_type_node
)
6239 ? unsigned_wchar_type_node
6240 : signed_wchar_type_node
;
6241 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6243 /* Artificial declaration of wchar_t -- can be bashed */
6244 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6246 pushdecl (wchar_decl_node
);
6248 /* This is for wide string constants. */
6249 wchar_array_type_node
6250 = build_array_type (wchar_type_node
, array_domain_type
);
6252 if (flag_vtable_thunks
)
6254 /* Make sure we get a unique function type, so we can give
6255 its pointer type a name. (This wins for gdb.) */
6256 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6257 TREE_TYPE (vfunc_type
) = integer_type_node
;
6258 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6259 layout_type (vfunc_type
);
6261 vtable_entry_type
= build_pointer_type (vfunc_type
);
6265 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6266 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6268 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6270 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6272 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6275 /* Make this part of an invisible union. */
6276 fields
[3] = copy_node (fields
[2]);
6277 TREE_TYPE (fields
[3]) = delta_type_node
;
6278 DECL_NAME (fields
[3]) = delta2_identifier
;
6279 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6280 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6281 TREE_UNSIGNED (fields
[3]) = 0;
6282 TREE_CHAIN (fields
[2]) = fields
[3];
6283 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6286 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6289 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6290 layout_type (vtbl_type_node
);
6291 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6292 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6293 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6294 layout_type (vtbl_ptr_type_node
);
6295 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6297 std_node
= build_decl (NAMESPACE_DECL
,
6298 get_identifier (flag_honor_std
? "fake std":"std"),
6300 pushdecl (std_node
);
6302 global_type_node
= make_node (LANG_TYPE
);
6303 record_unknown_type (global_type_node
, "global type");
6306 current_lang_name
= lang_name_cplusplus
;
6309 tree bad_alloc_type_node
, newtype
, deltype
;
6311 push_namespace (get_identifier ("std"));
6312 bad_alloc_type_node
= xref_tag
6313 (class_type_node
, get_identifier ("bad_alloc"), 1);
6316 newtype
= build_exception_variant
6317 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6318 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6319 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
);
6320 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6321 global_delete_fndecl
= auto_function (ansi_opname
[(int) DELETE_EXPR
],
6323 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6327 = define_function ("__pure_virtual", void_ftype
, 0, 0);
6329 /* Perform other language dependent initializations. */
6330 init_class_processing ();
6331 init_init_processing ();
6332 init_search_processing ();
6333 init_rtti_processing ();
6335 if (flag_exceptions
)
6336 init_exception_processing ();
6339 flag_inline_functions
= 0;
6342 if (! supports_one_only ())
6345 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6346 declare_function_name ();
6348 /* Prepare to check format strings against argument lists. */
6349 init_function_format_info ();
6351 /* Show we use EH for cleanups. */
6352 using_eh_for_cleanups ();
6354 print_error_function
= lang_print_error_function
;
6355 lang_get_alias_set
= &c_get_alias_set
;
6356 valid_lang_attribute
= cp_valid_lang_attribute
;
6358 /* Maintain consistency. Perhaps we should just complain if they
6359 say -fwritable-strings? */
6360 if (flag_writable_strings
)
6361 flag_const_strings
= 0;
6363 /* Add GC roots for all of our global variables. */
6364 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6365 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6366 ggc_add_tree_root (&integer_three_node
, 1);
6367 ggc_add_tree_root (&integer_two_node
, 1);
6368 ggc_add_tree_root (&signed_size_zero_node
, 1);
6369 ggc_add_tree_root (&size_one_node
, 1);
6370 ggc_add_tree_root (&size_zero_node
, 1);
6371 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6372 mark_binding_level
);
6373 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6374 ggc_add_tree_root (&static_ctors
, 1);
6375 ggc_add_tree_root (&static_dtors
, 1);
6376 ggc_add_tree_root (&lastiddecl
, 1);
6378 ggc_add_tree_root (&enum_next_value
, 1);
6379 ggc_add_tree_root (&last_function_parm_tags
, 1);
6380 ggc_add_tree_root (¤t_function_return_value
, 1);
6381 ggc_add_tree_root (¤t_function_parms
, 1);
6382 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6383 ggc_add_tree_root (&last_function_parms
, 1);
6384 ggc_add_tree_root (&error_mark_list
, 1);
6386 ggc_add_tree_root (&global_namespace
, 1);
6387 ggc_add_tree_root (&global_type_node
, 1);
6388 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6390 ggc_add_tree_root (&got_object
, 1);
6391 ggc_add_tree_root (&got_scope
, 1);
6393 ggc_add_tree_root (¤t_lang_name
, 1);
6394 ggc_add_tree_root (&static_aggregates
, 1);
6397 /* Function to print any language-specific context for an error message. */
6400 lang_print_error_function (file
)
6403 default_print_error_function (file
);
6404 maybe_print_template_context ();
6407 /* Make a definition for a builtin function named NAME and whose data type
6408 is TYPE. TYPE should be a function type with argument types.
6410 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6411 the name to be called if we can't opencode the function. */
6414 define_function (name
, type
, pfn
, library_name
)
6417 void (*pfn
) PROTO((tree
));
6418 const char *library_name
;
6420 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6421 DECL_EXTERNAL (decl
) = 1;
6422 TREE_PUBLIC (decl
) = 1;
6423 DECL_ARTIFICIAL (decl
) = 1;
6425 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6426 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6428 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6429 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6430 function in the namespace. */
6431 if (pfn
) (*pfn
) (decl
);
6433 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6434 make_function_rtl (decl
);
6439 /* Wrapper around define_function, for the benefit of
6440 c_common_nodes_and_builtins.
6441 FUNCTION_CODE tells later passes how to compile calls to this function.
6442 See tree.h for its possible values. */
6445 builtin_function (name
, type
, code
, class, libname
)
6449 enum built_in_class
class;
6450 const char *libname
;
6452 tree decl
= define_function (name
, type
, (void (*) PROTO((tree
)))pushdecl
,
6454 DECL_BUILT_IN_CLASS (decl
) = class;
6455 DECL_FUNCTION_CODE (decl
) = code
;
6459 /* When we call finish_struct for an anonymous union, we create
6460 default copy constructors and such. But, an anonymous union
6461 shouldn't have such things; this function undoes the damage to the
6462 anonymous union type T.
6464 (The reason that we create the synthesized methods is that we don't
6465 distinguish `union { int i; }' from `typedef union { int i; } U'.
6466 The first is an anonymous union; the second is just an ordinary
6470 fixup_anonymous_aggr (t
)
6475 /* Wipe out memory of synthesized methods */
6476 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6477 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6478 TYPE_HAS_INIT_REF (t
) = 0;
6479 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6480 TYPE_HAS_ASSIGN_REF (t
) = 0;
6481 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6483 /* Splice the implicitly generated functions out of the TYPE_METHODS
6485 q
= &TYPE_METHODS (t
);
6488 if (DECL_ARTIFICIAL (*q
))
6489 *q
= TREE_CHAIN (*q
);
6491 q
= &TREE_CHAIN (*q
);
6494 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6495 function members. */
6496 if (TYPE_METHODS (t
))
6497 error ("an anonymous union cannot have function members");
6500 /* Make sure that a declaration with no declarator is well-formed, i.e.
6501 just defines a tagged type or anonymous union.
6503 Returns the type defined, if any. */
6506 check_tag_decl (declspecs
)
6510 tree ob_modifier
= NULL_TREE
;
6512 register tree t
= NULL_TREE
;
6514 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6516 register tree value
= TREE_VALUE (link
);
6522 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6524 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6528 else if (value
== ridpointers
[(int) RID_FRIEND
])
6530 if (current_class_type
== NULL_TREE
6531 || current_scope () != current_class_type
)
6532 ob_modifier
= value
;
6534 else if (value
== ridpointers
[(int) RID_STATIC
]
6535 || value
== ridpointers
[(int) RID_EXTERN
]
6536 || value
== ridpointers
[(int) RID_AUTO
]
6537 || value
== ridpointers
[(int) RID_REGISTER
]
6538 || value
== ridpointers
[(int) RID_INLINE
]
6539 || value
== ridpointers
[(int) RID_VIRTUAL
]
6540 || value
== ridpointers
[(int) RID_CONST
]
6541 || value
== ridpointers
[(int) RID_VOLATILE
]
6542 || value
== ridpointers
[(int) RID_EXPLICIT
])
6543 ob_modifier
= value
;
6547 error ("multiple types in one declaration");
6549 /* Inside a class, we might be in a friend or access declaration.
6550 Until we have a good way of detecting the latter, don't warn. */
6551 if (t
== NULL_TREE
&& ! current_class_type
)
6552 pedwarn ("declaration does not declare anything");
6554 /* Check for an anonymous union. We're careful
6555 accessing TYPE_IDENTIFIER because some built-in types, like
6556 pointer-to-member types, do not have TYPE_NAME. */
6557 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6559 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6561 /* Anonymous unions are objects, so they can have specifiers. */;
6562 SET_ANON_AGGR_TYPE_P (t
);
6564 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6565 pedwarn ("ISO C++ prohibits anonymous structs");
6568 else if (ob_modifier
)
6570 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6571 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6572 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6573 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6574 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6575 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6576 cp_error ("`%D' can only be specified for constructors",
6579 cp_error ("`%D' can only be specified for objects and functions",
6586 /* Called when a declaration is seen that contains no names to declare.
6587 If its type is a reference to a structure, union or enum inherited
6588 from a containing scope, shadow that tag name for the current scope
6589 with a forward reference.
6590 If its type defines a new named structure or union
6591 or defines an enum, it is valid but we need not do anything here.
6592 Otherwise, it is an error.
6594 C++: may have to grok the declspecs to learn about static,
6595 complain for anonymous unions. */
6598 shadow_tag (declspecs
)
6601 tree t
= check_tag_decl (declspecs
);
6604 maybe_process_partial_specialization (t
);
6606 /* This is where the variables in an anonymous union are
6607 declared. An anonymous union declaration looks like:
6609 because there is no declarator after the union, the parser
6610 sends that declaration here. */
6611 if (t
&& ANON_AGGR_TYPE_P (t
))
6613 fixup_anonymous_aggr (t
);
6615 if (TYPE_FIELDS (t
))
6617 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6619 finish_anon_union (decl
);
6624 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6627 groktypename (typename
)
6630 if (TREE_CODE (typename
) != TREE_LIST
)
6632 return grokdeclarator (TREE_VALUE (typename
),
6633 TREE_PURPOSE (typename
),
6634 TYPENAME
, 0, NULL_TREE
);
6637 /* Decode a declarator in an ordinary declaration or data definition.
6638 This is called as soon as the type information and variable name
6639 have been parsed, before parsing the initializer if any.
6640 Here we create the ..._DECL node, fill in its type,
6641 and put it on the list of decls for the current context.
6642 The ..._DECL node is returned as the value.
6644 Exception: for arrays where the length is not specified,
6645 the type is left null, to be filled in by `cp_finish_decl'.
6647 Function definitions do not come here; they go to start_function
6648 instead. However, external and forward declarations of functions
6649 do go through here. Structure field declarations are done by
6650 grokfield and not through here. */
6652 /* Set this to zero to debug not using the temporary obstack
6653 to parse initializers. */
6654 int debug_temp_inits
= 1;
6657 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6658 tree declarator
, declspecs
;
6660 tree attributes
, prefix_attributes
;
6663 register tree type
, tem
;
6665 extern int have_extern_spec
;
6666 extern int used_extern_spec
;
6670 /* See code below that used this. */
6671 int init_written
= initialized
;
6674 /* This should only be done once on the top most decl. */
6675 if (have_extern_spec
&& !used_extern_spec
)
6677 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6679 used_extern_spec
= 1;
6682 if (attributes
|| prefix_attributes
)
6683 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6685 attrlist
= NULL_TREE
;
6687 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6690 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6693 type
= TREE_TYPE (decl
);
6695 if (type
== error_mark_node
)
6699 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6700 ? DECL_CLASS_CONTEXT (decl
)
6701 : DECL_CONTEXT (decl
);
6703 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6704 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6706 /* When parsing the initializer, lookup should use the object's
6708 push_decl_namespace (context
);
6711 /* We are only interested in class contexts, later. */
6712 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6713 context
= NULL_TREE
;
6716 /* Is it valid for this decl to have an initializer at all?
6717 If not, set INITIALIZED to zero, which will indirectly
6718 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6719 switch (TREE_CODE (decl
))
6722 /* typedef foo = bar means give foo the same type as bar.
6723 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6724 Any other case of an initialization in a TYPE_DECL is an error. */
6725 if (pedantic
|| list_length (declspecs
) > 1)
6727 cp_error ("typedef `%D' is initialized", decl
);
6733 cp_error ("function `%#D' is initialized like a variable", decl
);
6743 if (! toplevel_bindings_p ()
6744 && DECL_EXTERNAL (decl
))
6745 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6747 DECL_EXTERNAL (decl
) = 0;
6748 if (toplevel_bindings_p ())
6749 TREE_STATIC (decl
) = 1;
6751 /* Tell `pushdecl' this is an initialized decl
6752 even though we don't yet have the initializer expression.
6753 Also tell `cp_finish_decl' it may store the real initializer. */
6754 DECL_INITIAL (decl
) = error_mark_node
;
6757 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6758 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6761 /* Set attributes here so if duplicate decl, will have proper attributes. */
6762 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6764 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6766 push_nested_class (context
, 2);
6768 if (TREE_CODE (decl
) == VAR_DECL
)
6770 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6771 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6772 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6775 if (DECL_CONTEXT (field
) != context
)
6777 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6778 DECL_CONTEXT (field
), DECL_NAME (decl
),
6779 context
, DECL_NAME (decl
));
6780 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6782 /* Static data member are tricky; an in-class initialization
6783 still doesn't provide a definition, so the in-class
6784 declaration will have DECL_EXTERNAL set, but will have an
6785 initialization. Thus, duplicate_decls won't warn
6786 about this situation, and so we check here. */
6787 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6788 cp_error ("duplicate initialization of %D", decl
);
6789 if (duplicate_decls (decl
, field
))
6795 tree field
= check_classfn (context
, decl
);
6796 if (field
&& duplicate_decls (decl
, field
))
6800 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6801 DECL_IN_AGGR_P (decl
) = 0;
6802 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6803 || CLASSTYPE_USE_TEMPLATE (context
))
6805 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6806 /* [temp.expl.spec] An explicit specialization of a static data
6807 member of a template is a definition if the declaration
6808 includes an initializer; otherwise, it is a declaration.
6810 We check for processing_specialization so this only applies
6811 to the new specialization syntax. */
6812 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6813 DECL_EXTERNAL (decl
) = 1;
6816 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6817 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6821 /* Enter this declaration into the symbol table. */
6822 tem
= maybe_push_decl (decl
);
6824 if (processing_template_decl
)
6826 if (at_function_scope_p ())
6827 push_permanent_obstack ();
6828 tem
= push_template_decl (tem
);
6829 if (at_function_scope_p ())
6834 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6835 /* Tell the back-end to use or not use .common as appropriate. If we say
6836 -fconserve-space, we want this to save .data space, at the expense of
6837 wrong semantics. If we say -fno-conserve-space, we want this to
6838 produce errors about redefs; to do this we force variables into the
6840 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6843 if (! processing_template_decl
)
6846 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6847 push_obstacks_nochange ();
6856 tree type
= TREE_TYPE (decl
);
6857 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6859 if (type
== error_mark_node
)
6862 /* If this type of object needs a cleanup, but we're not allowed to
6863 add any more objects with cleanups to the current scope, create a
6864 new binding level. */
6865 if (TYPE_NEEDS_DESTRUCTOR (type
)
6866 && current_binding_level
->more_cleanups_ok
== 0)
6868 keep_next_level (2);
6871 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
6875 /* Is it valid for this decl to have an initializer at all?
6876 If not, set INITIALIZED to zero, which will indirectly
6877 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6879 /* Don't allow initializations for incomplete types except for
6880 arrays which might be completed by the initialization. */
6881 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6882 ; /* A complete type is ok. */
6883 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6885 cp_error ("variable `%#D' has initializer but incomplete type",
6888 type
= TREE_TYPE (decl
) = error_mark_node
;
6890 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6892 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6893 cp_error ("elements of array `%#D' have incomplete type", decl
);
6894 /* else we already gave an error in start_decl. */
6900 && TREE_CODE (decl
) != TYPE_DECL
6901 && TREE_CODE (decl
) != TEMPLATE_DECL
6902 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6904 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6905 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6907 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6909 /* Change the type so that assemble_variable will give
6910 DECL an rtl we can live with: (mem (const_int 0)). */
6911 type
= TREE_TYPE (decl
) = error_mark_node
;
6915 /* If any base type in the hierarchy of TYPE needs a constructor,
6916 then we set initialized to 1. This way any nodes which are
6917 created for the purposes of initializing this aggregate
6918 will live as long as it does. This is necessary for global
6919 aggregates which do not have their initializers processed until
6920 the end of the file. */
6921 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6926 DECL_INITIAL (decl
) = NULL_TREE
;
6929 /* Handle initialization of references.
6930 These three arguments are from `cp_finish_decl', and have the
6931 same meaning here that they do there.
6933 Quotes on semantics can be found in ARM 8.4.3. */
6936 grok_reference_init (decl
, type
, init
)
6937 tree decl
, type
, init
;
6941 if (init
== NULL_TREE
)
6943 if ((DECL_LANG_SPECIFIC (decl
) == 0
6944 || DECL_IN_AGGR_P (decl
) == 0)
6945 && ! DECL_THIS_EXTERN (decl
))
6946 cp_error ("`%D' declared as reference but not initialized", decl
);
6950 if (init
== error_mark_node
)
6953 if (TREE_CODE (init
) == CONSTRUCTOR
)
6955 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6959 if (TREE_CODE (init
) == TREE_LIST
)
6960 init
= build_compound_expr (init
);
6962 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6963 init
= convert_from_reference (init
);
6965 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6966 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6968 /* Note: default conversion is only called in very special cases. */
6969 init
= default_conversion (init
);
6972 /* Convert INIT to the reference type TYPE. This may involve the
6973 creation of a temporary, whose lifetime must be the same as that
6974 of the reference. If so, a DECL_STMT for the temporary will be
6975 added just after the DECL_STMT for DECL. That's why we don't set
6976 DECL_INITIAL for local references (instead assigning to them
6977 explicitly); we need to allow the temporary to be initialized
6979 tmp
= convert_to_reference
6980 (type
, init
, CONV_IMPLICIT
,
6981 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6983 if (tmp
== error_mark_node
)
6985 else if (tmp
!= NULL_TREE
)
6988 tmp
= save_expr (tmp
);
6989 if (building_stmt_tree ())
6991 /* Initialize the declaration. */
6992 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
6993 finish_expr_stmt (tmp
);
6996 DECL_INITIAL (decl
) = tmp
;
7000 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7004 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7006 expand_static_init (decl
, DECL_INITIAL (decl
));
7007 DECL_INITIAL (decl
) = NULL_TREE
;
7012 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7013 mucking with forces it does not comprehend (i.e. initialization with a
7014 constructor). If we are at global scope and won't go into COMMON, fill
7015 it in with a dummy CONSTRUCTOR to force the variable into .data;
7016 otherwise we can use error_mark_node. */
7019 obscure_complex_init (decl
, init
)
7022 if (! flag_no_inline
&& TREE_STATIC (decl
))
7024 if (extract_init (decl
, init
))
7028 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7029 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7030 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7034 DECL_INITIAL (decl
) = error_mark_node
;
7039 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7040 array until we finish parsing the initializer. If that's the
7041 situation we're in, update DECL accordingly. */
7044 maybe_deduce_size_from_array_init (decl
, init
)
7048 tree type
= TREE_TYPE (decl
);
7050 if (TREE_CODE (type
) == ARRAY_TYPE
7051 && TYPE_DOMAIN (type
) == NULL_TREE
7052 && TREE_CODE (decl
) != TYPE_DECL
)
7055 = (TREE_STATIC (decl
)
7056 /* Even if pedantic, an external linkage array
7057 may have incomplete type at first. */
7058 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7059 : !DECL_EXTERNAL (decl
));
7060 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7061 int failure
= complete_array_type (type
, initializer
, do_default
);
7064 cp_error ("initializer fails to determine size of `%D'", decl
);
7069 cp_error ("array size missing in `%D'", decl
);
7070 /* If a `static' var's size isn't known, make it extern as
7071 well as static, so it does not get allocated. If it's not
7072 `static', then don't mark it extern; finish_incomplete_decl
7073 will give it a default size and it will get allocated. */
7074 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7075 DECL_EXTERNAL (decl
) = 1;
7078 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7079 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7081 cp_error ("zero-size array `%D'", decl
);
7083 layout_decl (decl
, 0);
7087 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7088 any appropriate error messages regarding the layout. */
7091 layout_var_decl (decl
)
7094 tree type
= TREE_TYPE (decl
);
7095 tree ttype
= target_type (type
);
7097 /* If we haven't already layed out this declaration, do so now.
7098 Note that we must not call complete type for an external object
7099 because it's type might involve templates that we are not
7100 supposed to isntantiate yet. (And it's perfectly legal to say
7101 `extern X x' for some incomplete type `X'.) */
7102 if (!DECL_EXTERNAL (decl
))
7103 complete_type (type
);
7104 if (!DECL_SIZE (decl
)&& TYPE_SIZE (type
))
7105 layout_decl (decl
, 0);
7107 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7109 /* An automatic variable with an incomplete type: that is an error.
7110 Don't talk about array types here, since we took care of that
7111 message in grokdeclarator. */
7112 cp_error ("storage size of `%D' isn't known", decl
);
7113 TREE_TYPE (decl
) = error_mark_node
;
7115 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7116 /* Let debugger know it should output info for this type. */
7117 note_debug_info_needed (ttype
);
7119 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7120 note_debug_info_needed (DECL_CONTEXT (decl
));
7122 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7123 && DECL_SIZE (decl
) != NULL_TREE
7124 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7126 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7127 constant_expression_warning (DECL_SIZE (decl
));
7129 cp_error ("storage size of `%D' isn't constant", decl
);
7133 /* If a local static variable is declared in an inline function, or if
7134 we have a weak definition, we must endeavor to create only one
7135 instance of the variable at link-time. */
7138 maybe_commonize_var (decl
)
7141 /* Static data in a function with comdat linkage also has comdat
7143 if (TREE_STATIC (decl
)
7144 /* Don't mess with __FUNCTION__. */
7145 && ! TREE_ASM_WRITTEN (decl
)
7146 && current_function_decl
7147 && DECL_CONTEXT (decl
) == current_function_decl
7148 && (DECL_THIS_INLINE (current_function_decl
)
7149 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7150 && TREE_PUBLIC (current_function_decl
))
7152 /* Rather than try to get this right with inlining, we suppress
7153 inlining of such functions. */
7154 current_function_cannot_inline
7155 = "function with static variable cannot be inline";
7157 /* If flag_weak, we don't need to mess with this, as we can just
7158 make the function weak, and let it refer to its unique local
7159 copy. This works because we don't allow the function to be
7163 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7165 TREE_PUBLIC (decl
) = 1;
7166 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7168 else if (DECL_INITIAL (decl
) == NULL_TREE
7169 || DECL_INITIAL (decl
) == error_mark_node
)
7171 TREE_PUBLIC (decl
) = 1;
7172 DECL_COMMON (decl
) = 1;
7174 /* else we lose. We can only do this if we can use common,
7175 which we can't if it has been initialized. */
7177 if (TREE_PUBLIC (decl
))
7178 DECL_ASSEMBLER_NAME (decl
)
7179 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7180 else if (! DECL_ARTIFICIAL (decl
))
7182 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7183 cp_warning_at (" you can work around this by removing the initializer", decl
);
7187 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7188 /* Set it up again; we might have set DECL_INITIAL since the last
7190 comdat_linkage (decl
);
7193 /* Issue an error message if DECL is an uninitialized const variable. */
7196 check_for_uninitialized_const_var (decl
)
7199 tree type
= TREE_TYPE (decl
);
7201 /* ``Unless explicitly declared extern, a const object does not have
7202 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7204 if (TREE_CODE (decl
) == VAR_DECL
7205 && TREE_CODE (type
) != REFERENCE_TYPE
7206 && CP_TYPE_CONST_P (type
)
7207 && !TYPE_NEEDS_CONSTRUCTING (type
)
7208 && !DECL_INITIAL (decl
))
7209 cp_error ("uninitialized const `%D'", decl
);
7212 /* Verify INIT (the initializer for DECL), and record the
7213 initialization in DECL_INITIAL, if appropriate. Returns a new
7217 check_initializer (decl
, init
)
7223 if (TREE_CODE (decl
) == FIELD_DECL
)
7226 type
= TREE_TYPE (decl
);
7228 /* If `start_decl' didn't like having an initialization, ignore it now. */
7229 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7232 /* Check the initializer. */
7235 /* Things that are going to be initialized need to have complete
7237 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7239 if (type
== error_mark_node
)
7240 /* We will have already complained. */
7242 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7244 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7247 else if (TREE_CODE (type
) == ARRAY_TYPE
7248 && !TYPE_SIZE (TREE_TYPE (type
)))
7250 cp_error ("elements of array `%#D' have incomplete type", decl
);
7253 else if (!TYPE_SIZE (type
))
7255 cp_error ("`%D' has incomplete type", decl
);
7256 TREE_TYPE (decl
) = error_mark_node
;
7261 if (TREE_CODE (decl
) == CONST_DECL
)
7263 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7265 DECL_INITIAL (decl
) = init
;
7267 /* This will keep us from needing to worry about our obstacks. */
7268 my_friendly_assert (init
!= NULL_TREE
, 149);
7271 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7273 if (TREE_STATIC (decl
))
7274 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7275 grok_reference_init (decl
, type
, init
);
7280 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7282 if (TREE_CODE (type
) == ARRAY_TYPE
)
7283 init
= digest_init (type
, init
, (tree
*) 0);
7284 else if (TREE_CODE (init
) == CONSTRUCTOR
7285 && TREE_HAS_CONSTRUCTOR (init
))
7287 if (TYPE_NON_AGGREGATE_CLASS (type
))
7289 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7291 init
= error_mark_node
;
7294 goto dont_use_constructor
;
7299 dont_use_constructor
:
7300 if (TREE_CODE (init
) != TREE_VEC
)
7301 init
= store_init_value (decl
, init
);
7305 /* We must hide the initializer so that expand_decl
7306 won't try to do something it does not understand. */
7307 init
= obscure_complex_init (decl
, init
);
7309 else if (DECL_EXTERNAL (decl
))
7311 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7312 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7314 tree core_type
= strip_array_types (type
);
7316 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7318 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7319 cp_error ("structure `%D' with uninitialized const members", decl
);
7320 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7321 cp_error ("structure `%D' with uninitialized reference members",
7325 check_for_uninitialized_const_var (decl
);
7327 if (TYPE_SIZE (type
) != NULL_TREE
7328 && TYPE_NEEDS_CONSTRUCTING (type
))
7329 init
= obscure_complex_init (decl
, NULL_TREE
);
7333 check_for_uninitialized_const_var (decl
);
7338 /* If DECL is not a local variable, give it RTL. */
7341 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7344 const char *asmspec
;
7349 type
= TREE_TYPE (decl
);
7350 toplev
= toplevel_bindings_p ();
7352 /* Handle non-variables up front. */
7353 if (TREE_CODE (decl
) != VAR_DECL
)
7355 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7359 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7361 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7363 if (DECL_VIRTUAL_P (decl
))
7364 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7365 else if (TREE_READONLY (decl
)
7366 && DECL_INITIAL (decl
) != NULL_TREE
7367 && DECL_INITIAL (decl
) != error_mark_node
7368 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7370 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7372 if (toplev
&& ! TREE_PUBLIC (decl
))
7374 /* If this is a static const, change its apparent linkage
7375 if it belongs to a #pragma interface. */
7376 if (!interface_unknown
)
7378 TREE_PUBLIC (decl
) = 1;
7379 DECL_EXTERNAL (decl
) = interface_only
;
7381 make_decl_rtl (decl
, asmspec
, toplev
);
7384 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7386 else if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7388 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7390 if (init
== NULL_TREE
7391 #ifdef DEFAULT_STATIC_DEFS
7392 /* If this code is dead, then users must
7393 explicitly declare static member variables
7394 outside the class def'n as well. */
7395 && TYPE_NEEDS_CONSTRUCTING (type
)
7399 DECL_EXTERNAL (decl
) = 1;
7400 make_decl_rtl (decl
, asmspec
, 1);
7403 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7405 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7406 || (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
)))
7407 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7410 /* Create RTL for the local static variable DECL. */
7413 make_rtl_for_local_static (decl
)
7416 tree type
= TREE_TYPE (decl
);
7417 const char *asmspec
= NULL
;
7419 if (TREE_READONLY (decl
)
7420 && DECL_INITIAL (decl
) != NULL_TREE
7421 && DECL_INITIAL (decl
) != error_mark_node
7422 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7423 && ! TREE_SIDE_EFFECTS (decl
)
7424 && ! TREE_PUBLIC (decl
)
7425 && ! DECL_EXTERNAL (decl
)
7426 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7427 && ! TREE_ADDRESSABLE (decl
)
7428 && DECL_MODE (decl
) != BLKmode
)
7430 /* As an optimization, we try to put register-sized static
7431 constants in a register, rather than writing them out. If we
7432 take the address of the constant later, we'll make RTL for it
7434 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7435 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7436 TREE_ASM_WRITTEN (decl
) = 1;
7440 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7442 /* The only way this situaton can occur is if the
7443 user specified a name for this DECL using the
7444 `attribute' syntax. */
7445 asmspec
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
7446 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
7449 rest_of_decl_compilation (decl
, asmspec
, /*top_level=*/0, /*at_end=*/0);
7452 /* The old ARM scoping rules injected variables declared in the
7453 initialization statement of a for-statement into the surrounding
7454 scope. We support this usage, in order to be backward-compatible.
7455 DECL is a just-declared VAR_DECL; if necessary inject its
7456 declaration into the surrounding scope. */
7459 maybe_inject_for_scope_var (decl
)
7462 if (current_binding_level
->is_for_scope
)
7464 struct binding_level
*outer
7465 = current_binding_level
->level_chain
;
7467 /* Check to see if the same name is already bound at the outer
7468 level, either because it was directly declared, or because a
7469 dead for-decl got preserved. In either case, the code would
7470 not have been valid under the ARM scope rules, so clear
7471 is_for_scope for the current_binding_level.
7473 Otherwise, we need to preserve the temp slot for decl to last
7474 into the outer binding level. */
7477 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7479 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7480 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7482 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7484 BINDING_VALUE (outer_binding
)
7485 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7486 current_binding_level
->is_for_scope
= 0;
7488 else if (DECL_IN_MEMORY_P (decl
))
7489 preserve_temp_slots (DECL_RTL (decl
));
7493 /* Generate code to initialize DECL (a local variable). */
7496 initialize_local_var (decl
, init
, flags
)
7501 tree type
= TREE_TYPE (decl
);
7503 /* If the type is bogus, don't bother initializing the variable. */
7504 if (type
== error_mark_node
)
7507 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7509 /* If we used it already as memory, it must stay in memory. */
7510 DECL_INITIAL (decl
) = NULL_TREE
;
7511 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7514 /* Local statics are handled differently from ordinary automatic
7516 if (TREE_STATIC (decl
))
7518 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7519 || TYPE_NEEDS_DESTRUCTOR (type
))
7520 expand_static_init (decl
, init
);
7524 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7528 /* Compute and store the initial value. */
7529 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7531 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7533 int saved_stmts_are_full_exprs_p
;
7535 emit_line_note (DECL_SOURCE_FILE (decl
),
7536 DECL_SOURCE_LINE (decl
));
7537 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7538 stmts_are_full_exprs_p
= 1;
7539 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7540 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7543 /* Set this to 0 so we can tell whether an aggregate which was
7544 initialized was ever used. Don't do this if it has a
7545 destructor, so we don't complain about the 'resource
7546 allocation is initialization' idiom. Now set
7547 attribute((unused)) on types so decls of that type will be
7548 marked used. (see TREE_USED, above.) */
7549 if (TYPE_NEEDS_CONSTRUCTING (type
)
7551 && !TYPE_NEEDS_DESTRUCTOR (type
)
7552 && DECL_NAME (decl
))
7553 TREE_USED (decl
) = 0;
7554 else if (already_used
)
7555 TREE_USED (decl
) = 1;
7559 /* Generate code to destroy DECL (a local variable). */
7562 destroy_local_var (decl
)
7565 tree type
= TREE_TYPE (decl
);
7568 /* Only variables get cleaned up. */
7569 if (TREE_CODE (decl
) != VAR_DECL
)
7572 /* And only things with destructors need cleaning up. */
7573 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7576 if (TREE_CODE (decl
) == VAR_DECL
&&
7577 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7578 /* We don't clean up things that aren't defined in this
7579 translation unit, or that need a static cleanup. The latter
7580 are handled by finish_file. */
7583 /* Compute the cleanup. */
7584 cleanup
= maybe_build_cleanup (decl
);
7586 /* Record the cleanup required for this declaration. */
7587 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7589 finish_decl_cleanup (decl
, cleanup
);
7592 /* Let the back-end know about DECL. */
7595 emit_local_var (decl
)
7598 /* Create RTL for this variable. */
7599 if (DECL_RTL (decl
))
7600 /* Only a RESULT_DECL should have non-NULL RTL when
7601 arriving here. All other local variables are
7602 assigned RTL in this function. */
7603 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7607 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7608 /* The user must have specified an assembler name for this
7609 variable. Set that up now. */
7610 rest_of_decl_compilation
7611 (decl
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
7612 /*top_level=*/0, /*at_end=*/0);
7617 /* Actually do the initialization. */
7618 expand_start_target_temps ();
7619 expand_decl_init (decl
);
7620 expand_end_target_temps ();
7623 /* Finish processing of a declaration;
7624 install its line number and initial value.
7625 If the length of an array type is not known before,
7626 it must be determined now, from the initial value, or it is an error.
7628 Call `pop_obstacks' iff NEED_POP is nonzero.
7630 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7631 for aggregates that have constructors alive on the permanent obstack,
7632 so that the global initializing functions can be written at the end.
7634 INIT0 holds the value of an initializer that should be allowed to escape
7637 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7638 if the (init) syntax was used.
7640 For functions that take default parameters, DECL points to its
7641 "maximal" instantiation. `cp_finish_decl' must then also declared its
7642 subsequently lower and lower forms of instantiation, checking for
7643 ambiguity as it goes. This can be sped up later. */
7646 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7653 tree ttype
= NULL_TREE
;
7654 int temporary
= allocation_temporary_p ();
7655 const char *asmspec
= NULL
;
7656 int was_readonly
= 0;
7658 /* If this is 0, then we did not change obstacks. */
7662 error ("assignment (not initialization) in declaration");
7666 /* If a name was specified, get the string. */
7668 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7670 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7672 cp_error ("Cannot initialize `%D' to namespace `%D'",
7677 if (current_class_type
7678 && DECL_REAL_CONTEXT (decl
) == current_class_type
7679 && TYPE_BEING_DEFINED (current_class_type
)
7680 && (DECL_INITIAL (decl
) || init
))
7681 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7683 if (TREE_CODE (decl
) == VAR_DECL
7684 && DECL_CONTEXT (decl
)
7685 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7686 && DECL_CONTEXT (decl
) != current_namespace
7689 /* Leave the namespace of the object. */
7690 pop_decl_namespace ();
7693 type
= TREE_TYPE (decl
);
7695 if (type
== error_mark_node
)
7697 if (toplevel_bindings_p () && temporary
)
7698 end_temporary_allocation ();
7703 /* Add this declaration to the statement-tree. */
7704 if (building_stmt_tree ()
7705 && TREE_CODE (current_scope ()) == FUNCTION_DECL
)
7706 add_decl_stmt (decl
);
7708 if (TYPE_HAS_MUTABLE_P (type
))
7709 TREE_READONLY (decl
) = 0;
7711 if (processing_template_decl
)
7713 if (init
&& DECL_INITIAL (decl
))
7714 DECL_INITIAL (decl
) = init
;
7718 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7719 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7721 /* Take care of TYPE_DECLs up front. */
7722 if (TREE_CODE (decl
) == TYPE_DECL
)
7724 if (init
&& DECL_INITIAL (decl
))
7726 /* typedef foo = bar; store the type of bar as the type of foo. */
7727 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7728 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7730 if (type
!= error_mark_node
7731 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7733 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7734 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7735 set_identifier_type_value (DECL_NAME (decl
), type
);
7736 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7738 GNU_xref_decl (current_function_decl
, decl
);
7740 /* If we have installed this as the canonical typedef for this
7741 type, and that type has not been defined yet, delay emitting
7742 the debug information for it, as we will emit it later. */
7743 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7744 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7745 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7747 rest_of_decl_compilation (decl
, NULL_PTR
,
7748 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7752 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7753 ttype
= target_type (type
);
7755 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7756 && TYPE_NEEDS_CONSTRUCTING (type
))
7758 /* Currently, GNU C++ puts constants in text space, making them
7759 impossible to initialize. In the future, one would hope for
7760 an operating system which understood the difference between
7761 initialization and the running of a program. */
7763 TREE_READONLY (decl
) = 0;
7766 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7768 /* This must override the asm specifier which was placed by
7769 grokclassfn. Lay this out fresh. */
7770 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7771 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7772 make_decl_rtl (decl
, asmspec
, 0);
7775 /* Deduce size of array from initialization, if not already known. */
7776 maybe_deduce_size_from_array_init (decl
, init
);
7777 init
= check_initializer (decl
, init
);
7779 GNU_xref_decl (current_function_decl
, decl
);
7781 /* For top-level declaration, the initial value was read in
7782 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7783 must go in the permanent obstack; but don't discard the
7784 temporary data yet. */
7786 if (toplevel_bindings_p () && temporary
)
7787 end_temporary_allocation ();
7789 if (TREE_CODE (decl
) == VAR_DECL
)
7790 layout_var_decl (decl
);
7792 /* Output the assembler code and/or RTL code for variables and functions,
7793 unless the type is an undefined structure or union.
7794 If not, it will get done when the type is completed. */
7795 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7796 || TREE_CODE (decl
) == RESULT_DECL
)
7798 if (TREE_CODE (decl
) == VAR_DECL
)
7799 maybe_commonize_var (decl
);
7801 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7803 if (TREE_CODE (type
) == FUNCTION_TYPE
7804 || TREE_CODE (type
) == METHOD_TYPE
)
7805 abstract_virtuals_error (decl
,
7806 strip_array_types (TREE_TYPE (type
)));
7808 abstract_virtuals_error (decl
, strip_array_types (type
));
7810 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7812 else if (DECL_EXTERNAL (decl
)
7813 && ! (DECL_LANG_SPECIFIC (decl
)
7814 && DECL_NOT_REALLY_EXTERN (decl
)))
7817 DECL_INITIAL (decl
) = init
;
7819 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
7821 /* This is a local declaration. */
7822 if (doing_semantic_analysis_p ())
7823 maybe_inject_for_scope_var (decl
);
7824 /* Initialize the local variable. But, if we're building a
7825 statement-tree, we'll do the initialization when we
7827 if (processing_template_decl
)
7829 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7830 DECL_INITIAL (decl
) = init
;
7834 /* If we're not building RTL, then we need to do so
7836 if (!building_stmt_tree ())
7837 emit_local_var (decl
);
7838 /* Initialize the variable. */
7839 initialize_local_var (decl
, init
, flags
);
7840 /* Clean up the variable. */
7841 destroy_local_var (decl
);
7844 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7846 /* Cleanups for static variables are handled by `finish_file'. */
7847 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7848 || TYPE_NEEDS_DESTRUCTOR (type
))
7849 expand_static_init (decl
, init
);
7853 /* Undo call to `pushclass' that was done in `start_decl'
7854 due to initialization of qualified member variable.
7855 I.e., Foo::x = 10; */
7857 tree context
= DECL_REAL_CONTEXT (decl
);
7859 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7860 && (TREE_CODE (decl
) == VAR_DECL
7861 /* We also have a pushclass done that we need to undo here
7862 if we're at top level and declare a method. */
7863 || TREE_CODE (decl
) == FUNCTION_DECL
)
7864 /* If size hasn't been set, we're still defining it,
7865 and therefore inside the class body; don't pop
7866 the binding level.. */
7867 && TYPE_SIZE (context
) != NULL_TREE
7868 && context
== current_class_type
)
7869 pop_nested_class ();
7875 /* If requested, warn about definitions of large data objects. */
7877 if (warn_larger_than
7878 && ! processing_template_decl
7879 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7880 && !DECL_EXTERNAL (decl
))
7882 register tree decl_size
= DECL_SIZE (decl
);
7884 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7886 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7888 if (units
> larger_than_size
)
7889 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7894 /* Resume permanent allocation, if not within a function. The
7895 corresponding push_obstacks_nochange is in start_decl,
7896 start_method, groktypename, and in grokfield. */
7900 TREE_READONLY (decl
) = 1;
7903 /* This is here for a midend callback from c-common.c */
7906 finish_decl (decl
, init
, asmspec_tree
)
7910 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7913 /* Generate code to handle the destruction of the function-scoped
7914 static variable DECL. */
7917 destroy_local_static (decl
)
7920 tree cleanup
, fcall
;
7922 int saved_flag_access_control
;
7924 if (atexit_node
== 0)
7926 tree atexit_fndecl
, PFV
, pfvlist
;
7927 /* Remember this information until end of file. */
7928 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7929 PFV
= build_pointer_type (build_function_type
7930 (void_type_node
, void_list_node
));
7932 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7934 push_lang_context (lang_name_c
);
7935 /* Note that we do not call pushdecl for this function;
7936 there's no reason that this declaration should be
7937 accessible to anyone. */
7939 = define_function ("atexit",
7940 build_function_type (void_type_node
,
7942 /*pfn=*/0, NULL_PTR
);
7943 mark_used (atexit_fndecl
);
7944 atexit_node
= default_conversion (atexit_fndecl
);
7945 pop_lang_context ();
7949 /* Call build_cleanup before we enter the anonymous function so that
7950 any access checks will be done relative to the current scope,
7951 rather than the scope of the anonymous function. */
7952 build_cleanup (decl
);
7954 /* Now start the function. */
7955 cleanup
= start_anon_func ();
7957 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7958 to the original function, rather than the anonymous one. That
7959 will make the back-end think that nested functions are in use,
7960 which causes confusion. */
7961 saved_flag_access_control
= flag_access_control
;
7962 flag_access_control
= 0;
7963 fcall
= build_cleanup (decl
);
7964 flag_access_control
= saved_flag_access_control
;
7966 /* Create the body of the anonymous function. */
7967 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7968 finish_expr_stmt (fcall
);
7969 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7972 /* Call atexit with the cleanup function. */
7973 mark_addressable (cleanup
);
7974 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7975 fcall
= build_function_call (atexit_node
,
7976 tree_cons (NULL_TREE
,
7979 finish_expr_stmt (fcall
);
7983 expand_static_init (decl
, init
)
7987 tree oldstatic
= value_member (decl
, static_aggregates
);
7991 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7992 cp_error ("multiple initializations given for `%D'", decl
);
7994 else if (! toplevel_bindings_p ())
7996 /* Emit code to perform this initialization but once. */
8003 /* Remember this information until end of file. */
8004 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8006 /* Emit code to perform this initialization but once. This code
8009 static int temp = 0;
8011 // Do initialization.
8013 // Register variable for destruction at end of program.
8016 Note that the `temp' variable is only set to 1 *after* the
8017 initialization is complete. This ensures that an exception,
8018 thrown during the construction, will cause the variable to
8019 reinitialized when we pass through this code again, as per:
8023 If the initialization exits by throwing an exception, the
8024 initialization is not complete, so it will be tried again
8025 the next time control enters the declaration.
8027 In theory, this process should be thread-safe, too; multiple
8028 threads should not be able to initialize the variable more
8029 than once. We don't yet attempt to ensure thread-safety. */
8030 temp
= get_temp_name (integer_type_node
, 1);
8031 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8033 /* Begin the conditional initialization. */
8034 if_stmt
= begin_if_stmt ();
8035 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
8038 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8040 /* Do the initialization itself. */
8041 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8042 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8043 assignment
= build_aggr_init (decl
, init
, 0);
8045 /* The initialization we're doing here is just a bitwise
8047 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8049 assignment
= NULL_TREE
;
8051 /* Once the assignment is complete, set TEMP to 1. Since the
8052 construction of the static object is complete at this point,
8053 we want to make sure TEMP is set to 1 even if a temporary
8054 constructed during the initialization throws an exception
8055 when it is destroyed. So, we combine the initialization and
8056 the assignment to TEMP into a single expression, ensuring
8057 that when we call finish_expr_stmt the cleanups will not be
8058 run until after TEMP is set to 1. */
8059 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8062 assignment
= tree_cons (NULL_TREE
, assignment
,
8063 build_tree_list (NULL_TREE
,
8065 assignment
= build_compound_expr (assignment
);
8068 assignment
= temp_init
;
8069 finish_expr_stmt (assignment
);
8071 /* Use atexit to register a function for destroying this static
8073 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8074 destroy_local_static (decl
);
8076 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8077 finish_then_clause (if_stmt
);
8080 /* Resume old (possibly temporary) allocation. */
8085 /* This code takes into account memory allocation policy of
8086 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8087 hold for this object, then we must make permanent the storage
8088 currently in the temporary obstack. */
8089 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8090 preserve_initializer ();
8091 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8095 /* Finish the declaration of a catch-parameter. */
8098 start_handler_parms (declspecs
, declarator
)
8105 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8107 if (decl
== NULL_TREE
)
8108 error ("invalid catch parameter");
8117 /* Make TYPE a complete type based on INITIAL_VALUE.
8118 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8119 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8122 complete_array_type (type
, initial_value
, do_default
)
8123 tree type
, initial_value
;
8126 register tree maxindex
= NULL_TREE
;
8129 /* Allocate on the same obstack as TYPE. */
8130 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8134 /* Note MAXINDEX is really the maximum index,
8135 one less than the size. */
8136 if (TREE_CODE (initial_value
) == STRING_CST
)
8139 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8140 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8143 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8145 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8146 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8147 for (; elts
; elts
= TREE_CHAIN (elts
))
8149 if (TREE_PURPOSE (elts
))
8150 maxindex
= TREE_PURPOSE (elts
);
8152 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8154 maxindex
= copy_node (maxindex
);
8158 /* Make an error message unless that happened already. */
8159 if (initial_value
!= error_mark_node
)
8162 initial_value
= NULL_TREE
;
8164 /* Prevent further error messages. */
8165 maxindex
= build_int_2 (0, 0);
8172 maxindex
= build_int_2 (0, 0);
8181 domain
= build_index_type (maxindex
);
8182 TYPE_DOMAIN (type
) = domain
;
8184 if (! TREE_TYPE (maxindex
))
8185 TREE_TYPE (maxindex
) = domain
;
8187 itype
= TREE_TYPE (initial_value
);
8190 if (itype
&& !TYPE_DOMAIN (itype
))
8191 TYPE_DOMAIN (itype
) = domain
;
8192 /* The type of the main variant should never be used for arrays
8193 of different sizes. It should only ever be completed with the
8194 size of the array. */
8195 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8196 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8201 /* Lay out the type now that we can get the real answer. */
8208 /* Return zero if something is declared to be a member of type
8209 CTYPE when in the context of CUR_TYPE. STRING is the error
8210 message to print in that case. Otherwise, quietly return 1. */
8213 member_function_or_else (ctype
, cur_type
, string
)
8214 tree ctype
, cur_type
;
8217 if (ctype
&& ctype
!= cur_type
)
8219 error (string
, TYPE_NAME_STRING (ctype
));
8225 /* Subroutine of `grokdeclarator'. */
8227 /* Generate errors possibly applicable for a given set of specifiers.
8228 This is for ARM $7.1.2. */
8231 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8234 int virtualp
, quals
, friendp
, raises
, inlinep
;
8237 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8239 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8241 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8244 cp_error_at ("`%D' declared as a friend", object
);
8246 cp_error_at ("`%D' declared with an exception specification", object
);
8249 /* CTYPE is class type, or null if non-class.
8250 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8252 DECLARATOR is the function's name.
8253 VIRTUALP is truthvalue of whether the function is virtual or not.
8254 FLAGS are to be passed through to `grokclassfn'.
8255 QUALS are qualifiers indicating whether the function is `const'
8257 RAISES is a list of exceptions that this function can raise.
8258 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8259 not look, and -1 if we should not call `grokclassfn' at all.
8261 Returns `NULL_TREE' if something goes wrong, after issuing
8262 applicable error messages. */
8265 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8266 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8267 template_count
, in_namespace
)
8270 tree orig_declarator
;
8272 enum overload_flags flags
;
8274 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8278 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8279 int has_default_arg
= 0;
8283 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8284 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8290 type
= build_exception_variant (type
, raises
);
8293 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8294 /* Propagate volatile out from type to decl. */
8295 if (TYPE_VOLATILE (type
))
8296 TREE_THIS_VOLATILE (decl
) = 1;
8298 /* If this decl has namespace scope, set that up. */
8300 set_decl_namespace (decl
, in_namespace
, friendp
);
8301 else if (publicp
&& ! ctype
)
8302 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8304 /* `main' and builtins have implicit 'C' linkage. */
8305 if ((MAIN_NAME_P (declarator
)
8306 || (IDENTIFIER_LENGTH (declarator
) > 10
8307 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8308 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8309 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8310 && current_lang_name
== lang_name_cplusplus
8311 && ctype
== NULL_TREE
8312 /* NULL_TREE means global namespace. */
8313 && DECL_CONTEXT (decl
) == NULL_TREE
)
8314 DECL_LANGUAGE (decl
) = lang_c
;
8316 /* Should probably propagate const out from type to decl I bet (mrs). */
8319 DECL_STATIC_FUNCTION_P (decl
) = 1;
8320 DECL_CONTEXT (decl
) = ctype
;
8324 DECL_CLASS_CONTEXT (decl
) = ctype
;
8326 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8328 if (processing_template_decl
)
8329 error ("cannot declare `main' to be a template");
8331 error ("cannot declare `main' to be inline");
8333 error ("cannot declare `main' to be static");
8338 /* Members of anonymous types and local classes have no linkage; make
8340 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8341 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8346 /* [basic.link]: A name with no linkage (notably, the name of a class
8347 or enumeration declared in a local scope) shall not be used to
8348 declare an entity with linkage.
8350 Only check this for public decls for now. */
8351 t
= no_linkage_check (TREE_TYPE (decl
));
8354 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8356 if (DECL_LANGUAGE (decl
) == lang_c
)
8357 /* Allow this; it's pretty common in C. */;
8359 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8363 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8368 TREE_PUBLIC (decl
) = publicp
;
8371 DECL_INTERFACE_KNOWN (decl
) = 1;
8372 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8376 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8378 DECL_EXTERNAL (decl
) = 1;
8379 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8381 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8382 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8386 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8387 grok_op_properties (decl
, virtualp
, check
< 0);
8389 if (ctype
&& hack_decl_function_context (decl
))
8390 DECL_NO_STATIC_CHAIN (decl
) = 1;
8392 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8393 if (TREE_PURPOSE (t
)
8394 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8396 has_default_arg
= 1;
8401 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8405 ("defining explicit specialization `%D' in friend declaration",
8409 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8411 /* Something like `template <class T> friend void f<T>()'. */
8412 cp_error ("template-id `%D' in declaration of primary template",
8418 /* A friend declaration of the form friend void f<>(). Record
8419 the information in the TEMPLATE_ID_EXPR. */
8420 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8421 DECL_TEMPLATE_INFO (decl
)
8422 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8423 TREE_OPERAND (orig_declarator
, 1),
8426 if (has_default_arg
)
8428 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8435 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8442 if (has_default_arg
)
8443 add_defarg_fn (decl
);
8445 /* Plain overloading: will not be grok'd by grokclassfn. */
8446 if (! ctype
&& ! processing_template_decl
8447 && DECL_LANGUAGE (decl
) != lang_c
8448 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8449 set_mangled_name_for_decl (decl
);
8452 /* Make the init_value nonzero so pushdecl knows this is not
8453 tentative. error_mark_node is replaced later with the BLOCK. */
8454 DECL_INITIAL (decl
) = error_mark_node
;
8456 /* Caller will do the rest of this. */
8460 if (check
&& funcdef_flag
)
8461 DECL_INITIAL (decl
) = error_mark_node
;
8463 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8466 /* Just handle constructors here. We could do this
8467 inside the following if stmt, but I think
8468 that the code is more legible by breaking this
8469 case out. See comments below for what each of
8470 the following calls is supposed to do. */
8471 DECL_CONSTRUCTOR_P (decl
) = 1;
8473 grokclassfn (ctype
, decl
, flags
, quals
);
8475 decl
= check_explicit_specialization (orig_declarator
, decl
,
8477 2 * (funcdef_flag
!= 0) +
8478 4 * (friendp
!= 0));
8479 if (decl
== error_mark_node
)
8482 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8485 tmp
= check_classfn (ctype
, decl
);
8487 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8488 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8490 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8491 cp_error ("definition of implicitly-declared `%D'", tmp
);
8492 if (tmp
&& duplicate_decls (decl
, tmp
))
8495 if (! grok_ctor_properties (ctype
, decl
))
8502 /* Function gets the ugly name, field gets the nice one.
8503 This call may change the type of the function (because
8504 of default parameters)! */
8505 if (ctype
!= NULL_TREE
)
8506 grokclassfn (ctype
, decl
, flags
, quals
);
8508 decl
= check_explicit_specialization (orig_declarator
, decl
,
8510 2 * (funcdef_flag
!= 0) +
8511 4 * (friendp
!= 0));
8512 if (decl
== error_mark_node
)
8515 if (ctype
!= NULL_TREE
8516 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8519 tmp
= check_classfn (ctype
, decl
);
8521 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8522 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8524 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8525 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8527 /* Remove the `this' parm added by grokclassfn.
8528 XXX Isn't this done in start_function, too? */
8529 revert_static_member_fn (&decl
, NULL
, NULL
);
8530 last_function_parms
= TREE_CHAIN (last_function_parms
);
8532 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8533 cp_error ("definition of implicitly-declared `%D'", tmp
);
8536 /* Attempt to merge the declarations. This can fail, in
8537 the case of some illegal specialization declarations. */
8538 if (!duplicate_decls (decl
, tmp
))
8539 cp_error ("no `%#D' member function declared in class `%T'",
8545 if (ctype
== NULL_TREE
|| check
)
8550 DECL_VIRTUAL_P (decl
) = 1;
8551 if (DECL_VINDEX (decl
) == NULL_TREE
)
8552 DECL_VINDEX (decl
) = error_mark_node
;
8553 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8560 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8563 RID_BIT_TYPE
*specbits_in
;
8569 RID_BIT_TYPE specbits
;
8571 specbits
= *specbits_in
;
8573 if (TREE_CODE (type
) == OFFSET_TYPE
)
8575 /* If you declare a static member so that it
8576 can be initialized, the code will reach here. */
8577 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8578 type
= TREE_TYPE (type
);
8579 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8580 DECL_CONTEXT (decl
) = basetype
;
8581 DECL_CLASS_CONTEXT (decl
) = basetype
;
8582 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8589 context
= in_namespace
;
8590 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8591 context
= current_namespace
;
8593 context
= NULL_TREE
;
8595 if (processing_template_decl
)
8597 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8598 we can call push_template_decl. */
8599 push_permanent_obstack ();
8600 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8604 decl
= build_decl (VAR_DECL
, declarator
, type
);
8607 set_decl_namespace (decl
, context
, 0);
8609 context
= DECL_CONTEXT (decl
);
8610 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8611 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8615 set_decl_namespace (decl
, in_namespace
, 0);
8617 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8619 DECL_THIS_EXTERN (decl
) = 1;
8620 DECL_EXTERNAL (decl
) = !initialized
;
8623 /* In class context, static means one per class,
8624 public access, and static storage. */
8625 if (DECL_CLASS_SCOPE_P (decl
))
8627 TREE_PUBLIC (decl
) = 1;
8628 TREE_STATIC (decl
) = 1;
8629 DECL_EXTERNAL (decl
) = 0;
8631 /* At top level, either `static' or no s.c. makes a definition
8632 (perhaps tentative), and absence of `static' makes it public. */
8633 else if (toplevel_bindings_p ())
8635 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8636 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8637 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8639 /* Not at top level, only `static' makes a static definition. */
8642 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8643 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8646 if (TREE_PUBLIC (decl
))
8648 /* [basic.link]: A name with no linkage (notably, the name of a class
8649 or enumeration declared in a local scope) shall not be used to
8650 declare an entity with linkage.
8652 Only check this for public decls for now. */
8653 tree t
= no_linkage_check (TREE_TYPE (decl
));
8656 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8657 /* Ignore for now; `enum { foo } e' is pretty common. */;
8659 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8667 /* Create and return a canonical pointer to member function type, for
8668 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8671 build_ptrmemfunc_type (type
)
8677 tree unqualified_variant
= NULL_TREE
;
8679 /* If a canonical type already exists for this type, use it. We use
8680 this method instead of type_hash_canon, because it only does a
8681 simple equality check on the list of field members. */
8683 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8686 /* Make sure that we always have the unqualified pointer-to-member
8688 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8690 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8692 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8694 u
= make_lang_type (UNION_TYPE
);
8695 SET_IS_AGGR_TYPE (u
, 0);
8696 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8697 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8699 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8700 TYPE_NAME (u
) = NULL_TREE
;
8702 t
= make_lang_type (RECORD_TYPE
);
8704 /* Let the front-end know this is a pointer to member function... */
8705 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8706 /* ... and not really an aggregate. */
8707 SET_IS_AGGR_TYPE (t
, 0);
8709 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8711 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8713 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8714 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8718 /* Zap out the name so that the back-end will give us the debugging
8719 information for this anonymous RECORD_TYPE. */
8720 TYPE_NAME (t
) = NULL_TREE
;
8722 /* If this is not the unqualified form of this pointer-to-member
8723 type, set the TYPE_MAIN_VARIANT for this type to be the
8724 unqualified type. Since they are actually RECORD_TYPEs that are
8725 not variants of each other, we must do this manually. */
8726 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8728 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8729 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8730 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8731 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8734 /* Cache this pointer-to-member type so that we can find it again
8736 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8738 /* Seems to be wanted. */
8739 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8744 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8745 Check to see that the definition is valid. Issue appropriate error
8746 messages. Return 1 if the definition is particularly bad, or 0
8750 check_static_variable_definition (decl
, type
)
8754 /* Motion 10 at San Diego: If a static const integral data member is
8755 initialized with an integral constant expression, the initializer
8756 may appear either in the declaration (within the class), or in
8757 the definition, but not both. If it appears in the class, the
8758 member is a member constant. The file-scope definition is always
8760 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8762 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8764 /* If we just return the declaration, crashes will sometimes
8765 occur. We therefore return void_type_node, as if this was a
8766 friend declaration, to cause callers to completely ignore
8767 this declaration. */
8770 else if (!CP_TYPE_CONST_P (type
))
8771 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8773 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8774 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8779 /* Given declspecs and a declarator,
8780 determine the name and type of the object declared
8781 and construct a ..._DECL node for it.
8782 (In one case we can return a ..._TYPE node instead.
8783 For invalid input we sometimes return 0.)
8785 DECLSPECS is a chain of tree_list nodes whose value fields
8786 are the storage classes and type specifiers.
8788 DECL_CONTEXT says which syntactic context this declaration is in:
8789 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8790 FUNCDEF for a function definition. Like NORMAL but a few different
8791 error messages in each case. Return value may be zero meaning
8792 this definition is too screwy to try to parse.
8793 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8794 handle member functions (which have FIELD context).
8795 Return value may be zero meaning this definition is too screwy to
8797 PARM for a parameter declaration (either within a function prototype
8798 or before a function body). Make a PARM_DECL, or return void_type_node.
8799 CATCHPARM for a parameter declaration before a catch clause.
8800 TYPENAME if for a typename (in a cast or sizeof).
8801 Don't make a DECL node; just return the ..._TYPE node.
8802 FIELD for a struct or union field; make a FIELD_DECL.
8803 BITFIELD for a field with specified width.
8804 INITIALIZED is 1 if the decl has an initializer.
8806 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8807 normal attributes in TREE_PURPOSE, or NULL_TREE.
8809 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8810 It may also be so in the PARM case, for a prototype where the
8811 argument type is specified but not the name.
8813 This function is where the complicated C meanings of `static'
8814 and `extern' are interpreted.
8816 For C++, if there is any monkey business to do, the function which
8817 calls this one must do it, i.e., prepending instance variables,
8818 renaming overloaded function names, etc.
8820 Note that for this C++, it is an error to define a method within a class
8821 which does not belong to that class.
8823 Except in the case where SCOPE_REFs are implicitly known (such as
8824 methods within a class being redundantly qualified),
8825 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8826 (class_name::decl_name). The caller must also deal with this.
8828 If a constructor or destructor is seen, and the context is FIELD,
8829 then the type gains the attribute TREE_HAS_x. If such a declaration
8830 is erroneous, NULL_TREE is returned.
8832 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8833 function, these are the qualifiers to give to the `this' pointer.
8835 May return void_type_node if the declarator turned out to be a friend.
8836 See grokfield for details. */
8838 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8841 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8844 enum decl_context decl_context
;
8848 RID_BIT_TYPE specbits
;
8851 tree type
= NULL_TREE
;
8857 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8858 int explicit_int
= 0;
8859 int explicit_char
= 0;
8860 int defaulted_int
= 0;
8861 tree typedef_decl
= NULL_TREE
;
8863 tree typedef_type
= NULL_TREE
;
8864 int funcdef_flag
= 0;
8865 enum tree_code innermost_code
= ERROR_MARK
;
8868 /* See the code below that used this. */
8869 tree decl_machine_attr
= NULL_TREE
;
8871 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8872 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8873 tree init
= NULL_TREE
;
8875 /* Keep track of what sort of function is being processed
8876 so that we can warn about default return values, or explicit
8877 return values which do not match prescribed defaults. */
8878 enum return_types return_type
= return_normal
;
8880 tree dname
= NULL_TREE
;
8881 tree ctype
= current_class_type
;
8882 tree ctor_return_type
= NULL_TREE
;
8883 enum overload_flags flags
= NO_SPECIAL
;
8884 tree quals
= NULL_TREE
;
8885 tree raises
= NULL_TREE
;
8886 int template_count
= 0;
8887 tree in_namespace
= NULL_TREE
;
8891 RIDBIT_RESET_ALL (specbits
);
8892 if (decl_context
== FUNCDEF
)
8893 funcdef_flag
= 1, decl_context
= NORMAL
;
8894 else if (decl_context
== MEMFUNCDEF
)
8895 funcdef_flag
= -1, decl_context
= FIELD
;
8896 else if (decl_context
== BITFIELD
)
8897 bitfield
= 1, decl_context
= FIELD
;
8899 /* Look inside a declarator for the name being declared
8900 and get it as a string, for an error message. */
8902 tree
*next
= &declarator
;
8906 while (next
&& *next
)
8909 switch (TREE_CODE (decl
))
8912 /* For attributes. */
8913 next
= &TREE_VALUE (decl
);
8918 next
= &TREE_OPERAND (decl
, 0);
8921 case BIT_NOT_EXPR
: /* For C++ destructors! */
8923 tree name
= TREE_OPERAND (decl
, 0);
8924 tree rename
= NULL_TREE
;
8926 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8928 return_type
= return_dtor
;
8929 if (TREE_CODE (name
) == TYPE_DECL
)
8930 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8931 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8932 if (ctype
== NULL_TREE
)
8934 if (current_class_type
== NULL_TREE
)
8936 error ("destructors must be member functions");
8941 tree t
= constructor_name (current_class_name
);
8948 tree t
= constructor_name (ctype
);
8955 cp_error ("destructor `%T' must match class name `%T'",
8957 TREE_OPERAND (decl
, 0) = rename
;
8963 case ADDR_EXPR
: /* C++ reference declaration */
8968 innermost_code
= TREE_CODE (decl
);
8969 next
= &TREE_OPERAND (decl
, 0);
8973 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
8975 /* This is actually a variable declaration using
8976 constructor syntax. We need to call start_decl and
8977 cp_finish_decl so we can get the variable
8980 tree attributes
, prefix_attributes
;
8982 *next
= TREE_OPERAND (decl
, 0);
8983 init
= CALL_DECLARATOR_PARMS (decl
);
8987 attributes
= TREE_PURPOSE (attrlist
);
8988 prefix_attributes
= TREE_VALUE (attrlist
);
8992 attributes
= NULL_TREE
;
8993 prefix_attributes
= NULL_TREE
;
8996 decl
= start_decl (declarator
, declspecs
, 1,
8997 attributes
, prefix_attributes
);
9000 /* Look for __unused__ attribute */
9001 if (TREE_USED (TREE_TYPE (decl
)))
9002 TREE_USED (decl
) = 1;
9003 finish_decl (decl
, init
, NULL_TREE
);
9006 cp_error ("invalid declarator");
9009 innermost_code
= TREE_CODE (decl
);
9010 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9011 ctype
= current_class_type
;
9013 && TREE_OPERAND (decl
, 0)
9014 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9015 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9016 == constructor_name_full (ctype
))
9017 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9018 == constructor_name (ctype
)))))
9019 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9020 next
= &TREE_OPERAND (decl
, 0);
9022 if (ctype
!= NULL_TREE
9023 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9024 && decl
== constructor_name (ctype
))
9026 return_type
= return_ctor
;
9027 ctor_return_type
= ctype
;
9032 case TEMPLATE_ID_EXPR
:
9034 tree fns
= TREE_OPERAND (decl
, 0);
9036 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9037 fns
= TREE_OPERAND (fns
, 0);
9040 if (TREE_CODE (dname
) == COMPONENT_REF
)
9041 dname
= TREE_OPERAND (dname
, 1);
9042 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9044 my_friendly_assert (is_overloaded_fn (dname
),
9046 dname
= DECL_NAME (get_first_fn (dname
));
9051 case IDENTIFIER_NODE
:
9052 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9059 cp_error ("declarator-id missing; using reserved word `%D'",
9061 name
= IDENTIFIER_POINTER (dname
);
9063 if (! IDENTIFIER_OPNAME_P (dname
)
9064 /* GNU/Linux headers use '__op'. Arrgh. */
9065 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9066 name
= IDENTIFIER_POINTER (dname
);
9069 if (IDENTIFIER_TYPENAME_P (dname
))
9071 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9072 flags
= TYPENAME_FLAG
;
9073 ctor_return_type
= TREE_TYPE (dname
);
9074 return_type
= return_conversion
;
9076 name
= operator_name_string (dname
);
9083 /* Perform error checking, and decide on a ctype. */
9084 tree cname
= TREE_OPERAND (decl
, 0);
9085 if (cname
== NULL_TREE
)
9087 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9090 in_namespace
= TREE_OPERAND (decl
, 0);
9091 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9093 else if (! is_aggr_type (cname
, 1))
9094 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9095 /* Must test TREE_OPERAND (decl, 1), in case user gives
9096 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9097 else if (TREE_OPERAND (decl
, 1)
9098 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9100 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9101 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9103 cp_error ("`%T::%D' is not a valid declarator", cname
,
9104 TREE_OPERAND (decl
, 1));
9105 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9106 cname
, TREE_OPERAND (decl
, 1));
9107 return void_type_node
;
9109 else if (ctype
== NULL_TREE
)
9111 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9112 TREE_OPERAND (decl
, 0) = ctype
;
9115 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9117 cp_error ("type `%T' is not derived from type `%T'",
9119 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9125 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9126 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9127 == constructor_name_full (ctype
))
9128 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9129 == constructor_name (ctype
))))
9130 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9131 next
= &TREE_OPERAND (decl
, 1);
9135 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9136 && constructor_name (ctype
) == decl
)
9138 return_type
= return_ctor
;
9139 ctor_return_type
= ctype
;
9141 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9142 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9143 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9144 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9146 return_type
= return_dtor
;
9147 ctor_return_type
= ctype
;
9149 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9150 next
= &TREE_OPERAND (decl
, 0);
9161 /* Parse error puts this typespec where
9162 a declarator should go. */
9163 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9164 if (TREE_TYPE (decl
) == current_class_type
)
9165 cp_error (" perhaps you want `%T' for a constructor",
9166 current_class_name
);
9167 dname
= DECL_NAME (decl
);
9168 name
= IDENTIFIER_POINTER (dname
);
9170 /* Avoid giving two errors for this. */
9171 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9173 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9180 cp_compiler_error ("`%D' as declarator", decl
);
9181 return 0; /* We used to do a 155 abort here. */
9186 /* A function definition's declarator must have the form of
9187 a function declarator. */
9189 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9192 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9193 && innermost_code
!= CALL_EXPR
9194 && ! (ctype
&& declspecs
== NULL_TREE
))
9196 cp_error ("declaration of `%D' as non-function", dname
);
9197 return void_type_node
;
9200 /* Anything declared one level down from the top level
9201 must be one of the parameters of a function
9202 (because the body is at least two levels down). */
9204 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9205 by not allowing C++ class definitions to specify their parameters
9206 with xdecls (must be spec.d in the parmlist).
9208 Since we now wait to push a class scope until we are sure that
9209 we are in a legitimate method context, we must set oldcname
9210 explicitly (since current_class_name is not yet alive).
9212 We also want to avoid calling this a PARM if it is in a namespace. */
9214 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9216 struct binding_level
*b
= current_binding_level
;
9217 current_binding_level
= b
->level_chain
;
9218 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9219 decl_context
= PARM
;
9220 current_binding_level
= b
;
9224 name
= decl_context
== PARM
? "parameter" : "type name";
9226 /* Look through the decl specs and record which ones appear.
9227 Some typespecs are defined as built-in typenames.
9228 Others, the ones that are modifiers of other types,
9229 are represented by bits in SPECBITS: set the bits for
9230 the modifiers that appear. Storage class keywords are also in SPECBITS.
9232 If there is a typedef name or a type, store the type in TYPE.
9233 This includes builtin typedefs such as `int'.
9235 Set EXPLICIT_INT if the type is `int' or `char' and did not
9236 come from a user typedef.
9238 Set LONGLONG if `long' is mentioned twice.
9240 For C++, constructors and destructors have their own fast treatment. */
9242 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9247 /* Certain parse errors slip through. For example,
9248 `int class;' is not caught by the parser. Try
9249 weakly to recover here. */
9250 if (TREE_CODE (spec
) != TREE_LIST
)
9253 id
= TREE_VALUE (spec
);
9255 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9257 if (id
== ridpointers
[(int) RID_INT
]
9258 || id
== ridpointers
[(int) RID_CHAR
]
9259 || id
== ridpointers
[(int) RID_BOOL
]
9260 || id
== ridpointers
[(int) RID_WCHAR
])
9264 if (id
== ridpointers
[(int) RID_BOOL
])
9265 error ("`bool' is now a keyword");
9267 cp_error ("extraneous `%T' ignored", id
);
9271 if (id
== ridpointers
[(int) RID_INT
])
9273 else if (id
== ridpointers
[(int) RID_CHAR
])
9275 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9279 /* C++ aggregate types. */
9280 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9283 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9285 type
= IDENTIFIER_TYPE_VALUE (id
);
9289 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9291 if (ridpointers
[i
] == id
)
9293 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9295 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9296 pedwarn ("ANSI C++ does not support `long long'");
9298 error ("`long long long' is too long for GCC");
9302 else if (RIDBIT_SETP (i
, specbits
))
9303 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9304 RIDBIT_SET (i
, specbits
);
9309 /* C++ aggregate types. */
9310 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9313 cp_error ("multiple declarations `%T' and `%T'", type
,
9317 type
= TREE_TYPE (id
);
9318 TREE_VALUE (spec
) = type
;
9323 error ("two or more data types in declaration of `%s'", name
);
9324 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9326 register tree t
= lookup_name (id
, 1);
9327 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9328 error ("`%s' fails to be a typedef or built in type",
9329 IDENTIFIER_POINTER (id
));
9332 type
= TREE_TYPE (t
);
9334 /* See the code below that used this. */
9335 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9340 else if (id
!= error_mark_node
)
9341 /* Can't change CLASS nodes into RECORD nodes here! */
9347 typedef_type
= type
;
9349 /* No type at all: default to `int', and set DEFAULTED_INT
9350 because it was not a user-defined typedef. */
9352 if (type
== NULL_TREE
9353 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9354 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9355 || RIDBIT_SETP (RID_LONG
, specbits
)
9356 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9358 /* These imply 'int'. */
9359 type
= integer_type_node
;
9363 if (type
== NULL_TREE
)
9366 if (return_type
== return_dtor
)
9367 type
= void_type_node
;
9368 else if (return_type
== return_ctor
)
9369 type
= build_pointer_type (ctor_return_type
);
9370 else if (return_type
== return_conversion
)
9371 type
= ctor_return_type
;
9374 /* We handle `main' specially here, because 'main () { }' is so
9375 common. With no options, it is allowed. With -Wreturn-type,
9376 it is a warning. It is only an error with -pedantic-errors. */
9377 int is_main
= (funcdef_flag
9378 && MAIN_NAME_P (dname
)
9379 && ctype
== NULL_TREE
9380 && in_namespace
== NULL_TREE
9381 && current_namespace
== global_namespace
);
9383 if (in_system_header
|| flag_ms_extensions
)
9384 /* Allow it, sigh. */;
9385 else if (pedantic
|| ! is_main
)
9386 cp_pedwarn ("ANSI C++ forbids declaration of `%s' with no type",
9388 else if (warn_return_type
)
9389 cp_warning ("ANSI C++ forbids declaration of `%s' with no type",
9392 type
= integer_type_node
;
9395 else if (return_type
== return_dtor
)
9397 error ("return type specification for destructor invalid");
9398 type
= void_type_node
;
9400 else if (return_type
== return_ctor
)
9402 error ("return type specification for constructor invalid");
9403 type
= build_pointer_type (ctor_return_type
);
9405 else if (return_type
== return_conversion
)
9407 if (!same_type_p (type
, ctor_return_type
))
9408 cp_error ("operator `%T' declared to return `%T'",
9409 ctor_return_type
, type
);
9411 cp_pedwarn ("return type specified for `operator %T'",
9414 type
= ctor_return_type
;
9419 /* Now process the modifiers that were specified
9420 and check for invalid combinations. */
9422 /* Long double is a special combination. */
9424 if (RIDBIT_SETP (RID_LONG
, specbits
)
9425 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9427 RIDBIT_RESET (RID_LONG
, specbits
);
9428 type
= build_qualified_type (long_double_type_node
,
9429 CP_TYPE_QUALS (type
));
9432 /* Check all other uses of type modifiers. */
9434 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9435 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9436 || RIDBIT_SETP (RID_LONG
, specbits
)
9437 || RIDBIT_SETP (RID_SHORT
, specbits
))
9441 if (TREE_CODE (type
) == REAL_TYPE
)
9442 error ("short, signed or unsigned invalid for `%s'", name
);
9443 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9444 error ("long, short, signed or unsigned invalid for `%s'", name
);
9445 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9446 && RIDBIT_SETP (RID_SHORT
, specbits
))
9447 error ("long and short specified together for `%s'", name
);
9448 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9449 || RIDBIT_SETP (RID_SHORT
, specbits
))
9451 error ("long or short specified with char for `%s'", name
);
9452 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9453 || RIDBIT_SETP (RID_SHORT
, specbits
))
9454 && TREE_CODE (type
) == REAL_TYPE
)
9455 error ("long or short specified with floating type for `%s'", name
);
9456 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9457 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9458 error ("signed and unsigned given together for `%s'", name
);
9462 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9464 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9466 if (flag_pedantic_errors
)
9471 /* Discard the type modifiers if they are invalid. */
9474 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9475 RIDBIT_RESET (RID_SIGNED
, specbits
);
9476 RIDBIT_RESET (RID_LONG
, specbits
);
9477 RIDBIT_RESET (RID_SHORT
, specbits
);
9482 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9483 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9485 error ("complex invalid for `%s'", name
);
9486 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9489 /* Decide whether an integer type is signed or not.
9490 Optionally treat bitfields as signed by default. */
9491 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9494 It is implementation-defined whether a plain (neither
9495 explicitly signed or unsigned) char, short, int, or long
9496 bit-field is signed or unsigned.
9498 Naturally, we extend this to long long as well. Note that
9499 this does not include wchar_t. */
9500 || (bitfield
&& !flag_signed_bitfields
9501 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9502 /* A typedef for plain `int' without `signed' can be
9503 controlled just like plain `int', but a typedef for
9504 `signed int' cannot be so controlled. */
9506 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9507 && (TREE_CODE (type
) == INTEGER_TYPE
9508 || TREE_CODE (type
) == CHAR_TYPE
)
9509 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9512 type
= long_long_unsigned_type_node
;
9513 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9514 type
= long_unsigned_type_node
;
9515 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9516 type
= short_unsigned_type_node
;
9517 else if (type
== char_type_node
)
9518 type
= unsigned_char_type_node
;
9519 else if (typedef_decl
)
9520 type
= unsigned_type (type
);
9522 type
= unsigned_type_node
;
9524 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9525 && type
== char_type_node
)
9526 type
= signed_char_type_node
;
9528 type
= long_long_integer_type_node
;
9529 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9530 type
= long_integer_type_node
;
9531 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9532 type
= short_integer_type_node
;
9534 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9536 /* If we just have "complex", it is equivalent to
9537 "complex double", but if any modifiers at all are specified it is
9538 the complex form of TYPE. E.g, "complex short" is
9539 "complex short int". */
9541 if (defaulted_int
&& ! longlong
9542 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9543 || RIDBIT_SETP (RID_SHORT
, specbits
)
9544 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9545 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9546 type
= complex_double_type_node
;
9547 else if (type
== integer_type_node
)
9548 type
= complex_integer_type_node
;
9549 else if (type
== float_type_node
)
9550 type
= complex_float_type_node
;
9551 else if (type
== double_type_node
)
9552 type
= complex_double_type_node
;
9553 else if (type
== long_double_type_node
)
9554 type
= complex_long_double_type_node
;
9556 type
= build_complex_type (type
);
9559 if (return_type
== return_conversion
9560 && (RIDBIT_SETP (RID_CONST
, specbits
)
9561 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9562 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9563 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9566 /* Set CONSTP if this declaration is `const', whether by
9567 explicit specification or via a typedef.
9568 Likewise for VOLATILEP. */
9570 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9572 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9574 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9575 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9576 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9577 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9578 type
= cp_build_qualified_type (type
, type_quals
);
9580 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9581 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9582 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9583 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9584 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9586 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9587 staticp
= 1 + (decl_context
== FIELD
);
9589 if (virtualp
&& staticp
== 2)
9591 cp_error ("member `%D' cannot be declared both virtual and static",
9595 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9596 RIDBIT_RESET (RID_FRIEND
, specbits
);
9598 /* Warn if two storage classes are given. Default to `auto'. */
9600 if (RIDBIT_ANY_SET (specbits
))
9602 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9603 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9604 if (decl_context
== PARM
&& nclasses
> 0)
9605 error ("storage class specifiers invalid in parameter declarations");
9606 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9608 if (decl_context
== PARM
)
9609 error ("typedef declaration invalid in parameter declaration");
9612 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9613 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9616 /* Give error if `virtual' is used outside of class declaration. */
9618 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9620 error ("virtual outside class declaration");
9624 /* Static anonymous unions are dealt with here. */
9625 if (staticp
&& decl_context
== TYPENAME
9626 && TREE_CODE (declspecs
) == TREE_LIST
9627 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9628 decl_context
= FIELD
;
9630 /* Warn about storage classes that are invalid for certain
9631 kinds of declarations (parameters, typenames, etc.). */
9634 error ("multiple storage classes in declaration of `%s'", name
);
9635 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9637 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9638 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9639 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9641 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9643 else if (decl_context
== FIELD
9644 /* C++ allows static class elements */
9645 && RIDBIT_SETP (RID_STATIC
, specbits
))
9646 /* C++ also allows inlines and signed and unsigned elements,
9647 but in those cases we don't come in here. */
9651 if (decl_context
== FIELD
)
9653 tree tmp
= NULL_TREE
;
9654 register int op
= 0;
9658 /* Avoid trying to get an operand off an identifier node. */
9659 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9662 tmp
= TREE_OPERAND (declarator
, 0);
9663 op
= IDENTIFIER_OPNAME_P (tmp
);
9665 error ("storage class specified for %s `%s'",
9666 op
? "member operator" : "field",
9667 op
? operator_name_string (tmp
) : name
);
9670 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9671 ? "storage class specified for parameter `%s'"
9672 : "storage class specified for typename"), name
);
9673 RIDBIT_RESET (RID_REGISTER
, specbits
);
9674 RIDBIT_RESET (RID_AUTO
, specbits
);
9675 RIDBIT_RESET (RID_EXTERN
, specbits
);
9678 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9680 if (toplevel_bindings_p ())
9682 /* It's common practice (and completely valid) to have a const
9683 be initialized and declared extern. */
9684 if (!(type_quals
& TYPE_QUAL_CONST
))
9685 warning ("`%s' initialized and declared `extern'", name
);
9688 error ("`%s' has both `extern' and initializer", name
);
9690 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9691 && ! toplevel_bindings_p ())
9692 error ("nested function `%s' declared `extern'", name
);
9693 else if (toplevel_bindings_p ())
9695 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9696 error ("top-level declaration of `%s' specifies `auto'", name
);
9699 if (nclasses
> 0 && friendp
)
9700 error ("storage class specifiers invalid in friend function declarations");
9702 /* Now figure out the structure of the declarator proper.
9703 Descend through it, creating more complex types, until we reach
9704 the declared identifier (or NULL_TREE, in an absolute declarator). */
9706 inner_attrs
= NULL_TREE
;
9709 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9710 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9712 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9713 an INDIRECT_REF (for *...),
9714 a CALL_EXPR (for ...(...)),
9715 an identifier (for the name being declared)
9716 or a null pointer (for the place in an absolute declarator
9717 where the name was omitted).
9718 For the last two cases, we have just exited the loop.
9720 For C++ it could also be
9721 a SCOPE_REF (for class :: ...). In this case, we have converted
9722 sensible names to types, and those are the values we use to
9723 qualify the member name.
9724 an ADDR_EXPR (for &...),
9725 a BIT_NOT_EXPR (for destructors)
9727 At this point, TYPE is the type of elements of an array,
9728 or for a function to return, or for a pointer to point to.
9729 After this sequence of ifs, TYPE is the type of the
9730 array or function or pointer, and DECLARATOR has had its
9731 outermost layer removed. */
9733 if (type
== error_mark_node
)
9735 if (TREE_CODE (declarator
) == SCOPE_REF
)
9736 declarator
= TREE_OPERAND (declarator
, 1);
9738 declarator
= TREE_OPERAND (declarator
, 0);
9741 if (quals
!= NULL_TREE
9742 && (declarator
== NULL_TREE
9743 || TREE_CODE (declarator
) != SCOPE_REF
))
9745 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9746 ctype
= TYPE_METHOD_BASETYPE (type
);
9747 if (ctype
!= NULL_TREE
)
9749 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9750 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9751 type
= TREE_TYPE (dummy
);
9756 /* See the comment for the TREE_LIST case, below. */
9759 else if (inner_attrs
)
9761 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9762 inner_attrs
= NULL_TREE
;
9765 switch (TREE_CODE (declarator
))
9769 /* We encode a declarator with embedded attributes using
9770 a TREE_LIST. The attributes apply to the declarator
9771 directly inside them, so we have to skip an iteration
9772 before applying them to the type. If the declarator just
9773 inside is the declarator-id, we apply the attrs to the
9775 inner_attrs
= TREE_PURPOSE (declarator
);
9777 declarator
= TREE_VALUE (declarator
);
9783 register tree itype
= NULL_TREE
;
9784 register tree size
= TREE_OPERAND (declarator
, 1);
9785 /* The index is a signed object `sizetype' bits wide. */
9786 tree index_type
= signed_type (sizetype
);
9788 declarator
= TREE_OPERAND (declarator
, 0);
9790 /* Check for some types that there cannot be arrays of. */
9792 if (TREE_CODE (type
) == VOID_TYPE
)
9794 cp_error ("declaration of `%D' as array of voids", dname
);
9795 type
= error_mark_node
;
9798 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9800 cp_error ("declaration of `%D' as array of functions", dname
);
9801 type
= error_mark_node
;
9804 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9805 you can't have arrays of references. If we allowed them,
9806 then we'd be saying x[i] is valid for an array x, but
9807 then you'd have to ask: what does `*(x + i)' mean? */
9808 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9810 if (decl_context
== TYPENAME
)
9811 cp_error ("cannot make arrays of references");
9813 cp_error ("declaration of `%D' as array of references",
9815 type
= error_mark_node
;
9818 if (TREE_CODE (type
) == OFFSET_TYPE
)
9820 cp_error ("declaration of `%D' as array of data members",
9822 type
= error_mark_node
;
9825 if (TREE_CODE (type
) == METHOD_TYPE
)
9827 cp_error ("declaration of `%D' as array of function members",
9829 type
= error_mark_node
;
9832 if (size
== error_mark_node
)
9833 type
= error_mark_node
;
9834 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9838 the constant expressions that specify the bounds of
9839 the arrays can be omitted only for the first member
9841 cp_error ("declaration of `%D' as multidimensional array",
9843 cp_error ("must have bounds for all dimensions except the first");
9844 type
= error_mark_node
;
9847 if (type
== error_mark_node
)
9850 /* VC++ spells a zero-sized array with []. */
9851 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9852 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9853 size
= integer_zero_node
;
9857 /* Must suspend_momentary here because the index
9858 type may need to live until the end of the function.
9859 For example, it is used in the declaration of a
9860 variable which requires destructing at the end of
9861 the function; then build_vec_delete will need this
9863 int yes
= suspend_momentary ();
9864 /* Might be a cast. */
9865 if (TREE_CODE (size
) == NOP_EXPR
9866 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9867 size
= TREE_OPERAND (size
, 0);
9868 if (TREE_READONLY_DECL_P (size
))
9869 size
= decl_constant_value (size
);
9871 /* If this involves a template parameter, it will be a
9872 constant at instantiation time, but we don't know
9873 what the value is yet. Even if no template
9874 parameters are involved, we may an expression that
9875 is not a constant; we don't even simplify `1 + 2'
9876 when processing a template. */
9877 if (processing_template_decl
)
9879 /* Resolve a qualified reference to an enumerator or
9880 static const data member of ours. */
9881 if (TREE_CODE (size
) == SCOPE_REF
9882 && TREE_OPERAND (size
, 0) == current_class_type
)
9884 tree t
= lookup_field (current_class_type
,
9885 TREE_OPERAND (size
, 1), 0, 0);
9890 itype
= build_index_type (build_min
9891 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
9892 goto dont_grok_size
;
9895 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9896 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9897 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9899 cp_error ("size of array `%D' has non-integer type",
9901 size
= integer_one_node
;
9903 if (pedantic
&& !in_system_header
&& integer_zerop (size
))
9904 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9905 if (TREE_CONSTANT (size
))
9907 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9908 int old_pedantic
= pedantic
;
9909 pedantic
= flag_pedantic_errors
= 1;
9910 /* Always give overflow errors on array subscripts. */
9911 constant_expression_warning (size
);
9912 pedantic
= old_pedantic
;
9913 flag_pedantic_errors
= old_flag_pedantic_errors
;
9914 if (INT_CST_LT (size
, integer_zero_node
))
9916 cp_error ("size of array `%D' is negative", dname
);
9917 size
= integer_one_node
;
9925 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9928 cp_pedwarn ("ANSI C++ forbids variable-size array");
9933 = fold (build_binary_op (MINUS_EXPR
,
9934 cp_convert (index_type
, size
),
9935 cp_convert (index_type
,
9936 integer_one_node
)));
9937 if (! TREE_CONSTANT (itype
))
9938 itype
= variable_size (itype
);
9939 else if (TREE_OVERFLOW (itype
))
9941 error ("overflow in array dimension");
9942 TREE_OVERFLOW (itype
) = 0;
9945 itype
= build_index_type (itype
);
9948 resume_momentary (yes
);
9951 type
= build_cplus_array_type (type
, itype
);
9960 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9961 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9963 /* Declaring a function type.
9964 Make sure we have a valid type for the function to return. */
9966 /* We now know that the TYPE_QUALS don't apply to the
9967 decl, but to its return type. */
9968 type_quals
= TYPE_UNQUALIFIED
;
9970 /* Warn about some types functions can't return. */
9972 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9974 error ("`%s' declared as function returning a function", name
);
9975 type
= integer_type_node
;
9977 if (TREE_CODE (type
) == ARRAY_TYPE
)
9979 error ("`%s' declared as function returning an array", name
);
9980 type
= integer_type_node
;
9983 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9984 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9986 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9989 /* Pick up type qualifiers which should be applied to `this'. */
9990 quals
= CALL_DECLARATOR_QUALS (declarator
);
9992 /* Pick up the exception specifications. */
9993 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
9995 /* Say it's a definition only for the CALL_EXPR
9996 closest to the identifier. */
9999 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10000 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10001 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10003 if (ctype
== NULL_TREE
10004 && decl_context
== FIELD
10006 && (friendp
== 0 || dname
== current_class_name
))
10007 ctype
= current_class_type
;
10009 if (ctype
&& return_type
== return_conversion
)
10010 TYPE_HAS_CONVERSION (ctype
) = 1;
10011 if (ctype
&& constructor_name (ctype
) == dname
)
10013 /* We are within a class's scope. If our declarator name
10014 is the same as the class name, and we are defining
10015 a function, then it is a constructor/destructor, and
10016 therefore returns a void type. */
10018 if (flags
== DTOR_FLAG
)
10020 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10021 not be declared const or volatile. A destructor
10022 may not be static. */
10024 error ("destructor cannot be static member function");
10027 cp_error ("destructors may not be `%s'",
10028 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10031 if (decl_context
== FIELD
)
10033 if (! member_function_or_else (ctype
, current_class_type
,
10034 "destructor for alien class `%s' cannot be a member"))
10035 return void_type_node
;
10038 else /* It's a constructor. */
10040 if (explicitp
== 1)
10042 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10043 not be declared const or volatile. A constructor may
10044 not be virtual. A constructor may not be static. */
10046 error ("constructor cannot be static member function");
10049 pedwarn ("constructors cannot be declared virtual");
10054 cp_error ("constructors may not be `%s'",
10055 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10059 RID_BIT_TYPE tmp_bits
;
10060 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10061 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10062 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10063 if (RIDBIT_ANY_SET (tmp_bits
))
10064 error ("return value type specifier for constructor ignored");
10066 type
= build_pointer_type (ctype
);
10067 if (decl_context
== FIELD
)
10069 if (! member_function_or_else (ctype
, current_class_type
,
10070 "constructor for alien class `%s' cannot be member"))
10071 return void_type_node
;
10072 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10073 if (return_type
!= return_ctor
)
10077 if (decl_context
== FIELD
)
10083 error ("can't initialize friend function `%s'", name
);
10086 /* Cannot be both friend and virtual. */
10087 error ("virtual functions cannot be friends");
10088 RIDBIT_RESET (RID_FRIEND
, specbits
);
10091 if (decl_context
== NORMAL
)
10092 error ("friend declaration not in class definition");
10093 if (current_function_decl
&& funcdef_flag
)
10094 cp_error ("can't define friend function `%s' in a local class definition",
10098 /* Construct the function type and go to the next
10099 inner layer of declarator. */
10101 declarator
= TREE_OPERAND (declarator
, 0);
10103 /* FIXME: This is where default args should be fully
10106 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10108 if (declarator
&& flags
== DTOR_FLAG
)
10110 /* A destructor declared in the body of a class will
10111 be represented as a BIT_NOT_EXPR. But, we just
10112 want the underlying IDENTIFIER. */
10113 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10114 declarator
= TREE_OPERAND (declarator
, 0);
10116 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10117 arg_types
= void_list_node
;
10118 else if (arg_types
== NULL_TREE
10119 || arg_types
!= void_list_node
)
10121 cp_error ("destructors may not have parameters");
10122 arg_types
= void_list_node
;
10123 last_function_parms
= NULL_TREE
;
10127 /* ANSI says that `const int foo ();'
10128 does not make the function foo const. */
10129 type
= build_function_type (type
, arg_types
);
10133 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10134 if (TREE_PURPOSE (t
)
10135 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10137 add_defarg_fn (type
);
10146 /* Filter out pointers-to-references and references-to-references.
10147 We can get these if a TYPE_DECL is used. */
10149 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10151 error ("cannot declare %s to references",
10152 TREE_CODE (declarator
) == ADDR_EXPR
10153 ? "references" : "pointers");
10154 declarator
= TREE_OPERAND (declarator
, 0);
10158 if (TREE_CODE (type
) == OFFSET_TYPE
10159 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10160 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10162 cp_error ("cannot declare pointer to `%#T' member",
10164 type
= TREE_TYPE (type
);
10167 /* Merge any constancy or volatility into the target type
10168 for the pointer. */
10170 /* We now know that the TYPE_QUALS don't apply to the decl,
10171 but to the target of the pointer. */
10172 type_quals
= TYPE_UNQUALIFIED
;
10174 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10176 if (TREE_CODE (type
) == VOID_TYPE
)
10177 error ("invalid type: `void &'");
10179 type
= build_reference_type (type
);
10181 else if (TREE_CODE (type
) == METHOD_TYPE
)
10182 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10184 type
= build_pointer_type (type
);
10186 /* Process a list of type modifier keywords (such as
10187 const or volatile) that were given inside the `*' or `&'. */
10189 if (TREE_TYPE (declarator
))
10191 register tree typemodlist
;
10197 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10198 typemodlist
= TREE_CHAIN (typemodlist
))
10200 tree qualifier
= TREE_VALUE (typemodlist
);
10202 if (qualifier
== ridpointers
[(int) RID_CONST
])
10204 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10206 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10211 error ("invalid type modifier within pointer declarator");
10215 pedwarn ("duplicate `const'");
10217 pedwarn ("duplicate `volatile'");
10219 pedwarn ("duplicate `restrict'");
10221 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10222 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10223 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10224 if (TREE_CODE (declarator
) == ADDR_EXPR
10225 && (constp
|| volatilep
))
10228 pedwarn ("discarding `const' applied to a reference");
10230 pedwarn ("discarding `volatile' applied to a reference");
10231 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10233 type
= cp_build_qualified_type (type
, type_quals
);
10235 declarator
= TREE_OPERAND (declarator
, 0);
10241 /* We have converted type names to NULL_TREE if the
10242 name was bogus, or to a _TYPE node, if not.
10244 The variable CTYPE holds the type we will ultimately
10245 resolve to. The code here just needs to build
10246 up appropriate member types. */
10247 tree sname
= TREE_OPERAND (declarator
, 1);
10250 /* Destructors can have their visibilities changed as well. */
10251 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10252 sname
= TREE_OPERAND (sname
, 0);
10254 if (TREE_COMPLEXITY (declarator
) == 0)
10255 /* This needs to be here, in case we are called
10256 multiple times. */ ;
10257 else if (TREE_COMPLEXITY (declarator
) == -1)
10258 /* Namespace member. */
10259 pop_decl_namespace ();
10260 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10261 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10262 else if (! IS_AGGR_TYPE_CODE
10263 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10265 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10267 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10268 that refer to ctype. They couldn't be resolved earlier
10269 because we hadn't pushed into the class yet.
10270 Example: resolve 'B<T>::type' in
10271 'B<typename B<T>::type> B<T>::f () { }'. */
10272 if (current_template_parms
10273 && uses_template_parms (type
)
10274 && uses_template_parms (current_class_type
))
10276 tree args
= current_template_args ();
10277 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10280 /* This pop_nested_class corresponds to the
10281 push_nested_class used to push into class scope for
10282 parsing the argument list of a function decl, in
10284 pop_nested_class ();
10285 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10288 my_friendly_abort (16);
10290 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10292 /* We had a reference to a global decl, or
10293 perhaps we were given a non-aggregate typedef,
10294 in which case we cleared this out, and should just
10295 keep going as though it wasn't there. */
10296 declarator
= sname
;
10299 ctype
= TREE_OPERAND (declarator
, 0);
10302 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10304 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10305 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10306 template_count
+= 1;
10307 t
= TYPE_MAIN_DECL (t
);
10308 if (DECL_LANG_SPECIFIC (t
))
10309 t
= DECL_CLASS_CONTEXT (t
);
10314 if (sname
== NULL_TREE
)
10317 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10319 /* This is the `standard' use of the scoping operator:
10320 basetype :: member . */
10322 if (ctype
== current_class_type
)
10328 Is this ill-formed? */
10331 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10334 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10336 if (current_class_type
== NULL_TREE
10338 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10339 TYPE_ARG_TYPES (type
));
10342 cp_error ("cannot declare member function `%T::%s' within `%T'",
10343 ctype
, name
, current_class_type
);
10344 return void_type_node
;
10347 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10348 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10350 /* Have to move this code elsewhere in this function.
10351 this code is used for i.e., typedef int A::M; M *pm;
10353 It is? How? jason 10/2/94 */
10355 if (current_class_type
)
10357 cp_error ("cannot declare member `%T::%s' within `%T'",
10358 ctype
, name
, current_class_type
);
10359 return void_type_node
;
10361 type
= build_offset_type (ctype
, type
);
10363 else if (uses_template_parms (ctype
))
10365 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10367 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10368 TYPE_ARG_TYPES (type
));
10372 cp_error ("structure `%T' not yet defined", ctype
);
10373 return error_mark_node
;
10376 declarator
= sname
;
10378 else if (TREE_CODE (sname
) == SCOPE_REF
)
10379 my_friendly_abort (17);
10383 declarator
= TREE_OPERAND (declarator
, 1);
10384 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10385 /* In this case, we will deal with it later. */
10389 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10390 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10391 TYPE_ARG_TYPES (type
));
10393 type
= build_offset_type (ctype
, type
);
10400 declarator
= TREE_OPERAND (declarator
, 0);
10405 case ENUMERAL_TYPE
:
10406 declarator
= NULL_TREE
;
10410 declarator
= NULL_TREE
;
10414 my_friendly_abort (158);
10418 /* See the comment for the TREE_LIST case, above. */
10421 if (! ignore_attrs
)
10422 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10424 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10426 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10429 /* Now TYPE has the actual type. */
10431 if (explicitp
== 1 || (explicitp
&& friendp
))
10433 /* [dcl.fct.spec] The explicit specifier shall only be used in
10434 declarations of constructors within a class definition. */
10435 error ("only declarations of constructors can be `explicit'");
10439 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10441 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10443 error ("non-member `%s' cannot be declared `mutable'", name
);
10444 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10446 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10448 error ("non-object member `%s' cannot be declared `mutable'", name
);
10449 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10451 else if (TREE_CODE (type
) == FUNCTION_TYPE
10452 || TREE_CODE (type
) == METHOD_TYPE
)
10454 error ("function `%s' cannot be declared `mutable'", name
);
10455 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10459 error ("static `%s' cannot be declared `mutable'", name
);
10460 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10462 else if (type_quals
& TYPE_QUAL_CONST
)
10464 error ("const `%s' cannot be declared `mutable'", name
);
10465 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10469 if (declarator
== NULL_TREE
10470 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10471 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10472 && (TREE_CODE (type
) == FUNCTION_TYPE
10473 || TREE_CODE (type
) == METHOD_TYPE
)))
10475 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10477 cp_error ("template-id `%D' used as a declarator", declarator
);
10478 declarator
= dname
;
10481 /* Unexpected declarator format. */
10482 my_friendly_abort (990210);
10484 /* If this is declaring a typedef name, return a TYPE_DECL. */
10486 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10490 /* Note that the grammar rejects storage classes
10491 in typenames, fields or parameters. */
10492 if (current_lang_name
== lang_name_java
)
10493 TYPE_FOR_JAVA (type
) = 1;
10495 if (decl_context
== FIELD
)
10497 if (declarator
== constructor_name (current_class_type
))
10498 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10500 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10504 /* Make sure this typedef lives as long as its type,
10505 since it might be used as a template parameter. */
10506 if (type
!= error_mark_node
)
10507 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10508 if (processing_template_decl
)
10509 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10511 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10512 if (type
!= error_mark_node
)
10516 /* If the user declares "typedef struct {...} foo" then the
10517 struct will have an anonymous name. Fill that name in now.
10518 Nothing can refer to it, so nothing needs know about the name
10520 if (type
!= error_mark_node
10521 && TYPE_NAME (type
)
10522 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10523 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10524 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10526 tree oldname
= TYPE_NAME (type
);
10529 /* Replace the anonymous name with the real name everywhere. */
10530 lookup_tag_reverse (type
, declarator
);
10531 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10532 if (TYPE_NAME (t
) == oldname
)
10533 TYPE_NAME (t
) = decl
;
10535 if (TYPE_LANG_SPECIFIC (type
))
10536 TYPE_WAS_ANONYMOUS (type
) = 1;
10538 /* If this is a typedef within a template class, the nested
10539 type is a (non-primary) template. The name for the
10540 template needs updating as well. */
10541 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10542 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10543 = TYPE_IDENTIFIER (type
);
10545 /* XXX Temporarily set the scope.
10546 When returning, start_decl expects it as NULL_TREE,
10547 and will then then set it using pushdecl. */
10548 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10549 if (current_class_type
)
10550 DECL_CONTEXT (decl
) = current_class_type
;
10552 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10554 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10555 DECL_ASSEMBLER_NAME (decl
)
10556 = get_identifier (build_overload_name (type
, 1, 1));
10557 DECL_CONTEXT (decl
) = NULL_TREE
;
10559 /* FIXME remangle member functions; member functions of a
10560 type with external linkage have external linkage. */
10563 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10565 cp_error_at ("typedef name may not be class-qualified", decl
);
10570 if (ctype
== NULL_TREE
)
10572 if (TREE_CODE (type
) != METHOD_TYPE
)
10573 cp_error_at ("invalid type qualifier for non-method type", decl
);
10575 ctype
= TYPE_METHOD_BASETYPE (type
);
10577 if (ctype
!= NULL_TREE
)
10578 grok_method_quals (ctype
, decl
, quals
);
10581 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10582 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10583 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10585 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10586 inlinep
, friendp
, raises
!= NULL_TREE
);
10589 error ("typedef declaration includes an initializer");
10594 /* Detect the case of an array type of unspecified size
10595 which came, as such, direct from a typedef name.
10596 We must copy the type, so that each identifier gets
10597 a distinct type, so that each identifier's size can be
10598 controlled separately by its own initializer. */
10600 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10601 && TYPE_DOMAIN (type
) == NULL_TREE
)
10603 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10606 /* If this is a type name (such as, in a cast or sizeof),
10607 compute the type and return it now. */
10609 if (decl_context
== TYPENAME
)
10611 /* Note that the grammar rejects storage classes
10612 in typenames, fields or parameters. */
10613 if (type_quals
!= TYPE_UNQUALIFIED
)
10614 type_quals
= TYPE_UNQUALIFIED
;
10616 /* Special case: "friend class foo" looks like a TYPENAME context. */
10619 if (type_quals
!= TYPE_UNQUALIFIED
)
10621 cp_error ("type qualifiers specified for friend class declaration");
10622 type_quals
= TYPE_UNQUALIFIED
;
10626 cp_error ("`inline' specified for friend class declaration");
10630 /* Only try to do this stuff if we didn't already give up. */
10631 if (type
!= integer_type_node
)
10633 /* A friendly class? */
10634 if (current_class_type
)
10635 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10637 error ("trying to make class `%s' a friend of global scope",
10638 TYPE_NAME_STRING (type
));
10639 type
= void_type_node
;
10644 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10645 if (ctype
== NULL_TREE
)
10647 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10648 ctype
= TYPE_METHOD_BASETYPE (type
);
10650 grok_method_quals (ctype
, dummy
, quals
);
10651 type
= TREE_TYPE (dummy
);
10656 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10657 && decl_context
!= CATCHPARM
10658 && TREE_CODE (type
) != UNION_TYPE
10661 cp_error ("abstract declarator `%T' used as declaration", type
);
10662 declarator
= make_anon_name ();
10665 /* `void' at top level (not within pointer)
10666 is allowed only in typedefs or type names.
10667 We don't complain about parms either, but that is because
10668 a better error message can be made later. */
10670 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10673 error ("unnamed variable or field declared void");
10674 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10676 if (IDENTIFIER_OPNAME_P (declarator
))
10677 my_friendly_abort (356);
10679 error ("variable or field `%s' declared void", name
);
10682 error ("variable or field declared void");
10683 type
= integer_type_node
;
10686 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10687 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10689 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10691 if (ctype
|| in_namespace
)
10692 error ("cannot use `::' in parameter declaration");
10694 /* A parameter declared as an array of T is really a pointer to T.
10695 One declared as a function is really a pointer to a function.
10696 One declared as a member is really a pointer to member. */
10698 if (TREE_CODE (type
) == ARRAY_TYPE
)
10700 /* Transfer const-ness of array into that of type pointed to. */
10701 type
= build_pointer_type (TREE_TYPE (type
));
10702 type_quals
= TYPE_UNQUALIFIED
;
10704 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10705 type
= build_pointer_type (type
);
10706 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10707 type
= build_pointer_type (type
);
10708 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10710 error ("declaration of `%s' as void", name
);
10716 register tree decl
;
10718 if (decl_context
== PARM
)
10720 decl
= build_decl (PARM_DECL
, declarator
, type
);
10722 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10723 inlinep
, friendp
, raises
!= NULL_TREE
);
10725 /* Compute the type actually passed in the parmlist,
10726 for the case where there is no prototype.
10727 (For example, shorts and chars are passed as ints.)
10728 When there is a prototype, this is overridden later. */
10730 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10732 else if (decl_context
== FIELD
)
10734 if (type
== error_mark_node
)
10736 /* Happens when declaring arrays of sizes which
10737 are error_mark_node, for example. */
10740 else if (in_namespace
&& !friendp
)
10742 /* Something like struct S { int N::j; }; */
10743 cp_error ("invalid use of `::'");
10746 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10749 tree function_context
;
10751 /* We catch the others as conflicts with the builtin
10753 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10755 cp_error ("function `%D' cannot be declared friend",
10762 if (ctype
== NULL_TREE
)
10763 ctype
= current_class_type
;
10765 if (ctype
== NULL_TREE
)
10767 cp_error ("can't make `%D' into a method -- not in a class",
10769 return void_type_node
;
10772 /* ``A union may [ ... ] not [ have ] virtual functions.''
10774 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10776 cp_error ("function `%D' declared virtual inside a union",
10778 return void_type_node
;
10781 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10782 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10783 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10784 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10788 cp_error ("`%D' cannot be declared virtual, since it is always static",
10793 else if (staticp
< 2)
10794 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10795 TYPE_ARG_TYPES (type
));
10798 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10799 function_context
= (ctype
!= NULL_TREE
) ?
10800 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10801 publicp
= (! friendp
|| ! staticp
)
10802 && function_context
== NULL_TREE
;
10803 decl
= grokfndecl (ctype
, type
,
10804 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10805 ? declarator
: dname
,
10807 virtualp
, flags
, quals
, raises
,
10808 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10809 funcdef_flag
, template_count
, in_namespace
);
10810 if (decl
== NULL_TREE
)
10813 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10814 /* The decl and setting of decl_machine_attr is also turned off. */
10815 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10818 /* [class.conv.ctor]
10820 A constructor declared without the function-specifier
10821 explicit that can be called with a single parameter
10822 specifies a conversion from the type of its first
10823 parameter to the type of its class. Such a constructor
10824 is called a converting constructor. */
10825 if (explicitp
== 2)
10826 DECL_NONCONVERTING_P (decl
) = 1;
10827 else if (DECL_CONSTRUCTOR_P (decl
))
10829 /* The constructor can be called with exactly one
10830 parameter if there is at least one parameter, and
10831 any subsequent parameters have default arguments.
10832 We don't look at the first parameter, which is
10833 really just the `this' parameter for the new
10836 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10838 /* Skip the `in_chrg' argument too, if present. */
10839 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10840 arg_types
= TREE_CHAIN (arg_types
);
10842 if (arg_types
== void_list_node
10844 && TREE_CHAIN (arg_types
)
10845 && TREE_CHAIN (arg_types
) != void_list_node
10846 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10847 DECL_NONCONVERTING_P (decl
) = 1;
10850 else if (TREE_CODE (type
) == METHOD_TYPE
)
10852 /* We only get here for friend declarations of
10853 members of other classes. */
10854 /* All method decls are public, so tell grokfndecl to set
10855 TREE_PUBLIC, also. */
10856 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10857 virtualp
, flags
, quals
, raises
,
10858 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10859 template_count
, in_namespace
);
10860 if (decl
== NULL_TREE
)
10863 else if (!staticp
&& ! processing_template_decl
10864 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10865 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10868 cp_error ("field `%D' has incomplete type", declarator
);
10870 cp_error ("name `%T' has incomplete type", type
);
10872 /* If we're instantiating a template, tell them which
10873 instantiation made the field's type be incomplete. */
10874 if (current_class_type
10875 && TYPE_NAME (current_class_type
)
10876 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10877 && declspecs
&& TREE_VALUE (declspecs
)
10878 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10879 cp_error (" in instantiation of template `%T'",
10880 current_class_type
);
10882 type
= error_mark_node
;
10889 error ("`%s' is neither function nor method; cannot be declared friend",
10890 IDENTIFIER_POINTER (declarator
));
10898 /* Friends are treated specially. */
10899 if (ctype
== current_class_type
)
10900 warning ("member functions are implicitly friends of their class");
10903 tree t
= NULL_TREE
;
10904 if (decl
&& DECL_NAME (decl
))
10906 if (template_class_depth (current_class_type
) == 0)
10909 = check_explicit_specialization
10911 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10912 if (decl
== error_mark_node
)
10913 return error_mark_node
;
10916 t
= do_friend (ctype
, declarator
, decl
,
10917 last_function_parms
, attrlist
, flags
, quals
,
10920 if (t
&& funcdef_flag
)
10923 return void_type_node
;
10927 /* Structure field. It may not be a function, except for C++ */
10929 if (decl
== NULL_TREE
)
10935 /* An attempt is being made to initialize a non-static
10936 member. But, from [class.mem]:
10938 4 A member-declarator can contain a
10939 constant-initializer only if it declares a static
10940 member (_class.static_) of integral or enumeration
10941 type, see _class.static.data_.
10943 This used to be relatively common practice, but
10944 the rest of the compiler does not correctly
10945 handle the initialization unless the member is
10946 static so we make it static below. */
10947 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10949 cp_pedwarn ("making `%D' static", declarator
);
10953 if (uses_template_parms (type
))
10954 /* We'll check at instantiation time. */
10956 else if (check_static_variable_definition (declarator
,
10958 /* If we just return the declaration, crashes
10959 will sometimes occur. We therefore return
10960 void_type_node, as if this was a friend
10961 declaration, to cause callers to completely
10962 ignore this declaration. */
10963 return void_type_node
;
10966 /* 9.2p13 [class.mem] */
10967 if (declarator
== constructor_name (current_class_type
)
10968 /* Divergence from the standard: In extern "C", we
10969 allow non-static data members here, because C does
10970 and /usr/include/netinet/in.h uses that. */
10971 && (staticp
|| ! in_system_header
))
10972 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10977 /* C++ allows static class members. All other work
10978 for this is done by grokfield. */
10979 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10980 TREE_STATIC (decl
) = 1;
10981 /* In class context, 'static' means public access. */
10982 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10986 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10987 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10989 DECL_MUTABLE_P (decl
) = 1;
10990 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10994 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10995 inlinep
, friendp
, raises
!= NULL_TREE
);
10998 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11000 tree original_name
;
11006 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11007 original_name
= dname
;
11009 original_name
= declarator
;
11011 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11012 error ("storage class `auto' invalid for function `%s'", name
);
11013 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11014 error ("storage class `register' invalid for function `%s'", name
);
11016 /* Function declaration not at top level.
11017 Storage classes other than `extern' are not allowed
11018 and `extern' makes no difference. */
11019 if (! toplevel_bindings_p ()
11020 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11021 || RIDBIT_SETP (RID_INLINE
, specbits
))
11024 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11025 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11027 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11030 if (ctype
== NULL_TREE
)
11034 error ("virtual non-class function `%s'", name
);
11038 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11039 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11040 TYPE_ARG_TYPES (type
));
11042 /* Record presence of `static'. */
11043 publicp
= (ctype
!= NULL_TREE
11044 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11045 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11047 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11048 virtualp
, flags
, quals
, raises
,
11050 publicp
, inlinep
, funcdef_flag
,
11051 template_count
, in_namespace
);
11052 if (decl
== NULL_TREE
)
11057 int illegal_static
= 0;
11059 /* Don't allow a static member function in a class, and forbid
11060 declaring main to be static. */
11061 if (TREE_CODE (type
) == METHOD_TYPE
)
11063 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11064 illegal_static
= 1;
11066 else if (current_function_decl
)
11068 /* FIXME need arm citation */
11069 error ("cannot declare static function inside another function");
11070 illegal_static
= 1;
11073 if (illegal_static
)
11076 RIDBIT_RESET (RID_STATIC
, specbits
);
11082 /* It's a variable. */
11084 /* An uninitialized decl with `extern' is a reference. */
11085 decl
= grokvardecl (type
, declarator
, &specbits
,
11087 (type_quals
& TYPE_QUAL_CONST
) != 0,
11089 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11090 inlinep
, friendp
, raises
!= NULL_TREE
);
11094 DECL_CONTEXT (decl
) = ctype
;
11097 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11099 RIDBIT_RESET (RID_STATIC
, specbits
);
11101 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11103 cp_error ("static member `%D' declared `register'", decl
);
11104 RIDBIT_RESET (RID_REGISTER
, specbits
);
11106 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11108 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11110 RIDBIT_RESET (RID_EXTERN
, specbits
);
11115 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11117 /* Record `register' declaration for warnings on &
11118 and in case doing stupid register allocation. */
11120 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11121 DECL_REGISTER (decl
) = 1;
11123 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11124 DECL_THIS_EXTERN (decl
) = 1;
11126 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11127 DECL_THIS_STATIC (decl
) = 1;
11129 /* Record constancy and volatility. There's no need to do this
11130 when processing a template; we'll do this for the instantiated
11131 declaration based on the type of DECL. */
11132 if (!processing_template_decl
)
11133 c_apply_type_quals_to_decl (type_quals
, decl
);
11139 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11140 An empty exprlist is a parmlist. An exprlist which
11141 contains only identifiers at the global level
11142 is a parmlist. Otherwise, it is an exprlist. */
11145 parmlist_is_exprlist (exprs
)
11148 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11151 if (toplevel_bindings_p ())
11153 /* At the global level, if these are all identifiers,
11154 then it is a parmlist. */
11157 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11159 exprs
= TREE_CHAIN (exprs
);
11166 /* Subroutine of start_function. Ensure that each of the parameter
11167 types (as listed in PARMS) is complete, as is required for a
11168 function definition. */
11171 require_complete_types_for_parms (parms
)
11176 tree type
= TREE_TYPE (parms
);
11177 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11179 if (DECL_NAME (parms
))
11180 error ("parameter `%s' has incomplete type",
11181 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11183 error ("parameter has incomplete type");
11184 TREE_TYPE (parms
) = error_mark_node
;
11187 layout_decl (parms
, 0);
11189 parms
= TREE_CHAIN (parms
);
11193 /* Returns *TP if *TP is a local variable (or parameter). Returns
11194 NULL_TREE otherwise. */
11197 local_variable_p (tp
)
11202 if ((TREE_CODE (t
) == VAR_DECL
11203 /* A VAR_DECL with a context that is a _TYPE is a static data
11205 && !TYPE_P (CP_DECL_CONTEXT (t
))
11206 /* Any other non-local variable must be at namespace scope. */
11207 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11208 || (TREE_CODE (t
) == PARM_DECL
))
11214 /* Check that ARG, which is a default-argument expression for a
11215 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11216 something goes wrong. DECL may also be a _TYPE node, rather than a
11217 DECL, if there is no DECL available. */
11220 check_default_argument (decl
, arg
)
11227 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11228 /* We get a DEFAULT_ARG when looking at an in-class declaration
11229 with a default argument. Ignore the argument for now; we'll
11230 deal with it after the class is complete. */
11233 if (processing_template_decl
|| uses_template_parms (arg
))
11234 /* We don't do anything checking until instantiation-time. Note
11235 that there may be uninstantiated arguments even for an
11236 instantiated function, since default arguments are not
11237 instantiated until they are needed. */
11246 decl_type
= TREE_TYPE (decl
);
11248 if (arg
== error_mark_node
11249 || decl
== error_mark_node
11250 || TREE_TYPE (arg
) == error_mark_node
11251 || decl_type
== error_mark_node
)
11252 /* Something already went wrong. There's no need to check
11254 return error_mark_node
;
11256 /* [dcl.fct.default]
11258 A default argument expression is implicitly converted to the
11260 if (!TREE_TYPE (arg
)
11261 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11264 cp_error ("default argument for `%#D' has type `%T'",
11265 decl
, TREE_TYPE (arg
));
11267 cp_error ("default argument for parameter of type `%T' has type `%T'",
11268 decl_type
, TREE_TYPE (arg
));
11270 return error_mark_node
;
11273 /* [dcl.fct.default]
11275 Local variables shall not be used in default argument
11278 The keyword `this' shall not be used in a default argument of a
11279 member function. */
11280 var
= search_tree (&arg
, local_variable_p
);
11283 cp_error ("default argument `%E' uses local variable `%D'",
11285 return error_mark_node
;
11292 /* Decode the list of parameter types for a function type.
11293 Given the list of things declared inside the parens,
11294 return a list of types.
11296 The list we receive can have three kinds of elements:
11297 an IDENTIFIER_NODE for names given without types,
11298 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11299 or void_type_node, to mark the end of an argument list
11300 when additional arguments are not permitted (... was not used).
11302 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11303 a mere declaration. A nonempty identifier-list gets an error message
11304 when FUNCDEF_FLAG is zero.
11305 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11306 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11308 If all elements of the input list contain types,
11309 we return a list of the types.
11310 If all elements contain no type (except perhaps a void_type_node
11311 at the end), we return a null list.
11312 If some have types and some do not, it is an error, and we
11313 return a null list.
11315 Also set last_function_parms to either
11316 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11317 A list of names is converted to a chain of PARM_DECLs
11318 by store_parm_decls so that ultimately it is always a chain of decls.
11320 Note that in C++, parameters can take default values. These default
11321 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11322 an error to specify default values which are followed by parameters
11323 that have no default values, or an ELLIPSES. For simplicities sake,
11324 only parameters which are specified with their types can take on
11328 grokparms (first_parm
, funcdef_flag
)
11332 tree result
= NULL_TREE
;
11333 tree decls
= NULL_TREE
;
11335 if (first_parm
!= NULL_TREE
11336 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11338 if (! funcdef_flag
)
11339 pedwarn ("parameter names (without types) in function declaration");
11340 last_function_parms
= first_parm
;
11343 else if (first_parm
!= NULL_TREE
11344 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11345 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11346 my_friendly_abort (145);
11349 /* Types were specified. This is a list of declarators
11350 each represented as a TREE_LIST node. */
11351 register tree parm
, chain
;
11352 int any_init
= 0, any_error
= 0;
11354 if (first_parm
!= NULL_TREE
)
11356 tree last_result
= NULL_TREE
;
11357 tree last_decl
= NULL_TREE
;
11359 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11361 tree type
= NULL_TREE
, list_node
= parm
;
11362 register tree decl
= TREE_VALUE (parm
);
11363 tree init
= TREE_PURPOSE (parm
);
11365 chain
= TREE_CHAIN (parm
);
11366 /* @@ weak defense against parse errors. */
11367 if (TREE_CODE (decl
) != VOID_TYPE
11368 && TREE_CODE (decl
) != TREE_LIST
)
11370 /* Give various messages as the need arises. */
11371 if (TREE_CODE (decl
) == STRING_CST
)
11372 cp_error ("invalid string constant `%E'", decl
);
11373 else if (TREE_CODE (decl
) == INTEGER_CST
)
11374 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11378 if (TREE_CODE (decl
) != VOID_TYPE
)
11380 decl
= grokdeclarator (TREE_VALUE (decl
),
11381 TREE_PURPOSE (decl
),
11382 PARM
, init
!= NULL_TREE
,
11384 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11387 /* Top-level qualifiers on the parameters are
11388 ignored for function types. */
11389 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11391 if (TREE_CODE (type
) == VOID_TYPE
)
11392 decl
= void_type_node
;
11393 else if (TREE_CODE (type
) == METHOD_TYPE
)
11395 if (DECL_NAME (decl
))
11396 /* Cannot use the decl here because
11397 we don't have DECL_CONTEXT set up yet. */
11398 cp_error ("parameter `%D' invalidly declared method type",
11401 error ("parameter invalidly declared method type");
11402 type
= build_pointer_type (type
);
11403 TREE_TYPE (decl
) = type
;
11405 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11407 if (DECL_NAME (decl
))
11408 cp_error ("parameter `%D' invalidly declared offset type",
11411 error ("parameter invalidly declared offset type");
11412 type
= build_pointer_type (type
);
11413 TREE_TYPE (decl
) = type
;
11415 else if (abstract_virtuals_error (decl
, type
))
11416 any_error
= 1; /* Seems like a good idea. */
11417 else if (POINTER_TYPE_P (type
))
11420 while (POINTER_TYPE_P (t
)
11421 || (TREE_CODE (t
) == ARRAY_TYPE
11422 && TYPE_DOMAIN (t
) != NULL_TREE
))
11424 if (TREE_CODE (t
) == ARRAY_TYPE
)
11425 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11427 TYPE_PTR_P (type
) ? "pointer" : "reference");
11431 if (TREE_CODE (decl
) == VOID_TYPE
)
11433 if (result
== NULL_TREE
)
11435 result
= void_list_node
;
11436 last_result
= result
;
11440 TREE_CHAIN (last_result
) = void_list_node
;
11441 last_result
= void_list_node
;
11444 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11445 error ("`void' in parameter list must be entire list");
11449 /* Since there is a prototype, args are passed in their own types. */
11450 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11451 if (PROMOTE_PROTOTYPES
11452 && (TREE_CODE (type
) == INTEGER_TYPE
11453 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11454 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11455 DECL_ARG_TYPE (decl
) = integer_type_node
;
11456 if (!any_error
&& init
)
11459 init
= check_default_argument (decl
, init
);
11464 if (decls
== NULL_TREE
)
11471 TREE_CHAIN (last_decl
) = decl
;
11474 list_node
= tree_cons (init
, type
, NULL_TREE
);
11475 if (result
== NULL_TREE
)
11477 result
= list_node
;
11478 last_result
= result
;
11482 TREE_CHAIN (last_result
) = list_node
;
11483 last_result
= list_node
;
11487 TREE_CHAIN (last_result
) = NULL_TREE
;
11488 /* If there are no parameters, and the function does not end
11489 with `...', then last_decl will be NULL_TREE. */
11490 if (last_decl
!= NULL_TREE
)
11491 TREE_CHAIN (last_decl
) = NULL_TREE
;
11495 last_function_parms
= decls
;
11500 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11501 FUNCTION_TYPE with the newly parsed version of its default argument, which
11502 was previously digested as text. See snarf_defarg et al in lex.c. */
11505 replace_defarg (arg
, init
)
11508 if (! processing_template_decl
11509 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11510 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11511 TREE_TYPE (init
), TREE_VALUE (arg
));
11512 TREE_PURPOSE (arg
) = init
;
11519 tree t
= FUNCTION_ARG_CHAIN (d
);
11520 if (DECL_CONSTRUCTOR_P (d
)
11521 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11522 t
= TREE_CHAIN (t
);
11523 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11524 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11525 == DECL_CLASS_CONTEXT (d
))
11526 && (TREE_CHAIN (t
) == NULL_TREE
11527 || TREE_CHAIN (t
) == void_list_node
11528 || TREE_PURPOSE (TREE_CHAIN (t
))))
11533 /* These memoizing functions keep track of special properties which
11534 a class may have. `grok_ctor_properties' notices whether a class
11535 has a constructor of the form X(X&), and also complains
11536 if the class has a constructor of the form X(X).
11537 `grok_op_properties' takes notice of the various forms of
11538 operator= which are defined, as well as what sorts of type conversion
11539 may apply. Both functions take a FUNCTION_DECL as an argument. */
11542 grok_ctor_properties (ctype
, decl
)
11545 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11546 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11548 /* When a type has virtual baseclasses, a magical first int argument is
11549 added to any ctor so we can tell if the class has been initialized
11550 yet. This could screw things up in this function, so we deliberately
11551 ignore the leading int if we're in that situation. */
11552 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11554 my_friendly_assert (parmtypes
11555 && TREE_VALUE (parmtypes
) == integer_type_node
,
11557 parmtypes
= TREE_CHAIN (parmtypes
);
11558 parmtype
= TREE_VALUE (parmtypes
);
11563 A non-template constructor for class X is a copy constructor if
11564 its first parameter is of type X&, const X&, volatile X& or const
11565 volatile X&, and either there are no other parameters or else all
11566 other parameters have default arguments. */
11567 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11568 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11569 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11570 || TREE_CHAIN (parmtypes
) == void_list_node
11571 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11572 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11573 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11575 TYPE_HAS_INIT_REF (ctype
) = 1;
11576 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11577 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11581 A declaration of a constructor for a class X is ill-formed if its
11582 first parameter is of type (optionally cv-qualified) X and either
11583 there are no other parameters or else all other parameters have
11586 We *don't* complain about member template instantiations that
11587 have this form, though; they can occur as we try to decide what
11588 constructor to use during overload resolution. Since overload
11589 resolution will never prefer such a constructor to the
11590 non-template copy constructor (which is either explicitly or
11591 implicitly defined), there's no need to worry about their
11592 existence. Theoretically, they should never even be
11593 instantiated, but that's hard to forestall. */
11594 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11595 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11596 || TREE_CHAIN (parmtypes
) == void_list_node
11597 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11598 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11599 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11601 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11603 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11606 else if (TREE_CODE (parmtype
) == VOID_TYPE
11607 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11608 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11613 /* An operator with this name can be either unary or binary. */
11619 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11620 || name
== ansi_opname
[(int) ADDR_EXPR
]
11621 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11622 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11623 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11624 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11627 /* An operator with this name can only be unary. */
11633 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11634 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11635 || name
== ansi_opname
[(int) COMPONENT_REF
]
11636 || IDENTIFIER_TYPENAME_P (name
));
11639 /* Do a little sanity-checking on how they declared their operator. */
11642 grok_op_properties (decl
, virtualp
, friendp
)
11644 int virtualp
, friendp
;
11646 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11647 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11648 tree name
= DECL_NAME (decl
);
11650 if (current_class_type
== NULL_TREE
)
11657 A user-declared copy assignment operator X::operator= is a
11658 non-static non-template member function of class X with
11659 exactly one parameter of type X, X&, const X&, volatile X& or
11660 const volatile X&. */
11661 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11662 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11663 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11665 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11666 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11667 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11668 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11669 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11670 || name
== ansi_opname
[(int) MEMBER_REF
])
11671 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11672 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11673 TYPE_GETS_NEW (current_class_type
) |= 1;
11674 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11675 TYPE_GETS_DELETE (current_class_type
) |= 1;
11676 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11677 TYPE_GETS_NEW (current_class_type
) |= 2;
11678 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11679 TYPE_GETS_DELETE (current_class_type
) |= 2;
11682 if (name
== ansi_opname
[(int) NEW_EXPR
]
11683 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11685 /* When the compiler encounters the definition of A::operator new, it
11686 doesn't look at the class declaration to find out if it's static. */
11688 revert_static_member_fn (&decl
, NULL
, NULL
);
11690 /* Take care of function decl if we had syntax errors. */
11691 if (argtypes
== NULL_TREE
)
11693 = build_function_type (ptr_type_node
,
11694 hash_tree_chain (integer_type_node
,
11697 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11699 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11700 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11703 revert_static_member_fn (&decl
, NULL
, NULL
);
11705 if (argtypes
== NULL_TREE
)
11707 = build_function_type (void_type_node
,
11708 hash_tree_chain (ptr_type_node
,
11712 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11714 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11715 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11716 != void_list_node
))
11717 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11722 /* An operator function must either be a non-static member function
11723 or have at least one parameter of a class, a reference to a class,
11724 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11725 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11727 if (IDENTIFIER_TYPENAME_P (name
)
11728 || name
== ansi_opname
[(int) CALL_EXPR
]
11729 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11730 || name
== ansi_opname
[(int) COMPONENT_REF
]
11731 || name
== ansi_opname
[(int) ARRAY_REF
])
11732 cp_error ("`%D' must be a nonstatic member function", decl
);
11737 if (DECL_STATIC_FUNCTION_P (decl
))
11738 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11741 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11743 tree arg
= TREE_VALUE (p
);
11744 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11745 arg
= TREE_TYPE (arg
);
11747 /* This lets bad template code slip through. */
11748 if (IS_AGGR_TYPE (arg
)
11749 || TREE_CODE (arg
) == ENUMERAL_TYPE
11750 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11751 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11755 ("`%D' must have an argument of class or enumerated type",
11762 if (name
== ansi_opname
[(int) CALL_EXPR
])
11763 return; /* No restrictions on args. */
11765 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11767 tree t
= TREE_TYPE (name
);
11768 if (TREE_CODE (t
) == VOID_TYPE
)
11769 pedwarn ("void is not a valid type conversion operator");
11770 else if (! friendp
)
11772 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11773 const char *what
= 0;
11775 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11777 if (t
== current_class_type
)
11778 what
= "the same type";
11779 /* Don't force t to be complete here. */
11780 else if (IS_AGGR_TYPE (t
)
11782 && DERIVED_FROM_P (t
, current_class_type
))
11783 what
= "a base class";
11786 warning ("conversion to %s%s will never use a type conversion operator",
11787 ref
? "a reference to " : "", what
);
11791 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11795 if (list_length (argtypes
) != 3 && methodp
)
11797 cp_error ("`%D' must take exactly one argument", decl
);
11800 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11802 if (copy_assignment_arg_p (parmtype
, virtualp
)
11805 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11806 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11807 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11808 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11811 else if (name
== ansi_opname
[(int) COND_EXPR
])
11814 cp_error ("ANSI C++ prohibits overloading operator ?:");
11816 else if (ambi_op_p (name
))
11818 if (list_length (argtypes
) == 2)
11820 else if (list_length (argtypes
) == 3)
11822 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11823 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11824 && ! processing_template_decl
11825 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11828 cp_error ("postfix `%D' must take `int' as its argument",
11832 ("postfix `%D' must take `int' as its second argument",
11839 cp_error ("`%D' must take either zero or one argument", decl
);
11841 cp_error ("`%D' must take either one or two arguments", decl
);
11844 /* More Effective C++ rule 6. */
11846 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11847 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11849 tree arg
= TREE_VALUE (argtypes
);
11850 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11851 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11852 arg
= TREE_TYPE (arg
);
11853 arg
= TYPE_MAIN_VARIANT (arg
);
11854 if (list_length (argtypes
) == 2)
11856 if (TREE_CODE (ret
) != REFERENCE_TYPE
11857 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11859 cp_warning ("prefix `%D' should return `%T'", decl
,
11860 build_reference_type (arg
));
11864 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11865 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11869 else if (unary_op_p (name
))
11871 if (list_length (argtypes
) != 2)
11874 cp_error ("`%D' must take `void'", decl
);
11876 cp_error ("`%D' must take exactly one argument", decl
);
11879 else /* if (binary_op_p (name)) */
11881 if (list_length (argtypes
) != 3)
11884 cp_error ("`%D' must take exactly one argument", decl
);
11886 cp_error ("`%D' must take exactly two arguments", decl
);
11889 /* More Effective C++ rule 7. */
11891 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11892 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11893 || name
== ansi_opname
[COMPOUND_EXPR
]))
11894 cp_warning ("user-defined `%D' always evaluates both arguments",
11898 /* Effective C++ rule 23. */
11900 && list_length (argtypes
) == 3
11901 && (name
== ansi_opname
[PLUS_EXPR
]
11902 || name
== ansi_opname
[MINUS_EXPR
]
11903 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11904 || name
== ansi_opname
[MULT_EXPR
])
11905 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11906 cp_warning ("`%D' should return by value", decl
);
11910 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11911 if (TREE_PURPOSE (argtypes
))
11913 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11914 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11915 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11918 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11921 cp_error ("`%D' cannot have default arguments", decl
);
11926 static const char *
11928 enum tag_types code
;
11941 my_friendly_abort (981122);
11945 /* Get the struct, enum or union (CODE says which) with tag NAME.
11946 Define the tag as a forward-reference if it is not defined.
11948 C++: If a class derivation is given, process it here, and report
11949 an error if multiple derivation declarations are not identical.
11951 If this is a definition, come in through xref_tag and only look in
11952 the current frame for the name (since C++ allows new names in any
11956 xref_tag (code_type_node
, name
, globalize
)
11957 tree code_type_node
;
11961 enum tag_types tag_code
;
11962 enum tree_code code
;
11964 register tree ref
, t
;
11965 struct binding_level
*b
= current_binding_level
;
11967 tree attributes
= NULL_TREE
;
11968 tree context
= NULL_TREE
;
11970 /* If we are called from the parser, code_type_node will sometimes be a
11971 TREE_LIST. This indicates that the user wrote
11972 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11974 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11976 attributes
= TREE_PURPOSE (code_type_node
);
11977 code_type_node
= TREE_VALUE (code_type_node
);
11980 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11985 code
= RECORD_TYPE
;
11991 code
= ENUMERAL_TYPE
;
11994 my_friendly_abort (18);
11997 /* If a cross reference is requested, look up the type
11998 already defined for this tag and return it. */
11999 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
12002 name
= TYPE_IDENTIFIER (t
);
12006 t
= IDENTIFIER_TYPE_VALUE (name
);
12008 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12009 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12014 /* If we know we are defining this tag, only look it up in
12015 this scope and don't try to find it as a type. */
12016 ref
= lookup_tag (code
, name
, b
, 1);
12022 /* [dcl.type.elab] If the identifier resolves to a
12023 typedef-name or a template type-parameter, the
12024 elaborated-type-specifier is ill-formed. */
12025 if (t
!= TYPE_MAIN_VARIANT (t
)
12026 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12027 cp_pedwarn ("using typedef-name `%D' after `%s'",
12028 TYPE_NAME (t
), tag_name (tag_code
));
12029 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12030 cp_error ("using template type parameter `%T' after `%s'",
12031 t
, tag_name (tag_code
));
12036 ref
= lookup_tag (code
, name
, b
, 0);
12040 /* Try finding it as a type declaration. If that wins,
12042 ref
= lookup_name (name
, 1);
12044 if (ref
!= NULL_TREE
12045 && processing_template_decl
12046 && DECL_CLASS_TEMPLATE_P (ref
)
12047 && template_class_depth (current_class_type
) == 0)
12048 /* Since GLOBALIZE is true, we're declaring a global
12049 template, so we want this type. */
12050 ref
= DECL_RESULT (ref
);
12052 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12053 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12054 ref
= TREE_TYPE (ref
);
12059 if (ref
&& current_class_type
12060 && template_class_depth (current_class_type
)
12061 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12063 /* Since GLOBALIZE is non-zero, we are not looking at a
12064 definition of this tag. Since, in addition, we are currently
12065 processing a (member) template declaration of a template
12066 class, we must be very careful; consider:
12073 { template <class V>
12074 friend struct S1; };
12076 Here, the S2::S1 declaration should not be confused with the
12077 outer declaration. In particular, the inner version should
12078 have a template parameter of level 2, not level 1. This
12079 would be particularly important if the member declaration
12082 template <class V = U> friend struct S1;
12084 say, when we should tsubst into `U' when instantiating
12085 S2. On the other hand, when presented with:
12095 we must find the inner binding eventually. We
12096 accomplish this by making sure that the new type we
12097 create to represent this declaration has the right
12099 context
= TYPE_CONTEXT (ref
);
12104 push_obstacks_nochange ();
12108 /* If no such tag is yet defined, create a forward-reference node
12109 and record it as the "definition".
12110 When a real declaration of this type is found,
12111 the forward-reference will be altered into a real type. */
12113 /* In C++, since these migrate into the global scope, we must
12114 build them on the permanent obstack. */
12116 temp
= allocation_temporary_p ();
12118 end_temporary_allocation ();
12120 if (code
== ENUMERAL_TYPE
)
12122 cp_error ("use of enum `%#D' without previous declaration", name
);
12124 ref
= make_node (ENUMERAL_TYPE
);
12126 /* Give the type a default layout like unsigned int
12127 to avoid crashing if it does not get defined. */
12128 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12129 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12130 TREE_UNSIGNED (ref
) = 1;
12131 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12132 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12133 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12135 /* Enable us to recognize when a type is created in class context.
12136 To do nested classes correctly, this should probably be cleared
12137 out when we leave this classes scope. Currently this in only
12138 done in `start_enum'. */
12140 pushtag (name
, ref
, globalize
);
12144 struct binding_level
*old_b
= class_binding_level
;
12146 ref
= make_lang_type (code
);
12147 TYPE_CONTEXT (ref
) = context
;
12149 #ifdef NONNESTED_CLASSES
12150 /* Class types don't nest the way enums do. */
12151 class_binding_level
= (struct binding_level
*)0;
12153 pushtag (name
, ref
, globalize
);
12154 class_binding_level
= old_b
;
12159 /* If it no longer looks like a nested type, make sure it's
12161 If it is not an IDENTIFIER, this is not a declaration */
12162 if (b
->namespace_p
&& !class_binding_level
12163 && TREE_CODE (name
) == IDENTIFIER_NODE
12164 && IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12165 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12167 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12168 redeclare_class_template (ref
, current_template_parms
);
12171 /* Until the type is defined, tentatively accept whatever
12172 structure tag the user hands us. */
12173 if (TYPE_SIZE (ref
) == NULL_TREE
12174 && ref
!= current_class_type
12175 /* Have to check this, in case we have contradictory tag info. */
12176 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12178 if (tag_code
== class_type
)
12179 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12180 else if (tag_code
== record_type
)
12181 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12186 TREE_TYPE (ref
) = attributes
;
12192 xref_tag_from_type (old
, id
, globalize
)
12196 tree code_type_node
;
12198 if (TREE_CODE (old
) == RECORD_TYPE
)
12199 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12200 ? class_type_node
: record_type_node
);
12202 code_type_node
= union_type_node
;
12204 if (id
== NULL_TREE
)
12205 id
= TYPE_IDENTIFIER (old
);
12207 return xref_tag (code_type_node
, id
, globalize
);
12210 /* REF is a type (named NAME), for which we have just seen some
12211 baseclasses. BINFO is a list of those baseclasses; the
12212 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12213 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12214 struct, or union. */
12217 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12218 tree code_type_node
;
12222 /* In the declaration `A : X, Y, ... Z' we mark all the types
12223 (A, X, Y, ..., Z) so we can check for duplicates. */
12228 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12230 if (tag_code
== union_type
)
12232 cp_error ("derived union `%T' invalid", ref
);
12236 len
= list_length (binfo
);
12237 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12239 /* First, make sure that any templates in base-classes are
12240 instantiated. This ensures that if we call ourselves recursively
12241 we do not get confused about which classes are marked and which
12243 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12244 complete_type (TREE_VALUE (base
));
12246 SET_CLASSTYPE_MARKED (ref
);
12247 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12249 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12251 /* The base of a derived struct is public by default. */
12253 = (TREE_PURPOSE (binfo
) == access_public_node
12254 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12255 || (tag_code
!= class_type
12256 && (TREE_PURPOSE (binfo
) == access_default_node
12257 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12259 = (TREE_PURPOSE (binfo
) == access_protected_node
12260 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12262 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12263 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12264 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12265 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12266 tree basetype
= TREE_VALUE (binfo
);
12269 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12270 basetype
= TREE_TYPE (basetype
);
12272 || (TREE_CODE (basetype
) != RECORD_TYPE
12273 && TREE_CODE (basetype
) != TYPENAME_TYPE
12274 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12275 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12277 cp_error ("base type `%T' fails to be a struct or class type",
12278 TREE_VALUE (binfo
));
12282 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12284 /* This code replaces similar code in layout_basetypes.
12285 We put the complete_type first for implicit `typename'. */
12286 if (TYPE_SIZE (basetype
) == NULL_TREE
12287 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12289 cp_error ("base class `%T' has incomplete type", basetype
);
12294 if (CLASSTYPE_MARKED (basetype
))
12296 if (basetype
== ref
)
12297 cp_error ("recursive type `%T' undefined", basetype
);
12299 cp_error ("duplicate base type `%T' invalid", basetype
);
12303 if (TYPE_FOR_JAVA (basetype
)
12304 && (current_lang_stack
12305 == &VARRAY_TREE (current_lang_base
, 0)))
12306 TYPE_FOR_JAVA (ref
) = 1;
12308 /* Note that the BINFO records which describe individual
12309 inheritances are *not* shared in the lattice! They
12310 cannot be shared because a given baseclass may be
12311 inherited with different `accessibility' by different
12312 derived classes. (Each BINFO record describing an
12313 individual inheritance contains flags which say what
12314 the `accessibility' of that particular inheritance is.) */
12317 = make_binfo (integer_zero_node
, basetype
,
12318 CLASS_TYPE_P (basetype
)
12319 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12320 CLASS_TYPE_P (basetype
)
12321 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12323 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12324 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12325 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12326 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12327 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12329 /* We need to unshare the binfos now so that lookups during class
12330 definition work. */
12331 unshare_base_binfos (base_binfo
);
12333 SET_CLASSTYPE_MARKED (basetype
);
12335 /* We are free to modify these bits because they are meaningless
12336 at top level, and BASETYPE is a top-level type. */
12337 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12339 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12340 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12343 if (CLASS_TYPE_P (basetype
))
12345 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12346 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12353 TREE_VEC_LENGTH (binfos
) = i
;
12355 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12358 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12361 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12363 if (CLASS_TYPE_P (basetype
))
12364 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12365 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12368 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12369 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12371 /* Unmark all the types. */
12373 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12374 CLEAR_CLASSTYPE_MARKED (ref
);
12376 /* Now that we know all the base-classes, set up the list of virtual
12378 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12384 /* Begin compiling the definition of an enumeration type.
12385 NAME is its name (or null if anonymous).
12386 Returns the type object, as yet incomplete.
12387 Also records info about it so that build_enumerator
12388 may be used to declare the individual values as they are read. */
12394 register tree enumtype
= NULL_TREE
;
12395 struct binding_level
*b
= current_binding_level
;
12397 /* We are wasting space here and putting these on the permanent_obstack so
12398 that typeid(local enum) will work correctly. */
12399 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12401 /* If this is the real definition for a previous forward reference,
12402 fill in the contents in the same object that used to be the
12403 forward reference. */
12405 if (name
!= NULL_TREE
)
12406 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12408 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12410 cp_error ("multiple definition of `%#T'", enumtype
);
12411 cp_error_at ("previous definition here", enumtype
);
12415 enumtype
= make_node (ENUMERAL_TYPE
);
12416 pushtag (name
, enumtype
, 0);
12419 if (current_class_type
)
12420 TREE_ADDRESSABLE (b
->tags
) = 1;
12422 /* We don't copy this value because build_enumerator needs to do it. */
12423 enum_next_value
= integer_zero_node
;
12426 GNU_xref_decl (current_function_decl
, enumtype
);
12430 /* After processing and defining all the values of an enumeration type,
12431 install their decls in the enumeration type and finish it off.
12432 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12433 Returns ENUMTYPE. */
12436 finish_enum (enumtype
)
12439 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12440 /* Calculate the maximum value of any enumerator in this type. */
12442 tree values
= TYPE_VALUES (enumtype
);
12447 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12452 /* The TREE_VALUE is a CONST_DECL for this enumeration
12454 decl
= TREE_VALUE (pair
);
12456 /* The DECL_INITIAL will be NULL if we are processing a
12457 template declaration and this enumeration constant had no
12458 explicit initializer. */
12459 value
= DECL_INITIAL (decl
);
12460 if (value
&& !processing_template_decl
)
12462 /* Set the TREE_TYPE for the VALUE as well. That's so
12463 that when we call decl_constant_value we get an
12464 entity of the right type (but with the constant
12465 value). Since we shouldn't ever call
12466 decl_constant_value on a template type, there's no
12467 reason to do that when processing_template_decl.
12468 And, if the expression is something like a
12469 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12470 wreak havoc on the intended type of the expression.
12472 Of course, there's also no point in trying to compute
12473 minimum or maximum values if we're in a template. */
12474 TREE_TYPE (value
) = enumtype
;
12477 minnode
= maxnode
= value
;
12478 else if (tree_int_cst_lt (maxnode
, value
))
12480 else if (tree_int_cst_lt (value
, minnode
))
12484 if (processing_template_decl
)
12485 /* If this is just a template, leave the CONST_DECL
12486 alone. That way tsubst_copy will find CONST_DECLs for
12487 CONST_DECLs, and not INTEGER_CSTs. */
12490 /* In the list we're building up, we want the enumeration
12491 values, not the CONST_DECLs. */
12492 TREE_VALUE (pair
) = value
;
12496 maxnode
= minnode
= integer_zero_node
;
12498 TYPE_VALUES (enumtype
) = nreverse (values
);
12500 if (processing_template_decl
)
12502 tree scope
= current_scope ();
12503 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12504 add_tree (build_min (TAG_DEFN
, enumtype
));
12508 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12509 int lowprec
= min_precision (minnode
, unsignedp
);
12510 int highprec
= min_precision (maxnode
, unsignedp
);
12511 int precision
= MAX (lowprec
, highprec
);
12514 TYPE_SIZE (enumtype
) = NULL_TREE
;
12516 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12518 TYPE_PRECISION (enumtype
) = precision
;
12520 fixup_unsigned_type (enumtype
);
12522 fixup_signed_type (enumtype
);
12524 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12525 /* Use the width of the narrowest normal C type which is wide
12527 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12530 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12532 TYPE_SIZE (enumtype
) = 0;
12533 layout_type (enumtype
);
12535 /* Fix up all variant types of this enum type. */
12536 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12537 tem
= TYPE_NEXT_VARIANT (tem
))
12539 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12540 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12541 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12542 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12543 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12544 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12545 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12546 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12547 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12550 /* Finish debugging output for this type. */
12551 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12554 /* In start_enum we pushed obstacks. Here, we must pop them. */
12560 /* Build and install a CONST_DECL for an enumeration constant of the
12561 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12562 Assignment of sequential values by default is handled here. */
12565 build_enumerator (name
, value
, type
)
12573 /* Remove no-op casts from the value. */
12575 STRIP_TYPE_NOPS (value
);
12577 if (! processing_template_decl
)
12579 /* Validate and default VALUE. */
12580 if (value
!= NULL_TREE
)
12582 if (TREE_READONLY_DECL_P (value
))
12583 value
= decl_constant_value (value
);
12585 if (TREE_CODE (value
) == INTEGER_CST
)
12587 value
= default_conversion (value
);
12588 constant_expression_warning (value
);
12592 cp_error ("enumerator value for `%D' not integer constant", name
);
12597 /* Default based on previous value. */
12598 if (value
== NULL_TREE
&& ! processing_template_decl
)
12600 value
= enum_next_value
;
12602 cp_error ("overflow in enumeration values at `%D'", name
);
12605 /* Remove no-op casts from the value. */
12607 STRIP_TYPE_NOPS (value
);
12609 /* To fix MAX_VAL enum consts. (bkoz) */
12610 TREE_TYPE (value
) = integer_type_node
;
12614 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12615 Even in other cases, we will later (in finish_enum) be setting the
12617 if (value
!= NULL_TREE
)
12618 value
= copy_node (value
);
12620 /* C++ associates enums with global, function, or class declarations. */
12622 context
= current_scope ();
12623 if (context
&& context
== current_class_type
)
12624 /* This enum declaration is local to the class. */
12625 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12627 /* It's a global enum, or it's local to a function. (Note local to
12628 a function could mean local to a class method. */
12629 decl
= build_decl (CONST_DECL
, name
, type
);
12631 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12632 DECL_INITIAL (decl
) = value
;
12633 TREE_READONLY (decl
) = 1;
12635 if (context
&& context
== current_class_type
)
12636 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12637 on the TYPE_FIELDS list for `S'. (That's so that you can say
12638 things like `S::i' later.) */
12639 finish_member_declaration (decl
);
12643 GNU_xref_decl (current_function_decl
, decl
);
12646 if (! processing_template_decl
)
12648 /* Set basis for default for next value. */
12649 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12650 integer_one_node
, PLUS_EXPR
);
12651 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12654 result
= tree_cons (name
, decl
, NULL_TREE
);
12659 static int function_depth
;
12661 /* We're defining DECL. Make sure that it's type is OK. */
12664 check_function_type (decl
)
12667 tree fntype
= TREE_TYPE (decl
);
12669 /* In a function definition, arg types must be complete. */
12670 require_complete_types_for_parms (current_function_parms
);
12672 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12674 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12676 /* Make it return void instead, but don't change the
12677 type of the DECL_RESULT, in case we have a named return value. */
12678 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12680 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12682 = build_cplus_method_type (ctype
,
12684 FUNCTION_ARG_CHAIN (decl
));
12688 = build_function_type (void_type_node
,
12689 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12691 = build_exception_variant (fntype
,
12692 TYPE_RAISES_EXCEPTIONS (fntype
));
12695 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12698 /* Create the FUNCTION_DECL for a function definition.
12699 DECLSPECS and DECLARATOR are the parts of the declaration;
12700 they describe the function's name and the type it returns,
12701 but twisted together in a fashion that parallels the syntax of C.
12703 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12704 DECLARATOR is really the DECL for the function we are about to
12705 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12706 indicating that the function is an inline defined in-class, and
12707 SF_EXPAND indicating that we should generate RTL for this
12710 This function creates a binding context for the function body
12711 as well as setting up the FUNCTION_DECL in current_function_decl.
12713 Returns 1 on success. If the DECLARATOR is not suitable for a function
12714 (it defines a datum instead), we return 0, which tells
12715 yyparse to report a parse error.
12717 For C++, we must first check whether that datum makes any sense.
12718 For example, "class A local_a(1,2);" means that variable local_a
12719 is an aggregate of type A, which should have a constructor
12720 applied to it with the argument list [1, 2]. */
12723 start_function (declspecs
, declarator
, attrs
, flags
)
12724 tree declspecs
, declarator
, attrs
;
12728 tree ctype
= NULL_TREE
;
12731 extern int have_extern_spec
;
12732 extern int used_extern_spec
;
12733 int doing_friend
= 0;
12734 struct binding_level
*bl
;
12736 /* Sanity check. */
12737 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12738 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12740 /* This should only be done once on the top most decl. */
12741 if (have_extern_spec
&& !used_extern_spec
)
12743 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12744 used_extern_spec
= 1;
12747 if (flags
& SF_PRE_PARSED
)
12749 decl1
= declarator
;
12751 fntype
= TREE_TYPE (decl1
);
12752 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12753 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12755 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12756 class is in the (lexical) scope of the class in which it is
12758 if (!ctype
&& DECL_FRIEND_P (decl1
))
12760 ctype
= DECL_CLASS_CONTEXT (decl1
);
12762 /* CTYPE could be null here if we're dealing with a template;
12763 for example, `inline friend float foo()' inside a template
12764 will have no CTYPE set. */
12765 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12771 last_function_parms
= DECL_ARGUMENTS (decl1
);
12772 last_function_parm_tags
= NULL_TREE
;
12776 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12777 /* If the declarator is not suitable for a function definition,
12778 cause a syntax error. */
12779 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12781 fntype
= TREE_TYPE (decl1
);
12783 restype
= TREE_TYPE (fntype
);
12784 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12786 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12787 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12788 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12789 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12790 fntype
= build_function_type (integer_type_node
,
12791 TYPE_ARG_TYPES (fntype
));
12793 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12795 TYPE_ARG_TYPES (fntype
));
12796 TREE_TYPE (decl1
) = fntype
;
12799 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12800 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12801 else if (DECL_MAIN_P (decl1
))
12803 /* If this doesn't return integer_type, complain. */
12804 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12806 if (pedantic
|| warn_return_type
)
12807 pedwarn ("return type for `main' changed to `int'");
12808 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12813 /* Sometimes we don't notice that a function is a static member, and
12814 build a METHOD_TYPE for it. Fix that up now. */
12815 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
12816 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
12818 revert_static_member_fn (&decl1
, NULL
, NULL
);
12819 last_function_parms
= TREE_CHAIN (last_function_parms
);
12823 /* Warn if function was previously implicitly declared
12824 (but not if we warned then). */
12825 if (! warn_implicit
12826 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12827 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12829 /* Set up current_class_type, and enter the scope of the class, if
12832 push_nested_class (ctype
, 1);
12833 else if (DECL_STATIC_FUNCTION_P (decl1
))
12834 push_nested_class (DECL_CONTEXT (decl1
), 2);
12836 /* Now that we have entered the scope of the class, we must restore
12837 the bindings for any template parameters surrounding DECL1, if it
12838 is an inline member template. (Order is important; consider the
12839 case where a template parameter has the same name as a field of
12840 the class.) It is not until after this point that
12841 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12842 if (flags
& SF_INCLASS_INLINE
)
12843 maybe_begin_member_template_processing (decl1
);
12845 /* Effective C++ rule 15. See also c_expand_return. */
12847 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12848 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12849 cp_warning ("`operator=' should return a reference to `*this'");
12851 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12852 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12853 if (!DECL_INITIAL (decl1
))
12854 DECL_INITIAL (decl1
) = error_mark_node
;
12856 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12857 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12860 /* This function exists in static storage.
12861 (This does not mean `static' in the C sense!) */
12862 TREE_STATIC (decl1
) = 1;
12864 /* We must call push_template_decl after current_class_type is set
12865 up. (If we are processing inline definitions after exiting a
12866 class scope, current_class_type will be NULL_TREE until set above
12867 by push_nested_class.) */
12868 if (processing_template_decl
)
12869 decl1
= push_template_decl (decl1
);
12871 /* We are now in the scope of the function being defined. */
12872 current_function_decl
= decl1
;
12874 /* Save the parm names or decls from this function's declarator
12875 where store_parm_decls will find them. */
12876 current_function_parms
= last_function_parms
;
12877 current_function_parm_tags
= last_function_parm_tags
;
12879 /* Make sure the parameter and return types are reasonable. When
12880 you declare a function, these types can be incomplete, but they
12881 must be complete when you define the function. */
12882 if (! processing_template_decl
)
12883 check_function_type (decl1
);
12885 /* Build the return declaration for the function. */
12886 restype
= TREE_TYPE (fntype
);
12887 if (!processing_template_decl
)
12889 if (!DECL_RESULT (decl1
))
12891 DECL_RESULT (decl1
)
12892 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12893 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12894 DECL_RESULT (decl1
));
12898 /* Just use `void'. Nobody will ever look at this anyhow. */
12899 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12901 /* Initialize RTL machinery. We cannot do this until
12902 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12903 even when processing a template; this is how we get
12904 CURRENT_FUNCTION set up, and our per-function variables
12906 bl
= current_binding_level
;
12907 init_function_start (decl1
, input_filename
, lineno
);
12908 current_binding_level
= bl
;
12909 expanding_p
= (flags
& SF_EXPAND
) != 0;
12911 /* Even though we're inside a function body, we still don't want to
12912 call expand_expr to calculate the size of a variable-sized array.
12913 We haven't necessarily assigned RTL to all variables yet, so it's
12914 not safe to try to expand expressions involving them. */
12915 immediate_size_expand
= 0;
12916 current_function
->x_dont_save_pending_sizes_p
= 1;
12918 /* If we're building a statement-tree, start the tree now. */
12919 if (processing_template_decl
|| !expanding_p
)
12920 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
12922 /* Let the user know we're compiling this function. */
12923 if (processing_template_decl
|| !building_stmt_tree ())
12924 announce_function (decl1
);
12926 /* Record the decl so that the function name is defined.
12927 If we already have a decl for this name, and it is a FUNCTION_DECL,
12928 use the old decl. */
12929 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12931 /* A specialization is not used to guide overload resolution. */
12932 if ((flag_guiding_decls
12933 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12934 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12935 decl1
= pushdecl (decl1
);
12938 /* We need to set the DECL_CONTEXT. */
12939 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12940 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12941 /* And make sure we have enough default args. */
12942 check_default_args (decl1
);
12944 DECL_MAIN_VARIANT (decl1
) = decl1
;
12945 fntype
= TREE_TYPE (decl1
);
12948 /* Reset these in case the call to pushdecl changed them. */
12949 current_function_decl
= decl1
;
12950 current_function
->decl
= decl1
;
12952 /* Initialize the per-function data. */
12953 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
12955 /* If we already parsed this function, and we're just expanding it
12956 now, restore saved state. */
12957 struct binding_level
*bl
= current_binding_level
;
12958 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
12959 current_binding_level
= bl
;
12961 /* This function is being processed in whole-function mode; we
12962 already did semantic analysis. */
12963 current_function
->x_whole_function_mode_p
= 1;
12965 /* If we decided that we didn't want to inline this function,
12966 make sure the back-end knows that. */
12967 if (!current_function_cannot_inline
)
12968 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
12970 /* We don't need the saved data anymore. */
12971 free (DECL_SAVED_FUNCTION_DATA (decl1
));
12972 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
12974 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
12976 /* We know that this was set up by `grokclassfn'. We do not
12977 wait until `store_parm_decls', since evil parse errors may
12978 never get us to that point. Here we keep the consistency
12979 between `current_class_type' and `current_class_ptr'. */
12980 tree t
= DECL_ARGUMENTS (decl1
);
12982 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
12984 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
12987 cp_function_chain
->x_current_class_ref
12988 = build_indirect_ref (t
, NULL_PTR
);
12989 cp_function_chain
->x_current_class_ptr
= t
;
12991 /* Constructors and destructors need to know whether they're "in
12992 charge" of initializing virtual base classes. */
12993 if (DECL_DESTRUCTOR_P (decl1
))
12994 current_in_charge_parm
= TREE_CHAIN (t
);
12995 else if (DECL_CONSTRUCTOR_P (decl1
)
12997 && DECL_ARTIFICIAL (TREE_CHAIN (t
))
12998 && (DECL_NAME (TREE_CHAIN (t
))
12999 == in_charge_identifier
))
13000 current_in_charge_parm
= TREE_CHAIN (t
);
13003 if (DECL_INTERFACE_KNOWN (decl1
))
13005 tree ctx
= hack_decl_function_context (decl1
);
13007 if (DECL_NOT_REALLY_EXTERN (decl1
))
13008 DECL_EXTERNAL (decl1
) = 0;
13010 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13011 && TREE_PUBLIC (ctx
))
13012 /* This is a function in a local class in an extern inline
13014 comdat_linkage (decl1
);
13016 /* If this function belongs to an interface, it is public.
13017 If it belongs to someone else's interface, it is also external.
13018 This only affects inlines and template instantiations. */
13019 else if (interface_unknown
== 0
13020 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13021 || flag_alt_external_templates
))
13023 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13024 || processing_template_decl
)
13026 DECL_EXTERNAL (decl1
)
13028 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13029 && !DECL_VINDEX (decl1
)));
13031 /* For WIN32 we also want to put these in linkonce sections. */
13032 maybe_make_one_only (decl1
);
13035 DECL_EXTERNAL (decl1
) = 0;
13036 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13037 DECL_INTERFACE_KNOWN (decl1
) = 1;
13039 else if (interface_unknown
&& interface_only
13040 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13041 || flag_alt_external_templates
))
13043 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13044 interface, we will have interface_only set but not
13045 interface_known. In that case, we don't want to use the normal
13046 heuristics because someone will supply a #pragma implementation
13047 elsewhere, and deducing it here would produce a conflict. */
13048 comdat_linkage (decl1
);
13049 DECL_EXTERNAL (decl1
) = 0;
13050 DECL_INTERFACE_KNOWN (decl1
) = 1;
13051 DECL_DEFER_OUTPUT (decl1
) = 1;
13055 /* This is a definition, not a reference.
13056 So clear DECL_EXTERNAL. */
13057 DECL_EXTERNAL (decl1
) = 0;
13059 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13060 && ! DECL_INTERFACE_KNOWN (decl1
)
13061 /* Don't try to defer nested functions for now. */
13062 && ! hack_decl_function_context (decl1
))
13063 DECL_DEFER_OUTPUT (decl1
) = 1;
13065 DECL_INTERFACE_KNOWN (decl1
) = 1;
13068 if (doing_semantic_analysis_p ())
13071 current_binding_level
->parm_flag
= 1;
13075 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13077 if (!building_stmt_tree ())
13079 GNU_xref_function (decl1
, current_function_parms
);
13080 make_function_rtl (decl1
);
13083 /* Promote the value to int before returning it. */
13084 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13085 restype
= type_promotes_to (restype
);
13087 /* If this fcn was already referenced via a block-scope `extern' decl
13088 (or an implicit decl), propagate certain information about the usage. */
13089 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13090 TREE_ADDRESSABLE (decl1
) = 1;
13092 if (DECL_RESULT (decl1
) == NULL_TREE
)
13094 DECL_RESULT (decl1
)
13095 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13096 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13097 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13100 /* Allocate further tree nodes temporarily during compilation
13101 of this function only. Tiemann moved up here from bottom of fn. */
13102 /* If this is a nested function, then we must continue to allocate RTL
13103 on the permanent obstack in case we need to inline it later. */
13104 if (! hack_decl_function_context (decl1
))
13105 temporary_allocation ();
13107 /* Make sure that we always have a momntary obstack while we're in a
13113 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13114 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13115 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13116 else if (DECL_CONSTRUCTOR_P (decl1
))
13117 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13122 /* Called after store_parm_decls for a function-try-block. We need to update
13123 last_parm_cleanup_insn so that the base initializers for a constructor
13124 are run within this block, not before it. */
13127 expand_start_early_try_stmts ()
13129 expand_start_try_stmts ();
13130 last_parm_cleanup_insn
= get_last_insn ();
13133 /* Store the parameter declarations into the current function declaration.
13134 This is called after parsing the parameter declarations, before
13135 digesting the body of the function.
13137 Also install to binding contour return value identifier, if any. */
13140 store_parm_decls ()
13142 register tree fndecl
= current_function_decl
;
13143 register tree parm
;
13144 int parms_have_cleanups
= 0;
13145 tree cleanups
= NULL_TREE
;
13147 /* This is a list of types declared among parms in a prototype. */
13148 tree parmtags
= current_function_parm_tags
;
13150 /* This is a chain of any other decls that came in among the parm
13151 declarations. If a parm is declared with enum {foo, bar} x;
13152 then CONST_DECLs for foo and bar are put here. */
13153 tree nonparms
= NULL_TREE
;
13155 /* Create a binding level for the parms. */
13156 if (!building_stmt_tree ())
13157 expand_start_bindings (2);
13159 if (current_function_parms
)
13161 /* This case is when the function was defined with an ANSI prototype.
13162 The parms already have decls, so we need not do anything here
13163 except record them as in effect
13164 and complain if any redundant old-style parm decls were written. */
13166 tree specparms
= current_function_parms
;
13169 if (doing_semantic_analysis_p ())
13171 /* Must clear this because it might contain TYPE_DECLs declared
13173 storedecls (NULL_TREE
);
13175 /* If we're doing semantic analysis, then we'll call pushdecl
13176 for each of these. We must do them in reverse order so that
13177 they end in the correct forward order. */
13178 specparms
= nreverse (specparms
);
13181 for (parm
= specparms
; parm
; parm
= next
)
13183 next
= TREE_CHAIN (parm
);
13184 if (TREE_CODE (parm
) == PARM_DECL
)
13188 if (doing_semantic_analysis_p ())
13190 if (DECL_NAME (parm
) == NULL_TREE
13191 || TREE_CODE (TREE_TYPE (parm
)) != VOID_TYPE
)
13194 cp_error ("parameter `%D' declared void", parm
);
13197 if (! building_stmt_tree ()
13198 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13200 expand_decl (parm
);
13201 parms_have_cleanups
= 1;
13203 /* Keep track of the cleanups. */
13204 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13209 /* If we find an enum constant or a type tag,
13210 put it aside for the moment. */
13211 TREE_CHAIN (parm
) = NULL_TREE
;
13212 nonparms
= chainon (nonparms
, parm
);
13216 if (doing_semantic_analysis_p ())
13218 /* Get the decls in their original chain order
13219 and record in the function. This is all and only the
13220 PARM_DECLs that were pushed into scope by the loop above. */
13221 DECL_ARGUMENTS (fndecl
) = getdecls ();
13222 storetags (chainon (parmtags
, gettags ()));
13224 /* We built up the cleanups in reversed order. */
13225 cleanups
= nreverse (cleanups
);
13229 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13231 /* Now store the final chain of decls for the arguments
13232 as the decl-chain of the current lexical scope.
13233 Put the enumerators in as well, at the front so that
13234 DECL_ARGUMENTS is not modified. */
13235 if (doing_semantic_analysis_p ())
13236 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13238 /* Initialize the RTL code for the function. */
13239 DECL_SAVED_INSNS (fndecl
) = 0;
13240 if (! building_stmt_tree ())
13241 expand_function_start (fndecl
, parms_have_cleanups
);
13243 current_function_parms_stored
= 1;
13245 /* If this function is `main', emit a call to `__main'
13246 to run global initializers, etc. */
13247 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13248 expand_main_function ();
13250 /* Now that we have initialized the parms, we can start their
13251 cleanups. We cannot do this before, since expand_decl_cleanup
13252 should not be called before the parm can be used. */
13253 if (cleanups
&& !building_stmt_tree ())
13256 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
),
13257 TREE_VALUE (cleanups
)))
13258 cp_error ("parser lost in parsing declaration of `%D'",
13259 TREE_PURPOSE (cleanups
));
13261 cleanups
= TREE_CHAIN (cleanups
);
13264 /* Create a binding contour which can be used to catch
13265 cleanup-generated temporaries. Also, if the return value needs or
13266 has initialization, deal with that now. */
13267 if (parms_have_cleanups
)
13270 if (!building_stmt_tree ())
13271 expand_start_bindings (2);
13274 /* Do the starting of the exception specifications, if we have any. */
13275 if (flag_exceptions
&& !processing_template_decl
13276 && building_stmt_tree ()
13277 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13278 current_eh_spec_try_block
= expand_start_eh_spec ();
13280 last_parm_cleanup_insn
= get_last_insn ();
13281 last_dtor_insn
= get_last_insn ();
13284 /* Bind a name and initialization to the return value of
13285 the current function. */
13288 store_return_init (decl
)
13291 /* If this named return value comes in a register, put it in a
13292 pseudo-register. */
13293 if (DECL_REGISTER (decl
))
13295 original_result_rtx
= DECL_RTL (decl
);
13296 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13301 /* We have finished doing semantic analysis on DECL, but have not yet
13302 generated RTL for its body. Save away our current state, so that
13303 when we want to generate RTL later we know what to do. */
13306 save_function_data (decl
)
13309 struct language_function
*f
;
13311 /* Save the language-specific per-function data so that we can
13312 get it back when we really expand this function. */
13313 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13317 f
= ((struct language_function
*)
13318 xmalloc (sizeof (struct language_function
)));
13319 bcopy ((char *) cp_function_chain
, (char *) f
,
13320 sizeof (struct language_function
));
13321 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13323 /* Clear out the bits we don't need. */
13324 f
->x_base_init_list
= NULL_TREE
;
13325 f
->x_member_init_list
= NULL_TREE
;
13326 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13327 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13328 f
->x_last_dtor_insn
= NULL_RTX
;
13329 f
->x_last_parm_cleanup_insn
= NULL_RTX
;
13330 f
->x_result_rtx
= NULL_RTX
;
13331 f
->x_named_label_uses
= NULL
;
13332 f
->bindings
= NULL
;
13334 /* When we get back here again, we will be expanding. */
13335 f
->x_expanding_p
= 1;
13337 /* If we've already decided that we cannot inline this function, we
13338 must remember that fact when we actually go to expand the
13340 f
->cannot_inline
= current_function_cannot_inline
;
13343 /* At the end of every constructor we generate to code to return
13344 `this'. Do that now. */
13347 finish_constructor_body ()
13349 /* Any return from a constructor will end up here. */
13350 add_tree (build_min_nt (LABEL_STMT
, ctor_label
));
13352 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13353 generate the return, rather than a goto to CTOR_LABEL. */
13354 ctor_label
= NULL_TREE
;
13355 /* In check_return_expr we translate an empty return from a
13356 constructor to a return of `this'. */
13357 finish_return_stmt (NULL_TREE
);
13360 /* At the end of every destructor we generate code to restore virtual
13361 function tables to the values desired by base classes and to call
13362 to base class destructors. Do that now. */
13365 finish_destructor_body ()
13367 tree compound_stmt
;
13372 /* Create a block to contain all the extra code. */
13373 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13375 /* Any return from a destructor will end up here. */
13376 add_tree (build_min_nt (LABEL_STMT
, dtor_label
));
13378 /* Generate the code to call destructor on base class. If this
13379 destructor belongs to a class with virtual functions, then set
13380 the virtual function table pointer to represent the type of our
13383 /* This side-effect makes call to `build_delete' generate the code
13384 we have to have at the end of this destructor. `build_delete'
13385 will set the flag again. */
13386 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13388 /* These are two cases where we cannot delegate deletion. */
13389 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13390 || TYPE_GETS_REG_DELETE (current_class_type
))
13391 in_charge
= integer_zero_node
;
13393 in_charge
= current_in_charge_parm
;
13395 exprstmt
= build_delete (current_class_type
,
13398 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13401 if (exprstmt
!= error_mark_node
13402 && (TREE_CODE (exprstmt
) != NOP_EXPR
13403 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13404 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13406 if (exprstmt
!= void_zero_node
)
13407 /* Don't call `expand_expr_stmt' if we're not going to do
13408 anything, since -Wall will give a diagnostic. */
13409 finish_expr_stmt (exprstmt
);
13411 /* Run destructors for all virtual baseclasses. */
13412 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13414 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13415 tree if_stmt
= begin_if_stmt ();
13416 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13417 current_in_charge_parm
,
13423 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13425 tree vb
= get_vbase
13426 (BINFO_TYPE (vbases
),
13427 TYPE_BINFO (current_class_type
));
13429 (build_scoped_method_call
13430 (current_class_ref
, vb
, dtor_identifier
,
13431 build_expr_list (NULL_TREE
, integer_zero_node
)));
13433 vbases
= TREE_CHAIN (vbases
);
13436 finish_then_clause (if_stmt
);
13441 virtual_size
= c_sizeof (current_class_type
);
13443 /* At the end, call delete if that's what's requested. */
13445 /* FDIS sez: At the point of definition of a virtual destructor
13446 (including an implicit definition), non-placement operator delete
13447 shall be looked up in the scope of the destructor's class and if
13448 found shall be accessible and unambiguous.
13450 This is somewhat unclear, but I take it to mean that if the class
13451 only defines placement deletes we don't do anything here. So we
13452 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13453 they ever try to delete one of these. */
13454 if (TYPE_GETS_REG_DELETE (current_class_type
)
13455 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13459 exprstmt
= build_op_delete_call
13460 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13461 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13463 if_stmt
= begin_if_stmt ();
13464 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13465 current_in_charge_parm
,
13468 finish_expr_stmt (exprstmt
);
13469 finish_then_clause (if_stmt
);
13473 /* Close the block we started above. */
13474 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13477 /* Finish up a function declaration and compile that function
13478 all the way to assembler language output. The free the storage
13479 for the function definition.
13481 This is called after parsing the body of the function definition.
13482 LINENO is the current line number.
13484 FLAGS is a bitwise or of the following values:
13486 An extra call to poplevel (and expand_end_bindings) must be
13487 made to take care of the binding contour for the base
13488 initializers. This is only relevant for constructors.
13490 We just finished processing the body of an in-class inline
13491 function definition. (This processing will have taken place
13492 after the class definition is complete.) */
13495 finish_function (lineno
, flags
)
13499 register tree fndecl
= current_function_decl
;
13500 tree fntype
, ctype
= NULL_TREE
;
13501 /* Label to use if this function is supposed to return a value. */
13502 tree no_return_label
= NULL_TREE
;
13503 int call_poplevel
= (flags
& 1) != 0;
13504 int inclass_inline
= (flags
& 2) != 0;
13508 /* When we get some parse errors, we can end up without a
13509 current_function_decl, so cope. */
13510 if (fndecl
== NULL_TREE
)
13511 return error_mark_node
;
13513 nested
= function_depth
> 1;
13514 fntype
= TREE_TYPE (fndecl
);
13516 /* TREE_READONLY (fndecl) = 1;
13517 This caused &foo to be of type ptr-to-const-function
13518 which then got a warning when stored in a ptr-to-function variable. */
13520 /* This happens on strange parse errors. */
13521 if (! current_function_parms_stored
)
13524 store_parm_decls ();
13527 if (building_stmt_tree ())
13529 if (DECL_CONSTRUCTOR_P (fndecl
))
13531 finish_constructor_body ();
13535 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13536 finish_destructor_body ();
13537 else if (DECL_MAIN_P (fndecl
))
13539 /* Make it so that `main' always returns 0 by default. */
13541 finish_return_stmt (integer_one_node
);
13543 finish_return_stmt (integer_zero_node
);
13547 /* Finish dealing with exception specifiers. */
13548 if (flag_exceptions
&& !processing_template_decl
13549 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13550 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13551 (TREE_TYPE (current_function_decl
)),
13552 current_eh_spec_try_block
);
13556 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13558 tree ttype
= target_type (fntype
);
13561 if (IS_AGGR_TYPE (ttype
))
13562 /* Let debugger know it should output info for this type. */
13563 note_debug_info_needed (ttype
);
13565 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13567 ttype
= target_type (TREE_TYPE (parmdecl
));
13568 if (IS_AGGR_TYPE (ttype
))
13569 /* Let debugger know it should output info for this type. */
13570 note_debug_info_needed (ttype
);
13574 /* Clean house because we will need to reorder insns here. */
13575 do_pending_stack_adjust ();
13579 else if (DECL_CONSTRUCTOR_P (fndecl
))
13581 /* All subobjects have been fully constructed at this point. */
13582 end_protect_partials ();
13587 else if (return_label
!= NULL_RTX
13588 && flag_this_is_variable
<= 0
13589 && current_function_return_value
== NULL_TREE
13590 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13591 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13593 if (flag_exceptions
)
13594 expand_exception_blocks ();
13596 /* If this function is supposed to return a value, ensure that
13597 we do not fall into the cleanups by mistake. The end of our
13598 function will look like this:
13600 user code (may have return stmt somewhere)
13601 goto no_return_label
13606 NOTE_INSN_FUNCTION_END
13610 If the user omits a return stmt in the USER CODE section, we
13611 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13612 Otherwise, we won't. */
13613 if (no_return_label
)
13615 DECL_CONTEXT (no_return_label
) = fndecl
;
13616 DECL_INITIAL (no_return_label
) = error_mark_node
;
13617 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13618 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13619 expand_goto (no_return_label
);
13624 /* Remove the binding contour which is used
13625 to catch cleanup-generated temporaries. */
13626 expand_end_bindings (0, 0, 0);
13627 poplevel (0, 0, 0);
13629 /* Emit label at beginning of cleanup code for parameters. */
13630 emit_label (cleanup_label
);
13633 /* Get return value into register if that's where it's supposed
13635 if (original_result_rtx
)
13636 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13638 /* Finish building code that will trigger warnings if users forget
13639 to make their functions return values. */
13640 if (no_return_label
|| cleanup_label
)
13641 emit_jump (return_label
);
13642 if (no_return_label
)
13644 /* We don't need to call `expand_*_return' here because we
13645 don't need any cleanups here--this path of code is only
13646 for error checking purposes. */
13647 expand_label (no_return_label
);
13650 /* We hard-wired immediate_size_expand to zero in
13651 start_function. Expand_function_end will decrement this
13652 variable. So, we set the variable to one here, so that after
13653 the decrement it will remain zero. */
13654 immediate_size_expand
= 1;
13656 /* Generate rtl for function exit. */
13657 expand_function_end (input_filename
, lineno
, 1);
13660 /* We have to save this value here in case
13661 maybe_end_member_template_processing decides to pop all the
13662 template parameters. */
13663 expand_p
= !building_stmt_tree ();
13665 /* If we're saving up tree structure, tie off the function now. */
13667 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13669 /* This must come after expand_function_end because cleanups might
13670 have declarations (from inline functions) that need to go into
13671 this function's blocks. */
13672 if (doing_semantic_analysis_p ())
13674 if (current_binding_level
->parm_flag
!= 1)
13675 my_friendly_abort (122);
13676 poplevel (1, 0, 1);
13679 /* Remember that we were in class scope. */
13680 if (current_class_name
)
13681 ctype
= current_class_type
;
13683 /* Must mark the RESULT_DECL as being in this function. */
13684 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13686 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13687 to the FUNCTION_DECL node itself. */
13688 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13690 /* Undo the call to push_momentary in start_function. */
13693 /* Save away current state, if appropriate. */
13694 if (!expanding_p
&& !processing_template_decl
)
13695 save_function_data (fndecl
);
13701 int saved_flag_keep_inline_functions
=
13702 flag_keep_inline_functions
;
13704 /* So we can tell if jump_optimize sets it to 1. */
13707 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13708 && hack_decl_function_context (fndecl
))
13709 /* Trick rest_of_compilation into not deferring output of this
13710 function, even if it is inline, since the rtl_obstack for
13711 this function is the function_obstack of the enclosing
13712 function and will be deallocated when the enclosing
13713 function is gone. See save_tree_status. */
13714 flag_keep_inline_functions
= 1;
13716 /* Before we call rest_of_compilation (which will pop the
13717 CURRENT_FUNCTION), we must save these values. */
13718 returns_null
= current_function_returns_null
;
13719 returns_value
= current_function_returns_value
;
13721 /* If this is a nested function (like a template instantiation
13722 that we're compiling in the midst of compiling something
13723 else), push a new GC context. That will keep local variables
13724 on the stack from being collected while we're doing the
13725 compilation of this function. */
13726 if (function_depth
> 1)
13727 ggc_push_context ();
13729 /* Run the optimizers and output the assembler code for this
13731 if (DECL_ARTIFICIAL (fndecl
))
13733 /* Do we really *want* to inline this synthesized method? */
13735 int save_fif
= flag_inline_functions
;
13736 flag_inline_functions
= 1;
13738 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13739 will check our size. */
13740 DECL_INLINE (fndecl
) = 0;
13742 rest_of_compilation (fndecl
);
13743 flag_inline_functions
= save_fif
;
13746 rest_of_compilation (fndecl
);
13748 /* Undo the call to ggc_push_context above. */
13749 if (function_depth
> 1)
13750 ggc_pop_context ();
13752 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13754 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13756 /* Set DECL_EXTERNAL so that assemble_external will be called as
13757 necessary. We'll clear it again in finish_file. */
13758 if (! DECL_EXTERNAL (fndecl
))
13759 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13760 DECL_EXTERNAL (fndecl
) = 1;
13761 mark_inline_for_output (fndecl
);
13764 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13765 note_debug_info_needed (ctype
);
13767 returns_null
|= can_reach_end
;
13769 /* Since we don't normally go through c_expand_return for constructors,
13770 this normally gets the wrong value.
13771 Also, named return values have their return codes emitted after
13772 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13773 if (DECL_CONSTRUCTOR_P (fndecl
)
13774 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13777 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13778 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13779 else if ((warn_return_type
|| pedantic
)
13781 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13783 /* If this function returns non-void and control can drop through,
13785 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13787 /* With just -W, complain only if function returns both with
13788 and without a value. */
13789 else if (extra_warnings
&& returns_value
&& returns_null
)
13790 warning ("this function may return with or without a value");
13794 /* Since we never call rest_of_compilation, we never clear
13795 CURRENT_FUNCTION. Do so explicitly. */
13796 free_after_compilation (current_function
);
13797 current_function
= NULL
;
13800 /* If this is a in-class inline definition, we may have to pop the
13801 bindings for the template parameters that we added in
13802 maybe_begin_member_template_processing when start_function was
13804 if (inclass_inline
)
13805 maybe_end_member_template_processing ();
13807 /* Leave the scope of the class. */
13809 pop_nested_class ();
13813 /* Free all the tree nodes making up this function. */
13814 /* Switch back to allocating nodes permanently
13815 until we start another function. */
13817 permanent_allocation (1);
13819 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
))
13823 /* Stop pointing to the local nodes about to be freed. */
13824 /* But DECL_INITIAL must remain nonzero so we know this
13825 was an actual function definition. */
13826 DECL_INITIAL (fndecl
) = error_mark_node
;
13827 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13828 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13831 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13832 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13833 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13834 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13839 /* Let the error reporting routines know that we're outside a
13840 function. For a nested function, this value is used in
13841 pop_cp_function_context and then reset via pop_function_context. */
13842 current_function_decl
= NULL_TREE
;
13848 /* Create the FUNCTION_DECL for a function definition.
13849 DECLSPECS and DECLARATOR are the parts of the declaration;
13850 they describe the return type and the name of the function,
13851 but twisted together in a fashion that parallels the syntax of C.
13853 This function creates a binding context for the function body
13854 as well as setting up the FUNCTION_DECL in current_function_decl.
13856 Returns a FUNCTION_DECL on success.
13858 If the DECLARATOR is not suitable for a function (it defines a datum
13859 instead), we return 0, which tells yyparse to report a parse error.
13861 May return void_type_node indicating that this method is actually
13862 a friend. See grokfield for more details.
13864 Came here with a `.pushlevel' .
13866 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13867 CHANGES TO CODE IN `grokfield'. */
13870 start_method (declspecs
, declarator
, attrlist
)
13871 tree declarator
, declspecs
, attrlist
;
13873 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13876 /* Something too ugly to handle. */
13877 if (fndecl
== NULL_TREE
)
13880 /* Pass friends other than inline friend functions back. */
13881 if (fndecl
== void_type_node
)
13884 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13885 /* Not a function, tell parser to report parse error. */
13888 if (DECL_IN_AGGR_P (fndecl
))
13890 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13892 if (DECL_CONTEXT (fndecl
)
13893 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13894 cp_error ("`%D' is already defined in class %s", fndecl
,
13895 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13897 return void_type_node
;
13900 check_template_shadow (fndecl
);
13902 DECL_THIS_INLINE (fndecl
) = 1;
13904 if (flag_default_inline
)
13905 DECL_INLINE (fndecl
) = 1;
13907 /* We process method specializations in finish_struct_1. */
13908 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13909 fndecl
= push_template_decl (fndecl
);
13911 /* We read in the parameters on the maybepermanent_obstack,
13912 but we won't be getting back to them until after we
13913 may have clobbered them. So the call to preserve_data
13914 will keep them safe. */
13917 if (! DECL_FRIEND_P (fndecl
))
13919 if (TREE_CHAIN (fndecl
))
13921 fndecl
= copy_node (fndecl
);
13922 TREE_CHAIN (fndecl
) = NULL_TREE
;
13925 if (DECL_CONSTRUCTOR_P (fndecl
))
13927 if (! grok_ctor_properties (current_class_type
, fndecl
))
13928 return void_type_node
;
13930 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13931 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13934 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13936 /* Make a place for the parms */
13938 current_binding_level
->parm_flag
= 1;
13940 DECL_IN_AGGR_P (fndecl
) = 1;
13944 /* Go through the motions of finishing a function definition.
13945 We don't compile this method until after the whole class has
13948 FINISH_METHOD must return something that looks as though it
13949 came from GROKFIELD (since we are defining a method, after all).
13951 This is called after parsing the body of the function definition.
13952 STMTS is the chain of statements that makes up the function body.
13954 DECL is the ..._DECL that `start_method' provided. */
13957 finish_method (decl
)
13960 register tree fndecl
= decl
;
13963 register tree link
;
13965 if (decl
== void_type_node
)
13968 old_initial
= DECL_INITIAL (fndecl
);
13970 /* Undo the level for the parms (from start_method).
13971 This is like poplevel, but it causes nothing to be
13972 saved. Saving information here confuses symbol-table
13973 output routines. Besides, this information will
13974 be correctly output when this method is actually
13977 /* Clear out the meanings of the local variables of this level;
13978 also record in each decl which block it belongs to. */
13980 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13982 if (DECL_NAME (link
) != NULL_TREE
)
13983 pop_binding (DECL_NAME (link
), link
);
13984 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13985 DECL_CONTEXT (link
) = NULL_TREE
;
13988 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13989 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13990 current_binding_level
->parm_flag
,
13991 current_binding_level
->keep
);
13993 poplevel (0, 0, 0);
13995 DECL_INITIAL (fndecl
) = old_initial
;
13997 /* We used to check if the context of FNDECL was different from
13998 current_class_type as another way to get inside here. This didn't work
13999 for String.cc in libg++. */
14000 if (DECL_FRIEND_P (fndecl
))
14002 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14003 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14004 decl
= void_type_node
;
14010 /* Called when a new struct TYPE is defined.
14011 If this structure or union completes the type of any previous
14012 variable declaration, lay it out and output its rtl. */
14015 hack_incomplete_structures (type
)
14020 if (current_binding_level
->incomplete
== NULL_TREE
)
14023 if (!type
) /* Don't do this for class templates. */
14026 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14028 tree decl
= TREE_VALUE (*list
);
14029 if ((decl
&& TREE_TYPE (decl
) == type
)
14030 || (TREE_TYPE (decl
)
14031 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14032 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14034 int toplevel
= toplevel_bindings_p ();
14035 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14036 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14037 layout_type (TREE_TYPE (decl
));
14038 layout_decl (decl
, 0);
14039 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14043 expand_decl (decl
);
14044 cleanup
= maybe_build_cleanup (decl
);
14045 expand_decl_init (decl
);
14046 if (! expand_decl_cleanup (decl
, cleanup
))
14047 cp_error ("parser lost in parsing declaration of `%D'",
14050 *list
= TREE_CHAIN (*list
);
14053 list
= &TREE_CHAIN (*list
);
14057 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14058 See build_delete for information about AUTO_DELETE.
14060 Don't build these on the momentary obstack; they must live
14061 the life of the binding contour. */
14064 maybe_build_cleanup_1 (decl
, auto_delete
)
14065 tree decl
, auto_delete
;
14067 tree type
= TREE_TYPE (decl
);
14068 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14070 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14073 if (TREE_CODE (decl
) != PARM_DECL
)
14074 temp
= suspend_momentary ();
14076 if (TREE_CODE (type
) == ARRAY_TYPE
)
14080 mark_addressable (decl
);
14081 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14084 /* Optimize for space over speed here. */
14085 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14086 || flag_expensive_optimizations
)
14087 flags
|= LOOKUP_NONVIRTUAL
;
14089 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14091 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14092 && ! TYPE_HAS_DESTRUCTOR (type
))
14093 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14094 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14096 if (TREE_CODE (decl
) != PARM_DECL
)
14097 resume_momentary (temp
);
14104 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
14107 build_target_expr (decl
, value
)
14113 t
= build (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
14114 maybe_build_cleanup (decl
), NULL_TREE
);
14115 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
14116 ignore the TARGET_EXPR. If there really turn out to be no
14117 side-effects, then the optimizer should be able to get rid of
14118 whatever code is generated anyhow. */
14119 TREE_SIDE_EFFECTS (t
) = 1;
14124 /* If DECL is of a type which needs a cleanup, build that cleanup
14125 here. The cleanup does free the storage with a call to delete. */
14128 maybe_build_cleanup_and_delete (decl
)
14131 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14134 /* If DECL is of a type which needs a cleanup, build that cleanup
14135 here. The cleanup does not free the storage with a call a delete. */
14138 maybe_build_cleanup (decl
)
14141 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14144 /* Expand a C++ expression at the statement level.
14145 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14146 The C++ type checker should get all of these out when
14147 expressions are combined with other, type-providing, expressions,
14148 leaving only orphan expressions, such as:
14150 &class::bar; / / takes its address, but does nothing with it. */
14153 cplus_expand_expr_stmt (exp
)
14156 if (stmts_are_full_exprs_p
)
14157 exp
= convert_to_void (exp
, "statement");
14160 /* We should do this eventually, but right now this causes regex.o from
14161 libg++ to miscompile, and tString to core dump. */
14162 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14165 /* If we don't do this, we end up down inside expand_expr
14166 trying to do TYPE_MODE on the ERROR_MARK, and really
14167 go outside the bounds of the type. */
14168 if (exp
!= error_mark_node
)
14169 expand_expr_stmt (break_out_cleanups (exp
));
14172 /* When a stmt has been parsed, this function is called. */
14177 /* Always assume this statement was not an expression statement. If
14178 it actually was an expression statement, its our callers
14179 responsibility to fix this up. */
14180 last_expr_type
= NULL_TREE
;
14183 /* Change a static member function definition into a FUNCTION_TYPE, instead
14184 of the METHOD_TYPE that we create when it's originally parsed.
14186 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14187 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14188 other decls. Either pass the addresses of local variables or NULL. */
14191 revert_static_member_fn (decl
, fn
, argtypes
)
14192 tree
*decl
, *fn
, *argtypes
;
14195 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14196 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14198 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14199 != TYPE_UNQUALIFIED
)
14200 cp_error ("static member function `%#D' declared with type qualifiers",
14203 args
= TREE_CHAIN (args
);
14204 tmp
= build_function_type (TREE_TYPE (function
), args
);
14205 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14206 tmp
= build_exception_variant (tmp
,
14207 TYPE_RAISES_EXCEPTIONS (function
));
14208 TREE_TYPE (*decl
) = tmp
;
14209 if (DECL_ARGUMENTS (*decl
))
14210 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14211 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14218 /* Initialize the variables used during compilation of a C++
14222 push_cp_function_context (f
)
14223 struct function
*f
;
14225 struct language_function
*p
14226 = ((struct language_function
*)
14227 xcalloc (1, sizeof (struct language_function
)));
14230 /* It takes an explicit call to expand_body to generate RTL for a
14234 /* Whenever we start a new function, we destroy temporaries in the
14236 stmts_are_full_exprs_p
= 1;
14239 /* Free the language-specific parts of F, now that we've finished
14240 compiling the function. */
14243 pop_cp_function_context (f
)
14244 struct function
*f
;
14246 free (f
->language
);
14250 /* Mark P for GC. */
14253 mark_lang_function (p
)
14254 struct language_function
*p
;
14259 ggc_mark_tree (p
->x_named_labels
);
14260 ggc_mark_tree (p
->x_ctor_label
);
14261 ggc_mark_tree (p
->x_dtor_label
);
14262 ggc_mark_tree (p
->x_base_init_list
);
14263 ggc_mark_tree (p
->x_member_init_list
);
14264 ggc_mark_tree (p
->x_current_class_ptr
);
14265 ggc_mark_tree (p
->x_current_class_ref
);
14266 ggc_mark_tree (p
->x_eh_spec_try_block
);
14267 ggc_mark_tree (p
->x_scope_stmt_stack
);
14269 ggc_mark_rtx (p
->x_last_dtor_insn
);
14270 ggc_mark_rtx (p
->x_last_parm_cleanup_insn
);
14271 ggc_mark_rtx (p
->x_result_rtx
);
14273 mark_stmt_tree (&p
->x_stmt_tree
);
14274 mark_binding_level (&p
->bindings
);
14277 /* Mark the language-specific data in F for GC. */
14280 mark_cp_function_context (f
)
14281 struct function
*f
;
14283 mark_lang_function (f
->language
);
14289 return function_depth
!= 0;
14294 lang_mark_false_label_stack (l
)
14295 struct label_node
*l
;
14297 /* C++ doesn't use false_label_stack. It better be NULL. */
14298 my_friendly_assert (l
== NULL
, 19990904);
14305 enum tree_code code
= TREE_CODE (t
);
14306 if (code
== IDENTIFIER_NODE
)
14308 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14309 struct lang_id2
*li2
= li
->x
;
14310 ggc_mark_tree (li
->namespace_bindings
);
14311 ggc_mark_tree (li
->bindings
);
14312 ggc_mark_tree (li
->class_value
);
14313 ggc_mark_tree (li
->class_template_info
);
14317 ggc_mark_tree (li2
->label_value
);
14318 ggc_mark_tree (li2
->implicit_decl
);
14319 ggc_mark_tree (li2
->error_locus
);
14322 else if (code
== CPLUS_BINDING
)
14324 if (BINDING_HAS_LEVEL_P (t
))
14325 mark_binding_level (&BINDING_LEVEL (t
));
14327 ggc_mark_tree (BINDING_SCOPE (t
));
14328 ggc_mark_tree (BINDING_VALUE (t
));
14330 else if (code
== OVERLOAD
)
14331 ggc_mark_tree (OVL_FUNCTION (t
));
14332 else if (code
== TEMPLATE_PARM_INDEX
)
14333 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14334 else if (TREE_CODE_CLASS (code
) == 'd')
14336 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14341 if (!DECL_GLOBAL_CTOR_P (t
) && !DECL_GLOBAL_DTOR_P (t
))
14342 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14343 ggc_mark_tree (ld
->decl_flags
.context
);
14344 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14345 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14347 mark_binding_level (&NAMESPACE_LEVEL (t
));
14348 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14350 ggc_mark_tree (ld
->main_decl_variant
);
14351 ggc_mark_tree (ld
->befriending_classes
);
14352 ggc_mark_tree (ld
->saved_tree
);
14353 if (TREE_CODE (t
) == TYPE_DECL
)
14354 ggc_mark_tree (ld
->u
.sorted_fields
);
14355 else if (TREE_CODE (t
) == FUNCTION_DECL
14356 && !DECL_PENDING_INLINE_P (t
))
14357 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14361 else if (TREE_CODE_CLASS (code
) == 't')
14363 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14365 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14366 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14369 ggc_mark_tree (lt
->vfields
);
14370 ggc_mark_tree (lt
->vbases
);
14371 ggc_mark_tree (lt
->tags
);
14372 ggc_mark_tree (lt
->search_slot
);
14373 ggc_mark_tree (lt
->size
);
14374 ggc_mark_tree (lt
->abstract_virtuals
);
14375 ggc_mark_tree (lt
->friend_classes
);
14376 ggc_mark_tree (lt
->rtti
);
14377 ggc_mark_tree (lt
->methods
);
14378 ggc_mark_tree (lt
->template_info
);
14379 ggc_mark_tree (lt
->befriending_classes
);
14382 /* In the case of pointer-to-member function types, the
14383 TYPE_LANG_SPECIFIC is really just a tree. */
14384 ggc_mark_tree ((tree
) lt
);