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
*, int *, void *));
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));
178 static tree create_array_type_for_decl
PROTO((tree
, tree
, tree
));
180 #if defined (DEBUG_CP_BINDING_LEVELS)
181 static void indent
PROTO((void));
184 /* Erroneous argument lists can use this *IFF* they do not modify it. */
185 tree error_mark_list
;
187 /* The following symbols are subsumed in the cp_global_trees array, and
188 listed here individually for documentation purposes.
191 tree wchar_decl_node;
194 tree vtable_entry_type;
195 tree delta_type_node;
198 tree __baselist_desc_type_node;
199 tree __i_desc_type_node, __m_desc_type_node;
200 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
202 tree __t_desc_type_node;
204 tree __tp_desc_type_node;
206 tree __access_mode_type_node;
207 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
208 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
209 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
211 Not needed yet? May be needed one day?
212 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
213 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
214 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
217 tree class_star_type_node;
218 tree class_type_node, record_type_node, union_type_node, enum_type_node;
219 tree unknown_type_node;
221 Array type `vtable_entry_type[]'
224 tree vtbl_ptr_type_node;
230 A FUNCTION_DECL which can call `abort'. Not necessarily the
231 one that the user will declare, but sufficient to be called
232 by routines that want to abort the program.
236 The FUNCTION_DECL for the default `::operator delete'.
238 tree global_delete_fndecl;
241 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
245 tree cp_global_trees
[CPTI_MAX
];
247 /* Indicates that there is a type value in some namespace, although
248 that is not necessarily in scope at the moment. */
250 static tree global_type_node
;
255 /* Expect only namespace names now. */
256 static int only_namespace_names
;
258 /* If original DECL_RESULT of current function was a register,
259 but due to being an addressable named return value, would up
260 on the stack, this variable holds the named return value's
261 original location. */
263 #define original_result_rtx cp_function_chain->x_result_rtx
265 struct named_label_list
267 struct binding_level
*binding_level
;
270 const char *filename_o_goto
;
272 struct named_label_list
*next
;
275 /* Used only for jumps to as-yet undefined labels, since jumps to
276 defined labels can have their validity checked by stmt.c. */
278 #define named_label_uses cp_function_chain->x_named_label_uses
280 /* A list of objects which have constructors or destructors
281 which reside in the global scope. The decl is stored in
282 the TREE_VALUE slot and the initializer is stored
283 in the TREE_PURPOSE slot. */
284 tree static_aggregates
;
288 /* A node for the integer constants 2, and 3. */
290 tree integer_two_node
, integer_three_node
;
292 /* Parsing a function declarator leaves here a chain of structure
293 and enum types declared in the parmlist. */
295 static tree last_function_parm_tags
;
297 /* Similar, for last_function_parm_tags. */
298 tree last_function_parms
;
299 static tree current_function_parm_tags
;
301 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
302 that have names. Here so we can clear out their names' definitions
303 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
304 TREE_PURPOSE is the previous binding of the label. */
306 #define named_labels cp_function_chain->x_named_labels
308 /* The FUNCTION_DECL for the function currently being compiled,
309 or 0 if between functions. */
310 tree current_function_decl
;
312 /* Set to 0 at beginning of a function definition, and whenever
313 a label (case or named) is defined. Set to value of expression
314 returned from function when that value can be transformed into
315 a named return value. */
317 tree current_function_return_value
;
319 /* Nonzero means give `double' the same size as `float'. */
321 extern int flag_short_double
;
323 /* Nonzero means don't recognize any builtin functions. */
325 extern int flag_no_builtin
;
327 /* Nonzero means don't recognize the non-ANSI builtin functions.
330 extern int flag_no_nonansi_builtin
;
332 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
334 extern int flag_huge_objects
;
336 /* Nonzero if we want to conserve space in the .o files. We do this
337 by putting uninitialized data and runtime initialized data into
338 .common instead of .data at the expense of not flagging multiple
340 extern int flag_conserve_space
;
342 /* C and C++ flags are in decl2.c. */
344 /* Flag used when debugging spew.c */
346 extern int spew_debug
;
348 /* A expression of value 0 with the same precision as a sizetype
350 tree signed_size_zero_node
;
352 /* The name of the anonymous namespace, throughout this translation
354 tree anonymous_namespace_name
;
357 /* For each binding contour we allocate a binding_level structure
358 which records the names defined in that contour.
361 1) one for each function definition,
362 where internal declarations of the parameters appear.
363 2) one for each compound statement,
364 to record its declarations.
366 The current meaning of a name can be found by searching the levels
367 from the current one out to the global one.
369 Off to the side, may be the class_binding_level. This exists only
370 to catch class-local declarations. It is otherwise nonexistent.
372 Also there may be binding levels that catch cleanups that must be
373 run when exceptions occur. Thus, to see whether a name is bound in
374 the current scope, it is not enough to look in the
375 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
378 /* Note that the information in the `names' component of the global contour
379 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
383 /* A chain of _DECL nodes for all variables, constants, functions,
384 and typedef types. These are in the reverse of the order
385 supplied. There may be OVERLOADs on this list, too, but they
386 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
389 /* A list of structure, union and enum definitions, for looking up
391 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
392 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
393 or ENUMERAL_TYPE node.
395 C++: the TREE_VALUE nodes can be simple types for
396 component_bindings. */
399 /* A list of USING_DECL nodes. */
402 /* A list of used namespaces. PURPOSE is the namespace,
403 VALUE the common ancestor with this binding_level's namespace. */
404 tree using_directives
;
406 /* If this binding level is the binding level for a class, then
407 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
408 is the name of an entity bound in the class; the TREE_VALUE is
409 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
410 when leaving class scope, we can restore the
411 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
412 the DECL bound by this name in the class. */
415 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
416 is used for all binding levels. */
419 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
420 label in this scope. The TREE_PURPOSE is the previous value of
421 the IDENTIFIER_LABEL VALUE. */
422 tree shadowed_labels
;
424 /* For each level (except not the global one),
425 a chain of BLOCK nodes for all the levels
426 that were entered and exited one level down. */
429 /* The BLOCK node for this level, if one has been preallocated.
430 If 0, the BLOCK is allocated (if needed) when the level is popped. */
433 /* The binding level which this one is contained in (inherits from). */
434 struct binding_level
*level_chain
;
436 /* List of decls in `names' that have incomplete
437 structure or union types. */
440 /* List of VAR_DECLS saved from a previous for statement.
441 These would be dead in ANSI-conforming code, but might
442 be referenced in ARM-era code. These are stored in a
443 TREE_LIST; the TREE_VALUE is the actual declaration. */
444 tree dead_vars_from_for
;
446 /* 1 for the level that holds the parameters of a function.
447 2 for the level that holds a class declaration.
448 3 for levels that hold parameter declarations. */
449 unsigned parm_flag
: 4;
451 /* 1 means make a BLOCK for this level regardless of all else.
452 2 for temporary binding contours created by the compiler. */
455 /* Nonzero if this level "doesn't exist" for tags. */
456 unsigned tag_transparent
: 1;
458 /* Nonzero if this level can safely have additional
459 cleanup-needing variables added to it. */
460 unsigned more_cleanups_ok
: 1;
461 unsigned have_cleanups
: 1;
463 /* Nonzero if this level is for storing the decls for template
464 parameters and generic decls; these decls will be discarded and
465 replaced with a TEMPLATE_DECL. */
466 unsigned pseudo_global
: 1;
468 /* This is set for a namespace binding level. */
469 unsigned namespace_p
: 1;
471 /* True if this level is that of a for-statement where we need to
472 worry about ambiguous (ARM or ANSI) scope rules. */
473 unsigned is_for_scope
: 1;
475 /* True if this level corresponds to an EH region, as for a try block. */
476 unsigned eh_region
: 1;
478 /* One bit left for this word. */
480 #if defined(DEBUG_CP_BINDING_LEVELS)
481 /* Binding depth at which this level began. */
482 unsigned binding_depth
;
483 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
486 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
488 /* The binding level currently in effect. */
490 #define current_binding_level \
492 ? cp_function_chain->bindings \
493 : scope_chain->bindings)
495 /* The binding level of the current class, if any. */
497 #define class_binding_level scope_chain->class_bindings
499 /* A chain of binding_level structures awaiting reuse. */
501 static struct binding_level
*free_binding_level
;
503 /* The outermost binding level, for names of file scope.
504 This is created when the compiler is started and exists
505 through the entire run. */
507 static struct binding_level
*global_binding_level
;
509 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
511 static int keep_next_level_flag
;
513 #if defined(DEBUG_CP_BINDING_LEVELS)
514 static int binding_depth
= 0;
515 static int is_class_level
= 0;
522 for (i
= 0; i
< binding_depth
*2; i
++)
525 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
527 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
530 push_binding_level (newlevel
, tag_transparent
, keep
)
531 struct binding_level
*newlevel
;
532 int tag_transparent
, keep
;
534 /* Add this level to the front of the chain (stack) of levels that
536 bzero ((char*) newlevel
, sizeof (struct binding_level
));
537 newlevel
->level_chain
= current_binding_level
;
538 current_binding_level
= newlevel
;
539 newlevel
->tag_transparent
= tag_transparent
;
540 newlevel
->more_cleanups_ok
= 1;
542 /* We are called before expand_start_bindings, but after
543 expand_eh_region_start for a try block; so we check this now,
544 before the EH block is covered up. */
545 newlevel
->eh_region
= is_eh_region ();
547 newlevel
->keep
= keep
;
548 #if defined(DEBUG_CP_BINDING_LEVELS)
549 newlevel
->binding_depth
= binding_depth
;
551 fprintf (stderr
, "push %s level 0x%08x line %d\n",
552 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
555 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
558 /* Find the innermost enclosing class scope, and reset
559 CLASS_BINDING_LEVEL appropriately. */
562 find_class_binding_level ()
564 struct binding_level
*level
= current_binding_level
;
566 while (level
&& level
->parm_flag
!= 2)
567 level
= level
->level_chain
;
568 if (level
&& level
->parm_flag
== 2)
569 class_binding_level
= level
;
571 class_binding_level
= 0;
577 if (global_binding_level
)
579 /* Cannot pop a level, if there are none left to pop. */
580 if (current_binding_level
== global_binding_level
)
581 my_friendly_abort (123);
583 /* Pop the current level, and free the structure for reuse. */
584 #if defined(DEBUG_CP_BINDING_LEVELS)
587 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
588 (is_class_level
) ? "class" : "block",
589 current_binding_level
, lineno
);
590 if (is_class_level
!= (current_binding_level
== class_binding_level
))
593 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
596 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
598 register struct binding_level
*level
= current_binding_level
;
599 current_binding_level
= current_binding_level
->level_chain
;
600 level
->level_chain
= free_binding_level
;
601 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
602 if (level
->binding_depth
!= binding_depth
)
604 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
605 free_binding_level
= level
;
606 find_class_binding_level ();
611 suspend_binding_level ()
613 if (class_binding_level
)
614 current_binding_level
= class_binding_level
;
616 if (global_binding_level
)
618 /* Cannot suspend a level, if there are none left to suspend. */
619 if (current_binding_level
== global_binding_level
)
620 my_friendly_abort (123);
622 /* Suspend the current level. */
623 #if defined(DEBUG_CP_BINDING_LEVELS)
626 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
627 (is_class_level
) ? "class" : "block",
628 current_binding_level
, lineno
);
629 if (is_class_level
!= (current_binding_level
== class_binding_level
))
632 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
635 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
636 current_binding_level
= current_binding_level
->level_chain
;
637 find_class_binding_level ();
641 resume_binding_level (b
)
642 struct binding_level
*b
;
644 /* Resuming binding levels is meant only for namespaces,
645 and those cannot nest into classes. */
646 my_friendly_assert(!class_binding_level
, 386);
647 /* Also, resuming a non-directly nested namespace is a no-no. */
648 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
649 current_binding_level
= b
;
650 #if defined(DEBUG_CP_BINDING_LEVELS)
651 b
->binding_depth
= binding_depth
;
653 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
654 (is_class_level
) ? "class" : "block", b
, lineno
);
657 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
660 /* Create a new `struct binding_level'. */
663 struct binding_level
*
664 make_binding_level ()
667 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
670 /* Nonzero if we are currently in the global binding level. */
675 return current_binding_level
== global_binding_level
;
678 /* Return the innermost binding level that is not for a class scope. */
680 static struct binding_level
*
681 innermost_nonclass_level ()
683 struct binding_level
*b
;
685 b
= current_binding_level
;
686 while (b
->parm_flag
== 2)
692 /* Nonzero if we are currently in a toplevel binding level. This
693 means either the global binding level or a namespace in a toplevel
694 binding level. Since there are no non-toplevel namespace levels,
695 this really means any namespace or pseudo-global level. We also
696 include a class whose context is toplevel. */
699 toplevel_bindings_p ()
701 struct binding_level
*b
= innermost_nonclass_level ();
703 return b
->namespace_p
|| b
->pseudo_global
;
706 /* Nonzero if this is a namespace scope, or if we are defining a class
707 which is itself at namespace scope, or whose enclosing class is
708 such a class, etc. */
711 namespace_bindings_p ()
713 struct binding_level
*b
= innermost_nonclass_level ();
715 return b
->namespace_p
;
718 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
719 unconditionally. Otherwise, use the normal logic to decide whether
720 or not to create a BLOCK. */
723 keep_next_level (keep
)
726 keep_next_level_flag
= keep
;
729 /* Nonzero if the current level needs to have a BLOCK made. */
734 return (current_binding_level
->blocks
!= NULL_TREE
735 || current_binding_level
->keep
736 || current_binding_level
->names
!= NULL_TREE
737 || (current_binding_level
->tags
!= NULL_TREE
738 && !current_binding_level
->tag_transparent
));
742 declare_pseudo_global_level ()
744 current_binding_level
->pseudo_global
= 1;
748 declare_namespace_level ()
750 current_binding_level
->namespace_p
= 1;
754 pseudo_global_level_p ()
756 return current_binding_level
->pseudo_global
;
760 set_class_shadows (shadows
)
763 class_binding_level
->class_shadowed
= shadows
;
766 /* Enter a new binding level.
767 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
768 not for that of tags. */
771 pushlevel (tag_transparent
)
774 struct binding_level
*newlevel
;
776 if (current_function
&& !doing_semantic_analysis_p ())
779 /* Reuse or create a struct for this binding level. */
780 #if defined(DEBUG_CP_BINDING_LEVELS)
782 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
783 if (free_binding_level
)
784 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
786 newlevel
= free_binding_level
;
787 free_binding_level
= free_binding_level
->level_chain
;
790 newlevel
= make_binding_level ();
792 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
793 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
794 keep_next_level_flag
= 0;
798 note_level_for_for ()
800 current_binding_level
->is_for_scope
= 1;
803 /* For a binding between a name and an entity at a block scope,
804 this is the `struct binding_level' for the block. */
805 #define BINDING_LEVEL(NODE) \
806 (((struct tree_binding*)NODE)->scope.level)
808 /* Make DECL the innermost binding for ID. The LEVEL is the binding
809 level at which this declaration is being bound. */
812 push_binding (id
, decl
, level
)
815 struct binding_level
* level
;
819 binding
= make_node (CPLUS_BINDING
);
821 /* Now, fill in the binding information. */
822 BINDING_VALUE (binding
) = decl
;
823 BINDING_TYPE (binding
) = NULL_TREE
;
824 BINDING_LEVEL (binding
) = level
;
825 INHERITED_VALUE_BINDING_P (binding
) = 0;
826 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
827 BINDING_HAS_LEVEL_P (binding
) = 1;
829 /* And put it on the front of the list of bindings for ID. */
830 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
831 IDENTIFIER_BINDING (id
) = binding
;
834 /* ID is already bound in the current scope. But, DECL is an
835 additional binding for ID in the same scope. This is the `struct
836 stat' hack whereby a non-typedef class-name or enum-name can be
837 bound at the same level as some other kind of entity. It's the
838 responsibility of the caller to check that inserting this name is
839 legal here. Returns nonzero if the new binding was successful. */
841 add_binding (id
, decl
)
845 tree binding
= IDENTIFIER_BINDING (id
);
848 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
849 /* The new name is the type name. */
850 BINDING_TYPE (binding
) = decl
;
851 else if (!BINDING_VALUE (binding
))
852 /* This situation arises when push_class_level_binding moves an
853 inherited type-binding out of the way to make room for a new
855 BINDING_VALUE (binding
) = decl
;
856 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
857 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
859 /* The old binding was a type name. It was placed in
860 BINDING_VALUE because it was thought, at the point it was
861 declared, to be the only entity with such a name. Move the
862 type name into the type slot; it is now hidden by the new
864 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
865 BINDING_VALUE (binding
) = decl
;
866 INHERITED_VALUE_BINDING_P (binding
) = 0;
868 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
869 && TREE_CODE (decl
) == TYPE_DECL
870 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
871 && same_type_p (TREE_TYPE (decl
),
872 TREE_TYPE (BINDING_VALUE (binding
))))
873 /* We have two typedef-names, both naming the same type to have
874 the same name. This is OK because of:
878 In a given scope, a typedef specifier can be used to redefine
879 the name of any type declared in that scope to refer to the
880 type to which it already refers. */
884 cp_error ("declaration of `%#D'", decl
);
885 cp_error_at ("conflicts with previous declaration `%#D'",
886 BINDING_VALUE (binding
));
893 /* Add DECL to the list of things declared in B. */
896 add_decl_to_level (decl
, b
)
898 struct binding_level
*b
;
900 /* We build up the list in reverse order, and reverse it later if
902 TREE_CHAIN (decl
) = b
->names
;
906 /* Bind DECL to ID in the current_binding_level, assumed to be a local
907 binding level. If PUSH_USING is set in FLAGS, we know that DECL
908 doesn't really belong to this binding level, that it got here
909 through a using-declaration. */
912 push_local_binding (id
, decl
, flags
)
917 struct binding_level
*b
;
919 /* Skip over any local classes. This makes sense if we call
920 push_local_binding with a friend decl of a local class. */
921 b
= current_binding_level
;
922 while (b
->parm_flag
== 2)
925 if (lookup_name_current_level (id
))
927 /* Supplement the existing binding. */
928 if (!add_binding (id
, decl
))
929 /* It didn't work. Something else must be bound at this
930 level. Do not add DECL to the list of things to pop
935 /* Create a new binding. */
936 push_binding (id
, decl
, b
);
938 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
939 /* We must put the OVERLOAD into a TREE_LIST since the
940 TREE_CHAIN of an OVERLOAD is already used. Similarly for
941 decls that got here through a using-declaration. */
942 decl
= build_tree_list (NULL_TREE
, decl
);
944 /* And put DECL on the list of things declared by the current
946 add_decl_to_level (decl
, b
);
949 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
950 binding was successful. */
953 push_class_binding (id
, decl
)
958 tree binding
= IDENTIFIER_BINDING (id
);
961 /* Note that we declared this value so that we can issue an error if
962 this an illegal redeclaration of a name already used for some
964 note_name_declared_in_class (id
, decl
);
966 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
967 /* Supplement the existing binding. */
968 result
= add_binding (id
, decl
);
970 /* Create a new binding. */
971 push_binding (id
, decl
, class_binding_level
);
973 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
974 class-level declaration. Note that we do not use DECL here
975 because of the possibility of the `struct stat' hack; if DECL is
976 a class-name or enum-name we might prefer a field-name, or some
978 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
980 /* If this is a binding from a base class, mark it as such. */
981 binding
= IDENTIFIER_BINDING (id
);
982 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
984 /* Any implicit typename must be from a base-class. The
985 context for an implicit typename declaration is always
986 the derived class in which the lookup was done, so the checks
987 based on the context of DECL below will not trigger. */
988 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
989 INHERITED_VALUE_BINDING_P (binding
) = 1;
992 if (TREE_CODE (decl
) == OVERLOAD
)
993 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
996 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
998 context
= DECL_REAL_CONTEXT (decl
);
1001 if (is_properly_derived_from (current_class_type
, context
))
1002 INHERITED_VALUE_BINDING_P (binding
) = 1;
1004 INHERITED_VALUE_BINDING_P (binding
) = 0;
1007 else if (BINDING_VALUE (binding
) == decl
)
1008 /* We only encounter a TREE_LIST when push_class_decls detects an
1009 ambiguity. Such an ambiguity can be overridden by a definition
1011 INHERITED_VALUE_BINDING_P (binding
) = 1;
1016 /* Remove the binding for DECL which should be the innermost binding
1020 pop_binding (id
, decl
)
1026 if (id
== NULL_TREE
)
1027 /* It's easiest to write the loops that call this function without
1028 checking whether or not the entities involved have names. We
1029 get here for such an entity. */
1032 /* Get the innermost binding for ID. */
1033 binding
= IDENTIFIER_BINDING (id
);
1035 /* The name should be bound. */
1036 my_friendly_assert (binding
!= NULL_TREE
, 0);
1038 /* The DECL will be either the ordinary binding or the type
1039 binding for this identifier. Remove that binding. */
1040 if (BINDING_VALUE (binding
) == decl
)
1041 BINDING_VALUE (binding
) = NULL_TREE
;
1042 else if (BINDING_TYPE (binding
) == decl
)
1043 BINDING_TYPE (binding
) = NULL_TREE
;
1045 my_friendly_abort (0);
1047 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1048 /* We're completely done with the innermost binding for this
1049 identifier. Unhook it from the list of bindings. */
1050 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1053 /* When a label goes out of scope, check to see if that label was used
1054 in a valid manner, and issue any appropriate warnings or errors. */
1060 tree label
= TREE_VALUE (link
);
1062 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1064 if (DECL_INITIAL (label
) == NULL_TREE
)
1066 cp_error_at ("label `%D' used but not defined", label
);
1067 /* Avoid crashing later. */
1068 define_label (input_filename
, 1, DECL_NAME (label
));
1070 else if (warn_unused
&& !TREE_USED (label
))
1071 cp_warning_at ("label `%D' defined but not used", label
);
1074 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1077 /* At the end of a function, all labels declared within the fucntion
1078 go out of scope. BLOCK is the top-level block for the
1087 /* Clear out the definitions of all label names, since their scopes
1089 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1092 /* Put the labels into the "variables" of the top-level block,
1093 so debugger can see them. */
1094 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1095 BLOCK_VARS (block
) = TREE_VALUE (link
);
1098 named_labels
= NULL_TREE
;
1101 /* Exit a binding level.
1102 Pop the level off, and restore the state of the identifier-decl mappings
1103 that were in effect when this level was entered.
1105 If KEEP == 1, this level had explicit declarations, so
1106 and create a "block" (a BLOCK node) for the level
1107 to record its declarations and subblocks for symbol table output.
1109 If FUNCTIONBODY is nonzero, this level is the body of a function,
1110 so create a block as if KEEP were set and also clear out all
1113 If REVERSE is nonzero, reverse the order of decls before putting
1114 them into the BLOCK. */
1117 poplevel (keep
, reverse
, functionbody
)
1123 /* The chain of decls was accumulated in reverse order.
1124 Put it into forward order, just for cleanliness. */
1126 int tmp
= functionbody
;
1127 int real_functionbody
;
1130 tree block
= NULL_TREE
;
1132 int block_previously_created
;
1133 int leaving_for_scope
;
1135 if (current_function
&& !doing_semantic_analysis_p ())
1138 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1141 real_functionbody
= (current_binding_level
->keep
== 2
1142 ? ((functionbody
= 0), tmp
) : functionbody
);
1143 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1144 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1146 my_friendly_assert (!current_binding_level
->class_shadowed
,
1149 /* We used to use KEEP == 2 to indicate that the new block should go
1150 at the beginning of the list of blocks at this binding level,
1151 rather than the end. This hack is no longer used. */
1152 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1154 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1155 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1156 current_binding_level
->parm_flag
,
1157 current_binding_level
->keep
);
1159 if (current_binding_level
->keep
== 1)
1162 /* Get the decls in the order they were written.
1163 Usually current_binding_level->names is in reverse order.
1164 But parameter decls were previously put in forward order. */
1167 current_binding_level
->names
1168 = decls
= nreverse (current_binding_level
->names
);
1170 decls
= current_binding_level
->names
;
1172 /* Output any nested inline functions within this block
1173 if they weren't already output. */
1175 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1176 if (TREE_CODE (decl
) == FUNCTION_DECL
1177 && ! TREE_ASM_WRITTEN (decl
)
1178 && DECL_INITIAL (decl
) != NULL_TREE
1179 && TREE_ADDRESSABLE (decl
)
1180 && decl_function_context (decl
) == current_function_decl
)
1182 /* If this decl was copied from a file-scope decl
1183 on account of a block-scope extern decl,
1184 propagate TREE_ADDRESSABLE to the file-scope decl. */
1185 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1186 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1189 push_function_context ();
1190 output_inline_function (decl
);
1191 pop_function_context ();
1195 /* If there were any declarations or structure tags in that level,
1196 or if this level is a function body,
1197 create a BLOCK to record them for the life of this function. */
1200 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1201 if (block_previously_created
)
1202 block
= current_binding_level
->this_block
;
1203 else if (keep
== 1 || functionbody
)
1204 block
= make_node (BLOCK
);
1205 if (block
!= NULL_TREE
)
1207 if (block_previously_created
)
1209 if (decls
|| tags
|| subblocks
)
1211 if (BLOCK_VARS (block
))
1212 warning ("internal compiler error: debugging info corrupted");
1214 BLOCK_VARS (block
) = decls
;
1216 /* We can have previous subblocks and new subblocks when
1217 doing fixup_gotos with complex cleanups. We chain the new
1218 subblocks onto the end of any pre-existing subblocks. */
1219 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1225 BLOCK_VARS (block
) = decls
;
1226 BLOCK_SUBBLOCKS (block
) = subblocks
;
1230 /* In each subblock, record that this is its superior. */
1233 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1234 BLOCK_SUPERCONTEXT (link
) = block
;
1236 /* We still support the old for-scope rules, whereby the variables
1237 in a for-init statement were in scope after the for-statement
1238 ended. We only use the new rules in flag_new_for_scope is
1241 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1243 /* Remove declarations for all the DECLs in this level. */
1244 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1246 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1249 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1253 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1255 ns_binding
= NULL_TREE
;
1258 && (BINDING_LEVEL (outer_binding
)
1259 == current_binding_level
->level_chain
))
1260 /* We have something like:
1265 and we are leaving the `for' scope. There's no reason to
1266 keep the binding of the inner `i' in this case. */
1267 pop_binding (DECL_NAME (link
), link
);
1268 else if ((outer_binding
1269 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1272 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1273 /* Here, we have something like:
1281 We must pop the for-scope binding so we know what's a
1282 type and what isn't. */
1283 pop_binding (DECL_NAME (link
), link
);
1286 /* Mark this VAR_DECL as dead so that we can tell we left it
1287 there only for backward compatibility. */
1288 DECL_DEAD_FOR_LOCAL (link
) = 1;
1290 /* Keep track of what should of have happenned when we
1291 popped the binding. */
1292 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1293 DECL_SHADOWED_FOR_VAR (link
)
1294 = BINDING_VALUE (outer_binding
);
1296 /* Add it to the list of dead variables in the next
1297 outermost binding to that we can remove these when we
1298 leave that binding. */
1299 current_binding_level
->level_chain
->dead_vars_from_for
1300 = tree_cons (NULL_TREE
, link
,
1301 current_binding_level
->level_chain
->
1302 dead_vars_from_for
);
1304 /* Although we don't pop the CPLUS_BINDING, we do clear
1305 its BINDING_LEVEL since the level is going away now. */
1306 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1312 /* Remove the binding. */
1314 if (TREE_CODE (decl
) == TREE_LIST
)
1315 decl
= TREE_VALUE (decl
);
1316 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1317 pop_binding (DECL_NAME (decl
), decl
);
1318 else if (TREE_CODE (decl
) == OVERLOAD
)
1319 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1321 my_friendly_abort (0);
1325 /* Remove declarations for any `for' variables from inner scopes
1326 that we kept around. */
1327 for (link
= current_binding_level
->dead_vars_from_for
;
1328 link
; link
= TREE_CHAIN (link
))
1329 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1331 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1332 for (link
= current_binding_level
->type_shadowed
;
1333 link
; link
= TREE_CHAIN (link
))
1334 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1336 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1337 for (link
= current_binding_level
->shadowed_labels
;
1339 link
= TREE_CHAIN (link
))
1342 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1343 list if a `using' declaration put them there. The debugging
1344 back-ends won't understand OVERLOAD, so we remove them here.
1345 Because the BLOCK_VARS are (temporarily) shared with
1346 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1347 popped all the bindings. */
1352 for (d
= &BLOCK_VARS (block
); *d
; )
1354 if (TREE_CODE (*d
) == TREE_LIST
)
1355 *d
= TREE_CHAIN (*d
);
1357 d
= &TREE_CHAIN (*d
);
1361 /* If the level being exited is the top level of a function,
1362 check over all the labels. */
1365 /* Since this is the top level block of a function, the vars are
1366 the function's parameters. Don't leave them in the BLOCK
1367 because they are found in the FUNCTION_DECL instead. */
1368 BLOCK_VARS (block
) = 0;
1372 /* Any uses of undefined labels now operate under constraints
1373 of next binding contour. */
1374 if (current_function
)
1376 struct binding_level
*level_chain
;
1377 level_chain
= current_binding_level
->level_chain
;
1380 struct named_label_list
*labels
;
1381 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1382 if (labels
->binding_level
== current_binding_level
)
1384 labels
->binding_level
= level_chain
;
1385 labels
->names_in_scope
= level_chain
->names
;
1390 tmp
= current_binding_level
->keep
;
1392 pop_binding_level ();
1394 DECL_INITIAL (current_function_decl
) = block
;
1397 if (!block_previously_created
)
1398 current_binding_level
->blocks
1399 = chainon (current_binding_level
->blocks
, block
);
1401 /* If we did not make a block for the level just exited,
1402 any blocks made for inner levels
1403 (since they cannot be recorded as subblocks in that level)
1404 must be carried forward so they will later become subblocks
1405 of something else. */
1407 current_binding_level
->blocks
1408 = chainon (current_binding_level
->blocks
, subblocks
);
1410 /* Take care of compiler's internal binding structures. */
1413 add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1414 /* Each and every BLOCK node created here in `poplevel' is important
1415 (e.g. for proper debugging information) so if we created one
1416 earlier, mark it as "used". */
1418 TREE_USED (block
) = 1;
1419 block
= poplevel (keep
, reverse
, functionbody
);
1422 /* Each and every BLOCK node created here in `poplevel' is important
1423 (e.g. for proper debugging information) so if we created one
1424 earlier, mark it as "used". */
1426 TREE_USED (block
) = 1;
1430 /* Delete the node BLOCK from the current binding level.
1431 This is used for the block inside a stmt expr ({...})
1432 so that the block can be reinserted where appropriate. */
1435 delete_block (block
)
1439 if (current_binding_level
->blocks
== block
)
1440 current_binding_level
->blocks
= TREE_CHAIN (block
);
1441 for (t
= current_binding_level
->blocks
; t
;)
1443 if (TREE_CHAIN (t
) == block
)
1444 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1448 TREE_CHAIN (block
) = NULL_TREE
;
1449 /* Clear TREE_USED which is always set by poplevel.
1450 The flag is set again if insert_block is called. */
1451 TREE_USED (block
) = 0;
1454 /* Insert BLOCK at the end of the list of subblocks of the
1455 current binding level. This is used when a BIND_EXPR is expanded,
1456 to handle the BLOCK node inside the BIND_EXPR. */
1459 insert_block (block
)
1462 TREE_USED (block
) = 1;
1463 current_binding_level
->blocks
1464 = chainon (current_binding_level
->blocks
, block
);
1467 /* Set the BLOCK node for the innermost scope
1468 (the one we are currently in). */
1472 register tree block
;
1474 current_binding_level
->this_block
= block
;
1477 /* Do a pushlevel for class declarations. */
1482 register struct binding_level
*newlevel
;
1484 /* Reuse or create a struct for this binding level. */
1485 #if defined(DEBUG_CP_BINDING_LEVELS)
1487 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1488 if (free_binding_level
)
1489 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1491 newlevel
= free_binding_level
;
1492 free_binding_level
= free_binding_level
->level_chain
;
1495 newlevel
= make_binding_level ();
1497 #if defined(DEBUG_CP_BINDING_LEVELS)
1499 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1501 push_binding_level (newlevel
, 0, 0);
1503 class_binding_level
= current_binding_level
;
1504 class_binding_level
->parm_flag
= 2;
1507 /* ...and a poplevel for class declarations. */
1512 register struct binding_level
*level
= class_binding_level
;
1515 my_friendly_assert (level
!= 0, 354);
1517 /* If we're leaving a toplevel class, don't bother to do the setting
1518 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1519 shouldn't even be used when current_class_type isn't set, and second,
1520 if we don't touch it here, we're able to use the cache effect if the
1521 next time we're entering a class scope, it is the same class. */
1522 if (current_class_depth
!= 1)
1524 struct binding_level
* b
;
1526 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1527 for (shadowed
= level
->class_shadowed
;
1529 shadowed
= TREE_CHAIN (shadowed
))
1530 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1532 /* Find the next enclosing class, and recreate
1533 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1534 b
= level
->level_chain
;
1535 while (b
&& b
->parm_flag
!= 2)
1539 for (shadowed
= b
->class_shadowed
;
1541 shadowed
= TREE_CHAIN (shadowed
))
1545 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1546 while (t
&& BINDING_LEVEL (t
) != b
)
1550 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1551 = BINDING_VALUE (t
);
1555 /* Remember to save what IDENTIFIER's were bound in this scope so we
1556 can recover from cache misses. */
1558 previous_class_type
= current_class_type
;
1559 previous_class_values
= class_binding_level
->class_shadowed
;
1561 for (shadowed
= level
->type_shadowed
;
1563 shadowed
= TREE_CHAIN (shadowed
))
1564 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1566 /* Remove the bindings for all of the class-level declarations. */
1567 for (shadowed
= level
->class_shadowed
;
1569 shadowed
= TREE_CHAIN (shadowed
))
1570 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1572 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1573 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1574 class_binding_level
->parm_flag
,
1575 class_binding_level
->keep
);
1577 /* Now, pop out of the binding level which we created up in the
1578 `pushlevel_class' routine. */
1579 #if defined(DEBUG_CP_BINDING_LEVELS)
1581 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1583 pop_binding_level ();
1586 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1587 for any names in enclosing classes. */
1590 clear_identifier_class_values ()
1594 if (!class_binding_level
)
1597 for (t
= class_binding_level
->class_shadowed
;
1600 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1603 /* Returns non-zero if T is a virtual function table. */
1606 vtable_decl_p (t
, data
)
1608 void *data ATTRIBUTE_UNUSED
;
1610 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1613 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1617 vtype_decl_p (t
, data
)
1619 void *data ATTRIBUTE_UNUSED
;
1621 return (TREE_CODE (t
) == TYPE_DECL
1622 && TREE_TYPE (t
) != error_mark_node
1623 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1624 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1627 /* Return the declarations that are members of the namespace NS. */
1630 cp_namespace_decls (ns
)
1633 return NAMESPACE_LEVEL (ns
)->names
;
1636 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1637 itself, calling F for each. The DATA is passed to F as well. */
1640 walk_namespaces_r (namespace, f
, data
)
1642 walk_namespaces_fn f
;
1648 result
|= (*f
) (namespace, data
);
1650 for (current
= cp_namespace_decls (namespace);
1652 current
= TREE_CHAIN (current
))
1654 if (TREE_CODE (current
) != NAMESPACE_DECL
1655 || DECL_NAMESPACE_ALIAS (current
))
1657 if (!DECL_LANG_SPECIFIC (current
))
1660 my_friendly_assert (current
== std_node
, 393);
1664 /* We found a namespace. */
1665 result
|= walk_namespaces_r (current
, f
, data
);
1671 /* Walk all the namespaces, calling F for each. The DATA is passed to
1675 walk_namespaces (f
, data
)
1676 walk_namespaces_fn f
;
1679 return walk_namespaces_r (global_namespace
, f
, data
);
1682 struct walk_globals_data
{
1683 walk_globals_pred p
;
1688 /* Walk the global declarations in NAMESPACE. Whenever one is found
1689 for which P returns non-zero, call F with its address. If any call
1690 to F returns a non-zero value, return a non-zero value. */
1693 walk_globals_r (namespace, data
)
1697 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1698 walk_globals_pred p
= wgd
->p
;
1699 walk_globals_fn f
= wgd
->f
;
1700 void *d
= wgd
->data
;
1704 t
= &NAMESPACE_LEVEL (namespace)->names
;
1711 result
|= (*f
) (t
, d
);
1713 /* If F changed *T, then *T still points at the next item to
1716 t
= &TREE_CHAIN (*t
);
1722 /* Walk the global declarations. Whenever one is found for which P
1723 returns non-zero, call F with its address. If any call to F
1724 returns a non-zero value, return a non-zero value. */
1727 walk_globals (p
, f
, data
)
1728 walk_globals_pred p
;
1732 struct walk_globals_data wgd
;
1737 return walk_namespaces (walk_globals_r
, &wgd
);
1740 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1741 DATA is non-NULL, this is the last time we will call
1742 wrapup_global_declarations for this NAMESPACE. */
1745 wrapup_globals_for_namespace (namespace, data
)
1749 tree globals
= cp_namespace_decls (namespace);
1750 int len
= list_length (globals
);
1751 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1755 int last_time
= (data
!= 0);
1757 if (last_time
&& namespace == global_namespace
)
1758 /* Let compile_file handle the global namespace. */
1761 /* Process the decls in reverse order--earliest first.
1762 Put them into VEC from back to front, then take out from front. */
1764 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1765 vec
[len
- i
- 1] = decl
;
1769 check_global_declarations (vec
, len
);
1773 /* Temporarily mark vtables as external. That prevents
1774 wrapup_global_declarations from writing them out; we must process
1775 them ourselves in finish_vtable_vardecl. */
1776 for (i
= 0; i
< len
; ++i
)
1777 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1779 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1780 DECL_EXTERNAL (vec
[i
]) = 1;
1783 /* Write out any globals that need to be output. */
1784 result
= wrapup_global_declarations (vec
, len
);
1786 /* Undo the hack to DECL_EXTERNAL above. */
1787 for (i
= 0; i
< len
; ++i
)
1788 if (vtable_decl_p (vec
[i
], /*data=*/0)
1789 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1791 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1792 DECL_EXTERNAL (vec
[i
]) = 0;
1799 /* Mark ARG (which is really a struct binding_level **) for GC. */
1802 mark_binding_level (arg
)
1805 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1809 ggc_mark_tree (lvl
->names
);
1810 ggc_mark_tree (lvl
->tags
);
1811 ggc_mark_tree (lvl
->usings
);
1812 ggc_mark_tree (lvl
->using_directives
);
1813 ggc_mark_tree (lvl
->class_shadowed
);
1814 ggc_mark_tree (lvl
->type_shadowed
);
1815 ggc_mark_tree (lvl
->shadowed_labels
);
1816 ggc_mark_tree (lvl
->blocks
);
1817 ggc_mark_tree (lvl
->this_block
);
1818 ggc_mark_tree (lvl
->incomplete
);
1819 ggc_mark_tree (lvl
->dead_vars_from_for
);
1821 lvl
= lvl
->level_chain
;
1825 /* For debugging. */
1826 static int no_print_functions
= 0;
1827 static int no_print_builtins
= 0;
1830 print_binding_level (lvl
)
1831 struct binding_level
*lvl
;
1835 fprintf (stderr
, " blocks=");
1836 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1837 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1838 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1839 if (lvl
->tag_transparent
)
1840 fprintf (stderr
, " tag-transparent");
1841 if (lvl
->more_cleanups_ok
)
1842 fprintf (stderr
, " more-cleanups-ok");
1843 if (lvl
->have_cleanups
)
1844 fprintf (stderr
, " have-cleanups");
1845 fprintf (stderr
, "\n");
1848 fprintf (stderr
, " names:\t");
1849 /* We can probably fit 3 names to a line? */
1850 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1852 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1854 if (no_print_builtins
1855 && (TREE_CODE (t
) == TYPE_DECL
)
1856 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1859 /* Function decls tend to have longer names. */
1860 if (TREE_CODE (t
) == FUNCTION_DECL
)
1867 fprintf (stderr
, "\n\t");
1870 print_node_brief (stderr
, "", t
, 0);
1871 if (t
== error_mark_node
)
1875 fprintf (stderr
, "\n");
1879 fprintf (stderr
, " tags:\t");
1881 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1883 if (TREE_PURPOSE (t
) == NULL_TREE
)
1885 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1892 fprintf (stderr
, "\n\t");
1895 if (TREE_PURPOSE (t
) == NULL_TREE
)
1897 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1898 fprintf (stderr
, ">");
1900 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1901 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1904 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1905 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1906 fprintf (stderr
, ">");
1910 fprintf (stderr
, "\n");
1912 if (lvl
->class_shadowed
)
1914 fprintf (stderr
, " class-shadowed:");
1915 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1917 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1919 fprintf (stderr
, "\n");
1921 if (lvl
->type_shadowed
)
1923 fprintf (stderr
, " type-shadowed:");
1924 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1926 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1928 fprintf (stderr
, "\n");
1933 print_other_binding_stack (stack
)
1934 struct binding_level
*stack
;
1936 struct binding_level
*level
;
1937 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1939 fprintf (stderr
, "binding level ");
1940 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1941 fprintf (stderr
, "\n");
1942 print_binding_level (level
);
1947 print_binding_stack ()
1949 struct binding_level
*b
;
1950 fprintf (stderr
, "current_binding_level=");
1951 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
1952 fprintf (stderr
, "\nclass_binding_level=");
1953 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
1954 fprintf (stderr
, "\nglobal_binding_level=");
1955 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
1956 fprintf (stderr
, "\n");
1957 if (class_binding_level
)
1959 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1960 if (b
== current_binding_level
)
1963 b
= class_binding_level
;
1965 b
= current_binding_level
;
1968 b
= current_binding_level
;
1969 print_other_binding_stack (b
);
1970 fprintf (stderr
, "global:\n");
1971 print_binding_level (global_binding_level
);
1974 /* Namespace binding access routines: The namespace_bindings field of
1975 the identifier is polymorphic, with three possible values:
1976 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
1977 indicating the BINDING_VALUE of global_namespace. */
1979 /* Check whether the a binding for the name to scope is known.
1980 Assumes that the bindings of the name are already a list
1981 of bindings. Returns the binding found, or NULL_TREE. */
1984 find_binding (name
, scope
)
1988 tree iter
, prev
= NULL_TREE
;
1990 scope
= ORIGINAL_NAMESPACE (scope
);
1992 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
1993 iter
= TREE_CHAIN (iter
))
1995 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
1996 if (BINDING_SCOPE (iter
) == scope
)
1998 /* Move binding found to the front of the list, so
1999 subsequent lookups will find it faster. */
2002 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2003 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2004 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2013 /* Always returns a binding for name in scope. If the
2014 namespace_bindings is not a list, convert it to one first.
2015 If no binding is found, make a new one. */
2018 binding_for_name (name
, scope
)
2022 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2025 scope
= ORIGINAL_NAMESPACE (scope
);
2027 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2029 /* Get rid of optimization for global scope. */
2030 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2031 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2032 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2034 if (b
&& (result
= find_binding (name
, scope
)))
2036 /* Not found, make a new one. */
2037 result
= make_node (CPLUS_BINDING
);
2038 TREE_CHAIN (result
) = b
;
2039 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2040 BINDING_SCOPE (result
) = scope
;
2041 BINDING_TYPE (result
) = NULL_TREE
;
2042 BINDING_VALUE (result
) = NULL_TREE
;
2046 /* Return the binding value for name in scope, considering that
2047 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2050 namespace_binding (name
, scope
)
2054 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2057 if (scope
== NULL_TREE
)
2058 scope
= global_namespace
;
2059 if (TREE_CODE (b
) != CPLUS_BINDING
)
2060 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2061 name
= find_binding (name
,scope
);
2062 if (name
== NULL_TREE
)
2064 return BINDING_VALUE (name
);
2067 /* Set the binding value for name in scope. If modifying the binding
2068 of global_namespace is attempted, try to optimize it. */
2071 set_namespace_binding (name
, scope
, val
)
2078 if (scope
== NULL_TREE
)
2079 scope
= global_namespace
;
2081 if (scope
== global_namespace
)
2083 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2084 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2086 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2090 b
= binding_for_name (name
, scope
);
2091 BINDING_VALUE (b
) = val
;
2094 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2095 select a name that is unique to this compilation unit. */
2098 push_namespace (name
)
2103 int implicit_use
= 0;
2105 if (!global_namespace
)
2107 /* This must be ::. */
2108 my_friendly_assert (name
== get_identifier ("::"), 377);
2113 /* The name of anonymous namespace is unique for the translation
2115 if (!anonymous_namespace_name
)
2116 anonymous_namespace_name
= get_file_function_name ('N');
2117 name
= anonymous_namespace_name
;
2118 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2120 /* Reopening anonymous namespace. */
2124 else if (current_namespace
== global_namespace
2125 && name
== DECL_NAME (std_node
))
2132 /* Check whether this is an extended namespace definition. */
2133 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2134 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2137 if (DECL_NAMESPACE_ALIAS (d
))
2139 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2140 d
, DECL_NAMESPACE_ALIAS (d
));
2141 d
= DECL_NAMESPACE_ALIAS (d
);
2148 /* Make a new namespace, binding the name to it. */
2149 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2150 /* The global namespace is not pushed, and the global binding
2151 level is set elsewhere. */
2156 declare_namespace_level ();
2157 NAMESPACE_LEVEL (d
) = current_binding_level
;
2161 resume_binding_level (NAMESPACE_LEVEL (d
));
2164 do_using_directive (d
);
2165 /* Enter the name space. */
2166 current_namespace
= d
;
2169 /* Pop from the scope of the current namespace. */
2174 if (current_namespace
== global_namespace
)
2176 my_friendly_assert (in_std
>0, 980421);
2180 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2181 /* The binding level is not popped, as it might be re-opened later. */
2182 suspend_binding_level ();
2185 /* Push into the scope of the namespace NS, even if it is deeply
2186 nested within another namespace. */
2189 push_nested_namespace (ns
)
2192 if (ns
== global_namespace
)
2193 push_to_top_level ();
2196 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2197 push_namespace (DECL_NAME (ns
));
2201 /* Pop back from the scope of the namespace NS, which was previously
2202 entered with push_nested_namespace. */
2205 pop_nested_namespace (ns
)
2208 while (ns
!= global_namespace
)
2211 ns
= CP_DECL_CONTEXT (ns
);
2214 pop_from_top_level ();
2218 /* Subroutines for reverting temporarily to top-level for instantiation
2219 of templates and such. We actually need to clear out the class- and
2220 local-value slots of all identifiers, so that only the global values
2221 are at all visible. Simply setting current_binding_level to the global
2222 scope isn't enough, because more binding levels may be pushed. */
2223 struct saved_scope
*scope_chain
;
2225 /* Mark ST for GC. */
2229 struct stmt_tree
*st
;
2231 ggc_mark_tree (st
->x_last_stmt
);
2232 ggc_mark_tree (st
->x_last_expr_type
);
2235 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2238 mark_saved_scope (arg
)
2241 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2244 mark_binding_level (&t
->class_bindings
);
2245 ggc_mark_tree (t
->old_bindings
);
2246 ggc_mark_tree (t
->old_namespace
);
2247 ggc_mark_tree (t
->class_name
);
2248 ggc_mark_tree (t
->class_type
);
2249 ggc_mark_tree (t
->access_specifier
);
2250 ggc_mark_tree (t
->function_decl
);
2252 ggc_mark_tree_varray (t
->lang_base
);
2253 ggc_mark_tree (t
->lang_name
);
2254 ggc_mark_tree (t
->x_function_parms
);
2255 ggc_mark_tree (t
->template_parms
);
2256 ggc_mark_tree (t
->x_previous_class_type
);
2257 ggc_mark_tree (t
->x_previous_class_values
);
2258 ggc_mark_tree (t
->x_saved_tree
);
2260 mark_stmt_tree (&t
->x_stmt_tree
);
2261 mark_binding_level (&t
->bindings
);
2267 store_bindings (names
, old_bindings
)
2268 tree names
, old_bindings
;
2271 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2273 tree binding
, t1
, id
;
2275 if (TREE_CODE (t
) == TREE_LIST
)
2276 id
= TREE_PURPOSE (t
);
2281 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2282 we have no IDENTIFIER_BINDING if we have left the class
2283 scope, but cached the class-level declarations. */
2284 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2287 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2288 if (TREE_VEC_ELT (t1
, 0) == id
)
2291 binding
= make_tree_vec (4);
2295 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2296 TREE_VEC_ELT (binding
, 0) = id
;
2297 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2298 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2299 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2300 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2301 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2303 TREE_CHAIN (binding
) = old_bindings
;
2304 old_bindings
= binding
;
2308 return old_bindings
;
2312 maybe_push_to_top_level (pseudo
)
2315 struct saved_scope
*s
;
2316 struct binding_level
*b
;
2320 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2322 b
= scope_chain
? current_binding_level
: 0;
2324 /* If we're in the middle of some function, save our state. */
2325 if (current_function
)
2328 push_function_context_to (NULL_TREE
);
2333 old_bindings
= NULL_TREE
;
2334 if (scope_chain
&& previous_class_type
)
2335 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2337 /* Have to include global_binding_level, because class-level decls
2338 aren't listed anywhere useful. */
2339 for (; b
; b
= b
->level_chain
)
2343 /* Template IDs are inserted into the global level. If they were
2344 inserted into namespace level, finish_file wouldn't find them
2345 when doing pending instantiations. Therefore, don't stop at
2346 namespace level, but continue until :: . */
2347 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2350 old_bindings
= store_bindings (b
->names
, old_bindings
);
2351 /* We also need to check class_shadowed to save class-level type
2352 bindings, since pushclass doesn't fill in b->names. */
2353 if (b
->parm_flag
== 2)
2354 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2356 /* Unwind type-value slots back to top level. */
2357 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2358 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2360 s
->prev
= scope_chain
;
2361 s
->old_bindings
= old_bindings
;
2363 s
->need_pop_function_context
= need_pop
;
2364 s
->function_decl
= current_function_decl
;
2367 current_function_decl
= NULL_TREE
;
2368 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2369 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2370 current_lang_name
= lang_name_cplusplus
;
2371 strict_prototype
= strict_prototypes_lang_cplusplus
;
2372 current_namespace
= global_namespace
;
2376 push_to_top_level ()
2378 maybe_push_to_top_level (0);
2382 pop_from_top_level ()
2384 struct saved_scope
*s
= scope_chain
;
2387 /* Clear out class-level bindings cache. */
2388 if (previous_class_type
)
2389 invalidate_class_lookup_cache ();
2391 VARRAY_FREE (current_lang_base
);
2393 scope_chain
= s
->prev
;
2394 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2396 tree id
= TREE_VEC_ELT (t
, 0);
2399 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2400 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2401 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2405 if (current_lang_name
== lang_name_cplusplus
)
2406 strict_prototype
= strict_prototypes_lang_cplusplus
;
2407 else if (current_lang_name
== lang_name_c
)
2408 strict_prototype
= strict_prototypes_lang_c
;
2410 /* If we were in the middle of compiling a function, restore our
2412 if (s
->need_pop_function_context
)
2413 pop_function_context_from (NULL_TREE
);
2414 current_function_decl
= s
->function_decl
;
2419 /* Push a definition of struct, union or enum tag "name".
2420 into binding_level "b". "type" should be the type node,
2421 We assume that the tag "name" is not already defined.
2423 Note that the definition may really be just a forward reference.
2424 In that case, the TYPE_SIZE will be a NULL_TREE.
2426 C++ gratuitously puts all these tags in the name space. */
2428 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2429 record the shadowed value for this binding contour. TYPE is
2430 the type that ID maps to. */
2433 set_identifier_type_value_with_scope (id
, type
, b
)
2436 struct binding_level
*b
;
2438 if (!b
->namespace_p
)
2440 /* Shadow the marker, not the real thing, so that the marker
2441 gets restored later. */
2442 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2444 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2448 tree binding
= binding_for_name (id
, current_namespace
);
2449 BINDING_TYPE (binding
) = type
;
2450 /* Store marker instead of real type. */
2451 type
= global_type_node
;
2453 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2456 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2459 set_identifier_type_value (id
, type
)
2463 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2466 /* Return the type associated with id. */
2469 identifier_type_value (id
)
2472 /* There is no type with that name, anywhere. */
2473 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2475 /* This is not the type marker, but the real thing. */
2476 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2477 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2478 /* Have to search for it. It must be on the global level, now.
2479 Ask lookup_name not to return non-types. */
2480 id
= lookup_name_real (id
, 2, 1, 0);
2482 return TREE_TYPE (id
);
2486 /* Pop off extraneous binding levels left over due to syntax errors.
2488 We don't pop past namespaces, as they might be valid. */
2493 #ifdef DEBUG_CP_BINDING_LEVELS
2494 fprintf (stderr
, "XXX entering pop_everything ()\n");
2496 while (!toplevel_bindings_p ())
2498 if (current_binding_level
->parm_flag
== 2)
2499 pop_nested_class ();
2503 #ifdef DEBUG_CP_BINDING_LEVELS
2504 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2508 /* The type TYPE is being declared. If it is a class template, or a
2509 specialization of a class template, do any processing required and
2510 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2511 being declared a friend. B is the binding level at which this TYPE
2514 Returns the TYPE_DECL for TYPE, which may have been altered by this
2518 maybe_process_template_type_declaration (type
, globalize
, b
)
2521 struct binding_level
* b
;
2523 tree decl
= TYPE_NAME (type
);
2525 if (processing_template_parmlist
)
2526 /* You can't declare a new template type in a template parameter
2527 list. But, you can declare a non-template type:
2529 template <class A*> struct S;
2531 is a forward-declaration of `A'. */
2535 maybe_check_template_type (type
);
2537 my_friendly_assert (IS_AGGR_TYPE (type
)
2538 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2541 if (processing_template_decl
)
2543 /* This may change after the call to
2544 push_template_decl_real, but we want the original value. */
2545 tree name
= DECL_NAME (decl
);
2547 decl
= push_template_decl_real (decl
, globalize
);
2548 /* If the current binding level is the binding level for the
2549 template parameters (see the comment in
2550 begin_template_parm_list) and the enclosing level is a class
2551 scope, and we're not looking at a friend, push the
2552 declaration of the member class into the class scope. In the
2553 friend case, push_template_decl will already have put the
2554 friend into global scope, if appropriate. */
2555 if (TREE_CODE (type
) != ENUMERAL_TYPE
2556 && !globalize
&& b
->pseudo_global
2557 && b
->level_chain
->parm_flag
== 2)
2559 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2560 /* Put this tag on the list of tags for the class, since
2561 that won't happen below because B is not the class
2562 binding level, but is instead the pseudo-global level. */
2563 b
->level_chain
->tags
=
2564 tree_cons (name
, type
, b
->level_chain
->tags
);
2565 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2566 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2574 /* In C++, you don't have to write `struct S' to refer to `S'; you
2575 can just use `S'. We accomplish this by creating a TYPE_DECL as
2576 if the user had written `typedef struct S S'. Create and return
2577 the TYPE_DECL for TYPE. */
2580 create_implicit_typedef (name
, type
)
2586 decl
= build_decl (TYPE_DECL
, name
, type
);
2587 SET_DECL_ARTIFICIAL (decl
);
2588 /* There are other implicit type declarations, like the one *within*
2589 a class that allows you to write `S::S'. We must distinguish
2591 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2592 TYPE_NAME (type
) = decl
;
2597 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2598 Normally put it into the inner-most non-tag-transparent scope,
2599 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2600 The latter is needed for implicit declarations. */
2603 pushtag (name
, type
, globalize
)
2607 register struct binding_level
*b
;
2609 b
= current_binding_level
;
2610 while (b
->tag_transparent
2611 || (globalize
&& b
->parm_flag
== 2))
2614 b
->tags
= tree_cons (name
, type
, b
->tags
);
2618 /* Do C++ gratuitous typedefing. */
2619 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2621 register tree d
= NULL_TREE
;
2623 tree context
= TYPE_CONTEXT (type
);
2627 tree cs
= current_scope ();
2631 else if (cs
!= NULL_TREE
2632 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2633 /* When declaring a friend class of a local class, we want
2634 to inject the newly named class into the scope
2635 containing the local class, not the namespace scope. */
2636 context
= hack_decl_function_context (get_type_decl (cs
));
2639 context
= current_namespace
;
2641 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2642 || b
->parm_flag
== 2)
2645 if (current_lang_name
== lang_name_java
)
2646 TYPE_FOR_JAVA (type
) = 1;
2648 d
= create_implicit_typedef (name
, type
);
2649 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2651 set_identifier_type_value_with_scope (name
, type
, b
);
2653 d
= maybe_process_template_type_declaration (type
,
2656 if (b
->parm_flag
== 2)
2658 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2659 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2660 class. But if it's a member template class, we
2661 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2663 finish_member_declaration (d
);
2665 pushdecl_class_level (d
);
2668 d
= pushdecl_with_scope (d
, b
);
2670 if (ANON_AGGRNAME_P (name
))
2671 DECL_IGNORED_P (d
) = 1;
2673 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2674 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2675 if (!uses_template_parms (type
))
2676 DECL_ASSEMBLER_NAME (d
)
2677 = get_identifier (build_overload_name (type
, 1, 1));
2679 if (b
->parm_flag
== 2)
2681 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2682 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2686 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2687 /* Use the canonical TYPE_DECL for this node. */
2688 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2691 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2692 will be the tagged type we just added to the current
2693 binding level. This fake NULL-named TYPE_DECL node helps
2694 dwarfout.c to know when it needs to output a
2695 representation of a tagged type, and it also gives us a
2696 convenient place to record the "scope start" address for
2699 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2700 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2704 /* Counter used to create anonymous type names. */
2706 static int anon_cnt
= 0;
2708 /* Return an IDENTIFIER which can be used as a name for
2709 anonymous structs and unions. */
2716 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2717 return get_identifier (buf
);
2720 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2721 This keeps dbxout from getting confused. */
2726 register struct binding_level
*b
;
2728 static int last_cnt
= 0;
2730 /* Fast out if no new anon names were declared. */
2731 if (last_cnt
== anon_cnt
)
2734 b
= current_binding_level
;
2735 while (b
->tag_transparent
)
2740 /* A NULL purpose means we have already processed all tags
2741 from here to the end of the list. */
2742 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2744 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2745 TREE_PURPOSE (tags
) = NULL_TREE
;
2746 tags
= TREE_CHAIN (tags
);
2748 last_cnt
= anon_cnt
;
2751 /* Subroutine of duplicate_decls: return truthvalue of whether
2752 or not types of these decls match.
2754 For C++, we must compare the parameter list so that `int' can match
2755 `int&' in a parameter position, but `int&' is not confused with
2759 decls_match (newdecl
, olddecl
)
2760 tree newdecl
, olddecl
;
2764 if (newdecl
== olddecl
)
2767 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2768 /* If the two DECLs are not even the same kind of thing, we're not
2769 interested in their types. */
2772 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2774 tree f1
= TREE_TYPE (newdecl
);
2775 tree f2
= TREE_TYPE (olddecl
);
2776 tree p1
= TYPE_ARG_TYPES (f1
);
2777 tree p2
= TYPE_ARG_TYPES (f2
);
2779 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2780 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2781 && DECL_LANGUAGE (olddecl
) == lang_c
))
2784 /* When we parse a static member function definition,
2785 we put together a FUNCTION_DECL which thinks its type
2786 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2788 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2789 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2790 else if (TREE_CODE (f2
) == METHOD_TYPE
2791 && DECL_STATIC_FUNCTION_P (newdecl
))
2792 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2794 /* Here we must take care of the case where new default
2795 parameters are specified. Also, warn if an old
2796 declaration becomes ambiguous because default
2797 parameters may cause the two to be ambiguous. */
2798 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2800 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2801 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2803 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2807 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2809 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2812 types_match
= self_promoting_args_p (p1
);
2813 if (p1
== void_list_node
)
2814 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2816 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2817 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2819 types_match
= self_promoting_args_p (p2
);
2820 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2823 types_match
= compparms (p1
, p2
);
2828 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2830 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2831 DECL_TEMPLATE_PARMS (olddecl
)))
2834 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2837 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2838 DECL_TEMPLATE_RESULT (newdecl
));
2842 if (TREE_TYPE (newdecl
) == error_mark_node
)
2843 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2844 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2845 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2846 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2849 types_match
= comptypes (TREE_TYPE (newdecl
),
2850 TREE_TYPE (olddecl
),
2851 COMPARE_REDECLARATION
);
2857 /* If NEWDECL is `static' and an `extern' was seen previously,
2858 warn about it. OLDDECL is the previous declaration.
2860 Note that this does not apply to the C++ case of declaring
2861 a variable `extern const' and then later `const'.
2863 Don't complain about built-in functions, since they are beyond
2864 the user's control. */
2867 warn_extern_redeclared_static (newdecl
, olddecl
)
2868 tree newdecl
, olddecl
;
2870 static const char *explicit_extern_static_warning
2871 = "`%D' was declared `extern' and later `static'";
2872 static const char *implicit_extern_static_warning
2873 = "`%D' was declared implicitly `extern' and later `static'";
2877 if (TREE_CODE (newdecl
) == TYPE_DECL
2878 || TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2881 /* Don't get confused by static member functions; that's a different
2883 if (TREE_CODE (newdecl
) == FUNCTION_DECL
2884 && DECL_STATIC_FUNCTION_P (newdecl
))
2887 /* If the old declaration was `static', or the new one isn't, then
2888 then everything is OK. */
2889 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
2892 /* It's OK to declare a builtin function as `static'. */
2893 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2894 && DECL_ARTIFICIAL (olddecl
))
2897 name
= DECL_ASSEMBLER_NAME (newdecl
);
2898 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2899 ? implicit_extern_static_warning
2900 : explicit_extern_static_warning
, newdecl
);
2901 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2904 /* Handle when a new declaration NEWDECL has the same name as an old
2905 one OLDDECL in the same binding contour. Prints an error message
2908 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2909 Otherwise, return 0. */
2912 duplicate_decls (newdecl
, olddecl
)
2913 tree newdecl
, olddecl
;
2915 unsigned olddecl_uid
= DECL_UID (olddecl
);
2916 int olddecl_friend
= 0, types_match
= 0;
2917 int new_defines_function
= 0;
2919 if (newdecl
== olddecl
)
2922 types_match
= decls_match (newdecl
, olddecl
);
2924 /* If either the type of the new decl or the type of the old decl is an
2925 error_mark_node, then that implies that we have already issued an
2926 error (earlier) for some bogus type specification, and in that case,
2927 it is rather pointless to harass the user with yet more error message
2928 about the same declaration, so just pretend the types match here. */
2929 if (TREE_TYPE (newdecl
) == error_mark_node
2930 || TREE_TYPE (olddecl
) == error_mark_node
)
2933 /* Check for redeclaration and other discrepancies. */
2934 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2935 && DECL_ARTIFICIAL (olddecl
))
2937 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2939 /* If you declare a built-in or predefined function name as static,
2940 the old definition is overridden, but optionally warn this was a
2941 bad choice of name. */
2942 if (! TREE_PUBLIC (newdecl
))
2945 cp_warning ("shadowing %s function `%#D'",
2946 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2948 /* Discard the old built-in function. */
2951 /* If the built-in is not ansi, then programs can override
2952 it even globally without an error. */
2953 else if (! DECL_BUILT_IN (olddecl
))
2954 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2958 cp_error ("declaration of `%#D'", newdecl
);
2959 cp_error ("conflicts with built-in declaration `%#D'",
2964 else if (!types_match
)
2966 if ((DECL_LANGUAGE (newdecl
) == lang_c
2967 && DECL_LANGUAGE (olddecl
) == lang_c
)
2968 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
2969 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
2971 /* A near match; override the builtin. */
2973 if (TREE_PUBLIC (newdecl
))
2975 cp_warning ("new declaration `%#D'", newdecl
);
2976 cp_warning ("ambiguates built-in declaration `%#D'",
2979 else if (warn_shadow
)
2980 cp_warning ("shadowing %s function `%#D'",
2981 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2985 /* Discard the old built-in function. */
2989 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
2991 /* If a builtin function is redeclared as `static', merge
2992 the declarations, but make the original one static. */
2993 DECL_THIS_STATIC (olddecl
) = 1;
2994 TREE_PUBLIC (olddecl
) = 0;
2996 /* Make the olddeclaration consistent with the new one so that
2997 all remnants of the builtin-ness of this function will be
2999 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3000 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3001 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3002 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3006 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3008 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3009 && TREE_CODE (newdecl
) != TYPE_DECL
3010 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3011 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3012 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3013 && TREE_CODE (olddecl
) != TYPE_DECL
3014 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3015 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3018 /* We do nothing special here, because C++ does such nasty
3019 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3020 get shadowed, and know that if we need to find a TYPE_DECL
3021 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3022 slot of the identifier. */
3026 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3027 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3028 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3029 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3032 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3033 if (TREE_CODE (olddecl
) == TREE_LIST
)
3034 olddecl
= TREE_VALUE (olddecl
);
3035 cp_error_at ("previous declaration of `%#D'", olddecl
);
3037 /* New decl is completely inconsistent with the old one =>
3038 tell caller to replace the old one. */
3042 else if (!types_match
)
3044 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3045 /* These are certainly not duplicate declarations; they're
3046 from different scopes. */
3049 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3051 /* The name of a class template may not be declared to refer to
3052 any other template, class, function, object, namespace, value,
3053 or type in the same scope. */
3054 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3055 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3057 cp_error ("declaration of template `%#D'", newdecl
);
3058 cp_error_at ("conflicts with previous declaration `%#D'",
3061 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3062 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3063 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3064 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3065 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3066 DECL_TEMPLATE_PARMS (olddecl
)))
3068 cp_error ("new declaration `%#D'", newdecl
);
3069 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3073 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3075 if (DECL_LANGUAGE (newdecl
) == lang_c
3076 && DECL_LANGUAGE (olddecl
) == lang_c
)
3078 cp_error ("declaration of C function `%#D' conflicts with",
3080 cp_error_at ("previous declaration `%#D' here", olddecl
);
3082 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3083 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3085 cp_error ("new declaration `%#D'", newdecl
);
3086 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3092 /* Already complained about this, so don't do so again. */
3093 else if (current_class_type
== NULL_TREE
3094 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3096 cp_error ("conflicting types for `%#D'", newdecl
);
3097 cp_error_at ("previous declaration as `%#D'", olddecl
);
3100 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3101 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3102 && (!DECL_TEMPLATE_INFO (newdecl
)
3103 || (DECL_TI_TEMPLATE (newdecl
)
3104 != DECL_TI_TEMPLATE (olddecl
))))
3105 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3106 && (!DECL_TEMPLATE_INFO (olddecl
)
3107 || (DECL_TI_TEMPLATE (olddecl
)
3108 != DECL_TI_TEMPLATE (newdecl
))))))
3109 /* It's OK to have a template specialization and a non-template
3110 with the same type, or to have specializations of two
3111 different templates with the same type. Note that if one is a
3112 specialization, and the other is an instantiation of the same
3113 template, that we do not exit at this point. That situation
3114 can occur if we instantiate a template class, and then
3115 specialize one of its methods. This situation is legal, but
3116 the declarations must be merged in the usual way. */
3118 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3119 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3120 && !DECL_USE_TEMPLATE (newdecl
))
3121 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3122 && !DECL_USE_TEMPLATE (olddecl
))))
3123 /* One of the declarations is a template instantiation, and the
3124 other is not a template at all. That's OK. */
3126 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3127 && DECL_NAMESPACE_ALIAS (newdecl
)
3128 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3129 /* Redeclaration of namespace alias, ignore it. */
3133 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3136 cp_error (errmsg
, newdecl
);
3137 if (DECL_NAME (olddecl
) != NULL_TREE
)
3138 cp_error_at ((DECL_INITIAL (olddecl
)
3139 && namespace_bindings_p ())
3140 ? "`%#D' previously defined here"
3141 : "`%#D' previously declared here", olddecl
);
3143 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3144 && DECL_INITIAL (olddecl
) != NULL_TREE
3145 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3146 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3148 /* Prototype decl follows defn w/o prototype. */
3149 cp_warning_at ("prototype for `%#D'", newdecl
);
3150 cp_warning_at ("follows non-prototype definition here", olddecl
);
3152 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3153 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3155 /* extern "C" int foo ();
3156 int foo () { bar (); }
3158 if (current_lang_stack
3159 == &VARRAY_TREE (current_lang_base
, 0))
3160 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3163 cp_error_at ("previous declaration of `%#D' with %L linkage",
3164 olddecl
, DECL_LANGUAGE (olddecl
));
3165 cp_error ("conflicts with new declaration with %L linkage",
3166 DECL_LANGUAGE (newdecl
));
3170 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3172 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3174 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3175 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3178 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3179 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3181 for (; t1
&& t1
!= void_list_node
;
3182 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3183 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3185 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3190 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3192 cp_pedwarn_at ("after previous specification in `%#D'",
3198 cp_error ("default argument given for parameter %d of `%#D'",
3200 cp_error_at ("after previous specification in `%#D'",
3205 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3206 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3208 cp_warning ("`%#D' was used before it was declared inline",
3210 cp_warning_at ("previous non-inline declaration here",
3216 /* If new decl is `static' and an `extern' was seen previously,
3218 warn_extern_redeclared_static (newdecl
, olddecl
);
3220 /* We have committed to returning 1 at this point. */
3221 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3223 /* Now that functions must hold information normally held
3224 by field decls, there is extra work to do so that
3225 declaration information does not get destroyed during
3227 if (DECL_VINDEX (olddecl
))
3228 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3229 if (DECL_CONTEXT (olddecl
))
3230 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3231 if (DECL_CLASS_CONTEXT (olddecl
))
3232 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3233 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3234 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3235 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3236 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3237 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3238 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3239 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3240 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3241 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3243 /* Optionally warn about more than one declaration for the same
3244 name, but don't warn about a function declaration followed by a
3246 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3247 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3248 /* Don't warn about extern decl followed by definition. */
3249 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3250 /* Don't warn about friends, let add_friend take care of it. */
3251 && ! DECL_FRIEND_P (newdecl
))
3253 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3254 cp_warning_at ("previous declaration of `%D'", olddecl
);
3258 /* Deal with C++: must preserve virtual function table size. */
3259 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3261 register tree newtype
= TREE_TYPE (newdecl
);
3262 register tree oldtype
= TREE_TYPE (olddecl
);
3264 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3265 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3267 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3268 CLASSTYPE_FRIEND_CLASSES (newtype
)
3269 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3273 /* Copy all the DECL_... slots specified in the new decl
3274 except for any that we copy here from the old type. */
3275 DECL_MACHINE_ATTRIBUTES (newdecl
)
3276 = merge_machine_decl_attributes (olddecl
, newdecl
);
3278 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3280 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3281 DECL_TEMPLATE_RESULT (olddecl
)))
3282 cp_error ("invalid redeclaration of %D", newdecl
);
3283 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3284 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3285 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3286 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3293 /* Automatically handles default parameters. */
3294 tree oldtype
= TREE_TYPE (olddecl
);
3297 /* Merge the data types specified in the two decls. */
3298 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3300 if (TREE_CODE (newdecl
) == VAR_DECL
)
3301 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3302 /* Do this after calling `common_type' so that default
3303 parameters don't confuse us. */
3304 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3305 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3306 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3308 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3309 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3310 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3311 TYPE_RAISES_EXCEPTIONS (oldtype
));
3313 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3314 && DECL_SOURCE_LINE (olddecl
) != 0
3316 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3317 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3319 cp_error ("declaration of `%F' throws different exceptions",
3321 cp_error_at ("to previous declaration `%F'", olddecl
);
3324 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3326 /* Lay the type out, unless already done. */
3327 if (! same_type_p (newtype
, oldtype
)
3328 && TREE_TYPE (newdecl
) != error_mark_node
3329 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3330 layout_type (TREE_TYPE (newdecl
));
3332 if ((TREE_CODE (newdecl
) == VAR_DECL
3333 || TREE_CODE (newdecl
) == PARM_DECL
3334 || TREE_CODE (newdecl
) == RESULT_DECL
3335 || TREE_CODE (newdecl
) == FIELD_DECL
3336 || TREE_CODE (newdecl
) == TYPE_DECL
)
3337 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3338 layout_decl (newdecl
, 0);
3340 /* Merge the type qualifiers. */
3341 if (TREE_READONLY (newdecl
))
3342 TREE_READONLY (olddecl
) = 1;
3343 if (TREE_THIS_VOLATILE (newdecl
))
3344 TREE_THIS_VOLATILE (olddecl
) = 1;
3346 /* Merge the initialization information. */
3347 if (DECL_INITIAL (newdecl
) == NULL_TREE
3348 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3350 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3351 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3352 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3353 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3354 && DECL_LANG_SPECIFIC (newdecl
)
3355 && DECL_LANG_SPECIFIC (olddecl
))
3356 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3359 /* Merge the section attribute.
3360 We want to issue an error if the sections conflict but that must be
3361 done later in decl_attributes since we are called before attributes
3363 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3364 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3366 /* Keep the old rtl since we can safely use it. */
3367 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3369 /* If cannot merge, then use the new type and qualifiers,
3370 and don't preserve the old rtl. */
3373 /* Clean out any memory we had of the old declaration. */
3374 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3376 TREE_VALUE (oldstatic
) = error_mark_node
;
3378 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3379 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3380 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3381 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3384 /* Merge the storage class information. */
3385 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3386 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3387 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3388 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3389 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3390 if (! DECL_EXTERNAL (olddecl
))
3391 DECL_EXTERNAL (newdecl
) = 0;
3393 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3395 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3396 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3397 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3398 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3399 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3400 /* Don't really know how much of the language-specific
3401 values we should copy from old to new. */
3402 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3403 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3404 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3405 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3406 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3408 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3409 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3410 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3411 DECL_BEFRIENDING_CLASSES (newdecl
)
3412 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3413 DECL_BEFRIENDING_CLASSES (olddecl
));
3416 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3418 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3419 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3421 /* If newdecl is not a specialization, then it is not a
3422 template-related function at all. And that means that we
3423 shoud have exited above, returning 0. */
3424 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3427 if (TREE_USED (olddecl
))
3428 /* From [temp.expl.spec]:
3430 If a template, a member template or the member of a class
3431 template is explicitly specialized then that
3432 specialization shall be declared before the first use of
3433 that specialization that would cause an implicit
3434 instantiation to take place, in every translation unit in
3435 which such a use occurs. */
3436 cp_error ("explicit specialization of %D after first use",
3439 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3441 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3443 /* If either decl says `inline', this fn is inline, unless its
3444 definition was passed already. */
3445 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3446 DECL_INLINE (olddecl
) = 1;
3447 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3451 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3452 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3453 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3455 if (! types_match
|| new_defines_function
)
3457 /* These need to be copied so that the names are available.
3458 Note that if the types do match, we'll preserve inline
3459 info and other bits, but if not, we won't. */
3460 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3461 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3463 if (new_defines_function
)
3464 /* If defining a function declared with other language
3465 linkage, use the previously declared language linkage. */
3466 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3467 else if (types_match
)
3469 /* If redeclaring a builtin function, and not a definition,
3470 it stays built in. */
3471 if (DECL_BUILT_IN (olddecl
))
3473 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3474 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3475 /* If we're keeping the built-in definition, keep the rtl,
3476 regardless of declaration matches. */
3477 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3480 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3482 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3483 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3484 /* Previously saved insns go together with
3485 the function's previous definition. */
3486 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3487 /* Don't clear out the arguments if we're redefining a function. */
3488 if (DECL_ARGUMENTS (olddecl
))
3489 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3491 if (DECL_LANG_SPECIFIC (olddecl
))
3492 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3495 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3497 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3500 /* Now preserve various other info from the definition. */
3501 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3502 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3503 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3504 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3506 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3510 function_size
= sizeof (struct tree_decl
);
3512 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3513 (char *) olddecl
+ sizeof (struct tree_common
),
3514 function_size
- sizeof (struct tree_common
));
3516 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3518 /* If newdecl is a template instantiation, it is possible that
3519 the following sequence of events has occurred:
3521 o A friend function was declared in a class template. The
3522 class template was instantiated.
3524 o The instantiation of the friend declaration was
3525 recorded on the instantiation list, and is newdecl.
3527 o Later, however, instantiate_class_template called pushdecl
3528 on the newdecl to perform name injection. But, pushdecl in
3529 turn called duplicate_decls when it discovered that another
3530 declaration of a global function with the same name already
3533 o Here, in duplicate_decls, we decided to clobber newdecl.
3535 If we're going to do that, we'd better make sure that
3536 olddecl, and not newdecl, is on the list of
3537 instantiations so that if we try to do the instantiation
3538 again we won't get the clobbered declaration. */
3540 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3541 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3543 for (; decls
; decls
= TREE_CHAIN (decls
))
3544 if (TREE_VALUE (decls
) == newdecl
)
3545 TREE_VALUE (decls
) = olddecl
;
3550 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3551 (char *) olddecl
+ sizeof (struct tree_common
),
3552 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3553 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3556 DECL_UID (olddecl
) = olddecl_uid
;
3558 DECL_FRIEND_P (olddecl
) = 1;
3560 /* NEWDECL contains the merged attribute lists.
3561 Update OLDDECL to be the same. */
3562 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3567 /* Record a decl-node X as belonging to the current lexical scope.
3568 Check for errors (such as an incompatible declaration for the same
3569 name already seen in the same scope).
3571 Returns either X or an old decl for the same name.
3572 If an old decl is returned, it may have been smashed
3573 to agree with what X says. */
3581 int need_new_binding
;
3583 /* We shouldn't be calling pushdecl when we're generating RTL for a
3584 function that we already did semantic analysis on previously. */
3585 my_friendly_assert (!current_function
|| doing_semantic_analysis_p (),
3588 name
= DECL_ASSEMBLER_NAME (x
);
3589 need_new_binding
= 1;
3591 if (DECL_TEMPLATE_PARM_P (x
))
3592 /* Template parameters have no context; they are not X::T even
3593 when declared within a class or namespace. */
3597 if (current_function_decl
&& x
!= current_function_decl
3598 /* A local declaration for a function doesn't constitute
3600 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3601 /* A local declaration for an `extern' variable is in the
3602 scoped of the current namespace, not the current
3604 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3605 /* Don't change DECL_CONTEXT of virtual methods. */
3606 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3607 && !DECL_CONTEXT (x
))
3608 DECL_CONTEXT (x
) = current_function_decl
;
3609 if (!DECL_CONTEXT (x
))
3610 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3612 /* If this is the declaration for a namespace-scope function,
3613 but the declaration itself is in a local scope, mark the
3615 if (TREE_CODE (x
) == FUNCTION_DECL
3616 && DECL_NAMESPACE_SCOPE_P (x
)
3617 && current_function_decl
3618 && x
!= current_function_decl
)
3619 DECL_LOCAL_FUNCTION_P (x
) = 1;
3622 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3623 compiler wants to use. */
3624 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3625 || TREE_CODE (x
) == NAMESPACE_DECL
)
3626 name
= DECL_NAME (x
);
3631 /* Not needed...see below. */
3635 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3636 name
= TREE_OPERAND (name
, 0);
3638 /* Namespace-scoped variables are not found in the current level. */
3639 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3640 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3642 t
= lookup_name_current_level (name
);
3643 if (t
== error_mark_node
)
3645 /* error_mark_node is 0 for a while during initialization! */
3647 cp_error_at ("`%#D' used prior to declaration", x
);
3650 else if (t
!= NULL_TREE
)
3653 /* This is turned off until I have time to do it right (bpk). */
3654 /* With the code below that uses it... */
3655 file
= DECL_SOURCE_FILE (t
);
3656 line
= DECL_SOURCE_LINE (t
);
3658 if (TREE_CODE (t
) == PARM_DECL
)
3660 if (DECL_CONTEXT (t
) == NULL_TREE
)
3661 fatal ("parse errors have confused me too much");
3663 /* Check for duplicate params. */
3664 if (duplicate_decls (x
, t
))
3667 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3668 || DECL_FUNCTION_TEMPLATE_P (x
))
3669 && is_overloaded_fn (t
))
3670 /* Don't do anything just yet. */;
3671 else if (t
== wchar_decl_node
)
3673 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3674 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3676 /* Throw away the redeclaration. */
3679 else if (TREE_CODE (t
) != TREE_CODE (x
))
3681 if (duplicate_decls (x
, t
))
3684 else if (duplicate_decls (x
, t
))
3687 /* This is turned off until I have time to do it right (bpk). */
3689 /* Also warn if they did a prototype with `static' on it, but
3690 then later left the `static' off. */
3691 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3693 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3698 cp_warning ("`static' missing from declaration of `%D'",
3700 warning_with_file_and_line (file
, line
,
3701 "previous declaration of `%s'",
3702 decl_as_string (t
, 0));
3705 /* Now fix things so it'll do what they expect. */
3706 if (current_function_decl
)
3707 TREE_PUBLIC (current_function_decl
) = 0;
3709 /* Due to interference in memory reclamation (X may be
3710 obstack-deallocated at this point), we must guard against
3711 one really special case. [jason: This should be handled
3712 by start_function] */
3713 if (current_function_decl
== x
)
3714 current_function_decl
= t
;
3716 if (TREE_CODE (t
) == TYPE_DECL
)
3717 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3718 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3719 check_default_args (t
);
3723 else if (DECL_MAIN_P (x
))
3725 /* A redeclaration of main, but not a duplicate of the
3730 This function shall not be overloaded. */
3731 cp_error_at ("invalid redeclaration of `%D'", t
);
3732 cp_error ("as `%D'", x
);
3733 /* We don't try to push this declaration since that
3739 check_template_shadow (x
);
3741 /* If this is a function conjured up by the backend, massage it
3742 so it looks friendly. */
3743 if (TREE_CODE (x
) == FUNCTION_DECL
3744 && ! DECL_LANG_SPECIFIC (x
))
3746 retrofit_lang_decl (x
);
3747 DECL_LANGUAGE (x
) = lang_c
;
3750 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3752 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3755 if (!namespace_bindings_p ())
3756 /* We do not need to create a binding for this name;
3757 push_overloaded_decl will have already done so if
3759 need_new_binding
= 0;
3761 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3763 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3765 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3769 /* If declaring a type as a typedef, copy the type (unless we're
3770 at line 0), and install this TYPE_DECL as the new type's typedef
3771 name. See the extensive comment in ../c-decl.c (pushdecl). */
3772 if (TREE_CODE (x
) == TYPE_DECL
)
3774 tree type
= TREE_TYPE (x
);
3775 if (DECL_SOURCE_LINE (x
) == 0)
3777 if (TYPE_NAME (type
) == 0)
3778 TYPE_NAME (type
) = x
;
3780 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3781 /* We don't want to copy the type when all we're
3782 doing is making a TYPE_DECL for the purposes of
3784 && (!TYPE_NAME (type
)
3785 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3787 DECL_ORIGINAL_TYPE (x
) = type
;
3788 type
= build_type_copy (type
);
3789 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3790 TYPE_NAME (type
) = x
;
3791 TREE_TYPE (x
) = type
;
3794 if (type
!= error_mark_node
3796 && TYPE_IDENTIFIER (type
))
3797 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3798 current_binding_level
);
3802 /* Multiple external decls of the same identifier ought to match.
3804 We get warnings about inline functions where they are defined.
3805 We get warnings about other functions from push_overloaded_decl.
3807 Avoid duplicate warnings where they are used. */
3808 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3812 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3813 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3814 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3815 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3820 /* If different sort of thing, we already gave an error. */
3821 && TREE_CODE (decl
) == TREE_CODE (x
)
3822 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3824 cp_pedwarn ("type mismatch with previous external decl", x
);
3825 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3829 /* This name is new in its binding level.
3830 Install the new declaration and return it. */
3831 if (namespace_bindings_p ())
3833 /* Install a global value. */
3835 /* If the first global decl has external linkage,
3836 warn if we later see static one. */
3837 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3838 TREE_PUBLIC (name
) = 1;
3840 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3842 /* For an ordinary function, we create a binding from
3843 the mangled name (i.e., NAME) to the DECL. But, for
3844 an `extern "C"' function, the mangled name and the
3845 ordinary name are the same so we need not do this. */
3846 && !(TREE_CODE (x
) == FUNCTION_DECL
&&
3847 DECL_LANGUAGE (x
) == lang_c
))
3849 if (TREE_CODE (x
) == FUNCTION_DECL
)
3851 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3852 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3853 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3856 /* Don't forget if the function was used via an implicit decl. */
3857 if (IDENTIFIER_IMPLICIT_DECL (name
)
3858 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3861 /* Don't forget if its address was taken in that way. */
3862 if (IDENTIFIER_IMPLICIT_DECL (name
)
3863 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3864 TREE_ADDRESSABLE (x
) = 1;
3866 /* Warn about mismatches against previous implicit decl. */
3867 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3868 /* If this real decl matches the implicit, don't complain. */
3869 && ! (TREE_CODE (x
) == FUNCTION_DECL
3870 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3872 ("`%D' was previously implicitly declared to return `int'", x
);
3874 /* If new decl is `static' and an `extern' was seen previously,
3876 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3877 warn_extern_redeclared_static (x
, t
);
3881 /* Here to install a non-global value. */
3882 tree oldlocal
= IDENTIFIER_VALUE (name
);
3883 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3885 if (need_new_binding
)
3887 push_local_binding (name
, x
, 0);
3888 /* Because push_local_binding will hook X on to the
3889 current_binding_level's name list, we don't want to
3890 do that again below. */
3891 need_new_binding
= 0;
3894 /* If this is a TYPE_DECL, push it into the type value slot. */
3895 if (TREE_CODE (x
) == TYPE_DECL
)
3896 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3897 current_binding_level
);
3899 /* Clear out any TYPE_DECL shadowed by a namespace so that
3900 we won't think this is a type. The C struct hack doesn't
3901 go through namespaces. */
3902 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3903 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3904 current_binding_level
);
3906 /* If this is an extern function declaration, see if we
3907 have a global definition or declaration for the function. */
3908 if (oldlocal
== NULL_TREE
3909 && DECL_EXTERNAL (x
)
3910 && oldglobal
!= NULL_TREE
3911 && TREE_CODE (x
) == FUNCTION_DECL
3912 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3914 /* We have one. Their types must agree. */
3915 if (decls_match (x
, oldglobal
))
3919 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3920 cp_warning_at ("global declaration `%#D'", oldglobal
);
3923 /* If we have a local external declaration,
3924 and no file-scope declaration has yet been seen,
3925 then if we later have a file-scope decl it must not be static. */
3926 if (oldlocal
== NULL_TREE
3927 && oldglobal
== NULL_TREE
3928 && DECL_EXTERNAL (x
)
3930 TREE_PUBLIC (name
) = 1;
3932 if (DECL_FROM_INLINE (x
))
3933 /* Inline decls shadow nothing. */;
3935 /* Warn if shadowing an argument at the top level of the body. */
3936 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3937 && TREE_CODE (oldlocal
) == PARM_DECL
3938 /* Don't complain if it's from an enclosing function. */
3939 && DECL_CONTEXT (oldlocal
) == current_function_decl
3940 && TREE_CODE (x
) != PARM_DECL
)
3942 /* Go to where the parms should be and see if we
3944 struct binding_level
*b
= current_binding_level
->level_chain
;
3950 if (b
->parm_flag
== 1)
3951 cp_error ("declaration of `%#D' shadows a parameter", name
);
3953 else if (warn_shadow
&& oldlocal
!= NULL_TREE
3954 && current_binding_level
->is_for_scope
3955 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3957 warning ("variable `%s' shadows local",
3958 IDENTIFIER_POINTER (name
));
3959 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3961 /* Maybe warn if shadowing something else. */
3962 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
3963 /* No shadow warnings for internally generated vars. */
3964 && ! DECL_ARTIFICIAL (x
)
3965 /* No shadow warnings for vars made for inlining. */
3966 && ! DECL_FROM_INLINE (x
))
3968 const char *warnstring
= NULL
;
3970 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
3971 warnstring
= "declaration of `%s' shadows a parameter";
3972 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
3973 && current_class_ptr
3974 && !TREE_STATIC (name
))
3975 warnstring
= "declaration of `%s' shadows a member of `this'";
3976 else if (oldlocal
!= NULL_TREE
)
3977 warnstring
= "declaration of `%s' shadows previous local";
3978 else if (oldglobal
!= NULL_TREE
)
3979 /* XXX shadow warnings in outer-more namespaces */
3980 warnstring
= "declaration of `%s' shadows global declaration";
3983 warning (warnstring
, IDENTIFIER_POINTER (name
));
3987 if (TREE_CODE (x
) == FUNCTION_DECL
)
3988 check_default_args (x
);
3990 /* Keep count of variables in this level with incomplete type. */
3991 if (TREE_CODE (x
) == VAR_DECL
3992 && TREE_TYPE (x
) != error_mark_node
3993 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
3994 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
3995 /* RTTI TD entries are created while defining the type_info. */
3996 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
3997 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
3998 current_binding_level
->incomplete
3999 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4002 if (need_new_binding
)
4003 add_decl_to_level (x
,
4004 DECL_NAMESPACE_SCOPE_P (x
)
4005 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4006 : current_binding_level
);
4011 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4012 caller to set DECL_CONTEXT properly. */
4015 pushdecl_with_scope (x
, level
)
4017 struct binding_level
*level
;
4019 register struct binding_level
*b
;
4020 tree function_decl
= current_function_decl
;
4022 current_function_decl
= NULL_TREE
;
4023 if (level
->parm_flag
== 2)
4025 b
= class_binding_level
;
4026 class_binding_level
= level
;
4027 pushdecl_class_level (x
);
4028 class_binding_level
= b
;
4032 b
= current_binding_level
;
4033 current_binding_level
= level
;
4035 current_binding_level
= b
;
4037 current_function_decl
= function_decl
;
4041 /* Like pushdecl, only it places X in the current namespace,
4045 pushdecl_namespace_level (x
)
4048 register struct binding_level
*b
= current_binding_level
;
4051 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4053 /* Now, the type_shadowed stack may screw us. Munge it so it does
4055 if (TREE_CODE (x
) == TYPE_DECL
)
4057 tree name
= DECL_NAME (x
);
4059 tree
*ptr
= (tree
*)0;
4060 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4062 tree shadowed
= b
->type_shadowed
;
4063 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4064 if (TREE_PURPOSE (shadowed
) == name
)
4066 ptr
= &TREE_VALUE (shadowed
);
4067 /* Can't break out of the loop here because sometimes
4068 a binding level will have duplicate bindings for
4069 PT names. It's gross, but I haven't time to fix it. */
4072 newval
= TREE_TYPE (x
);
4073 if (ptr
== (tree
*)0)
4075 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4076 up here if this is changed to an assertion. --KR */
4077 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4087 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4091 pushdecl_top_level (x
)
4094 push_to_top_level ();
4095 x
= pushdecl_namespace_level (x
);
4096 pop_from_top_level ();
4100 /* Make the declaration of X appear in CLASS scope. */
4103 pushdecl_class_level (x
)
4106 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4107 scope looks for the pre-mangled name. */
4110 if (TREE_CODE (x
) == OVERLOAD
)
4111 x
= OVL_CURRENT (x
);
4112 name
= DECL_NAME (x
);
4116 push_class_level_binding (name
, x
);
4117 if (TREE_CODE (x
) == TYPE_DECL
)
4118 set_identifier_type_value (name
, TREE_TYPE (x
));
4120 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4124 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4127 pushdecl_class_level (f
);
4131 /* Enter DECL into the symbol table, if that's appropriate. Returns
4132 DECL, or a modified version thereof. */
4135 maybe_push_decl (decl
)
4138 tree type
= TREE_TYPE (decl
);
4140 /* Add this decl to the current binding level, but not if it comes
4141 from another scope, e.g. a static member variable. TEM may equal
4142 DECL or it may be a previous decl of the same name. */
4143 if ((TREE_CODE (decl
) != PARM_DECL
4144 && DECL_CONTEXT (decl
) != NULL_TREE
4145 /* Definitions of namespace members outside their namespace are
4147 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4148 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4149 || TREE_CODE (type
) == UNKNOWN_TYPE
4150 /* The declaration of a template specialization does not affect
4151 the functions available for overload resolution, so we do not
4153 || (TREE_CODE (decl
) == FUNCTION_DECL
4154 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4157 return pushdecl (decl
);
4161 /* This function is used to push the mangled decls for nested types into
4162 the appropriate scope. Previously pushdecl_top_level was used, but that
4163 is incorrect for members of local classes. */
4166 pushdecl_nonclass_level (x
)
4169 struct binding_level
*b
= current_binding_level
;
4171 my_friendly_assert (b
->parm_flag
!= 2, 180);
4174 /* Get out of template binding levels */
4175 while (b
->pseudo_global
)
4179 pushdecl_with_scope (x
, b
);
4183 /* Make the declaration(s) of X appear in CLASS scope
4184 under the name NAME. */
4187 push_class_level_binding (name
, x
)
4192 /* The class_binding_level will be NULL if x is a template
4193 parameter name in a member template. */
4194 if (!class_binding_level
)
4197 /* Make sure that this new member does not have the same name
4198 as a template parameter. */
4199 if (TYPE_BEING_DEFINED (current_class_type
))
4200 check_template_shadow (x
);
4202 /* If this declaration shadows a declaration from an enclosing
4203 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4204 we leave this class. Record the shadowed declaration here. */
4205 binding
= IDENTIFIER_BINDING (name
);
4207 && ((TREE_CODE (x
) == OVERLOAD
4208 && BINDING_VALUE (binding
)
4209 && is_overloaded_fn (BINDING_VALUE (binding
)))
4210 || INHERITED_VALUE_BINDING_P (binding
)))
4215 /* If the old binding was from a base class, and was for a tag
4216 name, slide it over to make room for the new binding. The
4217 old binding is still visible if explicitly qualified with a
4219 if (INHERITED_VALUE_BINDING_P (binding
)
4220 && BINDING_VALUE (binding
)
4221 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4222 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4223 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4225 old_decl
= BINDING_TYPE (binding
);
4226 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4227 BINDING_VALUE (binding
) = NULL_TREE
;
4228 INHERITED_VALUE_BINDING_P (binding
) = 0;
4231 old_decl
= BINDING_VALUE (binding
);
4233 /* There was already a binding for X containing fewer
4234 functions than are named in X. Find the previous
4235 declaration of X on the class-shadowed list, and update it. */
4236 for (shadow
= class_binding_level
->class_shadowed
;
4238 shadow
= TREE_CHAIN (shadow
))
4239 if (TREE_PURPOSE (shadow
) == name
4240 && TREE_TYPE (shadow
) == old_decl
)
4242 BINDING_VALUE (binding
) = x
;
4243 INHERITED_VALUE_BINDING_P (binding
) = 0;
4244 TREE_TYPE (shadow
) = x
;
4249 /* If we didn't replace an existing binding, put the binding on the
4250 stack of bindings for the identifier, and update
4251 IDENTIFIER_CLASS_VALUE. */
4252 if (push_class_binding (name
, x
))
4254 class_binding_level
->class_shadowed
4255 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4256 class_binding_level
->class_shadowed
);
4257 /* Record the value we are binding NAME to so that we can know
4258 what to pop later. */
4259 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4263 /* Insert another USING_DECL into the current binding level,
4264 returning this declaration. If this is a redeclaration,
4265 do nothing and return NULL_TREE. */
4268 push_using_decl (scope
, name
)
4274 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4275 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4276 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4277 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4281 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4282 DECL_INITIAL (decl
) = scope
;
4283 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4284 current_binding_level
->usings
= decl
;
4288 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4289 changed (i.e. there was already a directive), or the fresh
4290 TREE_LIST otherwise. */
4293 push_using_directive (used
)
4296 tree ud
= current_binding_level
->using_directives
;
4297 tree iter
, ancestor
;
4299 /* Check if we already have this. */
4300 if (purpose_member (used
, ud
) != NULL_TREE
)
4303 /* Recursively add all namespaces used. */
4304 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4305 push_using_directive (TREE_PURPOSE (iter
));
4307 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4308 ud
= current_binding_level
->using_directives
;
4309 ud
= tree_cons (used
, ancestor
, ud
);
4310 current_binding_level
->using_directives
= ud
;
4314 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4315 other definitions already in place. We get around this by making
4316 the value of the identifier point to a list of all the things that
4317 want to be referenced by that name. It is then up to the users of
4318 that name to decide what to do with that list.
4320 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4321 slot. It is dealt with the same way.
4323 FLAGS is a bitwise-or of the following values:
4324 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4326 PUSH_USING: DECL is being pushed as the result of a using
4329 The value returned may be a previous declaration if we guessed wrong
4330 about what language DECL should belong to (C or C++). Otherwise,
4331 it's always DECL (and never something that's not a _DECL). */
4334 push_overloaded_decl (decl
, flags
)
4338 tree name
= DECL_NAME (decl
);
4341 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4344 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4346 old
= lookup_name_current_level (name
);
4350 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4352 tree t
= TREE_TYPE (old
);
4353 if (IS_AGGR_TYPE (t
) && warn_shadow
4354 && (! DECL_IN_SYSTEM_HEADER (decl
)
4355 || ! DECL_IN_SYSTEM_HEADER (old
)))
4356 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4359 else if (is_overloaded_fn (old
))
4363 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4365 tree fn
= OVL_CURRENT (tmp
);
4367 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4368 && !(flags
& PUSH_USING
)
4369 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4370 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4371 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4374 if (duplicate_decls (decl
, fn
))
4380 cp_error_at ("previous non-function declaration `%#D'", old
);
4381 cp_error ("conflicts with function declaration `%#D'", decl
);
4386 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4388 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4389 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4391 new_binding
= ovl_cons (decl
, old
);
4392 if (flags
& PUSH_USING
)
4393 OVL_USED (new_binding
) = 1;
4396 /* NAME is not ambiguous. */
4400 set_namespace_binding (name
, current_namespace
, new_binding
);
4403 /* We only create an OVERLOAD if there was a previous binding at
4404 this level, or if decl is a template. In the former case, we
4405 need to remove the old binding and replace it with the new
4406 binding. We must also run through the NAMES on the binding
4407 level where the name was bound to update the chain. */
4409 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4413 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4415 d
= &TREE_CHAIN (*d
))
4417 || (TREE_CODE (*d
) == TREE_LIST
4418 && TREE_VALUE (*d
) == old
))
4420 if (TREE_CODE (*d
) == TREE_LIST
)
4421 /* Just replace the old binding with the new. */
4422 TREE_VALUE (*d
) = new_binding
;
4424 /* Build a TREE_LIST to wrap the OVERLOAD. */
4425 *d
= tree_cons (NULL_TREE
, new_binding
,
4428 /* And update the CPLUS_BINDING node. */
4429 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4434 /* We should always find a previous binding in this case. */
4435 my_friendly_abort (0);
4438 /* Install the new binding. */
4439 push_local_binding (name
, new_binding
, flags
);
4445 /* Generate an implicit declaration for identifier FUNCTIONID
4446 as a function of type int (). Print a warning if appropriate. */
4449 implicitly_declare (functionid
)
4454 /* We used to reuse an old implicit decl here,
4455 but this loses with inline functions because it can clobber
4456 the saved decl chains. */
4457 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4459 DECL_EXTERNAL (decl
) = 1;
4460 TREE_PUBLIC (decl
) = 1;
4462 /* ANSI standard says implicit declarations are in the innermost block.
4463 So we record the decl in the standard fashion. */
4465 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4468 /* Only one warning per identifier. */
4469 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4471 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4474 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4479 /* Return zero if the declaration NEWDECL is valid
4480 when the declaration OLDDECL (assumed to be for the same name)
4481 has already been seen.
4482 Otherwise return an error message format string with a %s
4483 where the identifier should go. */
4486 redeclaration_error_message (newdecl
, olddecl
)
4487 tree newdecl
, olddecl
;
4489 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4491 /* Because C++ can put things into name space for free,
4492 constructs like "typedef struct foo { ... } foo"
4493 would look like an erroneous redeclaration. */
4494 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4497 return "redefinition of `%#D'";
4499 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4501 /* If this is a pure function, its olddecl will actually be
4502 the original initialization to `0' (which we force to call
4503 abort()). Don't complain about redefinition in this case. */
4504 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4507 /* If both functions come from different namespaces, this is not
4508 a redeclaration - this is a conflict with a used function. */
4509 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4510 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4511 return "`%D' conflicts with used function";
4513 /* We'll complain about linkage mismatches in
4514 warn_extern_redeclared_static. */
4516 /* Defining the same name twice is no good. */
4517 if (DECL_INITIAL (olddecl
) != NULL_TREE
4518 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4520 if (DECL_NAME (olddecl
) == NULL_TREE
)
4521 return "`%#D' not declared in class";
4523 return "redefinition of `%#D'";
4527 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4529 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4530 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4531 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4532 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4533 && TYPE_SIZE (TREE_TYPE (newdecl
))
4534 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4535 return "redefinition of `%#D'";
4538 else if (toplevel_bindings_p ())
4540 /* Objects declared at top level: */
4541 /* If at least one is a reference, it's ok. */
4542 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4544 /* Reject two definitions. */
4545 return "redefinition of `%#D'";
4549 /* Objects declared with block scope: */
4550 /* Reject two definitions, and reject a definition
4551 together with an external reference. */
4552 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4553 return "redeclaration of `%#D'";
4558 /* Create a new label, named ID. */
4561 make_label_decl (id
, local_p
)
4567 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4569 /* Make sure every label has an rtx. */
4572 DECL_CONTEXT (decl
) = current_function_decl
;
4573 DECL_MODE (decl
) = VOIDmode
;
4574 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4576 /* Say where one reference is to the label, for the sake of the
4577 error if it is not defined. */
4578 DECL_SOURCE_LINE (decl
) = lineno
;
4579 DECL_SOURCE_FILE (decl
) = input_filename
;
4581 /* Record the fact that this identifier is bound to this label. */
4582 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4584 /* Record this label on the list of used labels so that we can check
4585 at the end of the function to see whether or not the label was
4586 actually defined. */
4587 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4588 && (named_label_uses
== NULL
4589 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4590 || named_label_uses
->label_decl
!= decl
))
4592 struct named_label_list
*new_ent
;
4594 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4595 new_ent
->label_decl
= decl
;
4596 new_ent
->names_in_scope
= current_binding_level
->names
;
4597 new_ent
->binding_level
= current_binding_level
;
4598 new_ent
->lineno_o_goto
= lineno
;
4599 new_ent
->filename_o_goto
= input_filename
;
4600 new_ent
->next
= named_label_uses
;
4601 named_label_uses
= new_ent
;
4607 /* Look for a label named ID in the current function. If one cannot
4608 be found, create one. (We keep track of used, but undefined,
4609 labels, and complain about them at the end of a function.) */
4617 /* You can't use labels at global scope. */
4618 if (current_function_decl
== NULL_TREE
)
4620 error ("label `%s' referenced outside of any function",
4621 IDENTIFIER_POINTER (id
));
4625 /* See if we've already got this label. */
4626 decl
= IDENTIFIER_LABEL_VALUE (id
);
4627 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4630 /* Record this label on the list of labels used in this function.
4631 We do this before calling make_label_decl so that we get the
4632 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4633 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4635 /* We need a new label. */
4636 decl
= make_label_decl (id
, /*local_p=*/0);
4637 /* Now fill in the information we didn't have before. */
4638 TREE_VALUE (named_labels
) = decl
;
4643 /* Declare a local label named ID. */
4646 declare_local_label (id
)
4651 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4652 this scope we can restore the old value of
4653 IDENTIFIER_TYPE_VALUE. */
4654 current_binding_level
->shadowed_labels
4655 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4656 current_binding_level
->shadowed_labels
);
4657 /* Look for the label. */
4658 decl
= make_label_decl (id
, /*local_p=*/1);
4659 /* Now fill in the information we didn't have before. */
4660 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4665 /* Define a label, specifying the location in the source file.
4666 Return the LABEL_DECL node for the label, if the definition is valid.
4667 Otherwise return 0. */
4670 define_label (filename
, line
, name
)
4675 tree decl
= lookup_label (name
);
4677 /* After labels, make any new cleanups go into their
4678 own new (temporary) binding contour. */
4679 current_binding_level
->more_cleanups_ok
= 0;
4681 if (name
== get_identifier ("wchar_t"))
4682 cp_pedwarn ("label named wchar_t");
4684 if (DECL_INITIAL (decl
) != NULL_TREE
)
4686 cp_error ("duplicate label `%D'", decl
);
4691 struct named_label_list
*uses
, *prev
;
4695 /* Mark label as having been defined. */
4696 DECL_INITIAL (decl
) = error_mark_node
;
4697 /* Say where in the source. */
4698 DECL_SOURCE_FILE (decl
) = filename
;
4699 DECL_SOURCE_LINE (decl
) = line
;
4702 uses
= named_label_uses
;
4703 while (uses
!= NULL
)
4704 if (uses
->label_decl
== decl
)
4706 struct binding_level
*b
= current_binding_level
;
4709 tree new_decls
= b
->names
;
4710 tree old_decls
= (b
== uses
->binding_level
)
4711 ? uses
->names_in_scope
: NULL_TREE
;
4712 while (new_decls
!= old_decls
)
4714 if (TREE_CODE (new_decls
) == VAR_DECL
4715 /* Don't complain about crossing initialization
4716 of internal entities. They can't be accessed,
4717 and they should be cleaned up
4718 by the time we get to the label. */
4719 && ! DECL_ARTIFICIAL (new_decls
)
4720 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4721 && pod_type_p (TREE_TYPE (new_decls
))))
4723 /* This is really only important if we're crossing
4724 an initialization. The POD stuff is just
4725 pedantry; why should it matter if the class
4726 contains a field of pointer to member type? */
4727 int problem
= (DECL_INITIAL (new_decls
)
4728 || (TYPE_NEEDS_CONSTRUCTING
4729 (TREE_TYPE (new_decls
))));
4735 cp_error ("jump to label `%D'", decl
);
4736 error_with_file_and_line
4737 (uses
->filename_o_goto
,
4738 uses
->lineno_o_goto
, " from here");
4742 cp_pedwarn ("jump to label `%D'", decl
);
4743 pedwarn_with_file_and_line
4744 (uses
->filename_o_goto
,
4745 uses
->lineno_o_goto
, " from here");
4751 cp_error_at (" crosses initialization of `%#D'",
4754 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4757 new_decls
= TREE_CHAIN (new_decls
);
4759 if (b
== uses
->binding_level
)
4761 if (b
->eh_region
&& ! saw_eh
)
4765 cp_error ("jump to label `%D'", decl
);
4766 error_with_file_and_line
4767 (uses
->filename_o_goto
,
4768 uses
->lineno_o_goto
, " from here");
4771 error (" enters exception handling block");
4778 prev
->next
= uses
->next
;
4780 named_label_uses
= uses
->next
;
4789 current_function_return_value
= NULL_TREE
;
4796 struct binding_level
*level
;
4797 struct cp_switch
*next
;
4800 static struct cp_switch
*switch_stack
;
4806 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4807 p
->level
= current_binding_level
;
4808 p
->next
= switch_stack
;
4815 switch_stack
= switch_stack
->next
;
4818 /* Note that we've seen a definition of a case label, and complain if this
4819 is a bad place for one. */
4822 define_case_label ()
4824 tree cleanup
= last_cleanup_this_contour ();
4825 struct binding_level
*b
= current_binding_level
;
4829 /* Don't crash; we'll complain in do_case. */
4834 static int explained
= 0;
4835 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4836 warning ("where case label appears here");
4839 warning ("(enclose actions of previous case statements requiring");
4840 warning ("destructors in their own binding contours.)");
4845 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4847 tree new_decls
= b
->names
;
4848 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4850 if (TREE_CODE (new_decls
) == VAR_DECL
4851 /* Don't complain about crossing initialization
4852 of internal entities. They can't be accessed,
4853 and they should be cleaned up
4854 by the time we get to the label. */
4855 && ! DECL_ARTIFICIAL (new_decls
)
4856 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4857 && DECL_INITIAL (new_decls
) != error_mark_node
)
4858 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4861 error ("jump to case label");
4863 cp_error_at (" crosses initialization of `%#D'",
4869 /* After labels, make any new cleanups go into their
4870 own new (temporary) binding contour. */
4872 current_binding_level
->more_cleanups_ok
= 0;
4873 current_function_return_value
= NULL_TREE
;
4876 /* Return the list of declarations of the current level.
4877 Note that this list is in reverse order unless/until
4878 you nreverse it; and when you do nreverse it, you must
4879 store the result back using `storedecls' or you will lose. */
4884 return current_binding_level
->names
;
4887 /* Return the list of type-tags (for structs, etc) of the current level. */
4892 return current_binding_level
->tags
;
4895 /* Store the list of declarations of the current level.
4896 This is done for the parameter declarations of a function being defined,
4897 after they are modified in the light of any missing parameters. */
4903 current_binding_level
->names
= decls
;
4906 /* Similarly, store the list of tags of the current level. */
4912 current_binding_level
->tags
= tags
;
4915 /* Given NAME, an IDENTIFIER_NODE,
4916 return the structure (or union or enum) definition for that name.
4917 Searches binding levels from BINDING_LEVEL up to the global level.
4918 If THISLEVEL_ONLY is nonzero, searches only the specified context
4919 (but skips any tag-transparent contexts to find one that is
4920 meaningful for tags).
4921 FORM says which kind of type the caller wants;
4922 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4923 If the wrong kind of type is found, and it's not a template, an error is
4927 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4928 enum tree_code form
;
4930 struct binding_level
*binding_level
;
4933 register struct binding_level
*level
;
4934 /* Non-zero if, we should look past a pseudo-global level, even if
4936 int allow_pseudo_global
= 1;
4938 for (level
= binding_level
; level
; level
= level
->level_chain
)
4941 if (ANON_AGGRNAME_P (name
))
4942 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4944 /* There's no need for error checking here, because
4945 anon names are unique throughout the compilation. */
4946 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4947 return TREE_VALUE (tail
);
4949 else if (level
->namespace_p
)
4950 /* Do namespace lookup. */
4951 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
4953 tree old
= binding_for_name (name
, tail
);
4955 /* If we just skipped past a pseudo global level, even
4956 though THISLEVEL_ONLY, and we find a template class
4957 declaration, then we use the _TYPE node for the
4958 template. See the example below. */
4959 if (thislevel_only
&& !allow_pseudo_global
4960 && old
&& BINDING_VALUE (old
)
4961 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
4962 old
= TREE_TYPE (BINDING_VALUE (old
));
4964 old
= BINDING_TYPE (old
);
4966 /* If it has an original type, it is a typedef, and we
4967 should not return it. */
4968 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
4970 if (old
&& TREE_CODE (old
) != form
4971 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
4973 cp_error ("`%#D' redeclared as %C", old
, form
);
4978 if (thislevel_only
|| tail
== global_namespace
)
4982 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4984 if (TREE_PURPOSE (tail
) == name
)
4986 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
4987 /* Should tighten this up; it'll probably permit
4988 UNION_TYPE and a struct template, for example. */
4990 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
4992 /* Definition isn't the kind we were looking for. */
4993 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
4997 return TREE_VALUE (tail
);
5000 if (thislevel_only
&& ! level
->tag_transparent
)
5002 if (level
->pseudo_global
&& allow_pseudo_global
)
5004 /* We must deal with cases like this:
5006 template <class T> struct S;
5007 template <class T> struct S {};
5009 When looking up `S', for the second declaration, we
5010 would like to find the first declaration. But, we
5011 are in the pseudo-global level created for the
5012 template parameters, rather than the (surrounding)
5013 namespace level. Thus, we keep going one more level,
5014 even though THISLEVEL_ONLY is non-zero. */
5015 allow_pseudo_global
= 0;
5027 set_current_level_tags_transparency (tags_transparent
)
5028 int tags_transparent
;
5030 current_binding_level
->tag_transparent
= tags_transparent
;
5034 /* Given a type, find the tag that was defined for it and return the tag name.
5035 Otherwise return 0. However, the value can never be 0
5036 in the cases in which this is used.
5038 C++: If NAME is non-zero, this is the new name to install. This is
5039 done when replacing anonymous tags with real tag names. */
5042 lookup_tag_reverse (type
, name
)
5046 register struct binding_level
*level
;
5048 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5051 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5053 if (TREE_VALUE (tail
) == type
)
5056 TREE_PURPOSE (tail
) = name
;
5057 return TREE_PURPOSE (tail
);
5064 /* Look up NAME in the NAMESPACE. */
5067 lookup_namespace_name (namespace, name
)
5068 tree
namespace, name
;
5071 tree template_id
= NULL_TREE
;
5073 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5075 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5076 /* This happens for A::B<int> when B is a namespace. */
5078 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5080 /* This happens for A::B where B is a template, and there are no
5081 template arguments. */
5082 cp_error ("invalid use of `%D'", name
);
5083 return error_mark_node
;
5086 namespace = ORIGINAL_NAMESPACE (namespace);
5088 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5091 name
= TREE_OPERAND (name
, 0);
5092 if (TREE_CODE (name
) == OVERLOAD
)
5093 name
= DECL_NAME (OVL_CURRENT (name
));
5094 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5095 name
= DECL_NAME (name
);
5098 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5100 val
= make_node (CPLUS_BINDING
);
5101 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5102 return error_mark_node
;
5104 if (BINDING_VALUE (val
))
5106 val
= BINDING_VALUE (val
);
5110 if (DECL_CLASS_TEMPLATE_P (val
))
5111 val
= lookup_template_class (val
,
5112 TREE_OPERAND (template_id
, 1),
5113 /*in_decl=*/NULL_TREE
,
5114 /*context=*/NULL_TREE
,
5115 /*entering_scope=*/0);
5116 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5117 || TREE_CODE (val
) == OVERLOAD
)
5118 val
= lookup_template_function (val
,
5119 TREE_OPERAND (template_id
, 1));
5122 cp_error ("`%D::%D' is not a template",
5124 return error_mark_node
;
5128 /* If we have a single function from a using decl, pull it out. */
5129 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5130 val
= OVL_FUNCTION (val
);
5134 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5135 return error_mark_node
;
5138 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5140 static unsigned long
5148 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5149 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5154 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5157 typename_compare (k1
, k2
)
5168 d1
= TYPE_NAME (t1
);
5169 d2
= TYPE_NAME (t2
);
5171 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5172 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5173 && ((TREE_TYPE (t1
) != NULL_TREE
)
5174 == (TREE_TYPE (t2
) != NULL_TREE
))
5175 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5176 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5179 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5180 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5181 is non-NULL, this type is being created by the implicit typename
5182 extension, and BASE_TYPE is a type named `t' in some base class of
5183 `T' which depends on template parameters.
5185 Returns the new TYPENAME_TYPE. */
5188 build_typename_type (context
, name
, fullname
, base_type
)
5196 struct hash_entry
* e
;
5198 static struct hash_table ht
;
5202 static struct hash_table
*h
= &ht
;
5203 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5205 fatal ("virtual memory exhausted");
5206 ggc_add_tree_hash_table_root (&h
, 1);
5209 /* Build the TYPENAME_TYPE. */
5210 t
= make_lang_type (TYPENAME_TYPE
);
5211 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5212 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5213 TREE_TYPE (t
) = base_type
;
5215 /* Build the corresponding TYPE_DECL. */
5216 d
= build_decl (TYPE_DECL
, name
, t
);
5217 TYPE_NAME (TREE_TYPE (d
)) = d
;
5218 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5219 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5220 DECL_ARTIFICIAL (d
) = 1;
5222 /* See if we already have this type. */
5223 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5227 /* Insert the type into the table. */
5228 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5233 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5234 unless an error occurs, in which case error_mark_node is returned.
5235 If COMPLAIN zero, don't complain about any errors that occur. */
5238 make_typename_type (context
, name
, complain
)
5244 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5246 if (!(TYPE_LANG_SPECIFIC (name
)
5247 && (CLASSTYPE_IS_TEMPLATE (name
)
5248 || CLASSTYPE_USE_TEMPLATE (name
))))
5249 name
= TYPE_IDENTIFIER (name
);
5251 /* Create a TEMPLATE_ID_EXPR for the type. */
5252 name
= build_nt (TEMPLATE_ID_EXPR
,
5253 CLASSTYPE_TI_TEMPLATE (name
),
5254 CLASSTYPE_TI_ARGS (name
));
5256 else if (TREE_CODE (name
) == TYPE_DECL
)
5257 name
= DECL_NAME (name
);
5261 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5263 name
= TREE_OPERAND (name
, 0);
5264 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5265 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5267 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5268 my_friendly_abort (2000);
5270 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5272 /* We can get here from typename_sub0 in the explicit_template_type
5273 expansion. Just fail. */
5275 cp_error ("no class template named `%#T' in `%#T'",
5277 return error_mark_node
;
5280 if (! uses_template_parms (context
)
5281 || currently_open_class (context
))
5283 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5285 tree tmpl
= NULL_TREE
;
5286 if (IS_AGGR_TYPE (context
))
5287 tmpl
= lookup_field (context
, name
, 0, 0);
5288 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5291 cp_error ("no class template named `%#T' in `%#T'",
5293 return error_mark_node
;
5296 return lookup_template_class (tmpl
,
5297 TREE_OPERAND (fullname
, 1),
5299 /*entering_scope=*/0);
5305 if (!IS_AGGR_TYPE (context
))
5308 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5309 return error_mark_node
;
5312 t
= lookup_field (context
, name
, 0, 1);
5314 return TREE_TYPE (t
);
5318 /* If the CONTEXT is not a template type, then either the field is
5319 there now or its never going to be. */
5320 if (!uses_template_parms (context
))
5323 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5324 return error_mark_node
;
5328 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5331 /* Select the right _DECL from multiple choices. */
5334 select_decl (binding
, flags
)
5339 val
= BINDING_VALUE (binding
);
5340 if (LOOKUP_NAMESPACES_ONLY (flags
))
5342 /* We are not interested in types. */
5343 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5348 /* If we could have a type and
5349 we have nothing or we need a type and have none. */
5350 if (BINDING_TYPE (binding
)
5351 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5352 && TREE_CODE (val
) != TYPE_DECL
)))
5353 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5354 /* Don't return non-types if we really prefer types. */
5355 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5356 && (TREE_CODE (val
) != TEMPLATE_DECL
5357 || !DECL_CLASS_TEMPLATE_P (val
)))
5363 /* Unscoped lookup of a global: iterate over current namespaces,
5364 considering using-directives. If SPACESP is non-NULL, store a list
5365 of the namespaces we've considered in it. */
5368 unqualified_namespace_lookup (name
, flags
, spacesp
)
5373 tree b
= make_node (CPLUS_BINDING
);
5374 tree initial
= current_decl_namespace();
5375 tree scope
= initial
;
5377 struct binding_level
*level
;
5378 tree val
= NULL_TREE
;
5381 *spacesp
= NULL_TREE
;
5383 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5386 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5387 val
= binding_for_name (name
, scope
);
5389 /* Initialize binding for this context. */
5390 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5391 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5393 /* Add all _DECLs seen through local using-directives. */
5394 for (level
= current_binding_level
;
5395 !level
->namespace_p
;
5396 level
= level
->level_chain
)
5397 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5398 scope
, flags
, spacesp
))
5399 /* Give up because of error. */
5400 return error_mark_node
;
5402 /* Add all _DECLs seen through global using-directives. */
5403 /* XXX local and global using lists should work equally. */
5407 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5408 scope
, flags
, spacesp
))
5409 /* Give up because of error. */
5410 return error_mark_node
;
5411 if (siter
== scope
) break;
5412 siter
= CP_DECL_CONTEXT (siter
);
5415 val
= select_decl (b
, flags
);
5416 if (scope
== global_namespace
)
5422 /* Combine prefer_type and namespaces_only into flags. */
5425 lookup_flags (prefer_type
, namespaces_only
)
5426 int prefer_type
, namespaces_only
;
5428 if (namespaces_only
)
5429 return LOOKUP_PREFER_NAMESPACES
;
5430 if (prefer_type
> 1)
5431 return LOOKUP_PREFER_TYPES
;
5432 if (prefer_type
> 0)
5433 return LOOKUP_PREFER_BOTH
;
5437 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5438 ignore it or not. Subroutine of lookup_name_real. */
5441 qualify_lookup (val
, flags
)
5445 if (val
== NULL_TREE
)
5447 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5449 if ((flags
& LOOKUP_PREFER_TYPES
)
5450 && (TREE_CODE (val
) == TYPE_DECL
5451 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5452 && DECL_CLASS_TEMPLATE_P (val
))))
5454 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5459 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5463 warn_about_implicit_typename_lookup (typename
, binding
)
5467 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5468 tree name
= DECL_NAME (typename
);
5470 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5471 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5472 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5473 && ! (TREE_CODE (binding
) == TYPE_DECL
5474 && same_type_p (TREE_TYPE (binding
), subtype
)))
5476 cp_warning ("lookup of `%D' finds `%#D'",
5478 cp_warning (" instead of `%D' from dependent base class",
5480 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5481 constructor_name (current_class_type
), name
);
5485 /* Look up NAME in the current binding level and its superiors in the
5486 namespace of variables, functions and typedefs. Return a ..._DECL
5487 node of some kind representing its definition if there is only one
5488 such declaration, or return a TREE_LIST with all the overloaded
5489 definitions if there are many, or return 0 if it is undefined.
5491 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5492 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5493 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5494 Otherwise we prefer non-TYPE_DECLs.
5496 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5497 using IDENTIFIER_CLASS_VALUE. */
5500 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5502 int prefer_type
, nonclass
, namespaces_only
;
5505 tree val
= NULL_TREE
;
5507 tree from_obj
= NULL_TREE
;
5509 int val_is_implicit_typename
= 0;
5511 /* Hack: copy flag set by parser, if set. */
5512 if (only_namespace_names
)
5513 namespaces_only
= 1;
5515 if (prefer_type
== -2)
5517 extern int looking_for_typename
;
5518 tree type
= NULL_TREE
;
5521 prefer_type
= looking_for_typename
;
5523 flags
= lookup_flags (prefer_type
, namespaces_only
);
5524 /* If the next thing is '<', class templates are types. */
5525 if (looking_for_template
)
5526 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5528 /* std:: becomes :: for now. */
5529 if (got_scope
== std_node
)
5530 got_scope
= void_type_node
;
5534 else if (got_object
!= error_mark_node
)
5539 if (type
== error_mark_node
)
5540 return error_mark_node
;
5541 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5542 type
= TREE_TYPE (type
);
5545 type
= complete_type (type
);
5547 if (TREE_CODE (type
) == VOID_TYPE
)
5548 type
= global_namespace
;
5549 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5551 val
= make_node (CPLUS_BINDING
);
5552 flags
|= LOOKUP_COMPLAIN
;
5553 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5555 val
= select_decl (val
, flags
);
5557 else if (! IS_AGGR_TYPE (type
)
5558 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5559 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5560 || TREE_CODE (type
) == TYPENAME_TYPE
)
5561 /* Someone else will give an error about this if needed. */
5563 else if (type
== current_class_type
)
5564 val
= IDENTIFIER_CLASS_VALUE (name
);
5566 val
= lookup_member (type
, name
, 0, prefer_type
);
5573 else if (got_object
&& val
)
5578 flags
= lookup_flags (prefer_type
, namespaces_only
);
5579 /* If we're not parsing, we need to complain. */
5580 flags
|= LOOKUP_COMPLAIN
;
5583 /* First, look in non-namespace scopes. */
5585 if (current_class_type
== NULL_TREE
)
5588 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5592 if (!LOCAL_BINDING_P (t
) && nonclass
)
5593 /* We're not looking for class-scoped bindings, so keep going. */
5596 /* If this is the kind of thing we're looking for, we're done. */
5597 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5598 binding
= BINDING_VALUE (t
);
5599 else if ((flags
& LOOKUP_PREFER_TYPES
)
5600 && qualify_lookup (BINDING_TYPE (t
), flags
))
5601 binding
= BINDING_TYPE (t
);
5603 binding
= NULL_TREE
;
5606 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5608 if (val_is_implicit_typename
&& !yylex
)
5609 warn_about_implicit_typename_lookup (val
, binding
);
5611 val_is_implicit_typename
5612 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5613 if (!val_is_implicit_typename
)
5618 /* Now lookup in namespace scopes. */
5619 if (!val
|| val_is_implicit_typename
)
5621 t
= unqualified_namespace_lookup (name
, flags
, 0);
5624 if (val_is_implicit_typename
&& !yylex
)
5625 warn_about_implicit_typename_lookup (val
, t
);
5633 /* This should only warn about types used in qualified-ids. */
5634 if (from_obj
&& from_obj
!= val
)
5636 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5637 && TREE_CODE (val
) == TYPE_DECL
5638 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5640 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5641 name
, got_object
, TREE_TYPE (from_obj
));
5642 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5646 /* We don't change val to from_obj if got_object depends on
5647 template parms because that breaks implicit typename for
5648 destructor calls. */
5649 if (! uses_template_parms (got_object
))
5653 /* If we have a single function from a using decl, pull it out. */
5654 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5655 val
= OVL_FUNCTION (val
);
5664 lookup_name_nonclass (name
)
5667 return lookup_name_real (name
, 0, 1, 0);
5671 lookup_function_nonclass (name
, args
)
5675 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5679 lookup_name_namespace_only (name
)
5682 /* type-or-namespace, nonclass, namespace_only */
5683 return lookup_name_real (name
, 1, 1, 1);
5687 lookup_name (name
, prefer_type
)
5691 return lookup_name_real (name
, prefer_type
, 0, 0);
5694 /* Similar to `lookup_name' but look only in the innermost non-class
5698 lookup_name_current_level (name
)
5701 struct binding_level
*b
;
5704 b
= current_binding_level
;
5705 while (b
->parm_flag
== 2)
5710 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5712 /* extern "C" function() */
5713 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5716 else if (IDENTIFIER_BINDING (name
)
5717 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5721 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5722 return IDENTIFIER_VALUE (name
);
5734 /* Like lookup_name_current_level, but for types. */
5737 lookup_type_current_level (name
)
5740 register tree t
= NULL_TREE
;
5742 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5744 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5745 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5747 struct binding_level
*b
= current_binding_level
;
5750 if (purpose_member (name
, b
->type_shadowed
))
5751 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5763 begin_only_namespace_names ()
5765 only_namespace_names
= 1;
5769 end_only_namespace_names ()
5771 only_namespace_names
= 0;
5774 /* Arrange for the user to get a source line number, even when the
5775 compiler is going down in flames, so that she at least has a
5776 chance of working around problems in the compiler. We used to
5777 call error(), but that let the segmentation fault continue
5778 through; now, it's much more passive by asking them to send the
5779 maintainers mail about the problem. */
5783 int sig ATTRIBUTE_UNUSED
;
5785 signal (SIGSEGV
, SIG_DFL
);
5787 signal (SIGIOT
, SIG_DFL
);
5790 signal (SIGILL
, SIG_DFL
);
5793 signal (SIGABRT
, SIG_DFL
);
5796 signal (SIGBUS
, SIG_DFL
);
5798 my_friendly_abort (0);
5801 /* Push the declarations of builtin types into the namespace.
5802 RID_INDEX, if < RID_MAX is the index of the builtin type
5803 in the array RID_POINTERS. NAME is the name used when looking
5804 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5807 record_builtin_type (rid_index
, name
, type
)
5812 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5813 tree tdecl
= NULL_TREE
;
5815 if ((int) rid_index
< (int) RID_MAX
)
5816 rname
= ridpointers
[(int) rid_index
];
5818 tname
= get_identifier (name
);
5820 TYPE_BUILT_IN (type
) = 1;
5824 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5825 set_identifier_type_value (tname
, NULL_TREE
);
5826 if ((int) rid_index
< (int) RID_MAX
)
5827 /* Built-in types live in the global namespace. */
5828 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5830 if (rname
!= NULL_TREE
)
5832 if (tname
!= NULL_TREE
)
5834 set_identifier_type_value (rname
, NULL_TREE
);
5835 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5839 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5840 set_identifier_type_value (rname
, NULL_TREE
);
5845 /* Record one of the standard Java types.
5846 * Declare it as having the given NAME.
5847 * If SIZE > 0, it is the size of one of the integral types;
5848 * otherwise it is the negative of the size of one of the other types. */
5851 record_builtin_java_type (name
, size
)
5857 type
= make_signed_type (size
);
5858 else if (size
> -32)
5859 { /* "__java_char" or ""__java_boolean". */
5860 type
= make_unsigned_type (-size
);
5861 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5864 { /* "__java_float" or ""__java_double". */
5865 type
= make_node (REAL_TYPE
);
5866 TYPE_PRECISION (type
) = - size
;
5869 record_builtin_type (RID_MAX
, name
, type
);
5870 decl
= TYPE_NAME (type
);
5872 /* Suppress generate debug symbol entries for these types,
5873 since for normal C++ they are just clutter.
5874 However, push_lang_context undoes this if extern "Java" is seen. */
5875 DECL_IGNORED_P (decl
) = 1;
5877 TYPE_FOR_JAVA (type
) = 1;
5881 /* Push a type into the namespace so that the back-ends ignore it. */
5884 record_unknown_type (type
, name
)
5888 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5889 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5890 DECL_IGNORED_P (decl
) = 1;
5891 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5892 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5893 TYPE_ALIGN (type
) = 1;
5894 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5897 /* Push overloaded decl, in global scope, with one argument so it
5898 can be used as a callback from define_function. */
5901 push_overloaded_decl_1 (x
)
5908 auto_function (name
, type
)
5911 return define_function
5912 (IDENTIFIER_POINTER (name
), type
, push_overloaded_decl_1
,
5913 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5917 /* Create the predefined scalar types of C,
5918 and some nodes representing standard constants (0, 1, (void *)0).
5919 Initialize the global binding level.
5920 Make definitions for built-in primitive functions. */
5923 init_decl_processing ()
5926 int wchar_type_size
;
5927 tree array_domain_type
;
5929 /* Have to make these distinct before we try using them. */
5930 lang_name_cplusplus
= get_identifier ("C++");
5931 lang_name_c
= get_identifier ("C");
5932 lang_name_java
= get_identifier ("Java");
5934 /* Let the back-end now how to save and restore language-specific
5935 per-function globals. */
5936 init_lang_status
= &push_cp_function_context
;
5937 free_lang_status
= &pop_cp_function_context
;
5938 mark_lang_status
= &mark_cp_function_context
;
5944 /* Create the global variables. */
5945 push_to_top_level ();
5947 /* Enter the global namespace. */
5948 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5949 push_namespace (get_identifier ("::"));
5950 global_namespace
= current_namespace
;
5951 current_lang_name
= NULL_TREE
;
5953 if (flag_strict_prototype
== 2)
5954 flag_strict_prototype
= pedantic
;
5955 if (! flag_permissive
&& ! pedantic
)
5956 flag_pedantic_errors
= 1;
5958 strict_prototypes_lang_c
= flag_strict_prototype
;
5961 current_lang_name
= lang_name_c
;
5963 current_function_decl
= NULL_TREE
;
5964 current_binding_level
= NULL_BINDING_LEVEL
;
5965 free_binding_level
= NULL_BINDING_LEVEL
;
5967 /* Because most segmentation signals can be traced back into user
5968 code, catch them and at least give the user a chance of working
5969 around compiler bugs. */
5970 signal (SIGSEGV
, signal_catch
);
5972 /* We will also catch aborts in the back-end through signal_catch and
5973 give the user a chance to see where the error might be, and to defeat
5974 aborts in the back-end when there have been errors previously in their
5977 signal (SIGIOT
, signal_catch
);
5980 signal (SIGILL
, signal_catch
);
5983 signal (SIGABRT
, signal_catch
);
5986 signal (SIGBUS
, signal_catch
);
5989 build_common_tree_nodes (flag_signed_char
);
5991 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
5992 TREE_TYPE (error_mark_list
) = error_mark_node
;
5994 /* Make the binding_level structure for global names. */
5996 global_binding_level
= current_binding_level
;
5997 /* The global level is the namespace level of ::. */
5998 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
5999 declare_namespace_level ();
6001 this_identifier
= get_identifier (THIS_NAME
);
6002 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6003 ctor_identifier
= get_identifier (CTOR_NAME
);
6004 dtor_identifier
= get_identifier (DTOR_NAME
);
6005 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6006 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6007 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6008 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6009 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6011 /* Define `int' and `char' first so that dbx will output them first. */
6012 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6013 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6015 /* `signed' is the same as `int' */
6016 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6017 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6018 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6019 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6020 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6021 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6022 record_builtin_type (RID_MAX
, "long long unsigned int",
6023 long_long_unsigned_type_node
);
6024 record_builtin_type (RID_MAX
, "long long unsigned",
6025 long_long_unsigned_type_node
);
6026 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6027 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6028 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6031 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6033 /* Define both `signed char' and `unsigned char'. */
6034 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6035 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6037 /* `unsigned long' is the standard type for sizeof.
6038 Note that stddef.h uses `unsigned long',
6039 and this must agree, even if long and int are the same size. */
6041 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6043 /* Create the widest literal types. */
6044 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6045 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6046 widest_integer_literal_type_node
));
6048 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6049 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6050 widest_unsigned_literal_type_node
));
6052 /* These are types that type_for_size and type_for_mode use. */
6053 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6054 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6055 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6056 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6057 #if HOST_BITS_PER_WIDE_INT >= 64
6058 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6060 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6061 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6062 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6063 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6064 #if HOST_BITS_PER_WIDE_INT >= 64
6065 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6068 build_common_tree_nodes_2 (flag_short_double
);
6070 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6071 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6072 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6073 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6074 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6075 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6076 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6077 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6079 integer_two_node
= build_int_2 (2, 0);
6080 TREE_TYPE (integer_two_node
) = integer_type_node
;
6081 integer_three_node
= build_int_2 (3, 0);
6082 TREE_TYPE (integer_three_node
) = integer_type_node
;
6084 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6085 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6086 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6087 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6088 TYPE_PRECISION (boolean_type_node
) = 1;
6089 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6090 boolean_false_node
= build_int_2 (0, 0);
6091 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6092 boolean_true_node
= build_int_2 (1, 0);
6093 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6095 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6096 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6097 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6099 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6100 complex_integer_type_node
));
6101 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6102 complex_float_type_node
));
6103 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6104 complex_double_type_node
));
6105 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6106 complex_long_double_type_node
));
6108 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6110 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6111 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6112 TREE_PARMLIST (void_list_node
) = 1;
6114 /* Used for expressions that do nothing, but are not errors. */
6115 void_zero_node
= build_int_2 (0, 0);
6116 TREE_TYPE (void_zero_node
) = void_type_node
;
6118 string_type_node
= build_pointer_type (char_type_node
);
6119 const_string_type_node
6120 = build_pointer_type (build_qualified_type (char_type_node
,
6122 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6124 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6127 /* Make a type to be the domain of a few array types
6128 whose domains don't really matter.
6129 200 is small enough that it always fits in size_t
6130 and large enough that it can hold most function names for the
6131 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6132 array_domain_type
= build_index_type (build_int_2 (200, 0));
6134 /* Make a type for arrays of characters.
6135 With luck nothing will ever really depend on the length of this
6137 char_array_type_node
6138 = build_array_type (char_type_node
, array_domain_type
);
6139 /* Likewise for arrays of ints. */
6141 = build_array_type (integer_type_node
, array_domain_type
);
6143 /* This is just some anonymous class type. Nobody should ever
6144 need to look inside this envelope. */
6145 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6147 if (flag_huge_objects
)
6148 delta_type_node
= long_integer_type_node
;
6150 delta_type_node
= short_integer_type_node
;
6152 default_function_type
6153 = build_function_type (integer_type_node
, NULL_TREE
);
6155 ptr_type_node
= build_pointer_type (void_type_node
);
6157 = build_pointer_type (build_qualified_type (void_type_node
,
6159 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6160 lang_type_promotes_to
= convert_type_from_ellipsis
;
6163 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6165 /* C++ extensions */
6167 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6168 record_unknown_type (unknown_type_node
, "unknown type");
6170 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6171 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6173 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6175 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6177 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6178 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6180 /* This is special for C++ so functions can be overloaded. */
6181 wchar_type_node
= get_identifier (flag_short_wchar
6182 ? "short unsigned int"
6184 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6185 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6186 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6187 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6189 = TREE_UNSIGNED (wchar_type_node
)
6190 ? unsigned_wchar_type_node
6191 : signed_wchar_type_node
;
6192 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6194 /* Artificial declaration of wchar_t -- can be bashed */
6195 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6197 pushdecl (wchar_decl_node
);
6199 /* This is for wide string constants. */
6200 wchar_array_type_node
6201 = build_array_type (wchar_type_node
, array_domain_type
);
6203 if (flag_vtable_thunks
)
6205 /* Make sure we get a unique function type, so we can give
6206 its pointer type a name. (This wins for gdb.) */
6207 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6208 TREE_TYPE (vfunc_type
) = integer_type_node
;
6209 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6210 layout_type (vfunc_type
);
6212 vtable_entry_type
= build_pointer_type (vfunc_type
);
6216 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6217 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6219 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6221 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6223 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6226 /* Make this part of an invisible union. */
6227 fields
[3] = copy_node (fields
[2]);
6228 TREE_TYPE (fields
[3]) = delta_type_node
;
6229 DECL_NAME (fields
[3]) = delta2_identifier
;
6230 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6231 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6232 TREE_UNSIGNED (fields
[3]) = 0;
6233 TREE_CHAIN (fields
[2]) = fields
[3];
6234 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6237 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6240 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6241 layout_type (vtbl_type_node
);
6242 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6243 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6244 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6245 layout_type (vtbl_ptr_type_node
);
6246 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6248 std_node
= build_decl (NAMESPACE_DECL
,
6249 get_identifier (flag_honor_std
? "fake std":"std"),
6251 pushdecl (std_node
);
6253 global_type_node
= make_node (LANG_TYPE
);
6254 record_unknown_type (global_type_node
, "global type");
6257 current_lang_name
= lang_name_cplusplus
;
6260 tree bad_alloc_type_node
, newtype
, deltype
;
6262 push_namespace (get_identifier ("std"));
6263 bad_alloc_type_node
= xref_tag
6264 (class_type_node
, get_identifier ("bad_alloc"), 1);
6267 newtype
= build_exception_variant
6268 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6269 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6270 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
);
6271 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6272 global_delete_fndecl
= auto_function (ansi_opname
[(int) DELETE_EXPR
],
6274 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6278 = define_function ("__pure_virtual", void_ftype
, 0, 0);
6280 /* Perform other language dependent initializations. */
6281 init_class_processing ();
6282 init_init_processing ();
6283 init_search_processing ();
6284 init_rtti_processing ();
6286 if (flag_exceptions
)
6287 init_exception_processing ();
6290 flag_inline_functions
= 0;
6293 if (! supports_one_only ())
6296 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6297 declare_function_name ();
6299 /* Prepare to check format strings against argument lists. */
6300 init_function_format_info ();
6302 /* Show we use EH for cleanups. */
6303 using_eh_for_cleanups ();
6305 print_error_function
= lang_print_error_function
;
6306 lang_get_alias_set
= &c_get_alias_set
;
6307 valid_lang_attribute
= cp_valid_lang_attribute
;
6309 /* Maintain consistency. Perhaps we should just complain if they
6310 say -fwritable-strings? */
6311 if (flag_writable_strings
)
6312 flag_const_strings
= 0;
6314 /* Add GC roots for all of our global variables. */
6315 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6316 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6317 ggc_add_tree_root (&integer_three_node
, 1);
6318 ggc_add_tree_root (&integer_two_node
, 1);
6319 ggc_add_tree_root (&signed_size_zero_node
, 1);
6320 ggc_add_tree_root (&size_one_node
, 1);
6321 ggc_add_tree_root (&size_zero_node
, 1);
6322 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6323 mark_binding_level
);
6324 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6325 ggc_add_tree_root (&static_ctors
, 1);
6326 ggc_add_tree_root (&static_dtors
, 1);
6327 ggc_add_tree_root (&lastiddecl
, 1);
6329 ggc_add_tree_root (&last_function_parm_tags
, 1);
6330 ggc_add_tree_root (¤t_function_return_value
, 1);
6331 ggc_add_tree_root (¤t_function_parms
, 1);
6332 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6333 ggc_add_tree_root (&last_function_parms
, 1);
6334 ggc_add_tree_root (&error_mark_list
, 1);
6336 ggc_add_tree_root (&global_namespace
, 1);
6337 ggc_add_tree_root (&global_type_node
, 1);
6338 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6340 ggc_add_tree_root (&got_object
, 1);
6341 ggc_add_tree_root (&got_scope
, 1);
6343 ggc_add_tree_root (¤t_lang_name
, 1);
6344 ggc_add_tree_root (&static_aggregates
, 1);
6347 /* Function to print any language-specific context for an error message. */
6350 lang_print_error_function (file
)
6353 default_print_error_function (file
);
6354 maybe_print_template_context ();
6357 /* Make a definition for a builtin function named NAME and whose data type
6358 is TYPE. TYPE should be a function type with argument types.
6360 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6361 the name to be called if we can't opencode the function. */
6364 define_function (name
, type
, pfn
, library_name
)
6367 void (*pfn
) PROTO((tree
));
6368 const char *library_name
;
6370 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6371 DECL_EXTERNAL (decl
) = 1;
6372 TREE_PUBLIC (decl
) = 1;
6373 DECL_ARTIFICIAL (decl
) = 1;
6375 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6376 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6378 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6379 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6380 function in the namespace. */
6381 if (pfn
) (*pfn
) (decl
);
6383 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6384 make_function_rtl (decl
);
6389 /* Wrapper around define_function, for the benefit of
6390 c_common_nodes_and_builtins.
6391 FUNCTION_CODE tells later passes how to compile calls to this function.
6392 See tree.h for its possible values. */
6395 builtin_function (name
, type
, code
, class, libname
)
6399 enum built_in_class
class;
6400 const char *libname
;
6402 tree decl
= define_function (name
, type
, (void (*) PROTO((tree
)))pushdecl
,
6404 DECL_BUILT_IN_CLASS (decl
) = class;
6405 DECL_FUNCTION_CODE (decl
) = code
;
6409 /* When we call finish_struct for an anonymous union, we create
6410 default copy constructors and such. But, an anonymous union
6411 shouldn't have such things; this function undoes the damage to the
6412 anonymous union type T.
6414 (The reason that we create the synthesized methods is that we don't
6415 distinguish `union { int i; }' from `typedef union { int i; } U'.
6416 The first is an anonymous union; the second is just an ordinary
6420 fixup_anonymous_aggr (t
)
6425 /* Wipe out memory of synthesized methods */
6426 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6427 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6428 TYPE_HAS_INIT_REF (t
) = 0;
6429 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6430 TYPE_HAS_ASSIGN_REF (t
) = 0;
6431 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6433 /* Splice the implicitly generated functions out of the TYPE_METHODS
6435 q
= &TYPE_METHODS (t
);
6438 if (DECL_ARTIFICIAL (*q
))
6439 *q
= TREE_CHAIN (*q
);
6441 q
= &TREE_CHAIN (*q
);
6444 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6445 function members. */
6446 if (TYPE_METHODS (t
))
6447 error ("an anonymous union cannot have function members");
6450 /* Make sure that a declaration with no declarator is well-formed, i.e.
6451 just defines a tagged type or anonymous union.
6453 Returns the type defined, if any. */
6456 check_tag_decl (declspecs
)
6460 tree ob_modifier
= NULL_TREE
;
6462 register tree t
= NULL_TREE
;
6464 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6466 register tree value
= TREE_VALUE (link
);
6472 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6474 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6478 else if (value
== ridpointers
[(int) RID_FRIEND
])
6480 if (current_class_type
== NULL_TREE
6481 || current_scope () != current_class_type
)
6482 ob_modifier
= value
;
6484 else if (value
== ridpointers
[(int) RID_STATIC
]
6485 || value
== ridpointers
[(int) RID_EXTERN
]
6486 || value
== ridpointers
[(int) RID_AUTO
]
6487 || value
== ridpointers
[(int) RID_REGISTER
]
6488 || value
== ridpointers
[(int) RID_INLINE
]
6489 || value
== ridpointers
[(int) RID_VIRTUAL
]
6490 || value
== ridpointers
[(int) RID_CONST
]
6491 || value
== ridpointers
[(int) RID_VOLATILE
]
6492 || value
== ridpointers
[(int) RID_EXPLICIT
])
6493 ob_modifier
= value
;
6497 error ("multiple types in one declaration");
6499 /* Inside a class, we might be in a friend or access declaration.
6500 Until we have a good way of detecting the latter, don't warn. */
6501 if (t
== NULL_TREE
&& ! current_class_type
)
6502 pedwarn ("declaration does not declare anything");
6504 /* Check for an anonymous union. We're careful
6505 accessing TYPE_IDENTIFIER because some built-in types, like
6506 pointer-to-member types, do not have TYPE_NAME. */
6507 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6509 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6511 /* Anonymous unions are objects, so they can have specifiers. */;
6512 SET_ANON_AGGR_TYPE_P (t
);
6514 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6515 pedwarn ("ISO C++ prohibits anonymous structs");
6518 else if (ob_modifier
)
6520 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6521 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6522 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6523 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6524 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6525 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6526 cp_error ("`%D' can only be specified for constructors",
6529 cp_error ("`%D' can only be specified for objects and functions",
6536 /* Called when a declaration is seen that contains no names to declare.
6537 If its type is a reference to a structure, union or enum inherited
6538 from a containing scope, shadow that tag name for the current scope
6539 with a forward reference.
6540 If its type defines a new named structure or union
6541 or defines an enum, it is valid but we need not do anything here.
6542 Otherwise, it is an error.
6544 C++: may have to grok the declspecs to learn about static,
6545 complain for anonymous unions. */
6548 shadow_tag (declspecs
)
6551 tree t
= check_tag_decl (declspecs
);
6554 maybe_process_partial_specialization (t
);
6556 /* This is where the variables in an anonymous union are
6557 declared. An anonymous union declaration looks like:
6559 because there is no declarator after the union, the parser
6560 sends that declaration here. */
6561 if (t
&& ANON_AGGR_TYPE_P (t
))
6563 fixup_anonymous_aggr (t
);
6565 if (TYPE_FIELDS (t
))
6567 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6569 finish_anon_union (decl
);
6574 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6577 groktypename (typename
)
6580 if (TREE_CODE (typename
) != TREE_LIST
)
6582 return grokdeclarator (TREE_VALUE (typename
),
6583 TREE_PURPOSE (typename
),
6584 TYPENAME
, 0, NULL_TREE
);
6587 /* Decode a declarator in an ordinary declaration or data definition.
6588 This is called as soon as the type information and variable name
6589 have been parsed, before parsing the initializer if any.
6590 Here we create the ..._DECL node, fill in its type,
6591 and put it on the list of decls for the current context.
6592 The ..._DECL node is returned as the value.
6594 Exception: for arrays where the length is not specified,
6595 the type is left null, to be filled in by `cp_finish_decl'.
6597 Function definitions do not come here; they go to start_function
6598 instead. However, external and forward declarations of functions
6599 do go through here. Structure field declarations are done by
6600 grokfield and not through here. */
6602 /* Set this to zero to debug not using the temporary obstack
6603 to parse initializers. */
6604 int debug_temp_inits
= 1;
6607 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6608 tree declarator
, declspecs
;
6610 tree attributes
, prefix_attributes
;
6613 register tree type
, tem
;
6615 extern int have_extern_spec
;
6616 extern int used_extern_spec
;
6620 /* See code below that used this. */
6621 int init_written
= initialized
;
6624 /* This should only be done once on the top most decl. */
6625 if (have_extern_spec
&& !used_extern_spec
)
6627 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6629 used_extern_spec
= 1;
6632 if (attributes
|| prefix_attributes
)
6633 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6635 attrlist
= NULL_TREE
;
6637 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6640 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6643 type
= TREE_TYPE (decl
);
6645 if (type
== error_mark_node
)
6649 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6650 ? DECL_CLASS_CONTEXT (decl
)
6651 : DECL_CONTEXT (decl
);
6653 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6654 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6656 /* When parsing the initializer, lookup should use the object's
6658 push_decl_namespace (context
);
6661 /* We are only interested in class contexts, later. */
6662 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6663 context
= NULL_TREE
;
6666 /* Is it valid for this decl to have an initializer at all?
6667 If not, set INITIALIZED to zero, which will indirectly
6668 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6669 switch (TREE_CODE (decl
))
6672 /* typedef foo = bar means give foo the same type as bar.
6673 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6674 Any other case of an initialization in a TYPE_DECL is an error. */
6675 if (pedantic
|| list_length (declspecs
) > 1)
6677 cp_error ("typedef `%D' is initialized", decl
);
6683 cp_error ("function `%#D' is initialized like a variable", decl
);
6693 if (! toplevel_bindings_p ()
6694 && DECL_EXTERNAL (decl
))
6695 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6697 DECL_EXTERNAL (decl
) = 0;
6698 if (toplevel_bindings_p ())
6699 TREE_STATIC (decl
) = 1;
6701 /* Tell `pushdecl' this is an initialized decl
6702 even though we don't yet have the initializer expression.
6703 Also tell `cp_finish_decl' it may store the real initializer. */
6704 DECL_INITIAL (decl
) = error_mark_node
;
6707 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6708 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6711 /* Set attributes here so if duplicate decl, will have proper attributes. */
6712 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6714 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6716 push_nested_class (context
, 2);
6718 if (TREE_CODE (decl
) == VAR_DECL
)
6720 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6721 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6722 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6725 if (DECL_CONTEXT (field
) != context
)
6727 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6728 DECL_CONTEXT (field
), DECL_NAME (decl
),
6729 context
, DECL_NAME (decl
));
6730 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6732 /* Static data member are tricky; an in-class initialization
6733 still doesn't provide a definition, so the in-class
6734 declaration will have DECL_EXTERNAL set, but will have an
6735 initialization. Thus, duplicate_decls won't warn
6736 about this situation, and so we check here. */
6737 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6738 cp_error ("duplicate initialization of %D", decl
);
6739 if (duplicate_decls (decl
, field
))
6745 tree field
= check_classfn (context
, decl
);
6746 if (field
&& duplicate_decls (decl
, field
))
6750 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6751 DECL_IN_AGGR_P (decl
) = 0;
6752 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6753 || CLASSTYPE_USE_TEMPLATE (context
))
6755 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6756 /* [temp.expl.spec] An explicit specialization of a static data
6757 member of a template is a definition if the declaration
6758 includes an initializer; otherwise, it is a declaration.
6760 We check for processing_specialization so this only applies
6761 to the new specialization syntax. */
6762 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6763 DECL_EXTERNAL (decl
) = 1;
6766 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6767 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6771 /* Enter this declaration into the symbol table. */
6772 tem
= maybe_push_decl (decl
);
6774 if (processing_template_decl
)
6775 tem
= push_template_decl (tem
);
6777 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6778 /* Tell the back-end to use or not use .common as appropriate. If we say
6779 -fconserve-space, we want this to save .data space, at the expense of
6780 wrong semantics. If we say -fno-conserve-space, we want this to
6781 produce errors about redefs; to do this we force variables into the
6783 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6786 if (! processing_template_decl
)
6796 tree type
= TREE_TYPE (decl
);
6797 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6799 if (type
== error_mark_node
)
6802 /* If this type of object needs a cleanup, but we're not allowed to
6803 add any more objects with cleanups to the current scope, create a
6804 new binding level. */
6805 if (TYPE_NEEDS_DESTRUCTOR (type
)
6806 && current_binding_level
->more_cleanups_ok
== 0)
6808 keep_next_level (2);
6811 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
6815 /* Is it valid for this decl to have an initializer at all?
6816 If not, set INITIALIZED to zero, which will indirectly
6817 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6819 /* Don't allow initializations for incomplete types except for
6820 arrays which might be completed by the initialization. */
6821 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6822 ; /* A complete type is ok. */
6823 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6825 cp_error ("variable `%#D' has initializer but incomplete type",
6828 type
= TREE_TYPE (decl
) = error_mark_node
;
6830 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6832 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6833 cp_error ("elements of array `%#D' have incomplete type", decl
);
6834 /* else we already gave an error in start_decl. */
6840 && TREE_CODE (decl
) != TYPE_DECL
6841 && TREE_CODE (decl
) != TEMPLATE_DECL
6842 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6844 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6845 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6847 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6849 /* Change the type so that assemble_variable will give
6850 DECL an rtl we can live with: (mem (const_int 0)). */
6851 type
= TREE_TYPE (decl
) = error_mark_node
;
6855 /* If any base type in the hierarchy of TYPE needs a constructor,
6856 then we set initialized to 1. This way any nodes which are
6857 created for the purposes of initializing this aggregate
6858 will live as long as it does. This is necessary for global
6859 aggregates which do not have their initializers processed until
6860 the end of the file. */
6861 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6866 DECL_INITIAL (decl
) = NULL_TREE
;
6869 /* Handle initialization of references.
6870 These three arguments are from `cp_finish_decl', and have the
6871 same meaning here that they do there.
6873 Quotes on semantics can be found in ARM 8.4.3. */
6876 grok_reference_init (decl
, type
, init
)
6877 tree decl
, type
, init
;
6881 if (init
== NULL_TREE
)
6883 if ((DECL_LANG_SPECIFIC (decl
) == 0
6884 || DECL_IN_AGGR_P (decl
) == 0)
6885 && ! DECL_THIS_EXTERN (decl
))
6886 cp_error ("`%D' declared as reference but not initialized", decl
);
6890 if (init
== error_mark_node
)
6893 if (TREE_CODE (init
) == CONSTRUCTOR
)
6895 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6899 if (TREE_CODE (init
) == TREE_LIST
)
6900 init
= build_compound_expr (init
);
6902 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6903 init
= convert_from_reference (init
);
6905 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6906 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6908 /* Note: default conversion is only called in very special cases. */
6909 init
= default_conversion (init
);
6912 /* Convert INIT to the reference type TYPE. This may involve the
6913 creation of a temporary, whose lifetime must be the same as that
6914 of the reference. If so, a DECL_STMT for the temporary will be
6915 added just after the DECL_STMT for DECL. That's why we don't set
6916 DECL_INITIAL for local references (instead assigning to them
6917 explicitly); we need to allow the temporary to be initialized
6919 tmp
= convert_to_reference
6920 (type
, init
, CONV_IMPLICIT
,
6921 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6923 if (tmp
== error_mark_node
)
6925 else if (tmp
!= NULL_TREE
)
6928 tmp
= save_expr (tmp
);
6929 if (building_stmt_tree ())
6931 /* Initialize the declaration. */
6932 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
6933 finish_expr_stmt (tmp
);
6936 DECL_INITIAL (decl
) = tmp
;
6940 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
6944 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
6946 expand_static_init (decl
, DECL_INITIAL (decl
));
6947 DECL_INITIAL (decl
) = NULL_TREE
;
6952 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
6953 mucking with forces it does not comprehend (i.e. initialization with a
6954 constructor). If we are at global scope and won't go into COMMON, fill
6955 it in with a dummy CONSTRUCTOR to force the variable into .data;
6956 otherwise we can use error_mark_node. */
6959 obscure_complex_init (decl
, init
)
6962 if (! flag_no_inline
&& TREE_STATIC (decl
))
6964 if (extract_init (decl
, init
))
6968 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6969 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
6970 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
6974 DECL_INITIAL (decl
) = error_mark_node
;
6979 /* When parsing `int a[] = {1, 2};' we don't know the size of the
6980 array until we finish parsing the initializer. If that's the
6981 situation we're in, update DECL accordingly. */
6984 maybe_deduce_size_from_array_init (decl
, init
)
6988 tree type
= TREE_TYPE (decl
);
6990 if (TREE_CODE (type
) == ARRAY_TYPE
6991 && TYPE_DOMAIN (type
) == NULL_TREE
6992 && TREE_CODE (decl
) != TYPE_DECL
)
6995 = (TREE_STATIC (decl
)
6996 /* Even if pedantic, an external linkage array
6997 may have incomplete type at first. */
6998 ? pedantic
&& ! DECL_EXTERNAL (decl
)
6999 : !DECL_EXTERNAL (decl
));
7000 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7001 int failure
= complete_array_type (type
, initializer
, do_default
);
7004 cp_error ("initializer fails to determine size of `%D'", decl
);
7009 cp_error ("array size missing in `%D'", decl
);
7010 /* If a `static' var's size isn't known, make it extern as
7011 well as static, so it does not get allocated. If it's not
7012 `static', then don't mark it extern; finish_incomplete_decl
7013 will give it a default size and it will get allocated. */
7014 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7015 DECL_EXTERNAL (decl
) = 1;
7018 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7019 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7021 cp_error ("zero-size array `%D'", decl
);
7023 layout_decl (decl
, 0);
7027 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7028 any appropriate error messages regarding the layout. */
7031 layout_var_decl (decl
)
7034 tree type
= TREE_TYPE (decl
);
7036 tree ttype
= target_type (type
);
7039 /* If we haven't already layed out this declaration, do so now.
7040 Note that we must not call complete type for an external object
7041 because it's type might involve templates that we are not
7042 supposed to isntantiate yet. (And it's perfectly legal to say
7043 `extern X x' for some incomplete type `X'.) */
7044 if (!DECL_EXTERNAL (decl
))
7045 complete_type (type
);
7046 if (!DECL_SIZE (decl
)&& TYPE_SIZE (type
))
7047 layout_decl (decl
, 0);
7049 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7051 /* An automatic variable with an incomplete type: that is an error.
7052 Don't talk about array types here, since we took care of that
7053 message in grokdeclarator. */
7054 cp_error ("storage size of `%D' isn't known", decl
);
7055 TREE_TYPE (decl
) = error_mark_node
;
7058 /* Keep this code around in case we later want to control debug info
7059 based on whether a type is "used". (jason 1999-11-11) */
7061 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7062 /* Let debugger know it should output info for this type. */
7063 note_debug_info_needed (ttype
);
7065 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7066 note_debug_info_needed (DECL_CONTEXT (decl
));
7069 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7070 && DECL_SIZE (decl
) != NULL_TREE
7071 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7073 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7074 constant_expression_warning (DECL_SIZE (decl
));
7076 cp_error ("storage size of `%D' isn't constant", decl
);
7080 /* If a local static variable is declared in an inline function, or if
7081 we have a weak definition, we must endeavor to create only one
7082 instance of the variable at link-time. */
7085 maybe_commonize_var (decl
)
7088 /* Static data in a function with comdat linkage also has comdat
7090 if (TREE_STATIC (decl
)
7091 /* Don't mess with __FUNCTION__. */
7092 && ! TREE_ASM_WRITTEN (decl
)
7093 && current_function_decl
7094 && DECL_CONTEXT (decl
) == current_function_decl
7095 && (DECL_THIS_INLINE (current_function_decl
)
7096 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7097 && TREE_PUBLIC (current_function_decl
))
7099 /* Rather than try to get this right with inlining, we suppress
7100 inlining of such functions. */
7101 current_function_cannot_inline
7102 = "function with static variable cannot be inline";
7104 /* If flag_weak, we don't need to mess with this, as we can just
7105 make the function weak, and let it refer to its unique local
7106 copy. This works because we don't allow the function to be
7110 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7112 TREE_PUBLIC (decl
) = 1;
7113 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7115 else if (DECL_INITIAL (decl
) == NULL_TREE
7116 || DECL_INITIAL (decl
) == error_mark_node
)
7118 TREE_PUBLIC (decl
) = 1;
7119 DECL_COMMON (decl
) = 1;
7121 /* else we lose. We can only do this if we can use common,
7122 which we can't if it has been initialized. */
7124 if (TREE_PUBLIC (decl
))
7125 DECL_ASSEMBLER_NAME (decl
)
7126 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7127 else if (! DECL_ARTIFICIAL (decl
))
7129 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7130 cp_warning_at (" you can work around this by removing the initializer", decl
);
7134 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7135 /* Set it up again; we might have set DECL_INITIAL since the last
7137 comdat_linkage (decl
);
7140 /* Issue an error message if DECL is an uninitialized const variable. */
7143 check_for_uninitialized_const_var (decl
)
7146 tree type
= TREE_TYPE (decl
);
7148 /* ``Unless explicitly declared extern, a const object does not have
7149 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7151 if (TREE_CODE (decl
) == VAR_DECL
7152 && TREE_CODE (type
) != REFERENCE_TYPE
7153 && CP_TYPE_CONST_P (type
)
7154 && !TYPE_NEEDS_CONSTRUCTING (type
)
7155 && !DECL_INITIAL (decl
))
7156 cp_error ("uninitialized const `%D'", decl
);
7159 /* Verify INIT (the initializer for DECL), and record the
7160 initialization in DECL_INITIAL, if appropriate. Returns a new
7164 check_initializer (decl
, init
)
7170 if (TREE_CODE (decl
) == FIELD_DECL
)
7173 type
= TREE_TYPE (decl
);
7175 /* If `start_decl' didn't like having an initialization, ignore it now. */
7176 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7179 /* Check the initializer. */
7182 /* Things that are going to be initialized need to have complete
7184 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7186 if (type
== error_mark_node
)
7187 /* We will have already complained. */
7189 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7191 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7194 else if (TREE_CODE (type
) == ARRAY_TYPE
7195 && !TYPE_SIZE (TREE_TYPE (type
)))
7197 cp_error ("elements of array `%#D' have incomplete type", decl
);
7200 else if (!TYPE_SIZE (type
))
7202 cp_error ("`%D' has incomplete type", decl
);
7203 TREE_TYPE (decl
) = error_mark_node
;
7208 if (TREE_CODE (decl
) == CONST_DECL
)
7210 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7212 DECL_INITIAL (decl
) = init
;
7214 /* This will keep us from needing to worry about our obstacks. */
7215 my_friendly_assert (init
!= NULL_TREE
, 149);
7218 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7220 if (TREE_STATIC (decl
))
7221 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7222 grok_reference_init (decl
, type
, init
);
7227 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7229 if (TREE_CODE (type
) == ARRAY_TYPE
)
7230 init
= digest_init (type
, init
, (tree
*) 0);
7231 else if (TREE_CODE (init
) == CONSTRUCTOR
7232 && TREE_HAS_CONSTRUCTOR (init
))
7234 if (TYPE_NON_AGGREGATE_CLASS (type
))
7236 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7238 init
= error_mark_node
;
7241 goto dont_use_constructor
;
7246 dont_use_constructor
:
7247 if (TREE_CODE (init
) != TREE_VEC
)
7248 init
= store_init_value (decl
, init
);
7252 /* We must hide the initializer so that expand_decl
7253 won't try to do something it does not understand. */
7254 init
= obscure_complex_init (decl
, init
);
7256 else if (DECL_EXTERNAL (decl
))
7258 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7259 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7261 tree core_type
= strip_array_types (type
);
7263 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7265 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7266 cp_error ("structure `%D' with uninitialized const members", decl
);
7267 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7268 cp_error ("structure `%D' with uninitialized reference members",
7272 check_for_uninitialized_const_var (decl
);
7274 if (TYPE_SIZE (type
) != NULL_TREE
7275 && TYPE_NEEDS_CONSTRUCTING (type
))
7276 init
= obscure_complex_init (decl
, NULL_TREE
);
7280 check_for_uninitialized_const_var (decl
);
7285 /* If DECL is not a local variable, give it RTL. */
7288 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7291 const char *asmspec
;
7296 type
= TREE_TYPE (decl
);
7297 toplev
= toplevel_bindings_p ();
7299 /* Handle non-variables up front. */
7300 if (TREE_CODE (decl
) != VAR_DECL
)
7302 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7306 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7308 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7310 if (DECL_VIRTUAL_P (decl
))
7311 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7312 else if (TREE_READONLY (decl
)
7313 && DECL_INITIAL (decl
) != NULL_TREE
7314 && DECL_INITIAL (decl
) != error_mark_node
7315 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7317 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7319 if (toplev
&& ! TREE_PUBLIC (decl
))
7321 /* If this is a static const, change its apparent linkage
7322 if it belongs to a #pragma interface. */
7323 if (!interface_unknown
)
7325 TREE_PUBLIC (decl
) = 1;
7326 DECL_EXTERNAL (decl
) = interface_only
;
7328 make_decl_rtl (decl
, asmspec
, toplev
);
7331 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7333 else if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7335 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7337 if (init
== NULL_TREE
7338 #ifdef DEFAULT_STATIC_DEFS
7339 /* If this code is dead, then users must
7340 explicitly declare static member variables
7341 outside the class def'n as well. */
7342 && TYPE_NEEDS_CONSTRUCTING (type
)
7346 DECL_EXTERNAL (decl
) = 1;
7347 make_decl_rtl (decl
, asmspec
, 1);
7350 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7352 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7353 || (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
)))
7354 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7357 /* Create RTL for the local static variable DECL. */
7360 make_rtl_for_local_static (decl
)
7363 tree type
= TREE_TYPE (decl
);
7364 const char *asmspec
= NULL
;
7366 if (TREE_READONLY (decl
)
7367 && DECL_INITIAL (decl
) != NULL_TREE
7368 && DECL_INITIAL (decl
) != error_mark_node
7369 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7370 && ! TREE_SIDE_EFFECTS (decl
)
7371 && ! TREE_PUBLIC (decl
)
7372 && ! DECL_EXTERNAL (decl
)
7373 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7374 && ! TREE_ADDRESSABLE (decl
)
7375 && DECL_MODE (decl
) != BLKmode
)
7377 /* As an optimization, we try to put register-sized static
7378 constants in a register, rather than writing them out. If we
7379 take the address of the constant later, we'll make RTL for it
7381 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7382 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7383 TREE_ASM_WRITTEN (decl
) = 1;
7387 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7389 /* The only way this situaton can occur is if the
7390 user specified a name for this DECL using the
7391 `attribute' syntax. */
7392 asmspec
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
7393 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
7396 rest_of_decl_compilation (decl
, asmspec
, /*top_level=*/0, /*at_end=*/0);
7399 /* The old ARM scoping rules injected variables declared in the
7400 initialization statement of a for-statement into the surrounding
7401 scope. We support this usage, in order to be backward-compatible.
7402 DECL is a just-declared VAR_DECL; if necessary inject its
7403 declaration into the surrounding scope. */
7406 maybe_inject_for_scope_var (decl
)
7409 if (current_binding_level
->is_for_scope
)
7411 struct binding_level
*outer
7412 = current_binding_level
->level_chain
;
7414 /* Check to see if the same name is already bound at the outer
7415 level, either because it was directly declared, or because a
7416 dead for-decl got preserved. In either case, the code would
7417 not have been valid under the ARM scope rules, so clear
7418 is_for_scope for the current_binding_level.
7420 Otherwise, we need to preserve the temp slot for decl to last
7421 into the outer binding level. */
7424 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7426 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7427 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7429 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7431 BINDING_VALUE (outer_binding
)
7432 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7433 current_binding_level
->is_for_scope
= 0;
7435 else if (DECL_IN_MEMORY_P (decl
))
7436 preserve_temp_slots (DECL_RTL (decl
));
7440 /* Generate code to initialize DECL (a local variable). */
7443 initialize_local_var (decl
, init
, flags
)
7448 tree type
= TREE_TYPE (decl
);
7450 /* If the type is bogus, don't bother initializing the variable. */
7451 if (type
== error_mark_node
)
7454 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7456 /* If we used it already as memory, it must stay in memory. */
7457 DECL_INITIAL (decl
) = NULL_TREE
;
7458 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7461 /* Local statics are handled differently from ordinary automatic
7463 if (TREE_STATIC (decl
))
7465 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7466 || TYPE_NEEDS_DESTRUCTOR (type
))
7467 expand_static_init (decl
, init
);
7471 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7475 /* Compute and store the initial value. */
7476 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7478 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7480 int saved_stmts_are_full_exprs_p
;
7482 emit_line_note (DECL_SOURCE_FILE (decl
),
7483 DECL_SOURCE_LINE (decl
));
7484 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7485 stmts_are_full_exprs_p
= 1;
7486 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7487 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7490 /* Set this to 0 so we can tell whether an aggregate which was
7491 initialized was ever used. Don't do this if it has a
7492 destructor, so we don't complain about the 'resource
7493 allocation is initialization' idiom. Now set
7494 attribute((unused)) on types so decls of that type will be
7495 marked used. (see TREE_USED, above.) */
7496 if (TYPE_NEEDS_CONSTRUCTING (type
)
7498 && !TYPE_NEEDS_DESTRUCTOR (type
)
7499 && DECL_NAME (decl
))
7500 TREE_USED (decl
) = 0;
7501 else if (already_used
)
7502 TREE_USED (decl
) = 1;
7506 /* Generate code to destroy DECL (a local variable). */
7509 destroy_local_var (decl
)
7512 tree type
= TREE_TYPE (decl
);
7515 /* Only variables get cleaned up. */
7516 if (TREE_CODE (decl
) != VAR_DECL
)
7519 /* And only things with destructors need cleaning up. */
7520 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7523 if (TREE_CODE (decl
) == VAR_DECL
&&
7524 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7525 /* We don't clean up things that aren't defined in this
7526 translation unit, or that need a static cleanup. The latter
7527 are handled by finish_file. */
7530 /* Compute the cleanup. */
7531 cleanup
= maybe_build_cleanup (decl
);
7533 /* Record the cleanup required for this declaration. */
7534 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7536 finish_decl_cleanup (decl
, cleanup
);
7539 /* Let the back-end know about DECL. */
7542 emit_local_var (decl
)
7545 /* Create RTL for this variable. */
7546 if (DECL_RTL (decl
))
7547 /* Only a RESULT_DECL should have non-NULL RTL when
7548 arriving here. All other local variables are
7549 assigned RTL in this function. */
7550 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7554 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7555 /* The user must have specified an assembler name for this
7556 variable. Set that up now. */
7557 rest_of_decl_compilation
7558 (decl
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
7559 /*top_level=*/0, /*at_end=*/0);
7564 /* Actually do the initialization. */
7565 expand_start_target_temps ();
7566 expand_decl_init (decl
);
7567 expand_end_target_temps ();
7570 /* Finish processing of a declaration;
7571 install its line number and initial value.
7572 If the length of an array type is not known before,
7573 it must be determined now, from the initial value, or it is an error.
7575 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7576 for aggregates that have constructors alive on the permanent obstack,
7577 so that the global initializing functions can be written at the end.
7579 INIT0 holds the value of an initializer that should be allowed to escape
7582 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7583 if the (init) syntax was used.
7585 For functions that take default parameters, DECL points to its
7586 "maximal" instantiation. `cp_finish_decl' must then also declared its
7587 subsequently lower and lower forms of instantiation, checking for
7588 ambiguity as it goes. This can be sped up later. */
7591 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7597 tree ttype
= NULL_TREE
;
7598 const char *asmspec
= NULL
;
7599 int was_readonly
= 0;
7601 /* If this is 0, then we did not change obstacks. */
7605 error ("assignment (not initialization) in declaration");
7609 /* Handling __FUNCTION__ and its ilk in a template-function requires
7610 some special processing because we are called from
7611 language-independent code. */
7612 if (current_function
&& processing_template_decl
7613 && current_function_name_declared
== 2)
7615 /* Since we're in a template function, we need to
7616 push_template_decl. The language-independent code in
7617 declare_hidden_char_array doesn't know to do this. */
7618 retrofit_lang_decl (decl
);
7619 decl
= push_template_decl (decl
);
7621 if (strcmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
7622 "__PRETTY_FUNCTION__") == 0)
7624 init
= build (FUNCTION_NAME
, const_string_type_node
);
7625 DECL_PRETTY_FUNCTION_P (decl
) = 1;
7629 /* If a name was specified, get the string. */
7631 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7633 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7635 cp_error ("Cannot initialize `%D' to namespace `%D'",
7640 if (current_class_type
7641 && DECL_REAL_CONTEXT (decl
) == current_class_type
7642 && TYPE_BEING_DEFINED (current_class_type
)
7643 && (DECL_INITIAL (decl
) || init
))
7644 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7646 if (TREE_CODE (decl
) == VAR_DECL
7647 && DECL_CONTEXT (decl
)
7648 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7649 && DECL_CONTEXT (decl
) != current_namespace
7652 /* Leave the namespace of the object. */
7653 pop_decl_namespace ();
7656 type
= TREE_TYPE (decl
);
7658 if (type
== error_mark_node
)
7661 /* Add this declaration to the statement-tree. */
7662 if (building_stmt_tree () && at_function_scope_p ())
7663 add_decl_stmt (decl
);
7665 if (TYPE_HAS_MUTABLE_P (type
))
7666 TREE_READONLY (decl
) = 0;
7668 if (processing_template_decl
)
7670 if (init
&& DECL_INITIAL (decl
))
7671 DECL_INITIAL (decl
) = init
;
7675 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7676 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7678 /* Take care of TYPE_DECLs up front. */
7679 if (TREE_CODE (decl
) == TYPE_DECL
)
7681 if (init
&& DECL_INITIAL (decl
))
7683 /* typedef foo = bar; store the type of bar as the type of foo. */
7684 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7685 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7687 if (type
!= error_mark_node
7688 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7690 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7691 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7692 set_identifier_type_value (DECL_NAME (decl
), type
);
7693 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7695 GNU_xref_decl (current_function_decl
, decl
);
7697 /* If we have installed this as the canonical typedef for this
7698 type, and that type has not been defined yet, delay emitting
7699 the debug information for it, as we will emit it later. */
7700 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7701 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7702 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7704 rest_of_decl_compilation (decl
, NULL_PTR
,
7705 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7709 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7710 ttype
= target_type (type
);
7712 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7713 && TYPE_NEEDS_CONSTRUCTING (type
))
7715 /* Currently, GNU C++ puts constants in text space, making them
7716 impossible to initialize. In the future, one would hope for
7717 an operating system which understood the difference between
7718 initialization and the running of a program. */
7720 TREE_READONLY (decl
) = 0;
7723 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7725 /* This must override the asm specifier which was placed by
7726 grokclassfn. Lay this out fresh. */
7727 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7728 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7729 make_decl_rtl (decl
, asmspec
, 0);
7732 /* Deduce size of array from initialization, if not already known. */
7733 maybe_deduce_size_from_array_init (decl
, init
);
7734 init
= check_initializer (decl
, init
);
7736 GNU_xref_decl (current_function_decl
, decl
);
7738 if (TREE_CODE (decl
) == VAR_DECL
)
7739 layout_var_decl (decl
);
7741 /* Output the assembler code and/or RTL code for variables and functions,
7742 unless the type is an undefined structure or union.
7743 If not, it will get done when the type is completed. */
7744 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7745 || TREE_CODE (decl
) == RESULT_DECL
)
7747 if (TREE_CODE (decl
) == VAR_DECL
)
7748 maybe_commonize_var (decl
);
7750 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7752 if (TREE_CODE (type
) == FUNCTION_TYPE
7753 || TREE_CODE (type
) == METHOD_TYPE
)
7754 abstract_virtuals_error (decl
,
7755 strip_array_types (TREE_TYPE (type
)));
7757 abstract_virtuals_error (decl
, strip_array_types (type
));
7759 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7761 else if (DECL_EXTERNAL (decl
)
7762 && ! (DECL_LANG_SPECIFIC (decl
)
7763 && DECL_NOT_REALLY_EXTERN (decl
)))
7766 DECL_INITIAL (decl
) = init
;
7768 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
7770 /* This is a local declaration. */
7771 if (doing_semantic_analysis_p ())
7772 maybe_inject_for_scope_var (decl
);
7773 /* Initialize the local variable. But, if we're building a
7774 statement-tree, we'll do the initialization when we
7776 if (processing_template_decl
)
7778 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7779 DECL_INITIAL (decl
) = init
;
7783 /* If we're not building RTL, then we need to do so
7785 if (!building_stmt_tree ())
7786 emit_local_var (decl
);
7787 /* Initialize the variable. */
7788 initialize_local_var (decl
, init
, flags
);
7789 /* Clean up the variable. */
7790 destroy_local_var (decl
);
7793 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7795 /* Cleanups for static variables are handled by `finish_file'. */
7796 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7797 || TYPE_NEEDS_DESTRUCTOR (type
))
7798 expand_static_init (decl
, init
);
7802 /* Undo call to `pushclass' that was done in `start_decl'
7803 due to initialization of qualified member variable.
7804 I.e., Foo::x = 10; */
7806 tree context
= DECL_REAL_CONTEXT (decl
);
7808 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7809 && (TREE_CODE (decl
) == VAR_DECL
7810 /* We also have a pushclass done that we need to undo here
7811 if we're at top level and declare a method. */
7812 || TREE_CODE (decl
) == FUNCTION_DECL
)
7813 /* If size hasn't been set, we're still defining it,
7814 and therefore inside the class body; don't pop
7815 the binding level.. */
7816 && TYPE_SIZE (context
) != NULL_TREE
7817 && context
== current_class_type
)
7818 pop_nested_class ();
7824 /* If requested, warn about definitions of large data objects. */
7826 if (warn_larger_than
7827 && ! processing_template_decl
7828 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7829 && !DECL_EXTERNAL (decl
))
7831 register tree decl_size
= DECL_SIZE (decl
);
7833 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7835 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7837 if (units
> larger_than_size
)
7838 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7843 TREE_READONLY (decl
) = 1;
7846 /* This is here for a midend callback from c-common.c */
7849 finish_decl (decl
, init
, asmspec_tree
)
7853 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
7856 /* Generate code to handle the destruction of the function-scoped
7857 static variable DECL. */
7860 destroy_local_static (decl
)
7863 tree cleanup
, fcall
;
7865 int saved_flag_access_control
;
7867 if (atexit_node
== 0)
7869 tree atexit_fndecl
, PFV
, pfvlist
;
7871 PFV
= build_pointer_type (build_function_type
7872 (void_type_node
, void_list_node
));
7874 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7876 push_lang_context (lang_name_c
);
7877 /* Note that we do not call pushdecl for this function;
7878 there's no reason that this declaration should be
7879 accessible to anyone. */
7881 = define_function ("atexit",
7882 build_function_type (void_type_node
,
7884 /*pfn=*/0, NULL_PTR
);
7885 mark_used (atexit_fndecl
);
7886 atexit_node
= default_conversion (atexit_fndecl
);
7887 pop_lang_context ();
7890 /* Call build_cleanup before we enter the anonymous function so that
7891 any access checks will be done relative to the current scope,
7892 rather than the scope of the anonymous function. */
7893 build_cleanup (decl
);
7895 /* Now start the function. */
7896 cleanup
= start_anon_func ();
7898 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7899 to the original function, rather than the anonymous one. That
7900 will make the back-end think that nested functions are in use,
7901 which causes confusion. */
7902 saved_flag_access_control
= flag_access_control
;
7903 flag_access_control
= 0;
7904 fcall
= build_cleanup (decl
);
7905 flag_access_control
= saved_flag_access_control
;
7907 /* Create the body of the anonymous function. */
7908 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7909 finish_expr_stmt (fcall
);
7910 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7913 /* Call atexit with the cleanup function. */
7914 mark_addressable (cleanup
);
7915 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7916 fcall
= build_function_call (atexit_node
,
7917 tree_cons (NULL_TREE
,
7920 finish_expr_stmt (fcall
);
7924 expand_static_init (decl
, init
)
7928 tree oldstatic
= value_member (decl
, static_aggregates
);
7932 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7933 cp_error ("multiple initializations given for `%D'", decl
);
7935 else if (! toplevel_bindings_p ())
7937 /* Emit code to perform this initialization but once. */
7944 /* Emit code to perform this initialization but once. This code
7947 static int temp = 0;
7949 // Do initialization.
7951 // Register variable for destruction at end of program.
7954 Note that the `temp' variable is only set to 1 *after* the
7955 initialization is complete. This ensures that an exception,
7956 thrown during the construction, will cause the variable to
7957 reinitialized when we pass through this code again, as per:
7961 If the initialization exits by throwing an exception, the
7962 initialization is not complete, so it will be tried again
7963 the next time control enters the declaration.
7965 In theory, this process should be thread-safe, too; multiple
7966 threads should not be able to initialize the variable more
7967 than once. We don't yet attempt to ensure thread-safety. */
7968 temp
= get_temp_name (integer_type_node
, 1);
7969 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
7971 /* Begin the conditional initialization. */
7972 if_stmt
= begin_if_stmt ();
7973 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
7976 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
7978 /* Do the initialization itself. */
7979 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
7980 || (init
&& TREE_CODE (init
) == TREE_LIST
))
7981 assignment
= build_aggr_init (decl
, init
, 0);
7983 /* The initialization we're doing here is just a bitwise
7985 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
7987 assignment
= NULL_TREE
;
7989 /* Once the assignment is complete, set TEMP to 1. Since the
7990 construction of the static object is complete at this point,
7991 we want to make sure TEMP is set to 1 even if a temporary
7992 constructed during the initialization throws an exception
7993 when it is destroyed. So, we combine the initialization and
7994 the assignment to TEMP into a single expression, ensuring
7995 that when we call finish_expr_stmt the cleanups will not be
7996 run until after TEMP is set to 1. */
7997 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8000 assignment
= tree_cons (NULL_TREE
, assignment
,
8001 build_tree_list (NULL_TREE
,
8003 assignment
= build_compound_expr (assignment
);
8006 assignment
= temp_init
;
8007 finish_expr_stmt (assignment
);
8009 /* Use atexit to register a function for destroying this static
8011 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8012 destroy_local_static (decl
);
8014 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8015 finish_then_clause (if_stmt
);
8020 /* This code takes into account memory allocation policy of
8021 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8022 hold for this object, then we must make permanent the storage
8023 currently in the temporary obstack. */
8024 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8025 preserve_initializer ();
8026 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8030 /* Finish the declaration of a catch-parameter. */
8033 start_handler_parms (declspecs
, declarator
)
8040 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8042 if (decl
== NULL_TREE
)
8043 error ("invalid catch parameter");
8052 /* Make TYPE a complete type based on INITIAL_VALUE.
8053 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8054 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8057 complete_array_type (type
, initial_value
, do_default
)
8058 tree type
, initial_value
;
8061 register tree maxindex
= NULL_TREE
;
8066 /* Note MAXINDEX is really the maximum index,
8067 one less than the size. */
8068 if (TREE_CODE (initial_value
) == STRING_CST
)
8071 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8072 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8075 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8077 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8078 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8079 for (; elts
; elts
= TREE_CHAIN (elts
))
8081 if (TREE_PURPOSE (elts
))
8082 maxindex
= TREE_PURPOSE (elts
);
8084 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8086 maxindex
= copy_node (maxindex
);
8090 /* Make an error message unless that happened already. */
8091 if (initial_value
!= error_mark_node
)
8094 initial_value
= NULL_TREE
;
8096 /* Prevent further error messages. */
8097 maxindex
= build_int_2 (0, 0);
8104 maxindex
= build_int_2 (0, 0);
8113 domain
= build_index_type (maxindex
);
8114 TYPE_DOMAIN (type
) = domain
;
8116 if (! TREE_TYPE (maxindex
))
8117 TREE_TYPE (maxindex
) = domain
;
8119 itype
= TREE_TYPE (initial_value
);
8122 if (itype
&& !TYPE_DOMAIN (itype
))
8123 TYPE_DOMAIN (itype
) = domain
;
8124 /* The type of the main variant should never be used for arrays
8125 of different sizes. It should only ever be completed with the
8126 size of the array. */
8127 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8128 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8131 /* Lay out the type now that we can get the real answer. */
8138 /* Return zero if something is declared to be a member of type
8139 CTYPE when in the context of CUR_TYPE. STRING is the error
8140 message to print in that case. Otherwise, quietly return 1. */
8143 member_function_or_else (ctype
, cur_type
, string
)
8144 tree ctype
, cur_type
;
8147 if (ctype
&& ctype
!= cur_type
)
8149 error (string
, TYPE_NAME_STRING (ctype
));
8155 /* Subroutine of `grokdeclarator'. */
8157 /* Generate errors possibly applicable for a given set of specifiers.
8158 This is for ARM $7.1.2. */
8161 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8164 int virtualp
, quals
, friendp
, raises
, inlinep
;
8167 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8169 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8171 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8174 cp_error_at ("`%D' declared as a friend", object
);
8176 cp_error_at ("`%D' declared with an exception specification", object
);
8179 /* CTYPE is class type, or null if non-class.
8180 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8182 DECLARATOR is the function's name.
8183 VIRTUALP is truthvalue of whether the function is virtual or not.
8184 FLAGS are to be passed through to `grokclassfn'.
8185 QUALS are qualifiers indicating whether the function is `const'
8187 RAISES is a list of exceptions that this function can raise.
8188 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8189 not look, and -1 if we should not call `grokclassfn' at all.
8191 Returns `NULL_TREE' if something goes wrong, after issuing
8192 applicable error messages. */
8195 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8196 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8197 template_count
, in_namespace
)
8200 tree orig_declarator
;
8202 enum overload_flags flags
;
8204 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8208 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8209 int has_default_arg
= 0;
8213 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8214 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8220 type
= build_exception_variant (type
, raises
);
8223 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8224 /* Propagate volatile out from type to decl. */
8225 if (TYPE_VOLATILE (type
))
8226 TREE_THIS_VOLATILE (decl
) = 1;
8228 /* If this decl has namespace scope, set that up. */
8230 set_decl_namespace (decl
, in_namespace
, friendp
);
8231 else if (publicp
&& ! ctype
)
8232 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8234 /* `main' and builtins have implicit 'C' linkage. */
8235 if ((MAIN_NAME_P (declarator
)
8236 || (IDENTIFIER_LENGTH (declarator
) > 10
8237 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8238 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8239 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8240 && current_lang_name
== lang_name_cplusplus
8241 && ctype
== NULL_TREE
8242 /* NULL_TREE means global namespace. */
8243 && DECL_CONTEXT (decl
) == NULL_TREE
)
8244 DECL_LANGUAGE (decl
) = lang_c
;
8246 /* Should probably propagate const out from type to decl I bet (mrs). */
8249 DECL_STATIC_FUNCTION_P (decl
) = 1;
8250 DECL_CONTEXT (decl
) = ctype
;
8254 DECL_CLASS_CONTEXT (decl
) = ctype
;
8256 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8258 if (processing_template_decl
)
8259 error ("cannot declare `main' to be a template");
8261 error ("cannot declare `main' to be inline");
8263 error ("cannot declare `main' to be static");
8268 /* Members of anonymous types and local classes have no linkage; make
8270 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8271 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8276 /* [basic.link]: A name with no linkage (notably, the name of a class
8277 or enumeration declared in a local scope) shall not be used to
8278 declare an entity with linkage.
8280 Only check this for public decls for now. */
8281 t
= no_linkage_check (TREE_TYPE (decl
));
8284 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8286 if (DECL_LANGUAGE (decl
) == lang_c
)
8287 /* Allow this; it's pretty common in C. */;
8289 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8293 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8298 TREE_PUBLIC (decl
) = publicp
;
8301 DECL_INTERFACE_KNOWN (decl
) = 1;
8302 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8306 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8308 DECL_EXTERNAL (decl
) = 1;
8309 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8311 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8312 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8316 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8317 grok_op_properties (decl
, virtualp
, check
< 0);
8319 if (ctype
&& hack_decl_function_context (decl
))
8320 DECL_NO_STATIC_CHAIN (decl
) = 1;
8322 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8323 if (TREE_PURPOSE (t
)
8324 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8326 has_default_arg
= 1;
8331 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8335 ("defining explicit specialization `%D' in friend declaration",
8339 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8341 /* Something like `template <class T> friend void f<T>()'. */
8342 cp_error ("template-id `%D' in declaration of primary template",
8348 /* A friend declaration of the form friend void f<>(). Record
8349 the information in the TEMPLATE_ID_EXPR. */
8350 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8351 DECL_TEMPLATE_INFO (decl
)
8352 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8353 TREE_OPERAND (orig_declarator
, 1),
8356 if (has_default_arg
)
8358 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8365 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8372 if (has_default_arg
)
8373 add_defarg_fn (decl
);
8375 /* Plain overloading: will not be grok'd by grokclassfn. */
8376 if (! ctype
&& ! processing_template_decl
8377 && DECL_LANGUAGE (decl
) != lang_c
8378 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8379 set_mangled_name_for_decl (decl
);
8382 /* Make the init_value nonzero so pushdecl knows this is not
8383 tentative. error_mark_node is replaced later with the BLOCK. */
8384 DECL_INITIAL (decl
) = error_mark_node
;
8386 /* Caller will do the rest of this. */
8390 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8393 /* Just handle constructors here. We could do this
8394 inside the following if stmt, but I think
8395 that the code is more legible by breaking this
8396 case out. See comments below for what each of
8397 the following calls is supposed to do. */
8398 DECL_CONSTRUCTOR_P (decl
) = 1;
8400 grokclassfn (ctype
, decl
, flags
, quals
);
8402 decl
= check_explicit_specialization (orig_declarator
, decl
,
8404 2 * (funcdef_flag
!= 0) +
8405 4 * (friendp
!= 0));
8406 if (decl
== error_mark_node
)
8409 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8412 tmp
= check_classfn (ctype
, decl
);
8414 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8415 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8417 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8418 cp_error ("definition of implicitly-declared `%D'", tmp
);
8419 if (tmp
&& duplicate_decls (decl
, tmp
))
8422 if (! grok_ctor_properties (ctype
, decl
))
8429 /* Function gets the ugly name, field gets the nice one.
8430 This call may change the type of the function (because
8431 of default parameters)! */
8432 if (ctype
!= NULL_TREE
)
8433 grokclassfn (ctype
, decl
, flags
, quals
);
8435 decl
= check_explicit_specialization (orig_declarator
, decl
,
8437 2 * (funcdef_flag
!= 0) +
8438 4 * (friendp
!= 0));
8439 if (decl
== error_mark_node
)
8442 if (ctype
!= NULL_TREE
8443 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8446 tmp
= check_classfn (ctype
, decl
);
8448 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8449 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8451 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8452 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8454 /* Remove the `this' parm added by grokclassfn.
8455 XXX Isn't this done in start_function, too? */
8456 revert_static_member_fn (&decl
, NULL
, NULL
);
8457 last_function_parms
= TREE_CHAIN (last_function_parms
);
8459 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8460 cp_error ("definition of implicitly-declared `%D'", tmp
);
8463 /* Attempt to merge the declarations. This can fail, in
8464 the case of some illegal specialization declarations. */
8465 if (!duplicate_decls (decl
, tmp
))
8466 cp_error ("no `%#D' member function declared in class `%T'",
8472 if (ctype
== NULL_TREE
|| check
)
8477 DECL_VIRTUAL_P (decl
) = 1;
8478 if (DECL_VINDEX (decl
) == NULL_TREE
)
8479 DECL_VINDEX (decl
) = error_mark_node
;
8480 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8487 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8490 RID_BIT_TYPE
*specbits_in
;
8496 RID_BIT_TYPE specbits
;
8498 specbits
= *specbits_in
;
8500 if (TREE_CODE (type
) == OFFSET_TYPE
)
8502 /* If you declare a static member so that it
8503 can be initialized, the code will reach here. */
8504 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8505 type
= TREE_TYPE (type
);
8506 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8507 DECL_CONTEXT (decl
) = basetype
;
8508 DECL_CLASS_CONTEXT (decl
) = basetype
;
8509 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8516 context
= in_namespace
;
8517 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8518 context
= current_namespace
;
8520 context
= NULL_TREE
;
8522 if (processing_template_decl
)
8523 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8524 we can call push_template_decl. */
8525 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8527 decl
= build_decl (VAR_DECL
, declarator
, type
);
8530 set_decl_namespace (decl
, context
, 0);
8532 context
= DECL_CONTEXT (decl
);
8533 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8534 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8538 set_decl_namespace (decl
, in_namespace
, 0);
8540 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8542 DECL_THIS_EXTERN (decl
) = 1;
8543 DECL_EXTERNAL (decl
) = !initialized
;
8546 /* In class context, static means one per class,
8547 public access, and static storage. */
8548 if (DECL_CLASS_SCOPE_P (decl
))
8550 TREE_PUBLIC (decl
) = 1;
8551 TREE_STATIC (decl
) = 1;
8552 DECL_EXTERNAL (decl
) = 0;
8554 /* At top level, either `static' or no s.c. makes a definition
8555 (perhaps tentative), and absence of `static' makes it public. */
8556 else if (toplevel_bindings_p ())
8558 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8559 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8560 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8562 /* Not at top level, only `static' makes a static definition. */
8565 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8566 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8569 if (TREE_PUBLIC (decl
))
8571 /* [basic.link]: A name with no linkage (notably, the name of a class
8572 or enumeration declared in a local scope) shall not be used to
8573 declare an entity with linkage.
8575 Only check this for public decls for now. */
8576 tree t
= no_linkage_check (TREE_TYPE (decl
));
8579 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8580 /* Ignore for now; `enum { foo } e' is pretty common. */;
8582 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8590 /* Create and return a canonical pointer to member function type, for
8591 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8594 build_ptrmemfunc_type (type
)
8600 tree unqualified_variant
= NULL_TREE
;
8602 /* If a canonical type already exists for this type, use it. We use
8603 this method instead of type_hash_canon, because it only does a
8604 simple equality check on the list of field members. */
8606 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8609 /* Make sure that we always have the unqualified pointer-to-member
8611 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8613 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8615 u
= make_lang_type (UNION_TYPE
);
8616 SET_IS_AGGR_TYPE (u
, 0);
8617 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8618 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8620 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8621 TYPE_NAME (u
) = NULL_TREE
;
8623 t
= make_lang_type (RECORD_TYPE
);
8625 /* Let the front-end know this is a pointer to member function... */
8626 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8627 /* ... and not really an aggregate. */
8628 SET_IS_AGGR_TYPE (t
, 0);
8630 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8632 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8634 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8635 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8637 /* Zap out the name so that the back-end will give us the debugging
8638 information for this anonymous RECORD_TYPE. */
8639 TYPE_NAME (t
) = NULL_TREE
;
8641 /* If this is not the unqualified form of this pointer-to-member
8642 type, set the TYPE_MAIN_VARIANT for this type to be the
8643 unqualified type. Since they are actually RECORD_TYPEs that are
8644 not variants of each other, we must do this manually. */
8645 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8647 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8648 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8649 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8650 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8653 /* Cache this pointer-to-member type so that we can find it again
8655 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8657 /* Seems to be wanted. */
8658 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8663 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8664 Check to see that the definition is valid. Issue appropriate error
8665 messages. Return 1 if the definition is particularly bad, or 0
8669 check_static_variable_definition (decl
, type
)
8673 /* Motion 10 at San Diego: If a static const integral data member is
8674 initialized with an integral constant expression, the initializer
8675 may appear either in the declaration (within the class), or in
8676 the definition, but not both. If it appears in the class, the
8677 member is a member constant. The file-scope definition is always
8679 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8681 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8683 /* If we just return the declaration, crashes will sometimes
8684 occur. We therefore return void_type_node, as if this was a
8685 friend declaration, to cause callers to completely ignore
8686 this declaration. */
8689 else if (!CP_TYPE_CONST_P (type
))
8690 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8692 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8693 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8698 /* Given the SIZE (i.e., number of elements) in an array, compute an
8699 appropriate index type for the array. If non-NULL, NAME is the
8700 name of the thing being declared. */
8703 compute_array_index_type (name
, size
)
8709 /* The size might be the result of a cast. */
8710 STRIP_TYPE_NOPS (size
);
8712 /* It might be a const variable or enumeration constant. */
8713 if (TREE_READONLY_DECL_P (size
))
8714 size
= decl_constant_value (size
);
8716 /* If this involves a template parameter, it will be a constant at
8717 instantiation time, but we don't know what the value is yet.
8718 Even if no template parameters are involved, we may an expression
8719 that is not a constant; we don't even simplify `1 + 2' when
8720 processing a template. */
8721 if (processing_template_decl
)
8723 /* Resolve a qualified reference to an enumerator or static
8724 const data member of ours. */
8725 if (TREE_CODE (size
) == SCOPE_REF
8726 && TREE_OPERAND (size
, 0) == current_class_type
)
8728 tree t
= lookup_field (current_class_type
,
8729 TREE_OPERAND (size
, 1), 0, 0);
8734 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
8735 size
, integer_one_node
));
8738 /* The array bound must be an integer type. */
8739 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
8740 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
8741 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
8743 cp_error ("size of array `%D' has non-integer type", name
);
8744 size
= integer_one_node
;
8747 /* Normally, the array-bound will be a constant. */
8748 if (TREE_CONSTANT (size
))
8750 /* Check to see if the array bound overflowed. Make that an
8751 error, no matter how generous we're being. */
8752 int old_flag_pedantic_errors
= flag_pedantic_errors
;
8753 int old_pedantic
= pedantic
;
8754 pedantic
= flag_pedantic_errors
= 1;
8755 constant_expression_warning (size
);
8756 pedantic
= old_pedantic
;
8757 flag_pedantic_errors
= old_flag_pedantic_errors
;
8759 /* An array must have a positive number of elements. */
8760 if (INT_CST_LT (size
, integer_zero_node
))
8762 cp_error ("size of array `%D' is negative", name
);
8763 size
= integer_one_node
;
8765 /* Except that an extension we allow zero-sized arrays. We
8766 always allow them in system headers because glibc uses
8768 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
8769 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", name
);
8772 /* Compute the index of the largest element in the array. It is
8773 one less than the number of elements in the array. */
8775 = fold (build_binary_op (MINUS_EXPR
,
8776 cp_convert (ssizetype
, size
),
8777 cp_convert (ssizetype
,
8778 integer_one_node
)));
8780 /* Check for variable-sized arrays. We allow such things as an
8781 extension, even though they are not allowed in ANSI/ISO C++. */
8782 if (!TREE_CONSTANT (itype
))
8787 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
8790 cp_pedwarn ("ANSI C++ forbids variable-size array");
8793 /* Create a variable-sized array index type. */
8794 itype
= variable_size (itype
);
8796 /* Make sure that there was no overflow when creating to a signed
8797 index type. (For example, on a 32-bit machine, an array with
8798 size 2^32 - 1 is too big.) */
8799 else if (TREE_OVERFLOW (itype
))
8801 error ("overflow in array dimension");
8802 TREE_OVERFLOW (itype
) = 0;
8805 /* Create and return the appropriate index type. */
8806 return build_index_type (itype
);
8809 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
8810 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
8814 create_array_type_for_decl (name
, type
, size
)
8819 tree itype
= NULL_TREE
;
8820 const char* error_msg
;
8822 /* If things have already gone awry, bail now. */
8823 if (type
== error_mark_node
|| size
== error_mark_node
)
8824 return error_mark_node
;
8826 /* Assume that everything will go OK. */
8829 /* There are some types which cannot be array elements. */
8830 switch (TREE_CODE (type
))
8833 error_msg
= "array of void";
8837 error_msg
= "array of functions";
8840 case REFERENCE_TYPE
:
8841 error_msg
= "array of references";
8845 error_msg
= "array of data members";
8849 error_msg
= "array of function members";
8856 /* If something went wrong, issue an error-message and return. */
8860 cp_error ("declaration of `%D' as %s", name
, error_msg
);
8862 cp_error ("creating %s", error_msg
);
8864 return error_mark_node
;
8869 The constant expressions that specify the bounds of the arrays
8870 can be omitted only for the first member of the sequence. */
8871 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
8873 cp_error ("declaration of `%D' as multidimensional array",
8875 cp_error ("must have bounds for all dimensions except the first");
8877 return error_mark_node
;
8880 /* Figure out the index type for the array. */
8882 itype
= compute_array_index_type (name
, size
);
8884 return build_cplus_array_type (type
, itype
);
8887 /* Given declspecs and a declarator,
8888 determine the name and type of the object declared
8889 and construct a ..._DECL node for it.
8890 (In one case we can return a ..._TYPE node instead.
8891 For invalid input we sometimes return 0.)
8893 DECLSPECS is a chain of tree_list nodes whose value fields
8894 are the storage classes and type specifiers.
8896 DECL_CONTEXT says which syntactic context this declaration is in:
8897 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8898 FUNCDEF for a function definition. Like NORMAL but a few different
8899 error messages in each case. Return value may be zero meaning
8900 this definition is too screwy to try to parse.
8901 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8902 handle member functions (which have FIELD context).
8903 Return value may be zero meaning this definition is too screwy to
8905 PARM for a parameter declaration (either within a function prototype
8906 or before a function body). Make a PARM_DECL, or return void_type_node.
8907 CATCHPARM for a parameter declaration before a catch clause.
8908 TYPENAME if for a typename (in a cast or sizeof).
8909 Don't make a DECL node; just return the ..._TYPE node.
8910 FIELD for a struct or union field; make a FIELD_DECL.
8911 BITFIELD for a field with specified width.
8912 INITIALIZED is 1 if the decl has an initializer.
8914 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8915 normal attributes in TREE_PURPOSE, or NULL_TREE.
8917 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8918 It may also be so in the PARM case, for a prototype where the
8919 argument type is specified but not the name.
8921 This function is where the complicated C meanings of `static'
8922 and `extern' are interpreted.
8924 For C++, if there is any monkey business to do, the function which
8925 calls this one must do it, i.e., prepending instance variables,
8926 renaming overloaded function names, etc.
8928 Note that for this C++, it is an error to define a method within a class
8929 which does not belong to that class.
8931 Except in the case where SCOPE_REFs are implicitly known (such as
8932 methods within a class being redundantly qualified),
8933 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8934 (class_name::decl_name). The caller must also deal with this.
8936 If a constructor or destructor is seen, and the context is FIELD,
8937 then the type gains the attribute TREE_HAS_x. If such a declaration
8938 is erroneous, NULL_TREE is returned.
8940 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8941 function, these are the qualifiers to give to the `this' pointer. We
8942 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
8944 May return void_type_node if the declarator turned out to be a friend.
8945 See grokfield for details. */
8947 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8950 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8953 enum decl_context decl_context
;
8957 RID_BIT_TYPE specbits
;
8960 tree type
= NULL_TREE
;
8966 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8967 int explicit_int
= 0;
8968 int explicit_char
= 0;
8969 int defaulted_int
= 0;
8970 tree typedef_decl
= NULL_TREE
;
8972 tree typedef_type
= NULL_TREE
;
8973 int funcdef_flag
= 0;
8974 enum tree_code innermost_code
= ERROR_MARK
;
8977 /* See the code below that used this. */
8978 tree decl_machine_attr
= NULL_TREE
;
8980 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8981 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8982 tree init
= NULL_TREE
;
8984 /* Keep track of what sort of function is being processed
8985 so that we can warn about default return values, or explicit
8986 return values which do not match prescribed defaults. */
8987 enum return_types return_type
= return_normal
;
8989 tree dname
= NULL_TREE
;
8990 tree ctype
= current_class_type
;
8991 tree ctor_return_type
= NULL_TREE
;
8992 enum overload_flags flags
= NO_SPECIAL
;
8993 tree quals
= NULL_TREE
;
8994 tree raises
= NULL_TREE
;
8995 int template_count
= 0;
8996 tree in_namespace
= NULL_TREE
;
9000 RIDBIT_RESET_ALL (specbits
);
9001 if (decl_context
== FUNCDEF
)
9002 funcdef_flag
= 1, decl_context
= NORMAL
;
9003 else if (decl_context
== MEMFUNCDEF
)
9004 funcdef_flag
= -1, decl_context
= FIELD
;
9005 else if (decl_context
== BITFIELD
)
9006 bitfield
= 1, decl_context
= FIELD
;
9008 /* Look inside a declarator for the name being declared
9009 and get it as a string, for an error message. */
9011 tree
*next
= &declarator
;
9015 while (next
&& *next
)
9018 switch (TREE_CODE (decl
))
9021 /* For attributes. */
9022 next
= &TREE_VALUE (decl
);
9027 next
= &TREE_OPERAND (decl
, 0);
9030 case BIT_NOT_EXPR
: /* For C++ destructors! */
9032 tree name
= TREE_OPERAND (decl
, 0);
9033 tree rename
= NULL_TREE
;
9035 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9037 return_type
= return_dtor
;
9038 if (TREE_CODE (name
) == TYPE_DECL
)
9039 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9040 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9041 if (ctype
== NULL_TREE
)
9043 if (current_class_type
== NULL_TREE
)
9045 error ("destructors must be member functions");
9050 tree t
= constructor_name (current_class_name
);
9057 tree t
= constructor_name (ctype
);
9064 cp_error ("destructor `%T' must match class name `%T'",
9066 TREE_OPERAND (decl
, 0) = rename
;
9072 case ADDR_EXPR
: /* C++ reference declaration */
9077 innermost_code
= TREE_CODE (decl
);
9078 next
= &TREE_OPERAND (decl
, 0);
9082 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9084 /* This is actually a variable declaration using
9085 constructor syntax. We need to call start_decl and
9086 cp_finish_decl so we can get the variable
9089 tree attributes
, prefix_attributes
;
9091 *next
= TREE_OPERAND (decl
, 0);
9092 init
= CALL_DECLARATOR_PARMS (decl
);
9096 attributes
= TREE_PURPOSE (attrlist
);
9097 prefix_attributes
= TREE_VALUE (attrlist
);
9101 attributes
= NULL_TREE
;
9102 prefix_attributes
= NULL_TREE
;
9105 decl
= start_decl (declarator
, declspecs
, 1,
9106 attributes
, prefix_attributes
);
9109 /* Look for __unused__ attribute */
9110 if (TREE_USED (TREE_TYPE (decl
)))
9111 TREE_USED (decl
) = 1;
9112 finish_decl (decl
, init
, NULL_TREE
);
9115 cp_error ("invalid declarator");
9118 innermost_code
= TREE_CODE (decl
);
9119 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9120 ctype
= current_class_type
;
9122 && TREE_OPERAND (decl
, 0)
9123 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9124 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9125 == constructor_name_full (ctype
))
9126 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9127 == constructor_name (ctype
)))))
9128 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9129 next
= &TREE_OPERAND (decl
, 0);
9131 if (ctype
!= NULL_TREE
9132 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9133 && decl
== constructor_name (ctype
))
9135 return_type
= return_ctor
;
9136 ctor_return_type
= ctype
;
9141 case TEMPLATE_ID_EXPR
:
9143 tree fns
= TREE_OPERAND (decl
, 0);
9145 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9146 fns
= TREE_OPERAND (fns
, 0);
9149 if (TREE_CODE (dname
) == COMPONENT_REF
)
9150 dname
= TREE_OPERAND (dname
, 1);
9151 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9153 my_friendly_assert (is_overloaded_fn (dname
),
9155 dname
= DECL_NAME (get_first_fn (dname
));
9160 case IDENTIFIER_NODE
:
9161 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9168 cp_error ("declarator-id missing; using reserved word `%D'",
9170 name
= IDENTIFIER_POINTER (dname
);
9172 if (! IDENTIFIER_OPNAME_P (dname
)
9173 /* GNU/Linux headers use '__op'. Arrgh. */
9174 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9175 name
= IDENTIFIER_POINTER (dname
);
9178 if (IDENTIFIER_TYPENAME_P (dname
))
9180 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9181 flags
= TYPENAME_FLAG
;
9182 ctor_return_type
= TREE_TYPE (dname
);
9183 return_type
= return_conversion
;
9185 name
= operator_name_string (dname
);
9192 /* Perform error checking, and decide on a ctype. */
9193 tree cname
= TREE_OPERAND (decl
, 0);
9194 if (cname
== NULL_TREE
)
9196 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9199 in_namespace
= TREE_OPERAND (decl
, 0);
9200 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9202 else if (! is_aggr_type (cname
, 1))
9203 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9204 /* Must test TREE_OPERAND (decl, 1), in case user gives
9205 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9206 else if (TREE_OPERAND (decl
, 1)
9207 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9209 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9210 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9212 cp_error ("`%T::%D' is not a valid declarator", cname
,
9213 TREE_OPERAND (decl
, 1));
9214 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9215 cname
, TREE_OPERAND (decl
, 1));
9216 return void_type_node
;
9218 else if (ctype
== NULL_TREE
)
9220 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9221 TREE_OPERAND (decl
, 0) = ctype
;
9224 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9226 cp_error ("type `%T' is not derived from type `%T'",
9228 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9234 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9235 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9236 == constructor_name_full (ctype
))
9237 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9238 == constructor_name (ctype
))))
9239 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9240 next
= &TREE_OPERAND (decl
, 1);
9244 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9245 && constructor_name (ctype
) == decl
)
9247 return_type
= return_ctor
;
9248 ctor_return_type
= ctype
;
9250 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9251 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9252 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9253 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9255 return_type
= return_dtor
;
9256 ctor_return_type
= ctype
;
9258 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9259 next
= &TREE_OPERAND (decl
, 0);
9270 /* Parse error puts this typespec where
9271 a declarator should go. */
9272 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9273 if (TREE_TYPE (decl
) == current_class_type
)
9274 cp_error (" perhaps you want `%T' for a constructor",
9275 current_class_name
);
9276 dname
= DECL_NAME (decl
);
9277 name
= IDENTIFIER_POINTER (dname
);
9279 /* Avoid giving two errors for this. */
9280 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9282 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9289 cp_compiler_error ("`%D' as declarator", decl
);
9290 return 0; /* We used to do a 155 abort here. */
9295 /* A function definition's declarator must have the form of
9296 a function declarator. */
9298 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9301 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9302 && innermost_code
!= CALL_EXPR
9303 && ! (ctype
&& declspecs
== NULL_TREE
))
9305 cp_error ("declaration of `%D' as non-function", dname
);
9306 return void_type_node
;
9309 /* Anything declared one level down from the top level
9310 must be one of the parameters of a function
9311 (because the body is at least two levels down). */
9313 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9314 by not allowing C++ class definitions to specify their parameters
9315 with xdecls (must be spec.d in the parmlist).
9317 Since we now wait to push a class scope until we are sure that
9318 we are in a legitimate method context, we must set oldcname
9319 explicitly (since current_class_name is not yet alive).
9321 We also want to avoid calling this a PARM if it is in a namespace. */
9323 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9325 struct binding_level
*b
= current_binding_level
;
9326 current_binding_level
= b
->level_chain
;
9327 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9328 decl_context
= PARM
;
9329 current_binding_level
= b
;
9333 name
= decl_context
== PARM
? "parameter" : "type name";
9335 /* Look through the decl specs and record which ones appear.
9336 Some typespecs are defined as built-in typenames.
9337 Others, the ones that are modifiers of other types,
9338 are represented by bits in SPECBITS: set the bits for
9339 the modifiers that appear. Storage class keywords are also in SPECBITS.
9341 If there is a typedef name or a type, store the type in TYPE.
9342 This includes builtin typedefs such as `int'.
9344 Set EXPLICIT_INT if the type is `int' or `char' and did not
9345 come from a user typedef.
9347 Set LONGLONG if `long' is mentioned twice.
9349 For C++, constructors and destructors have their own fast treatment. */
9351 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9356 /* Certain parse errors slip through. For example,
9357 `int class;' is not caught by the parser. Try
9358 weakly to recover here. */
9359 if (TREE_CODE (spec
) != TREE_LIST
)
9362 id
= TREE_VALUE (spec
);
9364 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9366 if (id
== ridpointers
[(int) RID_INT
]
9367 || id
== ridpointers
[(int) RID_CHAR
]
9368 || id
== ridpointers
[(int) RID_BOOL
]
9369 || id
== ridpointers
[(int) RID_WCHAR
])
9373 if (id
== ridpointers
[(int) RID_BOOL
])
9374 error ("`bool' is now a keyword");
9376 cp_error ("extraneous `%T' ignored", id
);
9380 if (id
== ridpointers
[(int) RID_INT
])
9382 else if (id
== ridpointers
[(int) RID_CHAR
])
9384 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9388 /* C++ aggregate types. */
9389 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9392 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9394 type
= IDENTIFIER_TYPE_VALUE (id
);
9398 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9400 if (ridpointers
[i
] == id
)
9402 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9404 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9405 pedwarn ("ANSI C++ does not support `long long'");
9407 error ("`long long long' is too long for GCC");
9411 else if (RIDBIT_SETP (i
, specbits
))
9412 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9413 RIDBIT_SET (i
, specbits
);
9418 /* C++ aggregate types. */
9419 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9422 cp_error ("multiple declarations `%T' and `%T'", type
,
9426 type
= TREE_TYPE (id
);
9427 TREE_VALUE (spec
) = type
;
9432 error ("two or more data types in declaration of `%s'", name
);
9433 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9435 register tree t
= lookup_name (id
, 1);
9436 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9437 error ("`%s' fails to be a typedef or built in type",
9438 IDENTIFIER_POINTER (id
));
9441 type
= TREE_TYPE (t
);
9443 /* See the code below that used this. */
9444 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9449 else if (id
!= error_mark_node
)
9450 /* Can't change CLASS nodes into RECORD nodes here! */
9456 typedef_type
= type
;
9458 /* No type at all: default to `int', and set DEFAULTED_INT
9459 because it was not a user-defined typedef. */
9461 if (type
== NULL_TREE
9462 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9463 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9464 || RIDBIT_SETP (RID_LONG
, specbits
)
9465 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9467 /* These imply 'int'. */
9468 type
= integer_type_node
;
9472 if (type
== NULL_TREE
)
9475 if (return_type
== return_dtor
)
9476 type
= void_type_node
;
9477 else if (return_type
== return_ctor
)
9478 type
= build_pointer_type (ctor_return_type
);
9479 else if (return_type
== return_conversion
)
9480 type
= ctor_return_type
;
9483 /* We handle `main' specially here, because 'main () { }' is so
9484 common. With no options, it is allowed. With -Wreturn-type,
9485 it is a warning. It is only an error with -pedantic-errors. */
9486 int is_main
= (funcdef_flag
9487 && MAIN_NAME_P (dname
)
9488 && ctype
== NULL_TREE
9489 && in_namespace
== NULL_TREE
9490 && current_namespace
== global_namespace
);
9492 if (in_system_header
|| flag_ms_extensions
)
9493 /* Allow it, sigh. */;
9494 else if (pedantic
|| ! is_main
)
9495 cp_pedwarn ("ANSI C++ forbids declaration of `%s' with no type",
9497 else if (warn_return_type
)
9498 cp_warning ("ANSI C++ forbids declaration of `%s' with no type",
9501 type
= integer_type_node
;
9504 else if (return_type
== return_dtor
)
9506 error ("return type specification for destructor invalid");
9507 type
= void_type_node
;
9509 else if (return_type
== return_ctor
)
9511 error ("return type specification for constructor invalid");
9512 type
= build_pointer_type (ctor_return_type
);
9514 else if (return_type
== return_conversion
)
9516 if (!same_type_p (type
, ctor_return_type
))
9517 cp_error ("operator `%T' declared to return `%T'",
9518 ctor_return_type
, type
);
9520 cp_pedwarn ("return type specified for `operator %T'",
9523 type
= ctor_return_type
;
9528 /* Now process the modifiers that were specified
9529 and check for invalid combinations. */
9531 /* Long double is a special combination. */
9533 if (RIDBIT_SETP (RID_LONG
, specbits
)
9534 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9536 RIDBIT_RESET (RID_LONG
, specbits
);
9537 type
= build_qualified_type (long_double_type_node
,
9538 CP_TYPE_QUALS (type
));
9541 /* Check all other uses of type modifiers. */
9543 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9544 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9545 || RIDBIT_SETP (RID_LONG
, specbits
)
9546 || RIDBIT_SETP (RID_SHORT
, specbits
))
9550 if (TREE_CODE (type
) == REAL_TYPE
)
9551 error ("short, signed or unsigned invalid for `%s'", name
);
9552 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9553 error ("long, short, signed or unsigned invalid for `%s'", name
);
9554 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9555 && RIDBIT_SETP (RID_SHORT
, specbits
))
9556 error ("long and short specified together for `%s'", name
);
9557 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9558 || RIDBIT_SETP (RID_SHORT
, specbits
))
9560 error ("long or short specified with char for `%s'", name
);
9561 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9562 || RIDBIT_SETP (RID_SHORT
, specbits
))
9563 && TREE_CODE (type
) == REAL_TYPE
)
9564 error ("long or short specified with floating type for `%s'", name
);
9565 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9566 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9567 error ("signed and unsigned given together for `%s'", name
);
9571 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9573 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9575 if (flag_pedantic_errors
)
9580 /* Discard the type modifiers if they are invalid. */
9583 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9584 RIDBIT_RESET (RID_SIGNED
, specbits
);
9585 RIDBIT_RESET (RID_LONG
, specbits
);
9586 RIDBIT_RESET (RID_SHORT
, specbits
);
9591 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9592 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9594 error ("complex invalid for `%s'", name
);
9595 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9598 /* Decide whether an integer type is signed or not.
9599 Optionally treat bitfields as signed by default. */
9600 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9603 It is implementation-defined whether a plain (neither
9604 explicitly signed or unsigned) char, short, int, or long
9605 bit-field is signed or unsigned.
9607 Naturally, we extend this to long long as well. Note that
9608 this does not include wchar_t. */
9609 || (bitfield
&& !flag_signed_bitfields
9610 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9611 /* A typedef for plain `int' without `signed' can be
9612 controlled just like plain `int', but a typedef for
9613 `signed int' cannot be so controlled. */
9615 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9616 && (TREE_CODE (type
) == INTEGER_TYPE
9617 || TREE_CODE (type
) == CHAR_TYPE
)
9618 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9621 type
= long_long_unsigned_type_node
;
9622 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9623 type
= long_unsigned_type_node
;
9624 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9625 type
= short_unsigned_type_node
;
9626 else if (type
== char_type_node
)
9627 type
= unsigned_char_type_node
;
9628 else if (typedef_decl
)
9629 type
= unsigned_type (type
);
9631 type
= unsigned_type_node
;
9633 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9634 && type
== char_type_node
)
9635 type
= signed_char_type_node
;
9637 type
= long_long_integer_type_node
;
9638 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9639 type
= long_integer_type_node
;
9640 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9641 type
= short_integer_type_node
;
9643 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9645 /* If we just have "complex", it is equivalent to
9646 "complex double", but if any modifiers at all are specified it is
9647 the complex form of TYPE. E.g, "complex short" is
9648 "complex short int". */
9650 if (defaulted_int
&& ! longlong
9651 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9652 || RIDBIT_SETP (RID_SHORT
, specbits
)
9653 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9654 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9655 type
= complex_double_type_node
;
9656 else if (type
== integer_type_node
)
9657 type
= complex_integer_type_node
;
9658 else if (type
== float_type_node
)
9659 type
= complex_float_type_node
;
9660 else if (type
== double_type_node
)
9661 type
= complex_double_type_node
;
9662 else if (type
== long_double_type_node
)
9663 type
= complex_long_double_type_node
;
9665 type
= build_complex_type (type
);
9668 if (return_type
== return_conversion
9669 && (RIDBIT_SETP (RID_CONST
, specbits
)
9670 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9671 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9672 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9675 /* Set CONSTP if this declaration is `const', whether by
9676 explicit specification or via a typedef.
9677 Likewise for VOLATILEP. */
9679 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9681 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9683 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9684 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9685 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9686 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9687 type
= cp_build_qualified_type (type
, type_quals
);
9689 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9690 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9691 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9692 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9693 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9695 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9696 staticp
= 1 + (decl_context
== FIELD
);
9698 if (virtualp
&& staticp
== 2)
9700 cp_error ("member `%D' cannot be declared both virtual and static",
9704 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9705 RIDBIT_RESET (RID_FRIEND
, specbits
);
9707 /* Warn if two storage classes are given. Default to `auto'. */
9709 if (RIDBIT_ANY_SET (specbits
))
9711 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9712 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9713 if (decl_context
== PARM
&& nclasses
> 0)
9714 error ("storage class specifiers invalid in parameter declarations");
9715 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9717 if (decl_context
== PARM
)
9718 error ("typedef declaration invalid in parameter declaration");
9721 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9722 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9725 /* Give error if `virtual' is used outside of class declaration. */
9727 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9729 error ("virtual outside class declaration");
9733 /* Static anonymous unions are dealt with here. */
9734 if (staticp
&& decl_context
== TYPENAME
9735 && TREE_CODE (declspecs
) == TREE_LIST
9736 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9737 decl_context
= FIELD
;
9739 /* Warn about storage classes that are invalid for certain
9740 kinds of declarations (parameters, typenames, etc.). */
9743 error ("multiple storage classes in declaration of `%s'", name
);
9744 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9746 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9747 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9748 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9750 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9752 else if (decl_context
== FIELD
9753 /* C++ allows static class elements */
9754 && RIDBIT_SETP (RID_STATIC
, specbits
))
9755 /* C++ also allows inlines and signed and unsigned elements,
9756 but in those cases we don't come in here. */
9760 if (decl_context
== FIELD
)
9762 tree tmp
= NULL_TREE
;
9763 register int op
= 0;
9767 /* Avoid trying to get an operand off an identifier node. */
9768 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9771 tmp
= TREE_OPERAND (declarator
, 0);
9772 op
= IDENTIFIER_OPNAME_P (tmp
);
9774 error ("storage class specified for %s `%s'",
9775 op
? "member operator" : "field",
9776 op
? operator_name_string (tmp
) : name
);
9779 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9780 ? "storage class specified for parameter `%s'"
9781 : "storage class specified for typename"), name
);
9782 RIDBIT_RESET (RID_REGISTER
, specbits
);
9783 RIDBIT_RESET (RID_AUTO
, specbits
);
9784 RIDBIT_RESET (RID_EXTERN
, specbits
);
9787 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9789 if (toplevel_bindings_p ())
9791 /* It's common practice (and completely valid) to have a const
9792 be initialized and declared extern. */
9793 if (!(type_quals
& TYPE_QUAL_CONST
))
9794 warning ("`%s' initialized and declared `extern'", name
);
9797 error ("`%s' has both `extern' and initializer", name
);
9799 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9800 && ! toplevel_bindings_p ())
9801 error ("nested function `%s' declared `extern'", name
);
9802 else if (toplevel_bindings_p ())
9804 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9805 error ("top-level declaration of `%s' specifies `auto'", name
);
9808 if (nclasses
> 0 && friendp
)
9809 error ("storage class specifiers invalid in friend function declarations");
9811 /* Now figure out the structure of the declarator proper.
9812 Descend through it, creating more complex types, until we reach
9813 the declared identifier (or NULL_TREE, in an absolute declarator). */
9815 inner_attrs
= NULL_TREE
;
9818 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9819 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9821 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9822 an INDIRECT_REF (for *...),
9823 a CALL_EXPR (for ...(...)),
9824 an identifier (for the name being declared)
9825 or a null pointer (for the place in an absolute declarator
9826 where the name was omitted).
9827 For the last two cases, we have just exited the loop.
9829 For C++ it could also be
9830 a SCOPE_REF (for class :: ...). In this case, we have converted
9831 sensible names to types, and those are the values we use to
9832 qualify the member name.
9833 an ADDR_EXPR (for &...),
9834 a BIT_NOT_EXPR (for destructors)
9836 At this point, TYPE is the type of elements of an array,
9837 or for a function to return, or for a pointer to point to.
9838 After this sequence of ifs, TYPE is the type of the
9839 array or function or pointer, and DECLARATOR has had its
9840 outermost layer removed. */
9842 if (type
== error_mark_node
)
9844 if (TREE_CODE (declarator
) == SCOPE_REF
)
9845 declarator
= TREE_OPERAND (declarator
, 1);
9847 declarator
= TREE_OPERAND (declarator
, 0);
9850 if (quals
!= NULL_TREE
9851 && (declarator
== NULL_TREE
9852 || TREE_CODE (declarator
) != SCOPE_REF
))
9854 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9855 ctype
= TYPE_METHOD_BASETYPE (type
);
9856 if (ctype
!= NULL_TREE
)
9858 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9859 grok_method_quals (ctype
, dummy
, quals
);
9860 type
= TREE_TYPE (dummy
);
9861 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
9866 /* See the comment for the TREE_LIST case, below. */
9869 else if (inner_attrs
)
9871 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9872 inner_attrs
= NULL_TREE
;
9875 switch (TREE_CODE (declarator
))
9879 /* We encode a declarator with embedded attributes using
9880 a TREE_LIST. The attributes apply to the declarator
9881 directly inside them, so we have to skip an iteration
9882 before applying them to the type. If the declarator just
9883 inside is the declarator-id, we apply the attrs to the
9885 inner_attrs
= TREE_PURPOSE (declarator
);
9887 declarator
= TREE_VALUE (declarator
);
9895 size
= TREE_OPERAND (declarator
, 1);
9897 /* VC++ spells a zero-sized array with []. */
9898 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9899 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9900 size
= integer_zero_node
;
9902 declarator
= TREE_OPERAND (declarator
, 0);
9904 type
= create_array_type_for_decl (dname
, type
, size
);
9913 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9914 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9916 /* Declaring a function type.
9917 Make sure we have a valid type for the function to return. */
9919 /* We now know that the TYPE_QUALS don't apply to the
9920 decl, but to its return type. */
9921 type_quals
= TYPE_UNQUALIFIED
;
9923 /* Warn about some types functions can't return. */
9925 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9927 error ("`%s' declared as function returning a function", name
);
9928 type
= integer_type_node
;
9930 if (TREE_CODE (type
) == ARRAY_TYPE
)
9932 error ("`%s' declared as function returning an array", name
);
9933 type
= integer_type_node
;
9936 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9937 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9939 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9942 /* Pick up type qualifiers which should be applied to `this'. */
9943 quals
= CALL_DECLARATOR_QUALS (declarator
);
9945 /* Pick up the exception specifications. */
9946 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
9948 /* Say it's a definition only for the CALL_EXPR
9949 closest to the identifier. */
9952 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9953 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9954 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9956 if (ctype
== NULL_TREE
9957 && decl_context
== FIELD
9959 && (friendp
== 0 || dname
== current_class_name
))
9960 ctype
= current_class_type
;
9962 if (ctype
&& return_type
== return_conversion
)
9963 TYPE_HAS_CONVERSION (ctype
) = 1;
9964 if (ctype
&& constructor_name (ctype
) == dname
)
9966 /* We are within a class's scope. If our declarator name
9967 is the same as the class name, and we are defining
9968 a function, then it is a constructor/destructor, and
9969 therefore returns a void type. */
9971 if (flags
== DTOR_FLAG
)
9973 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9974 not be declared const or volatile. A destructor
9975 may not be static. */
9977 error ("destructor cannot be static member function");
9980 cp_error ("destructors may not be `%s'",
9981 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9984 if (decl_context
== FIELD
)
9986 if (! member_function_or_else (ctype
, current_class_type
,
9987 "destructor for alien class `%s' cannot be a member"))
9988 return void_type_node
;
9991 else /* It's a constructor. */
9995 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
9996 not be declared const or volatile. A constructor may
9997 not be virtual. A constructor may not be static. */
9999 error ("constructor cannot be static member function");
10002 pedwarn ("constructors cannot be declared virtual");
10007 cp_error ("constructors may not be `%s'",
10008 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10012 RID_BIT_TYPE tmp_bits
;
10013 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10014 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10015 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10016 if (RIDBIT_ANY_SET (tmp_bits
))
10017 error ("return value type specifier for constructor ignored");
10019 type
= build_pointer_type (ctype
);
10020 if (decl_context
== FIELD
)
10022 if (! member_function_or_else (ctype
, current_class_type
,
10023 "constructor for alien class `%s' cannot be member"))
10024 return void_type_node
;
10025 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10026 if (return_type
!= return_ctor
)
10030 if (decl_context
== FIELD
)
10036 error ("can't initialize friend function `%s'", name
);
10039 /* Cannot be both friend and virtual. */
10040 error ("virtual functions cannot be friends");
10041 RIDBIT_RESET (RID_FRIEND
, specbits
);
10044 if (decl_context
== NORMAL
)
10045 error ("friend declaration not in class definition");
10046 if (current_function_decl
&& funcdef_flag
)
10047 cp_error ("can't define friend function `%s' in a local class definition",
10051 /* Construct the function type and go to the next
10052 inner layer of declarator. */
10054 declarator
= TREE_OPERAND (declarator
, 0);
10056 /* FIXME: This is where default args should be fully
10059 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10061 if (declarator
&& flags
== DTOR_FLAG
)
10063 /* A destructor declared in the body of a class will
10064 be represented as a BIT_NOT_EXPR. But, we just
10065 want the underlying IDENTIFIER. */
10066 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10067 declarator
= TREE_OPERAND (declarator
, 0);
10069 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10070 arg_types
= void_list_node
;
10071 else if (arg_types
== NULL_TREE
10072 || arg_types
!= void_list_node
)
10074 cp_error ("destructors may not have parameters");
10075 arg_types
= void_list_node
;
10076 last_function_parms
= NULL_TREE
;
10080 /* ANSI says that `const int foo ();'
10081 does not make the function foo const. */
10082 type
= build_function_type (type
, arg_types
);
10086 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10087 if (TREE_PURPOSE (t
)
10088 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10090 add_defarg_fn (type
);
10099 /* Filter out pointers-to-references and references-to-references.
10100 We can get these if a TYPE_DECL is used. */
10102 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10104 error ("cannot declare %s to references",
10105 TREE_CODE (declarator
) == ADDR_EXPR
10106 ? "references" : "pointers");
10107 declarator
= TREE_OPERAND (declarator
, 0);
10111 if (TREE_CODE (type
) == OFFSET_TYPE
10112 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10113 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10115 cp_error ("cannot declare pointer to `%#T' member",
10117 type
= TREE_TYPE (type
);
10120 /* Merge any constancy or volatility into the target type
10121 for the pointer. */
10123 /* We now know that the TYPE_QUALS don't apply to the decl,
10124 but to the target of the pointer. */
10125 type_quals
= TYPE_UNQUALIFIED
;
10127 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10129 if (TREE_CODE (type
) == VOID_TYPE
)
10130 error ("invalid type: `void &'");
10132 type
= build_reference_type (type
);
10134 else if (TREE_CODE (type
) == METHOD_TYPE
)
10135 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10137 type
= build_pointer_type (type
);
10139 /* Process a list of type modifier keywords (such as
10140 const or volatile) that were given inside the `*' or `&'. */
10142 if (TREE_TYPE (declarator
))
10144 register tree typemodlist
;
10150 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10151 typemodlist
= TREE_CHAIN (typemodlist
))
10153 tree qualifier
= TREE_VALUE (typemodlist
);
10155 if (qualifier
== ridpointers
[(int) RID_CONST
])
10157 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10159 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10164 error ("invalid type modifier within pointer declarator");
10168 pedwarn ("duplicate `const'");
10170 pedwarn ("duplicate `volatile'");
10172 pedwarn ("duplicate `restrict'");
10174 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10175 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10176 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10177 if (TREE_CODE (declarator
) == ADDR_EXPR
10178 && (constp
|| volatilep
))
10181 pedwarn ("discarding `const' applied to a reference");
10183 pedwarn ("discarding `volatile' applied to a reference");
10184 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10186 type
= cp_build_qualified_type (type
, type_quals
);
10188 declarator
= TREE_OPERAND (declarator
, 0);
10194 /* We have converted type names to NULL_TREE if the
10195 name was bogus, or to a _TYPE node, if not.
10197 The variable CTYPE holds the type we will ultimately
10198 resolve to. The code here just needs to build
10199 up appropriate member types. */
10200 tree sname
= TREE_OPERAND (declarator
, 1);
10203 /* Destructors can have their visibilities changed as well. */
10204 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10205 sname
= TREE_OPERAND (sname
, 0);
10207 if (TREE_COMPLEXITY (declarator
) == 0)
10208 /* This needs to be here, in case we are called
10209 multiple times. */ ;
10210 else if (TREE_COMPLEXITY (declarator
) == -1)
10211 /* Namespace member. */
10212 pop_decl_namespace ();
10213 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10214 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10215 else if (! IS_AGGR_TYPE_CODE
10216 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10218 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10220 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10221 that refer to ctype. They couldn't be resolved earlier
10222 because we hadn't pushed into the class yet.
10223 Example: resolve 'B<T>::type' in
10224 'B<typename B<T>::type> B<T>::f () { }'. */
10225 if (current_template_parms
10226 && uses_template_parms (type
)
10227 && uses_template_parms (current_class_type
))
10229 tree args
= current_template_args ();
10230 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10233 /* This pop_nested_class corresponds to the
10234 push_nested_class used to push into class scope for
10235 parsing the argument list of a function decl, in
10237 pop_nested_class ();
10238 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10241 my_friendly_abort (16);
10243 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10245 /* We had a reference to a global decl, or
10246 perhaps we were given a non-aggregate typedef,
10247 in which case we cleared this out, and should just
10248 keep going as though it wasn't there. */
10249 declarator
= sname
;
10252 ctype
= TREE_OPERAND (declarator
, 0);
10255 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10257 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10258 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10259 template_count
+= 1;
10260 t
= TYPE_MAIN_DECL (t
);
10261 if (DECL_LANG_SPECIFIC (t
))
10262 t
= DECL_CLASS_CONTEXT (t
);
10267 if (sname
== NULL_TREE
)
10270 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10272 /* This is the `standard' use of the scoping operator:
10273 basetype :: member . */
10275 if (ctype
== current_class_type
)
10281 Is this ill-formed? */
10284 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10287 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10289 if (current_class_type
== NULL_TREE
10291 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10292 TYPE_ARG_TYPES (type
));
10295 cp_error ("cannot declare member function `%T::%s' within `%T'",
10296 ctype
, name
, current_class_type
);
10297 return void_type_node
;
10300 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10301 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10303 /* Have to move this code elsewhere in this function.
10304 this code is used for i.e., typedef int A::M; M *pm;
10306 It is? How? jason 10/2/94 */
10308 if (current_class_type
)
10310 cp_error ("cannot declare member `%T::%s' within `%T'",
10311 ctype
, name
, current_class_type
);
10312 return void_type_node
;
10314 type
= build_offset_type (ctype
, type
);
10316 else if (uses_template_parms (ctype
))
10318 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10320 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10321 TYPE_ARG_TYPES (type
));
10325 cp_error ("structure `%T' not yet defined", ctype
);
10326 return error_mark_node
;
10329 declarator
= sname
;
10331 else if (TREE_CODE (sname
) == SCOPE_REF
)
10332 my_friendly_abort (17);
10336 declarator
= TREE_OPERAND (declarator
, 1);
10337 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10338 /* In this case, we will deal with it later. */
10342 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10343 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10344 TYPE_ARG_TYPES (type
));
10346 type
= build_offset_type (ctype
, type
);
10353 declarator
= TREE_OPERAND (declarator
, 0);
10358 case ENUMERAL_TYPE
:
10359 declarator
= NULL_TREE
;
10363 declarator
= NULL_TREE
;
10367 my_friendly_abort (158);
10371 /* See the comment for the TREE_LIST case, above. */
10374 if (! ignore_attrs
)
10375 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10377 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10379 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10382 /* Now TYPE has the actual type. */
10384 if (explicitp
== 1 || (explicitp
&& friendp
))
10386 /* [dcl.fct.spec] The explicit specifier shall only be used in
10387 declarations of constructors within a class definition. */
10388 error ("only declarations of constructors can be `explicit'");
10392 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10394 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10396 error ("non-member `%s' cannot be declared `mutable'", name
);
10397 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10399 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10401 error ("non-object member `%s' cannot be declared `mutable'", name
);
10402 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10404 else if (TREE_CODE (type
) == FUNCTION_TYPE
10405 || TREE_CODE (type
) == METHOD_TYPE
)
10407 error ("function `%s' cannot be declared `mutable'", name
);
10408 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10412 error ("static `%s' cannot be declared `mutable'", name
);
10413 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10415 else if (type_quals
& TYPE_QUAL_CONST
)
10417 error ("const `%s' cannot be declared `mutable'", name
);
10418 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10422 if (declarator
== NULL_TREE
10423 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10424 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10425 && (TREE_CODE (type
) == FUNCTION_TYPE
10426 || TREE_CODE (type
) == METHOD_TYPE
)))
10428 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10430 cp_error ("template-id `%D' used as a declarator", declarator
);
10431 declarator
= dname
;
10434 /* Unexpected declarator format. */
10435 my_friendly_abort (990210);
10437 /* If this is declaring a typedef name, return a TYPE_DECL. */
10439 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10443 /* Note that the grammar rejects storage classes
10444 in typenames, fields or parameters. */
10445 if (current_lang_name
== lang_name_java
)
10446 TYPE_FOR_JAVA (type
) = 1;
10448 if (decl_context
== FIELD
)
10450 if (declarator
== constructor_name (current_class_type
))
10451 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10453 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10457 /* Make sure this typedef lives as long as its type,
10458 since it might be used as a template parameter. */
10459 if (processing_template_decl
)
10460 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10462 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10465 /* If the user declares "typedef struct {...} foo" then the
10466 struct will have an anonymous name. Fill that name in now.
10467 Nothing can refer to it, so nothing needs know about the name
10469 if (type
!= error_mark_node
10470 && TYPE_NAME (type
)
10471 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10472 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10473 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10475 tree oldname
= TYPE_NAME (type
);
10478 /* Replace the anonymous name with the real name everywhere. */
10479 lookup_tag_reverse (type
, declarator
);
10480 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10481 if (TYPE_NAME (t
) == oldname
)
10482 TYPE_NAME (t
) = decl
;
10484 if (TYPE_LANG_SPECIFIC (type
))
10485 TYPE_WAS_ANONYMOUS (type
) = 1;
10487 /* If this is a typedef within a template class, the nested
10488 type is a (non-primary) template. The name for the
10489 template needs updating as well. */
10490 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10491 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10492 = TYPE_IDENTIFIER (type
);
10494 /* XXX Temporarily set the scope.
10495 When returning, start_decl expects it as NULL_TREE,
10496 and will then then set it using pushdecl. */
10497 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10498 if (current_class_type
)
10499 DECL_CONTEXT (decl
) = current_class_type
;
10501 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10503 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10504 DECL_ASSEMBLER_NAME (decl
)
10505 = get_identifier (build_overload_name (type
, 1, 1));
10506 DECL_CONTEXT (decl
) = NULL_TREE
;
10508 /* FIXME remangle member functions; member functions of a
10509 type with external linkage have external linkage. */
10512 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10514 cp_error_at ("typedef name may not be class-qualified", decl
);
10519 if (ctype
== NULL_TREE
)
10521 if (TREE_CODE (type
) != METHOD_TYPE
)
10522 cp_error_at ("invalid type qualifier for non-method type", decl
);
10524 ctype
= TYPE_METHOD_BASETYPE (type
);
10526 if (ctype
!= NULL_TREE
)
10527 grok_method_quals (ctype
, decl
, quals
);
10530 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10531 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10532 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10534 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10535 inlinep
, friendp
, raises
!= NULL_TREE
);
10538 error ("typedef declaration includes an initializer");
10543 /* Detect the case of an array type of unspecified size
10544 which came, as such, direct from a typedef name.
10545 We must copy the type, so that each identifier gets
10546 a distinct type, so that each identifier's size can be
10547 controlled separately by its own initializer. */
10549 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10550 && TYPE_DOMAIN (type
) == NULL_TREE
)
10552 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10555 /* If this is a type name (such as, in a cast or sizeof),
10556 compute the type and return it now. */
10558 if (decl_context
== TYPENAME
)
10560 /* Note that the grammar rejects storage classes
10561 in typenames, fields or parameters. */
10562 if (type_quals
!= TYPE_UNQUALIFIED
)
10563 type_quals
= TYPE_UNQUALIFIED
;
10565 /* Special case: "friend class foo" looks like a TYPENAME context. */
10568 if (type_quals
!= TYPE_UNQUALIFIED
)
10570 cp_error ("type qualifiers specified for friend class declaration");
10571 type_quals
= TYPE_UNQUALIFIED
;
10575 cp_error ("`inline' specified for friend class declaration");
10579 /* Only try to do this stuff if we didn't already give up. */
10580 if (type
!= integer_type_node
)
10582 /* A friendly class? */
10583 if (current_class_type
)
10584 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10586 error ("trying to make class `%s' a friend of global scope",
10587 TYPE_NAME_STRING (type
));
10588 type
= void_type_node
;
10593 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10594 if (ctype
== NULL_TREE
)
10596 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10597 ctype
= TYPE_METHOD_BASETYPE (type
);
10599 grok_method_quals (ctype
, dummy
, quals
);
10600 type
= TREE_TYPE (dummy
);
10605 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10606 && decl_context
!= CATCHPARM
10607 && TREE_CODE (type
) != UNION_TYPE
10610 cp_error ("abstract declarator `%T' used as declaration", type
);
10611 declarator
= make_anon_name ();
10614 /* `void' at top level (not within pointer)
10615 is allowed only in typedefs or type names.
10616 We don't complain about parms either, but that is because
10617 a better error message can be made later. */
10619 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10622 error ("unnamed variable or field declared void");
10623 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10625 if (IDENTIFIER_OPNAME_P (declarator
))
10626 my_friendly_abort (356);
10628 error ("variable or field `%s' declared void", name
);
10631 error ("variable or field declared void");
10632 type
= integer_type_node
;
10635 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10636 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10638 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10640 if (ctype
|| in_namespace
)
10641 error ("cannot use `::' in parameter declaration");
10643 /* A parameter declared as an array of T is really a pointer to T.
10644 One declared as a function is really a pointer to a function.
10645 One declared as a member is really a pointer to member. */
10647 if (TREE_CODE (type
) == ARRAY_TYPE
)
10649 /* Transfer const-ness of array into that of type pointed to. */
10650 type
= build_pointer_type (TREE_TYPE (type
));
10651 type_quals
= TYPE_UNQUALIFIED
;
10653 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10654 type
= build_pointer_type (type
);
10655 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10656 type
= build_pointer_type (type
);
10657 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10659 error ("declaration of `%s' as void", name
);
10665 register tree decl
;
10667 if (decl_context
== PARM
)
10669 decl
= build_decl (PARM_DECL
, declarator
, type
);
10671 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10672 inlinep
, friendp
, raises
!= NULL_TREE
);
10674 /* Compute the type actually passed in the parmlist,
10675 for the case where there is no prototype.
10676 (For example, shorts and chars are passed as ints.)
10677 When there is a prototype, this is overridden later. */
10679 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10681 else if (decl_context
== FIELD
)
10683 if (type
== error_mark_node
)
10685 /* Happens when declaring arrays of sizes which
10686 are error_mark_node, for example. */
10689 else if (in_namespace
&& !friendp
)
10691 /* Something like struct S { int N::j; }; */
10692 cp_error ("invalid use of `::'");
10695 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10698 tree function_context
;
10700 /* We catch the others as conflicts with the builtin
10702 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10704 cp_error ("function `%D' cannot be declared friend",
10711 if (ctype
== NULL_TREE
)
10712 ctype
= current_class_type
;
10714 if (ctype
== NULL_TREE
)
10716 cp_error ("can't make `%D' into a method -- not in a class",
10718 return void_type_node
;
10721 /* ``A union may [ ... ] not [ have ] virtual functions.''
10723 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10725 cp_error ("function `%D' declared virtual inside a union",
10727 return void_type_node
;
10730 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10731 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10732 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10733 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10737 cp_error ("`%D' cannot be declared virtual, since it is always static",
10742 else if (staticp
< 2)
10743 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10744 TYPE_ARG_TYPES (type
));
10747 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10748 function_context
= (ctype
!= NULL_TREE
) ?
10749 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10750 publicp
= (! friendp
|| ! staticp
)
10751 && function_context
== NULL_TREE
;
10752 decl
= grokfndecl (ctype
, type
,
10753 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10754 ? declarator
: dname
,
10756 virtualp
, flags
, quals
, raises
,
10757 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10758 funcdef_flag
, template_count
, in_namespace
);
10759 if (decl
== NULL_TREE
)
10762 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10763 /* The decl and setting of decl_machine_attr is also turned off. */
10764 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10767 /* [class.conv.ctor]
10769 A constructor declared without the function-specifier
10770 explicit that can be called with a single parameter
10771 specifies a conversion from the type of its first
10772 parameter to the type of its class. Such a constructor
10773 is called a converting constructor. */
10774 if (explicitp
== 2)
10775 DECL_NONCONVERTING_P (decl
) = 1;
10776 else if (DECL_CONSTRUCTOR_P (decl
))
10778 /* The constructor can be called with exactly one
10779 parameter if there is at least one parameter, and
10780 any subsequent parameters have default arguments.
10781 We don't look at the first parameter, which is
10782 really just the `this' parameter for the new
10785 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10787 /* Skip the `in_chrg' argument too, if present. */
10788 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10789 arg_types
= TREE_CHAIN (arg_types
);
10791 if (arg_types
== void_list_node
10793 && TREE_CHAIN (arg_types
)
10794 && TREE_CHAIN (arg_types
) != void_list_node
10795 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10796 DECL_NONCONVERTING_P (decl
) = 1;
10799 else if (TREE_CODE (type
) == METHOD_TYPE
)
10801 /* We only get here for friend declarations of
10802 members of other classes. */
10803 /* All method decls are public, so tell grokfndecl to set
10804 TREE_PUBLIC, also. */
10805 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10806 virtualp
, flags
, quals
, raises
,
10807 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10808 template_count
, in_namespace
);
10809 if (decl
== NULL_TREE
)
10812 else if (!staticp
&& ! processing_template_decl
10813 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10814 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10817 cp_error ("field `%D' has incomplete type", declarator
);
10819 cp_error ("name `%T' has incomplete type", type
);
10821 /* If we're instantiating a template, tell them which
10822 instantiation made the field's type be incomplete. */
10823 if (current_class_type
10824 && TYPE_NAME (current_class_type
)
10825 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10826 && declspecs
&& TREE_VALUE (declspecs
)
10827 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10828 cp_error (" in instantiation of template `%T'",
10829 current_class_type
);
10831 type
= error_mark_node
;
10838 error ("`%s' is neither function nor method; cannot be declared friend",
10839 IDENTIFIER_POINTER (declarator
));
10847 /* Friends are treated specially. */
10848 if (ctype
== current_class_type
)
10849 warning ("member functions are implicitly friends of their class");
10852 tree t
= NULL_TREE
;
10853 if (decl
&& DECL_NAME (decl
))
10855 if (template_class_depth (current_class_type
) == 0)
10858 = check_explicit_specialization
10860 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10861 if (decl
== error_mark_node
)
10862 return error_mark_node
;
10865 t
= do_friend (ctype
, declarator
, decl
,
10866 last_function_parms
, attrlist
, flags
, quals
,
10869 if (t
&& funcdef_flag
)
10872 return void_type_node
;
10876 /* Structure field. It may not be a function, except for C++ */
10878 if (decl
== NULL_TREE
)
10884 /* An attempt is being made to initialize a non-static
10885 member. But, from [class.mem]:
10887 4 A member-declarator can contain a
10888 constant-initializer only if it declares a static
10889 member (_class.static_) of integral or enumeration
10890 type, see _class.static.data_.
10892 This used to be relatively common practice, but
10893 the rest of the compiler does not correctly
10894 handle the initialization unless the member is
10895 static so we make it static below. */
10896 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10898 cp_pedwarn ("making `%D' static", declarator
);
10902 if (uses_template_parms (type
))
10903 /* We'll check at instantiation time. */
10905 else if (check_static_variable_definition (declarator
,
10907 /* If we just return the declaration, crashes
10908 will sometimes occur. We therefore return
10909 void_type_node, as if this was a friend
10910 declaration, to cause callers to completely
10911 ignore this declaration. */
10912 return void_type_node
;
10915 /* 9.2p13 [class.mem] */
10916 if (declarator
== constructor_name (current_class_type
)
10917 /* Divergence from the standard: In extern "C", we
10918 allow non-static data members here, because C does
10919 and /usr/include/netinet/in.h uses that. */
10920 && (staticp
|| ! in_system_header
))
10921 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10926 /* C++ allows static class members. All other work
10927 for this is done by grokfield. */
10928 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10929 TREE_STATIC (decl
) = 1;
10930 /* In class context, 'static' means public access. */
10931 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10935 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10936 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10938 DECL_MUTABLE_P (decl
) = 1;
10939 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10943 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10944 inlinep
, friendp
, raises
!= NULL_TREE
);
10947 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10949 tree original_name
;
10955 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10956 original_name
= dname
;
10958 original_name
= declarator
;
10960 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10961 error ("storage class `auto' invalid for function `%s'", name
);
10962 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10963 error ("storage class `register' invalid for function `%s'", name
);
10965 /* Function declaration not at top level.
10966 Storage classes other than `extern' are not allowed
10967 and `extern' makes no difference. */
10968 if (! toplevel_bindings_p ()
10969 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10970 || RIDBIT_SETP (RID_INLINE
, specbits
))
10973 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10974 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
10976 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
10979 if (ctype
== NULL_TREE
)
10983 error ("virtual non-class function `%s'", name
);
10987 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
10988 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10989 TYPE_ARG_TYPES (type
));
10991 /* Record presence of `static'. */
10992 publicp
= (ctype
!= NULL_TREE
10993 || RIDBIT_SETP (RID_EXTERN
, specbits
)
10994 || !RIDBIT_SETP (RID_STATIC
, specbits
));
10996 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
10997 virtualp
, flags
, quals
, raises
,
10999 publicp
, inlinep
, funcdef_flag
,
11000 template_count
, in_namespace
);
11001 if (decl
== NULL_TREE
)
11006 int illegal_static
= 0;
11008 /* Don't allow a static member function in a class, and forbid
11009 declaring main to be static. */
11010 if (TREE_CODE (type
) == METHOD_TYPE
)
11012 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11013 illegal_static
= 1;
11015 else if (current_function_decl
)
11017 /* FIXME need arm citation */
11018 error ("cannot declare static function inside another function");
11019 illegal_static
= 1;
11022 if (illegal_static
)
11025 RIDBIT_RESET (RID_STATIC
, specbits
);
11031 /* It's a variable. */
11033 /* An uninitialized decl with `extern' is a reference. */
11034 decl
= grokvardecl (type
, declarator
, &specbits
,
11036 (type_quals
& TYPE_QUAL_CONST
) != 0,
11038 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11039 inlinep
, friendp
, raises
!= NULL_TREE
);
11043 DECL_CONTEXT (decl
) = ctype
;
11046 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11048 RIDBIT_RESET (RID_STATIC
, specbits
);
11050 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11052 cp_error ("static member `%D' declared `register'", decl
);
11053 RIDBIT_RESET (RID_REGISTER
, specbits
);
11055 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11057 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11059 RIDBIT_RESET (RID_EXTERN
, specbits
);
11064 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11066 /* Record `register' declaration for warnings on &
11067 and in case doing stupid register allocation. */
11069 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11070 DECL_REGISTER (decl
) = 1;
11072 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11073 DECL_THIS_EXTERN (decl
) = 1;
11075 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11076 DECL_THIS_STATIC (decl
) = 1;
11078 /* Record constancy and volatility. There's no need to do this
11079 when processing a template; we'll do this for the instantiated
11080 declaration based on the type of DECL. */
11081 if (!processing_template_decl
)
11082 c_apply_type_quals_to_decl (type_quals
, decl
);
11088 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11089 An empty exprlist is a parmlist. An exprlist which
11090 contains only identifiers at the global level
11091 is a parmlist. Otherwise, it is an exprlist. */
11094 parmlist_is_exprlist (exprs
)
11097 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11100 if (toplevel_bindings_p ())
11102 /* At the global level, if these are all identifiers,
11103 then it is a parmlist. */
11106 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11108 exprs
= TREE_CHAIN (exprs
);
11115 /* Subroutine of start_function. Ensure that each of the parameter
11116 types (as listed in PARMS) is complete, as is required for a
11117 function definition. */
11120 require_complete_types_for_parms (parms
)
11125 tree type
= TREE_TYPE (parms
);
11126 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11128 if (DECL_NAME (parms
))
11129 error ("parameter `%s' has incomplete type",
11130 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11132 error ("parameter has incomplete type");
11133 TREE_TYPE (parms
) = error_mark_node
;
11136 layout_decl (parms
, 0);
11138 parms
= TREE_CHAIN (parms
);
11142 /* Returns *TP if *TP is a local variable (or parameter). Returns
11143 NULL_TREE otherwise. */
11146 local_variable_p (tp
, walk_subtrees
, data
)
11148 int *walk_subtrees ATTRIBUTE_UNUSED
;
11149 void *data ATTRIBUTE_UNUSED
;
11153 if ((TREE_CODE (t
) == VAR_DECL
11154 /* A VAR_DECL with a context that is a _TYPE is a static data
11156 && !TYPE_P (CP_DECL_CONTEXT (t
))
11157 /* Any other non-local variable must be at namespace scope. */
11158 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11159 || (TREE_CODE (t
) == PARM_DECL
))
11165 /* Check that ARG, which is a default-argument expression for a
11166 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11167 something goes wrong. DECL may also be a _TYPE node, rather than a
11168 DECL, if there is no DECL available. */
11171 check_default_argument (decl
, arg
)
11178 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11179 /* We get a DEFAULT_ARG when looking at an in-class declaration
11180 with a default argument. Ignore the argument for now; we'll
11181 deal with it after the class is complete. */
11184 if (processing_template_decl
|| uses_template_parms (arg
))
11185 /* We don't do anything checking until instantiation-time. Note
11186 that there may be uninstantiated arguments even for an
11187 instantiated function, since default arguments are not
11188 instantiated until they are needed. */
11197 decl_type
= TREE_TYPE (decl
);
11199 if (arg
== error_mark_node
11200 || decl
== error_mark_node
11201 || TREE_TYPE (arg
) == error_mark_node
11202 || decl_type
== error_mark_node
)
11203 /* Something already went wrong. There's no need to check
11205 return error_mark_node
;
11207 /* [dcl.fct.default]
11209 A default argument expression is implicitly converted to the
11211 if (!TREE_TYPE (arg
)
11212 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11215 cp_error ("default argument for `%#D' has type `%T'",
11216 decl
, TREE_TYPE (arg
));
11218 cp_error ("default argument for parameter of type `%T' has type `%T'",
11219 decl_type
, TREE_TYPE (arg
));
11221 return error_mark_node
;
11224 /* [dcl.fct.default]
11226 Local variables shall not be used in default argument
11229 The keyword `this' shall not be used in a default argument of a
11230 member function. */
11231 var
= walk_tree (&arg
, local_variable_p
, NULL
);
11234 cp_error ("default argument `%E' uses local variable `%D'",
11236 return error_mark_node
;
11243 /* Decode the list of parameter types for a function type.
11244 Given the list of things declared inside the parens,
11245 return a list of types.
11247 The list we receive can have three kinds of elements:
11248 an IDENTIFIER_NODE for names given without types,
11249 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11250 or void_type_node, to mark the end of an argument list
11251 when additional arguments are not permitted (... was not used).
11253 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11254 a mere declaration. A nonempty identifier-list gets an error message
11255 when FUNCDEF_FLAG is zero.
11256 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11257 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11259 If all elements of the input list contain types,
11260 we return a list of the types.
11261 If all elements contain no type (except perhaps a void_type_node
11262 at the end), we return a null list.
11263 If some have types and some do not, it is an error, and we
11264 return a null list.
11266 Also set last_function_parms to either
11267 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11268 A list of names is converted to a chain of PARM_DECLs
11269 by store_parm_decls so that ultimately it is always a chain of decls.
11271 Note that in C++, parameters can take default values. These default
11272 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11273 an error to specify default values which are followed by parameters
11274 that have no default values, or an ELLIPSES. For simplicities sake,
11275 only parameters which are specified with their types can take on
11279 grokparms (first_parm
, funcdef_flag
)
11283 tree result
= NULL_TREE
;
11284 tree decls
= NULL_TREE
;
11286 if (first_parm
!= NULL_TREE
11287 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11289 if (! funcdef_flag
)
11290 pedwarn ("parameter names (without types) in function declaration");
11291 last_function_parms
= first_parm
;
11294 else if (first_parm
!= NULL_TREE
11295 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11296 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11297 my_friendly_abort (145);
11300 /* Types were specified. This is a list of declarators
11301 each represented as a TREE_LIST node. */
11302 register tree parm
, chain
;
11303 int any_init
= 0, any_error
= 0;
11305 if (first_parm
!= NULL_TREE
)
11307 tree last_result
= NULL_TREE
;
11308 tree last_decl
= NULL_TREE
;
11310 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11312 tree type
= NULL_TREE
, list_node
= parm
;
11313 register tree decl
= TREE_VALUE (parm
);
11314 tree init
= TREE_PURPOSE (parm
);
11316 chain
= TREE_CHAIN (parm
);
11317 /* @@ weak defense against parse errors. */
11318 if (TREE_CODE (decl
) != VOID_TYPE
11319 && TREE_CODE (decl
) != TREE_LIST
)
11321 /* Give various messages as the need arises. */
11322 if (TREE_CODE (decl
) == STRING_CST
)
11323 cp_error ("invalid string constant `%E'", decl
);
11324 else if (TREE_CODE (decl
) == INTEGER_CST
)
11325 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11329 if (TREE_CODE (decl
) != VOID_TYPE
)
11331 decl
= grokdeclarator (TREE_VALUE (decl
),
11332 TREE_PURPOSE (decl
),
11333 PARM
, init
!= NULL_TREE
,
11335 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11338 /* Top-level qualifiers on the parameters are
11339 ignored for function types. */
11340 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11342 if (TREE_CODE (type
) == VOID_TYPE
)
11343 decl
= void_type_node
;
11344 else if (TREE_CODE (type
) == METHOD_TYPE
)
11346 if (DECL_NAME (decl
))
11347 /* Cannot use the decl here because
11348 we don't have DECL_CONTEXT set up yet. */
11349 cp_error ("parameter `%D' invalidly declared method type",
11352 error ("parameter invalidly declared method type");
11353 type
= build_pointer_type (type
);
11354 TREE_TYPE (decl
) = type
;
11356 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11358 if (DECL_NAME (decl
))
11359 cp_error ("parameter `%D' invalidly declared offset type",
11362 error ("parameter invalidly declared offset type");
11363 type
= build_pointer_type (type
);
11364 TREE_TYPE (decl
) = type
;
11366 else if (abstract_virtuals_error (decl
, type
))
11367 any_error
= 1; /* Seems like a good idea. */
11368 else if (POINTER_TYPE_P (type
))
11371 while (POINTER_TYPE_P (t
)
11372 || (TREE_CODE (t
) == ARRAY_TYPE
11373 && TYPE_DOMAIN (t
) != NULL_TREE
))
11375 if (TREE_CODE (t
) == ARRAY_TYPE
)
11376 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11378 TYPE_PTR_P (type
) ? "pointer" : "reference");
11382 if (TREE_CODE (decl
) == VOID_TYPE
)
11384 if (result
== NULL_TREE
)
11386 result
= void_list_node
;
11387 last_result
= result
;
11391 TREE_CHAIN (last_result
) = void_list_node
;
11392 last_result
= void_list_node
;
11395 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11396 error ("`void' in parameter list must be entire list");
11400 /* Since there is a prototype, args are passed in their own types. */
11401 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11402 if (PROMOTE_PROTOTYPES
11403 && (TREE_CODE (type
) == INTEGER_TYPE
11404 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11405 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11406 DECL_ARG_TYPE (decl
) = integer_type_node
;
11407 if (!any_error
&& init
)
11410 init
= check_default_argument (decl
, init
);
11415 if (decls
== NULL_TREE
)
11422 TREE_CHAIN (last_decl
) = decl
;
11425 list_node
= tree_cons (init
, type
, NULL_TREE
);
11426 if (result
== NULL_TREE
)
11428 result
= list_node
;
11429 last_result
= result
;
11433 TREE_CHAIN (last_result
) = list_node
;
11434 last_result
= list_node
;
11438 TREE_CHAIN (last_result
) = NULL_TREE
;
11439 /* If there are no parameters, and the function does not end
11440 with `...', then last_decl will be NULL_TREE. */
11441 if (last_decl
!= NULL_TREE
)
11442 TREE_CHAIN (last_decl
) = NULL_TREE
;
11446 last_function_parms
= decls
;
11451 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11452 FUNCTION_TYPE with the newly parsed version of its default argument, which
11453 was previously digested as text. See snarf_defarg et al in lex.c. */
11456 replace_defarg (arg
, init
)
11459 if (! processing_template_decl
11460 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11461 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11462 TREE_TYPE (init
), TREE_VALUE (arg
));
11463 TREE_PURPOSE (arg
) = init
;
11470 tree t
= FUNCTION_ARG_CHAIN (d
);
11471 if (DECL_CONSTRUCTOR_P (d
)
11472 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11473 t
= TREE_CHAIN (t
);
11474 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11475 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11476 == DECL_CLASS_CONTEXT (d
))
11477 && (TREE_CHAIN (t
) == NULL_TREE
11478 || TREE_CHAIN (t
) == void_list_node
11479 || TREE_PURPOSE (TREE_CHAIN (t
))))
11484 /* These memoizing functions keep track of special properties which
11485 a class may have. `grok_ctor_properties' notices whether a class
11486 has a constructor of the form X(X&), and also complains
11487 if the class has a constructor of the form X(X).
11488 `grok_op_properties' takes notice of the various forms of
11489 operator= which are defined, as well as what sorts of type conversion
11490 may apply. Both functions take a FUNCTION_DECL as an argument. */
11493 grok_ctor_properties (ctype
, decl
)
11496 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11497 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11499 /* When a type has virtual baseclasses, a magical first int argument is
11500 added to any ctor so we can tell if the class has been initialized
11501 yet. This could screw things up in this function, so we deliberately
11502 ignore the leading int if we're in that situation. */
11503 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11505 my_friendly_assert (parmtypes
11506 && TREE_VALUE (parmtypes
) == integer_type_node
,
11508 parmtypes
= TREE_CHAIN (parmtypes
);
11509 parmtype
= TREE_VALUE (parmtypes
);
11514 A non-template constructor for class X is a copy constructor if
11515 its first parameter is of type X&, const X&, volatile X& or const
11516 volatile X&, and either there are no other parameters or else all
11517 other parameters have default arguments. */
11518 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11519 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11520 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11521 || TREE_CHAIN (parmtypes
) == void_list_node
11522 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11523 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11524 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11526 TYPE_HAS_INIT_REF (ctype
) = 1;
11527 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11528 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11532 A declaration of a constructor for a class X is ill-formed if its
11533 first parameter is of type (optionally cv-qualified) X and either
11534 there are no other parameters or else all other parameters have
11537 We *don't* complain about member template instantiations that
11538 have this form, though; they can occur as we try to decide what
11539 constructor to use during overload resolution. Since overload
11540 resolution will never prefer such a constructor to the
11541 non-template copy constructor (which is either explicitly or
11542 implicitly defined), there's no need to worry about their
11543 existence. Theoretically, they should never even be
11544 instantiated, but that's hard to forestall. */
11545 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11546 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11547 || TREE_CHAIN (parmtypes
) == void_list_node
11548 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11549 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11550 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11552 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11554 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11557 else if (TREE_CODE (parmtype
) == VOID_TYPE
11558 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11559 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11564 /* An operator with this name can be either unary or binary. */
11570 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11571 || name
== ansi_opname
[(int) ADDR_EXPR
]
11572 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11573 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11574 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11575 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11578 /* An operator with this name can only be unary. */
11584 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11585 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11586 || name
== ansi_opname
[(int) COMPONENT_REF
]
11587 || IDENTIFIER_TYPENAME_P (name
));
11590 /* Do a little sanity-checking on how they declared their operator. */
11593 grok_op_properties (decl
, virtualp
, friendp
)
11595 int virtualp
, friendp
;
11597 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11598 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11599 tree name
= DECL_NAME (decl
);
11601 if (current_class_type
== NULL_TREE
)
11608 A user-declared copy assignment operator X::operator= is a
11609 non-static non-template member function of class X with
11610 exactly one parameter of type X, X&, const X&, volatile X& or
11611 const volatile X&. */
11612 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11613 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11614 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11616 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11617 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11618 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11619 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11620 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11621 || name
== ansi_opname
[(int) MEMBER_REF
])
11622 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11623 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11624 TYPE_GETS_NEW (current_class_type
) |= 1;
11625 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11626 TYPE_GETS_DELETE (current_class_type
) |= 1;
11627 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11628 TYPE_GETS_NEW (current_class_type
) |= 2;
11629 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11630 TYPE_GETS_DELETE (current_class_type
) |= 2;
11633 if (name
== ansi_opname
[(int) NEW_EXPR
]
11634 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11636 /* When the compiler encounters the definition of A::operator new, it
11637 doesn't look at the class declaration to find out if it's static. */
11639 revert_static_member_fn (&decl
, NULL
, NULL
);
11641 /* Take care of function decl if we had syntax errors. */
11642 if (argtypes
== NULL_TREE
)
11644 = build_function_type (ptr_type_node
,
11645 hash_tree_chain (integer_type_node
,
11648 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11650 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11651 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11654 revert_static_member_fn (&decl
, NULL
, NULL
);
11656 if (argtypes
== NULL_TREE
)
11658 = build_function_type (void_type_node
,
11659 hash_tree_chain (ptr_type_node
,
11663 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11665 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11666 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11667 != void_list_node
))
11668 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11673 /* An operator function must either be a non-static member function
11674 or have at least one parameter of a class, a reference to a class,
11675 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11676 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11678 if (IDENTIFIER_TYPENAME_P (name
)
11679 || name
== ansi_opname
[(int) CALL_EXPR
]
11680 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11681 || name
== ansi_opname
[(int) COMPONENT_REF
]
11682 || name
== ansi_opname
[(int) ARRAY_REF
])
11683 cp_error ("`%D' must be a nonstatic member function", decl
);
11688 if (DECL_STATIC_FUNCTION_P (decl
))
11689 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11692 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11694 tree arg
= TREE_VALUE (p
);
11695 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11696 arg
= TREE_TYPE (arg
);
11698 /* This lets bad template code slip through. */
11699 if (IS_AGGR_TYPE (arg
)
11700 || TREE_CODE (arg
) == ENUMERAL_TYPE
11701 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11702 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11706 ("`%D' must have an argument of class or enumerated type",
11713 if (name
== ansi_opname
[(int) CALL_EXPR
])
11714 return; /* No restrictions on args. */
11716 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11718 tree t
= TREE_TYPE (name
);
11719 if (TREE_CODE (t
) == VOID_TYPE
)
11720 pedwarn ("void is not a valid type conversion operator");
11721 else if (! friendp
)
11723 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11724 const char *what
= 0;
11726 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11728 if (t
== current_class_type
)
11729 what
= "the same type";
11730 /* Don't force t to be complete here. */
11731 else if (IS_AGGR_TYPE (t
)
11733 && DERIVED_FROM_P (t
, current_class_type
))
11734 what
= "a base class";
11737 warning ("conversion to %s%s will never use a type conversion operator",
11738 ref
? "a reference to " : "", what
);
11742 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11746 if (list_length (argtypes
) != 3 && methodp
)
11748 cp_error ("`%D' must take exactly one argument", decl
);
11751 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11753 if (copy_assignment_arg_p (parmtype
, virtualp
)
11756 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11757 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11758 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11759 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11762 else if (name
== ansi_opname
[(int) COND_EXPR
])
11765 cp_error ("ANSI C++ prohibits overloading operator ?:");
11767 else if (ambi_op_p (name
))
11769 if (list_length (argtypes
) == 2)
11771 else if (list_length (argtypes
) == 3)
11773 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11774 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11775 && ! processing_template_decl
11776 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11779 cp_error ("postfix `%D' must take `int' as its argument",
11783 ("postfix `%D' must take `int' as its second argument",
11790 cp_error ("`%D' must take either zero or one argument", decl
);
11792 cp_error ("`%D' must take either one or two arguments", decl
);
11795 /* More Effective C++ rule 6. */
11797 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11798 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11800 tree arg
= TREE_VALUE (argtypes
);
11801 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11802 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11803 arg
= TREE_TYPE (arg
);
11804 arg
= TYPE_MAIN_VARIANT (arg
);
11805 if (list_length (argtypes
) == 2)
11807 if (TREE_CODE (ret
) != REFERENCE_TYPE
11808 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11810 cp_warning ("prefix `%D' should return `%T'", decl
,
11811 build_reference_type (arg
));
11815 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11816 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11820 else if (unary_op_p (name
))
11822 if (list_length (argtypes
) != 2)
11825 cp_error ("`%D' must take `void'", decl
);
11827 cp_error ("`%D' must take exactly one argument", decl
);
11830 else /* if (binary_op_p (name)) */
11832 if (list_length (argtypes
) != 3)
11835 cp_error ("`%D' must take exactly one argument", decl
);
11837 cp_error ("`%D' must take exactly two arguments", decl
);
11840 /* More Effective C++ rule 7. */
11842 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11843 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11844 || name
== ansi_opname
[COMPOUND_EXPR
]))
11845 cp_warning ("user-defined `%D' always evaluates both arguments",
11849 /* Effective C++ rule 23. */
11851 && list_length (argtypes
) == 3
11852 && (name
== ansi_opname
[PLUS_EXPR
]
11853 || name
== ansi_opname
[MINUS_EXPR
]
11854 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11855 || name
== ansi_opname
[MULT_EXPR
])
11856 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11857 cp_warning ("`%D' should return by value", decl
);
11861 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11862 if (TREE_PURPOSE (argtypes
))
11864 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11865 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11866 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11869 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11872 cp_error ("`%D' cannot have default arguments", decl
);
11877 static const char *
11879 enum tag_types code
;
11892 my_friendly_abort (981122);
11896 /* Get the struct, enum or union (CODE says which) with tag NAME.
11897 Define the tag as a forward-reference if it is not defined.
11899 C++: If a class derivation is given, process it here, and report
11900 an error if multiple derivation declarations are not identical.
11902 If this is a definition, come in through xref_tag and only look in
11903 the current frame for the name (since C++ allows new names in any
11907 xref_tag (code_type_node
, name
, globalize
)
11908 tree code_type_node
;
11912 enum tag_types tag_code
;
11913 enum tree_code code
;
11914 register tree ref
, t
;
11915 struct binding_level
*b
= current_binding_level
;
11917 tree attributes
= NULL_TREE
;
11918 tree context
= NULL_TREE
;
11920 /* If we are called from the parser, code_type_node will sometimes be a
11921 TREE_LIST. This indicates that the user wrote
11922 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11924 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11926 attributes
= TREE_PURPOSE (code_type_node
);
11927 code_type_node
= TREE_VALUE (code_type_node
);
11930 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11935 code
= RECORD_TYPE
;
11941 code
= ENUMERAL_TYPE
;
11944 my_friendly_abort (18);
11947 /* If a cross reference is requested, look up the type
11948 already defined for this tag and return it. */
11949 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11952 name
= TYPE_IDENTIFIER (t
);
11956 t
= IDENTIFIER_TYPE_VALUE (name
);
11958 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11959 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11964 /* If we know we are defining this tag, only look it up in
11965 this scope and don't try to find it as a type. */
11966 ref
= lookup_tag (code
, name
, b
, 1);
11972 /* [dcl.type.elab] If the identifier resolves to a
11973 typedef-name or a template type-parameter, the
11974 elaborated-type-specifier is ill-formed. */
11975 if (t
!= TYPE_MAIN_VARIANT (t
)
11976 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
11977 cp_pedwarn ("using typedef-name `%D' after `%s'",
11978 TYPE_NAME (t
), tag_name (tag_code
));
11979 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
11980 cp_error ("using template type parameter `%T' after `%s'",
11981 t
, tag_name (tag_code
));
11986 ref
= lookup_tag (code
, name
, b
, 0);
11990 /* Try finding it as a type declaration. If that wins,
11992 ref
= lookup_name (name
, 1);
11994 if (ref
!= NULL_TREE
11995 && processing_template_decl
11996 && DECL_CLASS_TEMPLATE_P (ref
)
11997 && template_class_depth (current_class_type
) == 0)
11998 /* Since GLOBALIZE is true, we're declaring a global
11999 template, so we want this type. */
12000 ref
= DECL_RESULT (ref
);
12002 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12003 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12004 ref
= TREE_TYPE (ref
);
12009 if (ref
&& current_class_type
12010 && template_class_depth (current_class_type
)
12011 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12013 /* Since GLOBALIZE is non-zero, we are not looking at a
12014 definition of this tag. Since, in addition, we are currently
12015 processing a (member) template declaration of a template
12016 class, we must be very careful; consider:
12023 { template <class V>
12024 friend struct S1; };
12026 Here, the S2::S1 declaration should not be confused with the
12027 outer declaration. In particular, the inner version should
12028 have a template parameter of level 2, not level 1. This
12029 would be particularly important if the member declaration
12032 template <class V = U> friend struct S1;
12034 say, when we should tsubst into `U' when instantiating
12035 S2. On the other hand, when presented with:
12045 we must find the inner binding eventually. We
12046 accomplish this by making sure that the new type we
12047 create to represent this declaration has the right
12049 context
= TYPE_CONTEXT (ref
);
12056 /* If no such tag is yet defined, create a forward-reference node
12057 and record it as the "definition".
12058 When a real declaration of this type is found,
12059 the forward-reference will be altered into a real type. */
12060 if (code
== ENUMERAL_TYPE
)
12062 cp_error ("use of enum `%#D' without previous declaration", name
);
12064 ref
= make_node (ENUMERAL_TYPE
);
12066 /* Give the type a default layout like unsigned int
12067 to avoid crashing if it does not get defined. */
12068 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12069 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12070 TREE_UNSIGNED (ref
) = 1;
12071 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12072 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12073 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12075 /* Enable us to recognize when a type is created in class context.
12076 To do nested classes correctly, this should probably be cleared
12077 out when we leave this classes scope. Currently this in only
12078 done in `start_enum'. */
12080 pushtag (name
, ref
, globalize
);
12084 struct binding_level
*old_b
= class_binding_level
;
12086 ref
= make_lang_type (code
);
12087 TYPE_CONTEXT (ref
) = context
;
12089 #ifdef NONNESTED_CLASSES
12090 /* Class types don't nest the way enums do. */
12091 class_binding_level
= (struct binding_level
*)0;
12093 pushtag (name
, ref
, globalize
);
12094 class_binding_level
= old_b
;
12099 /* If it no longer looks like a nested type, make sure it's
12101 If it is not an IDENTIFIER, this is not a declaration */
12102 if (b
->namespace_p
&& !class_binding_level
12103 && TREE_CODE (name
) == IDENTIFIER_NODE
12104 && IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12105 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12107 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12108 redeclare_class_template (ref
, current_template_parms
);
12111 /* Until the type is defined, tentatively accept whatever
12112 structure tag the user hands us. */
12113 if (TYPE_SIZE (ref
) == NULL_TREE
12114 && ref
!= current_class_type
12115 /* Have to check this, in case we have contradictory tag info. */
12116 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12118 if (tag_code
== class_type
)
12119 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12120 else if (tag_code
== record_type
)
12121 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12124 TREE_TYPE (ref
) = attributes
;
12130 xref_tag_from_type (old
, id
, globalize
)
12134 tree code_type_node
;
12136 if (TREE_CODE (old
) == RECORD_TYPE
)
12137 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12138 ? class_type_node
: record_type_node
);
12140 code_type_node
= union_type_node
;
12142 if (id
== NULL_TREE
)
12143 id
= TYPE_IDENTIFIER (old
);
12145 return xref_tag (code_type_node
, id
, globalize
);
12148 /* REF is a type (named NAME), for which we have just seen some
12149 baseclasses. BINFO is a list of those baseclasses; the
12150 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12151 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12152 struct, or union. */
12155 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12156 tree code_type_node
;
12160 /* In the declaration `A : X, Y, ... Z' we mark all the types
12161 (A, X, Y, ..., Z) so we can check for duplicates. */
12166 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12168 if (tag_code
== union_type
)
12170 cp_error ("derived union `%T' invalid", ref
);
12174 len
= list_length (binfo
);
12176 /* First, make sure that any templates in base-classes are
12177 instantiated. This ensures that if we call ourselves recursively
12178 we do not get confused about which classes are marked and which
12180 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12181 complete_type (TREE_VALUE (base
));
12183 SET_CLASSTYPE_MARKED (ref
);
12184 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12186 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12188 /* The base of a derived struct is public by default. */
12190 = (TREE_PURPOSE (binfo
) == access_public_node
12191 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12192 || (tag_code
!= class_type
12193 && (TREE_PURPOSE (binfo
) == access_default_node
12194 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12196 = (TREE_PURPOSE (binfo
) == access_protected_node
12197 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12199 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12200 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12201 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12202 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12203 tree basetype
= TREE_VALUE (binfo
);
12206 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12207 basetype
= TREE_TYPE (basetype
);
12209 || (TREE_CODE (basetype
) != RECORD_TYPE
12210 && TREE_CODE (basetype
) != TYPENAME_TYPE
12211 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12212 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12214 cp_error ("base type `%T' fails to be a struct or class type",
12215 TREE_VALUE (binfo
));
12219 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12221 /* This code replaces similar code in layout_basetypes.
12222 We put the complete_type first for implicit `typename'. */
12223 if (TYPE_SIZE (basetype
) == NULL_TREE
12224 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12226 cp_error ("base class `%T' has incomplete type", basetype
);
12231 if (CLASSTYPE_MARKED (basetype
))
12233 if (basetype
== ref
)
12234 cp_error ("recursive type `%T' undefined", basetype
);
12236 cp_error ("duplicate base type `%T' invalid", basetype
);
12240 if (TYPE_FOR_JAVA (basetype
)
12241 && (current_lang_stack
12242 == &VARRAY_TREE (current_lang_base
, 0)))
12243 TYPE_FOR_JAVA (ref
) = 1;
12245 /* Note that the BINFO records which describe individual
12246 inheritances are *not* shared in the lattice! They
12247 cannot be shared because a given baseclass may be
12248 inherited with different `accessibility' by different
12249 derived classes. (Each BINFO record describing an
12250 individual inheritance contains flags which say what
12251 the `accessibility' of that particular inheritance is.) */
12254 = make_binfo (integer_zero_node
, basetype
,
12255 CLASS_TYPE_P (basetype
)
12256 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12257 CLASS_TYPE_P (basetype
)
12258 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12260 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12261 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12262 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12263 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12264 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12266 /* We need to unshare the binfos now so that lookups during class
12267 definition work. */
12268 unshare_base_binfos (base_binfo
);
12270 SET_CLASSTYPE_MARKED (basetype
);
12272 /* We are free to modify these bits because they are meaningless
12273 at top level, and BASETYPE is a top-level type. */
12274 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12276 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12277 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12280 if (CLASS_TYPE_P (basetype
))
12282 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12283 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12290 TREE_VEC_LENGTH (binfos
) = i
;
12292 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12295 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12298 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12300 if (CLASS_TYPE_P (basetype
))
12301 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12302 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12305 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12306 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12308 /* Unmark all the types. */
12310 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12311 CLEAR_CLASSTYPE_MARKED (ref
);
12313 /* Now that we know all the base-classes, set up the list of virtual
12315 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12319 /* Begin compiling the definition of an enumeration type.
12320 NAME is its name (or null if anonymous).
12321 Returns the type object, as yet incomplete.
12322 Also records info about it so that build_enumerator
12323 may be used to declare the individual values as they are read. */
12329 register tree enumtype
= NULL_TREE
;
12330 struct binding_level
*b
= current_binding_level
;
12332 /* If this is the real definition for a previous forward reference,
12333 fill in the contents in the same object that used to be the
12334 forward reference. */
12336 if (name
!= NULL_TREE
)
12337 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12339 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12341 cp_error ("multiple definition of `%#T'", enumtype
);
12342 cp_error_at ("previous definition here", enumtype
);
12343 /* Clear out TYPE_VALUES, and start again. */
12344 TYPE_VALUES (enumtype
) = NULL_TREE
;
12348 enumtype
= make_node (ENUMERAL_TYPE
);
12349 pushtag (name
, enumtype
, 0);
12352 if (current_class_type
)
12353 TREE_ADDRESSABLE (b
->tags
) = 1;
12355 GNU_xref_decl (current_function_decl
, enumtype
);
12359 /* After processing and defining all the values of an enumeration type,
12360 install their decls in the enumeration type and finish it off.
12361 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12362 Returns ENUMTYPE. */
12365 finish_enum (enumtype
)
12368 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12369 /* Calculate the maximum value of any enumerator in this type. */
12371 tree values
= TYPE_VALUES (enumtype
);
12376 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12381 /* The TREE_VALUE is a CONST_DECL for this enumeration
12383 decl
= TREE_VALUE (pair
);
12387 Following the closing brace of an enum-specifier, each
12388 enumerator has the type of its enumeration. Prior to the
12389 closing brace, the type of each enumerator is the type of
12390 its initializing value. */
12391 TREE_TYPE (decl
) = enumtype
;
12393 /* The DECL_INITIAL will be NULL if we are processing a
12394 template declaration and this enumeration constant had no
12395 explicit initializer. */
12396 value
= DECL_INITIAL (decl
);
12397 if (value
&& !processing_template_decl
)
12399 /* Set the TREE_TYPE for the VALUE as well. That's so
12400 that when we call decl_constant_value we get an
12401 entity of the right type (but with the constant
12402 value). Since we shouldn't ever call
12403 decl_constant_value on a template type, there's no
12404 reason to do that when processing_template_decl.
12405 And, if the expression is something like a
12406 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12407 wreak havoc on the intended type of the expression.
12409 Of course, there's also no point in trying to compute
12410 minimum or maximum values if we're in a template. */
12411 TREE_TYPE (value
) = enumtype
;
12414 minnode
= maxnode
= value
;
12415 else if (tree_int_cst_lt (maxnode
, value
))
12417 else if (tree_int_cst_lt (value
, minnode
))
12421 if (processing_template_decl
)
12422 /* If this is just a template, leave the CONST_DECL
12423 alone. That way tsubst_copy will find CONST_DECLs for
12424 CONST_DECLs, and not INTEGER_CSTs. */
12427 /* In the list we're building up, we want the enumeration
12428 values, not the CONST_DECLs. */
12429 TREE_VALUE (pair
) = value
;
12433 maxnode
= minnode
= integer_zero_node
;
12435 TYPE_VALUES (enumtype
) = nreverse (values
);
12437 if (processing_template_decl
)
12439 tree scope
= current_scope ();
12440 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12441 add_tree (build_min (TAG_DEFN
, enumtype
));
12445 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12446 int lowprec
= min_precision (minnode
, unsignedp
);
12447 int highprec
= min_precision (maxnode
, unsignedp
);
12448 int precision
= MAX (lowprec
, highprec
);
12451 TYPE_SIZE (enumtype
) = NULL_TREE
;
12453 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12455 TYPE_PRECISION (enumtype
) = precision
;
12457 fixup_unsigned_type (enumtype
);
12459 fixup_signed_type (enumtype
);
12461 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12462 /* Use the width of the narrowest normal C type which is wide
12464 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12467 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12469 TYPE_SIZE (enumtype
) = 0;
12470 layout_type (enumtype
);
12472 /* Fix up all variant types of this enum type. */
12473 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12474 tem
= TYPE_NEXT_VARIANT (tem
))
12476 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12477 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12478 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12479 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12480 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12481 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12482 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12483 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12484 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12487 /* Finish debugging output for this type. */
12488 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12494 /* Build and install a CONST_DECL for an enumeration constant of the
12495 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
12496 Assignment of sequential values by default is handled here. */
12499 build_enumerator (name
, value
, enumtype
)
12509 /* Remove no-op casts from the value. */
12511 STRIP_TYPE_NOPS (value
);
12513 if (! processing_template_decl
)
12515 /* Validate and default VALUE. */
12516 if (value
!= NULL_TREE
)
12518 if (TREE_READONLY_DECL_P (value
))
12519 value
= decl_constant_value (value
);
12521 if (TREE_CODE (value
) == INTEGER_CST
)
12523 value
= default_conversion (value
);
12524 constant_expression_warning (value
);
12528 cp_error ("enumerator value for `%D' not integer constant", name
);
12533 /* Default based on previous value. */
12534 if (value
== NULL_TREE
&& ! processing_template_decl
)
12538 if (TYPE_VALUES (enumtype
))
12540 /* The next value is the previous value ... */
12541 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
12542 /* ... plus one. */
12543 value
= build_binary_op_nodefault (PLUS_EXPR
,
12548 if (tree_int_cst_lt (value
, prev_value
))
12549 cp_error ("overflow in enumeration values at `%D'", name
);
12552 value
= integer_zero_node
;
12555 /* Remove no-op casts from the value. */
12557 STRIP_TYPE_NOPS (value
);
12559 /* To fix MAX_VAL enum consts. (bkoz) */
12560 TREE_TYPE (value
) = integer_type_node
;
12564 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12565 Even in other cases, we will later (in finish_enum) be setting
12566 the type of VALUE. But, we don't need to make a copy if this
12567 VALUE is one of the enumeration constants for this same
12568 enumeration type. */
12569 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
12570 if (TREE_VALUE (values
) == value
)
12572 /* If we didn't break out of the loop, then we do need a copy. */
12573 if (!values
&& value
)
12574 value
= copy_node (value
);
12576 /* C++ associates enums with global, function, or class declarations. */
12577 context
= current_scope ();
12579 /* Build the actual enumeration constant. Note that the enumeration
12580 constants have the type of their initializers until the
12581 enumeration is complete:
12585 Following the closing brace of an enum-specifier, each enumer-
12586 ator has the type of its enumeration. Prior to the closing
12587 brace, the type of each enumerator is the type of its
12588 initializing value.
12590 In finish_enum we will reset the type. Of course, if we're
12591 processing a template, there may be no value. */
12592 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
12594 if (context
&& context
== current_class_type
)
12595 /* This enum declaration is local to the class. We need the full
12596 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
12597 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12599 /* It's a global enum, or it's local to a function. (Note local to
12600 a function could mean local to a class method. */
12601 decl
= build_decl (CONST_DECL
, name
, type
);
12603 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12604 DECL_INITIAL (decl
) = value
;
12605 TREE_READONLY (decl
) = 1;
12607 if (context
&& context
== current_class_type
)
12608 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12609 on the TYPE_FIELDS list for `S'. (That's so that you can say
12610 things like `S::i' later.) */
12611 finish_member_declaration (decl
);
12615 GNU_xref_decl (current_function_decl
, decl
);
12618 /* Add this enumeration constant to the list for this type. */
12619 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
12623 static int function_depth
;
12625 /* We're defining DECL. Make sure that it's type is OK. */
12628 check_function_type (decl
)
12631 tree fntype
= TREE_TYPE (decl
);
12633 /* In a function definition, arg types must be complete. */
12634 require_complete_types_for_parms (current_function_parms
);
12636 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12638 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12640 /* Make it return void instead, but don't change the
12641 type of the DECL_RESULT, in case we have a named return value. */
12642 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12644 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12646 = build_cplus_method_type (ctype
,
12648 FUNCTION_ARG_CHAIN (decl
));
12652 = build_function_type (void_type_node
,
12653 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12655 = build_exception_variant (fntype
,
12656 TYPE_RAISES_EXCEPTIONS (fntype
));
12659 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12662 /* Create the FUNCTION_DECL for a function definition.
12663 DECLSPECS and DECLARATOR are the parts of the declaration;
12664 they describe the function's name and the type it returns,
12665 but twisted together in a fashion that parallels the syntax of C.
12667 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12668 DECLARATOR is really the DECL for the function we are about to
12669 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12670 indicating that the function is an inline defined in-class, and
12671 SF_EXPAND indicating that we should generate RTL for this
12674 This function creates a binding context for the function body
12675 as well as setting up the FUNCTION_DECL in current_function_decl.
12677 Returns 1 on success. If the DECLARATOR is not suitable for a function
12678 (it defines a datum instead), we return 0, which tells
12679 yyparse to report a parse error.
12681 For C++, we must first check whether that datum makes any sense.
12682 For example, "class A local_a(1,2);" means that variable local_a
12683 is an aggregate of type A, which should have a constructor
12684 applied to it with the argument list [1, 2]. */
12687 start_function (declspecs
, declarator
, attrs
, flags
)
12688 tree declspecs
, declarator
, attrs
;
12692 tree ctype
= NULL_TREE
;
12695 extern int have_extern_spec
;
12696 extern int used_extern_spec
;
12697 int doing_friend
= 0;
12698 struct binding_level
*bl
;
12700 /* Sanity check. */
12701 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12702 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12704 /* This should only be done once on the top most decl. */
12705 if (have_extern_spec
&& !used_extern_spec
)
12707 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12708 used_extern_spec
= 1;
12711 if (flags
& SF_PRE_PARSED
)
12713 decl1
= declarator
;
12715 fntype
= TREE_TYPE (decl1
);
12716 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12717 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12719 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12720 class is in the (lexical) scope of the class in which it is
12722 if (!ctype
&& DECL_FRIEND_P (decl1
))
12724 ctype
= DECL_CLASS_CONTEXT (decl1
);
12726 /* CTYPE could be null here if we're dealing with a template;
12727 for example, `inline friend float foo()' inside a template
12728 will have no CTYPE set. */
12729 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12735 last_function_parms
= DECL_ARGUMENTS (decl1
);
12736 last_function_parm_tags
= NULL_TREE
;
12740 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12741 /* If the declarator is not suitable for a function definition,
12742 cause a syntax error. */
12743 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12745 fntype
= TREE_TYPE (decl1
);
12747 restype
= TREE_TYPE (fntype
);
12748 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12750 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12751 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12752 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12753 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12754 fntype
= build_function_type (integer_type_node
,
12755 TYPE_ARG_TYPES (fntype
));
12757 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12759 TYPE_ARG_TYPES (fntype
));
12760 TREE_TYPE (decl1
) = fntype
;
12763 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12764 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12765 else if (DECL_MAIN_P (decl1
))
12767 /* If this doesn't return integer_type, complain. */
12768 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12770 if (pedantic
|| warn_return_type
)
12771 pedwarn ("return type for `main' changed to `int'");
12772 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12777 /* Sometimes we don't notice that a function is a static member, and
12778 build a METHOD_TYPE for it. Fix that up now. */
12779 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
12780 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
12782 revert_static_member_fn (&decl1
, NULL
, NULL
);
12783 last_function_parms
= TREE_CHAIN (last_function_parms
);
12787 /* Warn if function was previously implicitly declared
12788 (but not if we warned then). */
12789 if (! warn_implicit
12790 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12791 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12793 /* Set up current_class_type, and enter the scope of the class, if
12796 push_nested_class (ctype
, 1);
12797 else if (DECL_STATIC_FUNCTION_P (decl1
))
12798 push_nested_class (DECL_CONTEXT (decl1
), 2);
12800 /* Now that we have entered the scope of the class, we must restore
12801 the bindings for any template parameters surrounding DECL1, if it
12802 is an inline member template. (Order is important; consider the
12803 case where a template parameter has the same name as a field of
12804 the class.) It is not until after this point that
12805 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12806 if (flags
& SF_INCLASS_INLINE
)
12807 maybe_begin_member_template_processing (decl1
);
12809 /* Effective C++ rule 15. See also c_expand_return. */
12811 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12812 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12813 cp_warning ("`operator=' should return a reference to `*this'");
12815 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12816 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12817 if (!DECL_INITIAL (decl1
))
12818 DECL_INITIAL (decl1
) = error_mark_node
;
12820 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12821 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12824 /* This function exists in static storage.
12825 (This does not mean `static' in the C sense!) */
12826 TREE_STATIC (decl1
) = 1;
12828 /* We must call push_template_decl after current_class_type is set
12829 up. (If we are processing inline definitions after exiting a
12830 class scope, current_class_type will be NULL_TREE until set above
12831 by push_nested_class.) */
12832 if (processing_template_decl
)
12833 decl1
= push_template_decl (decl1
);
12835 /* We are now in the scope of the function being defined. */
12836 current_function_decl
= decl1
;
12838 /* Save the parm names or decls from this function's declarator
12839 where store_parm_decls will find them. */
12840 current_function_parms
= last_function_parms
;
12841 current_function_parm_tags
= last_function_parm_tags
;
12843 /* Make sure the parameter and return types are reasonable. When
12844 you declare a function, these types can be incomplete, but they
12845 must be complete when you define the function. */
12846 if (! processing_template_decl
)
12847 check_function_type (decl1
);
12849 /* Build the return declaration for the function. */
12850 restype
= TREE_TYPE (fntype
);
12851 if (!processing_template_decl
)
12853 if (!DECL_RESULT (decl1
))
12855 DECL_RESULT (decl1
)
12856 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12857 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12858 DECL_RESULT (decl1
));
12862 /* Just use `void'. Nobody will ever look at this anyhow. */
12863 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12865 /* Initialize RTL machinery. We cannot do this until
12866 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12867 even when processing a template; this is how we get
12868 CURRENT_FUNCTION set up, and our per-function variables
12870 bl
= current_binding_level
;
12871 init_function_start (decl1
, input_filename
, lineno
);
12872 current_binding_level
= bl
;
12873 expanding_p
= (flags
& SF_EXPAND
) != 0;
12875 /* Even though we're inside a function body, we still don't want to
12876 call expand_expr to calculate the size of a variable-sized array.
12877 We haven't necessarily assigned RTL to all variables yet, so it's
12878 not safe to try to expand expressions involving them. */
12879 immediate_size_expand
= 0;
12880 current_function
->x_dont_save_pending_sizes_p
= 1;
12882 /* If we're building a statement-tree, start the tree now. */
12883 if (processing_template_decl
|| !expanding_p
)
12884 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
12886 /* Let the user know we're compiling this function. */
12887 if (processing_template_decl
|| !building_stmt_tree ())
12888 announce_function (decl1
);
12890 /* Record the decl so that the function name is defined.
12891 If we already have a decl for this name, and it is a FUNCTION_DECL,
12892 use the old decl. */
12893 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12895 /* A specialization is not used to guide overload resolution. */
12896 if ((flag_guiding_decls
12897 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12898 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12899 decl1
= pushdecl (decl1
);
12902 /* We need to set the DECL_CONTEXT. */
12903 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12904 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12905 /* And make sure we have enough default args. */
12906 check_default_args (decl1
);
12908 DECL_MAIN_VARIANT (decl1
) = decl1
;
12909 fntype
= TREE_TYPE (decl1
);
12912 /* Reset these in case the call to pushdecl changed them. */
12913 current_function_decl
= decl1
;
12914 current_function
->decl
= decl1
;
12916 /* Initialize the per-function data. */
12917 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
12919 /* If we already parsed this function, and we're just expanding it
12920 now, restore saved state. */
12921 struct binding_level
*bl
= current_binding_level
;
12922 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
12923 current_binding_level
= bl
;
12925 /* This function is being processed in whole-function mode; we
12926 already did semantic analysis. */
12927 current_function
->x_whole_function_mode_p
= 1;
12929 /* If we decided that we didn't want to inline this function,
12930 make sure the back-end knows that. */
12931 if (!current_function_cannot_inline
)
12932 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
12934 /* We don't need the saved data anymore. */
12935 free (DECL_SAVED_FUNCTION_DATA (decl1
));
12936 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
12938 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
12940 /* We know that this was set up by `grokclassfn'. We do not
12941 wait until `store_parm_decls', since evil parse errors may
12942 never get us to that point. Here we keep the consistency
12943 between `current_class_type' and `current_class_ptr'. */
12944 tree t
= DECL_ARGUMENTS (decl1
);
12946 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
12948 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
12951 cp_function_chain
->x_current_class_ref
12952 = build_indirect_ref (t
, NULL_PTR
);
12953 cp_function_chain
->x_current_class_ptr
= t
;
12955 /* Constructors and destructors need to know whether they're "in
12956 charge" of initializing virtual base classes. */
12957 if (DECL_DESTRUCTOR_P (decl1
))
12958 current_in_charge_parm
= TREE_CHAIN (t
);
12959 else if (DECL_CONSTRUCTOR_P (decl1
)
12961 && DECL_ARTIFICIAL (TREE_CHAIN (t
))
12962 && (DECL_NAME (TREE_CHAIN (t
))
12963 == in_charge_identifier
))
12964 current_in_charge_parm
= TREE_CHAIN (t
);
12967 if (DECL_INTERFACE_KNOWN (decl1
))
12969 tree ctx
= hack_decl_function_context (decl1
);
12971 if (DECL_NOT_REALLY_EXTERN (decl1
))
12972 DECL_EXTERNAL (decl1
) = 0;
12974 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12975 && TREE_PUBLIC (ctx
))
12976 /* This is a function in a local class in an extern inline
12978 comdat_linkage (decl1
);
12980 /* If this function belongs to an interface, it is public.
12981 If it belongs to someone else's interface, it is also external.
12982 This only affects inlines and template instantiations. */
12983 else if (interface_unknown
== 0
12984 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12985 || flag_alt_external_templates
))
12987 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12988 || processing_template_decl
)
12990 DECL_EXTERNAL (decl1
)
12992 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
12993 && !DECL_VINDEX (decl1
)));
12995 /* For WIN32 we also want to put these in linkonce sections. */
12996 maybe_make_one_only (decl1
);
12999 DECL_EXTERNAL (decl1
) = 0;
13000 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13001 DECL_INTERFACE_KNOWN (decl1
) = 1;
13003 else if (interface_unknown
&& interface_only
13004 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13005 || flag_alt_external_templates
))
13007 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13008 interface, we will have interface_only set but not
13009 interface_known. In that case, we don't want to use the normal
13010 heuristics because someone will supply a #pragma implementation
13011 elsewhere, and deducing it here would produce a conflict. */
13012 comdat_linkage (decl1
);
13013 DECL_EXTERNAL (decl1
) = 0;
13014 DECL_INTERFACE_KNOWN (decl1
) = 1;
13015 DECL_DEFER_OUTPUT (decl1
) = 1;
13019 /* This is a definition, not a reference.
13020 So clear DECL_EXTERNAL. */
13021 DECL_EXTERNAL (decl1
) = 0;
13023 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13024 && ! DECL_INTERFACE_KNOWN (decl1
)
13025 /* Don't try to defer nested functions for now. */
13026 && ! hack_decl_function_context (decl1
))
13027 DECL_DEFER_OUTPUT (decl1
) = 1;
13029 DECL_INTERFACE_KNOWN (decl1
) = 1;
13032 if (doing_semantic_analysis_p ())
13035 current_binding_level
->parm_flag
= 1;
13039 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13041 if (!building_stmt_tree ())
13043 GNU_xref_function (decl1
, current_function_parms
);
13044 make_function_rtl (decl1
);
13047 /* Promote the value to int before returning it. */
13048 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13049 restype
= type_promotes_to (restype
);
13051 /* If this fcn was already referenced via a block-scope `extern' decl
13052 (or an implicit decl), propagate certain information about the usage. */
13053 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13054 TREE_ADDRESSABLE (decl1
) = 1;
13056 if (DECL_RESULT (decl1
) == NULL_TREE
)
13058 DECL_RESULT (decl1
)
13059 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13060 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13061 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13066 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13067 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13068 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13069 else if (DECL_CONSTRUCTOR_P (decl1
))
13070 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13075 /* Called after store_parm_decls for a function-try-block. */
13078 expand_start_early_try_stmts ()
13080 expand_start_try_stmts ();
13083 /* Store the parameter declarations into the current function declaration.
13084 This is called after parsing the parameter declarations, before
13085 digesting the body of the function.
13087 Also install to binding contour return value identifier, if any. */
13090 store_parm_decls ()
13092 register tree fndecl
= current_function_decl
;
13093 register tree parm
;
13094 int parms_have_cleanups
= 0;
13095 tree cleanups
= NULL_TREE
;
13097 /* This is a list of types declared among parms in a prototype. */
13098 tree parmtags
= current_function_parm_tags
;
13100 /* This is a chain of any other decls that came in among the parm
13101 declarations. If a parm is declared with enum {foo, bar} x;
13102 then CONST_DECLs for foo and bar are put here. */
13103 tree nonparms
= NULL_TREE
;
13105 /* Create a binding level for the parms. */
13106 if (!building_stmt_tree ())
13107 expand_start_bindings (2);
13109 if (current_function_parms
)
13111 /* This case is when the function was defined with an ANSI prototype.
13112 The parms already have decls, so we need not do anything here
13113 except record them as in effect
13114 and complain if any redundant old-style parm decls were written. */
13116 tree specparms
= current_function_parms
;
13119 if (doing_semantic_analysis_p ())
13121 /* Must clear this because it might contain TYPE_DECLs declared
13123 storedecls (NULL_TREE
);
13125 /* If we're doing semantic analysis, then we'll call pushdecl
13126 for each of these. We must do them in reverse order so that
13127 they end in the correct forward order. */
13128 specparms
= nreverse (specparms
);
13131 for (parm
= specparms
; parm
; parm
= next
)
13133 next
= TREE_CHAIN (parm
);
13134 if (TREE_CODE (parm
) == PARM_DECL
)
13136 tree type
= TREE_TYPE (parm
);
13138 if (doing_semantic_analysis_p ())
13142 if (DECL_NAME (parm
) == NULL_TREE
13143 || TREE_CODE (parm
) != VOID_TYPE
)
13146 cp_error ("parameter `%D' declared void", parm
);
13148 cleanup
= maybe_build_cleanup (parm
);
13151 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13153 else if (type
!= error_mark_node
13154 && TYPE_NEEDS_DESTRUCTOR (type
))
13155 parms_have_cleanups
= 1;
13159 /* If we find an enum constant or a type tag,
13160 put it aside for the moment. */
13161 TREE_CHAIN (parm
) = NULL_TREE
;
13162 nonparms
= chainon (nonparms
, parm
);
13166 if (doing_semantic_analysis_p ())
13168 /* Get the decls in their original chain order
13169 and record in the function. This is all and only the
13170 PARM_DECLs that were pushed into scope by the loop above. */
13171 DECL_ARGUMENTS (fndecl
) = getdecls ();
13172 storetags (chainon (parmtags
, gettags ()));
13176 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13178 /* Now store the final chain of decls for the arguments
13179 as the decl-chain of the current lexical scope.
13180 Put the enumerators in as well, at the front so that
13181 DECL_ARGUMENTS is not modified. */
13182 if (doing_semantic_analysis_p ())
13183 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13185 /* Initialize the RTL code for the function. */
13186 DECL_SAVED_INSNS (fndecl
) = 0;
13187 if (! building_stmt_tree ())
13188 expand_function_start (fndecl
, parms_have_cleanups
);
13190 current_function_parms_stored
= 1;
13192 /* If this function is `main', emit a call to `__main'
13193 to run global initializers, etc. */
13194 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13195 expand_main_function ();
13197 /* Now that we have initialized the parms, we can start their
13198 cleanups. We cannot do this before, since expand_decl_cleanup
13199 should not be called before the parm can be used. */
13202 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13203 TREE_VALUE (cleanups
));
13204 cleanups
= TREE_CHAIN (cleanups
);
13207 /* Create a binding contour which can be used to catch
13208 cleanup-generated temporaries. Also, if the return value needs or
13209 has initialization, deal with that now. */
13210 if (parms_have_cleanups
)
13213 if (!building_stmt_tree ())
13214 expand_start_bindings (2);
13217 /* Do the starting of the exception specifications, if we have any. */
13218 if (flag_exceptions
&& !processing_template_decl
13219 && building_stmt_tree ()
13220 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13221 current_eh_spec_try_block
= expand_start_eh_spec ();
13224 /* Bind a name and initialization to the return value of
13225 the current function. */
13228 store_return_init (decl
)
13231 /* If this named return value comes in a register, put it in a
13232 pseudo-register. */
13233 if (DECL_REGISTER (decl
))
13235 original_result_rtx
= DECL_RTL (decl
);
13236 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13241 /* We have finished doing semantic analysis on DECL, but have not yet
13242 generated RTL for its body. Save away our current state, so that
13243 when we want to generate RTL later we know what to do. */
13246 save_function_data (decl
)
13249 struct language_function
*f
;
13251 /* Save the language-specific per-function data so that we can
13252 get it back when we really expand this function. */
13253 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13257 f
= ((struct language_function
*)
13258 xmalloc (sizeof (struct language_function
)));
13259 bcopy ((char *) cp_function_chain
, (char *) f
,
13260 sizeof (struct language_function
));
13261 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13263 /* Clear out the bits we don't need. */
13264 f
->x_base_init_list
= NULL_TREE
;
13265 f
->x_member_init_list
= NULL_TREE
;
13266 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13267 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13268 f
->x_result_rtx
= NULL_RTX
;
13269 f
->x_named_label_uses
= NULL
;
13270 f
->bindings
= NULL
;
13272 /* When we get back here again, we will be expanding. */
13273 f
->x_expanding_p
= 1;
13275 /* If we've already decided that we cannot inline this function, we
13276 must remember that fact when we actually go to expand the
13278 f
->cannot_inline
= current_function_cannot_inline
;
13281 /* At the end of every constructor we generate to code to return
13282 `this'. Do that now. */
13285 finish_constructor_body ()
13287 /* Any return from a constructor will end up here. */
13288 add_tree (build_min_nt (LABEL_STMT
, ctor_label
));
13290 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13291 generate the return, rather than a goto to CTOR_LABEL. */
13292 ctor_label
= NULL_TREE
;
13293 /* In check_return_expr we translate an empty return from a
13294 constructor to a return of `this'. */
13295 finish_return_stmt (NULL_TREE
);
13298 /* At the end of every destructor we generate code to restore virtual
13299 function tables to the values desired by base classes and to call
13300 to base class destructors. Do that now. */
13303 finish_destructor_body ()
13305 tree compound_stmt
;
13310 /* Create a block to contain all the extra code. */
13311 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13313 /* Any return from a destructor will end up here. */
13314 add_tree (build_min_nt (LABEL_STMT
, dtor_label
));
13316 /* Generate the code to call destructor on base class. If this
13317 destructor belongs to a class with virtual functions, then set
13318 the virtual function table pointer to represent the type of our
13321 /* This side-effect makes call to `build_delete' generate the code
13322 we have to have at the end of this destructor. `build_delete'
13323 will set the flag again. */
13324 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13326 /* These are two cases where we cannot delegate deletion. */
13327 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13328 || TYPE_GETS_REG_DELETE (current_class_type
))
13329 in_charge
= integer_zero_node
;
13331 in_charge
= current_in_charge_parm
;
13333 exprstmt
= build_delete (current_class_type
,
13336 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13339 if (exprstmt
!= error_mark_node
13340 && (TREE_CODE (exprstmt
) != NOP_EXPR
13341 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13342 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13344 if (exprstmt
!= void_zero_node
)
13345 /* Don't call `expand_expr_stmt' if we're not going to do
13346 anything, since -Wall will give a diagnostic. */
13347 finish_expr_stmt (exprstmt
);
13349 /* Run destructors for all virtual baseclasses. */
13350 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13352 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13353 tree if_stmt
= begin_if_stmt ();
13354 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13355 current_in_charge_parm
,
13361 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13363 tree vb
= get_vbase
13364 (BINFO_TYPE (vbases
),
13365 TYPE_BINFO (current_class_type
));
13367 (build_scoped_method_call
13368 (current_class_ref
, vb
, dtor_identifier
,
13369 build_expr_list (NULL_TREE
, integer_zero_node
)));
13371 vbases
= TREE_CHAIN (vbases
);
13374 finish_then_clause (if_stmt
);
13379 virtual_size
= c_sizeof (current_class_type
);
13381 /* At the end, call delete if that's what's requested. */
13383 /* FDIS sez: At the point of definition of a virtual destructor
13384 (including an implicit definition), non-placement operator delete
13385 shall be looked up in the scope of the destructor's class and if
13386 found shall be accessible and unambiguous.
13388 This is somewhat unclear, but I take it to mean that if the class
13389 only defines placement deletes we don't do anything here. So we
13390 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13391 they ever try to delete one of these. */
13392 if (TYPE_GETS_REG_DELETE (current_class_type
)
13393 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13397 exprstmt
= build_op_delete_call
13398 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13399 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13401 if_stmt
= begin_if_stmt ();
13402 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13403 current_in_charge_parm
,
13406 finish_expr_stmt (exprstmt
);
13407 finish_then_clause (if_stmt
);
13411 /* Close the block we started above. */
13412 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13415 /* Finish up a function declaration and compile that function
13416 all the way to assembler language output. The free the storage
13417 for the function definition.
13419 This is called after parsing the body of the function definition.
13420 LINENO is the current line number.
13422 FLAGS is a bitwise or of the following values:
13424 An extra call to poplevel (and expand_end_bindings) must be
13425 made to take care of the binding contour for the base
13426 initializers. This is only relevant for constructors.
13428 We just finished processing the body of an in-class inline
13429 function definition. (This processing will have taken place
13430 after the class definition is complete.) */
13433 finish_function (lineno
, flags
)
13437 register tree fndecl
= current_function_decl
;
13438 tree fntype
, ctype
= NULL_TREE
;
13439 /* Label to use if this function is supposed to return a value. */
13440 tree no_return_label
= NULL_TREE
;
13441 int call_poplevel
= (flags
& 1) != 0;
13442 int inclass_inline
= (flags
& 2) != 0;
13446 /* When we get some parse errors, we can end up without a
13447 current_function_decl, so cope. */
13448 if (fndecl
== NULL_TREE
)
13449 return error_mark_node
;
13451 nested
= function_depth
> 1;
13452 fntype
= TREE_TYPE (fndecl
);
13454 /* TREE_READONLY (fndecl) = 1;
13455 This caused &foo to be of type ptr-to-const-function
13456 which then got a warning when stored in a ptr-to-function variable. */
13458 /* This happens on strange parse errors. */
13459 if (! current_function_parms_stored
)
13462 store_parm_decls ();
13465 if (building_stmt_tree ())
13467 if (DECL_CONSTRUCTOR_P (fndecl
))
13469 finish_constructor_body ();
13473 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13474 finish_destructor_body ();
13475 else if (DECL_MAIN_P (fndecl
))
13477 /* Make it so that `main' always returns 0 by default. */
13479 finish_return_stmt (integer_one_node
);
13481 finish_return_stmt (integer_zero_node
);
13485 /* Finish dealing with exception specifiers. */
13486 if (flag_exceptions
&& !processing_template_decl
13487 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13488 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13489 (TREE_TYPE (current_function_decl
)),
13490 current_eh_spec_try_block
);
13495 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13497 /* Keep this code around in case we later want to control debug info
13498 based on whether a type is "used". (jason 1999-11-11) */
13500 tree ttype
= target_type (fntype
);
13503 if (IS_AGGR_TYPE (ttype
))
13504 /* Let debugger know it should output info for this type. */
13505 note_debug_info_needed (ttype
);
13507 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13509 ttype
= target_type (TREE_TYPE (parmdecl
));
13510 if (IS_AGGR_TYPE (ttype
))
13511 /* Let debugger know it should output info for this type. */
13512 note_debug_info_needed (ttype
);
13517 /* Clean house because we will need to reorder insns here. */
13518 do_pending_stack_adjust ();
13522 else if (DECL_CONSTRUCTOR_P (fndecl
))
13524 /* All subobjects have been fully constructed at this point. */
13525 end_protect_partials ();
13530 else if (return_label
!= NULL_RTX
13531 && flag_this_is_variable
<= 0
13532 && current_function_return_value
== NULL_TREE
13533 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13534 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13536 if (flag_exceptions
)
13537 expand_exception_blocks ();
13539 /* If this function is supposed to return a value, ensure that
13540 we do not fall into the cleanups by mistake. The end of our
13541 function will look like this:
13543 user code (may have return stmt somewhere)
13544 goto no_return_label
13549 NOTE_INSN_FUNCTION_END
13553 If the user omits a return stmt in the USER CODE section, we
13554 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13555 Otherwise, we won't. */
13556 if (no_return_label
)
13558 DECL_CONTEXT (no_return_label
) = fndecl
;
13559 DECL_INITIAL (no_return_label
) = error_mark_node
;
13560 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13561 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13562 expand_goto (no_return_label
);
13567 /* Remove the binding contour which is used
13568 to catch cleanup-generated temporaries. */
13569 expand_end_bindings (0, 0, 0);
13570 poplevel (0, 0, 0);
13572 /* Emit label at beginning of cleanup code for parameters. */
13573 emit_label (cleanup_label
);
13576 /* Get return value into register if that's where it's supposed
13578 if (original_result_rtx
)
13579 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13581 /* Finish building code that will trigger warnings if users forget
13582 to make their functions return values. */
13583 if (no_return_label
|| cleanup_label
)
13584 emit_jump (return_label
);
13585 if (no_return_label
)
13587 /* We don't need to call `expand_*_return' here because we
13588 don't need any cleanups here--this path of code is only
13589 for error checking purposes. */
13590 expand_label (no_return_label
);
13593 /* We hard-wired immediate_size_expand to zero in
13594 start_function. Expand_function_end will decrement this
13595 variable. So, we set the variable to one here, so that after
13596 the decrement it will remain zero. */
13597 immediate_size_expand
= 1;
13599 /* Generate rtl for function exit. */
13600 expand_function_end (input_filename
, lineno
, 1);
13603 /* We have to save this value here in case
13604 maybe_end_member_template_processing decides to pop all the
13605 template parameters. */
13606 expand_p
= !building_stmt_tree ();
13608 /* If we're saving up tree structure, tie off the function now. */
13610 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13612 /* This must come after expand_function_end because cleanups might
13613 have declarations (from inline functions) that need to go into
13614 this function's blocks. */
13615 if (doing_semantic_analysis_p ())
13617 if (current_binding_level
->parm_flag
!= 1)
13618 my_friendly_abort (122);
13619 poplevel (1, 0, 1);
13622 /* Remember that we were in class scope. */
13623 if (current_class_name
)
13624 ctype
= current_class_type
;
13626 /* Must mark the RESULT_DECL as being in this function. */
13627 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13629 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13630 to the FUNCTION_DECL node itself. */
13631 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13633 /* Save away current state, if appropriate. */
13634 if (!expanding_p
&& !processing_template_decl
)
13635 save_function_data (fndecl
);
13641 int saved_flag_keep_inline_functions
=
13642 flag_keep_inline_functions
;
13644 /* So we can tell if jump_optimize sets it to 1. */
13647 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13648 && hack_decl_function_context (fndecl
))
13649 /* Trick rest_of_compilation into not deferring output of this
13650 function, even if it is inline, since the rtl_obstack for
13651 this function is the function_obstack of the enclosing
13652 function and will be deallocated when the enclosing
13653 function is gone. See save_tree_status. */
13654 flag_keep_inline_functions
= 1;
13656 /* Before we call rest_of_compilation (which will pop the
13657 CURRENT_FUNCTION), we must save these values. */
13658 returns_null
= current_function_returns_null
;
13659 returns_value
= current_function_returns_value
;
13661 /* If this is a nested function (like a template instantiation
13662 that we're compiling in the midst of compiling something
13663 else), push a new GC context. That will keep local variables
13664 on the stack from being collected while we're doing the
13665 compilation of this function. */
13666 if (function_depth
> 1)
13667 ggc_push_context ();
13669 /* Run the optimizers and output the assembler code for this
13671 if (DECL_ARTIFICIAL (fndecl
))
13673 /* Do we really *want* to inline this synthesized method? */
13675 int save_fif
= flag_inline_functions
;
13676 flag_inline_functions
= 1;
13678 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13679 will check our size. */
13680 DECL_INLINE (fndecl
) = 0;
13682 rest_of_compilation (fndecl
);
13683 flag_inline_functions
= save_fif
;
13686 rest_of_compilation (fndecl
);
13688 /* Undo the call to ggc_push_context above. */
13689 if (function_depth
> 1)
13690 ggc_pop_context ();
13692 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13694 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13696 /* Set DECL_EXTERNAL so that assemble_external will be called as
13697 necessary. We'll clear it again in finish_file. */
13698 if (! DECL_EXTERNAL (fndecl
))
13699 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13700 DECL_EXTERNAL (fndecl
) = 1;
13701 mark_inline_for_output (fndecl
);
13705 /* Keep this code around in case we later want to control debug info
13706 based on whether a type is "used". (jason 1999-11-11) */
13708 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13709 note_debug_info_needed (ctype
);
13712 returns_null
|= can_reach_end
;
13714 /* Since we don't normally go through c_expand_return for constructors,
13715 this normally gets the wrong value.
13716 Also, named return values have their return codes emitted after
13717 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13718 if (DECL_CONSTRUCTOR_P (fndecl
)
13719 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13722 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13723 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13724 else if ((warn_return_type
|| pedantic
)
13726 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13728 /* If this function returns non-void and control can drop through,
13730 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13732 /* With just -W, complain only if function returns both with
13733 and without a value. */
13734 else if (extra_warnings
&& returns_value
&& returns_null
)
13735 warning ("this function may return with or without a value");
13739 /* Clear out memory we no longer need. */
13740 free_after_parsing (current_function
);
13741 /* Since we never call rest_of_compilation, we never clear
13742 CURRENT_FUNCTION. Do so explicitly. */
13743 free_after_compilation (current_function
);
13744 current_function
= NULL
;
13747 /* If this is a in-class inline definition, we may have to pop the
13748 bindings for the template parameters that we added in
13749 maybe_begin_member_template_processing when start_function was
13751 if (inclass_inline
)
13752 maybe_end_member_template_processing ();
13754 /* Leave the scope of the class. */
13756 pop_nested_class ();
13760 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
))
13764 /* Stop pointing to the local nodes about to be freed. */
13765 /* But DECL_INITIAL must remain nonzero so we know this
13766 was an actual function definition. */
13767 DECL_INITIAL (fndecl
) = error_mark_node
;
13768 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13769 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13772 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13773 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13774 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13775 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13780 /* Let the error reporting routines know that we're outside a
13781 function. For a nested function, this value is used in
13782 pop_cp_function_context and then reset via pop_function_context. */
13783 current_function_decl
= NULL_TREE
;
13789 /* Create the FUNCTION_DECL for a function definition.
13790 DECLSPECS and DECLARATOR are the parts of the declaration;
13791 they describe the return type and the name of the function,
13792 but twisted together in a fashion that parallels the syntax of C.
13794 This function creates a binding context for the function body
13795 as well as setting up the FUNCTION_DECL in current_function_decl.
13797 Returns a FUNCTION_DECL on success.
13799 If the DECLARATOR is not suitable for a function (it defines a datum
13800 instead), we return 0, which tells yyparse to report a parse error.
13802 May return void_type_node indicating that this method is actually
13803 a friend. See grokfield for more details.
13805 Came here with a `.pushlevel' .
13807 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13808 CHANGES TO CODE IN `grokfield'. */
13811 start_method (declspecs
, declarator
, attrlist
)
13812 tree declarator
, declspecs
, attrlist
;
13814 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13817 /* Something too ugly to handle. */
13818 if (fndecl
== NULL_TREE
)
13821 /* Pass friends other than inline friend functions back. */
13822 if (fndecl
== void_type_node
)
13825 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13826 /* Not a function, tell parser to report parse error. */
13829 if (DECL_IN_AGGR_P (fndecl
))
13831 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13833 if (DECL_CONTEXT (fndecl
)
13834 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13835 cp_error ("`%D' is already defined in class %s", fndecl
,
13836 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13838 return void_type_node
;
13841 check_template_shadow (fndecl
);
13843 DECL_THIS_INLINE (fndecl
) = 1;
13845 if (flag_default_inline
)
13846 DECL_INLINE (fndecl
) = 1;
13848 /* We process method specializations in finish_struct_1. */
13849 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13850 fndecl
= push_template_decl (fndecl
);
13852 /* We read in the parameters on the maybepermanent_obstack,
13853 but we won't be getting back to them until after we
13854 may have clobbered them. So the call to preserve_data
13855 will keep them safe. */
13858 if (! DECL_FRIEND_P (fndecl
))
13860 if (TREE_CHAIN (fndecl
))
13862 fndecl
= copy_node (fndecl
);
13863 TREE_CHAIN (fndecl
) = NULL_TREE
;
13866 if (DECL_CONSTRUCTOR_P (fndecl
))
13868 if (! grok_ctor_properties (current_class_type
, fndecl
))
13869 return void_type_node
;
13871 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13872 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13875 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
13877 /* Make a place for the parms */
13879 current_binding_level
->parm_flag
= 1;
13881 DECL_IN_AGGR_P (fndecl
) = 1;
13885 /* Go through the motions of finishing a function definition.
13886 We don't compile this method until after the whole class has
13889 FINISH_METHOD must return something that looks as though it
13890 came from GROKFIELD (since we are defining a method, after all).
13892 This is called after parsing the body of the function definition.
13893 STMTS is the chain of statements that makes up the function body.
13895 DECL is the ..._DECL that `start_method' provided. */
13898 finish_method (decl
)
13901 register tree fndecl
= decl
;
13904 register tree link
;
13906 if (decl
== void_type_node
)
13909 old_initial
= DECL_INITIAL (fndecl
);
13911 /* Undo the level for the parms (from start_method).
13912 This is like poplevel, but it causes nothing to be
13913 saved. Saving information here confuses symbol-table
13914 output routines. Besides, this information will
13915 be correctly output when this method is actually
13918 /* Clear out the meanings of the local variables of this level;
13919 also record in each decl which block it belongs to. */
13921 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13923 if (DECL_NAME (link
) != NULL_TREE
)
13924 pop_binding (DECL_NAME (link
), link
);
13925 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13926 DECL_CONTEXT (link
) = NULL_TREE
;
13929 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13930 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13931 current_binding_level
->parm_flag
,
13932 current_binding_level
->keep
);
13934 poplevel (0, 0, 0);
13936 DECL_INITIAL (fndecl
) = old_initial
;
13938 /* We used to check if the context of FNDECL was different from
13939 current_class_type as another way to get inside here. This didn't work
13940 for String.cc in libg++. */
13941 if (DECL_FRIEND_P (fndecl
))
13943 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13944 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13945 decl
= void_type_node
;
13951 /* Called when a new struct TYPE is defined.
13952 If this structure or union completes the type of any previous
13953 variable declaration, lay it out and output its rtl. */
13956 hack_incomplete_structures (type
)
13961 if (current_binding_level
->incomplete
== NULL_TREE
)
13964 if (!type
) /* Don't do this for class templates. */
13967 for (list
= ¤t_binding_level
->incomplete
; *list
; )
13969 tree decl
= TREE_VALUE (*list
);
13970 if ((decl
&& TREE_TYPE (decl
) == type
)
13971 || (TREE_TYPE (decl
)
13972 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13973 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
13975 int toplevel
= toplevel_bindings_p ();
13976 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13977 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
13978 layout_type (TREE_TYPE (decl
));
13979 layout_decl (decl
, 0);
13980 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
13984 expand_decl (decl
);
13985 cleanup
= maybe_build_cleanup (decl
);
13986 expand_decl_init (decl
);
13987 if (! expand_decl_cleanup (decl
, cleanup
))
13988 cp_error ("parser lost in parsing declaration of `%D'",
13991 *list
= TREE_CHAIN (*list
);
13994 list
= &TREE_CHAIN (*list
);
13998 /* If DECL is of a type which needs a cleanup, build that cleanup here.
13999 See build_delete for information about AUTO_DELETE.
14001 Don't build these on the momentary obstack; they must live
14002 the life of the binding contour. */
14005 maybe_build_cleanup_1 (decl
, auto_delete
)
14006 tree decl
, auto_delete
;
14008 tree type
= TREE_TYPE (decl
);
14009 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14011 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14014 if (TREE_CODE (type
) == ARRAY_TYPE
)
14018 mark_addressable (decl
);
14019 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14022 /* Optimize for space over speed here. */
14023 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14024 || flag_expensive_optimizations
)
14025 flags
|= LOOKUP_NONVIRTUAL
;
14027 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14029 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14030 && ! TYPE_HAS_DESTRUCTOR (type
))
14031 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14032 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14039 /* If DECL is of a type which needs a cleanup, build that cleanup
14040 here. The cleanup does free the storage with a call to delete. */
14043 maybe_build_cleanup_and_delete (decl
)
14046 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14049 /* If DECL is of a type which needs a cleanup, build that cleanup
14050 here. The cleanup does not free the storage with a call a delete. */
14053 maybe_build_cleanup (decl
)
14056 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14059 /* Expand a C++ expression at the statement level.
14060 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14061 The C++ type checker should get all of these out when
14062 expressions are combined with other, type-providing, expressions,
14063 leaving only orphan expressions, such as:
14065 &class::bar; / / takes its address, but does nothing with it. */
14068 cplus_expand_expr_stmt (exp
)
14071 if (stmts_are_full_exprs_p
)
14072 exp
= convert_to_void (exp
, "statement");
14075 /* We should do this eventually, but right now this causes regex.o from
14076 libg++ to miscompile, and tString to core dump. */
14077 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14080 /* If we don't do this, we end up down inside expand_expr
14081 trying to do TYPE_MODE on the ERROR_MARK, and really
14082 go outside the bounds of the type. */
14083 if (exp
!= error_mark_node
)
14084 expand_expr_stmt (exp
);
14087 /* When a stmt has been parsed, this function is called. */
14092 /* Always assume this statement was not an expression statement. If
14093 it actually was an expression statement, its our callers
14094 responsibility to fix this up. */
14095 last_expr_type
= NULL_TREE
;
14098 /* Change a static member function definition into a FUNCTION_TYPE, instead
14099 of the METHOD_TYPE that we create when it's originally parsed.
14101 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14102 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14103 other decls. Either pass the addresses of local variables or NULL. */
14106 revert_static_member_fn (decl
, fn
, argtypes
)
14107 tree
*decl
, *fn
, *argtypes
;
14110 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14111 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14113 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14114 != TYPE_UNQUALIFIED
)
14115 cp_error ("static member function `%#D' declared with type qualifiers",
14118 args
= TREE_CHAIN (args
);
14119 tmp
= build_function_type (TREE_TYPE (function
), args
);
14120 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14121 tmp
= build_exception_variant (tmp
,
14122 TYPE_RAISES_EXCEPTIONS (function
));
14123 TREE_TYPE (*decl
) = tmp
;
14124 if (DECL_ARGUMENTS (*decl
))
14125 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14126 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14133 /* Initialize the variables used during compilation of a C++
14137 push_cp_function_context (f
)
14138 struct function
*f
;
14140 struct language_function
*p
14141 = ((struct language_function
*)
14142 xcalloc (1, sizeof (struct language_function
)));
14145 /* It takes an explicit call to expand_body to generate RTL for a
14149 /* Whenever we start a new function, we destroy temporaries in the
14151 stmts_are_full_exprs_p
= 1;
14154 /* Free the language-specific parts of F, now that we've finished
14155 compiling the function. */
14158 pop_cp_function_context (f
)
14159 struct function
*f
;
14162 free (f
->language
);
14166 /* Mark P for GC. */
14169 mark_lang_function (p
)
14170 struct language_function
*p
;
14175 ggc_mark_tree (p
->x_named_labels
);
14176 ggc_mark_tree (p
->x_ctor_label
);
14177 ggc_mark_tree (p
->x_dtor_label
);
14178 ggc_mark_tree (p
->x_base_init_list
);
14179 ggc_mark_tree (p
->x_member_init_list
);
14180 ggc_mark_tree (p
->x_current_class_ptr
);
14181 ggc_mark_tree (p
->x_current_class_ref
);
14182 ggc_mark_tree (p
->x_eh_spec_try_block
);
14183 ggc_mark_tree (p
->x_scope_stmt_stack
);
14185 ggc_mark_rtx (p
->x_result_rtx
);
14187 mark_stmt_tree (&p
->x_stmt_tree
);
14188 mark_binding_level (&p
->bindings
);
14191 /* Mark the language-specific data in F for GC. */
14194 mark_cp_function_context (f
)
14195 struct function
*f
;
14197 mark_lang_function (f
->language
);
14203 return function_depth
!= 0;
14208 lang_mark_false_label_stack (l
)
14209 struct label_node
*l
;
14211 /* C++ doesn't use false_label_stack. It better be NULL. */
14212 my_friendly_assert (l
== NULL
, 19990904);
14219 enum tree_code code
= TREE_CODE (t
);
14220 if (code
== IDENTIFIER_NODE
)
14222 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14223 struct lang_id2
*li2
= li
->x
;
14224 ggc_mark_tree (li
->namespace_bindings
);
14225 ggc_mark_tree (li
->bindings
);
14226 ggc_mark_tree (li
->class_value
);
14227 ggc_mark_tree (li
->class_template_info
);
14231 ggc_mark_tree (li2
->label_value
);
14232 ggc_mark_tree (li2
->implicit_decl
);
14233 ggc_mark_tree (li2
->error_locus
);
14236 else if (code
== CPLUS_BINDING
)
14238 if (BINDING_HAS_LEVEL_P (t
))
14239 mark_binding_level (&BINDING_LEVEL (t
));
14241 ggc_mark_tree (BINDING_SCOPE (t
));
14242 ggc_mark_tree (BINDING_VALUE (t
));
14244 else if (code
== OVERLOAD
)
14245 ggc_mark_tree (OVL_FUNCTION (t
));
14246 else if (code
== TEMPLATE_PARM_INDEX
)
14247 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14248 else if (TREE_CODE_CLASS (code
) == 'd')
14250 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14255 if (!DECL_GLOBAL_CTOR_P (t
) && !DECL_GLOBAL_DTOR_P (t
))
14256 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14257 ggc_mark_tree (ld
->decl_flags
.context
);
14258 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14259 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14261 mark_binding_level (&NAMESPACE_LEVEL (t
));
14262 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14264 ggc_mark_tree (ld
->main_decl_variant
);
14265 ggc_mark_tree (ld
->befriending_classes
);
14266 ggc_mark_tree (ld
->saved_tree
);
14267 if (TREE_CODE (t
) == TYPE_DECL
)
14268 ggc_mark_tree (ld
->u
.sorted_fields
);
14269 else if (TREE_CODE (t
) == FUNCTION_DECL
14270 && !DECL_PENDING_INLINE_P (t
))
14271 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14275 else if (TREE_CODE_CLASS (code
) == 't')
14277 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14279 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14280 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14283 ggc_mark_tree (lt
->vfields
);
14284 ggc_mark_tree (lt
->vbases
);
14285 ggc_mark_tree (lt
->tags
);
14286 ggc_mark_tree (lt
->search_slot
);
14287 ggc_mark_tree (lt
->size
);
14288 ggc_mark_tree (lt
->abstract_virtuals
);
14289 ggc_mark_tree (lt
->friend_classes
);
14290 ggc_mark_tree (lt
->rtti
);
14291 ggc_mark_tree (lt
->methods
);
14292 ggc_mark_tree (lt
->template_info
);
14293 ggc_mark_tree (lt
->befriending_classes
);
14296 /* In the case of pointer-to-member function types, the
14297 TYPE_LANG_SPECIFIC is really just a tree. */
14298 ggc_mark_tree ((tree
) lt
);