1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
49 #define obstack_chunk_alloc xmalloc
50 #define obstack_chunk_free free
52 extern struct obstack permanent_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) PARAMS ((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 /* In the new ABI, `bool' has size and alignment `1', on all
78 #define BOOL_TYPE_SIZE \
79 ((SLOW_BYTE_ACCESS && !flag_new_abi) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
81 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
85 /* We let tm.h override the types used here, to handle trivial differences
86 such as the choice of unsigned int or long unsigned int for size_t.
87 When machines start needing nontrivial differences in the size type,
88 it would be best to do something here to figure out automatically
89 from other information what type to use. */
92 #define SIZE_TYPE "long unsigned int"
96 #define PTRDIFF_TYPE "long int"
100 #define WCHAR_TYPE "int"
103 static tree grokparms PARAMS ((tree, int));
104 static const char *redeclaration_error_message PARAMS ((tree, tree));
106 static void push_binding_level PARAMS ((struct binding_level *, int,
108 static void pop_binding_level PARAMS ((void));
109 static void suspend_binding_level PARAMS ((void));
110 static void resume_binding_level PARAMS ((struct binding_level *));
111 static struct binding_level *make_binding_level PARAMS ((void));
112 static void declare_namespace_level PARAMS ((void));
113 static void signal_catch PARAMS ((int)) ATTRIBUTE_NORETURN;
114 static void storedecls PARAMS ((tree));
115 static void require_complete_types_for_parms PARAMS ((tree));
116 static int ambi_op_p PARAMS ((tree));
117 static int unary_op_p PARAMS ((tree));
118 static tree store_bindings PARAMS ((tree, tree));
119 static tree lookup_tag_reverse PARAMS ((tree, tree));
120 static tree obscure_complex_init PARAMS ((tree, tree));
121 static tree maybe_build_cleanup_1 PARAMS ((tree, tree));
122 static tree lookup_name_real PARAMS ((tree, int, int, int));
123 static void warn_extern_redeclared_static PARAMS ((tree, tree));
124 static void grok_reference_init PARAMS ((tree, tree, tree));
125 static tree grokfndecl PARAMS ((tree, tree, tree, tree, int,
126 enum overload_flags, tree,
127 tree, int, int, int, int, int, int, tree));
128 static tree grokvardecl PARAMS ((tree, tree, RID_BIT_TYPE *, int, int, tree));
129 static tree lookup_tag PARAMS ((enum tree_code, tree,
130 struct binding_level *, int));
131 static void set_identifier_type_value_with_scope
132 PARAMS ((tree, tree, struct binding_level *));
133 static void record_builtin_type PARAMS ((enum rid, const char *, tree));
134 static void record_unknown_type PARAMS ((tree, const char *));
135 static tree build_library_fn_1 PARAMS ((tree, tree));
136 static int member_function_or_else PARAMS ((tree, tree, enum overload_flags));
137 static void bad_specifiers PARAMS ((tree, const char *, int, int, int, int,
139 static void lang_print_error_function PARAMS ((const char *));
140 static tree maybe_process_template_type_declaration PARAMS ((tree, int, struct binding_level*));
141 static void check_for_uninitialized_const_var PARAMS ((tree));
142 static unsigned long typename_hash PARAMS ((hash_table_key));
143 static boolean typename_compare PARAMS ((hash_table_key, hash_table_key));
144 static void push_binding PARAMS ((tree, tree, struct binding_level*));
145 static int add_binding PARAMS ((tree, tree));
146 static void pop_binding PARAMS ((tree, tree));
147 static tree local_variable_p_walkfn PARAMS ((tree *, int *, void *));
148 static tree find_binding PARAMS ((tree, tree));
149 static tree select_decl PARAMS ((tree, int));
150 static int lookup_flags PARAMS ((int, int));
151 static tree qualify_lookup PARAMS ((tree, int));
152 static tree record_builtin_java_type PARAMS ((const char *, int));
153 static const char *tag_name PARAMS ((enum tag_types code));
154 static void find_class_binding_level PARAMS ((void));
155 static struct binding_level *innermost_nonclass_level PARAMS ((void));
156 static void warn_about_implicit_typename_lookup PARAMS ((tree, tree));
157 static int walk_namespaces_r PARAMS ((tree, walk_namespaces_fn, void *));
158 static int walk_globals_r PARAMS ((tree, void *));
159 static void add_decl_to_level PARAMS ((tree, struct binding_level *));
160 static tree make_label_decl PARAMS ((tree, int));
161 static void pop_label PARAMS ((tree));
162 static void pop_labels PARAMS ((tree));
163 static void maybe_deduce_size_from_array_init PARAMS ((tree, tree));
164 static void layout_var_decl PARAMS ((tree));
165 static void maybe_commonize_var PARAMS ((tree));
166 static tree check_initializer PARAMS ((tree, tree));
167 static void make_rtl_for_nonlocal_decl PARAMS ((tree, tree, const char *));
168 static void push_cp_function_context PARAMS ((struct function *));
169 static void pop_cp_function_context PARAMS ((struct function *));
170 static void mark_binding_level PARAMS ((void *));
171 static void mark_cp_function_context PARAMS ((struct function *));
172 static void mark_saved_scope PARAMS ((void *));
173 static void mark_lang_function PARAMS ((struct language_function *));
174 static void mark_stmt_tree PARAMS ((struct stmt_tree *));
175 static void save_function_data PARAMS ((tree));
176 static void check_function_type PARAMS ((tree));
177 static void destroy_local_var PARAMS ((tree));
178 static void finish_constructor_body PARAMS ((void));
179 static void finish_destructor_body PARAMS ((void));
180 static tree create_array_type_for_decl PARAMS ((tree, tree, tree));
181 static tree get_atexit_node PARAMS ((void));
182 static tree get_dso_handle_node PARAMS ((void));
183 static tree start_cleanup_fn PARAMS ((void));
184 static void end_cleanup_fn PARAMS ((void));
185 static tree cp_make_fname_decl PARAMS ((tree, const char *, int));
187 #if defined (DEBUG_CP_BINDING_LEVELS)
188 static void indent PARAMS ((void));
191 /* Erroneous argument lists can use this *IFF* they do not modify it. */
192 tree error_mark_list;
194 /* The following symbols are subsumed in the cp_global_trees array, and
195 listed here individually for documentation purposes.
198 tree wchar_decl_node;
201 tree vtable_entry_type;
202 tree delta_type_node;
205 tree __baselist_desc_type_node;
206 tree __i_desc_type_node, __m_desc_type_node;
207 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
209 tree __t_desc_type_node;
211 tree __tp_desc_type_node;
213 tree ti_desc_type_node;
214 tree bltn_desc_type_node, ptr_desc_type_node, ref_desc_type_node;
215 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
216 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
217 tree ptmd_desc_type_node;
218 tree base_desc_type_node;
220 Not needed yet? May be needed one day?
221 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
222 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
223 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
226 tree class_type_node, record_type_node, union_type_node, enum_type_node;
227 tree unknown_type_node;
229 Array type `vtable_entry_type[]'
232 tree vtbl_ptr_type_node;
238 A FUNCTION_DECL which can call `abort'. Not necessarily the
239 one that the user will declare, but sufficient to be called
240 by routines that want to abort the program.
244 The FUNCTION_DECL for the default `::operator delete'.
246 tree global_delete_fndecl;
249 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
254 tree cp_global_trees[CPTI_MAX];
256 /* Indicates that there is a type value in some namespace, although
257 that is not necessarily in scope at the moment. */
259 static tree global_type_node;
264 /* Expect only namespace names now. */
265 static int only_namespace_names;
267 /* If original DECL_RESULT of current function was a register,
268 but due to being an addressable named return value, would up
269 on the stack, this variable holds the named return value's
270 original location. */
272 #define original_result_rtx cp_function_chain->x_result_rtx
274 struct named_label_list
276 struct binding_level *binding_level;
279 const char *filename_o_goto;
281 struct named_label_list *next;
284 /* Used only for jumps to as-yet undefined labels, since jumps to
285 defined labels can have their validity checked by stmt.c. */
287 #define named_label_uses cp_function_chain->x_named_label_uses
289 /* A list of objects which have constructors or destructors
290 which reside in the global scope. The decl is stored in
291 the TREE_VALUE slot and the initializer is stored
292 in the TREE_PURPOSE slot. */
293 tree static_aggregates;
297 /* A node for the integer constants 2, and 3. */
299 tree integer_two_node, integer_three_node;
301 /* Parsing a function declarator leaves here a chain of structure
302 and enum types declared in the parmlist. */
304 static tree last_function_parm_tags;
306 /* Similar, for last_function_parm_tags. */
307 tree last_function_parms;
308 static tree current_function_parm_tags;
310 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
311 that have names. Here so we can clear out their names' definitions
312 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
313 TREE_PURPOSE is the previous binding of the label. */
315 #define named_labels cp_function_chain->x_named_labels
317 /* Set to 0 at beginning of a function definition, and whenever
318 a label (case or named) is defined. Set to value of expression
319 returned from function when that value can be transformed into
320 a named return value. */
322 tree current_function_return_value;
324 /* Nonzero means use the ISO C99 dialect of C. */
328 /* Nonzero means give `double' the same size as `float'. */
330 extern int flag_short_double;
332 /* Nonzero means don't recognize any builtin functions. */
334 extern int flag_no_builtin;
336 /* Nonzero means don't recognize the non-ANSI builtin functions.
339 extern int flag_no_nonansi_builtin;
341 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
343 extern int flag_huge_objects;
345 /* Nonzero if we want to conserve space in the .o files. We do this
346 by putting uninitialized data and runtime initialized data into
347 .common instead of .data at the expense of not flagging multiple
349 extern int flag_conserve_space;
351 /* C and C++ flags are in decl2.c. */
353 /* Flag used when debugging spew.c */
355 extern int spew_debug;
357 /* A expression of value 0 with the same precision as a sizetype
359 tree signed_size_zero_node;
361 /* The name of the anonymous namespace, throughout this translation
363 tree anonymous_namespace_name;
366 /* For each binding contour we allocate a binding_level structure
367 which records the names defined in that contour.
370 1) one for each function definition,
371 where internal declarations of the parameters appear.
372 2) one for each compound statement,
373 to record its declarations.
375 The current meaning of a name can be found by searching the levels
376 from the current one out to the global one.
378 Off to the side, may be the class_binding_level. This exists only
379 to catch class-local declarations. It is otherwise nonexistent.
381 Also there may be binding levels that catch cleanups that must be
382 run when exceptions occur. Thus, to see whether a name is bound in
383 the current scope, it is not enough to look in the
384 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
387 /* Note that the information in the `names' component of the global contour
388 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
392 /* A chain of _DECL nodes for all variables, constants, functions,
393 and typedef types. These are in the reverse of the order
394 supplied. There may be OVERLOADs on this list, too, but they
395 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
398 /* A list of structure, union and enum definitions, for looking up
400 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
401 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
402 or ENUMERAL_TYPE node.
404 C++: the TREE_VALUE nodes can be simple types for
405 component_bindings. */
408 /* A list of USING_DECL nodes. */
411 /* A list of used namespaces. PURPOSE is the namespace,
412 VALUE the common ancestor with this binding_level's namespace. */
413 tree using_directives;
415 /* If this binding level is the binding level for a class, then
416 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
417 is the name of an entity bound in the class; the TREE_VALUE is
418 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
419 when leaving class scope, we can restore the
420 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
421 the DECL bound by this name in the class. */
424 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
425 is used for all binding levels. */
428 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
429 label in this scope. The TREE_PURPOSE is the previous value of
430 the IDENTIFIER_LABEL VALUE. */
431 tree shadowed_labels;
433 /* For each level (except not the global one),
434 a chain of BLOCK nodes for all the levels
435 that were entered and exited one level down. */
438 /* The BLOCK node for this level, if one has been preallocated.
439 If 0, the BLOCK is allocated (if needed) when the level is popped. */
442 /* The _TYPE node for this level, if parm_flag == 2. */
445 /* The binding level which this one is contained in (inherits from). */
446 struct binding_level *level_chain;
448 /* List of decls in `names' that have incomplete
449 structure or union types. */
452 /* List of VAR_DECLS saved from a previous for statement.
453 These would be dead in ISO-conforming code, but might
454 be referenced in ARM-era code. These are stored in a
455 TREE_LIST; the TREE_VALUE is the actual declaration. */
456 tree dead_vars_from_for;
458 /* 1 for the level that holds the parameters of a function.
459 2 for the level that holds a class declaration. */
460 unsigned parm_flag : 2;
462 /* 1 means make a BLOCK for this level regardless of all else.
463 2 for temporary binding contours created by the compiler. */
466 /* Nonzero if this level "doesn't exist" for tags. */
467 unsigned tag_transparent : 1;
469 /* Nonzero if this level can safely have additional
470 cleanup-needing variables added to it. */
471 unsigned more_cleanups_ok : 1;
472 unsigned have_cleanups : 1;
474 /* Nonzero if this scope is for storing the decls for template
475 parameters and generic decls; these decls will be discarded and
476 replaced with a TEMPLATE_DECL. */
477 unsigned template_parms_p : 1;
479 /* Nonzero if this scope corresponds to the `<>' in a
480 `template <>' clause. Whenever this flag is set,
481 TEMPLATE_PARMS_P will be set as well. */
482 unsigned template_spec_p : 1;
484 /* This is set for a namespace binding level. */
485 unsigned namespace_p : 1;
487 /* True if this level is that of a for-statement where we need to
488 worry about ambiguous (ARM or ISO) scope rules. */
489 unsigned is_for_scope : 1;
491 /* True if this level corresponds to an EH region, as for a try block. */
492 unsigned eh_region : 1;
494 /* Four bits left for this word. */
496 #if defined(DEBUG_CP_BINDING_LEVELS)
497 /* Binding depth at which this level began. */
498 unsigned binding_depth;
499 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
502 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
504 /* The binding level currently in effect. */
506 #define current_binding_level \
508 ? cp_function_chain->bindings \
509 : scope_chain->bindings)
511 /* The binding level of the current class, if any. */
513 #define class_binding_level scope_chain->class_bindings
515 /* A chain of binding_level structures awaiting reuse. */
517 static struct binding_level *free_binding_level;
519 /* The outermost binding level, for names of file scope.
520 This is created when the compiler is started and exists
521 through the entire run. */
523 static struct binding_level *global_binding_level;
525 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
527 static int keep_next_level_flag;
529 #if defined(DEBUG_CP_BINDING_LEVELS)
530 static int binding_depth = 0;
531 static int is_class_level = 0;
538 for (i = 0; i < binding_depth*2; i++)
541 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
543 static tree pushdecl_with_scope PARAMS ((tree, struct binding_level *));
546 push_binding_level (newlevel, tag_transparent, keep)
547 struct binding_level *newlevel;
548 int tag_transparent, keep;
550 /* Add this level to the front of the chain (stack) of levels that
552 bzero ((char*) newlevel, sizeof (struct binding_level));
553 newlevel->level_chain = current_binding_level;
554 current_binding_level = newlevel;
555 newlevel->tag_transparent = tag_transparent;
556 newlevel->more_cleanups_ok = 1;
558 /* We are called before expand_start_bindings, but after
559 expand_eh_region_start for a try block; so we check this now,
560 before the EH block is covered up. */
561 newlevel->eh_region = is_eh_region ();
563 newlevel->keep = keep;
564 #if defined(DEBUG_CP_BINDING_LEVELS)
565 newlevel->binding_depth = binding_depth;
567 fprintf (stderr, "push %s level 0x%08x line %d\n",
568 (is_class_level) ? "class" : "block", newlevel, lineno);
571 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
574 /* Find the innermost enclosing class scope, and reset
575 CLASS_BINDING_LEVEL appropriately. */
578 find_class_binding_level ()
580 struct binding_level *level = current_binding_level;
582 while (level && level->parm_flag != 2)
583 level = level->level_chain;
584 if (level && level->parm_flag == 2)
585 class_binding_level = level;
587 class_binding_level = 0;
593 if (global_binding_level)
595 /* Cannot pop a level, if there are none left to pop. */
596 if (current_binding_level == global_binding_level)
597 my_friendly_abort (123);
599 /* Pop the current level, and free the structure for reuse. */
600 #if defined(DEBUG_CP_BINDING_LEVELS)
603 fprintf (stderr, "pop %s level 0x%08x line %d\n",
604 (is_class_level) ? "class" : "block",
605 current_binding_level, lineno);
606 if (is_class_level != (current_binding_level == class_binding_level))
609 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
612 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
614 register struct binding_level *level = current_binding_level;
615 current_binding_level = current_binding_level->level_chain;
616 level->level_chain = free_binding_level;
617 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
618 if (level->binding_depth != binding_depth)
620 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
621 free_binding_level = level;
622 find_class_binding_level ();
627 suspend_binding_level ()
629 if (class_binding_level)
630 current_binding_level = class_binding_level;
632 if (global_binding_level)
634 /* Cannot suspend a level, if there are none left to suspend. */
635 if (current_binding_level == global_binding_level)
636 my_friendly_abort (123);
638 /* Suspend the current level. */
639 #if defined(DEBUG_CP_BINDING_LEVELS)
642 fprintf (stderr, "suspend %s level 0x%08x line %d\n",
643 (is_class_level) ? "class" : "block",
644 current_binding_level, lineno);
645 if (is_class_level != (current_binding_level == class_binding_level))
648 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
651 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
652 current_binding_level = current_binding_level->level_chain;
653 find_class_binding_level ();
657 resume_binding_level (b)
658 struct binding_level *b;
660 /* Resuming binding levels is meant only for namespaces,
661 and those cannot nest into classes. */
662 my_friendly_assert(!class_binding_level, 386);
663 /* Also, resuming a non-directly nested namespace is a no-no. */
664 my_friendly_assert(b->level_chain == current_binding_level, 386);
665 current_binding_level = b;
666 #if defined(DEBUG_CP_BINDING_LEVELS)
667 b->binding_depth = binding_depth;
669 fprintf (stderr, "resume %s level 0x%08x line %d\n",
670 (is_class_level) ? "class" : "block", b, lineno);
673 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
676 /* Create a new `struct binding_level'. */
679 struct binding_level *
680 make_binding_level ()
683 return (struct binding_level *) xmalloc (sizeof (struct binding_level));
686 /* Nonzero if we are currently in the global binding level. */
691 return current_binding_level == global_binding_level;
694 /* Return the innermost binding level that is not for a class scope. */
696 static struct binding_level *
697 innermost_nonclass_level ()
699 struct binding_level *b;
701 b = current_binding_level;
702 while (b->parm_flag == 2)
708 /* Nonzero if we are currently in a toplevel binding level. This
709 means either the global binding level or a namespace in a toplevel
710 binding level. Since there are no non-toplevel namespace levels,
711 this really means any namespace or template parameter level. We
712 also include a class whose context is toplevel. */
715 toplevel_bindings_p ()
717 struct binding_level *b = innermost_nonclass_level ();
719 return b->namespace_p || b->template_parms_p;
722 /* Nonzero if this is a namespace scope, or if we are defining a class
723 which is itself at namespace scope, or whose enclosing class is
724 such a class, etc. */
727 namespace_bindings_p ()
729 struct binding_level *b = innermost_nonclass_level ();
731 return b->namespace_p;
734 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
735 unconditionally. Otherwise, use the normal logic to decide whether
736 or not to create a BLOCK. */
739 keep_next_level (keep)
742 keep_next_level_flag = keep;
745 /* Nonzero if the current level needs to have a BLOCK made. */
750 return (current_binding_level->blocks != NULL_TREE
751 || current_binding_level->keep
752 || current_binding_level->names != NULL_TREE
753 || (current_binding_level->tags != NULL_TREE
754 && !current_binding_level->tag_transparent));
758 declare_namespace_level ()
760 current_binding_level->namespace_p = 1;
763 /* Returns non-zero if this scope was created to store template
767 template_parm_scope_p ()
769 return current_binding_level->template_parms_p;
772 /* Returns the kind of template specialization we are currently
773 processing, given that it's declaration contained N_CLASS_SCOPES
774 explicit scope qualifications. */
777 current_tmpl_spec_kind (n_class_scopes)
780 int n_template_parm_scopes = 0;
781 int seen_specialization_p = 0;
782 int innermost_specialization_p = 0;
783 struct binding_level *b;
785 /* Scan through the template parameter scopes. */
786 for (b = current_binding_level; b->template_parms_p; b = b->level_chain)
788 /* If we see a specialization scope inside a parameter scope,
789 then something is wrong. That corresponds to a declaration
792 template <class T> template <> ...
794 which is always illegal since [temp.expl.spec] forbids the
795 specialization of a class member template if the enclosing
796 class templates are not explicitly specialized as well. */
797 if (b->template_spec_p)
799 if (n_template_parm_scopes == 0)
800 innermost_specialization_p = 1;
802 seen_specialization_p = 1;
804 else if (seen_specialization_p == 1)
805 return tsk_invalid_member_spec;
807 ++n_template_parm_scopes;
810 /* Handle explicit instantiations. */
811 if (processing_explicit_instantiation)
813 if (n_template_parm_scopes != 0)
814 /* We've seen a template parameter list during an explicit
815 instantiation. For example:
817 template <class T> template void f(int);
819 This is erroneous. */
820 return tsk_invalid_expl_inst;
822 return tsk_expl_inst;
825 if (n_template_parm_scopes < n_class_scopes)
826 /* We've not seen enough template headers to match all the
827 specialized classes present. For example:
829 template <class T> void R<T>::S<T>::f(int);
831 This is illegal; there needs to be one set of template
832 parameters for each class. */
833 return tsk_insufficient_parms;
834 else if (n_template_parm_scopes == n_class_scopes)
835 /* We're processing a non-template declaration (even though it may
836 be a member of a template class.) For example:
838 template <class T> void S<T>::f(int);
840 The `class T' maches the `S<T>', leaving no template headers
841 corresponding to the `f'. */
843 else if (n_template_parm_scopes > n_class_scopes + 1)
844 /* We've got too many template headers. For example:
846 template <> template <class T> void f (T);
848 There need to be more enclosing classes. */
849 return tsk_excessive_parms;
851 /* This must be a template. It's of the form:
853 template <class T> template <class U> void S<T>::f(U);
855 This is a specialization if the innermost level was a
856 specialization; otherwise it's just a definition of the
858 return innermost_specialization_p ? tsk_expl_spec : tsk_template;
862 set_class_shadows (shadows)
865 class_binding_level->class_shadowed = shadows;
868 /* Enter a new binding level.
869 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
870 not for that of tags. */
873 pushlevel (tag_transparent)
876 struct binding_level *newlevel;
878 if (cfun && !doing_semantic_analysis_p ())
881 /* Reuse or create a struct for this binding level. */
882 #if defined(DEBUG_CP_BINDING_LEVELS)
884 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
885 if (free_binding_level)
886 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
888 newlevel = free_binding_level;
889 free_binding_level = free_binding_level->level_chain;
892 newlevel = make_binding_level ();
894 push_binding_level (newlevel, tag_transparent, keep_next_level_flag);
895 GNU_xref_start_scope ((HOST_WIDE_INT) newlevel);
896 keep_next_level_flag = 0;
899 /* Enter a new scope. The KIND indicates what kind of scope is being
910 case sk_template_spec:
911 current_binding_level->template_spec_p = 1;
914 case sk_template_parms:
915 current_binding_level->template_parms_p = 1;
919 my_friendly_abort (20000309);
923 /* Exit the current scope. */
932 note_level_for_for ()
934 current_binding_level->is_for_scope = 1;
937 /* For a binding between a name and an entity at a block scope,
938 this is the `struct binding_level' for the block. */
939 #define BINDING_LEVEL(NODE) \
940 (((struct tree_binding*)NODE)->scope.level)
942 /* Make DECL the innermost binding for ID. The LEVEL is the binding
943 level at which this declaration is being bound. */
946 push_binding (id, decl, level)
949 struct binding_level* level;
953 binding = make_node (CPLUS_BINDING);
955 /* Now, fill in the binding information. */
956 BINDING_VALUE (binding) = decl;
957 BINDING_TYPE (binding) = NULL_TREE;
958 BINDING_LEVEL (binding) = level;
959 INHERITED_VALUE_BINDING_P (binding) = 0;
960 LOCAL_BINDING_P (binding) = (level != class_binding_level);
961 BINDING_HAS_LEVEL_P (binding) = 1;
963 /* And put it on the front of the list of bindings for ID. */
964 TREE_CHAIN (binding) = IDENTIFIER_BINDING (id);
965 IDENTIFIER_BINDING (id) = binding;
968 /* ID is already bound in the current scope. But, DECL is an
969 additional binding for ID in the same scope. This is the `struct
970 stat' hack whereby a non-typedef class-name or enum-name can be
971 bound at the same level as some other kind of entity. It's the
972 responsibility of the caller to check that inserting this name is
973 legal here. Returns nonzero if the new binding was successful. */
975 add_binding (id, decl)
979 tree binding = IDENTIFIER_BINDING (id);
982 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
983 /* The new name is the type name. */
984 BINDING_TYPE (binding) = decl;
985 else if (!BINDING_VALUE (binding))
986 /* This situation arises when push_class_level_binding moves an
987 inherited type-binding out of the way to make room for a new
989 BINDING_VALUE (binding) = decl;
990 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
991 && DECL_ARTIFICIAL (BINDING_VALUE (binding)))
993 /* The old binding was a type name. It was placed in
994 BINDING_VALUE because it was thought, at the point it was
995 declared, to be the only entity with such a name. Move the
996 type name into the type slot; it is now hidden by the new
998 BINDING_TYPE (binding) = BINDING_VALUE (binding);
999 BINDING_VALUE (binding) = decl;
1000 INHERITED_VALUE_BINDING_P (binding) = 0;
1002 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
1003 && TREE_CODE (decl) == TYPE_DECL
1004 && DECL_NAME (decl) == DECL_NAME (BINDING_VALUE (binding))
1005 && same_type_p (TREE_TYPE (decl),
1006 TREE_TYPE (BINDING_VALUE (binding))))
1007 /* We have two typedef-names, both naming the same type to have
1008 the same name. This is OK because of:
1012 In a given scope, a typedef specifier can be used to redefine
1013 the name of any type declared in that scope to refer to the
1014 type to which it already refers. */
1018 cp_error ("declaration of `%#D'", decl);
1019 cp_error_at ("conflicts with previous declaration `%#D'",
1020 BINDING_VALUE (binding));
1027 /* Add DECL to the list of things declared in B. */
1030 add_decl_to_level (decl, b)
1032 struct binding_level *b;
1034 /* We build up the list in reverse order, and reverse it later if
1036 TREE_CHAIN (decl) = b->names;
1040 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1041 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1042 doesn't really belong to this binding level, that it got here
1043 through a using-declaration. */
1046 push_local_binding (id, decl, flags)
1051 struct binding_level *b;
1053 /* Skip over any local classes. This makes sense if we call
1054 push_local_binding with a friend decl of a local class. */
1055 b = current_binding_level;
1056 while (b->parm_flag == 2)
1059 if (lookup_name_current_level (id))
1061 /* Supplement the existing binding. */
1062 if (!add_binding (id, decl))
1063 /* It didn't work. Something else must be bound at this
1064 level. Do not add DECL to the list of things to pop
1069 /* Create a new binding. */
1070 push_binding (id, decl, b);
1072 if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
1073 /* We must put the OVERLOAD into a TREE_LIST since the
1074 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1075 decls that got here through a using-declaration. */
1076 decl = build_tree_list (NULL_TREE, decl);
1078 /* And put DECL on the list of things declared by the current
1080 add_decl_to_level (decl, b);
1083 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1084 binding was successful. */
1087 push_class_binding (id, decl)
1092 tree binding = IDENTIFIER_BINDING (id);
1095 /* Note that we declared this value so that we can issue an error if
1096 this an illegal redeclaration of a name already used for some
1098 note_name_declared_in_class (id, decl);
1100 if (binding && BINDING_LEVEL (binding) == class_binding_level)
1101 /* Supplement the existing binding. */
1102 result = add_binding (id, decl);
1104 /* Create a new binding. */
1105 push_binding (id, decl, class_binding_level);
1107 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1108 class-level declaration. Note that we do not use DECL here
1109 because of the possibility of the `struct stat' hack; if DECL is
1110 a class-name or enum-name we might prefer a field-name, or some
1112 IDENTIFIER_CLASS_VALUE (id) = BINDING_VALUE (IDENTIFIER_BINDING (id));
1114 /* If this is a binding from a base class, mark it as such. */
1115 binding = IDENTIFIER_BINDING (id);
1116 if (BINDING_VALUE (binding) == decl && TREE_CODE (decl) != TREE_LIST)
1118 /* Any implicit typename must be from a base-class. The
1119 context for an implicit typename declaration is always
1120 the derived class in which the lookup was done, so the checks
1121 based on the context of DECL below will not trigger. */
1122 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl))
1123 INHERITED_VALUE_BINDING_P (binding) = 1;
1126 if (TREE_CODE (decl) == OVERLOAD)
1127 context = CP_DECL_CONTEXT (OVL_CURRENT (decl));
1130 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd',
1132 context = CP_DECL_CONTEXT (decl);
1135 if (is_properly_derived_from (current_class_type, context))
1136 INHERITED_VALUE_BINDING_P (binding) = 1;
1138 INHERITED_VALUE_BINDING_P (binding) = 0;
1141 else if (BINDING_VALUE (binding) == decl)
1142 /* We only encounter a TREE_LIST when push_class_decls detects an
1143 ambiguity. Such an ambiguity can be overridden by a definition
1145 INHERITED_VALUE_BINDING_P (binding) = 1;
1150 /* Remove the binding for DECL which should be the innermost binding
1154 pop_binding (id, decl)
1160 if (id == NULL_TREE)
1161 /* It's easiest to write the loops that call this function without
1162 checking whether or not the entities involved have names. We
1163 get here for such an entity. */
1166 /* Get the innermost binding for ID. */
1167 binding = IDENTIFIER_BINDING (id);
1169 /* The name should be bound. */
1170 my_friendly_assert (binding != NULL_TREE, 0);
1172 /* The DECL will be either the ordinary binding or the type
1173 binding for this identifier. Remove that binding. */
1174 if (BINDING_VALUE (binding) == decl)
1175 BINDING_VALUE (binding) = NULL_TREE;
1176 else if (BINDING_TYPE (binding) == decl)
1177 BINDING_TYPE (binding) = NULL_TREE;
1179 my_friendly_abort (0);
1181 if (!BINDING_VALUE (binding) && !BINDING_TYPE (binding))
1182 /* We're completely done with the innermost binding for this
1183 identifier. Unhook it from the list of bindings. */
1184 IDENTIFIER_BINDING (id) = TREE_CHAIN (binding);
1187 /* When a label goes out of scope, check to see if that label was used
1188 in a valid manner, and issue any appropriate warnings or errors. */
1194 tree label = TREE_VALUE (link);
1196 if (!processing_template_decl && doing_semantic_analysis_p ())
1198 if (DECL_INITIAL (label) == NULL_TREE)
1200 cp_error_at ("label `%D' used but not defined", label);
1201 /* Avoid crashing later. */
1202 define_label (input_filename, 1, DECL_NAME (label));
1204 else if (warn_unused && !TREE_USED (label))
1205 cp_warning_at ("label `%D' defined but not used", label);
1208 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), TREE_PURPOSE (link));
1211 /* At the end of a function, all labels declared within the fucntion
1212 go out of scope. BLOCK is the top-level block for the
1221 /* Clear out the definitions of all label names, since their scopes
1223 for (link = named_labels; link; link = TREE_CHAIN (link))
1226 /* Put the labels into the "variables" of the top-level block,
1227 so debugger can see them. */
1228 TREE_CHAIN (TREE_VALUE (link)) = BLOCK_VARS (block);
1229 BLOCK_VARS (block) = TREE_VALUE (link);
1232 named_labels = NULL_TREE;
1235 /* Exit a binding level.
1236 Pop the level off, and restore the state of the identifier-decl mappings
1237 that were in effect when this level was entered.
1239 If KEEP == 1, this level had explicit declarations, so
1240 and create a "block" (a BLOCK node) for the level
1241 to record its declarations and subblocks for symbol table output.
1243 If FUNCTIONBODY is nonzero, this level is the body of a function,
1244 so create a block as if KEEP were set and also clear out all
1247 If REVERSE is nonzero, reverse the order of decls before putting
1248 them into the BLOCK. */
1251 poplevel (keep, reverse, functionbody)
1257 /* The chain of decls was accumulated in reverse order.
1258 Put it into forward order, just for cleanliness. */
1260 int tmp = functionbody;
1261 int real_functionbody;
1264 tree block = NULL_TREE;
1266 int block_previously_created;
1267 int leaving_for_scope;
1269 if (cfun && !doing_semantic_analysis_p ())
1272 my_friendly_assert (current_binding_level->parm_flag != 2,
1275 real_functionbody = (current_binding_level->keep == 2
1276 ? ((functionbody = 0), tmp) : functionbody);
1277 tags = functionbody >= 0 ? current_binding_level->tags : 0;
1278 subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;
1280 my_friendly_assert (!current_binding_level->class_shadowed,
1283 /* We used to use KEEP == 2 to indicate that the new block should go
1284 at the beginning of the list of blocks at this binding level,
1285 rather than the end. This hack is no longer used. */
1286 my_friendly_assert (keep == 0 || keep == 1, 0);
1288 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
1289 (HOST_WIDE_INT) current_binding_level->level_chain,
1290 current_binding_level->parm_flag,
1291 current_binding_level->keep);
1293 if (current_binding_level->keep == 1)
1296 /* Get the decls in the order they were written.
1297 Usually current_binding_level->names is in reverse order.
1298 But parameter decls were previously put in forward order. */
1301 current_binding_level->names
1302 = decls = nreverse (current_binding_level->names);
1304 decls = current_binding_level->names;
1306 /* Output any nested inline functions within this block
1307 if they weren't already output. */
1308 for (decl = decls; decl; decl = TREE_CHAIN (decl))
1309 if (TREE_CODE (decl) == FUNCTION_DECL
1310 && ! TREE_ASM_WRITTEN (decl)
1311 && DECL_INITIAL (decl) != NULL_TREE
1312 && TREE_ADDRESSABLE (decl)
1313 && decl_function_context (decl) == current_function_decl)
1315 /* If this decl was copied from a file-scope decl
1316 on account of a block-scope extern decl,
1317 propagate TREE_ADDRESSABLE to the file-scope decl. */
1318 if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE)
1319 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
1322 push_function_context ();
1323 output_inline_function (decl);
1324 pop_function_context ();
1328 /* When not in function-at-a-time mode, expand_end_bindings will
1329 warn about unused variables. But, in function-at-a-time mode
1330 expand_end_bindings is not passed the list of variables in the
1331 current scope, and therefore no warning is emitted. So, we
1332 explicitly warn here. */
1333 if (!processing_template_decl)
1334 warn_about_unused_variables (getdecls ());
1336 /* If there were any declarations or structure tags in that level,
1337 or if this level is a function body,
1338 create a BLOCK to record them for the life of this function. */
1340 block_previously_created = (current_binding_level->this_block != NULL_TREE);
1341 if (block_previously_created)
1342 block = current_binding_level->this_block;
1343 else if (keep == 1 || functionbody)
1344 block = make_node (BLOCK);
1345 if (block != NULL_TREE)
1347 if (block_previously_created)
1349 if (decls || tags || subblocks)
1351 if (BLOCK_VARS (block))
1352 warning ("internal compiler error: debugging info corrupted");
1354 BLOCK_VARS (block) = decls;
1356 /* We can have previous subblocks and new subblocks when
1357 doing fixup_gotos with complex cleanups. We chain the new
1358 subblocks onto the end of any pre-existing subblocks. */
1359 BLOCK_SUBBLOCKS (block) = chainon (BLOCK_SUBBLOCKS (block),
1365 BLOCK_VARS (block) = decls;
1366 BLOCK_SUBBLOCKS (block) = subblocks;
1370 /* In each subblock, record that this is its superior. */
1372 for (link = subblocks; link; link = TREE_CHAIN (link))
1373 BLOCK_SUPERCONTEXT (link) = block;
1375 /* We still support the old for-scope rules, whereby the variables
1376 in a for-init statement were in scope after the for-statement
1377 ended. We only use the new rules in flag_new_for_scope is
1380 = current_binding_level->is_for_scope && flag_new_for_scope == 1;
1382 /* Remove declarations for all the DECLs in this level. */
1383 for (link = decls; link; link = TREE_CHAIN (link))
1385 if (leaving_for_scope && TREE_CODE (link) == VAR_DECL)
1388 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link)));
1392 ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link));
1394 ns_binding = NULL_TREE;
1397 && (BINDING_LEVEL (outer_binding)
1398 == current_binding_level->level_chain))
1399 /* We have something like:
1404 and we are leaving the `for' scope. There's no reason to
1405 keep the binding of the inner `i' in this case. */
1406 pop_binding (DECL_NAME (link), link);
1407 else if ((outer_binding
1408 && (TREE_CODE (BINDING_VALUE (outer_binding))
1411 && TREE_CODE (ns_binding) == TYPE_DECL))
1412 /* Here, we have something like:
1420 We must pop the for-scope binding so we know what's a
1421 type and what isn't. */
1422 pop_binding (DECL_NAME (link), link);
1425 /* Mark this VAR_DECL as dead so that we can tell we left it
1426 there only for backward compatibility. */
1427 DECL_DEAD_FOR_LOCAL (link) = 1;
1429 /* Keep track of what should of have happenned when we
1430 popped the binding. */
1431 if (outer_binding && BINDING_VALUE (outer_binding))
1432 DECL_SHADOWED_FOR_VAR (link)
1433 = BINDING_VALUE (outer_binding);
1435 /* Add it to the list of dead variables in the next
1436 outermost binding to that we can remove these when we
1437 leave that binding. */
1438 current_binding_level->level_chain->dead_vars_from_for
1439 = tree_cons (NULL_TREE, link,
1440 current_binding_level->level_chain->
1441 dead_vars_from_for);
1443 /* Although we don't pop the CPLUS_BINDING, we do clear
1444 its BINDING_LEVEL since the level is going away now. */
1445 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link)))
1451 /* Remove the binding. */
1453 if (TREE_CODE (decl) == TREE_LIST)
1454 decl = TREE_VALUE (decl);
1455 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd')
1456 pop_binding (DECL_NAME (decl), decl);
1457 else if (TREE_CODE (decl) == OVERLOAD)
1458 pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl);
1460 my_friendly_abort (0);
1464 /* Remove declarations for any `for' variables from inner scopes
1465 that we kept around. */
1466 for (link = current_binding_level->dead_vars_from_for;
1467 link; link = TREE_CHAIN (link))
1468 pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));
1470 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1471 for (link = current_binding_level->type_shadowed;
1472 link; link = TREE_CHAIN (link))
1473 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));
1475 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1476 for (link = current_binding_level->shadowed_labels;
1478 link = TREE_CHAIN (link))
1481 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1482 list if a `using' declaration put them there. The debugging
1483 back-ends won't understand OVERLOAD, so we remove them here.
1484 Because the BLOCK_VARS are (temporarily) shared with
1485 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1486 popped all the bindings. */
1491 for (d = &BLOCK_VARS (block); *d; )
1493 if (TREE_CODE (*d) == TREE_LIST)
1494 *d = TREE_CHAIN (*d);
1496 d = &TREE_CHAIN (*d);
1500 /* If the level being exited is the top level of a function,
1501 check over all the labels. */
1504 /* Since this is the top level block of a function, the vars are
1505 the function's parameters. Don't leave them in the BLOCK
1506 because they are found in the FUNCTION_DECL instead. */
1507 BLOCK_VARS (block) = 0;
1511 /* Any uses of undefined labels now operate under constraints
1512 of next binding contour. */
1515 struct binding_level *level_chain;
1516 level_chain = current_binding_level->level_chain;
1519 struct named_label_list *labels;
1520 for (labels = named_label_uses; labels; labels = labels->next)
1521 if (labels->binding_level == current_binding_level)
1523 labels->binding_level = level_chain;
1524 labels->names_in_scope = level_chain->names;
1529 tmp = current_binding_level->keep;
1531 pop_binding_level ();
1533 DECL_INITIAL (current_function_decl) = block;
1536 if (!block_previously_created)
1537 current_binding_level->blocks
1538 = chainon (current_binding_level->blocks, block);
1540 /* If we did not make a block for the level just exited,
1541 any blocks made for inner levels
1542 (since they cannot be recorded as subblocks in that level)
1543 must be carried forward so they will later become subblocks
1544 of something else. */
1546 current_binding_level->blocks
1547 = chainon (current_binding_level->blocks, subblocks);
1549 /* Each and every BLOCK node created here in `poplevel' is important
1550 (e.g. for proper debugging information) so if we created one
1551 earlier, mark it as "used". */
1553 TREE_USED (block) = 1;
1555 /* Take care of compiler's internal binding structures. */
1561 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1564 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts)) = block;
1565 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts)) = block;
1568 block = poplevel (keep, reverse, functionbody);
1574 /* Delete the node BLOCK from the current binding level.
1575 This is used for the block inside a stmt expr ({...})
1576 so that the block can be reinserted where appropriate. */
1579 delete_block (block)
1583 if (current_binding_level->blocks == block)
1584 current_binding_level->blocks = TREE_CHAIN (block);
1585 for (t = current_binding_level->blocks; t;)
1587 if (TREE_CHAIN (t) == block)
1588 TREE_CHAIN (t) = TREE_CHAIN (block);
1592 TREE_CHAIN (block) = NULL_TREE;
1593 /* Clear TREE_USED which is always set by poplevel.
1594 The flag is set again if insert_block is called. */
1595 TREE_USED (block) = 0;
1598 /* Insert BLOCK at the end of the list of subblocks of the
1599 current binding level. This is used when a BIND_EXPR is expanded,
1600 to handle the BLOCK node inside the BIND_EXPR. */
1603 insert_block (block)
1606 TREE_USED (block) = 1;
1607 current_binding_level->blocks
1608 = chainon (current_binding_level->blocks, block);
1611 /* Set the BLOCK node for the innermost scope
1612 (the one we are currently in). */
1616 register tree block;
1618 current_binding_level->this_block = block;
1621 /* Do a pushlevel for class declarations. */
1626 register struct binding_level *newlevel;
1628 /* Reuse or create a struct for this binding level. */
1629 #if defined(DEBUG_CP_BINDING_LEVELS)
1631 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1632 if (free_binding_level)
1633 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1635 newlevel = free_binding_level;
1636 free_binding_level = free_binding_level->level_chain;
1639 newlevel = make_binding_level ();
1641 #if defined(DEBUG_CP_BINDING_LEVELS)
1643 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1645 push_binding_level (newlevel, 0, 0);
1647 class_binding_level = current_binding_level;
1648 class_binding_level->parm_flag = 2;
1649 class_binding_level->this_class = current_class_type;
1652 /* ...and a poplevel for class declarations. */
1657 register struct binding_level *level = class_binding_level;
1660 my_friendly_assert (level != 0, 354);
1662 /* If we're leaving a toplevel class, don't bother to do the setting
1663 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1664 shouldn't even be used when current_class_type isn't set, and second,
1665 if we don't touch it here, we're able to use the cache effect if the
1666 next time we're entering a class scope, it is the same class. */
1667 if (current_class_depth != 1)
1669 struct binding_level* b;
1671 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1672 for (shadowed = level->class_shadowed;
1674 shadowed = TREE_CHAIN (shadowed))
1675 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = NULL_TREE;
1677 /* Find the next enclosing class, and recreate
1678 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1679 b = level->level_chain;
1680 while (b && b->parm_flag != 2)
1684 for (shadowed = b->class_shadowed;
1686 shadowed = TREE_CHAIN (shadowed))
1690 t = IDENTIFIER_BINDING (TREE_PURPOSE (shadowed));
1691 while (t && BINDING_LEVEL (t) != b)
1695 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed))
1696 = BINDING_VALUE (t);
1700 /* Remember to save what IDENTIFIER's were bound in this scope so we
1701 can recover from cache misses. */
1703 previous_class_type = current_class_type;
1704 previous_class_values = class_binding_level->class_shadowed;
1706 for (shadowed = level->type_shadowed;
1708 shadowed = TREE_CHAIN (shadowed))
1709 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
1711 /* Remove the bindings for all of the class-level declarations. */
1712 for (shadowed = level->class_shadowed;
1714 shadowed = TREE_CHAIN (shadowed))
1715 pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed));
1717 GNU_xref_end_scope ((HOST_WIDE_INT) class_binding_level,
1718 (HOST_WIDE_INT) class_binding_level->level_chain,
1719 class_binding_level->parm_flag,
1720 class_binding_level->keep);
1722 /* Now, pop out of the binding level which we created up in the
1723 `pushlevel_class' routine. */
1724 #if defined(DEBUG_CP_BINDING_LEVELS)
1726 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1728 pop_binding_level ();
1731 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1732 for any names in enclosing classes. */
1735 clear_identifier_class_values ()
1739 if (!class_binding_level)
1742 for (t = class_binding_level->class_shadowed;
1745 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
1748 /* Returns non-zero if T is a virtual function table. */
1751 vtable_decl_p (t, data)
1753 void *data ATTRIBUTE_UNUSED;
1755 return (TREE_CODE (t) == VAR_DECL && DECL_VIRTUAL_P (t));
1758 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1762 vtype_decl_p (t, data)
1764 void *data ATTRIBUTE_UNUSED;
1766 return (TREE_CODE (t) == TYPE_DECL
1767 && TREE_TYPE (t) != error_mark_node
1768 && TYPE_LANG_SPECIFIC (TREE_TYPE (t))
1769 && CLASSTYPE_VSIZE (TREE_TYPE (t)));
1772 /* Return the declarations that are members of the namespace NS. */
1775 cp_namespace_decls (ns)
1778 return NAMESPACE_LEVEL (ns)->names;
1781 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1782 itself, calling F for each. The DATA is passed to F as well. */
1785 walk_namespaces_r (namespace, f, data)
1787 walk_namespaces_fn f;
1793 result |= (*f) (namespace, data);
1795 for (current = cp_namespace_decls (namespace);
1797 current = TREE_CHAIN (current))
1799 if (TREE_CODE (current) != NAMESPACE_DECL
1800 || DECL_NAMESPACE_ALIAS (current))
1802 if (!DECL_LANG_SPECIFIC (current))
1805 my_friendly_assert (current == std_node, 393);
1809 /* We found a namespace. */
1810 result |= walk_namespaces_r (current, f, data);
1816 /* Walk all the namespaces, calling F for each. The DATA is passed to
1820 walk_namespaces (f, data)
1821 walk_namespaces_fn f;
1824 return walk_namespaces_r (global_namespace, f, data);
1827 struct walk_globals_data {
1828 walk_globals_pred p;
1833 /* Walk the global declarations in NAMESPACE. Whenever one is found
1834 for which P returns non-zero, call F with its address. If any call
1835 to F returns a non-zero value, return a non-zero value. */
1838 walk_globals_r (namespace, data)
1842 struct walk_globals_data* wgd = (struct walk_globals_data *) data;
1843 walk_globals_pred p = wgd->p;
1844 walk_globals_fn f = wgd->f;
1845 void *d = wgd->data;
1849 t = &NAMESPACE_LEVEL (namespace)->names;
1856 result |= (*f) (t, d);
1858 /* If F changed *T, then *T still points at the next item to
1861 t = &TREE_CHAIN (*t);
1867 /* Walk the global declarations. Whenever one is found for which P
1868 returns non-zero, call F with its address. If any call to F
1869 returns a non-zero value, return a non-zero value. */
1872 walk_globals (p, f, data)
1873 walk_globals_pred p;
1877 struct walk_globals_data wgd;
1882 return walk_namespaces (walk_globals_r, &wgd);
1885 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1886 DATA is non-NULL, this is the last time we will call
1887 wrapup_global_declarations for this NAMESPACE. */
1890 wrapup_globals_for_namespace (namespace, data)
1894 tree globals = cp_namespace_decls (namespace);
1895 int len = list_length (globals);
1896 tree *vec = (tree *) alloca (sizeof (tree) * len);
1900 int last_time = (data != 0);
1902 if (last_time && namespace == global_namespace)
1903 /* Let compile_file handle the global namespace. */
1906 /* Process the decls in reverse order--earliest first.
1907 Put them into VEC from back to front, then take out from front. */
1909 for (i = 0, decl = globals; i < len; i++, decl = TREE_CHAIN (decl))
1911 /* Pretend we've output an unused static variable. This ensures
1912 that the toplevel __FUNCTION__ etc won't be emitted, unless
1914 if (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)
1915 && !TREE_PUBLIC (decl) && !TREE_USED (decl))
1917 TREE_ASM_WRITTEN (decl) = 1;
1918 DECL_IGNORED_P (decl) = 1;
1920 vec[len - i - 1] = decl;
1925 check_global_declarations (vec, len);
1929 /* Temporarily mark vtables as external. That prevents
1930 wrapup_global_declarations from writing them out; we must process
1931 them ourselves in finish_vtable_vardecl. */
1932 for (i = 0; i < len; ++i)
1933 if (vtable_decl_p (vec[i], /*data=*/0) && !DECL_EXTERNAL (vec[i]))
1935 DECL_NOT_REALLY_EXTERN (vec[i]) = 1;
1936 DECL_EXTERNAL (vec[i]) = 1;
1939 /* Write out any globals that need to be output. */
1940 result = wrapup_global_declarations (vec, len);
1942 /* Undo the hack to DECL_EXTERNAL above. */
1943 for (i = 0; i < len; ++i)
1944 if (vtable_decl_p (vec[i], /*data=*/0)
1945 && DECL_NOT_REALLY_EXTERN (vec[i]))
1947 DECL_NOT_REALLY_EXTERN (vec[i]) = 0;
1948 DECL_EXTERNAL (vec[i]) = 0;
1955 /* Mark ARG (which is really a struct binding_level **) for GC. */
1958 mark_binding_level (arg)
1961 struct binding_level *lvl = *(struct binding_level **)arg;
1965 ggc_mark_tree (lvl->names);
1966 ggc_mark_tree (lvl->tags);
1967 ggc_mark_tree (lvl->usings);
1968 ggc_mark_tree (lvl->using_directives);
1969 ggc_mark_tree (lvl->class_shadowed);
1970 ggc_mark_tree (lvl->type_shadowed);
1971 ggc_mark_tree (lvl->shadowed_labels);
1972 ggc_mark_tree (lvl->blocks);
1973 ggc_mark_tree (lvl->this_block);
1974 ggc_mark_tree (lvl->this_class);
1975 ggc_mark_tree (lvl->incomplete);
1976 ggc_mark_tree (lvl->dead_vars_from_for);
1978 lvl = lvl->level_chain;
1982 /* For debugging. */
1983 static int no_print_functions = 0;
1984 static int no_print_builtins = 0;
1987 print_binding_level (lvl)
1988 struct binding_level *lvl;
1992 fprintf (stderr, " blocks=");
1993 fprintf (stderr, HOST_PTR_PRINTF, lvl->blocks);
1994 fprintf (stderr, " n_incomplete=%d parm_flag=%d keep=%d",
1995 list_length (lvl->incomplete), lvl->parm_flag, lvl->keep);
1996 if (lvl->tag_transparent)
1997 fprintf (stderr, " tag-transparent");
1998 if (lvl->more_cleanups_ok)
1999 fprintf (stderr, " more-cleanups-ok");
2000 if (lvl->have_cleanups)
2001 fprintf (stderr, " have-cleanups");
2002 fprintf (stderr, "\n");
2005 fprintf (stderr, " names:\t");
2006 /* We can probably fit 3 names to a line? */
2007 for (t = lvl->names; t; t = TREE_CHAIN (t))
2009 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
2011 if (no_print_builtins
2012 && (TREE_CODE (t) == TYPE_DECL)
2013 && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>")))
2016 /* Function decls tend to have longer names. */
2017 if (TREE_CODE (t) == FUNCTION_DECL)
2024 fprintf (stderr, "\n\t");
2027 print_node_brief (stderr, "", t, 0);
2028 if (t == error_mark_node)
2032 fprintf (stderr, "\n");
2036 fprintf (stderr, " tags:\t");
2038 for (t = lvl->tags; t; t = TREE_CHAIN (t))
2040 if (TREE_PURPOSE (t) == NULL_TREE)
2042 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
2049 fprintf (stderr, "\n\t");
2052 if (TREE_PURPOSE (t) == NULL_TREE)
2054 print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0);
2055 fprintf (stderr, ">");
2057 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
2058 print_node_brief (stderr, "", TREE_VALUE (t), 0);
2061 print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0);
2062 print_node_brief (stderr, "", TREE_VALUE (t), 0);
2063 fprintf (stderr, ">");
2067 fprintf (stderr, "\n");
2069 if (lvl->class_shadowed)
2071 fprintf (stderr, " class-shadowed:");
2072 for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t))
2074 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
2076 fprintf (stderr, "\n");
2078 if (lvl->type_shadowed)
2080 fprintf (stderr, " type-shadowed:");
2081 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
2083 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
2085 fprintf (stderr, "\n");
2090 print_other_binding_stack (stack)
2091 struct binding_level *stack;
2093 struct binding_level *level;
2094 for (level = stack; level != global_binding_level; level = level->level_chain)
2096 fprintf (stderr, "binding level ");
2097 fprintf (stderr, HOST_PTR_PRINTF, level);
2098 fprintf (stderr, "\n");
2099 print_binding_level (level);
2104 print_binding_stack ()
2106 struct binding_level *b;
2107 fprintf (stderr, "current_binding_level=");
2108 fprintf (stderr, HOST_PTR_PRINTF, current_binding_level);
2109 fprintf (stderr, "\nclass_binding_level=");
2110 fprintf (stderr, HOST_PTR_PRINTF, class_binding_level);
2111 fprintf (stderr, "\nglobal_binding_level=");
2112 fprintf (stderr, HOST_PTR_PRINTF, global_binding_level);
2113 fprintf (stderr, "\n");
2114 if (class_binding_level)
2116 for (b = class_binding_level; b; b = b->level_chain)
2117 if (b == current_binding_level)
2120 b = class_binding_level;
2122 b = current_binding_level;
2125 b = current_binding_level;
2126 print_other_binding_stack (b);
2127 fprintf (stderr, "global:\n");
2128 print_binding_level (global_binding_level);
2131 /* Namespace binding access routines: The namespace_bindings field of
2132 the identifier is polymorphic, with three possible values:
2133 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2134 indicating the BINDING_VALUE of global_namespace. */
2136 /* Check whether the a binding for the name to scope is known.
2137 Assumes that the bindings of the name are already a list
2138 of bindings. Returns the binding found, or NULL_TREE. */
2141 find_binding (name, scope)
2145 tree iter, prev = NULL_TREE;
2147 scope = ORIGINAL_NAMESPACE (scope);
2149 for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter;
2150 iter = TREE_CHAIN (iter))
2152 my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374);
2153 if (BINDING_SCOPE (iter) == scope)
2155 /* Move binding found to the front of the list, so
2156 subsequent lookups will find it faster. */
2159 TREE_CHAIN (prev) = TREE_CHAIN (iter);
2160 TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name);
2161 IDENTIFIER_NAMESPACE_BINDINGS (name) = iter;
2170 /* Always returns a binding for name in scope. If the
2171 namespace_bindings is not a list, convert it to one first.
2172 If no binding is found, make a new one. */
2175 binding_for_name (name, scope)
2179 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2182 scope = ORIGINAL_NAMESPACE (scope);
2184 if (b && TREE_CODE (b) != CPLUS_BINDING)
2186 /* Get rid of optimization for global scope. */
2187 IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE;
2188 BINDING_VALUE (binding_for_name (name, global_namespace)) = b;
2189 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2191 if (b && (result = find_binding (name, scope)))
2193 /* Not found, make a new one. */
2194 result = make_node (CPLUS_BINDING);
2195 TREE_CHAIN (result) = b;
2196 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
2197 BINDING_SCOPE (result) = scope;
2198 BINDING_TYPE (result) = NULL_TREE;
2199 BINDING_VALUE (result) = NULL_TREE;
2203 /* Return the binding value for name in scope, considering that
2204 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2207 namespace_binding (name, scope)
2211 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2214 if (scope == NULL_TREE)
2215 scope = global_namespace;
2216 if (TREE_CODE (b) != CPLUS_BINDING)
2217 return (scope == global_namespace) ? b : NULL_TREE;
2218 name = find_binding (name,scope);
2219 if (name == NULL_TREE)
2221 return BINDING_VALUE (name);
2224 /* Set the binding value for name in scope. If modifying the binding
2225 of global_namespace is attempted, try to optimize it. */
2228 set_namespace_binding (name, scope, val)
2235 if (scope == NULL_TREE)
2236 scope = global_namespace;
2238 if (scope == global_namespace)
2240 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2241 if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING)
2243 IDENTIFIER_NAMESPACE_BINDINGS (name) = val;
2247 b = binding_for_name (name, scope);
2248 BINDING_VALUE (b) = val;
2251 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2252 select a name that is unique to this compilation unit. */
2255 push_namespace (name)
2260 int implicit_use = 0;
2262 if (!global_namespace)
2264 /* This must be ::. */
2265 my_friendly_assert (name == get_identifier ("::"), 377);
2270 /* The name of anonymous namespace is unique for the translation
2272 if (!anonymous_namespace_name)
2273 anonymous_namespace_name = get_file_function_name ('N');
2274 name = anonymous_namespace_name;
2275 d = IDENTIFIER_NAMESPACE_VALUE (name);
2277 /* Reopening anonymous namespace. */
2281 else if (current_namespace == global_namespace
2282 && name == DECL_NAME (std_node))
2289 /* Check whether this is an extended namespace definition. */
2290 d = IDENTIFIER_NAMESPACE_VALUE (name);
2291 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2294 if (DECL_NAMESPACE_ALIAS (d))
2296 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2297 d, DECL_NAMESPACE_ALIAS (d));
2298 d = DECL_NAMESPACE_ALIAS (d);
2305 /* Make a new namespace, binding the name to it. */
2306 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2307 /* The global namespace is not pushed, and the global binding
2308 level is set elsewhere. */
2313 declare_namespace_level ();
2314 NAMESPACE_LEVEL (d) = current_binding_level;
2318 resume_binding_level (NAMESPACE_LEVEL (d));
2321 do_using_directive (d);
2322 /* Enter the name space. */
2323 current_namespace = d;
2326 /* Pop from the scope of the current namespace. */
2331 if (current_namespace == global_namespace)
2333 my_friendly_assert (in_std>0, 980421);
2337 current_namespace = CP_DECL_CONTEXT (current_namespace);
2338 /* The binding level is not popped, as it might be re-opened later. */
2339 suspend_binding_level ();
2342 /* Push into the scope of the namespace NS, even if it is deeply
2343 nested within another namespace. */
2346 push_nested_namespace (ns)
2349 if (ns == global_namespace)
2350 push_to_top_level ();
2353 push_nested_namespace (CP_DECL_CONTEXT (ns));
2354 push_namespace (DECL_NAME (ns));
2358 /* Pop back from the scope of the namespace NS, which was previously
2359 entered with push_nested_namespace. */
2362 pop_nested_namespace (ns)
2365 while (ns != global_namespace)
2368 ns = CP_DECL_CONTEXT (ns);
2371 pop_from_top_level ();
2375 /* Subroutines for reverting temporarily to top-level for instantiation
2376 of templates and such. We actually need to clear out the class- and
2377 local-value slots of all identifiers, so that only the global values
2378 are at all visible. Simply setting current_binding_level to the global
2379 scope isn't enough, because more binding levels may be pushed. */
2380 struct saved_scope *scope_chain;
2382 /* Mark ST for GC. */
2386 struct stmt_tree *st;
2388 ggc_mark_tree (st->x_last_stmt);
2389 ggc_mark_tree (st->x_last_expr_type);
2392 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2395 mark_saved_scope (arg)
2398 struct saved_scope *t = *(struct saved_scope **)arg;
2401 mark_binding_level (&t->class_bindings);
2402 ggc_mark_tree (t->old_bindings);
2403 ggc_mark_tree (t->old_namespace);
2404 ggc_mark_tree (t->class_name);
2405 ggc_mark_tree (t->class_type);
2406 ggc_mark_tree (t->access_specifier);
2407 ggc_mark_tree (t->function_decl);
2409 ggc_mark_tree_varray (t->lang_base);
2410 ggc_mark_tree (t->lang_name);
2411 ggc_mark_tree (t->x_function_parms);
2412 ggc_mark_tree (t->template_parms);
2413 ggc_mark_tree (t->x_previous_class_type);
2414 ggc_mark_tree (t->x_previous_class_values);
2415 ggc_mark_tree (t->x_saved_tree);
2416 ggc_mark_tree (t->incomplete);
2417 ggc_mark_tree (t->lookups);
2419 mark_stmt_tree (&t->x_stmt_tree);
2420 mark_binding_level (&t->bindings);
2426 store_bindings (names, old_bindings)
2427 tree names, old_bindings;
2430 for (t = names; t; t = TREE_CHAIN (t))
2432 tree binding, t1, id;
2434 if (TREE_CODE (t) == TREE_LIST)
2435 id = TREE_PURPOSE (t);
2440 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2441 we have no IDENTIFIER_BINDING if we have left the class
2442 scope, but cached the class-level declarations. */
2443 || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2446 for (t1 = old_bindings; t1; t1 = TREE_CHAIN (t1))
2447 if (TREE_VEC_ELT (t1, 0) == id)
2450 binding = make_tree_vec (4);
2454 my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2455 TREE_VEC_ELT (binding, 0) = id;
2456 TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2457 TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2458 TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2459 IDENTIFIER_BINDING (id) = NULL_TREE;
2460 IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2462 TREE_CHAIN (binding) = old_bindings;
2463 old_bindings = binding;
2467 return old_bindings;
2471 maybe_push_to_top_level (pseudo)
2474 struct saved_scope *s;
2475 struct binding_level *b;
2479 s = (struct saved_scope *) xcalloc (1, sizeof (struct saved_scope));
2481 b = scope_chain ? current_binding_level : 0;
2483 /* If we're in the middle of some function, save our state. */
2487 push_function_context_to (NULL_TREE);
2492 old_bindings = NULL_TREE;
2493 if (scope_chain && previous_class_type)
2494 old_bindings = store_bindings (previous_class_values, old_bindings);
2496 /* Have to include global_binding_level, because class-level decls
2497 aren't listed anywhere useful. */
2498 for (; b; b = b->level_chain)
2502 /* Template IDs are inserted into the global level. If they were
2503 inserted into namespace level, finish_file wouldn't find them
2504 when doing pending instantiations. Therefore, don't stop at
2505 namespace level, but continue until :: . */
2506 if (b == global_binding_level || (pseudo && b->template_parms_p))
2509 old_bindings = store_bindings (b->names, old_bindings);
2510 /* We also need to check class_shadowed to save class-level type
2511 bindings, since pushclass doesn't fill in b->names. */
2512 if (b->parm_flag == 2)
2513 old_bindings = store_bindings (b->class_shadowed, old_bindings);
2515 /* Unwind type-value slots back to top level. */
2516 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2517 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2519 s->prev = scope_chain;
2520 s->old_bindings = old_bindings;
2522 s->need_pop_function_context = need_pop;
2523 s->function_decl = current_function_decl;
2526 current_function_decl = NULL_TREE;
2527 VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base");
2528 current_lang_stack = &VARRAY_TREE (current_lang_base, 0);
2529 current_lang_name = lang_name_cplusplus;
2530 strict_prototype = strict_prototypes_lang_cplusplus;
2531 current_namespace = global_namespace;
2535 push_to_top_level ()
2537 maybe_push_to_top_level (0);
2541 pop_from_top_level ()
2543 struct saved_scope *s = scope_chain;
2546 /* Clear out class-level bindings cache. */
2547 if (previous_class_type)
2548 invalidate_class_lookup_cache ();
2550 VARRAY_FREE (current_lang_base);
2552 scope_chain = s->prev;
2553 for (t = s->old_bindings; t; t = TREE_CHAIN (t))
2555 tree id = TREE_VEC_ELT (t, 0);
2558 SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2559 IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2560 IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2564 if (current_lang_name == lang_name_cplusplus)
2565 strict_prototype = strict_prototypes_lang_cplusplus;
2566 else if (current_lang_name == lang_name_c)
2567 strict_prototype = strict_prototypes_lang_c;
2569 /* If we were in the middle of compiling a function, restore our
2571 if (s->need_pop_function_context)
2572 pop_function_context_from (NULL_TREE);
2573 current_function_decl = s->function_decl;
2578 /* Push a definition of struct, union or enum tag "name".
2579 into binding_level "b". "type" should be the type node,
2580 We assume that the tag "name" is not already defined.
2582 Note that the definition may really be just a forward reference.
2583 In that case, the TYPE_SIZE will be a NULL_TREE.
2585 C++ gratuitously puts all these tags in the name space. */
2587 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2588 record the shadowed value for this binding contour. TYPE is
2589 the type that ID maps to. */
2592 set_identifier_type_value_with_scope (id, type, b)
2595 struct binding_level *b;
2597 if (!b->namespace_p)
2599 /* Shadow the marker, not the real thing, so that the marker
2600 gets restored later. */
2601 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2603 = tree_cons (id, old_type_value, b->type_shadowed);
2607 tree binding = binding_for_name (id, current_namespace);
2608 BINDING_TYPE (binding) = type;
2609 /* Store marker instead of real type. */
2610 type = global_type_node;
2612 SET_IDENTIFIER_TYPE_VALUE (id, type);
2615 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2618 set_identifier_type_value (id, type)
2622 set_identifier_type_value_with_scope (id, type, current_binding_level);
2625 /* Return the type associated with id. */
2628 identifier_type_value (id)
2631 /* There is no type with that name, anywhere. */
2632 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2634 /* This is not the type marker, but the real thing. */
2635 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2636 return REAL_IDENTIFIER_TYPE_VALUE (id);
2637 /* Have to search for it. It must be on the global level, now.
2638 Ask lookup_name not to return non-types. */
2639 id = lookup_name_real (id, 2, 1, 0);
2641 return TREE_TYPE (id);
2645 /* Pop off extraneous binding levels left over due to syntax errors.
2647 We don't pop past namespaces, as they might be valid. */
2652 #ifdef DEBUG_CP_BINDING_LEVELS
2653 fprintf (stderr, "XXX entering pop_everything ()\n");
2655 while (!toplevel_bindings_p ())
2657 if (current_binding_level->parm_flag == 2)
2658 pop_nested_class ();
2662 #ifdef DEBUG_CP_BINDING_LEVELS
2663 fprintf (stderr, "XXX leaving pop_everything ()\n");
2667 /* The type TYPE is being declared. If it is a class template, or a
2668 specialization of a class template, do any processing required and
2669 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2670 being declared a friend. B is the binding level at which this TYPE
2673 Returns the TYPE_DECL for TYPE, which may have been altered by this
2677 maybe_process_template_type_declaration (type, globalize, b)
2680 struct binding_level* b;
2682 tree decl = TYPE_NAME (type);
2684 if (processing_template_parmlist)
2685 /* You can't declare a new template type in a template parameter
2686 list. But, you can declare a non-template type:
2688 template <class A*> struct S;
2690 is a forward-declaration of `A'. */
2694 maybe_check_template_type (type);
2696 my_friendly_assert (IS_AGGR_TYPE (type)
2697 || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2700 if (processing_template_decl)
2702 /* This may change after the call to
2703 push_template_decl_real, but we want the original value. */
2704 tree name = DECL_NAME (decl);
2706 decl = push_template_decl_real (decl, globalize);
2707 /* If the current binding level is the binding level for the
2708 template parameters (see the comment in
2709 begin_template_parm_list) and the enclosing level is a class
2710 scope, and we're not looking at a friend, push the
2711 declaration of the member class into the class scope. In the
2712 friend case, push_template_decl will already have put the
2713 friend into global scope, if appropriate. */
2714 if (TREE_CODE (type) != ENUMERAL_TYPE
2715 && !globalize && b->template_parms_p
2716 && b->level_chain->parm_flag == 2)
2718 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2719 /* Put this tag on the list of tags for the class, since
2720 that won't happen below because B is not the class
2721 binding level, but is instead the pseudo-global level. */
2722 b->level_chain->tags =
2723 tree_cons (name, type, b->level_chain->tags);
2724 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2725 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2733 /* In C++, you don't have to write `struct S' to refer to `S'; you
2734 can just use `S'. We accomplish this by creating a TYPE_DECL as
2735 if the user had written `typedef struct S S'. Create and return
2736 the TYPE_DECL for TYPE. */
2739 create_implicit_typedef (name, type)
2745 decl = build_decl (TYPE_DECL, name, type);
2746 SET_DECL_ARTIFICIAL (decl);
2747 /* There are other implicit type declarations, like the one *within*
2748 a class that allows you to write `S::S'. We must distinguish
2750 SET_DECL_IMPLICIT_TYPEDEF_P (decl);
2751 TYPE_NAME (type) = decl;
2756 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2757 Normally put it into the inner-most non-tag-transparent scope,
2758 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2759 The latter is needed for implicit declarations. */
2762 pushtag (name, type, globalize)
2766 register struct binding_level *b;
2768 b = current_binding_level;
2769 while (b->tag_transparent
2770 || (globalize && b->parm_flag == 2))
2773 b->tags = tree_cons (name, type, b->tags);
2777 /* Do C++ gratuitous typedefing. */
2778 if (IDENTIFIER_TYPE_VALUE (name) != type)
2780 register tree d = NULL_TREE;
2782 tree context = TYPE_CONTEXT (type);
2786 tree cs = current_scope ();
2790 else if (cs != NULL_TREE
2791 && TREE_CODE_CLASS (TREE_CODE (cs)) == 't')
2792 /* When declaring a friend class of a local class, we want
2793 to inject the newly named class into the scope
2794 containing the local class, not the namespace scope. */
2795 context = decl_function_context (get_type_decl (cs));
2798 context = current_namespace;
2800 if ((b->template_parms_p && b->level_chain->parm_flag == 2)
2801 || b->parm_flag == 2)
2804 if (current_lang_name == lang_name_java)
2805 TYPE_FOR_JAVA (type) = 1;
2807 d = create_implicit_typedef (name, type);
2808 DECL_CONTEXT (d) = FROB_CONTEXT (context);
2810 set_identifier_type_value_with_scope (name, type, b);
2812 d = maybe_process_template_type_declaration (type,
2815 if (b->parm_flag == 2)
2817 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2818 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2819 class. But if it's a member template class, we
2820 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2822 finish_member_declaration (d);
2824 pushdecl_class_level (d);
2827 d = pushdecl_with_scope (d, b);
2829 if (ANON_AGGRNAME_P (name))
2830 DECL_IGNORED_P (d) = 1;
2832 TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2833 DECL_ASSEMBLER_NAME (d) = DECL_NAME (d);
2834 if (!uses_template_parms (type))
2835 DECL_ASSEMBLER_NAME (d)
2836 = get_identifier (build_overload_name (type, 1, 1));
2838 if (b->parm_flag == 2)
2840 if (TYPE_SIZE (current_class_type) == NULL_TREE)
2841 CLASSTYPE_TAGS (current_class_type) = b->tags;
2845 if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2846 /* Use the canonical TYPE_DECL for this node. */
2847 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2850 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2851 will be the tagged type we just added to the current
2852 binding level. This fake NULL-named TYPE_DECL node helps
2853 dwarfout.c to know when it needs to output a
2854 representation of a tagged type, and it also gives us a
2855 convenient place to record the "scope start" address for
2858 tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2859 TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2863 /* Counter used to create anonymous type names. */
2865 static int anon_cnt = 0;
2867 /* Return an IDENTIFIER which can be used as a name for
2868 anonymous structs and unions. */
2875 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2876 return get_identifier (buf);
2879 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2880 This keeps dbxout from getting confused. */
2885 register struct binding_level *b;
2887 static int last_cnt = 0;
2889 /* Fast out if no new anon names were declared. */
2890 if (last_cnt == anon_cnt)
2893 b = current_binding_level;
2894 while (b->tag_transparent)
2899 /* A NULL purpose means we have already processed all tags
2900 from here to the end of the list. */
2901 if (TREE_PURPOSE (tags) == NULL_TREE)
2903 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2904 TREE_PURPOSE (tags) = NULL_TREE;
2905 tags = TREE_CHAIN (tags);
2907 last_cnt = anon_cnt;
2910 /* Subroutine of duplicate_decls: return truthvalue of whether
2911 or not types of these decls match.
2913 For C++, we must compare the parameter list so that `int' can match
2914 `int&' in a parameter position, but `int&' is not confused with
2918 decls_match (newdecl, olddecl)
2919 tree newdecl, olddecl;
2923 if (newdecl == olddecl)
2926 if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
2927 /* If the two DECLs are not even the same kind of thing, we're not
2928 interested in their types. */
2931 if (TREE_CODE (newdecl) == FUNCTION_DECL)
2933 tree f1 = TREE_TYPE (newdecl);
2934 tree f2 = TREE_TYPE (olddecl);
2935 tree p1 = TYPE_ARG_TYPES (f1);
2936 tree p2 = TYPE_ARG_TYPES (f2);
2938 if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)
2939 && ! (DECL_LANGUAGE (newdecl) == lang_c
2940 && DECL_LANGUAGE (olddecl) == lang_c))
2943 if (TREE_CODE (f1) != TREE_CODE (f2))
2946 if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
2948 if (! strict_prototypes_lang_c && DECL_LANGUAGE (olddecl) == lang_c
2951 types_match = self_promoting_args_p (p1);
2952 if (p1 == void_list_node)
2953 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2955 else if (!strict_prototypes_lang_c && DECL_LANGUAGE (olddecl)==lang_c
2956 && DECL_LANGUAGE (newdecl) == lang_c && p1 == NULL_TREE)
2958 types_match = self_promoting_args_p (p2);
2959 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2962 types_match = compparms (p1, p2);
2967 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
2969 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
2970 DECL_TEMPLATE_PARMS (olddecl)))
2973 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
2976 types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
2977 DECL_TEMPLATE_RESULT (newdecl));
2981 if (TREE_TYPE (newdecl) == error_mark_node)
2982 types_match = TREE_TYPE (olddecl) == error_mark_node;
2983 else if (TREE_TYPE (olddecl) == NULL_TREE)
2984 types_match = TREE_TYPE (newdecl) == NULL_TREE;
2985 else if (TREE_TYPE (newdecl) == NULL_TREE)
2988 types_match = comptypes (TREE_TYPE (newdecl),
2989 TREE_TYPE (olddecl),
2990 COMPARE_REDECLARATION);
2996 /* If NEWDECL is `static' and an `extern' was seen previously,
2997 warn about it. OLDDECL is the previous declaration.
2999 Note that this does not apply to the C++ case of declaring
3000 a variable `extern const' and then later `const'.
3002 Don't complain about built-in functions, since they are beyond
3003 the user's control. */
3006 warn_extern_redeclared_static (newdecl, olddecl)
3007 tree newdecl, olddecl;
3009 static const char *explicit_extern_static_warning
3010 = "`%D' was declared `extern' and later `static'";
3011 static const char *implicit_extern_static_warning
3012 = "`%D' was declared implicitly `extern' and later `static'";
3016 if (TREE_CODE (newdecl) == TYPE_DECL
3017 || TREE_CODE (newdecl) == TEMPLATE_DECL)
3020 /* Don't get confused by static member functions; that's a different
3022 if (TREE_CODE (newdecl) == FUNCTION_DECL
3023 && DECL_STATIC_FUNCTION_P (newdecl))
3026 /* If the old declaration was `static', or the new one isn't, then
3027 then everything is OK. */
3028 if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl))
3031 /* It's OK to declare a builtin function as `static'. */
3032 if (TREE_CODE (olddecl) == FUNCTION_DECL
3033 && DECL_ARTIFICIAL (olddecl))
3036 name = DECL_ASSEMBLER_NAME (newdecl);
3037 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
3038 ? implicit_extern_static_warning
3039 : explicit_extern_static_warning, newdecl);
3040 cp_pedwarn_at ("previous declaration of `%D'", olddecl);
3043 /* Handle when a new declaration NEWDECL has the same name as an old
3044 one OLDDECL in the same binding contour. Prints an error message
3047 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3048 Otherwise, return 0. */
3051 duplicate_decls (newdecl, olddecl)
3052 tree newdecl, olddecl;
3054 unsigned olddecl_uid = DECL_UID (olddecl);
3055 int olddecl_friend = 0, types_match = 0;
3056 int new_defines_function = 0;
3058 if (newdecl == olddecl)
3061 types_match = decls_match (newdecl, olddecl);
3063 /* If either the type of the new decl or the type of the old decl is an
3064 error_mark_node, then that implies that we have already issued an
3065 error (earlier) for some bogus type specification, and in that case,
3066 it is rather pointless to harass the user with yet more error message
3067 about the same declaration, so just pretend the types match here. */
3068 if (TREE_TYPE (newdecl) == error_mark_node
3069 || TREE_TYPE (olddecl) == error_mark_node)
3072 /* Check for redeclaration and other discrepancies. */
3073 if (TREE_CODE (olddecl) == FUNCTION_DECL
3074 && DECL_ARTIFICIAL (olddecl))
3076 if (TREE_CODE (newdecl) != FUNCTION_DECL)
3078 /* If you declare a built-in or predefined function name as static,
3079 the old definition is overridden, but optionally warn this was a
3080 bad choice of name. */
3081 if (! TREE_PUBLIC (newdecl))
3084 cp_warning ("shadowing %s function `%#D'",
3085 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3087 /* Discard the old built-in function. */
3090 /* If the built-in is not ansi, then programs can override
3091 it even globally without an error. */
3092 else if (! DECL_BUILT_IN (olddecl))
3093 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3097 cp_error ("declaration of `%#D'", newdecl);
3098 cp_error ("conflicts with built-in declaration `%#D'",
3103 else if (!types_match)
3105 if ((DECL_LANGUAGE (newdecl) == lang_c
3106 && DECL_LANGUAGE (olddecl) == lang_c)
3107 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3108 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3110 /* A near match; override the builtin. */
3112 if (TREE_PUBLIC (newdecl))
3114 cp_warning ("new declaration `%#D'", newdecl);
3115 cp_warning ("ambiguates built-in declaration `%#D'",
3118 else if (warn_shadow)
3119 cp_warning ("shadowing %s function `%#D'",
3120 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3124 /* Discard the old built-in function. */
3128 if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl))
3130 /* If a builtin function is redeclared as `static', merge
3131 the declarations, but make the original one static. */
3132 DECL_THIS_STATIC (olddecl) = 1;
3133 TREE_PUBLIC (olddecl) = 0;
3135 /* Make the olddeclaration consistent with the new one so that
3136 all remnants of the builtin-ness of this function will be
3138 DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3139 DECL_RTL (olddecl) = DECL_RTL (newdecl);
3140 DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3141 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl),
3145 else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
3147 if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
3148 && TREE_CODE (newdecl) != TYPE_DECL
3149 && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
3150 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
3151 || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
3152 && TREE_CODE (olddecl) != TYPE_DECL
3153 && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
3154 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
3157 /* We do nothing special here, because C++ does such nasty
3158 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3159 get shadowed, and know that if we need to find a TYPE_DECL
3160 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3161 slot of the identifier. */
3165 if ((TREE_CODE (newdecl) == FUNCTION_DECL
3166 && DECL_FUNCTION_TEMPLATE_P (olddecl))
3167 || (TREE_CODE (olddecl) == FUNCTION_DECL
3168 && DECL_FUNCTION_TEMPLATE_P (newdecl)))
3171 cp_error ("`%#D' redeclared as different kind of symbol", newdecl);
3172 if (TREE_CODE (olddecl) == TREE_LIST)
3173 olddecl = TREE_VALUE (olddecl);
3174 cp_error_at ("previous declaration of `%#D'", olddecl);
3176 /* New decl is completely inconsistent with the old one =>
3177 tell caller to replace the old one. */
3181 else if (!types_match)
3183 if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl))
3184 /* These are certainly not duplicate declarations; they're
3185 from different scopes. */
3188 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3190 /* The name of a class template may not be declared to refer to
3191 any other template, class, function, object, namespace, value,
3192 or type in the same scope. */
3193 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
3194 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3196 cp_error ("declaration of template `%#D'", newdecl);
3197 cp_error_at ("conflicts with previous declaration `%#D'",
3200 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
3201 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
3202 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
3203 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
3204 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3205 DECL_TEMPLATE_PARMS (olddecl)))
3207 cp_error ("new declaration `%#D'", newdecl);
3208 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3212 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3214 if (DECL_LANGUAGE (newdecl) == lang_c
3215 && DECL_LANGUAGE (olddecl) == lang_c)
3217 cp_error ("declaration of C function `%#D' conflicts with",
3219 cp_error_at ("previous declaration `%#D' here", olddecl);
3221 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3222 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3224 cp_error ("new declaration `%#D'", newdecl);
3225 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3231 /* Already complained about this, so don't do so again. */
3232 else if (current_class_type == NULL_TREE
3233 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
3235 cp_error ("conflicting types for `%#D'", newdecl);
3236 cp_error_at ("previous declaration as `%#D'", olddecl);
3239 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3240 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3241 && (!DECL_TEMPLATE_INFO (newdecl)
3242 || (DECL_TI_TEMPLATE (newdecl)
3243 != DECL_TI_TEMPLATE (olddecl))))
3244 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3245 && (!DECL_TEMPLATE_INFO (olddecl)
3246 || (DECL_TI_TEMPLATE (olddecl)
3247 != DECL_TI_TEMPLATE (newdecl))))))
3248 /* It's OK to have a template specialization and a non-template
3249 with the same type, or to have specializations of two
3250 different templates with the same type. Note that if one is a
3251 specialization, and the other is an instantiation of the same
3252 template, that we do not exit at this point. That situation
3253 can occur if we instantiate a template class, and then
3254 specialize one of its methods. This situation is legal, but
3255 the declarations must be merged in the usual way. */
3257 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3258 && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3259 && !DECL_USE_TEMPLATE (newdecl))
3260 || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3261 && !DECL_USE_TEMPLATE (olddecl))))
3262 /* One of the declarations is a template instantiation, and the
3263 other is not a template at all. That's OK. */
3265 else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3266 && DECL_NAMESPACE_ALIAS (newdecl)
3267 && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3268 /* Redeclaration of namespace alias, ignore it. */
3272 const char *errmsg = redeclaration_error_message (newdecl, olddecl);
3275 cp_error (errmsg, newdecl);
3276 if (DECL_NAME (olddecl) != NULL_TREE)
3277 cp_error_at ((DECL_INITIAL (olddecl)
3278 && namespace_bindings_p ())
3279 ? "`%#D' previously defined here"
3280 : "`%#D' previously declared here", olddecl);
3282 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3283 && DECL_INITIAL (olddecl) != NULL_TREE
3284 && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3285 && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3287 /* Prototype decl follows defn w/o prototype. */
3288 cp_warning_at ("prototype for `%#D'", newdecl);
3289 cp_warning_at ("follows non-prototype definition here", olddecl);
3291 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3292 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3294 /* extern "C" int foo ();
3295 int foo () { bar (); }
3297 if (current_lang_stack
3298 == &VARRAY_TREE (current_lang_base, 0))
3299 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3302 cp_error_at ("previous declaration of `%#D' with %L linkage",
3303 olddecl, DECL_LANGUAGE (olddecl));
3304 cp_error ("conflicts with new declaration with %L linkage",
3305 DECL_LANGUAGE (newdecl));
3309 if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3311 else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3313 tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3314 tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3317 if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3318 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3320 for (; t1 && t1 != void_list_node;
3321 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3322 if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3324 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3329 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3331 cp_pedwarn_at ("after previous specification in `%#D'",
3337 cp_error ("default argument given for parameter %d of `%#D'",
3339 cp_error_at ("after previous specification in `%#D'",
3344 if (DECL_THIS_INLINE (newdecl) && ! DECL_THIS_INLINE (olddecl)
3345 && TREE_ADDRESSABLE (olddecl) && warn_inline)
3347 cp_warning ("`%#D' was used before it was declared inline",
3349 cp_warning_at ("previous non-inline declaration here",
3355 /* If new decl is `static' and an `extern' was seen previously,
3357 warn_extern_redeclared_static (newdecl, olddecl);
3359 /* We have committed to returning 1 at this point. */
3360 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3362 /* Now that functions must hold information normally held
3363 by field decls, there is extra work to do so that
3364 declaration information does not get destroyed during
3366 if (DECL_VINDEX (olddecl))
3367 DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3368 if (DECL_VIRTUAL_CONTEXT (olddecl))
3369 DECL_VIRTUAL_CONTEXT (newdecl) = DECL_VIRTUAL_CONTEXT (olddecl);
3370 if (DECL_CONTEXT (olddecl))
3371 DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3372 if (DECL_PENDING_INLINE_INFO (newdecl) == (struct pending_inline *)0)
3373 DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3374 DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3375 DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3376 DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl);
3377 DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3378 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3379 DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl);
3380 new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3382 /* Optionally warn about more than one declaration for the same
3383 name, but don't warn about a function declaration followed by a
3385 if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3386 && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3387 /* Don't warn about extern decl followed by definition. */
3388 && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3389 /* Don't warn about friends, let add_friend take care of it. */
3390 && ! DECL_FRIEND_P (newdecl))
3392 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl);
3393 cp_warning_at ("previous declaration of `%D'", olddecl);
3397 /* Deal with C++: must preserve virtual function table size. */
3398 if (TREE_CODE (olddecl) == TYPE_DECL)
3400 register tree newtype = TREE_TYPE (newdecl);
3401 register tree oldtype = TREE_TYPE (olddecl);
3403 if (newtype != error_mark_node && oldtype != error_mark_node
3404 && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3406 CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype);
3407 CLASSTYPE_FRIEND_CLASSES (newtype)
3408 = CLASSTYPE_FRIEND_CLASSES (oldtype);
3412 /* Copy all the DECL_... slots specified in the new decl
3413 except for any that we copy here from the old type. */
3414 DECL_MACHINE_ATTRIBUTES (newdecl)
3415 = merge_machine_decl_attributes (olddecl, newdecl);
3417 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3419 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl),
3420 DECL_TEMPLATE_RESULT (olddecl)))
3421 cp_error ("invalid redeclaration of %D", newdecl);
3422 TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3423 DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3424 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3425 DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3432 /* Automatically handles default parameters. */
3433 tree oldtype = TREE_TYPE (olddecl);
3436 /* Merge the data types specified in the two decls. */
3437 newtype = common_type (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3439 if (TREE_CODE (newdecl) == VAR_DECL)
3440 DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3441 /* Do this after calling `common_type' so that default
3442 parameters don't confuse us. */
3443 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3444 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3445 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3447 TREE_TYPE (newdecl) = build_exception_variant (newtype,
3448 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3449 TREE_TYPE (olddecl) = build_exception_variant (newtype,
3450 TYPE_RAISES_EXCEPTIONS (oldtype));
3452 if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3453 && DECL_SOURCE_LINE (olddecl) != 0
3455 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)),
3456 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1))
3458 cp_error ("declaration of `%F' throws different exceptions",
3460 cp_error_at ("than previous declaration `%F'", olddecl);
3463 TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3465 /* Lay the type out, unless already done. */
3466 if (! same_type_p (newtype, oldtype)
3467 && TREE_TYPE (newdecl) != error_mark_node
3468 && !(processing_template_decl && uses_template_parms (newdecl)))
3469 layout_type (TREE_TYPE (newdecl));
3471 if ((TREE_CODE (newdecl) == VAR_DECL
3472 || TREE_CODE (newdecl) == PARM_DECL
3473 || TREE_CODE (newdecl) == RESULT_DECL
3474 || TREE_CODE (newdecl) == FIELD_DECL
3475 || TREE_CODE (newdecl) == TYPE_DECL)
3476 && !(processing_template_decl && uses_template_parms (newdecl)))
3477 layout_decl (newdecl, 0);
3479 /* Merge the type qualifiers. */
3480 if (TREE_READONLY (newdecl))
3481 TREE_READONLY (olddecl) = 1;
3482 if (TREE_THIS_VOLATILE (newdecl))
3483 TREE_THIS_VOLATILE (olddecl) = 1;
3485 /* Merge the initialization information. */
3486 if (DECL_INITIAL (newdecl) == NULL_TREE
3487 && DECL_INITIAL (olddecl) != NULL_TREE)
3489 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3490 DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
3491 DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
3492 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl)
3493 && DECL_LANG_SPECIFIC (newdecl)
3494 && DECL_LANG_SPECIFIC (olddecl))
3495 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3498 /* Merge the section attribute.
3499 We want to issue an error if the sections conflict but that must be
3500 done later in decl_attributes since we are called before attributes
3502 if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3503 DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3505 /* Keep the old rtl since we can safely use it. */
3506 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3508 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3510 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl)
3511 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl);
3512 DECL_NO_CHECK_MEMORY_USAGE (newdecl)
3513 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl);
3514 DECL_NO_LIMIT_STACK (newdecl)
3515 |= DECL_NO_LIMIT_STACK (olddecl);
3518 /* If cannot merge, then use the new type and qualifiers,
3519 and don't preserve the old rtl. */
3522 /* Clean out any memory we had of the old declaration. */
3523 tree oldstatic = value_member (olddecl, static_aggregates);
3525 TREE_VALUE (oldstatic) = error_mark_node;
3527 TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3528 TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3529 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3530 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3533 /* Merge the storage class information. */
3534 DECL_WEAK (newdecl) |= DECL_WEAK (olddecl);
3535 DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3536 DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl);
3537 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3538 TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3539 if (! DECL_EXTERNAL (olddecl))
3540 DECL_EXTERNAL (newdecl) = 0;
3542 if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3544 DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3545 DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3546 DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3547 DECL_TEMPLATE_INSTANTIATED (newdecl)
3548 |= DECL_TEMPLATE_INSTANTIATED (olddecl);
3549 /* Don't really know how much of the language-specific
3550 values we should copy from old to new. */
3551 DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3552 DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl);
3553 DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3554 DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3555 olddecl_friend = DECL_FRIEND_P (olddecl);
3557 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3558 if (TREE_CODE (newdecl) == FUNCTION_DECL
3559 || DECL_FUNCTION_TEMPLATE_P (newdecl))
3560 DECL_BEFRIENDING_CLASSES (newdecl)
3561 = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
3562 DECL_BEFRIENDING_CLASSES (olddecl));
3565 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3567 if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3568 && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3570 /* If newdecl is not a specialization, then it is not a
3571 template-related function at all. And that means that we
3572 shoud have exited above, returning 0. */
3573 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3576 if (TREE_USED (olddecl))
3577 /* From [temp.expl.spec]:
3579 If a template, a member template or the member of a class
3580 template is explicitly specialized then that
3581 specialization shall be declared before the first use of
3582 that specialization that would cause an implicit
3583 instantiation to take place, in every translation unit in
3584 which such a use occurs. */
3585 cp_error ("explicit specialization of %D after first use",
3588 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3590 DECL_THIS_INLINE (newdecl) |= DECL_THIS_INLINE (olddecl);
3592 /* If either decl says `inline', this fn is inline, unless its
3593 definition was passed already. */
3594 if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3595 DECL_INLINE (olddecl) = 1;
3596 DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3600 DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3601 DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3602 DECL_RTL (olddecl) = DECL_RTL (newdecl);
3604 if (! types_match || new_defines_function)
3606 /* These need to be copied so that the names are available.
3607 Note that if the types do match, we'll preserve inline
3608 info and other bits, but if not, we won't. */
3609 DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3610 DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3612 if (new_defines_function)
3613 /* If defining a function declared with other language
3614 linkage, use the previously declared language linkage. */
3615 DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3616 else if (types_match)
3618 /* If redeclaring a builtin function, and not a definition,
3619 it stays built in. */
3620 if (DECL_BUILT_IN (olddecl))
3622 DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl);
3623 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3624 /* If we're keeping the built-in definition, keep the rtl,
3625 regardless of declaration matches. */
3626 DECL_RTL (newdecl) = DECL_RTL (olddecl);
3629 DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl);
3631 DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3632 if ((DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl)))
3633 /* Previously saved insns go together with
3634 the function's previous definition. */
3635 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3636 /* Don't clear out the arguments if we're redefining a function. */
3637 if (DECL_ARGUMENTS (olddecl))
3638 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3640 if (DECL_LANG_SPECIFIC (olddecl))
3641 DECL_MAIN_VARIANT (newdecl) = DECL_MAIN_VARIANT (olddecl);
3644 if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3646 NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3649 /* Now preserve various other info from the definition. */
3650 TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3651 TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3652 DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3653 DECL_ASSEMBLER_NAME (newdecl) = DECL_ASSEMBLER_NAME (olddecl);
3655 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3659 function_size = sizeof (struct tree_decl);
3661 bcopy ((char *) newdecl + sizeof (struct tree_common),
3662 (char *) olddecl + sizeof (struct tree_common),
3663 function_size - sizeof (struct tree_common));
3665 if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3667 /* If newdecl is a template instantiation, it is possible that
3668 the following sequence of events has occurred:
3670 o A friend function was declared in a class template. The
3671 class template was instantiated.
3673 o The instantiation of the friend declaration was
3674 recorded on the instantiation list, and is newdecl.
3676 o Later, however, instantiate_class_template called pushdecl
3677 on the newdecl to perform name injection. But, pushdecl in
3678 turn called duplicate_decls when it discovered that another
3679 declaration of a global function with the same name already
3682 o Here, in duplicate_decls, we decided to clobber newdecl.
3684 If we're going to do that, we'd better make sure that
3685 olddecl, and not newdecl, is on the list of
3686 instantiations so that if we try to do the instantiation
3687 again we won't get the clobbered declaration. */
3689 tree tmpl = DECL_TI_TEMPLATE (newdecl);
3690 tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3692 for (; decls; decls = TREE_CHAIN (decls))
3693 if (TREE_VALUE (decls) == newdecl)
3694 TREE_VALUE (decls) = olddecl;
3699 bcopy ((char *) newdecl + sizeof (struct tree_common),
3700 (char *) olddecl + sizeof (struct tree_common),
3701 sizeof (struct tree_decl) - sizeof (struct tree_common)
3702 + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *));
3705 DECL_UID (olddecl) = olddecl_uid;
3707 DECL_FRIEND_P (olddecl) = 1;
3709 /* NEWDECL contains the merged attribute lists.
3710 Update OLDDECL to be the same. */
3711 DECL_MACHINE_ATTRIBUTES (olddecl) = DECL_MACHINE_ATTRIBUTES (newdecl);
3716 /* Record a decl-node X as belonging to the current lexical scope.
3717 Check for errors (such as an incompatible declaration for the same
3718 name already seen in the same scope).
3720 Returns either X or an old decl for the same name.
3721 If an old decl is returned, it may have been smashed
3722 to agree with what X says. */
3730 int need_new_binding;
3732 /* We shouldn't be calling pushdecl when we're generating RTL for a
3733 function that we already did semantic analysis on previously. */
3734 my_friendly_assert (!cfun || doing_semantic_analysis_p (),
3737 name = DECL_ASSEMBLER_NAME (x);
3738 need_new_binding = 1;
3740 if (DECL_TEMPLATE_PARM_P (x))
3741 /* Template parameters have no context; they are not X::T even
3742 when declared within a class or namespace. */
3746 if (current_function_decl && x != current_function_decl
3747 /* A local declaration for a function doesn't constitute
3749 && !(TREE_CODE (x) == FUNCTION_DECL && !DECL_INITIAL (x))
3750 /* A local declaration for an `extern' variable is in the
3751 scoped of the current namespace, not the current
3753 && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
3754 && !DECL_CONTEXT (x))
3755 DECL_CONTEXT (x) = current_function_decl;
3756 if (!DECL_CONTEXT (x))
3757 DECL_CONTEXT (x) = FROB_CONTEXT (current_namespace);
3759 /* If this is the declaration for a namespace-scope function,
3760 but the declaration itself is in a local scope, mark the
3762 if (TREE_CODE (x) == FUNCTION_DECL
3763 && DECL_NAMESPACE_SCOPE_P (x)
3764 && current_function_decl
3765 && x != current_function_decl)
3766 DECL_LOCAL_FUNCTION_P (x) = 1;
3769 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3770 compiler wants to use. */
3771 if (TREE_CODE (x) == TYPE_DECL || TREE_CODE (x) == VAR_DECL
3772 || TREE_CODE (x) == NAMESPACE_DECL)
3773 name = DECL_NAME (x);
3778 /* Not needed...see below. */
3782 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3783 name = TREE_OPERAND (name, 0);
3785 /* Namespace-scoped variables are not found in the current level. */
3786 if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x))
3787 t = namespace_binding (name, DECL_CONTEXT (x));
3789 t = lookup_name_current_level (name);
3790 if (t == error_mark_node)
3792 /* error_mark_node is 0 for a while during initialization! */
3794 cp_error_at ("`%#D' used prior to declaration", x);
3797 else if (t != NULL_TREE)
3800 /* This is turned off until I have time to do it right (bpk). */
3801 /* With the code below that uses it... */
3802 file = DECL_SOURCE_FILE (t);
3803 line = DECL_SOURCE_LINE (t);
3805 if (TREE_CODE (t) == PARM_DECL)
3807 if (DECL_CONTEXT (t) == NULL_TREE)
3808 fatal ("parse errors have confused me too much");
3810 /* Check for duplicate params. */
3811 if (duplicate_decls (x, t))
3814 else if (((TREE_CODE (x) == FUNCTION_DECL && DECL_LANGUAGE (x) == lang_c)
3815 || DECL_FUNCTION_TEMPLATE_P (x))
3816 && is_overloaded_fn (t))
3817 /* Don't do anything just yet. */;
3818 else if (t == wchar_decl_node)
3820 if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3821 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x));
3823 /* Throw away the redeclaration. */
3826 else if (TREE_CODE (t) != TREE_CODE (x))
3828 if (duplicate_decls (x, t))
3831 else if (duplicate_decls (x, t))
3834 /* This is turned off until I have time to do it right (bpk). */
3836 /* Also warn if they did a prototype with `static' on it, but
3837 then later left the `static' off. */
3838 if (! TREE_PUBLIC (name) && TREE_PUBLIC (x))
3840 if (DECL_LANG_SPECIFIC (t) && DECL_FRIEND_P (t))
3845 cp_warning ("`static' missing from declaration of `%D'",
3847 warning_with_file_and_line (file, line,
3848 "previous declaration of `%s'",
3849 decl_as_string (t, 0));
3852 /* Now fix things so it'll do what they expect. */
3853 if (current_function_decl)
3854 TREE_PUBLIC (current_function_decl) = 0;
3856 /* Due to interference in memory reclamation (X may be
3857 obstack-deallocated at this point), we must guard against
3858 one really special case. [jason: This should be handled
3859 by start_function] */
3860 if (current_function_decl == x)
3861 current_function_decl = t;
3863 if (TREE_CODE (t) == TYPE_DECL)
3864 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3865 else if (TREE_CODE (t) == FUNCTION_DECL)
3866 check_default_args (t);
3870 else if (DECL_MAIN_P (x))
3872 /* A redeclaration of main, but not a duplicate of the
3877 This function shall not be overloaded. */
3878 cp_error_at ("invalid redeclaration of `%D'", t);
3879 cp_error ("as `%D'", x);
3880 /* We don't try to push this declaration since that
3886 check_template_shadow (x);
3888 /* If this is a function conjured up by the backend, massage it
3889 so it looks friendly. */
3890 if (TREE_CODE (x) == FUNCTION_DECL
3891 && ! DECL_LANG_SPECIFIC (x))
3893 retrofit_lang_decl (x);
3894 DECL_LANGUAGE (x) = lang_c;
3897 if (TREE_CODE (x) == FUNCTION_DECL && ! DECL_FUNCTION_MEMBER_P (x))
3899 t = push_overloaded_decl (x, PUSH_LOCAL);
3902 if (!namespace_bindings_p ())
3903 /* We do not need to create a binding for this name;
3904 push_overloaded_decl will have already done so if
3906 need_new_binding = 0;
3908 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
3910 t = push_overloaded_decl (x, PUSH_GLOBAL);
3912 add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
3916 /* If declaring a type as a typedef, copy the type (unless we're
3917 at line 0), and install this TYPE_DECL as the new type's typedef
3918 name. See the extensive comment in ../c-decl.c (pushdecl). */
3919 if (TREE_CODE (x) == TYPE_DECL)
3921 tree type = TREE_TYPE (x);
3922 if (DECL_SOURCE_LINE (x) == 0)
3924 if (TYPE_NAME (type) == 0)
3925 TYPE_NAME (type) = x;
3927 else if (type != error_mark_node && TYPE_NAME (type) != x
3928 /* We don't want to copy the type when all we're
3929 doing is making a TYPE_DECL for the purposes of
3931 && (!TYPE_NAME (type)
3932 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
3934 DECL_ORIGINAL_TYPE (x) = type;
3935 type = build_type_copy (type);
3936 TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
3937 TYPE_NAME (type) = x;
3938 TREE_TYPE (x) = type;
3941 if (type != error_mark_node
3943 && TYPE_IDENTIFIER (type))
3944 set_identifier_type_value_with_scope (DECL_NAME (x), type,
3945 current_binding_level);
3949 /* Multiple external decls of the same identifier ought to match.
3951 We get warnings about inline functions where they are defined.
3952 We get warnings about other functions from push_overloaded_decl.
3954 Avoid duplicate warnings where they are used. */
3955 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
3959 if (IDENTIFIER_NAMESPACE_VALUE (name) != NULL_TREE
3960 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name))
3961 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name))))
3962 decl = IDENTIFIER_NAMESPACE_VALUE (name);
3967 /* If different sort of thing, we already gave an error. */
3968 && TREE_CODE (decl) == TREE_CODE (x)
3969 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
3971 cp_pedwarn ("type mismatch with previous external decl", x);
3972 cp_pedwarn_at ("previous external decl of `%#D'", decl);
3976 /* This name is new in its binding level.
3977 Install the new declaration and return it. */
3978 if (namespace_bindings_p ())
3980 /* Install a global value. */
3982 /* If the first global decl has external linkage,
3983 warn if we later see static one. */
3984 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
3985 TREE_PUBLIC (name) = 1;
3987 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
3989 /* For an ordinary function, we create a binding from
3990 the mangled name (i.e., NAME) to the DECL. But, for
3991 an `extern "C"' function, the mangled name and the
3992 ordinary name are the same so we need not do this. */
3993 && !(TREE_CODE (x) == FUNCTION_DECL &&
3994 DECL_LANGUAGE (x) == lang_c))
3996 if (TREE_CODE (x) == FUNCTION_DECL)
3998 ((IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE)
3999 || (IDENTIFIER_GLOBAL_VALUE (name) == x), 378);
4000 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
4003 /* Don't forget if the function was used via an implicit decl. */
4004 if (IDENTIFIER_IMPLICIT_DECL (name)
4005 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
4008 /* Don't forget if its address was taken in that way. */
4009 if (IDENTIFIER_IMPLICIT_DECL (name)
4010 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
4011 TREE_ADDRESSABLE (x) = 1;
4013 /* Warn about mismatches against previous implicit decl. */
4014 if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
4015 /* If this real decl matches the implicit, don't complain. */
4016 && ! (TREE_CODE (x) == FUNCTION_DECL
4017 && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
4019 ("`%D' was previously implicitly declared to return `int'", x);
4021 /* If new decl is `static' and an `extern' was seen previously,
4023 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
4024 warn_extern_redeclared_static (x, t);
4028 /* Here to install a non-global value. */
4029 tree oldlocal = IDENTIFIER_VALUE (name);
4030 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
4032 if (need_new_binding)
4034 push_local_binding (name, x, 0);
4035 /* Because push_local_binding will hook X on to the
4036 current_binding_level's name list, we don't want to
4037 do that again below. */
4038 need_new_binding = 0;
4041 /* If this is a TYPE_DECL, push it into the type value slot. */
4042 if (TREE_CODE (x) == TYPE_DECL)
4043 set_identifier_type_value_with_scope (name, TREE_TYPE (x),
4044 current_binding_level);
4046 /* Clear out any TYPE_DECL shadowed by a namespace so that
4047 we won't think this is a type. The C struct hack doesn't
4048 go through namespaces. */
4049 if (TREE_CODE (x) == NAMESPACE_DECL)
4050 set_identifier_type_value_with_scope (name, NULL_TREE,
4051 current_binding_level);
4057 && TREE_CODE (oldlocal) == VAR_DECL
4058 && DECL_DEAD_FOR_LOCAL (oldlocal))
4060 oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal);
4062 if (oldlocal == NULL_TREE)
4063 oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d));
4066 /* If this is an extern function declaration, see if we
4067 have a global definition or declaration for the function. */
4068 if (oldlocal == NULL_TREE
4069 && DECL_EXTERNAL (x)
4070 && oldglobal != NULL_TREE
4071 && TREE_CODE (x) == FUNCTION_DECL
4072 && TREE_CODE (oldglobal) == FUNCTION_DECL)
4074 /* We have one. Their types must agree. */
4075 if (decls_match (x, oldglobal))
4079 cp_warning ("extern declaration of `%#D' doesn't match", x);
4080 cp_warning_at ("global declaration `%#D'", oldglobal);
4083 /* If we have a local external declaration,
4084 and no file-scope declaration has yet been seen,
4085 then if we later have a file-scope decl it must not be static. */
4086 if (oldlocal == NULL_TREE
4087 && oldglobal == NULL_TREE
4088 && DECL_EXTERNAL (x)
4090 TREE_PUBLIC (name) = 1;
4092 /* Warn if shadowing an argument at the top level of the body. */
4093 if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
4094 /* Inline decls shadow nothing. */
4095 && !DECL_FROM_INLINE (x)
4096 && TREE_CODE (oldlocal) == PARM_DECL
4097 /* Don't complain if it's from an enclosing function. */
4098 && DECL_CONTEXT (oldlocal) == current_function_decl
4099 && TREE_CODE (x) != PARM_DECL)
4101 /* Go to where the parms should be and see if we
4103 struct binding_level *b = current_binding_level->level_chain;
4109 if (b->parm_flag == 1)
4110 cp_error ("declaration of `%#D' shadows a parameter", name);
4113 /* Maybe warn if shadowing something else. */
4114 if (warn_shadow && !DECL_EXTERNAL (x)
4115 /* Inline decls shadow nothing. */
4116 && !DECL_FROM_INLINE (x)
4117 /* No shadow warnings for internally generated vars. */
4118 && ! DECL_ARTIFICIAL (x)
4119 /* No shadow warnings for vars made for inlining. */
4120 && ! DECL_FROM_INLINE (x))
4122 if (oldlocal != NULL_TREE && TREE_CODE (oldlocal) == PARM_DECL)
4123 warning ("declaration of `%s' shadows a parameter",
4124 IDENTIFIER_POINTER (name));
4125 else if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
4126 && current_class_ptr
4127 && !TREE_STATIC (name))
4128 warning ("declaration of `%s' shadows a member of `this'",
4129 IDENTIFIER_POINTER (name));
4130 else if (oldlocal != NULL_TREE)
4131 warning ("declaration of `%s' shadows previous local",
4132 IDENTIFIER_POINTER (name));
4133 else if (oldglobal != NULL_TREE)
4134 /* XXX shadow warnings in outer-more namespaces */
4135 warning ("declaration of `%s' shadows global declaration",
4136 IDENTIFIER_POINTER (name));
4140 if (TREE_CODE (x) == FUNCTION_DECL)
4141 check_default_args (x);
4143 /* Keep count of variables in this level with incomplete type. */
4144 if (TREE_CODE (x) == VAR_DECL
4145 && TREE_TYPE (x) != error_mark_node
4146 && ((TYPE_SIZE (TREE_TYPE (x)) == NULL_TREE
4147 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x), ARRAY_TYPE))
4148 /* RTTI TD entries are created while defining the type_info. */
4149 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x))
4150 && TYPE_BEING_DEFINED (TREE_TYPE (x)))))
4152 if (namespace_bindings_p ())
4153 namespace_scope_incomplete
4154 = tree_cons (NULL_TREE, x, namespace_scope_incomplete);
4156 current_binding_level->incomplete
4157 = tree_cons (NULL_TREE, x, current_binding_level->incomplete);
4161 if (need_new_binding)
4162 add_decl_to_level (x,
4163 DECL_NAMESPACE_SCOPE_P (x)
4164 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
4165 : current_binding_level);
4170 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4171 caller to set DECL_CONTEXT properly. */
4174 pushdecl_with_scope (x, level)
4176 struct binding_level *level;
4178 register struct binding_level *b;
4179 tree function_decl = current_function_decl;
4181 current_function_decl = NULL_TREE;
4182 if (level->parm_flag == 2)
4184 b = class_binding_level;
4185 class_binding_level = level;
4186 pushdecl_class_level (x);
4187 class_binding_level = b;
4191 b = current_binding_level;
4192 current_binding_level = level;
4194 current_binding_level = b;
4196 current_function_decl = function_decl;
4200 /* Like pushdecl, only it places X in the current namespace,
4204 pushdecl_namespace_level (x)
4207 register struct binding_level *b = current_binding_level;
4210 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
4212 /* Now, the type_shadowed stack may screw us. Munge it so it does
4214 if (TREE_CODE (x) == TYPE_DECL)
4216 tree name = DECL_NAME (x);
4218 tree *ptr = (tree *)0;
4219 for (; b != global_binding_level; b = b->level_chain)
4221 tree shadowed = b->type_shadowed;
4222 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
4223 if (TREE_PURPOSE (shadowed) == name)
4225 ptr = &TREE_VALUE (shadowed);
4226 /* Can't break out of the loop here because sometimes
4227 a binding level will have duplicate bindings for
4228 PT names. It's gross, but I haven't time to fix it. */
4231 newval = TREE_TYPE (x);
4232 if (ptr == (tree *)0)
4234 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4235 up here if this is changed to an assertion. --KR */
4236 SET_IDENTIFIER_TYPE_VALUE (name, newval);
4246 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4250 pushdecl_top_level (x)
4253 push_to_top_level ();
4254 x = pushdecl_namespace_level (x);
4255 pop_from_top_level ();
4259 /* Make the declaration of X appear in CLASS scope. */
4262 pushdecl_class_level (x)
4265 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4266 scope looks for the pre-mangled name. */
4269 if (TREE_CODE (x) == OVERLOAD)
4270 x = OVL_CURRENT (x);
4271 name = DECL_NAME (x);
4275 push_class_level_binding (name, x);
4276 if (TREE_CODE (x) == TYPE_DECL)
4277 set_identifier_type_value (name, TREE_TYPE (x));
4279 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
4283 for (f = TYPE_FIELDS (TREE_TYPE (x));
4286 pushdecl_class_level (f);
4290 /* Enter DECL into the symbol table, if that's appropriate. Returns
4291 DECL, or a modified version thereof. */
4294 maybe_push_decl (decl)
4297 tree type = TREE_TYPE (decl);
4299 /* Add this decl to the current binding level, but not if it comes
4300 from another scope, e.g. a static member variable. TEM may equal
4301 DECL or it may be a previous decl of the same name. */
4302 if (decl == error_mark_node
4303 || (TREE_CODE (decl) != PARM_DECL
4304 && DECL_CONTEXT (decl) != NULL_TREE
4305 /* Definitions of namespace members outside their namespace are
4307 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
4308 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
4309 || TREE_CODE (type) == UNKNOWN_TYPE
4310 /* The declaration of a template specialization does not affect
4311 the functions available for overload resolution, so we do not
4313 || (TREE_CODE (decl) == FUNCTION_DECL
4314 && DECL_TEMPLATE_SPECIALIZATION (decl)))
4317 return pushdecl (decl);
4320 /* Make the declaration(s) of X appear in CLASS scope
4321 under the name NAME. */
4324 push_class_level_binding (name, x)
4329 /* The class_binding_level will be NULL if x is a template
4330 parameter name in a member template. */
4331 if (!class_binding_level)
4334 /* Make sure that this new member does not have the same name
4335 as a template parameter. */
4336 if (TYPE_BEING_DEFINED (current_class_type))
4337 check_template_shadow (x);
4339 /* If this declaration shadows a declaration from an enclosing
4340 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4341 we leave this class. Record the shadowed declaration here. */
4342 binding = IDENTIFIER_BINDING (name);
4344 && ((TREE_CODE (x) == OVERLOAD
4345 && BINDING_VALUE (binding)
4346 && is_overloaded_fn (BINDING_VALUE (binding)))
4347 || INHERITED_VALUE_BINDING_P (binding)))
4352 /* If the old binding was from a base class, and was for a tag
4353 name, slide it over to make room for the new binding. The
4354 old binding is still visible if explicitly qualified with a
4356 if (INHERITED_VALUE_BINDING_P (binding)
4357 && BINDING_VALUE (binding)
4358 && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
4359 && DECL_ARTIFICIAL (BINDING_VALUE (binding))
4360 && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
4362 old_decl = BINDING_TYPE (binding);
4363 BINDING_TYPE (binding) = BINDING_VALUE (binding);
4364 BINDING_VALUE (binding) = NULL_TREE;
4365 INHERITED_VALUE_BINDING_P (binding) = 0;
4368 old_decl = BINDING_VALUE (binding);
4370 /* There was already a binding for X containing fewer
4371 functions than are named in X. Find the previous
4372 declaration of X on the class-shadowed list, and update it. */
4373 for (shadow = class_binding_level->class_shadowed;
4375 shadow = TREE_CHAIN (shadow))
4376 if (TREE_PURPOSE (shadow) == name
4377 && TREE_TYPE (shadow) == old_decl)
4379 BINDING_VALUE (binding) = x;
4380 INHERITED_VALUE_BINDING_P (binding) = 0;
4381 TREE_TYPE (shadow) = x;
4386 /* If we didn't replace an existing binding, put the binding on the
4387 stack of bindings for the identifier, and update
4388 IDENTIFIER_CLASS_VALUE. */
4389 if (push_class_binding (name, x))
4391 class_binding_level->class_shadowed
4392 = tree_cons (name, IDENTIFIER_CLASS_VALUE (name),
4393 class_binding_level->class_shadowed);
4394 /* Record the value we are binding NAME to so that we can know
4395 what to pop later. */
4396 TREE_TYPE (class_binding_level->class_shadowed) = x;
4400 /* Insert another USING_DECL into the current binding level,
4401 returning this declaration. If this is a redeclaration,
4402 do nothing and return NULL_TREE. */
4405 push_using_decl (scope, name)
4411 my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4412 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4413 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4414 if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4418 decl = build_lang_decl (USING_DECL, name, void_type_node);
4419 DECL_INITIAL (decl) = scope;
4420 TREE_CHAIN (decl) = current_binding_level->usings;
4421 current_binding_level->usings = decl;
4425 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4426 changed (i.e. there was already a directive), or the fresh
4427 TREE_LIST otherwise. */
4430 push_using_directive (used)
4433 tree ud = current_binding_level->using_directives;
4434 tree iter, ancestor;
4436 /* Check if we already have this. */
4437 if (purpose_member (used, ud) != NULL_TREE)
4440 /* Recursively add all namespaces used. */
4441 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4442 push_using_directive (TREE_PURPOSE (iter));
4444 ancestor = namespace_ancestor (current_decl_namespace (), used);
4445 ud = current_binding_level->using_directives;
4446 ud = tree_cons (used, ancestor, ud);
4447 current_binding_level->using_directives = ud;
4451 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4452 other definitions already in place. We get around this by making
4453 the value of the identifier point to a list of all the things that
4454 want to be referenced by that name. It is then up to the users of
4455 that name to decide what to do with that list.
4457 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4458 slot. It is dealt with the same way.
4460 FLAGS is a bitwise-or of the following values:
4461 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4463 PUSH_USING: DECL is being pushed as the result of a using
4466 The value returned may be a previous declaration if we guessed wrong
4467 about what language DECL should belong to (C or C++). Otherwise,
4468 it's always DECL (and never something that's not a _DECL). */
4471 push_overloaded_decl (decl, flags)
4475 tree name = DECL_NAME (decl);
4478 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4481 old = namespace_binding (name, DECL_CONTEXT (decl));
4483 old = lookup_name_current_level (name);
4487 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4489 tree t = TREE_TYPE (old);
4490 if (IS_AGGR_TYPE (t) && warn_shadow
4491 && (! DECL_IN_SYSTEM_HEADER (decl)
4492 || ! DECL_IN_SYSTEM_HEADER (old)))
4493 cp_warning ("`%#D' hides constructor for `%#T'", decl, t);
4496 else if (is_overloaded_fn (old))
4500 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4502 tree fn = OVL_CURRENT (tmp);
4504 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4505 && !(flags & PUSH_USING)
4506 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4507 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4508 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4511 if (duplicate_decls (decl, fn))
4517 cp_error_at ("previous non-function declaration `%#D'", old);
4518 cp_error ("conflicts with function declaration `%#D'", decl);
4523 if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4525 if (old && TREE_CODE (old) != OVERLOAD)
4526 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4528 new_binding = ovl_cons (decl, old);
4529 if (flags & PUSH_USING)
4530 OVL_USED (new_binding) = 1;
4533 /* NAME is not ambiguous. */
4537 set_namespace_binding (name, current_namespace, new_binding);
4540 /* We only create an OVERLOAD if there was a previous binding at
4541 this level, or if decl is a template. In the former case, we
4542 need to remove the old binding and replace it with the new
4543 binding. We must also run through the NAMES on the binding
4544 level where the name was bound to update the chain. */
4546 if (TREE_CODE (new_binding) == OVERLOAD && old)
4550 for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4552 d = &TREE_CHAIN (*d))
4554 || (TREE_CODE (*d) == TREE_LIST
4555 && TREE_VALUE (*d) == old))
4557 if (TREE_CODE (*d) == TREE_LIST)
4558 /* Just replace the old binding with the new. */
4559 TREE_VALUE (*d) = new_binding;
4561 /* Build a TREE_LIST to wrap the OVERLOAD. */
4562 *d = tree_cons (NULL_TREE, new_binding,
4565 /* And update the CPLUS_BINDING node. */
4566 BINDING_VALUE (IDENTIFIER_BINDING (name))
4571 /* We should always find a previous binding in this case. */
4572 my_friendly_abort (0);
4575 /* Install the new binding. */
4576 push_local_binding (name, new_binding, flags);
4582 /* Generate an implicit declaration for identifier FUNCTIONID
4583 as a function of type int (). Print a warning if appropriate. */
4586 implicitly_declare (functionid)
4591 /* We used to reuse an old implicit decl here,
4592 but this loses with inline functions because it can clobber
4593 the saved decl chains. */
4594 decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4596 DECL_EXTERNAL (decl) = 1;
4597 TREE_PUBLIC (decl) = 1;
4599 /* ISO standard says implicit declarations are in the innermost block.
4600 So we record the decl in the standard fashion. */
4602 rest_of_decl_compilation (decl, NULL_PTR, 0, 0);
4605 /* Only one warning per identifier. */
4606 && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4608 cp_pedwarn ("implicit declaration of function `%#D'", decl);
4611 SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4616 /* Return zero if the declaration NEWDECL is valid
4617 when the declaration OLDDECL (assumed to be for the same name)
4618 has already been seen.
4619 Otherwise return an error message format string with a %s
4620 where the identifier should go. */
4623 redeclaration_error_message (newdecl, olddecl)
4624 tree newdecl, olddecl;
4626 if (TREE_CODE (newdecl) == TYPE_DECL)
4628 /* Because C++ can put things into name space for free,
4629 constructs like "typedef struct foo { ... } foo"
4630 would look like an erroneous redeclaration. */
4631 if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4634 return "redefinition of `%#D'";
4636 else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4638 /* If this is a pure function, its olddecl will actually be
4639 the original initialization to `0' (which we force to call
4640 abort()). Don't complain about redefinition in this case. */
4641 if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl))
4644 /* If both functions come from different namespaces, this is not
4645 a redeclaration - this is a conflict with a used function. */
4646 if (DECL_NAMESPACE_SCOPE_P (olddecl)
4647 && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4648 return "`%D' conflicts with used function";
4650 /* We'll complain about linkage mismatches in
4651 warn_extern_redeclared_static. */
4653 /* Defining the same name twice is no good. */
4654 if (DECL_INITIAL (olddecl) != NULL_TREE
4655 && DECL_INITIAL (newdecl) != NULL_TREE)
4657 if (DECL_NAME (olddecl) == NULL_TREE)
4658 return "`%#D' not declared in class";
4660 return "redefinition of `%#D'";
4664 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4666 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4667 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4668 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4669 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4670 && TYPE_SIZE (TREE_TYPE (newdecl))
4671 && TYPE_SIZE (TREE_TYPE (olddecl))))
4672 return "redefinition of `%#D'";
4675 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl))
4677 /* Objects declared at top level: */
4678 /* If at least one is a reference, it's ok. */
4679 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4681 /* Reject two definitions. */
4682 return "redefinition of `%#D'";
4686 /* Objects declared with block scope: */
4687 /* Reject two definitions, and reject a definition
4688 together with an external reference. */
4689 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4690 return "redeclaration of `%#D'";
4695 /* Create a new label, named ID. */
4698 make_label_decl (id, local_p)
4704 decl = build_decl (LABEL_DECL, id, void_type_node);
4706 /* Make sure every label has an rtx. */
4709 DECL_CONTEXT (decl) = current_function_decl;
4710 DECL_MODE (decl) = VOIDmode;
4711 C_DECLARED_LABEL_FLAG (decl) = local_p;
4713 /* Say where one reference is to the label, for the sake of the
4714 error if it is not defined. */
4715 DECL_SOURCE_LINE (decl) = lineno;
4716 DECL_SOURCE_FILE (decl) = input_filename;
4718 /* Record the fact that this identifier is bound to this label. */
4719 SET_IDENTIFIER_LABEL_VALUE (id, decl);
4721 /* Record this label on the list of used labels so that we can check
4722 at the end of the function to see whether or not the label was
4723 actually defined. */
4724 if ((named_label_uses == NULL || named_label_uses->label_decl != decl)
4725 && (named_label_uses == NULL
4726 || named_label_uses->names_in_scope != current_binding_level->names
4727 || named_label_uses->label_decl != decl))
4729 struct named_label_list *new_ent;
4731 = (struct named_label_list*)oballoc (sizeof (struct named_label_list));
4732 new_ent->label_decl = decl;
4733 new_ent->names_in_scope = current_binding_level->names;
4734 new_ent->binding_level = current_binding_level;
4735 new_ent->lineno_o_goto = lineno;
4736 new_ent->filename_o_goto = input_filename;
4737 new_ent->next = named_label_uses;
4738 named_label_uses = new_ent;
4744 /* Look for a label named ID in the current function. If one cannot
4745 be found, create one. (We keep track of used, but undefined,
4746 labels, and complain about them at the end of a function.) */
4754 /* You can't use labels at global scope. */
4755 if (current_function_decl == NULL_TREE)
4757 error ("label `%s' referenced outside of any function",
4758 IDENTIFIER_POINTER (id));
4762 /* See if we've already got this label. */
4763 decl = IDENTIFIER_LABEL_VALUE (id);
4764 if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl)
4767 /* Record this label on the list of labels used in this function.
4768 We do this before calling make_label_decl so that we get the
4769 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4770 named_labels = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4772 /* We need a new label. */
4773 decl = make_label_decl (id, /*local_p=*/0);
4774 /* Now fill in the information we didn't have before. */
4775 TREE_VALUE (named_labels) = decl;
4780 /* Declare a local label named ID. */
4783 declare_local_label (id)
4788 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4789 this scope we can restore the old value of
4790 IDENTIFIER_TYPE_VALUE. */
4791 current_binding_level->shadowed_labels
4792 = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4793 current_binding_level->shadowed_labels);
4794 /* Look for the label. */
4795 decl = make_label_decl (id, /*local_p=*/1);
4796 /* Now fill in the information we didn't have before. */
4797 TREE_VALUE (current_binding_level->shadowed_labels) = decl;
4802 /* Define a label, specifying the location in the source file.
4803 Return the LABEL_DECL node for the label, if the definition is valid.
4804 Otherwise return 0. */
4807 define_label (filename, line, name)
4812 tree decl = lookup_label (name);
4814 /* After labels, make any new cleanups go into their
4815 own new (temporary) binding contour. */
4816 current_binding_level->more_cleanups_ok = 0;
4818 if (name == get_identifier ("wchar_t"))
4819 cp_pedwarn ("label named wchar_t");
4821 if (DECL_INITIAL (decl) != NULL_TREE)
4823 cp_error ("duplicate label `%D'", decl);
4828 struct named_label_list *uses, *prev;
4832 /* Mark label as having been defined. */
4833 DECL_INITIAL (decl) = error_mark_node;
4834 /* Say where in the source. */
4835 DECL_SOURCE_FILE (decl) = filename;
4836 DECL_SOURCE_LINE (decl) = line;
4839 uses = named_label_uses;
4840 while (uses != NULL)
4841 if (uses->label_decl == decl)
4843 struct binding_level *b = current_binding_level;
4846 tree new_decls = b->names;
4847 tree old_decls = (b == uses->binding_level)
4848 ? uses->names_in_scope : NULL_TREE;
4849 while (new_decls != old_decls)
4851 if (TREE_CODE (new_decls) == VAR_DECL
4852 /* Don't complain about crossing initialization
4853 of internal entities. They can't be accessed,
4854 and they should be cleaned up
4855 by the time we get to the label. */
4856 && ! DECL_ARTIFICIAL (new_decls)
4857 && !(DECL_INITIAL (new_decls) == NULL_TREE
4858 && pod_type_p (TREE_TYPE (new_decls))))
4860 /* This is really only important if we're crossing
4861 an initialization. The POD stuff is just
4862 pedantry; why should it matter if the class
4863 contains a field of pointer to member type? */
4864 int problem = (DECL_INITIAL (new_decls)
4865 || (TYPE_NEEDS_CONSTRUCTING
4866 (TREE_TYPE (new_decls))));
4872 cp_error ("jump to label `%D'", decl);
4873 error_with_file_and_line
4874 (uses->filename_o_goto,
4875 uses->lineno_o_goto, " from here");
4879 cp_pedwarn ("jump to label `%D'", decl);
4880 pedwarn_with_file_and_line
4881 (uses->filename_o_goto,
4882 uses->lineno_o_goto, " from here");
4888 cp_error_at (" crosses initialization of `%#D'",
4891 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4894 new_decls = TREE_CHAIN (new_decls);
4896 if (b == uses->binding_level)
4898 if (b->eh_region && ! saw_eh)
4902 cp_error ("jump to label `%D'", decl);
4903 error_with_file_and_line
4904 (uses->filename_o_goto,
4905 uses->lineno_o_goto, " from here");
4908 error (" enters exception handling block");
4915 prev->next = uses->next;
4917 named_label_uses = uses->next;
4926 current_function_return_value = NULL_TREE;
4933 struct binding_level *level;
4934 struct cp_switch *next;
4937 static struct cp_switch *switch_stack;
4943 = (struct cp_switch *) oballoc (sizeof (struct cp_switch));
4944 p->level = current_binding_level;
4945 p->next = switch_stack;
4952 switch_stack = switch_stack->next;
4955 /* Note that we've seen a definition of a case label, and complain if this
4956 is a bad place for one. */
4959 define_case_label ()
4961 tree cleanup = last_cleanup_this_contour ();
4962 struct binding_level *b = current_binding_level;
4966 /* Don't crash; we'll complain in do_case. */
4971 static int explained = 0;
4972 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup));
4973 warning ("where case label appears here");
4976 warning ("(enclose actions of previous case statements requiring");
4977 warning ("destructors in their own binding contours.)");
4982 for (; b && b != switch_stack->level; b = b->level_chain)
4984 tree new_decls = b->names;
4985 for (; new_decls; new_decls = TREE_CHAIN (new_decls))
4987 if (TREE_CODE (new_decls) == VAR_DECL
4988 /* Don't complain about crossing initialization
4989 of internal entities. They can't be accessed,
4990 and they should be cleaned up
4991 by the time we get to the label. */
4992 && ! DECL_ARTIFICIAL (new_decls)
4993 && ((DECL_INITIAL (new_decls) != NULL_TREE
4994 && DECL_INITIAL (new_decls) != error_mark_node)
4995 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls))))
4998 error ("jump to case label");
5000 cp_error_at (" crosses initialization of `%#D'",
5006 /* After labels, make any new cleanups go into their
5007 own new (temporary) binding contour. */
5009 current_binding_level->more_cleanups_ok = 0;
5010 current_function_return_value = NULL_TREE;
5013 /* Return the list of declarations of the current level.
5014 Note that this list is in reverse order unless/until
5015 you nreverse it; and when you do nreverse it, you must
5016 store the result back using `storedecls' or you will lose. */
5021 return current_binding_level->names;
5024 /* Return the list of type-tags (for structs, etc) of the current level. */
5029 return current_binding_level->tags;
5032 /* Store the list of declarations of the current level.
5033 This is done for the parameter declarations of a function being defined,
5034 after they are modified in the light of any missing parameters. */
5040 current_binding_level->names = decls;
5043 /* Similarly, store the list of tags of the current level. */
5049 current_binding_level->tags = tags;
5052 /* Given NAME, an IDENTIFIER_NODE,
5053 return the structure (or union or enum) definition for that name.
5054 Searches binding levels from BINDING_LEVEL up to the global level.
5055 If THISLEVEL_ONLY is nonzero, searches only the specified context
5056 (but skips any tag-transparent contexts to find one that is
5057 meaningful for tags).
5058 FORM says which kind of type the caller wants;
5059 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5060 If the wrong kind of type is found, and it's not a template, an error is
5064 lookup_tag (form, name, binding_level, thislevel_only)
5065 enum tree_code form;
5067 struct binding_level *binding_level;
5070 register struct binding_level *level;
5071 /* Non-zero if, we should look past a template parameter level, even
5072 if THISLEVEL_ONLY. */
5073 int allow_template_parms_p = 1;
5075 for (level = binding_level; level; level = level->level_chain)
5078 if (ANON_AGGRNAME_P (name))
5079 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5081 /* There's no need for error checking here, because
5082 anon names are unique throughout the compilation. */
5083 if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
5084 return TREE_VALUE (tail);
5086 else if (level->namespace_p)
5087 /* Do namespace lookup. */
5088 for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
5090 tree old = binding_for_name (name, tail);
5092 /* If we just skipped past a template parameter level,
5093 even though THISLEVEL_ONLY, and we find a template
5094 class declaration, then we use the _TYPE node for the
5095 template. See the example below. */
5096 if (thislevel_only && !allow_template_parms_p
5097 && old && BINDING_VALUE (old)
5098 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
5099 old = TREE_TYPE (BINDING_VALUE (old));
5101 old = BINDING_TYPE (old);
5103 /* If it has an original type, it is a typedef, and we
5104 should not return it. */
5105 if (old && DECL_ORIGINAL_TYPE (TYPE_NAME (old)))
5107 if (old && TREE_CODE (old) != form
5108 && !(form != ENUMERAL_TYPE && TREE_CODE (old) == TEMPLATE_DECL))
5110 cp_error ("`%#D' redeclared as %C", old, form);
5115 if (thislevel_only || tail == global_namespace)
5119 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5121 if (TREE_PURPOSE (tail) == name)
5123 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
5124 /* Should tighten this up; it'll probably permit
5125 UNION_TYPE and a struct template, for example. */
5127 && !(form != ENUMERAL_TYPE && code == TEMPLATE_DECL))
5129 /* Definition isn't the kind we were looking for. */
5130 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail),
5134 return TREE_VALUE (tail);
5137 if (thislevel_only && ! level->tag_transparent)
5139 if (level->template_parms_p && allow_template_parms_p)
5141 /* We must deal with cases like this:
5143 template <class T> struct S;
5144 template <class T> struct S {};
5146 When looking up `S', for the second declaration, we
5147 would like to find the first declaration. But, we
5148 are in the pseudo-global level created for the
5149 template parameters, rather than the (surrounding)
5150 namespace level. Thus, we keep going one more level,
5151 even though THISLEVEL_ONLY is non-zero. */
5152 allow_template_parms_p = 0;
5164 set_current_level_tags_transparency (tags_transparent)
5165 int tags_transparent;
5167 current_binding_level->tag_transparent = tags_transparent;
5171 /* Given a type, find the tag that was defined for it and return the tag name.
5172 Otherwise return 0. However, the value can never be 0
5173 in the cases in which this is used.
5175 C++: If NAME is non-zero, this is the new name to install. This is
5176 done when replacing anonymous tags with real tag names. */
5179 lookup_tag_reverse (type, name)
5183 register struct binding_level *level;
5185 for (level = current_binding_level; level; level = level->level_chain)
5188 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5190 if (TREE_VALUE (tail) == type)
5193 TREE_PURPOSE (tail) = name;
5194 return TREE_PURPOSE (tail);
5201 /* Look up NAME in the NAMESPACE. */
5204 lookup_namespace_name (namespace, name)
5205 tree namespace, name;
5208 tree template_id = NULL_TREE;
5210 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5212 if (TREE_CODE (name) == NAMESPACE_DECL)
5213 /* This happens for A::B<int> when B is a namespace. */
5215 else if (TREE_CODE (name) == TEMPLATE_DECL)
5217 /* This happens for A::B where B is a template, and there are no
5218 template arguments. */
5219 cp_error ("invalid use of `%D'", name);
5220 return error_mark_node;
5223 namespace = ORIGINAL_NAMESPACE (namespace);
5225 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5228 name = TREE_OPERAND (name, 0);
5229 if (TREE_CODE (name) == OVERLOAD)
5230 name = DECL_NAME (OVL_CURRENT (name));
5231 else if (TREE_CODE_CLASS (TREE_CODE (name)) == 'd')
5232 name = DECL_NAME (name);
5235 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5237 val = make_node (CPLUS_BINDING);
5238 if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5239 return error_mark_node;
5241 if (BINDING_VALUE (val))
5243 val = BINDING_VALUE (val);
5247 if (DECL_CLASS_TEMPLATE_P (val))
5248 val = lookup_template_class (val,
5249 TREE_OPERAND (template_id, 1),
5250 /*in_decl=*/NULL_TREE,
5251 /*context=*/NULL_TREE,
5252 /*entering_scope=*/0);
5253 else if (DECL_FUNCTION_TEMPLATE_P (val)
5254 || TREE_CODE (val) == OVERLOAD)
5255 val = lookup_template_function (val,
5256 TREE_OPERAND (template_id, 1));
5259 cp_error ("`%D::%D' is not a template",
5261 return error_mark_node;
5265 /* If we have a single function from a using decl, pull it out. */
5266 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5267 val = OVL_FUNCTION (val);
5271 cp_error ("`%D' undeclared in namespace `%D'", name, namespace);
5272 return error_mark_node;
5275 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5277 static unsigned long
5285 hash = (((unsigned long) TYPE_CONTEXT (t))
5286 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t))));
5291 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5294 typename_compare (k1, k2)
5305 d1 = TYPE_NAME (t1);
5306 d2 = TYPE_NAME (t2);
5308 return (DECL_NAME (d1) == DECL_NAME (d2)
5309 && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2))
5310 && ((TREE_TYPE (t1) != NULL_TREE)
5311 == (TREE_TYPE (t2) != NULL_TREE))
5312 && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5313 && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5316 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5317 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5318 is non-NULL, this type is being created by the implicit typename
5319 extension, and BASE_TYPE is a type named `t' in some base class of
5320 `T' which depends on template parameters.
5322 Returns the new TYPENAME_TYPE. */
5325 build_typename_type (context, name, fullname, base_type)
5333 struct hash_entry* e;
5335 static struct hash_table ht;
5339 static struct hash_table *h = &ht;
5340 if (!hash_table_init (&ht, &hash_newfunc, &typename_hash,
5342 fatal ("virtual memory exhausted");
5343 ggc_add_tree_hash_table_root (&h, 1);
5346 /* Build the TYPENAME_TYPE. */
5347 t = make_aggr_type (TYPENAME_TYPE);
5348 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5349 TYPENAME_TYPE_FULLNAME (t) = fullname;
5350 TREE_TYPE (t) = base_type;
5352 /* Build the corresponding TYPE_DECL. */
5353 d = build_decl (TYPE_DECL, name, t);
5354 TYPE_NAME (TREE_TYPE (d)) = d;
5355 TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5356 DECL_CONTEXT (d) = FROB_CONTEXT (context);
5357 DECL_ARTIFICIAL (d) = 1;
5359 /* See if we already have this type. */
5360 e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0);
5364 /* Insert the type into the table. */
5365 hash_lookup (&ht, t, /*create=*/true, /*copy=*/0);
5370 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5371 unless an error occurs, in which case error_mark_node is returned.
5372 If COMPLAIN zero, don't complain about any errors that occur. */
5375 make_typename_type (context, name, complain)
5381 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
5383 if (!(TYPE_LANG_SPECIFIC (name)
5384 && (CLASSTYPE_IS_TEMPLATE (name)
5385 || CLASSTYPE_USE_TEMPLATE (name))))
5386 name = TYPE_IDENTIFIER (name);
5388 /* Create a TEMPLATE_ID_EXPR for the type. */
5389 name = build_nt (TEMPLATE_ID_EXPR,
5390 CLASSTYPE_TI_TEMPLATE (name),
5391 CLASSTYPE_TI_ARGS (name));
5393 else if (TREE_CODE (name) == TYPE_DECL)
5394 name = DECL_NAME (name);
5398 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5400 name = TREE_OPERAND (name, 0);
5401 if (TREE_CODE (name) == TEMPLATE_DECL)
5402 name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5404 if (TREE_CODE (name) != IDENTIFIER_NODE)
5405 my_friendly_abort (2000);
5407 if (TREE_CODE (context) == NAMESPACE_DECL)
5409 /* We can get here from typename_sub0 in the explicit_template_type
5410 expansion. Just fail. */
5412 cp_error ("no class template named `%#T' in `%#T'",
5414 return error_mark_node;
5417 if (! uses_template_parms (context)
5418 || currently_open_class (context))
5420 if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5422 tree tmpl = NULL_TREE;
5423 if (IS_AGGR_TYPE (context))
5424 tmpl = lookup_field (context, name, 0, 0);
5425 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5428 cp_error ("no class template named `%#T' in `%#T'",
5430 return error_mark_node;
5433 return lookup_template_class (tmpl,
5434 TREE_OPERAND (fullname, 1),
5436 /*entering_scope=*/0);
5442 if (!IS_AGGR_TYPE (context))
5445 cp_error ("no type named `%#T' in `%#T'", name, context);
5446 return error_mark_node;
5449 t = lookup_field (context, name, 0, 1);
5451 return TREE_TYPE (t);
5455 /* If the CONTEXT is not a template type, then either the field is
5456 there now or its never going to be. */
5457 if (!uses_template_parms (context))
5460 cp_error ("no type named `%#T' in `%#T'", name, context);
5461 return error_mark_node;
5465 return build_typename_type (context, name, fullname, NULL_TREE);
5468 /* Select the right _DECL from multiple choices. */
5471 select_decl (binding, flags)
5476 val = BINDING_VALUE (binding);
5477 if (LOOKUP_NAMESPACES_ONLY (flags))
5479 /* We are not interested in types. */
5480 if (val && TREE_CODE (val) == NAMESPACE_DECL)
5485 /* If we could have a type and
5486 we have nothing or we need a type and have none. */
5487 if (BINDING_TYPE (binding)
5488 && (!val || ((flags & LOOKUP_PREFER_TYPES)
5489 && TREE_CODE (val) != TYPE_DECL)))
5490 val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5491 /* Don't return non-types if we really prefer types. */
5492 else if (val && LOOKUP_TYPES_ONLY (flags) && TREE_CODE (val) != TYPE_DECL
5493 && (TREE_CODE (val) != TEMPLATE_DECL
5494 || !DECL_CLASS_TEMPLATE_P (val)))
5500 /* Unscoped lookup of a global: iterate over current namespaces,
5501 considering using-directives. If SPACESP is non-NULL, store a list
5502 of the namespaces we've considered in it. */
5505 unqualified_namespace_lookup (name, flags, spacesp)
5510 tree b = make_node (CPLUS_BINDING);
5511 tree initial = current_decl_namespace();
5512 tree scope = initial;
5514 struct binding_level *level;
5515 tree val = NULL_TREE;
5518 *spacesp = NULL_TREE;
5520 for (; !val; scope = CP_DECL_CONTEXT (scope))
5523 *spacesp = tree_cons (scope, NULL_TREE, *spacesp);
5524 val = binding_for_name (name, scope);
5526 /* Initialize binding for this context. */
5527 BINDING_VALUE (b) = BINDING_VALUE (val);
5528 BINDING_TYPE (b) = BINDING_TYPE (val);
5530 /* Add all _DECLs seen through local using-directives. */
5531 for (level = current_binding_level;
5532 !level->namespace_p;
5533 level = level->level_chain)
5534 if (!lookup_using_namespace (name, b, level->using_directives,
5535 scope, flags, spacesp))
5536 /* Give up because of error. */
5537 return error_mark_node;
5539 /* Add all _DECLs seen through global using-directives. */
5540 /* XXX local and global using lists should work equally. */
5544 if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5545 scope, flags, spacesp))
5546 /* Give up because of error. */
5547 return error_mark_node;
5548 if (siter == scope) break;
5549 siter = CP_DECL_CONTEXT (siter);
5552 val = select_decl (b, flags);
5553 if (scope == global_namespace)
5559 /* Combine prefer_type and namespaces_only into flags. */
5562 lookup_flags (prefer_type, namespaces_only)
5563 int prefer_type, namespaces_only;
5565 if (namespaces_only)
5566 return LOOKUP_PREFER_NAMESPACES;
5567 if (prefer_type > 1)
5568 return LOOKUP_PREFER_TYPES;
5569 if (prefer_type > 0)
5570 return LOOKUP_PREFER_BOTH;
5574 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5575 ignore it or not. Subroutine of lookup_name_real. */
5578 qualify_lookup (val, flags)
5582 if (val == NULL_TREE)
5584 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5586 if ((flags & LOOKUP_PREFER_TYPES)
5587 && (TREE_CODE (val) == TYPE_DECL
5588 || ((flags & LOOKUP_TEMPLATES_EXPECTED)
5589 && DECL_CLASS_TEMPLATE_P (val))))
5591 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
5596 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5600 warn_about_implicit_typename_lookup (typename, binding)
5604 tree subtype = TREE_TYPE (TREE_TYPE (typename));
5605 tree name = DECL_NAME (typename);
5607 if (! (TREE_CODE (binding) == TEMPLATE_DECL
5608 && CLASSTYPE_TEMPLATE_INFO (subtype)
5609 && CLASSTYPE_TI_TEMPLATE (subtype) == binding)
5610 && ! (TREE_CODE (binding) == TYPE_DECL
5611 && same_type_p (TREE_TYPE (binding), subtype)))
5613 cp_warning ("lookup of `%D' finds `%#D'",
5615 cp_warning (" instead of `%D' from dependent base class",
5617 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5618 constructor_name (current_class_type), name);
5622 /* Look up NAME in the current binding level and its superiors in the
5623 namespace of variables, functions and typedefs. Return a ..._DECL
5624 node of some kind representing its definition if there is only one
5625 such declaration, or return a TREE_LIST with all the overloaded
5626 definitions if there are many, or return 0 if it is undefined.
5628 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5629 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5630 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5631 Otherwise we prefer non-TYPE_DECLs.
5633 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5634 using IDENTIFIER_CLASS_VALUE. */
5637 lookup_name_real (name, prefer_type, nonclass, namespaces_only)
5639 int prefer_type, nonclass, namespaces_only;
5642 tree val = NULL_TREE;
5644 tree from_obj = NULL_TREE;
5646 int val_is_implicit_typename = 0;
5648 /* Hack: copy flag set by parser, if set. */
5649 if (only_namespace_names)
5650 namespaces_only = 1;
5652 if (prefer_type == -2)
5654 extern int looking_for_typename;
5655 tree type = NULL_TREE;
5658 prefer_type = looking_for_typename;
5660 flags = lookup_flags (prefer_type, namespaces_only);
5661 /* If the next thing is '<', class templates are types. */
5662 if (looking_for_template)
5663 flags |= LOOKUP_TEMPLATES_EXPECTED;
5665 /* std:: becomes :: for now. */
5666 if (got_scope == std_node)
5667 got_scope = void_type_node;
5671 else if (got_object != error_mark_node)
5676 if (type == error_mark_node)
5677 return error_mark_node;
5678 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
5679 type = TREE_TYPE (type);
5682 type = complete_type (type);
5684 if (TREE_CODE (type) == VOID_TYPE)
5685 type = global_namespace;
5686 if (TREE_CODE (type) == NAMESPACE_DECL)
5688 val = make_node (CPLUS_BINDING);
5689 flags |= LOOKUP_COMPLAIN;
5690 if (!qualified_lookup_using_namespace (name, type, val, flags))
5692 val = select_decl (val, flags);
5694 else if (! IS_AGGR_TYPE (type)
5695 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5696 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
5697 || TREE_CODE (type) == TYPENAME_TYPE)
5698 /* Someone else will give an error about this if needed. */
5700 else if (type == current_class_type)
5701 val = IDENTIFIER_CLASS_VALUE (name);
5704 val = lookup_member (type, name, 0, prefer_type);
5705 type_access_control (type, val);
5713 else if (got_object && val)
5718 flags = lookup_flags (prefer_type, namespaces_only);
5719 /* If we're not parsing, we need to complain. */
5720 flags |= LOOKUP_COMPLAIN;
5723 /* First, look in non-namespace scopes. */
5725 if (current_class_type == NULL_TREE)
5728 for (t = IDENTIFIER_BINDING (name); t; t = TREE_CHAIN (t))
5732 if (!LOCAL_BINDING_P (t) && nonclass)
5733 /* We're not looking for class-scoped bindings, so keep going. */
5736 /* If this is the kind of thing we're looking for, we're done. */
5737 if (qualify_lookup (BINDING_VALUE (t), flags))
5738 binding = BINDING_VALUE (t);
5739 else if ((flags & LOOKUP_PREFER_TYPES)
5740 && qualify_lookup (BINDING_TYPE (t), flags))
5741 binding = BINDING_TYPE (t);
5743 binding = NULL_TREE;
5745 /* Handle access control on types from enclosing or base classes. */
5746 if (binding && ! yylex
5747 && BINDING_LEVEL (t) && BINDING_LEVEL (t)->parm_flag == 2)
5748 type_access_control (BINDING_LEVEL (t)->this_class, binding);
5751 && (!val || !IMPLICIT_TYPENAME_TYPE_DECL_P (binding)))
5753 if (val_is_implicit_typename && !yylex)
5754 warn_about_implicit_typename_lookup (val, binding);
5756 val_is_implicit_typename
5757 = IMPLICIT_TYPENAME_TYPE_DECL_P (val);
5758 if (!val_is_implicit_typename)
5763 /* Now lookup in namespace scopes. */
5764 if (!val || val_is_implicit_typename)
5766 t = unqualified_namespace_lookup (name, flags, 0);
5769 if (val_is_implicit_typename && !yylex)
5770 warn_about_implicit_typename_lookup (val, t);
5778 /* This should only warn about types used in qualified-ids. */
5779 if (from_obj && from_obj != val)
5781 if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL
5782 && TREE_CODE (val) == TYPE_DECL
5783 && TREE_TYPE (from_obj) != TREE_TYPE (val))
5785 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5786 name, got_object, TREE_TYPE (from_obj));
5787 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5791 /* We don't change val to from_obj if got_object depends on
5792 template parms because that breaks implicit typename for
5793 destructor calls. */
5794 if (! uses_template_parms (got_object))
5798 /* If we have a single function from a using decl, pull it out. */
5799 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5800 val = OVL_FUNCTION (val);
5809 lookup_name_nonclass (name)
5812 return lookup_name_real (name, 0, 1, 0);
5816 lookup_function_nonclass (name, args)
5820 return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
5824 lookup_name_namespace_only (name)
5827 /* type-or-namespace, nonclass, namespace_only */
5828 return lookup_name_real (name, 1, 1, 1);
5832 lookup_name (name, prefer_type)
5836 return lookup_name_real (name, prefer_type, 0, 0);
5839 /* Similar to `lookup_name' but look only in the innermost non-class
5843 lookup_name_current_level (name)
5846 struct binding_level *b;
5849 b = current_binding_level;
5850 while (b->parm_flag == 2)
5855 t = IDENTIFIER_NAMESPACE_VALUE (name);
5857 /* extern "C" function() */
5858 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
5861 else if (IDENTIFIER_BINDING (name)
5862 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
5866 if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
5867 return IDENTIFIER_VALUE (name);
5879 /* Like lookup_name_current_level, but for types. */
5882 lookup_type_current_level (name)
5885 register tree t = NULL_TREE;
5887 my_friendly_assert (! current_binding_level->namespace_p, 980716);
5889 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
5890 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
5892 struct binding_level *b = current_binding_level;
5895 if (purpose_member (name, b->type_shadowed))
5896 return REAL_IDENTIFIER_TYPE_VALUE (name);
5908 begin_only_namespace_names ()
5910 only_namespace_names = 1;
5914 end_only_namespace_names ()
5916 only_namespace_names = 0;
5919 /* Arrange for the user to get a source line number, even when the
5920 compiler is going down in flames, so that she at least has a
5921 chance of working around problems in the compiler. We used to
5922 call error(), but that let the segmentation fault continue
5923 through; now, it's much more passive by asking them to send the
5924 maintainers mail about the problem. */
5928 int sig ATTRIBUTE_UNUSED;
5930 signal (SIGSEGV, SIG_DFL);
5932 signal (SIGIOT, SIG_DFL);
5935 signal (SIGILL, SIG_DFL);
5938 signal (SIGABRT, SIG_DFL);
5941 signal (SIGBUS, SIG_DFL);
5943 my_friendly_abort (0);
5946 /* Push the declarations of builtin types into the namespace.
5947 RID_INDEX, if < RID_MAX is the index of the builtin type
5948 in the array RID_POINTERS. NAME is the name used when looking
5949 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5952 record_builtin_type (rid_index, name, type)
5957 tree rname = NULL_TREE, tname = NULL_TREE;
5958 tree tdecl = NULL_TREE;
5960 if ((int) rid_index < (int) RID_MAX)
5961 rname = ridpointers[(int) rid_index];
5963 tname = get_identifier (name);
5965 TYPE_BUILT_IN (type) = 1;
5969 tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
5970 set_identifier_type_value (tname, NULL_TREE);
5971 if ((int) rid_index < (int) RID_MAX)
5972 /* Built-in types live in the global namespace. */
5973 SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
5975 if (rname != NULL_TREE)
5977 if (tname != NULL_TREE)
5979 set_identifier_type_value (rname, NULL_TREE);
5980 SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
5984 tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
5985 set_identifier_type_value (rname, NULL_TREE);
5990 /* Record one of the standard Java types.
5991 * Declare it as having the given NAME.
5992 * If SIZE > 0, it is the size of one of the integral types;
5993 * otherwise it is the negative of the size of one of the other types. */
5996 record_builtin_java_type (name, size)
6002 type = make_signed_type (size);
6003 else if (size > -32)
6004 { /* "__java_char" or ""__java_boolean". */
6005 type = make_unsigned_type (-size);
6006 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6009 { /* "__java_float" or ""__java_double". */
6010 type = make_node (REAL_TYPE);
6011 TYPE_PRECISION (type) = - size;
6014 record_builtin_type (RID_MAX, name, type);
6015 decl = TYPE_NAME (type);
6017 /* Suppress generate debug symbol entries for these types,
6018 since for normal C++ they are just clutter.
6019 However, push_lang_context undoes this if extern "Java" is seen. */
6020 DECL_IGNORED_P (decl) = 1;
6022 TYPE_FOR_JAVA (type) = 1;
6026 /* Push a type into the namespace so that the back-ends ignore it. */
6029 record_unknown_type (type, name)
6033 tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
6034 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6035 DECL_IGNORED_P (decl) = 1;
6036 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
6037 TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
6038 TYPE_ALIGN (type) = 1;
6039 TYPE_MODE (type) = TYPE_MODE (void_type_node);
6042 /* Create the predefined scalar types of C,
6043 and some nodes representing standard constants (0, 1, (void *)0).
6044 Initialize the global binding level.
6045 Make definitions for built-in primitive functions. */
6048 init_decl_processing ()
6051 int wchar_type_size;
6052 tree array_domain_type;
6054 /* Check to see that the user did not specify an invalid combination
6055 of command-line options. */
6056 if (flag_new_abi && !flag_vtable_thunks)
6057 fatal ("the new ABI requires vtable thunks");
6059 /* Have to make these distinct before we try using them. */
6060 lang_name_cplusplus = get_identifier ("C++");
6061 lang_name_c = get_identifier ("C");
6062 lang_name_java = get_identifier ("Java");
6064 /* Let the back-end now how to save and restore language-specific
6065 per-function globals. */
6066 init_lang_status = &push_cp_function_context;
6067 free_lang_status = &pop_cp_function_context;
6068 mark_lang_status = &mark_cp_function_context;
6074 /* Create the global variables. */
6075 push_to_top_level ();
6077 /* Enter the global namespace. */
6078 my_friendly_assert (global_namespace == NULL_TREE, 375);
6079 push_namespace (get_identifier ("::"));
6080 global_namespace = current_namespace;
6081 current_lang_name = NULL_TREE;
6083 /* Adjust various flags based on command-line settings. */
6084 if (flag_strict_prototype == 2)
6085 flag_strict_prototype = pedantic;
6086 if (! flag_permissive && ! pedantic)
6087 flag_pedantic_errors = 1;
6088 if (!flag_no_inline)
6089 flag_inline_trees = 1;
6091 strict_prototypes_lang_c = flag_strict_prototype;
6094 current_lang_name = lang_name_c;
6096 current_function_decl = NULL_TREE;
6097 current_binding_level = NULL_BINDING_LEVEL;
6098 free_binding_level = NULL_BINDING_LEVEL;
6100 /* Because most segmentation signals can be traced back into user
6101 code, catch them and at least give the user a chance of working
6102 around compiler bugs. */
6103 signal (SIGSEGV, signal_catch);
6105 /* We will also catch aborts in the back-end through signal_catch and
6106 give the user a chance to see where the error might be, and to defeat
6107 aborts in the back-end when there have been errors previously in their
6110 signal (SIGIOT, signal_catch);
6113 signal (SIGILL, signal_catch);
6116 signal (SIGABRT, signal_catch);
6119 signal (SIGBUS, signal_catch);
6122 build_common_tree_nodes (flag_signed_char);
6124 error_mark_list = build_tree_list (error_mark_node, error_mark_node);
6125 TREE_TYPE (error_mark_list) = error_mark_node;
6127 /* Make the binding_level structure for global names. */
6129 global_binding_level = current_binding_level;
6130 /* The global level is the namespace level of ::. */
6131 NAMESPACE_LEVEL (global_namespace) = global_binding_level;
6132 declare_namespace_level ();
6134 this_identifier = get_identifier (THIS_NAME);
6135 in_charge_identifier = get_identifier (IN_CHARGE_NAME);
6136 ctor_identifier = get_identifier (CTOR_NAME);
6137 dtor_identifier = get_identifier (DTOR_NAME);
6138 pfn_identifier = get_identifier (VTABLE_PFN_NAME);
6139 index_identifier = get_identifier (VTABLE_INDEX_NAME);
6140 delta_identifier = get_identifier (VTABLE_DELTA_NAME);
6141 delta2_identifier = get_identifier (VTABLE_DELTA2_NAME);
6142 pfn_or_delta2_identifier = get_identifier ("__pfn_or_delta2");
6144 /* Define `int' and `char' first so that dbx will output them first. */
6145 record_builtin_type (RID_INT, NULL_PTR, integer_type_node);
6146 record_builtin_type (RID_CHAR, "char", char_type_node);
6148 /* `signed' is the same as `int' */
6149 record_builtin_type (RID_SIGNED, NULL_PTR, integer_type_node);
6150 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
6151 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
6152 record_builtin_type (RID_MAX, "long unsigned int", long_unsigned_type_node);
6153 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
6154 record_builtin_type (RID_MAX, "long long int", long_long_integer_type_node);
6155 record_builtin_type (RID_MAX, "long long unsigned int",
6156 long_long_unsigned_type_node);
6157 record_builtin_type (RID_MAX, "long long unsigned",
6158 long_long_unsigned_type_node);
6159 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
6160 record_builtin_type (RID_MAX, "short unsigned int", short_unsigned_type_node);
6161 record_builtin_type (RID_MAX, "unsigned short", short_unsigned_type_node);
6164 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE)));
6166 /* Define both `signed char' and `unsigned char'. */
6167 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
6168 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
6170 /* `unsigned long' is the standard type for sizeof.
6171 Note that stddef.h uses `unsigned long',
6172 and this must agree, even if long and int are the same size. */
6174 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE))));
6176 /* Create the widest literal types. */
6177 widest_integer_literal_type_node = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
6178 pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6179 widest_integer_literal_type_node));
6181 widest_unsigned_literal_type_node = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
6182 pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6183 widest_unsigned_literal_type_node));
6185 /* These are types that type_for_size and type_for_mode use. */
6186 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node));
6187 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node));
6188 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node));
6189 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node));
6190 #if HOST_BITS_PER_WIDE_INT >= 64
6191 pushdecl (build_decl (TYPE_DECL, get_identifier ("__int128_t"), intTI_type_node));
6193 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node));
6194 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node));
6195 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node));
6196 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node));
6197 #if HOST_BITS_PER_WIDE_INT >= 64
6198 pushdecl (build_decl (TYPE_DECL, get_identifier ("__uint128_t"), unsigned_intTI_type_node));
6201 build_common_tree_nodes_2 (flag_short_double);
6203 java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6204 java_short_type_node = record_builtin_java_type ("__java_short", 16);
6205 java_int_type_node = record_builtin_java_type ("__java_int", 32);
6206 java_long_type_node = record_builtin_java_type ("__java_long", 64);
6207 java_float_type_node = record_builtin_java_type ("__java_float", -32);
6208 java_double_type_node = record_builtin_java_type ("__java_double", -64);
6209 java_char_type_node = record_builtin_java_type ("__java_char", -16);
6210 java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6212 integer_two_node = build_int_2 (2, 0);
6213 TREE_TYPE (integer_two_node) = integer_type_node;
6214 integer_three_node = build_int_2 (3, 0);
6215 TREE_TYPE (integer_three_node) = integer_type_node;
6217 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6218 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6219 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6220 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6221 TYPE_PRECISION (boolean_type_node) = 1;
6222 record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6223 boolean_false_node = build_int_2 (0, 0);
6224 TREE_TYPE (boolean_false_node) = boolean_type_node;
6225 boolean_true_node = build_int_2 (1, 0);
6226 TREE_TYPE (boolean_true_node) = boolean_type_node;
6228 signed_size_zero_node = build_int_2 (0, 0);
6229 record_builtin_type (RID_FLOAT, NULL_PTR, float_type_node);
6230 record_builtin_type (RID_DOUBLE, NULL_PTR, double_type_node);
6231 record_builtin_type (RID_MAX, "long double", long_double_type_node);
6233 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
6234 complex_integer_type_node));
6235 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
6236 complex_float_type_node));
6237 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
6238 complex_double_type_node));
6239 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
6240 complex_long_double_type_node));
6242 TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype));
6244 record_builtin_type (RID_VOID, NULL_PTR, void_type_node);
6245 void_list_node = build_tree_list (NULL_TREE, void_type_node);
6246 TREE_PARMLIST (void_list_node) = 1;
6248 /* Used for expressions that do nothing, but are not errors. */
6249 void_zero_node = build_int_2 (0, 0);
6250 TREE_TYPE (void_zero_node) = void_type_node;
6252 string_type_node = build_pointer_type (char_type_node);
6253 const_string_type_node
6254 = build_pointer_type (build_qualified_type (char_type_node,
6256 empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE);
6258 record_builtin_type (RID_MAX, NULL_PTR, string_type_node);
6261 /* Make a type to be the domain of a few array types
6262 whose domains don't really matter.
6263 200 is small enough that it always fits in size_t. */
6264 array_domain_type = build_index_type (build_int_2 (200, 0));
6266 /* Make a type for arrays of characters.
6267 With luck nothing will ever really depend on the length of this
6269 char_array_type_node
6270 = build_array_type (char_type_node, array_domain_type);
6271 /* Likewise for arrays of ints. */
6273 = build_array_type (integer_type_node, array_domain_type);
6276 delta_type_node = ptrdiff_type_node;
6277 else if (flag_huge_objects)
6278 delta_type_node = long_integer_type_node;
6280 delta_type_node = short_integer_type_node;
6283 vtable_index_type = ptrdiff_type_node;
6285 vtable_index_type = delta_type_node;
6287 default_function_type
6288 = build_function_type (integer_type_node, NULL_TREE);
6290 ptr_type_node = build_pointer_type (void_type_node);
6292 = build_pointer_type (build_qualified_type (void_type_node,
6294 c_common_nodes_and_builtins (1, flag_no_builtin, flag_no_nonansi_builtin);
6295 lang_type_promotes_to = convert_type_from_ellipsis;
6298 = build_exception_variant (void_ftype_ptr, empty_except_spec);
6300 /* C++ extensions */
6302 unknown_type_node = make_node (UNKNOWN_TYPE);
6303 record_unknown_type (unknown_type_node, "unknown type");
6305 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6306 TREE_TYPE (unknown_type_node) = unknown_type_node;
6308 TREE_TYPE (null_node) = type_for_size (POINTER_SIZE, 0);
6310 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6312 TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6313 TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6315 /* This is special for C++ so functions can be overloaded. */
6316 wchar_type_node = get_identifier (flag_short_wchar
6317 ? "short unsigned int"
6319 wchar_type_node = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node));
6320 wchar_type_size = TYPE_PRECISION (wchar_type_node);
6321 signed_wchar_type_node = make_signed_type (wchar_type_size);
6322 unsigned_wchar_type_node = make_unsigned_type (wchar_type_size);
6324 = TREE_UNSIGNED (wchar_type_node)
6325 ? unsigned_wchar_type_node
6326 : signed_wchar_type_node;
6327 record_builtin_type (RID_WCHAR, "__wchar_t", wchar_type_node);
6329 /* Artificial declaration of wchar_t -- can be bashed */
6330 wchar_decl_node = build_decl (TYPE_DECL, get_identifier ("wchar_t"),
6332 pushdecl (wchar_decl_node);
6334 /* This is for wide string constants. */
6335 wchar_array_type_node
6336 = build_array_type (wchar_type_node, array_domain_type);
6338 if (flag_vtable_thunks)
6340 /* Make sure we get a unique function type, so we can give
6341 its pointer type a name. (This wins for gdb.) */
6342 tree vfunc_type = make_node (FUNCTION_TYPE);
6343 TREE_TYPE (vfunc_type) = integer_type_node;
6344 TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6345 layout_type (vfunc_type);
6347 vtable_entry_type = build_pointer_type (vfunc_type);
6351 vtable_entry_type = make_aggr_type (RECORD_TYPE);
6352 fields[0] = build_lang_decl (FIELD_DECL, delta_identifier,
6354 fields[1] = build_lang_decl (FIELD_DECL, index_identifier,
6356 fields[2] = build_lang_decl (FIELD_DECL, pfn_identifier,
6358 finish_builtin_type (vtable_entry_type, VTBL_PTR_TYPE, fields, 2,
6361 /* Make this part of an invisible union. */
6362 fields[3] = copy_node (fields[2]);
6363 TREE_TYPE (fields[3]) = delta_type_node;
6364 DECL_NAME (fields[3]) = delta2_identifier;
6365 DECL_MODE (fields[3]) = TYPE_MODE (delta_type_node);
6366 DECL_SIZE (fields[3]) = TYPE_SIZE (delta_type_node);
6367 DECL_SIZE_UNIT (fields[3]) = TYPE_SIZE_UNIT (delta_type_node);
6368 TREE_UNSIGNED (fields[3]) = 0;
6369 TREE_CHAIN (fields[2]) = fields[3];
6370 vtable_entry_type = build_qualified_type (vtable_entry_type,
6373 record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6376 = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6377 layout_type (vtbl_type_node);
6378 vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6379 record_builtin_type (RID_MAX, NULL_PTR, vtbl_type_node);
6380 vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6381 layout_type (vtbl_ptr_type_node);
6382 record_builtin_type (RID_MAX, NULL_PTR, vtbl_ptr_type_node);
6384 std_node = build_decl (NAMESPACE_DECL,
6385 get_identifier (flag_honor_std ? "fake std":"std"),
6387 pushdecl (std_node);
6389 global_type_node = make_node (LANG_TYPE);
6390 record_unknown_type (global_type_node, "global type");
6393 current_lang_name = lang_name_cplusplus;
6396 tree bad_alloc_type_node, newtype, deltype;
6398 push_namespace (get_identifier ("std"));
6399 bad_alloc_type_node = xref_tag
6400 (class_type_node, get_identifier ("bad_alloc"), 1);
6403 newtype = build_exception_variant
6404 (ptr_ftype_sizetype, add_exception_specifier (NULL_TREE, bad_alloc_type_node, -1));
6405 deltype = build_exception_variant (void_ftype_ptr, empty_except_spec);
6406 push_cp_library_fn (ansi_opname[(int) NEW_EXPR], newtype);
6407 push_cp_library_fn (ansi_opname[(int) VEC_NEW_EXPR], newtype);
6408 global_delete_fndecl = push_cp_library_fn (ansi_opname[(int) DELETE_EXPR],
6410 push_cp_library_fn (ansi_opname[(int) VEC_DELETE_EXPR], deltype);
6414 = build_library_fn_ptr ("__pure_virtual", void_ftype);
6416 /* Perform other language dependent initializations. */
6417 init_class_processing ();
6418 init_init_processing ();
6419 init_search_processing ();
6420 init_rtti_processing ();
6422 if (flag_exceptions)
6423 init_exception_processing ();
6426 flag_inline_functions = 0;
6429 if (! supports_one_only ())
6432 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6433 make_fname_decl = cp_make_fname_decl;
6434 declare_function_name ();
6436 /* Prepare to check format strings against argument lists. */
6437 init_function_format_info ();
6439 /* Show we use EH for cleanups. */
6440 using_eh_for_cleanups ();
6442 print_error_function = lang_print_error_function;
6443 lang_get_alias_set = &c_get_alias_set;
6444 valid_lang_attribute = cp_valid_lang_attribute;
6446 /* Maintain consistency. Perhaps we should just complain if they
6447 say -fwritable-strings? */
6448 if (flag_writable_strings)
6449 flag_const_strings = 0;
6451 /* Add GC roots for all of our global variables. */
6452 ggc_add_tree_root (c_global_trees, sizeof c_global_trees / sizeof(tree));
6453 ggc_add_tree_root (cp_global_trees, sizeof cp_global_trees / sizeof(tree));
6454 ggc_add_tree_root (&integer_three_node, 1);
6455 ggc_add_tree_root (&integer_two_node, 1);
6456 ggc_add_tree_root (&signed_size_zero_node, 1);
6457 ggc_add_tree_root (&size_one_node, 1);
6458 ggc_add_tree_root (&size_zero_node, 1);
6459 ggc_add_root (&global_binding_level, 1, sizeof global_binding_level,
6460 mark_binding_level);
6461 ggc_add_root (&scope_chain, 1, sizeof scope_chain, &mark_saved_scope);
6462 ggc_add_tree_root (&static_ctors, 1);
6463 ggc_add_tree_root (&static_dtors, 1);
6464 ggc_add_tree_root (&lastiddecl, 1);
6466 ggc_add_tree_root (&last_function_parm_tags, 1);
6467 ggc_add_tree_root (¤t_function_return_value, 1);
6468 ggc_add_tree_root (¤t_function_parms, 1);
6469 ggc_add_tree_root (¤t_function_parm_tags, 1);
6470 ggc_add_tree_root (&last_function_parms, 1);
6471 ggc_add_tree_root (&error_mark_list, 1);
6473 ggc_add_tree_root (&global_namespace, 1);
6474 ggc_add_tree_root (&global_type_node, 1);
6475 ggc_add_tree_root (&anonymous_namespace_name, 1);
6477 ggc_add_tree_root (&got_object, 1);
6478 ggc_add_tree_root (&got_scope, 1);
6480 ggc_add_tree_root (¤t_lang_name, 1);
6481 ggc_add_tree_root (&static_aggregates, 1);
6484 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6485 decl, NAME is the initialization string and TYPE_DEP indicates whether
6486 NAME depended on the type of the function. We make use of that to detect
6487 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6488 the function before emitting any of it, we don't need to treat the
6489 VAR_DECL specially. We can decide whether to emit it later, if it was
6493 cp_make_fname_decl (id, name, type_dep)
6498 tree decl, type, init;
6499 size_t length = strlen (name);
6500 tree domain = NULL_TREE;
6502 if (!processing_template_decl)
6505 domain = build_index_type (build_int_2 (length, 0));
6507 type = build_cplus_array_type
6508 (build_qualified_type (char_type_node, TYPE_QUAL_CONST),
6511 decl = build_lang_decl (VAR_DECL, id, type);
6512 TREE_STATIC (decl) = 1;
6513 TREE_READONLY (decl) = 1;
6514 DECL_SOURCE_LINE (decl) = 0;
6515 DECL_ARTIFICIAL (decl) = 1;
6516 DECL_IN_SYSTEM_HEADER (decl) = 1;
6518 if (processing_template_decl)
6519 decl = push_template_decl (decl);
6522 init = build (FUNCTION_NAME, type);
6523 DECL_PRETTY_FUNCTION_P (decl) = 1;
6527 init = build_string (length + 1, name);
6528 TREE_TYPE (init) = type;
6530 DECL_INITIAL (decl) = init;
6531 cp_finish_decl (decl, init, NULL_TREE, LOOKUP_ONLYCONVERTING);
6533 /* We will have to make sure we only emit this, if it is actually used. */
6537 /* Function to print any language-specific context for an error message. */
6540 lang_print_error_function (file)
6543 default_print_error_function (file);
6544 maybe_print_template_context ();
6547 /* Entry point for the benefit of c_common_nodes_and_builtins.
6549 Make a definition for a builtin function named NAME and whose data type
6550 is TYPE. TYPE should be a function type with argument types.
6552 CLASS and CODE tell later passes how to compile calls to this function.
6553 See tree.h for possible values.
6555 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6556 the name to be called if we can't opencode the function. */
6559 builtin_function (name, type, code, class, libname)
6563 enum built_in_class class;
6564 const char *libname;
6566 tree decl = build_library_fn_1 (get_identifier (name), type);
6567 DECL_BUILT_IN_CLASS (decl) = class;
6568 DECL_FUNCTION_CODE (decl) = code;
6570 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 392);
6572 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6573 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6574 function in the namespace. */
6577 DECL_ASSEMBLER_NAME (decl) = get_identifier (libname);
6578 make_function_rtl (decl);
6582 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6583 function. Not called directly. */
6586 build_library_fn_1 (name, type)
6590 tree fn = build_lang_decl (FUNCTION_DECL, name, type);
6591 DECL_EXTERNAL (fn) = 1;
6592 TREE_PUBLIC (fn) = 1;
6593 DECL_ARTIFICIAL (fn) = 1;
6594 TREE_NOTHROW (fn) = 1;
6598 /* Returns the _DECL for a library function with C linkage.
6599 We assume that such functions never throw; if this is incorrect,
6600 callers should unset TREE_NOTHROW. */
6603 build_library_fn (name, type)
6607 tree fn = build_library_fn_1 (name, type);
6608 make_function_rtl (fn);
6612 /* Returns the _DECL for a library function with C++ linkage. */
6615 build_cp_library_fn (name, type)
6619 tree fn = build_library_fn_1 (name, type);
6620 TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type);
6621 set_mangled_name_for_decl (fn);
6622 make_function_rtl (fn);
6626 /* Like build_library_fn, but takes a C string instead of an
6630 build_library_fn_ptr (name, type)
6634 return build_library_fn (get_identifier (name), type);
6637 /* Like build_cp_library_fn, but takes a C string instead of an
6641 build_cp_library_fn_ptr (name, type)
6645 return build_cp_library_fn (get_identifier (name), type);
6648 /* Like build_library_fn, but also pushes the function so that we will
6649 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6652 push_library_fn (name, type)
6655 tree fn = build_library_fn (name, type);
6656 pushdecl_top_level (fn);
6660 /* Like build_cp_library_fn, but also pushes the function so that it
6661 will be found by normal lookup. */
6664 push_cp_library_fn (name, type)
6668 tree fn = build_cp_library_fn (name, type);
6673 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6677 push_void_library_fn (name, parmtypes)
6678 tree name, parmtypes;
6680 tree type = build_function_type (void_type_node, parmtypes);
6681 return push_library_fn (name, type);
6684 /* Like push_library_fn, but also note that this function throws
6685 and does not return. Used for __throw_foo and the like. */
6688 push_throw_library_fn (name, type)
6691 tree fn = push_library_fn (name, type);
6692 TREE_THIS_VOLATILE (fn) = 1;
6693 TREE_NOTHROW (fn) = 0;
6697 /* When we call finish_struct for an anonymous union, we create
6698 default copy constructors and such. But, an anonymous union
6699 shouldn't have such things; this function undoes the damage to the
6700 anonymous union type T.
6702 (The reason that we create the synthesized methods is that we don't
6703 distinguish `union { int i; }' from `typedef union { int i; } U'.
6704 The first is an anonymous union; the second is just an ordinary
6708 fixup_anonymous_aggr (t)
6713 /* Wipe out memory of synthesized methods */
6714 TYPE_HAS_CONSTRUCTOR (t) = 0;
6715 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
6716 TYPE_HAS_INIT_REF (t) = 0;
6717 TYPE_HAS_CONST_INIT_REF (t) = 0;
6718 TYPE_HAS_ASSIGN_REF (t) = 0;
6719 TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
6721 /* Splice the implicitly generated functions out of the TYPE_METHODS
6723 q = &TYPE_METHODS (t);
6726 if (DECL_ARTIFICIAL (*q))
6727 *q = TREE_CHAIN (*q);
6729 q = &TREE_CHAIN (*q);
6732 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6733 if (TYPE_METHODS (t))
6734 error ("an anonymous union cannot have function members");
6737 /* Make sure that a declaration with no declarator is well-formed, i.e.
6738 just defines a tagged type or anonymous union.
6740 Returns the type defined, if any. */
6743 check_tag_decl (declspecs)
6747 tree ob_modifier = NULL_TREE;
6749 register tree t = NULL_TREE;
6751 for (link = declspecs; link; link = TREE_CHAIN (link))
6753 register tree value = TREE_VALUE (link);
6759 if (IS_AGGR_TYPE (value) || TREE_CODE (value) == ENUMERAL_TYPE)
6761 my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
6765 else if (value == ridpointers[(int) RID_FRIEND])
6767 if (current_class_type == NULL_TREE
6768 || current_scope () != current_class_type)
6769 ob_modifier = value;
6771 else if (value == ridpointers[(int) RID_STATIC]
6772 || value == ridpointers[(int) RID_EXTERN]
6773 || value == ridpointers[(int) RID_AUTO]
6774 || value == ridpointers[(int) RID_REGISTER]
6775 || value == ridpointers[(int) RID_INLINE]
6776 || value == ridpointers[(int) RID_VIRTUAL]
6777 || value == ridpointers[(int) RID_CONST]
6778 || value == ridpointers[(int) RID_VOLATILE]
6779 || value == ridpointers[(int) RID_EXPLICIT])
6780 ob_modifier = value;
6784 error ("multiple types in one declaration");
6786 /* Inside a class, we might be in a friend or access declaration.
6787 Until we have a good way of detecting the latter, don't warn. */
6788 if (t == NULL_TREE && ! current_class_type)
6789 pedwarn ("declaration does not declare anything");
6791 /* Check for an anonymous union. We're careful
6792 accessing TYPE_IDENTIFIER because some built-in types, like
6793 pointer-to-member types, do not have TYPE_NAME. */
6794 else if (t && IS_AGGR_TYPE_CODE (TREE_CODE (t))
6796 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
6798 /* Anonymous unions are objects, so they can have specifiers. */;
6799 SET_ANON_AGGR_TYPE_P (t);
6801 if (TREE_CODE (t) != UNION_TYPE && pedantic && ! in_system_header)
6802 pedwarn ("ISO C++ prohibits anonymous structs");
6805 else if (ob_modifier)
6807 if (ob_modifier == ridpointers[(int) RID_INLINE]
6808 || ob_modifier == ridpointers[(int) RID_VIRTUAL])
6809 cp_error ("`%D' can only be specified for functions", ob_modifier);
6810 else if (ob_modifier == ridpointers[(int) RID_FRIEND])
6811 cp_error ("`%D' can only be specified inside a class", ob_modifier);
6812 else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
6813 cp_error ("`%D' can only be specified for constructors",
6816 cp_error ("`%D' can only be specified for objects and functions",
6823 /* Called when a declaration is seen that contains no names to declare.
6824 If its type is a reference to a structure, union or enum inherited
6825 from a containing scope, shadow that tag name for the current scope
6826 with a forward reference.
6827 If its type defines a new named structure or union
6828 or defines an enum, it is valid but we need not do anything here.
6829 Otherwise, it is an error.
6831 C++: may have to grok the declspecs to learn about static,
6832 complain for anonymous unions. */
6835 shadow_tag (declspecs)
6838 tree t = check_tag_decl (declspecs);
6841 maybe_process_partial_specialization (t);
6843 /* This is where the variables in an anonymous union are
6844 declared. An anonymous union declaration looks like:
6846 because there is no declarator after the union, the parser
6847 sends that declaration here. */
6848 if (t && ANON_AGGR_TYPE_P (t))
6850 fixup_anonymous_aggr (t);
6852 if (TYPE_FIELDS (t))
6854 tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
6856 finish_anon_union (decl);
6861 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6864 groktypename (typename)
6867 if (TREE_CODE (typename) != TREE_LIST)
6869 return grokdeclarator (TREE_VALUE (typename),
6870 TREE_PURPOSE (typename),
6871 TYPENAME, 0, NULL_TREE);
6874 /* Decode a declarator in an ordinary declaration or data definition.
6875 This is called as soon as the type information and variable name
6876 have been parsed, before parsing the initializer if any.
6877 Here we create the ..._DECL node, fill in its type,
6878 and put it on the list of decls for the current context.
6879 The ..._DECL node is returned as the value.
6881 Exception: for arrays where the length is not specified,
6882 the type is left null, to be filled in by `cp_finish_decl'.
6884 Function definitions do not come here; they go to start_function
6885 instead. However, external and forward declarations of functions
6886 do go through here. Structure field declarations are done by
6887 grokfield and not through here. */
6889 /* Set this to zero to debug not using the temporary obstack
6890 to parse initializers. */
6891 int debug_temp_inits = 1;
6894 start_decl (declarator, declspecs, initialized, attributes, prefix_attributes)
6895 tree declarator, declspecs;
6897 tree attributes, prefix_attributes;
6900 register tree type, tem;
6902 extern int have_extern_spec;
6903 extern int used_extern_spec;
6907 /* See code below that used this. */
6908 int init_written = initialized;
6911 /* This should only be done once on the top most decl. */
6912 if (have_extern_spec && !used_extern_spec)
6914 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"),
6916 used_extern_spec = 1;
6919 if (attributes || prefix_attributes)
6920 attrlist = build_tree_list (attributes, prefix_attributes);
6922 attrlist = NULL_TREE;
6924 decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
6927 if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
6930 type = TREE_TYPE (decl);
6932 if (type == error_mark_node)
6935 context = DECL_CONTEXT (decl);
6937 if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
6938 && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
6940 /* When parsing the initializer, lookup should use the object's
6942 push_decl_namespace (context);
6945 /* We are only interested in class contexts, later. */
6946 if (context && TREE_CODE (context) == NAMESPACE_DECL)
6947 context = NULL_TREE;
6950 /* Is it valid for this decl to have an initializer at all?
6951 If not, set INITIALIZED to zero, which will indirectly
6952 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6953 switch (TREE_CODE (decl))
6956 /* typedef foo = bar means give foo the same type as bar.
6957 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6958 Any other case of an initialization in a TYPE_DECL is an error. */
6959 if (pedantic || list_length (declspecs) > 1)
6961 cp_error ("typedef `%D' is initialized", decl);
6967 cp_error ("function `%#D' is initialized like a variable", decl);
6977 if (! toplevel_bindings_p ()
6978 && DECL_EXTERNAL (decl))
6979 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6981 DECL_EXTERNAL (decl) = 0;
6982 if (toplevel_bindings_p ())
6983 TREE_STATIC (decl) = 1;
6985 /* Tell `pushdecl' this is an initialized decl
6986 even though we don't yet have the initializer expression.
6987 Also tell `cp_finish_decl' it may store the real initializer. */
6988 DECL_INITIAL (decl) = error_mark_node;
6991 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6992 SET_DEFAULT_DECL_ATTRIBUTES (decl, attributes);
6995 /* Set attributes here so if duplicate decl, will have proper attributes. */
6996 cplus_decl_attributes (decl, attributes, prefix_attributes);
6998 if (context && TYPE_SIZE (complete_type (context)) != NULL_TREE)
7000 push_nested_class (context, 2);
7002 if (TREE_CODE (decl) == VAR_DECL)
7004 tree field = lookup_field (context, DECL_NAME (decl), 0, 0);
7005 if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
7006 cp_error ("`%#D' is not a static member of `%#T'", decl, context);
7009 if (DECL_CONTEXT (field) != context)
7011 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7012 DECL_CONTEXT (field), DECL_NAME (decl),
7013 context, DECL_NAME (decl));
7014 DECL_CONTEXT (decl) = DECL_CONTEXT (field);
7016 /* Static data member are tricky; an in-class initialization
7017 still doesn't provide a definition, so the in-class
7018 declaration will have DECL_EXTERNAL set, but will have an
7019 initialization. Thus, duplicate_decls won't warn
7020 about this situation, and so we check here. */
7021 if (DECL_INITIAL (decl) && DECL_INITIAL (field))
7022 cp_error ("duplicate initialization of %D", decl);
7023 if (duplicate_decls (decl, field))
7029 tree field = check_classfn (context, decl);
7030 if (field && duplicate_decls (decl, field))
7034 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7035 DECL_IN_AGGR_P (decl) = 0;
7036 if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
7037 || CLASSTYPE_USE_TEMPLATE (context))
7039 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
7040 /* [temp.expl.spec] An explicit specialization of a static data
7041 member of a template is a definition if the declaration
7042 includes an initializer; otherwise, it is a declaration.
7044 We check for processing_specialization so this only applies
7045 to the new specialization syntax. */
7046 if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
7047 DECL_EXTERNAL (decl) = 1;
7050 if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
7051 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7055 /* Enter this declaration into the symbol table. */
7056 tem = maybe_push_decl (decl);
7058 if (processing_template_decl)
7059 tem = push_template_decl (tem);
7061 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7062 /* Tell the back-end to use or not use .common as appropriate. If we say
7063 -fconserve-space, we want this to save .data space, at the expense of
7064 wrong semantics. If we say -fno-conserve-space, we want this to
7065 produce errors about redefs; to do this we force variables into the
7067 DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem);
7070 if (! processing_template_decl)
7080 tree type = TREE_TYPE (decl);
7081 int initialized = (DECL_INITIAL (decl) != NULL_TREE);
7083 if (type == error_mark_node)
7086 /* If this type of object needs a cleanup, but we're not allowed to
7087 add any more objects with cleanups to the current scope, create a
7088 new binding level. */
7089 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
7090 && current_binding_level->more_cleanups_ok == 0)
7092 keep_next_level (2);
7095 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7099 /* Is it valid for this decl to have an initializer at all?
7100 If not, set INITIALIZED to zero, which will indirectly
7101 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7103 /* Don't allow initializations for incomplete types except for
7104 arrays which might be completed by the initialization. */
7105 if (TYPE_SIZE (complete_type (type)) != NULL_TREE)
7106 ; /* A complete type is ok. */
7107 else if (TREE_CODE (type) != ARRAY_TYPE)
7109 cp_error ("variable `%#D' has initializer but incomplete type",
7112 type = TREE_TYPE (decl) = error_mark_node;
7114 else if (TYPE_SIZE (complete_type (TREE_TYPE (type))) == NULL_TREE)
7116 if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
7117 cp_error ("elements of array `%#D' have incomplete type", decl);
7118 /* else we already gave an error in start_decl. */
7124 && TREE_CODE (decl) != TYPE_DECL
7125 && TREE_CODE (decl) != TEMPLATE_DECL
7126 && type != error_mark_node
7127 && IS_AGGR_TYPE (type)
7128 && ! DECL_EXTERNAL (decl))
7130 if ((! processing_template_decl || ! uses_template_parms (type))
7131 && TYPE_SIZE (complete_type (type)) == NULL_TREE)
7133 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7135 /* Change the type so that assemble_variable will give
7136 DECL an rtl we can live with: (mem (const_int 0)). */
7137 type = TREE_TYPE (decl) = error_mark_node;
7141 /* If any base type in the hierarchy of TYPE needs a constructor,
7142 then we set initialized to 1. This way any nodes which are
7143 created for the purposes of initializing this aggregate
7144 will live as long as it does. This is necessary for global
7145 aggregates which do not have their initializers processed until
7146 the end of the file. */
7147 initialized = TYPE_NEEDS_CONSTRUCTING (type);
7152 DECL_INITIAL (decl) = NULL_TREE;
7155 /* Handle initialization of references.
7156 These three arguments are from `cp_finish_decl', and have the
7157 same meaning here that they do there.
7159 Quotes on semantics can be found in ARM 8.4.3. */
7162 grok_reference_init (decl, type, init)
7163 tree decl, type, init;
7167 if (init == NULL_TREE)
7169 if ((DECL_LANG_SPECIFIC (decl) == 0
7170 || DECL_IN_AGGR_P (decl) == 0)
7171 && ! DECL_THIS_EXTERN (decl))
7172 cp_error ("`%D' declared as reference but not initialized", decl);
7176 if (init == error_mark_node)
7179 if (TREE_CODE (init) == CONSTRUCTOR)
7181 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl);
7185 if (TREE_CODE (init) == TREE_LIST)
7186 init = build_compound_expr (init);
7188 if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
7189 init = convert_from_reference (init);
7191 if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
7192 && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
7194 /* Note: default conversion is only called in very special cases. */
7195 init = default_conversion (init);
7198 /* Convert INIT to the reference type TYPE. This may involve the
7199 creation of a temporary, whose lifetime must be the same as that
7200 of the reference. If so, a DECL_STMT for the temporary will be
7201 added just after the DECL_STMT for DECL. That's why we don't set
7202 DECL_INITIAL for local references (instead assigning to them
7203 explicitly); we need to allow the temporary to be initialized
7205 tmp = convert_to_reference
7206 (type, init, CONV_IMPLICIT,
7207 LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND, decl);
7209 if (tmp == error_mark_node)
7211 else if (tmp != NULL_TREE)
7214 tmp = save_expr (tmp);
7215 if (building_stmt_tree ())
7217 /* Initialize the declaration. */
7218 tmp = build (INIT_EXPR, TREE_TYPE (decl), decl, tmp);
7219 finish_expr_stmt (tmp);
7222 DECL_INITIAL (decl) = tmp;
7226 cp_error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
7230 if (TREE_STATIC (decl) && ! TREE_CONSTANT (DECL_INITIAL (decl)))
7232 expand_static_init (decl, DECL_INITIAL (decl));
7233 DECL_INITIAL (decl) = NULL_TREE;
7238 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7239 mucking with forces it does not comprehend (i.e. initialization with a
7240 constructor). If we are at global scope and won't go into COMMON, fill
7241 it in with a dummy CONSTRUCTOR to force the variable into .data;
7242 otherwise we can use error_mark_node. */
7245 obscure_complex_init (decl, init)
7248 if (! flag_no_inline && TREE_STATIC (decl))
7250 if (extract_init (decl, init))
7254 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7255 if (toplevel_bindings_p () && ! DECL_COMMON (decl))
7256 DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE,
7260 DECL_INITIAL (decl) = error_mark_node;
7265 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7266 array until we finish parsing the initializer. If that's the
7267 situation we're in, update DECL accordingly. */
7270 maybe_deduce_size_from_array_init (decl, init)
7274 tree type = TREE_TYPE (decl);
7276 if (TREE_CODE (type) == ARRAY_TYPE
7277 && TYPE_DOMAIN (type) == NULL_TREE
7278 && TREE_CODE (decl) != TYPE_DECL)
7281 = (TREE_STATIC (decl)
7282 /* Even if pedantic, an external linkage array
7283 may have incomplete type at first. */
7284 ? pedantic && ! DECL_EXTERNAL (decl)
7285 : !DECL_EXTERNAL (decl));
7286 tree initializer = init ? init : DECL_INITIAL (decl);
7287 int failure = complete_array_type (type, initializer, do_default);
7290 cp_error ("initializer fails to determine size of `%D'", decl);
7295 cp_error ("array size missing in `%D'", decl);
7296 /* If a `static' var's size isn't known, make it extern as
7297 well as static, so it does not get allocated. If it's not
7298 `static', then don't mark it extern; finish_incomplete_decl
7299 will give it a default size and it will get allocated. */
7300 else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7301 DECL_EXTERNAL (decl) = 1;
7304 if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7305 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7307 cp_error ("zero-size array `%D'", decl);
7309 layout_decl (decl, 0);
7313 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7314 any appropriate error messages regarding the layout. */
7317 layout_var_decl (decl)
7320 tree type = TREE_TYPE (decl);
7322 tree ttype = target_type (type);
7325 /* If we haven't already layed out this declaration, do so now.
7326 Note that we must not call complete type for an external object
7327 because it's type might involve templates that we are not
7328 supposed to isntantiate yet. (And it's perfectly legal to say
7329 `extern X x' for some incomplete type `X'.) */
7330 if (!DECL_EXTERNAL (decl))
7331 complete_type (type);
7332 if (!DECL_SIZE (decl) && TYPE_SIZE (type))
7333 layout_decl (decl, 0);
7335 if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7337 /* An automatic variable with an incomplete type: that is an error.
7338 Don't talk about array types here, since we took care of that
7339 message in grokdeclarator. */
7340 cp_error ("storage size of `%D' isn't known", decl);
7341 TREE_TYPE (decl) = error_mark_node;
7344 /* Keep this code around in case we later want to control debug info
7345 based on whether a type is "used". (jason 1999-11-11) */
7347 else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7348 /* Let debugger know it should output info for this type. */
7349 note_debug_info_needed (ttype);
7351 if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7352 note_debug_info_needed (DECL_CONTEXT (decl));
7355 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7356 && DECL_SIZE (decl) != NULL_TREE
7357 && ! TREE_CONSTANT (DECL_SIZE (decl)))
7359 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7360 constant_expression_warning (DECL_SIZE (decl));
7362 cp_error ("storage size of `%D' isn't constant", decl);
7366 /* If a local static variable is declared in an inline function, or if
7367 we have a weak definition, we must endeavor to create only one
7368 instance of the variable at link-time. */
7371 maybe_commonize_var (decl)
7374 /* Static data in a function with comdat linkage also has comdat
7376 if (TREE_STATIC (decl)
7377 /* Don't mess with __FUNCTION__. */
7378 && ! DECL_ARTIFICIAL (decl)
7379 && current_function_decl
7380 && DECL_CONTEXT (decl) == current_function_decl
7381 && (DECL_THIS_INLINE (current_function_decl)
7382 || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7383 && TREE_PUBLIC (current_function_decl))
7385 /* Rather than try to get this right with inlining, we suppress
7386 inlining of such functions. */
7387 current_function_cannot_inline
7388 = "function with static variable cannot be inline";
7390 /* If flag_weak, we don't need to mess with this, as we can just
7391 make the function weak, and let it refer to its unique local
7392 copy. This works because we don't allow the function to be
7396 if (DECL_INTERFACE_KNOWN (current_function_decl))
7398 TREE_PUBLIC (decl) = 1;
7399 DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7401 else if (DECL_INITIAL (decl) == NULL_TREE
7402 || DECL_INITIAL (decl) == error_mark_node)
7404 TREE_PUBLIC (decl) = 1;
7405 DECL_COMMON (decl) = 1;
7407 /* else we lose. We can only do this if we can use common,
7408 which we can't if it has been initialized. */
7410 if (TREE_PUBLIC (decl))
7411 DECL_ASSEMBLER_NAME (decl)
7412 = build_static_name (current_function_decl, DECL_NAME (decl));
7415 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7416 cp_warning_at (" you can work around this by removing the initializer", decl);
7420 else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
7421 /* Set it up again; we might have set DECL_INITIAL since the last
7423 comdat_linkage (decl);
7426 /* Issue an error message if DECL is an uninitialized const variable. */
7429 check_for_uninitialized_const_var (decl)
7432 tree type = TREE_TYPE (decl);
7434 /* ``Unless explicitly declared extern, a const object does not have
7435 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7437 if (TREE_CODE (decl) == VAR_DECL
7438 && TREE_CODE (type) != REFERENCE_TYPE
7439 && CP_TYPE_CONST_P (type)
7440 && !TYPE_NEEDS_CONSTRUCTING (type)
7441 && !DECL_INITIAL (decl))
7442 cp_error ("uninitialized const `%D'", decl);
7445 /* Verify INIT (the initializer for DECL), and record the
7446 initialization in DECL_INITIAL, if appropriate. Returns a new
7450 check_initializer (decl, init)
7456 if (TREE_CODE (decl) == FIELD_DECL)
7459 type = TREE_TYPE (decl);
7461 /* If `start_decl' didn't like having an initialization, ignore it now. */
7462 if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7465 /* Check the initializer. */
7468 /* Things that are going to be initialized need to have complete
7470 TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl));
7472 if (type == error_mark_node)
7473 /* We will have already complained. */
7475 else if (TYPE_SIZE (type) && !TREE_CONSTANT (TYPE_SIZE (type)))
7477 cp_error ("variable-sized object `%D' may not be initialized", decl);
7480 else if (TREE_CODE (type) == ARRAY_TYPE
7481 && !TYPE_SIZE (TREE_TYPE (type)))
7483 cp_error ("elements of array `%#D' have incomplete type", decl);
7486 else if (!TYPE_SIZE (type))
7488 cp_error ("`%D' has incomplete type", decl);
7489 TREE_TYPE (decl) = error_mark_node;
7494 if (TREE_CODE (decl) == CONST_DECL)
7496 my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7498 DECL_INITIAL (decl) = init;
7500 /* This will keep us from needing to worry about our obstacks. */
7501 my_friendly_assert (init != NULL_TREE, 149);
7504 else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE)
7506 if (TREE_STATIC (decl))
7507 make_decl_rtl (decl, NULL_PTR, toplevel_bindings_p ());
7508 grok_reference_init (decl, type, init);
7513 if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7515 if (TREE_CODE (type) == ARRAY_TYPE)
7516 init = digest_init (type, init, (tree *) 0);
7517 else if (TREE_CODE (init) == CONSTRUCTOR
7518 && TREE_HAS_CONSTRUCTOR (init))
7520 if (TYPE_NON_AGGREGATE_CLASS (type))
7522 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7524 init = error_mark_node;
7527 goto dont_use_constructor;
7532 dont_use_constructor:
7533 if (TREE_CODE (init) != TREE_VEC)
7534 init = store_init_value (decl, init);
7538 /* We must hide the initializer so that expand_decl
7539 won't try to do something it does not understand. */
7540 init = obscure_complex_init (decl, init);
7542 else if (DECL_EXTERNAL (decl))
7544 else if (TREE_CODE_CLASS (TREE_CODE (type)) == 't'
7545 && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type)))
7547 tree core_type = strip_array_types (type);
7549 if (! TYPE_NEEDS_CONSTRUCTING (core_type))
7551 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type))
7552 cp_error ("structure `%D' with uninitialized const members", decl);
7553 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))
7554 cp_error ("structure `%D' with uninitialized reference members",
7558 check_for_uninitialized_const_var (decl);
7560 if (TYPE_SIZE (type) != NULL_TREE
7561 && TYPE_NEEDS_CONSTRUCTING (type))
7562 init = obscure_complex_init (decl, NULL_TREE);
7566 check_for_uninitialized_const_var (decl);
7571 /* If DECL is not a local variable, give it RTL. */
7574 make_rtl_for_nonlocal_decl (decl, init, asmspec)
7577 const char *asmspec;
7582 type = TREE_TYPE (decl);
7583 toplev = toplevel_bindings_p ();
7585 /* Handle non-variables up front. */
7586 if (TREE_CODE (decl) != VAR_DECL)
7588 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7592 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7594 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7596 if (DECL_VIRTUAL_P (decl))
7597 make_decl_rtl (decl, NULL_PTR, toplev);
7598 else if (TREE_READONLY (decl)
7599 && DECL_INITIAL (decl) != NULL_TREE
7600 && DECL_INITIAL (decl) != error_mark_node
7601 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
7603 DECL_INITIAL (decl) = save_expr (DECL_INITIAL (decl));
7605 if (toplev && ! TREE_PUBLIC (decl))
7607 /* If this is a static const, change its apparent linkage
7608 if it belongs to a #pragma interface. */
7609 if (!interface_unknown)
7611 TREE_PUBLIC (decl) = 1;
7612 DECL_EXTERNAL (decl) = interface_only;
7614 make_decl_rtl (decl, asmspec, toplev);
7617 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7619 else if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl))
7621 my_friendly_assert (TREE_STATIC (decl), 19990828);
7623 if (init == NULL_TREE
7624 #ifdef DEFAULT_STATIC_DEFS
7625 /* If this code is dead, then users must
7626 explicitly declare static member variables
7627 outside the class def'n as well. */
7628 && TYPE_NEEDS_CONSTRUCTING (type)
7632 DECL_EXTERNAL (decl) = 1;
7633 make_decl_rtl (decl, asmspec, 1);
7636 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7638 else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == NAMESPACE_DECL
7639 || (TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl)))
7640 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7643 /* Create RTL for the local static variable DECL. */
7646 make_rtl_for_local_static (decl)
7649 const char *asmspec = NULL;
7651 /* If we inlined this variable, we could see it's declaration
7653 if (DECL_RTL (decl))
7656 if (DECL_ASSEMBLER_NAME (decl) != DECL_NAME (decl))
7658 /* The only way this situaton can occur is if the
7659 user specified a name for this DECL using the
7660 `attribute' syntax. */
7661 asmspec = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
7662 DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
7665 rest_of_decl_compilation (decl, asmspec, /*top_level=*/0, /*at_end=*/0);
7668 /* The old ARM scoping rules injected variables declared in the
7669 initialization statement of a for-statement into the surrounding
7670 scope. We support this usage, in order to be backward-compatible.
7671 DECL is a just-declared VAR_DECL; if necessary inject its
7672 declaration into the surrounding scope. */
7675 maybe_inject_for_scope_var (decl)
7678 if (current_binding_level->is_for_scope)
7680 struct binding_level *outer
7681 = current_binding_level->level_chain;
7683 /* Check to see if the same name is already bound at the outer
7684 level, either because it was directly declared, or because a
7685 dead for-decl got preserved. In either case, the code would
7686 not have been valid under the ARM scope rules, so clear
7687 is_for_scope for the current_binding_level.
7689 Otherwise, we need to preserve the temp slot for decl to last
7690 into the outer binding level. */
7693 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
7695 if (outer_binding && BINDING_LEVEL (outer_binding) == outer
7696 && (TREE_CODE (BINDING_VALUE (outer_binding))
7698 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
7700 BINDING_VALUE (outer_binding)
7701 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
7702 current_binding_level->is_for_scope = 0;
7704 else if (DECL_IN_MEMORY_P (decl))
7705 preserve_temp_slots (DECL_RTL (decl));
7709 /* Generate code to initialize DECL (a local variable). */
7712 initialize_local_var (decl, init, flags)
7717 tree type = TREE_TYPE (decl);
7719 /* If the type is bogus, don't bother initializing the variable. */
7720 if (type == error_mark_node)
7723 if (DECL_SIZE (decl) == NULL_TREE && !TREE_STATIC (decl))
7725 /* If we used it already as memory, it must stay in memory. */
7726 DECL_INITIAL (decl) = NULL_TREE;
7727 TREE_ADDRESSABLE (decl) = TREE_USED (decl);
7730 /* Local statics are handled differently from ordinary automatic
7732 if (TREE_STATIC (decl))
7734 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
7735 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7736 expand_static_init (decl, init);
7740 if (DECL_SIZE (decl) && type != error_mark_node)
7744 /* Compute and store the initial value. */
7745 already_used = TREE_USED (decl) || TREE_USED (type);
7747 if (init || TYPE_NEEDS_CONSTRUCTING (type))
7749 int saved_stmts_are_full_exprs_p;
7751 emit_line_note (DECL_SOURCE_FILE (decl),
7752 DECL_SOURCE_LINE (decl));
7753 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p;
7754 stmts_are_full_exprs_p = 1;
7755 finish_expr_stmt (build_aggr_init (decl, init, flags));
7756 stmts_are_full_exprs_p = saved_stmts_are_full_exprs_p;
7759 /* Set this to 0 so we can tell whether an aggregate which was
7760 initialized was ever used. Don't do this if it has a
7761 destructor, so we don't complain about the 'resource
7762 allocation is initialization' idiom. Now set
7763 attribute((unused)) on types so decls of that type will be
7764 marked used. (see TREE_USED, above.) */
7765 if (TYPE_NEEDS_CONSTRUCTING (type)
7767 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type)
7768 && DECL_NAME (decl))
7769 TREE_USED (decl) = 0;
7770 else if (already_used)
7771 TREE_USED (decl) = 1;
7775 /* Generate code to destroy DECL (a local variable). */
7778 destroy_local_var (decl)
7781 tree type = TREE_TYPE (decl);
7784 /* Only variables get cleaned up. */
7785 if (TREE_CODE (decl) != VAR_DECL)
7788 /* And only things with destructors need cleaning up. */
7789 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
7792 if (TREE_CODE (decl) == VAR_DECL &&
7793 (DECL_EXTERNAL (decl) || TREE_STATIC (decl)))
7794 /* We don't clean up things that aren't defined in this
7795 translation unit, or that need a static cleanup. The latter
7796 are handled by finish_file. */
7799 /* Compute the cleanup. */
7800 cleanup = maybe_build_cleanup (decl);
7802 /* Record the cleanup required for this declaration. */
7803 if (DECL_SIZE (decl) && TREE_TYPE (decl) != error_mark_node
7805 finish_decl_cleanup (decl, cleanup);
7808 /* Let the back-end know about DECL. */
7811 emit_local_var (decl)
7814 /* Create RTL for this variable. */
7815 if (DECL_RTL (decl))
7816 /* Only a RESULT_DECL should have non-NULL RTL when arriving here.
7817 All other local variables are assigned RTL in this function. */
7818 my_friendly_assert (TREE_CODE (decl) == RESULT_DECL,
7822 if (DECL_ASSEMBLER_NAME (decl) != DECL_NAME (decl))
7823 /* The user must have specified an assembler name for this
7824 variable. Set that up now. */
7825 rest_of_decl_compilation
7826 (decl, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)),
7827 /*top_level=*/0, /*at_end=*/0);
7832 /* Actually do the initialization. */
7833 expand_start_target_temps ();
7834 expand_decl_init (decl);
7835 expand_end_target_temps ();
7838 /* Finish processing of a declaration;
7839 install its line number and initial value.
7840 If the length of an array type is not known before,
7841 it must be determined now, from the initial value, or it is an error.
7843 INIT0 holds the value of an initializer that should be allowed to escape
7846 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7847 if the (init) syntax was used. */
7850 cp_finish_decl (decl, init, asmspec_tree, flags)
7856 tree ttype = NULL_TREE;
7857 const char *asmspec = NULL;
7858 int was_readonly = 0;
7863 error ("assignment (not initialization) in declaration");
7867 /* If a name was specified, get the string. */
7869 asmspec = TREE_STRING_POINTER (asmspec_tree);
7871 if (init && TREE_CODE (init) == NAMESPACE_DECL)
7873 cp_error ("cannot initialize `%D' to namespace `%D'",
7878 if (current_class_type
7879 && CP_DECL_CONTEXT (decl) == current_class_type
7880 && TYPE_BEING_DEFINED (current_class_type)
7881 && (DECL_INITIAL (decl) || init))
7882 DECL_DEFINED_IN_CLASS_P (decl) = 1;
7884 if (TREE_CODE (decl) == VAR_DECL
7885 && DECL_CONTEXT (decl)
7886 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
7887 && DECL_CONTEXT (decl) != current_namespace
7890 /* Leave the namespace of the object. */
7891 pop_decl_namespace ();
7894 type = TREE_TYPE (decl);
7896 if (type == error_mark_node)
7899 /* Add this declaration to the statement-tree. */
7900 if (building_stmt_tree () && at_function_scope_p ())
7901 add_decl_stmt (decl);
7903 if (TYPE_HAS_MUTABLE_P (type))
7904 TREE_READONLY (decl) = 0;
7906 if (processing_template_decl)
7908 if (init && DECL_INITIAL (decl))
7909 DECL_INITIAL (decl) = init;
7913 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7914 my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828);
7916 /* Take care of TYPE_DECLs up front. */
7917 if (TREE_CODE (decl) == TYPE_DECL)
7919 if (init && DECL_INITIAL (decl))
7921 /* typedef foo = bar; store the type of bar as the type of foo. */
7922 TREE_TYPE (decl) = type = TREE_TYPE (init);
7923 DECL_INITIAL (decl) = init = NULL_TREE;
7925 if (type != error_mark_node
7926 && IS_AGGR_TYPE (type) && DECL_NAME (decl))
7928 if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
7929 cp_warning ("shadowing previous type declaration of `%#D'", decl);
7930 set_identifier_type_value (DECL_NAME (decl), type);
7931 CLASSTYPE_GOT_SEMICOLON (type) = 1;
7933 GNU_xref_decl (current_function_decl, decl);
7935 /* If we have installed this as the canonical typedef for this
7936 type, and that type has not been defined yet, delay emitting
7937 the debug information for it, as we will emit it later. */
7938 if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
7939 && TYPE_SIZE (TREE_TYPE (decl)) == NULL_TREE)
7940 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
7942 rest_of_decl_compilation (decl, NULL_PTR,
7943 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
7947 if (TREE_CODE (decl) != FUNCTION_DECL)
7948 ttype = target_type (type);
7950 if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
7951 && TYPE_NEEDS_CONSTRUCTING (type))
7953 /* Currently, GNU C++ puts constants in text space, making them
7954 impossible to initialize. In the future, one would hope for
7955 an operating system which understood the difference between
7956 initialization and the running of a program. */
7958 TREE_READONLY (decl) = 0;
7961 if (TREE_CODE (decl) == FIELD_DECL && asmspec)
7963 /* This must override the asm specifier which was placed by
7964 grokclassfn. Lay this out fresh. */
7965 DECL_RTL (TREE_TYPE (decl)) = NULL_RTX;
7966 DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7967 make_decl_rtl (decl, asmspec, 0);
7970 /* Deduce size of array from initialization, if not already known. */
7971 maybe_deduce_size_from_array_init (decl, init);
7972 init = check_initializer (decl, init);
7974 GNU_xref_decl (current_function_decl, decl);
7976 if (TREE_CODE (decl) == VAR_DECL)
7977 layout_var_decl (decl);
7979 /* Output the assembler code and/or RTL code for variables and functions,
7980 unless the type is an undefined structure or union.
7981 If not, it will get done when the type is completed. */
7982 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
7983 || TREE_CODE (decl) == RESULT_DECL)
7985 if (TREE_CODE (decl) == VAR_DECL)
7986 maybe_commonize_var (decl);
7988 make_rtl_for_nonlocal_decl (decl, init, asmspec);
7990 if (TREE_CODE (type) == FUNCTION_TYPE
7991 || TREE_CODE (type) == METHOD_TYPE)
7992 abstract_virtuals_error (decl,
7993 strip_array_types (TREE_TYPE (type)));
7995 abstract_virtuals_error (decl, strip_array_types (type));
7997 if (TREE_CODE (decl) == FUNCTION_DECL)
7999 else if (DECL_EXTERNAL (decl)
8000 && ! (DECL_LANG_SPECIFIC (decl)
8001 && DECL_NOT_REALLY_EXTERN (decl)))
8004 DECL_INITIAL (decl) = init;
8006 else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
8008 /* This is a local declaration. */
8009 if (doing_semantic_analysis_p ())
8010 maybe_inject_for_scope_var (decl);
8011 /* Initialize the local variable. But, if we're building a
8012 statement-tree, we'll do the initialization when we
8014 if (processing_template_decl)
8016 if (init || DECL_INITIAL (decl) == error_mark_node)
8017 DECL_INITIAL (decl) = init;
8021 /* If we're not building RTL, then we need to do so
8023 if (!building_stmt_tree ())
8024 emit_local_var (decl);
8025 /* Initialize the variable. */
8026 initialize_local_var (decl, init, flags);
8027 /* Clean up the variable. */
8028 destroy_local_var (decl);
8031 else if (TREE_STATIC (decl) && type != error_mark_node)
8033 /* Cleanups for static variables are handled by `finish_file'. */
8034 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
8035 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
8036 expand_static_init (decl, init);
8040 /* Undo call to `pushclass' that was done in `start_decl'
8041 due to initialization of qualified member variable.
8042 I.e., Foo::x = 10; */
8044 tree context = CP_DECL_CONTEXT (decl);
8046 && TREE_CODE_CLASS (TREE_CODE (context)) == 't'
8047 && (TREE_CODE (decl) == VAR_DECL
8048 /* We also have a pushclass done that we need to undo here
8049 if we're at top level and declare a method. */
8050 || TREE_CODE (decl) == FUNCTION_DECL)
8051 /* If size hasn't been set, we're still defining it,
8052 and therefore inside the class body; don't pop
8053 the binding level.. */
8054 && TYPE_SIZE (context) != NULL_TREE
8055 && context == current_class_type)
8056 pop_nested_class ();
8063 TREE_READONLY (decl) = 1;
8066 /* This is here for a midend callback from c-common.c */
8069 finish_decl (decl, init, asmspec_tree)
8073 cp_finish_decl (decl, init, asmspec_tree, 0);
8076 /* Returns a declaration for a VAR_DECL as if:
8078 extern "C" TYPE NAME;
8080 had been seen. Used to create compiler-generated global
8084 declare_global_var (name, type)
8090 push_to_top_level ();
8091 decl = build_decl (VAR_DECL, name, type);
8092 TREE_PUBLIC (decl) = 1;
8093 DECL_EXTERNAL (decl) = 1;
8094 DECL_ARTIFICIAL (decl) = 1;
8096 cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
8097 pop_from_top_level ();
8102 /* Returns a pointer to the `atexit' function. Note that if
8103 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8104 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8118 if (flag_use_cxa_atexit)
8120 /* The declaration for `__cxa_atexit' is:
8122 int __cxa_atexit (void (*)(void *), void *, void *)
8124 We build up the argument types and then then function type
8127 /* First, build the pointer-to-function type for the first
8129 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8130 fn_type = build_function_type (void_type_node, arg_types);
8131 fn_ptr_type = build_pointer_type (fn_type);
8132 /* Then, build the rest of the argument types. */
8133 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8134 arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
8135 arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types);
8136 /* And the final __cxa_atexit type. */
8137 fn_type = build_function_type (integer_type_node, arg_types);
8138 fn_ptr_type = build_pointer_type (fn_type);
8139 name = "__cxa_atexit";
8143 /* The declaration for `atexit' is:
8145 int atexit (void (*)());
8147 We build up the argument types and then then function type
8149 fn_type = build_function_type (void_type_node, void_list_node);
8150 fn_ptr_type = build_pointer_type (fn_type);
8151 arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node);
8152 /* Build the final atexit type. */
8153 fn_type = build_function_type (integer_type_node, arg_types);
8157 /* Now, build the function declaration. */
8158 push_lang_context (lang_name_c);
8159 atexit_fndecl = build_library_fn_ptr (name, fn_type);
8160 mark_used (atexit_fndecl);
8161 pop_lang_context ();
8162 atexit_node = default_conversion (atexit_fndecl);
8167 /* Returns the __dso_handle VAR_DECL. */
8170 get_dso_handle_node ()
8172 if (dso_handle_node)
8173 return dso_handle_node;
8175 /* Declare the variable. */
8176 dso_handle_node = declare_global_var (get_identifier ("__dso_handle"),
8179 return dso_handle_node;
8182 /* Begin a new function with internal linkage whose job will be simply
8183 to destroy some particular variable. */
8188 static int counter = 0;
8189 int old_interface_unknown = interface_unknown;
8195 push_to_top_level ();
8197 /* No need to mangle this. */
8198 push_lang_context (lang_name_c);
8200 interface_unknown = 1;
8202 /* Build the parameter-types. */
8203 parmtypes = void_list_node;
8204 /* Functions passed to __cxa_atexit take an additional parameter.
8205 We'll just ignore it. After we implement the new calling
8206 convention for destructors, we can eliminate the use of
8207 additional cleanup functions entirely in the -fnew-abi case. */
8208 if (flag_use_cxa_atexit)
8209 parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes);
8210 /* Build the function type itself. */
8211 fntype = build_function_type (void_type_node, parmtypes);
8212 /* Build the name of the function. */
8213 sprintf (name, "__tcf_%d", counter++);
8214 /* Build the function declaration. */
8215 fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype);
8216 /* It's a function with internal linkage, generated by the
8218 TREE_PUBLIC (fndecl) = 0;
8219 DECL_ARTIFICIAL (fndecl) = 1;
8220 /* Build the parameter. */
8221 if (flag_use_cxa_atexit)
8225 parmdecl = build_decl (PARM_DECL, NULL_TREE, ptr_type_node);
8226 DECL_CONTEXT (parmdecl) = fndecl;
8227 DECL_ARG_TYPE (parmdecl) = ptr_type_node;
8228 TREE_USED (parmdecl) = 1;
8229 DECL_ARGUMENTS (fndecl) = parmdecl;
8233 start_function (/*specs=*/NULL_TREE, fndecl, NULL_TREE, SF_PRE_PARSED);
8236 interface_unknown = old_interface_unknown;
8238 pop_lang_context ();
8240 return current_function_decl;
8243 /* Finish the cleanup function begun by start_cleanup_fn. */
8250 expand_body (finish_function (lineno, 0));
8252 pop_from_top_level ();
8255 /* Generate code to handle the destruction of DECL, an object with
8256 static storage duration. */
8259 register_dtor_fn (decl)
8267 int saved_flag_access_control;
8269 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
8272 /* Call build_cleanup before we enter the anonymous function so that
8273 any access checks will be done relative to the current scope,
8274 rather than the scope of the anonymous function. */
8275 build_cleanup (decl);
8277 /* Now start the function. */
8278 cleanup = start_cleanup_fn ();
8280 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8281 to the original function, rather than the anonymous one. That
8282 will make the back-end think that nested functions are in use,
8283 which causes confusion. */
8284 saved_flag_access_control = flag_access_control;
8285 flag_access_control = 0;
8286 fcall = build_cleanup (decl);
8287 flag_access_control = saved_flag_access_control;
8289 /* Create the body of the anonymous function. */
8290 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
8291 finish_expr_stmt (fcall);
8292 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
8295 /* Call atexit with the cleanup function. */
8296 mark_addressable (cleanup);
8297 cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
8298 if (flag_use_cxa_atexit)
8300 args = tree_cons (NULL_TREE, get_dso_handle_node (), NULL_TREE);
8301 args = tree_cons (NULL_TREE, null_pointer_node, args);
8302 args = tree_cons (NULL_TREE, cleanup, args);
8305 args = tree_cons (NULL_TREE, cleanup, NULL_TREE);
8306 finish_expr_stmt (build_function_call (get_atexit_node (), args));
8310 expand_static_init (decl, init)
8314 tree oldstatic = value_member (decl, static_aggregates);
8318 if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
8319 cp_error ("multiple initializations given for `%D'", decl);
8321 else if (! toplevel_bindings_p ())
8323 /* Emit code to perform this initialization but once. */
8330 /* Emit code to perform this initialization but once. This code
8333 static int temp = 0;
8335 // Do initialization.
8337 // Register variable for destruction at end of program.
8340 Note that the `temp' variable is only set to 1 *after* the
8341 initialization is complete. This ensures that an exception,
8342 thrown during the construction, will cause the variable to
8343 reinitialized when we pass through this code again, as per:
8347 If the initialization exits by throwing an exception, the
8348 initialization is not complete, so it will be tried again
8349 the next time control enters the declaration.
8351 In theory, this process should be thread-safe, too; multiple
8352 threads should not be able to initialize the variable more
8353 than once. We don't yet attempt to ensure thread-safety. */
8354 temp = get_temp_name (integer_type_node, 1);
8355 rest_of_decl_compilation (temp, NULL_PTR, 0, 0);
8357 /* Begin the conditional initialization. */
8358 if_stmt = begin_if_stmt ();
8359 finish_if_stmt_cond (build_binary_op (EQ_EXPR, temp,
8362 then_clause = begin_compound_stmt (/*has_no_scope=*/0);
8364 /* Do the initialization itself. */
8365 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
8366 || (init && TREE_CODE (init) == TREE_LIST))
8367 assignment = build_aggr_init (decl, init, 0);
8369 /* The initialization we're doing here is just a bitwise
8371 assignment = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
8373 assignment = NULL_TREE;
8375 /* Once the assignment is complete, set TEMP to 1. Since the
8376 construction of the static object is complete at this point,
8377 we want to make sure TEMP is set to 1 even if a temporary
8378 constructed during the initialization throws an exception
8379 when it is destroyed. So, we combine the initialization and
8380 the assignment to TEMP into a single expression, ensuring
8381 that when we call finish_expr_stmt the cleanups will not be
8382 run until after TEMP is set to 1. */
8383 temp_init = build_modify_expr (temp, NOP_EXPR, integer_one_node);
8386 assignment = tree_cons (NULL_TREE, assignment,
8387 build_tree_list (NULL_TREE,
8389 assignment = build_compound_expr (assignment);
8392 assignment = temp_init;
8393 finish_expr_stmt (assignment);
8395 /* Use atexit to register a function for destroying this static
8397 register_dtor_fn (decl);
8399 finish_compound_stmt (/*has_no_scope=*/0, then_clause);
8400 finish_then_clause (if_stmt);
8404 static_aggregates = tree_cons (init, decl, static_aggregates);
8407 /* Finish the declaration of a catch-parameter. */
8410 start_handler_parms (declspecs, declarator)
8417 decl = grokdeclarator (declarator, declspecs, CATCHPARM,
8419 if (decl == NULL_TREE)
8420 error ("invalid catch parameter");
8429 /* Make TYPE a complete type based on INITIAL_VALUE.
8430 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8431 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8434 complete_array_type (type, initial_value, do_default)
8435 tree type, initial_value;
8438 register tree maxindex = NULL_TREE;
8443 /* Note MAXINDEX is really the maximum index,
8444 one less than the size. */
8445 if (TREE_CODE (initial_value) == STRING_CST)
8448 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8449 maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8452 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8454 tree elts = CONSTRUCTOR_ELTS (initial_value);
8456 maxindex = ssize_int (-1);
8457 for (; elts; elts = TREE_CHAIN (elts))
8459 if (TREE_PURPOSE (elts))
8460 maxindex = TREE_PURPOSE (elts);
8462 maxindex = size_binop (PLUS_EXPR, maxindex, ssize_int (1));
8464 maxindex = copy_node (maxindex);
8468 /* Make an error message unless that happened already. */
8469 if (initial_value != error_mark_node)
8472 initial_value = NULL_TREE;
8474 /* Prevent further error messages. */
8475 maxindex = build_int_2 (0, 0);
8482 maxindex = build_int_2 (0, 0);
8491 domain = build_index_type (maxindex);
8492 TYPE_DOMAIN (type) = domain;
8494 if (! TREE_TYPE (maxindex))
8495 TREE_TYPE (maxindex) = domain;
8497 itype = TREE_TYPE (initial_value);
8500 if (itype && !TYPE_DOMAIN (itype))
8501 TYPE_DOMAIN (itype) = domain;
8502 /* The type of the main variant should never be used for arrays
8503 of different sizes. It should only ever be completed with the
8504 size of the array. */
8505 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8506 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain;
8509 /* Lay out the type now that we can get the real answer. */
8516 /* Return zero if something is declared to be a member of type
8517 CTYPE when in the context of CUR_TYPE. STRING is the error
8518 message to print in that case. Otherwise, quietly return 1. */
8521 member_function_or_else (ctype, cur_type, flags)
8522 tree ctype, cur_type;
8523 enum overload_flags flags;
8525 if (ctype && ctype != cur_type)
8527 if (flags == DTOR_FLAG)
8528 error ("destructor for alien class `%s' cannot be a member",
8529 TYPE_NAME_STRING (ctype));
8531 error ("constructor for alien class `%s' cannot be a member",
8532 TYPE_NAME_STRING (ctype));
8538 /* Subroutine of `grokdeclarator'. */
8540 /* Generate errors possibly applicable for a given set of specifiers.
8541 This is for ARM $7.1.2. */
8544 bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises)
8547 int virtualp, quals, friendp, raises, inlinep;
8550 cp_error ("`%D' declared as a `virtual' %s", object, type);
8552 cp_error ("`%D' declared as an `inline' %s", object, type);
8554 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8557 cp_error_at ("`%D' declared as a friend", object);
8559 cp_error_at ("`%D' declared with an exception specification", object);
8562 /* CTYPE is class type, or null if non-class.
8563 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8565 DECLARATOR is the function's name.
8566 VIRTUALP is truthvalue of whether the function is virtual or not.
8567 FLAGS are to be passed through to `grokclassfn'.
8568 QUALS are qualifiers indicating whether the function is `const'
8570 RAISES is a list of exceptions that this function can raise.
8571 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8572 not look, and -1 if we should not call `grokclassfn' at all.
8574 Returns `NULL_TREE' if something goes wrong, after issuing
8575 applicable error messages. */
8578 grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals,
8579 raises, check, friendp, publicp, inlinep, funcdef_flag,
8580 template_count, in_namespace)
8583 tree orig_declarator;
8585 enum overload_flags flags;
8587 int check, friendp, publicp, inlinep, funcdef_flag, template_count;
8591 int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8592 int has_default_arg = 0;
8596 cname = TREE_CODE (TYPE_NAME (ctype)) == TYPE_DECL
8597 ? TYPE_IDENTIFIER (ctype) : TYPE_NAME (ctype);
8603 type = build_exception_variant (type, raises);
8606 decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8607 /* Propagate volatile out from type to decl. */
8608 if (TYPE_VOLATILE (type))
8609 TREE_THIS_VOLATILE (decl) = 1;
8611 /* If this decl has namespace scope, set that up. */
8613 set_decl_namespace (decl, in_namespace, friendp);
8614 else if (publicp && ! ctype)
8615 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8617 /* `main' and builtins have implicit 'C' linkage. */
8618 if ((MAIN_NAME_P (declarator)
8619 || (IDENTIFIER_LENGTH (declarator) > 10
8620 && IDENTIFIER_POINTER (declarator)[0] == '_'
8621 && IDENTIFIER_POINTER (declarator)[1] == '_'
8622 && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8623 && current_lang_name == lang_name_cplusplus
8624 && ctype == NULL_TREE
8625 /* NULL_TREE means global namespace. */
8626 && DECL_CONTEXT (decl) == NULL_TREE)
8627 DECL_LANGUAGE (decl) = lang_c;
8629 /* Should probably propagate const out from type to decl I bet (mrs). */
8632 DECL_STATIC_FUNCTION_P (decl) = 1;
8633 DECL_CONTEXT (decl) = ctype;
8637 DECL_CONTEXT (decl) = ctype;
8639 if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8641 if (processing_template_decl)
8642 error ("cannot declare `::main' to be a template");
8644 error ("cannot declare `::main' to be inline");
8646 error ("cannot declare `::main' to be static");
8651 /* Members of anonymous types and local classes have no linkage; make
8653 if (ctype && (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype))
8654 || decl_function_context (TYPE_MAIN_DECL (ctype))))
8659 /* [basic.link]: A name with no linkage (notably, the name of a class
8660 or enumeration declared in a local scope) shall not be used to
8661 declare an entity with linkage.
8663 Only check this for public decls for now. */
8664 t = no_linkage_check (TREE_TYPE (decl));
8667 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8669 if (DECL_LANGUAGE (decl) == lang_c)
8670 /* Allow this; it's pretty common in C. */;
8672 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8676 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8681 TREE_PUBLIC (decl) = publicp;
8684 DECL_INTERFACE_KNOWN (decl) = 1;
8685 DECL_NOT_REALLY_EXTERN (decl) = 1;
8689 DECL_THIS_INLINE (decl) = DECL_INLINE (decl) = 1;
8691 DECL_EXTERNAL (decl) = 1;
8692 if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
8694 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8695 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
8699 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
8700 grok_op_properties (decl, virtualp, check < 0);
8702 if (ctype && decl_function_context (decl))
8703 DECL_NO_STATIC_CHAIN (decl) = 1;
8705 for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
8706 if (TREE_PURPOSE (t)
8707 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
8709 has_default_arg = 1;
8714 && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
8718 ("defining explicit specialization `%D' in friend declaration",
8722 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8724 /* Something like `template <class T> friend void f<T>()'. */
8725 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8731 /* A friend declaration of the form friend void f<>(). Record
8732 the information in the TEMPLATE_ID_EXPR. */
8733 SET_DECL_IMPLICIT_INSTANTIATION (decl);
8734 DECL_TEMPLATE_INFO (decl)
8735 = tree_cons (TREE_OPERAND (orig_declarator, 0),
8736 TREE_OPERAND (orig_declarator, 1),
8739 if (has_default_arg)
8741 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8748 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8755 if (has_default_arg)
8756 add_defarg_fn (decl);
8758 /* Plain overloading: will not be grok'd by grokclassfn. */
8759 if (! ctype && ! processing_template_decl
8760 && DECL_LANGUAGE (decl) != lang_c
8761 && (! DECL_USE_TEMPLATE (decl) || name_mangling_version < 1))
8762 set_mangled_name_for_decl (decl);
8765 /* Make the init_value nonzero so pushdecl knows this is not
8766 tentative. error_mark_node is replaced later with the BLOCK. */
8767 DECL_INITIAL (decl) = error_mark_node;
8769 if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl))
8770 TREE_NOTHROW (decl) = 1;
8772 /* Caller will do the rest of this. */
8776 if (flags == NO_SPECIAL && ctype && constructor_name (cname) == declarator)
8777 DECL_CONSTRUCTOR_P (decl) = 1;
8779 /* Function gets the ugly name, field gets the nice one. This call
8780 may change the type of the function (because of default
8782 if (ctype != NULL_TREE)
8783 grokclassfn (ctype, decl, flags, quals);
8785 decl = check_explicit_specialization (orig_declarator, decl,
8787 2 * (funcdef_flag != 0) +
8788 4 * (friendp != 0));
8789 if (decl == error_mark_node)
8792 if (ctype != NULL_TREE
8793 && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8798 old_decl = check_classfn (ctype, decl);
8800 if (old_decl && TREE_CODE (old_decl) == TEMPLATE_DECL)
8801 /* Because grokfndecl is always supposed to return a
8802 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8803 here. We depend on our callers to figure out that its
8804 really a template that's being returned. */
8805 old_decl = DECL_TEMPLATE_RESULT (old_decl);
8807 if (old_decl && DECL_STATIC_FUNCTION_P (old_decl)
8808 && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
8810 /* Remove the `this' parm added by grokclassfn.
8811 XXX Isn't this done in start_function, too? */
8812 revert_static_member_fn (decl);
8813 last_function_parms = TREE_CHAIN (last_function_parms);
8815 if (old_decl && DECL_ARTIFICIAL (old_decl))
8816 cp_error ("definition of implicitly-declared `%D'", old_decl);
8820 /* Since we've smashed OLD_DECL to its
8821 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
8822 if (TREE_CODE (decl) == TEMPLATE_DECL)
8823 decl = DECL_TEMPLATE_RESULT (decl);
8825 /* Attempt to merge the declarations. This can fail, in
8826 the case of some illegal specialization declarations. */
8827 if (!duplicate_decls (decl, old_decl))
8828 cp_error ("no `%#D' member function declared in class `%T'",
8834 if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl))
8837 if (ctype == NULL_TREE || check)
8842 DECL_VIRTUAL_P (decl) = 1;
8843 if (DECL_VINDEX (decl) == NULL_TREE)
8844 DECL_VINDEX (decl) = error_mark_node;
8845 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
8852 grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace)
8855 RID_BIT_TYPE *specbits_in;
8861 RID_BIT_TYPE specbits;
8863 specbits = *specbits_in;
8865 if (TREE_CODE (type) == OFFSET_TYPE)
8867 /* If you declare a static member so that it
8868 can be initialized, the code will reach here. */
8869 tree basetype = TYPE_OFFSET_BASETYPE (type);
8870 type = TREE_TYPE (type);
8871 decl = build_lang_decl (VAR_DECL, declarator, type);
8872 DECL_CONTEXT (decl) = basetype;
8873 DECL_ASSEMBLER_NAME (decl) = build_static_name (basetype, declarator);
8880 context = in_namespace;
8881 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits))
8882 context = current_namespace;
8884 context = NULL_TREE;
8886 if (processing_template_decl)
8887 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8888 we can call push_template_decl. */
8889 decl = build_lang_decl (VAR_DECL, declarator, type);
8891 decl = build_decl (VAR_DECL, declarator, type);
8894 set_decl_namespace (decl, context, 0);
8896 context = DECL_CONTEXT (decl);
8897 if (declarator && context && current_lang_name != lang_name_c)
8898 DECL_ASSEMBLER_NAME (decl) = build_static_name (context, declarator);
8902 set_decl_namespace (decl, in_namespace, 0);
8904 if (RIDBIT_SETP (RID_EXTERN, specbits))
8906 DECL_THIS_EXTERN (decl) = 1;
8907 DECL_EXTERNAL (decl) = !initialized;
8910 /* In class context, static means one per class,
8911 public access, and static storage. */
8912 if (DECL_CLASS_SCOPE_P (decl))
8914 TREE_PUBLIC (decl) = 1;
8915 TREE_STATIC (decl) = 1;
8916 DECL_EXTERNAL (decl) = 0;
8918 /* At top level, either `static' or no s.c. makes a definition
8919 (perhaps tentative), and absence of `static' makes it public. */
8920 else if (toplevel_bindings_p ())
8922 TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
8923 && (DECL_THIS_EXTERN (decl) || ! constp));
8924 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
8926 /* Not at top level, only `static' makes a static definition. */
8929 TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
8930 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
8933 if (TREE_PUBLIC (decl))
8935 /* [basic.link]: A name with no linkage (notably, the name of a class
8936 or enumeration declared in a local scope) shall not be used to
8937 declare an entity with linkage.
8939 Only check this for public decls for now. */
8940 tree t = no_linkage_check (TREE_TYPE (decl));
8943 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8944 /* Ignore for now; `enum { foo } e' is pretty common. */;
8946 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8954 /* Create and return a canonical pointer to member function type, for
8955 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8958 build_ptrmemfunc_type (type)
8964 tree unqualified_variant = NULL_TREE;
8966 /* If a canonical type already exists for this type, use it. We use
8967 this method instead of type_hash_canon, because it only does a
8968 simple equality check on the list of field members. */
8970 if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
8973 /* Make sure that we always have the unqualified pointer-to-member
8975 if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
8977 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type));
8979 t = make_aggr_type (RECORD_TYPE);
8980 /* Let the front-end know this is a pointer to member function... */
8981 TYPE_PTRMEMFUNC_FLAG (t) = 1;
8982 /* ... and not really an aggregate. */
8983 SET_IS_AGGR_TYPE (t, 0);
8987 u = make_aggr_type (UNION_TYPE);
8988 SET_IS_AGGR_TYPE (u, 0);
8989 fields[0] = build_lang_decl (FIELD_DECL, pfn_identifier, type);
8990 fields[1] = build_lang_decl (FIELD_DECL, delta2_identifier,
8992 finish_builtin_type (u, "__ptrmemfunc_type", fields, 1, ptr_type_node);
8993 TYPE_NAME (u) = NULL_TREE;
8995 fields[0] = build_lang_decl (FIELD_DECL, delta_identifier,
8997 fields[1] = build_lang_decl (FIELD_DECL, index_identifier,
8999 fields[2] = build_lang_decl (FIELD_DECL, pfn_or_delta2_identifier, u);
9000 finish_builtin_type (t, "__ptrmemfunc_type", fields, 2, ptr_type_node);
9004 fields[0] = build_lang_decl (FIELD_DECL, pfn_identifier, type);
9005 fields[1] = build_lang_decl (FIELD_DECL, delta_identifier,
9007 finish_builtin_type (t, "__ptrmemfunc_type", fields, 1, ptr_type_node);
9010 /* Zap out the name so that the back-end will give us the debugging
9011 information for this anonymous RECORD_TYPE. */
9012 TYPE_NAME (t) = NULL_TREE;
9014 /* If this is not the unqualified form of this pointer-to-member
9015 type, set the TYPE_MAIN_VARIANT for this type to be the
9016 unqualified type. Since they are actually RECORD_TYPEs that are
9017 not variants of each other, we must do this manually. */
9018 if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
9020 t = build_qualified_type (t, CP_TYPE_QUALS (type));
9021 TYPE_MAIN_VARIANT (t) = unqualified_variant;
9022 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant);
9023 TYPE_NEXT_VARIANT (unqualified_variant) = t;
9026 /* Cache this pointer-to-member type so that we can find it again
9028 TYPE_SET_PTRMEMFUNC_TYPE (type, t);
9030 /* Seems to be wanted. */
9031 CLASSTYPE_GOT_SEMICOLON (t) = 1;
9036 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9037 Check to see that the definition is valid. Issue appropriate error
9038 messages. Return 1 if the definition is particularly bad, or 0
9042 check_static_variable_definition (decl, type)
9046 /* Motion 10 at San Diego: If a static const integral data member is
9047 initialized with an integral constant expression, the initializer
9048 may appear either in the declaration (within the class), or in
9049 the definition, but not both. If it appears in the class, the
9050 member is a member constant. The file-scope definition is always
9052 if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
9054 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9056 /* If we just return the declaration, crashes will sometimes
9057 occur. We therefore return void_type_node, as if this was a
9058 friend declaration, to cause callers to completely ignore
9059 this declaration. */
9062 else if (!CP_TYPE_CONST_P (type))
9063 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9065 else if (pedantic && !INTEGRAL_TYPE_P (type))
9066 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
9071 /* Given the SIZE (i.e., number of elements) in an array, compute an
9072 appropriate index type for the array. If non-NULL, NAME is the
9073 name of the thing being declared. */
9076 compute_array_index_type (name, size)
9082 /* The size might be the result of a cast. */
9083 STRIP_TYPE_NOPS (size);
9085 /* It might be a const variable or enumeration constant. */
9086 if (TREE_READONLY_DECL_P (size))
9087 size = decl_constant_value (size);
9089 /* If this involves a template parameter, it will be a constant at
9090 instantiation time, but we don't know what the value is yet.
9091 Even if no template parameters are involved, we may an expression
9092 that is not a constant; we don't even simplify `1 + 2' when
9093 processing a template. */
9094 if (processing_template_decl)
9096 /* Resolve a qualified reference to an enumerator or static
9097 const data member of ours. */
9098 if (TREE_CODE (size) == SCOPE_REF
9099 && TREE_OPERAND (size, 0) == current_class_type)
9101 tree t = lookup_field (current_class_type,
9102 TREE_OPERAND (size, 1), 0, 0);
9107 return build_index_type (build_min (MINUS_EXPR, sizetype,
9108 size, integer_one_node));
9111 /* The array bound must be an integer type. */
9112 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
9113 && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
9114 && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
9117 cp_error ("size of array `%D' has non-integer type", name);
9119 cp_error ("size of array has non-integer type");
9120 size = integer_one_node;
9123 /* Normally, the array-bound will be a constant. */
9124 if (TREE_CONSTANT (size))
9126 /* Check to see if the array bound overflowed. Make that an
9127 error, no matter how generous we're being. */
9128 int old_flag_pedantic_errors = flag_pedantic_errors;
9129 int old_pedantic = pedantic;
9130 pedantic = flag_pedantic_errors = 1;
9131 constant_expression_warning (size);
9132 pedantic = old_pedantic;
9133 flag_pedantic_errors = old_flag_pedantic_errors;
9135 /* An array must have a positive number of elements. */
9136 if (INT_CST_LT (size, integer_zero_node))
9139 cp_error ("size of array `%D' is negative", name);
9141 cp_error ("size of array is negative");
9142 size = integer_one_node;
9144 /* Except that an extension we allow zero-sized arrays. We
9145 always allow them in system headers because glibc uses
9147 else if (integer_zerop (size) && pedantic && !in_system_header)
9150 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name);
9152 cp_pedwarn ("ISO C++ forbids zero-size array");
9156 /* Compute the index of the largest element in the array. It is
9157 one less than the number of elements in the array. */
9159 = fold (build_binary_op (MINUS_EXPR,
9160 cp_convert (ssizetype, size),
9161 cp_convert (ssizetype,
9162 integer_one_node)));
9164 /* Check for variable-sized arrays. We allow such things as an
9165 extension, even though they are not allowed in ANSI/ISO C++. */
9166 if (!TREE_CONSTANT (itype))
9171 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9174 cp_pedwarn ("ISO C++ forbids variable-size array");
9177 /* Create a variable-sized array index type. */
9178 itype = variable_size (itype);
9180 /* Make sure that there was no overflow when creating to a signed
9181 index type. (For example, on a 32-bit machine, an array with
9182 size 2^32 - 1 is too big.) */
9183 else if (TREE_OVERFLOW (itype))
9185 error ("overflow in array dimension");
9186 TREE_OVERFLOW (itype) = 0;
9189 /* Create and return the appropriate index type. */
9190 return build_index_type (itype);
9193 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9194 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9198 create_array_type_for_decl (name, type, size)
9203 tree itype = NULL_TREE;
9204 const char* error_msg;
9206 /* If things have already gone awry, bail now. */
9207 if (type == error_mark_node || size == error_mark_node)
9208 return error_mark_node;
9210 /* Assume that everything will go OK. */
9213 /* There are some types which cannot be array elements. */
9214 switch (TREE_CODE (type))
9217 error_msg = "array of void";
9221 error_msg = "array of functions";
9224 case REFERENCE_TYPE:
9225 error_msg = "array of references";
9229 error_msg = "array of data members";
9233 error_msg = "array of function members";
9240 /* If something went wrong, issue an error-message and return. */
9244 cp_error ("declaration of `%D' as %s", name, error_msg);
9246 cp_error ("creating %s", error_msg);
9248 return error_mark_node;
9253 The constant expressions that specify the bounds of the arrays
9254 can be omitted only for the first member of the sequence. */
9255 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
9257 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9260 return error_mark_node;
9263 /* Figure out the index type for the array. */
9265 itype = compute_array_index_type (name, size);
9267 return build_cplus_array_type (type, itype);
9270 /* Given declspecs and a declarator,
9271 determine the name and type of the object declared
9272 and construct a ..._DECL node for it.
9273 (In one case we can return a ..._TYPE node instead.
9274 For invalid input we sometimes return 0.)
9276 DECLSPECS is a chain of tree_list nodes whose value fields
9277 are the storage classes and type specifiers.
9279 DECL_CONTEXT says which syntactic context this declaration is in:
9280 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9281 FUNCDEF for a function definition. Like NORMAL but a few different
9282 error messages in each case. Return value may be zero meaning
9283 this definition is too screwy to try to parse.
9284 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9285 handle member functions (which have FIELD context).
9286 Return value may be zero meaning this definition is too screwy to
9288 PARM for a parameter declaration (either within a function prototype
9289 or before a function body). Make a PARM_DECL, or return void_type_node.
9290 CATCHPARM for a parameter declaration before a catch clause.
9291 TYPENAME if for a typename (in a cast or sizeof).
9292 Don't make a DECL node; just return the ..._TYPE node.
9293 FIELD for a struct or union field; make a FIELD_DECL.
9294 BITFIELD for a field with specified width.
9295 INITIALIZED is 1 if the decl has an initializer.
9297 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9298 normal attributes in TREE_PURPOSE, or NULL_TREE.
9300 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9301 It may also be so in the PARM case, for a prototype where the
9302 argument type is specified but not the name.
9304 This function is where the complicated C meanings of `static'
9305 and `extern' are interpreted.
9307 For C++, if there is any monkey business to do, the function which
9308 calls this one must do it, i.e., prepending instance variables,
9309 renaming overloaded function names, etc.
9311 Note that for this C++, it is an error to define a method within a class
9312 which does not belong to that class.
9314 Except in the case where SCOPE_REFs are implicitly known (such as
9315 methods within a class being redundantly qualified),
9316 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9317 (class_name::decl_name). The caller must also deal with this.
9319 If a constructor or destructor is seen, and the context is FIELD,
9320 then the type gains the attribute TREE_HAS_x. If such a declaration
9321 is erroneous, NULL_TREE is returned.
9323 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9324 function, these are the qualifiers to give to the `this' pointer. We
9325 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9327 May return void_type_node if the declarator turned out to be a friend.
9328 See grokfield for details. */
9330 enum return_types { return_normal, return_ctor, return_dtor, return_conversion };
9333 grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist)
9336 enum decl_context decl_context;
9340 RID_BIT_TYPE specbits;
9343 tree type = NULL_TREE;
9349 int virtualp, explicitp, friendp, inlinep, staticp;
9350 int explicit_int = 0;
9351 int explicit_char = 0;
9352 int defaulted_int = 0;
9353 tree typedef_decl = NULL_TREE;
9355 tree typedef_type = NULL_TREE;
9356 int funcdef_flag = 0;
9357 enum tree_code innermost_code = ERROR_MARK;
9360 /* See the code below that used this. */
9361 tree decl_machine_attr = NULL_TREE;
9363 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9364 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9365 tree init = NULL_TREE;
9367 /* Keep track of what sort of function is being processed
9368 so that we can warn about default return values, or explicit
9369 return values which do not match prescribed defaults. */
9370 enum return_types return_type = return_normal;
9372 tree dname = NULL_TREE;
9373 tree ctype = current_class_type;
9374 tree ctor_return_type = NULL_TREE;
9375 enum overload_flags flags = NO_SPECIAL;
9376 tree quals = NULL_TREE;
9377 tree raises = NULL_TREE;
9378 int template_count = 0;
9379 tree in_namespace = NULL_TREE;
9383 RIDBIT_RESET_ALL (specbits);
9384 if (decl_context == FUNCDEF)
9385 funcdef_flag = 1, decl_context = NORMAL;
9386 else if (decl_context == MEMFUNCDEF)
9387 funcdef_flag = -1, decl_context = FIELD;
9388 else if (decl_context == BITFIELD)
9389 bitfield = 1, decl_context = FIELD;
9391 /* Look inside a declarator for the name being declared
9392 and get it as a string, for an error message. */
9394 tree *next = &declarator;
9398 while (next && *next)
9401 switch (TREE_CODE (decl))
9404 /* For attributes. */
9405 next = &TREE_VALUE (decl);
9410 next = &TREE_OPERAND (decl, 0);
9413 case BIT_NOT_EXPR: /* For C++ destructors! */
9415 tree name = TREE_OPERAND (decl, 0);
9416 tree rename = NULL_TREE;
9418 my_friendly_assert (flags == NO_SPECIAL, 152);
9420 return_type = return_dtor;
9421 if (TREE_CODE (name) == TYPE_DECL)
9422 TREE_OPERAND (decl, 0) = name = constructor_name (name);
9423 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
9424 if (ctype == NULL_TREE)
9426 if (current_class_type == NULL_TREE)
9428 error ("destructors must be member functions");
9433 tree t = constructor_name (current_class_name);
9440 tree t = constructor_name (ctype);
9447 cp_error ("destructor `%T' must match class name `%T'",
9449 TREE_OPERAND (decl, 0) = rename;
9455 case ADDR_EXPR: /* C++ reference declaration */
9460 innermost_code = TREE_CODE (decl);
9461 next = &TREE_OPERAND (decl, 0);
9465 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl)))
9467 /* This is actually a variable declaration using
9468 constructor syntax. We need to call start_decl and
9469 cp_finish_decl so we can get the variable
9472 tree attributes, prefix_attributes;
9474 *next = TREE_OPERAND (decl, 0);
9475 init = CALL_DECLARATOR_PARMS (decl);
9479 attributes = TREE_PURPOSE (attrlist);
9480 prefix_attributes = TREE_VALUE (attrlist);
9484 attributes = NULL_TREE;
9485 prefix_attributes = NULL_TREE;
9488 decl = start_decl (declarator, declspecs, 1,
9489 attributes, prefix_attributes);
9490 decl_type_access_control (decl);
9493 /* Look for __unused__ attribute */
9494 if (TREE_USED (TREE_TYPE (decl)))
9495 TREE_USED (decl) = 1;
9496 finish_decl (decl, init, NULL_TREE);
9499 cp_error ("invalid declarator");
9502 innermost_code = TREE_CODE (decl);
9503 if (decl_context == FIELD && ctype == NULL_TREE)
9504 ctype = current_class_type;
9506 && TREE_OPERAND (decl, 0)
9507 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
9508 && ((DECL_NAME (TREE_OPERAND (decl, 0))
9509 == constructor_name_full (ctype))
9510 || (DECL_NAME (TREE_OPERAND (decl, 0))
9511 == constructor_name (ctype)))))
9512 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9513 next = &TREE_OPERAND (decl, 0);
9515 if (ctype != NULL_TREE
9516 && decl != NULL_TREE && flags != DTOR_FLAG
9517 && decl == constructor_name (ctype))
9519 return_type = return_ctor;
9520 ctor_return_type = ctype;
9525 case TEMPLATE_ID_EXPR:
9527 tree fns = TREE_OPERAND (decl, 0);
9529 if (TREE_CODE (fns) == LOOKUP_EXPR)
9530 fns = TREE_OPERAND (fns, 0);
9533 if (TREE_CODE (dname) == COMPONENT_REF)
9534 dname = TREE_OPERAND (dname, 1);
9535 if (TREE_CODE (dname) != IDENTIFIER_NODE)
9537 my_friendly_assert (is_overloaded_fn (dname),
9539 dname = DECL_NAME (get_first_fn (dname));
9544 case IDENTIFIER_NODE:
9545 if (TREE_CODE (decl) == IDENTIFIER_NODE)
9552 cp_error ("declarator-id missing; using reserved word `%D'",
9554 name = IDENTIFIER_POINTER (dname);
9556 if (! IDENTIFIER_OPNAME_P (dname)
9557 /* GNU/Linux headers use '__op'. Arrgh. */
9558 || (IDENTIFIER_TYPENAME_P (dname) && ! TREE_TYPE (dname)))
9559 name = IDENTIFIER_POINTER (dname);
9562 if (IDENTIFIER_TYPENAME_P (dname))
9564 my_friendly_assert (flags == NO_SPECIAL, 154);
9565 flags = TYPENAME_FLAG;
9566 ctor_return_type = TREE_TYPE (dname);
9567 return_type = return_conversion;
9569 name = operator_name_string (dname);
9576 /* Perform error checking, and decide on a ctype. */
9577 tree cname = TREE_OPERAND (decl, 0);
9578 if (cname == NULL_TREE)
9580 else if (TREE_CODE (cname) == NAMESPACE_DECL)
9583 in_namespace = TREE_OPERAND (decl, 0);
9584 TREE_OPERAND (decl, 0) = NULL_TREE;
9586 else if (! is_aggr_type (cname, 1))
9587 TREE_OPERAND (decl, 0) = NULL_TREE;
9588 /* Must test TREE_OPERAND (decl, 1), in case user gives
9589 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9590 else if (TREE_OPERAND (decl, 1)
9591 && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9593 else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9594 || TREE_CODE (cname) == TEMPLATE_TEMPLATE_PARM)
9596 cp_error ("`%T::%D' is not a valid declarator", cname,
9597 TREE_OPERAND (decl, 1));
9598 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9599 cname, TREE_OPERAND (decl, 1));
9600 return void_type_node;
9602 else if (ctype == NULL_TREE)
9604 else if (TREE_COMPLEXITY (decl) == current_class_depth)
9605 TREE_OPERAND (decl, 0) = ctype;
9608 if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9610 cp_error ("type `%T' is not derived from type `%T'",
9612 TREE_OPERAND (decl, 0) = NULL_TREE;
9618 if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
9619 && ((DECL_NAME (TREE_OPERAND (decl, 1))
9620 == constructor_name_full (ctype))
9621 || (DECL_NAME (TREE_OPERAND (decl, 1))
9622 == constructor_name (ctype))))
9623 TREE_OPERAND (decl, 1) = constructor_name (ctype);
9624 next = &TREE_OPERAND (decl, 1);
9628 if (TREE_CODE (decl) == IDENTIFIER_NODE
9629 && constructor_name (ctype) == decl)
9631 return_type = return_ctor;
9632 ctor_return_type = ctype;
9634 else if (TREE_CODE (decl) == BIT_NOT_EXPR
9635 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
9636 && (constructor_name (ctype) == TREE_OPERAND (decl, 0)
9637 || constructor_name_full (ctype) == TREE_OPERAND (decl, 0)))
9639 return_type = return_dtor;
9640 ctor_return_type = ctype;
9642 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9643 next = &TREE_OPERAND (decl, 0);
9654 /* Parse error puts this typespec where
9655 a declarator should go. */
9656 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl));
9657 if (TREE_TYPE (decl) == current_class_type)
9658 cp_error (" perhaps you want `%T' for a constructor",
9659 current_class_name);
9660 dname = DECL_NAME (decl);
9661 name = IDENTIFIER_POINTER (dname);
9663 /* Avoid giving two errors for this. */
9664 IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
9666 declspecs = tree_cons (NULL_TREE, integer_type_node, declspecs);
9672 cp_compiler_error ("`%D' as declarator", decl);
9673 return 0; /* We used to do a 155 abort here. */
9678 /* A function definition's declarator must have the form of
9679 a function declarator. */
9681 if (funcdef_flag && innermost_code != CALL_EXPR)
9684 if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
9685 && innermost_code != CALL_EXPR
9686 && ! (ctype && declspecs == NULL_TREE))
9688 cp_error ("declaration of `%D' as non-function", dname);
9689 return void_type_node;
9692 /* Anything declared one level down from the top level
9693 must be one of the parameters of a function
9694 (because the body is at least two levels down). */
9696 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9697 by not allowing C++ class definitions to specify their parameters
9698 with xdecls (must be spec.d in the parmlist).
9700 Since we now wait to push a class scope until we are sure that
9701 we are in a legitimate method context, we must set oldcname
9702 explicitly (since current_class_name is not yet alive).
9704 We also want to avoid calling this a PARM if it is in a namespace. */
9706 if (decl_context == NORMAL && !toplevel_bindings_p ())
9708 struct binding_level *b = current_binding_level;
9709 current_binding_level = b->level_chain;
9710 if (current_binding_level != 0 && toplevel_bindings_p ())
9711 decl_context = PARM;
9712 current_binding_level = b;
9716 name = decl_context == PARM ? "parameter" : "type name";
9718 /* Look through the decl specs and record which ones appear.
9719 Some typespecs are defined as built-in typenames.
9720 Others, the ones that are modifiers of other types,
9721 are represented by bits in SPECBITS: set the bits for
9722 the modifiers that appear. Storage class keywords are also in SPECBITS.
9724 If there is a typedef name or a type, store the type in TYPE.
9725 This includes builtin typedefs such as `int'.
9727 Set EXPLICIT_INT if the type is `int' or `char' and did not
9728 come from a user typedef.
9730 Set LONGLONG if `long' is mentioned twice.
9732 For C++, constructors and destructors have their own fast treatment. */
9734 for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
9739 /* Certain parse errors slip through. For example,
9740 `int class;' is not caught by the parser. Try
9741 weakly to recover here. */
9742 if (TREE_CODE (spec) != TREE_LIST)
9745 id = TREE_VALUE (spec);
9747 if (TREE_CODE (id) == IDENTIFIER_NODE)
9749 if (id == ridpointers[(int) RID_INT]
9750 || id == ridpointers[(int) RID_CHAR]
9751 || id == ridpointers[(int) RID_BOOL]
9752 || id == ridpointers[(int) RID_WCHAR])
9756 if (id == ridpointers[(int) RID_BOOL])
9757 error ("`bool' is now a keyword");
9759 cp_error ("extraneous `%T' ignored", id);
9763 if (id == ridpointers[(int) RID_INT])
9765 else if (id == ridpointers[(int) RID_CHAR])
9767 type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
9771 /* C++ aggregate types. */
9772 if (IDENTIFIER_HAS_TYPE_VALUE (id))
9775 cp_error ("multiple declarations `%T' and `%T'", type, id);
9777 type = IDENTIFIER_TYPE_VALUE (id);
9781 for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
9783 if (ridpointers[i] == id)
9785 if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
9787 if (pedantic && ! in_system_header && warn_long_long)
9788 pedwarn ("ISO C++ does not support `long long'");
9790 error ("`long long long' is too long for GCC");
9794 else if (RIDBIT_SETP (i, specbits))
9795 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
9796 RIDBIT_SET (i, specbits);
9801 /* C++ aggregate types. */
9802 else if (TREE_CODE (id) == TYPE_DECL || TREE_CODE (id) == TEMPLATE_DECL)
9805 cp_error ("multiple declarations `%T' and `%T'", type,
9809 type = TREE_TYPE (id);
9810 TREE_VALUE (spec) = type;
9815 error ("two or more data types in declaration of `%s'", name);
9816 else if (TREE_CODE (id) == IDENTIFIER_NODE)
9818 register tree t = lookup_name (id, 1);
9819 if (!t || TREE_CODE (t) != TYPE_DECL)
9820 error ("`%s' fails to be a typedef or built in type",
9821 IDENTIFIER_POINTER (id));
9824 type = TREE_TYPE (t);
9826 /* See the code below that used this. */
9827 decl_machine_attr = DECL_MACHINE_ATTRIBUTES (id);
9832 else if (id != error_mark_node)
9833 /* Can't change CLASS nodes into RECORD nodes here! */
9839 typedef_type = type;
9841 /* No type at all: default to `int', and set DEFAULTED_INT
9842 because it was not a user-defined typedef. */
9844 if (type == NULL_TREE
9845 && (RIDBIT_SETP (RID_SIGNED, specbits)
9846 || RIDBIT_SETP (RID_UNSIGNED, specbits)
9847 || RIDBIT_SETP (RID_LONG, specbits)
9848 || RIDBIT_SETP (RID_SHORT, specbits)))
9850 /* These imply 'int'. */
9851 type = integer_type_node;
9855 if (type == NULL_TREE)
9858 if (return_type == return_dtor)
9859 type = void_type_node;
9860 else if (return_type == return_ctor)
9861 type = build_pointer_type (ctor_return_type);
9862 else if (return_type == return_conversion)
9863 type = ctor_return_type;
9866 /* We handle `main' specially here, because 'main () { }' is so
9867 common. With no options, it is allowed. With -Wreturn-type,
9868 it is a warning. It is only an error with -pedantic-errors. */
9869 int is_main = (funcdef_flag
9870 && MAIN_NAME_P (dname)
9871 && ctype == NULL_TREE
9872 && in_namespace == NULL_TREE
9873 && current_namespace == global_namespace);
9875 if (in_system_header || flag_ms_extensions)
9876 /* Allow it, sigh. */;
9877 else if (pedantic || ! is_main)
9878 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
9880 else if (warn_return_type)
9881 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
9884 type = integer_type_node;
9887 else if (return_type == return_dtor)
9889 error ("return type specification for destructor invalid");
9890 type = void_type_node;
9892 else if (return_type == return_ctor)
9894 error ("return type specification for constructor invalid");
9895 type = build_pointer_type (ctor_return_type);
9897 else if (return_type == return_conversion)
9899 if (!same_type_p (type, ctor_return_type))
9900 cp_error ("operator `%T' declared to return `%T'",
9901 ctor_return_type, type);
9903 cp_pedwarn ("return type specified for `operator %T'",
9906 type = ctor_return_type;
9911 /* Now process the modifiers that were specified
9912 and check for invalid combinations. */
9914 /* Long double is a special combination. */
9916 if (RIDBIT_SETP (RID_LONG, specbits)
9917 && TYPE_MAIN_VARIANT (type) == double_type_node)
9919 RIDBIT_RESET (RID_LONG, specbits);
9920 type = build_qualified_type (long_double_type_node,
9921 CP_TYPE_QUALS (type));
9924 /* Check all other uses of type modifiers. */
9926 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9927 || RIDBIT_SETP (RID_SIGNED, specbits)
9928 || RIDBIT_SETP (RID_LONG, specbits)
9929 || RIDBIT_SETP (RID_SHORT, specbits))
9933 if (TREE_CODE (type) == REAL_TYPE)
9934 error ("short, signed or unsigned invalid for `%s'", name);
9935 else if (TREE_CODE (type) != INTEGER_TYPE)
9936 error ("long, short, signed or unsigned invalid for `%s'", name);
9937 else if (RIDBIT_SETP (RID_LONG, specbits)
9938 && RIDBIT_SETP (RID_SHORT, specbits))
9939 error ("long and short specified together for `%s'", name);
9940 else if ((RIDBIT_SETP (RID_LONG, specbits)
9941 || RIDBIT_SETP (RID_SHORT, specbits))
9943 error ("long or short specified with char for `%s'", name);
9944 else if ((RIDBIT_SETP (RID_LONG, specbits)
9945 || RIDBIT_SETP (RID_SHORT, specbits))
9946 && TREE_CODE (type) == REAL_TYPE)
9947 error ("long or short specified with floating type for `%s'", name);
9948 else if (RIDBIT_SETP (RID_SIGNED, specbits)
9949 && RIDBIT_SETP (RID_UNSIGNED, specbits))
9950 error ("signed and unsigned given together for `%s'", name);
9954 if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
9956 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9958 if (flag_pedantic_errors)
9963 /* Discard the type modifiers if they are invalid. */
9966 RIDBIT_RESET (RID_UNSIGNED, specbits);
9967 RIDBIT_RESET (RID_SIGNED, specbits);
9968 RIDBIT_RESET (RID_LONG, specbits);
9969 RIDBIT_RESET (RID_SHORT, specbits);
9974 if (RIDBIT_SETP (RID_COMPLEX, specbits)
9975 && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
9977 error ("complex invalid for `%s'", name);
9978 RIDBIT_RESET (RID_COMPLEX, specbits);
9981 /* Decide whether an integer type is signed or not.
9982 Optionally treat bitfields as signed by default. */
9983 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
9986 It is implementation-defined whether a plain (neither
9987 explicitly signed or unsigned) char, short, int, or long
9988 bit-field is signed or unsigned.
9990 Naturally, we extend this to long long as well. Note that
9991 this does not include wchar_t. */
9992 || (bitfield && !flag_signed_bitfields
9993 && RIDBIT_NOTSETP (RID_SIGNED, specbits)
9994 /* A typedef for plain `int' without `signed' can be
9995 controlled just like plain `int', but a typedef for
9996 `signed int' cannot be so controlled. */
9998 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))
9999 && (TREE_CODE (type) == INTEGER_TYPE
10000 || TREE_CODE (type) == CHAR_TYPE)
10001 && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node)))
10004 type = long_long_unsigned_type_node;
10005 else if (RIDBIT_SETP (RID_LONG, specbits))
10006 type = long_unsigned_type_node;
10007 else if (RIDBIT_SETP (RID_SHORT, specbits))
10008 type = short_unsigned_type_node;
10009 else if (type == char_type_node)
10010 type = unsigned_char_type_node;
10011 else if (typedef_decl)
10012 type = unsigned_type (type);
10014 type = unsigned_type_node;
10016 else if (RIDBIT_SETP (RID_SIGNED, specbits)
10017 && type == char_type_node)
10018 type = signed_char_type_node;
10020 type = long_long_integer_type_node;
10021 else if (RIDBIT_SETP (RID_LONG, specbits))
10022 type = long_integer_type_node;
10023 else if (RIDBIT_SETP (RID_SHORT, specbits))
10024 type = short_integer_type_node;
10026 if (RIDBIT_SETP (RID_COMPLEX, specbits))
10028 /* If we just have "complex", it is equivalent to
10029 "complex double", but if any modifiers at all are specified it is
10030 the complex form of TYPE. E.g, "complex short" is
10031 "complex short int". */
10033 if (defaulted_int && ! longlong
10034 && ! (RIDBIT_SETP (RID_LONG, specbits)
10035 || RIDBIT_SETP (RID_SHORT, specbits)
10036 || RIDBIT_SETP (RID_SIGNED, specbits)
10037 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
10038 type = complex_double_type_node;
10039 else if (type == integer_type_node)
10040 type = complex_integer_type_node;
10041 else if (type == float_type_node)
10042 type = complex_float_type_node;
10043 else if (type == double_type_node)
10044 type = complex_double_type_node;
10045 else if (type == long_double_type_node)
10046 type = complex_long_double_type_node;
10048 type = build_complex_type (type);
10051 if (return_type == return_conversion
10052 && (RIDBIT_SETP (RID_CONST, specbits)
10053 || RIDBIT_SETP (RID_VOLATILE, specbits)
10054 || RIDBIT_SETP (RID_RESTRICT, specbits)))
10055 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10058 /* Set CONSTP if this declaration is `const', whether by
10059 explicit specification or via a typedef.
10060 Likewise for VOLATILEP. */
10062 constp = !! RIDBIT_SETP (RID_CONST, specbits) + CP_TYPE_CONST_P (type);
10064 !! RIDBIT_SETP (RID_RESTRICT, specbits) + CP_TYPE_RESTRICT_P (type);
10066 !! RIDBIT_SETP (RID_VOLATILE, specbits) + CP_TYPE_VOLATILE_P (type);
10067 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10068 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10069 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10070 type = cp_build_qualified_type (type, type_quals);
10072 inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
10073 virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
10074 RIDBIT_RESET (RID_VIRTUAL, specbits);
10075 explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
10076 RIDBIT_RESET (RID_EXPLICIT, specbits);
10078 if (RIDBIT_SETP (RID_STATIC, specbits))
10079 staticp = 1 + (decl_context == FIELD);
10081 if (virtualp && staticp == 2)
10083 cp_error ("member `%D' cannot be declared both virtual and static",
10087 friendp = RIDBIT_SETP (RID_FRIEND, specbits);
10088 RIDBIT_RESET (RID_FRIEND, specbits);
10090 /* Warn if two storage classes are given. Default to `auto'. */
10092 if (RIDBIT_ANY_SET (specbits))
10094 if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
10095 if (RIDBIT_SETP (RID_EXTERN, specbits)) nclasses++;
10096 if (decl_context == PARM && nclasses > 0)
10097 error ("storage class specifiers invalid in parameter declarations");
10098 if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10100 if (decl_context == PARM)
10101 error ("typedef declaration invalid in parameter declaration");
10104 if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
10105 if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
10108 /* Give error if `virtual' is used outside of class declaration. */
10110 && (current_class_name == NULL_TREE || decl_context != FIELD))
10112 error ("virtual outside class declaration");
10116 /* Static anonymous unions are dealt with here. */
10117 if (staticp && decl_context == TYPENAME
10118 && TREE_CODE (declspecs) == TREE_LIST
10119 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs)))
10120 decl_context = FIELD;
10122 /* Warn about storage classes that are invalid for certain
10123 kinds of declarations (parameters, typenames, etc.). */
10126 error ("multiple storage classes in declaration of `%s'", name);
10127 else if (decl_context != NORMAL && nclasses > 0)
10129 if ((decl_context == PARM || decl_context == CATCHPARM)
10130 && (RIDBIT_SETP (RID_REGISTER, specbits)
10131 || RIDBIT_SETP (RID_AUTO, specbits)))
10133 else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10135 else if (decl_context == FIELD
10136 /* C++ allows static class elements */
10137 && RIDBIT_SETP (RID_STATIC, specbits))
10138 /* C++ also allows inlines and signed and unsigned elements,
10139 but in those cases we don't come in here. */
10143 if (decl_context == FIELD)
10145 tree tmp = NULL_TREE;
10146 register int op = 0;
10150 /* Avoid trying to get an operand off an identifier node. */
10151 if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10154 tmp = TREE_OPERAND (declarator, 0);
10155 op = IDENTIFIER_OPNAME_P (tmp);
10157 error ("storage class specified for %s `%s'",
10158 op ? "member operator" : "field",
10159 op ? operator_name_string (tmp) : name);
10163 if (decl_context == PARM || decl_context == CATCHPARM)
10164 error ("storage class specified for parameter `%s'", name);
10166 error ("storage class specified for typename");
10168 RIDBIT_RESET (RID_REGISTER, specbits);
10169 RIDBIT_RESET (RID_AUTO, specbits);
10170 RIDBIT_RESET (RID_EXTERN, specbits);
10173 else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
10175 if (toplevel_bindings_p ())
10177 /* It's common practice (and completely valid) to have a const
10178 be initialized and declared extern. */
10179 if (!(type_quals & TYPE_QUAL_CONST))
10180 warning ("`%s' initialized and declared `extern'", name);
10183 error ("`%s' has both `extern' and initializer", name);
10185 else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
10186 && ! toplevel_bindings_p ())
10187 error ("nested function `%s' declared `extern'", name);
10188 else if (toplevel_bindings_p ())
10190 if (RIDBIT_SETP (RID_AUTO, specbits))
10191 error ("top-level declaration of `%s' specifies `auto'", name);
10194 if (nclasses > 0 && friendp)
10195 error ("storage class specifiers invalid in friend function declarations");
10197 /* Now figure out the structure of the declarator proper.
10198 Descend through it, creating more complex types, until we reach
10199 the declared identifier (or NULL_TREE, in an absolute declarator). */
10201 inner_attrs = NULL_TREE;
10204 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
10205 && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
10207 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10208 an INDIRECT_REF (for *...),
10209 a CALL_EXPR (for ...(...)),
10210 an identifier (for the name being declared)
10211 or a null pointer (for the place in an absolute declarator
10212 where the name was omitted).
10213 For the last two cases, we have just exited the loop.
10215 For C++ it could also be
10216 a SCOPE_REF (for class :: ...). In this case, we have converted
10217 sensible names to types, and those are the values we use to
10218 qualify the member name.
10219 an ADDR_EXPR (for &...),
10220 a BIT_NOT_EXPR (for destructors)
10222 At this point, TYPE is the type of elements of an array,
10223 or for a function to return, or for a pointer to point to.
10224 After this sequence of ifs, TYPE is the type of the
10225 array or function or pointer, and DECLARATOR has had its
10226 outermost layer removed. */
10228 if (type == error_mark_node)
10230 if (TREE_CODE (declarator) == SCOPE_REF)
10231 declarator = TREE_OPERAND (declarator, 1);
10233 declarator = TREE_OPERAND (declarator, 0);
10236 if (quals != NULL_TREE
10237 && (declarator == NULL_TREE
10238 || TREE_CODE (declarator) != SCOPE_REF))
10240 if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
10241 ctype = TYPE_METHOD_BASETYPE (type);
10242 if (ctype != NULL_TREE)
10244 tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
10245 grok_method_quals (ctype, dummy, quals);
10246 type = TREE_TYPE (dummy);
10247 ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
10252 /* See the comment for the TREE_LIST case, below. */
10255 else if (inner_attrs)
10257 decl_attributes (type, inner_attrs, NULL_TREE);
10258 inner_attrs = NULL_TREE;
10261 switch (TREE_CODE (declarator))
10265 /* We encode a declarator with embedded attributes using
10266 a TREE_LIST. The attributes apply to the declarator
10267 directly inside them, so we have to skip an iteration
10268 before applying them to the type. If the declarator just
10269 inside is the declarator-id, we apply the attrs to the
10271 inner_attrs = TREE_PURPOSE (declarator);
10273 declarator = TREE_VALUE (declarator);
10279 register tree size;
10281 size = TREE_OPERAND (declarator, 1);
10283 /* VC++ spells a zero-sized array with []. */
10284 if (size == NULL_TREE && decl_context == FIELD && ! staticp
10285 && ! RIDBIT_SETP (RID_TYPEDEF, specbits))
10286 size = integer_zero_node;
10288 declarator = TREE_OPERAND (declarator, 0);
10290 type = create_array_type_for_decl (dname, type, size);
10299 tree inner_parms = CALL_DECLARATOR_PARMS (declarator);
10300 tree inner_decl = TREE_OPERAND (declarator, 0);
10302 /* Declaring a function type.
10303 Make sure we have a valid type for the function to return. */
10305 /* We now know that the TYPE_QUALS don't apply to the
10306 decl, but to its return type. */
10307 type_quals = TYPE_UNQUALIFIED;
10309 /* Warn about some types functions can't return. */
10311 if (TREE_CODE (type) == FUNCTION_TYPE)
10313 error ("`%s' declared as function returning a function", name);
10314 type = integer_type_node;
10316 if (TREE_CODE (type) == ARRAY_TYPE)
10318 error ("`%s' declared as function returning an array", name);
10319 type = integer_type_node;
10322 if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
10323 inner_decl = TREE_OPERAND (inner_decl, 1);
10325 if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
10326 inner_decl = dname;
10328 /* Pick up type qualifiers which should be applied to `this'. */
10329 quals = CALL_DECLARATOR_QUALS (declarator);
10331 /* Pick up the exception specifications. */
10332 raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator);
10334 /* Say it's a definition only for the CALL_EXPR
10335 closest to the identifier. */
10338 && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
10339 || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
10340 || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
10342 if (ctype == NULL_TREE
10343 && decl_context == FIELD
10345 && (friendp == 0 || dname == current_class_name))
10346 ctype = current_class_type;
10348 if (ctype && return_type == return_conversion)
10349 TYPE_HAS_CONVERSION (ctype) = 1;
10350 if (ctype && constructor_name (ctype) == dname)
10352 /* We are within a class's scope. If our declarator name
10353 is the same as the class name, and we are defining
10354 a function, then it is a constructor/destructor, and
10355 therefore returns a void type. */
10357 if (flags == DTOR_FLAG)
10359 /* ISO C++ 12.4/2. A destructor may not be
10360 declared const or volatile. A destructor may
10363 error ("destructor cannot be static member function");
10366 cp_error ("destructors may not be `%s'",
10367 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10370 if (decl_context == FIELD)
10372 if (! member_function_or_else (ctype,
10373 current_class_type,
10375 return void_type_node;
10378 else /* It's a constructor. */
10380 if (explicitp == 1)
10382 /* ISO C++ 12.1. A constructor may not be
10383 declared const or volatile. A constructor may
10384 not be virtual. A constructor may not be
10387 error ("constructor cannot be static member function");
10390 pedwarn ("constructors cannot be declared virtual");
10395 cp_error ("constructors may not be `%s'",
10396 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10400 RID_BIT_TYPE tmp_bits;
10401 bcopy ((void*)&specbits, (void*)&tmp_bits, sizeof (RID_BIT_TYPE));
10402 RIDBIT_RESET (RID_INLINE, tmp_bits);
10403 RIDBIT_RESET (RID_STATIC, tmp_bits);
10404 if (RIDBIT_ANY_SET (tmp_bits))
10405 error ("return value type specifier for constructor ignored");
10407 type = build_pointer_type (ctype);
10408 if (decl_context == FIELD)
10410 if (! member_function_or_else (ctype,
10411 current_class_type,
10413 return void_type_node;
10414 TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10415 if (return_type != return_ctor)
10419 if (decl_context == FIELD)
10425 error ("can't initialize friend function `%s'", name);
10428 /* Cannot be both friend and virtual. */
10429 error ("virtual functions cannot be friends");
10430 RIDBIT_RESET (RID_FRIEND, specbits);
10433 if (decl_context == NORMAL)
10434 error ("friend declaration not in class definition");
10435 if (current_function_decl && funcdef_flag)
10436 cp_error ("can't define friend function `%s' in a local class definition",
10440 /* Construct the function type and go to the next
10441 inner layer of declarator. */
10443 declarator = TREE_OPERAND (declarator, 0);
10445 /* FIXME: This is where default args should be fully
10448 arg_types = grokparms (inner_parms, funcdecl_p ? funcdef_flag : 0);
10450 if (declarator && flags == DTOR_FLAG)
10452 /* A destructor declared in the body of a class will
10453 be represented as a BIT_NOT_EXPR. But, we just
10454 want the underlying IDENTIFIER. */
10455 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10456 declarator = TREE_OPERAND (declarator, 0);
10458 if (strict_prototype == 0 && arg_types == NULL_TREE)
10459 arg_types = void_list_node;
10460 else if (arg_types == NULL_TREE
10461 || arg_types != void_list_node)
10463 cp_error ("destructors may not have parameters");
10464 arg_types = void_list_node;
10465 last_function_parms = NULL_TREE;
10469 /* ANSI says that `const int foo ();'
10470 does not make the function foo const. */
10471 type = build_function_type (type, arg_types);
10475 for (t = arg_types; t; t = TREE_CHAIN (t))
10476 if (TREE_PURPOSE (t)
10477 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
10479 add_defarg_fn (type);
10488 /* Filter out pointers-to-references and references-to-references.
10489 We can get these if a TYPE_DECL is used. */
10491 if (TREE_CODE (type) == REFERENCE_TYPE)
10493 error ("cannot declare %s to references",
10494 TREE_CODE (declarator) == ADDR_EXPR
10495 ? "references" : "pointers");
10496 declarator = TREE_OPERAND (declarator, 0);
10500 if (TREE_CODE (type) == OFFSET_TYPE
10501 && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE
10502 || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE))
10504 cp_error ("cannot declare pointer to `%#T' member",
10506 type = TREE_TYPE (type);
10509 /* Merge any constancy or volatility into the target type
10510 for the pointer. */
10512 /* We now know that the TYPE_QUALS don't apply to the decl,
10513 but to the target of the pointer. */
10514 type_quals = TYPE_UNQUALIFIED;
10516 if (TREE_CODE (declarator) == ADDR_EXPR)
10518 if (TREE_CODE (type) == VOID_TYPE)
10519 error ("invalid type: `void &'");
10521 type = build_reference_type (type);
10523 else if (TREE_CODE (type) == METHOD_TYPE)
10524 type = build_ptrmemfunc_type (build_pointer_type (type));
10526 type = build_pointer_type (type);
10528 /* Process a list of type modifier keywords (such as
10529 const or volatile) that were given inside the `*' or `&'. */
10531 if (TREE_TYPE (declarator))
10533 register tree typemodlist;
10539 for (typemodlist = TREE_TYPE (declarator); typemodlist;
10540 typemodlist = TREE_CHAIN (typemodlist))
10542 tree qualifier = TREE_VALUE (typemodlist);
10544 if (qualifier == ridpointers[(int) RID_CONST])
10546 else if (qualifier == ridpointers[(int) RID_VOLATILE])
10548 else if (qualifier == ridpointers[(int) RID_RESTRICT])
10553 error ("invalid type modifier within pointer declarator");
10557 pedwarn ("duplicate `const'");
10559 pedwarn ("duplicate `volatile'");
10561 pedwarn ("duplicate `restrict'");
10563 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10564 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10565 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10566 if (TREE_CODE (declarator) == ADDR_EXPR
10567 && (constp || volatilep))
10570 pedwarn ("discarding `const' applied to a reference");
10572 pedwarn ("discarding `volatile' applied to a reference");
10573 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
10575 type = cp_build_qualified_type (type, type_quals);
10577 declarator = TREE_OPERAND (declarator, 0);
10583 /* We have converted type names to NULL_TREE if the
10584 name was bogus, or to a _TYPE node, if not.
10586 The variable CTYPE holds the type we will ultimately
10587 resolve to. The code here just needs to build
10588 up appropriate member types. */
10589 tree sname = TREE_OPERAND (declarator, 1);
10592 /* Destructors can have their visibilities changed as well. */
10593 if (TREE_CODE (sname) == BIT_NOT_EXPR)
10594 sname = TREE_OPERAND (sname, 0);
10596 if (TREE_COMPLEXITY (declarator) == 0)
10597 /* This needs to be here, in case we are called
10598 multiple times. */ ;
10599 else if (TREE_COMPLEXITY (declarator) == -1)
10600 /* Namespace member. */
10601 pop_decl_namespace ();
10602 else if (friendp && (TREE_COMPLEXITY (declarator) < 2))
10603 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10604 else if (! IS_AGGR_TYPE_CODE
10605 (TREE_CODE (TREE_OPERAND (declarator, 0))))
10607 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
10609 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10610 that refer to ctype. They couldn't be resolved earlier
10611 because we hadn't pushed into the class yet.
10612 Example: resolve 'B<T>::type' in
10613 'B<typename B<T>::type> B<T>::f () { }'. */
10614 if (current_template_parms
10615 && uses_template_parms (type)
10616 && uses_template_parms (current_class_type))
10618 tree args = current_template_args ();
10619 type = tsubst (type, args, /*complain=*/1, NULL_TREE);
10622 /* This pop_nested_class corresponds to the
10623 push_nested_class used to push into class scope for
10624 parsing the argument list of a function decl, in
10626 pop_nested_class ();
10627 TREE_COMPLEXITY (declarator) = current_class_depth;
10630 my_friendly_abort (16);
10632 if (TREE_OPERAND (declarator, 0) == NULL_TREE)
10634 /* We had a reference to a global decl, or
10635 perhaps we were given a non-aggregate typedef,
10636 in which case we cleared this out, and should just
10637 keep going as though it wasn't there. */
10638 declarator = sname;
10641 ctype = TREE_OPERAND (declarator, 0);
10644 while (t != NULL_TREE && CLASS_TYPE_P (t))
10646 if (CLASSTYPE_TEMPLATE_INFO (t) &&
10647 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
10648 template_count += 1;
10649 t = TYPE_MAIN_DECL (t);
10650 if (DECL_LANG_SPECIFIC (t))
10651 t = DECL_CONTEXT (t);
10656 if (sname == NULL_TREE)
10659 if (TREE_CODE (sname) == IDENTIFIER_NODE)
10661 /* This is the `standard' use of the scoping operator:
10662 basetype :: member . */
10664 if (ctype == current_class_type)
10670 Is this ill-formed? */
10673 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10676 else if (TREE_CODE (type) == FUNCTION_TYPE)
10678 if (current_class_type == NULL_TREE
10680 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10681 TYPE_ARG_TYPES (type));
10684 cp_error ("cannot declare member function `%T::%s' within `%T'",
10685 ctype, name, current_class_type);
10686 return void_type_node;
10689 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
10690 || TYPE_SIZE (complete_type (ctype)) != NULL_TREE)
10692 /* Have to move this code elsewhere in this function.
10693 this code is used for i.e., typedef int A::M; M *pm;
10695 It is? How? jason 10/2/94 */
10697 if (current_class_type)
10699 cp_error ("cannot declare member `%T::%s' within `%T'",
10700 ctype, name, current_class_type);
10701 return void_type_node;
10703 type = build_offset_type (ctype, type);
10705 else if (uses_template_parms (ctype))
10707 if (TREE_CODE (type) == FUNCTION_TYPE)
10709 = build_cplus_method_type (ctype, TREE_TYPE (type),
10710 TYPE_ARG_TYPES (type));
10714 cp_error ("structure `%T' not yet defined", ctype);
10715 return error_mark_node;
10718 declarator = sname;
10720 else if (TREE_CODE (sname) == SCOPE_REF)
10721 my_friendly_abort (17);
10725 declarator = TREE_OPERAND (declarator, 1);
10726 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
10727 /* In this case, we will deal with it later. */
10731 if (TREE_CODE (type) == FUNCTION_TYPE)
10732 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10733 TYPE_ARG_TYPES (type));
10735 type = build_offset_type (ctype, type);
10742 declarator = TREE_OPERAND (declarator, 0);
10747 case ENUMERAL_TYPE:
10748 declarator = NULL_TREE;
10752 declarator = NULL_TREE;
10756 my_friendly_abort (158);
10760 /* See the comment for the TREE_LIST case, above. */
10763 if (! ignore_attrs)
10764 decl_attributes (type, inner_attrs, NULL_TREE);
10766 TREE_VALUE (attrlist) = chainon (inner_attrs, TREE_VALUE (attrlist));
10768 attrlist = build_decl_list (NULL_TREE, inner_attrs);
10771 /* Now TYPE has the actual type. */
10773 if (explicitp == 1 || (explicitp && friendp))
10775 /* [dcl.fct.spec] The explicit specifier shall only be used in
10776 declarations of constructors within a class definition. */
10777 error ("only declarations of constructors can be `explicit'");
10781 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10783 if (current_class_name == NULL_TREE || decl_context == PARM || friendp)
10785 error ("non-member `%s' cannot be declared `mutable'", name);
10786 RIDBIT_RESET (RID_MUTABLE, specbits);
10788 else if (decl_context == TYPENAME || RIDBIT_SETP (RID_TYPEDEF, specbits))
10790 error ("non-object member `%s' cannot be declared `mutable'", name);
10791 RIDBIT_RESET (RID_MUTABLE, specbits);
10793 else if (TREE_CODE (type) == FUNCTION_TYPE
10794 || TREE_CODE (type) == METHOD_TYPE)
10796 error ("function `%s' cannot be declared `mutable'", name);
10797 RIDBIT_RESET (RID_MUTABLE, specbits);
10801 error ("static `%s' cannot be declared `mutable'", name);
10802 RIDBIT_RESET (RID_MUTABLE, specbits);
10804 else if (type_quals & TYPE_QUAL_CONST)
10806 error ("const `%s' cannot be declared `mutable'", name);
10807 RIDBIT_RESET (RID_MUTABLE, specbits);
10811 if (declarator == NULL_TREE
10812 || TREE_CODE (declarator) == IDENTIFIER_NODE
10813 || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR
10814 && (TREE_CODE (type) == FUNCTION_TYPE
10815 || TREE_CODE (type) == METHOD_TYPE)))
10817 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
10819 cp_error ("template-id `%D' used as a declarator", declarator);
10820 declarator = dname;
10823 /* Unexpected declarator format. */
10824 my_friendly_abort (990210);
10826 /* If this is declaring a typedef name, return a TYPE_DECL. */
10828 if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
10832 /* Note that the grammar rejects storage classes
10833 in typenames, fields or parameters. */
10834 if (current_lang_name == lang_name_java)
10835 TYPE_FOR_JAVA (type) = 1;
10837 if (decl_context == FIELD)
10839 if (declarator == constructor_name (current_class_type))
10840 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
10842 decl = build_lang_decl (TYPE_DECL, declarator, type);
10846 /* Make sure this typedef lives as long as its type,
10847 since it might be used as a template parameter. */
10848 if (processing_template_decl)
10849 decl = build_lang_decl (TYPE_DECL, declarator, type);
10851 decl = build_decl (TYPE_DECL, declarator, type);
10854 /* If the user declares "typedef struct {...} foo" then the
10855 struct will have an anonymous name. Fill that name in now.
10856 Nothing can refer to it, so nothing needs know about the name
10858 if (type != error_mark_node
10859 && TYPE_NAME (type)
10860 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
10861 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type))
10862 && CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED)
10864 tree oldname = TYPE_NAME (type);
10867 /* Replace the anonymous name with the real name everywhere. */
10868 lookup_tag_reverse (type, declarator);
10869 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
10870 if (TYPE_NAME (t) == oldname)
10871 TYPE_NAME (t) = decl;
10873 if (TYPE_LANG_SPECIFIC (type))
10874 TYPE_WAS_ANONYMOUS (type) = 1;
10876 /* If this is a typedef within a template class, the nested
10877 type is a (non-primary) template. The name for the
10878 template needs updating as well. */
10879 if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
10880 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
10881 = TYPE_IDENTIFIER (type);
10883 /* XXX Temporarily set the scope.
10884 When returning, start_decl expects it as NULL_TREE,
10885 and will then then set it using pushdecl. */
10886 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 980404);
10887 if (current_class_type)
10888 DECL_CONTEXT (decl) = current_class_type;
10890 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
10892 DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
10893 DECL_ASSEMBLER_NAME (decl)
10894 = get_identifier (build_overload_name (type, 1, 1));
10895 DECL_CONTEXT (decl) = NULL_TREE;
10897 /* FIXME remangle member functions; member functions of a
10898 type with external linkage have external linkage. */
10901 if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE)
10903 cp_error_at ("typedef name may not be class-qualified", decl);
10908 if (ctype == NULL_TREE)
10910 if (TREE_CODE (type) != METHOD_TYPE)
10911 cp_error_at ("invalid type qualifier for non-member function type", decl);
10913 ctype = TYPE_METHOD_BASETYPE (type);
10915 if (ctype != NULL_TREE)
10916 grok_method_quals (ctype, decl, quals);
10919 if (RIDBIT_SETP (RID_SIGNED, specbits)
10920 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
10921 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
10923 bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
10924 inlinep, friendp, raises != NULL_TREE);
10927 error ("typedef declaration includes an initializer");
10932 /* Detect the case of an array type of unspecified size
10933 which came, as such, direct from a typedef name.
10934 We must copy the type, so that each identifier gets
10935 a distinct type, so that each identifier's size can be
10936 controlled separately by its own initializer. */
10938 if (type == typedef_type && TREE_CODE (type) == ARRAY_TYPE
10939 && TYPE_DOMAIN (type) == NULL_TREE)
10941 type = build_cplus_array_type (TREE_TYPE (type), TYPE_DOMAIN (type));
10944 /* If this is a type name (such as, in a cast or sizeof),
10945 compute the type and return it now. */
10947 if (decl_context == TYPENAME)
10949 /* Note that the grammar rejects storage classes
10950 in typenames, fields or parameters. */
10951 if (type_quals != TYPE_UNQUALIFIED)
10952 type_quals = TYPE_UNQUALIFIED;
10954 /* Special case: "friend class foo" looks like a TYPENAME context. */
10957 if (type_quals != TYPE_UNQUALIFIED)
10959 cp_error ("type qualifiers specified for friend class declaration");
10960 type_quals = TYPE_UNQUALIFIED;
10964 cp_error ("`inline' specified for friend class declaration");
10968 /* Only try to do this stuff if we didn't already give up. */
10969 if (type != integer_type_node)
10971 /* A friendly class? */
10972 if (current_class_type)
10973 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
10975 error ("trying to make class `%s' a friend of global scope",
10976 TYPE_NAME_STRING (type));
10977 type = void_type_node;
10982 if (ctype == NULL_TREE)
10984 if (TREE_CODE (type) != METHOD_TYPE)
10985 cp_error ("invalid qualifiers on non-member function type");
10987 ctype = TYPE_METHOD_BASETYPE (type);
10991 tree dummy = build_decl (TYPE_DECL, declarator, type);
10992 grok_method_quals (ctype, dummy, quals);
10993 type = TREE_TYPE (dummy);
10999 else if (declarator == NULL_TREE && decl_context != PARM
11000 && decl_context != CATCHPARM
11001 && TREE_CODE (type) != UNION_TYPE
11004 cp_error ("abstract declarator `%T' used as declaration", type);
11005 declarator = make_anon_name ();
11008 /* `void' at top level (not within pointer)
11009 is allowed only in typedefs or type names.
11010 We don't complain about parms either, but that is because
11011 a better error message can be made later. */
11013 if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
11016 error ("unnamed variable or field declared void");
11017 else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
11019 if (IDENTIFIER_OPNAME_P (declarator))
11020 my_friendly_abort (356);
11022 error ("variable or field `%s' declared void", name);
11025 error ("variable or field declared void");
11026 type = integer_type_node;
11029 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11030 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11032 if (decl_context == PARM || decl_context == CATCHPARM)
11034 if (ctype || in_namespace)
11035 error ("cannot use `::' in parameter declaration");
11037 /* A parameter declared as an array of T is really a pointer to T.
11038 One declared as a function is really a pointer to a function.
11039 One declared as a member is really a pointer to member. */
11041 if (TREE_CODE (type) == ARRAY_TYPE)
11043 /* Transfer const-ness of array into that of type pointed to. */
11044 type = build_pointer_type (TREE_TYPE (type));
11045 type_quals = TYPE_UNQUALIFIED;
11047 else if (TREE_CODE (type) == FUNCTION_TYPE)
11048 type = build_pointer_type (type);
11049 else if (TREE_CODE (type) == OFFSET_TYPE)
11050 type = build_pointer_type (type);
11051 else if (TREE_CODE (type) == VOID_TYPE && declarator)
11053 error ("declaration of `%s' as void", name);
11059 register tree decl;
11061 if (decl_context == PARM)
11063 decl = build_decl (PARM_DECL, declarator, type);
11065 bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
11066 inlinep, friendp, raises != NULL_TREE);
11068 /* Compute the type actually passed in the parmlist,
11069 for the case where there is no prototype.
11070 (For example, shorts and chars are passed as ints.)
11071 When there is a prototype, this is overridden later. */
11073 DECL_ARG_TYPE (decl) = type_promotes_to (type);
11075 else if (decl_context == FIELD)
11077 if (type == error_mark_node)
11079 /* Happens when declaring arrays of sizes which
11080 are error_mark_node, for example. */
11083 else if (in_namespace && !friendp)
11085 /* Something like struct S { int N::j; }; */
11086 cp_error ("invalid use of `::'");
11089 else if (TREE_CODE (type) == FUNCTION_TYPE)
11092 tree function_context;
11094 /* We catch the others as conflicts with the builtin
11096 if (friendp && declarator == ridpointers[(int) RID_SIGNED])
11098 cp_error ("function `%D' cannot be declared friend",
11105 if (ctype == NULL_TREE)
11106 ctype = current_class_type;
11108 if (ctype == NULL_TREE)
11110 cp_error ("can't make `%D' into a method -- not in a class",
11112 return void_type_node;
11115 /* ``A union may [ ... ] not [ have ] virtual functions.''
11117 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
11119 cp_error ("function `%D' declared virtual inside a union",
11121 return void_type_node;
11124 if (declarator == ansi_opname[(int) NEW_EXPR]
11125 || declarator == ansi_opname[(int) VEC_NEW_EXPR]
11126 || declarator == ansi_opname[(int) DELETE_EXPR]
11127 || declarator == ansi_opname[(int) VEC_DELETE_EXPR])
11131 cp_error ("`%D' cannot be declared virtual, since it is always static",
11136 else if (staticp < 2)
11137 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11138 TYPE_ARG_TYPES (type));
11141 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11142 function_context = (ctype != NULL_TREE) ?
11143 decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
11144 publicp = (! friendp || ! staticp)
11145 && function_context == NULL_TREE;
11146 decl = grokfndecl (ctype, type,
11147 TREE_CODE (declarator) != TEMPLATE_ID_EXPR
11148 ? declarator : dname,
11150 virtualp, flags, quals, raises,
11151 friendp ? -1 : 0, friendp, publicp, inlinep,
11152 funcdef_flag, template_count, in_namespace);
11153 if (decl == NULL_TREE)
11156 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11157 /* The decl and setting of decl_machine_attr is also turned off. */
11158 decl = build_decl_attribute_variant (decl, decl_machine_attr);
11161 /* [class.conv.ctor]
11163 A constructor declared without the function-specifier
11164 explicit that can be called with a single parameter
11165 specifies a conversion from the type of its first
11166 parameter to the type of its class. Such a constructor
11167 is called a converting constructor. */
11168 if (explicitp == 2)
11169 DECL_NONCONVERTING_P (decl) = 1;
11170 else if (DECL_CONSTRUCTOR_P (decl))
11172 /* The constructor can be called with exactly one
11173 parameter if there is at least one parameter, and
11174 any subsequent parameters have default arguments.
11175 We don't look at the first parameter, which is
11176 really just the `this' parameter for the new
11179 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)));
11181 /* Skip the `in_chrg' argument too, if present. */
11182 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl)))
11183 arg_types = TREE_CHAIN (arg_types);
11185 if (arg_types == void_list_node
11187 && TREE_CHAIN (arg_types)
11188 && TREE_CHAIN (arg_types) != void_list_node
11189 && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
11190 DECL_NONCONVERTING_P (decl) = 1;
11193 else if (TREE_CODE (type) == METHOD_TYPE)
11195 /* We only get here for friend declarations of
11196 members of other classes. */
11197 /* All method decls are public, so tell grokfndecl to set
11198 TREE_PUBLIC, also. */
11199 decl = grokfndecl (ctype, type, declarator, declarator,
11200 virtualp, flags, quals, raises,
11201 friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
11202 template_count, in_namespace);
11203 if (decl == NULL_TREE)
11206 else if (!staticp && ! processing_template_decl
11207 && TYPE_SIZE (complete_type (type)) == NULL_TREE
11208 && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
11211 cp_error ("field `%D' has incomplete type", declarator);
11213 cp_error ("name `%T' has incomplete type", type);
11215 /* If we're instantiating a template, tell them which
11216 instantiation made the field's type be incomplete. */
11217 if (current_class_type
11218 && TYPE_NAME (current_class_type)
11219 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
11220 && declspecs && TREE_VALUE (declspecs)
11221 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
11222 cp_error (" in instantiation of template `%T'",
11223 current_class_type);
11225 type = error_mark_node;
11232 error ("`%s' is neither function nor member function; cannot be declared friend",
11233 IDENTIFIER_POINTER (declarator));
11241 /* Friends are treated specially. */
11242 if (ctype == current_class_type)
11243 warning ("member functions are implicitly friends of their class");
11246 tree t = NULL_TREE;
11247 if (decl && DECL_NAME (decl))
11249 if (template_class_depth (current_class_type) == 0)
11252 = check_explicit_specialization
11254 template_count, 2 * (funcdef_flag != 0) + 4);
11255 if (decl == error_mark_node)
11256 return error_mark_node;
11259 t = do_friend (ctype, declarator, decl,
11260 last_function_parms, attrlist, flags, quals,
11263 if (t && funcdef_flag)
11266 return void_type_node;
11270 /* Structure field. It may not be a function, except for C++ */
11272 if (decl == NULL_TREE)
11278 /* An attempt is being made to initialize a non-static
11279 member. But, from [class.mem]:
11281 4 A member-declarator can contain a
11282 constant-initializer only if it declares a static
11283 member (_class.static_) of integral or enumeration
11284 type, see _class.static.data_.
11286 This used to be relatively common practice, but
11287 the rest of the compiler does not correctly
11288 handle the initialization unless the member is
11289 static so we make it static below. */
11290 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11292 cp_pedwarn ("making `%D' static", declarator);
11296 if (uses_template_parms (type))
11297 /* We'll check at instantiation time. */
11299 else if (check_static_variable_definition (declarator,
11301 /* If we just return the declaration, crashes
11302 will sometimes occur. We therefore return
11303 void_type_node, as if this was a friend
11304 declaration, to cause callers to completely
11305 ignore this declaration. */
11306 return void_type_node;
11309 /* 9.2p13 [class.mem] */
11310 if (declarator == constructor_name (current_class_type)
11311 /* Divergence from the standard: In extern "C", we
11312 allow non-static data members here, because C does
11313 and /usr/include/netinet/in.h uses that. */
11314 && (staticp || ! in_system_header))
11315 cp_pedwarn ("ISO C++ forbids data member `%D' with same name as enclosing class",
11320 /* C++ allows static class members. All other work
11321 for this is done by grokfield. */
11322 decl = build_lang_decl (VAR_DECL, declarator, type);
11323 TREE_STATIC (decl) = 1;
11324 /* In class context, 'static' means public access. */
11325 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
11329 decl = build_lang_decl (FIELD_DECL, declarator, type);
11330 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11332 DECL_MUTABLE_P (decl) = 1;
11333 RIDBIT_RESET (RID_MUTABLE, specbits);
11337 bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
11338 inlinep, friendp, raises != NULL_TREE);
11341 else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
11343 tree original_name;
11349 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11350 original_name = dname;
11352 original_name = declarator;
11354 if (RIDBIT_SETP (RID_AUTO, specbits))
11355 error ("storage class `auto' invalid for function `%s'", name);
11356 else if (RIDBIT_SETP (RID_REGISTER, specbits))
11357 error ("storage class `register' invalid for function `%s'", name);
11359 /* Function declaration not at top level.
11360 Storage classes other than `extern' are not allowed
11361 and `extern' makes no difference. */
11362 if (! toplevel_bindings_p ()
11363 && (RIDBIT_SETP (RID_STATIC, specbits)
11364 || RIDBIT_SETP (RID_INLINE, specbits))
11367 if (RIDBIT_SETP (RID_STATIC, specbits))
11368 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
11370 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
11373 if (ctype == NULL_TREE)
11377 error ("virtual non-class function `%s'", name);
11381 else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
11382 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11383 TYPE_ARG_TYPES (type));
11385 /* Record presence of `static'. */
11386 publicp = (ctype != NULL_TREE
11387 || RIDBIT_SETP (RID_EXTERN, specbits)
11388 || !RIDBIT_SETP (RID_STATIC, specbits));
11390 decl = grokfndecl (ctype, type, original_name, declarator,
11391 virtualp, flags, quals, raises,
11393 publicp, inlinep, funcdef_flag,
11394 template_count, in_namespace);
11395 if (decl == NULL_TREE)
11400 int illegal_static = 0;
11402 /* Don't allow a static member function in a class, and forbid
11403 declaring main to be static. */
11404 if (TREE_CODE (type) == METHOD_TYPE)
11406 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11407 illegal_static = 1;
11409 else if (current_function_decl)
11411 /* FIXME need arm citation */
11412 error ("cannot declare static function inside another function");
11413 illegal_static = 1;
11416 if (illegal_static)
11419 RIDBIT_RESET (RID_STATIC, specbits);
11425 /* It's a variable. */
11427 /* An uninitialized decl with `extern' is a reference. */
11428 decl = grokvardecl (type, declarator, &specbits,
11430 (type_quals & TYPE_QUAL_CONST) != 0,
11432 bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11433 inlinep, friendp, raises != NULL_TREE);
11437 DECL_CONTEXT (decl) = ctype;
11440 cp_pedwarn ("static member `%D' re-declared as static", decl);
11442 RIDBIT_RESET (RID_STATIC, specbits);
11444 if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11446 cp_error ("static member `%D' declared `register'", decl);
11447 RIDBIT_RESET (RID_REGISTER, specbits);
11449 if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11451 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11453 RIDBIT_RESET (RID_EXTERN, specbits);
11458 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE, specbits), 19990927);
11460 /* Record `register' declaration for warnings on &
11461 and in case doing stupid register allocation. */
11463 if (RIDBIT_SETP (RID_REGISTER, specbits))
11464 DECL_REGISTER (decl) = 1;
11466 if (RIDBIT_SETP (RID_EXTERN, specbits))
11467 DECL_THIS_EXTERN (decl) = 1;
11469 if (RIDBIT_SETP (RID_STATIC, specbits))
11470 DECL_THIS_STATIC (decl) = 1;
11472 /* Record constancy and volatility. There's no need to do this
11473 when processing a template; we'll do this for the instantiated
11474 declaration based on the type of DECL. */
11475 if (!processing_template_decl)
11476 c_apply_type_quals_to_decl (type_quals, decl);
11482 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11483 An empty exprlist is a parmlist. An exprlist which
11484 contains only identifiers at the global level
11485 is a parmlist. Otherwise, it is an exprlist. */
11488 parmlist_is_exprlist (exprs)
11491 if (exprs == NULL_TREE || TREE_PARMLIST (exprs))
11494 if (toplevel_bindings_p ())
11496 /* At the global level, if these are all identifiers,
11497 then it is a parmlist. */
11500 if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE)
11502 exprs = TREE_CHAIN (exprs);
11509 /* Subroutine of start_function. Ensure that each of the parameter
11510 types (as listed in PARMS) is complete, as is required for a
11511 function definition. */
11514 require_complete_types_for_parms (parms)
11517 for (; parms; parms = TREE_CHAIN (parms))
11519 tree type = TREE_TYPE (parms);
11521 /* Try to complete the TYPE. */
11522 type = complete_type (type);
11524 if (type == error_mark_node)
11527 if (TYPE_SIZE (type) == NULL_TREE)
11529 if (DECL_NAME (parms))
11530 error ("parameter `%s' has incomplete type",
11531 IDENTIFIER_POINTER (DECL_NAME (parms)));
11533 error ("parameter has incomplete type");
11534 TREE_TYPE (parms) = error_mark_node;
11537 layout_decl (parms, 0);
11541 /* Returns non-zero if T is a local variable. */
11544 local_variable_p (t)
11547 if ((TREE_CODE (t) == VAR_DECL
11548 /* A VAR_DECL with a context that is a _TYPE is a static data
11550 && !TYPE_P (CP_DECL_CONTEXT (t))
11551 /* Any other non-local variable must be at namespace scope. */
11552 && !DECL_NAMESPACE_SCOPE_P (t))
11553 || (TREE_CODE (t) == PARM_DECL))
11559 /* Returns non-zero if T is an automatic local variable or a label.
11560 (These are the declarations that need to be remapped when the code
11561 containing them is duplicated.) */
11564 nonstatic_local_decl_p (t)
11567 return ((local_variable_p (t) && !TREE_STATIC (t))
11568 || TREE_CODE (t) == LABEL_DECL
11569 || TREE_CODE (t) == RESULT_DECL);
11572 /* Like local_variable_p, but suitable for use as a tree-walking
11576 local_variable_p_walkfn (tp, walk_subtrees, data)
11578 int *walk_subtrees ATTRIBUTE_UNUSED;
11579 void *data ATTRIBUTE_UNUSED;
11581 return ((local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp))
11582 ? *tp : NULL_TREE);
11585 /* Check that ARG, which is a default-argument expression for a
11586 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11587 something goes wrong. DECL may also be a _TYPE node, rather than a
11588 DECL, if there is no DECL available. */
11591 check_default_argument (decl, arg)
11598 if (TREE_CODE (arg) == DEFAULT_ARG)
11599 /* We get a DEFAULT_ARG when looking at an in-class declaration
11600 with a default argument. Ignore the argument for now; we'll
11601 deal with it after the class is complete. */
11604 if (processing_template_decl || uses_template_parms (arg))
11605 /* We don't do anything checking until instantiation-time. Note
11606 that there may be uninstantiated arguments even for an
11607 instantiated function, since default arguments are not
11608 instantiated until they are needed. */
11617 decl_type = TREE_TYPE (decl);
11619 if (arg == error_mark_node
11620 || decl == error_mark_node
11621 || TREE_TYPE (arg) == error_mark_node
11622 || decl_type == error_mark_node)
11623 /* Something already went wrong. There's no need to check
11625 return error_mark_node;
11627 /* [dcl.fct.default]
11629 A default argument expression is implicitly converted to the
11631 if (!TREE_TYPE (arg)
11632 || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
11635 cp_error ("default argument for `%#D' has type `%T'",
11636 decl, TREE_TYPE (arg));
11638 cp_error ("default argument for parameter of type `%T' has type `%T'",
11639 decl_type, TREE_TYPE (arg));
11641 return error_mark_node;
11644 /* [dcl.fct.default]
11646 Local variables shall not be used in default argument
11649 The keyword `this' shall not be used in a default argument of a
11650 member function. */
11651 var = walk_tree (&arg, local_variable_p_walkfn, NULL);
11654 cp_error ("default argument `%E' uses local variable `%D'",
11656 return error_mark_node;
11663 /* Decode the list of parameter types for a function type.
11664 Given the list of things declared inside the parens,
11665 return a list of types.
11667 The list we receive can have three kinds of elements:
11668 an IDENTIFIER_NODE for names given without types,
11669 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11670 or void_type_node, to mark the end of an argument list
11671 when additional arguments are not permitted (... was not used).
11673 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11674 a mere declaration. A nonempty identifier-list gets an error message
11675 when FUNCDEF_FLAG is zero.
11676 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11677 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11679 If all elements of the input list contain types,
11680 we return a list of the types.
11681 If all elements contain no type (except perhaps a void_type_node
11682 at the end), we return a null list.
11683 If some have types and some do not, it is an error, and we
11684 return a null list.
11686 Also set last_function_parms to either
11687 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11688 A list of names is converted to a chain of PARM_DECLs
11689 by store_parm_decls so that ultimately it is always a chain of decls.
11691 Note that in C++, parameters can take default values. These default
11692 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11693 an error to specify default values which are followed by parameters
11694 that have no default values, or an ELLIPSES. For simplicities sake,
11695 only parameters which are specified with their types can take on
11699 grokparms (first_parm, funcdef_flag)
11703 tree result = NULL_TREE;
11704 tree decls = NULL_TREE;
11706 if (first_parm != NULL_TREE
11707 && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE)
11709 if (! funcdef_flag)
11710 pedwarn ("parameter names (without types) in function declaration");
11711 last_function_parms = first_parm;
11714 else if (first_parm != NULL_TREE
11715 && TREE_CODE (TREE_VALUE (first_parm)) != TREE_LIST
11716 && TREE_CODE (TREE_VALUE (first_parm)) != VOID_TYPE)
11717 my_friendly_abort (145);
11720 /* Types were specified. This is a list of declarators
11721 each represented as a TREE_LIST node. */
11722 register tree parm, chain;
11723 int any_init = 0, any_error = 0;
11725 if (first_parm != NULL_TREE)
11727 tree last_result = NULL_TREE;
11728 tree last_decl = NULL_TREE;
11730 for (parm = first_parm; parm != NULL_TREE; parm = chain)
11732 tree type = NULL_TREE, list_node = parm;
11733 register tree decl = TREE_VALUE (parm);
11734 tree init = TREE_PURPOSE (parm);
11736 chain = TREE_CHAIN (parm);
11737 /* @@ weak defense against parse errors. */
11738 if (TREE_CODE (decl) != VOID_TYPE
11739 && TREE_CODE (decl) != TREE_LIST)
11741 /* Give various messages as the need arises. */
11742 if (TREE_CODE (decl) == STRING_CST)
11743 cp_error ("invalid string constant `%E'", decl);
11744 else if (TREE_CODE (decl) == INTEGER_CST)
11745 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11749 if (TREE_CODE (decl) != VOID_TYPE)
11751 decl = grokdeclarator (TREE_VALUE (decl),
11752 TREE_PURPOSE (decl),
11753 PARM, init != NULL_TREE,
11755 if (! decl || TREE_TYPE (decl) == error_mark_node)
11758 /* Top-level qualifiers on the parameters are
11759 ignored for function types. */
11760 type = TYPE_MAIN_VARIANT (TREE_TYPE (decl));
11762 if (TREE_CODE (type) == VOID_TYPE)
11763 decl = void_type_node;
11764 else if (TREE_CODE (type) == METHOD_TYPE)
11766 if (DECL_NAME (decl))
11767 /* Cannot use the decl here because
11768 we don't have DECL_CONTEXT set up yet. */
11769 cp_error ("parameter `%D' invalidly declared method type",
11772 error ("parameter invalidly declared method type");
11773 type = build_pointer_type (type);
11774 TREE_TYPE (decl) = type;
11776 else if (TREE_CODE (type) == OFFSET_TYPE)
11778 if (DECL_NAME (decl))
11779 cp_error ("parameter `%D' invalidly declared offset type",
11782 error ("parameter invalidly declared offset type");
11783 type = build_pointer_type (type);
11784 TREE_TYPE (decl) = type;
11786 else if (abstract_virtuals_error (decl, type))
11787 any_error = 1; /* Seems like a good idea. */
11788 else if (POINTER_TYPE_P (type))
11791 while (POINTER_TYPE_P (t)
11792 || (TREE_CODE (t) == ARRAY_TYPE
11793 && TYPE_DOMAIN (t) != NULL_TREE))
11795 if (TREE_CODE (t) == ARRAY_TYPE)
11796 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11798 TYPE_PTR_P (type) ? "pointer" : "reference");
11802 if (TREE_CODE (decl) == VOID_TYPE)
11804 if (result == NULL_TREE)
11806 result = void_list_node;
11807 last_result = result;
11811 TREE_CHAIN (last_result) = void_list_node;
11812 last_result = void_list_node;
11815 && (chain != void_list_node || TREE_CHAIN (chain)))
11816 error ("`void' in parameter list must be entire list");
11820 /* Since there is a prototype, args are passed in their own types. */
11821 DECL_ARG_TYPE (decl) = TREE_TYPE (decl);
11822 if (PROMOTE_PROTOTYPES
11823 && (TREE_CODE (type) == INTEGER_TYPE
11824 || TREE_CODE (type) == ENUMERAL_TYPE)
11825 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
11826 DECL_ARG_TYPE (decl) = integer_type_node;
11827 if (!any_error && init)
11830 init = check_default_argument (decl, init);
11835 if (decls == NULL_TREE)
11842 TREE_CHAIN (last_decl) = decl;
11845 list_node = tree_cons (init, type, NULL_TREE);
11846 if (result == NULL_TREE)
11848 result = list_node;
11849 last_result = result;
11853 TREE_CHAIN (last_result) = list_node;
11854 last_result = list_node;
11858 TREE_CHAIN (last_result) = NULL_TREE;
11859 /* If there are no parameters, and the function does not end
11860 with `...', then last_decl will be NULL_TREE. */
11861 if (last_decl != NULL_TREE)
11862 TREE_CHAIN (last_decl) = NULL_TREE;
11866 last_function_parms = decls;
11871 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11872 FUNCTION_TYPE with the newly parsed version of its default argument, which
11873 was previously digested as text. See snarf_defarg et al in lex.c. */
11876 replace_defarg (arg, init)
11879 if (! processing_template_decl
11880 && ! can_convert_arg (TREE_VALUE (arg), TREE_TYPE (init), init))
11881 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11882 TREE_TYPE (init), TREE_VALUE (arg));
11883 TREE_PURPOSE (arg) = init;
11886 /* D is a constructor or overloaded `operator='. Returns non-zero if
11887 D's arguments allow it to be a copy constructor, or copy assignment
11896 if (!DECL_FUNCTION_MEMBER_P (d))
11899 t = FUNCTION_ARG_CHAIN (d);
11900 if (DECL_CONSTRUCTOR_P (d)
11901 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d)))
11902 t = TREE_CHAIN (t);
11903 if (t && TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
11904 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t)))
11905 == DECL_CONTEXT (d))
11906 && (TREE_CHAIN (t) == NULL_TREE
11907 || TREE_CHAIN (t) == void_list_node
11908 || TREE_PURPOSE (TREE_CHAIN (t))))
11913 /* These memoizing functions keep track of special properties which
11914 a class may have. `grok_ctor_properties' notices whether a class
11915 has a constructor of the form X(X&), and also complains
11916 if the class has a constructor of the form X(X).
11917 `grok_op_properties' takes notice of the various forms of
11918 operator= which are defined, as well as what sorts of type conversion
11919 may apply. Both functions take a FUNCTION_DECL as an argument. */
11922 grok_ctor_properties (ctype, decl)
11925 tree parmtypes = FUNCTION_ARG_CHAIN (decl);
11926 tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
11928 /* When a type has virtual baseclasses, a magical first int argument is
11929 added to any ctor so we can tell if the class has been initialized
11930 yet. This could screw things up in this function, so we deliberately
11931 ignore the leading int if we're in that situation. */
11932 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype))
11934 my_friendly_assert (parmtypes
11935 && TREE_VALUE (parmtypes) == integer_type_node,
11937 parmtypes = TREE_CHAIN (parmtypes);
11938 parmtype = TREE_VALUE (parmtypes);
11943 A non-template constructor for class X is a copy constructor if
11944 its first parameter is of type X&, const X&, volatile X& or const
11945 volatile X&, and either there are no other parameters or else all
11946 other parameters have default arguments. */
11947 if (TREE_CODE (parmtype) == REFERENCE_TYPE
11948 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == ctype
11949 && (TREE_CHAIN (parmtypes) == NULL_TREE
11950 || TREE_CHAIN (parmtypes) == void_list_node
11951 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11952 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11953 && is_member_template (DECL_TI_TEMPLATE (decl))))
11955 TYPE_HAS_INIT_REF (ctype) = 1;
11956 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
11957 TYPE_HAS_CONST_INIT_REF (ctype) = 1;
11961 A declaration of a constructor for a class X is ill-formed if its
11962 first parameter is of type (optionally cv-qualified) X and either
11963 there are no other parameters or else all other parameters have
11966 We *don't* complain about member template instantiations that
11967 have this form, though; they can occur as we try to decide what
11968 constructor to use during overload resolution. Since overload
11969 resolution will never prefer such a constructor to the
11970 non-template copy constructor (which is either explicitly or
11971 implicitly defined), there's no need to worry about their
11972 existence. Theoretically, they should never even be
11973 instantiated, but that's hard to forestall. */
11974 else if (TYPE_MAIN_VARIANT (parmtype) == ctype
11975 && (TREE_CHAIN (parmtypes) == NULL_TREE
11976 || TREE_CHAIN (parmtypes) == void_list_node
11977 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
11978 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11979 && is_member_template (DECL_TI_TEMPLATE (decl))))
11981 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11983 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
11986 else if (TREE_CODE (parmtype) == VOID_TYPE
11987 || TREE_PURPOSE (parmtypes) != NULL_TREE)
11988 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype) = 1;
11993 /* An operator with this name can be either unary or binary. */
11999 return (name == ansi_opname [(int) INDIRECT_REF]
12000 || name == ansi_opname [(int) ADDR_EXPR]
12001 || name == ansi_opname [(int) NEGATE_EXPR]
12002 || name == ansi_opname[(int) POSTINCREMENT_EXPR]
12003 || name == ansi_opname[(int) POSTDECREMENT_EXPR]
12004 || name == ansi_opname [(int) CONVERT_EXPR]);
12007 /* An operator with this name can only be unary. */
12013 return (name == ansi_opname [(int) TRUTH_NOT_EXPR]
12014 || name == ansi_opname [(int) BIT_NOT_EXPR]
12015 || name == ansi_opname [(int) COMPONENT_REF]
12016 || IDENTIFIER_TYPENAME_P (name));
12019 /* Do a little sanity-checking on how they declared their operator. */
12022 grok_op_properties (decl, virtualp, friendp)
12024 int virtualp, friendp;
12026 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
12027 int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
12028 tree name = DECL_NAME (decl);
12030 if (current_class_type == NULL_TREE)
12037 A user-declared copy assignment operator X::operator= is a
12038 non-static non-template member function of class X with
12039 exactly one parameter of type X, X&, const X&, volatile X& or
12040 const volatile X&. */
12041 if (name == ansi_opname[(int) MODIFY_EXPR]
12042 && !(DECL_TEMPLATE_INSTANTIATION (decl)
12043 && is_member_template (DECL_TI_TEMPLATE (decl))))
12045 else if (name == ansi_opname[(int) CALL_EXPR])
12046 TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
12047 else if (name == ansi_opname[(int) ARRAY_REF])
12048 TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
12049 else if (name == ansi_opname[(int) COMPONENT_REF]
12050 || name == ansi_opname[(int) MEMBER_REF])
12051 TYPE_OVERLOADS_ARROW (current_class_type) = 1;
12052 else if (name == ansi_opname[(int) NEW_EXPR])
12053 TYPE_HAS_NEW_OPERATOR (current_class_type) = 1;
12054 else if (name == ansi_opname[(int) DELETE_EXPR])
12055 TYPE_GETS_DELETE (current_class_type) |= 1;
12056 else if (name == ansi_opname[(int) VEC_NEW_EXPR])
12057 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type) = 1;
12058 else if (name == ansi_opname[(int) VEC_DELETE_EXPR])
12059 TYPE_GETS_DELETE (current_class_type) |= 2;
12062 if (name == ansi_opname[(int) NEW_EXPR]
12063 || name == ansi_opname[(int) VEC_NEW_EXPR])
12065 /* When the compiler encounters the definition of A::operator new, it
12066 doesn't look at the class declaration to find out if it's static. */
12068 revert_static_member_fn (decl);
12070 /* Take care of function decl if we had syntax errors. */
12071 if (argtypes == NULL_TREE)
12073 = build_function_type (ptr_type_node,
12074 hash_tree_chain (integer_type_node,
12077 TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
12079 else if (name == ansi_opname[(int) DELETE_EXPR]
12080 || name == ansi_opname[(int) VEC_DELETE_EXPR])
12083 revert_static_member_fn (decl);
12085 if (argtypes == NULL_TREE)
12087 = build_function_type (void_type_node,
12088 hash_tree_chain (ptr_type_node,
12091 TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
12095 /* An operator function must either be a non-static member function
12096 or have at least one parameter of a class, a reference to a class,
12097 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12098 if (! methodp || DECL_STATIC_FUNCTION_P (decl))
12100 if (IDENTIFIER_TYPENAME_P (name)
12101 || name == ansi_opname[(int) CALL_EXPR]
12102 || name == ansi_opname[(int) MODIFY_EXPR]
12103 || name == ansi_opname[(int) COMPONENT_REF]
12104 || name == ansi_opname[(int) ARRAY_REF])
12105 cp_error ("`%D' must be a nonstatic member function", decl);
12110 if (DECL_STATIC_FUNCTION_P (decl))
12111 cp_error ("`%D' must be either a non-static member function or a non-member function", decl);
12114 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
12116 tree arg = TREE_VALUE (p);
12117 if (TREE_CODE (arg) == REFERENCE_TYPE)
12118 arg = TREE_TYPE (arg);
12120 /* This lets bad template code slip through. */
12121 if (IS_AGGR_TYPE (arg)
12122 || TREE_CODE (arg) == ENUMERAL_TYPE
12123 || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
12124 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
12128 ("`%D' must have an argument of class or enumerated type",
12135 if (name == ansi_opname[(int) CALL_EXPR])
12136 return; /* No restrictions on args. */
12138 if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
12140 tree t = TREE_TYPE (name);
12143 int ref = (TREE_CODE (t) == REFERENCE_TYPE);
12144 const char *what = 0;
12147 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
12149 if (TREE_CODE (t) == VOID_TYPE)
12151 else if (t == current_class_type)
12152 what = "the same type";
12153 /* Don't force t to be complete here. */
12154 else if (IS_AGGR_TYPE (t)
12156 && DERIVED_FROM_P (t, current_class_type))
12157 what = "a base class";
12160 warning ("conversion to %s%s will never use a type conversion operator",
12161 ref ? "a reference to " : "", what);
12165 if (name == ansi_opname[(int) MODIFY_EXPR])
12169 if (list_length (argtypes) != 3 && methodp)
12171 cp_error ("`%D' must take exactly one argument", decl);
12174 parmtype = TREE_VALUE (TREE_CHAIN (argtypes));
12176 if (copy_assignment_arg_p (parmtype, virtualp)
12179 TYPE_HAS_ASSIGN_REF (current_class_type) = 1;
12180 if (TREE_CODE (parmtype) != REFERENCE_TYPE
12181 || CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
12182 TYPE_HAS_CONST_ASSIGN_REF (current_class_type) = 1;
12185 else if (name == ansi_opname[(int) COND_EXPR])
12188 cp_error ("ISO C++ prohibits overloading operator ?:");
12190 else if (ambi_op_p (name))
12192 if (list_length (argtypes) == 2)
12194 else if (list_length (argtypes) == 3)
12196 if ((name == ansi_opname[(int) POSTINCREMENT_EXPR]
12197 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
12198 && ! processing_template_decl
12199 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
12202 cp_error ("postfix `%D' must take `int' as its argument",
12206 ("postfix `%D' must take `int' as its second argument",
12213 cp_error ("`%D' must take either zero or one argument", decl);
12215 cp_error ("`%D' must take either one or two arguments", decl);
12218 /* More Effective C++ rule 6. */
12220 && (name == ansi_opname[(int) POSTINCREMENT_EXPR]
12221 || name == ansi_opname[(int) POSTDECREMENT_EXPR]))
12223 tree arg = TREE_VALUE (argtypes);
12224 tree ret = TREE_TYPE (TREE_TYPE (decl));
12225 if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
12226 arg = TREE_TYPE (arg);
12227 arg = TYPE_MAIN_VARIANT (arg);
12228 if (list_length (argtypes) == 2)
12230 if (TREE_CODE (ret) != REFERENCE_TYPE
12231 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
12233 cp_warning ("prefix `%D' should return `%T'", decl,
12234 build_reference_type (arg));
12238 if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
12239 cp_warning ("postfix `%D' should return `%T'", decl, arg);
12243 else if (unary_op_p (name))
12245 if (list_length (argtypes) != 2)
12248 cp_error ("`%D' must take `void'", decl);
12250 cp_error ("`%D' must take exactly one argument", decl);
12253 else /* if (binary_op_p (name)) */
12255 if (list_length (argtypes) != 3)
12258 cp_error ("`%D' must take exactly one argument", decl);
12260 cp_error ("`%D' must take exactly two arguments", decl);
12263 /* More Effective C++ rule 7. */
12265 && (name == ansi_opname [TRUTH_ANDIF_EXPR]
12266 || name == ansi_opname [TRUTH_ORIF_EXPR]
12267 || name == ansi_opname [COMPOUND_EXPR]))
12268 cp_warning ("user-defined `%D' always evaluates both arguments",
12272 /* Effective C++ rule 23. */
12274 && list_length (argtypes) == 3
12275 && (name == ansi_opname [PLUS_EXPR]
12276 || name == ansi_opname [MINUS_EXPR]
12277 || name == ansi_opname [TRUNC_DIV_EXPR]
12278 || name == ansi_opname [MULT_EXPR])
12279 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
12280 cp_warning ("`%D' should return by value", decl);
12284 for (; argtypes != void_list_node ; argtypes = TREE_CHAIN (argtypes))
12285 if (TREE_PURPOSE (argtypes))
12287 TREE_PURPOSE (argtypes) = NULL_TREE;
12288 if (name == ansi_opname[(int) POSTINCREMENT_EXPR]
12289 || name == ansi_opname[(int) POSTDECREMENT_EXPR])
12292 cp_pedwarn ("`%D' cannot have default arguments", decl);
12295 cp_error ("`%D' cannot have default arguments", decl);
12300 static const char *
12302 enum tag_types code;
12315 my_friendly_abort (981122);
12319 /* Get the struct, enum or union (CODE says which) with tag NAME.
12320 Define the tag as a forward-reference if it is not defined.
12322 C++: If a class derivation is given, process it here, and report
12323 an error if multiple derivation declarations are not identical.
12325 If this is a definition, come in through xref_tag and only look in
12326 the current frame for the name (since C++ allows new names in any
12330 xref_tag (code_type_node, name, globalize)
12331 tree code_type_node;
12335 enum tag_types tag_code;
12336 enum tree_code code;
12337 register tree ref, t;
12338 struct binding_level *b = current_binding_level;
12340 tree attributes = NULL_TREE;
12341 tree context = NULL_TREE;
12343 /* If we are called from the parser, code_type_node will sometimes be a
12344 TREE_LIST. This indicates that the user wrote
12345 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12347 if (TREE_CODE (code_type_node) == TREE_LIST)
12349 attributes = TREE_PURPOSE (code_type_node);
12350 code_type_node = TREE_VALUE (code_type_node);
12353 tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
12358 code = RECORD_TYPE;
12364 code = ENUMERAL_TYPE;
12367 my_friendly_abort (18);
12370 /* If a cross reference is requested, look up the type
12371 already defined for this tag and return it. */
12372 if (TREE_CODE_CLASS (TREE_CODE (name)) == 't')
12375 name = TYPE_IDENTIFIER (t);
12379 t = IDENTIFIER_TYPE_VALUE (name);
12381 if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
12382 && TREE_CODE (t) != TEMPLATE_TEMPLATE_PARM)
12387 /* If we know we are defining this tag, only look it up in
12388 this scope and don't try to find it as a type. */
12389 ref = lookup_tag (code, name, b, 1);
12395 /* [dcl.type.elab] If the identifier resolves to a
12396 typedef-name or a template type-parameter, the
12397 elaborated-type-specifier is ill-formed. */
12398 if (t != TYPE_MAIN_VARIANT (t)
12399 || (CLASS_TYPE_P (t) && TYPE_WAS_ANONYMOUS (t)))
12400 cp_pedwarn ("using typedef-name `%D' after `%s'",
12401 TYPE_NAME (t), tag_name (tag_code));
12402 else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
12403 cp_error ("using template type parameter `%T' after `%s'",
12404 t, tag_name (tag_code));
12409 ref = lookup_tag (code, name, b, 0);
12413 /* Try finding it as a type declaration. If that wins,
12415 ref = lookup_name (name, 1);
12417 if (ref != NULL_TREE
12418 && processing_template_decl
12419 && DECL_CLASS_TEMPLATE_P (ref)
12420 && template_class_depth (current_class_type) == 0)
12421 /* Since GLOBALIZE is true, we're declaring a global
12422 template, so we want this type. */
12423 ref = DECL_RESULT (ref);
12425 if (ref && TREE_CODE (ref) == TYPE_DECL
12426 && TREE_CODE (TREE_TYPE (ref)) == code)
12427 ref = TREE_TYPE (ref);
12432 if (ref && current_class_type
12433 && template_class_depth (current_class_type)
12434 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12436 /* Since GLOBALIZE is non-zero, we are not looking at a
12437 definition of this tag. Since, in addition, we are currently
12438 processing a (member) template declaration of a template
12439 class, we must be very careful; consider:
12446 { template <class V>
12447 friend struct S1; };
12449 Here, the S2::S1 declaration should not be confused with the
12450 outer declaration. In particular, the inner version should
12451 have a template parameter of level 2, not level 1. This
12452 would be particularly important if the member declaration
12455 template <class V = U> friend struct S1;
12457 say, when we should tsubst into `U' when instantiating
12458 S2. On the other hand, when presented with:
12468 we must find the inner binding eventually. We
12469 accomplish this by making sure that the new type we
12470 create to represent this declaration has the right
12472 context = TYPE_CONTEXT (ref);
12479 /* If no such tag is yet defined, create a forward-reference node
12480 and record it as the "definition".
12481 When a real declaration of this type is found,
12482 the forward-reference will be altered into a real type. */
12483 if (code == ENUMERAL_TYPE)
12485 cp_error ("use of enum `%#D' without previous declaration", name);
12487 ref = make_node (ENUMERAL_TYPE);
12489 /* Give the type a default layout like unsigned int
12490 to avoid crashing if it does not get defined. */
12491 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12492 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12493 TREE_UNSIGNED (ref) = 1;
12494 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12495 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12496 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12498 /* Enable us to recognize when a type is created in class context.
12499 To do nested classes correctly, this should probably be cleared
12500 out when we leave this classes scope. Currently this in only
12501 done in `start_enum'. */
12503 pushtag (name, ref, globalize);
12507 struct binding_level *old_b = class_binding_level;
12509 ref = make_aggr_type (code);
12510 TYPE_CONTEXT (ref) = context;
12512 #ifdef NONNESTED_CLASSES
12513 /* Class types don't nest the way enums do. */
12514 class_binding_level = (struct binding_level *)0;
12516 pushtag (name, ref, globalize);
12517 class_binding_level = old_b;
12522 if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12523 redeclare_class_template (ref, current_template_parms);
12526 /* Until the type is defined, tentatively accept whatever
12527 structure tag the user hands us. */
12528 if (TYPE_SIZE (ref) == NULL_TREE
12529 && ref != current_class_type
12530 /* Have to check this, in case we have contradictory tag info. */
12531 && IS_AGGR_TYPE_CODE (TREE_CODE (ref)))
12533 if (tag_code == class_type)
12534 CLASSTYPE_DECLARED_CLASS (ref) = 1;
12535 else if (tag_code == record_type)
12536 CLASSTYPE_DECLARED_CLASS (ref) = 0;
12539 TREE_TYPE (ref) = attributes;
12545 xref_tag_from_type (old, id, globalize)
12549 tree code_type_node;
12551 if (TREE_CODE (old) == RECORD_TYPE)
12552 code_type_node = (CLASSTYPE_DECLARED_CLASS (old)
12553 ? class_type_node : record_type_node);
12555 code_type_node = union_type_node;
12557 if (id == NULL_TREE)
12558 id = TYPE_IDENTIFIER (old);
12560 return xref_tag (code_type_node, id, globalize);
12563 /* REF is a type (named NAME), for which we have just seen some
12564 baseclasses. BINFO is a list of those baseclasses; the
12565 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12566 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12567 struct, or union. */
12570 xref_basetypes (code_type_node, name, ref, binfo)
12571 tree code_type_node;
12575 /* In the declaration `A : X, Y, ... Z' we mark all the types
12576 (A, X, Y, ..., Z) so we can check for duplicates. */
12581 enum tag_types tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node);
12583 if (tag_code == union_type)
12585 cp_error ("derived union `%T' invalid", ref);
12589 len = list_length (binfo);
12591 /* First, make sure that any templates in base-classes are
12592 instantiated. This ensures that if we call ourselves recursively
12593 we do not get confused about which classes are marked and which
12595 for (base = binfo; base; base = TREE_CHAIN (base))
12596 complete_type (TREE_VALUE (base));
12598 SET_CLASSTYPE_MARKED (ref);
12599 BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len);
12601 for (i = 0; binfo; binfo = TREE_CHAIN (binfo))
12603 /* The base of a derived struct is public by default. */
12605 = (TREE_PURPOSE (binfo) == access_public_node
12606 || TREE_PURPOSE (binfo) == access_public_virtual_node
12607 || (tag_code != class_type
12608 && (TREE_PURPOSE (binfo) == access_default_node
12609 || TREE_PURPOSE (binfo) == access_default_virtual_node)));
12611 = (TREE_PURPOSE (binfo) == access_protected_node
12612 || TREE_PURPOSE (binfo) == access_protected_virtual_node);
12614 = (TREE_PURPOSE (binfo) == access_private_virtual_node
12615 || TREE_PURPOSE (binfo) == access_protected_virtual_node
12616 || TREE_PURPOSE (binfo) == access_public_virtual_node
12617 || TREE_PURPOSE (binfo) == access_default_virtual_node);
12618 tree basetype = TREE_VALUE (binfo);
12621 if (basetype && TREE_CODE (basetype) == TYPE_DECL)
12622 basetype = TREE_TYPE (basetype);
12624 || (TREE_CODE (basetype) != RECORD_TYPE
12625 && TREE_CODE (basetype) != TYPENAME_TYPE
12626 && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
12627 && TREE_CODE (basetype) != TEMPLATE_TEMPLATE_PARM))
12629 cp_error ("base type `%T' fails to be a struct or class type",
12630 TREE_VALUE (binfo));
12634 GNU_xref_hier (name, basetype, via_public, via_virtual, 0);
12636 /* This code replaces similar code in layout_basetypes.
12637 We put the complete_type first for implicit `typename'. */
12638 if (TYPE_SIZE (basetype) == NULL_TREE
12639 && ! (current_template_parms && uses_template_parms (basetype)))
12641 cp_error ("base class `%T' has incomplete type", basetype);
12646 if (CLASSTYPE_MARKED (basetype))
12648 if (basetype == ref)
12649 cp_error ("recursive type `%T' undefined", basetype);
12651 cp_error ("duplicate base type `%T' invalid", basetype);
12655 if (TYPE_FOR_JAVA (basetype)
12656 && (current_lang_stack
12657 == &VARRAY_TREE (current_lang_base, 0)))
12658 TYPE_FOR_JAVA (ref) = 1;
12660 /* Note that the BINFO records which describe individual
12661 inheritances are *not* shared in the lattice! They
12662 cannot be shared because a given baseclass may be
12663 inherited with different `accessibility' by different
12664 derived classes. (Each BINFO record describing an
12665 individual inheritance contains flags which say what
12666 the `accessibility' of that particular inheritance is.) */
12669 = make_binfo (size_zero_node, basetype,
12670 CLASS_TYPE_P (basetype)
12671 ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE,
12672 CLASS_TYPE_P (basetype)
12673 ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE);
12675 TREE_VEC_ELT (binfos, i) = base_binfo;
12676 TREE_VIA_PUBLIC (base_binfo) = via_public;
12677 TREE_VIA_PROTECTED (base_binfo) = via_protected;
12678 TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
12679 BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref);
12681 /* We need to unshare the binfos now so that lookups during class
12682 definition work. */
12683 unshare_base_binfos (base_binfo);
12685 SET_CLASSTYPE_MARKED (basetype);
12687 /* We are free to modify these bits because they are meaningless
12688 at top level, and BASETYPE is a top-level type. */
12689 if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
12691 TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
12692 /* Converting to a virtual base class requires looking
12693 up the offset of the virtual base. */
12694 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
12697 if (CLASS_TYPE_P (basetype))
12699 TYPE_HAS_NEW_OPERATOR (ref)
12700 |= TYPE_HAS_NEW_OPERATOR (basetype);
12701 TYPE_HAS_ARRAY_NEW_OPERATOR (ref)
12702 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype);
12703 TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
12704 /* If the base-class uses multiple inheritance, so do we. */
12705 TYPE_USES_MULTIPLE_INHERITANCE (ref)
12706 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype);
12707 /* Likewise, if converting to a base of the base may require
12708 code, then we may need to generate code to convert to a
12710 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref)
12711 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype);
12718 TREE_VEC_LENGTH (binfos) = i;
12720 BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE;
12724 TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
12725 /* If there is more than one non-empty they cannot be at the same
12727 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
12730 /* Unmark all the types. */
12732 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i)));
12733 CLEAR_CLASSTYPE_MARKED (ref);
12735 /* Now that we know all the base-classes, set up the list of virtual
12737 get_vbase_types (ref);
12741 /* Begin compiling the definition of an enumeration type.
12742 NAME is its name (or null if anonymous).
12743 Returns the type object, as yet incomplete.
12744 Also records info about it so that build_enumerator
12745 may be used to declare the individual values as they are read. */
12751 register tree enumtype = NULL_TREE;
12752 struct binding_level *b = current_binding_level;
12754 /* If this is the real definition for a previous forward reference,
12755 fill in the contents in the same object that used to be the
12756 forward reference. */
12758 if (name != NULL_TREE)
12759 enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
12761 if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
12763 cp_error ("multiple definition of `%#T'", enumtype);
12764 cp_error_at ("previous definition here", enumtype);
12765 /* Clear out TYPE_VALUES, and start again. */
12766 TYPE_VALUES (enumtype) = NULL_TREE;
12770 enumtype = make_node (ENUMERAL_TYPE);
12771 pushtag (name, enumtype, 0);
12774 if (current_class_type)
12775 TREE_ADDRESSABLE (b->tags) = 1;
12777 GNU_xref_decl (current_function_decl, enumtype);
12781 /* After processing and defining all the values of an enumeration type,
12782 install their decls in the enumeration type and finish it off.
12783 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12784 Returns ENUMTYPE. */
12787 finish_enum (enumtype)
12790 register tree minnode = NULL_TREE, maxnode = NULL_TREE;
12791 /* Calculate the maximum value of any enumerator in this type. */
12793 tree values = TYPE_VALUES (enumtype);
12798 for (pair = values; pair; pair = TREE_CHAIN (pair))
12803 /* The TREE_VALUE is a CONST_DECL for this enumeration
12805 decl = TREE_VALUE (pair);
12809 Following the closing brace of an enum-specifier, each
12810 enumerator has the type of its enumeration. Prior to the
12811 closing brace, the type of each enumerator is the type of
12812 its initializing value. */
12813 TREE_TYPE (decl) = enumtype;
12815 /* The DECL_INITIAL will be NULL if we are processing a
12816 template declaration and this enumeration constant had no
12817 explicit initializer. */
12818 value = DECL_INITIAL (decl);
12819 if (value && !processing_template_decl)
12821 /* Set the TREE_TYPE for the VALUE as well. That's so
12822 that when we call decl_constant_value we get an
12823 entity of the right type (but with the constant
12824 value). Since we shouldn't ever call
12825 decl_constant_value on a template type, there's no
12826 reason to do that when processing_template_decl.
12827 And, if the expression is something like a
12828 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12829 wreak havoc on the intended type of the expression.
12831 Of course, there's also no point in trying to compute
12832 minimum or maximum values if we're in a template. */
12833 TREE_TYPE (value) = enumtype;
12836 minnode = maxnode = value;
12837 else if (tree_int_cst_lt (maxnode, value))
12839 else if (tree_int_cst_lt (value, minnode))
12843 if (processing_template_decl)
12844 /* If this is just a template, leave the CONST_DECL
12845 alone. That way tsubst_copy will find CONST_DECLs for
12846 CONST_DECLs, and not INTEGER_CSTs. */
12849 /* In the list we're building up, we want the enumeration
12850 values, not the CONST_DECLs. */
12851 TREE_VALUE (pair) = value;
12855 maxnode = minnode = integer_zero_node;
12857 TYPE_VALUES (enumtype) = nreverse (values);
12859 if (processing_template_decl)
12861 tree scope = current_scope ();
12862 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
12863 add_tree (build_min (TAG_DEFN, enumtype));
12867 int unsignedp = tree_int_cst_sgn (minnode) >= 0;
12868 int lowprec = min_precision (minnode, unsignedp);
12869 int highprec = min_precision (maxnode, unsignedp);
12870 int precision = MAX (lowprec, highprec);
12873 TYPE_SIZE (enumtype) = NULL_TREE;
12875 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12877 TYPE_PRECISION (enumtype) = precision;
12879 fixup_unsigned_type (enumtype);
12881 fixup_signed_type (enumtype);
12883 if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
12884 /* Use the width of the narrowest normal C type which is wide
12886 TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size
12889 TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
12891 TYPE_SIZE (enumtype) = 0;
12892 layout_type (enumtype);
12894 /* Fix up all variant types of this enum type. */
12895 for (tem = TYPE_MAIN_VARIANT (enumtype); tem;
12896 tem = TYPE_NEXT_VARIANT (tem))
12898 TYPE_VALUES (tem) = TYPE_VALUES (enumtype);
12899 TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype);
12900 TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype);
12901 TYPE_SIZE (tem) = TYPE_SIZE (enumtype);
12902 TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype);
12903 TYPE_MODE (tem) = TYPE_MODE (enumtype);
12904 TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype);
12905 TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype);
12906 TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype);
12909 /* Finish debugging output for this type. */
12910 rest_of_type_compilation (enumtype, namespace_bindings_p ());
12916 /* Build and install a CONST_DECL for an enumeration constant of the
12917 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
12918 Assignment of sequential values by default is handled here. */
12921 build_enumerator (name, value, enumtype)
12931 /* Remove no-op casts from the value. */
12933 STRIP_TYPE_NOPS (value);
12935 if (! processing_template_decl)
12937 /* Validate and default VALUE. */
12938 if (value != NULL_TREE)
12940 if (TREE_READONLY_DECL_P (value))
12941 value = decl_constant_value (value);
12943 if (TREE_CODE (value) == INTEGER_CST)
12945 value = default_conversion (value);
12946 constant_expression_warning (value);
12950 cp_error ("enumerator value for `%D' not integer constant", name);
12955 /* Default based on previous value. */
12956 if (value == NULL_TREE && ! processing_template_decl)
12960 if (TYPE_VALUES (enumtype))
12962 /* The next value is the previous value ... */
12963 prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype)));
12964 /* ... plus one. */
12965 value = build_binary_op (PLUS_EXPR,
12969 if (tree_int_cst_lt (value, prev_value))
12970 cp_error ("overflow in enumeration values at `%D'", name);
12973 value = integer_zero_node;
12976 /* Remove no-op casts from the value. */
12978 STRIP_TYPE_NOPS (value);
12980 /* To fix MAX_VAL enum consts. (bkoz) */
12981 TREE_TYPE (value) = integer_type_node;
12985 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12986 Even in other cases, we will later (in finish_enum) be setting
12987 the type of VALUE. But, we don't need to make a copy if this
12988 VALUE is one of the enumeration constants for this same
12989 enumeration type. */
12990 for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values))
12991 if (TREE_VALUE (values) == value)
12993 /* If we didn't break out of the loop, then we do need a copy. */
12994 if (!values && value)
12995 value = copy_node (value);
12997 /* C++ associates enums with global, function, or class declarations. */
12998 context = current_scope ();
13000 /* Build the actual enumeration constant. Note that the enumeration
13001 constants have the type of their initializers until the
13002 enumeration is complete:
13006 Following the closing brace of an enum-specifier, each enumer-
13007 ator has the type of its enumeration. Prior to the closing
13008 brace, the type of each enumerator is the type of its
13009 initializing value.
13011 In finish_enum we will reset the type. Of course, if we're
13012 processing a template, there may be no value. */
13013 type = value ? TREE_TYPE (value) : NULL_TREE;
13015 if (context && context == current_class_type)
13016 /* This enum declaration is local to the class. We need the full
13017 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13018 decl = build_lang_decl (CONST_DECL, name, type);
13020 /* It's a global enum, or it's local to a function. (Note local to
13021 a function could mean local to a class method. */
13022 decl = build_decl (CONST_DECL, name, type);
13024 DECL_CONTEXT (decl) = FROB_CONTEXT (context);
13025 DECL_INITIAL (decl) = value;
13026 TREE_READONLY (decl) = 1;
13028 if (context && context == current_class_type)
13029 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13030 on the TYPE_FIELDS list for `S'. (That's so that you can say
13031 things like `S::i' later.) */
13032 finish_member_declaration (decl);
13036 GNU_xref_decl (current_function_decl, decl);
13039 /* Add this enumeration constant to the list for this type. */
13040 TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype));
13044 static int function_depth;
13046 /* We're defining DECL. Make sure that it's type is OK. */
13049 check_function_type (decl)
13052 tree fntype = TREE_TYPE (decl);
13054 /* In a function definition, arg types must be complete. */
13055 require_complete_types_for_parms (current_function_parms);
13057 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype))) == NULL_TREE)
13059 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype));
13061 /* Make it return void instead, but don't change the
13062 type of the DECL_RESULT, in case we have a named return value. */
13063 if (TREE_CODE (fntype) == METHOD_TYPE)
13065 tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
13067 = build_cplus_method_type (ctype,
13069 FUNCTION_ARG_CHAIN (decl));
13073 = build_function_type (void_type_node,
13074 TYPE_ARG_TYPES (TREE_TYPE (decl)));
13076 = build_exception_variant (fntype,
13077 TYPE_RAISES_EXCEPTIONS (fntype));
13080 abstract_virtuals_error (decl, TREE_TYPE (fntype));
13083 /* Create the FUNCTION_DECL for a function definition.
13084 DECLSPECS and DECLARATOR are the parts of the declaration;
13085 they describe the function's name and the type it returns,
13086 but twisted together in a fashion that parallels the syntax of C.
13088 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13089 DECLARATOR is really the DECL for the function we are about to
13090 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13091 indicating that the function is an inline defined in-class, and
13092 SF_EXPAND indicating that we should generate RTL for this
13095 This function creates a binding context for the function body
13096 as well as setting up the FUNCTION_DECL in current_function_decl.
13098 Returns 1 on success. If the DECLARATOR is not suitable for a function
13099 (it defines a datum instead), we return 0, which tells
13100 yyparse to report a parse error.
13102 For C++, we must first check whether that datum makes any sense.
13103 For example, "class A local_a(1,2);" means that variable local_a
13104 is an aggregate of type A, which should have a constructor
13105 applied to it with the argument list [1, 2]. */
13108 start_function (declspecs, declarator, attrs, flags)
13109 tree declspecs, declarator, attrs;
13113 tree ctype = NULL_TREE;
13116 extern int have_extern_spec;
13117 extern int used_extern_spec;
13118 int doing_friend = 0;
13119 struct binding_level *bl;
13121 /* Sanity check. */
13122 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
13123 my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
13125 /* This should only be done once on the top most decl. */
13126 if (have_extern_spec && !used_extern_spec)
13128 declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
13129 used_extern_spec = 1;
13132 if (flags & SF_PRE_PARSED)
13134 decl1 = declarator;
13136 fntype = TREE_TYPE (decl1);
13137 if (TREE_CODE (fntype) == METHOD_TYPE)
13138 ctype = TYPE_METHOD_BASETYPE (fntype);
13140 /* ISO C++ 11.4/5. A friend function defined in a class is in
13141 the (lexical) scope of the class in which it is defined. */
13142 if (!ctype && DECL_FRIEND_P (decl1))
13144 ctype = DECL_FRIEND_CONTEXT (decl1);
13146 /* CTYPE could be null here if we're dealing with a template;
13147 for example, `inline friend float foo()' inside a template
13148 will have no CTYPE set. */
13149 if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
13155 last_function_parms = DECL_ARGUMENTS (decl1);
13156 last_function_parm_tags = NULL_TREE;
13160 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL_TREE);
13161 /* If the declarator is not suitable for a function definition,
13162 cause a syntax error. */
13163 if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) return 0;
13165 fntype = TREE_TYPE (decl1);
13167 restype = TREE_TYPE (fntype);
13168 if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
13170 cp_error ("semicolon missing after declaration of `%#T'", restype);
13171 shadow_tag (build_tree_list (NULL_TREE, restype));
13172 CLASSTYPE_GOT_SEMICOLON (restype) = 1;
13173 if (TREE_CODE (fntype) == FUNCTION_TYPE)
13174 fntype = build_function_type (integer_type_node,
13175 TYPE_ARG_TYPES (fntype));
13177 fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
13179 TYPE_ARG_TYPES (fntype));
13180 TREE_TYPE (decl1) = fntype;
13183 if (TREE_CODE (fntype) == METHOD_TYPE)
13184 ctype = TYPE_METHOD_BASETYPE (fntype);
13185 else if (DECL_MAIN_P (decl1))
13187 /* If this doesn't return integer_type, complain. */
13188 if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
13190 if (pedantic || warn_return_type)
13191 pedwarn ("return type for `main' changed to `int'");
13192 TREE_TYPE (decl1) = fntype = default_function_type;
13197 /* Sometimes we don't notice that a function is a static member, and
13198 build a METHOD_TYPE for it. Fix that up now. */
13199 if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1)
13200 && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE)
13202 revert_static_member_fn (decl1);
13203 last_function_parms = TREE_CHAIN (last_function_parms);
13207 /* Warn if function was previously implicitly declared
13208 (but not if we warned then). */
13209 if (! warn_implicit
13210 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
13211 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
13213 /* Set up current_class_type, and enter the scope of the class, if
13216 push_nested_class (ctype, 1);
13217 else if (DECL_STATIC_FUNCTION_P (decl1))
13218 push_nested_class (DECL_CONTEXT (decl1), 2);
13220 /* Now that we have entered the scope of the class, we must restore
13221 the bindings for any template parameters surrounding DECL1, if it
13222 is an inline member template. (Order is important; consider the
13223 case where a template parameter has the same name as a field of
13224 the class.) It is not until after this point that
13225 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13226 if (flags & SF_INCLASS_INLINE)
13227 maybe_begin_member_template_processing (decl1);
13229 /* Effective C++ rule 15. See also c_expand_return. */
13231 && DECL_NAME (decl1) == ansi_opname[(int) MODIFY_EXPR]
13232 && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
13233 cp_warning ("`operator=' should return a reference to `*this'");
13235 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13236 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13237 if (!DECL_INITIAL (decl1))
13238 DECL_INITIAL (decl1) = error_mark_node;
13240 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13241 SET_DEFAULT_DECL_ATTRIBUTES (decl1, attrs);
13244 /* This function exists in static storage.
13245 (This does not mean `static' in the C sense!) */
13246 TREE_STATIC (decl1) = 1;
13248 /* We must call push_template_decl after current_class_type is set
13249 up. (If we are processing inline definitions after exiting a
13250 class scope, current_class_type will be NULL_TREE until set above
13251 by push_nested_class.) */
13252 if (processing_template_decl)
13253 decl1 = push_template_decl (decl1);
13255 /* We are now in the scope of the function being defined. */
13256 current_function_decl = decl1;
13258 /* Save the parm names or decls from this function's declarator
13259 where store_parm_decls will find them. */
13260 current_function_parms = last_function_parms;
13261 current_function_parm_tags = last_function_parm_tags;
13263 /* Make sure the parameter and return types are reasonable. When
13264 you declare a function, these types can be incomplete, but they
13265 must be complete when you define the function. */
13266 if (! processing_template_decl)
13267 check_function_type (decl1);
13269 /* Build the return declaration for the function. */
13270 restype = TREE_TYPE (fntype);
13271 if (!processing_template_decl)
13273 if (!DECL_RESULT (decl1))
13275 DECL_RESULT (decl1)
13276 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13277 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype),
13278 DECL_RESULT (decl1));
13282 /* Just use `void'. Nobody will ever look at this anyhow. */
13283 DECL_RESULT (decl1) = build_decl (RESULT_DECL, 0, void_type_node);
13285 /* Initialize RTL machinery. We cannot do this until
13286 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13287 even when processing a template; this is how we get
13288 CFUN set up, and our per-function variables initialized. */
13289 bl = current_binding_level;
13290 init_function_start (decl1, input_filename, lineno);
13291 current_binding_level = bl;
13292 expanding_p = (flags & SF_EXPAND) != 0;
13294 /* Even though we're inside a function body, we still don't want to
13295 call expand_expr to calculate the size of a variable-sized array.
13296 We haven't necessarily assigned RTL to all variables yet, so it's
13297 not safe to try to expand expressions involving them. */
13298 immediate_size_expand = 0;
13299 cfun->x_dont_save_pending_sizes_p = 1;
13301 /* If we're building a statement-tree, start the tree now. */
13302 if (processing_template_decl || !expanding_p)
13303 begin_stmt_tree (&DECL_SAVED_TREE (decl1));
13305 /* Let the user know we're compiling this function. */
13306 if (processing_template_decl || !building_stmt_tree ())
13307 announce_function (decl1);
13309 /* Record the decl so that the function name is defined.
13310 If we already have a decl for this name, and it is a FUNCTION_DECL,
13311 use the old decl. */
13312 if (!processing_template_decl && !(flags & SF_PRE_PARSED))
13314 /* A specialization is not used to guide overload resolution. */
13315 if ((flag_guiding_decls
13316 || !DECL_TEMPLATE_SPECIALIZATION (decl1))
13317 && ! DECL_FUNCTION_MEMBER_P (decl1))
13318 decl1 = pushdecl (decl1);
13321 /* We need to set the DECL_CONTEXT. */
13322 if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
13323 DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
13324 /* And make sure we have enough default args. */
13325 check_default_args (decl1);
13327 DECL_MAIN_VARIANT (decl1) = decl1;
13328 fntype = TREE_TYPE (decl1);
13331 /* Reset these in case the call to pushdecl changed them. */
13332 current_function_decl = decl1;
13333 cfun->decl = decl1;
13335 /* Initialize the per-function data. */
13336 if (!DECL_PENDING_INLINE_P (decl1) && DECL_SAVED_FUNCTION_DATA (decl1))
13338 /* If we already parsed this function, and we're just expanding it
13339 now, restore saved state. */
13340 struct binding_level *bl = current_binding_level;
13341 *cp_function_chain = *DECL_SAVED_FUNCTION_DATA (decl1);
13342 current_binding_level = bl;
13344 /* This function is being processed in whole-function mode; we
13345 already did semantic analysis. */
13346 cfun->x_whole_function_mode_p = 1;
13348 /* If we decided that we didn't want to inline this function,
13349 make sure the back-end knows that. */
13350 if (!current_function_cannot_inline)
13351 current_function_cannot_inline = cp_function_chain->cannot_inline;
13353 /* We don't need the saved data anymore. */
13354 free (DECL_SAVED_FUNCTION_DATA (decl1));
13355 DECL_SAVED_FUNCTION_DATA (decl1) = NULL;
13357 else if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1))
13359 /* We know that this was set up by `grokclassfn'. We do not
13360 wait until `store_parm_decls', since evil parse errors may
13361 never get us to that point. Here we keep the consistency
13362 between `current_class_type' and `current_class_ptr'. */
13363 tree t = DECL_ARGUMENTS (decl1);
13365 my_friendly_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL,
13367 my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE,
13370 cp_function_chain->x_current_class_ref
13371 = build_indirect_ref (t, NULL_PTR);
13372 cp_function_chain->x_current_class_ptr = t;
13374 /* Constructors and destructors need to know whether they're "in
13375 charge" of initializing virtual base classes. */
13376 if (DECL_DESTRUCTOR_P (decl1))
13377 current_in_charge_parm = TREE_CHAIN (t);
13378 else if (DECL_CONSTRUCTOR_P (decl1)
13380 && DECL_ARTIFICIAL (TREE_CHAIN (t))
13381 && (DECL_NAME (TREE_CHAIN (t))
13382 == in_charge_identifier))
13383 current_in_charge_parm = TREE_CHAIN (t);
13386 if (DECL_INTERFACE_KNOWN (decl1))
13388 tree ctx = decl_function_context (decl1);
13390 if (DECL_NOT_REALLY_EXTERN (decl1))
13391 DECL_EXTERNAL (decl1) = 0;
13393 if (ctx != NULL_TREE && DECL_THIS_INLINE (ctx)
13394 && TREE_PUBLIC (ctx))
13395 /* This is a function in a local class in an extern inline
13397 comdat_linkage (decl1);
13399 /* If this function belongs to an interface, it is public.
13400 If it belongs to someone else's interface, it is also external.
13401 This only affects inlines and template instantiations. */
13402 else if (interface_unknown == 0
13403 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13404 || flag_alt_external_templates))
13406 if (DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1)
13407 || processing_template_decl)
13409 DECL_EXTERNAL (decl1)
13411 || (DECL_THIS_INLINE (decl1) && ! flag_implement_inlines
13412 && !DECL_VINDEX (decl1)));
13414 /* For WIN32 we also want to put these in linkonce sections. */
13415 maybe_make_one_only (decl1);
13418 DECL_EXTERNAL (decl1) = 0;
13419 DECL_NOT_REALLY_EXTERN (decl1) = 0;
13420 DECL_INTERFACE_KNOWN (decl1) = 1;
13422 else if (interface_unknown && interface_only
13423 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13424 || flag_alt_external_templates))
13426 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13427 interface, we will have interface_only set but not
13428 interface_known. In that case, we don't want to use the normal
13429 heuristics because someone will supply a #pragma implementation
13430 elsewhere, and deducing it here would produce a conflict. */
13431 comdat_linkage (decl1);
13432 DECL_EXTERNAL (decl1) = 0;
13433 DECL_INTERFACE_KNOWN (decl1) = 1;
13434 DECL_DEFER_OUTPUT (decl1) = 1;
13438 /* This is a definition, not a reference.
13439 So clear DECL_EXTERNAL. */
13440 DECL_EXTERNAL (decl1) = 0;
13442 if ((DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1))
13443 && ! DECL_INTERFACE_KNOWN (decl1)
13444 /* Don't try to defer nested functions for now. */
13445 && ! decl_function_context (decl1))
13446 DECL_DEFER_OUTPUT (decl1) = 1;
13448 DECL_INTERFACE_KNOWN (decl1) = 1;
13451 if (doing_semantic_analysis_p ())
13454 current_binding_level->parm_flag = 1;
13458 cplus_decl_attributes (decl1, NULL_TREE, attrs);
13460 if (!building_stmt_tree ())
13462 GNU_xref_function (decl1, current_function_parms);
13463 make_function_rtl (decl1);
13466 /* Promote the value to int before returning it. */
13467 if (C_PROMOTING_INTEGER_TYPE_P (restype))
13468 restype = type_promotes_to (restype);
13470 /* If this fcn was already referenced via a block-scope `extern' decl
13471 (or an implicit decl), propagate certain information about the usage. */
13472 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1)))
13473 TREE_ADDRESSABLE (decl1) = 1;
13475 if (DECL_RESULT (decl1) == NULL_TREE)
13477 DECL_RESULT (decl1)
13478 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13479 TREE_READONLY (DECL_RESULT (decl1)) = CP_TYPE_CONST_P (restype);
13480 TREE_THIS_VOLATILE (DECL_RESULT (decl1)) = CP_TYPE_VOLATILE_P (restype);
13485 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1))
13486 && DECL_LANGUAGE (decl1) == lang_cplusplus)
13488 dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13489 DECL_CONTEXT (dtor_label) = current_function_decl;
13491 else if (DECL_CONSTRUCTOR_P (decl1))
13493 ctor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13494 DECL_CONTEXT (ctor_label) = current_function_decl;
13500 /* Called after store_parm_decls for a function-try-block. */
13503 expand_start_early_try_stmts ()
13505 expand_start_try_stmts ();
13508 /* Store the parameter declarations into the current function declaration.
13509 This is called after parsing the parameter declarations, before
13510 digesting the body of the function.
13512 Also install to binding contour return value identifier, if any. */
13515 store_parm_decls ()
13517 register tree fndecl = current_function_decl;
13518 register tree parm;
13519 int parms_have_cleanups = 0;
13520 tree cleanups = NULL_TREE;
13522 /* This is a list of types declared among parms in a prototype. */
13523 tree parmtags = current_function_parm_tags;
13525 /* This is a chain of any other decls that came in among the parm
13526 declarations. If a parm is declared with enum {foo, bar} x;
13527 then CONST_DECLs for foo and bar are put here. */
13528 tree nonparms = NULL_TREE;
13530 /* Create a binding level for the parms. */
13531 if (!building_stmt_tree ())
13532 expand_start_bindings (2);
13534 if (current_function_parms)
13536 /* This case is when the function was defined with an ANSI prototype.
13537 The parms already have decls, so we need not do anything here
13538 except record them as in effect
13539 and complain if any redundant old-style parm decls were written. */
13541 tree specparms = current_function_parms;
13544 if (doing_semantic_analysis_p ())
13546 /* Must clear this because it might contain TYPE_DECLs declared
13548 storedecls (NULL_TREE);
13550 /* If we're doing semantic analysis, then we'll call pushdecl
13551 for each of these. We must do them in reverse order so that
13552 they end in the correct forward order. */
13553 specparms = nreverse (specparms);
13556 for (parm = specparms; parm; parm = next)
13558 next = TREE_CHAIN (parm);
13559 if (TREE_CODE (parm) == PARM_DECL)
13561 tree type = TREE_TYPE (parm);
13563 if (doing_semantic_analysis_p ())
13567 if (DECL_NAME (parm) == NULL_TREE
13568 || TREE_CODE (parm) != VOID_TYPE)
13571 cp_error ("parameter `%D' declared void", parm);
13573 cleanup = (processing_template_decl
13575 : maybe_build_cleanup (parm));
13578 cleanups = tree_cons (parm, cleanup, cleanups);
13580 else if (type != error_mark_node
13581 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
13582 parms_have_cleanups = 1;
13586 /* If we find an enum constant or a type tag,
13587 put it aside for the moment. */
13588 TREE_CHAIN (parm) = NULL_TREE;
13589 nonparms = chainon (nonparms, parm);
13593 if (doing_semantic_analysis_p ())
13595 /* Get the decls in their original chain order
13596 and record in the function. This is all and only the
13597 PARM_DECLs that were pushed into scope by the loop above. */
13598 DECL_ARGUMENTS (fndecl) = getdecls ();
13599 storetags (chainon (parmtags, gettags ()));
13603 DECL_ARGUMENTS (fndecl) = NULL_TREE;
13605 /* Now store the final chain of decls for the arguments
13606 as the decl-chain of the current lexical scope.
13607 Put the enumerators in as well, at the front so that
13608 DECL_ARGUMENTS is not modified. */
13609 if (doing_semantic_analysis_p ())
13610 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
13612 /* Initialize the RTL code for the function. */
13613 DECL_SAVED_INSNS (fndecl) = 0;
13614 if (! building_stmt_tree ())
13615 expand_function_start (fndecl, parms_have_cleanups);
13617 current_function_parms_stored = 1;
13619 /* If this function is `main', emit a call to `__main'
13620 to run global initializers, etc. */
13621 if (DECL_MAIN_P (fndecl) && !building_stmt_tree ())
13622 expand_main_function ();
13624 /* Now that we have initialized the parms, we can start their
13625 cleanups. We cannot do this before, since expand_decl_cleanup
13626 should not be called before the parm can be used. */
13629 finish_decl_cleanup (TREE_PURPOSE (cleanups),
13630 TREE_VALUE (cleanups));
13631 cleanups = TREE_CHAIN (cleanups);
13634 /* Create a binding contour which can be used to catch
13635 cleanup-generated temporaries. Also, if the return value needs or
13636 has initialization, deal with that now. */
13637 if (parms_have_cleanups)
13640 if (!building_stmt_tree ())
13641 expand_start_bindings (2);
13644 /* Do the starting of the exception specifications, if we have any. */
13645 if (flag_exceptions && !processing_template_decl
13646 && flag_enforce_eh_specs
13647 && building_stmt_tree ()
13648 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13649 current_eh_spec_try_block = expand_start_eh_spec ();
13652 /* Bind a name and initialization to the return value of
13653 the current function. */
13656 store_return_init (decl)
13659 /* If this named return value comes in a register, put it in a
13660 pseudo-register. */
13661 if (DECL_REGISTER (decl))
13663 original_result_rtx = DECL_RTL (decl);
13664 /* Note that the mode of the old DECL_RTL may be wider than the
13665 mode of DECL_RESULT, depending on the calling conventions for
13666 the processor. For example, on the Alpha, a 32-bit integer
13667 is returned in a DImode register -- the DECL_RESULT has
13668 SImode but the DECL_RTL for the DECL_RESULT has DImode. So,
13669 here, we use the mode the back-end has already assigned for
13670 the return value. */
13671 DECL_RTL (decl) = gen_reg_rtx (GET_MODE (original_result_rtx));
13676 /* We have finished doing semantic analysis on DECL, but have not yet
13677 generated RTL for its body. Save away our current state, so that
13678 when we want to generate RTL later we know what to do. */
13681 save_function_data (decl)
13684 struct language_function *f;
13686 /* Save the language-specific per-function data so that we can
13687 get it back when we really expand this function. */
13688 my_friendly_assert (!DECL_PENDING_INLINE_P (decl),
13692 f = ((struct language_function *)
13693 xmalloc (sizeof (struct language_function)));
13694 bcopy ((char *) cp_function_chain, (char *) f,
13695 sizeof (struct language_function));
13696 DECL_SAVED_FUNCTION_DATA (decl) = f;
13698 /* Clear out the bits we don't need. */
13699 f->x_base_init_list = NULL_TREE;
13700 f->x_member_init_list = NULL_TREE;
13701 f->x_stmt_tree.x_last_stmt = NULL_TREE;
13702 f->x_stmt_tree.x_last_expr_type = NULL_TREE;
13703 f->x_result_rtx = NULL_RTX;
13704 f->x_named_label_uses = NULL;
13705 f->bindings = NULL;
13707 /* When we get back here again, we will be expanding. */
13708 f->x_expanding_p = 1;
13710 /* If we've already decided that we cannot inline this function, we
13711 must remember that fact when we actually go to expand the
13713 f->cannot_inline = current_function_cannot_inline;
13716 /* At the end of every constructor we generate to code to return
13717 `this'. Do that now. */
13720 finish_constructor_body ()
13722 /* Any return from a constructor will end up here. */
13723 add_tree (build_min_nt (LABEL_STMT, ctor_label));
13725 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13726 generate the return, rather than a goto to CTOR_LABEL. */
13727 ctor_label = NULL_TREE;
13728 /* In check_return_expr we translate an empty return from a
13729 constructor to a return of `this'. */
13730 finish_return_stmt (NULL_TREE);
13731 /* Mark the end of the constructor. */
13732 add_tree (build_min_nt (CTOR_STMT));
13735 /* At the end of every destructor we generate code to restore virtual
13736 function tables to the values desired by base classes and to call
13737 to base class destructors. Do that now. */
13740 finish_destructor_body ()
13742 tree compound_stmt;
13747 /* Create a block to contain all the extra code. */
13748 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
13750 /* Any return from a destructor will end up here. */
13751 add_tree (build_min_nt (LABEL_STMT, dtor_label));
13753 /* Generate the code to call destructor on base class. If this
13754 destructor belongs to a class with virtual functions, then set
13755 the virtual function table pointer to represent the type of our
13758 /* This side-effect makes call to `build_delete' generate the code
13759 we have to have at the end of this destructor. `build_delete'
13760 will set the flag again. */
13761 TYPE_HAS_DESTRUCTOR (current_class_type) = 0;
13763 /* These are two cases where we cannot delegate deletion. */
13764 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)
13765 || TYPE_GETS_REG_DELETE (current_class_type))
13766 in_charge = integer_zero_node;
13768 in_charge = current_in_charge_parm;
13770 exprstmt = build_delete (current_class_type,
13773 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
13776 if (exprstmt != error_mark_node
13777 && (TREE_CODE (exprstmt) != NOP_EXPR
13778 || TREE_OPERAND (exprstmt, 0) != integer_zero_node
13779 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)))
13781 if (exprstmt != void_zero_node)
13782 /* Don't call `expand_expr_stmt' if we're not going to do
13783 anything, since -Wall will give a diagnostic. */
13784 finish_expr_stmt (exprstmt);
13786 /* Run destructors for all virtual baseclasses. */
13787 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13789 tree vbases = nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type)));
13790 tree if_stmt = begin_if_stmt ();
13791 finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
13792 current_in_charge_parm,
13798 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbases)))
13800 tree vb = get_vbase
13801 (BINFO_TYPE (vbases),
13802 TYPE_BINFO (current_class_type));
13804 (build_scoped_method_call
13805 (current_class_ref, vb, dtor_identifier,
13806 build_tree_list (NULL_TREE, integer_zero_node)));
13808 vbases = TREE_CHAIN (vbases);
13811 finish_then_clause (if_stmt);
13816 virtual_size = c_sizeof (current_class_type);
13818 /* At the end, call delete if that's what's requested. */
13820 /* FDIS sez: At the point of definition of a virtual destructor
13821 (including an implicit definition), non-placement operator delete
13822 shall be looked up in the scope of the destructor's class and if
13823 found shall be accessible and unambiguous.
13825 This is somewhat unclear, but I take it to mean that if the class
13826 only defines placement deletes we don't do anything here. So we
13827 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13828 they ever try to delete one of these. */
13829 if (TYPE_GETS_REG_DELETE (current_class_type)
13830 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13834 exprstmt = build_op_delete_call
13835 (DELETE_EXPR, current_class_ptr, virtual_size,
13836 LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
13838 if_stmt = begin_if_stmt ();
13839 finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
13840 current_in_charge_parm,
13843 finish_expr_stmt (exprstmt);
13844 finish_then_clause (if_stmt);
13848 /* Close the block we started above. */
13849 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
13852 /* Finish up a function declaration and compile that function
13853 all the way to assembler language output. The free the storage
13854 for the function definition.
13856 This is called after parsing the body of the function definition.
13857 LINENO is the current line number.
13859 FLAGS is a bitwise or of the following values:
13861 An extra call to poplevel (and expand_end_bindings) must be
13862 made to take care of the binding contour for the base
13863 initializers. This is only relevant for constructors.
13865 We just finished processing the body of an in-class inline
13866 function definition. (This processing will have taken place
13867 after the class definition is complete.) */
13870 finish_function (lineno, flags)
13874 register tree fndecl = current_function_decl;
13875 tree fntype, ctype = NULL_TREE;
13876 /* Label to use if this function is supposed to return a value. */
13877 tree no_return_label = NULL_TREE;
13878 int call_poplevel = (flags & 1) != 0;
13879 int inclass_inline = (flags & 2) != 0;
13883 /* When we get some parse errors, we can end up without a
13884 current_function_decl, so cope. */
13885 if (fndecl == NULL_TREE)
13886 return error_mark_node;
13888 nested = function_depth > 1;
13889 fntype = TREE_TYPE (fndecl);
13891 /* TREE_READONLY (fndecl) = 1;
13892 This caused &foo to be of type ptr-to-const-function
13893 which then got a warning when stored in a ptr-to-function variable. */
13895 /* This happens on strange parse errors. */
13896 if (! current_function_parms_stored)
13899 store_parm_decls ();
13902 if (building_stmt_tree ())
13904 if (DECL_CONSTRUCTOR_P (fndecl))
13906 finish_constructor_body ();
13910 else if (DECL_DESTRUCTOR_P (fndecl) && !processing_template_decl)
13911 finish_destructor_body ();
13912 else if (DECL_MAIN_P (fndecl))
13914 /* Make it so that `main' always returns 0 by default. */
13916 finish_return_stmt (integer_one_node);
13918 finish_return_stmt (integer_zero_node);
13922 /* Finish dealing with exception specifiers. */
13923 if (flag_exceptions && !processing_template_decl
13924 && flag_enforce_eh_specs
13925 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13926 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13927 (TREE_TYPE (current_function_decl)),
13928 current_eh_spec_try_block);
13933 if (write_symbols != NO_DEBUG /*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13935 /* Keep this code around in case we later want to control debug info
13936 based on whether a type is "used". (jason 1999-11-11) */
13938 tree ttype = target_type (fntype);
13941 if (IS_AGGR_TYPE (ttype))
13942 /* Let debugger know it should output info for this type. */
13943 note_debug_info_needed (ttype);
13945 for (parmdecl = DECL_ARGUMENTS (fndecl); parmdecl; parmdecl = TREE_CHAIN (parmdecl))
13947 ttype = target_type (TREE_TYPE (parmdecl));
13948 if (IS_AGGR_TYPE (ttype))
13949 /* Let debugger know it should output info for this type. */
13950 note_debug_info_needed (ttype);
13955 /* Clean house because we will need to reorder insns here. */
13956 do_pending_stack_adjust ();
13960 else if (DECL_CONSTRUCTOR_P (fndecl))
13965 else if (return_label != NULL_RTX
13966 && flag_this_is_variable <= 0
13967 && current_function_return_value == NULL_TREE
13968 && ! DECL_NAME (DECL_RESULT (current_function_decl)))
13969 no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13971 if (flag_exceptions)
13972 expand_exception_blocks ();
13974 /* If this function is supposed to return a value, ensure that
13975 we do not fall into the cleanups by mistake. The end of our
13976 function will look like this:
13978 user code (may have return stmt somewhere)
13979 goto no_return_label
13984 NOTE_INSN_FUNCTION_END
13988 If the user omits a return stmt in the USER CODE section, we
13989 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13990 Otherwise, we won't. */
13991 if (no_return_label)
13993 DECL_CONTEXT (no_return_label) = fndecl;
13994 DECL_INITIAL (no_return_label) = error_mark_node;
13995 DECL_SOURCE_FILE (no_return_label) = input_filename;
13996 DECL_SOURCE_LINE (no_return_label) = lineno;
13997 expand_goto (no_return_label);
14002 /* Remove the binding contour which is used
14003 to catch cleanup-generated temporaries. */
14004 expand_end_bindings (0, 0, 0);
14005 poplevel (0, 0, 0);
14007 /* Emit label at beginning of cleanup code for parameters. */
14008 emit_label (cleanup_label);
14011 /* Get return value into register if that's where it's supposed
14013 if (original_result_rtx)
14014 fixup_result_decl (DECL_RESULT (fndecl), original_result_rtx);
14016 /* Finish building code that will trigger warnings if users forget
14017 to make their functions return values. */
14018 if (no_return_label || cleanup_label)
14019 emit_jump (return_label);
14020 if (no_return_label)
14022 /* We don't need to call `expand_*_return' here because we
14023 don't need any cleanups here--this path of code is only
14024 for error checking purposes. */
14025 expand_label (no_return_label);
14028 /* We hard-wired immediate_size_expand to zero in
14029 start_function. Expand_function_end will decrement this
14030 variable. So, we set the variable to one here, so that after
14031 the decrement it will remain zero. */
14032 immediate_size_expand = 1;
14034 /* Generate rtl for function exit. */
14035 expand_function_end (input_filename, lineno, 1);
14038 /* We have to save this value here in case
14039 maybe_end_member_template_processing decides to pop all the
14040 template parameters. */
14041 expand_p = !building_stmt_tree ();
14043 /* If we're saving up tree structure, tie off the function now. */
14045 finish_stmt_tree (&DECL_SAVED_TREE (fndecl));
14047 /* This must come after expand_function_end because cleanups might
14048 have declarations (from inline functions) that need to go into
14049 this function's blocks. */
14050 if (doing_semantic_analysis_p ())
14052 if (current_binding_level->parm_flag != 1)
14053 my_friendly_abort (122);
14054 poplevel (1, 0, 1);
14057 /* Remember that we were in class scope. */
14058 if (current_class_name)
14059 ctype = current_class_type;
14061 /* Must mark the RESULT_DECL as being in this function. */
14062 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
14064 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14065 to the FUNCTION_DECL node itself. */
14066 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
14068 /* Save away current state, if appropriate. */
14069 if (!expanding_p && !processing_template_decl)
14070 save_function_data (fndecl);
14072 /* If this function calls `setjmp' it cannot be inlined. When
14073 `longjmp' is called it is not guaranteed to restore the value of
14074 local variables that have been modified since the call to
14075 `setjmp'. So, if were to inline this function into some caller
14076 `c', then when we `longjmp', we might not restore all variables
14077 in `c'. (It might seem, at first blush, that there's no way for
14078 this function to modify local variables in `c', but their
14079 addresses may have been stored somewhere accessible to this
14081 if (!expanding_p && !processing_template_decl && calls_setjmp_p (fndecl))
14082 DECL_UNINLINABLE (fndecl) = 1;
14089 /* So we can tell if jump_optimize sets it to 1. */
14092 /* Before we call rest_of_compilation (which will pop the
14093 CURRENT_FUNCTION), we must save these values. */
14094 returns_null = current_function_returns_null;
14095 returns_value = current_function_returns_value;
14097 /* If this is a nested function (like a template instantiation
14098 that we're compiling in the midst of compiling something
14099 else), push a new GC context. That will keep local variables
14100 on the stack from being collected while we're doing the
14101 compilation of this function. */
14102 if (function_depth > 1)
14103 ggc_push_context ();
14105 /* Run the optimizers and output the assembler code for this
14107 if (DECL_ARTIFICIAL (fndecl))
14109 /* Do we really *want* to inline this synthesized method? */
14111 int save_fif = flag_inline_functions;
14112 flag_inline_functions = 1;
14114 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
14115 will check our size. */
14116 DECL_INLINE (fndecl) = 0;
14118 rest_of_compilation (fndecl);
14119 flag_inline_functions = save_fif;
14122 rest_of_compilation (fndecl);
14124 /* Undo the call to ggc_push_context above. */
14125 if (function_depth > 1)
14126 ggc_pop_context ();
14128 if (DECL_SAVED_INSNS (fndecl) && ! TREE_ASM_WRITTEN (fndecl))
14130 /* Set DECL_EXTERNAL so that assemble_external will be called as
14131 necessary. We'll clear it again in finish_file. */
14132 if (! DECL_EXTERNAL (fndecl))
14133 DECL_NOT_REALLY_EXTERN (fndecl) = 1;
14134 DECL_EXTERNAL (fndecl) = 1;
14135 mark_inline_for_output (fndecl);
14139 /* Keep this code around in case we later want to control debug info
14140 based on whether a type is "used". (jason 1999-11-11) */
14142 if (ctype && TREE_ASM_WRITTEN (fndecl))
14143 note_debug_info_needed (ctype);
14146 returns_null |= can_reach_end;
14148 /* Since we don't normally go through c_expand_return for constructors,
14149 this normally gets the wrong value.
14150 Also, named return values have their return codes emitted after
14151 NOTE_INSN_FUNCTION_END, confusing jump.c. */
14152 if (DECL_CONSTRUCTOR_P (fndecl)
14153 || DECL_NAME (DECL_RESULT (fndecl)) != NULL_TREE)
14156 if (TREE_THIS_VOLATILE (fndecl) && returns_null)
14157 cp_warning ("`noreturn' function `%D' does return", fndecl);
14158 else if ((warn_return_type || pedantic)
14160 && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE)
14162 /* If this function returns non-void and control can drop through,
14164 cp_warning ("control reaches end of non-void function `%D'", fndecl);
14166 /* With just -W, complain only if function returns both with
14167 and without a value. */
14168 else if (extra_warnings && returns_value && returns_null)
14169 warning ("this function may return with or without a value");
14173 /* Clear out memory we no longer need. */
14174 free_after_parsing (cfun);
14175 /* Since we never call rest_of_compilation, we never clear
14176 CFUN. Do so explicitly. */
14177 free_after_compilation (cfun);
14181 /* If this is a in-class inline definition, we may have to pop the
14182 bindings for the template parameters that we added in
14183 maybe_begin_member_template_processing when start_function was
14185 if (inclass_inline)
14186 maybe_end_member_template_processing ();
14188 /* Leave the scope of the class. */
14190 pop_nested_class ();
14194 if (!DECL_SAVED_INSNS (fndecl) && !DECL_SAVED_FUNCTION_DATA (fndecl)
14195 && !(flag_inline_trees && DECL_INLINE (fndecl)))
14199 /* Stop pointing to the local nodes about to be freed. */
14200 /* But DECL_INITIAL must remain nonzero so we know this
14201 was an actual function definition. */
14202 DECL_INITIAL (fndecl) = error_mark_node;
14203 for (t = DECL_ARGUMENTS (fndecl); t; t = TREE_CHAIN (t))
14204 DECL_RTL (t) = DECL_INCOMING_RTL (t) = NULL_RTX;
14207 if (DECL_STATIC_CONSTRUCTOR (fndecl))
14208 static_ctors = tree_cons (NULL_TREE, fndecl, static_ctors);
14209 if (DECL_STATIC_DESTRUCTOR (fndecl))
14210 static_dtors = tree_cons (NULL_TREE, fndecl, static_dtors);
14215 /* Let the error reporting routines know that we're outside a
14216 function. For a nested function, this value is used in
14217 pop_cp_function_context and then reset via pop_function_context. */
14218 current_function_decl = NULL_TREE;
14219 /* We don't really care about obstacks, but the middle-end
14220 sometimes cares on what obstck things are located. */
14221 permanent_allocation (1);
14227 /* Create the FUNCTION_DECL for a function definition.
14228 DECLSPECS and DECLARATOR are the parts of the declaration;
14229 they describe the return type and the name of the function,
14230 but twisted together in a fashion that parallels the syntax of C.
14232 This function creates a binding context for the function body
14233 as well as setting up the FUNCTION_DECL in current_function_decl.
14235 Returns a FUNCTION_DECL on success.
14237 If the DECLARATOR is not suitable for a function (it defines a datum
14238 instead), we return 0, which tells yyparse to report a parse error.
14240 May return void_type_node indicating that this method is actually
14241 a friend. See grokfield for more details.
14243 Came here with a `.pushlevel' .
14245 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14246 CHANGES TO CODE IN `grokfield'. */
14249 start_method (declspecs, declarator, attrlist)
14250 tree declarator, declspecs, attrlist;
14252 tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
14255 /* Something too ugly to handle. */
14256 if (fndecl == NULL_TREE)
14259 /* Pass friends other than inline friend functions back. */
14260 if (fndecl == void_type_node)
14263 if (TREE_CODE (fndecl) != FUNCTION_DECL)
14264 /* Not a function, tell parser to report parse error. */
14267 if (DECL_IN_AGGR_P (fndecl))
14269 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
14271 if (DECL_CONTEXT (fndecl)
14272 && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
14273 cp_error ("`%D' is already defined in class %s", fndecl,
14274 TYPE_NAME_STRING (DECL_CONTEXT (fndecl)));
14276 return void_type_node;
14279 check_template_shadow (fndecl);
14281 DECL_THIS_INLINE (fndecl) = 1;
14283 if (flag_default_inline)
14284 DECL_INLINE (fndecl) = 1;
14286 /* We process method specializations in finish_struct_1. */
14287 if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
14288 fndecl = push_template_decl (fndecl);
14290 /* We read in the parameters on the maybepermanent_obstack,
14291 but we won't be getting back to them until after we
14292 may have clobbered them. So the call to preserve_data
14293 will keep them safe. */
14296 if (! DECL_FRIEND_P (fndecl))
14298 if (TREE_CHAIN (fndecl))
14300 fndecl = copy_node (fndecl);
14301 TREE_CHAIN (fndecl) = NULL_TREE;
14304 if (DECL_CONSTRUCTOR_P (fndecl))
14306 if (! grok_ctor_properties (current_class_type, fndecl))
14307 return void_type_node;
14309 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl)))
14310 grok_op_properties (fndecl, DECL_VIRTUAL_P (fndecl), 0);
14313 cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0);
14315 /* Make a place for the parms */
14317 current_binding_level->parm_flag = 1;
14319 DECL_IN_AGGR_P (fndecl) = 1;
14323 /* Go through the motions of finishing a function definition.
14324 We don't compile this method until after the whole class has
14327 FINISH_METHOD must return something that looks as though it
14328 came from GROKFIELD (since we are defining a method, after all).
14330 This is called after parsing the body of the function definition.
14331 STMTS is the chain of statements that makes up the function body.
14333 DECL is the ..._DECL that `start_method' provided. */
14336 finish_method (decl)
14339 register tree fndecl = decl;
14342 register tree link;
14344 if (decl == void_type_node)
14347 old_initial = DECL_INITIAL (fndecl);
14349 /* Undo the level for the parms (from start_method).
14350 This is like poplevel, but it causes nothing to be
14351 saved. Saving information here confuses symbol-table
14352 output routines. Besides, this information will
14353 be correctly output when this method is actually
14356 /* Clear out the meanings of the local variables of this level;
14357 also record in each decl which block it belongs to. */
14359 for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
14361 if (DECL_NAME (link) != NULL_TREE)
14362 pop_binding (DECL_NAME (link), link);
14363 my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
14364 DECL_CONTEXT (link) = NULL_TREE;
14367 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
14368 (HOST_WIDE_INT) current_binding_level->level_chain,
14369 current_binding_level->parm_flag,
14370 current_binding_level->keep);
14372 poplevel (0, 0, 0);
14374 DECL_INITIAL (fndecl) = old_initial;
14376 /* We used to check if the context of FNDECL was different from
14377 current_class_type as another way to get inside here. This didn't work
14378 for String.cc in libg++. */
14379 if (DECL_FRIEND_P (fndecl))
14381 CLASSTYPE_INLINE_FRIENDS (current_class_type)
14382 = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
14383 decl = void_type_node;
14389 /* Called when a new struct TYPE is defined.
14390 If this structure or union completes the type of any previous
14391 variable declaration, lay it out and output its rtl. */
14394 hack_incomplete_structures (type)
14398 struct binding_level *level;
14400 if (!type) /* Don't do this for class templates. */
14403 if (namespace_bindings_p ())
14406 list = &namespace_scope_incomplete;
14410 level = innermost_nonclass_level ();
14411 list = &level->incomplete;
14418 tree decl = TREE_VALUE (*list);
14419 if ((decl && TREE_TYPE (decl) == type)
14420 || (TREE_TYPE (decl)
14421 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14422 && TREE_TYPE (TREE_TYPE (decl)) == type))
14424 int toplevel = toplevel_bindings_p ();
14425 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14426 && TREE_TYPE (TREE_TYPE (decl)) == type)
14427 layout_type (TREE_TYPE (decl));
14428 layout_decl (decl, 0);
14429 rest_of_decl_compilation (decl, NULL_PTR, toplevel, 0);
14433 expand_decl (decl);
14434 cleanup = maybe_build_cleanup (decl);
14435 expand_decl_init (decl);
14436 if (! expand_decl_cleanup (decl, cleanup))
14437 cp_error ("parser lost in parsing declaration of `%D'",
14440 *list = TREE_CHAIN (*list);
14443 list = &TREE_CHAIN (*list);
14446 /* Keep looking through artificial binding levels generated
14447 for local variables. */
14448 if (level && level->keep == 2)
14450 level = level->level_chain;
14451 list = &level->incomplete;
14458 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14459 See build_delete for information about AUTO_DELETE.
14461 Don't build these on the momentary obstack; they must live
14462 the life of the binding contour. */
14465 maybe_build_cleanup_1 (decl, auto_delete)
14466 tree decl, auto_delete;
14468 tree type = TREE_TYPE (decl);
14469 if (type != error_mark_node && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
14471 int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14474 if (TREE_CODE (type) == ARRAY_TYPE)
14478 mark_addressable (decl);
14479 rval = build_unary_op (ADDR_EXPR, decl, 0);
14482 /* Optimize for space over speed here. */
14483 if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14484 || flag_expensive_optimizations)
14485 flags |= LOOKUP_NONVIRTUAL;
14487 rval = build_delete (TREE_TYPE (rval), rval, auto_delete, flags, 0);
14489 if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14490 && ! TYPE_HAS_DESTRUCTOR (type))
14491 rval = build_compound_expr (tree_cons (NULL_TREE, rval,
14492 build_tree_list (NULL_TREE, build_vbase_delete (type, decl))));
14499 /* If DECL is of a type which needs a cleanup, build that cleanup
14500 here. The cleanup does free the storage with a call to delete. */
14503 maybe_build_cleanup_and_delete (decl)
14506 return maybe_build_cleanup_1 (decl, integer_three_node);
14509 /* If DECL is of a type which needs a cleanup, build that cleanup
14510 here. The cleanup does not free the storage with a call a delete. */
14513 maybe_build_cleanup (decl)
14516 return maybe_build_cleanup_1 (decl, integer_two_node);
14519 /* Expand a C++ expression at the statement level.
14520 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14521 The C++ type checker should get all of these out when
14522 expressions are combined with other, type-providing, expressions,
14523 leaving only orphan expressions, such as:
14525 &class::bar; / / takes its address, but does nothing with it. */
14528 cplus_expand_expr_stmt (exp)
14531 if (stmts_are_full_exprs_p)
14532 exp = convert_to_void (exp, "statement");
14535 /* We should do this eventually, but right now this causes regex.o from
14536 libg++ to miscompile, and tString to core dump. */
14537 exp = build1 (CLEANUP_POINT_EXPR, TREE_TYPE (exp), exp);
14540 /* If we don't do this, we end up down inside expand_expr
14541 trying to do TYPE_MODE on the ERROR_MARK, and really
14542 go outside the bounds of the type. */
14543 if (exp != error_mark_node)
14544 expand_expr_stmt (exp);
14547 /* When a stmt has been parsed, this function is called. */
14552 /* Always assume this statement was not an expression statement. If
14553 it actually was an expression statement, its our callers
14554 responsibility to fix this up. */
14555 last_expr_type = NULL_TREE;
14558 /* DECL was originally constructed as a non-static member function,
14559 but turned out to be static. Update it accordingly. */
14562 revert_static_member_fn (decl)
14566 tree function = TREE_TYPE (decl);
14567 tree args = TYPE_ARG_TYPES (function);
14569 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args)))
14570 != TYPE_UNQUALIFIED)
14571 cp_error ("static member function `%#D' declared with type qualifiers",
14574 args = TREE_CHAIN (args);
14575 tmp = build_function_type (TREE_TYPE (function), args);
14576 tmp = build_qualified_type (tmp, CP_TYPE_QUALS (function));
14577 tmp = build_exception_variant (tmp,
14578 TYPE_RAISES_EXCEPTIONS (function));
14579 TREE_TYPE (decl) = tmp;
14580 if (DECL_ARGUMENTS (decl))
14581 DECL_ARGUMENTS (decl) = TREE_CHAIN (DECL_ARGUMENTS (decl));
14582 DECL_STATIC_FUNCTION_P (decl) = 1;
14585 /* Initialize the variables used during compilation of a C++
14589 push_cp_function_context (f)
14590 struct function *f;
14592 struct language_function *p
14593 = ((struct language_function *)
14594 xcalloc (1, sizeof (struct language_function)));
14597 /* It takes an explicit call to expand_body to generate RTL for a
14601 /* Whenever we start a new function, we destroy temporaries in the
14603 stmts_are_full_exprs_p = 1;
14606 /* Free the language-specific parts of F, now that we've finished
14607 compiling the function. */
14610 pop_cp_function_context (f)
14611 struct function *f;
14614 free (f->language);
14618 /* Mark P for GC. */
14621 mark_lang_function (p)
14622 struct language_function *p;
14627 ggc_mark_tree (p->x_named_labels);
14628 ggc_mark_tree (p->x_ctor_label);
14629 ggc_mark_tree (p->x_dtor_label);
14630 ggc_mark_tree (p->x_base_init_list);
14631 ggc_mark_tree (p->x_member_init_list);
14632 ggc_mark_tree (p->x_current_class_ptr);
14633 ggc_mark_tree (p->x_current_class_ref);
14634 ggc_mark_tree (p->x_eh_spec_try_block);
14635 ggc_mark_tree (p->x_scope_stmt_stack);
14637 ggc_mark_rtx (p->x_result_rtx);
14639 mark_stmt_tree (&p->x_stmt_tree);
14640 mark_binding_level (&p->bindings);
14643 /* Mark the language-specific data in F for GC. */
14646 mark_cp_function_context (f)
14647 struct function *f;
14649 mark_lang_function (f->language);
14655 return function_depth != 0;
14660 lang_mark_false_label_stack (l)
14661 struct label_node *l;
14663 /* C++ doesn't use false_label_stack. It better be NULL. */
14664 my_friendly_assert (l == NULL, 19990904);
14671 enum tree_code code = TREE_CODE (t);
14672 if (code == IDENTIFIER_NODE)
14674 struct lang_identifier *li = (struct lang_identifier *) t;
14675 struct lang_id2 *li2 = li->x;
14676 ggc_mark_tree (li->namespace_bindings);
14677 ggc_mark_tree (li->bindings);
14678 ggc_mark_tree (li->class_value);
14679 ggc_mark_tree (li->class_template_info);
14683 ggc_mark_tree (li2->label_value);
14684 ggc_mark_tree (li2->implicit_decl);
14685 ggc_mark_tree (li2->error_locus);
14688 else if (code == CPLUS_BINDING)
14690 if (BINDING_HAS_LEVEL_P (t))
14691 mark_binding_level (&BINDING_LEVEL (t));
14693 ggc_mark_tree (BINDING_SCOPE (t));
14694 ggc_mark_tree (BINDING_VALUE (t));
14696 else if (code == OVERLOAD)
14697 ggc_mark_tree (OVL_FUNCTION (t));
14698 else if (code == TEMPLATE_PARM_INDEX)
14699 ggc_mark_tree (TEMPLATE_PARM_DECL (t));
14700 else if (TREE_CODE_CLASS (code) == 'd')
14702 struct lang_decl *ld = DECL_LANG_SPECIFIC (t);
14707 if (!DECL_GLOBAL_CTOR_P (t) && !DECL_GLOBAL_DTOR_P (t))
14708 ggc_mark_tree (ld->decl_flags.u2.access);
14709 ggc_mark_tree (ld->decl_flags.context);
14710 if (TREE_CODE (t) != NAMESPACE_DECL)
14711 ggc_mark_tree (ld->decl_flags.u.template_info);
14713 mark_binding_level (&NAMESPACE_LEVEL (t));
14714 if (CAN_HAVE_FULL_LANG_DECL_P (t))
14716 ggc_mark_tree (ld->main_decl_variant);
14717 ggc_mark_tree (ld->befriending_classes);
14718 ggc_mark_tree (ld->saved_tree);
14719 if (TREE_CODE (t) == TYPE_DECL)
14720 ggc_mark_tree (ld->u.sorted_fields);
14721 else if (TREE_CODE (t) == FUNCTION_DECL
14722 && !DECL_PENDING_INLINE_P (t))
14723 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t));
14727 else if (TREE_CODE_CLASS (code) == 't')
14729 struct lang_type *lt = TYPE_LANG_SPECIFIC (t);
14731 if (lt && !(TREE_CODE (t) == POINTER_TYPE
14732 && TREE_CODE (TREE_TYPE (t)) == METHOD_TYPE))
14735 ggc_mark_tree (lt->vfields);
14736 ggc_mark_tree (lt->vbases);
14737 ggc_mark_tree (lt->tags);
14738 ggc_mark_tree (lt->search_slot);
14739 ggc_mark_tree (lt->size);
14740 ggc_mark_tree (lt->pure_virtuals);
14741 ggc_mark_tree (lt->friend_classes);
14742 ggc_mark_tree (lt->rtti);
14743 ggc_mark_tree (lt->methods);
14744 ggc_mark_tree (lt->template_info);
14745 ggc_mark_tree (lt->befriending_classes);
14748 /* In the case of pointer-to-member function types, the
14749 TYPE_LANG_SPECIFIC is really just a tree. */
14750 ggc_mark_tree ((tree) lt);