1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001 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. */
48 extern int (*valid_lang_attribute) PARAMS ((tree, tree, tree, tree));
50 #ifndef BOOL_TYPE_SIZE
51 /* `bool' has size and alignment `1', on all platforms. */
52 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
55 static tree grokparms PARAMS ((tree));
56 static const char *redeclaration_error_message PARAMS ((tree, tree));
58 static void push_binding_level PARAMS ((struct binding_level *, int,
60 static void pop_binding_level PARAMS ((void));
61 static void suspend_binding_level PARAMS ((void));
62 static void resume_binding_level PARAMS ((struct binding_level *));
63 static struct binding_level *make_binding_level PARAMS ((void));
64 static void declare_namespace_level PARAMS ((void));
65 static int decl_jump_unsafe PARAMS ((tree));
66 static void storedecls PARAMS ((tree));
67 static void require_complete_types_for_parms PARAMS ((tree));
68 static int ambi_op_p PARAMS ((enum tree_code));
69 static int unary_op_p PARAMS ((enum tree_code));
70 static tree store_bindings PARAMS ((tree, tree));
71 static tree lookup_tag_reverse PARAMS ((tree, tree));
72 static tree obscure_complex_init PARAMS ((tree, tree));
73 static tree lookup_name_real PARAMS ((tree, int, int, int));
74 static void push_local_name PARAMS ((tree));
75 static void warn_extern_redeclared_static PARAMS ((tree, tree));
76 static tree grok_reference_init PARAMS ((tree, tree, tree));
77 static tree grokfndecl PARAMS ((tree, tree, tree, tree, int,
78 enum overload_flags, tree,
79 tree, int, int, int, int, int, int, tree));
80 static tree grokvardecl PARAMS ((tree, tree, RID_BIT_TYPE *, int, int, tree));
81 static tree lookup_tag PARAMS ((enum tree_code, tree,
82 struct binding_level *, int));
83 static void set_identifier_type_value_with_scope
84 PARAMS ((tree, tree, struct binding_level *));
85 static void record_unknown_type PARAMS ((tree, const char *));
86 static tree build_library_fn_1 PARAMS ((tree, enum tree_code, tree));
87 static int member_function_or_else PARAMS ((tree, tree, enum overload_flags));
88 static void bad_specifiers PARAMS ((tree, const char *, int, int, int, int,
90 static tree maybe_process_template_type_declaration PARAMS ((tree, int, struct binding_level*));
91 static void check_for_uninitialized_const_var PARAMS ((tree));
92 static unsigned long typename_hash PARAMS ((hash_table_key));
93 static bool typename_compare PARAMS ((hash_table_key, hash_table_key));
94 static void push_binding PARAMS ((tree, tree, struct binding_level*));
95 static int add_binding PARAMS ((tree, tree));
96 static void pop_binding PARAMS ((tree, tree));
97 static tree local_variable_p_walkfn PARAMS ((tree *, int *, void *));
98 static tree find_binding PARAMS ((tree, tree));
99 static tree select_decl PARAMS ((tree, int));
100 static int lookup_flags PARAMS ((int, int));
101 static tree qualify_lookup PARAMS ((tree, int));
102 static tree record_builtin_java_type PARAMS ((const char *, int));
103 static const char *tag_name PARAMS ((enum tag_types code));
104 static void find_class_binding_level PARAMS ((void));
105 static struct binding_level *innermost_nonclass_level PARAMS ((void));
106 static void warn_about_implicit_typename_lookup PARAMS ((tree, tree));
107 static int walk_namespaces_r PARAMS ((tree, walk_namespaces_fn, void *));
108 static int walk_globals_r PARAMS ((tree, void *));
109 static void add_decl_to_level PARAMS ((tree, struct binding_level *));
110 static tree make_label_decl PARAMS ((tree, int));
111 static void use_label PARAMS ((tree));
112 static void check_previous_goto_1 PARAMS ((tree, struct binding_level *, tree,
114 static void check_previous_goto PARAMS ((struct named_label_use_list *));
115 static void check_switch_goto PARAMS ((struct binding_level *));
116 static void check_previous_gotos PARAMS ((tree));
117 static void pop_label PARAMS ((tree, tree));
118 static void pop_labels PARAMS ((tree));
119 static void maybe_deduce_size_from_array_init PARAMS ((tree, tree));
120 static void layout_var_decl PARAMS ((tree));
121 static void maybe_commonize_var PARAMS ((tree));
122 static tree check_initializer PARAMS ((tree, tree));
123 static void make_rtl_for_nonlocal_decl PARAMS ((tree, tree, const char *));
124 static void push_cp_function_context PARAMS ((struct function *));
125 static void pop_cp_function_context PARAMS ((struct function *));
126 static void mark_binding_level PARAMS ((void *));
127 static void mark_named_label_lists PARAMS ((void *, void *));
128 static void mark_cp_function_context PARAMS ((struct function *));
129 static void mark_saved_scope PARAMS ((void *));
130 static void mark_lang_function PARAMS ((struct cp_language_function *));
131 static void save_function_data PARAMS ((tree));
132 static void check_function_type PARAMS ((tree, tree));
133 static void destroy_local_var PARAMS ((tree));
134 static void finish_constructor_body PARAMS ((void));
135 static void finish_destructor_body PARAMS ((void));
136 static tree create_array_type_for_decl PARAMS ((tree, tree, tree));
137 static tree get_atexit_node PARAMS ((void));
138 static tree get_dso_handle_node PARAMS ((void));
139 static tree start_cleanup_fn PARAMS ((void));
140 static void end_cleanup_fn PARAMS ((void));
141 static tree cp_make_fname_decl PARAMS ((tree, int));
142 static void initialize_predefined_identifiers PARAMS ((void));
143 static tree check_special_function_return_type
144 PARAMS ((special_function_kind, tree, tree));
145 static tree push_cp_library_fn PARAMS ((enum tree_code, tree));
146 static tree build_cp_library_fn PARAMS ((tree, enum tree_code, tree));
147 static void store_parm_decls PARAMS ((tree));
148 static int cp_missing_noreturn_ok_p PARAMS ((tree));
150 #if defined (DEBUG_CP_BINDING_LEVELS)
151 static void indent PARAMS ((void));
154 /* Erroneous argument lists can use this *IFF* they do not modify it. */
155 tree error_mark_list;
157 /* The following symbols are subsumed in the cp_global_trees array, and
158 listed here individually for documentation purposes.
161 tree wchar_decl_node;
163 tree vtable_entry_type;
164 tree delta_type_node;
165 tree __t_desc_type_node;
166 tree ti_desc_type_node;
167 tree bltn_desc_type_node, ptr_desc_type_node;
168 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
169 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
170 tree ptm_desc_type_node;
171 tree base_desc_type_node;
173 tree class_type_node, record_type_node, union_type_node, enum_type_node;
174 tree unknown_type_node;
176 Array type `vtable_entry_type[]'
179 tree vtbl_ptr_type_node;
186 A FUNCTION_DECL which can call `abort'. Not necessarily the
187 one that the user will declare, but sufficient to be called
188 by routines that want to abort the program.
192 The FUNCTION_DECL for the default `::operator delete'.
194 tree global_delete_fndecl;
197 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
202 tree cp_global_trees[CPTI_MAX];
204 /* Indicates that there is a type value in some namespace, although
205 that is not necessarily in scope at the moment. */
207 static tree global_type_node;
209 /* Expect only namespace names now. */
210 static int only_namespace_names;
212 /* Used only for jumps to as-yet undefined labels, since jumps to
213 defined labels can have their validity checked immediately. */
215 struct named_label_use_list
217 struct binding_level *binding_level;
220 const char *filename_o_goto;
222 struct named_label_use_list *next;
225 #define named_label_uses cp_function_chain->x_named_label_uses
227 #define local_names cp_function_chain->x_local_names
229 /* A list of objects which have constructors or destructors
230 which reside in the global scope. The decl is stored in
231 the TREE_VALUE slot and the initializer is stored
232 in the TREE_PURPOSE slot. */
233 tree static_aggregates;
237 /* A node for the integer constants 2, and 3. */
239 tree integer_two_node, integer_three_node;
241 /* Similar, for last_function_parm_tags. */
242 tree last_function_parms;
244 /* A list of all LABEL_DECLs in the function that have names. Here so
245 we can clear out their names' definitions at the end of the
246 function, and so we can check the validity of jumps to these labels. */
248 struct named_label_list
250 struct binding_level *binding_level;
255 struct named_label_list *next;
256 unsigned int in_try_scope : 1;
257 unsigned int in_catch_scope : 1;
260 #define named_labels cp_function_chain->x_named_labels
262 /* Nonzero means use the ISO C94 dialect of C. */
266 /* Nonzero means use the ISO C99 dialect of C. */
270 /* Nonzero means we are a hosted implementation for code shared with C. */
274 /* Nonzero means add default format_arg attributes for functions not
277 int flag_noniso_default_format_attributes = 1;
279 /* Nonzero if we want to conserve space in the .o files. We do this
280 by putting uninitialized data and runtime initialized data into
281 .common instead of .data at the expense of not flagging multiple
283 extern int flag_conserve_space;
285 /* C and C++ flags are in decl2.c. */
287 /* Flag used when debugging spew.c */
289 extern int spew_debug;
291 /* A expression of value 0 with the same precision as a sizetype
293 tree signed_size_zero_node;
295 /* The name of the anonymous namespace, throughout this translation
297 tree anonymous_namespace_name;
299 /* The number of function bodies which we are currently processing.
300 (Zero if we are at namespace scope, one inside the body of a
301 function, two inside the body of a function in a local class, etc.) */
304 /* For each binding contour we allocate a binding_level structure
305 which records the names defined in that contour.
308 1) one for each function definition,
309 where internal declarations of the parameters appear.
310 2) one for each compound statement,
311 to record its declarations.
313 The current meaning of a name can be found by searching the levels
314 from the current one out to the global one.
316 Off to the side, may be the class_binding_level. This exists only
317 to catch class-local declarations. It is otherwise nonexistent.
319 Also there may be binding levels that catch cleanups that must be
320 run when exceptions occur. Thus, to see whether a name is bound in
321 the current scope, it is not enough to look in the
322 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
325 /* Note that the information in the `names' component of the global contour
326 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
330 /* A chain of _DECL nodes for all variables, constants, functions,
331 and typedef types. These are in the reverse of the order
332 supplied. There may be OVERLOADs on this list, too, but they
333 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
336 /* A list of structure, union and enum definitions, for looking up
338 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
339 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
340 or ENUMERAL_TYPE node.
342 C++: the TREE_VALUE nodes can be simple types for
343 component_bindings. */
346 /* A list of USING_DECL nodes. */
349 /* A list of used namespaces. PURPOSE is the namespace,
350 VALUE the common ancestor with this binding_level's namespace. */
351 tree using_directives;
353 /* If this binding level is the binding level for a class, then
354 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
355 is the name of an entity bound in the class. The TREE_TYPE is
356 the DECL bound by this name in the class. */
359 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
360 is used for all binding levels. In addition the TREE_VALUE is the
361 IDENTIFIER_TYPE_VALUE before we entered the class. */
364 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
365 label in this scope. The TREE_PURPOSE is the previous value of
366 the IDENTIFIER_LABEL VALUE. */
367 tree shadowed_labels;
369 /* For each level (except not the global one),
370 a chain of BLOCK nodes for all the levels
371 that were entered and exited one level down. */
374 /* The _TYPE node for this level, if parm_flag == 2. */
377 /* The binding level which this one is contained in (inherits from). */
378 struct binding_level *level_chain;
380 /* List of decls in `names' that have incomplete
381 structure or union types. */
384 /* List of VAR_DECLS saved from a previous for statement.
385 These would be dead in ISO-conforming code, but might
386 be referenced in ARM-era code. These are stored in a
387 TREE_LIST; the TREE_VALUE is the actual declaration. */
388 tree dead_vars_from_for;
390 /* 1 for the level that holds the parameters of a function.
391 2 for the level that holds a class declaration. */
392 unsigned parm_flag : 2;
394 /* 1 means make a BLOCK for this level regardless of all else.
395 2 for temporary binding contours created by the compiler. */
398 /* Nonzero if this level "doesn't exist" for tags. */
399 unsigned tag_transparent : 1;
401 /* Nonzero if this level can safely have additional
402 cleanup-needing variables added to it. */
403 unsigned more_cleanups_ok : 1;
404 unsigned have_cleanups : 1;
406 /* Nonzero if this scope is for storing the decls for template
407 parameters and generic decls; these decls will be discarded and
408 replaced with a TEMPLATE_DECL. */
409 unsigned template_parms_p : 1;
411 /* Nonzero if this scope corresponds to the `<>' in a
412 `template <>' clause. Whenever this flag is set,
413 TEMPLATE_PARMS_P will be set as well. */
414 unsigned template_spec_p : 1;
416 /* This is set for a namespace binding level. */
417 unsigned namespace_p : 1;
419 /* True if this level is that of a for-statement where we need to
420 worry about ambiguous (ARM or ISO) scope rules. */
421 unsigned is_for_scope : 1;
423 /* True if this level corresponds to a TRY block. Currently this
424 information is only available while building the tree structure. */
425 unsigned is_try_scope : 1;
427 /* True if this level corresponds to a CATCH block. Currently this
428 information is only available while building the tree structure. */
429 unsigned is_catch_scope : 1;
431 /* Three bits left for this word. */
433 #if defined(DEBUG_CP_BINDING_LEVELS)
434 /* Binding depth at which this level began. */
435 unsigned binding_depth;
436 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
439 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
441 /* The binding level currently in effect. */
443 #define current_binding_level \
444 (cfun && cp_function_chain->bindings \
445 ? cp_function_chain->bindings \
446 : scope_chain->bindings)
448 /* The binding level of the current class, if any. */
450 #define class_binding_level scope_chain->class_bindings
452 /* A chain of binding_level structures awaiting reuse. */
454 static struct binding_level *free_binding_level;
456 /* The outermost binding level, for names of file scope.
457 This is created when the compiler is started and exists
458 through the entire run. */
460 static struct binding_level *global_binding_level;
462 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
464 static int keep_next_level_flag;
466 #if defined(DEBUG_CP_BINDING_LEVELS)
467 static int binding_depth = 0;
468 static int is_class_level = 0;
475 for (i = 0; i < binding_depth*2; i++)
478 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
480 static tree pushdecl_with_scope PARAMS ((tree, struct binding_level *));
483 push_binding_level (newlevel, tag_transparent, keep)
484 struct binding_level *newlevel;
485 int tag_transparent, keep;
487 /* Add this level to the front of the chain (stack) of levels that
489 memset ((char*) newlevel, 0, sizeof (struct binding_level));
490 newlevel->level_chain = current_binding_level;
491 current_binding_level = newlevel;
492 newlevel->tag_transparent = tag_transparent;
493 newlevel->more_cleanups_ok = 1;
495 newlevel->keep = keep;
496 #if defined(DEBUG_CP_BINDING_LEVELS)
497 newlevel->binding_depth = binding_depth;
499 fprintf (stderr, "push %s level 0x%08x line %d\n",
500 (is_class_level) ? "class" : "block", newlevel, lineno);
503 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
506 /* Find the innermost enclosing class scope, and reset
507 CLASS_BINDING_LEVEL appropriately. */
510 find_class_binding_level ()
512 struct binding_level *level = current_binding_level;
514 while (level && level->parm_flag != 2)
515 level = level->level_chain;
516 if (level && level->parm_flag == 2)
517 class_binding_level = level;
519 class_binding_level = 0;
525 if (global_binding_level)
527 /* Cannot pop a level, if there are none left to pop. */
528 if (current_binding_level == global_binding_level)
529 my_friendly_abort (123);
531 /* Pop the current level, and free the structure for reuse. */
532 #if defined(DEBUG_CP_BINDING_LEVELS)
535 fprintf (stderr, "pop %s level 0x%08x line %d\n",
536 (is_class_level) ? "class" : "block",
537 current_binding_level, lineno);
538 if (is_class_level != (current_binding_level == class_binding_level))
541 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
544 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
546 register struct binding_level *level = current_binding_level;
547 current_binding_level = current_binding_level->level_chain;
548 level->level_chain = free_binding_level;
549 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
550 if (level->binding_depth != binding_depth)
552 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
553 free_binding_level = level;
554 find_class_binding_level ();
559 suspend_binding_level ()
561 if (class_binding_level)
562 current_binding_level = class_binding_level;
564 if (global_binding_level)
566 /* Cannot suspend a level, if there are none left to suspend. */
567 if (current_binding_level == global_binding_level)
568 my_friendly_abort (123);
570 /* Suspend the current level. */
571 #if defined(DEBUG_CP_BINDING_LEVELS)
574 fprintf (stderr, "suspend %s level 0x%08x line %d\n",
575 (is_class_level) ? "class" : "block",
576 current_binding_level, lineno);
577 if (is_class_level != (current_binding_level == class_binding_level))
580 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
583 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
584 current_binding_level = current_binding_level->level_chain;
585 find_class_binding_level ();
589 resume_binding_level (b)
590 struct binding_level *b;
592 /* Resuming binding levels is meant only for namespaces,
593 and those cannot nest into classes. */
594 my_friendly_assert(!class_binding_level, 386);
595 /* Also, resuming a non-directly nested namespace is a no-no. */
596 my_friendly_assert(b->level_chain == current_binding_level, 386);
597 current_binding_level = b;
598 #if defined(DEBUG_CP_BINDING_LEVELS)
599 b->binding_depth = binding_depth;
601 fprintf (stderr, "resume %s level 0x%08x line %d\n",
602 (is_class_level) ? "class" : "block", b, lineno);
605 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
608 /* Create a new `struct binding_level'. */
611 struct binding_level *
612 make_binding_level ()
615 return (struct binding_level *) xmalloc (sizeof (struct binding_level));
618 /* Nonzero if we are currently in the global binding level. */
623 return current_binding_level == global_binding_level;
626 /* Return the innermost binding level that is not for a class scope. */
628 static struct binding_level *
629 innermost_nonclass_level ()
631 struct binding_level *b;
633 b = current_binding_level;
634 while (b->parm_flag == 2)
640 /* Nonzero if we are currently in a toplevel binding level. This
641 means either the global binding level or a namespace in a toplevel
642 binding level. Since there are no non-toplevel namespace levels,
643 this really means any namespace or template parameter level. We
644 also include a class whose context is toplevel. */
647 toplevel_bindings_p ()
649 struct binding_level *b = innermost_nonclass_level ();
651 return b->namespace_p || b->template_parms_p;
654 /* Nonzero if this is a namespace scope, or if we are defining a class
655 which is itself at namespace scope, or whose enclosing class is
656 such a class, etc. */
659 namespace_bindings_p ()
661 struct binding_level *b = innermost_nonclass_level ();
663 return b->namespace_p;
666 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
667 unconditionally. Otherwise, use the normal logic to decide whether
668 or not to create a BLOCK. */
671 keep_next_level (keep)
674 keep_next_level_flag = keep;
677 /* Nonzero if the current level needs to have a BLOCK made. */
682 return (current_binding_level->blocks != NULL_TREE
683 || current_binding_level->keep
684 || current_binding_level->names != NULL_TREE
685 || (current_binding_level->tags != NULL_TREE
686 && !current_binding_level->tag_transparent));
690 declare_namespace_level ()
692 current_binding_level->namespace_p = 1;
695 /* Returns non-zero if this scope was created to store template
699 template_parm_scope_p ()
701 return current_binding_level->template_parms_p;
704 /* Returns the kind of template specialization we are currently
705 processing, given that it's declaration contained N_CLASS_SCOPES
706 explicit scope qualifications. */
709 current_tmpl_spec_kind (n_class_scopes)
712 int n_template_parm_scopes = 0;
713 int seen_specialization_p = 0;
714 int innermost_specialization_p = 0;
715 struct binding_level *b;
717 /* Scan through the template parameter scopes. */
718 for (b = current_binding_level; b->template_parms_p; b = b->level_chain)
720 /* If we see a specialization scope inside a parameter scope,
721 then something is wrong. That corresponds to a declaration
724 template <class T> template <> ...
726 which is always illegal since [temp.expl.spec] forbids the
727 specialization of a class member template if the enclosing
728 class templates are not explicitly specialized as well. */
729 if (b->template_spec_p)
731 if (n_template_parm_scopes == 0)
732 innermost_specialization_p = 1;
734 seen_specialization_p = 1;
736 else if (seen_specialization_p == 1)
737 return tsk_invalid_member_spec;
739 ++n_template_parm_scopes;
742 /* Handle explicit instantiations. */
743 if (processing_explicit_instantiation)
745 if (n_template_parm_scopes != 0)
746 /* We've seen a template parameter list during an explicit
747 instantiation. For example:
749 template <class T> template void f(int);
751 This is erroneous. */
752 return tsk_invalid_expl_inst;
754 return tsk_expl_inst;
757 if (n_template_parm_scopes < n_class_scopes)
758 /* We've not seen enough template headers to match all the
759 specialized classes present. For example:
761 template <class T> void R<T>::S<T>::f(int);
763 This is illegal; there needs to be one set of template
764 parameters for each class. */
765 return tsk_insufficient_parms;
766 else if (n_template_parm_scopes == n_class_scopes)
767 /* We're processing a non-template declaration (even though it may
768 be a member of a template class.) For example:
770 template <class T> void S<T>::f(int);
772 The `class T' maches the `S<T>', leaving no template headers
773 corresponding to the `f'. */
775 else if (n_template_parm_scopes > n_class_scopes + 1)
776 /* We've got too many template headers. For example:
778 template <> template <class T> void f (T);
780 There need to be more enclosing classes. */
781 return tsk_excessive_parms;
783 /* This must be a template. It's of the form:
785 template <class T> template <class U> void S<T>::f(U);
787 This is a specialization if the innermost level was a
788 specialization; otherwise it's just a definition of the
790 return innermost_specialization_p ? tsk_expl_spec : tsk_template;
794 set_class_shadows (shadows)
797 class_binding_level->class_shadowed = shadows;
800 /* Enter a new binding level.
801 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
802 not for that of tags. */
805 pushlevel (tag_transparent)
808 struct binding_level *newlevel;
810 if (cfun && !doing_semantic_analysis_p ())
813 /* Reuse or create a struct for this binding level. */
814 #if defined(DEBUG_CP_BINDING_LEVELS)
816 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
817 if (free_binding_level)
818 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
820 newlevel = free_binding_level;
821 free_binding_level = free_binding_level->level_chain;
824 newlevel = make_binding_level ();
826 push_binding_level (newlevel, tag_transparent, keep_next_level_flag);
827 GNU_xref_start_scope ((HOST_WIDE_INT) newlevel);
828 keep_next_level_flag = 0;
831 /* We're defining an object of type TYPE. If it needs a cleanup, but
832 we're not allowed to add any more objects with cleanups to the current
833 scope, create a new binding level. */
836 maybe_push_cleanup_level (type)
839 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
840 && current_binding_level->more_cleanups_ok == 0)
845 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
849 /* Enter a new scope. The KIND indicates what kind of scope is being
860 case sk_template_spec:
861 current_binding_level->template_spec_p = 1;
864 case sk_template_parms:
865 current_binding_level->template_parms_p = 1;
869 my_friendly_abort (20000309);
873 /* Exit the current scope. */
882 note_level_for_for ()
884 current_binding_level->is_for_scope = 1;
887 /* Record that the current binding level represents a try block. */
890 note_level_for_try ()
892 current_binding_level->is_try_scope = 1;
895 /* Record that the current binding level represents a catch block. */
898 note_level_for_catch ()
900 current_binding_level->is_catch_scope = 1;
903 /* For a binding between a name and an entity at a block scope,
904 this is the `struct binding_level' for the block. */
905 #define BINDING_LEVEL(NODE) \
906 (((struct tree_binding*)NODE)->scope.level)
908 /* A free list of CPLUS_BINDING nodes, connected by their
911 static tree free_bindings;
913 /* Make DECL the innermost binding for ID. The LEVEL is the binding
914 level at which this declaration is being bound. */
917 push_binding (id, decl, level)
920 struct binding_level* level;
926 binding = free_bindings;
927 free_bindings = TREE_CHAIN (binding);
930 binding = make_node (CPLUS_BINDING);
932 /* Now, fill in the binding information. */
933 BINDING_VALUE (binding) = decl;
934 BINDING_TYPE (binding) = NULL_TREE;
935 BINDING_LEVEL (binding) = level;
936 INHERITED_VALUE_BINDING_P (binding) = 0;
937 LOCAL_BINDING_P (binding) = (level != class_binding_level);
938 BINDING_HAS_LEVEL_P (binding) = 1;
940 /* And put it on the front of the list of bindings for ID. */
941 TREE_CHAIN (binding) = IDENTIFIER_BINDING (id);
942 IDENTIFIER_BINDING (id) = binding;
945 /* ID is already bound in the current scope. But, DECL is an
946 additional binding for ID in the same scope. This is the `struct
947 stat' hack whereby a non-typedef class-name or enum-name can be
948 bound at the same level as some other kind of entity. It's the
949 responsibility of the caller to check that inserting this name is
950 legal here. Returns nonzero if the new binding was successful. */
952 add_binding (id, decl)
956 tree binding = IDENTIFIER_BINDING (id);
959 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
960 /* The new name is the type name. */
961 BINDING_TYPE (binding) = decl;
962 else if (!BINDING_VALUE (binding))
963 /* This situation arises when push_class_level_binding moves an
964 inherited type-binding out of the way to make room for a new
966 BINDING_VALUE (binding) = decl;
967 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
968 && DECL_ARTIFICIAL (BINDING_VALUE (binding)))
970 /* The old binding was a type name. It was placed in
971 BINDING_VALUE because it was thought, at the point it was
972 declared, to be the only entity with such a name. Move the
973 type name into the type slot; it is now hidden by the new
975 BINDING_TYPE (binding) = BINDING_VALUE (binding);
976 BINDING_VALUE (binding) = decl;
977 INHERITED_VALUE_BINDING_P (binding) = 0;
979 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
980 && TREE_CODE (decl) == TYPE_DECL
981 && DECL_NAME (decl) == DECL_NAME (BINDING_VALUE (binding))
982 && same_type_p (TREE_TYPE (decl),
983 TREE_TYPE (BINDING_VALUE (binding))))
984 /* We have two typedef-names, both naming the same type to have
985 the same name. This is OK because of:
989 In a given scope, a typedef specifier can be used to redefine
990 the name of any type declared in that scope to refer to the
991 type to which it already refers. */
993 /* There can be two block-scope declarations of the same variable,
994 so long as they are `extern' declarations. */
995 else if (TREE_CODE (decl) == VAR_DECL
996 && TREE_CODE (BINDING_VALUE (binding)) == VAR_DECL
997 && DECL_EXTERNAL (decl)
998 && DECL_EXTERNAL (BINDING_VALUE (binding)))
1000 duplicate_decls (decl, BINDING_VALUE (binding));
1005 cp_error ("declaration of `%#D'", decl);
1006 cp_error_at ("conflicts with previous declaration `%#D'",
1007 BINDING_VALUE (binding));
1014 /* Add DECL to the list of things declared in B. */
1017 add_decl_to_level (decl, b)
1019 struct binding_level *b;
1021 /* We build up the list in reverse order, and reverse it later if
1023 TREE_CHAIN (decl) = b->names;
1027 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1028 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1029 doesn't really belong to this binding level, that it got here
1030 through a using-declaration. */
1033 push_local_binding (id, decl, flags)
1038 struct binding_level *b;
1040 /* Skip over any local classes. This makes sense if we call
1041 push_local_binding with a friend decl of a local class. */
1042 b = current_binding_level;
1043 while (b->parm_flag == 2)
1046 if (lookup_name_current_level (id))
1048 /* Supplement the existing binding. */
1049 if (!add_binding (id, decl))
1050 /* It didn't work. Something else must be bound at this
1051 level. Do not add DECL to the list of things to pop
1056 /* Create a new binding. */
1057 push_binding (id, decl, b);
1059 if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
1060 /* We must put the OVERLOAD into a TREE_LIST since the
1061 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1062 decls that got here through a using-declaration. */
1063 decl = build_tree_list (NULL_TREE, decl);
1065 /* And put DECL on the list of things declared by the current
1067 add_decl_to_level (decl, b);
1070 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1071 binding was successful. */
1074 push_class_binding (id, decl)
1079 tree binding = IDENTIFIER_BINDING (id);
1082 /* Note that we declared this value so that we can issue an error if
1083 this an illegal redeclaration of a name already used for some
1085 note_name_declared_in_class (id, decl);
1087 if (binding && BINDING_LEVEL (binding) == class_binding_level)
1088 /* Supplement the existing binding. */
1089 result = add_binding (id, decl);
1091 /* Create a new binding. */
1092 push_binding (id, decl, class_binding_level);
1094 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1095 class-level declaration. Note that we do not use DECL here
1096 because of the possibility of the `struct stat' hack; if DECL is
1097 a class-name or enum-name we might prefer a field-name, or some
1099 IDENTIFIER_CLASS_VALUE (id) = BINDING_VALUE (IDENTIFIER_BINDING (id));
1101 /* If this is a binding from a base class, mark it as such. */
1102 binding = IDENTIFIER_BINDING (id);
1103 if (BINDING_VALUE (binding) == decl && TREE_CODE (decl) != TREE_LIST)
1105 /* Any implicit typename must be from a base-class. The
1106 context for an implicit typename declaration is always
1107 the derived class in which the lookup was done, so the checks
1108 based on the context of DECL below will not trigger. */
1109 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl))
1110 INHERITED_VALUE_BINDING_P (binding) = 1;
1113 if (TREE_CODE (decl) == OVERLOAD)
1114 context = CP_DECL_CONTEXT (OVL_CURRENT (decl));
1117 my_friendly_assert (DECL_P (decl), 0);
1118 context = context_for_name_lookup (decl);
1121 if (is_properly_derived_from (current_class_type, context))
1122 INHERITED_VALUE_BINDING_P (binding) = 1;
1124 INHERITED_VALUE_BINDING_P (binding) = 0;
1127 else if (BINDING_VALUE (binding) == decl)
1128 /* We only encounter a TREE_LIST when push_class_decls detects an
1129 ambiguity. Such an ambiguity can be overridden by a definition
1131 INHERITED_VALUE_BINDING_P (binding) = 1;
1136 /* Remove the binding for DECL which should be the innermost binding
1140 pop_binding (id, decl)
1146 if (id == NULL_TREE)
1147 /* It's easiest to write the loops that call this function without
1148 checking whether or not the entities involved have names. We
1149 get here for such an entity. */
1152 /* Get the innermost binding for ID. */
1153 binding = IDENTIFIER_BINDING (id);
1155 /* The name should be bound. */
1156 my_friendly_assert (binding != NULL_TREE, 0);
1158 /* The DECL will be either the ordinary binding or the type
1159 binding for this identifier. Remove that binding. */
1160 if (BINDING_VALUE (binding) == decl)
1161 BINDING_VALUE (binding) = NULL_TREE;
1162 else if (BINDING_TYPE (binding) == decl)
1163 BINDING_TYPE (binding) = NULL_TREE;
1165 my_friendly_abort (0);
1167 if (!BINDING_VALUE (binding) && !BINDING_TYPE (binding))
1169 /* We're completely done with the innermost binding for this
1170 identifier. Unhook it from the list of bindings. */
1171 IDENTIFIER_BINDING (id) = TREE_CHAIN (binding);
1173 /* Add it to the free list. */
1174 TREE_CHAIN (binding) = free_bindings;
1175 free_bindings = binding;
1177 /* Clear the BINDING_LEVEL so the garbage collector doesn't walk
1179 BINDING_LEVEL (binding) = NULL;
1183 /* When a label goes out of scope, check to see if that label was used
1184 in a valid manner, and issue any appropriate warnings or errors. */
1187 pop_label (label, old_value)
1191 if (!processing_template_decl && doing_semantic_analysis_p ())
1193 if (DECL_INITIAL (label) == NULL_TREE)
1195 cp_error_at ("label `%D' used but not defined", label);
1196 /* Avoid crashing later. */
1197 define_label (input_filename, 1, DECL_NAME (label));
1199 else if (warn_unused_label && !TREE_USED (label))
1200 cp_warning_at ("label `%D' defined but not used", label);
1203 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), old_value);
1206 /* At the end of a function, all labels declared within the function
1207 go out of scope. BLOCK is the top-level block for the
1214 struct named_label_list *link;
1216 /* Clear out the definitions of all label names, since their scopes
1218 for (link = named_labels; link; link = link->next)
1220 pop_label (link->label_decl, link->old_value);
1221 /* Put the labels into the "variables" of the top-level block,
1222 so debugger can see them. */
1223 TREE_CHAIN (link->label_decl) = BLOCK_VARS (block);
1224 BLOCK_VARS (block) = link->label_decl;
1227 named_labels = NULL;
1230 /* Exit a binding level.
1231 Pop the level off, and restore the state of the identifier-decl mappings
1232 that were in effect when this level was entered.
1234 If KEEP == 1, this level had explicit declarations, so
1235 and create a "block" (a BLOCK node) for the level
1236 to record its declarations and subblocks for symbol table output.
1238 If FUNCTIONBODY is nonzero, this level is the body of a function,
1239 so create a block as if KEEP were set and also clear out all
1242 If REVERSE is nonzero, reverse the order of decls before putting
1243 them into the BLOCK. */
1246 poplevel (keep, reverse, functionbody)
1252 /* The chain of decls was accumulated in reverse order.
1253 Put it into forward order, just for cleanliness. */
1255 int tmp = functionbody;
1256 int real_functionbody;
1259 tree block = NULL_TREE;
1261 int leaving_for_scope;
1263 if (cfun && !doing_semantic_analysis_p ())
1266 my_friendly_assert (current_binding_level->parm_flag != 2,
1269 real_functionbody = (current_binding_level->keep == 2
1270 ? ((functionbody = 0), tmp) : functionbody);
1271 tags = functionbody >= 0 ? current_binding_level->tags : 0;
1272 subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;
1274 my_friendly_assert (!current_binding_level->class_shadowed,
1277 /* We used to use KEEP == 2 to indicate that the new block should go
1278 at the beginning of the list of blocks at this binding level,
1279 rather than the end. This hack is no longer used. */
1280 my_friendly_assert (keep == 0 || keep == 1, 0);
1282 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
1283 (HOST_WIDE_INT) current_binding_level->level_chain,
1284 current_binding_level->parm_flag,
1285 current_binding_level->keep);
1287 if (current_binding_level->keep == 1)
1290 /* Any uses of undefined labels, and any defined labels, now operate
1291 under constraints of next binding contour. */
1292 if (cfun && !functionbody)
1294 struct binding_level *level_chain;
1295 level_chain = current_binding_level->level_chain;
1298 struct named_label_use_list *uses;
1299 struct named_label_list *labels;
1300 for (labels = named_labels; labels; labels = labels->next)
1301 if (labels->binding_level == current_binding_level)
1304 if (current_binding_level->is_try_scope)
1305 labels->in_try_scope = 1;
1306 if (current_binding_level->is_catch_scope)
1307 labels->in_catch_scope = 1;
1308 for (decl = labels->names_in_scope; decl;
1309 decl = TREE_CHAIN (decl))
1310 if (decl_jump_unsafe (decl))
1311 labels->bad_decls = tree_cons (NULL_TREE, decl,
1313 labels->binding_level = level_chain;
1314 labels->names_in_scope = level_chain->names;
1317 for (uses = named_label_uses; uses; uses = uses->next)
1318 if (uses->binding_level == current_binding_level)
1320 uses->binding_level = level_chain;
1321 uses->names_in_scope = level_chain->names;
1326 /* Get the decls in the order they were written.
1327 Usually current_binding_level->names is in reverse order.
1328 But parameter decls were previously put in forward order. */
1331 current_binding_level->names
1332 = decls = nreverse (current_binding_level->names);
1334 decls = current_binding_level->names;
1336 /* Output any nested inline functions within this block
1337 if they weren't already output. */
1338 for (decl = decls; decl; decl = TREE_CHAIN (decl))
1339 if (TREE_CODE (decl) == FUNCTION_DECL
1340 && ! TREE_ASM_WRITTEN (decl)
1341 && DECL_INITIAL (decl) != NULL_TREE
1342 && TREE_ADDRESSABLE (decl)
1343 && decl_function_context (decl) == current_function_decl)
1345 /* If this decl was copied from a file-scope decl
1346 on account of a block-scope extern decl,
1347 propagate TREE_ADDRESSABLE to the file-scope decl. */
1348 if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE)
1349 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
1352 push_function_context ();
1353 output_inline_function (decl);
1354 pop_function_context ();
1358 /* When not in function-at-a-time mode, expand_end_bindings will
1359 warn about unused variables. But, in function-at-a-time mode
1360 expand_end_bindings is not passed the list of variables in the
1361 current scope, and therefore no warning is emitted. So, we
1362 explicitly warn here. */
1363 if (!processing_template_decl)
1364 warn_about_unused_variables (getdecls ());
1366 /* If there were any declarations or structure tags in that level,
1367 or if this level is a function body,
1368 create a BLOCK to record them for the life of this function. */
1370 if (keep == 1 || functionbody)
1371 block = make_node (BLOCK);
1372 if (block != NULL_TREE)
1374 BLOCK_VARS (block) = decls;
1375 BLOCK_SUBBLOCKS (block) = subblocks;
1378 /* In each subblock, record that this is its superior. */
1380 for (link = subblocks; link; link = TREE_CHAIN (link))
1381 BLOCK_SUPERCONTEXT (link) = block;
1383 /* We still support the old for-scope rules, whereby the variables
1384 in a for-init statement were in scope after the for-statement
1385 ended. We only use the new rules in flag_new_for_scope is
1388 = current_binding_level->is_for_scope && flag_new_for_scope == 1;
1390 /* Remove declarations for all the DECLs in this level. */
1391 for (link = decls; link; link = TREE_CHAIN (link))
1393 if (leaving_for_scope && TREE_CODE (link) == VAR_DECL
1394 && DECL_NAME (link))
1397 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link)));
1401 ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link));
1403 ns_binding = NULL_TREE;
1406 && (BINDING_LEVEL (outer_binding)
1407 == current_binding_level->level_chain))
1408 /* We have something like:
1413 and we are leaving the `for' scope. There's no reason to
1414 keep the binding of the inner `i' in this case. */
1415 pop_binding (DECL_NAME (link), link);
1416 else if ((outer_binding
1417 && (TREE_CODE (BINDING_VALUE (outer_binding))
1420 && TREE_CODE (ns_binding) == TYPE_DECL))
1421 /* Here, we have something like:
1429 We must pop the for-scope binding so we know what's a
1430 type and what isn't. */
1431 pop_binding (DECL_NAME (link), link);
1434 /* Mark this VAR_DECL as dead so that we can tell we left it
1435 there only for backward compatibility. */
1436 DECL_DEAD_FOR_LOCAL (link) = 1;
1438 /* Keep track of what should of have happenned when we
1439 popped the binding. */
1440 if (outer_binding && BINDING_VALUE (outer_binding))
1441 DECL_SHADOWED_FOR_VAR (link)
1442 = BINDING_VALUE (outer_binding);
1444 /* Add it to the list of dead variables in the next
1445 outermost binding to that we can remove these when we
1446 leave that binding. */
1447 current_binding_level->level_chain->dead_vars_from_for
1448 = tree_cons (NULL_TREE, link,
1449 current_binding_level->level_chain->
1450 dead_vars_from_for);
1452 /* Although we don't pop the CPLUS_BINDING, we do clear
1453 its BINDING_LEVEL since the level is going away now. */
1454 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link)))
1460 /* Remove the binding. */
1462 if (TREE_CODE (decl) == TREE_LIST)
1463 decl = TREE_VALUE (decl);
1465 pop_binding (DECL_NAME (decl), decl);
1466 else if (TREE_CODE (decl) == OVERLOAD)
1467 pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl);
1469 my_friendly_abort (0);
1473 /* Remove declarations for any `for' variables from inner scopes
1474 that we kept around. */
1475 for (link = current_binding_level->dead_vars_from_for;
1476 link; link = TREE_CHAIN (link))
1477 pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));
1479 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1480 for (link = current_binding_level->type_shadowed;
1481 link; link = TREE_CHAIN (link))
1482 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));
1484 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1485 for (link = current_binding_level->shadowed_labels;
1487 link = TREE_CHAIN (link))
1488 pop_label (TREE_VALUE (link), TREE_PURPOSE (link));
1490 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1491 list if a `using' declaration put them there. The debugging
1492 back-ends won't understand OVERLOAD, so we remove them here.
1493 Because the BLOCK_VARS are (temporarily) shared with
1494 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1495 popped all the bindings. */
1500 for (d = &BLOCK_VARS (block); *d; )
1502 if (TREE_CODE (*d) == TREE_LIST)
1503 *d = TREE_CHAIN (*d);
1505 d = &TREE_CHAIN (*d);
1509 /* If the level being exited is the top level of a function,
1510 check over all the labels. */
1513 /* Since this is the top level block of a function, the vars are
1514 the function's parameters. Don't leave them in the BLOCK
1515 because they are found in the FUNCTION_DECL instead. */
1516 BLOCK_VARS (block) = 0;
1520 tmp = current_binding_level->keep;
1522 pop_binding_level ();
1524 DECL_INITIAL (current_function_decl) = block;
1526 current_binding_level->blocks
1527 = chainon (current_binding_level->blocks, block);
1529 /* If we did not make a block for the level just exited,
1530 any blocks made for inner levels
1531 (since they cannot be recorded as subblocks in that level)
1532 must be carried forward so they will later become subblocks
1533 of something else. */
1535 current_binding_level->blocks
1536 = chainon (current_binding_level->blocks, subblocks);
1538 /* Each and every BLOCK node created here in `poplevel' is important
1539 (e.g. for proper debugging information) so if we created one
1540 earlier, mark it as "used". */
1542 TREE_USED (block) = 1;
1544 /* Take care of compiler's internal binding structures. */
1550 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1553 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts)) = block;
1554 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts)) = block;
1557 block = poplevel (keep, reverse, functionbody);
1563 /* Delete the node BLOCK from the current binding level.
1564 This is used for the block inside a stmt expr ({...})
1565 so that the block can be reinserted where appropriate. */
1568 delete_block (block)
1572 if (current_binding_level->blocks == block)
1573 current_binding_level->blocks = TREE_CHAIN (block);
1574 for (t = current_binding_level->blocks; t;)
1576 if (TREE_CHAIN (t) == block)
1577 TREE_CHAIN (t) = TREE_CHAIN (block);
1581 TREE_CHAIN (block) = NULL_TREE;
1582 /* Clear TREE_USED which is always set by poplevel.
1583 The flag is set again if insert_block is called. */
1584 TREE_USED (block) = 0;
1587 /* Insert BLOCK at the end of the list of subblocks of the
1588 current binding level. This is used when a BIND_EXPR is expanded,
1589 to handle the BLOCK node inside the BIND_EXPR. */
1592 insert_block (block)
1595 TREE_USED (block) = 1;
1596 current_binding_level->blocks
1597 = chainon (current_binding_level->blocks, block);
1600 /* Set the BLOCK node for the innermost scope
1601 (the one we are currently in). */
1605 tree block ATTRIBUTE_UNUSED;
1607 /* The RTL expansion machinery requires us to provide this callback,
1608 but it is not applicable in function-at-a-time mode. */
1609 my_friendly_assert (cfun && !doing_semantic_analysis_p (), 20000911);
1612 /* Do a pushlevel for class declarations. */
1617 register struct binding_level *newlevel;
1619 /* Reuse or create a struct for this binding level. */
1620 #if defined(DEBUG_CP_BINDING_LEVELS)
1622 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1623 if (free_binding_level)
1624 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1626 newlevel = free_binding_level;
1627 free_binding_level = free_binding_level->level_chain;
1630 newlevel = make_binding_level ();
1632 #if defined(DEBUG_CP_BINDING_LEVELS)
1634 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1636 push_binding_level (newlevel, 0, 0);
1638 class_binding_level = current_binding_level;
1639 class_binding_level->parm_flag = 2;
1640 class_binding_level->this_class = current_class_type;
1643 /* ...and a poplevel for class declarations. */
1648 register struct binding_level *level = class_binding_level;
1651 my_friendly_assert (level != 0, 354);
1653 /* If we're leaving a toplevel class, don't bother to do the setting
1654 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1655 shouldn't even be used when current_class_type isn't set, and second,
1656 if we don't touch it here, we're able to use the cache effect if the
1657 next time we're entering a class scope, it is the same class. */
1658 if (current_class_depth != 1)
1660 struct binding_level* b;
1662 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1663 for (shadowed = level->class_shadowed;
1665 shadowed = TREE_CHAIN (shadowed))
1666 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = NULL_TREE;
1668 /* Find the next enclosing class, and recreate
1669 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1670 b = level->level_chain;
1671 while (b && b->parm_flag != 2)
1675 for (shadowed = b->class_shadowed;
1677 shadowed = TREE_CHAIN (shadowed))
1681 t = IDENTIFIER_BINDING (TREE_PURPOSE (shadowed));
1682 while (t && BINDING_LEVEL (t) != b)
1686 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed))
1687 = BINDING_VALUE (t);
1691 /* Remember to save what IDENTIFIER's were bound in this scope so we
1692 can recover from cache misses. */
1694 previous_class_type = current_class_type;
1695 previous_class_values = class_binding_level->class_shadowed;
1697 for (shadowed = level->type_shadowed;
1699 shadowed = TREE_CHAIN (shadowed))
1700 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
1702 /* Remove the bindings for all of the class-level declarations. */
1703 for (shadowed = level->class_shadowed;
1705 shadowed = TREE_CHAIN (shadowed))
1706 pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed));
1708 GNU_xref_end_scope ((HOST_WIDE_INT) class_binding_level,
1709 (HOST_WIDE_INT) class_binding_level->level_chain,
1710 class_binding_level->parm_flag,
1711 class_binding_level->keep);
1713 /* Now, pop out of the binding level which we created up in the
1714 `pushlevel_class' routine. */
1715 #if defined(DEBUG_CP_BINDING_LEVELS)
1717 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1719 pop_binding_level ();
1722 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1723 for any names in enclosing classes. */
1726 clear_identifier_class_values ()
1730 if (!class_binding_level)
1733 for (t = class_binding_level->class_shadowed;
1736 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
1739 /* Returns non-zero if T is a virtual function table. */
1742 vtable_decl_p (t, data)
1744 void *data ATTRIBUTE_UNUSED;
1746 return (TREE_CODE (t) == VAR_DECL && DECL_VIRTUAL_P (t));
1749 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1753 vtype_decl_p (t, data)
1755 void *data ATTRIBUTE_UNUSED;
1757 return (TREE_CODE (t) == TYPE_DECL
1758 && TREE_CODE (TREE_TYPE (t)) == RECORD_TYPE
1759 && TYPE_POLYMORPHIC_P (TREE_TYPE (t)));
1762 /* Return the declarations that are members of the namespace NS. */
1765 cp_namespace_decls (ns)
1768 return NAMESPACE_LEVEL (ns)->names;
1771 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1772 itself, calling F for each. The DATA is passed to F as well. */
1775 walk_namespaces_r (namespace, f, data)
1777 walk_namespaces_fn f;
1783 result |= (*f) (namespace, data);
1785 for (current = cp_namespace_decls (namespace);
1787 current = TREE_CHAIN (current))
1789 if (TREE_CODE (current) != NAMESPACE_DECL
1790 || DECL_NAMESPACE_ALIAS (current))
1793 /* We found a namespace. */
1794 result |= walk_namespaces_r (current, f, data);
1800 /* Walk all the namespaces, calling F for each. The DATA is passed to
1804 walk_namespaces (f, data)
1805 walk_namespaces_fn f;
1808 return walk_namespaces_r (global_namespace, f, data);
1811 struct walk_globals_data {
1812 walk_globals_pred p;
1817 /* Walk the global declarations in NAMESPACE. Whenever one is found
1818 for which P returns non-zero, call F with its address. If any call
1819 to F returns a non-zero value, return a non-zero value. */
1822 walk_globals_r (namespace, data)
1826 struct walk_globals_data* wgd = (struct walk_globals_data *) data;
1827 walk_globals_pred p = wgd->p;
1828 walk_globals_fn f = wgd->f;
1829 void *d = wgd->data;
1833 t = &NAMESPACE_LEVEL (namespace)->names;
1840 result |= (*f) (t, d);
1842 /* If F changed *T, then *T still points at the next item to
1845 t = &TREE_CHAIN (*t);
1851 /* Walk the global declarations. Whenever one is found for which P
1852 returns non-zero, call F with its address. If any call to F
1853 returns a non-zero value, return a non-zero value. */
1856 walk_globals (p, f, data)
1857 walk_globals_pred p;
1861 struct walk_globals_data wgd;
1866 return walk_namespaces (walk_globals_r, &wgd);
1869 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1870 DATA is non-NULL, this is the last time we will call
1871 wrapup_global_declarations for this NAMESPACE. */
1874 wrapup_globals_for_namespace (namespace, data)
1878 tree globals = cp_namespace_decls (namespace);
1879 int len = list_length (globals);
1880 tree *vec = (tree *) alloca (sizeof (tree) * len);
1884 int last_time = (data != 0);
1886 if (last_time && namespace == global_namespace)
1887 /* Let compile_file handle the global namespace. */
1890 /* Process the decls in reverse order--earliest first.
1891 Put them into VEC from back to front, then take out from front. */
1892 for (i = 0, decl = globals; i < len; i++, decl = TREE_CHAIN (decl))
1893 vec[len - i - 1] = decl;
1897 check_global_declarations (vec, len);
1901 /* Temporarily mark vtables as external. That prevents
1902 wrapup_global_declarations from writing them out; we must process
1903 them ourselves in finish_vtable_vardecl. */
1904 for (i = 0; i < len; ++i)
1905 if (vtable_decl_p (vec[i], /*data=*/0) && !DECL_EXTERNAL (vec[i]))
1907 DECL_NOT_REALLY_EXTERN (vec[i]) = 1;
1908 DECL_EXTERNAL (vec[i]) = 1;
1911 /* Write out any globals that need to be output. */
1912 result = wrapup_global_declarations (vec, len);
1914 /* Undo the hack to DECL_EXTERNAL above. */
1915 for (i = 0; i < len; ++i)
1916 if (vtable_decl_p (vec[i], /*data=*/0)
1917 && DECL_NOT_REALLY_EXTERN (vec[i]))
1919 DECL_NOT_REALLY_EXTERN (vec[i]) = 0;
1920 DECL_EXTERNAL (vec[i]) = 0;
1927 /* Mark ARG (which is really a struct binding_level **) for GC. */
1930 mark_binding_level (arg)
1933 struct binding_level *lvl = *(struct binding_level **)arg;
1935 for (; lvl; lvl = lvl->level_chain)
1937 ggc_mark_tree (lvl->names);
1938 ggc_mark_tree (lvl->tags);
1939 ggc_mark_tree (lvl->usings);
1940 ggc_mark_tree (lvl->using_directives);
1941 ggc_mark_tree (lvl->class_shadowed);
1942 ggc_mark_tree (lvl->type_shadowed);
1943 ggc_mark_tree (lvl->shadowed_labels);
1944 ggc_mark_tree (lvl->blocks);
1945 ggc_mark_tree (lvl->this_class);
1946 ggc_mark_tree (lvl->incomplete);
1947 ggc_mark_tree (lvl->dead_vars_from_for);
1952 mark_named_label_lists (labs, uses)
1956 struct named_label_list *l = *(struct named_label_list **)labs;
1957 struct named_label_use_list *u = *(struct named_label_use_list **)uses;
1959 for (; l; l = l->next)
1962 mark_binding_level (l->binding_level);
1963 ggc_mark_tree (l->old_value);
1964 ggc_mark_tree (l->label_decl);
1965 ggc_mark_tree (l->bad_decls);
1968 for (; u; u = u->next)
1972 /* For debugging. */
1973 static int no_print_functions = 0;
1974 static int no_print_builtins = 0;
1977 print_binding_level (lvl)
1978 struct binding_level *lvl;
1982 fprintf (stderr, " blocks=");
1983 fprintf (stderr, HOST_PTR_PRINTF, lvl->blocks);
1984 fprintf (stderr, " n_incomplete=%d parm_flag=%d keep=%d",
1985 list_length (lvl->incomplete), lvl->parm_flag, lvl->keep);
1986 if (lvl->tag_transparent)
1987 fprintf (stderr, " tag-transparent");
1988 if (lvl->more_cleanups_ok)
1989 fprintf (stderr, " more-cleanups-ok");
1990 if (lvl->have_cleanups)
1991 fprintf (stderr, " have-cleanups");
1992 fprintf (stderr, "\n");
1995 fprintf (stderr, " names:\t");
1996 /* We can probably fit 3 names to a line? */
1997 for (t = lvl->names; t; t = TREE_CHAIN (t))
1999 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
2001 if (no_print_builtins
2002 && (TREE_CODE (t) == TYPE_DECL)
2003 && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>")))
2006 /* Function decls tend to have longer names. */
2007 if (TREE_CODE (t) == FUNCTION_DECL)
2014 fprintf (stderr, "\n\t");
2017 print_node_brief (stderr, "", t, 0);
2018 if (t == error_mark_node)
2022 fprintf (stderr, "\n");
2026 fprintf (stderr, " tags:\t");
2028 for (t = lvl->tags; t; t = TREE_CHAIN (t))
2030 if (TREE_PURPOSE (t) == NULL_TREE)
2032 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
2039 fprintf (stderr, "\n\t");
2042 if (TREE_PURPOSE (t) == NULL_TREE)
2044 print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0);
2045 fprintf (stderr, ">");
2047 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
2048 print_node_brief (stderr, "", TREE_VALUE (t), 0);
2051 print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0);
2052 print_node_brief (stderr, "", TREE_VALUE (t), 0);
2053 fprintf (stderr, ">");
2057 fprintf (stderr, "\n");
2059 if (lvl->class_shadowed)
2061 fprintf (stderr, " class-shadowed:");
2062 for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t))
2064 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
2066 fprintf (stderr, "\n");
2068 if (lvl->type_shadowed)
2070 fprintf (stderr, " type-shadowed:");
2071 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
2073 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
2075 fprintf (stderr, "\n");
2080 print_other_binding_stack (stack)
2081 struct binding_level *stack;
2083 struct binding_level *level;
2084 for (level = stack; level != global_binding_level; level = level->level_chain)
2086 fprintf (stderr, "binding level ");
2087 fprintf (stderr, HOST_PTR_PRINTF, level);
2088 fprintf (stderr, "\n");
2089 print_binding_level (level);
2094 print_binding_stack ()
2096 struct binding_level *b;
2097 fprintf (stderr, "current_binding_level=");
2098 fprintf (stderr, HOST_PTR_PRINTF, current_binding_level);
2099 fprintf (stderr, "\nclass_binding_level=");
2100 fprintf (stderr, HOST_PTR_PRINTF, class_binding_level);
2101 fprintf (stderr, "\nglobal_binding_level=");
2102 fprintf (stderr, HOST_PTR_PRINTF, global_binding_level);
2103 fprintf (stderr, "\n");
2104 if (class_binding_level)
2106 for (b = class_binding_level; b; b = b->level_chain)
2107 if (b == current_binding_level)
2110 b = class_binding_level;
2112 b = current_binding_level;
2115 b = current_binding_level;
2116 print_other_binding_stack (b);
2117 fprintf (stderr, "global:\n");
2118 print_binding_level (global_binding_level);
2121 /* Namespace binding access routines: The namespace_bindings field of
2122 the identifier is polymorphic, with three possible values:
2123 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2124 indicating the BINDING_VALUE of global_namespace. */
2126 /* Check whether the a binding for the name to scope is known.
2127 Assumes that the bindings of the name are already a list
2128 of bindings. Returns the binding found, or NULL_TREE. */
2131 find_binding (name, scope)
2135 tree iter, prev = NULL_TREE;
2137 scope = ORIGINAL_NAMESPACE (scope);
2139 for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter;
2140 iter = TREE_CHAIN (iter))
2142 my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374);
2143 if (BINDING_SCOPE (iter) == scope)
2145 /* Move binding found to the front of the list, so
2146 subsequent lookups will find it faster. */
2149 TREE_CHAIN (prev) = TREE_CHAIN (iter);
2150 TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name);
2151 IDENTIFIER_NAMESPACE_BINDINGS (name) = iter;
2160 /* Always returns a binding for name in scope. If the
2161 namespace_bindings is not a list, convert it to one first.
2162 If no binding is found, make a new one. */
2165 binding_for_name (name, scope)
2169 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2172 scope = ORIGINAL_NAMESPACE (scope);
2174 if (b && TREE_CODE (b) != CPLUS_BINDING)
2176 /* Get rid of optimization for global scope. */
2177 IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE;
2178 BINDING_VALUE (binding_for_name (name, global_namespace)) = b;
2179 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2181 if (b && (result = find_binding (name, scope)))
2183 /* Not found, make a new one. */
2184 result = make_node (CPLUS_BINDING);
2185 TREE_CHAIN (result) = b;
2186 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
2187 BINDING_SCOPE (result) = scope;
2188 BINDING_TYPE (result) = NULL_TREE;
2189 BINDING_VALUE (result) = NULL_TREE;
2193 /* Return the binding value for name in scope, considering that
2194 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2197 namespace_binding (name, scope)
2201 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2204 if (scope == NULL_TREE)
2205 scope = global_namespace;
2206 if (TREE_CODE (b) != CPLUS_BINDING)
2207 return (scope == global_namespace) ? b : NULL_TREE;
2208 name = find_binding (name,scope);
2209 if (name == NULL_TREE)
2211 return BINDING_VALUE (name);
2214 /* Set the binding value for name in scope. If modifying the binding
2215 of global_namespace is attempted, try to optimize it. */
2218 set_namespace_binding (name, scope, val)
2225 if (scope == NULL_TREE)
2226 scope = global_namespace;
2228 if (scope == global_namespace)
2230 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2231 if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING)
2233 IDENTIFIER_NAMESPACE_BINDINGS (name) = val;
2237 b = binding_for_name (name, scope);
2238 BINDING_VALUE (b) = val;
2241 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2242 select a name that is unique to this compilation unit. */
2245 push_namespace (name)
2250 int implicit_use = 0;
2252 if (!global_namespace)
2254 /* This must be ::. */
2255 my_friendly_assert (name == get_identifier ("::"), 377);
2260 /* The name of anonymous namespace is unique for the translation
2262 if (!anonymous_namespace_name)
2263 anonymous_namespace_name = get_file_function_name ('N');
2264 name = anonymous_namespace_name;
2265 d = IDENTIFIER_NAMESPACE_VALUE (name);
2267 /* Reopening anonymous namespace. */
2273 /* Check whether this is an extended namespace definition. */
2274 d = IDENTIFIER_NAMESPACE_VALUE (name);
2275 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2278 if (DECL_NAMESPACE_ALIAS (d))
2280 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2281 d, DECL_NAMESPACE_ALIAS (d));
2282 d = DECL_NAMESPACE_ALIAS (d);
2289 /* Make a new namespace, binding the name to it. */
2290 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2291 /* The global namespace is not pushed, and the global binding
2292 level is set elsewhere. */
2295 DECL_CONTEXT (d) = FROB_CONTEXT (current_namespace);
2298 declare_namespace_level ();
2299 NAMESPACE_LEVEL (d) = current_binding_level;
2303 resume_binding_level (NAMESPACE_LEVEL (d));
2306 do_using_directive (d);
2307 /* Enter the name space. */
2308 current_namespace = d;
2311 /* Pop from the scope of the current namespace. */
2316 my_friendly_assert (current_namespace != global_namespace, 20010801);
2317 current_namespace = CP_DECL_CONTEXT (current_namespace);
2318 /* The binding level is not popped, as it might be re-opened later. */
2319 suspend_binding_level ();
2322 /* Push into the scope of the namespace NS, even if it is deeply
2323 nested within another namespace. */
2326 push_nested_namespace (ns)
2329 if (ns == global_namespace)
2330 push_to_top_level ();
2333 push_nested_namespace (CP_DECL_CONTEXT (ns));
2334 push_namespace (DECL_NAME (ns));
2338 /* Pop back from the scope of the namespace NS, which was previously
2339 entered with push_nested_namespace. */
2342 pop_nested_namespace (ns)
2345 while (ns != global_namespace)
2348 ns = CP_DECL_CONTEXT (ns);
2351 pop_from_top_level ();
2355 /* Subroutines for reverting temporarily to top-level for instantiation
2356 of templates and such. We actually need to clear out the class- and
2357 local-value slots of all identifiers, so that only the global values
2358 are at all visible. Simply setting current_binding_level to the global
2359 scope isn't enough, because more binding levels may be pushed. */
2360 struct saved_scope *scope_chain;
2362 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2365 mark_saved_scope (arg)
2368 struct saved_scope *t = *(struct saved_scope **)arg;
2371 mark_binding_level (&t->class_bindings);
2372 ggc_mark_tree (t->old_bindings);
2373 ggc_mark_tree (t->old_namespace);
2374 ggc_mark_tree (t->decl_ns_list);
2375 ggc_mark_tree (t->class_name);
2376 ggc_mark_tree (t->class_type);
2377 ggc_mark_tree (t->access_specifier);
2378 ggc_mark_tree (t->function_decl);
2380 ggc_mark_tree_varray (t->lang_base);
2381 ggc_mark_tree (t->lang_name);
2382 ggc_mark_tree (t->template_parms);
2383 ggc_mark_tree (t->x_previous_class_type);
2384 ggc_mark_tree (t->x_previous_class_values);
2385 ggc_mark_tree (t->x_saved_tree);
2386 ggc_mark_tree (t->incomplete);
2387 ggc_mark_tree (t->lookups);
2389 mark_stmt_tree (&t->x_stmt_tree);
2390 mark_binding_level (&t->bindings);
2396 store_bindings (names, old_bindings)
2397 tree names, old_bindings;
2400 tree search_bindings = old_bindings;
2402 for (t = names; t; t = TREE_CHAIN (t))
2404 tree binding, t1, id;
2406 if (TREE_CODE (t) == TREE_LIST)
2407 id = TREE_PURPOSE (t);
2412 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2413 we have no IDENTIFIER_BINDING if we have left the class
2414 scope, but cached the class-level declarations. */
2415 || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2418 for (t1 = search_bindings; t1; t1 = TREE_CHAIN (t1))
2419 if (TREE_VEC_ELT (t1, 0) == id)
2422 my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2423 binding = make_tree_vec (4);
2424 TREE_VEC_ELT (binding, 0) = id;
2425 TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2426 TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2427 TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2428 IDENTIFIER_BINDING (id) = NULL_TREE;
2429 IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2430 TREE_CHAIN (binding) = old_bindings;
2431 old_bindings = binding;
2435 return old_bindings;
2439 maybe_push_to_top_level (pseudo)
2442 struct saved_scope *s;
2443 struct binding_level *b;
2447 s = (struct saved_scope *) xcalloc (1, sizeof (struct saved_scope));
2449 b = scope_chain ? current_binding_level : 0;
2451 /* If we're in the middle of some function, save our state. */
2455 push_function_context_to (NULL_TREE);
2460 old_bindings = NULL_TREE;
2461 if (scope_chain && previous_class_type)
2462 old_bindings = store_bindings (previous_class_values, old_bindings);
2464 /* Have to include global_binding_level, because class-level decls
2465 aren't listed anywhere useful. */
2466 for (; b; b = b->level_chain)
2470 /* Template IDs are inserted into the global level. If they were
2471 inserted into namespace level, finish_file wouldn't find them
2472 when doing pending instantiations. Therefore, don't stop at
2473 namespace level, but continue until :: . */
2474 if (b == global_binding_level || (pseudo && b->template_parms_p))
2477 old_bindings = store_bindings (b->names, old_bindings);
2478 /* We also need to check class_shadowed to save class-level type
2479 bindings, since pushclass doesn't fill in b->names. */
2480 if (b->parm_flag == 2)
2481 old_bindings = store_bindings (b->class_shadowed, old_bindings);
2483 /* Unwind type-value slots back to top level. */
2484 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2485 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2487 s->prev = scope_chain;
2488 s->old_bindings = old_bindings;
2490 s->need_pop_function_context = need_pop;
2491 s->function_decl = current_function_decl;
2494 current_function_decl = NULL_TREE;
2495 VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base");
2496 current_lang_name = lang_name_cplusplus;
2497 current_namespace = global_namespace;
2501 push_to_top_level ()
2503 maybe_push_to_top_level (0);
2507 pop_from_top_level ()
2509 struct saved_scope *s = scope_chain;
2512 /* Clear out class-level bindings cache. */
2513 if (previous_class_type)
2514 invalidate_class_lookup_cache ();
2516 VARRAY_FREE (current_lang_base);
2518 scope_chain = s->prev;
2519 for (t = s->old_bindings; t; t = TREE_CHAIN (t))
2521 tree id = TREE_VEC_ELT (t, 0);
2523 SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2524 IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2525 IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2528 /* If we were in the middle of compiling a function, restore our
2530 if (s->need_pop_function_context)
2531 pop_function_context_from (NULL_TREE);
2532 current_function_decl = s->function_decl;
2537 /* Push a definition of struct, union or enum tag "name".
2538 into binding_level "b". "type" should be the type node,
2539 We assume that the tag "name" is not already defined.
2541 Note that the definition may really be just a forward reference.
2542 In that case, the TYPE_SIZE will be a NULL_TREE.
2544 C++ gratuitously puts all these tags in the name space. */
2546 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2547 record the shadowed value for this binding contour. TYPE is
2548 the type that ID maps to. */
2551 set_identifier_type_value_with_scope (id, type, b)
2554 struct binding_level *b;
2556 if (!b->namespace_p)
2558 /* Shadow the marker, not the real thing, so that the marker
2559 gets restored later. */
2560 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2562 = tree_cons (id, old_type_value, b->type_shadowed);
2566 tree binding = binding_for_name (id, current_namespace);
2567 BINDING_TYPE (binding) = type;
2568 /* Store marker instead of real type. */
2569 type = global_type_node;
2571 SET_IDENTIFIER_TYPE_VALUE (id, type);
2574 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2577 set_identifier_type_value (id, type)
2581 set_identifier_type_value_with_scope (id, type, current_binding_level);
2584 /* Return the type associated with id. */
2587 identifier_type_value (id)
2590 /* There is no type with that name, anywhere. */
2591 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2593 /* This is not the type marker, but the real thing. */
2594 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2595 return REAL_IDENTIFIER_TYPE_VALUE (id);
2596 /* Have to search for it. It must be on the global level, now.
2597 Ask lookup_name not to return non-types. */
2598 id = lookup_name_real (id, 2, 1, 0);
2600 return TREE_TYPE (id);
2604 /* Pop off extraneous binding levels left over due to syntax errors.
2606 We don't pop past namespaces, as they might be valid. */
2611 #ifdef DEBUG_CP_BINDING_LEVELS
2612 fprintf (stderr, "XXX entering pop_everything ()\n");
2614 while (!toplevel_bindings_p ())
2616 if (current_binding_level->parm_flag == 2)
2617 pop_nested_class ();
2621 #ifdef DEBUG_CP_BINDING_LEVELS
2622 fprintf (stderr, "XXX leaving pop_everything ()\n");
2626 /* The type TYPE is being declared. If it is a class template, or a
2627 specialization of a class template, do any processing required and
2628 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2629 being declared a friend. B is the binding level at which this TYPE
2632 Returns the TYPE_DECL for TYPE, which may have been altered by this
2636 maybe_process_template_type_declaration (type, globalize, b)
2639 struct binding_level* b;
2641 tree decl = TYPE_NAME (type);
2643 if (processing_template_parmlist)
2644 /* You can't declare a new template type in a template parameter
2645 list. But, you can declare a non-template type:
2647 template <class A*> struct S;
2649 is a forward-declaration of `A'. */
2653 maybe_check_template_type (type);
2655 my_friendly_assert (IS_AGGR_TYPE (type)
2656 || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2659 if (processing_template_decl)
2661 /* This may change after the call to
2662 push_template_decl_real, but we want the original value. */
2663 tree name = DECL_NAME (decl);
2665 decl = push_template_decl_real (decl, globalize);
2666 /* If the current binding level is the binding level for the
2667 template parameters (see the comment in
2668 begin_template_parm_list) and the enclosing level is a class
2669 scope, and we're not looking at a friend, push the
2670 declaration of the member class into the class scope. In the
2671 friend case, push_template_decl will already have put the
2672 friend into global scope, if appropriate. */
2673 if (TREE_CODE (type) != ENUMERAL_TYPE
2674 && !globalize && b->template_parms_p
2675 && b->level_chain->parm_flag == 2)
2677 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2678 /* Put this tag on the list of tags for the class, since
2679 that won't happen below because B is not the class
2680 binding level, but is instead the pseudo-global level. */
2681 b->level_chain->tags =
2682 tree_cons (name, type, b->level_chain->tags);
2683 if (!COMPLETE_TYPE_P (current_class_type))
2684 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2692 /* In C++, you don't have to write `struct S' to refer to `S'; you
2693 can just use `S'. We accomplish this by creating a TYPE_DECL as
2694 if the user had written `typedef struct S S'. Create and return
2695 the TYPE_DECL for TYPE. */
2698 create_implicit_typedef (name, type)
2704 decl = build_decl (TYPE_DECL, name, type);
2705 DECL_ARTIFICIAL (decl) = 1;
2706 /* There are other implicit type declarations, like the one *within*
2707 a class that allows you to write `S::S'. We must distinguish
2709 SET_DECL_IMPLICIT_TYPEDEF_P (decl);
2710 TYPE_NAME (type) = decl;
2715 /* Remember a local name for name-mangling purposes. */
2718 push_local_name (decl)
2725 VARRAY_TREE_INIT (local_names, 8, "local_names");
2727 name = DECL_NAME (decl);
2729 nelts = VARRAY_ACTIVE_SIZE (local_names);
2730 for (i = 0; i < nelts; i++)
2732 t = VARRAY_TREE (local_names, i);
2733 if (DECL_NAME (t) == name)
2735 if (!DECL_LANG_SPECIFIC (decl))
2736 retrofit_lang_decl (decl);
2737 if (DECL_LANG_SPECIFIC (t))
2738 DECL_DISCRIMINATOR (decl) = DECL_DISCRIMINATOR (t) + 1;
2740 DECL_DISCRIMINATOR (decl) = 1;
2742 VARRAY_TREE (local_names, i) = decl;
2747 VARRAY_PUSH_TREE (local_names, decl);
2750 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2751 Normally put it into the inner-most non-tag-transparent scope,
2752 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2753 The latter is needed for implicit declarations. */
2756 pushtag (name, type, globalize)
2760 register struct binding_level *b;
2762 b = current_binding_level;
2763 while (b->tag_transparent
2764 || (b->parm_flag == 2
2766 /* We may be defining a new type in the initializer
2767 of a static member variable. We allow this when
2768 not pedantic, and it is particularly useful for
2769 type punning via an anonymous union. */
2770 || COMPLETE_TYPE_P (b->this_class))))
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 && TYPE_P (cs))
2791 /* When declaring a friend class of a local class, we want
2792 to inject the newly named class into the scope
2793 containing the local class, not the namespace scope. */
2794 context = decl_function_context (get_type_decl (cs));
2797 context = current_namespace;
2799 if ((b->template_parms_p && b->level_chain->parm_flag == 2)
2800 || b->parm_flag == 2)
2803 if (current_lang_name == lang_name_java)
2804 TYPE_FOR_JAVA (type) = 1;
2806 d = create_implicit_typedef (name, type);
2807 DECL_CONTEXT (d) = FROB_CONTEXT (context);
2809 set_identifier_type_value_with_scope (name, type, b);
2811 d = maybe_process_template_type_declaration (type,
2814 if (b->parm_flag == 2)
2816 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2817 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2818 class. But if it's a member template class, we
2819 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2821 finish_member_declaration (d);
2823 pushdecl_class_level (d);
2826 d = pushdecl_with_scope (d, b);
2828 /* FIXME what if it gets a name from typedef? */
2829 if (ANON_AGGRNAME_P (name))
2830 DECL_IGNORED_P (d) = 1;
2832 TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2834 /* If this is a local class, keep track of it. We need this
2835 information for name-mangling, and so that it is possible to find
2836 all function definitions in a translation unit in a convenient
2837 way. (It's otherwise tricky to find a member function definition
2838 it's only pointed to from within a local class.) */
2839 if (TYPE_CONTEXT (type)
2840 && TREE_CODE (TYPE_CONTEXT (type)) == FUNCTION_DECL
2841 && !processing_template_decl)
2842 VARRAY_PUSH_TREE (local_classes, type);
2844 if (b->parm_flag == 2)
2846 if (!COMPLETE_TYPE_P (current_class_type))
2847 CLASSTYPE_TAGS (current_class_type) = b->tags;
2851 if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2852 /* Use the canonical TYPE_DECL for this node. */
2853 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2856 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2857 will be the tagged type we just added to the current
2858 binding level. This fake NULL-named TYPE_DECL node helps
2859 dwarfout.c to know when it needs to output a
2860 representation of a tagged type, and it also gives us a
2861 convenient place to record the "scope start" address for
2864 tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2865 TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2869 /* Counter used to create anonymous type names. */
2871 static int anon_cnt = 0;
2873 /* Return an IDENTIFIER which can be used as a name for
2874 anonymous structs and unions. */
2881 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2882 return get_identifier (buf);
2885 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2886 This keeps dbxout from getting confused. */
2891 register struct binding_level *b;
2893 static int last_cnt = 0;
2895 /* Fast out if no new anon names were declared. */
2896 if (last_cnt == anon_cnt)
2899 b = current_binding_level;
2900 while (b->tag_transparent)
2905 /* A NULL purpose means we have already processed all tags
2906 from here to the end of the list. */
2907 if (TREE_PURPOSE (tags) == NULL_TREE)
2909 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2910 TREE_PURPOSE (tags) = NULL_TREE;
2911 tags = TREE_CHAIN (tags);
2913 last_cnt = anon_cnt;
2916 /* Subroutine of duplicate_decls: return truthvalue of whether
2917 or not types of these decls match.
2919 For C++, we must compare the parameter list so that `int' can match
2920 `int&' in a parameter position, but `int&' is not confused with
2924 decls_match (newdecl, olddecl)
2925 tree newdecl, olddecl;
2929 if (newdecl == olddecl)
2932 if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
2933 /* If the two DECLs are not even the same kind of thing, we're not
2934 interested in their types. */
2937 if (TREE_CODE (newdecl) == FUNCTION_DECL)
2939 tree f1 = TREE_TYPE (newdecl);
2940 tree f2 = TREE_TYPE (olddecl);
2941 tree p1 = TYPE_ARG_TYPES (f1);
2942 tree p2 = TYPE_ARG_TYPES (f2);
2944 if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)
2945 && ! (DECL_EXTERN_C_P (newdecl)
2946 && DECL_EXTERN_C_P (olddecl)))
2949 if (TREE_CODE (f1) != TREE_CODE (f2))
2952 if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
2954 if (p2 == NULL_TREE && DECL_EXTERN_C_P (olddecl)
2955 && (DECL_BUILT_IN (olddecl)
2956 #ifndef NO_IMPLICIT_EXTERN_C
2957 || (DECL_IN_SYSTEM_HEADER (newdecl) && !DECL_CLASS_SCOPE_P (newdecl))
2958 || (DECL_IN_SYSTEM_HEADER (olddecl) && !DECL_CLASS_SCOPE_P (olddecl))
2962 types_match = self_promoting_args_p (p1);
2963 if (p1 == void_list_node)
2964 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2966 #ifndef NO_IMPLICIT_EXTERN_C
2967 else if (p1 == NULL_TREE
2968 && (DECL_EXTERN_C_P (olddecl)
2969 && DECL_IN_SYSTEM_HEADER (olddecl)
2970 && !DECL_CLASS_SCOPE_P (olddecl))
2971 && (DECL_EXTERN_C_P (newdecl)
2972 && DECL_IN_SYSTEM_HEADER (newdecl)
2973 && !DECL_CLASS_SCOPE_P (newdecl)))
2975 types_match = self_promoting_args_p (p2);
2976 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2980 types_match = compparms (p1, p2);
2985 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
2987 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
2988 DECL_TEMPLATE_PARMS (olddecl)))
2991 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl))
2992 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)))
2995 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
2998 types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
2999 DECL_TEMPLATE_RESULT (newdecl));
3003 if (TREE_TYPE (newdecl) == error_mark_node)
3004 types_match = TREE_TYPE (olddecl) == error_mark_node;
3005 else if (TREE_TYPE (olddecl) == NULL_TREE)
3006 types_match = TREE_TYPE (newdecl) == NULL_TREE;
3007 else if (TREE_TYPE (newdecl) == NULL_TREE)
3010 types_match = comptypes (TREE_TYPE (newdecl),
3011 TREE_TYPE (olddecl),
3012 COMPARE_REDECLARATION);
3018 /* If NEWDECL is `static' and an `extern' was seen previously,
3019 warn about it. OLDDECL is the previous declaration.
3021 Note that this does not apply to the C++ case of declaring
3022 a variable `extern const' and then later `const'.
3024 Don't complain about built-in functions, since they are beyond
3025 the user's control. */
3028 warn_extern_redeclared_static (newdecl, olddecl)
3029 tree newdecl, olddecl;
3031 static const char *explicit_extern_static_warning
3032 = "`%D' was declared `extern' and later `static'";
3033 static const char *implicit_extern_static_warning
3034 = "`%D' was declared implicitly `extern' and later `static'";
3038 if (TREE_CODE (newdecl) == TYPE_DECL
3039 || TREE_CODE (newdecl) == TEMPLATE_DECL
3040 || TREE_CODE (newdecl) == CONST_DECL)
3043 /* Don't get confused by static member functions; that's a different
3045 if (TREE_CODE (newdecl) == FUNCTION_DECL
3046 && DECL_STATIC_FUNCTION_P (newdecl))
3049 /* If the old declaration was `static', or the new one isn't, then
3050 then everything is OK. */
3051 if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl))
3054 /* It's OK to declare a builtin function as `static'. */
3055 if (TREE_CODE (olddecl) == FUNCTION_DECL
3056 && DECL_ARTIFICIAL (olddecl))
3059 name = DECL_ASSEMBLER_NAME (newdecl);
3060 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
3061 ? implicit_extern_static_warning
3062 : explicit_extern_static_warning, newdecl);
3063 cp_pedwarn_at ("previous declaration of `%D'", olddecl);
3066 /* Handle when a new declaration NEWDECL has the same name as an old
3067 one OLDDECL in the same binding contour. Prints an error message
3070 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3071 Otherwise, return 0. */
3074 duplicate_decls (newdecl, olddecl)
3075 tree newdecl, olddecl;
3077 unsigned olddecl_uid = DECL_UID (olddecl);
3078 int olddecl_friend = 0, types_match = 0;
3079 int new_defines_function = 0;
3081 if (newdecl == olddecl)
3084 types_match = decls_match (newdecl, olddecl);
3086 /* If either the type of the new decl or the type of the old decl is an
3087 error_mark_node, then that implies that we have already issued an
3088 error (earlier) for some bogus type specification, and in that case,
3089 it is rather pointless to harass the user with yet more error message
3090 about the same declaration, so just pretend the types match here. */
3091 if (TREE_TYPE (newdecl) == error_mark_node
3092 || TREE_TYPE (olddecl) == error_mark_node)
3095 /* Check for redeclaration and other discrepancies. */
3096 if (TREE_CODE (olddecl) == FUNCTION_DECL
3097 && DECL_ARTIFICIAL (olddecl))
3099 if (TREE_CODE (newdecl) != FUNCTION_DECL)
3101 /* If you declare a built-in or predefined function name as static,
3102 the old definition is overridden, but optionally warn this was a
3103 bad choice of name. */
3104 if (! TREE_PUBLIC (newdecl))
3107 cp_warning ("shadowing %s function `%#D'",
3108 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3110 /* Discard the old built-in function. */
3113 /* If the built-in is not ansi, then programs can override
3114 it even globally without an error. */
3115 else if (! DECL_BUILT_IN (olddecl))
3116 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3120 cp_error ("declaration of `%#D'", newdecl);
3121 cp_error ("conflicts with built-in declaration `%#D'",
3126 else if (!types_match)
3128 if ((DECL_EXTERN_C_P (newdecl)
3129 && DECL_EXTERN_C_P (olddecl))
3130 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3131 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3133 /* A near match; override the builtin. */
3135 if (TREE_PUBLIC (newdecl))
3137 cp_warning ("new declaration `%#D'", newdecl);
3138 cp_warning ("ambiguates built-in declaration `%#D'",
3141 else if (warn_shadow)
3142 cp_warning ("shadowing %s function `%#D'",
3143 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3147 /* Discard the old built-in function. */
3151 if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl))
3153 /* If a builtin function is redeclared as `static', merge
3154 the declarations, but make the original one static. */
3155 DECL_THIS_STATIC (olddecl) = 1;
3156 TREE_PUBLIC (olddecl) = 0;
3158 /* Make the old declaration consistent with the new one so
3159 that all remnants of the builtin-ness of this function
3160 will be banished. */
3161 SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl));
3162 SET_DECL_RTL (olddecl, DECL_RTL (newdecl));
3163 COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl);
3164 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl),
3168 else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
3170 if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
3171 && TREE_CODE (newdecl) != TYPE_DECL
3172 && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
3173 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
3174 || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
3175 && TREE_CODE (olddecl) != TYPE_DECL
3176 && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
3177 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
3180 /* We do nothing special here, because C++ does such nasty
3181 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3182 get shadowed, and know that if we need to find a TYPE_DECL
3183 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3184 slot of the identifier. */
3188 if ((TREE_CODE (newdecl) == FUNCTION_DECL
3189 && DECL_FUNCTION_TEMPLATE_P (olddecl))
3190 || (TREE_CODE (olddecl) == FUNCTION_DECL
3191 && DECL_FUNCTION_TEMPLATE_P (newdecl)))
3194 cp_error ("`%#D' redeclared as different kind of symbol", newdecl);
3195 if (TREE_CODE (olddecl) == TREE_LIST)
3196 olddecl = TREE_VALUE (olddecl);
3197 cp_error_at ("previous declaration of `%#D'", olddecl);
3199 /* New decl is completely inconsistent with the old one =>
3200 tell caller to replace the old one. */
3204 else if (!types_match)
3206 if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl))
3207 /* These are certainly not duplicate declarations; they're
3208 from different scopes. */
3211 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3213 /* The name of a class template may not be declared to refer to
3214 any other template, class, function, object, namespace, value,
3215 or type in the same scope. */
3216 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
3217 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3219 cp_error ("declaration of template `%#D'", newdecl);
3220 cp_error_at ("conflicts with previous declaration `%#D'",
3223 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
3224 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
3225 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
3226 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
3227 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3228 DECL_TEMPLATE_PARMS (olddecl)))
3230 cp_error ("new declaration `%#D'", newdecl);
3231 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3235 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3237 if (DECL_EXTERN_C_P (newdecl) && DECL_EXTERN_C_P (olddecl))
3239 cp_error ("declaration of C function `%#D' conflicts with",
3241 cp_error_at ("previous declaration `%#D' here", olddecl);
3243 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3244 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3246 cp_error ("new declaration `%#D'", newdecl);
3247 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3253 /* Already complained about this, so don't do so again. */
3254 else if (current_class_type == NULL_TREE
3255 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
3257 cp_error ("conflicting types for `%#D'", newdecl);
3258 cp_error_at ("previous declaration as `%#D'", olddecl);
3261 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3262 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3263 && (!DECL_TEMPLATE_INFO (newdecl)
3264 || (DECL_TI_TEMPLATE (newdecl)
3265 != DECL_TI_TEMPLATE (olddecl))))
3266 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3267 && (!DECL_TEMPLATE_INFO (olddecl)
3268 || (DECL_TI_TEMPLATE (olddecl)
3269 != DECL_TI_TEMPLATE (newdecl))))))
3270 /* It's OK to have a template specialization and a non-template
3271 with the same type, or to have specializations of two
3272 different templates with the same type. Note that if one is a
3273 specialization, and the other is an instantiation of the same
3274 template, that we do not exit at this point. That situation
3275 can occur if we instantiate a template class, and then
3276 specialize one of its methods. This situation is legal, but
3277 the declarations must be merged in the usual way. */
3279 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3280 && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3281 && !DECL_USE_TEMPLATE (newdecl))
3282 || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3283 && !DECL_USE_TEMPLATE (olddecl))))
3284 /* One of the declarations is a template instantiation, and the
3285 other is not a template at all. That's OK. */
3287 else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3288 && DECL_NAMESPACE_ALIAS (newdecl)
3289 && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3290 /* Redeclaration of namespace alias, ignore it. */
3294 const char *errmsg = redeclaration_error_message (newdecl, olddecl);
3297 cp_error (errmsg, newdecl);
3298 if (DECL_NAME (olddecl) != NULL_TREE)
3299 cp_error_at ((DECL_INITIAL (olddecl)
3300 && namespace_bindings_p ())
3301 ? "`%#D' previously defined here"
3302 : "`%#D' previously declared here", olddecl);
3304 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3305 && DECL_INITIAL (olddecl) != NULL_TREE
3306 && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3307 && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3309 /* Prototype decl follows defn w/o prototype. */
3310 cp_warning_at ("prototype for `%#D'", newdecl);
3311 cp_warning_at ("follows non-prototype definition here", olddecl);
3313 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3314 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3316 /* extern "C" int foo ();
3317 int foo () { bar (); }
3319 if (current_lang_depth () == 0)
3320 SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl));
3323 cp_error_at ("previous declaration of `%#D' with %L linkage",
3324 olddecl, DECL_LANGUAGE (olddecl));
3325 cp_error ("conflicts with new declaration with %L linkage",
3326 DECL_LANGUAGE (newdecl));
3330 if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3332 else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3334 tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3335 tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3338 if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3339 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3341 for (; t1 && t1 != void_list_node;
3342 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3343 if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3345 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3350 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3352 cp_pedwarn_at ("after previous specification in `%#D'",
3358 cp_error ("default argument given for parameter %d of `%#D'",
3360 cp_error_at ("after previous specification in `%#D'",
3365 if (DECL_DECLARED_INLINE_P (newdecl)
3366 && ! DECL_DECLARED_INLINE_P (olddecl)
3367 && TREE_ADDRESSABLE (olddecl) && warn_inline)
3369 cp_warning ("`%#D' was used before it was declared inline",
3371 cp_warning_at ("previous non-inline declaration here",
3377 /* If new decl is `static' and an `extern' was seen previously,
3379 warn_extern_redeclared_static (newdecl, olddecl);
3381 /* We have committed to returning 1 at this point. */
3382 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3384 /* Now that functions must hold information normally held
3385 by field decls, there is extra work to do so that
3386 declaration information does not get destroyed during
3388 if (DECL_VINDEX (olddecl))
3389 DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3390 if (DECL_VIRTUAL_CONTEXT (olddecl))
3391 DECL_VIRTUAL_CONTEXT (newdecl) = DECL_VIRTUAL_CONTEXT (olddecl);
3392 if (DECL_CONTEXT (olddecl))
3393 DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3394 if (DECL_PENDING_INLINE_INFO (newdecl) == 0)
3395 DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3396 DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3397 DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3398 DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl);
3399 DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3400 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3401 DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl);
3402 if (DECL_OVERLOADED_OPERATOR_P (olddecl) != ERROR_MARK)
3403 SET_OVERLOADED_OPERATOR_CODE
3404 (newdecl, DECL_OVERLOADED_OPERATOR_P (olddecl));
3405 new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3407 /* Optionally warn about more than one declaration for the same
3408 name, but don't warn about a function declaration followed by a
3410 if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3411 && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3412 /* Don't warn about extern decl followed by definition. */
3413 && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3414 /* Don't warn about friends, let add_friend take care of it. */
3415 && ! (DECL_FRIEND_P (newdecl) || DECL_FRIEND_P (olddecl)))
3417 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl);
3418 cp_warning_at ("previous declaration of `%D'", olddecl);
3422 /* Deal with C++: must preserve virtual function table size. */
3423 if (TREE_CODE (olddecl) == TYPE_DECL)
3425 register tree newtype = TREE_TYPE (newdecl);
3426 register tree oldtype = TREE_TYPE (olddecl);
3428 if (newtype != error_mark_node && oldtype != error_mark_node
3429 && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3431 CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype);
3432 CLASSTYPE_FRIEND_CLASSES (newtype)
3433 = CLASSTYPE_FRIEND_CLASSES (oldtype);
3436 DECL_ORIGINAL_TYPE (newdecl) = DECL_ORIGINAL_TYPE (olddecl);
3439 /* Copy all the DECL_... slots specified in the new decl
3440 except for any that we copy here from the old type. */
3441 DECL_MACHINE_ATTRIBUTES (newdecl)
3442 = (*targetm.merge_decl_attributes) (olddecl, newdecl);
3444 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3446 TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3447 DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3448 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3449 DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3451 /* If the new declaration is a definition, update the file and
3452 line information on the declaration. */
3453 if (DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)) == NULL_TREE
3454 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl)) != NULL_TREE)
3456 DECL_SOURCE_LINE (olddecl)
3457 = DECL_SOURCE_LINE (DECL_TEMPLATE_RESULT (olddecl))
3458 = DECL_SOURCE_LINE (newdecl);
3459 DECL_SOURCE_FILE (olddecl)
3460 = DECL_SOURCE_FILE (DECL_TEMPLATE_RESULT (olddecl))
3461 = DECL_SOURCE_FILE (newdecl);
3469 /* Automatically handles default parameters. */
3470 tree oldtype = TREE_TYPE (olddecl);
3473 /* Merge the data types specified in the two decls. */
3474 newtype = common_type (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3476 /* If common_type produces a non-typedef type, just use the old type. */
3477 if (TREE_CODE (newdecl) == TYPE_DECL
3478 && newtype == DECL_ORIGINAL_TYPE (newdecl))
3481 if (TREE_CODE (newdecl) == VAR_DECL)
3482 DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3483 /* Do this after calling `common_type' so that default
3484 parameters don't confuse us. */
3485 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3486 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3487 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3489 TREE_TYPE (newdecl) = build_exception_variant (newtype,
3490 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3491 TREE_TYPE (olddecl) = build_exception_variant (newtype,
3492 TYPE_RAISES_EXCEPTIONS (oldtype));
3494 if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3495 && DECL_SOURCE_LINE (olddecl) != 0
3497 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)),
3498 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1))
3500 cp_error ("declaration of `%F' throws different exceptions",
3502 cp_error_at ("than previous declaration `%F'", olddecl);
3505 TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3507 /* Lay the type out, unless already done. */
3508 if (! same_type_p (newtype, oldtype)
3509 && TREE_TYPE (newdecl) != error_mark_node
3510 && !(processing_template_decl && uses_template_parms (newdecl)))
3511 layout_type (TREE_TYPE (newdecl));
3513 if ((TREE_CODE (newdecl) == VAR_DECL
3514 || TREE_CODE (newdecl) == PARM_DECL
3515 || TREE_CODE (newdecl) == RESULT_DECL
3516 || TREE_CODE (newdecl) == FIELD_DECL
3517 || TREE_CODE (newdecl) == TYPE_DECL)
3518 && !(processing_template_decl && uses_template_parms (newdecl)))
3519 layout_decl (newdecl, 0);
3521 /* Merge the type qualifiers. */
3522 if (TREE_READONLY (newdecl))
3523 TREE_READONLY (olddecl) = 1;
3524 if (TREE_THIS_VOLATILE (newdecl))
3525 TREE_THIS_VOLATILE (olddecl) = 1;
3527 /* Merge the initialization information. */
3528 if (DECL_INITIAL (newdecl) == NULL_TREE
3529 && DECL_INITIAL (olddecl) != NULL_TREE)
3531 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3532 DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
3533 DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
3534 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl)
3535 && DECL_LANG_SPECIFIC (newdecl)
3536 && DECL_LANG_SPECIFIC (olddecl))
3537 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3540 /* Merge the section attribute.
3541 We want to issue an error if the sections conflict but that must be
3542 done later in decl_attributes since we are called before attributes
3544 if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3545 DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3547 /* Keep the old rtl since we can safely use it. */
3548 COPY_DECL_RTL (olddecl, newdecl);
3550 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3552 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl)
3553 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl);
3554 DECL_NO_CHECK_MEMORY_USAGE (newdecl)
3555 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl);
3556 DECL_NO_LIMIT_STACK (newdecl)
3557 |= DECL_NO_LIMIT_STACK (olddecl);
3560 /* If cannot merge, then use the new type and qualifiers,
3561 and don't preserve the old rtl. */
3564 /* Clean out any memory we had of the old declaration. */
3565 tree oldstatic = value_member (olddecl, static_aggregates);
3567 TREE_VALUE (oldstatic) = error_mark_node;
3569 TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3570 TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3571 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3572 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3575 /* Merge the storage class information. */
3576 DECL_WEAK (newdecl) |= DECL_WEAK (olddecl);
3577 DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3578 DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl);
3579 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3580 TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3581 if (! DECL_EXTERNAL (olddecl))
3582 DECL_EXTERNAL (newdecl) = 0;
3584 if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3586 DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3587 DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3588 DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3589 DECL_TEMPLATE_INSTANTIATED (newdecl)
3590 |= DECL_TEMPLATE_INSTANTIATED (olddecl);
3591 /* Don't really know how much of the language-specific
3592 values we should copy from old to new. */
3593 DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3594 DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl);
3595 DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3596 DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3597 DECL_INITIALIZED_IN_CLASS_P (newdecl)
3598 |= DECL_INITIALIZED_IN_CLASS_P (olddecl);
3599 olddecl_friend = DECL_FRIEND_P (olddecl);
3601 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3602 if (TREE_CODE (newdecl) == FUNCTION_DECL
3603 || DECL_FUNCTION_TEMPLATE_P (newdecl))
3604 DECL_BEFRIENDING_CLASSES (newdecl)
3605 = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
3606 DECL_BEFRIENDING_CLASSES (olddecl));
3609 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3611 if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3612 && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3614 /* If newdecl is not a specialization, then it is not a
3615 template-related function at all. And that means that we
3616 shoud have exited above, returning 0. */
3617 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3620 if (TREE_USED (olddecl))
3621 /* From [temp.expl.spec]:
3623 If a template, a member template or the member of a class
3624 template is explicitly specialized then that
3625 specialization shall be declared before the first use of
3626 that specialization that would cause an implicit
3627 instantiation to take place, in every translation unit in
3628 which such a use occurs. */
3629 cp_error ("explicit specialization of %D after first use",
3632 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3634 DECL_DECLARED_INLINE_P (newdecl) |= DECL_DECLARED_INLINE_P (olddecl);
3636 /* If either decl says `inline', this fn is inline, unless its
3637 definition was passed already. */
3638 if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3639 DECL_INLINE (olddecl) = 1;
3640 DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3642 /* Preserve abstractness on cloned [cd]tors. */
3643 DECL_ABSTRACT (newdecl) = DECL_ABSTRACT (olddecl);
3647 SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl));
3648 COPY_DECL_ASSEMBLER_NAME (newdecl, olddecl);
3649 SET_DECL_RTL (olddecl, DECL_RTL (newdecl));
3651 if (! types_match || new_defines_function)
3653 /* These need to be copied so that the names are available.
3654 Note that if the types do match, we'll preserve inline
3655 info and other bits, but if not, we won't. */
3656 DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3657 DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3659 if (new_defines_function)
3660 /* If defining a function declared with other language
3661 linkage, use the previously declared language linkage. */
3662 SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl));
3663 else if (types_match)
3665 /* If redeclaring a builtin function, and not a definition,
3666 it stays built in. */
3667 if (DECL_BUILT_IN (olddecl))
3669 DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl);
3670 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3671 /* If we're keeping the built-in definition, keep the rtl,
3672 regardless of declaration matches. */
3673 SET_DECL_RTL (newdecl, DECL_RTL (olddecl));
3676 DECL_NUM_STMTS (newdecl) = DECL_NUM_STMTS (olddecl);
3678 DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3679 if ((DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl)))
3680 /* Previously saved insns go together with
3681 the function's previous definition. */
3682 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3683 /* Don't clear out the arguments if we're redefining a function. */
3684 if (DECL_ARGUMENTS (olddecl))
3685 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3688 else if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3689 NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3691 /* Now preserve various other info from the definition. */
3692 TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3693 TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3694 DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3695 COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl);
3697 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3701 function_size = sizeof (struct tree_decl);
3703 memcpy ((char *) olddecl + sizeof (struct tree_common),
3704 (char *) newdecl + sizeof (struct tree_common),
3705 function_size - sizeof (struct tree_common));
3707 if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3709 /* If newdecl is a template instantiation, it is possible that
3710 the following sequence of events has occurred:
3712 o A friend function was declared in a class template. The
3713 class template was instantiated.
3715 o The instantiation of the friend declaration was
3716 recorded on the instantiation list, and is newdecl.
3718 o Later, however, instantiate_class_template called pushdecl
3719 on the newdecl to perform name injection. But, pushdecl in
3720 turn called duplicate_decls when it discovered that another
3721 declaration of a global function with the same name already
3724 o Here, in duplicate_decls, we decided to clobber newdecl.
3726 If we're going to do that, we'd better make sure that
3727 olddecl, and not newdecl, is on the list of
3728 instantiations so that if we try to do the instantiation
3729 again we won't get the clobbered declaration. */
3731 tree tmpl = DECL_TI_TEMPLATE (newdecl);
3732 tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3734 for (; decls; decls = TREE_CHAIN (decls))
3735 if (TREE_VALUE (decls) == newdecl)
3736 TREE_VALUE (decls) = olddecl;
3741 memcpy ((char *) olddecl + sizeof (struct tree_common),
3742 (char *) newdecl + sizeof (struct tree_common),
3743 sizeof (struct tree_decl) - sizeof (struct tree_common)
3744 + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *));
3747 DECL_UID (olddecl) = olddecl_uid;
3749 DECL_FRIEND_P (olddecl) = 1;
3751 /* NEWDECL contains the merged attribute lists.
3752 Update OLDDECL to be the same. */
3753 DECL_MACHINE_ATTRIBUTES (olddecl) = DECL_MACHINE_ATTRIBUTES (newdecl);
3758 /* Record a decl-node X as belonging to the current lexical scope.
3759 Check for errors (such as an incompatible declaration for the same
3760 name already seen in the same scope).
3762 Returns either X or an old decl for the same name.
3763 If an old decl is returned, it may have been smashed
3764 to agree with what X says. */
3772 int need_new_binding;
3774 /* We shouldn't be calling pushdecl when we're generating RTL for a
3775 function that we already did semantic analysis on previously. */
3776 my_friendly_assert (!cfun || doing_semantic_analysis_p (),
3779 need_new_binding = 1;
3781 if (DECL_TEMPLATE_PARM_P (x))
3782 /* Template parameters have no context; they are not X::T even
3783 when declared within a class or namespace. */
3787 if (current_function_decl && x != current_function_decl
3788 /* A local declaration for a function doesn't constitute
3790 && !(TREE_CODE (x) == FUNCTION_DECL && !DECL_INITIAL (x))
3791 /* A local declaration for an `extern' variable is in the
3792 scope of the current namespace, not the current
3794 && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
3795 && !DECL_CONTEXT (x))
3796 DECL_CONTEXT (x) = current_function_decl;
3798 /* If this is the declaration for a namespace-scope function,
3799 but the declaration itself is in a local scope, mark the
3801 if (TREE_CODE (x) == FUNCTION_DECL
3802 && DECL_NAMESPACE_SCOPE_P (x)
3803 && current_function_decl
3804 && x != current_function_decl)
3805 DECL_LOCAL_FUNCTION_P (x) = 1;
3808 name = DECL_NAME (x);
3811 int different_binding_level = 0;
3813 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3814 name = TREE_OPERAND (name, 0);
3816 /* In case this decl was explicitly namespace-qualified, look it
3817 up in its namespace context. */
3818 if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x)
3819 && namespace_bindings_p ())
3820 t = namespace_binding (name, DECL_CONTEXT (x));
3822 t = lookup_name_current_level (name);
3824 /* [basic.link] If there is a visible declaration of an entity
3825 with linkage having the same name and type, ignoring entities
3826 declared outside the innermost enclosing namespace scope, the
3827 block scope declaration declares that same entity and
3828 receives the linkage of the previous declaration. */
3829 if (! t && current_function_decl && x != current_function_decl
3830 && (TREE_CODE (x) == FUNCTION_DECL || TREE_CODE (x) == VAR_DECL)
3831 && DECL_EXTERNAL (x))
3833 /* Look in block scope. */
3834 t = IDENTIFIER_VALUE (name);
3835 /* Or in the innermost namespace. */
3837 t = namespace_binding (name, DECL_CONTEXT (x));
3838 /* Does it have linkage? Note that if this isn't a DECL, it's an
3839 OVERLOAD, which is OK. */
3840 if (t && DECL_P (t) && ! (TREE_STATIC (t) || DECL_EXTERNAL (t)))
3843 different_binding_level = 1;
3846 /* If we are declaring a function, and the result of name-lookup
3847 was an OVERLOAD, look for an overloaded instance that is
3848 actually the same as the function we are declaring. (If
3849 there is one, we have to merge our declaration with the
3850 previous declaration.) */
3851 if (t && TREE_CODE (t) == OVERLOAD)
3855 if (TREE_CODE (x) == FUNCTION_DECL)
3856 for (match = t; match; match = OVL_NEXT (match))
3858 if (decls_match (OVL_CURRENT (match), x))
3862 /* Just choose one. */
3866 t = OVL_CURRENT (match);
3871 if (t == error_mark_node)
3873 /* error_mark_node is 0 for a while during initialization! */
3875 cp_error_at ("`%#D' used prior to declaration", x);
3877 else if (t != NULL_TREE)
3879 if (different_binding_level)
3881 if (decls_match (x, t))
3882 /* The standard only says that the local extern
3883 inherits linkage from the previous decl; in
3884 particular, default args are not shared. It would
3885 be nice to propagate inlining info, though. FIXME. */
3886 TREE_PUBLIC (x) = TREE_PUBLIC (t);
3888 else if (TREE_CODE (t) == PARM_DECL)
3890 if (DECL_CONTEXT (t) == NULL_TREE)
3891 /* This is probaby caused by too many errors, but calling
3892 abort will say that if errors have occurred. */
3895 /* Check for duplicate params. */
3896 if (duplicate_decls (x, t))
3899 else if ((DECL_EXTERN_C_FUNCTION_P (x)
3900 || DECL_FUNCTION_TEMPLATE_P (x))
3901 && is_overloaded_fn (t))
3902 /* Don't do anything just yet. */;
3903 else if (t == wchar_decl_node)
3905 if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3906 cp_pedwarn ("redeclaration of `wchar_t' as `%T'",
3909 /* Throw away the redeclaration. */
3912 else if (TREE_CODE (t) != TREE_CODE (x))
3914 if (duplicate_decls (x, t))
3917 else if (duplicate_decls (x, t))
3919 if (TREE_CODE (t) == TYPE_DECL)
3920 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3921 else if (TREE_CODE (t) == FUNCTION_DECL)
3922 check_default_args (t);
3926 else if (DECL_MAIN_P (x))
3928 /* A redeclaration of main, but not a duplicate of the
3933 This function shall not be overloaded. */
3934 cp_error_at ("invalid redeclaration of `%D'", t);
3935 cp_error ("as `%D'", x);
3936 /* We don't try to push this declaration since that
3942 check_template_shadow (x);
3944 /* If this is a function conjured up by the backend, massage it
3945 so it looks friendly. */
3946 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_LANG_SPECIFIC (x))
3948 retrofit_lang_decl (x);
3949 SET_DECL_LANGUAGE (x, lang_c);
3952 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_FUNCTION_MEMBER_P (x))
3954 t = push_overloaded_decl (x, PUSH_LOCAL);
3957 if (!namespace_bindings_p ())
3958 /* We do not need to create a binding for this name;
3959 push_overloaded_decl will have already done so if
3961 need_new_binding = 0;
3963 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
3965 t = push_overloaded_decl (x, PUSH_GLOBAL);
3967 add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
3971 /* If declaring a type as a typedef, copy the type (unless we're
3972 at line 0), and install this TYPE_DECL as the new type's typedef
3973 name. See the extensive comment in ../c-decl.c (pushdecl). */
3974 if (TREE_CODE (x) == TYPE_DECL)
3976 tree type = TREE_TYPE (x);
3977 if (DECL_SOURCE_LINE (x) == 0)
3979 if (TYPE_NAME (type) == 0)
3980 TYPE_NAME (type) = x;
3982 else if (type != error_mark_node && TYPE_NAME (type) != x
3983 /* We don't want to copy the type when all we're
3984 doing is making a TYPE_DECL for the purposes of
3986 && (!TYPE_NAME (type)
3987 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
3989 DECL_ORIGINAL_TYPE (x) = type;
3990 type = build_type_copy (type);
3991 TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
3992 TYPE_NAME (type) = x;
3993 TREE_TYPE (x) = type;
3996 if (type != error_mark_node
3998 && TYPE_IDENTIFIER (type))
3999 set_identifier_type_value_with_scope (DECL_NAME (x), type,
4000 current_binding_level);
4004 /* Multiple external decls of the same identifier ought to match.
4006 We get warnings about inline functions where they are defined.
4007 We get warnings about other functions from push_overloaded_decl.
4009 Avoid duplicate warnings where they are used. */
4010 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
4014 decl = IDENTIFIER_NAMESPACE_VALUE (name);
4015 if (decl && TREE_CODE (decl) == OVERLOAD)
4016 decl = OVL_FUNCTION (decl);
4018 if (decl && decl != error_mark_node
4019 && (DECL_EXTERNAL (decl) || TREE_PUBLIC (decl))
4020 /* If different sort of thing, we already gave an error. */
4021 && TREE_CODE (decl) == TREE_CODE (x)
4022 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
4024 cp_pedwarn ("type mismatch with previous external decl", x);
4025 cp_pedwarn_at ("previous external decl of `%#D'", decl);
4029 /* This name is new in its binding level.
4030 Install the new declaration and return it. */
4031 if (namespace_bindings_p ())
4033 /* Install a global value. */
4035 /* If the first global decl has external linkage,
4036 warn if we later see static one. */
4037 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
4038 TREE_PUBLIC (name) = 1;
4040 /* Bind the name for the entity. */
4041 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
4043 && (TREE_CODE (x) == TYPE_DECL
4044 || TREE_CODE (x) == VAR_DECL
4045 || TREE_CODE (x) == NAMESPACE_DECL
4046 || TREE_CODE (x) == CONST_DECL
4047 || TREE_CODE (x) == TEMPLATE_DECL))
4048 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
4050 /* Don't forget if the function was used via an implicit decl. */
4051 if (IDENTIFIER_IMPLICIT_DECL (name)
4052 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
4055 /* Don't forget if its address was taken in that way. */
4056 if (IDENTIFIER_IMPLICIT_DECL (name)
4057 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
4058 TREE_ADDRESSABLE (x) = 1;
4060 /* Warn about mismatches against previous implicit decl. */
4061 if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
4062 /* If this real decl matches the implicit, don't complain. */
4063 && ! (TREE_CODE (x) == FUNCTION_DECL
4064 && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
4066 ("`%D' was previously implicitly declared to return `int'", x);
4068 /* If new decl is `static' and an `extern' was seen previously,
4070 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
4071 warn_extern_redeclared_static (x, t);
4075 /* Here to install a non-global value. */
4076 tree oldlocal = IDENTIFIER_VALUE (name);
4077 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
4079 if (need_new_binding)
4081 push_local_binding (name, x, 0);
4082 /* Because push_local_binding will hook X on to the
4083 current_binding_level's name list, we don't want to
4084 do that again below. */
4085 need_new_binding = 0;
4088 /* If this is a TYPE_DECL, push it into the type value slot. */
4089 if (TREE_CODE (x) == TYPE_DECL)
4090 set_identifier_type_value_with_scope (name, TREE_TYPE (x),
4091 current_binding_level);
4093 /* Clear out any TYPE_DECL shadowed by a namespace so that
4094 we won't think this is a type. The C struct hack doesn't
4095 go through namespaces. */
4096 if (TREE_CODE (x) == NAMESPACE_DECL)
4097 set_identifier_type_value_with_scope (name, NULL_TREE,
4098 current_binding_level);
4105 && TREE_CODE (oldlocal) == VAR_DECL
4106 && DECL_DEAD_FOR_LOCAL (oldlocal))
4107 oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal);
4109 if (oldlocal == NULL_TREE)
4110 oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d));
4113 /* If this is an extern function declaration, see if we
4114 have a global definition or declaration for the function. */
4115 if (oldlocal == NULL_TREE
4116 && DECL_EXTERNAL (x)
4117 && oldglobal != NULL_TREE
4118 && TREE_CODE (x) == FUNCTION_DECL
4119 && TREE_CODE (oldglobal) == FUNCTION_DECL)
4121 /* We have one. Their types must agree. */
4122 if (decls_match (x, oldglobal))
4126 cp_warning ("extern declaration of `%#D' doesn't match", x);
4127 cp_warning_at ("global declaration `%#D'", oldglobal);
4130 /* If we have a local external declaration,
4131 and no file-scope declaration has yet been seen,
4132 then if we later have a file-scope decl it must not be static. */
4133 if (oldlocal == NULL_TREE
4134 && oldglobal == NULL_TREE
4135 && DECL_EXTERNAL (x)
4137 TREE_PUBLIC (name) = 1;
4139 /* Warn if shadowing an argument at the top level of the body. */
4140 if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
4141 /* Inline decls shadow nothing. */
4142 && !DECL_FROM_INLINE (x)
4143 && TREE_CODE (oldlocal) == PARM_DECL
4144 /* Don't complain if it's from an enclosing function. */
4145 && DECL_CONTEXT (oldlocal) == current_function_decl
4146 && TREE_CODE (x) != PARM_DECL)
4148 /* Go to where the parms should be and see if we
4150 struct binding_level *b = current_binding_level->level_chain;
4156 if (b->parm_flag == 1)
4157 cp_error ("declaration of `%#D' shadows a parameter", name);
4160 /* Maybe warn if shadowing something else. */
4161 if (warn_shadow && !DECL_EXTERNAL (x)
4162 /* Inline decls shadow nothing. */
4163 && !DECL_FROM_INLINE (x)
4164 /* No shadow warnings for internally generated vars. */
4165 && ! DECL_ARTIFICIAL (x)
4166 /* No shadow warnings for vars made for inlining. */
4167 && ! DECL_FROM_INLINE (x))
4169 if (oldlocal != NULL_TREE && TREE_CODE (oldlocal) == PARM_DECL)
4170 warning ("declaration of `%s' shadows a parameter",
4171 IDENTIFIER_POINTER (name));
4172 else if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
4173 && current_class_ptr
4174 && !TREE_STATIC (name))
4175 warning ("declaration of `%s' shadows a member of `this'",
4176 IDENTIFIER_POINTER (name));
4177 else if (oldlocal != NULL_TREE)
4178 warning ("declaration of `%s' shadows previous local",
4179 IDENTIFIER_POINTER (name));
4180 else if (oldglobal != NULL_TREE)
4181 /* XXX shadow warnings in outer-more namespaces */
4182 warning ("declaration of `%s' shadows global declaration",
4183 IDENTIFIER_POINTER (name));
4187 if (TREE_CODE (x) == FUNCTION_DECL)
4188 check_default_args (x);
4190 /* Keep count of variables in this level with incomplete type. */
4191 if (TREE_CODE (x) == VAR_DECL
4192 && TREE_TYPE (x) != error_mark_node
4193 && ((!COMPLETE_TYPE_P (TREE_TYPE (x))
4194 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x), ARRAY_TYPE))
4195 /* RTTI TD entries are created while defining the type_info. */
4196 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x))
4197 && TYPE_BEING_DEFINED (TREE_TYPE (x)))))
4199 if (namespace_bindings_p ())
4200 namespace_scope_incomplete
4201 = tree_cons (NULL_TREE, x, namespace_scope_incomplete);
4203 current_binding_level->incomplete
4204 = tree_cons (NULL_TREE, x, current_binding_level->incomplete);
4208 if (need_new_binding)
4209 add_decl_to_level (x,
4210 DECL_NAMESPACE_SCOPE_P (x)
4211 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
4212 : current_binding_level);
4217 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4218 caller to set DECL_CONTEXT properly. */
4221 pushdecl_with_scope (x, level)
4223 struct binding_level *level;
4225 register struct binding_level *b;
4226 tree function_decl = current_function_decl;
4228 current_function_decl = NULL_TREE;
4229 if (level->parm_flag == 2)
4231 b = class_binding_level;
4232 class_binding_level = level;
4233 pushdecl_class_level (x);
4234 class_binding_level = b;
4238 b = current_binding_level;
4239 current_binding_level = level;
4241 current_binding_level = b;
4243 current_function_decl = function_decl;
4247 /* Like pushdecl, only it places X in the current namespace,
4251 pushdecl_namespace_level (x)
4254 register struct binding_level *b = current_binding_level;
4257 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
4259 /* Now, the type_shadowed stack may screw us. Munge it so it does
4261 if (TREE_CODE (x) == TYPE_DECL)
4263 tree name = DECL_NAME (x);
4265 tree *ptr = (tree *)0;
4266 for (; b != global_binding_level; b = b->level_chain)
4268 tree shadowed = b->type_shadowed;
4269 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
4270 if (TREE_PURPOSE (shadowed) == name)
4272 ptr = &TREE_VALUE (shadowed);
4273 /* Can't break out of the loop here because sometimes
4274 a binding level will have duplicate bindings for
4275 PT names. It's gross, but I haven't time to fix it. */
4278 newval = TREE_TYPE (x);
4279 if (ptr == (tree *)0)
4281 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4282 up here if this is changed to an assertion. --KR */
4283 SET_IDENTIFIER_TYPE_VALUE (name, newval);
4293 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4297 pushdecl_top_level (x)
4300 push_to_top_level ();
4301 x = pushdecl_namespace_level (x);
4302 pop_from_top_level ();
4306 /* Make the declaration of X appear in CLASS scope. */
4309 pushdecl_class_level (x)
4312 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4313 scope looks for the pre-mangled name. */
4316 if (TREE_CODE (x) == OVERLOAD)
4317 x = OVL_CURRENT (x);
4318 name = DECL_NAME (x);
4322 push_class_level_binding (name, x);
4323 if (TREE_CODE (x) == TYPE_DECL)
4324 set_identifier_type_value (name, TREE_TYPE (x));
4326 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
4330 for (f = TYPE_FIELDS (TREE_TYPE (x));
4333 pushdecl_class_level (f);
4337 /* Enter DECL into the symbol table, if that's appropriate. Returns
4338 DECL, or a modified version thereof. */
4341 maybe_push_decl (decl)
4344 tree type = TREE_TYPE (decl);
4346 /* Add this decl to the current binding level, but not if it comes
4347 from another scope, e.g. a static member variable. TEM may equal
4348 DECL or it may be a previous decl of the same name. */
4349 if (decl == error_mark_node
4350 || (TREE_CODE (decl) != PARM_DECL
4351 && DECL_CONTEXT (decl) != NULL_TREE
4352 /* Definitions of namespace members outside their namespace are
4354 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
4355 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
4356 || TREE_CODE (type) == UNKNOWN_TYPE
4357 /* The declaration of a template specialization does not affect
4358 the functions available for overload resolution, so we do not
4360 || (TREE_CODE (decl) == FUNCTION_DECL
4361 && DECL_TEMPLATE_SPECIALIZATION (decl)))
4364 return pushdecl (decl);
4367 /* Make the declaration(s) of X appear in CLASS scope
4368 under the name NAME. */
4371 push_class_level_binding (name, x)
4376 /* The class_binding_level will be NULL if x is a template
4377 parameter name in a member template. */
4378 if (!class_binding_level)
4381 /* Make sure that this new member does not have the same name
4382 as a template parameter. */
4383 if (TYPE_BEING_DEFINED (current_class_type))
4384 check_template_shadow (x);
4386 /* If this declaration shadows a declaration from an enclosing
4387 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4388 we leave this class. Record the shadowed declaration here. */
4389 binding = IDENTIFIER_BINDING (name);
4391 && ((TREE_CODE (x) == OVERLOAD
4392 && BINDING_VALUE (binding)
4393 && is_overloaded_fn (BINDING_VALUE (binding)))
4394 || INHERITED_VALUE_BINDING_P (binding)))
4399 /* If the old binding was from a base class, and was for a tag
4400 name, slide it over to make room for the new binding. The
4401 old binding is still visible if explicitly qualified with a
4403 if (INHERITED_VALUE_BINDING_P (binding)
4404 && BINDING_VALUE (binding)
4405 && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
4406 && DECL_ARTIFICIAL (BINDING_VALUE (binding))
4407 && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
4409 old_decl = BINDING_TYPE (binding);
4410 BINDING_TYPE (binding) = BINDING_VALUE (binding);
4411 BINDING_VALUE (binding) = NULL_TREE;
4412 INHERITED_VALUE_BINDING_P (binding) = 0;
4415 old_decl = BINDING_VALUE (binding);
4417 /* Find the previous binding of name on the class-shadowed
4418 list, and update it. */
4419 for (shadow = class_binding_level->class_shadowed;
4421 shadow = TREE_CHAIN (shadow))
4422 if (TREE_PURPOSE (shadow) == name
4423 && TREE_TYPE (shadow) == old_decl)
4425 BINDING_VALUE (binding) = x;
4426 INHERITED_VALUE_BINDING_P (binding) = 0;
4427 TREE_TYPE (shadow) = x;
4428 IDENTIFIER_CLASS_VALUE (name) = x;
4433 /* If we didn't replace an existing binding, put the binding on the
4434 stack of bindings for the identifier, and update the shadowed list. */
4435 if (push_class_binding (name, x))
4437 class_binding_level->class_shadowed
4438 = tree_cons (name, NULL,
4439 class_binding_level->class_shadowed);
4440 /* Record the value we are binding NAME to so that we can know
4441 what to pop later. */
4442 TREE_TYPE (class_binding_level->class_shadowed) = x;
4446 /* Insert another USING_DECL into the current binding level, returning
4447 this declaration. If this is a redeclaration, do nothing, and
4448 return NULL_TREE if this not in namespace scope (in namespace
4449 scope, a using decl might extend any previous bindings). */
4452 push_using_decl (scope, name)
4458 my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4459 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4460 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4461 if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4464 return namespace_bindings_p () ? decl : NULL_TREE;
4465 decl = build_lang_decl (USING_DECL, name, void_type_node);
4466 DECL_INITIAL (decl) = scope;
4467 TREE_CHAIN (decl) = current_binding_level->usings;
4468 current_binding_level->usings = decl;
4472 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4473 changed (i.e. there was already a directive), or the fresh
4474 TREE_LIST otherwise. */
4477 push_using_directive (used)
4480 tree ud = current_binding_level->using_directives;
4481 tree iter, ancestor;
4483 /* Check if we already have this. */
4484 if (purpose_member (used, ud) != NULL_TREE)
4487 /* Recursively add all namespaces used. */
4488 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4489 push_using_directive (TREE_PURPOSE (iter));
4491 ancestor = namespace_ancestor (current_decl_namespace (), used);
4492 ud = current_binding_level->using_directives;
4493 ud = tree_cons (used, ancestor, ud);
4494 current_binding_level->using_directives = ud;
4498 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4499 other definitions already in place. We get around this by making
4500 the value of the identifier point to a list of all the things that
4501 want to be referenced by that name. It is then up to the users of
4502 that name to decide what to do with that list.
4504 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4505 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4507 FLAGS is a bitwise-or of the following values:
4508 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4510 PUSH_USING: DECL is being pushed as the result of a using
4513 The value returned may be a previous declaration if we guessed wrong
4514 about what language DECL should belong to (C or C++). Otherwise,
4515 it's always DECL (and never something that's not a _DECL). */
4518 push_overloaded_decl (decl, flags)
4522 tree name = DECL_NAME (decl);
4525 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4528 old = namespace_binding (name, DECL_CONTEXT (decl));
4530 old = lookup_name_current_level (name);
4534 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4536 tree t = TREE_TYPE (old);
4537 if (IS_AGGR_TYPE (t) && warn_shadow
4538 && (! DECL_IN_SYSTEM_HEADER (decl)
4539 || ! DECL_IN_SYSTEM_HEADER (old)))
4540 cp_warning ("`%#D' hides constructor for `%#T'", decl, t);
4543 else if (is_overloaded_fn (old))
4547 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4549 tree fn = OVL_CURRENT (tmp);
4551 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4552 && !(flags & PUSH_USING)
4553 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4554 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4555 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4558 if (duplicate_decls (decl, fn))
4562 else if (old == error_mark_node)
4563 /* Ignore the undefined symbol marker. */
4567 cp_error_at ("previous non-function declaration `%#D'", old);
4568 cp_error ("conflicts with function declaration `%#D'", decl);
4573 if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4575 if (old && TREE_CODE (old) != OVERLOAD)
4576 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4578 new_binding = ovl_cons (decl, old);
4579 if (flags & PUSH_USING)
4580 OVL_USED (new_binding) = 1;
4583 /* NAME is not ambiguous. */
4587 set_namespace_binding (name, current_namespace, new_binding);
4590 /* We only create an OVERLOAD if there was a previous binding at
4591 this level, or if decl is a template. In the former case, we
4592 need to remove the old binding and replace it with the new
4593 binding. We must also run through the NAMES on the binding
4594 level where the name was bound to update the chain. */
4596 if (TREE_CODE (new_binding) == OVERLOAD && old)
4600 for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4602 d = &TREE_CHAIN (*d))
4604 || (TREE_CODE (*d) == TREE_LIST
4605 && TREE_VALUE (*d) == old))
4607 if (TREE_CODE (*d) == TREE_LIST)
4608 /* Just replace the old binding with the new. */
4609 TREE_VALUE (*d) = new_binding;
4611 /* Build a TREE_LIST to wrap the OVERLOAD. */
4612 *d = tree_cons (NULL_TREE, new_binding,
4615 /* And update the CPLUS_BINDING node. */
4616 BINDING_VALUE (IDENTIFIER_BINDING (name))
4621 /* We should always find a previous binding in this case. */
4622 my_friendly_abort (0);
4625 /* Install the new binding. */
4626 push_local_binding (name, new_binding, flags);
4632 /* Generate an implicit declaration for identifier FUNCTIONID
4633 as a function of type int (). Print a warning if appropriate. */
4636 implicitly_declare (functionid)
4641 /* We used to reuse an old implicit decl here,
4642 but this loses with inline functions because it can clobber
4643 the saved decl chains. */
4644 decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4646 DECL_EXTERNAL (decl) = 1;
4647 TREE_PUBLIC (decl) = 1;
4649 /* ISO standard says implicit declarations are in the innermost block.
4650 So we record the decl in the standard fashion. */
4652 rest_of_decl_compilation (decl, NULL, 0, 0);
4655 /* Only one warning per identifier. */
4656 && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4658 cp_pedwarn ("implicit declaration of function `%#D'", decl);
4661 SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4666 /* Return zero if the declaration NEWDECL is valid
4667 when the declaration OLDDECL (assumed to be for the same name)
4668 has already been seen.
4669 Otherwise return an error message format string with a %s
4670 where the identifier should go. */
4673 redeclaration_error_message (newdecl, olddecl)
4674 tree newdecl, olddecl;
4676 if (TREE_CODE (newdecl) == TYPE_DECL)
4678 /* Because C++ can put things into name space for free,
4679 constructs like "typedef struct foo { ... } foo"
4680 would look like an erroneous redeclaration. */
4681 if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4684 return "redefinition of `%#D'";
4686 else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4688 /* If this is a pure function, its olddecl will actually be
4689 the original initialization to `0' (which we force to call
4690 abort()). Don't complain about redefinition in this case. */
4691 if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl))
4694 /* If both functions come from different namespaces, this is not
4695 a redeclaration - this is a conflict with a used function. */
4696 if (DECL_NAMESPACE_SCOPE_P (olddecl)
4697 && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4698 return "`%D' conflicts with used function";
4700 /* We'll complain about linkage mismatches in
4701 warn_extern_redeclared_static. */
4703 /* Defining the same name twice is no good. */
4704 if (DECL_INITIAL (olddecl) != NULL_TREE
4705 && DECL_INITIAL (newdecl) != NULL_TREE)
4707 if (DECL_NAME (olddecl) == NULL_TREE)
4708 return "`%#D' not declared in class";
4710 return "redefinition of `%#D'";
4714 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4716 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4717 && (DECL_TEMPLATE_RESULT (newdecl)
4718 != DECL_TEMPLATE_RESULT (olddecl))
4719 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4720 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4721 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4722 && COMPLETE_TYPE_P (TREE_TYPE (newdecl))
4723 && COMPLETE_TYPE_P (TREE_TYPE (olddecl))))
4724 return "redefinition of `%#D'";
4727 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl))
4729 /* Objects declared at top level: */
4730 /* If at least one is a reference, it's ok. */
4731 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4733 /* Reject two definitions. */
4734 return "redefinition of `%#D'";
4738 /* Objects declared with block scope: */
4739 /* Reject two definitions, and reject a definition
4740 together with an external reference. */
4741 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4742 return "redeclaration of `%#D'";
4747 /* Create a new label, named ID. */
4750 make_label_decl (id, local_p)
4756 decl = build_decl (LABEL_DECL, id, void_type_node);
4758 /* Make sure every label has an rtx. */
4761 DECL_CONTEXT (decl) = current_function_decl;
4762 DECL_MODE (decl) = VOIDmode;
4763 C_DECLARED_LABEL_FLAG (decl) = local_p;
4765 /* Say where one reference is to the label, for the sake of the
4766 error if it is not defined. */
4767 DECL_SOURCE_LINE (decl) = lineno;
4768 DECL_SOURCE_FILE (decl) = input_filename;
4770 /* Record the fact that this identifier is bound to this label. */
4771 SET_IDENTIFIER_LABEL_VALUE (id, decl);
4776 /* Record this label on the list of used labels so that we can check
4777 at the end of the function to see whether or not the label was
4778 actually defined, and so we can check when the label is defined whether
4779 this use is valid. */
4785 if (named_label_uses == NULL
4786 || named_label_uses->names_in_scope != current_binding_level->names
4787 || named_label_uses->label_decl != decl)
4789 struct named_label_use_list *new_ent;
4790 new_ent = ((struct named_label_use_list *)
4791 ggc_alloc (sizeof (struct named_label_use_list)));
4792 new_ent->label_decl = decl;
4793 new_ent->names_in_scope = current_binding_level->names;
4794 new_ent->binding_level = current_binding_level;
4795 new_ent->lineno_o_goto = lineno;
4796 new_ent->filename_o_goto = input_filename;
4797 new_ent->next = named_label_uses;
4798 named_label_uses = new_ent;
4802 /* Look for a label named ID in the current function. If one cannot
4803 be found, create one. (We keep track of used, but undefined,
4804 labels, and complain about them at the end of a function.) */
4811 struct named_label_list *ent;
4813 /* You can't use labels at global scope. */
4814 if (current_function_decl == NULL_TREE)
4816 error ("label `%s' referenced outside of any function",
4817 IDENTIFIER_POINTER (id));
4821 /* See if we've already got this label. */
4822 decl = IDENTIFIER_LABEL_VALUE (id);
4823 if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl)
4826 /* Record this label on the list of labels used in this function.
4827 We do this before calling make_label_decl so that we get the
4828 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4829 ent = ((struct named_label_list *)
4830 ggc_alloc_cleared (sizeof (struct named_label_list)));
4831 ent->old_value = IDENTIFIER_LABEL_VALUE (id);
4832 ent->next = named_labels;
4835 /* We need a new label. */
4836 decl = make_label_decl (id, /*local_p=*/0);
4838 /* Now fill in the information we didn't have before. */
4839 ent->label_decl = decl;
4844 /* Declare a local label named ID. */
4847 declare_local_label (id)
4852 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4853 this scope we can restore the old value of
4854 IDENTIFIER_TYPE_VALUE. */
4855 current_binding_level->shadowed_labels
4856 = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4857 current_binding_level->shadowed_labels);
4858 /* Look for the label. */
4859 decl = make_label_decl (id, /*local_p=*/1);
4860 /* Now fill in the information we didn't have before. */
4861 TREE_VALUE (current_binding_level->shadowed_labels) = decl;
4866 /* Returns nonzero if it is ill-formed to jump past the declaration of
4867 DECL. Returns 2 if it's also a real problem. */
4870 decl_jump_unsafe (decl)
4873 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
4876 if (DECL_INITIAL (decl) == NULL_TREE
4877 && pod_type_p (TREE_TYPE (decl)))
4880 /* This is really only important if we're crossing an initialization.
4881 The POD stuff is just pedantry; why should it matter if the class
4882 contains a field of pointer to member type? */
4883 if (DECL_INITIAL (decl)
4884 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))))
4889 /* Check that a single previously seen jump to a newly defined label
4890 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4891 the jump context; NAMES are the names in scope in LEVEL at the jump
4892 context; FILE and LINE are the source position of the jump or 0. */
4895 check_previous_goto_1 (decl, level, names, file, line)
4897 struct binding_level *level;
4904 struct binding_level *b = current_binding_level;
4905 for (; b; b = b->level_chain)
4907 tree new_decls = b->names;
4908 tree old_decls = (b == level ? names : NULL_TREE);
4909 for (; new_decls != old_decls;
4910 new_decls = TREE_CHAIN (new_decls))
4912 int problem = decl_jump_unsafe (new_decls);
4919 cp_pedwarn ("jump to label `%D'", decl);
4921 pedwarn ("jump to case label");
4924 pedwarn_with_file_and_line (file, line, " from here");
4929 cp_error_at (" crosses initialization of `%#D'",
4932 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4938 if ((b->is_try_scope || b->is_catch_scope) && ! saw_eh)
4943 cp_pedwarn ("jump to label `%D'", decl);
4945 pedwarn ("jump to case label");
4948 pedwarn_with_file_and_line (file, line, " from here");
4951 if (b->is_try_scope)
4952 error (" enters try block");
4954 error (" enters catch block");
4961 check_previous_goto (use)
4962 struct named_label_use_list *use;
4964 check_previous_goto_1 (use->label_decl, use->binding_level,
4965 use->names_in_scope, use->filename_o_goto,
4966 use->lineno_o_goto);
4970 check_switch_goto (level)
4971 struct binding_level *level;
4973 check_previous_goto_1 (NULL_TREE, level, level->names, NULL, 0);
4976 /* Check that any previously seen jumps to a newly defined label DECL
4977 are OK. Called by define_label. */
4980 check_previous_gotos (decl)
4983 struct named_label_use_list **usep;
4985 if (! TREE_USED (decl))
4988 for (usep = &named_label_uses; *usep; )
4990 struct named_label_use_list *use = *usep;
4991 if (use->label_decl == decl)
4993 check_previous_goto (use);
4997 usep = &(use->next);
5001 /* Check that a new jump to a label DECL is OK. Called by
5002 finish_goto_stmt. */
5010 struct named_label_list *lab;
5012 /* We can't know where a computed goto is jumping. So we assume
5014 if (! DECL_P (decl))
5017 /* If the label hasn't been defined yet, defer checking. */
5018 if (! DECL_INITIAL (decl))
5024 for (lab = named_labels; lab; lab = lab->next)
5025 if (decl == lab->label_decl)
5028 /* If the label is not on named_labels it's a gcc local label, so
5029 it must be in an outer scope, so jumping to it is always OK. */
5033 if ((lab->in_try_scope || lab->in_catch_scope || lab->bad_decls)
5036 cp_pedwarn_at ("jump to label `%D'", decl);
5037 pedwarn (" from here");
5041 for (bad = lab->bad_decls; bad; bad = TREE_CHAIN (bad))
5043 tree b = TREE_VALUE (bad);
5044 int u = decl_jump_unsafe (b);
5046 if (u > 1 && DECL_ARTIFICIAL (b))
5047 /* Can't skip init of __exception_info. */
5048 cp_error_at (" enters catch block", b);
5050 cp_error_at (" skips initialization of `%#D'", b);
5052 cp_pedwarn_at (" enters scope of non-POD `%#D'", b);
5055 if (lab->in_try_scope)
5056 error (" enters try block");
5057 else if (lab->in_catch_scope)
5058 error (" enters catch block");
5061 /* Define a label, specifying the location in the source file.
5062 Return the LABEL_DECL node for the label, if the definition is valid.
5063 Otherwise return 0. */
5066 define_label (filename, line, name)
5067 const char *filename;
5071 tree decl = lookup_label (name);
5072 struct named_label_list *ent;
5073 register struct binding_level *p;
5075 for (ent = named_labels; ent; ent = ent->next)
5076 if (ent->label_decl == decl)
5079 /* After labels, make any new cleanups in the function go into their
5080 own new (temporary) binding contour. */
5081 for (p = current_binding_level; !(p->parm_flag); p = p->level_chain)
5082 p->more_cleanups_ok = 0;
5084 if (name == get_identifier ("wchar_t"))
5085 cp_pedwarn ("label named wchar_t");
5087 if (DECL_INITIAL (decl) != NULL_TREE)
5089 cp_error ("duplicate label `%D'", decl);
5094 /* Mark label as having been defined. */
5095 DECL_INITIAL (decl) = error_mark_node;
5096 /* Say where in the source. */
5097 DECL_SOURCE_FILE (decl) = filename;
5098 DECL_SOURCE_LINE (decl) = line;
5101 ent->names_in_scope = current_binding_level->names;
5102 ent->binding_level = current_binding_level;
5104 check_previous_gotos (decl);
5111 struct binding_level *level;
5112 struct cp_switch *next;
5113 /* The SWITCH_STMT being built. */
5115 /* A splay-tree mapping the low element of a case range to the high
5116 element, or NULL_TREE if there is no high element. Used to
5117 determine whether or not a new case label duplicates an old case
5118 label. We need a tree, rather than simply a hash table, because
5119 of the GNU case range extension. */
5123 /* A stack of the currently active switch statements. The innermost
5124 switch statement is on the top of the stack. There is no need to
5125 mark the stack for garbage collection because it is only active
5126 during the processing of the body of a function, and we never
5127 collect at that point. */
5129 static struct cp_switch *switch_stack;
5131 /* Called right after a switch-statement condition is parsed.
5132 SWITCH_STMT is the switch statement being parsed. */
5135 push_switch (switch_stmt)
5139 = (struct cp_switch *) xmalloc (sizeof (struct cp_switch));
5140 p->level = current_binding_level;
5141 p->next = switch_stack;
5142 p->switch_stmt = switch_stmt;
5143 p->cases = splay_tree_new (case_compare, NULL, NULL);
5150 struct cp_switch *cs;
5153 splay_tree_delete (cs->cases);
5154 switch_stack = switch_stack->next;
5158 /* Note that we've seen a definition of a case label, and complain if this
5159 is a bad place for one. */
5162 finish_case_label (low_value, high_value)
5167 register struct binding_level *p;
5172 error ("case label not within a switch statement");
5174 cp_error ("case label `%E' not within a switch statement",
5177 error ("`default' label not within a switch statement");
5181 if (processing_template_decl)
5185 /* For templates, just add the case label; we'll do semantic
5186 analysis at instantiation-time. */
5187 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
5188 return add_stmt (build_case_label (low_value, high_value, label));
5191 /* Find the condition on which this switch statement depends. */
5192 cond = SWITCH_COND (switch_stack->switch_stmt);
5193 if (cond && TREE_CODE (cond) == TREE_LIST)
5194 cond = TREE_VALUE (cond);
5196 r = c_add_case_label (switch_stack->cases, cond, low_value, high_value);
5197 if (r == error_mark_node)
5200 check_switch_goto (switch_stack->level);
5202 /* After labels, make any new cleanups in the function go into their
5203 own new (temporary) binding contour. */
5204 for (p = current_binding_level; !(p->parm_flag); p = p->level_chain)
5205 p->more_cleanups_ok = 0;
5210 /* Return the list of declarations of the current level.
5211 Note that this list is in reverse order unless/until
5212 you nreverse it; and when you do nreverse it, you must
5213 store the result back using `storedecls' or you will lose. */
5218 return current_binding_level->names;
5221 /* Return the list of type-tags (for structs, etc) of the current level. */
5226 return current_binding_level->tags;
5229 /* Store the list of declarations of the current level.
5230 This is done for the parameter declarations of a function being defined,
5231 after they are modified in the light of any missing parameters. */
5237 current_binding_level->names = decls;
5240 /* Similarly, store the list of tags of the current level. */
5246 current_binding_level->tags = tags;
5249 /* Given NAME, an IDENTIFIER_NODE,
5250 return the structure (or union or enum) definition for that name.
5251 Searches binding levels from BINDING_LEVEL up to the global level.
5252 If THISLEVEL_ONLY is nonzero, searches only the specified context
5253 (but skips any tag-transparent contexts to find one that is
5254 meaningful for tags).
5255 FORM says which kind of type the caller wants;
5256 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5257 If the wrong kind of type is found, and it's not a template, an error is
5261 lookup_tag (form, name, binding_level, thislevel_only)
5262 enum tree_code form;
5264 struct binding_level *binding_level;
5267 register struct binding_level *level;
5268 /* Non-zero if, we should look past a template parameter level, even
5269 if THISLEVEL_ONLY. */
5270 int allow_template_parms_p = 1;
5272 for (level = binding_level; level; level = level->level_chain)
5275 if (ANON_AGGRNAME_P (name))
5276 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5278 /* There's no need for error checking here, because
5279 anon names are unique throughout the compilation. */
5280 if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
5281 return TREE_VALUE (tail);
5283 else if (level->namespace_p)
5284 /* Do namespace lookup. */
5285 for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
5287 tree old = binding_for_name (name, tail);
5289 /* If we just skipped past a template parameter level,
5290 even though THISLEVEL_ONLY, and we find a template
5291 class declaration, then we use the _TYPE node for the
5292 template. See the example below. */
5293 if (thislevel_only && !allow_template_parms_p
5294 && old && BINDING_VALUE (old)
5295 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
5296 old = TREE_TYPE (BINDING_VALUE (old));
5298 old = BINDING_TYPE (old);
5300 /* If it has an original type, it is a typedef, and we
5301 should not return it. */
5302 if (old && DECL_ORIGINAL_TYPE (TYPE_NAME (old)))
5304 if (old && TREE_CODE (old) != form
5305 && !(form != ENUMERAL_TYPE && TREE_CODE (old) == TEMPLATE_DECL))
5307 cp_error ("`%#D' redeclared as %C", old, form);
5312 if (thislevel_only || tail == global_namespace)
5316 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5318 if (TREE_PURPOSE (tail) == name)
5320 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
5321 /* Should tighten this up; it'll probably permit
5322 UNION_TYPE and a struct template, for example. */
5324 && !(form != ENUMERAL_TYPE && code == TEMPLATE_DECL))
5326 /* Definition isn't the kind we were looking for. */
5327 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail),
5331 return TREE_VALUE (tail);
5334 if (thislevel_only && ! level->tag_transparent)
5336 if (level->template_parms_p && allow_template_parms_p)
5338 /* We must deal with cases like this:
5340 template <class T> struct S;
5341 template <class T> struct S {};
5343 When looking up `S', for the second declaration, we
5344 would like to find the first declaration. But, we
5345 are in the pseudo-global level created for the
5346 template parameters, rather than the (surrounding)
5347 namespace level. Thus, we keep going one more level,
5348 even though THISLEVEL_ONLY is non-zero. */
5349 allow_template_parms_p = 0;
5361 set_current_level_tags_transparency (tags_transparent)
5362 int tags_transparent;
5364 current_binding_level->tag_transparent = tags_transparent;
5368 /* Given a type, find the tag that was defined for it and return the tag name.
5369 Otherwise return 0. However, the value can never be 0
5370 in the cases in which this is used.
5372 C++: If NAME is non-zero, this is the new name to install. This is
5373 done when replacing anonymous tags with real tag names. */
5376 lookup_tag_reverse (type, name)
5380 register struct binding_level *level;
5382 for (level = current_binding_level; level; level = level->level_chain)
5385 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5387 if (TREE_VALUE (tail) == type)
5390 TREE_PURPOSE (tail) = name;
5391 return TREE_PURPOSE (tail);
5398 /* Look up NAME in the NAMESPACE. */
5401 lookup_namespace_name (namespace, name)
5402 tree namespace, name;
5405 tree template_id = NULL_TREE;
5407 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5409 if (TREE_CODE (name) == NAMESPACE_DECL)
5410 /* This happens for A::B<int> when B is a namespace. */
5412 else if (TREE_CODE (name) == TEMPLATE_DECL)
5414 /* This happens for A::B where B is a template, and there are no
5415 template arguments. */
5416 cp_error ("invalid use of `%D'", name);
5417 return error_mark_node;
5420 namespace = ORIGINAL_NAMESPACE (namespace);
5422 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5425 name = TREE_OPERAND (name, 0);
5426 if (TREE_CODE (name) == OVERLOAD)
5427 name = DECL_NAME (OVL_CURRENT (name));
5428 else if (DECL_P (name))
5429 name = DECL_NAME (name);
5432 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5434 val = make_node (CPLUS_BINDING);
5435 if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5436 return error_mark_node;
5438 if (BINDING_VALUE (val))
5440 val = BINDING_VALUE (val);
5444 if (DECL_CLASS_TEMPLATE_P (val))
5445 val = lookup_template_class (val,
5446 TREE_OPERAND (template_id, 1),
5447 /*in_decl=*/NULL_TREE,
5448 /*context=*/NULL_TREE,
5449 /*entering_scope=*/0,
5451 else if (DECL_FUNCTION_TEMPLATE_P (val)
5452 || TREE_CODE (val) == OVERLOAD)
5453 val = lookup_template_function (val,
5454 TREE_OPERAND (template_id, 1));
5457 cp_error ("`%D::%D' is not a template",
5459 return error_mark_node;
5463 /* If we have a single function from a using decl, pull it out. */
5464 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5465 val = OVL_FUNCTION (val);
5469 cp_error ("`%D' undeclared in namespace `%D'", name, namespace);
5470 return error_mark_node;
5473 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5475 static unsigned long
5483 hash = (((unsigned long) TYPE_CONTEXT (t))
5484 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t))));
5489 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5492 typename_compare (k1, k2)
5503 d1 = TYPE_NAME (t1);
5504 d2 = TYPE_NAME (t2);
5506 return (DECL_NAME (d1) == DECL_NAME (d2)
5507 && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2))
5508 && ((TREE_TYPE (t1) != NULL_TREE)
5509 == (TREE_TYPE (t2) != NULL_TREE))
5510 && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5511 && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5514 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5515 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5516 is non-NULL, this type is being created by the implicit typename
5517 extension, and BASE_TYPE is a type named `t' in some base class of
5518 `T' which depends on template parameters.
5520 Returns the new TYPENAME_TYPE. */
5523 build_typename_type (context, name, fullname, base_type)
5531 struct hash_entry *e;
5533 static struct hash_table ht;
5537 static struct hash_table *h = &ht;
5539 hash_table_init (&ht, &hash_newfunc, &typename_hash, &typename_compare);
5540 ggc_add_tree_hash_table_root (&h, 1);
5543 /* Build the TYPENAME_TYPE. */
5544 t = make_aggr_type (TYPENAME_TYPE);
5545 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5546 TYPENAME_TYPE_FULLNAME (t) = fullname;
5547 TREE_TYPE (t) = base_type;
5549 /* Build the corresponding TYPE_DECL. */
5550 d = build_decl (TYPE_DECL, name, t);
5551 TYPE_NAME (TREE_TYPE (d)) = d;
5552 TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5553 DECL_CONTEXT (d) = FROB_CONTEXT (context);
5554 DECL_ARTIFICIAL (d) = 1;
5556 /* See if we already have this type. */
5557 e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0);
5561 /* Insert the type into the table. */
5562 hash_lookup (&ht, t, /*create=*/true, /*copy=*/0);
5567 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5568 unless an error occurs, in which case error_mark_node is returned.
5569 If COMPLAIN zero, don't complain about any errors that occur. */
5572 make_typename_type (context, name, complain)
5580 if (!(TYPE_LANG_SPECIFIC (name)
5581 && (CLASSTYPE_IS_TEMPLATE (name)
5582 || CLASSTYPE_USE_TEMPLATE (name))))
5583 name = TYPE_IDENTIFIER (name);
5585 /* Create a TEMPLATE_ID_EXPR for the type. */
5586 name = build_nt (TEMPLATE_ID_EXPR,
5587 CLASSTYPE_TI_TEMPLATE (name),
5588 CLASSTYPE_TI_ARGS (name));
5590 else if (TREE_CODE (name) == TYPE_DECL)
5591 name = DECL_NAME (name);
5595 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5597 name = TREE_OPERAND (name, 0);
5598 if (TREE_CODE (name) == TEMPLATE_DECL)
5599 name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5601 if (TREE_CODE (name) != IDENTIFIER_NODE)
5602 my_friendly_abort (2000);
5604 if (TREE_CODE (context) == NAMESPACE_DECL)
5606 /* We can get here from typename_sub0 in the explicit_template_type
5607 expansion. Just fail. */
5609 cp_error ("no class template named `%#T' in `%#T'",
5611 return error_mark_node;
5614 if (! uses_template_parms (context)
5615 || currently_open_class (context))
5617 if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5619 tree tmpl = NULL_TREE;
5620 if (IS_AGGR_TYPE (context))
5621 tmpl = lookup_field (context, name, 0, 0);
5622 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5625 cp_error ("no class template named `%#T' in `%#T'",
5627 return error_mark_node;
5630 return lookup_template_class (tmpl,
5631 TREE_OPERAND (fullname, 1),
5633 /*entering_scope=*/0,
5640 if (!IS_AGGR_TYPE (context))
5643 cp_error ("no type named `%#T' in `%#T'", name, context);
5644 return error_mark_node;
5647 t = lookup_field (context, name, 0, 1);
5649 return TREE_TYPE (t);
5653 /* If the CONTEXT is not a template type, then either the field is
5654 there now or its never going to be. */
5655 if (!uses_template_parms (context))
5658 cp_error ("no type named `%#T' in `%#T'", name, context);
5659 return error_mark_node;
5663 return build_typename_type (context, name, fullname, NULL_TREE);
5666 /* Select the right _DECL from multiple choices. */
5669 select_decl (binding, flags)
5674 val = BINDING_VALUE (binding);
5676 /* When we implicitly declare some builtin entity, we mark it
5677 DECL_ANTICIPATED, so that we know to ignore it until it is
5679 if (val && DECL_P (val)
5680 && DECL_LANG_SPECIFIC (val)
5681 && DECL_ANTICIPATED (val))
5684 if (LOOKUP_NAMESPACES_ONLY (flags))
5686 /* We are not interested in types. */
5687 if (val && TREE_CODE (val) == NAMESPACE_DECL)
5692 /* If we could have a type and
5693 we have nothing or we need a type and have none. */
5694 if (BINDING_TYPE (binding)
5695 && (!val || ((flags & LOOKUP_PREFER_TYPES)
5696 && TREE_CODE (val) != TYPE_DECL)))
5697 val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5698 /* Don't return non-types if we really prefer types. */
5699 else if (val && LOOKUP_TYPES_ONLY (flags) && TREE_CODE (val) != TYPE_DECL
5700 && (TREE_CODE (val) != TEMPLATE_DECL
5701 || !DECL_CLASS_TEMPLATE_P (val)))
5707 /* Unscoped lookup of a global: iterate over current namespaces,
5708 considering using-directives. If SPACESP is non-NULL, store a list
5709 of the namespaces we've considered in it. */
5712 unqualified_namespace_lookup (name, flags, spacesp)
5717 tree b = make_node (CPLUS_BINDING);
5718 tree initial = current_decl_namespace ();
5719 tree scope = initial;
5721 struct binding_level *level;
5722 tree val = NULL_TREE;
5725 *spacesp = NULL_TREE;
5727 for (; !val; scope = CP_DECL_CONTEXT (scope))
5730 *spacesp = tree_cons (scope, NULL_TREE, *spacesp);
5731 val = binding_for_name (name, scope);
5733 /* Initialize binding for this context. */
5734 BINDING_VALUE (b) = BINDING_VALUE (val);
5735 BINDING_TYPE (b) = BINDING_TYPE (val);
5737 /* Add all _DECLs seen through local using-directives. */
5738 for (level = current_binding_level;
5739 !level->namespace_p;
5740 level = level->level_chain)
5741 if (!lookup_using_namespace (name, b, level->using_directives,
5742 scope, flags, spacesp))
5743 /* Give up because of error. */
5744 return error_mark_node;
5746 /* Add all _DECLs seen through global using-directives. */
5747 /* XXX local and global using lists should work equally. */
5751 if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5752 scope, flags, spacesp))
5753 /* Give up because of error. */
5754 return error_mark_node;
5755 if (siter == scope) break;
5756 siter = CP_DECL_CONTEXT (siter);
5759 val = select_decl (b, flags);
5760 if (scope == global_namespace)
5766 /* Combine prefer_type and namespaces_only into flags. */
5769 lookup_flags (prefer_type, namespaces_only)
5770 int prefer_type, namespaces_only;
5772 if (namespaces_only)
5773 return LOOKUP_PREFER_NAMESPACES;
5774 if (prefer_type > 1)
5775 return LOOKUP_PREFER_TYPES;
5776 if (prefer_type > 0)
5777 return LOOKUP_PREFER_BOTH;
5781 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5782 ignore it or not. Subroutine of lookup_name_real. */
5785 qualify_lookup (val, flags)
5789 if (val == NULL_TREE)
5791 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5793 if ((flags & LOOKUP_PREFER_TYPES)
5794 && (TREE_CODE (val) == TYPE_DECL
5795 || ((flags & LOOKUP_TEMPLATES_EXPECTED)
5796 && DECL_CLASS_TEMPLATE_P (val))))
5798 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
5803 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5807 warn_about_implicit_typename_lookup (typename, binding)
5811 tree subtype = TREE_TYPE (TREE_TYPE (typename));
5812 tree name = DECL_NAME (typename);
5814 if (! (TREE_CODE (binding) == TEMPLATE_DECL
5815 && CLASSTYPE_TEMPLATE_INFO (subtype)
5816 && CLASSTYPE_TI_TEMPLATE (subtype) == binding)
5817 && ! (TREE_CODE (binding) == TYPE_DECL
5818 && same_type_p (TREE_TYPE (binding), subtype)))
5820 cp_warning ("lookup of `%D' finds `%#D'",
5822 cp_warning (" instead of `%D' from dependent base class",
5824 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5825 constructor_name (current_class_type), name);
5829 /* Look up NAME in the current binding level and its superiors in the
5830 namespace of variables, functions and typedefs. Return a ..._DECL
5831 node of some kind representing its definition if there is only one
5832 such declaration, or return a TREE_LIST with all the overloaded
5833 definitions if there are many, or return 0 if it is undefined.
5835 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5836 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5837 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5838 Otherwise we prefer non-TYPE_DECLs.
5840 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5841 using IDENTIFIER_CLASS_VALUE. */
5844 lookup_name_real (name, prefer_type, nonclass, namespaces_only)
5846 int prefer_type, nonclass, namespaces_only;
5849 tree val = NULL_TREE;
5851 tree from_obj = NULL_TREE;
5853 int val_is_implicit_typename = 0;
5855 /* Hack: copy flag set by parser, if set. */
5856 if (only_namespace_names)
5857 namespaces_only = 1;
5859 if (prefer_type == -2)
5861 extern int looking_for_typename;
5862 tree type = NULL_TREE;
5865 prefer_type = looking_for_typename;
5867 flags = lookup_flags (prefer_type, namespaces_only);
5868 /* If the next thing is '<', class templates are types. */
5869 if (looking_for_template)
5870 flags |= LOOKUP_TEMPLATES_EXPECTED;
5874 else if (got_object != error_mark_node)
5879 if (type == error_mark_node)
5880 return error_mark_node;
5881 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
5882 type = TREE_TYPE (type);
5885 type = complete_type (type);
5887 if (TREE_CODE (type) == VOID_TYPE)
5888 type = global_namespace;
5889 if (TREE_CODE (type) == NAMESPACE_DECL)
5891 val = make_node (CPLUS_BINDING);
5892 flags |= LOOKUP_COMPLAIN;
5893 if (!qualified_lookup_using_namespace (name, type, val, flags))
5895 val = select_decl (val, flags);
5897 else if (! IS_AGGR_TYPE (type)
5898 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5899 || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM
5900 || TREE_CODE (type) == TYPENAME_TYPE)
5901 /* Someone else will give an error about this if needed. */
5903 else if (type == current_class_type)
5904 val = IDENTIFIER_CLASS_VALUE (name);
5907 val = lookup_member (type, name, 0, prefer_type);
5908 type_access_control (type, val);
5910 /* Restore the containing TYPENAME_TYPE if we looked
5911 through it before. */
5912 if (got_scope && got_scope != type
5913 && val && TREE_CODE (val) == TYPE_DECL
5914 && TREE_CODE (TREE_TYPE (val)) == TYPENAME_TYPE)
5915 TYPE_CONTEXT (TREE_TYPE (val)) = got_scope;
5923 else if (got_object && val)
5931 flags = lookup_flags (prefer_type, namespaces_only);
5932 /* If we're not parsing, we need to complain. */
5933 flags |= LOOKUP_COMPLAIN;
5936 /* First, look in non-namespace scopes. */
5938 if (current_class_type == NULL_TREE)
5941 for (t = IDENTIFIER_BINDING (name); t; t = TREE_CHAIN (t))
5945 if (!LOCAL_BINDING_P (t) && nonclass)
5946 /* We're not looking for class-scoped bindings, so keep going. */
5949 /* If this is the kind of thing we're looking for, we're done. */
5950 if (qualify_lookup (BINDING_VALUE (t), flags))
5951 binding = BINDING_VALUE (t);
5952 else if ((flags & LOOKUP_PREFER_TYPES)
5953 && qualify_lookup (BINDING_TYPE (t), flags))
5954 binding = BINDING_TYPE (t);
5956 binding = NULL_TREE;
5958 /* Handle access control on types from enclosing or base classes. */
5959 if (binding && ! yylex
5960 && BINDING_LEVEL (t) && BINDING_LEVEL (t)->parm_flag == 2)
5961 type_access_control (BINDING_LEVEL (t)->this_class, binding);
5964 && (!val || !IMPLICIT_TYPENAME_TYPE_DECL_P (binding)))
5966 if (val_is_implicit_typename && !yylex)
5967 warn_about_implicit_typename_lookup (val, binding);
5969 val_is_implicit_typename
5970 = IMPLICIT_TYPENAME_TYPE_DECL_P (val);
5971 if (!val_is_implicit_typename)
5976 /* Now lookup in namespace scopes. */
5977 if (!val || val_is_implicit_typename)
5979 t = unqualified_namespace_lookup (name, flags, 0);
5982 if (val_is_implicit_typename && !yylex)
5983 warn_about_implicit_typename_lookup (val, t);
5991 /* This should only warn about types used in qualified-ids. */
5992 if (from_obj && from_obj != val)
5994 if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL
5995 && TREE_CODE (val) == TYPE_DECL
5996 && ! same_type_p (TREE_TYPE (from_obj), TREE_TYPE (val)))
5998 lookup of `%D' in the scope of `%#T' (`%#D') \
5999 does not match lookup in the current scope (`%#D')",
6000 name, got_object, from_obj, val);
6002 /* We don't change val to from_obj if got_object depends on
6003 template parms because that breaks implicit typename for
6004 destructor calls. */
6005 if (! uses_template_parms (got_object))
6009 /* If we have a single function from a using decl, pull it out. */
6010 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
6011 val = OVL_FUNCTION (val);
6020 lookup_name_nonclass (name)
6023 return lookup_name_real (name, 0, 1, 0);
6027 lookup_function_nonclass (name, args)
6031 return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
6035 lookup_name_namespace_only (name)
6038 /* type-or-namespace, nonclass, namespace_only */
6039 return lookup_name_real (name, 1, 1, 1);
6043 lookup_name (name, prefer_type)
6047 return lookup_name_real (name, prefer_type, 0, 0);
6050 /* Similar to `lookup_name' but look only in the innermost non-class
6054 lookup_name_current_level (name)
6057 struct binding_level *b;
6060 b = current_binding_level;
6061 while (b->parm_flag == 2)
6066 t = IDENTIFIER_NAMESPACE_VALUE (name);
6068 /* extern "C" function() */
6069 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
6072 else if (IDENTIFIER_BINDING (name)
6073 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
6077 if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
6078 return IDENTIFIER_VALUE (name);
6090 /* Like lookup_name_current_level, but for types. */
6093 lookup_type_current_level (name)
6096 register tree t = NULL_TREE;
6098 my_friendly_assert (! current_binding_level->namespace_p, 980716);
6100 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
6101 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
6103 struct binding_level *b = current_binding_level;
6106 if (purpose_member (name, b->type_shadowed))
6107 return REAL_IDENTIFIER_TYPE_VALUE (name);
6119 begin_only_namespace_names ()
6121 only_namespace_names = 1;
6125 end_only_namespace_names ()
6127 only_namespace_names = 0;
6130 /* Push the declarations of builtin types into the namespace.
6131 RID_INDEX is the index of the builtin type
6132 in the array RID_POINTERS. NAME is the name used when looking
6133 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6136 record_builtin_type (rid_index, name, type)
6141 tree rname = NULL_TREE, tname = NULL_TREE;
6142 tree tdecl = NULL_TREE;
6144 if ((int) rid_index < (int) RID_MAX)
6145 rname = ridpointers[(int) rid_index];
6147 tname = get_identifier (name);
6149 TYPE_BUILT_IN (type) = 1;
6153 tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
6154 set_identifier_type_value (tname, NULL_TREE);
6155 if ((int) rid_index < (int) RID_MAX)
6156 /* Built-in types live in the global namespace. */
6157 SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
6159 if (rname != NULL_TREE)
6161 if (tname != NULL_TREE)
6163 set_identifier_type_value (rname, NULL_TREE);
6164 SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
6168 tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
6169 set_identifier_type_value (rname, NULL_TREE);
6174 /* Record one of the standard Java types.
6175 * Declare it as having the given NAME.
6176 * If SIZE > 0, it is the size of one of the integral types;
6177 * otherwise it is the negative of the size of one of the other types. */
6180 record_builtin_java_type (name, size)
6186 type = make_signed_type (size);
6187 else if (size > -32)
6188 { /* "__java_char" or ""__java_boolean". */
6189 type = make_unsigned_type (-size);
6190 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6193 { /* "__java_float" or ""__java_double". */
6194 type = make_node (REAL_TYPE);
6195 TYPE_PRECISION (type) = - size;
6198 record_builtin_type (RID_MAX, name, type);
6199 decl = TYPE_NAME (type);
6201 /* Suppress generate debug symbol entries for these types,
6202 since for normal C++ they are just clutter.
6203 However, push_lang_context undoes this if extern "Java" is seen. */
6204 DECL_IGNORED_P (decl) = 1;
6206 TYPE_FOR_JAVA (type) = 1;
6210 /* Push a type into the namespace so that the back-ends ignore it. */
6213 record_unknown_type (type, name)
6217 tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
6218 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6219 DECL_IGNORED_P (decl) = 1;
6220 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
6221 TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
6222 TYPE_ALIGN (type) = 1;
6223 TYPE_USER_ALIGN (type) = 0;
6224 TYPE_MODE (type) = TYPE_MODE (void_type_node);
6227 /* An string for which we should create an IDENTIFIER_NODE at
6230 typedef struct predefined_identifier
6232 /* The name of the identifier. */
6234 /* The place where the IDENTIFIER_NODE should be stored. */
6236 /* Non-zero if this is the name of a constructor or destructor. */
6238 } predefined_identifier;
6240 /* Create all the predefined identifiers. */
6243 initialize_predefined_identifiers ()
6245 struct predefined_identifier *pid;
6247 /* A table of identifiers to create at startup. */
6248 static predefined_identifier predefined_identifiers[] = {
6249 { "C++", &lang_name_cplusplus, 0 },
6250 { "C", &lang_name_c, 0 },
6251 { "Java", &lang_name_java, 0 },
6252 { CTOR_NAME, &ctor_identifier, 1 },
6253 { "__base_ctor", &base_ctor_identifier, 1 },
6254 { "__comp_ctor", &complete_ctor_identifier, 1 },
6255 { DTOR_NAME, &dtor_identifier, 1 },
6256 { "__comp_dtor", &complete_dtor_identifier, 1 },
6257 { "__base_dtor", &base_dtor_identifier, 1 },
6258 { "__deleting_dtor", &deleting_dtor_identifier, 1 },
6259 { IN_CHARGE_NAME, &in_charge_identifier, 0 },
6260 { "nelts", &nelts_identifier, 0 },
6261 { THIS_NAME, &this_identifier, 0 },
6262 { VTABLE_DELTA_NAME, &delta_identifier, 0 },
6263 { VTABLE_PFN_NAME, &pfn_identifier, 0 },
6264 { "_vptr", &vptr_identifier, 0 },
6265 { "__vtt_parm", &vtt_parm_identifier, 0 },
6266 { "std", &std_identifier, 0 },
6270 for (pid = predefined_identifiers; pid->name; ++pid)
6272 *pid->node = get_identifier (pid->name);
6273 if (pid->ctor_or_dtor_p)
6274 IDENTIFIER_CTOR_OR_DTOR_P (*pid->node) = 1;
6278 /* Create the predefined scalar types of C,
6279 and some nodes representing standard constants (0, 1, (void *)0).
6280 Initialize the global binding level.
6281 Make definitions for built-in primitive functions. */
6284 init_decl_processing ()
6287 tree void_ftype_ptr;
6289 /* Create all the identifiers we need. */
6290 initialize_predefined_identifiers ();
6292 /* Fill in back-end hooks. */
6293 init_lang_status = &push_cp_function_context;
6294 free_lang_status = &pop_cp_function_context;
6295 mark_lang_status = &mark_cp_function_context;
6296 lang_safe_from_p = &c_safe_from_p;
6297 lang_dump_tree = &cp_dump_tree;
6298 lang_missing_noreturn_ok_p = &cp_missing_noreturn_ok_p;
6304 /* Create the global variables. */
6305 push_to_top_level ();
6307 /* Enter the global namespace. */
6308 my_friendly_assert (global_namespace == NULL_TREE, 375);
6309 push_namespace (get_identifier ("::"));
6310 global_namespace = current_namespace;
6311 current_lang_name = NULL_TREE;
6313 /* Adjust various flags based on command-line settings. */
6314 if (! flag_permissive && ! pedantic)
6315 flag_pedantic_errors = 1;
6316 if (!flag_no_inline)
6318 flag_inline_trees = 1;
6321 if (flag_inline_functions)
6323 flag_inline_trees = 2;
6324 flag_inline_functions = 0;
6327 /* In C++, we never create builtin functions whose name does not
6328 begin with `__'. Users should be using headers to get prototypes
6329 in C++. It would be nice if we could warn when `-fbuiltin' is
6330 used explicitly, but we do not have that information. */
6331 flag_no_builtin = 1;
6334 current_lang_name = lang_name_c;
6336 current_function_decl = NULL_TREE;
6337 current_binding_level = NULL_BINDING_LEVEL;
6338 free_binding_level = NULL_BINDING_LEVEL;
6340 build_common_tree_nodes (flag_signed_char);
6342 error_mark_list = build_tree_list (error_mark_node, error_mark_node);
6343 TREE_TYPE (error_mark_list) = error_mark_node;
6345 /* Make the binding_level structure for global names. */
6347 global_binding_level = current_binding_level;
6348 /* The global level is the namespace level of ::. */
6349 NAMESPACE_LEVEL (global_namespace) = global_binding_level;
6350 declare_namespace_level ();
6352 /* Create the `std' namespace. */
6353 push_namespace (std_identifier);
6354 std_node = current_namespace;
6357 c_common_nodes_and_builtins ();
6359 java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6360 java_short_type_node = record_builtin_java_type ("__java_short", 16);
6361 java_int_type_node = record_builtin_java_type ("__java_int", 32);
6362 java_long_type_node = record_builtin_java_type ("__java_long", 64);
6363 java_float_type_node = record_builtin_java_type ("__java_float", -32);
6364 java_double_type_node = record_builtin_java_type ("__java_double", -64);
6365 java_char_type_node = record_builtin_java_type ("__java_char", -16);
6366 java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6368 integer_two_node = build_int_2 (2, 0);
6369 TREE_TYPE (integer_two_node) = integer_type_node;
6370 integer_three_node = build_int_2 (3, 0);
6371 TREE_TYPE (integer_three_node) = integer_type_node;
6373 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6374 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6375 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6376 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6377 TYPE_PRECISION (boolean_type_node) = 1;
6378 record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6379 boolean_false_node = build_int_2 (0, 0);
6380 TREE_TYPE (boolean_false_node) = boolean_type_node;
6381 boolean_true_node = build_int_2 (1, 0);
6382 TREE_TYPE (boolean_true_node) = boolean_type_node;
6384 signed_size_zero_node = build_int_2 (0, 0);
6385 TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype));
6387 empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE);
6390 record_builtin_type (RID_MAX, NULL, string_type_node);
6393 delta_type_node = ptrdiff_type_node;
6394 vtable_index_type = ptrdiff_type_node;
6396 vtt_parm_type = build_pointer_type (const_ptr_type_node);
6397 lang_type_promotes_to = convert_type_from_ellipsis;
6399 void_ftype = build_function_type (void_type_node, void_list_node);
6400 void_ftype_ptr = build_function_type (void_type_node,
6401 tree_cons (NULL_TREE,
6405 = build_exception_variant (void_ftype_ptr, empty_except_spec);
6407 /* C++ extensions */
6409 unknown_type_node = make_node (UNKNOWN_TYPE);
6410 record_unknown_type (unknown_type_node, "unknown type");
6412 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6413 TREE_TYPE (unknown_type_node) = unknown_type_node;
6415 TREE_TYPE (null_node) = type_for_size (POINTER_SIZE, 0);
6417 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6419 TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6420 TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6423 /* Make sure we get a unique function type, so we can give
6424 its pointer type a name. (This wins for gdb.) */
6425 tree vfunc_type = make_node (FUNCTION_TYPE);
6426 TREE_TYPE (vfunc_type) = integer_type_node;
6427 TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6428 layout_type (vfunc_type);
6430 vtable_entry_type = build_pointer_type (vfunc_type);
6432 record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6435 = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6436 layout_type (vtbl_type_node);
6437 vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6438 record_builtin_type (RID_MAX, NULL, vtbl_type_node);
6439 vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6440 layout_type (vtbl_ptr_type_node);
6441 record_builtin_type (RID_MAX, NULL, vtbl_ptr_type_node);
6443 push_namespace (get_identifier ("__cxxabiv1"));
6444 abi_node = current_namespace;
6447 global_type_node = make_node (LANG_TYPE);
6448 record_unknown_type (global_type_node, "global type");
6451 current_lang_name = lang_name_cplusplus;
6454 tree bad_alloc_type_node, newtype, deltype;
6455 tree ptr_ftype_sizetype;
6457 push_namespace (std_identifier);
6458 bad_alloc_type_node = xref_tag
6459 (class_type_node, get_identifier ("bad_alloc"), 1);
6462 = build_function_type (ptr_type_node,
6463 tree_cons (NULL_TREE,
6466 newtype = build_exception_variant
6467 (ptr_ftype_sizetype, add_exception_specifier
6468 (NULL_TREE, bad_alloc_type_node, -1));
6469 deltype = build_exception_variant (void_ftype_ptr, empty_except_spec);
6470 push_cp_library_fn (NEW_EXPR, newtype);
6471 push_cp_library_fn (VEC_NEW_EXPR, newtype);
6472 global_delete_fndecl = push_cp_library_fn (DELETE_EXPR, deltype);
6473 push_cp_library_fn (VEC_DELETE_EXPR, deltype);
6477 = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype);
6479 /* Perform other language dependent initializations. */
6480 init_class_processing ();
6481 init_init_processing ();
6482 init_search_processing ();
6483 init_rtti_processing ();
6485 if (flag_exceptions)
6486 init_exception_processing ();
6488 if (! supports_one_only ())
6491 make_fname_decl = cp_make_fname_decl;
6492 start_fname_decls ();
6494 /* Prepare to check format strings against argument lists. */
6495 init_function_format_info ();
6497 /* Show we use EH for cleanups. */
6498 using_eh_for_cleanups ();
6500 valid_lang_attribute = cp_valid_lang_attribute;
6502 /* Maintain consistency. Perhaps we should just complain if they
6503 say -fwritable-strings? */
6504 if (flag_writable_strings)
6505 flag_const_strings = 0;
6507 /* Add GC roots for all of our global variables. */
6508 ggc_add_tree_root (c_global_trees, sizeof c_global_trees / sizeof(tree));
6509 ggc_add_tree_root (cp_global_trees, sizeof cp_global_trees / sizeof(tree));
6510 ggc_add_tree_root (&integer_three_node, 1);
6511 ggc_add_tree_root (&integer_two_node, 1);
6512 ggc_add_tree_root (&signed_size_zero_node, 1);
6513 ggc_add_tree_root (&size_one_node, 1);
6514 ggc_add_tree_root (&size_zero_node, 1);
6515 ggc_add_root (&global_binding_level, 1, sizeof global_binding_level,
6516 mark_binding_level);
6517 ggc_add_root (&scope_chain, 1, sizeof scope_chain, &mark_saved_scope);
6518 ggc_add_tree_root (&static_ctors, 1);
6519 ggc_add_tree_root (&static_dtors, 1);
6520 ggc_add_tree_root (&lastiddecl, 1);
6522 ggc_add_tree_root (&last_function_parms, 1);
6523 ggc_add_tree_root (&error_mark_list, 1);
6525 ggc_add_tree_root (&global_namespace, 1);
6526 ggc_add_tree_root (&global_type_node, 1);
6527 ggc_add_tree_root (&anonymous_namespace_name, 1);
6529 ggc_add_tree_root (&got_object, 1);
6530 ggc_add_tree_root (&got_scope, 1);
6532 ggc_add_tree_root (¤t_lang_name, 1);
6533 ggc_add_tree_root (&static_aggregates, 1);
6534 ggc_add_tree_root (&free_bindings, 1);
6537 /* Generate an initializer for a function naming variable from
6538 NAME. NAME may be NULL, in which case we generate a special
6539 ERROR_MARK node which should be replaced later. */
6542 cp_fname_init (name)
6545 tree domain = NULL_TREE;
6547 tree init = NULL_TREE;
6552 length = strlen (name);
6553 domain = build_index_type (size_int (length));
6554 init = build_string (length + 1, name);
6557 type = build_qualified_type (char_type_node, TYPE_QUAL_CONST);
6558 type = build_cplus_array_type (type, domain);
6561 TREE_TYPE (init) = type;
6563 /* We don't know the value until instantiation time. Make
6564 something which will be digested now, but replaced later. */
6565 init = build (ERROR_MARK, type);
6570 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6571 decl, NAME is the initialization string and TYPE_DEP indicates whether
6572 NAME depended on the type of the function. We make use of that to detect
6573 __PRETTY_FUNCTION__ inside a template fn. This is being done
6574 lazily at the point of first use, so we musn't push the decl now. */
6577 cp_make_fname_decl (id, type_dep)
6581 const char *name = (type_dep && processing_template_decl
6582 ? NULL : fname_as_string (type_dep));
6583 tree init = cp_fname_init (name);
6584 tree decl = build_decl (VAR_DECL, id, TREE_TYPE (init));
6586 /* As we don't push the decl here, we must set the context. */
6587 DECL_CONTEXT (decl) = current_function_decl;
6588 DECL_PRETTY_FUNCTION_P (decl) = type_dep;
6590 TREE_STATIC (decl) = 1;
6591 TREE_READONLY (decl) = 1;
6592 DECL_ARTIFICIAL (decl) = 1;
6593 DECL_INITIAL (decl) = init;
6595 TREE_USED (decl) = 1;
6597 cp_finish_decl (decl, init, NULL_TREE, LOOKUP_ONLYCONVERTING);
6602 /* Entry point for the benefit of c_common_nodes_and_builtins.
6604 Make a definition for a builtin function named NAME and whose data type
6605 is TYPE. TYPE should be a function type with argument types.
6607 CLASS and CODE tell later passes how to compile calls to this function.
6608 See tree.h for possible values.
6610 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6611 the name to be called if we can't opencode the function. */
6614 builtin_function (name, type, code, class, libname)
6618 enum built_in_class class;
6619 const char *libname;
6621 tree decl = build_library_fn_1 (get_identifier (name), ERROR_MARK, type);
6622 DECL_BUILT_IN_CLASS (decl) = class;
6623 DECL_FUNCTION_CODE (decl) = code;
6625 my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 392);
6627 /* All builtins that don't begin with an `_' should go in the `std'
6631 push_namespace (std_identifier);
6632 DECL_CONTEXT (decl) = std_node;
6638 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6639 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6640 function in the namespace. */
6642 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (libname));
6643 make_decl_rtl (decl, NULL);
6645 /* Warn if a function in the namespace for users
6646 is used without an occasion to consider it declared. */
6647 if (name[0] != '_' || name[1] != '_')
6648 DECL_ANTICIPATED (decl) = 1;
6653 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6654 function. Not called directly. */
6657 build_library_fn_1 (name, operator_code, type)
6659 enum tree_code operator_code;
6662 tree fn = build_lang_decl (FUNCTION_DECL, name, type);
6663 DECL_EXTERNAL (fn) = 1;
6664 TREE_PUBLIC (fn) = 1;
6665 DECL_ARTIFICIAL (fn) = 1;
6666 TREE_NOTHROW (fn) = 1;
6667 SET_OVERLOADED_OPERATOR_CODE (fn, operator_code);
6668 SET_DECL_LANGUAGE (fn, lang_c);
6672 /* Returns the _DECL for a library function with C linkage.
6673 We assume that such functions never throw; if this is incorrect,
6674 callers should unset TREE_NOTHROW. */
6677 build_library_fn (name, type)
6681 return build_library_fn_1 (name, ERROR_MARK, type);
6684 /* Returns the _DECL for a library function with C++ linkage. */
6687 build_cp_library_fn (name, operator_code, type)
6689 enum tree_code operator_code;
6692 tree fn = build_library_fn_1 (name, operator_code, type);
6693 TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type);
6694 DECL_CONTEXT (fn) = FROB_CONTEXT (current_namespace);
6695 SET_DECL_LANGUAGE (fn, lang_cplusplus);
6696 set_mangled_name_for_decl (fn);
6700 /* Like build_library_fn, but takes a C string instead of an
6704 build_library_fn_ptr (name, type)
6708 return build_library_fn (get_identifier (name), type);
6711 /* Like build_cp_library_fn, but takes a C string instead of an
6715 build_cp_library_fn_ptr (name, type)
6719 return build_cp_library_fn (get_identifier (name), ERROR_MARK, type);
6722 /* Like build_library_fn, but also pushes the function so that we will
6723 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6726 push_library_fn (name, type)
6729 tree fn = build_library_fn (name, type);
6730 pushdecl_top_level (fn);
6734 /* Like build_cp_library_fn, but also pushes the function so that it
6735 will be found by normal lookup. */
6738 push_cp_library_fn (operator_code, type)
6739 enum tree_code operator_code;
6742 tree fn = build_cp_library_fn (ansi_opname (operator_code),
6749 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6753 push_void_library_fn (name, parmtypes)
6754 tree name, parmtypes;
6756 tree type = build_function_type (void_type_node, parmtypes);
6757 return push_library_fn (name, type);
6760 /* Like push_library_fn, but also note that this function throws
6761 and does not return. Used for __throw_foo and the like. */
6764 push_throw_library_fn (name, type)
6767 tree fn = push_library_fn (name, type);
6768 TREE_THIS_VOLATILE (fn) = 1;
6769 TREE_NOTHROW (fn) = 0;
6773 /* When we call finish_struct for an anonymous union, we create
6774 default copy constructors and such. But, an anonymous union
6775 shouldn't have such things; this function undoes the damage to the
6776 anonymous union type T.
6778 (The reason that we create the synthesized methods is that we don't
6779 distinguish `union { int i; }' from `typedef union { int i; } U'.
6780 The first is an anonymous union; the second is just an ordinary
6784 fixup_anonymous_aggr (t)
6789 /* Wipe out memory of synthesized methods */
6790 TYPE_HAS_CONSTRUCTOR (t) = 0;
6791 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
6792 TYPE_HAS_INIT_REF (t) = 0;
6793 TYPE_HAS_CONST_INIT_REF (t) = 0;
6794 TYPE_HAS_ASSIGN_REF (t) = 0;
6795 TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
6797 /* Splice the implicitly generated functions out of the TYPE_METHODS
6799 q = &TYPE_METHODS (t);
6802 if (DECL_ARTIFICIAL (*q))
6803 *q = TREE_CHAIN (*q);
6805 q = &TREE_CHAIN (*q);
6808 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6809 if (TYPE_METHODS (t))
6810 cp_error_at ("an anonymous union cannot have function members", t);
6812 /* Anonymous aggregates cannot have fields with ctors, dtors or complex
6813 assignment operators (because they cannot have these methods themselves).
6814 For anonymous unions this is already checked because they are not allowed
6815 in any union, otherwise we have to check it. */
6816 if (TREE_CODE (t) != UNION_TYPE)
6820 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
6821 if (TREE_CODE (field) == FIELD_DECL)
6823 type = TREE_TYPE (field);
6824 if (CLASS_TYPE_P (type))
6826 if (TYPE_NEEDS_CONSTRUCTING (type))
6827 cp_error_at ("member %#D' with constructor not allowed in anonymous aggregate",
6829 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
6830 cp_error_at ("member %#D' with destructor not allowed in anonymous aggregate",
6832 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type))
6833 cp_error_at ("member %#D' with copy assignment operator not allowed in anonymous aggregate",
6840 /* Make sure that a declaration with no declarator is well-formed, i.e.
6841 just defines a tagged type or anonymous union.
6843 Returns the type defined, if any. */
6846 check_tag_decl (declspecs)
6851 int saw_typedef = 0;
6852 tree ob_modifier = NULL_TREE;
6854 register tree t = NULL_TREE;
6856 for (link = declspecs; link; link = TREE_CHAIN (link))
6858 register tree value = TREE_VALUE (link);
6861 || TREE_CODE (value) == TYPE_DECL
6862 || (TREE_CODE (value) == IDENTIFIER_NODE
6863 && IDENTIFIER_GLOBAL_VALUE (value)
6864 && TREE_CODE (IDENTIFIER_GLOBAL_VALUE (value)) == TYPE_DECL))
6868 if (found_type == 2 && TREE_CODE (value) == IDENTIFIER_NODE)
6870 if (! in_system_header)
6871 cp_pedwarn ("redeclaration of C++ built-in type `%T'", value);
6876 && ((TREE_CODE (value) != TYPENAME_TYPE && IS_AGGR_TYPE (value))
6877 || TREE_CODE (value) == ENUMERAL_TYPE))
6879 my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
6883 else if (value == ridpointers[(int) RID_TYPEDEF])
6885 else if (value == ridpointers[(int) RID_FRIEND])
6887 if (current_class_type == NULL_TREE
6888 || current_scope () != current_class_type)
6889 ob_modifier = value;
6893 else if (value == ridpointers[(int) RID_STATIC]
6894 || value == ridpointers[(int) RID_EXTERN]
6895 || value == ridpointers[(int) RID_AUTO]
6896 || value == ridpointers[(int) RID_REGISTER]
6897 || value == ridpointers[(int) RID_INLINE]
6898 || value == ridpointers[(int) RID_VIRTUAL]
6899 || value == ridpointers[(int) RID_CONST]
6900 || value == ridpointers[(int) RID_VOLATILE]
6901 || value == ridpointers[(int) RID_EXPLICIT])
6902 ob_modifier = value;
6906 error ("multiple types in one declaration");
6908 if (t == NULL_TREE && ! saw_friend)
6909 pedwarn ("declaration does not declare anything");
6911 /* Check for an anonymous union. */
6912 else if (t && IS_AGGR_TYPE_CODE (TREE_CODE (t))
6913 && TYPE_ANONYMOUS_P (t))
6915 /* 7/3 In a simple-declaration, the optional init-declarator-list
6916 can be omitted only when declaring a class (clause 9) or
6917 enumeration (7.2), that is, when the decl-specifier-seq contains
6918 either a class-specifier, an elaborated-type-specifier with
6919 a class-key (9.1), or an enum-specifier. In these cases and
6920 whenever a class-specifier or enum-specifier is present in the
6921 decl-specifier-seq, the identifiers in these specifiers are among
6922 the names being declared by the declaration (as class-name,
6923 enum-names, or enumerators, depending on the syntax). In such
6924 cases, and except for the declaration of an unnamed bit-field (9.6),
6925 the decl-specifier-seq shall introduce one or more names into the
6926 program, or shall redeclare a name introduced by a previous
6927 declaration. [Example:
6928 enum { }; // ill-formed
6929 typedef class { }; // ill-formed
6933 error ("Missing type-name in typedef-declaration.");
6936 /* Anonymous unions are objects, so they can have specifiers. */;
6937 SET_ANON_AGGR_TYPE_P (t);
6939 if (TREE_CODE (t) != UNION_TYPE && pedantic && ! in_system_header)
6940 pedwarn ("ISO C++ prohibits anonymous structs");
6943 else if (ob_modifier)
6945 if (ob_modifier == ridpointers[(int) RID_INLINE]
6946 || ob_modifier == ridpointers[(int) RID_VIRTUAL])
6947 cp_error ("`%D' can only be specified for functions", ob_modifier);
6948 else if (ob_modifier == ridpointers[(int) RID_FRIEND])
6949 cp_error ("`%D' can only be specified inside a class", ob_modifier);
6950 else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
6951 cp_error ("`%D' can only be specified for constructors",
6954 cp_error ("`%D' can only be specified for objects and functions",
6961 /* Called when a declaration is seen that contains no names to declare.
6962 If its type is a reference to a structure, union or enum inherited
6963 from a containing scope, shadow that tag name for the current scope
6964 with a forward reference.
6965 If its type defines a new named structure or union
6966 or defines an enum, it is valid but we need not do anything here.
6967 Otherwise, it is an error.
6969 C++: may have to grok the declspecs to learn about static,
6970 complain for anonymous unions. */
6973 shadow_tag (declspecs)
6976 tree t = check_tag_decl (declspecs);
6979 maybe_process_partial_specialization (t);
6981 /* This is where the variables in an anonymous union are
6982 declared. An anonymous union declaration looks like:
6984 because there is no declarator after the union, the parser
6985 sends that declaration here. */
6986 if (t && ANON_AGGR_TYPE_P (t))
6988 fixup_anonymous_aggr (t);
6990 if (TYPE_FIELDS (t))
6992 tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
6994 finish_anon_union (decl);
6999 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7002 groktypename (typename)
7005 if (TREE_CODE (typename) != TREE_LIST)
7007 return grokdeclarator (TREE_VALUE (typename),
7008 TREE_PURPOSE (typename),
7009 TYPENAME, 0, NULL_TREE);
7012 /* Decode a declarator in an ordinary declaration or data definition.
7013 This is called as soon as the type information and variable name
7014 have been parsed, before parsing the initializer if any.
7015 Here we create the ..._DECL node, fill in its type,
7016 and put it on the list of decls for the current context.
7017 The ..._DECL node is returned as the value.
7019 Exception: for arrays where the length is not specified,
7020 the type is left null, to be filled in by `cp_finish_decl'.
7022 Function definitions do not come here; they go to start_function
7023 instead. However, external and forward declarations of functions
7024 do go through here. Structure field declarations are done by
7025 grokfield and not through here. */
7028 start_decl (declarator, declspecs, initialized, attributes, prefix_attributes)
7029 tree declarator, declspecs;
7031 tree attributes, prefix_attributes;
7034 register tree type, tem;
7036 extern int have_extern_spec;
7037 extern int used_extern_spec;
7041 /* See code below that used this. */
7042 int init_written = initialized;
7045 /* This should only be done once on the top most decl. */
7046 if (have_extern_spec && !used_extern_spec)
7048 declspecs = tree_cons (NULL_TREE, get_identifier ("extern"),
7050 used_extern_spec = 1;
7053 if (attributes || prefix_attributes)
7054 attrlist = build_tree_list (attributes, prefix_attributes);
7056 attrlist = NULL_TREE;
7058 decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
7061 if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
7064 type = TREE_TYPE (decl);
7066 if (type == error_mark_node)
7069 context = DECL_CONTEXT (decl);
7071 if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
7072 && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
7074 /* When parsing the initializer, lookup should use the object's
7076 push_decl_namespace (context);
7079 /* We are only interested in class contexts, later. */
7080 if (context && TREE_CODE (context) == NAMESPACE_DECL)
7081 context = NULL_TREE;
7084 /* Is it valid for this decl to have an initializer at all?
7085 If not, set INITIALIZED to zero, which will indirectly
7086 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7087 switch (TREE_CODE (decl))
7090 /* typedef foo = bar means give foo the same type as bar.
7091 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7092 Any other case of an initialization in a TYPE_DECL is an error. */
7093 if (pedantic || list_length (declspecs) > 1)
7095 cp_error ("typedef `%D' is initialized", decl);
7101 cp_error ("function `%#D' is initialized like a variable", decl);
7111 if (! toplevel_bindings_p ()
7112 && DECL_EXTERNAL (decl))
7113 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7115 DECL_EXTERNAL (decl) = 0;
7116 if (toplevel_bindings_p ())
7117 TREE_STATIC (decl) = 1;
7119 /* Tell `pushdecl' this is an initialized decl
7120 even though we don't yet have the initializer expression.
7121 Also tell `cp_finish_decl' it may store the real initializer. */
7122 DECL_INITIAL (decl) = error_mark_node;
7125 /* Set attributes here so if duplicate decl, will have proper attributes. */
7126 cplus_decl_attributes (&decl, attributes, prefix_attributes, 0);
7128 if (context && COMPLETE_TYPE_P (complete_type (context)))
7130 push_nested_class (context, 2);
7132 if (TREE_CODE (decl) == VAR_DECL)
7134 tree field = lookup_field (context, DECL_NAME (decl), 0, 0);
7135 if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
7136 cp_error ("`%#D' is not a static member of `%#T'", decl, context);
7139 if (DECL_CONTEXT (field) != context)
7141 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7142 DECL_CONTEXT (field), DECL_NAME (decl),
7143 context, DECL_NAME (decl));
7144 DECL_CONTEXT (decl) = DECL_CONTEXT (field);
7146 /* Static data member are tricky; an in-class initialization
7147 still doesn't provide a definition, so the in-class
7148 declaration will have DECL_EXTERNAL set, but will have an
7149 initialization. Thus, duplicate_decls won't warn
7150 about this situation, and so we check here. */
7151 if (DECL_INITIAL (decl) && DECL_INITIAL (field))
7152 cp_error ("duplicate initialization of %D", decl);
7153 if (duplicate_decls (decl, field))
7159 tree field = check_classfn (context, decl);
7160 if (field && duplicate_decls (decl, field))
7164 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7165 DECL_IN_AGGR_P (decl) = 0;
7166 if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
7167 || CLASSTYPE_TEMPLATE_INSTANTIATION (context))
7169 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
7170 /* [temp.expl.spec] An explicit specialization of a static data
7171 member of a template is a definition if the declaration
7172 includes an initializer; otherwise, it is a declaration.
7174 We check for processing_specialization so this only applies
7175 to the new specialization syntax. */
7176 if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
7177 DECL_EXTERNAL (decl) = 1;
7180 if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
7181 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7185 /* Enter this declaration into the symbol table. */
7186 tem = maybe_push_decl (decl);
7188 if (processing_template_decl)
7189 tem = push_template_decl (tem);
7191 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7192 /* Tell the back-end to use or not use .common as appropriate. If we say
7193 -fconserve-space, we want this to save .data space, at the expense of
7194 wrong semantics. If we say -fno-conserve-space, we want this to
7195 produce errors about redefs; to do this we force variables into the
7197 DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem);
7200 if (! processing_template_decl)
7210 tree type = TREE_TYPE (decl);
7211 int initialized = (DECL_INITIAL (decl) != NULL_TREE);
7213 if (type == error_mark_node)
7216 maybe_push_cleanup_level (type);
7219 /* Is it valid for this decl to have an initializer at all?
7220 If not, set INITIALIZED to zero, which will indirectly
7221 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7223 /* Don't allow initializations for incomplete types except for
7224 arrays which might be completed by the initialization. */
7225 if (COMPLETE_TYPE_P (complete_type (type)))
7226 ; /* A complete type is ok. */
7227 else if (TREE_CODE (type) != ARRAY_TYPE)
7229 cp_error ("variable `%#D' has initializer but incomplete type",
7232 type = TREE_TYPE (decl) = error_mark_node;
7234 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type))))
7236 if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
7237 cp_error ("elements of array `%#D' have incomplete type", decl);
7238 /* else we already gave an error in start_decl. */
7244 && TREE_CODE (decl) != TYPE_DECL
7245 && TREE_CODE (decl) != TEMPLATE_DECL
7246 && type != error_mark_node
7247 && IS_AGGR_TYPE (type)
7248 && ! DECL_EXTERNAL (decl))
7250 if ((! processing_template_decl || ! uses_template_parms (type))
7251 && !COMPLETE_TYPE_P (complete_type (type)))
7253 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7255 /* Change the type so that assemble_variable will give
7256 DECL an rtl we can live with: (mem (const_int 0)). */
7257 type = TREE_TYPE (decl) = error_mark_node;
7261 /* If any base type in the hierarchy of TYPE needs a constructor,
7262 then we set initialized to 1. This way any nodes which are
7263 created for the purposes of initializing this aggregate
7264 will live as long as it does. This is necessary for global
7265 aggregates which do not have their initializers processed until
7266 the end of the file. */
7267 initialized = TYPE_NEEDS_CONSTRUCTING (type);
7272 DECL_INITIAL (decl) = NULL_TREE;
7275 /* Handle initialization of references.
7276 These three arguments are from `cp_finish_decl', and have the
7277 same meaning here that they do there.
7279 Quotes on semantics can be found in ARM 8.4.3. */
7282 grok_reference_init (decl, type, init)
7283 tree decl, type, init;
7287 if (init == NULL_TREE)
7289 if ((DECL_LANG_SPECIFIC (decl) == 0
7290 || DECL_IN_AGGR_P (decl) == 0)
7291 && ! DECL_THIS_EXTERN (decl))
7292 cp_error ("`%D' declared as reference but not initialized", decl);
7296 if (init == error_mark_node)
7299 if (TREE_CODE (init) == CONSTRUCTOR)
7301 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl);
7305 if (TREE_CODE (init) == TREE_LIST)
7306 init = build_compound_expr (init);
7308 if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
7309 init = convert_from_reference (init);
7311 if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
7312 && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
7314 /* Note: default conversion is only called in very special cases. */
7315 init = default_conversion (init);
7318 /* Convert INIT to the reference type TYPE. This may involve the
7319 creation of a temporary, whose lifetime must be the same as that
7320 of the reference. If so, a DECL_STMT for the temporary will be
7321 added just after the DECL_STMT for DECL. That's why we don't set
7322 DECL_INITIAL for local references (instead assigning to them
7323 explicitly); we need to allow the temporary to be initialized
7325 tmp = convert_to_reference
7326 (type, init, CONV_IMPLICIT,
7327 LOOKUP_ONLYCONVERTING|LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND,
7330 if (tmp == error_mark_node)
7332 else if (tmp == NULL_TREE)
7334 cp_error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
7338 if (TREE_STATIC (decl) && !TREE_CONSTANT (tmp))
7341 DECL_INITIAL (decl) = tmp;
7346 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7347 mucking with forces it does not comprehend (i.e. initialization with a
7348 constructor). If we are at global scope and won't go into COMMON, fill
7349 it in with a dummy CONSTRUCTOR to force the variable into .data;
7350 otherwise we can use error_mark_node. */
7353 obscure_complex_init (decl, init)
7356 if (! flag_no_inline && TREE_STATIC (decl))
7358 if (extract_init (decl, init))
7362 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7363 if (toplevel_bindings_p () && ! DECL_COMMON (decl))
7364 DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE,
7368 DECL_INITIAL (decl) = error_mark_node;
7373 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7374 array until we finish parsing the initializer. If that's the
7375 situation we're in, update DECL accordingly. */
7378 maybe_deduce_size_from_array_init (decl, init)
7382 tree type = TREE_TYPE (decl);
7384 if (TREE_CODE (type) == ARRAY_TYPE
7385 && TYPE_DOMAIN (type) == NULL_TREE
7386 && TREE_CODE (decl) != TYPE_DECL)
7388 /* do_default is really a C-ism to deal with tentative definitions.
7389 But let's leave it here to ease the eventual merge. */
7390 int do_default = !DECL_EXTERNAL (decl);
7391 tree initializer = init ? init : DECL_INITIAL (decl);
7392 int failure = complete_array_type (type, initializer, do_default);
7395 cp_error ("initializer fails to determine size of `%D'", decl);
7400 cp_error ("array size missing in `%D'", decl);
7401 /* If a `static' var's size isn't known, make it extern as
7402 well as static, so it does not get allocated. If it's not
7403 `static', then don't mark it extern; finish_incomplete_decl
7404 will give it a default size and it will get allocated. */
7405 else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7406 DECL_EXTERNAL (decl) = 1;
7409 if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7410 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7412 cp_error ("zero-size array `%D'", decl);
7414 layout_decl (decl, 0);
7418 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7419 any appropriate error messages regarding the layout. */
7422 layout_var_decl (decl)
7425 tree type = TREE_TYPE (decl);
7427 tree ttype = target_type (type);
7430 /* If we haven't already layed out this declaration, do so now.
7431 Note that we must not call complete type for an external object
7432 because it's type might involve templates that we are not
7433 supposed to isntantiate yet. (And it's perfectly legal to say
7434 `extern X x' for some incomplete type `X'.) */
7435 if (!DECL_EXTERNAL (decl))
7436 complete_type (type);
7437 if (!DECL_SIZE (decl) && COMPLETE_TYPE_P (type))
7438 layout_decl (decl, 0);
7440 if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7442 /* An automatic variable with an incomplete type: that is an error.
7443 Don't talk about array types here, since we took care of that
7444 message in grokdeclarator. */
7445 cp_error ("storage size of `%D' isn't known", decl);
7446 TREE_TYPE (decl) = error_mark_node;
7449 /* Keep this code around in case we later want to control debug info
7450 based on whether a type is "used". (jason 1999-11-11) */
7452 else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7453 /* Let debugger know it should output info for this type. */
7454 note_debug_info_needed (ttype);
7456 if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7457 note_debug_info_needed (DECL_CONTEXT (decl));
7460 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7461 && DECL_SIZE (decl) != NULL_TREE
7462 && ! TREE_CONSTANT (DECL_SIZE (decl)))
7464 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7465 constant_expression_warning (DECL_SIZE (decl));
7467 cp_error ("storage size of `%D' isn't constant", decl);
7470 if (TREE_STATIC (decl)
7471 && !DECL_ARTIFICIAL (decl)
7472 && current_function_decl
7473 && DECL_CONTEXT (decl) == current_function_decl)
7474 push_local_name (decl);
7477 /* If a local static variable is declared in an inline function, or if
7478 we have a weak definition, we must endeavor to create only one
7479 instance of the variable at link-time. */
7482 maybe_commonize_var (decl)
7485 /* Static data in a function with comdat linkage also has comdat
7487 if (TREE_STATIC (decl)
7488 /* Don't mess with __FUNCTION__. */
7489 && ! DECL_ARTIFICIAL (decl)
7490 && current_function_decl
7491 && DECL_CONTEXT (decl) == current_function_decl
7492 && (DECL_DECLARED_INLINE_P (current_function_decl)
7493 || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7494 && TREE_PUBLIC (current_function_decl))
7496 /* If flag_weak, we don't need to mess with this, as we can just
7497 make the function weak, and let it refer to its unique local
7498 copy. This works because we don't allow the function to be
7502 if (DECL_INTERFACE_KNOWN (current_function_decl))
7504 TREE_PUBLIC (decl) = 1;
7505 DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7507 else if (DECL_INITIAL (decl) == NULL_TREE
7508 || DECL_INITIAL (decl) == error_mark_node)
7510 TREE_PUBLIC (decl) = 1;
7511 DECL_COMMON (decl) = 1;
7513 /* else we lose. We can only do this if we can use common,
7514 which we can't if it has been initialized. */
7516 if (!TREE_PUBLIC (decl))
7518 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7519 cp_warning_at (" you can work around this by removing the initializer", decl);
7523 comdat_linkage (decl);
7525 else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
7526 /* Set it up again; we might have set DECL_INITIAL since the last
7528 comdat_linkage (decl);
7531 /* Issue an error message if DECL is an uninitialized const variable. */
7534 check_for_uninitialized_const_var (decl)
7537 tree type = TREE_TYPE (decl);
7539 /* ``Unless explicitly declared extern, a const object does not have
7540 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7542 if (TREE_CODE (decl) == VAR_DECL
7543 && TREE_CODE (type) != REFERENCE_TYPE
7544 && CP_TYPE_CONST_P (type)
7545 && !TYPE_NEEDS_CONSTRUCTING (type)
7546 && !DECL_INITIAL (decl))
7547 cp_error ("uninitialized const `%D'", decl);
7550 /* Verify INIT (the initializer for DECL), and record the
7551 initialization in DECL_INITIAL, if appropriate. Returns a new
7555 check_initializer (decl, init)
7561 if (TREE_CODE (decl) == FIELD_DECL)
7564 type = TREE_TYPE (decl);
7566 /* If `start_decl' didn't like having an initialization, ignore it now. */
7567 if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7570 /* Check the initializer. */
7573 /* Things that are going to be initialized need to have complete
7575 TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl));
7577 if (type == error_mark_node)
7578 /* We will have already complained. */
7580 else if (COMPLETE_TYPE_P (type) && !TREE_CONSTANT (TYPE_SIZE (type)))
7582 cp_error ("variable-sized object `%D' may not be initialized", decl);
7585 else if (TREE_CODE (type) == ARRAY_TYPE
7586 && !COMPLETE_TYPE_P (TREE_TYPE (type)))
7588 cp_error ("elements of array `%#D' have incomplete type", decl);
7591 else if (!COMPLETE_TYPE_P (type))
7593 cp_error ("`%D' has incomplete type", decl);
7594 TREE_TYPE (decl) = error_mark_node;
7599 if (TREE_CODE (decl) == CONST_DECL)
7601 my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7603 DECL_INITIAL (decl) = init;
7605 my_friendly_assert (init != NULL_TREE, 149);
7608 else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE)
7610 init = grok_reference_init (decl, type, init);
7612 init = obscure_complex_init (decl, init);
7616 if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7618 if (TREE_CODE (type) == ARRAY_TYPE)
7619 init = digest_init (type, init, (tree *) 0);
7620 else if (TREE_CODE (init) == CONSTRUCTOR
7621 && TREE_HAS_CONSTRUCTOR (init))
7623 if (TYPE_NON_AGGREGATE_CLASS (type))
7625 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7627 init = error_mark_node;
7630 goto dont_use_constructor;
7635 dont_use_constructor:
7636 if (TREE_CODE (init) != TREE_VEC)
7637 init = store_init_value (decl, init);
7641 /* We must hide the initializer so that expand_decl
7642 won't try to do something it does not understand. */
7643 init = obscure_complex_init (decl, init);
7645 else if (DECL_EXTERNAL (decl))
7647 else if (TYPE_P (type)
7648 && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type)))
7650 tree core_type = strip_array_types (type);
7652 if (! TYPE_NEEDS_CONSTRUCTING (core_type))
7654 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type))
7655 cp_error ("structure `%D' with uninitialized const members", decl);
7656 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))
7657 cp_error ("structure `%D' with uninitialized reference members",
7661 check_for_uninitialized_const_var (decl);
7663 if (COMPLETE_TYPE_P (type) && TYPE_NEEDS_CONSTRUCTING (type))
7664 init = obscure_complex_init (decl, NULL_TREE);
7668 check_for_uninitialized_const_var (decl);
7673 /* If DECL is not a local variable, give it RTL. */
7676 make_rtl_for_nonlocal_decl (decl, init, asmspec)
7679 const char *asmspec;
7681 int toplev = toplevel_bindings_p ();
7684 /* Handle non-variables up front. */
7685 if (TREE_CODE (decl) != VAR_DECL)
7687 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7691 /* If we see a class member here, it should be a static data
7693 if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl))
7695 my_friendly_assert (TREE_STATIC (decl), 19990828);
7696 /* An in-class declaration of a static data member should be
7697 external; it is only a declaration, and not a definition. */
7698 if (init == NULL_TREE)
7699 my_friendly_assert (DECL_EXTERNAL (decl), 20000723);
7702 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7705 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (asmspec));
7706 /* The `register' keyword, when used together with an
7707 asm-specification, indicates that the variable should be
7708 placed in a particular register. */
7709 if (DECL_REGISTER (decl))
7710 DECL_C_HARD_REGISTER (decl) = 1;
7713 /* We don't create any RTL for local variables. */
7714 if (DECL_FUNCTION_SCOPE_P (decl) && !TREE_STATIC (decl))
7717 /* We defer emission of local statics until the corresponding
7718 DECL_STMT is expanded. */
7719 defer_p = DECL_FUNCTION_SCOPE_P (decl) || DECL_VIRTUAL_P (decl);
7721 /* We try to defer namespace-scope static constants so that they are
7722 not emitted into the object file unncessarily. */
7723 if (!DECL_VIRTUAL_P (decl)
7724 && TREE_READONLY (decl)
7725 && DECL_INITIAL (decl) != NULL_TREE
7726 && DECL_INITIAL (decl) != error_mark_node
7727 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl))
7729 && !TREE_PUBLIC (decl))
7731 /* Fool with the linkage according to #pragma interface. */
7732 if (!interface_unknown)
7734 TREE_PUBLIC (decl) = 1;
7735 DECL_EXTERNAL (decl) = interface_only;
7741 /* If we're deferring the variable, we only need to make RTL if
7742 there's an ASMSPEC. Otherwise, we'll lazily create it later when
7743 we need it. (There's no way to lazily create RTL for things that
7744 have assembly specs because the information about the specifier
7745 isn't stored in the tree, yet) */
7746 if (defer_p && asmspec)
7747 make_decl_rtl (decl, asmspec);
7748 /* If we're not deferring, go ahead and assemble the variable. */
7750 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7753 /* The old ARM scoping rules injected variables declared in the
7754 initialization statement of a for-statement into the surrounding
7755 scope. We support this usage, in order to be backward-compatible.
7756 DECL is a just-declared VAR_DECL; if necessary inject its
7757 declaration into the surrounding scope. */
7760 maybe_inject_for_scope_var (decl)
7763 if (!DECL_NAME (decl))
7766 if (current_binding_level->is_for_scope)
7768 struct binding_level *outer
7769 = current_binding_level->level_chain;
7771 /* Check to see if the same name is already bound at the outer
7772 level, either because it was directly declared, or because a
7773 dead for-decl got preserved. In either case, the code would
7774 not have been valid under the ARM scope rules, so clear
7775 is_for_scope for the current_binding_level.
7777 Otherwise, we need to preserve the temp slot for decl to last
7778 into the outer binding level. */
7781 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
7783 if (outer_binding && BINDING_LEVEL (outer_binding) == outer
7784 && (TREE_CODE (BINDING_VALUE (outer_binding))
7786 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
7788 BINDING_VALUE (outer_binding)
7789 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
7790 current_binding_level->is_for_scope = 0;
7792 else if (DECL_IN_MEMORY_P (decl))
7793 preserve_temp_slots (DECL_RTL (decl));
7797 /* Generate code to initialize DECL (a local variable). */
7800 initialize_local_var (decl, init, flags)
7805 tree type = TREE_TYPE (decl);
7807 /* If the type is bogus, don't bother initializing the variable. */
7808 if (type == error_mark_node)
7811 if (DECL_SIZE (decl) == NULL_TREE && !TREE_STATIC (decl))
7813 /* If we used it already as memory, it must stay in memory. */
7814 DECL_INITIAL (decl) = NULL_TREE;
7815 TREE_ADDRESSABLE (decl) = TREE_USED (decl);
7818 /* Local statics are handled differently from ordinary automatic
7820 if (TREE_STATIC (decl))
7822 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
7823 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7824 expand_static_init (decl, init);
7828 if (DECL_SIZE (decl) && type != error_mark_node)
7832 /* Compute and store the initial value. */
7833 already_used = TREE_USED (decl) || TREE_USED (type);
7835 if (init || TYPE_NEEDS_CONSTRUCTING (type))
7837 int saved_stmts_are_full_exprs_p;
7839 my_friendly_assert (building_stmt_tree (), 20000906);
7840 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p ();
7841 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
7842 finish_expr_stmt (build_aggr_init (decl, init, flags));
7843 current_stmt_tree ()->stmts_are_full_exprs_p =
7844 saved_stmts_are_full_exprs_p;
7847 /* Set this to 0 so we can tell whether an aggregate which was
7848 initialized was ever used. Don't do this if it has a
7849 destructor, so we don't complain about the 'resource
7850 allocation is initialization' idiom. Now set
7851 attribute((unused)) on types so decls of that type will be
7852 marked used. (see TREE_USED, above.) */
7853 if (TYPE_NEEDS_CONSTRUCTING (type)
7855 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type)
7856 && DECL_NAME (decl))
7857 TREE_USED (decl) = 0;
7858 else if (already_used)
7859 TREE_USED (decl) = 1;
7863 /* Generate code to destroy DECL (a local variable). */
7866 destroy_local_var (decl)
7869 tree type = TREE_TYPE (decl);
7872 /* Only variables get cleaned up. */
7873 if (TREE_CODE (decl) != VAR_DECL)
7876 /* And only things with destructors need cleaning up. */
7877 if (type == error_mark_node
7878 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
7881 if (TREE_CODE (decl) == VAR_DECL &&
7882 (DECL_EXTERNAL (decl) || TREE_STATIC (decl)))
7883 /* We don't clean up things that aren't defined in this
7884 translation unit, or that need a static cleanup. The latter
7885 are handled by finish_file. */
7888 /* Compute the cleanup. */
7889 cleanup = maybe_build_cleanup (decl);
7891 /* Record the cleanup required for this declaration. */
7892 if (DECL_SIZE (decl) && TREE_TYPE (decl) != error_mark_node
7894 finish_decl_cleanup (decl, cleanup);
7897 /* Finish processing of a declaration;
7898 install its line number and initial value.
7899 If the length of an array type is not known before,
7900 it must be determined now, from the initial value, or it is an error.
7902 INIT holds the value of an initializer that should be allowed to escape
7905 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7906 if the (init) syntax was used. */
7909 cp_finish_decl (decl, init, asmspec_tree, flags)
7915 tree ttype = NULL_TREE;
7916 const char *asmspec = NULL;
7917 int was_readonly = 0;
7922 error ("assignment (not initialization) in declaration");
7926 /* If a name was specified, get the string. */
7928 asmspec = TREE_STRING_POINTER (asmspec_tree);
7930 if (init && TREE_CODE (init) == NAMESPACE_DECL)
7932 cp_error ("cannot initialize `%D' to namespace `%D'",
7937 if (current_class_type
7938 && CP_DECL_CONTEXT (decl) == current_class_type
7939 && TYPE_BEING_DEFINED (current_class_type)
7940 && (DECL_INITIAL (decl) || init))
7941 DECL_INITIALIZED_IN_CLASS_P (decl) = 1;
7943 if (TREE_CODE (decl) == VAR_DECL
7944 && DECL_CONTEXT (decl)
7945 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
7946 && DECL_CONTEXT (decl) != current_namespace
7949 /* Leave the namespace of the object. */
7950 pop_decl_namespace ();
7953 type = TREE_TYPE (decl);
7955 if (type == error_mark_node)
7958 if (TYPE_HAS_MUTABLE_P (type))
7959 TREE_READONLY (decl) = 0;
7961 if (processing_template_decl)
7963 /* Add this declaration to the statement-tree. */
7964 if (at_function_scope_p ()
7965 && TREE_CODE (decl) != RESULT_DECL)
7966 add_decl_stmt (decl);
7968 if (init && DECL_INITIAL (decl))
7969 DECL_INITIAL (decl) = init;
7973 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7974 my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828);
7976 /* Take care of TYPE_DECLs up front. */
7977 if (TREE_CODE (decl) == TYPE_DECL)
7979 if (init && DECL_INITIAL (decl))
7981 /* typedef foo = bar; store the type of bar as the type of foo. */
7982 TREE_TYPE (decl) = type = TREE_TYPE (init);
7983 DECL_INITIAL (decl) = init = NULL_TREE;
7985 if (type != error_mark_node
7986 && IS_AGGR_TYPE (type) && DECL_NAME (decl))
7988 if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
7989 cp_warning ("shadowing previous type declaration of `%#D'", decl);
7990 set_identifier_type_value (DECL_NAME (decl), type);
7991 CLASSTYPE_GOT_SEMICOLON (type) = 1;
7993 GNU_xref_decl (current_function_decl, decl);
7995 /* If we have installed this as the canonical typedef for this
7996 type, and that type has not been defined yet, delay emitting
7997 the debug information for it, as we will emit it later. */
7998 if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
7999 && !COMPLETE_TYPE_P (TREE_TYPE (decl)))
8000 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
8002 rest_of_decl_compilation (decl, NULL,
8003 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
8007 if (TREE_CODE (decl) != FUNCTION_DECL)
8008 ttype = target_type (type);
8010 if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
8011 && TYPE_NEEDS_CONSTRUCTING (type))
8013 /* Currently, GNU C++ puts constants in text space, making them
8014 impossible to initialize. In the future, one would hope for
8015 an operating system which understood the difference between
8016 initialization and the running of a program. */
8018 TREE_READONLY (decl) = 0;
8021 if (TREE_CODE (decl) == FIELD_DECL && asmspec)
8023 /* This must override the asm specifier which was placed by
8024 grokclassfn. Lay this out fresh. */
8025 SET_DECL_RTL (TREE_TYPE (decl), NULL_RTX);
8026 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (asmspec));
8027 make_decl_rtl (decl, asmspec);
8030 /* Deduce size of array from initialization, if not already known. */
8031 maybe_deduce_size_from_array_init (decl, init);
8032 init = check_initializer (decl, init);
8034 GNU_xref_decl (current_function_decl, decl);
8036 /* Add this declaration to the statement-tree. This needs to happen
8037 after the call to check_initializer so that the DECL_STMT for a
8038 reference temp is added before the DECL_STMT for the reference itself. */
8039 if (building_stmt_tree ()
8040 && at_function_scope_p ()
8041 && TREE_CODE (decl) != RESULT_DECL)
8042 add_decl_stmt (decl);
8044 if (TREE_CODE (decl) == VAR_DECL)
8045 layout_var_decl (decl);
8047 /* Output the assembler code and/or RTL code for variables and functions,
8048 unless the type is an undefined structure or union.
8049 If not, it will get done when the type is completed. */
8050 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
8051 || TREE_CODE (decl) == RESULT_DECL)
8053 if (TREE_CODE (decl) == VAR_DECL)
8054 maybe_commonize_var (decl);
8056 make_rtl_for_nonlocal_decl (decl, init, asmspec);
8058 if (TREE_CODE (type) == FUNCTION_TYPE
8059 || TREE_CODE (type) == METHOD_TYPE)
8060 abstract_virtuals_error (decl,
8061 strip_array_types (TREE_TYPE (type)));
8063 abstract_virtuals_error (decl, strip_array_types (type));
8065 if (TREE_CODE (decl) == FUNCTION_DECL)
8067 else if (DECL_EXTERNAL (decl)
8068 && ! (DECL_LANG_SPECIFIC (decl)
8069 && DECL_NOT_REALLY_EXTERN (decl)))
8072 DECL_INITIAL (decl) = init;
8074 else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
8076 /* This is a local declaration. */
8077 if (doing_semantic_analysis_p ())
8078 maybe_inject_for_scope_var (decl);
8079 /* Initialize the local variable. But, if we're building a
8080 statement-tree, we'll do the initialization when we
8082 if (processing_template_decl)
8084 if (init || DECL_INITIAL (decl) == error_mark_node)
8085 DECL_INITIAL (decl) = init;
8089 /* If we're not building RTL, then we need to do so
8091 my_friendly_assert (building_stmt_tree (), 20000906);
8092 /* Initialize the variable. */
8093 initialize_local_var (decl, init, flags);
8094 /* Clean up the variable. */
8095 destroy_local_var (decl);
8098 else if (TREE_STATIC (decl) && type != error_mark_node)
8100 /* Cleanups for static variables are handled by `finish_file'. */
8101 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
8102 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
8103 expand_static_init (decl, init);
8107 /* Undo call to `pushclass' that was done in `start_decl'
8108 due to initialization of qualified member variable.
8109 I.e., Foo::x = 10; */
8111 tree context = CP_DECL_CONTEXT (decl);
8114 && (TREE_CODE (decl) == VAR_DECL
8115 /* We also have a pushclass done that we need to undo here
8116 if we're at top level and declare a method. */
8117 || TREE_CODE (decl) == FUNCTION_DECL)
8118 /* If size hasn't been set, we're still defining it,
8119 and therefore inside the class body; don't pop
8120 the binding level.. */
8121 && COMPLETE_TYPE_P (context)
8122 && context == current_class_type)
8123 pop_nested_class ();
8130 TREE_READONLY (decl) = 1;
8133 /* This is here for a midend callback from c-common.c */
8136 finish_decl (decl, init, asmspec_tree)
8140 cp_finish_decl (decl, init, asmspec_tree, 0);
8143 /* Returns a declaration for a VAR_DECL as if:
8145 extern "C" TYPE NAME;
8147 had been seen. Used to create compiler-generated global
8151 declare_global_var (name, type)
8157 push_to_top_level ();
8158 decl = build_decl (VAR_DECL, name, type);
8159 TREE_PUBLIC (decl) = 1;
8160 DECL_EXTERNAL (decl) = 1;
8161 DECL_ARTIFICIAL (decl) = 1;
8163 cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
8164 pop_from_top_level ();
8169 /* Returns a pointer to the `atexit' function. Note that if
8170 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8171 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8185 if (flag_use_cxa_atexit)
8187 /* The declaration for `__cxa_atexit' is:
8189 int __cxa_atexit (void (*)(void *), void *, void *)
8191 We build up the argument types and then then function type
8194 /* First, build the pointer-to-function type for the first
8196 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8197 fn_type = build_function_type (void_type_node, arg_types);
8198 fn_ptr_type = build_pointer_type (fn_type);
8199 /* Then, build the rest of the argument types. */
8200 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8201 arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
8202 arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types);
8203 /* And the final __cxa_atexit type. */
8204 fn_type = build_function_type (integer_type_node, arg_types);
8205 fn_ptr_type = build_pointer_type (fn_type);
8206 name = "__cxa_atexit";
8210 /* The declaration for `atexit' is:
8212 int atexit (void (*)());
8214 We build up the argument types and then then function type
8216 fn_type = build_function_type (void_type_node, void_list_node);
8217 fn_ptr_type = build_pointer_type (fn_type);
8218 arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node);
8219 /* Build the final atexit type. */
8220 fn_type = build_function_type (integer_type_node, arg_types);
8224 /* Now, build the function declaration. */
8225 push_lang_context (lang_name_c);
8226 atexit_fndecl = build_library_fn_ptr (name, fn_type);
8227 mark_used (atexit_fndecl);
8228 pop_lang_context ();
8229 atexit_node = default_conversion (atexit_fndecl);
8234 /* Returns the __dso_handle VAR_DECL. */
8237 get_dso_handle_node ()
8239 if (dso_handle_node)
8240 return dso_handle_node;
8242 /* Declare the variable. */
8243 dso_handle_node = declare_global_var (get_identifier ("__dso_handle"),
8246 return dso_handle_node;
8249 /* Begin a new function with internal linkage whose job will be simply
8250 to destroy some particular variable. */
8255 static int counter = 0;
8256 int old_interface_unknown = interface_unknown;
8262 push_to_top_level ();
8264 /* No need to mangle this. */
8265 push_lang_context (lang_name_c);
8267 interface_unknown = 1;
8269 /* Build the parameter-types. */
8270 parmtypes = void_list_node;
8271 /* Functions passed to __cxa_atexit take an additional parameter.
8272 We'll just ignore it. After we implement the new calling
8273 convention for destructors, we can eliminate the use of
8274 additional cleanup functions entirely in the -fnew-abi case. */
8275 if (flag_use_cxa_atexit)
8276 parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes);
8277 /* Build the function type itself. */
8278 fntype = build_function_type (void_type_node, parmtypes);
8279 /* Build the name of the function. */
8280 sprintf (name, "__tcf_%d", counter++);
8281 /* Build the function declaration. */
8282 fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype);
8283 /* It's a function with internal linkage, generated by the
8285 TREE_PUBLIC (fndecl) = 0;
8286 DECL_ARTIFICIAL (fndecl) = 1;
8287 /* Make the function `inline' so that it is only emitted if it is
8288 actually needed. It is unlikely that it will be inlined, since
8289 it is only called via a function pointer, but we avoid unncessary
8290 emissions this way. */
8291 DECL_INLINE (fndecl) = 1;
8292 /* Build the parameter. */
8293 if (flag_use_cxa_atexit)
8297 parmdecl = build_decl (PARM_DECL, NULL_TREE, ptr_type_node);
8298 DECL_CONTEXT (parmdecl) = fndecl;
8299 DECL_ARG_TYPE (parmdecl) = ptr_type_node;
8300 TREE_USED (parmdecl) = 1;
8301 DECL_ARGUMENTS (fndecl) = parmdecl;
8305 start_function (/*specs=*/NULL_TREE, fndecl, NULL_TREE, SF_PRE_PARSED);
8308 interface_unknown = old_interface_unknown;
8310 pop_lang_context ();
8312 return current_function_decl;
8315 /* Finish the cleanup function begun by start_cleanup_fn. */
8322 expand_body (finish_function (0));
8324 pop_from_top_level ();
8327 /* Generate code to handle the destruction of DECL, an object with
8328 static storage duration. */
8331 register_dtor_fn (decl)
8339 int saved_flag_access_control;
8341 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
8344 /* Call build_cleanup before we enter the anonymous function so that
8345 any access checks will be done relative to the current scope,
8346 rather than the scope of the anonymous function. */
8347 build_cleanup (decl);
8349 /* Now start the function. */
8350 cleanup = start_cleanup_fn ();
8352 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8353 to the original function, rather than the anonymous one. That
8354 will make the back-end think that nested functions are in use,
8355 which causes confusion. */
8356 saved_flag_access_control = flag_access_control;
8357 flag_access_control = 0;
8358 fcall = build_cleanup (decl);
8359 flag_access_control = saved_flag_access_control;
8361 /* Create the body of the anonymous function. */
8362 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
8363 finish_expr_stmt (fcall);
8364 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
8367 /* Call atexit with the cleanup function. */
8368 mark_addressable (cleanup);
8369 cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
8370 if (flag_use_cxa_atexit)
8372 args = tree_cons (NULL_TREE, get_dso_handle_node (), NULL_TREE);
8373 args = tree_cons (NULL_TREE, null_pointer_node, args);
8374 args = tree_cons (NULL_TREE, cleanup, args);
8377 args = tree_cons (NULL_TREE, cleanup, NULL_TREE);
8378 finish_expr_stmt (build_function_call (get_atexit_node (), args));
8382 expand_static_init (decl, init)
8386 tree oldstatic = value_member (decl, static_aggregates);
8390 if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
8391 cp_error ("multiple initializations given for `%D'", decl);
8393 else if (! toplevel_bindings_p ())
8395 /* Emit code to perform this initialization but once. */
8402 /* Emit code to perform this initialization but once. This code
8405 static int guard = 0;
8407 // Do initialization.
8409 // Register variable for destruction at end of program.
8412 Note that the `temp' variable is only set to 1 *after* the
8413 initialization is complete. This ensures that an exception,
8414 thrown during the construction, will cause the variable to
8415 reinitialized when we pass through this code again, as per:
8419 If the initialization exits by throwing an exception, the
8420 initialization is not complete, so it will be tried again
8421 the next time control enters the declaration.
8423 In theory, this process should be thread-safe, too; multiple
8424 threads should not be able to initialize the variable more
8425 than once. We don't yet attempt to ensure thread-safety. */
8427 /* Create the guard variable. */
8428 guard = get_guard (decl);
8430 /* Begin the conditional initialization. */
8431 if_stmt = begin_if_stmt ();
8432 finish_if_stmt_cond (get_guard_cond (guard), if_stmt);
8433 then_clause = begin_compound_stmt (/*has_no_scope=*/0);
8435 /* Do the initialization itself. */
8436 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
8437 || (init && TREE_CODE (init) == TREE_LIST))
8438 assignment = build_aggr_init (decl, init, 0);
8440 /* The initialization we're doing here is just a bitwise
8442 assignment = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
8444 assignment = NULL_TREE;
8446 /* Once the assignment is complete, set TEMP to 1. Since the
8447 construction of the static object is complete at this point,
8448 we want to make sure TEMP is set to 1 even if a temporary
8449 constructed during the initialization throws an exception
8450 when it is destroyed. So, we combine the initialization and
8451 the assignment to TEMP into a single expression, ensuring
8452 that when we call finish_expr_stmt the cleanups will not be
8453 run until after TEMP is set to 1. */
8454 guard_init = set_guard (guard);
8457 assignment = tree_cons (NULL_TREE, assignment,
8458 build_tree_list (NULL_TREE,
8460 assignment = build_compound_expr (assignment);
8463 assignment = guard_init;
8464 finish_expr_stmt (assignment);
8466 /* Use atexit to register a function for destroying this static
8468 register_dtor_fn (decl);
8470 finish_compound_stmt (/*has_no_scope=*/0, then_clause);
8471 finish_then_clause (if_stmt);
8475 static_aggregates = tree_cons (init, decl, static_aggregates);
8478 /* Finish the declaration of a catch-parameter. */
8481 start_handler_parms (declspecs, declarator)
8488 decl = grokdeclarator (declarator, declspecs, CATCHPARM,
8490 if (decl == NULL_TREE)
8491 error ("invalid catch parameter");
8500 /* Make TYPE a complete type based on INITIAL_VALUE.
8501 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8502 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8505 complete_array_type (type, initial_value, do_default)
8506 tree type, initial_value;
8509 register tree maxindex = NULL_TREE;
8514 /* An array of character type can be initialized from a
8515 brace-enclosed string constant. */
8516 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type)))
8517 && TREE_CODE (initial_value) == CONSTRUCTOR
8518 && CONSTRUCTOR_ELTS (initial_value)
8519 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value)))
8521 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value)) == NULL_TREE)
8522 initial_value = TREE_VALUE (CONSTRUCTOR_ELTS (initial_value));
8524 /* Note MAXINDEX is really the maximum index, one less than the
8526 if (TREE_CODE (initial_value) == STRING_CST)
8529 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8530 maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8533 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8535 tree elts = CONSTRUCTOR_ELTS (initial_value);
8537 maxindex = ssize_int (-1);
8538 for (; elts; elts = TREE_CHAIN (elts))
8540 if (TREE_PURPOSE (elts))
8541 maxindex = TREE_PURPOSE (elts);
8543 maxindex = size_binop (PLUS_EXPR, maxindex, ssize_int (1));
8545 maxindex = copy_node (maxindex);
8549 /* Make an error message unless that happened already. */
8550 if (initial_value != error_mark_node)
8553 initial_value = NULL_TREE;
8555 /* Prevent further error messages. */
8556 maxindex = build_int_2 (0, 0);
8563 maxindex = build_int_2 (0, 0);
8572 domain = build_index_type (maxindex);
8573 TYPE_DOMAIN (type) = domain;
8575 if (! TREE_TYPE (maxindex))
8576 TREE_TYPE (maxindex) = domain;
8578 itype = TREE_TYPE (initial_value);
8581 if (itype && !TYPE_DOMAIN (itype))
8582 TYPE_DOMAIN (itype) = domain;
8583 /* The type of the main variant should never be used for arrays
8584 of different sizes. It should only ever be completed with the
8585 size of the array. */
8586 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8587 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain;
8590 /* Lay out the type now that we can get the real answer. */
8597 /* Return zero if something is declared to be a member of type
8598 CTYPE when in the context of CUR_TYPE. STRING is the error
8599 message to print in that case. Otherwise, quietly return 1. */
8602 member_function_or_else (ctype, cur_type, flags)
8603 tree ctype, cur_type;
8604 enum overload_flags flags;
8606 if (ctype && ctype != cur_type)
8608 if (flags == DTOR_FLAG)
8609 cp_error ("destructor for alien class `%T' cannot be a member",
8612 cp_error ("constructor for alien class `%T' cannot be a member",
8619 /* Subroutine of `grokdeclarator'. */
8621 /* Generate errors possibly applicable for a given set of specifiers.
8622 This is for ARM $7.1.2. */
8625 bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises)
8628 int virtualp, quals, friendp, raises, inlinep;
8631 cp_error ("`%D' declared as a `virtual' %s", object, type);
8633 cp_error ("`%D' declared as an `inline' %s", object, type);
8635 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8638 cp_error_at ("`%D' declared as a friend", object);
8639 if (raises && !TYPE_PTRFN_P (TREE_TYPE (object))
8640 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object)))
8641 cp_error_at ("`%D' declared with an exception specification", object);
8644 /* CTYPE is class type, or null if non-class.
8645 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8647 DECLARATOR is the function's name.
8648 VIRTUALP is truthvalue of whether the function is virtual or not.
8649 FLAGS are to be passed through to `grokclassfn'.
8650 QUALS are qualifiers indicating whether the function is `const'
8652 RAISES is a list of exceptions that this function can raise.
8653 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8654 not look, and -1 if we should not call `grokclassfn' at all.
8656 Returns `NULL_TREE' if something goes wrong, after issuing
8657 applicable error messages. */
8660 grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals,
8661 raises, check, friendp, publicp, inlinep, funcdef_flag,
8662 template_count, in_namespace)
8665 tree orig_declarator;
8667 enum overload_flags flags;
8669 int check, friendp, publicp, inlinep, funcdef_flag, template_count;
8673 int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8674 int has_default_arg = 0;
8679 type = build_exception_variant (type, raises);
8682 decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8683 /* Propagate volatile out from type to decl. */
8684 if (TYPE_VOLATILE (type))
8685 TREE_THIS_VOLATILE (decl) = 1;
8687 /* If this decl has namespace scope, set that up. */
8689 set_decl_namespace (decl, in_namespace, friendp);
8691 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8693 /* `main' and builtins have implicit 'C' linkage. */
8694 if ((MAIN_NAME_P (declarator)
8695 || (IDENTIFIER_LENGTH (declarator) > 10
8696 && IDENTIFIER_POINTER (declarator)[0] == '_'
8697 && IDENTIFIER_POINTER (declarator)[1] == '_'
8698 && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8699 && current_lang_name == lang_name_cplusplus
8700 && ctype == NULL_TREE
8701 /* NULL_TREE means global namespace. */
8702 && DECL_CONTEXT (decl) == NULL_TREE)
8703 SET_DECL_LANGUAGE (decl, lang_c);
8705 /* Should probably propagate const out from type to decl I bet (mrs). */
8708 DECL_STATIC_FUNCTION_P (decl) = 1;
8709 DECL_CONTEXT (decl) = ctype;
8713 DECL_CONTEXT (decl) = ctype;
8715 if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8717 if (processing_template_decl)
8718 error ("cannot declare `::main' to be a template");
8720 error ("cannot declare `::main' to be inline");
8722 error ("cannot declare `::main' to be static");
8723 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
8725 error ("`main' must return `int'");
8730 /* Members of anonymous types and local classes have no linkage; make
8732 /* FIXME what if it gets a name from typedef? */
8733 if (ctype && (TYPE_ANONYMOUS_P (ctype)
8734 || decl_function_context (TYPE_MAIN_DECL (ctype))))
8739 /* [basic.link]: A name with no linkage (notably, the name of a class
8740 or enumeration declared in a local scope) shall not be used to
8741 declare an entity with linkage.
8743 Only check this for public decls for now. */
8744 t = no_linkage_check (TREE_TYPE (decl));
8747 if (TYPE_ANONYMOUS_P (t))
8749 if (DECL_EXTERN_C_P (decl))
8750 /* Allow this; it's pretty common in C. */;
8753 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8755 if (DECL_ORIGINAL_TYPE (TYPE_NAME (t)))
8757 `%#D' does not refer to the unqualified type, so it is not used for linkage",
8762 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8767 TREE_PUBLIC (decl) = publicp;
8770 DECL_INTERFACE_KNOWN (decl) = 1;
8771 DECL_NOT_REALLY_EXTERN (decl) = 1;
8774 /* If the declaration was declared inline, mark it as such. */
8776 DECL_DECLARED_INLINE_P (decl) = 1;
8777 /* We inline functions that are explicitly declared inline, or, when
8778 the user explicitly asks us to, all functions. */
8779 if (DECL_DECLARED_INLINE_P (decl) || flag_inline_trees == 2)
8780 DECL_INLINE (decl) = 1;
8782 DECL_EXTERNAL (decl) = 1;
8783 if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
8785 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8786 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
8790 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
8791 grok_op_properties (decl, virtualp, check < 0);
8793 if (ctype && decl_function_context (decl))
8794 DECL_NO_STATIC_CHAIN (decl) = 1;
8796 for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
8797 if (TREE_PURPOSE (t)
8798 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
8800 has_default_arg = 1;
8805 && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
8809 ("defining explicit specialization `%D' in friend declaration",
8813 tree fns = TREE_OPERAND (orig_declarator, 0);
8814 tree args = TREE_OPERAND (orig_declarator, 1);
8816 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8818 /* Something like `template <class T> friend void f<T>()'. */
8819 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8825 /* A friend declaration of the form friend void f<>(). Record
8826 the information in the TEMPLATE_ID_EXPR. */
8827 SET_DECL_IMPLICIT_INSTANTIATION (decl);
8829 if (TREE_CODE (fns) == COMPONENT_REF)
8831 /* Due to bison parser ickiness, we will have already looked
8832 up an operator_name or PFUNCNAME within the current class
8833 (see template_id in parse.y). If the current class contains
8834 such a name, we'll get a COMPONENT_REF here. Undo that. */
8836 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns, 0))
8837 == current_class_type, 20001120);
8838 fns = TREE_OPERAND (fns, 1);
8840 my_friendly_assert (TREE_CODE (fns) == IDENTIFIER_NODE
8841 || TREE_CODE (fns) == LOOKUP_EXPR
8842 || TREE_CODE (fns) == OVERLOAD, 20001120);
8843 DECL_TEMPLATE_INFO (decl) = tree_cons (fns, args, NULL_TREE);
8845 if (has_default_arg)
8847 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8854 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8861 if (has_default_arg)
8862 add_defarg_fn (decl);
8865 /* Make the init_value nonzero so pushdecl knows this is not
8866 tentative. error_mark_node is replaced later with the BLOCK. */
8867 DECL_INITIAL (decl) = error_mark_node;
8869 if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl))
8870 TREE_NOTHROW (decl) = 1;
8872 /* Caller will do the rest of this. */
8876 if (flags == NO_SPECIAL && ctype && constructor_name (ctype) == declarator)
8877 DECL_CONSTRUCTOR_P (decl) = 1;
8879 /* Function gets the ugly name, field gets the nice one. This call
8880 may change the type of the function (because of default
8882 if (ctype != NULL_TREE)
8883 grokclassfn (ctype, decl, flags, quals);
8885 decl = check_explicit_specialization (orig_declarator, decl,
8887 2 * (funcdef_flag != 0) +
8888 4 * (friendp != 0));
8889 if (decl == error_mark_node)
8892 if (ctype != NULL_TREE
8893 && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8898 old_decl = check_classfn (ctype, decl);
8900 if (old_decl && TREE_CODE (old_decl) == TEMPLATE_DECL)
8901 /* Because grokfndecl is always supposed to return a
8902 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8903 here. We depend on our callers to figure out that its
8904 really a template that's being returned. */
8905 old_decl = DECL_TEMPLATE_RESULT (old_decl);
8907 if (old_decl && DECL_STATIC_FUNCTION_P (old_decl)
8908 && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
8910 /* Remove the `this' parm added by grokclassfn.
8911 XXX Isn't this done in start_function, too? */
8912 revert_static_member_fn (decl);
8913 last_function_parms = TREE_CHAIN (last_function_parms);
8915 if (old_decl && DECL_ARTIFICIAL (old_decl))
8916 cp_error ("definition of implicitly-declared `%D'", old_decl);
8920 /* Since we've smashed OLD_DECL to its
8921 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
8922 if (TREE_CODE (decl) == TEMPLATE_DECL)
8923 decl = DECL_TEMPLATE_RESULT (decl);
8925 /* Attempt to merge the declarations. This can fail, in
8926 the case of some illegal specialization declarations. */
8927 if (!duplicate_decls (decl, old_decl))
8928 cp_error ("no `%#D' member function declared in class `%T'",
8934 if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl))
8937 if (ctype == NULL_TREE || check)
8941 DECL_VIRTUAL_P (decl) = 1;
8947 grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace)
8950 RID_BIT_TYPE *specbits_in;
8956 RID_BIT_TYPE specbits;
8958 specbits = *specbits_in;
8960 if (TREE_CODE (type) == OFFSET_TYPE)
8962 /* If you declare a static member so that it
8963 can be initialized, the code will reach here. */
8964 tree basetype = TYPE_OFFSET_BASETYPE (type);
8965 type = TREE_TYPE (type);
8966 decl = build_lang_decl (VAR_DECL, declarator, type);
8967 DECL_CONTEXT (decl) = basetype;
8974 context = in_namespace;
8975 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits))
8976 context = current_namespace;
8978 context = NULL_TREE;
8980 /* For namespace-scope variables, declared in a template, we
8981 need the full lang_decl. The same is true for
8982 namespace-scope variables that do not have C++ language
8985 && (processing_template_decl
8986 || current_lang_name != lang_name_cplusplus))
8987 decl = build_lang_decl (VAR_DECL, declarator, type);
8989 decl = build_decl (VAR_DECL, declarator, type);
8992 set_decl_namespace (decl, context, 0);
8994 context = DECL_CONTEXT (decl);
8995 if (declarator && context && current_lang_name != lang_name_c)
8996 /* We can't mangle lazily here because we don't have any
8997 way to recover whether or not a variable was `extern
9003 set_decl_namespace (decl, in_namespace, 0);
9005 if (RIDBIT_SETP (RID_EXTERN, specbits))
9007 DECL_THIS_EXTERN (decl) = 1;
9008 DECL_EXTERNAL (decl) = !initialized;
9011 /* In class context, static means one per class,
9012 public access, and static storage. */
9013 if (DECL_CLASS_SCOPE_P (decl))
9015 TREE_PUBLIC (decl) = 1;
9016 TREE_STATIC (decl) = 1;
9017 DECL_EXTERNAL (decl) = 0;
9019 /* At top level, either `static' or no s.c. makes a definition
9020 (perhaps tentative), and absence of `static' makes it public. */
9021 else if (toplevel_bindings_p ())
9023 TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
9024 && (DECL_THIS_EXTERN (decl) || ! constp));
9025 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
9027 /* Not at top level, only `static' makes a static definition. */
9030 TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
9031 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
9034 if (TREE_PUBLIC (decl))
9036 /* [basic.link]: A name with no linkage (notably, the name of a class
9037 or enumeration declared in a local scope) shall not be used to
9038 declare an entity with linkage.
9040 Only check this for public decls for now. */
9041 tree t = no_linkage_check (TREE_TYPE (decl));
9044 if (TYPE_ANONYMOUS_P (t))
9045 /* Ignore for now; `enum { foo } e' is pretty common. */;
9047 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9055 /* Create and return a canonical pointer to member function type, for
9056 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9059 build_ptrmemfunc_type (type)
9064 tree unqualified_variant = NULL_TREE;
9066 if (type == error_mark_node)
9069 /* If a canonical type already exists for this type, use it. We use
9070 this method instead of type_hash_canon, because it only does a
9071 simple equality check on the list of field members. */
9073 if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
9076 /* Make sure that we always have the unqualified pointer-to-member
9078 if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
9080 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type));
9082 t = make_aggr_type (RECORD_TYPE);
9083 /* Let the front-end know this is a pointer to member function... */
9084 TYPE_PTRMEMFUNC_FLAG (t) = 1;
9085 /* ... and not really an aggregate. */
9086 SET_IS_AGGR_TYPE (t, 0);
9088 fields[0] = build_decl (FIELD_DECL, pfn_identifier, type);
9089 fields[1] = build_decl (FIELD_DECL, delta_identifier,
9091 finish_builtin_type (t, "__ptrmemfunc_type", fields, 1, ptr_type_node);
9093 /* Zap out the name so that the back-end will give us the debugging
9094 information for this anonymous RECORD_TYPE. */
9095 TYPE_NAME (t) = NULL_TREE;
9097 /* If this is not the unqualified form of this pointer-to-member
9098 type, set the TYPE_MAIN_VARIANT for this type to be the
9099 unqualified type. Since they are actually RECORD_TYPEs that are
9100 not variants of each other, we must do this manually. */
9101 if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
9103 t = build_qualified_type (t, CP_TYPE_QUALS (type));
9104 TYPE_MAIN_VARIANT (t) = unqualified_variant;
9105 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant);
9106 TYPE_NEXT_VARIANT (unqualified_variant) = t;
9109 /* Cache this pointer-to-member type so that we can find it again
9111 TYPE_SET_PTRMEMFUNC_TYPE (type, t);
9113 /* Seems to be wanted. */
9114 CLASSTYPE_GOT_SEMICOLON (t) = 1;
9119 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9120 Check to see that the definition is valid. Issue appropriate error
9121 messages. Return 1 if the definition is particularly bad, or 0
9125 check_static_variable_definition (decl, type)
9129 /* Motion 10 at San Diego: If a static const integral data member is
9130 initialized with an integral constant expression, the initializer
9131 may appear either in the declaration (within the class), or in
9132 the definition, but not both. If it appears in the class, the
9133 member is a member constant. The file-scope definition is always
9135 if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
9137 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9139 /* If we just return the declaration, crashes will sometimes
9140 occur. We therefore return void_type_node, as if this was a
9141 friend declaration, to cause callers to completely ignore
9142 this declaration. */
9145 else if (!CP_TYPE_CONST_P (type))
9146 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9148 else if (pedantic && !INTEGRAL_TYPE_P (type))
9149 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
9154 /* Given the SIZE (i.e., number of elements) in an array, compute an
9155 appropriate index type for the array. If non-NULL, NAME is the
9156 name of the thing being declared. */
9159 compute_array_index_type (name, size)
9165 /* If this involves a template parameter, it will be a constant at
9166 instantiation time, but we don't know what the value is yet.
9167 Even if no template parameters are involved, we may an expression
9168 that is not a constant; we don't even simplify `1 + 2' when
9169 processing a template. */
9170 if (processing_template_decl)
9172 /* Resolve a qualified reference to an enumerator or static
9173 const data member of ours. */
9174 if (TREE_CODE (size) == SCOPE_REF
9175 && TREE_OPERAND (size, 0) == current_class_type)
9177 tree t = lookup_field (current_class_type,
9178 TREE_OPERAND (size, 1), 0, 0);
9183 return build_index_type (build_min (MINUS_EXPR, sizetype,
9184 size, integer_one_node));
9187 /* The size might be the result of a cast. */
9188 STRIP_TYPE_NOPS (size);
9190 /* It might be a const variable or enumeration constant. */
9191 size = decl_constant_value (size);
9193 /* The array bound must be an integer type. */
9194 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
9195 && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
9196 && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
9199 cp_error ("size of array `%D' has non-integer type", name);
9201 cp_error ("size of array has non-integer type");
9202 size = integer_one_node;
9205 /* Normally, the array-bound will be a constant. */
9206 if (TREE_CODE (size) == INTEGER_CST)
9208 /* Check to see if the array bound overflowed. Make that an
9209 error, no matter how generous we're being. */
9210 int old_flag_pedantic_errors = flag_pedantic_errors;
9211 int old_pedantic = pedantic;
9212 pedantic = flag_pedantic_errors = 1;
9213 constant_expression_warning (size);
9214 pedantic = old_pedantic;
9215 flag_pedantic_errors = old_flag_pedantic_errors;
9217 /* An array must have a positive number of elements. */
9218 if (INT_CST_LT (size, integer_zero_node))
9221 cp_error ("size of array `%D' is negative", name);
9223 cp_error ("size of array is negative");
9224 size = integer_one_node;
9226 /* Except that an extension we allow zero-sized arrays. We
9227 always allow them in system headers because glibc uses
9229 else if (integer_zerop (size) && pedantic && !in_system_header)
9232 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name);
9234 cp_pedwarn ("ISO C++ forbids zero-size array");
9237 else if (TREE_CONSTANT (size))
9239 /* `(int) &fn' is not a valid array bound. */
9241 cp_error ("size of array `%D' is not an integral constant-expression",
9244 cp_error ("size of array is not an integral constant-expression");
9247 /* Compute the index of the largest element in the array. It is
9248 one less than the number of elements in the array. */
9250 = fold (cp_build_binary_op (MINUS_EXPR,
9251 cp_convert (ssizetype, size),
9252 cp_convert (ssizetype,
9253 integer_one_node)));
9255 /* Check for variable-sized arrays. We allow such things as an
9256 extension, even though they are not allowed in ANSI/ISO C++. */
9257 if (!TREE_CONSTANT (itype))
9262 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9265 cp_pedwarn ("ISO C++ forbids variable-size array");
9268 /* Create a variable-sized array index type. */
9269 itype = variable_size (itype);
9271 /* Make sure that there was no overflow when creating to a signed
9272 index type. (For example, on a 32-bit machine, an array with
9273 size 2^32 - 1 is too big.) */
9274 else if (TREE_OVERFLOW (itype))
9276 error ("overflow in array dimension");
9277 TREE_OVERFLOW (itype) = 0;
9280 /* Create and return the appropriate index type. */
9281 return build_index_type (itype);
9284 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9285 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9289 create_array_type_for_decl (name, type, size)
9294 tree itype = NULL_TREE;
9295 const char* error_msg;
9297 /* If things have already gone awry, bail now. */
9298 if (type == error_mark_node || size == error_mark_node)
9299 return error_mark_node;
9301 /* Assume that everything will go OK. */
9304 /* There are some types which cannot be array elements. */
9305 switch (TREE_CODE (type))
9308 error_msg = "array of void";
9312 error_msg = "array of functions";
9315 case REFERENCE_TYPE:
9316 error_msg = "array of references";
9320 error_msg = "array of data members";
9324 error_msg = "array of function members";
9331 /* If something went wrong, issue an error-message and return. */
9335 cp_error ("declaration of `%D' as %s", name, error_msg);
9337 cp_error ("creating %s", error_msg);
9339 return error_mark_node;
9344 The constant expressions that specify the bounds of the arrays
9345 can be omitted only for the first member of the sequence. */
9346 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
9348 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9351 return error_mark_node;
9354 /* Figure out the index type for the array. */
9356 itype = compute_array_index_type (name, size);
9358 return build_cplus_array_type (type, itype);
9361 /* Check that it's OK to declare a function with the indicated TYPE.
9362 SFK indicates the kind of special function (if any) that this
9363 function is. OPTYPE is the type given in a conversion operator
9364 declaration. Returns the actual return type of the function; that
9365 may be different than TYPE if an error occurs, or for certain
9366 special functions. */
9369 check_special_function_return_type (sfk, type, optype)
9370 special_function_kind sfk;
9376 case sfk_constructor:
9378 cp_error ("return type specification for constructor invalid");
9380 type = void_type_node;
9383 case sfk_destructor:
9385 cp_error ("return type specification for destructor invalid");
9386 type = void_type_node;
9389 case sfk_conversion:
9390 if (type && !same_type_p (type, optype))
9391 cp_error ("operator `%T' declared to return `%T'", optype, type);
9393 cp_pedwarn ("return type specified for `operator %T'", optype);
9398 my_friendly_abort (20000408);
9405 /* Given declspecs and a declarator,
9406 determine the name and type of the object declared
9407 and construct a ..._DECL node for it.
9408 (In one case we can return a ..._TYPE node instead.
9409 For invalid input we sometimes return 0.)
9411 DECLSPECS is a chain of tree_list nodes whose value fields
9412 are the storage classes and type specifiers.
9414 DECL_CONTEXT says which syntactic context this declaration is in:
9415 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9416 FUNCDEF for a function definition. Like NORMAL but a few different
9417 error messages in each case. Return value may be zero meaning
9418 this definition is too screwy to try to parse.
9419 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9420 handle member functions (which have FIELD context).
9421 Return value may be zero meaning this definition is too screwy to
9423 PARM for a parameter declaration (either within a function prototype
9424 or before a function body). Make a PARM_DECL, or return void_type_node.
9425 CATCHPARM for a parameter declaration before a catch clause.
9426 TYPENAME if for a typename (in a cast or sizeof).
9427 Don't make a DECL node; just return the ..._TYPE node.
9428 FIELD for a struct or union field; make a FIELD_DECL.
9429 BITFIELD for a field with specified width.
9430 INITIALIZED is 1 if the decl has an initializer.
9432 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9433 normal attributes in TREE_PURPOSE, or NULL_TREE.
9435 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9436 It may also be so in the PARM case, for a prototype where the
9437 argument type is specified but not the name.
9439 This function is where the complicated C meanings of `static'
9440 and `extern' are interpreted.
9442 For C++, if there is any monkey business to do, the function which
9443 calls this one must do it, i.e., prepending instance variables,
9444 renaming overloaded function names, etc.
9446 Note that for this C++, it is an error to define a method within a class
9447 which does not belong to that class.
9449 Except in the case where SCOPE_REFs are implicitly known (such as
9450 methods within a class being redundantly qualified),
9451 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9452 (class_name::decl_name). The caller must also deal with this.
9454 If a constructor or destructor is seen, and the context is FIELD,
9455 then the type gains the attribute TREE_HAS_x. If such a declaration
9456 is erroneous, NULL_TREE is returned.
9458 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9459 function, these are the qualifiers to give to the `this' pointer. We
9460 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9462 May return void_type_node if the declarator turned out to be a friend.
9463 See grokfield for details. */
9466 grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist)
9469 enum decl_context decl_context;
9473 RID_BIT_TYPE specbits;
9476 tree type = NULL_TREE;
9482 int virtualp, explicitp, friendp, inlinep, staticp;
9483 int explicit_int = 0;
9484 int explicit_char = 0;
9485 int defaulted_int = 0;
9486 tree typedef_decl = NULL_TREE;
9488 tree typedef_type = NULL_TREE;
9489 int funcdef_flag = 0;
9490 enum tree_code innermost_code = ERROR_MARK;
9493 /* See the code below that used this. */
9494 tree decl_machine_attr = NULL_TREE;
9496 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9497 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9498 tree init = NULL_TREE;
9500 /* Keep track of what sort of function is being processed
9501 so that we can warn about default return values, or explicit
9502 return values which do not match prescribed defaults. */
9503 special_function_kind sfk = sfk_none;
9505 tree dname = NULL_TREE;
9506 tree ctype = current_class_type;
9507 tree ctor_return_type = NULL_TREE;
9508 enum overload_flags flags = NO_SPECIAL;
9509 tree quals = NULL_TREE;
9510 tree raises = NULL_TREE;
9511 int template_count = 0;
9512 tree in_namespace = NULL_TREE;
9516 RIDBIT_RESET_ALL (specbits);
9517 if (decl_context == FUNCDEF)
9518 funcdef_flag = 1, decl_context = NORMAL;
9519 else if (decl_context == MEMFUNCDEF)
9520 funcdef_flag = -1, decl_context = FIELD;
9521 else if (decl_context == BITFIELD)
9522 bitfield = 1, decl_context = FIELD;
9524 /* Look inside a declarator for the name being declared
9525 and get it as a string, for an error message. */
9527 tree *next = &declarator;
9531 while (next && *next)
9534 switch (TREE_CODE (decl))
9537 /* For attributes. */
9538 next = &TREE_VALUE (decl);
9543 next = &TREE_OPERAND (decl, 0);
9546 case BIT_NOT_EXPR: /* For C++ destructors! */
9548 tree name = TREE_OPERAND (decl, 0);
9549 tree rename = NULL_TREE;
9551 my_friendly_assert (flags == NO_SPECIAL, 152);
9553 sfk = sfk_destructor;
9554 if (TREE_CODE (name) == TYPE_DECL)
9555 TREE_OPERAND (decl, 0) = name = constructor_name (name);
9556 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
9557 if (ctype == NULL_TREE)
9559 if (current_class_type == NULL_TREE)
9561 error ("destructors must be member functions");
9566 tree t = constructor_name (current_class_name);
9573 tree t = constructor_name (ctype);
9580 cp_error ("destructor `%T' must match class name `%T'",
9582 TREE_OPERAND (decl, 0) = rename;
9588 case ADDR_EXPR: /* C++ reference declaration */
9593 innermost_code = TREE_CODE (decl);
9594 next = &TREE_OPERAND (decl, 0);
9598 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl)))
9600 /* This is actually a variable declaration using
9601 constructor syntax. We need to call start_decl and
9602 cp_finish_decl so we can get the variable
9605 tree attributes, prefix_attributes;
9607 *next = TREE_OPERAND (decl, 0);
9608 init = CALL_DECLARATOR_PARMS (decl);
9612 attributes = TREE_PURPOSE (attrlist);
9613 prefix_attributes = TREE_VALUE (attrlist);
9617 attributes = NULL_TREE;
9618 prefix_attributes = NULL_TREE;
9621 decl = start_decl (declarator, declspecs, 1,
9622 attributes, prefix_attributes);
9623 decl_type_access_control (decl);
9626 /* Look for __unused__ attribute */
9627 if (TREE_USED (TREE_TYPE (decl)))
9628 TREE_USED (decl) = 1;
9629 finish_decl (decl, init, NULL_TREE);
9632 cp_error ("invalid declarator");
9635 innermost_code = TREE_CODE (decl);
9636 if (decl_context == FIELD && ctype == NULL_TREE)
9637 ctype = current_class_type;
9639 && TREE_OPERAND (decl, 0)
9640 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
9641 && ((DECL_NAME (TREE_OPERAND (decl, 0))
9642 == constructor_name_full (ctype))
9643 || (DECL_NAME (TREE_OPERAND (decl, 0))
9644 == constructor_name (ctype)))))
9645 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9646 next = &TREE_OPERAND (decl, 0);
9648 if (ctype != NULL_TREE
9649 && decl != NULL_TREE && flags != DTOR_FLAG
9650 && decl == constructor_name (ctype))
9652 sfk = sfk_constructor;
9653 ctor_return_type = ctype;
9658 case TEMPLATE_ID_EXPR:
9660 tree fns = TREE_OPERAND (decl, 0);
9662 if (TREE_CODE (fns) == LOOKUP_EXPR)
9663 fns = TREE_OPERAND (fns, 0);
9666 if (TREE_CODE (dname) == COMPONENT_REF)
9667 dname = TREE_OPERAND (dname, 1);
9668 if (TREE_CODE (dname) != IDENTIFIER_NODE)
9670 my_friendly_assert (is_overloaded_fn (dname),
9672 dname = DECL_NAME (get_first_fn (dname));
9677 case IDENTIFIER_NODE:
9678 if (TREE_CODE (decl) == IDENTIFIER_NODE)
9683 if (C_IS_RESERVED_WORD (dname))
9685 cp_error ("declarator-id missing; using reserved word `%D'",
9687 name = IDENTIFIER_POINTER (dname);
9689 else if (!IDENTIFIER_TYPENAME_P (dname))
9690 name = IDENTIFIER_POINTER (dname);
9693 my_friendly_assert (flags == NO_SPECIAL, 154);
9694 flags = TYPENAME_FLAG;
9695 ctor_return_type = TREE_TYPE (dname);
9696 sfk = sfk_conversion;
9697 if (IDENTIFIER_GLOBAL_VALUE (dname)
9698 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname))
9700 name = IDENTIFIER_POINTER (dname);
9702 name = "<invalid operator>";
9709 /* Perform error checking, and decide on a ctype. */
9710 tree cname = TREE_OPERAND (decl, 0);
9711 if (cname == NULL_TREE)
9713 else if (TREE_CODE (cname) == NAMESPACE_DECL)
9716 in_namespace = TREE_OPERAND (decl, 0);
9717 TREE_OPERAND (decl, 0) = NULL_TREE;
9719 else if (! is_aggr_type (cname, 1))
9720 TREE_OPERAND (decl, 0) = NULL_TREE;
9721 /* Must test TREE_OPERAND (decl, 1), in case user gives
9722 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9723 else if (TREE_OPERAND (decl, 1)
9724 && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9726 else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9727 || TREE_CODE (cname) == BOUND_TEMPLATE_TEMPLATE_PARM)
9729 cp_error ("`%T::%D' is not a valid declarator", cname,
9730 TREE_OPERAND (decl, 1));
9731 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9732 cname, TREE_OPERAND (decl, 1));
9733 return void_type_node;
9735 else if (ctype == NULL_TREE)
9737 else if (TREE_COMPLEXITY (decl) == current_class_depth)
9738 TREE_OPERAND (decl, 0) = ctype;
9741 if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9743 cp_error ("type `%T' is not derived from type `%T'",
9745 TREE_OPERAND (decl, 0) = NULL_TREE;
9751 if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
9752 && ((DECL_NAME (TREE_OPERAND (decl, 1))
9753 == constructor_name_full (ctype))
9754 || (DECL_NAME (TREE_OPERAND (decl, 1))
9755 == constructor_name (ctype))))
9756 TREE_OPERAND (decl, 1) = constructor_name (ctype);
9757 next = &TREE_OPERAND (decl, 1);
9761 if (TREE_CODE (decl) == IDENTIFIER_NODE
9762 && constructor_name (ctype) == decl)
9764 sfk = sfk_constructor;
9765 ctor_return_type = ctype;
9767 else if (TREE_CODE (decl) == BIT_NOT_EXPR
9768 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
9769 && (constructor_name (ctype) == TREE_OPERAND (decl, 0)
9770 || constructor_name_full (ctype) == TREE_OPERAND (decl, 0)))
9772 sfk = sfk_destructor;
9773 ctor_return_type = ctype;
9775 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9776 next = &TREE_OPERAND (decl, 0);
9787 /* Parse error puts this typespec where
9788 a declarator should go. */
9789 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl));
9790 if (TREE_TYPE (decl) == current_class_type)
9791 cp_error (" perhaps you want `%T' for a constructor",
9792 current_class_name);
9793 dname = DECL_NAME (decl);
9794 name = IDENTIFIER_POINTER (dname);
9796 /* Avoid giving two errors for this. */
9797 IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
9799 declspecs = tree_cons (NULL_TREE, integer_type_node, declspecs);
9805 cp_compiler_error ("`%D' as declarator", decl);
9806 return 0; /* We used to do a 155 abort here. */
9811 /* A function definition's declarator must have the form of
9812 a function declarator. */
9814 if (funcdef_flag && innermost_code != CALL_EXPR)
9817 if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
9818 && innermost_code != CALL_EXPR
9819 && ! (ctype && declspecs == NULL_TREE))
9821 cp_error ("declaration of `%D' as non-function", dname);
9822 return void_type_node;
9825 /* Anything declared one level down from the top level
9826 must be one of the parameters of a function
9827 (because the body is at least two levels down). */
9829 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9830 by not allowing C++ class definitions to specify their parameters
9831 with xdecls (must be spec.d in the parmlist).
9833 Since we now wait to push a class scope until we are sure that
9834 we are in a legitimate method context, we must set oldcname
9835 explicitly (since current_class_name is not yet alive).
9837 We also want to avoid calling this a PARM if it is in a namespace. */
9839 if (decl_context == NORMAL && !toplevel_bindings_p ())
9841 struct binding_level *b = current_binding_level;
9842 current_binding_level = b->level_chain;
9843 if (current_binding_level != 0 && toplevel_bindings_p ())
9844 decl_context = PARM;
9845 current_binding_level = b;
9849 name = decl_context == PARM ? "parameter" : "type name";
9851 /* Look through the decl specs and record which ones appear.
9852 Some typespecs are defined as built-in typenames.
9853 Others, the ones that are modifiers of other types,
9854 are represented by bits in SPECBITS: set the bits for
9855 the modifiers that appear. Storage class keywords are also in SPECBITS.
9857 If there is a typedef name or a type, store the type in TYPE.
9858 This includes builtin typedefs such as `int'.
9860 Set EXPLICIT_INT if the type is `int' or `char' and did not
9861 come from a user typedef.
9863 Set LONGLONG if `long' is mentioned twice.
9865 For C++, constructors and destructors have their own fast treatment. */
9867 for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
9872 /* Certain parse errors slip through. For example,
9873 `int class;' is not caught by the parser. Try
9874 weakly to recover here. */
9875 if (TREE_CODE (spec) != TREE_LIST)
9878 id = TREE_VALUE (spec);
9880 if (TREE_CODE (id) == IDENTIFIER_NODE)
9882 if (id == ridpointers[(int) RID_INT]
9883 || id == ridpointers[(int) RID_CHAR]
9884 || id == ridpointers[(int) RID_BOOL]
9885 || id == ridpointers[(int) RID_WCHAR])
9889 if (id == ridpointers[(int) RID_BOOL])
9890 error ("`bool' is now a keyword");
9892 cp_error ("extraneous `%T' ignored", id);
9896 if (id == ridpointers[(int) RID_INT])
9898 else if (id == ridpointers[(int) RID_CHAR])
9900 type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
9904 /* C++ aggregate types. */
9905 if (IDENTIFIER_HAS_TYPE_VALUE (id))
9908 cp_error ("multiple declarations `%T' and `%T'", type, id);
9910 type = IDENTIFIER_TYPE_VALUE (id);
9914 for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
9916 if (ridpointers[i] == id)
9918 if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
9920 if (pedantic && ! in_system_header && warn_long_long)
9921 pedwarn ("ISO C++ does not support `long long'");
9923 error ("`long long long' is too long for GCC");
9927 else if (RIDBIT_SETP (i, specbits))
9928 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
9929 RIDBIT_SET (i, specbits);
9934 /* C++ aggregate types. */
9935 else if (TREE_CODE (id) == TYPE_DECL)
9938 cp_error ("multiple declarations `%T' and `%T'", type,
9942 type = TREE_TYPE (id);
9943 TREE_VALUE (spec) = type;
9948 error ("two or more data types in declaration of `%s'", name);
9949 else if (TREE_CODE (id) == IDENTIFIER_NODE)
9951 register tree t = lookup_name (id, 1);
9952 if (!t || TREE_CODE (t) != TYPE_DECL)
9953 error ("`%s' fails to be a typedef or built in type",
9954 IDENTIFIER_POINTER (id));
9957 type = TREE_TYPE (t);
9959 /* See the code below that used this. */
9960 decl_machine_attr = DECL_MACHINE_ATTRIBUTES (id);
9965 else if (id != error_mark_node)
9966 /* Can't change CLASS nodes into RECORD nodes here! */
9972 typedef_type = type;
9974 /* No type at all: default to `int', and set DEFAULTED_INT
9975 because it was not a user-defined typedef. */
9977 if (type == NULL_TREE
9978 && (RIDBIT_SETP (RID_SIGNED, specbits)
9979 || RIDBIT_SETP (RID_UNSIGNED, specbits)
9980 || RIDBIT_SETP (RID_LONG, specbits)
9981 || RIDBIT_SETP (RID_SHORT, specbits)))
9983 /* These imply 'int'. */
9984 type = integer_type_node;
9988 if (sfk != sfk_none)
9989 type = check_special_function_return_type (sfk, type,
9991 else if (type == NULL_TREE)
9997 /* We handle `main' specially here, because 'main () { }' is so
9998 common. With no options, it is allowed. With -Wreturn-type,
9999 it is a warning. It is only an error with -pedantic-errors. */
10000 is_main = (funcdef_flag
10001 && MAIN_NAME_P (dname)
10002 && ctype == NULL_TREE
10003 && in_namespace == NULL_TREE
10004 && current_namespace == global_namespace);
10006 if (in_system_header || flag_ms_extensions)
10007 /* Allow it, sigh. */;
10008 else if (pedantic || ! is_main)
10009 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10011 else if (warn_return_type)
10012 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10015 type = integer_type_node;
10020 /* Now process the modifiers that were specified
10021 and check for invalid combinations. */
10023 /* Long double is a special combination. */
10025 if (RIDBIT_SETP (RID_LONG, specbits)
10026 && TYPE_MAIN_VARIANT (type) == double_type_node)
10028 RIDBIT_RESET (RID_LONG, specbits);
10029 type = build_qualified_type (long_double_type_node,
10030 CP_TYPE_QUALS (type));
10033 /* Check all other uses of type modifiers. */
10035 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10036 || RIDBIT_SETP (RID_SIGNED, specbits)
10037 || RIDBIT_SETP (RID_LONG, specbits)
10038 || RIDBIT_SETP (RID_SHORT, specbits))
10042 if (TREE_CODE (type) == REAL_TYPE)
10043 error ("short, signed or unsigned invalid for `%s'", name);
10044 else if (TREE_CODE (type) != INTEGER_TYPE)
10045 error ("long, short, signed or unsigned invalid for `%s'", name);
10046 else if (RIDBIT_SETP (RID_LONG, specbits)
10047 && RIDBIT_SETP (RID_SHORT, specbits))
10048 error ("long and short specified together for `%s'", name);
10049 else if ((RIDBIT_SETP (RID_LONG, specbits)
10050 || RIDBIT_SETP (RID_SHORT, specbits))
10052 error ("long or short specified with char for `%s'", name);
10053 else if ((RIDBIT_SETP (RID_LONG, specbits)
10054 || RIDBIT_SETP (RID_SHORT, specbits))
10055 && TREE_CODE (type) == REAL_TYPE)
10056 error ("long or short specified with floating type for `%s'", name);
10057 else if (RIDBIT_SETP (RID_SIGNED, specbits)
10058 && RIDBIT_SETP (RID_UNSIGNED, specbits))
10059 error ("signed and unsigned given together for `%s'", name);
10063 if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
10065 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10067 if (flag_pedantic_errors)
10072 /* Discard the type modifiers if they are invalid. */
10075 RIDBIT_RESET (RID_UNSIGNED, specbits);
10076 RIDBIT_RESET (RID_SIGNED, specbits);
10077 RIDBIT_RESET (RID_LONG, specbits);
10078 RIDBIT_RESET (RID_SHORT, specbits);
10083 if (RIDBIT_SETP (RID_COMPLEX, specbits)
10084 && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
10086 error ("complex invalid for `%s'", name);
10087 RIDBIT_RESET (RID_COMPLEX, specbits);
10090 /* Decide whether an integer type is signed or not.
10091 Optionally treat bitfields as signed by default. */
10092 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10095 It is implementation-defined whether a plain (neither
10096 explicitly signed or unsigned) char, short, int, or long
10097 bit-field is signed or unsigned.
10099 Naturally, we extend this to long long as well. Note that
10100 this does not include wchar_t. */
10101 || (bitfield && !flag_signed_bitfields
10102 && RIDBIT_NOTSETP (RID_SIGNED, specbits)
10103 /* A typedef for plain `int' without `signed' can be
10104 controlled just like plain `int', but a typedef for
10105 `signed int' cannot be so controlled. */
10107 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))
10108 && (TREE_CODE (type) == INTEGER_TYPE
10109 || TREE_CODE (type) == CHAR_TYPE)
10110 && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node)))
10113 type = long_long_unsigned_type_node;
10114 else if (RIDBIT_SETP (RID_LONG, specbits))
10115 type = long_unsigned_type_node;
10116 else if (RIDBIT_SETP (RID_SHORT, specbits))
10117 type = short_unsigned_type_node;
10118 else if (type == char_type_node)
10119 type = unsigned_char_type_node;
10120 else if (typedef_decl)
10121 type = unsigned_type (type);
10123 type = unsigned_type_node;
10125 else if (RIDBIT_SETP (RID_SIGNED, specbits)
10126 && type == char_type_node)
10127 type = signed_char_type_node;
10129 type = long_long_integer_type_node;
10130 else if (RIDBIT_SETP (RID_LONG, specbits))
10131 type = long_integer_type_node;
10132 else if (RIDBIT_SETP (RID_SHORT, specbits))
10133 type = short_integer_type_node;
10135 if (RIDBIT_SETP (RID_COMPLEX, specbits))
10137 /* If we just have "complex", it is equivalent to
10138 "complex double", but if any modifiers at all are specified it is
10139 the complex form of TYPE. E.g, "complex short" is
10140 "complex short int". */
10142 if (defaulted_int && ! longlong
10143 && ! (RIDBIT_SETP (RID_LONG, specbits)
10144 || RIDBIT_SETP (RID_SHORT, specbits)
10145 || RIDBIT_SETP (RID_SIGNED, specbits)
10146 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
10147 type = complex_double_type_node;
10148 else if (type == integer_type_node)
10149 type = complex_integer_type_node;
10150 else if (type == float_type_node)
10151 type = complex_float_type_node;
10152 else if (type == double_type_node)
10153 type = complex_double_type_node;
10154 else if (type == long_double_type_node)
10155 type = complex_long_double_type_node;
10157 type = build_complex_type (type);
10160 if (sfk == sfk_conversion
10161 && (RIDBIT_SETP (RID_CONST, specbits)
10162 || RIDBIT_SETP (RID_VOLATILE, specbits)
10163 || RIDBIT_SETP (RID_RESTRICT, specbits)))
10164 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10167 /* Set CONSTP if this declaration is `const', whether by
10168 explicit specification or via a typedef.
10169 Likewise for VOLATILEP. */
10171 constp = !! RIDBIT_SETP (RID_CONST, specbits) + CP_TYPE_CONST_P (type);
10173 !! RIDBIT_SETP (RID_RESTRICT, specbits) + CP_TYPE_RESTRICT_P (type);
10175 !! RIDBIT_SETP (RID_VOLATILE, specbits) + CP_TYPE_VOLATILE_P (type);
10176 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10177 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10178 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10179 type = cp_build_qualified_type (type, type_quals);
10181 inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
10182 virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
10183 RIDBIT_RESET (RID_VIRTUAL, specbits);
10184 explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
10185 RIDBIT_RESET (RID_EXPLICIT, specbits);
10187 if (RIDBIT_SETP (RID_STATIC, specbits))
10188 staticp = 1 + (decl_context == FIELD);
10190 if (virtualp && staticp == 2)
10192 cp_error ("member `%D' cannot be declared both virtual and static",
10196 friendp = RIDBIT_SETP (RID_FRIEND, specbits);
10197 RIDBIT_RESET (RID_FRIEND, specbits);
10199 /* Warn if two storage classes are given. Default to `auto'. */
10201 if (RIDBIT_ANY_SET (specbits))
10203 if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
10204 if (RIDBIT_SETP (RID_EXTERN, specbits)) nclasses++;
10205 if (decl_context == PARM && nclasses > 0)
10206 error ("storage class specifiers invalid in parameter declarations");
10207 if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10209 if (decl_context == PARM)
10210 error ("typedef declaration invalid in parameter declaration");
10213 if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
10214 if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
10217 /* Give error if `virtual' is used outside of class declaration. */
10219 && (current_class_name == NULL_TREE || decl_context != FIELD))
10221 error ("virtual outside class declaration");
10225 /* Static anonymous unions are dealt with here. */
10226 if (staticp && decl_context == TYPENAME
10227 && TREE_CODE (declspecs) == TREE_LIST
10228 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs)))
10229 decl_context = FIELD;
10231 /* Warn about storage classes that are invalid for certain
10232 kinds of declarations (parameters, typenames, etc.). */
10235 error ("multiple storage classes in declaration of `%s'", name);
10236 else if (decl_context != NORMAL && nclasses > 0)
10238 if ((decl_context == PARM || decl_context == CATCHPARM)
10239 && (RIDBIT_SETP (RID_REGISTER, specbits)
10240 || RIDBIT_SETP (RID_AUTO, specbits)))
10242 else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10244 else if (decl_context == FIELD
10245 /* C++ allows static class elements */
10246 && RIDBIT_SETP (RID_STATIC, specbits))
10247 /* C++ also allows inlines and signed and unsigned elements,
10248 but in those cases we don't come in here. */
10252 if (decl_context == FIELD)
10254 tree tmp = NULL_TREE;
10255 register int op = 0;
10259 /* Avoid trying to get an operand off an identifier node. */
10260 if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10263 tmp = TREE_OPERAND (declarator, 0);
10264 op = IDENTIFIER_OPNAME_P (tmp);
10265 if (IDENTIFIER_TYPENAME_P (tmp))
10267 if (IDENTIFIER_GLOBAL_VALUE (tmp)
10268 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp))
10270 name = IDENTIFIER_POINTER (tmp);
10272 name = "<invalid operator>";
10275 error ("storage class specified for %s `%s'",
10276 op ? "member operator" : "field",
10281 if (decl_context == PARM || decl_context == CATCHPARM)
10282 error ("storage class specified for parameter `%s'", name);
10284 error ("storage class specified for typename");
10286 RIDBIT_RESET (RID_REGISTER, specbits);
10287 RIDBIT_RESET (RID_AUTO, specbits);
10288 RIDBIT_RESET (RID_EXTERN, specbits);
10291 else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
10293 if (toplevel_bindings_p ())
10295 /* It's common practice (and completely valid) to have a const
10296 be initialized and declared extern. */
10297 if (!(type_quals & TYPE_QUAL_CONST))
10298 warning ("`%s' initialized and declared `extern'", name);
10301 error ("`%s' has both `extern' and initializer", name);
10303 else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
10304 && ! toplevel_bindings_p ())
10305 error ("nested function `%s' declared `extern'", name);
10306 else if (toplevel_bindings_p ())
10308 if (RIDBIT_SETP (RID_AUTO, specbits))
10309 error ("top-level declaration of `%s' specifies `auto'", name);
10312 if (nclasses > 0 && friendp)
10313 error ("storage class specifiers invalid in friend function declarations");
10315 /* Now figure out the structure of the declarator proper.
10316 Descend through it, creating more complex types, until we reach
10317 the declared identifier (or NULL_TREE, in an absolute declarator). */
10319 inner_attrs = NULL_TREE;
10322 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
10323 && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
10325 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10326 an INDIRECT_REF (for *...),
10327 a CALL_EXPR (for ...(...)),
10328 an identifier (for the name being declared)
10329 or a null pointer (for the place in an absolute declarator
10330 where the name was omitted).
10331 For the last two cases, we have just exited the loop.
10333 For C++ it could also be
10334 a SCOPE_REF (for class :: ...). In this case, we have converted
10335 sensible names to types, and those are the values we use to
10336 qualify the member name.
10337 an ADDR_EXPR (for &...),
10338 a BIT_NOT_EXPR (for destructors)
10340 At this point, TYPE is the type of elements of an array,
10341 or for a function to return, or for a pointer to point to.
10342 After this sequence of ifs, TYPE is the type of the
10343 array or function or pointer, and DECLARATOR has had its
10344 outermost layer removed. */
10346 if (type == error_mark_node)
10348 if (TREE_CODE (declarator) == SCOPE_REF)
10349 declarator = TREE_OPERAND (declarator, 1);
10351 declarator = TREE_OPERAND (declarator, 0);
10354 if (quals != NULL_TREE
10355 && (declarator == NULL_TREE
10356 || TREE_CODE (declarator) != SCOPE_REF))
10358 if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
10359 ctype = TYPE_METHOD_BASETYPE (type);
10360 if (ctype != NULL_TREE)
10362 tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
10363 grok_method_quals (ctype, dummy, quals);
10364 type = TREE_TYPE (dummy);
10365 ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
10370 /* See the comment for the TREE_LIST case, below. */
10373 else if (inner_attrs)
10375 decl_attributes (&type, inner_attrs, 0);
10376 inner_attrs = NULL_TREE;
10379 switch (TREE_CODE (declarator))
10383 /* We encode a declarator with embedded attributes using
10384 a TREE_LIST. The attributes apply to the declarator
10385 directly inside them, so we have to skip an iteration
10386 before applying them to the type. If the declarator just
10387 inside is the declarator-id, we apply the attrs to the
10389 inner_attrs = TREE_PURPOSE (declarator);
10391 declarator = TREE_VALUE (declarator);
10397 register tree size;
10399 size = TREE_OPERAND (declarator, 1);
10401 /* VC++ spells a zero-sized array with []. */
10402 if (size == NULL_TREE && decl_context == FIELD && ! staticp
10403 && ! RIDBIT_SETP (RID_TYPEDEF, specbits))
10404 size = integer_zero_node;
10406 declarator = TREE_OPERAND (declarator, 0);
10408 type = create_array_type_for_decl (dname, type, size);
10410 /* VLAs never work as fields. */
10411 if (decl_context == FIELD && !processing_template_decl
10412 && TREE_CODE (type) == ARRAY_TYPE
10413 && TYPE_DOMAIN (type) != NULL_TREE
10414 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
10416 cp_error ("size of member `%D' is not constant", dname);
10417 /* Proceed with arbitrary constant size, so that offset
10418 computations don't get confused. */
10419 type = create_array_type_for_decl (dname, TREE_TYPE (type),
10431 tree inner_parms = CALL_DECLARATOR_PARMS (declarator);
10432 tree inner_decl = TREE_OPERAND (declarator, 0);
10434 /* Declaring a function type.
10435 Make sure we have a valid type for the function to return. */
10437 /* We now know that the TYPE_QUALS don't apply to the
10438 decl, but to its return type. */
10439 type_quals = TYPE_UNQUALIFIED;
10441 /* Warn about some types functions can't return. */
10443 if (TREE_CODE (type) == FUNCTION_TYPE)
10445 error ("`%s' declared as function returning a function", name);
10446 type = integer_type_node;
10448 if (TREE_CODE (type) == ARRAY_TYPE)
10450 error ("`%s' declared as function returning an array", name);
10451 type = integer_type_node;
10454 if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
10455 inner_decl = TREE_OPERAND (inner_decl, 1);
10457 if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
10458 inner_decl = dname;
10460 /* Pick up type qualifiers which should be applied to `this'. */
10461 quals = CALL_DECLARATOR_QUALS (declarator);
10463 /* Pick up the exception specifications. */
10464 raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator);
10466 /* Say it's a definition only for the CALL_EXPR
10467 closest to the identifier. */
10470 && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
10471 || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
10472 || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
10474 if (ctype == NULL_TREE
10475 && decl_context == FIELD
10477 && (friendp == 0 || dname == current_class_name))
10478 ctype = current_class_type;
10480 if (ctype && sfk == sfk_conversion)
10481 TYPE_HAS_CONVERSION (ctype) = 1;
10482 if (ctype && constructor_name (ctype) == dname)
10484 /* We are within a class's scope. If our declarator name
10485 is the same as the class name, and we are defining
10486 a function, then it is a constructor/destructor, and
10487 therefore returns a void type. */
10489 if (flags == DTOR_FLAG)
10491 /* ISO C++ 12.4/2. A destructor may not be
10492 declared const or volatile. A destructor may
10495 error ("destructor cannot be static member function");
10498 cp_error ("destructors may not be `%s'",
10499 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10502 if (decl_context == FIELD)
10504 if (! member_function_or_else (ctype,
10505 current_class_type,
10507 return void_type_node;
10510 else /* It's a constructor. */
10512 if (explicitp == 1)
10514 /* ISO C++ 12.1. A constructor may not be
10515 declared const or volatile. A constructor may
10516 not be virtual. A constructor may not be
10519 error ("constructor cannot be static member function");
10522 pedwarn ("constructors cannot be declared virtual");
10527 cp_error ("constructors may not be `%s'",
10528 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10532 RID_BIT_TYPE tmp_bits;
10533 memcpy (&tmp_bits, &specbits, sizeof (RID_BIT_TYPE));
10534 RIDBIT_RESET (RID_INLINE, tmp_bits);
10535 RIDBIT_RESET (RID_STATIC, tmp_bits);
10536 if (RIDBIT_ANY_SET (tmp_bits))
10537 error ("return value type specifier for constructor ignored");
10539 if (decl_context == FIELD)
10541 if (! member_function_or_else (ctype,
10542 current_class_type,
10544 return void_type_node;
10545 TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10546 if (sfk != sfk_constructor)
10550 if (decl_context == FIELD)
10556 error ("can't initialize friend function `%s'", name);
10559 /* Cannot be both friend and virtual. */
10560 error ("virtual functions cannot be friends");
10561 RIDBIT_RESET (RID_FRIEND, specbits);
10564 if (decl_context == NORMAL)
10565 error ("friend declaration not in class definition");
10566 if (current_function_decl && funcdef_flag)
10567 cp_error ("can't define friend function `%s' in a local class definition",
10571 /* Construct the function type and go to the next
10572 inner layer of declarator. */
10574 declarator = TREE_OPERAND (declarator, 0);
10576 /* FIXME: This is where default args should be fully
10579 arg_types = grokparms (inner_parms);
10581 if (declarator && flags == DTOR_FLAG)
10583 /* A destructor declared in the body of a class will
10584 be represented as a BIT_NOT_EXPR. But, we just
10585 want the underlying IDENTIFIER. */
10586 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10587 declarator = TREE_OPERAND (declarator, 0);
10589 if (arg_types != void_list_node)
10591 cp_error ("destructors may not have parameters");
10592 arg_types = void_list_node;
10593 last_function_parms = NULL_TREE;
10597 /* ANSI says that `const int foo ();'
10598 does not make the function foo const. */
10599 type = build_function_type (type, arg_types);
10603 for (t = arg_types; t; t = TREE_CHAIN (t))
10604 if (TREE_PURPOSE (t)
10605 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
10607 add_defarg_fn (type);
10616 /* Filter out pointers-to-references and references-to-references.
10617 We can get these if a TYPE_DECL is used. */
10619 if (TREE_CODE (type) == REFERENCE_TYPE)
10621 error ("cannot declare %s to references",
10622 TREE_CODE (declarator) == ADDR_EXPR
10623 ? "references" : "pointers");
10624 declarator = TREE_OPERAND (declarator, 0);
10628 if (TREE_CODE (type) == OFFSET_TYPE
10629 && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE
10630 || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE))
10632 cp_error ("cannot declare pointer to `%#T' member",
10634 type = TREE_TYPE (type);
10637 /* Merge any constancy or volatility into the target type
10638 for the pointer. */
10640 /* We now know that the TYPE_QUALS don't apply to the decl,
10641 but to the target of the pointer. */
10642 type_quals = TYPE_UNQUALIFIED;
10644 if (TREE_CODE (declarator) == ADDR_EXPR)
10646 if (TREE_CODE (type) == VOID_TYPE)
10647 error ("invalid type: `void &'");
10649 type = build_reference_type (type);
10651 else if (TREE_CODE (type) == METHOD_TYPE)
10652 type = build_ptrmemfunc_type (build_pointer_type (type));
10654 type = build_pointer_type (type);
10656 /* Process a list of type modifier keywords (such as
10657 const or volatile) that were given inside the `*' or `&'. */
10659 if (TREE_TYPE (declarator))
10661 register tree typemodlist;
10667 for (typemodlist = TREE_TYPE (declarator); typemodlist;
10668 typemodlist = TREE_CHAIN (typemodlist))
10670 tree qualifier = TREE_VALUE (typemodlist);
10672 if (qualifier == ridpointers[(int) RID_CONST])
10674 else if (qualifier == ridpointers[(int) RID_VOLATILE])
10676 else if (qualifier == ridpointers[(int) RID_RESTRICT])
10681 error ("invalid type modifier within pointer declarator");
10685 pedwarn ("duplicate `const'");
10687 pedwarn ("duplicate `volatile'");
10689 pedwarn ("duplicate `restrict'");
10691 type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10692 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10693 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10694 if (TREE_CODE (declarator) == ADDR_EXPR
10695 && (constp || volatilep))
10698 pedwarn ("discarding `const' applied to a reference");
10700 pedwarn ("discarding `volatile' applied to a reference");
10701 type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
10703 type = cp_build_qualified_type (type, type_quals);
10705 declarator = TREE_OPERAND (declarator, 0);
10711 /* We have converted type names to NULL_TREE if the
10712 name was bogus, or to a _TYPE node, if not.
10714 The variable CTYPE holds the type we will ultimately
10715 resolve to. The code here just needs to build
10716 up appropriate member types. */
10717 tree sname = TREE_OPERAND (declarator, 1);
10720 /* Destructors can have their visibilities changed as well. */
10721 if (TREE_CODE (sname) == BIT_NOT_EXPR)
10722 sname = TREE_OPERAND (sname, 0);
10724 if (TREE_COMPLEXITY (declarator) == 0)
10725 /* This needs to be here, in case we are called
10726 multiple times. */ ;
10727 else if (TREE_COMPLEXITY (declarator) == -1)
10728 /* Namespace member. */
10729 pop_decl_namespace ();
10730 else if (friendp && (TREE_COMPLEXITY (declarator) < 2))
10731 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10732 else if (! IS_AGGR_TYPE_CODE
10733 (TREE_CODE (TREE_OPERAND (declarator, 0))))
10735 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
10737 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10738 that refer to ctype. They couldn't be resolved earlier
10739 because we hadn't pushed into the class yet.
10740 Example: resolve 'B<T>::type' in
10741 'B<typename B<T>::type> B<T>::f () { }'. */
10742 if (current_template_parms
10743 && uses_template_parms (type)
10744 && uses_template_parms (current_class_type))
10746 tree args = current_template_args ();
10747 type = tsubst (type, args, /*complain=*/1, NULL_TREE);
10750 /* This pop_nested_class corresponds to the
10751 push_nested_class used to push into class scope for
10752 parsing the argument list of a function decl, in
10754 pop_nested_class ();
10755 TREE_COMPLEXITY (declarator) = current_class_depth;
10758 my_friendly_abort (16);
10760 if (TREE_OPERAND (declarator, 0) == NULL_TREE)
10762 /* We had a reference to a global decl, or
10763 perhaps we were given a non-aggregate typedef,
10764 in which case we cleared this out, and should just
10765 keep going as though it wasn't there. */
10766 declarator = sname;
10769 ctype = TREE_OPERAND (declarator, 0);
10772 while (t != NULL_TREE && CLASS_TYPE_P (t))
10774 /* You're supposed to have one `template <...>'
10775 for every template class, but you don't need one
10776 for a full specialization. For example:
10778 template <class T> struct S{};
10779 template <> struct S<int> { void f(); };
10780 void S<int>::f () {}
10782 is correct; there shouldn't be a `template <>' for
10783 the definition of `S<int>::f'. */
10784 if (CLASSTYPE_TEMPLATE_INFO (t)
10785 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t)
10786 || uses_template_parms (CLASSTYPE_TI_ARGS (t)))
10787 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t)))
10788 template_count += 1;
10790 t = TYPE_MAIN_DECL (t);
10791 t = DECL_CONTEXT (t);
10794 if (sname == NULL_TREE)
10797 if (TREE_CODE (sname) == IDENTIFIER_NODE)
10799 /* This is the `standard' use of the scoping operator:
10800 basetype :: member . */
10802 if (ctype == current_class_type)
10808 Is this ill-formed? */
10811 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10814 else if (TREE_CODE (type) == FUNCTION_TYPE)
10816 if (current_class_type == NULL_TREE || friendp)
10817 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10818 TYPE_ARG_TYPES (type));
10821 cp_error ("cannot declare member function `%T::%s' within `%T'",
10822 ctype, name, current_class_type);
10823 return void_type_node;
10826 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
10827 || COMPLETE_TYPE_P (complete_type (ctype)))
10829 /* Have to move this code elsewhere in this function.
10830 this code is used for i.e., typedef int A::M; M *pm;
10832 It is? How? jason 10/2/94 */
10834 if (current_class_type)
10836 cp_error ("cannot declare member `%T::%s' within `%T'",
10837 ctype, name, current_class_type);
10838 return void_type_node;
10840 type = build_offset_type (ctype, type);
10844 incomplete_type_error (NULL_TREE, ctype);
10845 return error_mark_node;
10848 declarator = sname;
10850 else if (TREE_CODE (sname) == SCOPE_REF)
10851 my_friendly_abort (17);
10855 declarator = TREE_OPERAND (declarator, 1);
10856 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
10857 /* In this case, we will deal with it later. */
10861 if (TREE_CODE (type) == FUNCTION_TYPE)
10862 type = build_cplus_method_type (ctype, TREE_TYPE (type),
10863 TYPE_ARG_TYPES (type));
10865 type = build_offset_type (ctype, type);
10872 declarator = TREE_OPERAND (declarator, 0);
10877 case ENUMERAL_TYPE:
10878 declarator = NULL_TREE;
10882 declarator = NULL_TREE;
10886 my_friendly_abort (158);
10890 /* See the comment for the TREE_LIST case, above. */
10893 if (! ignore_attrs)
10894 decl_attributes (&type, inner_attrs, 0);
10896 TREE_VALUE (attrlist) = chainon (inner_attrs, TREE_VALUE (attrlist));
10898 attrlist = build_tree_list (NULL_TREE, inner_attrs);
10901 /* Now TYPE has the actual type. */
10903 if (explicitp == 1 || (explicitp && friendp))
10905 /* [dcl.fct.spec] The explicit specifier shall only be used in
10906 declarations of constructors within a class definition. */
10907 error ("only declarations of constructors can be `explicit'");
10911 if (RIDBIT_SETP (RID_MUTABLE, specbits))
10913 if (current_class_name == NULL_TREE || decl_context == PARM || friendp)
10915 error ("non-member `%s' cannot be declared `mutable'", name);
10916 RIDBIT_RESET (RID_MUTABLE, specbits);
10918 else if (decl_context == TYPENAME || RIDBIT_SETP (RID_TYPEDEF, specbits))
10920 error ("non-object member `%s' cannot be declared `mutable'", name);
10921 RIDBIT_RESET (RID_MUTABLE, specbits);
10923 else if (TREE_CODE (type) == FUNCTION_TYPE
10924 || TREE_CODE (type) == METHOD_TYPE)
10926 error ("function `%s' cannot be declared `mutable'", name);
10927 RIDBIT_RESET (RID_MUTABLE, specbits);
10931 error ("static `%s' cannot be declared `mutable'", name);
10932 RIDBIT_RESET (RID_MUTABLE, specbits);
10934 else if (type_quals & TYPE_QUAL_CONST)
10936 error ("const `%s' cannot be declared `mutable'", name);
10937 RIDBIT_RESET (RID_MUTABLE, specbits);
10941 if (declarator == NULL_TREE
10942 || TREE_CODE (declarator) == IDENTIFIER_NODE
10943 || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR
10944 && (TREE_CODE (type) == FUNCTION_TYPE
10945 || TREE_CODE (type) == METHOD_TYPE)))
10947 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
10949 cp_error ("template-id `%D' used as a declarator", declarator);
10950 declarator = dname;
10953 /* Unexpected declarator format. */
10954 my_friendly_abort (990210);
10956 /* If this is declaring a typedef name, return a TYPE_DECL. */
10958 if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
10962 /* Note that the grammar rejects storage classes
10963 in typenames, fields or parameters. */
10964 if (current_lang_name == lang_name_java)
10965 TYPE_FOR_JAVA (type) = 1;
10967 if (decl_context == FIELD)
10969 if (declarator == constructor_name (current_class_type))
10970 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
10972 decl = build_lang_decl (TYPE_DECL, declarator, type);
10976 decl = build_decl (TYPE_DECL, declarator, type);
10977 if (!current_function_decl)
10978 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
10981 /* If the user declares "typedef struct {...} foo" then the
10982 struct will have an anonymous name. Fill that name in now.
10983 Nothing can refer to it, so nothing needs know about the name
10985 if (type != error_mark_node
10987 && TYPE_NAME (type)
10988 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
10989 && TYPE_ANONYMOUS_P (type)
10990 && CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED)
10992 tree oldname = TYPE_NAME (type);
10995 /* Replace the anonymous name with the real name everywhere. */
10996 lookup_tag_reverse (type, declarator);
10997 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
10998 if (TYPE_NAME (t) == oldname)
10999 TYPE_NAME (t) = decl;
11001 if (TYPE_LANG_SPECIFIC (type))
11002 TYPE_WAS_ANONYMOUS (type) = 1;
11004 /* If this is a typedef within a template class, the nested
11005 type is a (non-primary) template. The name for the
11006 template needs updating as well. */
11007 if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
11008 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
11009 = TYPE_IDENTIFIER (type);
11011 /* FIXME remangle member functions; member functions of a
11012 type with external linkage have external linkage. */
11015 if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE)
11017 cp_error_at ("typedef name may not be class-qualified", decl);
11022 if (ctype == NULL_TREE)
11024 if (TREE_CODE (type) != METHOD_TYPE)
11025 cp_error_at ("invalid type qualifier for non-member function type", decl);
11027 ctype = TYPE_METHOD_BASETYPE (type);
11029 if (ctype != NULL_TREE)
11030 grok_method_quals (ctype, decl, quals);
11033 if (RIDBIT_SETP (RID_SIGNED, specbits)
11034 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
11035 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
11037 bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
11038 inlinep, friendp, raises != NULL_TREE);
11041 error ("typedef declaration includes an initializer");
11046 /* Detect the case of an array type of unspecified size
11047 which came, as such, direct from a typedef name.
11048 We must copy the type, so that each identifier gets
11049 a distinct type, so that each identifier's size can be
11050 controlled separately by its own initializer. */
11052 if (type == typedef_type && TREE_CODE (type) == ARRAY_TYPE
11053 && TYPE_DOMAIN (type) == NULL_TREE)
11055 type = build_cplus_array_type (TREE_TYPE (type), TYPE_DOMAIN (type));
11058 /* Detect where we're using a typedef of function type to declare a
11059 function. last_function_parms will not be set, so we must create
11062 if (type == typedef_type && TREE_CODE (type) == FUNCTION_TYPE)
11064 tree decls = NULL_TREE;
11067 for (args = TYPE_ARG_TYPES (type); args; args = TREE_CHAIN (args))
11069 tree decl = build_decl (PARM_DECL, NULL_TREE, TREE_VALUE (args));
11071 TREE_CHAIN (decl) = decls;
11075 last_function_parms = nreverse (decls);
11078 /* If this is a type name (such as, in a cast or sizeof),
11079 compute the type and return it now. */
11081 if (decl_context == TYPENAME)
11083 /* Note that the grammar rejects storage classes
11084 in typenames, fields or parameters. */
11085 if (type_quals != TYPE_UNQUALIFIED)
11086 type_quals = TYPE_UNQUALIFIED;
11088 /* Special case: "friend class foo" looks like a TYPENAME context. */
11091 if (type_quals != TYPE_UNQUALIFIED)
11093 cp_error ("type qualifiers specified for friend class declaration");
11094 type_quals = TYPE_UNQUALIFIED;
11098 cp_error ("`inline' specified for friend class declaration");
11102 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11103 But don't allow implicit typenames except with a class-key. */
11104 if (!current_aggr && (TREE_CODE (type) != TYPENAME_TYPE
11105 || IMPLICIT_TYPENAME_P (type)))
11107 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11108 cp_pedwarn ("template parameters cannot be friends");
11109 else if (TREE_CODE (type) == TYPENAME_TYPE)
11111 friend declaration requires class-key, i.e. `friend class %T::%T'",
11112 constructor_name (current_class_type),
11113 TYPE_IDENTIFIER (type));
11116 friend declaration requires class-key, i.e. `friend %#T'",
11120 /* Only try to do this stuff if we didn't already give up. */
11121 if (type != integer_type_node)
11123 /* DR 209. The friendly class does not need to be accessible
11124 in the scope of the class granting friendship. */
11125 skip_type_access_control ();
11127 /* A friendly class? */
11128 if (current_class_type)
11129 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
11131 cp_error ("trying to make class `%T' a friend of global scope",
11134 type = void_type_node;
11139 if (ctype == NULL_TREE)
11141 if (TREE_CODE (type) != METHOD_TYPE)
11142 cp_error ("invalid qualifiers on non-member function type");
11144 ctype = TYPE_METHOD_BASETYPE (type);
11148 tree dummy = build_decl (TYPE_DECL, declarator, type);
11149 grok_method_quals (ctype, dummy, quals);
11150 type = TREE_TYPE (dummy);
11156 else if (declarator == NULL_TREE && decl_context != PARM
11157 && decl_context != CATCHPARM
11158 && TREE_CODE (type) != UNION_TYPE
11161 cp_error ("abstract declarator `%T' used as declaration", type);
11162 declarator = make_anon_name ();
11165 /* `void' at top level (not within pointer)
11166 is allowed only in typedefs or type names.
11167 We don't complain about parms either, but that is because
11168 a better error message can be made later. */
11170 if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
11173 error ("unnamed variable or field declared void");
11174 else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
11176 if (IDENTIFIER_OPNAME_P (declarator))
11177 my_friendly_abort (356);
11179 error ("variable or field `%s' declared void", name);
11182 error ("variable or field declared void");
11183 type = integer_type_node;
11186 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11187 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11189 if (decl_context == PARM || decl_context == CATCHPARM)
11191 if (ctype || in_namespace)
11192 error ("cannot use `::' in parameter declaration");
11194 /* A parameter declared as an array of T is really a pointer to T.
11195 One declared as a function is really a pointer to a function.
11196 One declared as a member is really a pointer to member. */
11198 if (TREE_CODE (type) == ARRAY_TYPE)
11200 /* Transfer const-ness of array into that of type pointed to. */
11201 type = build_pointer_type (TREE_TYPE (type));
11202 type_quals = TYPE_UNQUALIFIED;
11204 else if (TREE_CODE (type) == FUNCTION_TYPE)
11205 type = build_pointer_type (type);
11206 else if (TREE_CODE (type) == OFFSET_TYPE)
11207 type = build_pointer_type (type);
11211 register tree decl;
11213 if (decl_context == PARM)
11215 decl = build_decl (PARM_DECL, declarator, type);
11217 bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
11218 inlinep, friendp, raises != NULL_TREE);
11220 /* Compute the type actually passed in the parmlist,
11221 for the case where there is no prototype.
11222 (For example, shorts and chars are passed as ints.)
11223 When there is a prototype, this is overridden later. */
11225 DECL_ARG_TYPE (decl) = type_promotes_to (type);
11227 else if (decl_context == FIELD)
11229 if (type == error_mark_node)
11231 /* Happens when declaring arrays of sizes which
11232 are error_mark_node, for example. */
11235 else if (in_namespace && !friendp)
11237 /* Something like struct S { int N::j; }; */
11238 cp_error ("invalid use of `::'");
11241 else if (TREE_CODE (type) == FUNCTION_TYPE)
11244 tree function_context;
11246 /* We catch the others as conflicts with the builtin
11248 if (friendp && declarator == ridpointers[(int) RID_SIGNED])
11250 cp_error ("function `%D' cannot be declared friend",
11257 if (ctype == NULL_TREE)
11258 ctype = current_class_type;
11260 if (ctype == NULL_TREE)
11262 cp_error ("can't make `%D' into a method -- not in a class",
11264 return void_type_node;
11267 /* ``A union may [ ... ] not [ have ] virtual functions.''
11269 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
11271 cp_error ("function `%D' declared virtual inside a union",
11273 return void_type_node;
11276 if (declarator == ansi_opname (NEW_EXPR)
11277 || declarator == ansi_opname (VEC_NEW_EXPR)
11278 || declarator == ansi_opname (DELETE_EXPR)
11279 || declarator == ansi_opname (VEC_DELETE_EXPR))
11283 cp_error ("`%D' cannot be declared virtual, since it is always static",
11288 else if (staticp < 2)
11289 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11290 TYPE_ARG_TYPES (type));
11293 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11294 function_context = (ctype != NULL_TREE) ?
11295 decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
11296 publicp = (! friendp || ! staticp)
11297 && function_context == NULL_TREE;
11298 decl = grokfndecl (ctype, type,
11299 TREE_CODE (declarator) != TEMPLATE_ID_EXPR
11300 ? declarator : dname,
11302 virtualp, flags, quals, raises,
11303 friendp ? -1 : 0, friendp, publicp, inlinep,
11304 funcdef_flag, template_count, in_namespace);
11305 if (decl == NULL_TREE)
11308 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11309 /* The decl and setting of decl_machine_attr is also turned off. */
11310 decl = build_decl_attribute_variant (decl, decl_machine_attr);
11313 /* [class.conv.ctor]
11315 A constructor declared without the function-specifier
11316 explicit that can be called with a single parameter
11317 specifies a conversion from the type of its first
11318 parameter to the type of its class. Such a constructor
11319 is called a converting constructor. */
11320 if (explicitp == 2)
11321 DECL_NONCONVERTING_P (decl) = 1;
11322 else if (DECL_CONSTRUCTOR_P (decl))
11324 /* The constructor can be called with exactly one
11325 parameter if there is at least one parameter, and
11326 any subsequent parameters have default arguments.
11327 Ignore any compiler-added parms. */
11328 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (decl);
11330 if (arg_types == void_list_node
11332 && TREE_CHAIN (arg_types)
11333 && TREE_CHAIN (arg_types) != void_list_node
11334 && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
11335 DECL_NONCONVERTING_P (decl) = 1;
11338 else if (TREE_CODE (type) == METHOD_TYPE)
11340 /* We only get here for friend declarations of
11341 members of other classes. */
11342 /* All method decls are public, so tell grokfndecl to set
11343 TREE_PUBLIC, also. */
11344 decl = grokfndecl (ctype, type, declarator, declarator,
11345 virtualp, flags, quals, raises,
11346 friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
11347 template_count, in_namespace);
11348 if (decl == NULL_TREE)
11351 else if (!staticp && ! processing_template_decl
11352 && !COMPLETE_TYPE_P (complete_type (type))
11353 && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
11356 cp_error ("field `%D' has incomplete type", declarator);
11358 cp_error ("name `%T' has incomplete type", type);
11360 /* If we're instantiating a template, tell them which
11361 instantiation made the field's type be incomplete. */
11362 if (current_class_type
11363 && TYPE_NAME (current_class_type)
11364 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
11365 && declspecs && TREE_VALUE (declspecs)
11366 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
11367 cp_error (" in instantiation of template `%T'",
11368 current_class_type);
11370 type = error_mark_node;
11377 error ("`%s' is neither function nor member function; cannot be declared friend",
11378 IDENTIFIER_POINTER (declarator));
11386 /* Friends are treated specially. */
11387 tree t = NULL_TREE;
11389 /* DR 209. The friend does not need to be accessible at this
11391 skip_type_access_control ();
11393 if (ctype == current_class_type)
11394 warning ("member functions are implicitly friends of their class");
11396 if (decl && DECL_NAME (decl))
11398 if (template_class_depth (current_class_type) == 0)
11400 decl = check_explicit_specialization
11402 template_count, 2 * (funcdef_flag != 0) + 4);
11403 if (decl == error_mark_node)
11404 return error_mark_node;
11407 t = do_friend (ctype, declarator, decl,
11408 last_function_parms, attrlist, flags, quals,
11411 if (t && funcdef_flag)
11413 return void_type_node;
11416 /* Structure field. It may not be a function, except for C++ */
11418 if (decl == NULL_TREE)
11424 /* An attempt is being made to initialize a non-static
11425 member. But, from [class.mem]:
11427 4 A member-declarator can contain a
11428 constant-initializer only if it declares a static
11429 member (_class.static_) of integral or enumeration
11430 type, see _class.static.data_.
11432 This used to be relatively common practice, but
11433 the rest of the compiler does not correctly
11434 handle the initialization unless the member is
11435 static so we make it static below. */
11436 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11438 cp_pedwarn ("making `%D' static", declarator);
11442 if (uses_template_parms (type))
11443 /* We'll check at instantiation time. */
11445 else if (check_static_variable_definition (declarator,
11447 /* If we just return the declaration, crashes
11448 will sometimes occur. We therefore return
11449 void_type_node, as if this was a friend
11450 declaration, to cause callers to completely
11451 ignore this declaration. */
11452 return void_type_node;
11455 /* 9.2p13 [class.mem] */
11456 if (declarator == constructor_name (current_class_type)
11457 /* The standard does not allow non-static data members
11458 here either, but we agreed at the 10/99 meeting
11459 to change that in TC 1 so that they are allowed in
11460 classes with no user-defined constructors. */
11462 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11467 /* C++ allows static class members. All other work
11468 for this is done by grokfield. */
11469 decl = build_lang_decl (VAR_DECL, declarator, type);
11470 TREE_STATIC (decl) = 1;
11471 /* In class context, 'static' means public access. */
11472 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
11476 decl = build_decl (FIELD_DECL, declarator, type);
11477 DECL_NONADDRESSABLE_P (decl) = bitfield;
11478 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11480 DECL_MUTABLE_P (decl) = 1;
11481 RIDBIT_RESET (RID_MUTABLE, specbits);
11485 bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
11486 inlinep, friendp, raises != NULL_TREE);
11489 else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
11491 tree original_name;
11497 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11498 original_name = dname;
11500 original_name = declarator;
11502 if (RIDBIT_SETP (RID_AUTO, specbits))
11503 error ("storage class `auto' invalid for function `%s'", name);
11504 else if (RIDBIT_SETP (RID_REGISTER, specbits))
11505 error ("storage class `register' invalid for function `%s'", name);
11507 /* Function declaration not at top level.
11508 Storage classes other than `extern' are not allowed
11509 and `extern' makes no difference. */
11510 if (! toplevel_bindings_p ()
11511 && (RIDBIT_SETP (RID_STATIC, specbits)
11512 || RIDBIT_SETP (RID_INLINE, specbits))
11515 if (RIDBIT_SETP (RID_STATIC, specbits))
11516 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
11518 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
11521 if (ctype == NULL_TREE)
11525 error ("virtual non-class function `%s'", name);
11529 else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
11530 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11531 TYPE_ARG_TYPES (type));
11533 /* Record presence of `static'. */
11534 publicp = (ctype != NULL_TREE
11535 || RIDBIT_SETP (RID_EXTERN, specbits)
11536 || !RIDBIT_SETP (RID_STATIC, specbits));
11538 decl = grokfndecl (ctype, type, original_name, declarator,
11539 virtualp, flags, quals, raises,
11541 publicp, inlinep, funcdef_flag,
11542 template_count, in_namespace);
11543 if (decl == NULL_TREE)
11548 int illegal_static = 0;
11550 /* Don't allow a static member function in a class, and forbid
11551 declaring main to be static. */
11552 if (TREE_CODE (type) == METHOD_TYPE)
11554 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11555 illegal_static = 1;
11557 else if (current_function_decl)
11559 /* FIXME need arm citation */
11560 error ("cannot declare static function inside another function");
11561 illegal_static = 1;
11564 if (illegal_static)
11567 RIDBIT_RESET (RID_STATIC, specbits);
11573 /* It's a variable. */
11575 /* An uninitialized decl with `extern' is a reference. */
11576 decl = grokvardecl (type, declarator, &specbits,
11578 (type_quals & TYPE_QUAL_CONST) != 0,
11580 bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11581 inlinep, friendp, raises != NULL_TREE);
11585 DECL_CONTEXT (decl) = ctype;
11588 cp_pedwarn ("`static' may not be used when defining (as opposed to declaring) a static data member");
11590 RIDBIT_RESET (RID_STATIC, specbits);
11592 if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11594 cp_error ("static member `%D' declared `register'", decl);
11595 RIDBIT_RESET (RID_REGISTER, specbits);
11597 if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11599 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11601 RIDBIT_RESET (RID_EXTERN, specbits);
11606 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE, specbits), 19990927);
11608 /* Record `register' declaration for warnings on &
11609 and in case doing stupid register allocation. */
11611 if (RIDBIT_SETP (RID_REGISTER, specbits))
11612 DECL_REGISTER (decl) = 1;
11614 if (RIDBIT_SETP (RID_EXTERN, specbits))
11615 DECL_THIS_EXTERN (decl) = 1;
11617 if (RIDBIT_SETP (RID_STATIC, specbits))
11618 DECL_THIS_STATIC (decl) = 1;
11620 /* Record constancy and volatility. There's no need to do this
11621 when processing a template; we'll do this for the instantiated
11622 declaration based on the type of DECL. */
11623 if (!processing_template_decl)
11624 c_apply_type_quals_to_decl (type_quals, decl);
11630 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11631 An empty exprlist is a parmlist. An exprlist which
11632 contains only identifiers at the global level
11633 is a parmlist. Otherwise, it is an exprlist. */
11636 parmlist_is_exprlist (exprs)
11639 if (exprs == NULL_TREE || TREE_PARMLIST (exprs))
11642 if (toplevel_bindings_p ())
11644 /* At the global level, if these are all identifiers,
11645 then it is a parmlist. */
11648 if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE)
11650 exprs = TREE_CHAIN (exprs);
11657 /* Subroutine of start_function. Ensure that each of the parameter
11658 types (as listed in PARMS) is complete, as is required for a
11659 function definition. */
11662 require_complete_types_for_parms (parms)
11665 for (; parms; parms = TREE_CHAIN (parms))
11667 if (VOID_TYPE_P (TREE_TYPE (parms)))
11668 /* grokparms will have already issued an error */
11669 TREE_TYPE (parms) = error_mark_node;
11670 else if (complete_type_or_else (TREE_TYPE (parms), parms))
11671 layout_decl (parms, 0);
11673 TREE_TYPE (parms) = error_mark_node;
11677 /* Returns non-zero if T is a local variable. */
11680 local_variable_p (t)
11683 if ((TREE_CODE (t) == VAR_DECL
11684 /* A VAR_DECL with a context that is a _TYPE is a static data
11686 && !TYPE_P (CP_DECL_CONTEXT (t))
11687 /* Any other non-local variable must be at namespace scope. */
11688 && !DECL_NAMESPACE_SCOPE_P (t))
11689 || (TREE_CODE (t) == PARM_DECL))
11695 /* Returns non-zero if T is an automatic local variable or a label.
11696 (These are the declarations that need to be remapped when the code
11697 containing them is duplicated.) */
11700 nonstatic_local_decl_p (t)
11703 return ((local_variable_p (t) && !TREE_STATIC (t))
11704 || TREE_CODE (t) == LABEL_DECL
11705 || TREE_CODE (t) == RESULT_DECL);
11708 /* Like local_variable_p, but suitable for use as a tree-walking
11712 local_variable_p_walkfn (tp, walk_subtrees, data)
11714 int *walk_subtrees ATTRIBUTE_UNUSED;
11715 void *data ATTRIBUTE_UNUSED;
11717 return ((local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp))
11718 ? *tp : NULL_TREE);
11721 /* Check that ARG, which is a default-argument expression for a
11722 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11723 something goes wrong. DECL may also be a _TYPE node, rather than a
11724 DECL, if there is no DECL available. */
11727 check_default_argument (decl, arg)
11734 if (TREE_CODE (arg) == DEFAULT_ARG)
11735 /* We get a DEFAULT_ARG when looking at an in-class declaration
11736 with a default argument. Ignore the argument for now; we'll
11737 deal with it after the class is complete. */
11740 if (processing_template_decl || uses_template_parms (arg))
11741 /* We don't do anything checking until instantiation-time. Note
11742 that there may be uninstantiated arguments even for an
11743 instantiated function, since default arguments are not
11744 instantiated until they are needed. */
11753 decl_type = TREE_TYPE (decl);
11755 if (arg == error_mark_node
11756 || decl == error_mark_node
11757 || TREE_TYPE (arg) == error_mark_node
11758 || decl_type == error_mark_node)
11759 /* Something already went wrong. There's no need to check
11761 return error_mark_node;
11763 /* [dcl.fct.default]
11765 A default argument expression is implicitly converted to the
11767 if (!TREE_TYPE (arg)
11768 || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
11771 cp_error ("default argument for `%#D' has type `%T'",
11772 decl, TREE_TYPE (arg));
11774 cp_error ("default argument for parameter of type `%T' has type `%T'",
11775 decl_type, TREE_TYPE (arg));
11777 return error_mark_node;
11780 /* [dcl.fct.default]
11782 Local variables shall not be used in default argument
11785 The keyword `this' shall not be used in a default argument of a
11786 member function. */
11787 var = walk_tree_without_duplicates (&arg, local_variable_p_walkfn,
11791 cp_error ("default argument `%E' uses local variable `%D'",
11793 return error_mark_node;
11800 /* Decode the list of parameter types for a function type.
11801 Given the list of things declared inside the parens,
11802 return a list of types.
11804 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11805 flag. If unset, we append void_list_node. A parmlist declared
11806 as `(void)' is accepted as the empty parmlist.
11808 Also set last_function_parms to the chain of PARM_DECLs. */
11811 grokparms (first_parm)
11814 tree result = NULL_TREE;
11815 tree decls = NULL_TREE;
11816 int ellipsis = !first_parm || PARMLIST_ELLIPSIS_P (first_parm);
11820 my_friendly_assert (!first_parm || TREE_PARMLIST (first_parm), 20001115);
11822 for (parm = first_parm; parm != NULL_TREE; parm = chain)
11824 tree type = NULL_TREE;
11825 register tree decl = TREE_VALUE (parm);
11826 tree init = TREE_PURPOSE (parm);
11828 chain = TREE_CHAIN (parm);
11829 /* @@ weak defense against parse errors. */
11830 if (TREE_CODE (decl) != VOID_TYPE
11831 && TREE_CODE (decl) != TREE_LIST)
11833 /* Give various messages as the need arises. */
11834 if (TREE_CODE (decl) == STRING_CST)
11835 cp_error ("invalid string constant `%E'", decl);
11836 else if (TREE_CODE (decl) == INTEGER_CST)
11837 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11841 if (parm == void_list_node)
11844 decl = grokdeclarator (TREE_VALUE (decl), TREE_PURPOSE (decl),
11845 PARM, init != NULL_TREE, NULL_TREE);
11846 if (! decl || TREE_TYPE (decl) == error_mark_node)
11849 type = TREE_TYPE (decl);
11850 if (VOID_TYPE_P (type))
11852 if (same_type_p (type, void_type_node)
11853 && !DECL_NAME (decl) && !result && !chain && !ellipsis)
11854 /* this is a parmlist of `(void)', which is ok. */
11856 incomplete_type_error (decl, type);
11857 /* It's not a good idea to actually create parameters of
11858 type `void'; other parts of the compiler assume that a
11859 void type terminates the parameter list. */
11860 type = error_mark_node;
11861 TREE_TYPE (decl) = error_mark_node;
11864 if (type != error_mark_node)
11866 /* Top-level qualifiers on the parameters are
11867 ignored for function types. */
11868 type = TYPE_MAIN_VARIANT (type);
11869 if (TREE_CODE (type) == METHOD_TYPE)
11871 cp_error ("parameter `%D' invalidly declared method type", decl);
11872 type = build_pointer_type (type);
11873 TREE_TYPE (decl) = type;
11875 else if (TREE_CODE (type) == OFFSET_TYPE)
11877 cp_error ("parameter `%D' invalidly declared offset type", decl);
11878 type = build_pointer_type (type);
11879 TREE_TYPE (decl) = type;
11881 else if (abstract_virtuals_error (decl, type))
11882 any_error = 1; /* Seems like a good idea. */
11883 else if (POINTER_TYPE_P (type))
11885 /* [dcl.fct]/6, parameter types cannot contain pointers
11886 (references) to arrays of unknown bound. */
11887 tree t = TREE_TYPE (type);
11888 int ptr = TYPE_PTR_P (type);
11892 if (TYPE_PTR_P (t))
11894 else if (TREE_CODE (t) != ARRAY_TYPE)
11896 else if (!TYPE_DOMAIN (t))
11900 if (TREE_CODE (t) == ARRAY_TYPE)
11901 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
11902 decl, ptr ? "pointer" : "reference", t);
11905 DECL_ARG_TYPE (decl) = TREE_TYPE (decl);
11906 if (PROMOTE_PROTOTYPES
11907 && INTEGRAL_TYPE_P (type)
11908 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
11909 DECL_ARG_TYPE (decl) = integer_type_node;
11910 if (!any_error && init)
11911 init = check_default_argument (decl, init);
11916 TREE_CHAIN (decl) = decls;
11918 result = tree_cons (init, type, result);
11920 decls = nreverse (decls);
11921 result = nreverse (result);
11923 result = chainon (result, void_list_node);
11924 last_function_parms = decls;
11930 /* D is a constructor or overloaded `operator='. Returns non-zero if
11931 D's arguments allow it to be a copy constructor, or copy assignment
11940 if (!DECL_FUNCTION_MEMBER_P (d))
11943 t = FUNCTION_FIRST_USER_PARMTYPE (d);
11944 if (t && TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
11945 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t)))
11946 == DECL_CONTEXT (d))
11947 && (TREE_CHAIN (t) == NULL_TREE
11948 || TREE_CHAIN (t) == void_list_node
11949 || TREE_PURPOSE (TREE_CHAIN (t))))
11954 /* These memoizing functions keep track of special properties which
11955 a class may have. `grok_ctor_properties' notices whether a class
11956 has a constructor of the form X(X&), and also complains
11957 if the class has a constructor of the form X(X).
11958 `grok_op_properties' takes notice of the various forms of
11959 operator= which are defined, as well as what sorts of type conversion
11960 may apply. Both functions take a FUNCTION_DECL as an argument. */
11963 grok_ctor_properties (ctype, decl)
11966 tree parmtypes = FUNCTION_FIRST_USER_PARMTYPE (decl);
11967 tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
11971 A non-template constructor for class X is a copy constructor if
11972 its first parameter is of type X&, const X&, volatile X& or const
11973 volatile X&, and either there are no other parameters or else all
11974 other parameters have default arguments. */
11975 if (TREE_CODE (parmtype) == REFERENCE_TYPE
11976 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == ctype
11977 && sufficient_parms_p (TREE_CHAIN (parmtypes))
11978 && !(DECL_TEMPLATE_INSTANTIATION (decl)
11979 && is_member_template (DECL_TI_TEMPLATE (decl))))
11981 TYPE_HAS_INIT_REF (ctype) = 1;
11982 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
11983 TYPE_HAS_CONST_INIT_REF (ctype) = 1;
11987 A declaration of a constructor for a class X is ill-formed if its
11988 first parameter is of type (optionally cv-qualified) X and either
11989 there are no other parameters or else all other parameters have
11992 We *don't* complain about member template instantiations that
11993 have this form, though; they can occur as we try to decide what
11994 constructor to use during overload resolution. Since overload
11995 resolution will never prefer such a constructor to the
11996 non-template copy constructor (which is either explicitly or
11997 implicitly defined), there's no need to worry about their
11998 existence. Theoretically, they should never even be
11999 instantiated, but that's hard to forestall. */
12000 else if (TYPE_MAIN_VARIANT (parmtype) == ctype
12001 && sufficient_parms_p (TREE_CHAIN (parmtypes))
12002 && !(DECL_TEMPLATE_INSTANTIATION (decl)
12003 && is_member_template (DECL_TI_TEMPLATE (decl))))
12005 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12007 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
12010 else if (TREE_CODE (parmtype) == VOID_TYPE
12011 || TREE_PURPOSE (parmtypes) != NULL_TREE)
12012 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype) = 1;
12017 /* An operator with this code is unary, but can also be binary. */
12021 enum tree_code code;
12023 return (code == INDIRECT_REF
12024 || code == ADDR_EXPR
12025 || code == CONVERT_EXPR
12026 || code == NEGATE_EXPR
12027 || code == PREINCREMENT_EXPR
12028 || code == PREDECREMENT_EXPR);
12031 /* An operator with this name can only be unary. */
12035 enum tree_code code;
12037 return (code == TRUTH_NOT_EXPR
12038 || code == BIT_NOT_EXPR
12039 || code == COMPONENT_REF
12040 || code == TYPE_EXPR);
12043 /* Do a little sanity-checking on how they declared their operator. */
12046 grok_op_properties (decl, virtualp, friendp)
12048 int virtualp, friendp;
12050 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
12052 int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
12053 tree name = DECL_NAME (decl);
12054 enum tree_code operator_code;
12057 /* Count the number of arguments. */
12058 for (argtype = argtypes, arity = 0;
12059 argtype && argtype != void_list_node;
12060 argtype = TREE_CHAIN (argtype))
12063 if (current_class_type == NULL_TREE)
12066 if (DECL_CONV_FN_P (decl))
12067 operator_code = TYPE_EXPR;
12071 #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \
12072 if (ansi_opname (CODE) == name) \
12074 operator_code = CODE; \
12077 else if (ansi_assopname (CODE) == name) \
12079 operator_code = CODE; \
12080 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12084 #include "operators.def"
12085 #undef DEF_OPERATOR
12087 my_friendly_abort (20000527);
12090 my_friendly_assert (operator_code != LAST_CPLUS_TREE_CODE, 20000526);
12091 SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12095 switch (operator_code)
12098 TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
12102 TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
12105 case COMPONENT_REF:
12107 TYPE_OVERLOADS_ARROW (current_class_type) = 1;
12111 TYPE_HAS_NEW_OPERATOR (current_class_type) = 1;
12115 TYPE_GETS_DELETE (current_class_type) |= 1;
12119 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type) = 1;
12122 case VEC_DELETE_EXPR:
12123 TYPE_GETS_DELETE (current_class_type) |= 2;
12131 if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR)
12133 /* When the compiler encounters the definition of A::operator new, it
12134 doesn't look at the class declaration to find out if it's static. */
12136 revert_static_member_fn (decl);
12138 TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
12140 else if (operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR)
12143 revert_static_member_fn (decl);
12145 TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
12149 /* An operator function must either be a non-static member function
12150 or have at least one parameter of a class, a reference to a class,
12151 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12152 if (! methodp || DECL_STATIC_FUNCTION_P (decl))
12154 if (operator_code == TYPE_EXPR
12155 || operator_code == CALL_EXPR
12156 || operator_code == COMPONENT_REF
12157 || operator_code == ARRAY_REF
12158 || operator_code == NOP_EXPR)
12159 cp_error ("`%D' must be a nonstatic member function", decl);
12164 if (DECL_STATIC_FUNCTION_P (decl))
12165 cp_error ("`%D' must be either a non-static member function or a non-member function", decl);
12168 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
12170 tree arg = TREE_VALUE (p);
12171 if (TREE_CODE (arg) == REFERENCE_TYPE)
12172 arg = TREE_TYPE (arg);
12174 /* This lets bad template code slip through. */
12175 if (IS_AGGR_TYPE (arg)
12176 || TREE_CODE (arg) == ENUMERAL_TYPE
12177 || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
12178 || TREE_CODE (arg) == BOUND_TEMPLATE_TEMPLATE_PARM)
12182 ("`%D' must have an argument of class or enumerated type",
12189 if (operator_code == CALL_EXPR)
12190 return; /* No restrictions on args. */
12192 if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
12194 tree t = TREE_TYPE (name);
12197 int ref = (TREE_CODE (t) == REFERENCE_TYPE);
12198 const char *what = 0;
12201 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
12203 if (TREE_CODE (t) == VOID_TYPE)
12205 else if (t == current_class_type)
12206 what = "the same type";
12207 /* Don't force t to be complete here. */
12208 else if (IS_AGGR_TYPE (t)
12209 && COMPLETE_TYPE_P (t)
12210 && DERIVED_FROM_P (t, current_class_type))
12211 what = "a base class";
12214 warning ("conversion to %s%s will never use a type conversion operator",
12215 ref ? "a reference to " : "", what);
12219 if (DECL_ASSIGNMENT_OPERATOR_P (decl)
12220 && operator_code == NOP_EXPR)
12224 if (arity != 2 && methodp)
12226 cp_error ("`%D' must take exactly one argument", decl);
12229 parmtype = TREE_VALUE (TREE_CHAIN (argtypes));
12233 A user-declared copy assignment operator X::operator= is
12234 a non-static non-template member function of class X with
12235 exactly one parameter of type X, X&, const X&, volatile
12236 X& or const volatile X&. */
12237 if (copy_assignment_arg_p (parmtype, virtualp)
12238 && !(DECL_TEMPLATE_INSTANTIATION (decl)
12239 && is_member_template (DECL_TI_TEMPLATE (decl)))
12242 TYPE_HAS_ASSIGN_REF (current_class_type) = 1;
12243 if (TREE_CODE (parmtype) != REFERENCE_TYPE
12244 || CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
12245 TYPE_HAS_CONST_ASSIGN_REF (current_class_type) = 1;
12248 else if (operator_code == COND_EXPR)
12251 cp_error ("ISO C++ prohibits overloading operator ?:");
12253 else if (ambi_op_p (operator_code))
12256 /* We pick the one-argument operator codes by default, so
12257 we don't have to change anything. */
12259 else if (arity == 2)
12261 /* If we thought this was a unary operator, we now know
12262 it to be a binary operator. */
12263 switch (operator_code)
12266 operator_code = MULT_EXPR;
12270 operator_code = BIT_AND_EXPR;
12274 operator_code = PLUS_EXPR;
12278 operator_code = MINUS_EXPR;
12281 case PREINCREMENT_EXPR:
12282 operator_code = POSTINCREMENT_EXPR;
12285 case PREDECREMENT_EXPR:
12286 operator_code = POSTDECREMENT_EXPR;
12290 my_friendly_abort (20000527);
12293 SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12295 if ((operator_code == POSTINCREMENT_EXPR
12296 || operator_code == POSTDECREMENT_EXPR)
12297 && ! processing_template_decl
12298 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
12301 cp_error ("postfix `%D' must take `int' as its argument",
12305 ("postfix `%D' must take `int' as its second argument",
12312 cp_error ("`%D' must take either zero or one argument", decl);
12314 cp_error ("`%D' must take either one or two arguments", decl);
12317 /* More Effective C++ rule 6. */
12319 && (operator_code == POSTINCREMENT_EXPR
12320 || operator_code == POSTDECREMENT_EXPR
12321 || operator_code == PREINCREMENT_EXPR
12322 || operator_code == PREDECREMENT_EXPR))
12324 tree arg = TREE_VALUE (argtypes);
12325 tree ret = TREE_TYPE (TREE_TYPE (decl));
12326 if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
12327 arg = TREE_TYPE (arg);
12328 arg = TYPE_MAIN_VARIANT (arg);
12329 if (operator_code == PREINCREMENT_EXPR
12330 || operator_code == PREDECREMENT_EXPR)
12332 if (TREE_CODE (ret) != REFERENCE_TYPE
12333 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
12335 cp_warning ("prefix `%D' should return `%T'", decl,
12336 build_reference_type (arg));
12340 if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
12341 cp_warning ("postfix `%D' should return `%T'", decl, arg);
12345 else if (unary_op_p (operator_code))
12350 cp_error ("`%D' must take `void'", decl);
12352 cp_error ("`%D' must take exactly one argument", decl);
12355 else /* if (binary_op_p (operator_code)) */
12360 cp_error ("`%D' must take exactly one argument", decl);
12362 cp_error ("`%D' must take exactly two arguments", decl);
12365 /* More Effective C++ rule 7. */
12367 && (operator_code == TRUTH_ANDIF_EXPR
12368 || operator_code == TRUTH_ORIF_EXPR
12369 || operator_code == COMPOUND_EXPR))
12370 cp_warning ("user-defined `%D' always evaluates both arguments",
12374 /* Effective C++ rule 23. */
12377 && (operator_code == PLUS_EXPR
12378 || operator_code == MINUS_EXPR
12379 || operator_code == TRUNC_DIV_EXPR
12380 || operator_code == MULT_EXPR)
12381 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
12382 cp_warning ("`%D' should return by value", decl);
12385 for (; argtypes && argtypes != void_list_node;
12386 argtypes = TREE_CHAIN (argtypes))
12387 if (TREE_PURPOSE (argtypes))
12389 TREE_PURPOSE (argtypes) = NULL_TREE;
12390 if (operator_code == POSTINCREMENT_EXPR
12391 || operator_code == POSTDECREMENT_EXPR)
12394 cp_pedwarn ("`%D' cannot have default arguments", decl);
12397 cp_error ("`%D' cannot have default arguments", decl);
12403 static const char *
12405 enum tag_types code;
12418 my_friendly_abort (981122);
12422 /* Get the struct, enum or union (CODE says which) with tag NAME.
12423 Define the tag as a forward-reference if it is not defined.
12425 C++: If a class derivation is given, process it here, and report
12426 an error if multiple derivation declarations are not identical.
12428 If this is a definition, come in through xref_tag and only look in
12429 the current frame for the name (since C++ allows new names in any
12433 xref_tag (code_type_node, name, globalize)
12434 tree code_type_node;
12438 enum tag_types tag_code;
12439 enum tree_code code;
12440 register tree ref, t;
12441 struct binding_level *b = current_binding_level;
12443 tree attributes = NULL_TREE;
12444 tree context = NULL_TREE;
12446 /* If we are called from the parser, code_type_node will sometimes be a
12447 TREE_LIST. This indicates that the user wrote
12448 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12450 if (TREE_CODE (code_type_node) == TREE_LIST)
12452 attributes = TREE_PURPOSE (code_type_node);
12453 code_type_node = TREE_VALUE (code_type_node);
12456 tag_code = (enum tag_types) tree_low_cst (code_type_node, 1);
12461 code = RECORD_TYPE;
12467 code = ENUMERAL_TYPE;
12470 my_friendly_abort (18);
12473 /* If a cross reference is requested, look up the type
12474 already defined for this tag and return it. */
12478 name = TYPE_IDENTIFIER (t);
12482 t = IDENTIFIER_TYPE_VALUE (name);
12484 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12485 if (t && globalize && TREE_CODE (t) == TYPENAME_TYPE)
12487 static int explained;
12490 cp_warning ("`%s %T' declares a new type at namespace scope",
12491 tag_name (tag_code), name);
12493 cp_warning (" names from dependent base classes are not visible to unqualified name lookup - to refer to the inherited type, say `%s %T::%T'",
12494 tag_name (tag_code),
12495 constructor_name (current_class_type),
12496 TYPE_IDENTIFIER (t));
12498 /* We need to remove the class scope binding for the
12499 TYPENAME_TYPE as otherwise poplevel_class gets confused. */
12500 for (shadowed = b->class_shadowed;
12502 shadowed = TREE_CHAIN (shadowed))
12503 if (TREE_TYPE (shadowed) == TYPE_NAME (t))
12505 TREE_PURPOSE (shadowed) = NULL_TREE;
12510 if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
12511 && TREE_CODE (t) != BOUND_TEMPLATE_TEMPLATE_PARM)
12516 /* If we know we are defining this tag, only look it up in
12517 this scope and don't try to find it as a type. */
12518 ref = lookup_tag (code, name, b, 1);
12524 /* [dcl.type.elab] If the identifier resolves to a
12525 typedef-name or a template type-parameter, the
12526 elaborated-type-specifier is ill-formed. */
12527 if (t != TYPE_MAIN_VARIANT (t)
12528 || (CLASS_TYPE_P (t) && TYPE_WAS_ANONYMOUS (t)))
12529 cp_pedwarn ("using typedef-name `%D' after `%s'",
12530 TYPE_NAME (t), tag_name (tag_code));
12531 else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
12532 cp_error ("using template type parameter `%T' after `%s'",
12533 t, tag_name (tag_code));
12538 ref = lookup_tag (code, name, b, 0);
12542 /* Try finding it as a type declaration. If that wins,
12544 ref = lookup_name (name, 1);
12546 if (ref != NULL_TREE
12547 && processing_template_decl
12548 && DECL_CLASS_TEMPLATE_P (ref)
12549 && template_class_depth (current_class_type) == 0)
12550 /* Since GLOBALIZE is true, we're declaring a global
12551 template, so we want this type. */
12552 ref = DECL_TEMPLATE_RESULT (ref);
12554 if (ref && TREE_CODE (ref) == TYPE_DECL
12555 && TREE_CODE (TREE_TYPE (ref)) == code)
12556 ref = TREE_TYPE (ref);
12561 if (ref && current_class_type
12562 && template_class_depth (current_class_type)
12563 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12565 /* Since GLOBALIZE is non-zero, we are not looking at a
12566 definition of this tag. Since, in addition, we are currently
12567 processing a (member) template declaration of a template
12568 class, we must be very careful; consider:
12575 { template <class V>
12576 friend struct S1; };
12578 Here, the S2::S1 declaration should not be confused with the
12579 outer declaration. In particular, the inner version should
12580 have a template parameter of level 2, not level 1. This
12581 would be particularly important if the member declaration
12584 template <class V = U> friend struct S1;
12586 say, when we should tsubst into `U' when instantiating
12587 S2. On the other hand, when presented with:
12597 we must find the inner binding eventually. We
12598 accomplish this by making sure that the new type we
12599 create to represent this declaration has the right
12601 context = TYPE_CONTEXT (ref);
12608 /* If no such tag is yet defined, create a forward-reference node
12609 and record it as the "definition".
12610 When a real declaration of this type is found,
12611 the forward-reference will be altered into a real type. */
12612 if (code == ENUMERAL_TYPE)
12614 cp_error ("use of enum `%#D' without previous declaration", name);
12616 ref = make_node (ENUMERAL_TYPE);
12618 /* Give the type a default layout like unsigned int
12619 to avoid crashing if it does not get defined. */
12620 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12621 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12622 TYPE_USER_ALIGN (ref) = 0;
12623 TREE_UNSIGNED (ref) = 1;
12624 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12625 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12626 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12628 /* Enable us to recognize when a type is created in class context.
12629 To do nested classes correctly, this should probably be cleared
12630 out when we leave this classes scope. Currently this in only
12631 done in `start_enum'. */
12633 pushtag (name, ref, globalize);
12637 struct binding_level *old_b = class_binding_level;
12639 ref = make_aggr_type (code);
12640 TYPE_CONTEXT (ref) = context;
12642 #ifdef NONNESTED_CLASSES
12643 /* Class types don't nest the way enums do. */
12644 class_binding_level = (struct binding_level *)0;
12646 pushtag (name, ref, globalize);
12647 class_binding_level = old_b;
12652 if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12653 redeclare_class_template (ref, current_template_parms);
12656 /* Until the type is defined, tentatively accept whatever
12657 structure tag the user hands us. */
12658 if (!COMPLETE_TYPE_P (ref)
12659 && ref != current_class_type
12660 /* Have to check this, in case we have contradictory tag info. */
12661 && IS_AGGR_TYPE_CODE (TREE_CODE (ref)))
12663 if (tag_code == class_type)
12664 CLASSTYPE_DECLARED_CLASS (ref) = 1;
12665 else if (tag_code == record_type)
12666 CLASSTYPE_DECLARED_CLASS (ref) = 0;
12669 TREE_TYPE (ref) = attributes;
12675 xref_tag_from_type (old, id, globalize)
12679 tree code_type_node;
12681 if (TREE_CODE (old) == RECORD_TYPE)
12682 code_type_node = (CLASSTYPE_DECLARED_CLASS (old)
12683 ? class_type_node : record_type_node);
12685 code_type_node = union_type_node;
12687 if (id == NULL_TREE)
12688 id = TYPE_IDENTIFIER (old);
12690 return xref_tag (code_type_node, id, globalize);
12693 /* REF is a type (named NAME), for which we have just seen some
12694 baseclasses. BINFO is a list of those baseclasses; the
12695 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12696 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12697 struct, or union. */
12700 xref_basetypes (code_type_node, name, ref, binfo)
12701 tree code_type_node;
12705 /* In the declaration `A : X, Y, ... Z' we mark all the types
12706 (A, X, Y, ..., Z) so we can check for duplicates. */
12711 enum tag_types tag_code = (enum tag_types) tree_low_cst (code_type_node, 1);
12713 if (tag_code == union_type)
12715 cp_error ("derived union `%T' invalid", ref);
12719 len = list_length (binfo);
12721 /* First, make sure that any templates in base-classes are
12722 instantiated. This ensures that if we call ourselves recursively
12723 we do not get confused about which classes are marked and which
12725 for (base = binfo; base; base = TREE_CHAIN (base))
12726 complete_type (TREE_VALUE (base));
12728 SET_CLASSTYPE_MARKED (ref);
12729 BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len);
12731 for (i = 0; binfo; binfo = TREE_CHAIN (binfo))
12733 /* The base of a derived struct is public by default. */
12735 = (TREE_PURPOSE (binfo) == access_public_node
12736 || TREE_PURPOSE (binfo) == access_public_virtual_node
12737 || (tag_code != class_type
12738 && (TREE_PURPOSE (binfo) == access_default_node
12739 || TREE_PURPOSE (binfo) == access_default_virtual_node)));
12741 = (TREE_PURPOSE (binfo) == access_protected_node
12742 || TREE_PURPOSE (binfo) == access_protected_virtual_node);
12744 = (TREE_PURPOSE (binfo) == access_private_virtual_node
12745 || TREE_PURPOSE (binfo) == access_protected_virtual_node
12746 || TREE_PURPOSE (binfo) == access_public_virtual_node
12747 || TREE_PURPOSE (binfo) == access_default_virtual_node);
12748 tree basetype = TREE_VALUE (binfo);
12751 if (basetype && TREE_CODE (basetype) == TYPE_DECL)
12752 basetype = TREE_TYPE (basetype);
12754 || (TREE_CODE (basetype) != RECORD_TYPE
12755 && TREE_CODE (basetype) != TYPENAME_TYPE
12756 && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
12757 && TREE_CODE (basetype) != BOUND_TEMPLATE_TEMPLATE_PARM))
12759 cp_error ("base type `%T' fails to be a struct or class type",
12760 TREE_VALUE (binfo));
12764 GNU_xref_hier (name, basetype, via_public, via_virtual, 0);
12766 /* This code replaces similar code in layout_basetypes.
12767 We put the complete_type first for implicit `typename'. */
12768 if (!COMPLETE_TYPE_P (basetype)
12769 && ! (current_template_parms && uses_template_parms (basetype)))
12771 cp_error ("base class `%T' has incomplete type", basetype);
12776 if (CLASSTYPE_MARKED (basetype))
12778 if (basetype == ref)
12779 cp_error ("recursive type `%T' undefined", basetype);
12781 cp_error ("duplicate base type `%T' invalid", basetype);
12785 if (TYPE_FOR_JAVA (basetype)
12786 && (current_lang_depth () == 0))
12787 TYPE_FOR_JAVA (ref) = 1;
12789 /* Note that the BINFO records which describe individual
12790 inheritances are *not* shared in the lattice! They
12791 cannot be shared because a given baseclass may be
12792 inherited with different `accessibility' by different
12793 derived classes. (Each BINFO record describing an
12794 individual inheritance contains flags which say what
12795 the `accessibility' of that particular inheritance is.) */
12798 = make_binfo (size_zero_node, basetype,
12799 CLASS_TYPE_P (basetype)
12800 ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE,
12801 CLASS_TYPE_P (basetype)
12802 ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE);
12804 TREE_VEC_ELT (binfos, i) = base_binfo;
12805 TREE_VIA_PUBLIC (base_binfo) = via_public;
12806 TREE_VIA_PROTECTED (base_binfo) = via_protected;
12807 TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
12808 BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref);
12810 /* We need to unshare the binfos now so that lookups during class
12811 definition work. */
12812 unshare_base_binfos (base_binfo);
12814 SET_CLASSTYPE_MARKED (basetype);
12816 /* We are free to modify these bits because they are meaningless
12817 at top level, and BASETYPE is a top-level type. */
12818 if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
12820 TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
12821 /* Converting to a virtual base class requires looking
12822 up the offset of the virtual base. */
12823 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
12826 if (CLASS_TYPE_P (basetype))
12828 TYPE_HAS_NEW_OPERATOR (ref)
12829 |= TYPE_HAS_NEW_OPERATOR (basetype);
12830 TYPE_HAS_ARRAY_NEW_OPERATOR (ref)
12831 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype);
12832 TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
12833 /* If the base-class uses multiple inheritance, so do we. */
12834 TYPE_USES_MULTIPLE_INHERITANCE (ref)
12835 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype);
12836 /* Likewise, if converting to a base of the base may require
12837 code, then we may need to generate code to convert to a
12839 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref)
12840 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype);
12847 TREE_VEC_LENGTH (binfos) = i;
12849 BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE;
12853 TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
12854 /* If there is more than one non-empty they cannot be at the same
12856 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
12859 /* Unmark all the types. */
12861 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i)));
12862 CLEAR_CLASSTYPE_MARKED (ref);
12864 /* Now that we know all the base-classes, set up the list of virtual
12866 get_vbase_types (ref);
12870 /* Begin compiling the definition of an enumeration type.
12871 NAME is its name (or null if anonymous).
12872 Returns the type object, as yet incomplete.
12873 Also records info about it so that build_enumerator
12874 may be used to declare the individual values as they are read. */
12880 register tree enumtype = NULL_TREE;
12881 struct binding_level *b = current_binding_level;
12883 /* If this is the real definition for a previous forward reference,
12884 fill in the contents in the same object that used to be the
12885 forward reference. */
12887 if (name != NULL_TREE)
12888 enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
12890 if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
12892 cp_error ("multiple definition of `%#T'", enumtype);
12893 cp_error_at ("previous definition here", enumtype);
12894 /* Clear out TYPE_VALUES, and start again. */
12895 TYPE_VALUES (enumtype) = NULL_TREE;
12899 enumtype = make_node (ENUMERAL_TYPE);
12900 pushtag (name, enumtype, 0);
12903 if (current_class_type)
12904 TREE_ADDRESSABLE (b->tags) = 1;
12906 GNU_xref_decl (current_function_decl, enumtype);
12910 /* After processing and defining all the values of an enumeration type,
12911 install their decls in the enumeration type and finish it off.
12912 ENUMTYPE is the type object and VALUES a list of name-value pairs. */
12915 finish_enum (enumtype)
12927 /* We built up the VALUES in reverse order. */
12928 TYPE_VALUES (enumtype) = nreverse (TYPE_VALUES (enumtype));
12932 Following the closing brace of an enum-specifier, each
12933 enumerator has the type of its enumeration. Prior to the
12934 closing brace, the type of each enumerator is the type of
12935 its initializing value. */
12936 for (pair = TYPE_VALUES (enumtype); pair; pair = TREE_CHAIN (pair))
12937 TREE_TYPE (TREE_VALUE (pair)) = enumtype;
12939 /* For a enum defined in a template, all further processing is
12940 postponed until the template is instantiated. */
12941 if (processing_template_decl)
12943 tree scope = current_scope ();
12944 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
12945 add_stmt (build_min (TAG_DEFN, enumtype));
12951 /* Figure out what the minimum and maximum values of the enumerators
12953 if (TYPE_VALUES (enumtype))
12955 minnode = maxnode = NULL_TREE;
12957 for (pair = TYPE_VALUES (enumtype);
12959 pair = TREE_CHAIN (pair))
12963 value = DECL_INITIAL (TREE_VALUE (pair));
12966 minnode = maxnode = value;
12967 else if (tree_int_cst_lt (maxnode, value))
12969 else if (tree_int_cst_lt (value, minnode))
12974 minnode = maxnode = integer_zero_node;
12976 /* Compute the number of bits require to represent all values of the
12977 enumeration. We must do this before the type of MINNODE and
12978 MAXNODE are transformed, since min_precision relies on the
12979 TREE_TYPE of the value it is passed. */
12980 unsignedp = tree_int_cst_sgn (minnode) >= 0;
12981 lowprec = min_precision (minnode, unsignedp);
12982 highprec = min_precision (maxnode, unsignedp);
12983 precision = MAX (lowprec, highprec);
12985 /* Set the TREE_TYPE for the values as well. That's so that when we
12986 call decl_constant_value we get an entity of the right type (but
12987 with the constant value). In addition, transform the TYPE_VALUES
12988 list to contain the values, rather than the CONST_DECLs for them. */
12989 for (pair = TYPE_VALUES (enumtype); pair; pair = TREE_CHAIN (pair))
12991 tree value = DECL_INITIAL (TREE_VALUE (pair));
12993 TREE_TYPE (value) = enumtype;
12994 TREE_VALUE (pair) = value;
12997 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12998 TYPE_SIZE (enumtype) = NULL_TREE;
12999 TYPE_PRECISION (enumtype) = precision;
13001 fixup_unsigned_type (enumtype);
13003 fixup_signed_type (enumtype);
13005 if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
13006 /* Use the width of the narrowest normal C type which is wide
13008 TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size
13011 TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
13013 TYPE_SIZE (enumtype) = NULL_TREE;
13014 layout_type (enumtype);
13016 /* Fix up all variant types of this enum type. */
13017 for (t = TYPE_MAIN_VARIANT (enumtype); t; t = TYPE_NEXT_VARIANT (t))
13019 TYPE_VALUES (t) = TYPE_VALUES (enumtype);
13020 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (enumtype);
13021 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (enumtype);
13022 TYPE_SIZE (t) = TYPE_SIZE (enumtype);
13023 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (enumtype);
13024 TYPE_MODE (t) = TYPE_MODE (enumtype);
13025 TYPE_PRECISION (t) = TYPE_PRECISION (enumtype);
13026 TYPE_ALIGN (t) = TYPE_ALIGN (enumtype);
13027 TYPE_USER_ALIGN (t) = TYPE_USER_ALIGN (enumtype);
13028 TREE_UNSIGNED (t) = TREE_UNSIGNED (enumtype);
13031 /* Finish debugging output for this type. */
13032 rest_of_type_compilation (enumtype, namespace_bindings_p ());
13035 /* Build and install a CONST_DECL for an enumeration constant of the
13036 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13037 Assignment of sequential values by default is handled here. */
13040 build_enumerator (name, value, enumtype)
13050 /* Remove no-op casts from the value. */
13052 STRIP_TYPE_NOPS (value);
13054 if (! processing_template_decl)
13056 /* Validate and default VALUE. */
13057 if (value != NULL_TREE)
13059 value = decl_constant_value (value);
13061 if (TREE_CODE (value) == INTEGER_CST)
13063 value = default_conversion (value);
13064 constant_expression_warning (value);
13068 cp_error ("enumerator value for `%D' not integer constant", name);
13073 /* Default based on previous value. */
13074 if (value == NULL_TREE && ! processing_template_decl)
13078 if (TYPE_VALUES (enumtype))
13080 /* The next value is the previous value ... */
13081 prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype)));
13082 /* ... plus one. */
13083 value = cp_build_binary_op (PLUS_EXPR,
13087 if (tree_int_cst_lt (value, prev_value))
13088 cp_error ("overflow in enumeration values at `%D'", name);
13091 value = integer_zero_node;
13094 /* Remove no-op casts from the value. */
13096 STRIP_TYPE_NOPS (value);
13098 /* To fix MAX_VAL enum consts. (bkoz) */
13099 TREE_TYPE (value) = integer_type_node;
13103 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13104 Even in other cases, we will later (in finish_enum) be setting
13105 the type of VALUE. But, we don't need to make a copy if this
13106 VALUE is one of the enumeration constants for this same
13107 enumeration type. */
13108 for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values))
13109 if (TREE_VALUE (values) == value)
13111 /* If we didn't break out of the loop, then we do need a copy. */
13112 if (!values && value)
13113 value = copy_node (value);
13115 /* C++ associates enums with global, function, or class declarations. */
13116 context = current_scope ();
13118 /* Build the actual enumeration constant. Note that the enumeration
13119 constants have the type of their initializers until the
13120 enumeration is complete:
13124 Following the closing brace of an enum-specifier, each enumer-
13125 ator has the type of its enumeration. Prior to the closing
13126 brace, the type of each enumerator is the type of its
13127 initializing value.
13129 In finish_enum we will reset the type. Of course, if we're
13130 processing a template, there may be no value. */
13131 type = value ? TREE_TYPE (value) : NULL_TREE;
13133 if (context && context == current_class_type)
13134 /* This enum declaration is local to the class. We need the full
13135 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13136 decl = build_lang_decl (CONST_DECL, name, type);
13138 /* It's a global enum, or it's local to a function. (Note local to
13139 a function could mean local to a class method. */
13140 decl = build_decl (CONST_DECL, name, type);
13142 DECL_CONTEXT (decl) = FROB_CONTEXT (context);
13143 DECL_INITIAL (decl) = value;
13144 TREE_READONLY (decl) = 1;
13146 if (context && context == current_class_type)
13147 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13148 on the TYPE_FIELDS list for `S'. (That's so that you can say
13149 things like `S::i' later.) */
13150 finish_member_declaration (decl);
13154 GNU_xref_decl (current_function_decl, decl);
13157 /* Add this enumeration constant to the list for this type. */
13158 TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype));
13162 /* We're defining DECL. Make sure that it's type is OK. */
13165 check_function_type (decl, current_function_parms)
13167 tree current_function_parms;
13169 tree fntype = TREE_TYPE (decl);
13170 tree return_type = complete_type (TREE_TYPE (fntype));
13172 /* In a function definition, arg types must be complete. */
13173 require_complete_types_for_parms (current_function_parms);
13175 if (!COMPLETE_OR_VOID_TYPE_P (return_type))
13177 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype));
13179 /* Make it return void instead, but don't change the
13180 type of the DECL_RESULT, in case we have a named return value. */
13181 if (TREE_CODE (fntype) == METHOD_TYPE)
13183 tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
13185 = build_cplus_method_type (ctype,
13187 FUNCTION_ARG_CHAIN (decl));
13191 = build_function_type (void_type_node,
13192 TYPE_ARG_TYPES (TREE_TYPE (decl)));
13194 = build_exception_variant (fntype,
13195 TYPE_RAISES_EXCEPTIONS (fntype));
13198 abstract_virtuals_error (decl, TREE_TYPE (fntype));
13201 /* Create the FUNCTION_DECL for a function definition.
13202 DECLSPECS and DECLARATOR are the parts of the declaration;
13203 they describe the function's name and the type it returns,
13204 but twisted together in a fashion that parallels the syntax of C.
13206 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13207 DECLARATOR is really the DECL for the function we are about to
13208 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13209 indicating that the function is an inline defined in-class.
13211 This function creates a binding context for the function body
13212 as well as setting up the FUNCTION_DECL in current_function_decl.
13214 Returns 1 on success. If the DECLARATOR is not suitable for a function
13215 (it defines a datum instead), we return 0, which tells
13216 yyparse to report a parse error.
13218 For C++, we must first check whether that datum makes any sense.
13219 For example, "class A local_a(1,2);" means that variable local_a
13220 is an aggregate of type A, which should have a constructor
13221 applied to it with the argument list [1, 2]. */
13224 start_function (declspecs, declarator, attrs, flags)
13225 tree declspecs, declarator, attrs;
13229 tree ctype = NULL_TREE;
13232 extern int have_extern_spec;
13233 extern int used_extern_spec;
13234 int doing_friend = 0;
13235 struct binding_level *bl;
13236 tree current_function_parms;
13238 /* Sanity check. */
13239 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
13240 my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
13242 /* This should only be done once on the top most decl. */
13243 if (have_extern_spec && !used_extern_spec)
13245 declspecs = tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
13246 used_extern_spec = 1;
13249 if (flags & SF_PRE_PARSED)
13251 decl1 = declarator;
13253 fntype = TREE_TYPE (decl1);
13254 if (TREE_CODE (fntype) == METHOD_TYPE)
13255 ctype = TYPE_METHOD_BASETYPE (fntype);
13257 /* ISO C++ 11.4/5. A friend function defined in a class is in
13258 the (lexical) scope of the class in which it is defined. */
13259 if (!ctype && DECL_FRIEND_P (decl1))
13261 ctype = DECL_FRIEND_CONTEXT (decl1);
13263 /* CTYPE could be null here if we're dealing with a template;
13264 for example, `inline friend float foo()' inside a template
13265 will have no CTYPE set. */
13266 if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
13272 last_function_parms = DECL_ARGUMENTS (decl1);
13276 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL_TREE);
13277 /* If the declarator is not suitable for a function definition,
13278 cause a syntax error. */
13279 if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) return 0;
13281 fntype = TREE_TYPE (decl1);
13283 restype = TREE_TYPE (fntype);
13284 if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
13286 cp_error ("semicolon missing after declaration of `%#T'", restype);
13287 shadow_tag (build_tree_list (NULL_TREE, restype));
13288 CLASSTYPE_GOT_SEMICOLON (restype) = 1;
13289 if (TREE_CODE (fntype) == FUNCTION_TYPE)
13290 fntype = build_function_type (integer_type_node,
13291 TYPE_ARG_TYPES (fntype));
13293 fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
13295 TYPE_ARG_TYPES (fntype));
13296 TREE_TYPE (decl1) = fntype;
13299 if (TREE_CODE (fntype) == METHOD_TYPE)
13300 ctype = TYPE_METHOD_BASETYPE (fntype);
13301 else if (DECL_MAIN_P (decl1))
13303 /* If this doesn't return integer_type, complain. */
13304 if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
13306 if (pedantic || warn_return_type)
13307 pedwarn ("return type for `main' changed to `int'");
13308 TREE_TYPE (decl1) = fntype = default_function_type;
13313 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl1))
13314 /* This is a constructor, we must ensure that any default args
13315 introduced by this definition are propagated to the clones
13316 now. The clones are used directly in overload resolution. */
13317 adjust_clone_args (decl1);
13319 /* Sometimes we don't notice that a function is a static member, and
13320 build a METHOD_TYPE for it. Fix that up now. */
13321 if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1)
13322 && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE)
13324 revert_static_member_fn (decl1);
13325 last_function_parms = TREE_CHAIN (last_function_parms);
13329 /* Warn if function was previously implicitly declared
13330 (but not if we warned then). */
13331 if (! warn_implicit
13332 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
13333 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
13335 /* Set up current_class_type, and enter the scope of the class, if
13338 push_nested_class (ctype, 1);
13339 else if (DECL_STATIC_FUNCTION_P (decl1))
13340 push_nested_class (DECL_CONTEXT (decl1), 2);
13342 /* Now that we have entered the scope of the class, we must restore
13343 the bindings for any template parameters surrounding DECL1, if it
13344 is an inline member template. (Order is important; consider the
13345 case where a template parameter has the same name as a field of
13346 the class.) It is not until after this point that
13347 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13348 if (flags & SF_INCLASS_INLINE)
13349 maybe_begin_member_template_processing (decl1);
13351 /* Effective C++ rule 15. */
13353 && DECL_OVERLOADED_OPERATOR_P (decl1) == NOP_EXPR
13354 && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
13355 cp_warning ("`operator=' should return a reference to `*this'");
13357 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13358 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13359 if (!DECL_INITIAL (decl1))
13360 DECL_INITIAL (decl1) = error_mark_node;
13362 /* This function exists in static storage.
13363 (This does not mean `static' in the C sense!) */
13364 TREE_STATIC (decl1) = 1;
13366 /* We must call push_template_decl after current_class_type is set
13367 up. (If we are processing inline definitions after exiting a
13368 class scope, current_class_type will be NULL_TREE until set above
13369 by push_nested_class.) */
13370 if (processing_template_decl)
13371 decl1 = push_template_decl (decl1);
13373 /* We are now in the scope of the function being defined. */
13374 current_function_decl = decl1;
13376 /* Save the parm names or decls from this function's declarator
13377 where store_parm_decls will find them. */
13378 current_function_parms = last_function_parms;
13380 /* Make sure the parameter and return types are reasonable. When
13381 you declare a function, these types can be incomplete, but they
13382 must be complete when you define the function. */
13383 if (! processing_template_decl)
13384 check_function_type (decl1, current_function_parms);
13386 /* Build the return declaration for the function. */
13387 restype = TREE_TYPE (fntype);
13388 if (!processing_template_decl)
13390 if (!DECL_RESULT (decl1))
13392 DECL_RESULT (decl1)
13393 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13394 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype),
13395 DECL_RESULT (decl1));
13399 /* Just use `void'. Nobody will ever look at this anyhow. */
13400 DECL_RESULT (decl1) = build_decl (RESULT_DECL, 0, void_type_node);
13402 /* Initialize RTL machinery. We cannot do this until
13403 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13404 even when processing a template; this is how we get
13405 CFUN set up, and our per-function variables initialized.
13406 FIXME factor out the non-RTL stuff. */
13407 bl = current_binding_level;
13408 init_function_start (decl1, input_filename, lineno);
13409 current_binding_level = bl;
13411 /* Even though we're inside a function body, we still don't want to
13412 call expand_expr to calculate the size of a variable-sized array.
13413 We haven't necessarily assigned RTL to all variables yet, so it's
13414 not safe to try to expand expressions involving them. */
13415 immediate_size_expand = 0;
13416 cfun->x_dont_save_pending_sizes_p = 1;
13418 /* Start the statement-tree, start the tree now. */
13419 begin_stmt_tree (&DECL_SAVED_TREE (decl1));
13421 /* Let the user know we're compiling this function. */
13422 announce_function (decl1);
13424 /* Record the decl so that the function name is defined.
13425 If we already have a decl for this name, and it is a FUNCTION_DECL,
13426 use the old decl. */
13427 if (!processing_template_decl && !(flags & SF_PRE_PARSED))
13429 /* A specialization is not used to guide overload resolution. */
13430 if (!DECL_TEMPLATE_SPECIALIZATION (decl1)
13431 && ! DECL_FUNCTION_MEMBER_P (decl1))
13432 decl1 = pushdecl (decl1);
13435 /* We need to set the DECL_CONTEXT. */
13436 if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
13437 DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
13438 /* And make sure we have enough default args. */
13439 check_default_args (decl1);
13441 fntype = TREE_TYPE (decl1);
13444 /* Reset these in case the call to pushdecl changed them. */
13445 current_function_decl = decl1;
13446 cfun->decl = decl1;
13448 /* If we are (erroneously) defining a function that we have already
13449 defined before, wipe out what we knew before. */
13450 if (!DECL_PENDING_INLINE_P (decl1)
13451 && DECL_SAVED_FUNCTION_DATA (decl1))
13453 free (DECL_SAVED_FUNCTION_DATA (decl1));
13454 DECL_SAVED_FUNCTION_DATA (decl1) = NULL;
13457 if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1))
13459 /* We know that this was set up by `grokclassfn'. We do not
13460 wait until `store_parm_decls', since evil parse errors may
13461 never get us to that point. Here we keep the consistency
13462 between `current_class_type' and `current_class_ptr'. */
13463 tree t = DECL_ARGUMENTS (decl1);
13465 my_friendly_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL,
13467 my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE,
13470 cp_function_chain->x_current_class_ref
13471 = build_indirect_ref (t, NULL);
13472 cp_function_chain->x_current_class_ptr = t;
13474 /* Constructors and destructors need to know whether they're "in
13475 charge" of initializing virtual base classes. */
13476 t = TREE_CHAIN (t);
13477 if (DECL_HAS_IN_CHARGE_PARM_P (decl1))
13479 current_in_charge_parm = t;
13480 t = TREE_CHAIN (t);
13482 if (DECL_HAS_VTT_PARM_P (decl1))
13484 if (DECL_NAME (t) != vtt_parm_identifier)
13486 current_vtt_parm = t;
13490 if (DECL_INTERFACE_KNOWN (decl1))
13492 tree ctx = decl_function_context (decl1);
13494 if (DECL_NOT_REALLY_EXTERN (decl1))
13495 DECL_EXTERNAL (decl1) = 0;
13497 if (ctx != NULL_TREE && DECL_DECLARED_INLINE_P (ctx)
13498 && TREE_PUBLIC (ctx))
13499 /* This is a function in a local class in an extern inline
13501 comdat_linkage (decl1);
13503 /* If this function belongs to an interface, it is public.
13504 If it belongs to someone else's interface, it is also external.
13505 This only affects inlines and template instantiations. */
13506 else if (interface_unknown == 0
13507 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13508 || flag_alt_external_templates))
13510 if (DECL_DECLARED_INLINE_P (decl1)
13511 || DECL_TEMPLATE_INSTANTIATION (decl1)
13512 || processing_template_decl)
13514 DECL_EXTERNAL (decl1)
13516 || (DECL_DECLARED_INLINE_P (decl1)
13517 && ! flag_implement_inlines
13518 && !DECL_VINDEX (decl1)));
13520 /* For WIN32 we also want to put these in linkonce sections. */
13521 maybe_make_one_only (decl1);
13524 DECL_EXTERNAL (decl1) = 0;
13525 DECL_NOT_REALLY_EXTERN (decl1) = 0;
13526 DECL_INTERFACE_KNOWN (decl1) = 1;
13528 else if (interface_unknown && interface_only
13529 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13530 || flag_alt_external_templates))
13532 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13533 interface, we will have interface_only set but not
13534 interface_known. In that case, we don't want to use the normal
13535 heuristics because someone will supply a #pragma implementation
13536 elsewhere, and deducing it here would produce a conflict. */
13537 comdat_linkage (decl1);
13538 DECL_EXTERNAL (decl1) = 0;
13539 DECL_INTERFACE_KNOWN (decl1) = 1;
13540 DECL_DEFER_OUTPUT (decl1) = 1;
13544 /* This is a definition, not a reference.
13545 So clear DECL_EXTERNAL. */
13546 DECL_EXTERNAL (decl1) = 0;
13548 if ((DECL_DECLARED_INLINE_P (decl1)
13549 || DECL_TEMPLATE_INSTANTIATION (decl1))
13550 && ! DECL_INTERFACE_KNOWN (decl1)
13551 /* Don't try to defer nested functions for now. */
13552 && ! decl_function_context (decl1))
13553 DECL_DEFER_OUTPUT (decl1) = 1;
13555 DECL_INTERFACE_KNOWN (decl1) = 1;
13559 current_binding_level->parm_flag = 1;
13561 cplus_decl_attributes (&decl1, NULL_TREE, attrs, 0);
13563 /* Promote the value to int before returning it. */
13564 if (c_promoting_integer_type_p (restype))
13565 restype = type_promotes_to (restype);
13567 if (DECL_RESULT (decl1) == NULL_TREE)
13569 DECL_RESULT (decl1)
13570 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13571 TREE_READONLY (DECL_RESULT (decl1)) = CP_TYPE_CONST_P (restype);
13572 TREE_THIS_VOLATILE (DECL_RESULT (decl1)) = CP_TYPE_VOLATILE_P (restype);
13577 if (DECL_DESTRUCTOR_P (decl1))
13579 dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13580 DECL_CONTEXT (dtor_label) = current_function_decl;
13583 start_fname_decls ();
13585 store_parm_decls (current_function_parms);
13590 /* Store the parameter declarations into the current function declaration.
13591 This is called after parsing the parameter declarations, before
13592 digesting the body of the function.
13594 Also install to binding contour return value identifier, if any. */
13597 store_parm_decls (current_function_parms)
13598 tree current_function_parms;
13600 register tree fndecl = current_function_decl;
13601 register tree parm;
13602 int parms_have_cleanups = 0;
13603 tree cleanups = NULL_TREE;
13605 /* This is a chain of any other decls that came in among the parm
13606 declarations. If a parm is declared with enum {foo, bar} x;
13607 then CONST_DECLs for foo and bar are put here. */
13608 tree nonparms = NULL_TREE;
13610 if (current_function_parms)
13612 /* This case is when the function was defined with an ANSI prototype.
13613 The parms already have decls, so we need not do anything here
13614 except record them as in effect
13615 and complain if any redundant old-style parm decls were written. */
13617 tree specparms = current_function_parms;
13620 /* Must clear this because it might contain TYPE_DECLs declared
13622 storedecls (NULL_TREE);
13624 /* If we're doing semantic analysis, then we'll call pushdecl
13625 for each of these. We must do them in reverse order so that
13626 they end in the correct forward order. */
13627 specparms = nreverse (specparms);
13629 for (parm = specparms; parm; parm = next)
13631 next = TREE_CHAIN (parm);
13632 if (TREE_CODE (parm) == PARM_DECL)
13636 if (DECL_NAME (parm) == NULL_TREE
13637 || TREE_CODE (parm) != VOID_TYPE)
13640 cp_error ("parameter `%D' declared void", parm);
13642 cleanup = (processing_template_decl
13644 : maybe_build_cleanup (parm));
13647 cleanups = tree_cons (parm, cleanup, cleanups);
13651 /* If we find an enum constant or a type tag,
13652 put it aside for the moment. */
13653 TREE_CHAIN (parm) = NULL_TREE;
13654 nonparms = chainon (nonparms, parm);
13658 /* Get the decls in their original chain order and record in the
13659 function. This is all and only the PARM_DECLs that were
13660 pushed into scope by the loop above. */
13661 DECL_ARGUMENTS (fndecl) = getdecls ();
13662 storetags (gettags ());
13665 DECL_ARGUMENTS (fndecl) = NULL_TREE;
13667 /* Now store the final chain of decls for the arguments
13668 as the decl-chain of the current lexical scope.
13669 Put the enumerators in as well, at the front so that
13670 DECL_ARGUMENTS is not modified. */
13671 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
13673 /* Now that we have initialized the parms, we can start their
13674 cleanups. We cannot do this before, since expand_decl_cleanup
13675 should not be called before the parm can be used. */
13678 finish_decl_cleanup (TREE_PURPOSE (cleanups),
13679 TREE_VALUE (cleanups));
13680 cleanups = TREE_CHAIN (cleanups);
13683 /* Create a binding contour which can be used to catch
13684 cleanup-generated temporaries. */
13685 if (parms_have_cleanups)
13688 /* Do the starting of the exception specifications, if we have any. */
13689 if (flag_exceptions && !processing_template_decl
13690 && flag_enforce_eh_specs
13691 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13692 current_eh_spec_block = begin_eh_spec_block ();
13696 /* We have finished doing semantic analysis on DECL, but have not yet
13697 generated RTL for its body. Save away our current state, so that
13698 when we want to generate RTL later we know what to do. */
13701 save_function_data (decl)
13704 struct cp_language_function *f;
13706 /* Save the language-specific per-function data so that we can
13707 get it back when we really expand this function. */
13708 my_friendly_assert (!DECL_PENDING_INLINE_P (decl),
13712 f = ((struct cp_language_function *)
13713 xmalloc (sizeof (struct cp_language_function)));
13714 memcpy (f, cp_function_chain, sizeof (struct cp_language_function));
13715 DECL_SAVED_FUNCTION_DATA (decl) = f;
13717 /* Clear out the bits we don't need. */
13718 f->base.x_stmt_tree.x_last_stmt = NULL_TREE;
13719 f->base.x_stmt_tree.x_last_expr_type = NULL_TREE;
13720 f->x_named_label_uses = NULL;
13721 f->bindings = NULL;
13722 f->x_local_names = NULL;
13724 /* When we get back here again, we will be expanding. */
13725 f->x_expanding_p = 1;
13727 /* If we've already decided that we cannot inline this function, we
13728 must remember that fact when we actually go to expand the
13730 if (current_function_cannot_inline)
13732 f->cannot_inline = current_function_cannot_inline;
13733 DECL_INLINE (decl) = 0;
13737 /* At the end of every constructor we generate to code to return
13738 `this'. Do that now. */
13741 finish_constructor_body ()
13743 /* Any return from a constructor will end up here. */
13745 add_stmt (build_stmt (LABEL_STMT, ctor_label));
13747 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13748 generate the return, rather than a goto to CTOR_LABEL. */
13749 ctor_label = NULL_TREE;
13750 /* In check_return_expr we translate an empty return from a
13751 constructor to a return of `this'. */
13752 finish_return_stmt (NULL_TREE);
13753 /* Mark the end of the constructor. */
13754 add_stmt (build_stmt (CTOR_STMT));
13757 /* At the end of every destructor we generate code to restore virtual
13758 function tables to the values desired by base classes and to call
13759 to base class destructors. Do that now. */
13762 finish_destructor_body ()
13764 tree compound_stmt;
13767 /* Create a block to contain all the extra code. */
13768 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
13770 /* Any return from a destructor will end up here. */
13771 add_stmt (build_stmt (LABEL_STMT, dtor_label));
13773 /* Generate the code to call destructor on base class. If this
13774 destructor belongs to a class with virtual functions, then set
13775 the virtual function table pointer to represent the type of our
13778 /* This side-effect makes call to `build_delete' generate the code
13779 we have to have at the end of this destructor. `build_delete'
13780 will set the flag again. */
13781 TYPE_HAS_DESTRUCTOR (current_class_type) = 0;
13783 exprstmt = build_delete (current_class_type,
13785 sfk_base_destructor,
13786 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
13789 if (exprstmt != error_mark_node
13790 && (TREE_CODE (exprstmt) != NOP_EXPR
13791 || TREE_OPERAND (exprstmt, 0) != integer_zero_node
13792 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)))
13794 if (exprstmt != void_zero_node)
13795 /* Don't call `expand_expr_stmt' if we're not going to do
13796 anything, since -Wall will give a diagnostic. */
13797 finish_expr_stmt (exprstmt);
13799 /* Run destructors for all virtual baseclasses. */
13800 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
13805 if_stmt = begin_if_stmt ();
13806 finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
13807 current_in_charge_parm,
13811 vbases = CLASSTYPE_VBASECLASSES (current_class_type);
13812 /* The CLASSTYPE_VBASECLASSES list is in initialization
13813 order, so we have to march through it in reverse order. */
13814 for (vbases = nreverse (copy_list (vbases));
13816 vbases = TREE_CHAIN (vbases))
13818 tree vbase = TREE_VALUE (vbases);
13819 tree base_type = BINFO_TYPE (vbase);
13821 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type))
13823 tree base_ptr_type = build_pointer_type (base_type);
13824 tree expr = current_class_ptr;
13826 /* Convert to the basetype here, as we know the layout is
13827 fixed. What is more, if we let build_method_call do it,
13828 it will use the vtable, which may have been clobbered
13829 by the deletion of our primary base. */
13831 expr = build1 (NOP_EXPR, base_ptr_type, expr);
13832 expr = build (PLUS_EXPR, base_ptr_type, expr,
13833 BINFO_OFFSET (vbase));
13834 expr = build_indirect_ref (expr, NULL);
13835 expr = build_method_call (expr, base_dtor_identifier,
13838 finish_expr_stmt (expr);
13842 finish_then_clause (if_stmt);
13847 /* In a virtual destructor, we must call delete. */
13848 if (DECL_VIRTUAL_P (current_function_decl))
13851 tree virtual_size = c_sizeof (current_class_type);
13855 At the point of definition of a virtual destructor (including
13856 an implicit definition), non-placement operator delete shall
13857 be looked up in the scope of the destructor's class and if
13858 found shall be accessible and unambiguous. */
13859 exprstmt = build_op_delete_call
13860 (DELETE_EXPR, current_class_ptr, virtual_size,
13861 LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
13863 if_stmt = begin_if_stmt ();
13864 finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
13865 current_in_charge_parm,
13868 finish_expr_stmt (exprstmt);
13869 finish_then_clause (if_stmt);
13873 /* Close the block we started above. */
13874 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
13877 /* Finish up a function declaration and compile that function
13878 all the way to assembler language output. The free the storage
13879 for the function definition.
13881 FLAGS is a bitwise or of the following values:
13883 An extra call to poplevel (and expand_end_bindings) must be
13884 made to take care of the binding contour for the base
13885 initializers. This is only relevant for constructors.
13887 We just finished processing the body of an in-class inline
13888 function definition. (This processing will have taken place
13889 after the class definition is complete.) */
13892 finish_function (flags)
13895 register tree fndecl = current_function_decl;
13896 tree fntype, ctype = NULL_TREE;
13897 int call_poplevel = (flags & 1) != 0;
13898 int inclass_inline = (flags & 2) != 0;
13901 /* When we get some parse errors, we can end up without a
13902 current_function_decl, so cope. */
13903 if (fndecl == NULL_TREE)
13904 return error_mark_node;
13906 nested = function_depth > 1;
13907 fntype = TREE_TYPE (fndecl);
13909 /* TREE_READONLY (fndecl) = 1;
13910 This caused &foo to be of type ptr-to-const-function
13911 which then got a warning when stored in a ptr-to-function variable. */
13913 my_friendly_assert (building_stmt_tree (), 20000911);
13915 finish_fname_decls ();
13917 /* For a cloned function, we've already got all the code we need;
13918 there's no need to add any extra bits. */
13919 if (!DECL_CLONED_FUNCTION_P (fndecl))
13921 if (DECL_CONSTRUCTOR_P (fndecl))
13923 finish_constructor_body ();
13927 else if (DECL_DESTRUCTOR_P (fndecl) && !processing_template_decl)
13928 finish_destructor_body ();
13929 else if (DECL_MAIN_P (fndecl))
13931 /* Make it so that `main' always returns 0 by default. */
13933 finish_return_stmt (integer_one_node);
13935 finish_return_stmt (integer_zero_node);
13939 /* Finish dealing with exception specifiers. */
13940 if (flag_exceptions && !processing_template_decl
13941 && flag_enforce_eh_specs
13942 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13943 finish_eh_spec_block (TYPE_RAISES_EXCEPTIONS
13944 (TREE_TYPE (current_function_decl)),
13945 current_eh_spec_block);
13948 /* If we're saving up tree structure, tie off the function now. */
13949 finish_stmt_tree (&DECL_SAVED_TREE (fndecl));
13951 /* This must come after expand_function_end because cleanups might
13952 have declarations (from inline functions) that need to go into
13953 this function's blocks. */
13954 if (current_binding_level->parm_flag != 1)
13955 my_friendly_abort (122);
13956 poplevel (1, 0, 1);
13958 /* Set up the named return value optimization, if we can. Here, we
13959 eliminate the copy from the nrv into the RESULT_DECL and any cleanup
13960 for the nrv. genrtl_start_function and declare_return_variable
13961 handle making the nrv and RESULT_DECL share space. */
13962 if (current_function_return_value)
13964 tree r = current_function_return_value;
13965 /* This is only worth doing for fns that return in memory--and
13966 simpler, since we don't have to worry about promoted modes. */
13967 if (r != error_mark_node
13968 && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))))
13970 DECL_ALIGN (r) = DECL_ALIGN (DECL_RESULT (fndecl));
13971 walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl),
13972 nullify_returns_r, r);
13975 /* Clear it so genrtl_start_function and declare_return_variable
13976 know we're not optimizing. */
13977 current_function_return_value = NULL_TREE;
13980 /* Remember that we were in class scope. */
13981 if (current_class_name)
13982 ctype = current_class_type;
13984 /* Must mark the RESULT_DECL as being in this function. */
13985 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
13987 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13988 to the FUNCTION_DECL node itself. */
13989 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
13991 /* Save away current state, if appropriate. */
13992 if (!processing_template_decl)
13993 save_function_data (fndecl);
13995 /* If this function calls `setjmp' it cannot be inlined. When
13996 `longjmp' is called it is not guaranteed to restore the value of
13997 local variables that have been modified since the call to
13998 `setjmp'. So, if were to inline this function into some caller
13999 `c', then when we `longjmp', we might not restore all variables
14000 in `c'. (It might seem, at first blush, that there's no way for
14001 this function to modify local variables in `c', but their
14002 addresses may have been stored somewhere accessible to this
14004 if (!processing_template_decl && calls_setjmp_p (fndecl))
14005 DECL_UNINLINABLE (fndecl) = 1;
14007 /* Clear out memory we no longer need. */
14008 free_after_parsing (cfun);
14009 /* Since we never call rest_of_compilation, we never clear
14010 CFUN. Do so explicitly. */
14011 free_after_compilation (cfun);
14014 /* If this is a in-class inline definition, we may have to pop the
14015 bindings for the template parameters that we added in
14016 maybe_begin_member_template_processing when start_function was
14018 if (inclass_inline)
14019 maybe_end_member_template_processing ();
14021 /* Leave the scope of the class. */
14023 pop_nested_class ();
14029 /* Let the error reporting routines know that we're outside a
14030 function. For a nested function, this value is used in
14031 pop_cp_function_context and then reset via pop_function_context. */
14032 current_function_decl = NULL_TREE;
14037 /* Create the FUNCTION_DECL for a function definition.
14038 DECLSPECS and DECLARATOR are the parts of the declaration;
14039 they describe the return type and the name of the function,
14040 but twisted together in a fashion that parallels the syntax of C.
14042 This function creates a binding context for the function body
14043 as well as setting up the FUNCTION_DECL in current_function_decl.
14045 Returns a FUNCTION_DECL on success.
14047 If the DECLARATOR is not suitable for a function (it defines a datum
14048 instead), we return 0, which tells yyparse to report a parse error.
14050 May return void_type_node indicating that this method is actually
14051 a friend. See grokfield for more details.
14053 Came here with a `.pushlevel' .
14055 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14056 CHANGES TO CODE IN `grokfield'. */
14059 start_method (declspecs, declarator, attrlist)
14060 tree declarator, declspecs, attrlist;
14062 tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
14065 /* Something too ugly to handle. */
14066 if (fndecl == NULL_TREE)
14069 /* Pass friends other than inline friend functions back. */
14070 if (fndecl == void_type_node)
14073 if (TREE_CODE (fndecl) != FUNCTION_DECL)
14074 /* Not a function, tell parser to report parse error. */
14077 if (DECL_IN_AGGR_P (fndecl))
14079 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
14081 if (DECL_CONTEXT (fndecl)
14082 && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
14083 cp_error ("`%D' is already defined in class `%T'", fndecl,
14084 DECL_CONTEXT (fndecl));
14086 return void_type_node;
14089 check_template_shadow (fndecl);
14091 DECL_DECLARED_INLINE_P (fndecl) = 1;
14093 if (flag_default_inline)
14094 DECL_INLINE (fndecl) = 1;
14096 /* We process method specializations in finish_struct_1. */
14097 if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
14098 fndecl = push_template_decl (fndecl);
14100 if (! DECL_FRIEND_P (fndecl))
14102 if (TREE_CHAIN (fndecl))
14104 fndecl = copy_node (fndecl);
14105 TREE_CHAIN (fndecl) = NULL_TREE;
14108 if (DECL_CONSTRUCTOR_P (fndecl))
14110 if (! grok_ctor_properties (current_class_type, fndecl))
14111 return void_type_node;
14113 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl)))
14114 grok_op_properties (fndecl, DECL_VIRTUAL_P (fndecl), 0);
14117 cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0);
14119 /* Make a place for the parms */
14121 current_binding_level->parm_flag = 1;
14123 DECL_IN_AGGR_P (fndecl) = 1;
14127 /* Go through the motions of finishing a function definition.
14128 We don't compile this method until after the whole class has
14131 FINISH_METHOD must return something that looks as though it
14132 came from GROKFIELD (since we are defining a method, after all).
14134 This is called after parsing the body of the function definition.
14135 STMTS is the chain of statements that makes up the function body.
14137 DECL is the ..._DECL that `start_method' provided. */
14140 finish_method (decl)
14143 register tree fndecl = decl;
14146 register tree link;
14148 if (decl == void_type_node)
14151 old_initial = DECL_INITIAL (fndecl);
14153 /* Undo the level for the parms (from start_method).
14154 This is like poplevel, but it causes nothing to be
14155 saved. Saving information here confuses symbol-table
14156 output routines. Besides, this information will
14157 be correctly output when this method is actually
14160 /* Clear out the meanings of the local variables of this level;
14161 also record in each decl which block it belongs to. */
14163 for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
14165 if (DECL_NAME (link) != NULL_TREE)
14166 pop_binding (DECL_NAME (link), link);
14167 my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
14168 DECL_CONTEXT (link) = NULL_TREE;
14171 GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
14172 (HOST_WIDE_INT) current_binding_level->level_chain,
14173 current_binding_level->parm_flag,
14174 current_binding_level->keep);
14176 poplevel (0, 0, 0);
14178 DECL_INITIAL (fndecl) = old_initial;
14180 /* We used to check if the context of FNDECL was different from
14181 current_class_type as another way to get inside here. This didn't work
14182 for String.cc in libg++. */
14183 if (DECL_FRIEND_P (fndecl))
14185 CLASSTYPE_INLINE_FRIENDS (current_class_type)
14186 = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
14187 decl = void_type_node;
14193 /* Called when a new struct TYPE is defined.
14194 If this structure or union completes the type of any previous
14195 variable declaration, lay it out and output its rtl. */
14198 hack_incomplete_structures (type)
14202 struct binding_level *level;
14204 if (!type) /* Don't do this for class templates. */
14207 if (namespace_bindings_p ())
14210 list = &namespace_scope_incomplete;
14214 level = innermost_nonclass_level ();
14215 list = &level->incomplete;
14222 tree decl = TREE_VALUE (*list);
14223 if ((decl && TREE_TYPE (decl) == type)
14224 || (TREE_TYPE (decl)
14225 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14226 && TREE_TYPE (TREE_TYPE (decl)) == type))
14228 int toplevel = toplevel_bindings_p ();
14229 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14230 && TREE_TYPE (TREE_TYPE (decl)) == type)
14231 layout_type (TREE_TYPE (decl));
14232 layout_decl (decl, 0);
14233 rest_of_decl_compilation (decl, NULL, toplevel, 0);
14237 expand_decl (decl);
14238 cleanup = maybe_build_cleanup (decl);
14239 expand_decl_init (decl);
14240 if (! expand_decl_cleanup (decl, cleanup))
14241 cp_error ("parser lost in parsing declaration of `%D'",
14244 *list = TREE_CHAIN (*list);
14247 list = &TREE_CHAIN (*list);
14250 /* Keep looking through artificial binding levels generated
14251 for local variables. */
14252 if (level && level->keep == 2)
14254 level = level->level_chain;
14255 list = &level->incomplete;
14262 /* If DECL is of a type which needs a cleanup, build that cleanup
14266 maybe_build_cleanup (decl)
14269 tree type = TREE_TYPE (decl);
14271 if (type != error_mark_node && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
14273 int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14276 if (TREE_CODE (type) == ARRAY_TYPE)
14280 mark_addressable (decl);
14281 rval = build_unary_op (ADDR_EXPR, decl, 0);
14284 /* Optimize for space over speed here. */
14285 if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14286 || flag_expensive_optimizations)
14287 flags |= LOOKUP_NONVIRTUAL;
14289 rval = build_delete (TREE_TYPE (rval), rval,
14290 sfk_complete_destructor, flags, 0);
14292 if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14293 && ! TYPE_HAS_DESTRUCTOR (type))
14294 rval = build_compound_expr (tree_cons (NULL_TREE, rval,
14295 build_tree_list (NULL_TREE, build_vbase_delete (type, decl))));
14302 /* When a stmt has been parsed, this function is called. */
14307 /* Always assume this statement was not an expression statement. If
14308 it actually was an expression statement, its our callers
14309 responsibility to fix this up. */
14310 last_expr_type = NULL_TREE;
14313 /* DECL was originally constructed as a non-static member function,
14314 but turned out to be static. Update it accordingly. */
14317 revert_static_member_fn (decl)
14321 tree function = TREE_TYPE (decl);
14322 tree args = TYPE_ARG_TYPES (function);
14324 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args)))
14325 != TYPE_UNQUALIFIED)
14326 cp_error ("static member function `%#D' declared with type qualifiers",
14329 args = TREE_CHAIN (args);
14330 tmp = build_function_type (TREE_TYPE (function), args);
14331 tmp = build_qualified_type (tmp, CP_TYPE_QUALS (function));
14332 tmp = build_exception_variant (tmp,
14333 TYPE_RAISES_EXCEPTIONS (function));
14334 TREE_TYPE (decl) = tmp;
14335 if (DECL_ARGUMENTS (decl))
14336 DECL_ARGUMENTS (decl) = TREE_CHAIN (DECL_ARGUMENTS (decl));
14337 DECL_STATIC_FUNCTION_P (decl) = 1;
14340 /* Initialize the variables used during compilation of a C++
14344 push_cp_function_context (f)
14345 struct function *f;
14347 struct cp_language_function *p
14348 = ((struct cp_language_function *)
14349 xcalloc (1, sizeof (struct cp_language_function)));
14350 f->language = (struct language_function *) p;
14352 /* It takes an explicit call to expand_body to generate RTL for a
14356 /* Whenever we start a new function, we destroy temporaries in the
14358 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
14361 /* Free the language-specific parts of F, now that we've finished
14362 compiling the function. */
14365 pop_cp_function_context (f)
14366 struct function *f;
14370 struct cp_language_function *cp =
14371 (struct cp_language_function *) f->language;
14372 if (cp->x_local_names)
14373 VARRAY_FREE (cp->x_local_names);
14374 free (f->language);
14379 /* Mark P for GC. */
14382 mark_lang_function (p)
14383 struct cp_language_function *p;
14388 mark_c_language_function (&p->base);
14390 ggc_mark_tree (p->x_ctor_label);
14391 ggc_mark_tree (p->x_dtor_label);
14392 ggc_mark_tree (p->x_current_class_ptr);
14393 ggc_mark_tree (p->x_current_class_ref);
14394 ggc_mark_tree (p->x_eh_spec_block);
14395 ggc_mark_tree_varray (p->x_local_names);
14397 mark_named_label_lists (&p->x_named_labels, &p->x_named_label_uses);
14398 mark_binding_level (&p->bindings);
14401 /* Mark the language-specific data in F for GC. */
14404 mark_cp_function_context (f)
14405 struct function *f;
14407 mark_lang_function ((struct cp_language_function *) f->language);
14414 enum tree_code code = TREE_CODE (t);
14415 if (code == IDENTIFIER_NODE)
14417 struct lang_identifier *li = (struct lang_identifier *) t;
14418 struct lang_id2 *li2 = li->x;
14419 ggc_mark_tree (li->namespace_bindings);
14420 ggc_mark_tree (li->bindings);
14421 ggc_mark_tree (li->class_value);
14422 ggc_mark_tree (li->class_template_info);
14426 ggc_mark_tree (li2->label_value);
14427 ggc_mark_tree (li2->implicit_decl);
14428 ggc_mark_tree (li2->error_locus);
14431 else if (code == CPLUS_BINDING)
14433 if (BINDING_HAS_LEVEL_P (t))
14434 mark_binding_level (&BINDING_LEVEL (t));
14436 ggc_mark_tree (BINDING_SCOPE (t));
14437 ggc_mark_tree (BINDING_VALUE (t));
14439 else if (code == OVERLOAD)
14440 ggc_mark_tree (OVL_FUNCTION (t));
14441 else if (code == TEMPLATE_PARM_INDEX)
14442 ggc_mark_tree (TEMPLATE_PARM_DECL (t));
14443 else if (TREE_CODE_CLASS (code) == 'd')
14445 struct lang_decl *ld = DECL_LANG_SPECIFIC (t);
14450 c_mark_lang_decl (&ld->decl_flags.base);
14451 if (!DECL_GLOBAL_CTOR_P (t)
14452 && !DECL_GLOBAL_DTOR_P (t)
14453 && !DECL_THUNK_P (t)
14454 && !DECL_DISCRIMINATOR_P (t))
14455 ggc_mark_tree (ld->decl_flags.u2.access);
14456 else if (DECL_THUNK_P (t))
14457 ggc_mark_tree (ld->decl_flags.u2.vcall_offset);
14458 if (TREE_CODE (t) != NAMESPACE_DECL)
14459 ggc_mark_tree (ld->decl_flags.u.template_info);
14461 mark_binding_level (&NAMESPACE_LEVEL (t));
14462 if (CAN_HAVE_FULL_LANG_DECL_P (t))
14464 ggc_mark_tree (ld->befriending_classes);
14465 ggc_mark_tree (ld->context);
14466 ggc_mark_tree (ld->cloned_function);
14467 ggc_mark_tree (ld->inlined_fns);
14468 if (TREE_CODE (t) == TYPE_DECL)
14469 ggc_mark_tree (ld->u.sorted_fields);
14470 else if (TREE_CODE (t) == FUNCTION_DECL
14471 && !DECL_PENDING_INLINE_P (t))
14472 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t));
14476 else if (TREE_CODE_CLASS (code) == 't')
14478 struct lang_type *lt = TYPE_LANG_SPECIFIC (t);
14480 if (lt && !(TREE_CODE (t) == POINTER_TYPE
14481 && TREE_CODE (TREE_TYPE (t)) == METHOD_TYPE))
14484 ggc_mark_tree (lt->primary_base);
14485 ggc_mark_tree (lt->vfields);
14486 ggc_mark_tree (lt->vbases);
14487 ggc_mark_tree (lt->tags);
14488 ggc_mark_tree (lt->size);
14489 ggc_mark_tree (lt->pure_virtuals);
14490 ggc_mark_tree (lt->friend_classes);
14491 ggc_mark_tree (lt->rtti);
14492 ggc_mark_tree (lt->methods);
14493 ggc_mark_tree (lt->template_info);
14494 ggc_mark_tree (lt->befriending_classes);
14497 /* In the case of pointer-to-member function types, the
14498 TYPE_LANG_SPECIFIC is really just a tree. */
14499 ggc_mark_tree ((tree) lt);
14503 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14504 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14507 identifier_global_value (t)
14510 return IDENTIFIER_GLOBAL_VALUE (t);
14513 /* Build the void_list_node (void_type_node having been created). */
14515 build_void_list_node ()
14517 tree t = build_tree_list (NULL_TREE, void_type_node);
14518 TREE_PARMLIST (t) = 1;
14523 cp_missing_noreturn_ok_p (decl)
14526 /* A missing noreturn is ok for the `main' function. */
14527 return DECL_MAIN_P (decl);