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
))
1237 warning ("internal compiler error: debugging info corrupted");
1239 BLOCK_VARS (block
) = decls
;
1241 /* We can have previous subblocks and new subblocks when
1242 doing fixup_gotos with complex cleanups. We chain the new
1243 subblocks onto the end of any pre-existing subblocks. */
1244 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1250 BLOCK_VARS (block
) = decls
;
1251 BLOCK_SUBBLOCKS (block
) = subblocks
;
1255 /* In each subblock, record that this is its superior. */
1258 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1259 BLOCK_SUPERCONTEXT (link
) = block
;
1261 /* We still support the old for-scope rules, whereby the variables
1262 in a for-init statement were in scope after the for-statement
1263 ended. We only use the new rules in flag_new_for_scope is
1266 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1268 /* Remove declarations for all the DECLs in this level. */
1269 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1271 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1274 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1278 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1280 ns_binding
= NULL_TREE
;
1283 && (BINDING_LEVEL (outer_binding
)
1284 == current_binding_level
->level_chain
))
1285 /* We have something like:
1290 and we are leaving the `for' scope. There's no reason to
1291 keep the binding of the inner `i' in this case. */
1292 pop_binding (DECL_NAME (link
), link
);
1293 else if ((outer_binding
1294 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1297 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1298 /* Here, we have something like:
1306 We must pop the for-scope binding so we know what's a
1307 type and what isn't. */
1308 pop_binding (DECL_NAME (link
), link
);
1311 /* Mark this VAR_DECL as dead so that we can tell we left it
1312 there only for backward compatibility. */
1313 DECL_DEAD_FOR_LOCAL (link
) = 1;
1315 /* Keep track of what should of have happenned when we
1316 popped the binding. */
1317 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1318 DECL_SHADOWED_FOR_VAR (link
)
1319 = BINDING_VALUE (outer_binding
);
1321 /* Add it to the list of dead variables in the next
1322 outermost binding to that we can remove these when we
1323 leave that binding. */
1324 current_binding_level
->level_chain
->dead_vars_from_for
1325 = tree_cons (NULL_TREE
, link
,
1326 current_binding_level
->level_chain
->
1327 dead_vars_from_for
);
1329 /* Although we don't pop the CPLUS_BINDING, we do clear
1330 its BINDING_LEVEL since the level is going away now. */
1331 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1337 /* Remove the binding. */
1339 if (TREE_CODE (decl
) == TREE_LIST
)
1340 decl
= TREE_VALUE (decl
);
1341 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1342 pop_binding (DECL_NAME (decl
), decl
);
1343 else if (TREE_CODE (decl
) == OVERLOAD
)
1344 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1346 my_friendly_abort (0);
1350 /* Remove declarations for any `for' variables from inner scopes
1351 that we kept around. */
1352 for (link
= current_binding_level
->dead_vars_from_for
;
1353 link
; link
= TREE_CHAIN (link
))
1354 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1356 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1357 for (link
= current_binding_level
->type_shadowed
;
1358 link
; link
= TREE_CHAIN (link
))
1359 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1361 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1362 for (link
= current_binding_level
->shadowed_labels
;
1364 link
= TREE_CHAIN (link
))
1367 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1368 list if a `using' declaration put them there. The debugging
1369 back-ends won't understand OVERLOAD, so we remove them here.
1370 Because the BLOCK_VARS are (temporarily) shared with
1371 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1372 popped all the bindings. */
1377 for (d
= &BLOCK_VARS (block
); *d
; )
1379 if (TREE_CODE (*d
) == TREE_LIST
)
1380 *d
= TREE_CHAIN (*d
);
1382 d
= &TREE_CHAIN (*d
);
1386 /* If the level being exited is the top level of a function,
1387 check over all the labels. */
1390 /* Since this is the top level block of a function, the vars are
1391 the function's parameters. Don't leave them in the BLOCK
1392 because they are found in the FUNCTION_DECL instead. */
1393 BLOCK_VARS (block
) = 0;
1397 /* Any uses of undefined labels now operate under constraints
1398 of next binding contour. */
1399 if (current_function
)
1401 struct binding_level
*level_chain
;
1402 level_chain
= current_binding_level
->level_chain
;
1405 struct named_label_list
*labels
;
1406 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1407 if (labels
->binding_level
== current_binding_level
)
1409 labels
->binding_level
= level_chain
;
1410 labels
->names_in_scope
= level_chain
->names
;
1415 tmp
= current_binding_level
->keep
;
1417 pop_binding_level ();
1419 DECL_INITIAL (current_function_decl
) = block
;
1422 if (!block_previously_created
)
1423 current_binding_level
->blocks
1424 = chainon (current_binding_level
->blocks
, block
);
1426 /* If we did not make a block for the level just exited,
1427 any blocks made for inner levels
1428 (since they cannot be recorded as subblocks in that level)
1429 must be carried forward so they will later become subblocks
1430 of something else. */
1432 current_binding_level
->blocks
1433 = chainon (current_binding_level
->blocks
, subblocks
);
1435 /* Take care of compiler's internal binding structures. */
1438 add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1439 /* Each and every BLOCK node created here in `poplevel' is important
1440 (e.g. for proper debugging information) so if we created one
1441 earlier, mark it as "used". */
1443 TREE_USED (block
) = 1;
1444 block
= poplevel (keep
, reverse
, functionbody
);
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;
1455 /* Delete the node BLOCK from the current binding level.
1456 This is used for the block inside a stmt expr ({...})
1457 so that the block can be reinserted where appropriate. */
1460 delete_block (block
)
1464 if (current_binding_level
->blocks
== block
)
1465 current_binding_level
->blocks
= TREE_CHAIN (block
);
1466 for (t
= current_binding_level
->blocks
; t
;)
1468 if (TREE_CHAIN (t
) == block
)
1469 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1473 TREE_CHAIN (block
) = NULL_TREE
;
1474 /* Clear TREE_USED which is always set by poplevel.
1475 The flag is set again if insert_block is called. */
1476 TREE_USED (block
) = 0;
1479 /* Insert BLOCK at the end of the list of subblocks of the
1480 current binding level. This is used when a BIND_EXPR is expanded,
1481 to handle the BLOCK node inside the BIND_EXPR. */
1484 insert_block (block
)
1487 TREE_USED (block
) = 1;
1488 current_binding_level
->blocks
1489 = chainon (current_binding_level
->blocks
, block
);
1492 /* Set the BLOCK node for the innermost scope
1493 (the one we are currently in). */
1497 register tree block
;
1499 current_binding_level
->this_block
= block
;
1502 /* Do a pushlevel for class declarations. */
1507 register struct binding_level
*newlevel
;
1509 /* Reuse or create a struct for this binding level. */
1510 #if defined(DEBUG_CP_BINDING_LEVELS)
1512 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1513 if (free_binding_level
)
1514 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1516 newlevel
= free_binding_level
;
1517 free_binding_level
= free_binding_level
->level_chain
;
1520 newlevel
= make_binding_level ();
1522 #if defined(DEBUG_CP_BINDING_LEVELS)
1524 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1526 push_binding_level (newlevel
, 0, 0);
1528 class_binding_level
= current_binding_level
;
1529 class_binding_level
->parm_flag
= 2;
1532 /* ...and a poplevel for class declarations. */
1537 register struct binding_level
*level
= class_binding_level
;
1540 my_friendly_assert (level
!= 0, 354);
1542 /* If we're leaving a toplevel class, don't bother to do the setting
1543 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1544 shouldn't even be used when current_class_type isn't set, and second,
1545 if we don't touch it here, we're able to use the cache effect if the
1546 next time we're entering a class scope, it is the same class. */
1547 if (current_class_depth
!= 1)
1549 struct binding_level
* b
;
1551 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1552 for (shadowed
= level
->class_shadowed
;
1554 shadowed
= TREE_CHAIN (shadowed
))
1555 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1557 /* Find the next enclosing class, and recreate
1558 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1559 b
= level
->level_chain
;
1560 while (b
&& b
->parm_flag
!= 2)
1564 for (shadowed
= b
->class_shadowed
;
1566 shadowed
= TREE_CHAIN (shadowed
))
1570 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1571 while (t
&& BINDING_LEVEL (t
) != b
)
1575 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1576 = BINDING_VALUE (t
);
1580 /* Remember to save what IDENTIFIER's were bound in this scope so we
1581 can recover from cache misses. */
1583 previous_class_type
= current_class_type
;
1584 previous_class_values
= class_binding_level
->class_shadowed
;
1586 for (shadowed
= level
->type_shadowed
;
1588 shadowed
= TREE_CHAIN (shadowed
))
1589 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1591 /* Remove the bindings for all of the class-level declarations. */
1592 for (shadowed
= level
->class_shadowed
;
1594 shadowed
= TREE_CHAIN (shadowed
))
1595 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1597 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1598 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1599 class_binding_level
->parm_flag
,
1600 class_binding_level
->keep
);
1602 /* Now, pop out of the binding level which we created up in the
1603 `pushlevel_class' routine. */
1604 #if defined(DEBUG_CP_BINDING_LEVELS)
1606 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1608 pop_binding_level ();
1611 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1612 for any names in enclosing classes. */
1615 clear_identifier_class_values ()
1619 if (!class_binding_level
)
1622 for (t
= class_binding_level
->class_shadowed
;
1625 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1628 /* Returns non-zero if T is a virtual function table. */
1631 vtable_decl_p (t
, data
)
1633 void *data ATTRIBUTE_UNUSED
;
1635 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1638 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1642 vtype_decl_p (t
, data
)
1644 void *data ATTRIBUTE_UNUSED
;
1646 return (TREE_CODE (t
) == TYPE_DECL
1647 && TREE_TYPE (t
) != error_mark_node
1648 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1649 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1652 /* Return the declarations that are members of the namespace NS. */
1655 cp_namespace_decls (ns
)
1658 return NAMESPACE_LEVEL (ns
)->names
;
1661 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1662 itself, calling F for each. The DATA is passed to F as well. */
1665 walk_namespaces_r (namespace, f
, data
)
1667 walk_namespaces_fn f
;
1673 result
|= (*f
) (namespace, data
);
1675 for (current
= cp_namespace_decls (namespace);
1677 current
= TREE_CHAIN (current
))
1679 if (TREE_CODE (current
) != NAMESPACE_DECL
1680 || DECL_NAMESPACE_ALIAS (current
))
1682 if (!DECL_LANG_SPECIFIC (current
))
1685 my_friendly_assert (current
== std_node
, 393);
1689 /* We found a namespace. */
1690 result
|= walk_namespaces_r (current
, f
, data
);
1696 /* Walk all the namespaces, calling F for each. The DATA is passed to
1700 walk_namespaces (f
, data
)
1701 walk_namespaces_fn f
;
1704 return walk_namespaces_r (global_namespace
, f
, data
);
1707 struct walk_globals_data
{
1708 walk_globals_pred p
;
1713 /* Walk the global declarations in NAMESPACE. Whenever one is found
1714 for which P returns non-zero, call F with its address. If any call
1715 to F returns a non-zero value, return a non-zero value. */
1718 walk_globals_r (namespace, data
)
1722 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1723 walk_globals_pred p
= wgd
->p
;
1724 walk_globals_fn f
= wgd
->f
;
1725 void *d
= wgd
->data
;
1729 t
= &NAMESPACE_LEVEL (namespace)->names
;
1736 result
|= (*f
) (t
, d
);
1738 /* If F changed *T, then *T still points at the next item to
1741 t
= &TREE_CHAIN (*t
);
1747 /* Walk the global declarations. Whenever one is found for which P
1748 returns non-zero, call F with its address. If any call to F
1749 returns a non-zero value, return a non-zero value. */
1752 walk_globals (p
, f
, data
)
1753 walk_globals_pred p
;
1757 struct walk_globals_data wgd
;
1762 return walk_namespaces (walk_globals_r
, &wgd
);
1765 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1766 DATA is non-NULL, this is the last time we will call
1767 wrapup_global_declarations for this NAMESPACE. */
1770 wrapup_globals_for_namespace (namespace, data
)
1774 tree globals
= cp_namespace_decls (namespace);
1775 int len
= list_length (globals
);
1776 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1780 int last_time
= (data
!= 0);
1782 if (last_time
&& namespace == global_namespace
)
1783 /* Let compile_file handle the global namespace. */
1786 /* Process the decls in reverse order--earliest first.
1787 Put them into VEC from back to front, then take out from front. */
1789 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1790 vec
[len
- i
- 1] = decl
;
1794 check_global_declarations (vec
, len
);
1798 /* Temporarily mark vtables as external. That prevents
1799 wrapup_global_declarations from writing them out; we must process
1800 them ourselves in finish_vtable_vardecl. */
1801 for (i
= 0; i
< len
; ++i
)
1802 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1804 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1805 DECL_EXTERNAL (vec
[i
]) = 1;
1808 /* Write out any globals that need to be output. */
1809 result
= wrapup_global_declarations (vec
, len
);
1811 /* Undo the hack to DECL_EXTERNAL above. */
1812 for (i
= 0; i
< len
; ++i
)
1813 if (vtable_decl_p (vec
[i
], /*data=*/0)
1814 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1816 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1817 DECL_EXTERNAL (vec
[i
]) = 0;
1824 /* Mark ARG (which is really a struct binding_level **) for GC. */
1827 mark_binding_level (arg
)
1830 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1834 ggc_mark_tree (lvl
->names
);
1835 ggc_mark_tree (lvl
->tags
);
1836 ggc_mark_tree (lvl
->usings
);
1837 ggc_mark_tree (lvl
->using_directives
);
1838 ggc_mark_tree (lvl
->class_shadowed
);
1839 ggc_mark_tree (lvl
->type_shadowed
);
1840 ggc_mark_tree (lvl
->shadowed_labels
);
1841 ggc_mark_tree (lvl
->blocks
);
1842 ggc_mark_tree (lvl
->this_block
);
1843 ggc_mark_tree (lvl
->incomplete
);
1844 ggc_mark_tree (lvl
->dead_vars_from_for
);
1846 lvl
= lvl
->level_chain
;
1850 /* For debugging. */
1851 static int no_print_functions
= 0;
1852 static int no_print_builtins
= 0;
1855 print_binding_level (lvl
)
1856 struct binding_level
*lvl
;
1860 fprintf (stderr
, " blocks=");
1861 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1862 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1863 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1864 if (lvl
->tag_transparent
)
1865 fprintf (stderr
, " tag-transparent");
1866 if (lvl
->more_cleanups_ok
)
1867 fprintf (stderr
, " more-cleanups-ok");
1868 if (lvl
->have_cleanups
)
1869 fprintf (stderr
, " have-cleanups");
1870 fprintf (stderr
, "\n");
1873 fprintf (stderr
, " names:\t");
1874 /* We can probably fit 3 names to a line? */
1875 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1877 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1879 if (no_print_builtins
1880 && (TREE_CODE (t
) == TYPE_DECL
)
1881 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1884 /* Function decls tend to have longer names. */
1885 if (TREE_CODE (t
) == FUNCTION_DECL
)
1892 fprintf (stderr
, "\n\t");
1895 print_node_brief (stderr
, "", t
, 0);
1896 if (t
== error_mark_node
)
1900 fprintf (stderr
, "\n");
1904 fprintf (stderr
, " tags:\t");
1906 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1908 if (TREE_PURPOSE (t
) == NULL_TREE
)
1910 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1917 fprintf (stderr
, "\n\t");
1920 if (TREE_PURPOSE (t
) == NULL_TREE
)
1922 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1923 fprintf (stderr
, ">");
1925 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1926 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1929 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1930 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1931 fprintf (stderr
, ">");
1935 fprintf (stderr
, "\n");
1937 if (lvl
->class_shadowed
)
1939 fprintf (stderr
, " class-shadowed:");
1940 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1942 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1944 fprintf (stderr
, "\n");
1946 if (lvl
->type_shadowed
)
1948 fprintf (stderr
, " type-shadowed:");
1949 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1951 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1953 fprintf (stderr
, "\n");
1958 print_other_binding_stack (stack
)
1959 struct binding_level
*stack
;
1961 struct binding_level
*level
;
1962 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1964 fprintf (stderr
, "binding level ");
1965 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1966 fprintf (stderr
, "\n");
1967 print_binding_level (level
);
1972 print_binding_stack ()
1974 struct binding_level
*b
;
1975 fprintf (stderr
, "current_binding_level=");
1976 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
1977 fprintf (stderr
, "\nclass_binding_level=");
1978 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
1979 fprintf (stderr
, "\nglobal_binding_level=");
1980 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
1981 fprintf (stderr
, "\n");
1982 if (class_binding_level
)
1984 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1985 if (b
== current_binding_level
)
1988 b
= class_binding_level
;
1990 b
= current_binding_level
;
1993 b
= current_binding_level
;
1994 print_other_binding_stack (b
);
1995 fprintf (stderr
, "global:\n");
1996 print_binding_level (global_binding_level
);
1999 /* Namespace binding access routines: The namespace_bindings field of
2000 the identifier is polymorphic, with three possible values:
2001 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2002 indicating the BINDING_VALUE of global_namespace. */
2004 /* Check whether the a binding for the name to scope is known.
2005 Assumes that the bindings of the name are already a list
2006 of bindings. Returns the binding found, or NULL_TREE. */
2009 find_binding (name
, scope
)
2013 tree iter
, prev
= NULL_TREE
;
2015 scope
= ORIGINAL_NAMESPACE (scope
);
2017 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2018 iter
= TREE_CHAIN (iter
))
2020 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2021 if (BINDING_SCOPE (iter
) == scope
)
2023 /* Move binding found to the front of the list, so
2024 subsequent lookups will find it faster. */
2027 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2028 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2029 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2038 /* Always returns a binding for name in scope. If the
2039 namespace_bindings is not a list, convert it to one first.
2040 If no binding is found, make a new one. */
2043 binding_for_name (name
, scope
)
2047 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2050 scope
= ORIGINAL_NAMESPACE (scope
);
2052 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2054 /* Get rid of optimization for global scope. */
2055 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2056 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2057 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2059 if (b
&& (result
= find_binding (name
, scope
)))
2061 /* Not found, make a new permanent one. */
2062 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2063 result
= make_node (CPLUS_BINDING
);
2064 TREE_CHAIN (result
) = b
;
2065 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2066 BINDING_SCOPE (result
) = scope
;
2067 BINDING_TYPE (result
) = NULL_TREE
;
2068 BINDING_VALUE (result
) = NULL_TREE
;
2073 /* Return the binding value for name in scope, considering that
2074 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2077 namespace_binding (name
, scope
)
2081 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2084 if (scope
== NULL_TREE
)
2085 scope
= global_namespace
;
2086 if (TREE_CODE (b
) != CPLUS_BINDING
)
2087 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2088 name
= find_binding (name
,scope
);
2089 if (name
== NULL_TREE
)
2091 return BINDING_VALUE (name
);
2094 /* Set the binding value for name in scope. If modifying the binding
2095 of global_namespace is attempted, try to optimize it. */
2098 set_namespace_binding (name
, scope
, val
)
2105 if (scope
== NULL_TREE
)
2106 scope
= global_namespace
;
2108 if (scope
== global_namespace
)
2110 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2111 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2113 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2117 b
= binding_for_name (name
, scope
);
2118 BINDING_VALUE (b
) = val
;
2121 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2122 select a name that is unique to this compilation unit. */
2125 push_namespace (name
)
2130 int implicit_use
= 0;
2132 if (!global_namespace
)
2134 /* This must be ::. */
2135 my_friendly_assert (name
== get_identifier ("::"), 377);
2140 /* The name of anonymous namespace is unique for the translation
2142 if (!anonymous_namespace_name
)
2143 anonymous_namespace_name
= get_file_function_name ('N');
2144 name
= anonymous_namespace_name
;
2145 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2147 /* Reopening anonymous namespace. */
2151 else if (current_namespace
== global_namespace
2152 && name
== DECL_NAME (std_node
))
2159 /* Check whether this is an extended namespace definition. */
2160 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2161 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2164 if (DECL_NAMESPACE_ALIAS (d
))
2166 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2167 d
, DECL_NAMESPACE_ALIAS (d
));
2168 d
= DECL_NAMESPACE_ALIAS (d
);
2175 /* Make a new namespace, binding the name to it. */
2176 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2177 /* The global namespace is not pushed, and the global binding
2178 level is set elsewhere. */
2183 declare_namespace_level ();
2184 NAMESPACE_LEVEL (d
) = current_binding_level
;
2188 resume_binding_level (NAMESPACE_LEVEL (d
));
2191 do_using_directive (d
);
2192 /* Enter the name space. */
2193 current_namespace
= d
;
2196 /* Pop from the scope of the current namespace. */
2201 if (current_namespace
== global_namespace
)
2203 my_friendly_assert (in_std
>0, 980421);
2207 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2208 /* The binding level is not popped, as it might be re-opened later. */
2209 suspend_binding_level ();
2212 /* Push into the scope of the namespace NS, even if it is deeply
2213 nested within another namespace. */
2216 push_nested_namespace (ns
)
2219 if (ns
== global_namespace
)
2220 push_to_top_level ();
2223 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2224 push_namespace (DECL_NAME (ns
));
2228 /* Pop back from the scope of the namespace NS, which was previously
2229 entered with push_nested_namespace. */
2232 pop_nested_namespace (ns
)
2235 while (ns
!= global_namespace
)
2238 ns
= CP_DECL_CONTEXT (ns
);
2241 pop_from_top_level ();
2245 /* Subroutines for reverting temporarily to top-level for instantiation
2246 of templates and such. We actually need to clear out the class- and
2247 local-value slots of all identifiers, so that only the global values
2248 are at all visible. Simply setting current_binding_level to the global
2249 scope isn't enough, because more binding levels may be pushed. */
2250 struct saved_scope
*scope_chain
;
2252 /* Mark ST for GC. */
2256 struct stmt_tree
*st
;
2258 ggc_mark_tree (st
->x_last_stmt
);
2259 ggc_mark_tree (st
->x_last_expr_type
);
2262 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2265 mark_saved_scope (arg
)
2268 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2271 mark_binding_level (&t
->class_bindings
);
2272 ggc_mark_tree (t
->old_bindings
);
2273 ggc_mark_tree (t
->old_namespace
);
2274 ggc_mark_tree (t
->class_name
);
2275 ggc_mark_tree (t
->class_type
);
2276 ggc_mark_tree (t
->access_specifier
);
2277 ggc_mark_tree (t
->function_decl
);
2279 ggc_mark_tree_varray (t
->lang_base
);
2280 ggc_mark_tree (t
->lang_name
);
2281 ggc_mark_tree (t
->x_function_parms
);
2282 ggc_mark_tree (t
->template_parms
);
2283 ggc_mark_tree (t
->x_previous_class_type
);
2284 ggc_mark_tree (t
->x_previous_class_values
);
2285 ggc_mark_tree (t
->x_saved_tree
);
2287 mark_stmt_tree (&t
->x_stmt_tree
);
2288 mark_binding_level (&t
->bindings
);
2294 store_bindings (names
, old_bindings
)
2295 tree names
, old_bindings
;
2298 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2300 tree binding
, t1
, id
;
2302 if (TREE_CODE (t
) == TREE_LIST
)
2303 id
= TREE_PURPOSE (t
);
2308 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2309 we have no IDENTIFIER_BINDING if we have left the class
2310 scope, but cached the class-level declarations. */
2311 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2314 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2315 if (TREE_VEC_ELT (t1
, 0) == id
)
2318 binding
= make_tree_vec (4);
2322 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2323 TREE_VEC_ELT (binding
, 0) = id
;
2324 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2325 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2326 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2327 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2328 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2330 TREE_CHAIN (binding
) = old_bindings
;
2331 old_bindings
= binding
;
2335 return old_bindings
;
2339 maybe_push_to_top_level (pseudo
)
2342 struct saved_scope
*s
;
2343 struct binding_level
*b
;
2347 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2349 b
= scope_chain
? current_binding_level
: 0;
2351 /* If we're in the middle of some function, save our state. */
2352 if (current_function
)
2355 push_function_context_to (NULL_TREE
);
2360 old_bindings
= NULL_TREE
;
2361 if (scope_chain
&& previous_class_type
)
2362 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2364 /* Have to include global_binding_level, because class-level decls
2365 aren't listed anywhere useful. */
2366 for (; b
; b
= b
->level_chain
)
2370 /* Template IDs are inserted into the global level. If they were
2371 inserted into namespace level, finish_file wouldn't find them
2372 when doing pending instantiations. Therefore, don't stop at
2373 namespace level, but continue until :: . */
2374 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2377 old_bindings
= store_bindings (b
->names
, old_bindings
);
2378 /* We also need to check class_shadowed to save class-level type
2379 bindings, since pushclass doesn't fill in b->names. */
2380 if (b
->parm_flag
== 2)
2381 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2383 /* Unwind type-value slots back to top level. */
2384 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2385 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2387 s
->prev
= scope_chain
;
2388 s
->old_bindings
= old_bindings
;
2390 s
->need_pop_function_context
= need_pop
;
2391 s
->function_decl
= current_function_decl
;
2394 current_function_decl
= NULL_TREE
;
2395 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2396 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2397 current_lang_name
= lang_name_cplusplus
;
2398 strict_prototype
= strict_prototypes_lang_cplusplus
;
2399 current_namespace
= global_namespace
;
2401 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2405 push_to_top_level ()
2407 maybe_push_to_top_level (0);
2411 pop_from_top_level ()
2413 struct saved_scope
*s
= scope_chain
;
2416 /* Clear out class-level bindings cache. */
2417 if (previous_class_type
)
2418 invalidate_class_lookup_cache ();
2422 VARRAY_FREE (current_lang_base
);
2424 scope_chain
= s
->prev
;
2425 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2427 tree id
= TREE_VEC_ELT (t
, 0);
2430 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2431 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2432 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2436 if (current_lang_name
== lang_name_cplusplus
)
2437 strict_prototype
= strict_prototypes_lang_cplusplus
;
2438 else if (current_lang_name
== lang_name_c
)
2439 strict_prototype
= strict_prototypes_lang_c
;
2441 /* If we were in the middle of compiling a function, restore our
2443 if (s
->need_pop_function_context
)
2444 pop_function_context_from (NULL_TREE
);
2445 current_function_decl
= s
->function_decl
;
2450 /* Push a definition of struct, union or enum tag "name".
2451 into binding_level "b". "type" should be the type node,
2452 We assume that the tag "name" is not already defined.
2454 Note that the definition may really be just a forward reference.
2455 In that case, the TYPE_SIZE will be a NULL_TREE.
2457 C++ gratuitously puts all these tags in the name space. */
2459 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2460 record the shadowed value for this binding contour. TYPE is
2461 the type that ID maps to. */
2464 set_identifier_type_value_with_scope (id
, type
, b
)
2467 struct binding_level
*b
;
2469 if (!b
->namespace_p
)
2471 /* Shadow the marker, not the real thing, so that the marker
2472 gets restored later. */
2473 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2475 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2479 tree binding
= binding_for_name (id
, current_namespace
);
2480 BINDING_TYPE (binding
) = type
;
2481 /* Store marker instead of real type. */
2482 type
= global_type_node
;
2484 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2487 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2490 set_identifier_type_value (id
, type
)
2494 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2497 /* Return the type associated with id. */
2500 identifier_type_value (id
)
2503 /* There is no type with that name, anywhere. */
2504 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2506 /* This is not the type marker, but the real thing. */
2507 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2508 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2509 /* Have to search for it. It must be on the global level, now.
2510 Ask lookup_name not to return non-types. */
2511 id
= lookup_name_real (id
, 2, 1, 0);
2513 return TREE_TYPE (id
);
2517 /* Pop off extraneous binding levels left over due to syntax errors.
2519 We don't pop past namespaces, as they might be valid. */
2524 #ifdef DEBUG_CP_BINDING_LEVELS
2525 fprintf (stderr
, "XXX entering pop_everything ()\n");
2527 while (!toplevel_bindings_p ())
2529 if (current_binding_level
->parm_flag
== 2)
2530 pop_nested_class ();
2534 #ifdef DEBUG_CP_BINDING_LEVELS
2535 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2539 /* The type TYPE is being declared. If it is a class template, or a
2540 specialization of a class template, do any processing required and
2541 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2542 being declared a friend. B is the binding level at which this TYPE
2545 Returns the TYPE_DECL for TYPE, which may have been altered by this
2549 maybe_process_template_type_declaration (type
, globalize
, b
)
2552 struct binding_level
* b
;
2554 tree decl
= TYPE_NAME (type
);
2556 if (processing_template_parmlist
)
2557 /* You can't declare a new template type in a template parameter
2558 list. But, you can declare a non-template type:
2560 template <class A*> struct S;
2562 is a forward-declaration of `A'. */
2566 maybe_check_template_type (type
);
2568 my_friendly_assert (IS_AGGR_TYPE (type
)
2569 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2572 if (processing_template_decl
)
2574 /* This may change after the call to
2575 push_template_decl_real, but we want the original value. */
2576 tree name
= DECL_NAME (decl
);
2578 decl
= push_template_decl_real (decl
, globalize
);
2579 /* If the current binding level is the binding level for the
2580 template parameters (see the comment in
2581 begin_template_parm_list) and the enclosing level is a class
2582 scope, and we're not looking at a friend, push the
2583 declaration of the member class into the class scope. In the
2584 friend case, push_template_decl will already have put the
2585 friend into global scope, if appropriate. */
2586 if (TREE_CODE (type
) != ENUMERAL_TYPE
2587 && !globalize
&& b
->pseudo_global
2588 && b
->level_chain
->parm_flag
== 2)
2590 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2591 /* Put this tag on the list of tags for the class, since
2592 that won't happen below because B is not the class
2593 binding level, but is instead the pseudo-global level. */
2594 b
->level_chain
->tags
=
2595 tree_cons (name
, type
, b
->level_chain
->tags
);
2596 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2597 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2605 /* In C++, you don't have to write `struct S' to refer to `S'; you
2606 can just use `S'. We accomplish this by creating a TYPE_DECL as
2607 if the user had written `typedef struct S S'. Create and return
2608 the TYPE_DECL for TYPE. */
2611 create_implicit_typedef (name
, type
)
2617 decl
= build_decl (TYPE_DECL
, name
, type
);
2618 SET_DECL_ARTIFICIAL (decl
);
2619 /* There are other implicit type declarations, like the one *within*
2620 a class that allows you to write `S::S'. We must distinguish
2622 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2623 TYPE_NAME (type
) = decl
;
2628 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2629 Normally put it into the inner-most non-tag-transparent scope,
2630 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2631 The latter is needed for implicit declarations. */
2634 pushtag (name
, type
, globalize
)
2638 register struct binding_level
*b
;
2640 b
= current_binding_level
;
2641 while (b
->tag_transparent
2642 || (globalize
&& b
->parm_flag
== 2))
2645 b
->tags
= tree_cons (name
, type
, b
->tags
);
2649 /* Do C++ gratuitous typedefing. */
2650 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2652 register tree d
= NULL_TREE
;
2654 tree context
= TYPE_CONTEXT (type
);
2658 tree cs
= current_scope ();
2662 else if (cs
!= NULL_TREE
2663 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2664 /* When declaring a friend class of a local class, we want
2665 to inject the newly named class into the scope
2666 containing the local class, not the namespace scope. */
2667 context
= hack_decl_function_context (get_type_decl (cs
));
2670 context
= current_namespace
;
2672 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2673 || b
->parm_flag
== 2)
2676 if (current_lang_name
== lang_name_java
)
2677 TYPE_FOR_JAVA (type
) = 1;
2679 d
= create_implicit_typedef (name
, type
);
2680 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2682 set_identifier_type_value_with_scope (name
, type
, b
);
2684 d
= maybe_process_template_type_declaration (type
,
2687 if (b
->parm_flag
== 2)
2689 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2690 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2691 class. But if it's a member template class, we
2692 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2694 finish_member_declaration (d
);
2696 pushdecl_class_level (d
);
2699 d
= pushdecl_with_scope (d
, b
);
2701 if (ANON_AGGRNAME_P (name
))
2702 DECL_IGNORED_P (d
) = 1;
2704 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2705 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2706 if (!uses_template_parms (type
))
2707 DECL_ASSEMBLER_NAME (d
)
2708 = get_identifier (build_overload_name (type
, 1, 1));
2710 if (b
->parm_flag
== 2)
2712 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2713 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2717 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2718 /* Use the canonical TYPE_DECL for this node. */
2719 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2722 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2723 will be the tagged type we just added to the current
2724 binding level. This fake NULL-named TYPE_DECL node helps
2725 dwarfout.c to know when it needs to output a
2726 representation of a tagged type, and it also gives us a
2727 convenient place to record the "scope start" address for
2730 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2731 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2735 /* Counter used to create anonymous type names. */
2737 static int anon_cnt
= 0;
2739 /* Return an IDENTIFIER which can be used as a name for
2740 anonymous structs and unions. */
2747 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2748 return get_identifier (buf
);
2751 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2752 This keeps dbxout from getting confused. */
2757 register struct binding_level
*b
;
2759 static int last_cnt
= 0;
2761 /* Fast out if no new anon names were declared. */
2762 if (last_cnt
== anon_cnt
)
2765 b
= current_binding_level
;
2766 while (b
->tag_transparent
)
2771 /* A NULL purpose means we have already processed all tags
2772 from here to the end of the list. */
2773 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2775 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2776 TREE_PURPOSE (tags
) = NULL_TREE
;
2777 tags
= TREE_CHAIN (tags
);
2779 last_cnt
= anon_cnt
;
2782 /* Subroutine of duplicate_decls: return truthvalue of whether
2783 or not types of these decls match.
2785 For C++, we must compare the parameter list so that `int' can match
2786 `int&' in a parameter position, but `int&' is not confused with
2790 decls_match (newdecl
, olddecl
)
2791 tree newdecl
, olddecl
;
2795 if (newdecl
== olddecl
)
2798 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2799 /* If the two DECLs are not even the same kind of thing, we're not
2800 interested in their types. */
2803 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2805 tree f1
= TREE_TYPE (newdecl
);
2806 tree f2
= TREE_TYPE (olddecl
);
2807 tree p1
= TYPE_ARG_TYPES (f1
);
2808 tree p2
= TYPE_ARG_TYPES (f2
);
2810 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2811 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2812 && DECL_LANGUAGE (olddecl
) == lang_c
))
2815 /* When we parse a static member function definition,
2816 we put together a FUNCTION_DECL which thinks its type
2817 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2819 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2820 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2821 else if (TREE_CODE (f2
) == METHOD_TYPE
2822 && DECL_STATIC_FUNCTION_P (newdecl
))
2823 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2825 /* Here we must take care of the case where new default
2826 parameters are specified. Also, warn if an old
2827 declaration becomes ambiguous because default
2828 parameters may cause the two to be ambiguous. */
2829 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2831 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2832 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2834 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2838 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2840 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2843 types_match
= self_promoting_args_p (p1
);
2844 if (p1
== void_list_node
)
2845 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2847 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2848 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2850 types_match
= self_promoting_args_p (p2
);
2851 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2854 types_match
= compparms (p1
, p2
);
2859 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2861 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2862 DECL_TEMPLATE_PARMS (olddecl
)))
2865 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2868 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2869 DECL_TEMPLATE_RESULT (newdecl
));
2873 if (TREE_TYPE (newdecl
) == error_mark_node
)
2874 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2875 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2876 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2877 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2880 types_match
= comptypes (TREE_TYPE (newdecl
),
2881 TREE_TYPE (olddecl
),
2882 COMPARE_REDECLARATION
);
2888 /* If NEWDECL is `static' and an `extern' was seen previously,
2889 warn about it. OLDDECL is the previous declaration.
2891 Note that this does not apply to the C++ case of declaring
2892 a variable `extern const' and then later `const'.
2894 Don't complain about built-in functions, since they are beyond
2895 the user's control. */
2898 warn_extern_redeclared_static (newdecl
, olddecl
)
2899 tree newdecl
, olddecl
;
2901 static const char *explicit_extern_static_warning
2902 = "`%D' was declared `extern' and later `static'";
2903 static const char *implicit_extern_static_warning
2904 = "`%D' was declared implicitly `extern' and later `static'";
2908 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2911 /* Don't get confused by static member functions; that's a different
2913 if (TREE_CODE (newdecl
) == FUNCTION_DECL
2914 && DECL_STATIC_FUNCTION_P (newdecl
))
2917 /* If the old declaration was `static', or the new one isn't, then
2918 then everything is OK. */
2919 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
2922 /* It's OK to declare a builtin function as `static'. */
2923 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2924 && DECL_ARTIFICIAL (olddecl
))
2927 name
= DECL_ASSEMBLER_NAME (newdecl
);
2928 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2929 ? implicit_extern_static_warning
2930 : explicit_extern_static_warning
, newdecl
);
2931 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2934 /* Handle when a new declaration NEWDECL has the same name as an old
2935 one OLDDECL in the same binding contour. Prints an error message
2938 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2939 Otherwise, return 0. */
2942 duplicate_decls (newdecl
, olddecl
)
2943 tree newdecl
, olddecl
;
2945 unsigned olddecl_uid
= DECL_UID (olddecl
);
2946 int olddecl_friend
= 0, types_match
= 0;
2947 int new_defines_function
= 0;
2949 if (newdecl
== olddecl
)
2952 types_match
= decls_match (newdecl
, olddecl
);
2954 /* If either the type of the new decl or the type of the old decl is an
2955 error_mark_node, then that implies that we have already issued an
2956 error (earlier) for some bogus type specification, and in that case,
2957 it is rather pointless to harass the user with yet more error message
2958 about the same declaration, so just pretend the types match here. */
2959 if (TREE_TYPE (newdecl
) == error_mark_node
2960 || TREE_TYPE (olddecl
) == error_mark_node
)
2963 /* Check for redeclaration and other discrepancies. */
2964 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2965 && DECL_ARTIFICIAL (olddecl
))
2967 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2969 /* If you declare a built-in or predefined function name as static,
2970 the old definition is overridden, but optionally warn this was a
2971 bad choice of name. */
2972 if (! TREE_PUBLIC (newdecl
))
2975 cp_warning ("shadowing %s function `%#D'",
2976 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2978 /* Discard the old built-in function. */
2981 /* If the built-in is not ansi, then programs can override
2982 it even globally without an error. */
2983 else if (! DECL_BUILT_IN (olddecl
))
2984 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2988 cp_error ("declaration of `%#D'", newdecl
);
2989 cp_error ("conflicts with built-in declaration `%#D'",
2994 else if (!types_match
)
2996 if ((DECL_LANGUAGE (newdecl
) == lang_c
2997 && DECL_LANGUAGE (olddecl
) == lang_c
)
2998 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
2999 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3001 /* A near match; override the builtin. */
3003 if (TREE_PUBLIC (newdecl
))
3005 cp_warning ("new declaration `%#D'", newdecl
);
3006 cp_warning ("ambiguates built-in declaration `%#D'",
3009 else if (warn_shadow
)
3010 cp_warning ("shadowing %s function `%#D'",
3011 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3015 /* Discard the old built-in function. */
3019 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3021 /* If a builtin function is redeclared as `static', merge
3022 the declarations, but make the original one static. */
3023 DECL_THIS_STATIC (olddecl
) = 1;
3024 TREE_PUBLIC (olddecl
) = 0;
3026 /* Make the olddeclaration consistent with the new one so that
3027 all remnants of the builtin-ness of this function will be
3029 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3030 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3031 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3032 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3036 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3038 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3039 && TREE_CODE (newdecl
) != TYPE_DECL
3040 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3041 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3042 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3043 && TREE_CODE (olddecl
) != TYPE_DECL
3044 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3045 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3048 /* We do nothing special here, because C++ does such nasty
3049 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3050 get shadowed, and know that if we need to find a TYPE_DECL
3051 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3052 slot of the identifier. */
3056 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3057 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3058 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3059 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3062 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3063 if (TREE_CODE (olddecl
) == TREE_LIST
)
3064 olddecl
= TREE_VALUE (olddecl
);
3065 cp_error_at ("previous declaration of `%#D'", olddecl
);
3067 /* New decl is completely inconsistent with the old one =>
3068 tell caller to replace the old one. */
3072 else if (!types_match
)
3074 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3075 /* These are certainly not duplicate declarations; they're
3076 from different scopes. */
3079 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3081 /* The name of a class template may not be declared to refer to
3082 any other template, class, function, object, namespace, value,
3083 or type in the same scope. */
3084 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3085 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3087 cp_error ("declaration of template `%#D'", newdecl
);
3088 cp_error_at ("conflicts with previous declaration `%#D'",
3091 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3092 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3093 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3094 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3095 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3096 DECL_TEMPLATE_PARMS (olddecl
)))
3098 cp_error ("new declaration `%#D'", newdecl
);
3099 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3103 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3105 if (DECL_LANGUAGE (newdecl
) == lang_c
3106 && DECL_LANGUAGE (olddecl
) == lang_c
)
3108 cp_error ("declaration of C function `%#D' conflicts with",
3110 cp_error_at ("previous declaration `%#D' here", olddecl
);
3112 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3113 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3115 cp_error ("new declaration `%#D'", newdecl
);
3116 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3122 /* Already complained about this, so don't do so again. */
3123 else if (current_class_type
== NULL_TREE
3124 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3126 cp_error ("conflicting types for `%#D'", newdecl
);
3127 cp_error_at ("previous declaration as `%#D'", olddecl
);
3130 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3131 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3132 && (!DECL_TEMPLATE_INFO (newdecl
)
3133 || (DECL_TI_TEMPLATE (newdecl
)
3134 != DECL_TI_TEMPLATE (olddecl
))))
3135 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3136 && (!DECL_TEMPLATE_INFO (olddecl
)
3137 || (DECL_TI_TEMPLATE (olddecl
)
3138 != DECL_TI_TEMPLATE (newdecl
))))))
3139 /* It's OK to have a template specialization and a non-template
3140 with the same type, or to have specializations of two
3141 different templates with the same type. Note that if one is a
3142 specialization, and the other is an instantiation of the same
3143 template, that we do not exit at this point. That situation
3144 can occur if we instantiate a template class, and then
3145 specialize one of its methods. This situation is legal, but
3146 the declarations must be merged in the usual way. */
3148 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3149 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3150 && !DECL_USE_TEMPLATE (newdecl
))
3151 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3152 && !DECL_USE_TEMPLATE (olddecl
))))
3153 /* One of the declarations is a template instantiation, and the
3154 other is not a template at all. That's OK. */
3156 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3157 && DECL_NAMESPACE_ALIAS (newdecl
)
3158 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3159 /* Redeclaration of namespace alias, ignore it. */
3163 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3166 cp_error (errmsg
, newdecl
);
3167 if (DECL_NAME (olddecl
) != NULL_TREE
)
3168 cp_error_at ((DECL_INITIAL (olddecl
)
3169 && namespace_bindings_p ())
3170 ? "`%#D' previously defined here"
3171 : "`%#D' previously declared here", olddecl
);
3173 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3174 && DECL_INITIAL (olddecl
) != NULL_TREE
3175 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3176 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3178 /* Prototype decl follows defn w/o prototype. */
3179 cp_warning_at ("prototype for `%#D'", newdecl
);
3180 cp_warning_at ("follows non-prototype definition here", olddecl
);
3182 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3183 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3185 /* extern "C" int foo ();
3186 int foo () { bar (); }
3188 if (current_lang_stack
3189 == &VARRAY_TREE (current_lang_base
, 0))
3190 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3193 cp_error_at ("previous declaration of `%#D' with %L linkage",
3194 olddecl
, DECL_LANGUAGE (olddecl
));
3195 cp_error ("conflicts with new declaration with %L linkage",
3196 DECL_LANGUAGE (newdecl
));
3200 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3202 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3204 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3205 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3208 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3209 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3211 for (; t1
&& t1
!= void_list_node
;
3212 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3213 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3215 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3220 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3222 cp_pedwarn_at ("after previous specification in `%#D'",
3228 cp_error ("default argument given for parameter %d of `%#D'",
3230 cp_error_at ("after previous specification in `%#D'",
3235 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3236 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3238 cp_warning ("`%#D' was used before it was declared inline",
3240 cp_warning_at ("previous non-inline declaration here",
3246 /* If new decl is `static' and an `extern' was seen previously,
3248 warn_extern_redeclared_static (newdecl
, olddecl
);
3250 /* We have committed to returning 1 at this point. */
3251 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3253 /* Now that functions must hold information normally held
3254 by field decls, there is extra work to do so that
3255 declaration information does not get destroyed during
3257 if (DECL_VINDEX (olddecl
))
3258 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3259 if (DECL_CONTEXT (olddecl
))
3260 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3261 if (DECL_CLASS_CONTEXT (olddecl
))
3262 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3263 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3264 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3265 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3266 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3267 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3268 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3269 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3270 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3271 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3273 /* Optionally warn about more than one declaration for the same
3274 name, but don't warn about a function declaration followed by a
3276 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3277 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3278 /* Don't warn about extern decl followed by definition. */
3279 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3280 /* Don't warn about friends, let add_friend take care of it. */
3281 && ! DECL_FRIEND_P (newdecl
))
3283 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3284 cp_warning_at ("previous declaration of `%D'", olddecl
);
3288 /* Deal with C++: must preserve virtual function table size. */
3289 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3291 register tree newtype
= TREE_TYPE (newdecl
);
3292 register tree oldtype
= TREE_TYPE (olddecl
);
3294 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3295 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3297 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3298 CLASSTYPE_FRIEND_CLASSES (newtype
)
3299 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3303 /* Copy all the DECL_... slots specified in the new decl
3304 except for any that we copy here from the old type. */
3305 DECL_MACHINE_ATTRIBUTES (newdecl
)
3306 = merge_machine_decl_attributes (olddecl
, newdecl
);
3308 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3310 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3311 DECL_TEMPLATE_RESULT (olddecl
)))
3312 cp_error ("invalid redeclaration of %D", newdecl
);
3313 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3314 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3315 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3316 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3323 /* Automatically handles default parameters. */
3324 tree oldtype
= TREE_TYPE (olddecl
);
3327 /* Make sure we put the new type in the same obstack as the old one. */
3329 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3331 push_permanent_obstack ();
3333 /* Merge the data types specified in the two decls. */
3334 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3336 if (TREE_CODE (newdecl
) == VAR_DECL
)
3337 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3338 /* Do this after calling `common_type' so that default
3339 parameters don't confuse us. */
3340 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3341 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3342 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3344 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3345 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3346 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3347 TYPE_RAISES_EXCEPTIONS (oldtype
));
3349 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3350 && DECL_SOURCE_LINE (olddecl
) != 0
3352 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3353 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3355 cp_error ("declaration of `%F' throws different exceptions",
3357 cp_error_at ("to previous declaration `%F'", olddecl
);
3360 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3362 /* Lay the type out, unless already done. */
3363 if (! same_type_p (newtype
, oldtype
)
3364 && TREE_TYPE (newdecl
) != error_mark_node
3365 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3366 layout_type (TREE_TYPE (newdecl
));
3368 if ((TREE_CODE (newdecl
) == VAR_DECL
3369 || TREE_CODE (newdecl
) == PARM_DECL
3370 || TREE_CODE (newdecl
) == RESULT_DECL
3371 || TREE_CODE (newdecl
) == FIELD_DECL
3372 || TREE_CODE (newdecl
) == TYPE_DECL
)
3373 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3374 layout_decl (newdecl
, 0);
3376 /* Merge the type qualifiers. */
3377 if (TREE_READONLY (newdecl
))
3378 TREE_READONLY (olddecl
) = 1;
3379 if (TREE_THIS_VOLATILE (newdecl
))
3380 TREE_THIS_VOLATILE (olddecl
) = 1;
3382 /* Merge the initialization information. */
3383 if (DECL_INITIAL (newdecl
) == NULL_TREE
3384 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3386 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3387 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3388 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3389 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3390 && DECL_LANG_SPECIFIC (newdecl
)
3391 && DECL_LANG_SPECIFIC (olddecl
))
3392 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3395 /* Merge the section attribute.
3396 We want to issue an error if the sections conflict but that must be
3397 done later in decl_attributes since we are called before attributes
3399 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3400 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3402 /* Keep the old rtl since we can safely use it. */
3403 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3407 /* If cannot merge, then use the new type and qualifiers,
3408 and don't preserve the old rtl. */
3411 /* Clean out any memory we had of the old declaration. */
3412 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3414 TREE_VALUE (oldstatic
) = error_mark_node
;
3416 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3417 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3418 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3419 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3422 /* Merge the storage class information. */
3423 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3424 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3425 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3426 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3427 if (! DECL_EXTERNAL (olddecl
))
3428 DECL_EXTERNAL (newdecl
) = 0;
3430 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3432 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3433 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3434 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3435 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3436 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3437 /* Don't really know how much of the language-specific
3438 values we should copy from old to new. */
3439 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3440 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3441 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3442 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3443 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3445 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3446 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3447 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3448 DECL_BEFRIENDING_CLASSES (newdecl
)
3449 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3450 DECL_BEFRIENDING_CLASSES (olddecl
));
3453 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3455 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3456 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3458 /* If newdecl is not a specialization, then it is not a
3459 template-related function at all. And that means that we
3460 shoud have exited above, returning 0. */
3461 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3464 if (TREE_USED (olddecl
))
3465 /* From [temp.expl.spec]:
3467 If a template, a member template or the member of a class
3468 template is explicitly specialized then that
3469 specialization shall be declared before the first use of
3470 that specialization that would cause an implicit
3471 instantiation to take place, in every translation unit in
3472 which such a use occurs. */
3473 cp_error ("explicit specialization of %D after first use",
3476 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3478 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3480 /* If either decl says `inline', this fn is inline, unless its
3481 definition was passed already. */
3482 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3483 DECL_INLINE (olddecl
) = 1;
3484 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3488 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3489 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3490 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3492 if (! types_match
|| new_defines_function
)
3494 /* These need to be copied so that the names are available.
3495 Note that if the types do match, we'll preserve inline
3496 info and other bits, but if not, we won't. */
3497 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3498 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3500 if (new_defines_function
)
3501 /* If defining a function declared with other language
3502 linkage, use the previously declared language linkage. */
3503 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3504 else if (types_match
)
3506 /* If redeclaring a builtin function, and not a definition,
3507 it stays built in. */
3508 if (DECL_BUILT_IN (olddecl
))
3510 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3511 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3512 /* If we're keeping the built-in definition, keep the rtl,
3513 regardless of declaration matches. */
3514 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3517 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3519 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3520 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3521 /* Previously saved insns go together with
3522 the function's previous definition. */
3523 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3524 /* Don't clear out the arguments if we're redefining a function. */
3525 if (DECL_ARGUMENTS (olddecl
))
3526 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3528 if (DECL_LANG_SPECIFIC (olddecl
))
3529 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3532 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3534 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3537 /* Now preserve various other info from the definition. */
3538 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3539 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3540 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3541 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3543 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3547 function_size
= sizeof (struct tree_decl
);
3549 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3550 (char *) olddecl
+ sizeof (struct tree_common
),
3551 function_size
- sizeof (struct tree_common
));
3553 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3555 /* If newdecl is a template instantiation, it is possible that
3556 the following sequence of events has occurred:
3558 o A friend function was declared in a class template. The
3559 class template was instantiated.
3561 o The instantiation of the friend declaration was
3562 recorded on the instantiation list, and is newdecl.
3564 o Later, however, instantiate_class_template called pushdecl
3565 on the newdecl to perform name injection. But, pushdecl in
3566 turn called duplicate_decls when it discovered that another
3567 declaration of a global function with the same name already
3570 o Here, in duplicate_decls, we decided to clobber newdecl.
3572 If we're going to do that, we'd better make sure that
3573 olddecl, and not newdecl, is on the list of
3574 instantiations so that if we try to do the instantiation
3575 again we won't get the clobbered declaration. */
3577 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3578 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3580 for (; decls
; decls
= TREE_CHAIN (decls
))
3581 if (TREE_VALUE (decls
) == newdecl
)
3582 TREE_VALUE (decls
) = olddecl
;
3587 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3588 (char *) olddecl
+ sizeof (struct tree_common
),
3589 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3590 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3593 DECL_UID (olddecl
) = olddecl_uid
;
3595 DECL_FRIEND_P (olddecl
) = 1;
3597 /* NEWDECL contains the merged attribute lists.
3598 Update OLDDECL to be the same. */
3599 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3604 /* Record a decl-node X as belonging to the current lexical scope.
3605 Check for errors (such as an incompatible declaration for the same
3606 name already seen in the same scope).
3608 Returns either X or an old decl for the same name.
3609 If an old decl is returned, it may have been smashed
3610 to agree with what X says. */
3618 int need_new_binding
;
3620 /* We shouldn't be calling pushdecl when we're generating RTL for a
3621 function that we already did semantic analysis on previously. */
3622 my_friendly_assert (!current_function
|| doing_semantic_analysis_p (),
3625 name
= DECL_ASSEMBLER_NAME (x
);
3626 need_new_binding
= 1;
3628 if (DECL_TEMPLATE_PARM_P (x
))
3629 /* Template parameters have no context; they are not X::T even
3630 when declared within a class or namespace. */
3634 if (current_function_decl
&& x
!= current_function_decl
3635 /* A local declaration for a function doesn't constitute
3637 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3638 /* A local declaration for an `extern' variable is in the
3639 scoped of the current namespace, not the current
3641 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3642 /* Don't change DECL_CONTEXT of virtual methods. */
3643 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3644 && !DECL_CONTEXT (x
))
3645 DECL_CONTEXT (x
) = current_function_decl
;
3646 if (!DECL_CONTEXT (x
))
3647 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3650 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3651 compiler wants to use. */
3652 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3653 || TREE_CODE (x
) == NAMESPACE_DECL
)
3654 name
= DECL_NAME (x
);
3659 /* Not needed...see below. */
3663 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3664 name
= TREE_OPERAND (name
, 0);
3666 /* Namespace-scoped variables are not found in the current level. */
3667 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3668 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3670 t
= lookup_name_current_level (name
);
3671 if (t
== error_mark_node
)
3673 /* error_mark_node is 0 for a while during initialization! */
3675 cp_error_at ("`%#D' used prior to declaration", x
);
3678 else if (t
!= NULL_TREE
)
3681 /* This is turned off until I have time to do it right (bpk). */
3682 /* With the code below that uses it... */
3683 file
= DECL_SOURCE_FILE (t
);
3684 line
= DECL_SOURCE_LINE (t
);
3686 if (TREE_CODE (t
) == PARM_DECL
)
3688 if (DECL_CONTEXT (t
) == NULL_TREE
)
3689 fatal ("parse errors have confused me too much");
3691 /* Check for duplicate params. */
3692 if (duplicate_decls (x
, t
))
3695 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3696 || DECL_FUNCTION_TEMPLATE_P (x
))
3697 && is_overloaded_fn (t
))
3698 /* Don't do anything just yet. */;
3699 else if (t
== wchar_decl_node
)
3701 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3702 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3704 /* Throw away the redeclaration. */
3707 else if (TREE_CODE (t
) != TREE_CODE (x
))
3709 if (duplicate_decls (x
, t
))
3712 else if (duplicate_decls (x
, t
))
3715 /* This is turned off until I have time to do it right (bpk). */
3717 /* Also warn if they did a prototype with `static' on it, but
3718 then later left the `static' off. */
3719 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3721 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3726 cp_warning ("`static' missing from declaration of `%D'",
3728 warning_with_file_and_line (file
, line
,
3729 "previous declaration of `%s'",
3730 decl_as_string (t
, 0));
3733 /* Now fix things so it'll do what they expect. */
3734 if (current_function_decl
)
3735 TREE_PUBLIC (current_function_decl
) = 0;
3737 /* Due to interference in memory reclamation (X may be
3738 obstack-deallocated at this point), we must guard against
3739 one really special case. [jason: This should be handled
3740 by start_function] */
3741 if (current_function_decl
== x
)
3742 current_function_decl
= t
;
3744 if (TREE_CODE (t
) == TYPE_DECL
)
3745 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3746 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3747 check_default_args (t
);
3751 else if (DECL_MAIN_P (x
))
3753 /* A redeclaration of main, but not a duplicate of the
3758 This function shall not be overloaded. */
3759 cp_error_at ("invalid redeclaration of `%D'", t
);
3760 cp_error ("as `%D'", x
);
3761 /* We don't try to push this declaration since that
3767 check_template_shadow (x
);
3769 /* If this is a function conjured up by the backend, massage it
3770 so it looks friendly. */
3771 if (TREE_CODE (x
) == FUNCTION_DECL
3772 && ! DECL_LANG_SPECIFIC (x
))
3774 retrofit_lang_decl (x
);
3775 DECL_LANGUAGE (x
) = lang_c
;
3778 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3780 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3783 if (!namespace_bindings_p ())
3784 /* We do not need to create a binding for this name;
3785 push_overloaded_decl will have already done so if
3787 need_new_binding
= 0;
3789 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3791 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3793 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3797 /* If declaring a type as a typedef, copy the type (unless we're
3798 at line 0), and install this TYPE_DECL as the new type's typedef
3799 name. See the extensive comment in ../c-decl.c (pushdecl). */
3800 if (TREE_CODE (x
) == TYPE_DECL
)
3802 tree type
= TREE_TYPE (x
);
3803 if (DECL_SOURCE_LINE (x
) == 0)
3805 if (TYPE_NAME (type
) == 0)
3806 TYPE_NAME (type
) = x
;
3808 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3809 /* We don't want to copy the type when all we're
3810 doing is making a TYPE_DECL for the purposes of
3812 && (!TYPE_NAME (type
)
3813 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3815 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3817 DECL_ORIGINAL_TYPE (x
) = type
;
3818 type
= build_type_copy (type
);
3819 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3820 TYPE_NAME (type
) = x
;
3821 TREE_TYPE (x
) = type
;
3826 if (type
!= error_mark_node
3828 && TYPE_IDENTIFIER (type
))
3829 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3830 current_binding_level
);
3834 /* Multiple external decls of the same identifier ought to match.
3836 We get warnings about inline functions where they are defined.
3837 We get warnings about other functions from push_overloaded_decl.
3839 Avoid duplicate warnings where they are used. */
3840 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3844 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3845 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3846 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3847 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3852 /* If different sort of thing, we already gave an error. */
3853 && TREE_CODE (decl
) == TREE_CODE (x
)
3854 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3856 cp_pedwarn ("type mismatch with previous external decl", x
);
3857 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3861 /* This name is new in its binding level.
3862 Install the new declaration and return it. */
3863 if (namespace_bindings_p ())
3865 /* Install a global value. */
3867 /* If the first global decl has external linkage,
3868 warn if we later see static one. */
3869 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3870 TREE_PUBLIC (name
) = 1;
3872 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3874 /* For an ordinary function, we create a binding from
3875 the mangled name (i.e., NAME) to the DECL. But, for
3876 an `extern "C"' function, the mangled name and the
3877 ordinary name are the same so we need not do this. */
3878 && !(TREE_CODE (x
) == FUNCTION_DECL
&&
3879 DECL_LANGUAGE (x
) == lang_c
))
3881 if (TREE_CODE (x
) == FUNCTION_DECL
)
3883 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3884 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3885 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3888 /* Don't forget if the function was used via an implicit decl. */
3889 if (IDENTIFIER_IMPLICIT_DECL (name
)
3890 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3893 /* Don't forget if its address was taken in that way. */
3894 if (IDENTIFIER_IMPLICIT_DECL (name
)
3895 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3896 TREE_ADDRESSABLE (x
) = 1;
3898 /* Warn about mismatches against previous implicit decl. */
3899 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3900 /* If this real decl matches the implicit, don't complain. */
3901 && ! (TREE_CODE (x
) == FUNCTION_DECL
3902 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3904 ("`%D' was previously implicitly declared to return `int'", x
);
3906 /* If new decl is `static' and an `extern' was seen previously,
3908 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3909 warn_extern_redeclared_static (x
, t
);
3913 /* Here to install a non-global value. */
3914 tree oldlocal
= IDENTIFIER_VALUE (name
);
3915 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3917 if (need_new_binding
)
3919 push_local_binding (name
, x
, 0);
3920 /* Because push_local_binding will hook X on to the
3921 current_binding_level's name list, we don't want to
3922 do that again below. */
3923 need_new_binding
= 0;
3926 /* If this is a TYPE_DECL, push it into the type value slot. */
3927 if (TREE_CODE (x
) == TYPE_DECL
)
3928 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3929 current_binding_level
);
3931 /* Clear out any TYPE_DECL shadowed by a namespace so that
3932 we won't think this is a type. The C struct hack doesn't
3933 go through namespaces. */
3934 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3935 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3936 current_binding_level
);
3938 /* If this is an extern function declaration, see if we
3939 have a global definition or declaration for the function. */
3940 if (oldlocal
== NULL_TREE
3941 && DECL_EXTERNAL (x
)
3942 && oldglobal
!= NULL_TREE
3943 && TREE_CODE (x
) == FUNCTION_DECL
3944 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3946 /* We have one. Their types must agree. */
3947 if (decls_match (x
, oldglobal
))
3951 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3952 cp_warning_at ("global declaration `%#D'", oldglobal
);
3955 /* If we have a local external declaration,
3956 and no file-scope declaration has yet been seen,
3957 then if we later have a file-scope decl it must not be static. */
3958 if (oldlocal
== NULL_TREE
3959 && oldglobal
== NULL_TREE
3960 && DECL_EXTERNAL (x
)
3962 TREE_PUBLIC (name
) = 1;
3964 if (DECL_FROM_INLINE (x
))
3965 /* Inline decls shadow nothing. */;
3967 /* Warn if shadowing an argument at the top level of the body. */
3968 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3969 && TREE_CODE (oldlocal
) == PARM_DECL
3970 /* Don't complain if it's from an enclosing function. */
3971 && DECL_CONTEXT (oldlocal
) == current_function_decl
3972 && TREE_CODE (x
) != PARM_DECL
)
3974 /* Go to where the parms should be and see if we
3976 struct binding_level
*b
= current_binding_level
->level_chain
;
3982 if (b
->parm_flag
== 1)
3983 cp_error ("declaration of `%#D' shadows a parameter", name
);
3985 else if (warn_shadow
&& oldlocal
!= NULL_TREE
3986 && current_binding_level
->is_for_scope
3987 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3989 warning ("variable `%s' shadows local",
3990 IDENTIFIER_POINTER (name
));
3991 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3993 /* Maybe warn if shadowing something else. */
3994 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
3995 /* No shadow warnings for internally generated vars. */
3996 && ! DECL_ARTIFICIAL (x
)
3997 /* No shadow warnings for vars made for inlining. */
3998 && ! DECL_FROM_INLINE (x
))
4000 const char *warnstring
= NULL
;
4002 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4003 warnstring
= "declaration of `%s' shadows a parameter";
4004 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4005 && current_class_ptr
4006 && !TREE_STATIC (name
))
4007 warnstring
= "declaration of `%s' shadows a member of `this'";
4008 else if (oldlocal
!= NULL_TREE
)
4009 warnstring
= "declaration of `%s' shadows previous local";
4010 else if (oldglobal
!= NULL_TREE
)
4011 /* XXX shadow warnings in outer-more namespaces */
4012 warnstring
= "declaration of `%s' shadows global declaration";
4015 warning (warnstring
, IDENTIFIER_POINTER (name
));
4019 if (TREE_CODE (x
) == FUNCTION_DECL
)
4020 check_default_args (x
);
4022 /* Keep count of variables in this level with incomplete type. */
4023 if (TREE_CODE (x
) == VAR_DECL
4024 && TREE_TYPE (x
) != error_mark_node
4025 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4026 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4027 /* RTTI TD entries are created while defining the type_info. */
4028 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4029 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4030 current_binding_level
->incomplete
4031 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4034 if (need_new_binding
)
4035 add_decl_to_level (x
,
4036 DECL_NAMESPACE_SCOPE_P (x
)
4037 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4038 : current_binding_level
);
4043 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4044 caller to set DECL_CONTEXT properly. */
4047 pushdecl_with_scope (x
, level
)
4049 struct binding_level
*level
;
4051 register struct binding_level
*b
;
4052 tree function_decl
= current_function_decl
;
4054 current_function_decl
= NULL_TREE
;
4055 if (level
->parm_flag
== 2)
4057 b
= class_binding_level
;
4058 class_binding_level
= level
;
4059 pushdecl_class_level (x
);
4060 class_binding_level
= b
;
4064 b
= current_binding_level
;
4065 current_binding_level
= level
;
4067 current_binding_level
= b
;
4069 current_function_decl
= function_decl
;
4073 /* Like pushdecl, only it places X in the current namespace,
4077 pushdecl_namespace_level (x
)
4080 register struct binding_level
*b
= current_binding_level
;
4083 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4085 /* Now, the type_shadowed stack may screw us. Munge it so it does
4087 if (TREE_CODE (x
) == TYPE_DECL
)
4089 tree name
= DECL_NAME (x
);
4091 tree
*ptr
= (tree
*)0;
4092 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4094 tree shadowed
= b
->type_shadowed
;
4095 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4096 if (TREE_PURPOSE (shadowed
) == name
)
4098 ptr
= &TREE_VALUE (shadowed
);
4099 /* Can't break out of the loop here because sometimes
4100 a binding level will have duplicate bindings for
4101 PT names. It's gross, but I haven't time to fix it. */
4104 newval
= TREE_TYPE (x
);
4105 if (ptr
== (tree
*)0)
4107 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4108 up here if this is changed to an assertion. --KR */
4109 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4119 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4123 pushdecl_top_level (x
)
4126 push_to_top_level ();
4127 x
= pushdecl_namespace_level (x
);
4128 pop_from_top_level ();
4132 /* Make the declaration of X appear in CLASS scope. */
4135 pushdecl_class_level (x
)
4138 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4139 scope looks for the pre-mangled name. */
4142 if (TREE_CODE (x
) == OVERLOAD
)
4143 x
= OVL_CURRENT (x
);
4144 name
= DECL_NAME (x
);
4148 push_class_level_binding (name
, x
);
4149 if (TREE_CODE (x
) == TYPE_DECL
)
4150 set_identifier_type_value (name
, TREE_TYPE (x
));
4152 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4156 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4159 pushdecl_class_level (f
);
4163 /* Enter DECL into the symbol table, if that's appropriate. Returns
4164 DECL, or a modified version thereof. */
4167 maybe_push_decl (decl
)
4170 tree type
= TREE_TYPE (decl
);
4172 /* Add this decl to the current binding level, but not if it comes
4173 from another scope, e.g. a static member variable. TEM may equal
4174 DECL or it may be a previous decl of the same name. */
4175 if ((TREE_CODE (decl
) != PARM_DECL
4176 && DECL_CONTEXT (decl
) != NULL_TREE
4177 /* Definitions of namespace members outside their namespace are
4179 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4180 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4181 || TREE_CODE (type
) == UNKNOWN_TYPE
4182 /* The declaration of a template specialization does not affect
4183 the functions available for overload resolution, so we do not
4185 || (TREE_CODE (decl
) == FUNCTION_DECL
4186 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4189 return pushdecl (decl
);
4193 /* This function is used to push the mangled decls for nested types into
4194 the appropriate scope. Previously pushdecl_top_level was used, but that
4195 is incorrect for members of local classes. */
4198 pushdecl_nonclass_level (x
)
4201 struct binding_level
*b
= current_binding_level
;
4203 my_friendly_assert (b
->parm_flag
!= 2, 180);
4206 /* Get out of template binding levels */
4207 while (b
->pseudo_global
)
4211 pushdecl_with_scope (x
, b
);
4215 /* Make the declaration(s) of X appear in CLASS scope
4216 under the name NAME. */
4219 push_class_level_binding (name
, x
)
4224 /* The class_binding_level will be NULL if x is a template
4225 parameter name in a member template. */
4226 if (!class_binding_level
)
4229 /* Make sure that this new member does not have the same name
4230 as a template parameter. */
4231 if (TYPE_BEING_DEFINED (current_class_type
))
4232 check_template_shadow (x
);
4234 /* If this declaration shadows a declaration from an enclosing
4235 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4236 we leave this class. Record the shadowed declaration here. */
4237 binding
= IDENTIFIER_BINDING (name
);
4239 && ((TREE_CODE (x
) == OVERLOAD
4240 && BINDING_VALUE (binding
)
4241 && is_overloaded_fn (BINDING_VALUE (binding
)))
4242 || INHERITED_VALUE_BINDING_P (binding
)))
4247 /* If the old binding was from a base class, and was for a tag
4248 name, slide it over to make room for the new binding. The
4249 old binding is still visible if explicitly qualified with a
4251 if (INHERITED_VALUE_BINDING_P (binding
)
4252 && BINDING_VALUE (binding
)
4253 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4254 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4255 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4257 old_decl
= BINDING_TYPE (binding
);
4258 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4259 BINDING_VALUE (binding
) = NULL_TREE
;
4260 INHERITED_VALUE_BINDING_P (binding
) = 0;
4263 old_decl
= BINDING_VALUE (binding
);
4265 /* There was already a binding for X containing fewer
4266 functions than are named in X. Find the previous
4267 declaration of X on the class-shadowed list, and update it. */
4268 for (shadow
= class_binding_level
->class_shadowed
;
4270 shadow
= TREE_CHAIN (shadow
))
4271 if (TREE_PURPOSE (shadow
) == name
4272 && TREE_TYPE (shadow
) == old_decl
)
4274 BINDING_VALUE (binding
) = x
;
4275 INHERITED_VALUE_BINDING_P (binding
) = 0;
4276 TREE_TYPE (shadow
) = x
;
4281 /* If we didn't replace an existing binding, put the binding on the
4282 stack of bindings for the identifier, and update
4283 IDENTIFIER_CLASS_VALUE. */
4284 if (push_class_binding (name
, x
))
4286 class_binding_level
->class_shadowed
4287 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4288 class_binding_level
->class_shadowed
);
4289 /* Record the value we are binding NAME to so that we can know
4290 what to pop later. */
4291 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4295 /* Insert another USING_DECL into the current binding level,
4296 returning this declaration. If this is a redeclaration,
4297 do nothing and return NULL_TREE. */
4300 push_using_decl (scope
, name
)
4306 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4307 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4308 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4309 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4313 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4314 DECL_INITIAL (decl
) = scope
;
4315 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4316 current_binding_level
->usings
= decl
;
4320 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4321 changed (i.e. there was already a directive), or the fresh
4322 TREE_LIST otherwise. */
4325 push_using_directive (used
)
4328 tree ud
= current_binding_level
->using_directives
;
4329 tree iter
, ancestor
;
4331 /* Check if we already have this. */
4332 if (purpose_member (used
, ud
) != NULL_TREE
)
4335 /* Recursively add all namespaces used. */
4336 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4337 push_using_directive (TREE_PURPOSE (iter
));
4339 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4340 ud
= current_binding_level
->using_directives
;
4341 ud
= tree_cons (used
, ancestor
, ud
);
4342 current_binding_level
->using_directives
= ud
;
4346 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4347 other definitions already in place. We get around this by making
4348 the value of the identifier point to a list of all the things that
4349 want to be referenced by that name. It is then up to the users of
4350 that name to decide what to do with that list.
4352 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4353 slot. It is dealt with the same way.
4355 FLAGS is a bitwise-or of the following values:
4356 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4358 PUSH_USING: DECL is being pushed as the result of a using
4361 The value returned may be a previous declaration if we guessed wrong
4362 about what language DECL should belong to (C or C++). Otherwise,
4363 it's always DECL (and never something that's not a _DECL). */
4366 push_overloaded_decl (decl
, flags
)
4370 tree name
= DECL_NAME (decl
);
4373 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4376 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4378 old
= lookup_name_current_level (name
);
4382 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4384 tree t
= TREE_TYPE (old
);
4385 if (IS_AGGR_TYPE (t
) && warn_shadow
4386 && (! DECL_IN_SYSTEM_HEADER (decl
)
4387 || ! DECL_IN_SYSTEM_HEADER (old
)))
4388 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4391 else if (is_overloaded_fn (old
))
4395 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4397 tree fn
= OVL_CURRENT (tmp
);
4399 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4400 && !(flags
& PUSH_USING
)
4401 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4402 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4403 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4406 if (duplicate_decls (decl
, fn
))
4412 cp_error_at ("previous non-function declaration `%#D'", old
);
4413 cp_error ("conflicts with function declaration `%#D'", decl
);
4418 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4420 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4421 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4423 new_binding
= ovl_cons (decl
, old
);
4424 if (flags
& PUSH_USING
)
4425 OVL_USED (new_binding
) = 1;
4428 /* NAME is not ambiguous. */
4432 set_namespace_binding (name
, current_namespace
, new_binding
);
4435 /* We only create an OVERLOAD if there was a previous binding at
4436 this level, or if decl is a template. In the former case, we
4437 need to remove the old binding and replace it with the new
4438 binding. We must also run through the NAMES on the binding
4439 level where the name was bound to update the chain. */
4441 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4445 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4447 d
= &TREE_CHAIN (*d
))
4449 || (TREE_CODE (*d
) == TREE_LIST
4450 && TREE_VALUE (*d
) == old
))
4452 if (TREE_CODE (*d
) == TREE_LIST
)
4453 /* Just replace the old binding with the new. */
4454 TREE_VALUE (*d
) = new_binding
;
4456 /* Build a TREE_LIST to wrap the OVERLOAD. */
4457 *d
= tree_cons (NULL_TREE
, new_binding
,
4460 /* And update the CPLUS_BINDING node. */
4461 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4466 /* We should always find a previous binding in this case. */
4467 my_friendly_abort (0);
4470 /* Install the new binding. */
4471 push_local_binding (name
, new_binding
, flags
);
4477 /* Generate an implicit declaration for identifier FUNCTIONID
4478 as a function of type int (). Print a warning if appropriate. */
4481 implicitly_declare (functionid
)
4485 int temp
= allocation_temporary_p ();
4487 push_obstacks_nochange ();
4489 /* Save the decl permanently so we can warn if definition follows.
4490 In ANSI C, warn_implicit is usually false, so the saves little space.
4491 But in C++, it's usually true, hence the extra code. */
4492 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4493 end_temporary_allocation ();
4495 /* We used to reuse an old implicit decl here,
4496 but this loses with inline functions because it can clobber
4497 the saved decl chains. */
4498 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4500 DECL_EXTERNAL (decl
) = 1;
4501 TREE_PUBLIC (decl
) = 1;
4503 /* ANSI standard says implicit declarations are in the innermost block.
4504 So we record the decl in the standard fashion. */
4506 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4509 /* Only one warning per identifier. */
4510 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4512 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4515 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4522 /* Return zero if the declaration NEWDECL is valid
4523 when the declaration OLDDECL (assumed to be for the same name)
4524 has already been seen.
4525 Otherwise return an error message format string with a %s
4526 where the identifier should go. */
4529 redeclaration_error_message (newdecl
, olddecl
)
4530 tree newdecl
, olddecl
;
4532 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4534 /* Because C++ can put things into name space for free,
4535 constructs like "typedef struct foo { ... } foo"
4536 would look like an erroneous redeclaration. */
4537 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4540 return "redefinition of `%#D'";
4542 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4544 /* If this is a pure function, its olddecl will actually be
4545 the original initialization to `0' (which we force to call
4546 abort()). Don't complain about redefinition in this case. */
4547 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4550 /* If both functions come from different namespaces, this is not
4551 a redeclaration - this is a conflict with a used function. */
4552 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4553 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4554 return "`%D' conflicts with used function";
4556 /* We'll complain about linkage mismatches in
4557 warn_extern_redeclared_static. */
4559 /* Defining the same name twice is no good. */
4560 if (DECL_INITIAL (olddecl
) != NULL_TREE
4561 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4563 if (DECL_NAME (olddecl
) == NULL_TREE
)
4564 return "`%#D' not declared in class";
4566 return "redefinition of `%#D'";
4570 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4572 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4573 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4574 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4575 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4576 && TYPE_SIZE (TREE_TYPE (newdecl
))
4577 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4578 return "redefinition of `%#D'";
4581 else if (toplevel_bindings_p ())
4583 /* Objects declared at top level: */
4584 /* If at least one is a reference, it's ok. */
4585 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4587 /* Reject two definitions. */
4588 return "redefinition of `%#D'";
4592 /* Objects declared with block scope: */
4593 /* Reject two definitions, and reject a definition
4594 together with an external reference. */
4595 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4596 return "redeclaration of `%#D'";
4601 /* Create a new label, named ID. */
4604 make_label_decl (id
, local_p
)
4610 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4612 /* Make sure every label has an rtx. */
4615 DECL_CONTEXT (decl
) = current_function_decl
;
4616 DECL_MODE (decl
) = VOIDmode
;
4617 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4619 /* Say where one reference is to the label, for the sake of the
4620 error if it is not defined. */
4621 DECL_SOURCE_LINE (decl
) = lineno
;
4622 DECL_SOURCE_FILE (decl
) = input_filename
;
4624 /* Record the fact that this identifier is bound to this label. */
4625 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4627 /* Record this label on the list of used labels so that we can check
4628 at the end of the function to see whether or not the label was
4629 actually defined. */
4630 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4631 && (named_label_uses
== NULL
4632 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4633 || named_label_uses
->label_decl
!= decl
))
4635 struct named_label_list
*new_ent
;
4637 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4638 new_ent
->label_decl
= decl
;
4639 new_ent
->names_in_scope
= current_binding_level
->names
;
4640 new_ent
->binding_level
= current_binding_level
;
4641 new_ent
->lineno_o_goto
= lineno
;
4642 new_ent
->filename_o_goto
= input_filename
;
4643 new_ent
->next
= named_label_uses
;
4644 named_label_uses
= new_ent
;
4650 /* Look for a label named ID in the current function. If one cannot
4651 be found, create one. (We keep track of used, but undefined,
4652 labels, and complain about them at the end of a function.) */
4660 /* You can't use labels at global scope. */
4661 if (current_function_decl
== NULL_TREE
)
4663 error ("label `%s' referenced outside of any function",
4664 IDENTIFIER_POINTER (id
));
4668 /* See if we've already got this label. */
4669 decl
= IDENTIFIER_LABEL_VALUE (id
);
4670 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4673 /* Record this label on the list of labels used in this function.
4674 We do this before calling make_label_decl so that we get the
4675 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4676 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4678 /* We need a new label. */
4679 decl
= make_label_decl (id
, /*local_p=*/0);
4680 /* Now fill in the information we didn't have before. */
4681 TREE_VALUE (named_labels
) = decl
;
4686 /* Declare a local label named ID. */
4689 declare_local_label (id
)
4694 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4695 this scope we can restore the old value of
4696 IDENTIFIER_TYPE_VALUE. */
4697 current_binding_level
->shadowed_labels
4698 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4699 current_binding_level
->shadowed_labels
);
4700 /* Look for the label. */
4701 decl
= make_label_decl (id
, /*local_p=*/1);
4702 /* Now fill in the information we didn't have before. */
4703 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4708 /* Define a label, specifying the location in the source file.
4709 Return the LABEL_DECL node for the label, if the definition is valid.
4710 Otherwise return 0. */
4713 define_label (filename
, line
, name
)
4718 tree decl
= lookup_label (name
);
4720 /* After labels, make any new cleanups go into their
4721 own new (temporary) binding contour. */
4722 current_binding_level
->more_cleanups_ok
= 0;
4724 if (name
== get_identifier ("wchar_t"))
4725 cp_pedwarn ("label named wchar_t");
4727 if (DECL_INITIAL (decl
) != NULL_TREE
)
4729 cp_error ("duplicate label `%D'", decl
);
4734 struct named_label_list
*uses
, *prev
;
4738 /* Mark label as having been defined. */
4739 DECL_INITIAL (decl
) = error_mark_node
;
4740 /* Say where in the source. */
4741 DECL_SOURCE_FILE (decl
) = filename
;
4742 DECL_SOURCE_LINE (decl
) = line
;
4745 uses
= named_label_uses
;
4746 while (uses
!= NULL
)
4747 if (uses
->label_decl
== decl
)
4749 struct binding_level
*b
= current_binding_level
;
4752 tree new_decls
= b
->names
;
4753 tree old_decls
= (b
== uses
->binding_level
)
4754 ? uses
->names_in_scope
: NULL_TREE
;
4755 while (new_decls
!= old_decls
)
4757 if (TREE_CODE (new_decls
) == VAR_DECL
4758 /* Don't complain about crossing initialization
4759 of internal entities. They can't be accessed,
4760 and they should be cleaned up
4761 by the time we get to the label. */
4762 && ! DECL_ARTIFICIAL (new_decls
)
4763 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4764 && pod_type_p (TREE_TYPE (new_decls
))))
4766 /* This is really only important if we're crossing
4767 an initialization. The POD stuff is just
4768 pedantry; why should it matter if the class
4769 contains a field of pointer to member type? */
4770 int problem
= (DECL_INITIAL (new_decls
)
4771 || (TYPE_NEEDS_CONSTRUCTING
4772 (TREE_TYPE (new_decls
))));
4778 cp_error ("jump to label `%D'", decl
);
4779 error_with_file_and_line
4780 (uses
->filename_o_goto
,
4781 uses
->lineno_o_goto
, " from here");
4785 cp_pedwarn ("jump to label `%D'", decl
);
4786 pedwarn_with_file_and_line
4787 (uses
->filename_o_goto
,
4788 uses
->lineno_o_goto
, " from here");
4794 cp_error_at (" crosses initialization of `%#D'",
4797 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4800 new_decls
= TREE_CHAIN (new_decls
);
4802 if (b
== uses
->binding_level
)
4804 if (b
->eh_region
&& ! saw_eh
)
4808 cp_error ("jump to label `%D'", decl
);
4809 error_with_file_and_line
4810 (uses
->filename_o_goto
,
4811 uses
->lineno_o_goto
, " from here");
4814 error (" enters exception handling block");
4821 prev
->next
= uses
->next
;
4823 named_label_uses
= uses
->next
;
4832 current_function_return_value
= NULL_TREE
;
4839 struct binding_level
*level
;
4840 struct cp_switch
*next
;
4843 static struct cp_switch
*switch_stack
;
4849 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4850 p
->level
= current_binding_level
;
4851 p
->next
= switch_stack
;
4858 switch_stack
= switch_stack
->next
;
4861 /* Note that we've seen a definition of a case label, and complain if this
4862 is a bad place for one. */
4865 define_case_label ()
4867 tree cleanup
= last_cleanup_this_contour ();
4868 struct binding_level
*b
= current_binding_level
;
4872 /* Don't crash; we'll complain in do_case. */
4877 static int explained
= 0;
4878 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4879 warning ("where case label appears here");
4882 warning ("(enclose actions of previous case statements requiring");
4883 warning ("destructors in their own binding contours.)");
4888 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4890 tree new_decls
= b
->names
;
4891 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4893 if (TREE_CODE (new_decls
) == VAR_DECL
4894 /* Don't complain about crossing initialization
4895 of internal entities. They can't be accessed,
4896 and they should be cleaned up
4897 by the time we get to the label. */
4898 && ! DECL_ARTIFICIAL (new_decls
)
4899 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4900 && DECL_INITIAL (new_decls
) != error_mark_node
)
4901 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4904 error ("jump to case label");
4906 cp_error_at (" crosses initialization of `%#D'",
4912 /* After labels, make any new cleanups go into their
4913 own new (temporary) binding contour. */
4915 current_binding_level
->more_cleanups_ok
= 0;
4916 current_function_return_value
= NULL_TREE
;
4919 /* Return the list of declarations of the current level.
4920 Note that this list is in reverse order unless/until
4921 you nreverse it; and when you do nreverse it, you must
4922 store the result back using `storedecls' or you will lose. */
4927 return current_binding_level
->names
;
4930 /* Return the list of type-tags (for structs, etc) of the current level. */
4935 return current_binding_level
->tags
;
4938 /* Store the list of declarations of the current level.
4939 This is done for the parameter declarations of a function being defined,
4940 after they are modified in the light of any missing parameters. */
4946 current_binding_level
->names
= decls
;
4949 /* Similarly, store the list of tags of the current level. */
4955 current_binding_level
->tags
= tags
;
4958 /* Given NAME, an IDENTIFIER_NODE,
4959 return the structure (or union or enum) definition for that name.
4960 Searches binding levels from BINDING_LEVEL up to the global level.
4961 If THISLEVEL_ONLY is nonzero, searches only the specified context
4962 (but skips any tag-transparent contexts to find one that is
4963 meaningful for tags).
4964 FORM says which kind of type the caller wants;
4965 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4966 If the wrong kind of type is found, and it's not a template, an error is
4970 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4971 enum tree_code form
;
4973 struct binding_level
*binding_level
;
4976 register struct binding_level
*level
;
4977 /* Non-zero if, we should look past a pseudo-global level, even if
4979 int allow_pseudo_global
= 1;
4981 for (level
= binding_level
; level
; level
= level
->level_chain
)
4984 if (ANON_AGGRNAME_P (name
))
4985 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4987 /* There's no need for error checking here, because
4988 anon names are unique throughout the compilation. */
4989 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4990 return TREE_VALUE (tail
);
4992 else if (level
->namespace_p
)
4993 /* Do namespace lookup. */
4994 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
4996 tree old
= binding_for_name (name
, tail
);
4998 /* If we just skipped past a pseudo global level, even
4999 though THISLEVEL_ONLY, and we find a template class
5000 declaration, then we use the _TYPE node for the
5001 template. See the example below. */
5002 if (thislevel_only
&& !allow_pseudo_global
5003 && old
&& BINDING_VALUE (old
)
5004 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5005 old
= TREE_TYPE (BINDING_VALUE (old
));
5007 old
= BINDING_TYPE (old
);
5009 /* If it has an original type, it is a typedef, and we
5010 should not return it. */
5011 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5013 if (old
&& TREE_CODE (old
) != form
5014 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5016 cp_error ("`%#D' redeclared as %C", old
, form
);
5021 if (thislevel_only
|| tail
== global_namespace
)
5025 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5027 if (TREE_PURPOSE (tail
) == name
)
5029 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5030 /* Should tighten this up; it'll probably permit
5031 UNION_TYPE and a struct template, for example. */
5033 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5035 /* Definition isn't the kind we were looking for. */
5036 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5040 return TREE_VALUE (tail
);
5043 if (thislevel_only
&& ! level
->tag_transparent
)
5045 if (level
->pseudo_global
&& allow_pseudo_global
)
5047 /* We must deal with cases like this:
5049 template <class T> struct S;
5050 template <class T> struct S {};
5052 When looking up `S', for the second declaration, we
5053 would like to find the first declaration. But, we
5054 are in the pseudo-global level created for the
5055 template parameters, rather than the (surrounding)
5056 namespace level. Thus, we keep going one more level,
5057 even though THISLEVEL_ONLY is non-zero. */
5058 allow_pseudo_global
= 0;
5070 set_current_level_tags_transparency (tags_transparent
)
5071 int tags_transparent
;
5073 current_binding_level
->tag_transparent
= tags_transparent
;
5077 /* Given a type, find the tag that was defined for it and return the tag name.
5078 Otherwise return 0. However, the value can never be 0
5079 in the cases in which this is used.
5081 C++: If NAME is non-zero, this is the new name to install. This is
5082 done when replacing anonymous tags with real tag names. */
5085 lookup_tag_reverse (type
, name
)
5089 register struct binding_level
*level
;
5091 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5094 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5096 if (TREE_VALUE (tail
) == type
)
5099 TREE_PURPOSE (tail
) = name
;
5100 return TREE_PURPOSE (tail
);
5107 /* Look up NAME in the NAMESPACE. */
5110 lookup_namespace_name (namespace, name
)
5111 tree
namespace, name
;
5114 tree template_id
= NULL_TREE
;
5116 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5118 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5119 /* This happens for A::B<int> when B is a namespace. */
5121 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5123 /* This happens for A::B where B is a template, and there are no
5124 template arguments. */
5125 cp_error ("invalid use of `%D'", name
);
5126 return error_mark_node
;
5129 namespace = ORIGINAL_NAMESPACE (namespace);
5131 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5134 name
= TREE_OPERAND (name
, 0);
5135 if (TREE_CODE (name
) == OVERLOAD
)
5136 name
= DECL_NAME (OVL_CURRENT (name
));
5137 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5138 name
= DECL_NAME (name
);
5141 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5143 val
= make_node (CPLUS_BINDING
);
5144 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5145 return error_mark_node
;
5147 if (BINDING_VALUE (val
))
5149 val
= BINDING_VALUE (val
);
5153 if (DECL_CLASS_TEMPLATE_P (val
))
5154 val
= lookup_template_class (val
,
5155 TREE_OPERAND (template_id
, 1),
5156 /*in_decl=*/NULL_TREE
,
5157 /*context=*/NULL_TREE
,
5158 /*entering_scope=*/0);
5159 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5160 || TREE_CODE (val
) == OVERLOAD
)
5161 val
= lookup_template_function (val
,
5162 TREE_OPERAND (template_id
, 1));
5165 cp_error ("`%D::%D' is not a template",
5167 return error_mark_node
;
5171 /* If we have a single function from a using decl, pull it out. */
5172 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5173 val
= OVL_FUNCTION (val
);
5177 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5178 return error_mark_node
;
5181 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5183 static unsigned long
5191 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5192 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5197 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5200 typename_compare (k1
, k2
)
5211 d1
= TYPE_NAME (t1
);
5212 d2
= TYPE_NAME (t2
);
5214 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5215 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5216 && ((TREE_TYPE (t1
) != NULL_TREE
)
5217 == (TREE_TYPE (t2
) != NULL_TREE
))
5218 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5219 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5222 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5223 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5224 is non-NULL, this type is being created by the implicit typename
5225 extension, and BASE_TYPE is a type named `t' in some base class of
5226 `T' which depends on template parameters.
5228 Returns the new TYPENAME_TYPE. */
5231 build_typename_type (context
, name
, fullname
, base_type
)
5239 struct hash_entry
* e
;
5241 static struct hash_table ht
;
5243 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5247 static struct hash_table
*h
= &ht
;
5248 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5250 fatal ("virtual memory exhausted");
5251 ggc_add_tree_hash_table_root (&h
, 1);
5254 /* Build the TYPENAME_TYPE. */
5255 t
= make_lang_type (TYPENAME_TYPE
);
5256 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5257 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5258 TREE_TYPE (t
) = base_type
;
5260 /* Build the corresponding TYPE_DECL. */
5261 d
= build_decl (TYPE_DECL
, name
, t
);
5262 TYPE_NAME (TREE_TYPE (d
)) = d
;
5263 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5264 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5265 DECL_ARTIFICIAL (d
) = 1;
5267 /* See if we already have this type. */
5268 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5272 /* Insert the type into the table. */
5273 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5280 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5281 unless an error occurs, in which case error_mark_node is returned.
5282 If COMPLAIN zero, don't complain about any errors that occur. */
5285 make_typename_type (context
, name
, complain
)
5291 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5293 if (!(TYPE_LANG_SPECIFIC (name
)
5294 && (CLASSTYPE_IS_TEMPLATE (name
)
5295 || CLASSTYPE_USE_TEMPLATE (name
))))
5296 name
= TYPE_IDENTIFIER (name
);
5298 /* Create a TEMPLATE_ID_EXPR for the type. */
5299 name
= build_nt (TEMPLATE_ID_EXPR
,
5300 CLASSTYPE_TI_TEMPLATE (name
),
5301 CLASSTYPE_TI_ARGS (name
));
5303 else if (TREE_CODE (name
) == TYPE_DECL
)
5304 name
= DECL_NAME (name
);
5308 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5310 name
= TREE_OPERAND (name
, 0);
5311 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5312 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5314 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5315 my_friendly_abort (2000);
5317 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5319 /* We can get here from typename_sub0 in the explicit_template_type
5320 expansion. Just fail. */
5322 cp_error ("no class template named `%#T' in `%#T'",
5324 return error_mark_node
;
5327 if (! uses_template_parms (context
)
5328 || currently_open_class (context
))
5330 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5332 tree tmpl
= NULL_TREE
;
5333 if (IS_AGGR_TYPE (context
))
5334 tmpl
= lookup_field (context
, name
, 0, 0);
5335 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5338 cp_error ("no class template named `%#T' in `%#T'",
5340 return error_mark_node
;
5343 return lookup_template_class (tmpl
,
5344 TREE_OPERAND (fullname
, 1),
5346 /*entering_scope=*/0);
5352 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
))
5370 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5371 return error_mark_node
;
5375 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5378 /* Select the right _DECL from multiple choices. */
5381 select_decl (binding
, flags
)
5386 val
= BINDING_VALUE (binding
);
5387 if (LOOKUP_NAMESPACES_ONLY (flags
))
5389 /* We are not interested in types. */
5390 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5395 /* If we could have a type and
5396 we have nothing or we need a type and have none. */
5397 if (BINDING_TYPE (binding
)
5398 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5399 && TREE_CODE (val
) != TYPE_DECL
)))
5400 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5401 /* Don't return non-types if we really prefer types. */
5402 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5403 && (TREE_CODE (val
) != TEMPLATE_DECL
5404 || !DECL_CLASS_TEMPLATE_P (val
)))
5410 /* Unscoped lookup of a global: iterate over current namespaces,
5411 considering using-directives. If SPACESP is non-NULL, store a list
5412 of the namespaces we've considered in it. */
5415 unqualified_namespace_lookup (name
, flags
, spacesp
)
5420 tree b
= make_node (CPLUS_BINDING
);
5421 tree initial
= current_decl_namespace();
5422 tree scope
= initial
;
5424 struct binding_level
*level
;
5425 tree val
= NULL_TREE
;
5428 *spacesp
= NULL_TREE
;
5430 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5433 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5434 val
= binding_for_name (name
, scope
);
5436 /* Initialize binding for this context. */
5437 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5438 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5440 /* Add all _DECLs seen through local using-directives. */
5441 for (level
= current_binding_level
;
5442 !level
->namespace_p
;
5443 level
= level
->level_chain
)
5444 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5445 scope
, flags
, spacesp
))
5446 /* Give up because of error. */
5447 return error_mark_node
;
5449 /* Add all _DECLs seen through global using-directives. */
5450 /* XXX local and global using lists should work equally. */
5454 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5455 scope
, flags
, spacesp
))
5456 /* Give up because of error. */
5457 return error_mark_node
;
5458 if (siter
== scope
) break;
5459 siter
= CP_DECL_CONTEXT (siter
);
5462 val
= select_decl (b
, flags
);
5463 if (scope
== global_namespace
)
5469 /* Combine prefer_type and namespaces_only into flags. */
5472 lookup_flags (prefer_type
, namespaces_only
)
5473 int prefer_type
, namespaces_only
;
5475 if (namespaces_only
)
5476 return LOOKUP_PREFER_NAMESPACES
;
5477 if (prefer_type
> 1)
5478 return LOOKUP_PREFER_TYPES
;
5479 if (prefer_type
> 0)
5480 return LOOKUP_PREFER_BOTH
;
5484 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5485 ignore it or not. Subroutine of lookup_name_real. */
5488 qualify_lookup (val
, flags
)
5492 if (val
== NULL_TREE
)
5494 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5496 if ((flags
& LOOKUP_PREFER_TYPES
)
5497 && (TREE_CODE (val
) == TYPE_DECL
5498 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5499 && DECL_CLASS_TEMPLATE_P (val
))))
5501 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5506 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5510 warn_about_implicit_typename_lookup (typename
, binding
)
5514 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5515 tree name
= DECL_NAME (typename
);
5517 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5518 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5519 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5520 && ! (TREE_CODE (binding
) == TYPE_DECL
5521 && same_type_p (TREE_TYPE (binding
), subtype
)))
5523 cp_warning ("lookup of `%D' finds `%#D'",
5525 cp_warning (" instead of `%D' from dependent base class",
5527 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5528 constructor_name (current_class_type
), name
);
5532 /* Look up NAME in the current binding level and its superiors in the
5533 namespace of variables, functions and typedefs. Return a ..._DECL
5534 node of some kind representing its definition if there is only one
5535 such declaration, or return a TREE_LIST with all the overloaded
5536 definitions if there are many, or return 0 if it is undefined.
5538 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5539 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5540 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5541 Otherwise we prefer non-TYPE_DECLs.
5543 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5544 using IDENTIFIER_CLASS_VALUE. */
5547 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5549 int prefer_type
, nonclass
, namespaces_only
;
5552 tree val
= NULL_TREE
;
5554 tree from_obj
= NULL_TREE
;
5556 int val_is_implicit_typename
= 0;
5558 /* Hack: copy flag set by parser, if set. */
5559 if (only_namespace_names
)
5560 namespaces_only
= 1;
5562 if (prefer_type
== -2)
5564 extern int looking_for_typename
;
5565 tree type
= NULL_TREE
;
5568 prefer_type
= looking_for_typename
;
5570 flags
= lookup_flags (prefer_type
, namespaces_only
);
5571 /* If the next thing is '<', class templates are types. */
5572 if (looking_for_template
)
5573 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5575 /* std:: becomes :: for now. */
5576 if (got_scope
== std_node
)
5577 got_scope
= void_type_node
;
5581 else if (got_object
!= error_mark_node
)
5586 if (type
== error_mark_node
)
5587 return error_mark_node
;
5588 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5589 type
= TREE_TYPE (type
);
5592 type
= complete_type (type
);
5594 if (TREE_CODE (type
) == VOID_TYPE
)
5595 type
= global_namespace
;
5596 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5598 val
= make_node (CPLUS_BINDING
);
5599 flags
|= LOOKUP_COMPLAIN
;
5600 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5602 val
= select_decl (val
, flags
);
5604 else if (! IS_AGGR_TYPE (type
)
5605 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5606 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5607 || TREE_CODE (type
) == TYPENAME_TYPE
)
5608 /* Someone else will give an error about this if needed. */
5610 else if (type
== current_class_type
)
5611 val
= IDENTIFIER_CLASS_VALUE (name
);
5613 val
= lookup_member (type
, name
, 0, prefer_type
);
5620 else if (got_object
&& val
)
5625 flags
= lookup_flags (prefer_type
, namespaces_only
);
5626 /* If we're not parsing, we need to complain. */
5627 flags
|= LOOKUP_COMPLAIN
;
5630 /* First, look in non-namespace scopes. */
5632 if (current_class_type
== NULL_TREE
)
5635 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5639 if (!LOCAL_BINDING_P (t
) && nonclass
)
5640 /* We're not looking for class-scoped bindings, so keep going. */
5643 /* If this is the kind of thing we're looking for, we're done. */
5644 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5645 binding
= BINDING_VALUE (t
);
5646 else if ((flags
& LOOKUP_PREFER_TYPES
)
5647 && qualify_lookup (BINDING_TYPE (t
), flags
))
5648 binding
= BINDING_TYPE (t
);
5650 binding
= NULL_TREE
;
5653 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5655 if (val_is_implicit_typename
&& !yylex
)
5656 warn_about_implicit_typename_lookup (val
, binding
);
5658 val_is_implicit_typename
5659 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5660 if (!val_is_implicit_typename
)
5665 /* Now lookup in namespace scopes. */
5666 if (!val
|| val_is_implicit_typename
)
5668 t
= unqualified_namespace_lookup (name
, flags
, 0);
5671 if (val_is_implicit_typename
&& !yylex
)
5672 warn_about_implicit_typename_lookup (val
, t
);
5680 /* This should only warn about types used in qualified-ids. */
5681 if (from_obj
&& from_obj
!= val
)
5683 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5684 && TREE_CODE (val
) == TYPE_DECL
5685 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5687 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5688 name
, got_object
, TREE_TYPE (from_obj
));
5689 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5693 /* We don't change val to from_obj if got_object depends on
5694 template parms because that breaks implicit typename for
5695 destructor calls. */
5696 if (! uses_template_parms (got_object
))
5700 /* If we have a single function from a using decl, pull it out. */
5701 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5702 val
= OVL_FUNCTION (val
);
5711 lookup_name_nonclass (name
)
5714 return lookup_name_real (name
, 0, 1, 0);
5718 lookup_function_nonclass (name
, args
)
5722 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5726 lookup_name_namespace_only (name
)
5729 /* type-or-namespace, nonclass, namespace_only */
5730 return lookup_name_real (name
, 1, 1, 1);
5734 lookup_name (name
, prefer_type
)
5738 return lookup_name_real (name
, prefer_type
, 0, 0);
5741 /* Similar to `lookup_name' but look only in the innermost non-class
5745 lookup_name_current_level (name
)
5748 struct binding_level
*b
;
5751 b
= current_binding_level
;
5752 while (b
->parm_flag
== 2)
5757 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5759 /* extern "C" function() */
5760 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5763 else if (IDENTIFIER_BINDING (name
)
5764 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5768 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5769 return IDENTIFIER_VALUE (name
);
5781 /* Like lookup_name_current_level, but for types. */
5784 lookup_type_current_level (name
)
5787 register tree t
= NULL_TREE
;
5789 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5791 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5792 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5794 struct binding_level
*b
= current_binding_level
;
5797 if (purpose_member (name
, b
->type_shadowed
))
5798 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5810 begin_only_namespace_names ()
5812 only_namespace_names
= 1;
5816 end_only_namespace_names ()
5818 only_namespace_names
= 0;
5821 /* Arrange for the user to get a source line number, even when the
5822 compiler is going down in flames, so that she at least has a
5823 chance of working around problems in the compiler. We used to
5824 call error(), but that let the segmentation fault continue
5825 through; now, it's much more passive by asking them to send the
5826 maintainers mail about the problem. */
5830 int sig ATTRIBUTE_UNUSED
;
5832 signal (SIGSEGV
, SIG_DFL
);
5834 signal (SIGIOT
, SIG_DFL
);
5837 signal (SIGILL
, SIG_DFL
);
5840 signal (SIGABRT
, SIG_DFL
);
5843 signal (SIGBUS
, SIG_DFL
);
5845 my_friendly_abort (0);
5848 /* Push the declarations of builtin types into the namespace.
5849 RID_INDEX, if < RID_MAX is the index of the builtin type
5850 in the array RID_POINTERS. NAME is the name used when looking
5851 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5854 record_builtin_type (rid_index
, name
, type
)
5859 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5860 tree tdecl
= NULL_TREE
;
5862 if ((int) rid_index
< (int) RID_MAX
)
5863 rname
= ridpointers
[(int) rid_index
];
5865 tname
= get_identifier (name
);
5867 TYPE_BUILT_IN (type
) = 1;
5871 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5872 set_identifier_type_value (tname
, NULL_TREE
);
5873 if ((int) rid_index
< (int) RID_MAX
)
5874 /* Built-in types live in the global namespace. */
5875 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5877 if (rname
!= NULL_TREE
)
5879 if (tname
!= NULL_TREE
)
5881 set_identifier_type_value (rname
, NULL_TREE
);
5882 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5886 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5887 set_identifier_type_value (rname
, NULL_TREE
);
5892 /* Record one of the standard Java types.
5893 * Declare it as having the given NAME.
5894 * If SIZE > 0, it is the size of one of the integral types;
5895 * otherwise it is the negative of the size of one of the other types. */
5898 record_builtin_java_type (name
, size
)
5904 type
= make_signed_type (size
);
5905 else if (size
> -32)
5906 { /* "__java_char" or ""__java_boolean". */
5907 type
= make_unsigned_type (-size
);
5908 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5911 { /* "__java_float" or ""__java_double". */
5912 type
= make_node (REAL_TYPE
);
5913 TYPE_PRECISION (type
) = - size
;
5916 record_builtin_type (RID_MAX
, name
, type
);
5917 decl
= TYPE_NAME (type
);
5919 /* Suppress generate debug symbol entries for these types,
5920 since for normal C++ they are just clutter.
5921 However, push_lang_context undoes this if extern "Java" is seen. */
5922 DECL_IGNORED_P (decl
) = 1;
5924 TYPE_FOR_JAVA (type
) = 1;
5928 /* Push a type into the namespace so that the back-ends ignore it. */
5931 record_unknown_type (type
, name
)
5935 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5936 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5937 DECL_IGNORED_P (decl
) = 1;
5938 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5939 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5940 TYPE_ALIGN (type
) = 1;
5941 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5944 /* Push overloaded decl, in global scope, with one argument so it
5945 can be used as a callback from define_function. */
5948 push_overloaded_decl_1 (x
)
5955 auto_function (name
, type
)
5958 return define_function
5959 (IDENTIFIER_POINTER (name
), type
, push_overloaded_decl_1
,
5960 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5964 /* Create the predefined scalar types of C,
5965 and some nodes representing standard constants (0, 1, (void *)0).
5966 Initialize the global binding level.
5967 Make definitions for built-in primitive functions. */
5970 init_decl_processing ()
5973 int wchar_type_size
;
5974 tree array_domain_type
;
5976 /* Have to make these distinct before we try using them. */
5977 lang_name_cplusplus
= get_identifier ("C++");
5978 lang_name_c
= get_identifier ("C");
5979 lang_name_java
= get_identifier ("Java");
5981 /* Let the back-end now how to save and restore language-specific
5982 per-function globals. */
5983 init_lang_status
= &push_cp_function_context
;
5984 free_lang_status
= &pop_cp_function_context
;
5985 mark_lang_status
= &mark_cp_function_context
;
5991 /* Create the global variables. */
5992 push_to_top_level ();
5994 /* Enter the global namespace. */
5995 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5996 push_namespace (get_identifier ("::"));
5997 global_namespace
= current_namespace
;
5998 current_lang_name
= NULL_TREE
;
6000 if (flag_strict_prototype
== 2)
6001 flag_strict_prototype
= pedantic
;
6002 if (! flag_permissive
&& ! pedantic
)
6003 flag_pedantic_errors
= 1;
6005 strict_prototypes_lang_c
= flag_strict_prototype
;
6008 current_lang_name
= lang_name_c
;
6010 current_function_decl
= NULL_TREE
;
6011 current_binding_level
= NULL_BINDING_LEVEL
;
6012 free_binding_level
= NULL_BINDING_LEVEL
;
6014 /* Because most segmentation signals can be traced back into user
6015 code, catch them and at least give the user a chance of working
6016 around compiler bugs. */
6017 signal (SIGSEGV
, signal_catch
);
6019 /* We will also catch aborts in the back-end through signal_catch and
6020 give the user a chance to see where the error might be, and to defeat
6021 aborts in the back-end when there have been errors previously in their
6024 signal (SIGIOT
, signal_catch
);
6027 signal (SIGILL
, signal_catch
);
6030 signal (SIGABRT
, signal_catch
);
6033 signal (SIGBUS
, signal_catch
);
6036 build_common_tree_nodes (flag_signed_char
);
6038 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6039 TREE_TYPE (error_mark_list
) = error_mark_node
;
6041 /* Make the binding_level structure for global names. */
6043 global_binding_level
= current_binding_level
;
6044 /* The global level is the namespace level of ::. */
6045 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6046 declare_namespace_level ();
6048 this_identifier
= get_identifier (THIS_NAME
);
6049 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6050 ctor_identifier
= get_identifier (CTOR_NAME
);
6051 dtor_identifier
= get_identifier (DTOR_NAME
);
6052 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6053 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6054 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6055 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6056 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6058 /* Define `int' and `char' first so that dbx will output them first. */
6059 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6060 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6062 /* `signed' is the same as `int' */
6063 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6064 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6065 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6066 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6067 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6068 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6069 record_builtin_type (RID_MAX
, "long long unsigned int",
6070 long_long_unsigned_type_node
);
6071 record_builtin_type (RID_MAX
, "long long unsigned",
6072 long_long_unsigned_type_node
);
6073 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6074 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6075 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6078 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6080 /* Define both `signed char' and `unsigned char'. */
6081 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6082 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6084 /* `unsigned long' is the standard type for sizeof.
6085 Note that stddef.h uses `unsigned long',
6086 and this must agree, even if long and int are the same size. */
6088 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6090 /* Create the widest literal types. */
6091 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6092 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6093 widest_integer_literal_type_node
));
6095 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6096 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6097 widest_unsigned_literal_type_node
));
6099 /* These are types that type_for_size and type_for_mode use. */
6100 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6101 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6102 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6103 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6104 #if HOST_BITS_PER_WIDE_INT >= 64
6105 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6107 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6108 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6109 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6110 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6111 #if HOST_BITS_PER_WIDE_INT >= 64
6112 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6115 build_common_tree_nodes_2 (flag_short_double
);
6117 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6118 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6119 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6120 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6121 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6122 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6123 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6124 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6126 integer_two_node
= build_int_2 (2, 0);
6127 TREE_TYPE (integer_two_node
) = integer_type_node
;
6128 integer_three_node
= build_int_2 (3, 0);
6129 TREE_TYPE (integer_three_node
) = integer_type_node
;
6131 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6132 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6133 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6134 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6135 TYPE_PRECISION (boolean_type_node
) = 1;
6136 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6137 boolean_false_node
= build_int_2 (0, 0);
6138 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6139 boolean_true_node
= build_int_2 (1, 0);
6140 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6142 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6143 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6144 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6146 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6147 complex_integer_type_node
));
6148 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6149 complex_float_type_node
));
6150 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6151 complex_double_type_node
));
6152 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6153 complex_long_double_type_node
));
6155 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6157 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6158 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6159 TREE_PARMLIST (void_list_node
) = 1;
6161 /* Used for expressions that do nothing, but are not errors. */
6162 void_zero_node
= build_int_2 (0, 0);
6163 TREE_TYPE (void_zero_node
) = void_type_node
;
6165 string_type_node
= build_pointer_type (char_type_node
);
6166 const_string_type_node
6167 = build_pointer_type (build_qualified_type (char_type_node
,
6169 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6171 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6174 /* Make a type to be the domain of a few array types
6175 whose domains don't really matter.
6176 200 is small enough that it always fits in size_t
6177 and large enough that it can hold most function names for the
6178 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6179 array_domain_type
= build_index_type (build_int_2 (200, 0));
6181 /* Make a type for arrays of characters.
6182 With luck nothing will ever really depend on the length of this
6184 char_array_type_node
6185 = build_array_type (char_type_node
, array_domain_type
);
6186 /* Likewise for arrays of ints. */
6188 = build_array_type (integer_type_node
, array_domain_type
);
6190 /* This is just some anonymous class type. Nobody should ever
6191 need to look inside this envelope. */
6192 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6194 if (flag_huge_objects
)
6195 delta_type_node
= long_integer_type_node
;
6197 delta_type_node
= short_integer_type_node
;
6199 default_function_type
6200 = build_function_type (integer_type_node
, NULL_TREE
);
6202 ptr_type_node
= build_pointer_type (void_type_node
);
6204 = build_pointer_type (build_qualified_type (void_type_node
,
6206 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6207 lang_type_promotes_to
= convert_type_from_ellipsis
;
6210 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6212 /* C++ extensions */
6214 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6215 record_unknown_type (unknown_type_node
, "unknown type");
6217 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6218 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6220 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6222 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6224 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6225 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6227 /* This is special for C++ so functions can be overloaded. */
6228 wchar_type_node
= get_identifier (flag_short_wchar
6229 ? "short unsigned int"
6231 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6232 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6233 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6234 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6236 = TREE_UNSIGNED (wchar_type_node
)
6237 ? unsigned_wchar_type_node
6238 : signed_wchar_type_node
;
6239 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6241 /* Artificial declaration of wchar_t -- can be bashed */
6242 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6244 pushdecl (wchar_decl_node
);
6246 /* This is for wide string constants. */
6247 wchar_array_type_node
6248 = build_array_type (wchar_type_node
, array_domain_type
);
6250 if (flag_vtable_thunks
)
6252 /* Make sure we get a unique function type, so we can give
6253 its pointer type a name. (This wins for gdb.) */
6254 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6255 TREE_TYPE (vfunc_type
) = integer_type_node
;
6256 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6257 layout_type (vfunc_type
);
6259 vtable_entry_type
= build_pointer_type (vfunc_type
);
6263 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6264 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6266 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6268 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6270 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6273 /* Make this part of an invisible union. */
6274 fields
[3] = copy_node (fields
[2]);
6275 TREE_TYPE (fields
[3]) = delta_type_node
;
6276 DECL_NAME (fields
[3]) = delta2_identifier
;
6277 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6278 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6279 TREE_UNSIGNED (fields
[3]) = 0;
6280 TREE_CHAIN (fields
[2]) = fields
[3];
6281 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6284 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6287 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6288 layout_type (vtbl_type_node
);
6289 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6290 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6291 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6292 layout_type (vtbl_ptr_type_node
);
6293 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6295 std_node
= build_decl (NAMESPACE_DECL
,
6296 get_identifier (flag_honor_std
? "fake std":"std"),
6298 pushdecl (std_node
);
6300 global_type_node
= make_node (LANG_TYPE
);
6301 record_unknown_type (global_type_node
, "global type");
6304 current_lang_name
= lang_name_cplusplus
;
6307 tree bad_alloc_type_node
, newtype
, deltype
;
6309 push_namespace (get_identifier ("std"));
6310 bad_alloc_type_node
= xref_tag
6311 (class_type_node
, get_identifier ("bad_alloc"), 1);
6314 newtype
= build_exception_variant
6315 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6316 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6317 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
);
6318 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6319 global_delete_fndecl
= auto_function (ansi_opname
[(int) DELETE_EXPR
],
6321 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6325 = define_function ("__pure_virtual", void_ftype
, 0, 0);
6327 /* Perform other language dependent initializations. */
6328 init_class_processing ();
6329 init_init_processing ();
6330 init_search_processing ();
6331 init_rtti_processing ();
6333 if (flag_exceptions
)
6334 init_exception_processing ();
6337 flag_inline_functions
= 0;
6340 if (! supports_one_only ())
6343 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6344 declare_function_name ();
6346 /* Prepare to check format strings against argument lists. */
6347 init_function_format_info ();
6349 /* Show we use EH for cleanups. */
6350 using_eh_for_cleanups ();
6352 print_error_function
= lang_print_error_function
;
6353 lang_get_alias_set
= &c_get_alias_set
;
6354 valid_lang_attribute
= cp_valid_lang_attribute
;
6356 /* Maintain consistency. Perhaps we should just complain if they
6357 say -fwritable-strings? */
6358 if (flag_writable_strings
)
6359 flag_const_strings
= 0;
6361 /* Add GC roots for all of our global variables. */
6362 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6363 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6364 ggc_add_tree_root (&integer_three_node
, 1);
6365 ggc_add_tree_root (&integer_two_node
, 1);
6366 ggc_add_tree_root (&signed_size_zero_node
, 1);
6367 ggc_add_tree_root (&size_one_node
, 1);
6368 ggc_add_tree_root (&size_zero_node
, 1);
6369 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6370 mark_binding_level
);
6371 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6372 ggc_add_tree_root (&static_ctors
, 1);
6373 ggc_add_tree_root (&static_dtors
, 1);
6374 ggc_add_tree_root (&lastiddecl
, 1);
6376 ggc_add_tree_root (&enum_next_value
, 1);
6377 ggc_add_tree_root (&last_function_parm_tags
, 1);
6378 ggc_add_tree_root (¤t_function_return_value
, 1);
6379 ggc_add_tree_root (¤t_function_parms
, 1);
6380 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6381 ggc_add_tree_root (&last_function_parms
, 1);
6382 ggc_add_tree_root (&error_mark_list
, 1);
6384 ggc_add_tree_root (&global_namespace
, 1);
6385 ggc_add_tree_root (&global_type_node
, 1);
6386 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6388 ggc_add_tree_root (&got_object
, 1);
6389 ggc_add_tree_root (&got_scope
, 1);
6391 ggc_add_tree_root (¤t_lang_name
, 1);
6392 ggc_add_tree_root (&static_aggregates
, 1);
6395 /* Function to print any language-specific context for an error message. */
6398 lang_print_error_function (file
)
6401 default_print_error_function (file
);
6402 maybe_print_template_context ();
6405 /* Make a definition for a builtin function named NAME and whose data type
6406 is TYPE. TYPE should be a function type with argument types.
6408 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6409 the name to be called if we can't opencode the function. */
6412 define_function (name
, type
, pfn
, library_name
)
6415 void (*pfn
) PROTO((tree
));
6416 const char *library_name
;
6418 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6419 DECL_EXTERNAL (decl
) = 1;
6420 TREE_PUBLIC (decl
) = 1;
6421 DECL_ARTIFICIAL (decl
) = 1;
6423 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6424 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6426 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6427 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6428 function in the namespace. */
6429 if (pfn
) (*pfn
) (decl
);
6431 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6432 make_function_rtl (decl
);
6437 /* Wrapper around define_function, for the benefit of
6438 c_common_nodes_and_builtins.
6439 FUNCTION_CODE tells later passes how to compile calls to this function.
6440 See tree.h for its possible values. */
6443 builtin_function (name
, type
, code
, class, libname
)
6447 enum built_in_class
class;
6448 const char *libname
;
6450 tree decl
= define_function (name
, type
, (void (*) PROTO((tree
)))pushdecl
,
6452 DECL_BUILT_IN_CLASS (decl
) = class;
6453 DECL_FUNCTION_CODE (decl
) = code
;
6457 /* When we call finish_struct for an anonymous union, we create
6458 default copy constructors and such. But, an anonymous union
6459 shouldn't have such things; this function undoes the damage to the
6460 anonymous union type T.
6462 (The reason that we create the synthesized methods is that we don't
6463 distinguish `union { int i; }' from `typedef union { int i; } U'.
6464 The first is an anonymous union; the second is just an ordinary
6468 fixup_anonymous_aggr (t
)
6473 /* Wipe out memory of synthesized methods */
6474 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6475 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6476 TYPE_HAS_INIT_REF (t
) = 0;
6477 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6478 TYPE_HAS_ASSIGN_REF (t
) = 0;
6479 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6481 /* Splice the implicitly generated functions out of the TYPE_METHODS
6483 q
= &TYPE_METHODS (t
);
6486 if (DECL_ARTIFICIAL (*q
))
6487 *q
= TREE_CHAIN (*q
);
6489 q
= &TREE_CHAIN (*q
);
6492 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6493 function members. */
6494 if (TYPE_METHODS (t
))
6495 error ("an anonymous union cannot have function members");
6498 /* Make sure that a declaration with no declarator is well-formed, i.e.
6499 just defines a tagged type or anonymous union.
6501 Returns the type defined, if any. */
6504 check_tag_decl (declspecs
)
6508 tree ob_modifier
= NULL_TREE
;
6510 register tree t
= NULL_TREE
;
6512 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6514 register tree value
= TREE_VALUE (link
);
6520 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6522 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6526 else if (value
== ridpointers
[(int) RID_FRIEND
])
6528 if (current_class_type
== NULL_TREE
6529 || current_scope () != current_class_type
)
6530 ob_modifier
= value
;
6532 else if (value
== ridpointers
[(int) RID_STATIC
]
6533 || value
== ridpointers
[(int) RID_EXTERN
]
6534 || value
== ridpointers
[(int) RID_AUTO
]
6535 || value
== ridpointers
[(int) RID_REGISTER
]
6536 || value
== ridpointers
[(int) RID_INLINE
]
6537 || value
== ridpointers
[(int) RID_VIRTUAL
]
6538 || value
== ridpointers
[(int) RID_CONST
]
6539 || value
== ridpointers
[(int) RID_VOLATILE
]
6540 || value
== ridpointers
[(int) RID_EXPLICIT
])
6541 ob_modifier
= value
;
6545 error ("multiple types in one declaration");
6547 /* Inside a class, we might be in a friend or access declaration.
6548 Until we have a good way of detecting the latter, don't warn. */
6549 if (t
== NULL_TREE
&& ! current_class_type
)
6550 pedwarn ("declaration does not declare anything");
6552 /* Check for an anonymous union. We're careful
6553 accessing TYPE_IDENTIFIER because some built-in types, like
6554 pointer-to-member types, do not have TYPE_NAME. */
6555 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6557 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6559 /* Anonymous unions are objects, so they can have specifiers. */;
6560 SET_ANON_AGGR_TYPE_P (t
);
6562 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6563 pedwarn ("ISO C++ prohibits anonymous structs");
6566 else if (ob_modifier
)
6568 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6569 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6570 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6571 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6572 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6573 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6574 cp_error ("`%D' can only be specified for constructors",
6577 cp_error ("`%D' can only be specified for objects and functions",
6584 /* Called when a declaration is seen that contains no names to declare.
6585 If its type is a reference to a structure, union or enum inherited
6586 from a containing scope, shadow that tag name for the current scope
6587 with a forward reference.
6588 If its type defines a new named structure or union
6589 or defines an enum, it is valid but we need not do anything here.
6590 Otherwise, it is an error.
6592 C++: may have to grok the declspecs to learn about static,
6593 complain for anonymous unions. */
6596 shadow_tag (declspecs
)
6599 tree t
= check_tag_decl (declspecs
);
6602 maybe_process_partial_specialization (t
);
6604 /* This is where the variables in an anonymous union are
6605 declared. An anonymous union declaration looks like:
6607 because there is no declarator after the union, the parser
6608 sends that declaration here. */
6609 if (t
&& ANON_AGGR_TYPE_P (t
))
6611 fixup_anonymous_aggr (t
);
6613 if (TYPE_FIELDS (t
))
6615 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6617 finish_anon_union (decl
);
6622 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6625 groktypename (typename
)
6628 if (TREE_CODE (typename
) != TREE_LIST
)
6630 return grokdeclarator (TREE_VALUE (typename
),
6631 TREE_PURPOSE (typename
),
6632 TYPENAME
, 0, NULL_TREE
);
6635 /* Decode a declarator in an ordinary declaration or data definition.
6636 This is called as soon as the type information and variable name
6637 have been parsed, before parsing the initializer if any.
6638 Here we create the ..._DECL node, fill in its type,
6639 and put it on the list of decls for the current context.
6640 The ..._DECL node is returned as the value.
6642 Exception: for arrays where the length is not specified,
6643 the type is left null, to be filled in by `cp_finish_decl'.
6645 Function definitions do not come here; they go to start_function
6646 instead. However, external and forward declarations of functions
6647 do go through here. Structure field declarations are done by
6648 grokfield and not through here. */
6650 /* Set this to zero to debug not using the temporary obstack
6651 to parse initializers. */
6652 int debug_temp_inits
= 1;
6655 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6656 tree declarator
, declspecs
;
6658 tree attributes
, prefix_attributes
;
6661 register tree type
, tem
;
6663 extern int have_extern_spec
;
6664 extern int used_extern_spec
;
6668 /* See code below that used this. */
6669 int init_written
= initialized
;
6672 /* This should only be done once on the top most decl. */
6673 if (have_extern_spec
&& !used_extern_spec
)
6675 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6677 used_extern_spec
= 1;
6680 if (attributes
|| prefix_attributes
)
6681 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6683 attrlist
= NULL_TREE
;
6685 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6688 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6691 type
= TREE_TYPE (decl
);
6693 if (type
== error_mark_node
)
6697 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6698 ? DECL_CLASS_CONTEXT (decl
)
6699 : DECL_CONTEXT (decl
);
6701 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6702 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6704 /* When parsing the initializer, lookup should use the object's
6706 push_decl_namespace (context
);
6709 /* We are only interested in class contexts, later. */
6710 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6711 context
= NULL_TREE
;
6714 /* Is it valid for this decl to have an initializer at all?
6715 If not, set INITIALIZED to zero, which will indirectly
6716 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6717 switch (TREE_CODE (decl
))
6720 /* typedef foo = bar means give foo the same type as bar.
6721 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6722 Any other case of an initialization in a TYPE_DECL is an error. */
6723 if (pedantic
|| list_length (declspecs
) > 1)
6725 cp_error ("typedef `%D' is initialized", decl
);
6731 cp_error ("function `%#D' is initialized like a variable", decl
);
6741 if (! toplevel_bindings_p ()
6742 && DECL_EXTERNAL (decl
))
6743 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6745 DECL_EXTERNAL (decl
) = 0;
6746 if (toplevel_bindings_p ())
6747 TREE_STATIC (decl
) = 1;
6749 /* Tell `pushdecl' this is an initialized decl
6750 even though we don't yet have the initializer expression.
6751 Also tell `cp_finish_decl' it may store the real initializer. */
6752 DECL_INITIAL (decl
) = error_mark_node
;
6755 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6756 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6759 /* Set attributes here so if duplicate decl, will have proper attributes. */
6760 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6762 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6764 push_nested_class (context
, 2);
6766 if (TREE_CODE (decl
) == VAR_DECL
)
6768 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6769 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6770 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6773 if (DECL_CONTEXT (field
) != context
)
6775 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6776 DECL_CONTEXT (field
), DECL_NAME (decl
),
6777 context
, DECL_NAME (decl
));
6778 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6780 /* Static data member are tricky; an in-class initialization
6781 still doesn't provide a definition, so the in-class
6782 declaration will have DECL_EXTERNAL set, but will have an
6783 initialization. Thus, duplicate_decls won't warn
6784 about this situation, and so we check here. */
6785 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6786 cp_error ("duplicate initialization of %D", decl
);
6787 if (duplicate_decls (decl
, field
))
6793 tree field
= check_classfn (context
, decl
);
6794 if (field
&& duplicate_decls (decl
, field
))
6798 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6799 DECL_IN_AGGR_P (decl
) = 0;
6800 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6801 || CLASSTYPE_USE_TEMPLATE (context
))
6803 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6804 /* [temp.expl.spec] An explicit specialization of a static data
6805 member of a template is a definition if the declaration
6806 includes an initializer; otherwise, it is a declaration.
6808 We check for processing_specialization so this only applies
6809 to the new specialization syntax. */
6810 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6811 DECL_EXTERNAL (decl
) = 1;
6814 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6815 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6819 /* Enter this declaration into the symbol table. */
6820 tem
= maybe_push_decl (decl
);
6822 if (processing_template_decl
)
6824 if (at_function_scope_p ())
6825 push_permanent_obstack ();
6826 tem
= push_template_decl (tem
);
6827 if (at_function_scope_p ())
6832 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6833 /* Tell the back-end to use or not use .common as appropriate. If we say
6834 -fconserve-space, we want this to save .data space, at the expense of
6835 wrong semantics. If we say -fno-conserve-space, we want this to
6836 produce errors about redefs; to do this we force variables into the
6838 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6841 if (! processing_template_decl
)
6844 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6845 push_obstacks_nochange ();
6854 tree type
= TREE_TYPE (decl
);
6855 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6857 if (type
== error_mark_node
)
6860 /* If this type of object needs a cleanup, but we're not allowed to
6861 add any more objects with cleanups to the current scope, create a
6862 new binding level. */
6863 if (TYPE_NEEDS_DESTRUCTOR (type
)
6864 && current_binding_level
->more_cleanups_ok
== 0)
6866 keep_next_level (2);
6869 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
6873 /* Is it valid for this decl to have an initializer at all?
6874 If not, set INITIALIZED to zero, which will indirectly
6875 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6877 /* Don't allow initializations for incomplete types except for
6878 arrays which might be completed by the initialization. */
6879 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6880 ; /* A complete type is ok. */
6881 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6883 cp_error ("variable `%#D' has initializer but incomplete type",
6886 type
= TREE_TYPE (decl
) = error_mark_node
;
6888 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6890 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6891 cp_error ("elements of array `%#D' have incomplete type", decl
);
6892 /* else we already gave an error in start_decl. */
6898 && TREE_CODE (decl
) != TYPE_DECL
6899 && TREE_CODE (decl
) != TEMPLATE_DECL
6900 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6902 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6903 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6905 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6907 /* Change the type so that assemble_variable will give
6908 DECL an rtl we can live with: (mem (const_int 0)). */
6909 type
= TREE_TYPE (decl
) = error_mark_node
;
6913 /* If any base type in the hierarchy of TYPE needs a constructor,
6914 then we set initialized to 1. This way any nodes which are
6915 created for the purposes of initializing this aggregate
6916 will live as long as it does. This is necessary for global
6917 aggregates which do not have their initializers processed until
6918 the end of the file. */
6919 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6924 DECL_INITIAL (decl
) = NULL_TREE
;
6927 /* Handle initialization of references.
6928 These three arguments are from `cp_finish_decl', and have the
6929 same meaning here that they do there.
6931 Quotes on semantics can be found in ARM 8.4.3. */
6934 grok_reference_init (decl
, type
, init
)
6935 tree decl
, type
, init
;
6939 if (init
== NULL_TREE
)
6941 if ((DECL_LANG_SPECIFIC (decl
) == 0
6942 || DECL_IN_AGGR_P (decl
) == 0)
6943 && ! DECL_THIS_EXTERN (decl
))
6944 cp_error ("`%D' declared as reference but not initialized", decl
);
6948 if (init
== error_mark_node
)
6951 if (TREE_CODE (init
) == CONSTRUCTOR
)
6953 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6957 if (TREE_CODE (init
) == TREE_LIST
)
6958 init
= build_compound_expr (init
);
6960 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6961 init
= convert_from_reference (init
);
6963 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6964 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6966 /* Note: default conversion is only called in very special cases. */
6967 init
= default_conversion (init
);
6970 /* Convert INIT to the reference type TYPE. This may involve the
6971 creation of a temporary, whose lifetime must be the same as that
6972 of the reference. If so, a DECL_STMT for the temporary will be
6973 added just after the DECL_STMT for DECL. That's why we don't set
6974 DECL_INITIAL for local references (instead assigning to them
6975 explicitly); we need to allow the temporary to be initialized
6977 tmp
= convert_to_reference
6978 (type
, init
, CONV_IMPLICIT
,
6979 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6981 if (tmp
== error_mark_node
)
6983 else if (tmp
!= NULL_TREE
)
6986 tmp
= save_expr (tmp
);
6987 if (building_stmt_tree ())
6989 /* Initialize the declaration. */
6990 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
6991 finish_expr_stmt (tmp
);
6994 DECL_INITIAL (decl
) = tmp
;
6998 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7002 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7004 expand_static_init (decl
, DECL_INITIAL (decl
));
7005 DECL_INITIAL (decl
) = NULL_TREE
;
7010 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7011 mucking with forces it does not comprehend (i.e. initialization with a
7012 constructor). If we are at global scope and won't go into COMMON, fill
7013 it in with a dummy CONSTRUCTOR to force the variable into .data;
7014 otherwise we can use error_mark_node. */
7017 obscure_complex_init (decl
, init
)
7020 if (! flag_no_inline
&& TREE_STATIC (decl
))
7022 if (extract_init (decl
, init
))
7026 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7027 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7028 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7032 DECL_INITIAL (decl
) = error_mark_node
;
7037 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7038 array until we finish parsing the initializer. If that's the
7039 situation we're in, update DECL accordingly. */
7042 maybe_deduce_size_from_array_init (decl
, init
)
7046 tree type
= TREE_TYPE (decl
);
7048 if (TREE_CODE (type
) == ARRAY_TYPE
7049 && TYPE_DOMAIN (type
) == NULL_TREE
7050 && TREE_CODE (decl
) != TYPE_DECL
)
7053 = (TREE_STATIC (decl
)
7054 /* Even if pedantic, an external linkage array
7055 may have incomplete type at first. */
7056 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7057 : !DECL_EXTERNAL (decl
));
7058 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7059 int failure
= complete_array_type (type
, initializer
, do_default
);
7062 cp_error ("initializer fails to determine size of `%D'", decl
);
7067 cp_error ("array size missing in `%D'", decl
);
7068 /* If a `static' var's size isn't known, make it extern as
7069 well as static, so it does not get allocated. If it's not
7070 `static', then don't mark it extern; finish_incomplete_decl
7071 will give it a default size and it will get allocated. */
7072 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7073 DECL_EXTERNAL (decl
) = 1;
7076 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7077 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7079 cp_error ("zero-size array `%D'", decl
);
7081 layout_decl (decl
, 0);
7085 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7086 any appropriate error messages regarding the layout. */
7089 layout_var_decl (decl
)
7092 tree type
= TREE_TYPE (decl
);
7093 tree ttype
= target_type (type
);
7095 /* If we haven't already layed out this declaration, do so now.
7096 Note that we must not call complete type for an external object
7097 because it's type might involve templates that we are not
7098 supposed to isntantiate yet. (And it's perfectly legal to say
7099 `extern X x' for some incomplete type `X'.) */
7100 if (!DECL_EXTERNAL (decl
))
7101 complete_type (type
);
7102 if (!DECL_SIZE (decl
)&& TYPE_SIZE (type
))
7103 layout_decl (decl
, 0);
7105 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7107 /* An automatic variable with an incomplete type: that is an error.
7108 Don't talk about array types here, since we took care of that
7109 message in grokdeclarator. */
7110 cp_error ("storage size of `%D' isn't known", decl
);
7111 TREE_TYPE (decl
) = error_mark_node
;
7113 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7114 /* Let debugger know it should output info for this type. */
7115 note_debug_info_needed (ttype
);
7117 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7118 note_debug_info_needed (DECL_CONTEXT (decl
));
7120 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7121 && DECL_SIZE (decl
) != NULL_TREE
7122 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7124 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7125 constant_expression_warning (DECL_SIZE (decl
));
7127 cp_error ("storage size of `%D' isn't constant", decl
);
7131 /* If a local static variable is declared in an inline function, or if
7132 we have a weak definition, we must endeavor to create only one
7133 instance of the variable at link-time. */
7136 maybe_commonize_var (decl
)
7139 /* Static data in a function with comdat linkage also has comdat
7141 if (TREE_STATIC (decl
)
7142 /* Don't mess with __FUNCTION__. */
7143 && ! TREE_ASM_WRITTEN (decl
)
7144 && current_function_decl
7145 && DECL_CONTEXT (decl
) == current_function_decl
7146 && (DECL_THIS_INLINE (current_function_decl
)
7147 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7148 && TREE_PUBLIC (current_function_decl
))
7150 /* Rather than try to get this right with inlining, we suppress
7151 inlining of such functions. */
7152 current_function_cannot_inline
7153 = "function with static variable cannot be inline";
7155 /* If flag_weak, we don't need to mess with this, as we can just
7156 make the function weak, and let it refer to its unique local
7157 copy. This works because we don't allow the function to be
7161 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7163 TREE_PUBLIC (decl
) = 1;
7164 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7166 else if (DECL_INITIAL (decl
) == NULL_TREE
7167 || DECL_INITIAL (decl
) == error_mark_node
)
7169 TREE_PUBLIC (decl
) = 1;
7170 DECL_COMMON (decl
) = 1;
7172 /* else we lose. We can only do this if we can use common,
7173 which we can't if it has been initialized. */
7175 if (TREE_PUBLIC (decl
))
7176 DECL_ASSEMBLER_NAME (decl
)
7177 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7178 else if (! DECL_ARTIFICIAL (decl
))
7180 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7181 cp_warning_at (" you can work around this by removing the initializer", decl
);
7185 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7186 /* Set it up again; we might have set DECL_INITIAL since the last
7188 comdat_linkage (decl
);
7191 /* Issue an error message if DECL is an uninitialized const variable. */
7194 check_for_uninitialized_const_var (decl
)
7197 tree type
= TREE_TYPE (decl
);
7199 /* ``Unless explicitly declared extern, a const object does not have
7200 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7202 if (TREE_CODE (decl
) == VAR_DECL
7203 && TREE_CODE (type
) != REFERENCE_TYPE
7204 && CP_TYPE_CONST_P (type
)
7205 && !TYPE_NEEDS_CONSTRUCTING (type
)
7206 && !DECL_INITIAL (decl
))
7207 cp_error ("uninitialized const `%D'", decl
);
7210 /* Verify INIT (the initializer for DECL), and record the
7211 initialization in DECL_INITIAL, if appropriate. Returns a new
7215 check_initializer (decl
, init
)
7221 if (TREE_CODE (decl
) == FIELD_DECL
)
7224 type
= TREE_TYPE (decl
);
7226 /* If `start_decl' didn't like having an initialization, ignore it now. */
7227 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7230 /* Check the initializer. */
7233 /* Things that are going to be initialized need to have complete
7235 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7237 if (type
== error_mark_node
)
7238 /* We will have already complained. */
7240 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7242 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7245 else if (TREE_CODE (type
) == ARRAY_TYPE
7246 && !TYPE_SIZE (TREE_TYPE (type
)))
7248 cp_error ("elements of array `%#D' have incomplete type", decl
);
7251 else if (!TYPE_SIZE (type
))
7253 cp_error ("`%D' has incomplete type", decl
);
7254 TREE_TYPE (decl
) = error_mark_node
;
7259 if (TREE_CODE (decl
) == CONST_DECL
)
7261 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7263 DECL_INITIAL (decl
) = init
;
7265 /* This will keep us from needing to worry about our obstacks. */
7266 my_friendly_assert (init
!= NULL_TREE
, 149);
7269 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7271 if (TREE_STATIC (decl
))
7272 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7273 grok_reference_init (decl
, type
, init
);
7278 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7280 if (TREE_CODE (type
) == ARRAY_TYPE
)
7281 init
= digest_init (type
, init
, (tree
*) 0);
7282 else if (TREE_CODE (init
) == CONSTRUCTOR
7283 && TREE_HAS_CONSTRUCTOR (init
))
7285 if (TYPE_NON_AGGREGATE_CLASS (type
))
7287 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7289 init
= error_mark_node
;
7292 goto dont_use_constructor
;
7297 dont_use_constructor
:
7298 if (TREE_CODE (init
) != TREE_VEC
)
7299 init
= store_init_value (decl
, init
);
7303 /* We must hide the initializer so that expand_decl
7304 won't try to do something it does not understand. */
7305 init
= obscure_complex_init (decl
, init
);
7307 else if (DECL_EXTERNAL (decl
))
7309 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7310 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7312 tree core_type
= strip_array_types (type
);
7314 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7316 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7317 cp_error ("structure `%D' with uninitialized const members", decl
);
7318 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7319 cp_error ("structure `%D' with uninitialized reference members",
7323 check_for_uninitialized_const_var (decl
);
7325 if (TYPE_SIZE (type
) != NULL_TREE
7326 && TYPE_NEEDS_CONSTRUCTING (type
))
7327 init
= obscure_complex_init (decl
, NULL_TREE
);
7331 check_for_uninitialized_const_var (decl
);
7336 /* If DECL is not a local variable, give it RTL. */
7339 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7342 const char *asmspec
;
7347 type
= TREE_TYPE (decl
);
7348 toplev
= toplevel_bindings_p ();
7350 /* Handle non-variables up front. */
7351 if (TREE_CODE (decl
) != VAR_DECL
)
7353 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7357 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7359 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7361 if (DECL_VIRTUAL_P (decl
))
7362 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7363 else if (TREE_READONLY (decl
)
7364 && DECL_INITIAL (decl
) != NULL_TREE
7365 && DECL_INITIAL (decl
) != error_mark_node
7366 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7368 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7370 if (toplev
&& ! TREE_PUBLIC (decl
))
7372 /* If this is a static const, change its apparent linkage
7373 if it belongs to a #pragma interface. */
7374 if (!interface_unknown
)
7376 TREE_PUBLIC (decl
) = 1;
7377 DECL_EXTERNAL (decl
) = interface_only
;
7379 make_decl_rtl (decl
, asmspec
, toplev
);
7382 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7384 else if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7386 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7388 if (init
== NULL_TREE
7389 #ifdef DEFAULT_STATIC_DEFS
7390 /* If this code is dead, then users must
7391 explicitly declare static member variables
7392 outside the class def'n as well. */
7393 && TYPE_NEEDS_CONSTRUCTING (type
)
7397 DECL_EXTERNAL (decl
) = 1;
7398 make_decl_rtl (decl
, asmspec
, 1);
7401 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7403 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7404 || (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
)))
7405 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7408 /* Create RTL for the local static variable DECL. */
7411 make_rtl_for_local_static (decl
)
7414 tree type
= TREE_TYPE (decl
);
7415 const char *asmspec
= NULL
;
7417 if (TREE_READONLY (decl
)
7418 && DECL_INITIAL (decl
) != NULL_TREE
7419 && DECL_INITIAL (decl
) != error_mark_node
7420 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7421 && ! TREE_SIDE_EFFECTS (decl
)
7422 && ! TREE_PUBLIC (decl
)
7423 && ! DECL_EXTERNAL (decl
)
7424 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7425 && ! TREE_ADDRESSABLE (decl
)
7426 && DECL_MODE (decl
) != BLKmode
)
7428 /* As an optimization, we try to put register-sized static
7429 constants in a register, rather than writing them out. If we
7430 take the address of the constant later, we'll make RTL for it
7432 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7433 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7434 TREE_ASM_WRITTEN (decl
) = 1;
7438 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7440 /* The only way this situaton can occur is if the
7441 user specified a name for this DECL using the
7442 `attribute' syntax. */
7443 asmspec
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
7444 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
7447 rest_of_decl_compilation (decl
, asmspec
, /*top_level=*/0, /*at_end=*/0);
7450 /* The old ARM scoping rules injected variables declared in the
7451 initialization statement of a for-statement into the surrounding
7452 scope. We support this usage, in order to be backward-compatible.
7453 DECL is a just-declared VAR_DECL; if necessary inject its
7454 declaration into the surrounding scope. */
7457 maybe_inject_for_scope_var (decl
)
7460 if (current_binding_level
->is_for_scope
)
7462 struct binding_level
*outer
7463 = current_binding_level
->level_chain
;
7465 /* Check to see if the same name is already bound at the outer
7466 level, either because it was directly declared, or because a
7467 dead for-decl got preserved. In either case, the code would
7468 not have been valid under the ARM scope rules, so clear
7469 is_for_scope for the current_binding_level.
7471 Otherwise, we need to preserve the temp slot for decl to last
7472 into the outer binding level. */
7475 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7477 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7478 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7480 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7482 BINDING_VALUE (outer_binding
)
7483 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7484 current_binding_level
->is_for_scope
= 0;
7486 else if (DECL_IN_MEMORY_P (decl
))
7487 preserve_temp_slots (DECL_RTL (decl
));
7491 /* Generate code to initialize DECL (a local variable). */
7494 initialize_local_var (decl
, init
, flags
)
7499 tree type
= TREE_TYPE (decl
);
7501 /* If the type is bogus, don't bother initializing the variable. */
7502 if (type
== error_mark_node
)
7505 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7507 /* If we used it already as memory, it must stay in memory. */
7508 DECL_INITIAL (decl
) = NULL_TREE
;
7509 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7512 /* Local statics are handled differently from ordinary automatic
7514 if (TREE_STATIC (decl
))
7516 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7517 || TYPE_NEEDS_DESTRUCTOR (type
))
7518 expand_static_init (decl
, init
);
7522 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7526 /* Compute and store the initial value. */
7527 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7529 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7531 int saved_stmts_are_full_exprs_p
;
7533 emit_line_note (DECL_SOURCE_FILE (decl
),
7534 DECL_SOURCE_LINE (decl
));
7535 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7536 stmts_are_full_exprs_p
= 1;
7537 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7538 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7541 /* Set this to 0 so we can tell whether an aggregate which was
7542 initialized was ever used. Don't do this if it has a
7543 destructor, so we don't complain about the 'resource
7544 allocation is initialization' idiom. Now set
7545 attribute((unused)) on types so decls of that type will be
7546 marked used. (see TREE_USED, above.) */
7547 if (TYPE_NEEDS_CONSTRUCTING (type
)
7549 && !TYPE_NEEDS_DESTRUCTOR (type
)
7550 && DECL_NAME (decl
))
7551 TREE_USED (decl
) = 0;
7552 else if (already_used
)
7553 TREE_USED (decl
) = 1;
7557 /* Generate code to destroy DECL (a local variable). */
7560 destroy_local_var (decl
)
7563 tree type
= TREE_TYPE (decl
);
7566 /* Only variables get cleaned up. */
7567 if (TREE_CODE (decl
) != VAR_DECL
)
7570 /* And only things with destructors need cleaning up. */
7571 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7574 if (TREE_CODE (decl
) == VAR_DECL
&&
7575 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7576 /* We don't clean up things that aren't defined in this
7577 translation unit, or that need a static cleanup. The latter
7578 are handled by finish_file. */
7581 /* Compute the cleanup. */
7582 cleanup
= maybe_build_cleanup (decl
);
7584 /* Record the cleanup required for this declaration. */
7585 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7587 finish_decl_cleanup (decl
, cleanup
);
7590 /* Let the back-end know about DECL. */
7593 emit_local_var (decl
)
7596 /* Create RTL for this variable. */
7597 if (DECL_RTL (decl
))
7598 /* Only a RESULT_DECL should have non-NULL RTL when
7599 arriving here. All other local variables are
7600 assigned RTL in this function. */
7601 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7605 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7606 /* The user must have specified an assembler name for this
7607 variable. Set that up now. */
7608 rest_of_decl_compilation
7609 (decl
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
7610 /*top_level=*/0, /*at_end=*/0);
7615 /* Actually do the initialization. */
7616 expand_start_target_temps ();
7617 expand_decl_init (decl
);
7618 expand_end_target_temps ();
7621 /* Finish processing of a declaration;
7622 install its line number and initial value.
7623 If the length of an array type is not known before,
7624 it must be determined now, from the initial value, or it is an error.
7626 Call `pop_obstacks' iff NEED_POP is nonzero.
7628 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7629 for aggregates that have constructors alive on the permanent obstack,
7630 so that the global initializing functions can be written at the end.
7632 INIT0 holds the value of an initializer that should be allowed to escape
7635 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7636 if the (init) syntax was used.
7638 For functions that take default parameters, DECL points to its
7639 "maximal" instantiation. `cp_finish_decl' must then also declared its
7640 subsequently lower and lower forms of instantiation, checking for
7641 ambiguity as it goes. This can be sped up later. */
7644 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7651 tree ttype
= NULL_TREE
;
7652 int temporary
= allocation_temporary_p ();
7653 const char *asmspec
= NULL
;
7654 int was_readonly
= 0;
7656 /* If this is 0, then we did not change obstacks. */
7660 error ("assignment (not initialization) in declaration");
7664 /* If a name was specified, get the string. */
7666 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7668 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7670 cp_error ("Cannot initialize `%D' to namespace `%D'",
7675 if (current_class_type
7676 && DECL_REAL_CONTEXT (decl
) == current_class_type
7677 && TYPE_BEING_DEFINED (current_class_type
)
7678 && (DECL_INITIAL (decl
) || init
))
7679 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7681 if (TREE_CODE (decl
) == VAR_DECL
7682 && DECL_CONTEXT (decl
)
7683 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7684 && DECL_CONTEXT (decl
) != current_namespace
7687 /* Leave the namespace of the object. */
7688 pop_decl_namespace ();
7691 type
= TREE_TYPE (decl
);
7693 if (type
== error_mark_node
)
7695 if (toplevel_bindings_p () && temporary
)
7696 end_temporary_allocation ();
7701 /* Add this declaration to the statement-tree. */
7702 if (building_stmt_tree ()
7703 && TREE_CODE (current_scope ()) == FUNCTION_DECL
)
7704 add_decl_stmt (decl
);
7706 if (TYPE_HAS_MUTABLE_P (type
))
7707 TREE_READONLY (decl
) = 0;
7709 if (processing_template_decl
)
7711 if (init
&& DECL_INITIAL (decl
))
7712 DECL_INITIAL (decl
) = init
;
7716 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7717 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7719 /* Take care of TYPE_DECLs up front. */
7720 if (TREE_CODE (decl
) == TYPE_DECL
)
7722 if (init
&& DECL_INITIAL (decl
))
7724 /* typedef foo = bar; store the type of bar as the type of foo. */
7725 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7726 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7728 if (type
!= error_mark_node
7729 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7731 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7732 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7733 set_identifier_type_value (DECL_NAME (decl
), type
);
7734 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7736 GNU_xref_decl (current_function_decl
, decl
);
7738 /* If we have installed this as the canonical typedef for this
7739 type, and that type has not been defined yet, delay emitting
7740 the debug information for it, as we will emit it later. */
7741 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7742 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7743 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7745 rest_of_decl_compilation (decl
, NULL_PTR
,
7746 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7750 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7751 ttype
= target_type (type
);
7753 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7754 && TYPE_NEEDS_CONSTRUCTING (type
))
7756 /* Currently, GNU C++ puts constants in text space, making them
7757 impossible to initialize. In the future, one would hope for
7758 an operating system which understood the difference between
7759 initialization and the running of a program. */
7761 TREE_READONLY (decl
) = 0;
7764 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7766 /* This must override the asm specifier which was placed by
7767 grokclassfn. Lay this out fresh. */
7768 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7769 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7770 make_decl_rtl (decl
, asmspec
, 0);
7773 /* Deduce size of array from initialization, if not already known. */
7774 maybe_deduce_size_from_array_init (decl
, init
);
7775 init
= check_initializer (decl
, init
);
7777 GNU_xref_decl (current_function_decl
, decl
);
7779 /* For top-level declaration, the initial value was read in
7780 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7781 must go in the permanent obstack; but don't discard the
7782 temporary data yet. */
7784 if (toplevel_bindings_p () && temporary
)
7785 end_temporary_allocation ();
7787 if (TREE_CODE (decl
) == VAR_DECL
)
7788 layout_var_decl (decl
);
7790 /* Output the assembler code and/or RTL code for variables and functions,
7791 unless the type is an undefined structure or union.
7792 If not, it will get done when the type is completed. */
7793 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7794 || TREE_CODE (decl
) == RESULT_DECL
)
7796 if (TREE_CODE (decl
) == VAR_DECL
)
7797 maybe_commonize_var (decl
);
7799 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7801 if (TREE_CODE (type
) == FUNCTION_TYPE
7802 || TREE_CODE (type
) == METHOD_TYPE
)
7803 abstract_virtuals_error (decl
,
7804 strip_array_types (TREE_TYPE (type
)));
7806 abstract_virtuals_error (decl
, strip_array_types (type
));
7808 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7810 else if (DECL_EXTERNAL (decl
)
7811 && ! (DECL_LANG_SPECIFIC (decl
)
7812 && DECL_NOT_REALLY_EXTERN (decl
)))
7815 DECL_INITIAL (decl
) = init
;
7817 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
7819 /* This is a local declaration. */
7820 if (doing_semantic_analysis_p ())
7821 maybe_inject_for_scope_var (decl
);
7822 /* Initialize the local variable. But, if we're building a
7823 statement-tree, we'll do the initialization when we
7825 if (processing_template_decl
)
7827 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7828 DECL_INITIAL (decl
) = init
;
7832 /* If we're not building RTL, then we need to do so
7834 if (!building_stmt_tree ())
7835 emit_local_var (decl
);
7836 /* Initialize the variable. */
7837 initialize_local_var (decl
, init
, flags
);
7838 /* Clean up the variable. */
7839 destroy_local_var (decl
);
7842 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7844 /* Cleanups for static variables are handled by `finish_file'. */
7845 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7846 || TYPE_NEEDS_DESTRUCTOR (type
))
7847 expand_static_init (decl
, init
);
7851 /* Undo call to `pushclass' that was done in `start_decl'
7852 due to initialization of qualified member variable.
7853 I.e., Foo::x = 10; */
7855 tree context
= DECL_REAL_CONTEXT (decl
);
7857 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7858 && (TREE_CODE (decl
) == VAR_DECL
7859 /* We also have a pushclass done that we need to undo here
7860 if we're at top level and declare a method. */
7861 || TREE_CODE (decl
) == FUNCTION_DECL
)
7862 /* If size hasn't been set, we're still defining it,
7863 and therefore inside the class body; don't pop
7864 the binding level.. */
7865 && TYPE_SIZE (context
) != NULL_TREE
7866 && context
== current_class_type
)
7867 pop_nested_class ();
7873 /* If requested, warn about definitions of large data objects. */
7875 if (warn_larger_than
7876 && ! processing_template_decl
7877 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7878 && !DECL_EXTERNAL (decl
))
7880 register tree decl_size
= DECL_SIZE (decl
);
7882 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7884 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7886 if (units
> larger_than_size
)
7887 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7892 /* Resume permanent allocation, if not within a function. The
7893 corresponding push_obstacks_nochange is in start_decl,
7894 start_method, groktypename, and in grokfield. */
7898 TREE_READONLY (decl
) = 1;
7901 /* This is here for a midend callback from c-common.c */
7904 finish_decl (decl
, init
, asmspec_tree
)
7908 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7911 /* Generate code to handle the destruction of the function-scoped
7912 static variable DECL. */
7915 destroy_local_static (decl
)
7918 tree cleanup
, fcall
;
7920 int saved_flag_access_control
;
7922 if (atexit_node
== 0)
7924 tree atexit_fndecl
, PFV
, pfvlist
;
7925 /* Remember this information until end of file. */
7926 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7927 PFV
= build_pointer_type (build_function_type
7928 (void_type_node
, void_list_node
));
7930 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7932 push_lang_context (lang_name_c
);
7933 /* Note that we do not call pushdecl for this function;
7934 there's no reason that this declaration should be
7935 accessible to anyone. */
7937 = define_function ("atexit",
7938 build_function_type (void_type_node
,
7940 /*pfn=*/0, NULL_PTR
);
7941 mark_used (atexit_fndecl
);
7942 atexit_node
= default_conversion (atexit_fndecl
);
7943 pop_lang_context ();
7947 /* Call build_cleanup before we enter the anonymous function so that
7948 any access checks will be done relative to the current scope,
7949 rather than the scope of the anonymous function. */
7950 build_cleanup (decl
);
7952 /* Now start the function. */
7953 cleanup
= start_anon_func ();
7955 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7956 to the original function, rather than the anonymous one. That
7957 will make the back-end think that nested functions are in use,
7958 which causes confusion. */
7959 saved_flag_access_control
= flag_access_control
;
7960 flag_access_control
= 0;
7961 fcall
= build_cleanup (decl
);
7962 flag_access_control
= saved_flag_access_control
;
7964 /* Create the body of the anonymous function. */
7965 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7966 finish_expr_stmt (fcall
);
7967 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7970 /* Call atexit with the cleanup function. */
7971 mark_addressable (cleanup
);
7972 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7973 fcall
= build_function_call (atexit_node
,
7974 tree_cons (NULL_TREE
,
7977 finish_expr_stmt (fcall
);
7981 expand_static_init (decl
, init
)
7985 tree oldstatic
= value_member (decl
, static_aggregates
);
7989 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7990 cp_error ("multiple initializations given for `%D'", decl
);
7992 else if (! toplevel_bindings_p ())
7994 /* Emit code to perform this initialization but once. */
8001 /* Remember this information until end of file. */
8002 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8004 /* Emit code to perform this initialization but once. This code
8007 static int temp = 0;
8009 // Do initialization.
8011 // Register variable for destruction at end of program.
8014 Note that the `temp' variable is only set to 1 *after* the
8015 initialization is complete. This ensures that an exception,
8016 thrown during the construction, will cause the variable to
8017 reinitialized when we pass through this code again, as per:
8021 If the initialization exits by throwing an exception, the
8022 initialization is not complete, so it will be tried again
8023 the next time control enters the declaration.
8025 In theory, this process should be thread-safe, too; multiple
8026 threads should not be able to initialize the variable more
8027 than once. We don't yet attempt to ensure thread-safety. */
8028 temp
= get_temp_name (integer_type_node
, 1);
8029 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8031 /* Begin the conditional initialization. */
8032 if_stmt
= begin_if_stmt ();
8033 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
8036 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8038 /* Do the initialization itself. */
8039 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8040 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8041 assignment
= build_aggr_init (decl
, init
, 0);
8043 /* The initialization we're doing here is just a bitwise
8045 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8047 assignment
= NULL_TREE
;
8049 /* Once the assignment is complete, set TEMP to 1. Since the
8050 construction of the static object is complete at this point,
8051 we want to make sure TEMP is set to 1 even if a temporary
8052 constructed during the initialization throws an exception
8053 when it is destroyed. So, we combine the initialization and
8054 the assignment to TEMP into a single expression, ensuring
8055 that when we call finish_expr_stmt the cleanups will not be
8056 run until after TEMP is set to 1. */
8057 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8060 assignment
= tree_cons (NULL_TREE
, assignment
,
8061 build_tree_list (NULL_TREE
,
8063 assignment
= build_compound_expr (assignment
);
8066 assignment
= temp_init
;
8067 finish_expr_stmt (assignment
);
8069 /* Use atexit to register a function for destroying this static
8071 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8072 destroy_local_static (decl
);
8074 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8075 finish_then_clause (if_stmt
);
8078 /* Resume old (possibly temporary) allocation. */
8083 /* This code takes into account memory allocation policy of
8084 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8085 hold for this object, then we must make permanent the storage
8086 currently in the temporary obstack. */
8087 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8088 preserve_initializer ();
8089 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8093 /* Finish the declaration of a catch-parameter. */
8096 start_handler_parms (declspecs
, declarator
)
8103 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8105 if (decl
== NULL_TREE
)
8106 error ("invalid catch parameter");
8115 /* Make TYPE a complete type based on INITIAL_VALUE.
8116 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8117 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8120 complete_array_type (type
, initial_value
, do_default
)
8121 tree type
, initial_value
;
8124 register tree maxindex
= NULL_TREE
;
8127 /* Allocate on the same obstack as TYPE. */
8128 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8132 /* Note MAXINDEX is really the maximum index,
8133 one less than the size. */
8134 if (TREE_CODE (initial_value
) == STRING_CST
)
8137 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8138 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8141 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8143 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8144 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8145 for (; elts
; elts
= TREE_CHAIN (elts
))
8147 if (TREE_PURPOSE (elts
))
8148 maxindex
= TREE_PURPOSE (elts
);
8150 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8152 maxindex
= copy_node (maxindex
);
8156 /* Make an error message unless that happened already. */
8157 if (initial_value
!= error_mark_node
)
8160 initial_value
= NULL_TREE
;
8162 /* Prevent further error messages. */
8163 maxindex
= build_int_2 (0, 0);
8170 maxindex
= build_int_2 (0, 0);
8179 domain
= build_index_type (maxindex
);
8180 TYPE_DOMAIN (type
) = domain
;
8182 if (! TREE_TYPE (maxindex
))
8183 TREE_TYPE (maxindex
) = domain
;
8185 itype
= TREE_TYPE (initial_value
);
8188 if (itype
&& !TYPE_DOMAIN (itype
))
8189 TYPE_DOMAIN (itype
) = domain
;
8190 /* The type of the main variant should never be used for arrays
8191 of different sizes. It should only ever be completed with the
8192 size of the array. */
8193 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8194 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8199 /* Lay out the type now that we can get the real answer. */
8206 /* Return zero if something is declared to be a member of type
8207 CTYPE when in the context of CUR_TYPE. STRING is the error
8208 message to print in that case. Otherwise, quietly return 1. */
8211 member_function_or_else (ctype
, cur_type
, string
)
8212 tree ctype
, cur_type
;
8215 if (ctype
&& ctype
!= cur_type
)
8217 error (string
, TYPE_NAME_STRING (ctype
));
8223 /* Subroutine of `grokdeclarator'. */
8225 /* Generate errors possibly applicable for a given set of specifiers.
8226 This is for ARM $7.1.2. */
8229 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8232 int virtualp
, quals
, friendp
, raises
, inlinep
;
8235 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8237 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8239 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8242 cp_error_at ("`%D' declared as a friend", object
);
8244 cp_error_at ("`%D' declared with an exception specification", object
);
8247 /* CTYPE is class type, or null if non-class.
8248 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8250 DECLARATOR is the function's name.
8251 VIRTUALP is truthvalue of whether the function is virtual or not.
8252 FLAGS are to be passed through to `grokclassfn'.
8253 QUALS are qualifiers indicating whether the function is `const'
8255 RAISES is a list of exceptions that this function can raise.
8256 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8257 not look, and -1 if we should not call `grokclassfn' at all.
8259 Returns `NULL_TREE' if something goes wrong, after issuing
8260 applicable error messages. */
8263 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8264 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8265 template_count
, in_namespace
)
8268 tree orig_declarator
;
8270 enum overload_flags flags
;
8272 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8276 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8277 int has_default_arg
= 0;
8281 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8282 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8288 type
= build_exception_variant (type
, raises
);
8291 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8292 /* Propagate volatile out from type to decl. */
8293 if (TYPE_VOLATILE (type
))
8294 TREE_THIS_VOLATILE (decl
) = 1;
8296 /* If this decl has namespace scope, set that up. */
8298 set_decl_namespace (decl
, in_namespace
, friendp
);
8299 else if (publicp
&& ! ctype
)
8300 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8302 /* `main' and builtins have implicit 'C' linkage. */
8303 if ((MAIN_NAME_P (declarator
)
8304 || (IDENTIFIER_LENGTH (declarator
) > 10
8305 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8306 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8307 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8308 && current_lang_name
== lang_name_cplusplus
8309 && ctype
== NULL_TREE
8310 /* NULL_TREE means global namespace. */
8311 && DECL_CONTEXT (decl
) == NULL_TREE
)
8312 DECL_LANGUAGE (decl
) = lang_c
;
8314 /* Should probably propagate const out from type to decl I bet (mrs). */
8317 DECL_STATIC_FUNCTION_P (decl
) = 1;
8318 DECL_CONTEXT (decl
) = ctype
;
8322 DECL_CLASS_CONTEXT (decl
) = ctype
;
8324 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8326 if (processing_template_decl
)
8327 error ("cannot declare `main' to be a template");
8329 error ("cannot declare `main' to be inline");
8331 error ("cannot declare `main' to be static");
8336 /* Members of anonymous types and local classes have no linkage; make
8338 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8339 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8344 /* [basic.link]: A name with no linkage (notably, the name of a class
8345 or enumeration declared in a local scope) shall not be used to
8346 declare an entity with linkage.
8348 Only check this for public decls for now. */
8349 t
= no_linkage_check (TREE_TYPE (decl
));
8352 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8354 if (DECL_LANGUAGE (decl
) == lang_c
)
8355 /* Allow this; it's pretty common in C. */;
8357 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8361 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8366 TREE_PUBLIC (decl
) = publicp
;
8369 DECL_INTERFACE_KNOWN (decl
) = 1;
8370 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8374 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8376 DECL_EXTERNAL (decl
) = 1;
8377 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8379 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8380 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8384 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8385 grok_op_properties (decl
, virtualp
, check
< 0);
8387 if (ctype
&& hack_decl_function_context (decl
))
8388 DECL_NO_STATIC_CHAIN (decl
) = 1;
8390 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8391 if (TREE_PURPOSE (t
)
8392 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8394 has_default_arg
= 1;
8399 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8403 ("defining explicit specialization `%D' in friend declaration",
8407 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8409 /* Something like `template <class T> friend void f<T>()'. */
8410 cp_error ("template-id `%D' in declaration of primary template",
8416 /* A friend declaration of the form friend void f<>(). Record
8417 the information in the TEMPLATE_ID_EXPR. */
8418 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8419 DECL_TEMPLATE_INFO (decl
)
8420 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8421 TREE_OPERAND (orig_declarator
, 1),
8424 if (has_default_arg
)
8426 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8433 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8440 if (has_default_arg
)
8441 add_defarg_fn (decl
);
8443 /* Plain overloading: will not be grok'd by grokclassfn. */
8444 if (! ctype
&& ! processing_template_decl
8445 && DECL_LANGUAGE (decl
) != lang_c
8446 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8447 set_mangled_name_for_decl (decl
);
8450 /* Make the init_value nonzero so pushdecl knows this is not
8451 tentative. error_mark_node is replaced later with the BLOCK. */
8452 DECL_INITIAL (decl
) = error_mark_node
;
8454 /* Caller will do the rest of this. */
8458 if (check
&& funcdef_flag
)
8459 DECL_INITIAL (decl
) = error_mark_node
;
8461 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8464 /* Just handle constructors here. We could do this
8465 inside the following if stmt, but I think
8466 that the code is more legible by breaking this
8467 case out. See comments below for what each of
8468 the following calls is supposed to do. */
8469 DECL_CONSTRUCTOR_P (decl
) = 1;
8471 grokclassfn (ctype
, decl
, flags
, quals
);
8473 decl
= check_explicit_specialization (orig_declarator
, decl
,
8475 2 * (funcdef_flag
!= 0) +
8476 4 * (friendp
!= 0));
8477 if (decl
== error_mark_node
)
8480 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8483 tmp
= check_classfn (ctype
, decl
);
8485 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8486 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8488 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8489 cp_error ("definition of implicitly-declared `%D'", tmp
);
8490 if (tmp
&& duplicate_decls (decl
, tmp
))
8493 if (! grok_ctor_properties (ctype
, decl
))
8500 /* Function gets the ugly name, field gets the nice one.
8501 This call may change the type of the function (because
8502 of default parameters)! */
8503 if (ctype
!= NULL_TREE
)
8504 grokclassfn (ctype
, decl
, flags
, quals
);
8506 decl
= check_explicit_specialization (orig_declarator
, decl
,
8508 2 * (funcdef_flag
!= 0) +
8509 4 * (friendp
!= 0));
8510 if (decl
== error_mark_node
)
8513 if (ctype
!= NULL_TREE
8514 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8517 tmp
= check_classfn (ctype
, decl
);
8519 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8520 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8522 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8523 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8525 /* Remove the `this' parm added by grokclassfn.
8526 XXX Isn't this done in start_function, too? */
8527 revert_static_member_fn (&decl
, NULL
, NULL
);
8528 last_function_parms
= TREE_CHAIN (last_function_parms
);
8530 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8531 cp_error ("definition of implicitly-declared `%D'", tmp
);
8534 /* Attempt to merge the declarations. This can fail, in
8535 the case of some illegal specialization declarations. */
8536 if (!duplicate_decls (decl
, tmp
))
8537 cp_error ("no `%#D' member function declared in class `%T'",
8543 if (ctype
== NULL_TREE
|| check
)
8548 DECL_VIRTUAL_P (decl
) = 1;
8549 if (DECL_VINDEX (decl
) == NULL_TREE
)
8550 DECL_VINDEX (decl
) = error_mark_node
;
8551 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8558 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8561 RID_BIT_TYPE
*specbits_in
;
8567 RID_BIT_TYPE specbits
;
8569 specbits
= *specbits_in
;
8571 if (TREE_CODE (type
) == OFFSET_TYPE
)
8573 /* If you declare a static member so that it
8574 can be initialized, the code will reach here. */
8575 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8576 type
= TREE_TYPE (type
);
8577 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8578 DECL_CONTEXT (decl
) = basetype
;
8579 DECL_CLASS_CONTEXT (decl
) = basetype
;
8580 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8587 context
= in_namespace
;
8588 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8589 context
= current_namespace
;
8591 context
= NULL_TREE
;
8593 if (processing_template_decl
)
8595 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8596 we can call push_template_decl. */
8597 push_permanent_obstack ();
8598 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8602 decl
= build_decl (VAR_DECL
, declarator
, type
);
8605 set_decl_namespace (decl
, context
, 0);
8607 context
= DECL_CONTEXT (decl
);
8608 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8609 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8613 set_decl_namespace (decl
, in_namespace
, 0);
8615 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8617 DECL_THIS_EXTERN (decl
) = 1;
8618 DECL_EXTERNAL (decl
) = !initialized
;
8621 /* In class context, static means one per class,
8622 public access, and static storage. */
8623 if (DECL_CLASS_SCOPE_P (decl
))
8625 TREE_PUBLIC (decl
) = 1;
8626 TREE_STATIC (decl
) = 1;
8627 DECL_EXTERNAL (decl
) = 0;
8629 /* At top level, either `static' or no s.c. makes a definition
8630 (perhaps tentative), and absence of `static' makes it public. */
8631 else if (toplevel_bindings_p ())
8633 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8634 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8635 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8637 /* Not at top level, only `static' makes a static definition. */
8640 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8641 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8644 if (TREE_PUBLIC (decl
))
8646 /* [basic.link]: A name with no linkage (notably, the name of a class
8647 or enumeration declared in a local scope) shall not be used to
8648 declare an entity with linkage.
8650 Only check this for public decls for now. */
8651 tree t
= no_linkage_check (TREE_TYPE (decl
));
8654 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8655 /* Ignore for now; `enum { foo } e' is pretty common. */;
8657 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8665 /* Create and return a canonical pointer to member function type, for
8666 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8669 build_ptrmemfunc_type (type
)
8675 tree unqualified_variant
= NULL_TREE
;
8677 /* If a canonical type already exists for this type, use it. We use
8678 this method instead of type_hash_canon, because it only does a
8679 simple equality check on the list of field members. */
8681 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8684 /* Make sure that we always have the unqualified pointer-to-member
8686 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8688 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8690 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8692 u
= make_lang_type (UNION_TYPE
);
8693 SET_IS_AGGR_TYPE (u
, 0);
8694 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8695 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8697 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8698 TYPE_NAME (u
) = NULL_TREE
;
8700 t
= make_lang_type (RECORD_TYPE
);
8702 /* Let the front-end know this is a pointer to member function... */
8703 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8704 /* ... and not really an aggregate. */
8705 SET_IS_AGGR_TYPE (t
, 0);
8707 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8709 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8711 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8712 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8716 /* Zap out the name so that the back-end will give us the debugging
8717 information for this anonymous RECORD_TYPE. */
8718 TYPE_NAME (t
) = NULL_TREE
;
8720 /* If this is not the unqualified form of this pointer-to-member
8721 type, set the TYPE_MAIN_VARIANT for this type to be the
8722 unqualified type. Since they are actually RECORD_TYPEs that are
8723 not variants of each other, we must do this manually. */
8724 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8726 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8727 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8728 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8729 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8732 /* Cache this pointer-to-member type so that we can find it again
8734 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8736 /* Seems to be wanted. */
8737 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8742 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8743 Check to see that the definition is valid. Issue appropriate error
8744 messages. Return 1 if the definition is particularly bad, or 0
8748 check_static_variable_definition (decl
, type
)
8752 /* Motion 10 at San Diego: If a static const integral data member is
8753 initialized with an integral constant expression, the initializer
8754 may appear either in the declaration (within the class), or in
8755 the definition, but not both. If it appears in the class, the
8756 member is a member constant. The file-scope definition is always
8758 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8760 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8762 /* If we just return the declaration, crashes will sometimes
8763 occur. We therefore return void_type_node, as if this was a
8764 friend declaration, to cause callers to completely ignore
8765 this declaration. */
8768 else if (!CP_TYPE_CONST_P (type
))
8769 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8771 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8772 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8777 /* Given declspecs and a declarator,
8778 determine the name and type of the object declared
8779 and construct a ..._DECL node for it.
8780 (In one case we can return a ..._TYPE node instead.
8781 For invalid input we sometimes return 0.)
8783 DECLSPECS is a chain of tree_list nodes whose value fields
8784 are the storage classes and type specifiers.
8786 DECL_CONTEXT says which syntactic context this declaration is in:
8787 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8788 FUNCDEF for a function definition. Like NORMAL but a few different
8789 error messages in each case. Return value may be zero meaning
8790 this definition is too screwy to try to parse.
8791 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8792 handle member functions (which have FIELD context).
8793 Return value may be zero meaning this definition is too screwy to
8795 PARM for a parameter declaration (either within a function prototype
8796 or before a function body). Make a PARM_DECL, or return void_type_node.
8797 CATCHPARM for a parameter declaration before a catch clause.
8798 TYPENAME if for a typename (in a cast or sizeof).
8799 Don't make a DECL node; just return the ..._TYPE node.
8800 FIELD for a struct or union field; make a FIELD_DECL.
8801 BITFIELD for a field with specified width.
8802 INITIALIZED is 1 if the decl has an initializer.
8804 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8805 normal attributes in TREE_PURPOSE, or NULL_TREE.
8807 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8808 It may also be so in the PARM case, for a prototype where the
8809 argument type is specified but not the name.
8811 This function is where the complicated C meanings of `static'
8812 and `extern' are interpreted.
8814 For C++, if there is any monkey business to do, the function which
8815 calls this one must do it, i.e., prepending instance variables,
8816 renaming overloaded function names, etc.
8818 Note that for this C++, it is an error to define a method within a class
8819 which does not belong to that class.
8821 Except in the case where SCOPE_REFs are implicitly known (such as
8822 methods within a class being redundantly qualified),
8823 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8824 (class_name::decl_name). The caller must also deal with this.
8826 If a constructor or destructor is seen, and the context is FIELD,
8827 then the type gains the attribute TREE_HAS_x. If such a declaration
8828 is erroneous, NULL_TREE is returned.
8830 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8831 function, these are the qualifiers to give to the `this' pointer.
8833 May return void_type_node if the declarator turned out to be a friend.
8834 See grokfield for details. */
8836 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8839 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8842 enum decl_context decl_context
;
8846 RID_BIT_TYPE specbits
;
8849 tree type
= NULL_TREE
;
8855 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8856 int explicit_int
= 0;
8857 int explicit_char
= 0;
8858 int defaulted_int
= 0;
8859 tree typedef_decl
= NULL_TREE
;
8861 tree typedef_type
= NULL_TREE
;
8862 int funcdef_flag
= 0;
8863 enum tree_code innermost_code
= ERROR_MARK
;
8866 /* See the code below that used this. */
8867 tree decl_machine_attr
= NULL_TREE
;
8869 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8870 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8871 tree init
= NULL_TREE
;
8873 /* Keep track of what sort of function is being processed
8874 so that we can warn about default return values, or explicit
8875 return values which do not match prescribed defaults. */
8876 enum return_types return_type
= return_normal
;
8878 tree dname
= NULL_TREE
;
8879 tree ctype
= current_class_type
;
8880 tree ctor_return_type
= NULL_TREE
;
8881 enum overload_flags flags
= NO_SPECIAL
;
8882 tree quals
= NULL_TREE
;
8883 tree raises
= NULL_TREE
;
8884 int template_count
= 0;
8885 tree in_namespace
= NULL_TREE
;
8889 RIDBIT_RESET_ALL (specbits
);
8890 if (decl_context
== FUNCDEF
)
8891 funcdef_flag
= 1, decl_context
= NORMAL
;
8892 else if (decl_context
== MEMFUNCDEF
)
8893 funcdef_flag
= -1, decl_context
= FIELD
;
8894 else if (decl_context
== BITFIELD
)
8895 bitfield
= 1, decl_context
= FIELD
;
8897 /* Look inside a declarator for the name being declared
8898 and get it as a string, for an error message. */
8900 tree
*next
= &declarator
;
8904 while (next
&& *next
)
8907 switch (TREE_CODE (decl
))
8910 /* For attributes. */
8911 next
= &TREE_VALUE (decl
);
8916 next
= &TREE_OPERAND (decl
, 0);
8919 case BIT_NOT_EXPR
: /* For C++ destructors! */
8921 tree name
= TREE_OPERAND (decl
, 0);
8922 tree rename
= NULL_TREE
;
8924 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8926 return_type
= return_dtor
;
8927 if (TREE_CODE (name
) == TYPE_DECL
)
8928 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8929 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8930 if (ctype
== NULL_TREE
)
8932 if (current_class_type
== NULL_TREE
)
8934 error ("destructors must be member functions");
8939 tree t
= constructor_name (current_class_name
);
8946 tree t
= constructor_name (ctype
);
8953 cp_error ("destructor `%T' must match class name `%T'",
8955 TREE_OPERAND (decl
, 0) = rename
;
8961 case ADDR_EXPR
: /* C++ reference declaration */
8966 innermost_code
= TREE_CODE (decl
);
8967 next
= &TREE_OPERAND (decl
, 0);
8971 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
8973 /* This is actually a variable declaration using
8974 constructor syntax. We need to call start_decl and
8975 cp_finish_decl so we can get the variable
8978 tree attributes
, prefix_attributes
;
8980 *next
= TREE_OPERAND (decl
, 0);
8981 init
= CALL_DECLARATOR_PARMS (decl
);
8985 attributes
= TREE_PURPOSE (attrlist
);
8986 prefix_attributes
= TREE_VALUE (attrlist
);
8990 attributes
= NULL_TREE
;
8991 prefix_attributes
= NULL_TREE
;
8994 decl
= start_decl (declarator
, declspecs
, 1,
8995 attributes
, prefix_attributes
);
8998 /* Look for __unused__ attribute */
8999 if (TREE_USED (TREE_TYPE (decl
)))
9000 TREE_USED (decl
) = 1;
9001 finish_decl (decl
, init
, NULL_TREE
);
9004 cp_error ("invalid declarator");
9007 innermost_code
= TREE_CODE (decl
);
9008 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9009 ctype
= current_class_type
;
9011 && TREE_OPERAND (decl
, 0)
9012 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9013 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9014 == constructor_name_full (ctype
))
9015 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9016 == constructor_name (ctype
)))))
9017 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9018 next
= &TREE_OPERAND (decl
, 0);
9020 if (ctype
!= NULL_TREE
9021 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9022 && decl
== constructor_name (ctype
))
9024 return_type
= return_ctor
;
9025 ctor_return_type
= ctype
;
9030 case TEMPLATE_ID_EXPR
:
9032 tree fns
= TREE_OPERAND (decl
, 0);
9034 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9035 fns
= TREE_OPERAND (fns
, 0);
9038 if (TREE_CODE (dname
) == COMPONENT_REF
)
9039 dname
= TREE_OPERAND (dname
, 1);
9040 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9042 my_friendly_assert (is_overloaded_fn (dname
),
9044 dname
= DECL_NAME (get_first_fn (dname
));
9049 case IDENTIFIER_NODE
:
9050 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9057 cp_error ("declarator-id missing; using reserved word `%D'",
9059 name
= IDENTIFIER_POINTER (dname
);
9061 if (! IDENTIFIER_OPNAME_P (dname
)
9062 /* GNU/Linux headers use '__op'. Arrgh. */
9063 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9064 name
= IDENTIFIER_POINTER (dname
);
9067 if (IDENTIFIER_TYPENAME_P (dname
))
9069 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9070 flags
= TYPENAME_FLAG
;
9071 ctor_return_type
= TREE_TYPE (dname
);
9072 return_type
= return_conversion
;
9074 name
= operator_name_string (dname
);
9081 /* Perform error checking, and decide on a ctype. */
9082 tree cname
= TREE_OPERAND (decl
, 0);
9083 if (cname
== NULL_TREE
)
9085 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9088 in_namespace
= TREE_OPERAND (decl
, 0);
9089 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9091 else if (! is_aggr_type (cname
, 1))
9092 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9093 /* Must test TREE_OPERAND (decl, 1), in case user gives
9094 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9095 else if (TREE_OPERAND (decl
, 1)
9096 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9098 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9099 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9101 cp_error ("`%T::%D' is not a valid declarator", cname
,
9102 TREE_OPERAND (decl
, 1));
9103 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9104 cname
, TREE_OPERAND (decl
, 1));
9105 return void_type_node
;
9107 else if (ctype
== NULL_TREE
)
9109 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9110 TREE_OPERAND (decl
, 0) = ctype
;
9113 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9115 cp_error ("type `%T' is not derived from type `%T'",
9117 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9123 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9124 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9125 == constructor_name_full (ctype
))
9126 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9127 == constructor_name (ctype
))))
9128 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9129 next
= &TREE_OPERAND (decl
, 1);
9133 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9134 && constructor_name (ctype
) == decl
)
9136 return_type
= return_ctor
;
9137 ctor_return_type
= ctype
;
9139 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9140 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9141 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9142 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9144 return_type
= return_dtor
;
9145 ctor_return_type
= ctype
;
9147 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9148 next
= &TREE_OPERAND (decl
, 0);
9159 /* Parse error puts this typespec where
9160 a declarator should go. */
9161 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9162 if (TREE_TYPE (decl
) == current_class_type
)
9163 cp_error (" perhaps you want `%T' for a constructor",
9164 current_class_name
);
9165 dname
= DECL_NAME (decl
);
9166 name
= IDENTIFIER_POINTER (dname
);
9168 /* Avoid giving two errors for this. */
9169 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9171 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9178 cp_compiler_error ("`%D' as declarator", decl
);
9179 return 0; /* We used to do a 155 abort here. */
9184 /* A function definition's declarator must have the form of
9185 a function declarator. */
9187 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9190 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9191 && innermost_code
!= CALL_EXPR
9192 && ! (ctype
&& declspecs
== NULL_TREE
))
9194 cp_error ("declaration of `%D' as non-function", dname
);
9195 return void_type_node
;
9198 /* Anything declared one level down from the top level
9199 must be one of the parameters of a function
9200 (because the body is at least two levels down). */
9202 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9203 by not allowing C++ class definitions to specify their parameters
9204 with xdecls (must be spec.d in the parmlist).
9206 Since we now wait to push a class scope until we are sure that
9207 we are in a legitimate method context, we must set oldcname
9208 explicitly (since current_class_name is not yet alive).
9210 We also want to avoid calling this a PARM if it is in a namespace. */
9212 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9214 struct binding_level
*b
= current_binding_level
;
9215 current_binding_level
= b
->level_chain
;
9216 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9217 decl_context
= PARM
;
9218 current_binding_level
= b
;
9222 name
= decl_context
== PARM
? "parameter" : "type name";
9224 /* Look through the decl specs and record which ones appear.
9225 Some typespecs are defined as built-in typenames.
9226 Others, the ones that are modifiers of other types,
9227 are represented by bits in SPECBITS: set the bits for
9228 the modifiers that appear. Storage class keywords are also in SPECBITS.
9230 If there is a typedef name or a type, store the type in TYPE.
9231 This includes builtin typedefs such as `int'.
9233 Set EXPLICIT_INT if the type is `int' or `char' and did not
9234 come from a user typedef.
9236 Set LONGLONG if `long' is mentioned twice.
9238 For C++, constructors and destructors have their own fast treatment. */
9240 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9245 /* Certain parse errors slip through. For example,
9246 `int class;' is not caught by the parser. Try
9247 weakly to recover here. */
9248 if (TREE_CODE (spec
) != TREE_LIST
)
9251 id
= TREE_VALUE (spec
);
9253 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9255 if (id
== ridpointers
[(int) RID_INT
]
9256 || id
== ridpointers
[(int) RID_CHAR
]
9257 || id
== ridpointers
[(int) RID_BOOL
]
9258 || id
== ridpointers
[(int) RID_WCHAR
])
9262 if (id
== ridpointers
[(int) RID_BOOL
])
9263 error ("`bool' is now a keyword");
9265 cp_error ("extraneous `%T' ignored", id
);
9269 if (id
== ridpointers
[(int) RID_INT
])
9271 else if (id
== ridpointers
[(int) RID_CHAR
])
9273 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9277 /* C++ aggregate types. */
9278 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9281 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9283 type
= IDENTIFIER_TYPE_VALUE (id
);
9287 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9289 if (ridpointers
[i
] == id
)
9291 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9293 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9294 pedwarn ("ANSI C++ does not support `long long'");
9296 error ("`long long long' is too long for GCC");
9300 else if (RIDBIT_SETP (i
, specbits
))
9301 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9302 RIDBIT_SET (i
, specbits
);
9307 /* C++ aggregate types. */
9308 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9311 cp_error ("multiple declarations `%T' and `%T'", type
,
9315 type
= TREE_TYPE (id
);
9316 TREE_VALUE (spec
) = type
;
9321 error ("two or more data types in declaration of `%s'", name
);
9322 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9324 register tree t
= lookup_name (id
, 1);
9325 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9326 error ("`%s' fails to be a typedef or built in type",
9327 IDENTIFIER_POINTER (id
));
9330 type
= TREE_TYPE (t
);
9332 /* See the code below that used this. */
9333 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9338 else if (id
!= error_mark_node
)
9339 /* Can't change CLASS nodes into RECORD nodes here! */
9345 typedef_type
= type
;
9347 /* No type at all: default to `int', and set DEFAULTED_INT
9348 because it was not a user-defined typedef. */
9350 if (type
== NULL_TREE
9351 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9352 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9353 || RIDBIT_SETP (RID_LONG
, specbits
)
9354 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9356 /* These imply 'int'. */
9357 type
= integer_type_node
;
9361 if (type
== NULL_TREE
)
9364 if (return_type
== return_dtor
)
9365 type
= void_type_node
;
9366 else if (return_type
== return_ctor
)
9367 type
= build_pointer_type (ctor_return_type
);
9368 else if (return_type
== return_conversion
)
9369 type
= ctor_return_type
;
9372 /* We handle `main' specially here, because 'main () { }' is so
9373 common. With no options, it is allowed. With -Wreturn-type,
9374 it is a warning. It is only an error with -pedantic-errors. */
9375 int is_main
= (funcdef_flag
9376 && MAIN_NAME_P (dname
)
9377 && ctype
== NULL_TREE
9378 && in_namespace
== NULL_TREE
9379 && current_namespace
== global_namespace
);
9381 if (in_system_header
|| flag_ms_extensions
)
9382 /* Allow it, sigh. */;
9383 else if (pedantic
|| ! is_main
)
9384 cp_pedwarn ("ANSI C++ forbids declaration of `%s' with no type",
9386 else if (warn_return_type
)
9387 cp_warning ("ANSI C++ forbids declaration of `%s' with no type",
9390 type
= integer_type_node
;
9393 else if (return_type
== return_dtor
)
9395 error ("return type specification for destructor invalid");
9396 type
= void_type_node
;
9398 else if (return_type
== return_ctor
)
9400 error ("return type specification for constructor invalid");
9401 type
= build_pointer_type (ctor_return_type
);
9403 else if (return_type
== return_conversion
)
9405 if (!same_type_p (type
, ctor_return_type
))
9406 cp_error ("operator `%T' declared to return `%T'",
9407 ctor_return_type
, type
);
9409 cp_pedwarn ("return type specified for `operator %T'",
9412 type
= ctor_return_type
;
9417 /* Now process the modifiers that were specified
9418 and check for invalid combinations. */
9420 /* Long double is a special combination. */
9422 if (RIDBIT_SETP (RID_LONG
, specbits
)
9423 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9425 RIDBIT_RESET (RID_LONG
, specbits
);
9426 type
= build_qualified_type (long_double_type_node
,
9427 CP_TYPE_QUALS (type
));
9430 /* Check all other uses of type modifiers. */
9432 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9433 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9434 || RIDBIT_SETP (RID_LONG
, specbits
)
9435 || RIDBIT_SETP (RID_SHORT
, specbits
))
9439 if (TREE_CODE (type
) == REAL_TYPE
)
9440 error ("short, signed or unsigned invalid for `%s'", name
);
9441 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9442 error ("long, short, signed or unsigned invalid for `%s'", name
);
9443 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9444 && RIDBIT_SETP (RID_SHORT
, specbits
))
9445 error ("long and short specified together for `%s'", name
);
9446 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9447 || RIDBIT_SETP (RID_SHORT
, specbits
))
9449 error ("long or short specified with char for `%s'", name
);
9450 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9451 || RIDBIT_SETP (RID_SHORT
, specbits
))
9452 && TREE_CODE (type
) == REAL_TYPE
)
9453 error ("long or short specified with floating type for `%s'", name
);
9454 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9455 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9456 error ("signed and unsigned given together for `%s'", name
);
9460 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9462 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9464 if (flag_pedantic_errors
)
9469 /* Discard the type modifiers if they are invalid. */
9472 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9473 RIDBIT_RESET (RID_SIGNED
, specbits
);
9474 RIDBIT_RESET (RID_LONG
, specbits
);
9475 RIDBIT_RESET (RID_SHORT
, specbits
);
9480 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9481 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9483 error ("complex invalid for `%s'", name
);
9484 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9487 /* Decide whether an integer type is signed or not.
9488 Optionally treat bitfields as signed by default. */
9489 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9492 It is implementation-defined whether a plain (neither
9493 explicitly signed or unsigned) char, short, int, or long
9494 bit-field is signed or unsigned.
9496 Naturally, we extend this to long long as well. Note that
9497 this does not include wchar_t. */
9498 || (bitfield
&& !flag_signed_bitfields
9499 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9500 /* A typedef for plain `int' without `signed' can be
9501 controlled just like plain `int', but a typedef for
9502 `signed int' cannot be so controlled. */
9504 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9505 && (TREE_CODE (type
) == INTEGER_TYPE
9506 || TREE_CODE (type
) == CHAR_TYPE
)
9507 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9510 type
= long_long_unsigned_type_node
;
9511 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9512 type
= long_unsigned_type_node
;
9513 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9514 type
= short_unsigned_type_node
;
9515 else if (type
== char_type_node
)
9516 type
= unsigned_char_type_node
;
9517 else if (typedef_decl
)
9518 type
= unsigned_type (type
);
9520 type
= unsigned_type_node
;
9522 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9523 && type
== char_type_node
)
9524 type
= signed_char_type_node
;
9526 type
= long_long_integer_type_node
;
9527 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9528 type
= long_integer_type_node
;
9529 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9530 type
= short_integer_type_node
;
9532 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9534 /* If we just have "complex", it is equivalent to
9535 "complex double", but if any modifiers at all are specified it is
9536 the complex form of TYPE. E.g, "complex short" is
9537 "complex short int". */
9539 if (defaulted_int
&& ! longlong
9540 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9541 || RIDBIT_SETP (RID_SHORT
, specbits
)
9542 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9543 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9544 type
= complex_double_type_node
;
9545 else if (type
== integer_type_node
)
9546 type
= complex_integer_type_node
;
9547 else if (type
== float_type_node
)
9548 type
= complex_float_type_node
;
9549 else if (type
== double_type_node
)
9550 type
= complex_double_type_node
;
9551 else if (type
== long_double_type_node
)
9552 type
= complex_long_double_type_node
;
9554 type
= build_complex_type (type
);
9557 if (return_type
== return_conversion
9558 && (RIDBIT_SETP (RID_CONST
, specbits
)
9559 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9560 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9561 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9564 /* Set CONSTP if this declaration is `const', whether by
9565 explicit specification or via a typedef.
9566 Likewise for VOLATILEP. */
9568 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9570 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9572 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9573 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9574 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9575 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9576 type
= cp_build_qualified_type (type
, type_quals
);
9578 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9579 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9580 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9581 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9582 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9584 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9585 staticp
= 1 + (decl_context
== FIELD
);
9587 if (virtualp
&& staticp
== 2)
9589 cp_error ("member `%D' cannot be declared both virtual and static",
9593 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9594 RIDBIT_RESET (RID_FRIEND
, specbits
);
9596 /* Warn if two storage classes are given. Default to `auto'. */
9598 if (RIDBIT_ANY_SET (specbits
))
9600 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9601 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9602 if (decl_context
== PARM
&& nclasses
> 0)
9603 error ("storage class specifiers invalid in parameter declarations");
9604 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9606 if (decl_context
== PARM
)
9607 error ("typedef declaration invalid in parameter declaration");
9610 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9611 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9614 /* Give error if `virtual' is used outside of class declaration. */
9616 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9618 error ("virtual outside class declaration");
9622 /* Static anonymous unions are dealt with here. */
9623 if (staticp
&& decl_context
== TYPENAME
9624 && TREE_CODE (declspecs
) == TREE_LIST
9625 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9626 decl_context
= FIELD
;
9628 /* Warn about storage classes that are invalid for certain
9629 kinds of declarations (parameters, typenames, etc.). */
9632 error ("multiple storage classes in declaration of `%s'", name
);
9633 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9635 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9636 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9637 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9639 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9641 else if (decl_context
== FIELD
9642 /* C++ allows static class elements */
9643 && RIDBIT_SETP (RID_STATIC
, specbits
))
9644 /* C++ also allows inlines and signed and unsigned elements,
9645 but in those cases we don't come in here. */
9649 if (decl_context
== FIELD
)
9651 tree tmp
= NULL_TREE
;
9652 register int op
= 0;
9656 /* Avoid trying to get an operand off an identifier node. */
9657 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9660 tmp
= TREE_OPERAND (declarator
, 0);
9661 op
= IDENTIFIER_OPNAME_P (tmp
);
9663 error ("storage class specified for %s `%s'",
9664 op
? "member operator" : "field",
9665 op
? operator_name_string (tmp
) : name
);
9668 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9669 ? "storage class specified for parameter `%s'"
9670 : "storage class specified for typename"), name
);
9671 RIDBIT_RESET (RID_REGISTER
, specbits
);
9672 RIDBIT_RESET (RID_AUTO
, specbits
);
9673 RIDBIT_RESET (RID_EXTERN
, specbits
);
9676 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9678 if (toplevel_bindings_p ())
9680 /* It's common practice (and completely valid) to have a const
9681 be initialized and declared extern. */
9682 if (!(type_quals
& TYPE_QUAL_CONST
))
9683 warning ("`%s' initialized and declared `extern'", name
);
9686 error ("`%s' has both `extern' and initializer", name
);
9688 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9689 && ! toplevel_bindings_p ())
9690 error ("nested function `%s' declared `extern'", name
);
9691 else if (toplevel_bindings_p ())
9693 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9694 error ("top-level declaration of `%s' specifies `auto'", name
);
9697 if (nclasses
> 0 && friendp
)
9698 error ("storage class specifiers invalid in friend function declarations");
9700 /* Now figure out the structure of the declarator proper.
9701 Descend through it, creating more complex types, until we reach
9702 the declared identifier (or NULL_TREE, in an absolute declarator). */
9704 inner_attrs
= NULL_TREE
;
9707 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9708 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9710 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9711 an INDIRECT_REF (for *...),
9712 a CALL_EXPR (for ...(...)),
9713 an identifier (for the name being declared)
9714 or a null pointer (for the place in an absolute declarator
9715 where the name was omitted).
9716 For the last two cases, we have just exited the loop.
9718 For C++ it could also be
9719 a SCOPE_REF (for class :: ...). In this case, we have converted
9720 sensible names to types, and those are the values we use to
9721 qualify the member name.
9722 an ADDR_EXPR (for &...),
9723 a BIT_NOT_EXPR (for destructors)
9725 At this point, TYPE is the type of elements of an array,
9726 or for a function to return, or for a pointer to point to.
9727 After this sequence of ifs, TYPE is the type of the
9728 array or function or pointer, and DECLARATOR has had its
9729 outermost layer removed. */
9731 if (type
== error_mark_node
)
9733 if (TREE_CODE (declarator
) == SCOPE_REF
)
9734 declarator
= TREE_OPERAND (declarator
, 1);
9736 declarator
= TREE_OPERAND (declarator
, 0);
9739 if (quals
!= NULL_TREE
9740 && (declarator
== NULL_TREE
9741 || TREE_CODE (declarator
) != SCOPE_REF
))
9743 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9744 ctype
= TYPE_METHOD_BASETYPE (type
);
9745 if (ctype
!= NULL_TREE
)
9747 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9748 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9749 type
= TREE_TYPE (dummy
);
9754 /* See the comment for the TREE_LIST case, below. */
9757 else if (inner_attrs
)
9759 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9760 inner_attrs
= NULL_TREE
;
9763 switch (TREE_CODE (declarator
))
9767 /* We encode a declarator with embedded attributes using
9768 a TREE_LIST. The attributes apply to the declarator
9769 directly inside them, so we have to skip an iteration
9770 before applying them to the type. If the declarator just
9771 inside is the declarator-id, we apply the attrs to the
9773 inner_attrs
= TREE_PURPOSE (declarator
);
9775 declarator
= TREE_VALUE (declarator
);
9781 register tree itype
= NULL_TREE
;
9782 register tree size
= TREE_OPERAND (declarator
, 1);
9783 /* The index is a signed object `sizetype' bits wide. */
9784 tree index_type
= signed_type (sizetype
);
9786 declarator
= TREE_OPERAND (declarator
, 0);
9788 /* Check for some types that there cannot be arrays of. */
9790 if (TREE_CODE (type
) == VOID_TYPE
)
9792 cp_error ("declaration of `%D' as array of voids", dname
);
9793 type
= error_mark_node
;
9796 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9798 cp_error ("declaration of `%D' as array of functions", dname
);
9799 type
= error_mark_node
;
9802 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9803 you can't have arrays of references. If we allowed them,
9804 then we'd be saying x[i] is valid for an array x, but
9805 then you'd have to ask: what does `*(x + i)' mean? */
9806 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9808 if (decl_context
== TYPENAME
)
9809 cp_error ("cannot make arrays of references");
9811 cp_error ("declaration of `%D' as array of references",
9813 type
= error_mark_node
;
9816 if (TREE_CODE (type
) == OFFSET_TYPE
)
9818 cp_error ("declaration of `%D' as array of data members",
9820 type
= error_mark_node
;
9823 if (TREE_CODE (type
) == METHOD_TYPE
)
9825 cp_error ("declaration of `%D' as array of function members",
9827 type
= error_mark_node
;
9830 if (size
== error_mark_node
)
9831 type
= error_mark_node
;
9832 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9836 the constant expressions that specify the bounds of
9837 the arrays can be omitted only for the first member
9839 cp_error ("declaration of `%D' as multidimensional array",
9841 cp_error ("must have bounds for all dimensions except the first");
9842 type
= error_mark_node
;
9845 if (type
== error_mark_node
)
9848 /* VC++ spells a zero-sized array with []. */
9849 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9850 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9851 size
= integer_zero_node
;
9855 /* Must suspend_momentary here because the index
9856 type may need to live until the end of the function.
9857 For example, it is used in the declaration of a
9858 variable which requires destructing at the end of
9859 the function; then build_vec_delete will need this
9861 int yes
= suspend_momentary ();
9862 /* Might be a cast. */
9863 if (TREE_CODE (size
) == NOP_EXPR
9864 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9865 size
= TREE_OPERAND (size
, 0);
9866 if (TREE_READONLY_DECL_P (size
))
9867 size
= decl_constant_value (size
);
9869 /* If this involves a template parameter, it will be a
9870 constant at instantiation time, but we don't know
9871 what the value is yet. Even if no template
9872 parameters are involved, we may an expression that
9873 is not a constant; we don't even simplify `1 + 2'
9874 when processing a template. */
9875 if (processing_template_decl
)
9877 /* Resolve a qualified reference to an enumerator or
9878 static const data member of ours. */
9879 if (TREE_CODE (size
) == SCOPE_REF
9880 && TREE_OPERAND (size
, 0) == current_class_type
)
9882 tree t
= lookup_field (current_class_type
,
9883 TREE_OPERAND (size
, 1), 0, 0);
9888 itype
= build_index_type (build_min
9889 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
9890 goto dont_grok_size
;
9893 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9894 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9895 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9897 cp_error ("size of array `%D' has non-integer type",
9899 size
= integer_one_node
;
9901 if (pedantic
&& !in_system_header
&& integer_zerop (size
))
9902 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9903 if (TREE_CONSTANT (size
))
9905 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9906 int old_pedantic
= pedantic
;
9907 pedantic
= flag_pedantic_errors
= 1;
9908 /* Always give overflow errors on array subscripts. */
9909 constant_expression_warning (size
);
9910 pedantic
= old_pedantic
;
9911 flag_pedantic_errors
= old_flag_pedantic_errors
;
9912 if (INT_CST_LT (size
, integer_zero_node
))
9914 cp_error ("size of array `%D' is negative", dname
);
9915 size
= integer_one_node
;
9923 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9926 cp_pedwarn ("ANSI C++ forbids variable-size array");
9931 = fold (build_binary_op (MINUS_EXPR
,
9932 cp_convert (index_type
, size
),
9933 cp_convert (index_type
,
9934 integer_one_node
)));
9935 if (! TREE_CONSTANT (itype
))
9936 itype
= variable_size (itype
);
9937 else if (TREE_OVERFLOW (itype
))
9939 error ("overflow in array dimension");
9940 TREE_OVERFLOW (itype
) = 0;
9943 itype
= build_index_type (itype
);
9946 resume_momentary (yes
);
9949 type
= build_cplus_array_type (type
, itype
);
9958 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9959 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9961 /* Declaring a function type.
9962 Make sure we have a valid type for the function to return. */
9964 /* We now know that the TYPE_QUALS don't apply to the
9965 decl, but to its return type. */
9966 type_quals
= TYPE_UNQUALIFIED
;
9968 /* Warn about some types functions can't return. */
9970 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9972 error ("`%s' declared as function returning a function", name
);
9973 type
= integer_type_node
;
9975 if (TREE_CODE (type
) == ARRAY_TYPE
)
9977 error ("`%s' declared as function returning an array", name
);
9978 type
= integer_type_node
;
9981 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9982 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9984 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9987 /* Pick up type qualifiers which should be applied to `this'. */
9988 quals
= CALL_DECLARATOR_QUALS (declarator
);
9990 /* Pick up the exception specifications. */
9991 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
9993 /* Say it's a definition only for the CALL_EXPR
9994 closest to the identifier. */
9997 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9998 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9999 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10001 if (ctype
== NULL_TREE
10002 && decl_context
== FIELD
10004 && (friendp
== 0 || dname
== current_class_name
))
10005 ctype
= current_class_type
;
10007 if (ctype
&& return_type
== return_conversion
)
10008 TYPE_HAS_CONVERSION (ctype
) = 1;
10009 if (ctype
&& constructor_name (ctype
) == dname
)
10011 /* We are within a class's scope. If our declarator name
10012 is the same as the class name, and we are defining
10013 a function, then it is a constructor/destructor, and
10014 therefore returns a void type. */
10016 if (flags
== DTOR_FLAG
)
10018 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10019 not be declared const or volatile. A destructor
10020 may not be static. */
10022 error ("destructor cannot be static member function");
10025 cp_error ("destructors may not be `%s'",
10026 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10029 if (decl_context
== FIELD
)
10031 if (! member_function_or_else (ctype
, current_class_type
,
10032 "destructor for alien class `%s' cannot be a member"))
10033 return void_type_node
;
10036 else /* It's a constructor. */
10038 if (explicitp
== 1)
10040 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10041 not be declared const or volatile. A constructor may
10042 not be virtual. A constructor may not be static. */
10044 error ("constructor cannot be static member function");
10047 pedwarn ("constructors cannot be declared virtual");
10052 cp_error ("constructors may not be `%s'",
10053 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10057 RID_BIT_TYPE tmp_bits
;
10058 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10059 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10060 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10061 if (RIDBIT_ANY_SET (tmp_bits
))
10062 error ("return value type specifier for constructor ignored");
10064 type
= build_pointer_type (ctype
);
10065 if (decl_context
== FIELD
)
10067 if (! member_function_or_else (ctype
, current_class_type
,
10068 "constructor for alien class `%s' cannot be member"))
10069 return void_type_node
;
10070 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10071 if (return_type
!= return_ctor
)
10075 if (decl_context
== FIELD
)
10081 error ("can't initialize friend function `%s'", name
);
10084 /* Cannot be both friend and virtual. */
10085 error ("virtual functions cannot be friends");
10086 RIDBIT_RESET (RID_FRIEND
, specbits
);
10089 if (decl_context
== NORMAL
)
10090 error ("friend declaration not in class definition");
10091 if (current_function_decl
&& funcdef_flag
)
10092 cp_error ("can't define friend function `%s' in a local class definition",
10096 /* Construct the function type and go to the next
10097 inner layer of declarator. */
10099 declarator
= TREE_OPERAND (declarator
, 0);
10101 /* FIXME: This is where default args should be fully
10104 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10106 if (declarator
&& flags
== DTOR_FLAG
)
10108 /* A destructor declared in the body of a class will
10109 be represented as a BIT_NOT_EXPR. But, we just
10110 want the underlying IDENTIFIER. */
10111 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10112 declarator
= TREE_OPERAND (declarator
, 0);
10114 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10115 arg_types
= void_list_node
;
10116 else if (arg_types
== NULL_TREE
10117 || arg_types
!= void_list_node
)
10119 cp_error ("destructors may not have parameters");
10120 arg_types
= void_list_node
;
10121 last_function_parms
= NULL_TREE
;
10125 /* ANSI says that `const int foo ();'
10126 does not make the function foo const. */
10127 type
= build_function_type (type
, arg_types
);
10131 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10132 if (TREE_PURPOSE (t
)
10133 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10135 add_defarg_fn (type
);
10144 /* Filter out pointers-to-references and references-to-references.
10145 We can get these if a TYPE_DECL is used. */
10147 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10149 error ("cannot declare %s to references",
10150 TREE_CODE (declarator
) == ADDR_EXPR
10151 ? "references" : "pointers");
10152 declarator
= TREE_OPERAND (declarator
, 0);
10156 if (TREE_CODE (type
) == OFFSET_TYPE
10157 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10158 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10160 cp_error ("cannot declare pointer to `%#T' member",
10162 type
= TREE_TYPE (type
);
10165 /* Merge any constancy or volatility into the target type
10166 for the pointer. */
10168 /* We now know that the TYPE_QUALS don't apply to the decl,
10169 but to the target of the pointer. */
10170 type_quals
= TYPE_UNQUALIFIED
;
10172 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10174 if (TREE_CODE (type
) == VOID_TYPE
)
10175 error ("invalid type: `void &'");
10177 type
= build_reference_type (type
);
10179 else if (TREE_CODE (type
) == METHOD_TYPE
)
10180 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10182 type
= build_pointer_type (type
);
10184 /* Process a list of type modifier keywords (such as
10185 const or volatile) that were given inside the `*' or `&'. */
10187 if (TREE_TYPE (declarator
))
10189 register tree typemodlist
;
10195 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10196 typemodlist
= TREE_CHAIN (typemodlist
))
10198 tree qualifier
= TREE_VALUE (typemodlist
);
10200 if (qualifier
== ridpointers
[(int) RID_CONST
])
10202 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10204 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10209 error ("invalid type modifier within pointer declarator");
10213 pedwarn ("duplicate `const'");
10215 pedwarn ("duplicate `volatile'");
10217 pedwarn ("duplicate `restrict'");
10219 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10220 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10221 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10222 if (TREE_CODE (declarator
) == ADDR_EXPR
10223 && (constp
|| volatilep
))
10226 pedwarn ("discarding `const' applied to a reference");
10228 pedwarn ("discarding `volatile' applied to a reference");
10229 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10231 type
= cp_build_qualified_type (type
, type_quals
);
10233 declarator
= TREE_OPERAND (declarator
, 0);
10239 /* We have converted type names to NULL_TREE if the
10240 name was bogus, or to a _TYPE node, if not.
10242 The variable CTYPE holds the type we will ultimately
10243 resolve to. The code here just needs to build
10244 up appropriate member types. */
10245 tree sname
= TREE_OPERAND (declarator
, 1);
10248 /* Destructors can have their visibilities changed as well. */
10249 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10250 sname
= TREE_OPERAND (sname
, 0);
10252 if (TREE_COMPLEXITY (declarator
) == 0)
10253 /* This needs to be here, in case we are called
10254 multiple times. */ ;
10255 else if (TREE_COMPLEXITY (declarator
) == -1)
10256 /* Namespace member. */
10257 pop_decl_namespace ();
10258 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10259 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10260 else if (! IS_AGGR_TYPE_CODE
10261 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10263 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10265 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10266 that refer to ctype. They couldn't be resolved earlier
10267 because we hadn't pushed into the class yet.
10268 Example: resolve 'B<T>::type' in
10269 'B<typename B<T>::type> B<T>::f () { }'. */
10270 if (current_template_parms
10271 && uses_template_parms (type
)
10272 && uses_template_parms (current_class_type
))
10274 tree args
= current_template_args ();
10275 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10278 /* This pop_nested_class corresponds to the
10279 push_nested_class used to push into class scope for
10280 parsing the argument list of a function decl, in
10282 pop_nested_class ();
10283 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10286 my_friendly_abort (16);
10288 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10290 /* We had a reference to a global decl, or
10291 perhaps we were given a non-aggregate typedef,
10292 in which case we cleared this out, and should just
10293 keep going as though it wasn't there. */
10294 declarator
= sname
;
10297 ctype
= TREE_OPERAND (declarator
, 0);
10300 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10302 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10303 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10304 template_count
+= 1;
10305 t
= TYPE_MAIN_DECL (t
);
10306 if (DECL_LANG_SPECIFIC (t
))
10307 t
= DECL_CLASS_CONTEXT (t
);
10312 if (sname
== NULL_TREE
)
10315 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10317 /* This is the `standard' use of the scoping operator:
10318 basetype :: member . */
10320 if (ctype
== current_class_type
)
10326 Is this ill-formed? */
10329 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10332 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10334 if (current_class_type
== NULL_TREE
10336 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10337 TYPE_ARG_TYPES (type
));
10340 cp_error ("cannot declare member function `%T::%s' within `%T'",
10341 ctype
, name
, current_class_type
);
10342 return void_type_node
;
10345 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10346 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10348 /* Have to move this code elsewhere in this function.
10349 this code is used for i.e., typedef int A::M; M *pm;
10351 It is? How? jason 10/2/94 */
10353 if (current_class_type
)
10355 cp_error ("cannot declare member `%T::%s' within `%T'",
10356 ctype
, name
, current_class_type
);
10357 return void_type_node
;
10359 type
= build_offset_type (ctype
, type
);
10361 else if (uses_template_parms (ctype
))
10363 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10365 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10366 TYPE_ARG_TYPES (type
));
10370 cp_error ("structure `%T' not yet defined", ctype
);
10371 return error_mark_node
;
10374 declarator
= sname
;
10376 else if (TREE_CODE (sname
) == SCOPE_REF
)
10377 my_friendly_abort (17);
10381 declarator
= TREE_OPERAND (declarator
, 1);
10382 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10383 /* In this case, we will deal with it later. */
10387 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10388 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10389 TYPE_ARG_TYPES (type
));
10391 type
= build_offset_type (ctype
, type
);
10398 declarator
= TREE_OPERAND (declarator
, 0);
10403 case ENUMERAL_TYPE
:
10404 declarator
= NULL_TREE
;
10408 declarator
= NULL_TREE
;
10412 my_friendly_abort (158);
10416 /* See the comment for the TREE_LIST case, above. */
10419 if (! ignore_attrs
)
10420 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10422 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10424 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10427 /* Now TYPE has the actual type. */
10429 if (explicitp
== 1 || (explicitp
&& friendp
))
10431 /* [dcl.fct.spec] The explicit specifier shall only be used in
10432 declarations of constructors within a class definition. */
10433 error ("only declarations of constructors can be `explicit'");
10437 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10439 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10441 error ("non-member `%s' cannot be declared `mutable'", name
);
10442 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10444 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10446 error ("non-object member `%s' cannot be declared `mutable'", name
);
10447 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10449 else if (TREE_CODE (type
) == FUNCTION_TYPE
10450 || TREE_CODE (type
) == METHOD_TYPE
)
10452 error ("function `%s' cannot be declared `mutable'", name
);
10453 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10457 error ("static `%s' cannot be declared `mutable'", name
);
10458 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10460 else if (type_quals
& TYPE_QUAL_CONST
)
10462 error ("const `%s' cannot be declared `mutable'", name
);
10463 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10467 if (declarator
== NULL_TREE
10468 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10469 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10470 && (TREE_CODE (type
) == FUNCTION_TYPE
10471 || TREE_CODE (type
) == METHOD_TYPE
)))
10473 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10475 cp_error ("template-id `%D' used as a declarator", declarator
);
10476 declarator
= dname
;
10479 /* Unexpected declarator format. */
10480 my_friendly_abort (990210);
10482 /* If this is declaring a typedef name, return a TYPE_DECL. */
10484 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10488 /* Note that the grammar rejects storage classes
10489 in typenames, fields or parameters. */
10490 if (current_lang_name
== lang_name_java
)
10491 TYPE_FOR_JAVA (type
) = 1;
10493 if (decl_context
== FIELD
)
10495 if (declarator
== constructor_name (current_class_type
))
10496 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10498 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10502 /* Make sure this typedef lives as long as its type,
10503 since it might be used as a template parameter. */
10504 if (type
!= error_mark_node
)
10505 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10506 if (processing_template_decl
)
10507 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10509 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10510 if (type
!= error_mark_node
)
10514 /* If the user declares "typedef struct {...} foo" then the
10515 struct will have an anonymous name. Fill that name in now.
10516 Nothing can refer to it, so nothing needs know about the name
10518 if (type
!= error_mark_node
10519 && TYPE_NAME (type
)
10520 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10521 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10522 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10524 tree oldname
= TYPE_NAME (type
);
10527 /* Replace the anonymous name with the real name everywhere. */
10528 lookup_tag_reverse (type
, declarator
);
10529 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10530 if (TYPE_NAME (t
) == oldname
)
10531 TYPE_NAME (t
) = decl
;
10533 if (TYPE_LANG_SPECIFIC (type
))
10534 TYPE_WAS_ANONYMOUS (type
) = 1;
10536 /* If this is a typedef within a template class, the nested
10537 type is a (non-primary) template. The name for the
10538 template needs updating as well. */
10539 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10540 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10541 = TYPE_IDENTIFIER (type
);
10543 /* XXX Temporarily set the scope.
10544 When returning, start_decl expects it as NULL_TREE,
10545 and will then then set it using pushdecl. */
10546 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10547 if (current_class_type
)
10548 DECL_CONTEXT (decl
) = current_class_type
;
10550 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10552 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10553 DECL_ASSEMBLER_NAME (decl
)
10554 = get_identifier (build_overload_name (type
, 1, 1));
10555 DECL_CONTEXT (decl
) = NULL_TREE
;
10557 /* FIXME remangle member functions; member functions of a
10558 type with external linkage have external linkage. */
10561 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10563 cp_error_at ("typedef name may not be class-qualified", decl
);
10568 if (ctype
== NULL_TREE
)
10570 if (TREE_CODE (type
) != METHOD_TYPE
)
10571 cp_error_at ("invalid type qualifier for non-method type", decl
);
10573 ctype
= TYPE_METHOD_BASETYPE (type
);
10575 if (ctype
!= NULL_TREE
)
10576 grok_method_quals (ctype
, decl
, quals
);
10579 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10580 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10581 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10583 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10584 inlinep
, friendp
, raises
!= NULL_TREE
);
10587 error ("typedef declaration includes an initializer");
10592 /* Detect the case of an array type of unspecified size
10593 which came, as such, direct from a typedef name.
10594 We must copy the type, so that each identifier gets
10595 a distinct type, so that each identifier's size can be
10596 controlled separately by its own initializer. */
10598 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10599 && TYPE_DOMAIN (type
) == NULL_TREE
)
10601 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10604 /* If this is a type name (such as, in a cast or sizeof),
10605 compute the type and return it now. */
10607 if (decl_context
== TYPENAME
)
10609 /* Note that the grammar rejects storage classes
10610 in typenames, fields or parameters. */
10611 if (type_quals
!= TYPE_UNQUALIFIED
)
10612 type_quals
= TYPE_UNQUALIFIED
;
10614 /* Special case: "friend class foo" looks like a TYPENAME context. */
10617 if (type_quals
!= TYPE_UNQUALIFIED
)
10619 cp_error ("type qualifiers specified for friend class declaration");
10620 type_quals
= TYPE_UNQUALIFIED
;
10624 cp_error ("`inline' specified for friend class declaration");
10628 /* Only try to do this stuff if we didn't already give up. */
10629 if (type
!= integer_type_node
)
10631 /* A friendly class? */
10632 if (current_class_type
)
10633 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10635 error ("trying to make class `%s' a friend of global scope",
10636 TYPE_NAME_STRING (type
));
10637 type
= void_type_node
;
10642 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10643 if (ctype
== NULL_TREE
)
10645 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10646 ctype
= TYPE_METHOD_BASETYPE (type
);
10648 grok_method_quals (ctype
, dummy
, quals
);
10649 type
= TREE_TYPE (dummy
);
10654 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10655 && decl_context
!= CATCHPARM
10656 && TREE_CODE (type
) != UNION_TYPE
10659 cp_error ("abstract declarator `%T' used as declaration", type
);
10660 declarator
= make_anon_name ();
10663 /* `void' at top level (not within pointer)
10664 is allowed only in typedefs or type names.
10665 We don't complain about parms either, but that is because
10666 a better error message can be made later. */
10668 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10671 error ("unnamed variable or field declared void");
10672 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10674 if (IDENTIFIER_OPNAME_P (declarator
))
10675 my_friendly_abort (356);
10677 error ("variable or field `%s' declared void", name
);
10680 error ("variable or field declared void");
10681 type
= integer_type_node
;
10684 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10685 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10687 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10689 if (ctype
|| in_namespace
)
10690 error ("cannot use `::' in parameter declaration");
10692 /* A parameter declared as an array of T is really a pointer to T.
10693 One declared as a function is really a pointer to a function.
10694 One declared as a member is really a pointer to member. */
10696 if (TREE_CODE (type
) == ARRAY_TYPE
)
10698 /* Transfer const-ness of array into that of type pointed to. */
10699 type
= build_pointer_type (TREE_TYPE (type
));
10700 type_quals
= TYPE_UNQUALIFIED
;
10702 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10703 type
= build_pointer_type (type
);
10704 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10705 type
= build_pointer_type (type
);
10706 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10708 error ("declaration of `%s' as void", name
);
10714 register tree decl
;
10716 if (decl_context
== PARM
)
10718 decl
= build_decl (PARM_DECL
, declarator
, type
);
10720 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10721 inlinep
, friendp
, raises
!= NULL_TREE
);
10723 /* Compute the type actually passed in the parmlist,
10724 for the case where there is no prototype.
10725 (For example, shorts and chars are passed as ints.)
10726 When there is a prototype, this is overridden later. */
10728 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10730 else if (decl_context
== FIELD
)
10732 if (type
== error_mark_node
)
10734 /* Happens when declaring arrays of sizes which
10735 are error_mark_node, for example. */
10738 else if (in_namespace
&& !friendp
)
10740 /* Something like struct S { int N::j; }; */
10741 cp_error ("invalid use of `::'");
10744 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10747 tree function_context
;
10749 /* We catch the others as conflicts with the builtin
10751 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10753 cp_error ("function `%D' cannot be declared friend",
10760 if (ctype
== NULL_TREE
)
10761 ctype
= current_class_type
;
10763 if (ctype
== NULL_TREE
)
10765 cp_error ("can't make `%D' into a method -- not in a class",
10767 return void_type_node
;
10770 /* ``A union may [ ... ] not [ have ] virtual functions.''
10772 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10774 cp_error ("function `%D' declared virtual inside a union",
10776 return void_type_node
;
10779 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10780 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10781 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10782 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10786 cp_error ("`%D' cannot be declared virtual, since it is always static",
10791 else if (staticp
< 2)
10792 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10793 TYPE_ARG_TYPES (type
));
10796 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10797 function_context
= (ctype
!= NULL_TREE
) ?
10798 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10799 publicp
= (! friendp
|| ! staticp
)
10800 && function_context
== NULL_TREE
;
10801 decl
= grokfndecl (ctype
, type
,
10802 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10803 ? declarator
: dname
,
10805 virtualp
, flags
, quals
, raises
,
10806 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10807 funcdef_flag
, template_count
, in_namespace
);
10808 if (decl
== NULL_TREE
)
10811 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10812 /* The decl and setting of decl_machine_attr is also turned off. */
10813 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10816 /* [class.conv.ctor]
10818 A constructor declared without the function-specifier
10819 explicit that can be called with a single parameter
10820 specifies a conversion from the type of its first
10821 parameter to the type of its class. Such a constructor
10822 is called a converting constructor. */
10823 if (explicitp
== 2)
10824 DECL_NONCONVERTING_P (decl
) = 1;
10825 else if (DECL_CONSTRUCTOR_P (decl
))
10827 /* The constructor can be called with exactly one
10828 parameter if there is at least one parameter, and
10829 any subsequent parameters have default arguments.
10830 We don't look at the first parameter, which is
10831 really just the `this' parameter for the new
10834 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10836 /* Skip the `in_chrg' argument too, if present. */
10837 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10838 arg_types
= TREE_CHAIN (arg_types
);
10840 if (arg_types
== void_list_node
10842 && TREE_CHAIN (arg_types
)
10843 && TREE_CHAIN (arg_types
) != void_list_node
10844 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10845 DECL_NONCONVERTING_P (decl
) = 1;
10848 else if (TREE_CODE (type
) == METHOD_TYPE
)
10850 /* We only get here for friend declarations of
10851 members of other classes. */
10852 /* All method decls are public, so tell grokfndecl to set
10853 TREE_PUBLIC, also. */
10854 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10855 virtualp
, flags
, quals
, raises
,
10856 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10857 template_count
, in_namespace
);
10858 if (decl
== NULL_TREE
)
10861 else if (!staticp
&& ! processing_template_decl
10862 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10863 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10866 cp_error ("field `%D' has incomplete type", declarator
);
10868 cp_error ("name `%T' has incomplete type", type
);
10870 /* If we're instantiating a template, tell them which
10871 instantiation made the field's type be incomplete. */
10872 if (current_class_type
10873 && TYPE_NAME (current_class_type
)
10874 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10875 && declspecs
&& TREE_VALUE (declspecs
)
10876 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10877 cp_error (" in instantiation of template `%T'",
10878 current_class_type
);
10880 type
= error_mark_node
;
10887 error ("`%s' is neither function nor method; cannot be declared friend",
10888 IDENTIFIER_POINTER (declarator
));
10896 /* Friends are treated specially. */
10897 if (ctype
== current_class_type
)
10898 warning ("member functions are implicitly friends of their class");
10901 tree t
= NULL_TREE
;
10902 if (decl
&& DECL_NAME (decl
))
10904 if (template_class_depth (current_class_type
) == 0)
10907 = check_explicit_specialization
10909 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10910 if (decl
== error_mark_node
)
10911 return error_mark_node
;
10914 t
= do_friend (ctype
, declarator
, decl
,
10915 last_function_parms
, attrlist
, flags
, quals
,
10918 if (t
&& funcdef_flag
)
10921 return void_type_node
;
10925 /* Structure field. It may not be a function, except for C++ */
10927 if (decl
== NULL_TREE
)
10933 /* An attempt is being made to initialize a non-static
10934 member. But, from [class.mem]:
10936 4 A member-declarator can contain a
10937 constant-initializer only if it declares a static
10938 member (_class.static_) of integral or enumeration
10939 type, see _class.static.data_.
10941 This used to be relatively common practice, but
10942 the rest of the compiler does not correctly
10943 handle the initialization unless the member is
10944 static so we make it static below. */
10945 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10947 cp_pedwarn ("making `%D' static", declarator
);
10951 if (uses_template_parms (type
))
10952 /* We'll check at instantiation time. */
10954 else if (check_static_variable_definition (declarator
,
10956 /* If we just return the declaration, crashes
10957 will sometimes occur. We therefore return
10958 void_type_node, as if this was a friend
10959 declaration, to cause callers to completely
10960 ignore this declaration. */
10961 return void_type_node
;
10964 /* 9.2p13 [class.mem] */
10965 if (declarator
== constructor_name (current_class_type
)
10966 /* Divergence from the standard: In extern "C", we
10967 allow non-static data members here, because C does
10968 and /usr/include/netinet/in.h uses that. */
10969 && (staticp
|| ! in_system_header
))
10970 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10975 /* C++ allows static class members. All other work
10976 for this is done by grokfield. */
10977 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10978 TREE_STATIC (decl
) = 1;
10979 /* In class context, 'static' means public access. */
10980 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10984 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10985 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10987 DECL_MUTABLE_P (decl
) = 1;
10988 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10992 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10993 inlinep
, friendp
, raises
!= NULL_TREE
);
10996 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10998 tree original_name
;
11004 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11005 original_name
= dname
;
11007 original_name
= declarator
;
11009 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11010 error ("storage class `auto' invalid for function `%s'", name
);
11011 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11012 error ("storage class `register' invalid for function `%s'", name
);
11014 /* Function declaration not at top level.
11015 Storage classes other than `extern' are not allowed
11016 and `extern' makes no difference. */
11017 if (! toplevel_bindings_p ()
11018 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11019 || RIDBIT_SETP (RID_INLINE
, specbits
))
11022 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11023 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11025 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11028 if (ctype
== NULL_TREE
)
11032 error ("virtual non-class function `%s'", name
);
11036 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11037 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11038 TYPE_ARG_TYPES (type
));
11040 /* Record presence of `static'. */
11041 publicp
= (ctype
!= NULL_TREE
11042 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11043 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11045 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11046 virtualp
, flags
, quals
, raises
,
11048 publicp
, inlinep
, funcdef_flag
,
11049 template_count
, in_namespace
);
11050 if (decl
== NULL_TREE
)
11055 int illegal_static
= 0;
11057 /* Don't allow a static member function in a class, and forbid
11058 declaring main to be static. */
11059 if (TREE_CODE (type
) == METHOD_TYPE
)
11061 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11062 illegal_static
= 1;
11064 else if (current_function_decl
)
11066 /* FIXME need arm citation */
11067 error ("cannot declare static function inside another function");
11068 illegal_static
= 1;
11071 if (illegal_static
)
11074 RIDBIT_RESET (RID_STATIC
, specbits
);
11080 /* It's a variable. */
11082 /* An uninitialized decl with `extern' is a reference. */
11083 decl
= grokvardecl (type
, declarator
, &specbits
,
11085 (type_quals
& TYPE_QUAL_CONST
) != 0,
11087 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11088 inlinep
, friendp
, raises
!= NULL_TREE
);
11092 DECL_CONTEXT (decl
) = ctype
;
11095 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11097 RIDBIT_RESET (RID_STATIC
, specbits
);
11099 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11101 cp_error ("static member `%D' declared `register'", decl
);
11102 RIDBIT_RESET (RID_REGISTER
, specbits
);
11104 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11106 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11108 RIDBIT_RESET (RID_EXTERN
, specbits
);
11113 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11115 /* Record `register' declaration for warnings on &
11116 and in case doing stupid register allocation. */
11118 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11119 DECL_REGISTER (decl
) = 1;
11121 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11122 DECL_THIS_EXTERN (decl
) = 1;
11124 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11125 DECL_THIS_STATIC (decl
) = 1;
11127 /* Record constancy and volatility. There's no need to do this
11128 when processing a template; we'll do this for the instantiated
11129 declaration based on the type of DECL. */
11130 if (!processing_template_decl
)
11131 c_apply_type_quals_to_decl (type_quals
, decl
);
11137 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11138 An empty exprlist is a parmlist. An exprlist which
11139 contains only identifiers at the global level
11140 is a parmlist. Otherwise, it is an exprlist. */
11143 parmlist_is_exprlist (exprs
)
11146 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11149 if (toplevel_bindings_p ())
11151 /* At the global level, if these are all identifiers,
11152 then it is a parmlist. */
11155 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11157 exprs
= TREE_CHAIN (exprs
);
11164 /* Subroutine of start_function. Ensure that each of the parameter
11165 types (as listed in PARMS) is complete, as is required for a
11166 function definition. */
11169 require_complete_types_for_parms (parms
)
11174 tree type
= TREE_TYPE (parms
);
11175 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11177 if (DECL_NAME (parms
))
11178 error ("parameter `%s' has incomplete type",
11179 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11181 error ("parameter has incomplete type");
11182 TREE_TYPE (parms
) = error_mark_node
;
11185 layout_decl (parms
, 0);
11187 parms
= TREE_CHAIN (parms
);
11191 /* Returns *TP if *TP is a local variable (or parameter). Returns
11192 NULL_TREE otherwise. */
11195 local_variable_p (tp
)
11200 if ((TREE_CODE (t
) == VAR_DECL
11201 /* A VAR_DECL with a context that is a _TYPE is a static data
11203 && !TYPE_P (CP_DECL_CONTEXT (t
))
11204 /* Any other non-local variable must be at namespace scope. */
11205 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11206 || (TREE_CODE (t
) == PARM_DECL
))
11212 /* Check that ARG, which is a default-argument expression for a
11213 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11214 something goes wrong. DECL may also be a _TYPE node, rather than a
11215 DECL, if there is no DECL available. */
11218 check_default_argument (decl
, arg
)
11225 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11226 /* We get a DEFAULT_ARG when looking at an in-class declaration
11227 with a default argument. Ignore the argument for now; we'll
11228 deal with it after the class is complete. */
11231 if (processing_template_decl
|| uses_template_parms (arg
))
11232 /* We don't do anything checking until instantiation-time. Note
11233 that there may be uninstantiated arguments even for an
11234 instantiated function, since default arguments are not
11235 instantiated until they are needed. */
11244 decl_type
= TREE_TYPE (decl
);
11246 if (arg
== error_mark_node
11247 || decl
== error_mark_node
11248 || TREE_TYPE (arg
) == error_mark_node
11249 || decl_type
== error_mark_node
)
11250 /* Something already went wrong. There's no need to check
11252 return error_mark_node
;
11254 /* [dcl.fct.default]
11256 A default argument expression is implicitly converted to the
11258 if (!TREE_TYPE (arg
)
11259 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11262 cp_error ("default argument for `%#D' has type `%T'",
11263 decl
, TREE_TYPE (arg
));
11265 cp_error ("default argument for parameter of type `%T' has type `%T'",
11266 decl_type
, TREE_TYPE (arg
));
11268 return error_mark_node
;
11271 /* [dcl.fct.default]
11273 Local variables shall not be used in default argument
11276 The keyword `this' shall not be used in a default argument of a
11277 member function. */
11278 var
= search_tree (&arg
, local_variable_p
);
11281 cp_error ("default argument `%E' uses local variable `%D'",
11283 return error_mark_node
;
11290 /* Decode the list of parameter types for a function type.
11291 Given the list of things declared inside the parens,
11292 return a list of types.
11294 The list we receive can have three kinds of elements:
11295 an IDENTIFIER_NODE for names given without types,
11296 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11297 or void_type_node, to mark the end of an argument list
11298 when additional arguments are not permitted (... was not used).
11300 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11301 a mere declaration. A nonempty identifier-list gets an error message
11302 when FUNCDEF_FLAG is zero.
11303 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11304 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11306 If all elements of the input list contain types,
11307 we return a list of the types.
11308 If all elements contain no type (except perhaps a void_type_node
11309 at the end), we return a null list.
11310 If some have types and some do not, it is an error, and we
11311 return a null list.
11313 Also set last_function_parms to either
11314 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11315 A list of names is converted to a chain of PARM_DECLs
11316 by store_parm_decls so that ultimately it is always a chain of decls.
11318 Note that in C++, parameters can take default values. These default
11319 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11320 an error to specify default values which are followed by parameters
11321 that have no default values, or an ELLIPSES. For simplicities sake,
11322 only parameters which are specified with their types can take on
11326 grokparms (first_parm
, funcdef_flag
)
11330 tree result
= NULL_TREE
;
11331 tree decls
= NULL_TREE
;
11333 if (first_parm
!= NULL_TREE
11334 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11336 if (! funcdef_flag
)
11337 pedwarn ("parameter names (without types) in function declaration");
11338 last_function_parms
= first_parm
;
11341 else if (first_parm
!= NULL_TREE
11342 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11343 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11344 my_friendly_abort (145);
11347 /* Types were specified. This is a list of declarators
11348 each represented as a TREE_LIST node. */
11349 register tree parm
, chain
;
11350 int any_init
= 0, any_error
= 0;
11352 if (first_parm
!= NULL_TREE
)
11354 tree last_result
= NULL_TREE
;
11355 tree last_decl
= NULL_TREE
;
11357 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11359 tree type
= NULL_TREE
, list_node
= parm
;
11360 register tree decl
= TREE_VALUE (parm
);
11361 tree init
= TREE_PURPOSE (parm
);
11363 chain
= TREE_CHAIN (parm
);
11364 /* @@ weak defense against parse errors. */
11365 if (TREE_CODE (decl
) != VOID_TYPE
11366 && TREE_CODE (decl
) != TREE_LIST
)
11368 /* Give various messages as the need arises. */
11369 if (TREE_CODE (decl
) == STRING_CST
)
11370 cp_error ("invalid string constant `%E'", decl
);
11371 else if (TREE_CODE (decl
) == INTEGER_CST
)
11372 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11376 if (TREE_CODE (decl
) != VOID_TYPE
)
11378 decl
= grokdeclarator (TREE_VALUE (decl
),
11379 TREE_PURPOSE (decl
),
11380 PARM
, init
!= NULL_TREE
,
11382 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11385 /* Top-level qualifiers on the parameters are
11386 ignored for function types. */
11387 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11389 if (TREE_CODE (type
) == VOID_TYPE
)
11390 decl
= void_type_node
;
11391 else if (TREE_CODE (type
) == METHOD_TYPE
)
11393 if (DECL_NAME (decl
))
11394 /* Cannot use the decl here because
11395 we don't have DECL_CONTEXT set up yet. */
11396 cp_error ("parameter `%D' invalidly declared method type",
11399 error ("parameter invalidly declared method type");
11400 type
= build_pointer_type (type
);
11401 TREE_TYPE (decl
) = type
;
11403 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11405 if (DECL_NAME (decl
))
11406 cp_error ("parameter `%D' invalidly declared offset type",
11409 error ("parameter invalidly declared offset type");
11410 type
= build_pointer_type (type
);
11411 TREE_TYPE (decl
) = type
;
11413 else if (abstract_virtuals_error (decl
, type
))
11414 any_error
= 1; /* Seems like a good idea. */
11415 else if (POINTER_TYPE_P (type
))
11418 while (POINTER_TYPE_P (t
)
11419 || (TREE_CODE (t
) == ARRAY_TYPE
11420 && TYPE_DOMAIN (t
) != NULL_TREE
))
11422 if (TREE_CODE (t
) == ARRAY_TYPE
)
11423 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11425 TYPE_PTR_P (type
) ? "pointer" : "reference");
11429 if (TREE_CODE (decl
) == VOID_TYPE
)
11431 if (result
== NULL_TREE
)
11433 result
= void_list_node
;
11434 last_result
= result
;
11438 TREE_CHAIN (last_result
) = void_list_node
;
11439 last_result
= void_list_node
;
11442 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11443 error ("`void' in parameter list must be entire list");
11447 /* Since there is a prototype, args are passed in their own types. */
11448 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11449 if (PROMOTE_PROTOTYPES
11450 && (TREE_CODE (type
) == INTEGER_TYPE
11451 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11452 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11453 DECL_ARG_TYPE (decl
) = integer_type_node
;
11454 if (!any_error
&& init
)
11457 init
= check_default_argument (decl
, init
);
11462 if (decls
== NULL_TREE
)
11469 TREE_CHAIN (last_decl
) = decl
;
11472 list_node
= tree_cons (init
, type
, NULL_TREE
);
11473 if (result
== NULL_TREE
)
11475 result
= list_node
;
11476 last_result
= result
;
11480 TREE_CHAIN (last_result
) = list_node
;
11481 last_result
= list_node
;
11485 TREE_CHAIN (last_result
) = NULL_TREE
;
11486 /* If there are no parameters, and the function does not end
11487 with `...', then last_decl will be NULL_TREE. */
11488 if (last_decl
!= NULL_TREE
)
11489 TREE_CHAIN (last_decl
) = NULL_TREE
;
11493 last_function_parms
= decls
;
11498 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11499 FUNCTION_TYPE with the newly parsed version of its default argument, which
11500 was previously digested as text. See snarf_defarg et al in lex.c. */
11503 replace_defarg (arg
, init
)
11506 if (! processing_template_decl
11507 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11508 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11509 TREE_TYPE (init
), TREE_VALUE (arg
));
11510 TREE_PURPOSE (arg
) = init
;
11517 tree t
= FUNCTION_ARG_CHAIN (d
);
11518 if (DECL_CONSTRUCTOR_P (d
)
11519 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11520 t
= TREE_CHAIN (t
);
11521 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11522 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11523 == DECL_CLASS_CONTEXT (d
))
11524 && (TREE_CHAIN (t
) == NULL_TREE
11525 || TREE_CHAIN (t
) == void_list_node
11526 || TREE_PURPOSE (TREE_CHAIN (t
))))
11531 /* These memoizing functions keep track of special properties which
11532 a class may have. `grok_ctor_properties' notices whether a class
11533 has a constructor of the form X(X&), and also complains
11534 if the class has a constructor of the form X(X).
11535 `grok_op_properties' takes notice of the various forms of
11536 operator= which are defined, as well as what sorts of type conversion
11537 may apply. Both functions take a FUNCTION_DECL as an argument. */
11540 grok_ctor_properties (ctype
, decl
)
11543 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11544 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11546 /* When a type has virtual baseclasses, a magical first int argument is
11547 added to any ctor so we can tell if the class has been initialized
11548 yet. This could screw things up in this function, so we deliberately
11549 ignore the leading int if we're in that situation. */
11550 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11552 my_friendly_assert (parmtypes
11553 && TREE_VALUE (parmtypes
) == integer_type_node
,
11555 parmtypes
= TREE_CHAIN (parmtypes
);
11556 parmtype
= TREE_VALUE (parmtypes
);
11561 A non-template constructor for class X is a copy constructor if
11562 its first parameter is of type X&, const X&, volatile X& or const
11563 volatile X&, and either there are no other parameters or else all
11564 other parameters have default arguments. */
11565 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11566 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11567 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11568 || TREE_CHAIN (parmtypes
) == void_list_node
11569 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11570 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11571 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11573 TYPE_HAS_INIT_REF (ctype
) = 1;
11574 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11575 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11579 A declaration of a constructor for a class X is ill-formed if its
11580 first parameter is of type (optionally cv-qualified) X and either
11581 there are no other parameters or else all other parameters have
11584 We *don't* complain about member template instantiations that
11585 have this form, though; they can occur as we try to decide what
11586 constructor to use during overload resolution. Since overload
11587 resolution will never prefer such a constructor to the
11588 non-template copy constructor (which is either explicitly or
11589 implicitly defined), there's no need to worry about their
11590 existence. Theoretically, they should never even be
11591 instantiated, but that's hard to forestall. */
11592 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11593 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11594 || TREE_CHAIN (parmtypes
) == void_list_node
11595 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11596 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11597 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11599 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11601 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11604 else if (TREE_CODE (parmtype
) == VOID_TYPE
11605 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11606 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11611 /* An operator with this name can be either unary or binary. */
11617 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11618 || name
== ansi_opname
[(int) ADDR_EXPR
]
11619 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11620 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11621 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11622 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11625 /* An operator with this name can only be unary. */
11631 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11632 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11633 || name
== ansi_opname
[(int) COMPONENT_REF
]
11634 || IDENTIFIER_TYPENAME_P (name
));
11637 /* Do a little sanity-checking on how they declared their operator. */
11640 grok_op_properties (decl
, virtualp
, friendp
)
11642 int virtualp
, friendp
;
11644 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11645 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11646 tree name
= DECL_NAME (decl
);
11648 if (current_class_type
== NULL_TREE
)
11655 A user-declared copy assignment operator X::operator= is a
11656 non-static non-template member function of class X with
11657 exactly one parameter of type X, X&, const X&, volatile X& or
11658 const volatile X&. */
11659 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11660 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11661 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11663 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11664 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11665 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11666 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11667 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11668 || name
== ansi_opname
[(int) MEMBER_REF
])
11669 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11670 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11671 TYPE_GETS_NEW (current_class_type
) |= 1;
11672 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11673 TYPE_GETS_DELETE (current_class_type
) |= 1;
11674 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11675 TYPE_GETS_NEW (current_class_type
) |= 2;
11676 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11677 TYPE_GETS_DELETE (current_class_type
) |= 2;
11680 if (name
== ansi_opname
[(int) NEW_EXPR
]
11681 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11683 /* When the compiler encounters the definition of A::operator new, it
11684 doesn't look at the class declaration to find out if it's static. */
11686 revert_static_member_fn (&decl
, NULL
, NULL
);
11688 /* Take care of function decl if we had syntax errors. */
11689 if (argtypes
== NULL_TREE
)
11691 = build_function_type (ptr_type_node
,
11692 hash_tree_chain (integer_type_node
,
11695 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11697 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11698 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11701 revert_static_member_fn (&decl
, NULL
, NULL
);
11703 if (argtypes
== NULL_TREE
)
11705 = build_function_type (void_type_node
,
11706 hash_tree_chain (ptr_type_node
,
11710 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11712 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11713 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11714 != void_list_node
))
11715 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11720 /* An operator function must either be a non-static member function
11721 or have at least one parameter of a class, a reference to a class,
11722 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11723 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11725 if (IDENTIFIER_TYPENAME_P (name
)
11726 || name
== ansi_opname
[(int) CALL_EXPR
]
11727 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11728 || name
== ansi_opname
[(int) COMPONENT_REF
]
11729 || name
== ansi_opname
[(int) ARRAY_REF
])
11730 cp_error ("`%D' must be a nonstatic member function", decl
);
11735 if (DECL_STATIC_FUNCTION_P (decl
))
11736 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11739 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11741 tree arg
= TREE_VALUE (p
);
11742 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11743 arg
= TREE_TYPE (arg
);
11745 /* This lets bad template code slip through. */
11746 if (IS_AGGR_TYPE (arg
)
11747 || TREE_CODE (arg
) == ENUMERAL_TYPE
11748 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11749 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11753 ("`%D' must have an argument of class or enumerated type",
11760 if (name
== ansi_opname
[(int) CALL_EXPR
])
11761 return; /* No restrictions on args. */
11763 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11765 tree t
= TREE_TYPE (name
);
11766 if (TREE_CODE (t
) == VOID_TYPE
)
11767 pedwarn ("void is not a valid type conversion operator");
11768 else if (! friendp
)
11770 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11771 const char *what
= 0;
11773 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11775 if (t
== current_class_type
)
11776 what
= "the same type";
11777 /* Don't force t to be complete here. */
11778 else if (IS_AGGR_TYPE (t
)
11780 && DERIVED_FROM_P (t
, current_class_type
))
11781 what
= "a base class";
11784 warning ("conversion to %s%s will never use a type conversion operator",
11785 ref
? "a reference to " : "", what
);
11789 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11793 if (list_length (argtypes
) != 3 && methodp
)
11795 cp_error ("`%D' must take exactly one argument", decl
);
11798 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11800 if (copy_assignment_arg_p (parmtype
, virtualp
)
11803 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11804 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11805 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11806 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11809 else if (name
== ansi_opname
[(int) COND_EXPR
])
11812 cp_error ("ANSI C++ prohibits overloading operator ?:");
11814 else if (ambi_op_p (name
))
11816 if (list_length (argtypes
) == 2)
11818 else if (list_length (argtypes
) == 3)
11820 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11821 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11822 && ! processing_template_decl
11823 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11826 cp_error ("postfix `%D' must take `int' as its argument",
11830 ("postfix `%D' must take `int' as its second argument",
11837 cp_error ("`%D' must take either zero or one argument", decl
);
11839 cp_error ("`%D' must take either one or two arguments", decl
);
11842 /* More Effective C++ rule 6. */
11844 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11845 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11847 tree arg
= TREE_VALUE (argtypes
);
11848 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11849 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11850 arg
= TREE_TYPE (arg
);
11851 arg
= TYPE_MAIN_VARIANT (arg
);
11852 if (list_length (argtypes
) == 2)
11854 if (TREE_CODE (ret
) != REFERENCE_TYPE
11855 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11857 cp_warning ("prefix `%D' should return `%T'", decl
,
11858 build_reference_type (arg
));
11862 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11863 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11867 else if (unary_op_p (name
))
11869 if (list_length (argtypes
) != 2)
11872 cp_error ("`%D' must take `void'", decl
);
11874 cp_error ("`%D' must take exactly one argument", decl
);
11877 else /* if (binary_op_p (name)) */
11879 if (list_length (argtypes
) != 3)
11882 cp_error ("`%D' must take exactly one argument", decl
);
11884 cp_error ("`%D' must take exactly two arguments", decl
);
11887 /* More Effective C++ rule 7. */
11889 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11890 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11891 || name
== ansi_opname
[COMPOUND_EXPR
]))
11892 cp_warning ("user-defined `%D' always evaluates both arguments",
11896 /* Effective C++ rule 23. */
11898 && list_length (argtypes
) == 3
11899 && (name
== ansi_opname
[PLUS_EXPR
]
11900 || name
== ansi_opname
[MINUS_EXPR
]
11901 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11902 || name
== ansi_opname
[MULT_EXPR
])
11903 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11904 cp_warning ("`%D' should return by value", decl
);
11908 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11909 if (TREE_PURPOSE (argtypes
))
11911 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11912 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11913 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11916 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11919 cp_error ("`%D' cannot have default arguments", decl
);
11924 static const char *
11926 enum tag_types code
;
11939 my_friendly_abort (981122);
11943 /* Get the struct, enum or union (CODE says which) with tag NAME.
11944 Define the tag as a forward-reference if it is not defined.
11946 C++: If a class derivation is given, process it here, and report
11947 an error if multiple derivation declarations are not identical.
11949 If this is a definition, come in through xref_tag and only look in
11950 the current frame for the name (since C++ allows new names in any
11954 xref_tag (code_type_node
, name
, globalize
)
11955 tree code_type_node
;
11959 enum tag_types tag_code
;
11960 enum tree_code code
;
11962 register tree ref
, t
;
11963 struct binding_level
*b
= current_binding_level
;
11965 tree attributes
= NULL_TREE
;
11966 tree context
= NULL_TREE
;
11968 /* If we are called from the parser, code_type_node will sometimes be a
11969 TREE_LIST. This indicates that the user wrote
11970 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11972 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11974 attributes
= TREE_PURPOSE (code_type_node
);
11975 code_type_node
= TREE_VALUE (code_type_node
);
11978 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11983 code
= RECORD_TYPE
;
11989 code
= ENUMERAL_TYPE
;
11992 my_friendly_abort (18);
11995 /* If a cross reference is requested, look up the type
11996 already defined for this tag and return it. */
11997 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
12000 name
= TYPE_IDENTIFIER (t
);
12004 t
= IDENTIFIER_TYPE_VALUE (name
);
12006 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12007 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12012 /* If we know we are defining this tag, only look it up in
12013 this scope and don't try to find it as a type. */
12014 ref
= lookup_tag (code
, name
, b
, 1);
12020 /* [dcl.type.elab] If the identifier resolves to a
12021 typedef-name or a template type-parameter, the
12022 elaborated-type-specifier is ill-formed. */
12023 if (t
!= TYPE_MAIN_VARIANT (t
)
12024 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12025 cp_pedwarn ("using typedef-name `%D' after `%s'",
12026 TYPE_NAME (t
), tag_name (tag_code
));
12027 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12028 cp_error ("using template type parameter `%T' after `%s'",
12029 t
, tag_name (tag_code
));
12034 ref
= lookup_tag (code
, name
, b
, 0);
12038 /* Try finding it as a type declaration. If that wins,
12040 ref
= lookup_name (name
, 1);
12042 if (ref
!= NULL_TREE
12043 && processing_template_decl
12044 && DECL_CLASS_TEMPLATE_P (ref
)
12045 && template_class_depth (current_class_type
) == 0)
12046 /* Since GLOBALIZE is true, we're declaring a global
12047 template, so we want this type. */
12048 ref
= DECL_RESULT (ref
);
12050 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12051 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12052 ref
= TREE_TYPE (ref
);
12057 if (ref
&& current_class_type
12058 && template_class_depth (current_class_type
)
12059 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12061 /* Since GLOBALIZE is non-zero, we are not looking at a
12062 definition of this tag. Since, in addition, we are currently
12063 processing a (member) template declaration of a template
12064 class, we must be very careful; consider:
12071 { template <class V>
12072 friend struct S1; };
12074 Here, the S2::S1 declaration should not be confused with the
12075 outer declaration. In particular, the inner version should
12076 have a template parameter of level 2, not level 1. This
12077 would be particularly important if the member declaration
12080 template <class V = U> friend struct S1;
12082 say, when we should tsubst into `U' when instantiating
12083 S2. On the other hand, when presented with:
12093 we must find the inner binding eventually. We
12094 accomplish this by making sure that the new type we
12095 create to represent this declaration has the right
12097 context
= TYPE_CONTEXT (ref
);
12102 push_obstacks_nochange ();
12106 /* If no such tag is yet defined, create a forward-reference node
12107 and record it as the "definition".
12108 When a real declaration of this type is found,
12109 the forward-reference will be altered into a real type. */
12111 /* In C++, since these migrate into the global scope, we must
12112 build them on the permanent obstack. */
12114 temp
= allocation_temporary_p ();
12116 end_temporary_allocation ();
12118 if (code
== ENUMERAL_TYPE
)
12120 cp_error ("use of enum `%#D' without previous declaration", name
);
12122 ref
= make_node (ENUMERAL_TYPE
);
12124 /* Give the type a default layout like unsigned int
12125 to avoid crashing if it does not get defined. */
12126 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12127 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12128 TREE_UNSIGNED (ref
) = 1;
12129 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12130 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12131 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12133 /* Enable us to recognize when a type is created in class context.
12134 To do nested classes correctly, this should probably be cleared
12135 out when we leave this classes scope. Currently this in only
12136 done in `start_enum'. */
12138 pushtag (name
, ref
, globalize
);
12142 struct binding_level
*old_b
= class_binding_level
;
12144 ref
= make_lang_type (code
);
12145 TYPE_CONTEXT (ref
) = context
;
12147 #ifdef NONNESTED_CLASSES
12148 /* Class types don't nest the way enums do. */
12149 class_binding_level
= (struct binding_level
*)0;
12151 pushtag (name
, ref
, globalize
);
12152 class_binding_level
= old_b
;
12157 /* If it no longer looks like a nested type, make sure it's
12159 If it is not an IDENTIFIER, this is not a declaration */
12160 if (b
->namespace_p
&& !class_binding_level
12161 && TREE_CODE (name
) == IDENTIFIER_NODE
12162 && IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12163 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12165 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12166 redeclare_class_template (ref
, current_template_parms
);
12169 /* Until the type is defined, tentatively accept whatever
12170 structure tag the user hands us. */
12171 if (TYPE_SIZE (ref
) == NULL_TREE
12172 && ref
!= current_class_type
12173 /* Have to check this, in case we have contradictory tag info. */
12174 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12176 if (tag_code
== class_type
)
12177 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12178 else if (tag_code
== record_type
)
12179 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12184 TREE_TYPE (ref
) = attributes
;
12190 xref_tag_from_type (old
, id
, globalize
)
12194 tree code_type_node
;
12196 if (TREE_CODE (old
) == RECORD_TYPE
)
12197 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12198 ? class_type_node
: record_type_node
);
12200 code_type_node
= union_type_node
;
12202 if (id
== NULL_TREE
)
12203 id
= TYPE_IDENTIFIER (old
);
12205 return xref_tag (code_type_node
, id
, globalize
);
12208 /* REF is a type (named NAME), for which we have just seen some
12209 baseclasses. BINFO is a list of those baseclasses; the
12210 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12211 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12212 struct, or union. */
12215 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12216 tree code_type_node
;
12220 /* In the declaration `A : X, Y, ... Z' we mark all the types
12221 (A, X, Y, ..., Z) so we can check for duplicates. */
12226 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12228 if (tag_code
== union_type
)
12230 cp_error ("derived union `%T' invalid", ref
);
12234 len
= list_length (binfo
);
12235 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12237 /* First, make sure that any templates in base-classes are
12238 instantiated. This ensures that if we call ourselves recursively
12239 we do not get confused about which classes are marked and which
12241 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12242 complete_type (TREE_VALUE (base
));
12244 SET_CLASSTYPE_MARKED (ref
);
12245 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12247 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12249 /* The base of a derived struct is public by default. */
12251 = (TREE_PURPOSE (binfo
) == access_public_node
12252 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12253 || (tag_code
!= class_type
12254 && (TREE_PURPOSE (binfo
) == access_default_node
12255 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12257 = (TREE_PURPOSE (binfo
) == access_protected_node
12258 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12260 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12261 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12262 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12263 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12264 tree basetype
= TREE_VALUE (binfo
);
12267 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12268 basetype
= TREE_TYPE (basetype
);
12270 || (TREE_CODE (basetype
) != RECORD_TYPE
12271 && TREE_CODE (basetype
) != TYPENAME_TYPE
12272 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12273 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12275 cp_error ("base type `%T' fails to be a struct or class type",
12276 TREE_VALUE (binfo
));
12280 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12282 /* This code replaces similar code in layout_basetypes.
12283 We put the complete_type first for implicit `typename'. */
12284 if (TYPE_SIZE (basetype
) == NULL_TREE
12285 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12287 cp_error ("base class `%T' has incomplete type", basetype
);
12292 if (CLASSTYPE_MARKED (basetype
))
12294 if (basetype
== ref
)
12295 cp_error ("recursive type `%T' undefined", basetype
);
12297 cp_error ("duplicate base type `%T' invalid", basetype
);
12301 if (TYPE_FOR_JAVA (basetype
)
12302 && (current_lang_stack
12303 == &VARRAY_TREE (current_lang_base
, 0)))
12304 TYPE_FOR_JAVA (ref
) = 1;
12306 /* Note that the BINFO records which describe individual
12307 inheritances are *not* shared in the lattice! They
12308 cannot be shared because a given baseclass may be
12309 inherited with different `accessibility' by different
12310 derived classes. (Each BINFO record describing an
12311 individual inheritance contains flags which say what
12312 the `accessibility' of that particular inheritance is.) */
12315 = make_binfo (integer_zero_node
, basetype
,
12316 CLASS_TYPE_P (basetype
)
12317 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12318 CLASS_TYPE_P (basetype
)
12319 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12321 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12322 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12323 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12324 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12325 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12327 /* We need to unshare the binfos now so that lookups during class
12328 definition work. */
12329 unshare_base_binfos (base_binfo
);
12331 SET_CLASSTYPE_MARKED (basetype
);
12333 /* We are free to modify these bits because they are meaningless
12334 at top level, and BASETYPE is a top-level type. */
12335 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12337 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12338 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12341 if (CLASS_TYPE_P (basetype
))
12343 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12344 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12351 TREE_VEC_LENGTH (binfos
) = i
;
12353 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12356 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12359 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12361 if (CLASS_TYPE_P (basetype
))
12362 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12363 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12366 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12367 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12369 /* Unmark all the types. */
12371 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12372 CLEAR_CLASSTYPE_MARKED (ref
);
12374 /* Now that we know all the base-classes, set up the list of virtual
12376 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12382 /* Begin compiling the definition of an enumeration type.
12383 NAME is its name (or null if anonymous).
12384 Returns the type object, as yet incomplete.
12385 Also records info about it so that build_enumerator
12386 may be used to declare the individual values as they are read. */
12392 register tree enumtype
= NULL_TREE
;
12393 struct binding_level
*b
= current_binding_level
;
12395 /* We are wasting space here and putting these on the permanent_obstack so
12396 that typeid(local enum) will work correctly. */
12397 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12399 /* If this is the real definition for a previous forward reference,
12400 fill in the contents in the same object that used to be the
12401 forward reference. */
12403 if (name
!= NULL_TREE
)
12404 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12406 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12408 cp_error ("multiple definition of `%#T'", enumtype
);
12409 cp_error_at ("previous definition here", enumtype
);
12413 enumtype
= make_node (ENUMERAL_TYPE
);
12414 pushtag (name
, enumtype
, 0);
12417 if (current_class_type
)
12418 TREE_ADDRESSABLE (b
->tags
) = 1;
12420 /* We don't copy this value because build_enumerator needs to do it. */
12421 enum_next_value
= integer_zero_node
;
12424 GNU_xref_decl (current_function_decl
, enumtype
);
12428 /* After processing and defining all the values of an enumeration type,
12429 install their decls in the enumeration type and finish it off.
12430 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12431 Returns ENUMTYPE. */
12434 finish_enum (enumtype
)
12437 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12438 /* Calculate the maximum value of any enumerator in this type. */
12440 tree values
= TYPE_VALUES (enumtype
);
12445 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12450 /* The TREE_VALUE is a CONST_DECL for this enumeration
12452 decl
= TREE_VALUE (pair
);
12454 /* The DECL_INITIAL will be NULL if we are processing a
12455 template declaration and this enumeration constant had no
12456 explicit initializer. */
12457 value
= DECL_INITIAL (decl
);
12458 if (value
&& !processing_template_decl
)
12460 /* Set the TREE_TYPE for the VALUE as well. That's so
12461 that when we call decl_constant_value we get an
12462 entity of the right type (but with the constant
12463 value). Since we shouldn't ever call
12464 decl_constant_value on a template type, there's no
12465 reason to do that when processing_template_decl.
12466 And, if the expression is something like a
12467 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12468 wreak havoc on the intended type of the expression.
12470 Of course, there's also no point in trying to compute
12471 minimum or maximum values if we're in a template. */
12472 TREE_TYPE (value
) = enumtype
;
12475 minnode
= maxnode
= value
;
12476 else if (tree_int_cst_lt (maxnode
, value
))
12478 else if (tree_int_cst_lt (value
, minnode
))
12482 if (processing_template_decl
)
12483 /* If this is just a template, leave the CONST_DECL
12484 alone. That way tsubst_copy will find CONST_DECLs for
12485 CONST_DECLs, and not INTEGER_CSTs. */
12488 /* In the list we're building up, we want the enumeration
12489 values, not the CONST_DECLs. */
12490 TREE_VALUE (pair
) = value
;
12494 maxnode
= minnode
= integer_zero_node
;
12496 TYPE_VALUES (enumtype
) = nreverse (values
);
12498 if (processing_template_decl
)
12500 tree scope
= current_scope ();
12501 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12502 add_tree (build_min (TAG_DEFN
, enumtype
));
12506 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12507 int lowprec
= min_precision (minnode
, unsignedp
);
12508 int highprec
= min_precision (maxnode
, unsignedp
);
12509 int precision
= MAX (lowprec
, highprec
);
12512 TYPE_SIZE (enumtype
) = NULL_TREE
;
12514 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12516 TYPE_PRECISION (enumtype
) = precision
;
12518 fixup_unsigned_type (enumtype
);
12520 fixup_signed_type (enumtype
);
12522 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12523 /* Use the width of the narrowest normal C type which is wide
12525 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12528 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12530 TYPE_SIZE (enumtype
) = 0;
12531 layout_type (enumtype
);
12533 /* Fix up all variant types of this enum type. */
12534 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12535 tem
= TYPE_NEXT_VARIANT (tem
))
12537 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12538 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12539 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12540 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12541 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12542 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12543 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12544 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12545 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12548 /* Finish debugging output for this type. */
12549 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12552 /* In start_enum we pushed obstacks. Here, we must pop them. */
12558 /* Build and install a CONST_DECL for an enumeration constant of the
12559 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12560 Assignment of sequential values by default is handled here. */
12563 build_enumerator (name
, value
, type
)
12571 /* Remove no-op casts from the value. */
12573 STRIP_TYPE_NOPS (value
);
12575 if (! processing_template_decl
)
12577 /* Validate and default VALUE. */
12578 if (value
!= NULL_TREE
)
12580 if (TREE_READONLY_DECL_P (value
))
12581 value
= decl_constant_value (value
);
12583 if (TREE_CODE (value
) == INTEGER_CST
)
12585 value
= default_conversion (value
);
12586 constant_expression_warning (value
);
12590 cp_error ("enumerator value for `%D' not integer constant", name
);
12595 /* Default based on previous value. */
12596 if (value
== NULL_TREE
&& ! processing_template_decl
)
12598 value
= enum_next_value
;
12600 cp_error ("overflow in enumeration values at `%D'", name
);
12603 /* Remove no-op casts from the value. */
12605 STRIP_TYPE_NOPS (value
);
12607 /* To fix MAX_VAL enum consts. (bkoz) */
12608 TREE_TYPE (value
) = integer_type_node
;
12612 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12613 Even in other cases, we will later (in finish_enum) be setting the
12615 if (value
!= NULL_TREE
)
12616 value
= copy_node (value
);
12618 /* C++ associates enums with global, function, or class declarations. */
12620 context
= current_scope ();
12621 if (context
&& context
== current_class_type
)
12622 /* This enum declaration is local to the class. */
12623 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12625 /* It's a global enum, or it's local to a function. (Note local to
12626 a function could mean local to a class method. */
12627 decl
= build_decl (CONST_DECL
, name
, type
);
12629 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12630 DECL_INITIAL (decl
) = value
;
12631 TREE_READONLY (decl
) = 1;
12633 if (context
&& context
== current_class_type
)
12634 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12635 on the TYPE_FIELDS list for `S'. (That's so that you can say
12636 things like `S::i' later.) */
12637 finish_member_declaration (decl
);
12641 GNU_xref_decl (current_function_decl
, decl
);
12644 if (! processing_template_decl
)
12646 /* Set basis for default for next value. */
12647 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12648 integer_one_node
, PLUS_EXPR
);
12649 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12652 result
= tree_cons (name
, decl
, NULL_TREE
);
12657 static int function_depth
;
12659 /* We're defining DECL. Make sure that it's type is OK. */
12662 check_function_type (decl
)
12665 tree fntype
= TREE_TYPE (decl
);
12667 /* In a function definition, arg types must be complete. */
12668 require_complete_types_for_parms (current_function_parms
);
12670 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12672 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12674 /* Make it return void instead, but don't change the
12675 type of the DECL_RESULT, in case we have a named return value. */
12676 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12678 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12680 = build_cplus_method_type (ctype
,
12682 FUNCTION_ARG_CHAIN (decl
));
12686 = build_function_type (void_type_node
,
12687 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12689 = build_exception_variant (fntype
,
12690 TYPE_RAISES_EXCEPTIONS (fntype
));
12693 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12696 /* Create the FUNCTION_DECL for a function definition.
12697 DECLSPECS and DECLARATOR are the parts of the declaration;
12698 they describe the function's name and the type it returns,
12699 but twisted together in a fashion that parallels the syntax of C.
12701 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12702 DECLARATOR is really the DECL for the function we are about to
12703 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12704 indicating that the function is an inline defined in-class, and
12705 SF_EXPAND indicating that we should generate RTL for this
12708 This function creates a binding context for the function body
12709 as well as setting up the FUNCTION_DECL in current_function_decl.
12711 Returns 1 on success. If the DECLARATOR is not suitable for a function
12712 (it defines a datum instead), we return 0, which tells
12713 yyparse to report a parse error.
12715 For C++, we must first check whether that datum makes any sense.
12716 For example, "class A local_a(1,2);" means that variable local_a
12717 is an aggregate of type A, which should have a constructor
12718 applied to it with the argument list [1, 2]. */
12721 start_function (declspecs
, declarator
, attrs
, flags
)
12722 tree declspecs
, declarator
, attrs
;
12726 tree ctype
= NULL_TREE
;
12729 extern int have_extern_spec
;
12730 extern int used_extern_spec
;
12731 int doing_friend
= 0;
12732 struct binding_level
*bl
;
12734 /* Sanity check. */
12735 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12736 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12738 /* This should only be done once on the top most decl. */
12739 if (have_extern_spec
&& !used_extern_spec
)
12741 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12742 used_extern_spec
= 1;
12745 if (flags
& SF_PRE_PARSED
)
12747 decl1
= declarator
;
12749 fntype
= TREE_TYPE (decl1
);
12750 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12751 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12753 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12754 class is in the (lexical) scope of the class in which it is
12756 if (!ctype
&& DECL_FRIEND_P (decl1
))
12758 ctype
= DECL_CLASS_CONTEXT (decl1
);
12760 /* CTYPE could be null here if we're dealing with a template;
12761 for example, `inline friend float foo()' inside a template
12762 will have no CTYPE set. */
12763 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12769 last_function_parms
= DECL_ARGUMENTS (decl1
);
12770 last_function_parm_tags
= NULL_TREE
;
12774 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12775 /* If the declarator is not suitable for a function definition,
12776 cause a syntax error. */
12777 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12779 fntype
= TREE_TYPE (decl1
);
12781 restype
= TREE_TYPE (fntype
);
12782 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12784 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12785 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12786 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12787 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12788 fntype
= build_function_type (integer_type_node
,
12789 TYPE_ARG_TYPES (fntype
));
12791 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12793 TYPE_ARG_TYPES (fntype
));
12794 TREE_TYPE (decl1
) = fntype
;
12797 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12798 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12799 else if (DECL_MAIN_P (decl1
))
12801 /* If this doesn't return integer_type, complain. */
12802 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12804 if (pedantic
|| warn_return_type
)
12805 pedwarn ("return type for `main' changed to `int'");
12806 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12811 /* Sometimes we don't notice that a function is a static member, and
12812 build a METHOD_TYPE for it. Fix that up now. */
12813 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
12814 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
12816 revert_static_member_fn (&decl1
, NULL
, NULL
);
12817 last_function_parms
= TREE_CHAIN (last_function_parms
);
12821 /* Warn if function was previously implicitly declared
12822 (but not if we warned then). */
12823 if (! warn_implicit
12824 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12825 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12827 /* Set up current_class_type, and enter the scope of the class, if
12830 push_nested_class (ctype
, 1);
12831 else if (DECL_STATIC_FUNCTION_P (decl1
))
12832 push_nested_class (DECL_CONTEXT (decl1
), 2);
12834 /* Now that we have entered the scope of the class, we must restore
12835 the bindings for any template parameters surrounding DECL1, if it
12836 is an inline member template. (Order is important; consider the
12837 case where a template parameter has the same name as a field of
12838 the class.) It is not until after this point that
12839 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12840 if (flags
& SF_INCLASS_INLINE
)
12841 maybe_begin_member_template_processing (decl1
);
12843 /* Effective C++ rule 15. See also c_expand_return. */
12845 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12846 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12847 cp_warning ("`operator=' should return a reference to `*this'");
12849 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12850 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12851 if (!DECL_INITIAL (decl1
))
12852 DECL_INITIAL (decl1
) = error_mark_node
;
12854 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12855 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12858 /* This function exists in static storage.
12859 (This does not mean `static' in the C sense!) */
12860 TREE_STATIC (decl1
) = 1;
12862 /* We must call push_template_decl after current_class_type is set
12863 up. (If we are processing inline definitions after exiting a
12864 class scope, current_class_type will be NULL_TREE until set above
12865 by push_nested_class.) */
12866 if (processing_template_decl
)
12867 decl1
= push_template_decl (decl1
);
12869 /* We are now in the scope of the function being defined. */
12870 current_function_decl
= decl1
;
12872 /* Save the parm names or decls from this function's declarator
12873 where store_parm_decls will find them. */
12874 current_function_parms
= last_function_parms
;
12875 current_function_parm_tags
= last_function_parm_tags
;
12877 /* Make sure the parameter and return types are reasonable. When
12878 you declare a function, these types can be incomplete, but they
12879 must be complete when you define the function. */
12880 if (! processing_template_decl
)
12881 check_function_type (decl1
);
12883 /* Build the return declaration for the function. */
12884 restype
= TREE_TYPE (fntype
);
12885 if (!processing_template_decl
)
12887 if (!DECL_RESULT (decl1
))
12889 DECL_RESULT (decl1
)
12890 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12891 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12892 DECL_RESULT (decl1
));
12896 /* Just use `void'. Nobody will ever look at this anyhow. */
12897 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12899 /* Initialize RTL machinery. We cannot do this until
12900 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12901 even when processing a template; this is how we get
12902 CURRENT_FUNCTION set up, and our per-function variables
12904 bl
= current_binding_level
;
12905 init_function_start (decl1
, input_filename
, lineno
);
12906 current_binding_level
= bl
;
12907 expanding_p
= (flags
& SF_EXPAND
) != 0;
12909 /* Even though we're inside a function body, we still don't want to
12910 call expand_expr to calculate the size of a variable-sized array.
12911 We haven't necessarily assigned RTL to all variables yet, so it's
12912 not safe to try to expand expressions involving them. */
12913 immediate_size_expand
= 0;
12914 current_function
->x_dont_save_pending_sizes_p
= 1;
12916 /* If we're building a statement-tree, start the tree now. */
12917 if (processing_template_decl
|| !expanding_p
)
12918 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
12920 /* Let the user know we're compiling this function. */
12921 if (processing_template_decl
|| !building_stmt_tree ())
12922 announce_function (decl1
);
12924 /* Record the decl so that the function name is defined.
12925 If we already have a decl for this name, and it is a FUNCTION_DECL,
12926 use the old decl. */
12927 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12929 /* A specialization is not used to guide overload resolution. */
12930 if ((flag_guiding_decls
12931 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12932 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12933 decl1
= pushdecl (decl1
);
12936 /* We need to set the DECL_CONTEXT. */
12937 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12938 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12939 /* And make sure we have enough default args. */
12940 check_default_args (decl1
);
12942 DECL_MAIN_VARIANT (decl1
) = decl1
;
12943 fntype
= TREE_TYPE (decl1
);
12946 /* Reset these in case the call to pushdecl changed them. */
12947 current_function_decl
= decl1
;
12948 current_function
->decl
= decl1
;
12950 /* Initialize the per-function data. */
12951 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
12953 /* If we already parsed this function, and we're just expanding it
12954 now, restore saved state. */
12955 struct binding_level
*bl
= current_binding_level
;
12956 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
12957 current_binding_level
= bl
;
12959 /* This function is being processed in whole-function mode; we
12960 already did semantic analysis. */
12961 current_function
->x_whole_function_mode_p
= 1;
12963 /* If we decided that we didn't want to inline this function,
12964 make sure the back-end knows that. */
12965 if (!current_function_cannot_inline
)
12966 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
12968 /* We don't need the saved data anymore. */
12969 free (DECL_SAVED_FUNCTION_DATA (decl1
));
12970 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
12972 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
12974 /* We know that this was set up by `grokclassfn'. We do not
12975 wait until `store_parm_decls', since evil parse errors may
12976 never get us to that point. Here we keep the consistency
12977 between `current_class_type' and `current_class_ptr'. */
12978 tree t
= DECL_ARGUMENTS (decl1
);
12980 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
12982 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
12985 cp_function_chain
->x_current_class_ref
12986 = build_indirect_ref (t
, NULL_PTR
);
12987 cp_function_chain
->x_current_class_ptr
= t
;
12989 /* Constructors and destructors need to know whether they're "in
12990 charge" of initializing virtual base classes. */
12991 if (DECL_DESTRUCTOR_P (decl1
))
12992 current_in_charge_parm
= TREE_CHAIN (t
);
12993 else if (DECL_CONSTRUCTOR_P (decl1
)
12995 && DECL_ARTIFICIAL (TREE_CHAIN (t
))
12996 && (DECL_NAME (TREE_CHAIN (t
))
12997 == in_charge_identifier
))
12998 current_in_charge_parm
= TREE_CHAIN (t
);
13001 if (DECL_INTERFACE_KNOWN (decl1
))
13003 tree ctx
= hack_decl_function_context (decl1
);
13005 if (DECL_NOT_REALLY_EXTERN (decl1
))
13006 DECL_EXTERNAL (decl1
) = 0;
13008 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13009 && TREE_PUBLIC (ctx
))
13010 /* This is a function in a local class in an extern inline
13012 comdat_linkage (decl1
);
13014 /* If this function belongs to an interface, it is public.
13015 If it belongs to someone else's interface, it is also external.
13016 This only affects inlines and template instantiations. */
13017 else if (interface_unknown
== 0
13018 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13019 || flag_alt_external_templates
))
13021 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13022 || processing_template_decl
)
13024 DECL_EXTERNAL (decl1
)
13026 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13027 && !DECL_VINDEX (decl1
)));
13029 /* For WIN32 we also want to put these in linkonce sections. */
13030 maybe_make_one_only (decl1
);
13033 DECL_EXTERNAL (decl1
) = 0;
13034 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13035 DECL_INTERFACE_KNOWN (decl1
) = 1;
13037 else if (interface_unknown
&& interface_only
13038 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13039 || flag_alt_external_templates
))
13041 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13042 interface, we will have interface_only set but not
13043 interface_known. In that case, we don't want to use the normal
13044 heuristics because someone will supply a #pragma implementation
13045 elsewhere, and deducing it here would produce a conflict. */
13046 comdat_linkage (decl1
);
13047 DECL_EXTERNAL (decl1
) = 0;
13048 DECL_INTERFACE_KNOWN (decl1
) = 1;
13049 DECL_DEFER_OUTPUT (decl1
) = 1;
13053 /* This is a definition, not a reference.
13054 So clear DECL_EXTERNAL. */
13055 DECL_EXTERNAL (decl1
) = 0;
13057 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13058 && ! DECL_INTERFACE_KNOWN (decl1
)
13059 /* Don't try to defer nested functions for now. */
13060 && ! hack_decl_function_context (decl1
))
13061 DECL_DEFER_OUTPUT (decl1
) = 1;
13063 DECL_INTERFACE_KNOWN (decl1
) = 1;
13066 if (doing_semantic_analysis_p ())
13069 current_binding_level
->parm_flag
= 1;
13073 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13075 if (!building_stmt_tree ())
13077 GNU_xref_function (decl1
, current_function_parms
);
13078 make_function_rtl (decl1
);
13081 /* Promote the value to int before returning it. */
13082 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13083 restype
= type_promotes_to (restype
);
13085 /* If this fcn was already referenced via a block-scope `extern' decl
13086 (or an implicit decl), propagate certain information about the usage. */
13087 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13088 TREE_ADDRESSABLE (decl1
) = 1;
13090 if (DECL_RESULT (decl1
) == NULL_TREE
)
13092 DECL_RESULT (decl1
)
13093 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13094 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13095 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13098 /* Allocate further tree nodes temporarily during compilation
13099 of this function only. Tiemann moved up here from bottom of fn. */
13100 /* If this is a nested function, then we must continue to allocate RTL
13101 on the permanent obstack in case we need to inline it later. */
13102 if (! hack_decl_function_context (decl1
))
13103 temporary_allocation ();
13107 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13108 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13109 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13110 else if (DECL_CONSTRUCTOR_P (decl1
))
13111 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13116 /* Called after store_parm_decls for a function-try-block. We need to update
13117 last_parm_cleanup_insn so that the base initializers for a constructor
13118 are run within this block, not before it. */
13121 expand_start_early_try_stmts ()
13123 expand_start_try_stmts ();
13124 last_parm_cleanup_insn
= get_last_insn ();
13127 /* Store the parameter declarations into the current function declaration.
13128 This is called after parsing the parameter declarations, before
13129 digesting the body of the function.
13131 Also install to binding contour return value identifier, if any. */
13134 store_parm_decls ()
13136 register tree fndecl
= current_function_decl
;
13137 register tree parm
;
13138 int parms_have_cleanups
= 0;
13139 tree cleanups
= NULL_TREE
;
13141 /* This is a list of types declared among parms in a prototype. */
13142 tree parmtags
= current_function_parm_tags
;
13144 /* This is a chain of any other decls that came in among the parm
13145 declarations. If a parm is declared with enum {foo, bar} x;
13146 then CONST_DECLs for foo and bar are put here. */
13147 tree nonparms
= NULL_TREE
;
13149 /* Create a binding level for the parms. */
13150 if (!building_stmt_tree ())
13151 expand_start_bindings (2);
13153 if (current_function_parms
)
13155 /* This case is when the function was defined with an ANSI prototype.
13156 The parms already have decls, so we need not do anything here
13157 except record them as in effect
13158 and complain if any redundant old-style parm decls were written. */
13160 tree specparms
= current_function_parms
;
13163 if (doing_semantic_analysis_p ())
13165 /* Must clear this because it might contain TYPE_DECLs declared
13167 storedecls (NULL_TREE
);
13169 /* If we're doing semantic analysis, then we'll call pushdecl
13170 for each of these. We must do them in reverse order so that
13171 they end in the correct forward order. */
13172 specparms
= nreverse (specparms
);
13175 for (parm
= specparms
; parm
; parm
= next
)
13177 next
= TREE_CHAIN (parm
);
13178 if (TREE_CODE (parm
) == PARM_DECL
)
13182 if (doing_semantic_analysis_p ())
13184 if (DECL_NAME (parm
) == NULL_TREE
13185 || TREE_CODE (TREE_TYPE (parm
)) != VOID_TYPE
)
13188 cp_error ("parameter `%D' declared void", parm
);
13191 if (! building_stmt_tree ()
13192 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13194 expand_decl (parm
);
13195 parms_have_cleanups
= 1;
13197 /* Keep track of the cleanups. */
13198 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13203 /* If we find an enum constant or a type tag,
13204 put it aside for the moment. */
13205 TREE_CHAIN (parm
) = NULL_TREE
;
13206 nonparms
= chainon (nonparms
, parm
);
13210 if (doing_semantic_analysis_p ())
13212 /* Get the decls in their original chain order
13213 and record in the function. This is all and only the
13214 PARM_DECLs that were pushed into scope by the loop above. */
13215 DECL_ARGUMENTS (fndecl
) = getdecls ();
13216 storetags (chainon (parmtags
, gettags ()));
13218 /* We built up the cleanups in reversed order. */
13219 cleanups
= nreverse (cleanups
);
13223 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13225 /* Now store the final chain of decls for the arguments
13226 as the decl-chain of the current lexical scope.
13227 Put the enumerators in as well, at the front so that
13228 DECL_ARGUMENTS is not modified. */
13229 if (doing_semantic_analysis_p ())
13230 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13232 /* Initialize the RTL code for the function. */
13233 DECL_SAVED_INSNS (fndecl
) = 0;
13234 if (! building_stmt_tree ())
13235 expand_function_start (fndecl
, parms_have_cleanups
);
13237 current_function_parms_stored
= 1;
13239 /* If this function is `main', emit a call to `__main'
13240 to run global initializers, etc. */
13241 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13242 expand_main_function ();
13244 /* Now that we have initialized the parms, we can start their
13245 cleanups. We cannot do this before, since expand_decl_cleanup
13246 should not be called before the parm can be used. */
13247 if (cleanups
&& !building_stmt_tree ())
13250 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
),
13251 TREE_VALUE (cleanups
)))
13252 cp_error ("parser lost in parsing declaration of `%D'",
13253 TREE_PURPOSE (cleanups
));
13255 cleanups
= TREE_CHAIN (cleanups
);
13258 /* Create a binding contour which can be used to catch
13259 cleanup-generated temporaries. Also, if the return value needs or
13260 has initialization, deal with that now. */
13261 if (parms_have_cleanups
)
13264 if (!building_stmt_tree ())
13265 expand_start_bindings (2);
13268 /* Do the starting of the exception specifications, if we have any. */
13269 if (flag_exceptions
&& !processing_template_decl
13270 && building_stmt_tree ()
13271 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13272 current_eh_spec_try_block
= expand_start_eh_spec ();
13274 last_parm_cleanup_insn
= get_last_insn ();
13275 last_dtor_insn
= get_last_insn ();
13278 /* Bind a name and initialization to the return value of
13279 the current function. */
13282 store_return_init (decl
)
13285 /* If this named return value comes in a register, put it in a
13286 pseudo-register. */
13287 if (DECL_REGISTER (decl
))
13289 original_result_rtx
= DECL_RTL (decl
);
13290 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13295 /* We have finished doing semantic analysis on DECL, but have not yet
13296 generated RTL for its body. Save away our current state, so that
13297 when we want to generate RTL later we know what to do. */
13300 save_function_data (decl
)
13303 struct language_function
*f
;
13305 /* Save the language-specific per-function data so that we can
13306 get it back when we really expand this function. */
13307 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13311 f
= ((struct language_function
*)
13312 xmalloc (sizeof (struct language_function
)));
13313 bcopy ((char *) cp_function_chain
, (char *) f
,
13314 sizeof (struct language_function
));
13315 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13317 /* Clear out the bits we don't need. */
13318 f
->x_base_init_list
= NULL_TREE
;
13319 f
->x_member_init_list
= NULL_TREE
;
13320 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13321 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13322 f
->x_last_dtor_insn
= NULL_RTX
;
13323 f
->x_last_parm_cleanup_insn
= NULL_RTX
;
13324 f
->x_result_rtx
= NULL_RTX
;
13325 f
->x_named_label_uses
= NULL
;
13326 f
->bindings
= NULL
;
13328 /* When we get back here again, we will be expanding. */
13329 f
->x_expanding_p
= 1;
13331 /* If we've already decided that we cannot inline this function, we
13332 must remember that fact when we actually go to expand the
13334 f
->cannot_inline
= current_function_cannot_inline
;
13337 /* At the end of every constructor we generate to code to return
13338 `this'. Do that now. */
13341 finish_constructor_body ()
13343 /* Any return from a constructor will end up here. */
13344 add_tree (build_min_nt (LABEL_STMT
, ctor_label
));
13346 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13347 generate the return, rather than a goto to CTOR_LABEL. */
13348 ctor_label
= NULL_TREE
;
13349 /* In check_return_expr we translate an empty return from a
13350 constructor to a return of `this'. */
13351 finish_return_stmt (NULL_TREE
);
13354 /* At the end of every destructor we generate code to restore virtual
13355 function tables to the values desired by base classes and to call
13356 to base class destructors. Do that now. */
13359 finish_destructor_body ()
13361 tree compound_stmt
;
13366 /* Create a block to contain all the extra code. */
13367 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13369 /* Any return from a destructor will end up here. */
13370 add_tree (build_min_nt (LABEL_STMT
, dtor_label
));
13372 /* Generate the code to call destructor on base class. If this
13373 destructor belongs to a class with virtual functions, then set
13374 the virtual function table pointer to represent the type of our
13377 /* This side-effect makes call to `build_delete' generate the code
13378 we have to have at the end of this destructor. `build_delete'
13379 will set the flag again. */
13380 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13382 /* These are two cases where we cannot delegate deletion. */
13383 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13384 || TYPE_GETS_REG_DELETE (current_class_type
))
13385 in_charge
= integer_zero_node
;
13387 in_charge
= current_in_charge_parm
;
13389 exprstmt
= build_delete (current_class_type
,
13392 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13395 if (exprstmt
!= error_mark_node
13396 && (TREE_CODE (exprstmt
) != NOP_EXPR
13397 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13398 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13400 if (exprstmt
!= void_zero_node
)
13401 /* Don't call `expand_expr_stmt' if we're not going to do
13402 anything, since -Wall will give a diagnostic. */
13403 finish_expr_stmt (exprstmt
);
13405 /* Run destructors for all virtual baseclasses. */
13406 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13408 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13409 tree if_stmt
= begin_if_stmt ();
13410 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13411 current_in_charge_parm
,
13417 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13419 tree vb
= get_vbase
13420 (BINFO_TYPE (vbases
),
13421 TYPE_BINFO (current_class_type
));
13423 (build_scoped_method_call
13424 (current_class_ref
, vb
, dtor_identifier
,
13425 build_expr_list (NULL_TREE
, integer_zero_node
)));
13427 vbases
= TREE_CHAIN (vbases
);
13430 finish_then_clause (if_stmt
);
13435 virtual_size
= c_sizeof (current_class_type
);
13437 /* At the end, call delete if that's what's requested. */
13439 /* FDIS sez: At the point of definition of a virtual destructor
13440 (including an implicit definition), non-placement operator delete
13441 shall be looked up in the scope of the destructor's class and if
13442 found shall be accessible and unambiguous.
13444 This is somewhat unclear, but I take it to mean that if the class
13445 only defines placement deletes we don't do anything here. So we
13446 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13447 they ever try to delete one of these. */
13448 if (TYPE_GETS_REG_DELETE (current_class_type
)
13449 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13453 exprstmt
= build_op_delete_call
13454 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13455 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13457 if_stmt
= begin_if_stmt ();
13458 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13459 current_in_charge_parm
,
13462 finish_expr_stmt (exprstmt
);
13463 finish_then_clause (if_stmt
);
13467 /* Close the block we started above. */
13468 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13471 /* Finish up a function declaration and compile that function
13472 all the way to assembler language output. The free the storage
13473 for the function definition.
13475 This is called after parsing the body of the function definition.
13476 LINENO is the current line number.
13478 FLAGS is a bitwise or of the following values:
13480 An extra call to poplevel (and expand_end_bindings) must be
13481 made to take care of the binding contour for the base
13482 initializers. This is only relevant for constructors.
13484 We just finished processing the body of an in-class inline
13485 function definition. (This processing will have taken place
13486 after the class definition is complete.) */
13489 finish_function (lineno
, flags
)
13493 register tree fndecl
= current_function_decl
;
13494 tree fntype
, ctype
= NULL_TREE
;
13495 /* Label to use if this function is supposed to return a value. */
13496 tree no_return_label
= NULL_TREE
;
13497 int call_poplevel
= (flags
& 1) != 0;
13498 int inclass_inline
= (flags
& 2) != 0;
13502 /* When we get some parse errors, we can end up without a
13503 current_function_decl, so cope. */
13504 if (fndecl
== NULL_TREE
)
13505 return error_mark_node
;
13507 nested
= function_depth
> 1;
13508 fntype
= TREE_TYPE (fndecl
);
13510 /* TREE_READONLY (fndecl) = 1;
13511 This caused &foo to be of type ptr-to-const-function
13512 which then got a warning when stored in a ptr-to-function variable. */
13514 /* This happens on strange parse errors. */
13515 if (! current_function_parms_stored
)
13518 store_parm_decls ();
13521 if (building_stmt_tree ())
13523 if (DECL_CONSTRUCTOR_P (fndecl
))
13525 finish_constructor_body ();
13529 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13530 finish_destructor_body ();
13531 else if (DECL_MAIN_P (fndecl
))
13533 /* Make it so that `main' always returns 0 by default. */
13535 finish_return_stmt (integer_one_node
);
13537 finish_return_stmt (integer_zero_node
);
13541 /* Finish dealing with exception specifiers. */
13542 if (flag_exceptions
&& !processing_template_decl
13543 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13544 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13545 (TREE_TYPE (current_function_decl
)),
13546 current_eh_spec_try_block
);
13550 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13552 tree ttype
= target_type (fntype
);
13555 if (IS_AGGR_TYPE (ttype
))
13556 /* Let debugger know it should output info for this type. */
13557 note_debug_info_needed (ttype
);
13559 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13561 ttype
= target_type (TREE_TYPE (parmdecl
));
13562 if (IS_AGGR_TYPE (ttype
))
13563 /* Let debugger know it should output info for this type. */
13564 note_debug_info_needed (ttype
);
13568 /* Clean house because we will need to reorder insns here. */
13569 do_pending_stack_adjust ();
13573 else if (DECL_CONSTRUCTOR_P (fndecl
))
13575 /* All subobjects have been fully constructed at this point. */
13576 end_protect_partials ();
13581 else if (return_label
!= NULL_RTX
13582 && flag_this_is_variable
<= 0
13583 && current_function_return_value
== NULL_TREE
13584 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13585 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13587 if (flag_exceptions
)
13588 expand_exception_blocks ();
13590 /* If this function is supposed to return a value, ensure that
13591 we do not fall into the cleanups by mistake. The end of our
13592 function will look like this:
13594 user code (may have return stmt somewhere)
13595 goto no_return_label
13600 NOTE_INSN_FUNCTION_END
13604 If the user omits a return stmt in the USER CODE section, we
13605 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13606 Otherwise, we won't. */
13607 if (no_return_label
)
13609 DECL_CONTEXT (no_return_label
) = fndecl
;
13610 DECL_INITIAL (no_return_label
) = error_mark_node
;
13611 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13612 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13613 expand_goto (no_return_label
);
13618 /* Remove the binding contour which is used
13619 to catch cleanup-generated temporaries. */
13620 expand_end_bindings (0, 0, 0);
13621 poplevel (0, 0, 0);
13623 /* Emit label at beginning of cleanup code for parameters. */
13624 emit_label (cleanup_label
);
13627 /* Get return value into register if that's where it's supposed
13629 if (original_result_rtx
)
13630 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13632 /* Finish building code that will trigger warnings if users forget
13633 to make their functions return values. */
13634 if (no_return_label
|| cleanup_label
)
13635 emit_jump (return_label
);
13636 if (no_return_label
)
13638 /* We don't need to call `expand_*_return' here because we
13639 don't need any cleanups here--this path of code is only
13640 for error checking purposes. */
13641 expand_label (no_return_label
);
13644 /* We hard-wired immediate_size_expand to zero in
13645 start_function. Expand_function_end will decrement this
13646 variable. So, we set the variable to one here, so that after
13647 the decrement it will remain zero. */
13648 immediate_size_expand
= 1;
13650 /* Generate rtl for function exit. */
13651 expand_function_end (input_filename
, lineno
, 1);
13654 /* We have to save this value here in case
13655 maybe_end_member_template_processing decides to pop all the
13656 template parameters. */
13657 expand_p
= !building_stmt_tree ();
13659 /* If we're saving up tree structure, tie off the function now. */
13661 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13663 /* This must come after expand_function_end because cleanups might
13664 have declarations (from inline functions) that need to go into
13665 this function's blocks. */
13666 if (doing_semantic_analysis_p ())
13668 if (current_binding_level
->parm_flag
!= 1)
13669 my_friendly_abort (122);
13670 poplevel (1, 0, 1);
13673 /* Remember that we were in class scope. */
13674 if (current_class_name
)
13675 ctype
= current_class_type
;
13677 /* Must mark the RESULT_DECL as being in this function. */
13678 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13680 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13681 to the FUNCTION_DECL node itself. */
13682 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13684 /* Save away current state, if appropriate. */
13685 if (!expanding_p
&& !processing_template_decl
)
13686 save_function_data (fndecl
);
13692 int saved_flag_keep_inline_functions
=
13693 flag_keep_inline_functions
;
13695 /* So we can tell if jump_optimize sets it to 1. */
13698 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13699 && hack_decl_function_context (fndecl
))
13700 /* Trick rest_of_compilation into not deferring output of this
13701 function, even if it is inline, since the rtl_obstack for
13702 this function is the function_obstack of the enclosing
13703 function and will be deallocated when the enclosing
13704 function is gone. See save_tree_status. */
13705 flag_keep_inline_functions
= 1;
13707 /* Before we call rest_of_compilation (which will pop the
13708 CURRENT_FUNCTION), we must save these values. */
13709 returns_null
= current_function_returns_null
;
13710 returns_value
= current_function_returns_value
;
13712 /* If this is a nested function (like a template instantiation
13713 that we're compiling in the midst of compiling something
13714 else), push a new GC context. That will keep local variables
13715 on the stack from being collected while we're doing the
13716 compilation of this function. */
13717 if (function_depth
> 1)
13718 ggc_push_context ();
13720 /* Run the optimizers and output the assembler code for this
13722 if (DECL_ARTIFICIAL (fndecl
))
13724 /* Do we really *want* to inline this synthesized method? */
13726 int save_fif
= flag_inline_functions
;
13727 flag_inline_functions
= 1;
13729 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13730 will check our size. */
13731 DECL_INLINE (fndecl
) = 0;
13733 rest_of_compilation (fndecl
);
13734 flag_inline_functions
= save_fif
;
13737 rest_of_compilation (fndecl
);
13739 /* Undo the call to ggc_push_context above. */
13740 if (function_depth
> 1)
13741 ggc_pop_context ();
13743 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13745 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13747 /* Set DECL_EXTERNAL so that assemble_external will be called as
13748 necessary. We'll clear it again in finish_file. */
13749 if (! DECL_EXTERNAL (fndecl
))
13750 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13751 DECL_EXTERNAL (fndecl
) = 1;
13752 mark_inline_for_output (fndecl
);
13755 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13756 note_debug_info_needed (ctype
);
13758 returns_null
|= can_reach_end
;
13760 /* Since we don't normally go through c_expand_return for constructors,
13761 this normally gets the wrong value.
13762 Also, named return values have their return codes emitted after
13763 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13764 if (DECL_CONSTRUCTOR_P (fndecl
)
13765 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13768 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13769 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13770 else if ((warn_return_type
|| pedantic
)
13772 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13774 /* If this function returns non-void and control can drop through,
13776 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13778 /* With just -W, complain only if function returns both with
13779 and without a value. */
13780 else if (extra_warnings
&& returns_value
&& returns_null
)
13781 warning ("this function may return with or without a value");
13785 /* Since we never call rest_of_compilation, we never clear
13786 CURRENT_FUNCTION. Do so explicitly. */
13787 free_after_compilation (current_function
);
13788 current_function
= NULL
;
13791 /* If this is a in-class inline definition, we may have to pop the
13792 bindings for the template parameters that we added in
13793 maybe_begin_member_template_processing when start_function was
13795 if (inclass_inline
)
13796 maybe_end_member_template_processing ();
13798 /* Leave the scope of the class. */
13800 pop_nested_class ();
13804 /* Free all the tree nodes making up this function. */
13805 /* Switch back to allocating nodes permanently
13806 until we start another function. */
13808 permanent_allocation (1);
13810 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
))
13814 /* Stop pointing to the local nodes about to be freed. */
13815 /* But DECL_INITIAL must remain nonzero so we know this
13816 was an actual function definition. */
13817 DECL_INITIAL (fndecl
) = error_mark_node
;
13818 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13819 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13822 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13823 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13824 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13825 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13830 /* Let the error reporting routines know that we're outside a
13831 function. For a nested function, this value is used in
13832 pop_cp_function_context and then reset via pop_function_context. */
13833 current_function_decl
= NULL_TREE
;
13839 /* Create the FUNCTION_DECL for a function definition.
13840 DECLSPECS and DECLARATOR are the parts of the declaration;
13841 they describe the return type and the name of the function,
13842 but twisted together in a fashion that parallels the syntax of C.
13844 This function creates a binding context for the function body
13845 as well as setting up the FUNCTION_DECL in current_function_decl.
13847 Returns a FUNCTION_DECL on success.
13849 If the DECLARATOR is not suitable for a function (it defines a datum
13850 instead), we return 0, which tells yyparse to report a parse error.
13852 May return void_type_node indicating that this method is actually
13853 a friend. See grokfield for more details.
13855 Came here with a `.pushlevel' .
13857 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13858 CHANGES TO CODE IN `grokfield'. */
13861 start_method (declspecs
, declarator
, attrlist
)
13862 tree declarator
, declspecs
, attrlist
;
13864 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13867 /* Something too ugly to handle. */
13868 if (fndecl
== NULL_TREE
)
13871 /* Pass friends other than inline friend functions back. */
13872 if (fndecl
== void_type_node
)
13875 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13876 /* Not a function, tell parser to report parse error. */
13879 if (DECL_IN_AGGR_P (fndecl
))
13881 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13883 if (DECL_CONTEXT (fndecl
)
13884 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13885 cp_error ("`%D' is already defined in class %s", fndecl
,
13886 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13888 return void_type_node
;
13891 check_template_shadow (fndecl
);
13893 DECL_THIS_INLINE (fndecl
) = 1;
13895 if (flag_default_inline
)
13896 DECL_INLINE (fndecl
) = 1;
13898 /* We process method specializations in finish_struct_1. */
13899 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13900 fndecl
= push_template_decl (fndecl
);
13902 /* We read in the parameters on the maybepermanent_obstack,
13903 but we won't be getting back to them until after we
13904 may have clobbered them. So the call to preserve_data
13905 will keep them safe. */
13908 if (! DECL_FRIEND_P (fndecl
))
13910 if (TREE_CHAIN (fndecl
))
13912 fndecl
= copy_node (fndecl
);
13913 TREE_CHAIN (fndecl
) = NULL_TREE
;
13916 if (DECL_CONSTRUCTOR_P (fndecl
))
13918 if (! grok_ctor_properties (current_class_type
, fndecl
))
13919 return void_type_node
;
13921 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13922 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13925 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13927 /* Make a place for the parms */
13929 current_binding_level
->parm_flag
= 1;
13931 DECL_IN_AGGR_P (fndecl
) = 1;
13935 /* Go through the motions of finishing a function definition.
13936 We don't compile this method until after the whole class has
13939 FINISH_METHOD must return something that looks as though it
13940 came from GROKFIELD (since we are defining a method, after all).
13942 This is called after parsing the body of the function definition.
13943 STMTS is the chain of statements that makes up the function body.
13945 DECL is the ..._DECL that `start_method' provided. */
13948 finish_method (decl
)
13951 register tree fndecl
= decl
;
13954 register tree link
;
13956 if (decl
== void_type_node
)
13959 old_initial
= DECL_INITIAL (fndecl
);
13961 /* Undo the level for the parms (from start_method).
13962 This is like poplevel, but it causes nothing to be
13963 saved. Saving information here confuses symbol-table
13964 output routines. Besides, this information will
13965 be correctly output when this method is actually
13968 /* Clear out the meanings of the local variables of this level;
13969 also record in each decl which block it belongs to. */
13971 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13973 if (DECL_NAME (link
) != NULL_TREE
)
13974 pop_binding (DECL_NAME (link
), link
);
13975 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13976 DECL_CONTEXT (link
) = NULL_TREE
;
13979 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13980 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13981 current_binding_level
->parm_flag
,
13982 current_binding_level
->keep
);
13984 poplevel (0, 0, 0);
13986 DECL_INITIAL (fndecl
) = old_initial
;
13988 /* We used to check if the context of FNDECL was different from
13989 current_class_type as another way to get inside here. This didn't work
13990 for String.cc in libg++. */
13991 if (DECL_FRIEND_P (fndecl
))
13993 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13994 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13995 decl
= void_type_node
;
14001 /* Called when a new struct TYPE is defined.
14002 If this structure or union completes the type of any previous
14003 variable declaration, lay it out and output its rtl. */
14006 hack_incomplete_structures (type
)
14011 if (current_binding_level
->incomplete
== NULL_TREE
)
14014 if (!type
) /* Don't do this for class templates. */
14017 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14019 tree decl
= TREE_VALUE (*list
);
14020 if ((decl
&& TREE_TYPE (decl
) == type
)
14021 || (TREE_TYPE (decl
)
14022 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14023 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14025 int toplevel
= toplevel_bindings_p ();
14026 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14027 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14028 layout_type (TREE_TYPE (decl
));
14029 layout_decl (decl
, 0);
14030 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14034 expand_decl (decl
);
14035 cleanup
= maybe_build_cleanup (decl
);
14036 expand_decl_init (decl
);
14037 if (! expand_decl_cleanup (decl
, cleanup
))
14038 cp_error ("parser lost in parsing declaration of `%D'",
14041 *list
= TREE_CHAIN (*list
);
14044 list
= &TREE_CHAIN (*list
);
14048 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14049 See build_delete for information about AUTO_DELETE.
14051 Don't build these on the momentary obstack; they must live
14052 the life of the binding contour. */
14055 maybe_build_cleanup_1 (decl
, auto_delete
)
14056 tree decl
, auto_delete
;
14058 tree type
= TREE_TYPE (decl
);
14059 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14061 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14064 if (TREE_CODE (decl
) != PARM_DECL
)
14065 temp
= suspend_momentary ();
14067 if (TREE_CODE (type
) == ARRAY_TYPE
)
14071 mark_addressable (decl
);
14072 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14075 /* Optimize for space over speed here. */
14076 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14077 || flag_expensive_optimizations
)
14078 flags
|= LOOKUP_NONVIRTUAL
;
14080 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14082 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14083 && ! TYPE_HAS_DESTRUCTOR (type
))
14084 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14085 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14087 if (TREE_CODE (decl
) != PARM_DECL
)
14088 resume_momentary (temp
);
14095 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
14098 build_target_expr (decl
, value
)
14104 t
= build (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
14105 maybe_build_cleanup (decl
), NULL_TREE
);
14106 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
14107 ignore the TARGET_EXPR. If there really turn out to be no
14108 side-effects, then the optimizer should be able to get rid of
14109 whatever code is generated anyhow. */
14110 TREE_SIDE_EFFECTS (t
) = 1;
14115 /* If DECL is of a type which needs a cleanup, build that cleanup
14116 here. The cleanup does free the storage with a call to delete. */
14119 maybe_build_cleanup_and_delete (decl
)
14122 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14125 /* If DECL is of a type which needs a cleanup, build that cleanup
14126 here. The cleanup does not free the storage with a call a delete. */
14129 maybe_build_cleanup (decl
)
14132 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14135 /* Expand a C++ expression at the statement level.
14136 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14137 The C++ type checker should get all of these out when
14138 expressions are combined with other, type-providing, expressions,
14139 leaving only orphan expressions, such as:
14141 &class::bar; / / takes its address, but does nothing with it. */
14144 cplus_expand_expr_stmt (exp
)
14147 if (stmts_are_full_exprs_p
)
14148 exp
= convert_to_void (exp
, "statement");
14151 /* We should do this eventually, but right now this causes regex.o from
14152 libg++ to miscompile, and tString to core dump. */
14153 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14156 /* If we don't do this, we end up down inside expand_expr
14157 trying to do TYPE_MODE on the ERROR_MARK, and really
14158 go outside the bounds of the type. */
14159 if (exp
!= error_mark_node
)
14160 expand_expr_stmt (break_out_cleanups (exp
));
14163 /* When a stmt has been parsed, this function is called. */
14168 /* Always assume this statement was not an expression statement. If
14169 it actually was an expression statement, its our callers
14170 responsibility to fix this up. */
14171 last_expr_type
= NULL_TREE
;
14174 /* Change a static member function definition into a FUNCTION_TYPE, instead
14175 of the METHOD_TYPE that we create when it's originally parsed.
14177 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14178 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14179 other decls. Either pass the addresses of local variables or NULL. */
14182 revert_static_member_fn (decl
, fn
, argtypes
)
14183 tree
*decl
, *fn
, *argtypes
;
14186 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14187 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14189 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14190 != TYPE_UNQUALIFIED
)
14191 cp_error ("static member function `%#D' declared with type qualifiers",
14194 args
= TREE_CHAIN (args
);
14195 tmp
= build_function_type (TREE_TYPE (function
), args
);
14196 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14197 tmp
= build_exception_variant (tmp
,
14198 TYPE_RAISES_EXCEPTIONS (function
));
14199 TREE_TYPE (*decl
) = tmp
;
14200 if (DECL_ARGUMENTS (*decl
))
14201 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14202 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14209 /* Initialize the variables used during compilation of a C++
14213 push_cp_function_context (f
)
14214 struct function
*f
;
14216 struct language_function
*p
14217 = ((struct language_function
*)
14218 xcalloc (1, sizeof (struct language_function
)));
14221 /* It takes an explicit call to expand_body to generate RTL for a
14225 /* Whenever we start a new function, we destroy temporaries in the
14227 stmts_are_full_exprs_p
= 1;
14230 /* Free the language-specific parts of F, now that we've finished
14231 compiling the function. */
14234 pop_cp_function_context (f
)
14235 struct function
*f
;
14237 free (f
->language
);
14241 /* Mark P for GC. */
14244 mark_lang_function (p
)
14245 struct language_function
*p
;
14250 ggc_mark_tree (p
->x_named_labels
);
14251 ggc_mark_tree (p
->x_ctor_label
);
14252 ggc_mark_tree (p
->x_dtor_label
);
14253 ggc_mark_tree (p
->x_base_init_list
);
14254 ggc_mark_tree (p
->x_member_init_list
);
14255 ggc_mark_tree (p
->x_current_class_ptr
);
14256 ggc_mark_tree (p
->x_current_class_ref
);
14257 ggc_mark_tree (p
->x_eh_spec_try_block
);
14258 ggc_mark_tree (p
->x_scope_stmt_stack
);
14260 ggc_mark_rtx (p
->x_last_dtor_insn
);
14261 ggc_mark_rtx (p
->x_last_parm_cleanup_insn
);
14262 ggc_mark_rtx (p
->x_result_rtx
);
14264 mark_stmt_tree (&p
->x_stmt_tree
);
14265 mark_binding_level (&p
->bindings
);
14268 /* Mark the language-specific data in F for GC. */
14271 mark_cp_function_context (f
)
14272 struct function
*f
;
14274 mark_lang_function (f
->language
);
14280 return function_depth
!= 0;
14285 lang_mark_false_label_stack (l
)
14286 struct label_node
*l
;
14288 /* C++ doesn't use false_label_stack. It better be NULL. */
14289 my_friendly_assert (l
== NULL
, 19990904);
14296 enum tree_code code
= TREE_CODE (t
);
14297 if (code
== IDENTIFIER_NODE
)
14299 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14300 struct lang_id2
*li2
= li
->x
;
14301 ggc_mark_tree (li
->namespace_bindings
);
14302 ggc_mark_tree (li
->bindings
);
14303 ggc_mark_tree (li
->class_value
);
14304 ggc_mark_tree (li
->class_template_info
);
14308 ggc_mark_tree (li2
->label_value
);
14309 ggc_mark_tree (li2
->implicit_decl
);
14310 ggc_mark_tree (li2
->error_locus
);
14313 else if (code
== CPLUS_BINDING
)
14315 if (BINDING_HAS_LEVEL_P (t
))
14316 mark_binding_level (&BINDING_LEVEL (t
));
14318 ggc_mark_tree (BINDING_SCOPE (t
));
14319 ggc_mark_tree (BINDING_VALUE (t
));
14321 else if (code
== OVERLOAD
)
14322 ggc_mark_tree (OVL_FUNCTION (t
));
14323 else if (code
== TEMPLATE_PARM_INDEX
)
14324 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14325 else if (TREE_CODE_CLASS (code
) == 'd')
14327 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14332 if (!DECL_GLOBAL_CTOR_P (t
) && !DECL_GLOBAL_DTOR_P (t
))
14333 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14334 ggc_mark_tree (ld
->decl_flags
.context
);
14335 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14336 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14338 mark_binding_level (&NAMESPACE_LEVEL (t
));
14339 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14341 ggc_mark_tree (ld
->main_decl_variant
);
14342 ggc_mark_tree (ld
->befriending_classes
);
14343 ggc_mark_tree (ld
->saved_tree
);
14344 if (TREE_CODE (t
) == TYPE_DECL
)
14345 ggc_mark_tree (ld
->u
.sorted_fields
);
14346 else if (TREE_CODE (t
) == FUNCTION_DECL
14347 && !DECL_PENDING_INLINE_P (t
))
14348 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14352 else if (TREE_CODE_CLASS (code
) == 't')
14354 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14356 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14357 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14360 ggc_mark_tree (lt
->vfields
);
14361 ggc_mark_tree (lt
->vbases
);
14362 ggc_mark_tree (lt
->tags
);
14363 ggc_mark_tree (lt
->search_slot
);
14364 ggc_mark_tree (lt
->size
);
14365 ggc_mark_tree (lt
->abstract_virtuals
);
14366 ggc_mark_tree (lt
->friend_classes
);
14367 ggc_mark_tree (lt
->rtti
);
14368 ggc_mark_tree (lt
->methods
);
14369 ggc_mark_tree (lt
->template_info
);
14370 ggc_mark_tree (lt
->befriending_classes
);
14373 /* In the case of pointer-to-member function types, the
14374 TYPE_LANG_SPECIFIC is really just a tree. */
14375 ggc_mark_tree ((tree
) lt
);