1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002 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. */
26 /* Process declarations and symbol lookup for C front end.
27 Also constructs types; the standard scalar types at initialization,
28 and structure, union, array and enum types when they are declared. */
30 /* ??? not all decl nodes are given the most useful possible
31 line numbers. For example, the CONST_DECLs for enum values. */
40 #include "tree-inline.h"
52 #include "diagnostic.h"
54 extern const struct attribute_spec *lang_attribute_table;
56 #ifndef HOST_PTR_PRINTF_FORMAT
57 #define HOST_PTR_PRINTF_FORMAT HOST_PTR_PRINTF
59 #ifndef HOST_PTR_PRINTF_TYPE
60 #define HOST_PTR_PRINTF_TYPE (void *)
63 static tree grokparms PARAMS ((tree));
64 static const char *redeclaration_error_message PARAMS ((tree, tree));
66 static void push_binding_level PARAMS ((struct binding_level *, int,
68 static void pop_binding_level PARAMS ((void));
69 static void suspend_binding_level PARAMS ((void));
70 static void resume_binding_level PARAMS ((struct binding_level *));
71 static struct binding_level *make_binding_level PARAMS ((void));
72 static void declare_namespace_level PARAMS ((void));
73 static int decl_jump_unsafe PARAMS ((tree));
74 static void storedecls PARAMS ((tree));
75 static void require_complete_types_for_parms PARAMS ((tree));
76 static int ambi_op_p PARAMS ((enum tree_code));
77 static int unary_op_p PARAMS ((enum tree_code));
78 static tree store_bindings PARAMS ((tree, tree));
79 static tree lookup_tag_reverse PARAMS ((tree, tree));
80 static tree obscure_complex_init PARAMS ((tree, tree));
81 static tree lookup_name_real PARAMS ((tree, int, int, int));
82 static void push_local_name PARAMS ((tree));
83 static void warn_extern_redeclared_static PARAMS ((tree, tree));
84 static tree grok_reference_init PARAMS ((tree, tree, tree));
85 static tree grokfndecl PARAMS ((tree, tree, tree, tree, int,
86 enum overload_flags, tree,
87 tree, int, int, int, int, int, int, tree));
88 static tree grokvardecl PARAMS ((tree, tree, RID_BIT_TYPE *, int, int, tree));
89 static tree follow_tag_typedef PARAMS ((tree));
90 static tree lookup_tag PARAMS ((enum tree_code, tree,
91 struct binding_level *, int));
92 static void set_identifier_type_value_with_scope
93 PARAMS ((tree, tree, struct binding_level *));
94 static void record_unknown_type PARAMS ((tree, const char *));
95 static tree builtin_function_1 PARAMS ((const char *, tree, tree, int,
96 enum built_in_class, const char *));
97 static tree build_library_fn_1 PARAMS ((tree, enum tree_code, tree));
98 static int member_function_or_else PARAMS ((tree, tree, enum overload_flags));
99 static void bad_specifiers PARAMS ((tree, const char *, int, int, int, int,
101 static tree maybe_process_template_type_declaration PARAMS ((tree, int, struct binding_level*));
102 static void check_for_uninitialized_const_var PARAMS ((tree));
103 static unsigned long typename_hash PARAMS ((hash_table_key));
104 static bool typename_compare PARAMS ((hash_table_key, hash_table_key));
105 static void push_binding PARAMS ((tree, tree, struct binding_level*));
106 static int add_binding PARAMS ((tree, tree));
107 static void pop_binding PARAMS ((tree, tree));
108 static tree local_variable_p_walkfn PARAMS ((tree *, int *, void *));
109 static tree find_binding PARAMS ((tree, tree));
110 static tree select_decl PARAMS ((tree, int));
111 static int lookup_flags PARAMS ((int, int));
112 static tree qualify_lookup PARAMS ((tree, int));
113 static tree record_builtin_java_type PARAMS ((const char *, int));
114 static const char *tag_name PARAMS ((enum tag_types code));
115 static void find_class_binding_level PARAMS ((void));
116 static struct binding_level *innermost_nonclass_level PARAMS ((void));
117 static void warn_about_implicit_typename_lookup PARAMS ((tree, tree));
118 static int walk_namespaces_r PARAMS ((tree, walk_namespaces_fn, void *));
119 static int walk_globals_r PARAMS ((tree, void *));
120 static void add_decl_to_level PARAMS ((tree, struct binding_level *));
121 static tree make_label_decl PARAMS ((tree, int));
122 static void use_label PARAMS ((tree));
123 static void check_previous_goto_1 PARAMS ((tree, struct binding_level *, tree,
125 static void check_previous_goto PARAMS ((struct named_label_use_list *));
126 static void check_switch_goto PARAMS ((struct binding_level *));
127 static void check_previous_gotos PARAMS ((tree));
128 static void pop_label PARAMS ((tree, tree));
129 static void pop_labels PARAMS ((tree));
130 static void maybe_deduce_size_from_array_init PARAMS ((tree, tree));
131 static void layout_var_decl PARAMS ((tree));
132 static void maybe_commonize_var PARAMS ((tree));
133 static tree check_initializer PARAMS ((tree, tree));
134 static void make_rtl_for_nonlocal_decl PARAMS ((tree, tree, const char *));
135 static void push_cp_function_context PARAMS ((struct function *));
136 static void pop_cp_function_context PARAMS ((struct function *));
137 static void mark_binding_level PARAMS ((void *));
138 static void mark_named_label_lists PARAMS ((void *, void *));
139 static void mark_cp_function_context PARAMS ((struct function *));
140 static void mark_saved_scope PARAMS ((void *));
141 static void mark_lang_function PARAMS ((struct cp_language_function *));
142 static void save_function_data PARAMS ((tree));
143 static void check_function_type PARAMS ((tree, tree));
144 static void destroy_local_var PARAMS ((tree));
145 static void begin_constructor_body PARAMS ((void));
146 static void finish_constructor_body PARAMS ((void));
147 static void begin_destructor_body PARAMS ((void));
148 static void finish_destructor_body PARAMS ((void));
149 static tree create_array_type_for_decl PARAMS ((tree, tree, tree));
150 static tree get_atexit_node PARAMS ((void));
151 static tree get_dso_handle_node PARAMS ((void));
152 static tree start_cleanup_fn PARAMS ((void));
153 static void end_cleanup_fn PARAMS ((void));
154 static tree cp_make_fname_decl PARAMS ((tree, int));
155 static void initialize_predefined_identifiers PARAMS ((void));
156 static tree check_special_function_return_type
157 PARAMS ((special_function_kind, tree, tree));
158 static tree push_cp_library_fn PARAMS ((enum tree_code, tree));
159 static tree build_cp_library_fn PARAMS ((tree, enum tree_code, tree));
160 static void store_parm_decls PARAMS ((tree));
161 static int cp_missing_noreturn_ok_p PARAMS ((tree));
163 #if defined (DEBUG_CP_BINDING_LEVELS)
164 static void indent PARAMS ((void));
167 /* Erroneous argument lists can use this *IFF* they do not modify it. */
168 tree error_mark_list;
170 /* The following symbols are subsumed in the cp_global_trees array, and
171 listed here individually for documentation purposes.
174 tree wchar_decl_node;
176 tree vtable_entry_type;
177 tree delta_type_node;
178 tree __t_desc_type_node;
179 tree ti_desc_type_node;
180 tree bltn_desc_type_node, ptr_desc_type_node;
181 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
182 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
183 tree ptm_desc_type_node;
184 tree base_desc_type_node;
186 tree class_type_node, record_type_node, union_type_node, enum_type_node;
187 tree unknown_type_node;
189 Array type `vtable_entry_type[]'
192 tree vtbl_ptr_type_node;
199 A FUNCTION_DECL which can call `abort'. Not necessarily the
200 one that the user will declare, but sufficient to be called
201 by routines that want to abort the program.
205 The FUNCTION_DECL for the default `::operator delete'.
207 tree global_delete_fndecl;
210 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
215 tree cp_global_trees[CPTI_MAX];
217 /* Indicates that there is a type value in some namespace, although
218 that is not necessarily in scope at the moment. */
220 static tree global_type_node;
222 /* Expect only namespace names now. */
223 static int only_namespace_names;
225 /* Used only for jumps to as-yet undefined labels, since jumps to
226 defined labels can have their validity checked immediately. */
228 struct named_label_use_list
230 struct binding_level *binding_level;
233 const char *filename_o_goto;
235 struct named_label_use_list *next;
238 #define named_label_uses cp_function_chain->x_named_label_uses
240 #define local_names cp_function_chain->x_local_names
242 /* A list of objects which have constructors or destructors
243 which reside in the global scope. The decl is stored in
244 the TREE_VALUE slot and the initializer is stored
245 in the TREE_PURPOSE slot. */
246 tree static_aggregates;
250 /* A node for the integer constants 2, and 3. */
252 tree integer_two_node, integer_three_node;
254 /* Similar, for last_function_parm_tags. */
255 tree last_function_parms;
257 /* A list of all LABEL_DECLs in the function that have names. Here so
258 we can clear out their names' definitions at the end of the
259 function, and so we can check the validity of jumps to these labels. */
261 struct named_label_list
263 struct binding_level *binding_level;
268 struct named_label_list *next;
269 unsigned int in_try_scope : 1;
270 unsigned int in_catch_scope : 1;
273 #define named_labels cp_function_chain->x_named_labels
275 /* Nonzero means use the ISO C94 dialect of C. */
279 /* Nonzero means use the ISO C99 dialect of C. */
283 /* Nonzero means we are a hosted implementation for code shared with C. */
287 /* Nonzero means add default format_arg attributes for functions not
290 int flag_noniso_default_format_attributes = 1;
292 /* Nonzero if we want to conserve space in the .o files. We do this
293 by putting uninitialized data and runtime initialized data into
294 .common instead of .data at the expense of not flagging multiple
296 extern int flag_conserve_space;
298 /* C and C++ flags are in decl2.c. */
300 /* A expression of value 0 with the same precision as a sizetype
302 tree signed_size_zero_node;
304 /* The name of the anonymous namespace, throughout this translation
306 tree anonymous_namespace_name;
308 /* The number of function bodies which we are currently processing.
309 (Zero if we are at namespace scope, one inside the body of a
310 function, two inside the body of a function in a local class, etc.) */
313 /* States indicating how grokdeclarator() should handle declspecs marked
314 with __attribute__((deprecated)). An object declared as
315 __attribute__((deprecated)) suppresses warnings of uses of other
318 enum deprecated_states {
323 static enum deprecated_states deprecated_state = DEPRECATED_NORMAL;
325 /* Set by add_implicitly_declared_members() to keep those members from
326 being flagged as deprecated or reported as using deprecated
328 int adding_implicit_members = 0;
330 /* For each binding contour we allocate a binding_level structure
331 which records the names defined in that contour.
334 1) one for each function definition,
335 where internal declarations of the parameters appear.
336 2) one for each compound statement,
337 to record its declarations.
339 The current meaning of a name can be found by searching the levels
340 from the current one out to the global one.
342 Off to the side, may be the class_binding_level. This exists only
343 to catch class-local declarations. It is otherwise nonexistent.
345 Also there may be binding levels that catch cleanups that must be
346 run when exceptions occur. Thus, to see whether a name is bound in
347 the current scope, it is not enough to look in the
348 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
351 /* Note that the information in the `names' component of the global contour
352 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
356 /* A chain of _DECL nodes for all variables, constants, functions,
357 and typedef types. These are in the reverse of the order
358 supplied. There may be OVERLOADs on this list, too, but they
359 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
362 /* A list of structure, union and enum definitions, for looking up
364 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
365 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
366 or ENUMERAL_TYPE node.
368 C++: the TREE_VALUE nodes can be simple types for
369 component_bindings. */
372 /* A list of USING_DECL nodes. */
375 /* A list of used namespaces. PURPOSE is the namespace,
376 VALUE the common ancestor with this binding_level's namespace. */
377 tree using_directives;
379 /* If this binding level is the binding level for a class, then
380 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
381 is the name of an entity bound in the class. The TREE_TYPE is
382 the DECL bound by this name in the class. */
385 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
386 is used for all binding levels. In addition the TREE_VALUE is the
387 IDENTIFIER_TYPE_VALUE before we entered the class. */
390 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
391 label in this scope. The TREE_PURPOSE is the previous value of
392 the IDENTIFIER_LABEL VALUE. */
393 tree shadowed_labels;
395 /* For each level (except not the global one),
396 a chain of BLOCK nodes for all the levels
397 that were entered and exited one level down. */
400 /* The _TYPE node for this level, if parm_flag == 2. */
403 /* The binding level which this one is contained in (inherits from). */
404 struct binding_level *level_chain;
406 /* List of VAR_DECLS saved from a previous for statement.
407 These would be dead in ISO-conforming code, but might
408 be referenced in ARM-era code. These are stored in a
409 TREE_LIST; the TREE_VALUE is the actual declaration. */
410 tree dead_vars_from_for;
412 /* 1 for the level that holds the parameters of a function.
413 2 for the level that holds a class declaration. */
414 unsigned parm_flag : 2;
416 /* 1 means make a BLOCK for this level regardless of all else.
417 2 for temporary binding contours created by the compiler. */
420 /* Nonzero if this level "doesn't exist" for tags. */
421 unsigned tag_transparent : 1;
423 /* Nonzero if this level can safely have additional
424 cleanup-needing variables added to it. */
425 unsigned more_cleanups_ok : 1;
426 unsigned have_cleanups : 1;
428 /* Nonzero if this scope is for storing the decls for template
429 parameters and generic decls; these decls will be discarded and
430 replaced with a TEMPLATE_DECL. */
431 unsigned template_parms_p : 1;
433 /* Nonzero if this scope corresponds to the `<>' in a
434 `template <>' clause. Whenever this flag is set,
435 TEMPLATE_PARMS_P will be set as well. */
436 unsigned template_spec_p : 1;
438 /* This is set for a namespace binding level. */
439 unsigned namespace_p : 1;
441 /* True if this level is that of a for-statement where we need to
442 worry about ambiguous (ARM or ISO) scope rules. */
443 unsigned is_for_scope : 1;
445 /* True if this level corresponds to a TRY block. Currently this
446 information is only available while building the tree structure. */
447 unsigned is_try_scope : 1;
449 /* True if this level corresponds to a CATCH block. Currently this
450 information is only available while building the tree structure. */
451 unsigned is_catch_scope : 1;
453 /* Three bits left for this word. */
455 #if defined(DEBUG_CP_BINDING_LEVELS)
456 /* Binding depth at which this level began. */
457 unsigned binding_depth;
458 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
461 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
463 /* The binding level currently in effect. */
465 #define current_binding_level \
466 (cfun && cp_function_chain->bindings \
467 ? cp_function_chain->bindings \
468 : scope_chain->bindings)
470 /* The binding level of the current class, if any. */
472 #define class_binding_level scope_chain->class_bindings
474 /* A chain of binding_level structures awaiting reuse. */
476 static struct binding_level *free_binding_level;
478 /* The outermost binding level, for names of file scope.
479 This is created when the compiler is started and exists
480 through the entire run. */
482 static struct binding_level *global_binding_level;
484 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
486 static int keep_next_level_flag;
488 /* A TREE_LIST of VAR_DECLs. The TREE_PURPOSE is a RECORD_TYPE or
489 UNION_TYPE; the TREE_VALUE is a VAR_DECL with that type. At the
490 time the VAR_DECL was declared, the type was incomplete. */
492 static tree incomplete_vars;
494 #if defined(DEBUG_CP_BINDING_LEVELS)
495 static int binding_depth = 0;
496 static int is_class_level = 0;
503 for (i = 0; i < binding_depth*2; i++)
506 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
508 static tree pushdecl_with_scope PARAMS ((tree, struct binding_level *));
511 push_binding_level (newlevel, tag_transparent, keep)
512 struct binding_level *newlevel;
513 int tag_transparent, keep;
515 /* Add this level to the front of the chain (stack) of levels that
517 memset ((char*) newlevel, 0, sizeof (struct binding_level));
518 newlevel->level_chain = current_binding_level;
519 current_binding_level = newlevel;
520 newlevel->tag_transparent = tag_transparent;
521 newlevel->more_cleanups_ok = 1;
523 newlevel->keep = keep;
524 #if defined(DEBUG_CP_BINDING_LEVELS)
525 newlevel->binding_depth = binding_depth;
527 fprintf (stderr, "push %s level 0x%08x line %d\n",
528 (is_class_level) ? "class" : "block", newlevel, lineno);
531 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
534 /* Find the innermost enclosing class scope, and reset
535 CLASS_BINDING_LEVEL appropriately. */
538 find_class_binding_level ()
540 struct binding_level *level = current_binding_level;
542 while (level && level->parm_flag != 2)
543 level = level->level_chain;
544 if (level && level->parm_flag == 2)
545 class_binding_level = level;
547 class_binding_level = 0;
553 if (global_binding_level)
555 /* Cannot pop a level, if there are none left to pop. */
556 if (current_binding_level == global_binding_level)
559 /* Pop the current level, and free the structure for reuse. */
560 #if defined(DEBUG_CP_BINDING_LEVELS)
563 fprintf (stderr, "pop %s level 0x%08x line %d\n",
564 (is_class_level) ? "class" : "block",
565 current_binding_level, lineno);
566 if (is_class_level != (current_binding_level == class_binding_level))
569 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
572 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
574 register struct binding_level *level = current_binding_level;
575 current_binding_level = current_binding_level->level_chain;
576 level->level_chain = free_binding_level;
577 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
578 if (level->binding_depth != binding_depth)
580 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
581 free_binding_level = level;
582 find_class_binding_level ();
587 suspend_binding_level ()
589 if (class_binding_level)
590 current_binding_level = class_binding_level;
592 if (global_binding_level)
594 /* Cannot suspend a level, if there are none left to suspend. */
595 if (current_binding_level == global_binding_level)
598 /* Suspend the current level. */
599 #if defined(DEBUG_CP_BINDING_LEVELS)
602 fprintf (stderr, "suspend %s level 0x%08x line %d\n",
603 (is_class_level) ? "class" : "block",
604 current_binding_level, lineno);
605 if (is_class_level != (current_binding_level == class_binding_level))
608 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
611 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
612 current_binding_level = current_binding_level->level_chain;
613 find_class_binding_level ();
617 resume_binding_level (b)
618 struct binding_level *b;
620 /* Resuming binding levels is meant only for namespaces,
621 and those cannot nest into classes. */
622 my_friendly_assert(!class_binding_level, 386);
623 /* Also, resuming a non-directly nested namespace is a no-no. */
624 my_friendly_assert(b->level_chain == current_binding_level, 386);
625 current_binding_level = b;
626 #if defined(DEBUG_CP_BINDING_LEVELS)
627 b->binding_depth = binding_depth;
629 fprintf (stderr, "resume %s level 0x%08x line %d\n",
630 (is_class_level) ? "class" : "block", b, lineno);
633 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
636 /* Create a new `struct binding_level'. */
639 struct binding_level *
640 make_binding_level ()
643 return (struct binding_level *) xmalloc (sizeof (struct binding_level));
646 /* Nonzero if we are currently in the global binding level. */
651 return current_binding_level == global_binding_level;
654 /* Return the innermost binding level that is not for a class scope. */
656 static struct binding_level *
657 innermost_nonclass_level ()
659 struct binding_level *b;
661 b = current_binding_level;
662 while (b->parm_flag == 2)
668 /* Nonzero if we are currently in a toplevel binding level. This
669 means either the global binding level or a namespace in a toplevel
670 binding level. Since there are no non-toplevel namespace levels,
671 this really means any namespace or template parameter level. We
672 also include a class whose context is toplevel. */
675 toplevel_bindings_p ()
677 struct binding_level *b = innermost_nonclass_level ();
679 return b->namespace_p || b->template_parms_p;
682 /* Nonzero if this is a namespace scope, or if we are defining a class
683 which is itself at namespace scope, or whose enclosing class is
684 such a class, etc. */
687 namespace_bindings_p ()
689 struct binding_level *b = innermost_nonclass_level ();
691 return b->namespace_p;
694 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
695 unconditionally. Otherwise, use the normal logic to decide whether
696 or not to create a BLOCK. */
699 keep_next_level (keep)
702 keep_next_level_flag = keep;
705 /* Nonzero if the current level needs to have a BLOCK made. */
710 return (current_binding_level->blocks != NULL_TREE
711 || current_binding_level->keep
712 || current_binding_level->names != NULL_TREE
713 || (current_binding_level->tags != NULL_TREE
714 && !current_binding_level->tag_transparent));
718 declare_namespace_level ()
720 current_binding_level->namespace_p = 1;
723 /* Returns non-zero if this scope was created to store template
727 template_parm_scope_p ()
729 return current_binding_level->template_parms_p;
732 /* Returns the kind of template specialization we are currently
733 processing, given that it's declaration contained N_CLASS_SCOPES
734 explicit scope qualifications. */
737 current_tmpl_spec_kind (n_class_scopes)
740 int n_template_parm_scopes = 0;
741 int seen_specialization_p = 0;
742 int innermost_specialization_p = 0;
743 struct binding_level *b;
745 /* Scan through the template parameter scopes. */
746 for (b = current_binding_level; b->template_parms_p; b = b->level_chain)
748 /* If we see a specialization scope inside a parameter scope,
749 then something is wrong. That corresponds to a declaration
752 template <class T> template <> ...
754 which is always illegal since [temp.expl.spec] forbids the
755 specialization of a class member template if the enclosing
756 class templates are not explicitly specialized as well. */
757 if (b->template_spec_p)
759 if (n_template_parm_scopes == 0)
760 innermost_specialization_p = 1;
762 seen_specialization_p = 1;
764 else if (seen_specialization_p == 1)
765 return tsk_invalid_member_spec;
767 ++n_template_parm_scopes;
770 /* Handle explicit instantiations. */
771 if (processing_explicit_instantiation)
773 if (n_template_parm_scopes != 0)
774 /* We've seen a template parameter list during an explicit
775 instantiation. For example:
777 template <class T> template void f(int);
779 This is erroneous. */
780 return tsk_invalid_expl_inst;
782 return tsk_expl_inst;
785 if (n_template_parm_scopes < n_class_scopes)
786 /* We've not seen enough template headers to match all the
787 specialized classes present. For example:
789 template <class T> void R<T>::S<T>::f(int);
791 This is illegal; there needs to be one set of template
792 parameters for each class. */
793 return tsk_insufficient_parms;
794 else if (n_template_parm_scopes == n_class_scopes)
795 /* We're processing a non-template declaration (even though it may
796 be a member of a template class.) For example:
798 template <class T> void S<T>::f(int);
800 The `class T' maches the `S<T>', leaving no template headers
801 corresponding to the `f'. */
803 else if (n_template_parm_scopes > n_class_scopes + 1)
804 /* We've got too many template headers. For example:
806 template <> template <class T> void f (T);
808 There need to be more enclosing classes. */
809 return tsk_excessive_parms;
811 /* This must be a template. It's of the form:
813 template <class T> template <class U> void S<T>::f(U);
815 This is a specialization if the innermost level was a
816 specialization; otherwise it's just a definition of the
818 return innermost_specialization_p ? tsk_expl_spec : tsk_template;
822 set_class_shadows (shadows)
825 class_binding_level->class_shadowed = shadows;
828 /* Enter a new binding level.
829 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
830 not for that of tags. */
833 pushlevel (tag_transparent)
836 struct binding_level *newlevel;
838 if (cfun && !doing_semantic_analysis_p ())
841 /* Reuse or create a struct for this binding level. */
842 #if defined(DEBUG_CP_BINDING_LEVELS)
844 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
845 if (free_binding_level)
846 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
848 newlevel = free_binding_level;
849 free_binding_level = free_binding_level->level_chain;
852 newlevel = make_binding_level ();
854 push_binding_level (newlevel, tag_transparent, keep_next_level_flag);
855 keep_next_level_flag = 0;
858 /* We're defining an object of type TYPE. If it needs a cleanup, but
859 we're not allowed to add any more objects with cleanups to the current
860 scope, create a new binding level. */
863 maybe_push_cleanup_level (type)
866 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
867 && current_binding_level->more_cleanups_ok == 0)
872 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
876 /* Enter a new scope. The KIND indicates what kind of scope is being
887 case sk_template_spec:
888 current_binding_level->template_spec_p = 1;
891 case sk_template_parms:
892 current_binding_level->template_parms_p = 1;
900 /* Exit the current scope. */
909 note_level_for_for ()
911 current_binding_level->is_for_scope = 1;
914 /* Record that the current binding level represents a try block. */
917 note_level_for_try ()
919 current_binding_level->is_try_scope = 1;
922 /* Record that the current binding level represents a catch block. */
925 note_level_for_catch ()
927 current_binding_level->is_catch_scope = 1;
930 /* For a binding between a name and an entity at a block scope,
931 this is the `struct binding_level' for the block. */
932 #define BINDING_LEVEL(NODE) \
933 (((struct tree_binding*)(NODE))->scope.level)
935 /* A free list of CPLUS_BINDING nodes, connected by their
938 static tree free_bindings;
940 /* Make DECL the innermost binding for ID. The LEVEL is the binding
941 level at which this declaration is being bound. */
944 push_binding (id, decl, level)
947 struct binding_level* level;
953 binding = free_bindings;
954 free_bindings = TREE_CHAIN (binding);
957 binding = make_node (CPLUS_BINDING);
959 /* Now, fill in the binding information. */
960 BINDING_VALUE (binding) = decl;
961 BINDING_TYPE (binding) = NULL_TREE;
962 BINDING_LEVEL (binding) = level;
963 INHERITED_VALUE_BINDING_P (binding) = 0;
964 LOCAL_BINDING_P (binding) = (level != class_binding_level);
965 BINDING_HAS_LEVEL_P (binding) = 1;
967 /* And put it on the front of the list of bindings for ID. */
968 TREE_CHAIN (binding) = IDENTIFIER_BINDING (id);
969 IDENTIFIER_BINDING (id) = binding;
972 /* ID is already bound in the current scope. But, DECL is an
973 additional binding for ID in the same scope. This is the `struct
974 stat' hack whereby a non-typedef class-name or enum-name can be
975 bound at the same level as some other kind of entity. It's the
976 responsibility of the caller to check that inserting this name is
977 legal here. Returns nonzero if the new binding was successful. */
979 add_binding (id, decl)
983 tree binding = IDENTIFIER_BINDING (id);
986 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
987 /* The new name is the type name. */
988 BINDING_TYPE (binding) = decl;
989 else if (!BINDING_VALUE (binding))
990 /* This situation arises when push_class_level_binding moves an
991 inherited type-binding out of the way to make room for a new
993 BINDING_VALUE (binding) = decl;
994 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
995 && DECL_ARTIFICIAL (BINDING_VALUE (binding)))
997 /* The old binding was a type name. It was placed in
998 BINDING_VALUE because it was thought, at the point it was
999 declared, to be the only entity with such a name. Move the
1000 type name into the type slot; it is now hidden by the new
1002 BINDING_TYPE (binding) = BINDING_VALUE (binding);
1003 BINDING_VALUE (binding) = decl;
1004 INHERITED_VALUE_BINDING_P (binding) = 0;
1006 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
1007 && TREE_CODE (decl) == TYPE_DECL
1008 && DECL_NAME (decl) == DECL_NAME (BINDING_VALUE (binding))
1009 && (same_type_p (TREE_TYPE (decl),
1010 TREE_TYPE (BINDING_VALUE (binding)))
1011 /* If either type involves template parameters, we must
1012 wait until instantiation. */
1013 || uses_template_parms (TREE_TYPE (decl))
1014 || uses_template_parms (TREE_TYPE (BINDING_VALUE (binding)))))
1015 /* We have two typedef-names, both naming the same type to have
1016 the same name. This is OK because of:
1020 In a given scope, a typedef specifier can be used to redefine
1021 the name of any type declared in that scope to refer to the
1022 type to which it already refers. */
1024 /* There can be two block-scope declarations of the same variable,
1025 so long as they are `extern' declarations. */
1026 else if (TREE_CODE (decl) == VAR_DECL
1027 && TREE_CODE (BINDING_VALUE (binding)) == VAR_DECL
1028 && DECL_EXTERNAL (decl)
1029 && DECL_EXTERNAL (BINDING_VALUE (binding)))
1031 duplicate_decls (decl, BINDING_VALUE (binding));
1036 error ("declaration of `%#D'", decl);
1037 cp_error_at ("conflicts with previous declaration `%#D'",
1038 BINDING_VALUE (binding));
1045 /* Add DECL to the list of things declared in B. */
1048 add_decl_to_level (decl, b)
1050 struct binding_level *b;
1052 /* We build up the list in reverse order, and reverse it later if
1054 TREE_CHAIN (decl) = b->names;
1058 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1059 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1060 doesn't really belong to this binding level, that it got here
1061 through a using-declaration. */
1064 push_local_binding (id, decl, flags)
1069 struct binding_level *b;
1071 /* Skip over any local classes. This makes sense if we call
1072 push_local_binding with a friend decl of a local class. */
1073 b = current_binding_level;
1074 while (b->parm_flag == 2)
1077 if (lookup_name_current_level (id))
1079 /* Supplement the existing binding. */
1080 if (!add_binding (id, decl))
1081 /* It didn't work. Something else must be bound at this
1082 level. Do not add DECL to the list of things to pop
1087 /* Create a new binding. */
1088 push_binding (id, decl, b);
1090 if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
1091 /* We must put the OVERLOAD into a TREE_LIST since the
1092 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1093 decls that got here through a using-declaration. */
1094 decl = build_tree_list (NULL_TREE, decl);
1096 /* And put DECL on the list of things declared by the current
1098 add_decl_to_level (decl, b);
1101 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1102 binding was successful. */
1105 push_class_binding (id, decl)
1110 tree binding = IDENTIFIER_BINDING (id);
1113 /* Note that we declared this value so that we can issue an error if
1114 this an illegal redeclaration of a name already used for some
1116 note_name_declared_in_class (id, decl);
1118 if (binding && BINDING_LEVEL (binding) == class_binding_level)
1119 /* Supplement the existing binding. */
1120 result = add_binding (id, decl);
1122 /* Create a new binding. */
1123 push_binding (id, decl, class_binding_level);
1125 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1126 class-level declaration. Note that we do not use DECL here
1127 because of the possibility of the `struct stat' hack; if DECL is
1128 a class-name or enum-name we might prefer a field-name, or some
1130 IDENTIFIER_CLASS_VALUE (id) = BINDING_VALUE (IDENTIFIER_BINDING (id));
1132 /* If this is a binding from a base class, mark it as such. */
1133 binding = IDENTIFIER_BINDING (id);
1134 if (BINDING_VALUE (binding) == decl && TREE_CODE (decl) != TREE_LIST)
1136 /* Any implicit typename must be from a base-class. The
1137 context for an implicit typename declaration is always
1138 the derived class in which the lookup was done, so the checks
1139 based on the context of DECL below will not trigger. */
1140 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl))
1141 INHERITED_VALUE_BINDING_P (binding) = 1;
1144 if (TREE_CODE (decl) == OVERLOAD)
1145 context = CP_DECL_CONTEXT (OVL_CURRENT (decl));
1148 my_friendly_assert (DECL_P (decl), 0);
1149 context = context_for_name_lookup (decl);
1152 if (is_properly_derived_from (current_class_type, context))
1153 INHERITED_VALUE_BINDING_P (binding) = 1;
1155 INHERITED_VALUE_BINDING_P (binding) = 0;
1158 else if (BINDING_VALUE (binding) == decl)
1159 /* We only encounter a TREE_LIST when push_class_decls detects an
1160 ambiguity. Such an ambiguity can be overridden by a definition
1162 INHERITED_VALUE_BINDING_P (binding) = 1;
1167 /* Remove the binding for DECL which should be the innermost binding
1171 pop_binding (id, decl)
1177 if (id == NULL_TREE)
1178 /* It's easiest to write the loops that call this function without
1179 checking whether or not the entities involved have names. We
1180 get here for such an entity. */
1183 /* Get the innermost binding for ID. */
1184 binding = IDENTIFIER_BINDING (id);
1186 /* The name should be bound. */
1187 my_friendly_assert (binding != NULL_TREE, 0);
1189 /* The DECL will be either the ordinary binding or the type
1190 binding for this identifier. Remove that binding. */
1191 if (BINDING_VALUE (binding) == decl)
1192 BINDING_VALUE (binding) = NULL_TREE;
1193 else if (BINDING_TYPE (binding) == decl)
1194 BINDING_TYPE (binding) = NULL_TREE;
1198 if (!BINDING_VALUE (binding) && !BINDING_TYPE (binding))
1200 /* We're completely done with the innermost binding for this
1201 identifier. Unhook it from the list of bindings. */
1202 IDENTIFIER_BINDING (id) = TREE_CHAIN (binding);
1204 /* Add it to the free list. */
1205 TREE_CHAIN (binding) = free_bindings;
1206 free_bindings = binding;
1208 /* Clear the BINDING_LEVEL so the garbage collector doesn't walk
1210 BINDING_LEVEL (binding) = NULL;
1214 /* When a label goes out of scope, check to see if that label was used
1215 in a valid manner, and issue any appropriate warnings or errors. */
1218 pop_label (label, old_value)
1222 if (!processing_template_decl && doing_semantic_analysis_p ())
1224 if (DECL_INITIAL (label) == NULL_TREE)
1226 cp_error_at ("label `%D' used but not defined", label);
1227 /* Avoid crashing later. */
1228 define_label (input_filename, 1, DECL_NAME (label));
1230 else if (warn_unused_label && !TREE_USED (label))
1231 cp_warning_at ("label `%D' defined but not used", label);
1234 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), old_value);
1237 /* At the end of a function, all labels declared within the function
1238 go out of scope. BLOCK is the top-level block for the
1245 struct named_label_list *link;
1247 /* Clear out the definitions of all label names, since their scopes
1249 for (link = named_labels; link; link = link->next)
1251 pop_label (link->label_decl, link->old_value);
1252 /* Put the labels into the "variables" of the top-level block,
1253 so debugger can see them. */
1254 TREE_CHAIN (link->label_decl) = BLOCK_VARS (block);
1255 BLOCK_VARS (block) = link->label_decl;
1258 named_labels = NULL;
1261 /* Exit a binding level.
1262 Pop the level off, and restore the state of the identifier-decl mappings
1263 that were in effect when this level was entered.
1265 If KEEP == 1, this level had explicit declarations, so
1266 and create a "block" (a BLOCK node) for the level
1267 to record its declarations and subblocks for symbol table output.
1269 If FUNCTIONBODY is nonzero, this level is the body of a function,
1270 so create a block as if KEEP were set and also clear out all
1273 If REVERSE is nonzero, reverse the order of decls before putting
1274 them into the BLOCK. */
1277 poplevel (keep, reverse, functionbody)
1283 /* The chain of decls was accumulated in reverse order.
1284 Put it into forward order, just for cleanliness. */
1286 int tmp = functionbody;
1287 int real_functionbody;
1290 tree block = NULL_TREE;
1292 int leaving_for_scope;
1294 if (cfun && !doing_semantic_analysis_p ())
1297 my_friendly_assert (current_binding_level->parm_flag != 2,
1300 real_functionbody = (current_binding_level->keep == 2
1301 ? ((functionbody = 0), tmp) : functionbody);
1302 tags = functionbody >= 0 ? current_binding_level->tags : 0;
1303 subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;
1305 my_friendly_assert (!current_binding_level->class_shadowed,
1308 /* We used to use KEEP == 2 to indicate that the new block should go
1309 at the beginning of the list of blocks at this binding level,
1310 rather than the end. This hack is no longer used. */
1311 my_friendly_assert (keep == 0 || keep == 1, 0);
1313 if (current_binding_level->keep == 1)
1316 /* Any uses of undefined labels, and any defined labels, now operate
1317 under constraints of next binding contour. */
1318 if (cfun && !functionbody)
1320 struct binding_level *level_chain;
1321 level_chain = current_binding_level->level_chain;
1324 struct named_label_use_list *uses;
1325 struct named_label_list *labels;
1326 for (labels = named_labels; labels; labels = labels->next)
1327 if (labels->binding_level == current_binding_level)
1330 if (current_binding_level->is_try_scope)
1331 labels->in_try_scope = 1;
1332 if (current_binding_level->is_catch_scope)
1333 labels->in_catch_scope = 1;
1334 for (decl = labels->names_in_scope; decl;
1335 decl = TREE_CHAIN (decl))
1336 if (decl_jump_unsafe (decl))
1337 labels->bad_decls = tree_cons (NULL_TREE, decl,
1339 labels->binding_level = level_chain;
1340 labels->names_in_scope = level_chain->names;
1343 for (uses = named_label_uses; uses; uses = uses->next)
1344 if (uses->binding_level == current_binding_level)
1346 uses->binding_level = level_chain;
1347 uses->names_in_scope = level_chain->names;
1352 /* Get the decls in the order they were written.
1353 Usually current_binding_level->names is in reverse order.
1354 But parameter decls were previously put in forward order. */
1357 current_binding_level->names
1358 = decls = nreverse (current_binding_level->names);
1360 decls = current_binding_level->names;
1362 /* Output any nested inline functions within this block
1363 if they weren't already output. */
1364 for (decl = decls; decl; decl = TREE_CHAIN (decl))
1365 if (TREE_CODE (decl) == FUNCTION_DECL
1366 && ! TREE_ASM_WRITTEN (decl)
1367 && DECL_INITIAL (decl) != NULL_TREE
1368 && TREE_ADDRESSABLE (decl)
1369 && decl_function_context (decl) == current_function_decl)
1371 /* If this decl was copied from a file-scope decl
1372 on account of a block-scope extern decl,
1373 propagate TREE_ADDRESSABLE to the file-scope decl. */
1374 if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE)
1375 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
1378 push_function_context ();
1379 output_inline_function (decl);
1380 pop_function_context ();
1384 /* When not in function-at-a-time mode, expand_end_bindings will
1385 warn about unused variables. But, in function-at-a-time mode
1386 expand_end_bindings is not passed the list of variables in the
1387 current scope, and therefore no warning is emitted. So, we
1388 explicitly warn here. */
1389 if (!processing_template_decl)
1390 warn_about_unused_variables (getdecls ());
1392 /* If there were any declarations or structure tags in that level,
1393 or if this level is a function body,
1394 create a BLOCK to record them for the life of this function. */
1396 if (keep == 1 || functionbody)
1397 block = make_node (BLOCK);
1398 if (block != NULL_TREE)
1400 BLOCK_VARS (block) = decls;
1401 BLOCK_SUBBLOCKS (block) = subblocks;
1404 /* In each subblock, record that this is its superior. */
1406 for (link = subblocks; link; link = TREE_CHAIN (link))
1407 BLOCK_SUPERCONTEXT (link) = block;
1409 /* We still support the old for-scope rules, whereby the variables
1410 in a for-init statement were in scope after the for-statement
1411 ended. We only use the new rules in flag_new_for_scope is
1414 = current_binding_level->is_for_scope && flag_new_for_scope == 1;
1416 /* Remove declarations for all the DECLs in this level. */
1417 for (link = decls; link; link = TREE_CHAIN (link))
1419 if (leaving_for_scope && TREE_CODE (link) == VAR_DECL
1420 && DECL_NAME (link))
1423 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link)));
1427 ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link));
1429 ns_binding = NULL_TREE;
1432 && (BINDING_LEVEL (outer_binding)
1433 == current_binding_level->level_chain))
1434 /* We have something like:
1439 and we are leaving the `for' scope. There's no reason to
1440 keep the binding of the inner `i' in this case. */
1441 pop_binding (DECL_NAME (link), link);
1442 else if ((outer_binding
1443 && (TREE_CODE (BINDING_VALUE (outer_binding))
1446 && TREE_CODE (ns_binding) == TYPE_DECL))
1447 /* Here, we have something like:
1455 We must pop the for-scope binding so we know what's a
1456 type and what isn't. */
1457 pop_binding (DECL_NAME (link), link);
1460 /* Mark this VAR_DECL as dead so that we can tell we left it
1461 there only for backward compatibility. */
1462 DECL_DEAD_FOR_LOCAL (link) = 1;
1464 /* Keep track of what should of have happenned when we
1465 popped the binding. */
1466 if (outer_binding && BINDING_VALUE (outer_binding))
1467 DECL_SHADOWED_FOR_VAR (link)
1468 = BINDING_VALUE (outer_binding);
1470 /* Add it to the list of dead variables in the next
1471 outermost binding to that we can remove these when we
1472 leave that binding. */
1473 current_binding_level->level_chain->dead_vars_from_for
1474 = tree_cons (NULL_TREE, link,
1475 current_binding_level->level_chain->
1476 dead_vars_from_for);
1478 /* Although we don't pop the CPLUS_BINDING, we do clear
1479 its BINDING_LEVEL since the level is going away now. */
1480 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link)))
1486 /* Remove the binding. */
1488 if (TREE_CODE (decl) == TREE_LIST)
1489 decl = TREE_VALUE (decl);
1491 pop_binding (DECL_NAME (decl), decl);
1492 else if (TREE_CODE (decl) == OVERLOAD)
1493 pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl);
1499 /* Remove declarations for any `for' variables from inner scopes
1500 that we kept around. */
1501 for (link = current_binding_level->dead_vars_from_for;
1502 link; link = TREE_CHAIN (link))
1503 pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));
1505 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1506 for (link = current_binding_level->type_shadowed;
1507 link; link = TREE_CHAIN (link))
1508 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));
1510 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1511 for (link = current_binding_level->shadowed_labels;
1513 link = TREE_CHAIN (link))
1514 pop_label (TREE_VALUE (link), TREE_PURPOSE (link));
1516 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1517 list if a `using' declaration put them there. The debugging
1518 back-ends won't understand OVERLOAD, so we remove them here.
1519 Because the BLOCK_VARS are (temporarily) shared with
1520 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1521 popped all the bindings. */
1526 for (d = &BLOCK_VARS (block); *d; )
1528 if (TREE_CODE (*d) == TREE_LIST)
1529 *d = TREE_CHAIN (*d);
1531 d = &TREE_CHAIN (*d);
1535 /* If the level being exited is the top level of a function,
1536 check over all the labels. */
1539 /* Since this is the top level block of a function, the vars are
1540 the function's parameters. Don't leave them in the BLOCK
1541 because they are found in the FUNCTION_DECL instead. */
1542 BLOCK_VARS (block) = 0;
1546 tmp = current_binding_level->keep;
1548 pop_binding_level ();
1550 DECL_INITIAL (current_function_decl) = block;
1552 current_binding_level->blocks
1553 = chainon (current_binding_level->blocks, block);
1555 /* If we did not make a block for the level just exited,
1556 any blocks made for inner levels
1557 (since they cannot be recorded as subblocks in that level)
1558 must be carried forward so they will later become subblocks
1559 of something else. */
1561 current_binding_level->blocks
1562 = chainon (current_binding_level->blocks, subblocks);
1564 /* Each and every BLOCK node created here in `poplevel' is important
1565 (e.g. for proper debugging information) so if we created one
1566 earlier, mark it as "used". */
1568 TREE_USED (block) = 1;
1570 /* Take care of compiler's internal binding structures. */
1576 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1579 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts)) = block;
1580 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts)) = block;
1583 block = poplevel (keep, reverse, functionbody);
1589 /* Delete the node BLOCK from the current binding level.
1590 This is used for the block inside a stmt expr ({...})
1591 so that the block can be reinserted where appropriate. */
1594 delete_block (block)
1598 if (current_binding_level->blocks == block)
1599 current_binding_level->blocks = TREE_CHAIN (block);
1600 for (t = current_binding_level->blocks; t;)
1602 if (TREE_CHAIN (t) == block)
1603 TREE_CHAIN (t) = TREE_CHAIN (block);
1607 TREE_CHAIN (block) = NULL_TREE;
1608 /* Clear TREE_USED which is always set by poplevel.
1609 The flag is set again if insert_block is called. */
1610 TREE_USED (block) = 0;
1613 /* Insert BLOCK at the end of the list of subblocks of the
1614 current binding level. This is used when a BIND_EXPR is expanded,
1615 to handle the BLOCK node inside the BIND_EXPR. */
1618 insert_block (block)
1621 TREE_USED (block) = 1;
1622 current_binding_level->blocks
1623 = chainon (current_binding_level->blocks, block);
1626 /* Set the BLOCK node for the innermost scope
1627 (the one we are currently in). */
1631 tree block ATTRIBUTE_UNUSED;
1633 /* The RTL expansion machinery requires us to provide this callback,
1634 but it is not applicable in function-at-a-time mode. */
1635 my_friendly_assert (cfun && !doing_semantic_analysis_p (), 20000911);
1638 /* Do a pushlevel for class declarations. */
1643 register struct binding_level *newlevel;
1645 /* Reuse or create a struct for this binding level. */
1646 #if defined(DEBUG_CP_BINDING_LEVELS)
1648 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1649 if (free_binding_level)
1650 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1652 newlevel = free_binding_level;
1653 free_binding_level = free_binding_level->level_chain;
1656 newlevel = make_binding_level ();
1658 #if defined(DEBUG_CP_BINDING_LEVELS)
1660 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1662 push_binding_level (newlevel, 0, 0);
1664 class_binding_level = current_binding_level;
1665 class_binding_level->parm_flag = 2;
1666 class_binding_level->this_class = current_class_type;
1669 /* ...and a poplevel for class declarations. */
1674 register struct binding_level *level = class_binding_level;
1677 my_friendly_assert (level != 0, 354);
1679 /* If we're leaving a toplevel class, don't bother to do the setting
1680 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1681 shouldn't even be used when current_class_type isn't set, and second,
1682 if we don't touch it here, we're able to use the cache effect if the
1683 next time we're entering a class scope, it is the same class. */
1684 if (current_class_depth != 1)
1686 struct binding_level* b;
1688 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1689 for (shadowed = level->class_shadowed;
1691 shadowed = TREE_CHAIN (shadowed))
1692 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = NULL_TREE;
1694 /* Find the next enclosing class, and recreate
1695 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1696 b = level->level_chain;
1697 while (b && b->parm_flag != 2)
1701 for (shadowed = b->class_shadowed;
1703 shadowed = TREE_CHAIN (shadowed))
1707 t = IDENTIFIER_BINDING (TREE_PURPOSE (shadowed));
1708 while (t && BINDING_LEVEL (t) != b)
1712 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed))
1713 = BINDING_VALUE (t);
1717 /* Remember to save what IDENTIFIER's were bound in this scope so we
1718 can recover from cache misses. */
1720 previous_class_type = current_class_type;
1721 previous_class_values = class_binding_level->class_shadowed;
1723 for (shadowed = level->type_shadowed;
1725 shadowed = TREE_CHAIN (shadowed))
1726 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
1728 /* Remove the bindings for all of the class-level declarations. */
1729 for (shadowed = level->class_shadowed;
1731 shadowed = TREE_CHAIN (shadowed))
1732 pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed));
1734 /* Now, pop out of the binding level which we created up in the
1735 `pushlevel_class' routine. */
1736 #if defined(DEBUG_CP_BINDING_LEVELS)
1738 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1740 pop_binding_level ();
1743 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1744 for any names in enclosing classes. */
1747 clear_identifier_class_values ()
1751 if (!class_binding_level)
1754 for (t = class_binding_level->class_shadowed;
1757 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
1760 /* Returns non-zero if T is a virtual function table. */
1763 vtable_decl_p (t, data)
1765 void *data ATTRIBUTE_UNUSED;
1767 return (TREE_CODE (t) == VAR_DECL && DECL_VIRTUAL_P (t));
1770 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1774 vtype_decl_p (t, data)
1776 void *data ATTRIBUTE_UNUSED;
1778 return (TREE_CODE (t) == TYPE_DECL
1779 && TREE_CODE (TREE_TYPE (t)) == RECORD_TYPE
1780 && TYPE_POLYMORPHIC_P (TREE_TYPE (t)));
1783 /* Return the declarations that are members of the namespace NS. */
1786 cp_namespace_decls (ns)
1789 return NAMESPACE_LEVEL (ns)->names;
1792 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1793 itself, calling F for each. The DATA is passed to F as well. */
1796 walk_namespaces_r (namespace, f, data)
1798 walk_namespaces_fn f;
1804 result |= (*f) (namespace, data);
1806 for (current = cp_namespace_decls (namespace);
1808 current = TREE_CHAIN (current))
1810 if (TREE_CODE (current) != NAMESPACE_DECL
1811 || DECL_NAMESPACE_ALIAS (current))
1814 /* We found a namespace. */
1815 result |= walk_namespaces_r (current, f, data);
1821 /* Walk all the namespaces, calling F for each. The DATA is passed to
1825 walk_namespaces (f, data)
1826 walk_namespaces_fn f;
1829 return walk_namespaces_r (global_namespace, f, data);
1832 struct walk_globals_data {
1833 walk_globals_pred p;
1838 /* Walk the global declarations in NAMESPACE. Whenever one is found
1839 for which P returns non-zero, call F with its address. If any call
1840 to F returns a non-zero value, return a non-zero value. */
1843 walk_globals_r (namespace, data)
1847 struct walk_globals_data* wgd = (struct walk_globals_data *) data;
1848 walk_globals_pred p = wgd->p;
1849 walk_globals_fn f = wgd->f;
1850 void *d = wgd->data;
1854 t = &NAMESPACE_LEVEL (namespace)->names;
1861 result |= (*f) (t, d);
1863 /* If F changed *T, then *T still points at the next item to
1866 t = &TREE_CHAIN (*t);
1872 /* Walk the global declarations. Whenever one is found for which P
1873 returns non-zero, call F with its address. If any call to F
1874 returns a non-zero value, return a non-zero value. */
1877 walk_globals (p, f, data)
1878 walk_globals_pred p;
1882 struct walk_globals_data wgd;
1887 return walk_namespaces (walk_globals_r, &wgd);
1890 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1891 DATA is non-NULL, this is the last time we will call
1892 wrapup_global_declarations for this NAMESPACE. */
1895 wrapup_globals_for_namespace (namespace, data)
1899 tree globals = cp_namespace_decls (namespace);
1900 int len = list_length (globals);
1901 tree *vec = (tree *) alloca (sizeof (tree) * len);
1905 int last_time = (data != 0);
1907 if (last_time && namespace == global_namespace)
1908 /* Let compile_file handle the global namespace. */
1911 /* Process the decls in reverse order--earliest first.
1912 Put them into VEC from back to front, then take out from front. */
1913 for (i = 0, decl = globals; i < len; i++, decl = TREE_CHAIN (decl))
1914 vec[len - i - 1] = decl;
1918 check_global_declarations (vec, len);
1922 /* Temporarily mark vtables as external. That prevents
1923 wrapup_global_declarations from writing them out; we must process
1924 them ourselves in finish_vtable_vardecl. */
1925 for (i = 0; i < len; ++i)
1926 if (vtable_decl_p (vec[i], /*data=*/0) && !DECL_EXTERNAL (vec[i]))
1928 DECL_NOT_REALLY_EXTERN (vec[i]) = 1;
1929 DECL_EXTERNAL (vec[i]) = 1;
1932 /* Write out any globals that need to be output. */
1933 result = wrapup_global_declarations (vec, len);
1935 /* Undo the hack to DECL_EXTERNAL above. */
1936 for (i = 0; i < len; ++i)
1937 if (vtable_decl_p (vec[i], /*data=*/0)
1938 && DECL_NOT_REALLY_EXTERN (vec[i]))
1940 DECL_NOT_REALLY_EXTERN (vec[i]) = 0;
1941 DECL_EXTERNAL (vec[i]) = 0;
1948 /* Mark ARG (which is really a struct binding_level **) for GC. */
1951 mark_binding_level (arg)
1954 struct binding_level *lvl = *(struct binding_level **)arg;
1956 for (; lvl; lvl = lvl->level_chain)
1958 ggc_mark_tree (lvl->names);
1959 ggc_mark_tree (lvl->tags);
1960 ggc_mark_tree (lvl->usings);
1961 ggc_mark_tree (lvl->using_directives);
1962 ggc_mark_tree (lvl->class_shadowed);
1963 ggc_mark_tree (lvl->type_shadowed);
1964 ggc_mark_tree (lvl->shadowed_labels);
1965 ggc_mark_tree (lvl->blocks);
1966 ggc_mark_tree (lvl->this_class);
1967 ggc_mark_tree (lvl->dead_vars_from_for);
1972 mark_named_label_lists (labs, uses)
1976 struct named_label_list *l = *(struct named_label_list **)labs;
1977 struct named_label_use_list *u = *(struct named_label_use_list **)uses;
1979 for (; l; l = l->next)
1982 mark_binding_level (l->binding_level);
1983 ggc_mark_tree (l->old_value);
1984 ggc_mark_tree (l->label_decl);
1985 ggc_mark_tree (l->bad_decls);
1988 for (; u; u = u->next)
1992 /* For debugging. */
1993 static int no_print_functions = 0;
1994 static int no_print_builtins = 0;
1997 print_binding_level (lvl)
1998 struct binding_level *lvl;
2002 fprintf (stderr, " blocks=");
2003 fprintf (stderr, HOST_PTR_PRINTF_FORMAT, HOST_PTR_PRINTF_TYPE lvl->blocks);
2004 if (lvl->tag_transparent)
2005 fprintf (stderr, " tag-transparent");
2006 if (lvl->more_cleanups_ok)
2007 fprintf (stderr, " more-cleanups-ok");
2008 if (lvl->have_cleanups)
2009 fprintf (stderr, " have-cleanups");
2010 fprintf (stderr, "\n");
2013 fprintf (stderr, " names:\t");
2014 /* We can probably fit 3 names to a line? */
2015 for (t = lvl->names; t; t = TREE_CHAIN (t))
2017 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
2019 if (no_print_builtins
2020 && (TREE_CODE (t) == TYPE_DECL)
2021 && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>")))
2024 /* Function decls tend to have longer names. */
2025 if (TREE_CODE (t) == FUNCTION_DECL)
2032 fprintf (stderr, "\n\t");
2035 print_node_brief (stderr, "", t, 0);
2036 if (t == error_mark_node)
2040 fprintf (stderr, "\n");
2044 fprintf (stderr, " tags:\t");
2046 for (t = lvl->tags; t; t = TREE_CHAIN (t))
2048 if (TREE_PURPOSE (t) == NULL_TREE)
2050 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
2057 fprintf (stderr, "\n\t");
2060 if (TREE_PURPOSE (t) == NULL_TREE)
2062 print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0);
2063 fprintf (stderr, ">");
2065 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
2066 print_node_brief (stderr, "", TREE_VALUE (t), 0);
2069 print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0);
2070 print_node_brief (stderr, "", TREE_VALUE (t), 0);
2071 fprintf (stderr, ">");
2075 fprintf (stderr, "\n");
2077 if (lvl->class_shadowed)
2079 fprintf (stderr, " class-shadowed:");
2080 for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t))
2082 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
2084 fprintf (stderr, "\n");
2086 if (lvl->type_shadowed)
2088 fprintf (stderr, " type-shadowed:");
2089 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
2091 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
2093 fprintf (stderr, "\n");
2098 print_other_binding_stack (stack)
2099 struct binding_level *stack;
2101 struct binding_level *level;
2102 for (level = stack; level != global_binding_level; level = level->level_chain)
2104 fprintf (stderr, "binding level ");
2105 fprintf (stderr, HOST_PTR_PRINTF_FORMAT, HOST_PTR_PRINTF_TYPE level);
2106 fprintf (stderr, "\n");
2107 print_binding_level (level);
2112 print_binding_stack ()
2114 struct binding_level *b;
2115 fprintf (stderr, "current_binding_level=");
2116 fprintf (stderr, HOST_PTR_PRINTF_FORMAT, HOST_PTR_PRINTF_TYPE current_binding_level);
2117 fprintf (stderr, "\nclass_binding_level=");
2118 fprintf (stderr, HOST_PTR_PRINTF_FORMAT, HOST_PTR_PRINTF_TYPE class_binding_level);
2119 fprintf (stderr, "\nglobal_binding_level=");
2120 fprintf (stderr, HOST_PTR_PRINTF_FORMAT, HOST_PTR_PRINTF_TYPE global_binding_level);
2121 fprintf (stderr, "\n");
2122 if (class_binding_level)
2124 for (b = class_binding_level; b; b = b->level_chain)
2125 if (b == current_binding_level)
2128 b = class_binding_level;
2130 b = current_binding_level;
2133 b = current_binding_level;
2134 print_other_binding_stack (b);
2135 fprintf (stderr, "global:\n");
2136 print_binding_level (global_binding_level);
2139 /* Namespace binding access routines: The namespace_bindings field of
2140 the identifier is polymorphic, with three possible values:
2141 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2142 indicating the BINDING_VALUE of global_namespace. */
2144 /* Check whether the a binding for the name to scope is known.
2145 Assumes that the bindings of the name are already a list
2146 of bindings. Returns the binding found, or NULL_TREE. */
2149 find_binding (name, scope)
2153 tree iter, prev = NULL_TREE;
2155 scope = ORIGINAL_NAMESPACE (scope);
2157 for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter;
2158 iter = TREE_CHAIN (iter))
2160 my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374);
2161 if (BINDING_SCOPE (iter) == scope)
2163 /* Move binding found to the front of the list, so
2164 subsequent lookups will find it faster. */
2167 TREE_CHAIN (prev) = TREE_CHAIN (iter);
2168 TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name);
2169 IDENTIFIER_NAMESPACE_BINDINGS (name) = iter;
2178 /* Always returns a binding for name in scope. If the
2179 namespace_bindings is not a list, convert it to one first.
2180 If no binding is found, make a new one. */
2183 binding_for_name (name, scope)
2187 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2190 scope = ORIGINAL_NAMESPACE (scope);
2192 if (b && TREE_CODE (b) != CPLUS_BINDING)
2194 /* Get rid of optimization for global scope. */
2195 IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE;
2196 BINDING_VALUE (binding_for_name (name, global_namespace)) = b;
2197 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2199 if (b && (result = find_binding (name, scope)))
2201 /* Not found, make a new one. */
2202 result = make_node (CPLUS_BINDING);
2203 TREE_CHAIN (result) = b;
2204 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
2205 BINDING_SCOPE (result) = scope;
2206 BINDING_TYPE (result) = NULL_TREE;
2207 BINDING_VALUE (result) = NULL_TREE;
2211 /* Return the binding value for name in scope, considering that
2212 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2215 namespace_binding (name, scope)
2219 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2222 if (scope == NULL_TREE)
2223 scope = global_namespace;
2224 if (TREE_CODE (b) != CPLUS_BINDING)
2225 return (scope == global_namespace) ? b : NULL_TREE;
2226 name = find_binding (name,scope);
2227 if (name == NULL_TREE)
2229 return BINDING_VALUE (name);
2232 /* Set the binding value for name in scope. If modifying the binding
2233 of global_namespace is attempted, try to optimize it. */
2236 set_namespace_binding (name, scope, val)
2243 if (scope == NULL_TREE)
2244 scope = global_namespace;
2246 if (scope == global_namespace)
2248 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2249 if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING)
2251 IDENTIFIER_NAMESPACE_BINDINGS (name) = val;
2255 b = binding_for_name (name, scope);
2256 BINDING_VALUE (b) = val;
2259 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2260 select a name that is unique to this compilation unit. */
2263 push_namespace (name)
2268 int implicit_use = 0;
2270 if (!global_namespace)
2272 /* This must be ::. */
2273 my_friendly_assert (name == get_identifier ("::"), 377);
2278 /* The name of anonymous namespace is unique for the translation
2280 if (!anonymous_namespace_name)
2281 anonymous_namespace_name = get_file_function_name ('N');
2282 name = anonymous_namespace_name;
2283 d = IDENTIFIER_NAMESPACE_VALUE (name);
2285 /* Reopening anonymous namespace. */
2291 /* Check whether this is an extended namespace definition. */
2292 d = IDENTIFIER_NAMESPACE_VALUE (name);
2293 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2296 if (DECL_NAMESPACE_ALIAS (d))
2298 error ("namespace alias `%D' not allowed here, assuming `%D'",
2299 d, DECL_NAMESPACE_ALIAS (d));
2300 d = DECL_NAMESPACE_ALIAS (d);
2307 /* Make a new namespace, binding the name to it. */
2308 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2309 /* The global namespace is not pushed, and the global binding
2310 level is set elsewhere. */
2313 DECL_CONTEXT (d) = FROB_CONTEXT (current_namespace);
2316 declare_namespace_level ();
2317 NAMESPACE_LEVEL (d) = current_binding_level;
2321 resume_binding_level (NAMESPACE_LEVEL (d));
2324 do_using_directive (d);
2325 /* Enter the name space. */
2326 current_namespace = d;
2329 /* Pop from the scope of the current namespace. */
2334 my_friendly_assert (current_namespace != global_namespace, 20010801);
2335 current_namespace = CP_DECL_CONTEXT (current_namespace);
2336 /* The binding level is not popped, as it might be re-opened later. */
2337 suspend_binding_level ();
2340 /* Push into the scope of the namespace NS, even if it is deeply
2341 nested within another namespace. */
2344 push_nested_namespace (ns)
2347 if (ns == global_namespace)
2348 push_to_top_level ();
2351 push_nested_namespace (CP_DECL_CONTEXT (ns));
2352 push_namespace (DECL_NAME (ns));
2356 /* Pop back from the scope of the namespace NS, which was previously
2357 entered with push_nested_namespace. */
2360 pop_nested_namespace (ns)
2363 while (ns != global_namespace)
2366 ns = CP_DECL_CONTEXT (ns);
2369 pop_from_top_level ();
2373 /* Subroutines for reverting temporarily to top-level for instantiation
2374 of templates and such. We actually need to clear out the class- and
2375 local-value slots of all identifiers, so that only the global values
2376 are at all visible. Simply setting current_binding_level to the global
2377 scope isn't enough, because more binding levels may be pushed. */
2378 struct saved_scope *scope_chain;
2380 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2383 mark_saved_scope (arg)
2386 struct saved_scope *t = *(struct saved_scope **)arg;
2389 mark_binding_level (&t->class_bindings);
2390 ggc_mark_tree (t->old_bindings);
2391 ggc_mark_tree (t->old_namespace);
2392 ggc_mark_tree (t->decl_ns_list);
2393 ggc_mark_tree (t->class_name);
2394 ggc_mark_tree (t->class_type);
2395 ggc_mark_tree (t->access_specifier);
2396 ggc_mark_tree (t->function_decl);
2398 ggc_mark_tree_varray (t->lang_base);
2399 ggc_mark_tree (t->lang_name);
2400 ggc_mark_tree (t->template_parms);
2401 ggc_mark_tree (t->x_previous_class_type);
2402 ggc_mark_tree (t->x_previous_class_values);
2403 ggc_mark_tree (t->x_saved_tree);
2404 ggc_mark_tree (t->lookups);
2406 mark_stmt_tree (&t->x_stmt_tree);
2407 mark_binding_level (&t->bindings);
2413 store_bindings (names, old_bindings)
2414 tree names, old_bindings;
2417 tree search_bindings = old_bindings;
2419 for (t = names; t; t = TREE_CHAIN (t))
2421 tree binding, t1, id;
2423 if (TREE_CODE (t) == TREE_LIST)
2424 id = TREE_PURPOSE (t);
2429 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2430 we have no IDENTIFIER_BINDING if we have left the class
2431 scope, but cached the class-level declarations. */
2432 || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2435 for (t1 = search_bindings; t1; t1 = TREE_CHAIN (t1))
2436 if (TREE_VEC_ELT (t1, 0) == id)
2439 my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2440 binding = make_tree_vec (4);
2441 TREE_VEC_ELT (binding, 0) = id;
2442 TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2443 TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2444 TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2445 IDENTIFIER_BINDING (id) = NULL_TREE;
2446 IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2447 TREE_CHAIN (binding) = old_bindings;
2448 old_bindings = binding;
2452 return old_bindings;
2456 maybe_push_to_top_level (pseudo)
2459 struct saved_scope *s;
2460 struct binding_level *b;
2464 s = (struct saved_scope *) xcalloc (1, sizeof (struct saved_scope));
2466 b = scope_chain ? current_binding_level : 0;
2468 /* If we're in the middle of some function, save our state. */
2472 push_function_context_to (NULL_TREE);
2477 old_bindings = NULL_TREE;
2478 if (scope_chain && previous_class_type)
2479 old_bindings = store_bindings (previous_class_values, old_bindings);
2481 /* Have to include global_binding_level, because class-level decls
2482 aren't listed anywhere useful. */
2483 for (; b; b = b->level_chain)
2487 /* Template IDs are inserted into the global level. If they were
2488 inserted into namespace level, finish_file wouldn't find them
2489 when doing pending instantiations. Therefore, don't stop at
2490 namespace level, but continue until :: . */
2491 if (b == global_binding_level || (pseudo && b->template_parms_p))
2494 old_bindings = store_bindings (b->names, old_bindings);
2495 /* We also need to check class_shadowed to save class-level type
2496 bindings, since pushclass doesn't fill in b->names. */
2497 if (b->parm_flag == 2)
2498 old_bindings = store_bindings (b->class_shadowed, old_bindings);
2500 /* Unwind type-value slots back to top level. */
2501 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2502 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2504 s->prev = scope_chain;
2505 s->old_bindings = old_bindings;
2507 s->need_pop_function_context = need_pop;
2508 s->function_decl = current_function_decl;
2509 s->last_parms = last_function_parms;
2512 current_function_decl = NULL_TREE;
2513 VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base");
2514 current_lang_name = lang_name_cplusplus;
2515 current_namespace = global_namespace;
2519 push_to_top_level ()
2521 maybe_push_to_top_level (0);
2525 pop_from_top_level ()
2527 struct saved_scope *s = scope_chain;
2530 /* Clear out class-level bindings cache. */
2531 if (previous_class_type)
2532 invalidate_class_lookup_cache ();
2534 VARRAY_FREE (current_lang_base);
2536 scope_chain = s->prev;
2537 for (t = s->old_bindings; t; t = TREE_CHAIN (t))
2539 tree id = TREE_VEC_ELT (t, 0);
2541 SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2542 IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2543 IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2546 /* If we were in the middle of compiling a function, restore our
2548 if (s->need_pop_function_context)
2549 pop_function_context_from (NULL_TREE);
2550 current_function_decl = s->function_decl;
2551 last_function_parms = s->last_parms;
2556 /* Push a definition of struct, union or enum tag "name".
2557 into binding_level "b". "type" should be the type node,
2558 We assume that the tag "name" is not already defined.
2560 Note that the definition may really be just a forward reference.
2561 In that case, the TYPE_SIZE will be a NULL_TREE.
2563 C++ gratuitously puts all these tags in the name space. */
2565 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2566 record the shadowed value for this binding contour. TYPE is
2567 the type that ID maps to. */
2570 set_identifier_type_value_with_scope (id, type, b)
2573 struct binding_level *b;
2575 if (!b->namespace_p)
2577 /* Shadow the marker, not the real thing, so that the marker
2578 gets restored later. */
2579 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2581 = tree_cons (id, old_type_value, b->type_shadowed);
2585 tree binding = binding_for_name (id, current_namespace);
2586 BINDING_TYPE (binding) = type;
2587 /* Store marker instead of real type. */
2588 type = global_type_node;
2590 SET_IDENTIFIER_TYPE_VALUE (id, type);
2593 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2596 set_identifier_type_value (id, type)
2600 set_identifier_type_value_with_scope (id, type, current_binding_level);
2603 /* Return the type associated with id. */
2606 identifier_type_value (id)
2609 /* There is no type with that name, anywhere. */
2610 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2612 /* This is not the type marker, but the real thing. */
2613 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2614 return REAL_IDENTIFIER_TYPE_VALUE (id);
2615 /* Have to search for it. It must be on the global level, now.
2616 Ask lookup_name not to return non-types. */
2617 id = lookup_name_real (id, 2, 1, 0);
2619 return TREE_TYPE (id);
2623 /* Pop off extraneous binding levels left over due to syntax errors.
2625 We don't pop past namespaces, as they might be valid. */
2630 #ifdef DEBUG_CP_BINDING_LEVELS
2631 fprintf (stderr, "XXX entering pop_everything ()\n");
2633 while (!toplevel_bindings_p ())
2635 if (current_binding_level->parm_flag == 2)
2636 pop_nested_class ();
2640 #ifdef DEBUG_CP_BINDING_LEVELS
2641 fprintf (stderr, "XXX leaving pop_everything ()\n");
2645 /* The type TYPE is being declared. If it is a class template, or a
2646 specialization of a class template, do any processing required and
2647 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2648 being declared a friend. B is the binding level at which this TYPE
2651 Returns the TYPE_DECL for TYPE, which may have been altered by this
2655 maybe_process_template_type_declaration (type, globalize, b)
2658 struct binding_level* b;
2660 tree decl = TYPE_NAME (type);
2662 if (processing_template_parmlist)
2663 /* You can't declare a new template type in a template parameter
2664 list. But, you can declare a non-template type:
2666 template <class A*> struct S;
2668 is a forward-declaration of `A'. */
2672 maybe_check_template_type (type);
2674 my_friendly_assert (IS_AGGR_TYPE (type)
2675 || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2678 if (processing_template_decl)
2680 /* This may change after the call to
2681 push_template_decl_real, but we want the original value. */
2682 tree name = DECL_NAME (decl);
2684 decl = push_template_decl_real (decl, globalize);
2685 /* If the current binding level is the binding level for the
2686 template parameters (see the comment in
2687 begin_template_parm_list) and the enclosing level is a class
2688 scope, and we're not looking at a friend, push the
2689 declaration of the member class into the class scope. In the
2690 friend case, push_template_decl will already have put the
2691 friend into global scope, if appropriate. */
2692 if (TREE_CODE (type) != ENUMERAL_TYPE
2693 && !globalize && b->template_parms_p
2694 && b->level_chain->parm_flag == 2)
2696 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2697 /* Put this tag on the list of tags for the class, since
2698 that won't happen below because B is not the class
2699 binding level, but is instead the pseudo-global level. */
2700 b->level_chain->tags =
2701 tree_cons (name, type, b->level_chain->tags);
2702 if (!COMPLETE_TYPE_P (current_class_type))
2703 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2711 /* In C++, you don't have to write `struct S' to refer to `S'; you
2712 can just use `S'. We accomplish this by creating a TYPE_DECL as
2713 if the user had written `typedef struct S S'. Create and return
2714 the TYPE_DECL for TYPE. */
2717 create_implicit_typedef (name, type)
2723 decl = build_decl (TYPE_DECL, name, type);
2724 DECL_ARTIFICIAL (decl) = 1;
2725 /* There are other implicit type declarations, like the one *within*
2726 a class that allows you to write `S::S'. We must distinguish
2728 SET_DECL_IMPLICIT_TYPEDEF_P (decl);
2729 TYPE_NAME (type) = decl;
2734 /* Remember a local name for name-mangling purposes. */
2737 push_local_name (decl)
2744 VARRAY_TREE_INIT (local_names, 8, "local_names");
2746 name = DECL_NAME (decl);
2748 nelts = VARRAY_ACTIVE_SIZE (local_names);
2749 for (i = 0; i < nelts; i++)
2751 t = VARRAY_TREE (local_names, i);
2752 if (DECL_NAME (t) == name)
2754 if (!DECL_LANG_SPECIFIC (decl))
2755 retrofit_lang_decl (decl);
2756 if (DECL_LANG_SPECIFIC (t))
2757 DECL_DISCRIMINATOR (decl) = DECL_DISCRIMINATOR (t) + 1;
2759 DECL_DISCRIMINATOR (decl) = 1;
2761 VARRAY_TREE (local_names, i) = decl;
2766 VARRAY_PUSH_TREE (local_names, decl);
2769 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2770 Normally put it into the inner-most non-tag-transparent scope,
2771 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2772 The latter is needed for implicit declarations. */
2775 pushtag (name, type, globalize)
2779 register struct binding_level *b;
2781 b = current_binding_level;
2782 while (b->tag_transparent
2783 || (b->parm_flag == 2
2785 /* We may be defining a new type in the initializer
2786 of a static member variable. We allow this when
2787 not pedantic, and it is particularly useful for
2788 type punning via an anonymous union. */
2789 || COMPLETE_TYPE_P (b->this_class))))
2792 b->tags = tree_cons (name, type, b->tags);
2796 /* Do C++ gratuitous typedefing. */
2797 if (IDENTIFIER_TYPE_VALUE (name) != type)
2799 register tree d = NULL_TREE;
2801 tree context = TYPE_CONTEXT (type);
2805 tree cs = current_scope ();
2809 else if (cs != NULL_TREE && TYPE_P (cs))
2810 /* When declaring a friend class of a local class, we want
2811 to inject the newly named class into the scope
2812 containing the local class, not the namespace scope. */
2813 context = decl_function_context (get_type_decl (cs));
2816 context = current_namespace;
2818 if ((b->template_parms_p && b->level_chain->parm_flag == 2)
2819 || b->parm_flag == 2)
2822 if (current_lang_name == lang_name_java)
2823 TYPE_FOR_JAVA (type) = 1;
2825 d = create_implicit_typedef (name, type);
2826 DECL_CONTEXT (d) = FROB_CONTEXT (context);
2828 set_identifier_type_value_with_scope (name, type, b);
2830 d = maybe_process_template_type_declaration (type,
2833 if (b->parm_flag == 2)
2835 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2836 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2837 class. But if it's a member template class, we
2838 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2840 finish_member_declaration (d);
2842 pushdecl_class_level (d);
2845 d = pushdecl_with_scope (d, b);
2847 /* FIXME what if it gets a name from typedef? */
2848 if (ANON_AGGRNAME_P (name))
2849 DECL_IGNORED_P (d) = 1;
2851 TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2853 /* If this is a local class, keep track of it. We need this
2854 information for name-mangling, and so that it is possible to find
2855 all function definitions in a translation unit in a convenient
2856 way. (It's otherwise tricky to find a member function definition
2857 it's only pointed to from within a local class.) */
2858 if (TYPE_CONTEXT (type)
2859 && TREE_CODE (TYPE_CONTEXT (type)) == FUNCTION_DECL
2860 && !processing_template_decl)
2861 VARRAY_PUSH_TREE (local_classes, type);
2863 if (b->parm_flag == 2)
2865 if (!COMPLETE_TYPE_P (current_class_type))
2866 CLASSTYPE_TAGS (current_class_type) = b->tags;
2870 if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2871 /* Use the canonical TYPE_DECL for this node. */
2872 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2875 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2876 will be the tagged type we just added to the current
2877 binding level. This fake NULL-named TYPE_DECL node helps
2878 dwarfout.c to know when it needs to output a
2879 representation of a tagged type, and it also gives us a
2880 convenient place to record the "scope start" address for
2883 tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2884 TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2888 /* Counter used to create anonymous type names. */
2890 static int anon_cnt = 0;
2892 /* Return an IDENTIFIER which can be used as a name for
2893 anonymous structs and unions. */
2900 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2901 return get_identifier (buf);
2904 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2905 This keeps dbxout from getting confused. */
2910 register struct binding_level *b;
2912 static int last_cnt = 0;
2914 /* Fast out if no new anon names were declared. */
2915 if (last_cnt == anon_cnt)
2918 b = current_binding_level;
2919 while (b->tag_transparent)
2924 /* A NULL purpose means we have already processed all tags
2925 from here to the end of the list. */
2926 if (TREE_PURPOSE (tags) == NULL_TREE)
2928 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2929 TREE_PURPOSE (tags) = NULL_TREE;
2930 tags = TREE_CHAIN (tags);
2932 last_cnt = anon_cnt;
2935 /* Subroutine of duplicate_decls: return truthvalue of whether
2936 or not types of these decls match.
2938 For C++, we must compare the parameter list so that `int' can match
2939 `int&' in a parameter position, but `int&' is not confused with
2943 decls_match (newdecl, olddecl)
2944 tree newdecl, olddecl;
2948 if (newdecl == olddecl)
2951 if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
2952 /* If the two DECLs are not even the same kind of thing, we're not
2953 interested in their types. */
2956 if (TREE_CODE (newdecl) == FUNCTION_DECL)
2958 tree f1 = TREE_TYPE (newdecl);
2959 tree f2 = TREE_TYPE (olddecl);
2960 tree p1 = TYPE_ARG_TYPES (f1);
2961 tree p2 = TYPE_ARG_TYPES (f2);
2963 if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)
2964 && ! (DECL_EXTERN_C_P (newdecl)
2965 && DECL_EXTERN_C_P (olddecl)))
2968 if (TREE_CODE (f1) != TREE_CODE (f2))
2971 if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
2973 if (p2 == NULL_TREE && DECL_EXTERN_C_P (olddecl)
2974 && (DECL_BUILT_IN (olddecl)
2975 #ifndef NO_IMPLICIT_EXTERN_C
2976 || (DECL_IN_SYSTEM_HEADER (newdecl) && !DECL_CLASS_SCOPE_P (newdecl))
2977 || (DECL_IN_SYSTEM_HEADER (olddecl) && !DECL_CLASS_SCOPE_P (olddecl))
2981 types_match = self_promoting_args_p (p1);
2982 if (p1 == void_list_node)
2983 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2985 #ifndef NO_IMPLICIT_EXTERN_C
2986 else if (p1 == NULL_TREE
2987 && (DECL_EXTERN_C_P (olddecl)
2988 && DECL_IN_SYSTEM_HEADER (olddecl)
2989 && !DECL_CLASS_SCOPE_P (olddecl))
2990 && (DECL_EXTERN_C_P (newdecl)
2991 && DECL_IN_SYSTEM_HEADER (newdecl)
2992 && !DECL_CLASS_SCOPE_P (newdecl)))
2994 types_match = self_promoting_args_p (p2);
2995 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2999 types_match = compparms (p1, p2);
3004 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3006 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3007 DECL_TEMPLATE_PARMS (olddecl)))
3010 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl))
3011 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)))
3014 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3017 types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
3018 DECL_TEMPLATE_RESULT (newdecl));
3022 if (TREE_TYPE (newdecl) == error_mark_node)
3023 types_match = TREE_TYPE (olddecl) == error_mark_node;
3024 else if (TREE_TYPE (olddecl) == NULL_TREE)
3025 types_match = TREE_TYPE (newdecl) == NULL_TREE;
3026 else if (TREE_TYPE (newdecl) == NULL_TREE)
3029 types_match = comptypes (TREE_TYPE (newdecl),
3030 TREE_TYPE (olddecl),
3031 COMPARE_REDECLARATION);
3037 /* If NEWDECL is `static' and an `extern' was seen previously,
3038 warn about it. OLDDECL is the previous declaration.
3040 Note that this does not apply to the C++ case of declaring
3041 a variable `extern const' and then later `const'.
3043 Don't complain about built-in functions, since they are beyond
3044 the user's control. */
3047 warn_extern_redeclared_static (newdecl, olddecl)
3048 tree newdecl, olddecl;
3050 static const char *const explicit_extern_static_warning
3051 = "`%D' was declared `extern' and later `static'";
3052 static const char *const implicit_extern_static_warning
3053 = "`%D' was declared implicitly `extern' and later `static'";
3057 if (TREE_CODE (newdecl) == TYPE_DECL
3058 || TREE_CODE (newdecl) == TEMPLATE_DECL
3059 || TREE_CODE (newdecl) == CONST_DECL)
3062 /* Don't get confused by static member functions; that's a different
3064 if (TREE_CODE (newdecl) == FUNCTION_DECL
3065 && DECL_STATIC_FUNCTION_P (newdecl))
3068 /* If the old declaration was `static', or the new one isn't, then
3069 then everything is OK. */
3070 if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl))
3073 /* It's OK to declare a builtin function as `static'. */
3074 if (TREE_CODE (olddecl) == FUNCTION_DECL
3075 && DECL_ARTIFICIAL (olddecl))
3078 name = DECL_ASSEMBLER_NAME (newdecl);
3079 pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
3080 ? implicit_extern_static_warning
3081 : explicit_extern_static_warning, newdecl);
3082 cp_pedwarn_at ("previous declaration of `%D'", olddecl);
3085 /* Handle when a new declaration NEWDECL has the same name as an old
3086 one OLDDECL in the same binding contour. Prints an error message
3089 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3090 Otherwise, return 0. */
3093 duplicate_decls (newdecl, olddecl)
3094 tree newdecl, olddecl;
3096 unsigned olddecl_uid = DECL_UID (olddecl);
3097 int olddecl_friend = 0, types_match = 0;
3098 int new_defines_function = 0;
3100 if (newdecl == olddecl)
3103 types_match = decls_match (newdecl, olddecl);
3105 /* If either the type of the new decl or the type of the old decl is an
3106 error_mark_node, then that implies that we have already issued an
3107 error (earlier) for some bogus type specification, and in that case,
3108 it is rather pointless to harass the user with yet more error message
3109 about the same declaration, so just pretend the types match here. */
3110 if (TREE_TYPE (newdecl) == error_mark_node
3111 || TREE_TYPE (olddecl) == error_mark_node)
3114 if (DECL_P (olddecl)
3115 && TREE_CODE (newdecl) == FUNCTION_DECL
3116 && TREE_CODE (olddecl) == FUNCTION_DECL
3117 && (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl)))
3119 if (DECL_DECLARED_INLINE_P (newdecl)
3120 && DECL_UNINLINABLE (newdecl)
3121 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl)))
3122 /* Already warned elsewhere. */;
3123 else if (DECL_DECLARED_INLINE_P (olddecl)
3124 && DECL_UNINLINABLE (olddecl)
3125 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
3126 /* Already warned. */;
3127 else if (DECL_DECLARED_INLINE_P (newdecl)
3128 && DECL_UNINLINABLE (olddecl)
3129 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
3131 warning_with_decl (newdecl,
3132 "function `%s' redeclared as inline");
3133 warning_with_decl (olddecl,
3134 "previous declaration of function `%s' with attribute noinline");
3136 else if (DECL_DECLARED_INLINE_P (olddecl)
3137 && DECL_UNINLINABLE (newdecl)
3138 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl)))
3140 warning_with_decl (newdecl,
3141 "function `%s' redeclared with attribute noinline");
3142 warning_with_decl (olddecl,
3143 "previous declaration of function `%s' was inline");
3147 /* Check for redeclaration and other discrepancies. */
3148 if (TREE_CODE (olddecl) == FUNCTION_DECL
3149 && DECL_ARTIFICIAL (olddecl))
3151 if (TREE_CODE (newdecl) != FUNCTION_DECL)
3153 /* Avoid warnings redeclaring anticipated built-ins. */
3154 if (DECL_ANTICIPATED (olddecl))
3157 /* If you declare a built-in or predefined function name as static,
3158 the old definition is overridden, but optionally warn this was a
3159 bad choice of name. */
3160 if (! TREE_PUBLIC (newdecl))
3163 warning ("shadowing %s function `%#D'",
3164 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3166 /* Discard the old built-in function. */
3169 /* If the built-in is not ansi, then programs can override
3170 it even globally without an error. */
3171 else if (! DECL_BUILT_IN (olddecl))
3172 warning ("library function `%#D' redeclared as non-function `%#D'",
3176 error ("declaration of `%#D'", newdecl);
3177 error ("conflicts with built-in declaration `%#D'",
3182 else if (!types_match)
3184 /* Avoid warnings redeclaring anticipated built-ins. */
3185 if (DECL_ANTICIPATED (olddecl))
3186 ; /* Do nothing yet. */
3187 else if ((DECL_EXTERN_C_P (newdecl)
3188 && DECL_EXTERN_C_P (olddecl))
3189 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3190 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3192 /* A near match; override the builtin. */
3194 if (TREE_PUBLIC (newdecl))
3196 warning ("new declaration `%#D'", newdecl);
3197 warning ("ambiguates built-in declaration `%#D'",
3200 else if (warn_shadow)
3201 warning ("shadowing %s function `%#D'",
3202 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3206 /* Discard the old built-in function. */
3209 /* Replace the old RTL to avoid problems with inlining. */
3210 SET_DECL_RTL (olddecl, DECL_RTL (newdecl));
3213 if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl))
3215 /* If a builtin function is redeclared as `static', merge
3216 the declarations, but make the original one static. */
3217 DECL_THIS_STATIC (olddecl) = 1;
3218 TREE_PUBLIC (olddecl) = 0;
3220 /* Make the old declaration consistent with the new one so
3221 that all remnants of the builtin-ness of this function
3222 will be banished. */
3223 SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl));
3224 SET_DECL_RTL (olddecl, DECL_RTL (newdecl));
3227 else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
3229 if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
3230 && TREE_CODE (newdecl) != TYPE_DECL
3231 && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
3232 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
3233 || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
3234 && TREE_CODE (olddecl) != TYPE_DECL
3235 && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
3236 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
3239 /* We do nothing special here, because C++ does such nasty
3240 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3241 get shadowed, and know that if we need to find a TYPE_DECL
3242 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3243 slot of the identifier. */
3247 if ((TREE_CODE (newdecl) == FUNCTION_DECL
3248 && DECL_FUNCTION_TEMPLATE_P (olddecl))
3249 || (TREE_CODE (olddecl) == FUNCTION_DECL
3250 && DECL_FUNCTION_TEMPLATE_P (newdecl)))
3253 error ("`%#D' redeclared as different kind of symbol", newdecl);
3254 if (TREE_CODE (olddecl) == TREE_LIST)
3255 olddecl = TREE_VALUE (olddecl);
3256 cp_error_at ("previous declaration of `%#D'", olddecl);
3258 /* New decl is completely inconsistent with the old one =>
3259 tell caller to replace the old one. */
3263 else if (!types_match)
3265 if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl))
3266 /* These are certainly not duplicate declarations; they're
3267 from different scopes. */
3270 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3272 /* The name of a class template may not be declared to refer to
3273 any other template, class, function, object, namespace, value,
3274 or type in the same scope. */
3275 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
3276 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3278 error ("declaration of template `%#D'", newdecl);
3279 cp_error_at ("conflicts with previous declaration `%#D'",
3282 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
3283 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
3284 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
3285 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
3286 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3287 DECL_TEMPLATE_PARMS (olddecl)))
3289 error ("new declaration `%#D'", newdecl);
3290 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3294 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3296 if (DECL_EXTERN_C_P (newdecl) && DECL_EXTERN_C_P (olddecl))
3298 error ("declaration of C function `%#D' conflicts with",
3300 cp_error_at ("previous declaration `%#D' here", olddecl);
3302 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3303 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3305 error ("new declaration `%#D'", newdecl);
3306 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3312 /* Already complained about this, so don't do so again. */
3313 else if (current_class_type == NULL_TREE
3314 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
3316 error ("conflicting types for `%#D'", newdecl);
3317 cp_error_at ("previous declaration as `%#D'", olddecl);
3320 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3321 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3322 && (!DECL_TEMPLATE_INFO (newdecl)
3323 || (DECL_TI_TEMPLATE (newdecl)
3324 != DECL_TI_TEMPLATE (olddecl))))
3325 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3326 && (!DECL_TEMPLATE_INFO (olddecl)
3327 || (DECL_TI_TEMPLATE (olddecl)
3328 != DECL_TI_TEMPLATE (newdecl))))))
3329 /* It's OK to have a template specialization and a non-template
3330 with the same type, or to have specializations of two
3331 different templates with the same type. Note that if one is a
3332 specialization, and the other is an instantiation of the same
3333 template, that we do not exit at this point. That situation
3334 can occur if we instantiate a template class, and then
3335 specialize one of its methods. This situation is legal, but
3336 the declarations must be merged in the usual way. */
3338 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3339 && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3340 && !DECL_USE_TEMPLATE (newdecl))
3341 || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3342 && !DECL_USE_TEMPLATE (olddecl))))
3343 /* One of the declarations is a template instantiation, and the
3344 other is not a template at all. That's OK. */
3346 else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3347 && DECL_NAMESPACE_ALIAS (newdecl)
3348 && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3349 /* Redeclaration of namespace alias, ignore it. */
3353 const char *errmsg = redeclaration_error_message (newdecl, olddecl);
3356 error (errmsg, newdecl);
3357 if (DECL_NAME (olddecl) != NULL_TREE)
3358 cp_error_at ((DECL_INITIAL (olddecl)
3359 && namespace_bindings_p ())
3360 ? "`%#D' previously defined here"
3361 : "`%#D' previously declared here", olddecl);
3364 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3365 && DECL_INITIAL (olddecl) != NULL_TREE
3366 && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3367 && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3369 /* Prototype decl follows defn w/o prototype. */
3370 cp_warning_at ("prototype for `%#D'", newdecl);
3371 cp_warning_at ("follows non-prototype definition here", olddecl);
3373 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3374 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3376 /* extern "C" int foo ();
3377 int foo () { bar (); }
3379 if (current_lang_depth () == 0)
3380 SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl));
3383 cp_error_at ("previous declaration of `%#D' with %L linkage",
3384 olddecl, DECL_LANGUAGE (olddecl));
3385 error ("conflicts with new declaration with %L linkage",
3386 DECL_LANGUAGE (newdecl));
3390 if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3392 else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3394 tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3395 tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3398 if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3399 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3401 for (; t1 && t1 != void_list_node;
3402 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3403 if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3405 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3408 pedwarn ("default argument given for parameter %d of `%#D'",
3410 cp_pedwarn_at ("after previous specification in `%#D'",
3415 error ("default argument given for parameter %d of `%#D'",
3417 cp_error_at ("after previous specification in `%#D'",
3422 if (DECL_DECLARED_INLINE_P (newdecl)
3423 && ! DECL_DECLARED_INLINE_P (olddecl)
3424 && TREE_ADDRESSABLE (olddecl) && warn_inline)
3426 warning ("`%#D' was used before it was declared inline",
3428 cp_warning_at ("previous non-inline declaration here",
3434 /* Do not merge an implicit typedef with an explicit one. In:
3438 typedef class A A __attribute__ ((foo));
3440 the attribute should apply only to the typedef. */
3441 if (TREE_CODE (olddecl) == TYPE_DECL
3442 && (DECL_IMPLICIT_TYPEDEF_P (olddecl)
3443 || DECL_IMPLICIT_TYPEDEF_P (newdecl)))
3446 /* If new decl is `static' and an `extern' was seen previously,
3448 warn_extern_redeclared_static (newdecl, olddecl);
3450 /* We have committed to returning 1 at this point. */
3451 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3453 /* Now that functions must hold information normally held
3454 by field decls, there is extra work to do so that
3455 declaration information does not get destroyed during
3457 if (DECL_VINDEX (olddecl))
3458 DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3459 if (DECL_VIRTUAL_CONTEXT (olddecl))
3460 DECL_VIRTUAL_CONTEXT (newdecl) = DECL_VIRTUAL_CONTEXT (olddecl);
3461 if (DECL_CONTEXT (olddecl))
3462 DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3463 if (DECL_PENDING_INLINE_INFO (newdecl) == 0)
3464 DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3465 DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3466 DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3467 DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl);
3468 DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3469 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3470 DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl);
3471 if (DECL_OVERLOADED_OPERATOR_P (olddecl) != ERROR_MARK)
3472 SET_OVERLOADED_OPERATOR_CODE
3473 (newdecl, DECL_OVERLOADED_OPERATOR_P (olddecl));
3474 new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3476 /* Optionally warn about more than one declaration for the same
3477 name, but don't warn about a function declaration followed by a
3479 if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3480 && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3481 /* Don't warn about extern decl followed by definition. */
3482 && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3483 /* Don't warn about friends, let add_friend take care of it. */
3484 && ! (DECL_FRIEND_P (newdecl) || DECL_FRIEND_P (olddecl)))
3486 warning ("redundant redeclaration of `%D' in same scope", newdecl);
3487 cp_warning_at ("previous declaration of `%D'", olddecl);
3491 /* Deal with C++: must preserve virtual function table size. */
3492 if (TREE_CODE (olddecl) == TYPE_DECL)
3494 register tree newtype = TREE_TYPE (newdecl);
3495 register tree oldtype = TREE_TYPE (olddecl);
3497 if (newtype != error_mark_node && oldtype != error_mark_node
3498 && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3500 CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype);
3501 CLASSTYPE_FRIEND_CLASSES (newtype)
3502 = CLASSTYPE_FRIEND_CLASSES (oldtype);
3505 DECL_ORIGINAL_TYPE (newdecl) = DECL_ORIGINAL_TYPE (olddecl);
3508 /* Copy all the DECL_... slots specified in the new decl
3509 except for any that we copy here from the old type. */
3510 DECL_ATTRIBUTES (newdecl)
3511 = (*targetm.merge_decl_attributes) (olddecl, newdecl);
3512 decl_attributes (&newdecl, DECL_ATTRIBUTES (newdecl), 0);
3514 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3516 TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3517 DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3518 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3519 DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3521 /* If the new declaration is a definition, update the file and
3522 line information on the declaration. */
3523 if (DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)) == NULL_TREE
3524 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl)) != NULL_TREE)
3526 DECL_SOURCE_LINE (olddecl)
3527 = DECL_SOURCE_LINE (DECL_TEMPLATE_RESULT (olddecl))
3528 = DECL_SOURCE_LINE (newdecl);
3529 DECL_SOURCE_FILE (olddecl)
3530 = DECL_SOURCE_FILE (DECL_TEMPLATE_RESULT (olddecl))
3531 = DECL_SOURCE_FILE (newdecl);
3539 /* Automatically handles default parameters. */
3540 tree oldtype = TREE_TYPE (olddecl);
3543 /* Merge the data types specified in the two decls. */
3544 newtype = merge_types (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3546 /* If merge_types produces a non-typedef type, just use the old type. */
3547 if (TREE_CODE (newdecl) == TYPE_DECL
3548 && newtype == DECL_ORIGINAL_TYPE (newdecl))
3551 if (TREE_CODE (newdecl) == VAR_DECL)
3552 DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3553 /* Do this after calling `merge_types' so that default
3554 parameters don't confuse us. */
3555 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3556 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3557 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3559 TREE_TYPE (newdecl) = build_exception_variant (newtype,
3560 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3561 TREE_TYPE (olddecl) = build_exception_variant (newtype,
3562 TYPE_RAISES_EXCEPTIONS (oldtype));
3564 if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3565 && DECL_SOURCE_LINE (olddecl) != 0
3567 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)),
3568 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1))
3570 error ("declaration of `%F' throws different exceptions",
3572 cp_error_at ("than previous declaration `%F'", olddecl);
3575 TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3577 /* Lay the type out, unless already done. */
3578 if (! same_type_p (newtype, oldtype)
3579 && TREE_TYPE (newdecl) != error_mark_node
3580 && !(processing_template_decl && uses_template_parms (newdecl)))
3581 layout_type (TREE_TYPE (newdecl));
3583 if ((TREE_CODE (newdecl) == VAR_DECL
3584 || TREE_CODE (newdecl) == PARM_DECL
3585 || TREE_CODE (newdecl) == RESULT_DECL
3586 || TREE_CODE (newdecl) == FIELD_DECL
3587 || TREE_CODE (newdecl) == TYPE_DECL)
3588 && !(processing_template_decl && uses_template_parms (newdecl)))
3589 layout_decl (newdecl, 0);
3591 /* Merge the type qualifiers. */
3592 if (TREE_READONLY (newdecl))
3593 TREE_READONLY (olddecl) = 1;
3594 if (TREE_THIS_VOLATILE (newdecl))
3595 TREE_THIS_VOLATILE (olddecl) = 1;
3597 /* Merge the initialization information. */
3598 if (DECL_INITIAL (newdecl) == NULL_TREE
3599 && DECL_INITIAL (olddecl) != NULL_TREE)
3601 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3602 DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
3603 DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
3604 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl)
3605 && DECL_LANG_SPECIFIC (newdecl)
3606 && DECL_LANG_SPECIFIC (olddecl))
3607 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3610 /* Merge the section attribute.
3611 We want to issue an error if the sections conflict but that must be
3612 done later in decl_attributes since we are called before attributes
3614 if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3615 DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3617 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3619 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl)
3620 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl);
3621 DECL_NO_LIMIT_STACK (newdecl)
3622 |= DECL_NO_LIMIT_STACK (olddecl);
3623 /* Keep the old RTL. */
3624 COPY_DECL_RTL (olddecl, newdecl);
3626 else if (TREE_CODE (newdecl) == VAR_DECL
3627 && (DECL_SIZE (olddecl) || !DECL_SIZE (newdecl)))
3629 /* Keep the old RTL. We cannot keep the old RTL if the old
3630 declaration was for an incomplete object and the new
3631 declaration is not since many attributes of the RTL will
3633 COPY_DECL_RTL (olddecl, newdecl);
3636 /* If cannot merge, then use the new type and qualifiers,
3637 and don't preserve the old rtl. */
3640 /* Clean out any memory we had of the old declaration. */
3641 tree oldstatic = value_member (olddecl, static_aggregates);
3643 TREE_VALUE (oldstatic) = error_mark_node;
3645 TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3646 TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3647 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3648 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3651 /* Merge the storage class information. */
3652 merge_weak (newdecl, olddecl);
3654 DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3655 DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl);
3656 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3657 TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3658 if (! DECL_EXTERNAL (olddecl))
3659 DECL_EXTERNAL (newdecl) = 0;
3661 if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3663 DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3664 DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3665 DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3666 DECL_TEMPLATE_INSTANTIATED (newdecl)
3667 |= DECL_TEMPLATE_INSTANTIATED (olddecl);
3668 /* Don't really know how much of the language-specific
3669 values we should copy from old to new. */
3670 DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3671 DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl);
3672 DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3673 DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3674 DECL_INITIALIZED_IN_CLASS_P (newdecl)
3675 |= DECL_INITIALIZED_IN_CLASS_P (olddecl);
3676 olddecl_friend = DECL_FRIEND_P (olddecl);
3678 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3679 if (TREE_CODE (newdecl) == FUNCTION_DECL
3680 || DECL_FUNCTION_TEMPLATE_P (newdecl))
3681 DECL_BEFRIENDING_CLASSES (newdecl)
3682 = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
3683 DECL_BEFRIENDING_CLASSES (olddecl));
3686 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3688 if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3689 && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3691 /* If newdecl is not a specialization, then it is not a
3692 template-related function at all. And that means that we
3693 shoud have exited above, returning 0. */
3694 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3697 if (TREE_USED (olddecl))
3698 /* From [temp.expl.spec]:
3700 If a template, a member template or the member of a class
3701 template is explicitly specialized then that
3702 specialization shall be declared before the first use of
3703 that specialization that would cause an implicit
3704 instantiation to take place, in every translation unit in
3705 which such a use occurs. */
3706 error ("explicit specialization of %D after first use",
3709 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3711 DECL_DECLARED_INLINE_P (newdecl) |= DECL_DECLARED_INLINE_P (olddecl);
3713 /* If either decl says `inline', this fn is inline, unless its
3714 definition was passed already. */
3715 if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3716 DECL_INLINE (olddecl) = 1;
3717 DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3719 DECL_UNINLINABLE (newdecl) = DECL_UNINLINABLE (olddecl)
3720 = (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl));
3722 /* Preserve abstractness on cloned [cd]tors. */
3723 DECL_ABSTRACT (newdecl) = DECL_ABSTRACT (olddecl);
3727 SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl));
3728 COPY_DECL_ASSEMBLER_NAME (newdecl, olddecl);
3729 SET_DECL_RTL (olddecl, DECL_RTL (newdecl));
3731 if (! types_match || new_defines_function)
3733 /* These need to be copied so that the names are available.
3734 Note that if the types do match, we'll preserve inline
3735 info and other bits, but if not, we won't. */
3736 DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3737 DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3739 if (new_defines_function)
3740 /* If defining a function declared with other language
3741 linkage, use the previously declared language linkage. */
3742 SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl));
3743 else if (types_match)
3745 /* If redeclaring a builtin function, and not a definition,
3746 it stays built in. */
3747 if (DECL_BUILT_IN (olddecl))
3749 DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl);
3750 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3751 /* If we're keeping the built-in definition, keep the rtl,
3752 regardless of declaration matches. */
3753 SET_DECL_RTL (newdecl, DECL_RTL (olddecl));
3756 DECL_NUM_STMTS (newdecl) = DECL_NUM_STMTS (olddecl);
3758 DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3759 /* Don't clear out the arguments if we're redefining a function. */
3760 if (DECL_ARGUMENTS (olddecl))
3761 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3764 else if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3765 NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3767 /* Now preserve various other info from the definition. */
3768 TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3769 TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3770 DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3771 COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl);
3773 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3777 function_size = sizeof (struct tree_decl);
3779 memcpy ((char *) olddecl + sizeof (struct tree_common),
3780 (char *) newdecl + sizeof (struct tree_common),
3781 function_size - sizeof (struct tree_common));
3783 if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3785 /* If newdecl is a template instantiation, it is possible that
3786 the following sequence of events has occurred:
3788 o A friend function was declared in a class template. The
3789 class template was instantiated.
3791 o The instantiation of the friend declaration was
3792 recorded on the instantiation list, and is newdecl.
3794 o Later, however, instantiate_class_template called pushdecl
3795 on the newdecl to perform name injection. But, pushdecl in
3796 turn called duplicate_decls when it discovered that another
3797 declaration of a global function with the same name already
3800 o Here, in duplicate_decls, we decided to clobber newdecl.
3802 If we're going to do that, we'd better make sure that
3803 olddecl, and not newdecl, is on the list of
3804 instantiations so that if we try to do the instantiation
3805 again we won't get the clobbered declaration. */
3807 tree tmpl = DECL_TI_TEMPLATE (newdecl);
3808 tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3810 for (; decls; decls = TREE_CHAIN (decls))
3811 if (TREE_VALUE (decls) == newdecl)
3812 TREE_VALUE (decls) = olddecl;
3817 memcpy ((char *) olddecl + sizeof (struct tree_common),
3818 (char *) newdecl + sizeof (struct tree_common),
3819 sizeof (struct tree_decl) - sizeof (struct tree_common)
3820 + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *));
3823 DECL_UID (olddecl) = olddecl_uid;
3825 DECL_FRIEND_P (olddecl) = 1;
3827 /* NEWDECL contains the merged attribute lists.
3828 Update OLDDECL to be the same. */
3829 DECL_ATTRIBUTES (olddecl) = DECL_ATTRIBUTES (newdecl);
3834 /* Record a decl-node X as belonging to the current lexical scope.
3835 Check for errors (such as an incompatible declaration for the same
3836 name already seen in the same scope).
3838 Returns either X or an old decl for the same name.
3839 If an old decl is returned, it may have been smashed
3840 to agree with what X says. */
3848 int need_new_binding;
3850 /* We shouldn't be calling pushdecl when we're generating RTL for a
3851 function that we already did semantic analysis on previously. */
3852 my_friendly_assert (!cfun || doing_semantic_analysis_p (),
3855 need_new_binding = 1;
3857 if (DECL_TEMPLATE_PARM_P (x))
3858 /* Template parameters have no context; they are not X::T even
3859 when declared within a class or namespace. */
3863 if (current_function_decl && x != current_function_decl
3864 /* A local declaration for a function doesn't constitute
3866 && !(TREE_CODE (x) == FUNCTION_DECL && !DECL_INITIAL (x))
3867 /* A local declaration for an `extern' variable is in the
3868 scope of the current namespace, not the current
3870 && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
3871 && !DECL_CONTEXT (x))
3872 DECL_CONTEXT (x) = current_function_decl;
3874 /* If this is the declaration for a namespace-scope function,
3875 but the declaration itself is in a local scope, mark the
3877 if (TREE_CODE (x) == FUNCTION_DECL
3878 && DECL_NAMESPACE_SCOPE_P (x)
3879 && current_function_decl
3880 && x != current_function_decl)
3881 DECL_LOCAL_FUNCTION_P (x) = 1;
3884 name = DECL_NAME (x);
3887 int different_binding_level = 0;
3889 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3890 name = TREE_OPERAND (name, 0);
3892 /* In case this decl was explicitly namespace-qualified, look it
3893 up in its namespace context. */
3894 if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x)
3895 && namespace_bindings_p ())
3896 t = namespace_binding (name, DECL_CONTEXT (x));
3898 t = lookup_name_current_level (name);
3900 /* [basic.link] If there is a visible declaration of an entity
3901 with linkage having the same name and type, ignoring entities
3902 declared outside the innermost enclosing namespace scope, the
3903 block scope declaration declares that same entity and
3904 receives the linkage of the previous declaration. */
3905 if (! t && current_function_decl && x != current_function_decl
3906 && (TREE_CODE (x) == FUNCTION_DECL || TREE_CODE (x) == VAR_DECL)
3907 && DECL_EXTERNAL (x))
3909 /* Look in block scope. */
3910 t = IDENTIFIER_VALUE (name);
3911 /* Or in the innermost namespace. */
3913 t = namespace_binding (name, DECL_CONTEXT (x));
3914 /* Does it have linkage? Note that if this isn't a DECL, it's an
3915 OVERLOAD, which is OK. */
3916 if (t && DECL_P (t) && ! (TREE_STATIC (t) || DECL_EXTERNAL (t)))
3919 different_binding_level = 1;
3922 /* If we are declaring a function, and the result of name-lookup
3923 was an OVERLOAD, look for an overloaded instance that is
3924 actually the same as the function we are declaring. (If
3925 there is one, we have to merge our declaration with the
3926 previous declaration.) */
3927 if (t && TREE_CODE (t) == OVERLOAD)
3931 if (TREE_CODE (x) == FUNCTION_DECL)
3932 for (match = t; match; match = OVL_NEXT (match))
3934 if (decls_match (OVL_CURRENT (match), x))
3938 /* Just choose one. */
3942 t = OVL_CURRENT (match);
3947 if (t == error_mark_node)
3949 /* error_mark_node is 0 for a while during initialization! */
3951 cp_error_at ("`%#D' used prior to declaration", x);
3953 else if (t != NULL_TREE)
3955 if (different_binding_level)
3957 if (decls_match (x, t))
3958 /* The standard only says that the local extern
3959 inherits linkage from the previous decl; in
3960 particular, default args are not shared. It would
3961 be nice to propagate inlining info, though. FIXME. */
3962 TREE_PUBLIC (x) = TREE_PUBLIC (t);
3964 else if (TREE_CODE (t) == PARM_DECL)
3966 if (DECL_CONTEXT (t) == NULL_TREE)
3967 /* This is probaby caused by too many errors, but calling
3968 abort will say that if errors have occurred. */
3971 /* Check for duplicate params. */
3972 if (duplicate_decls (x, t))
3975 else if ((DECL_EXTERN_C_FUNCTION_P (x)
3976 || DECL_FUNCTION_TEMPLATE_P (x))
3977 && is_overloaded_fn (t))
3978 /* Don't do anything just yet. */;
3979 else if (t == wchar_decl_node)
3981 if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3982 pedwarn ("redeclaration of `wchar_t' as `%T'",
3985 /* Throw away the redeclaration. */
3988 else if (TREE_CODE (t) != TREE_CODE (x))
3990 if (duplicate_decls (x, t))
3993 else if (duplicate_decls (x, t))
3995 if (TREE_CODE (t) == TYPE_DECL)
3996 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3997 else if (TREE_CODE (t) == FUNCTION_DECL)
3998 check_default_args (t);
4002 else if (DECL_MAIN_P (x))
4004 /* A redeclaration of main, but not a duplicate of the
4009 This function shall not be overloaded. */
4010 cp_error_at ("invalid redeclaration of `%D'", t);
4011 error ("as `%D'", x);
4012 /* We don't try to push this declaration since that
4018 check_template_shadow (x);
4020 /* If this is a function conjured up by the backend, massage it
4021 so it looks friendly. */
4022 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_LANG_SPECIFIC (x))
4024 retrofit_lang_decl (x);
4025 SET_DECL_LANGUAGE (x, lang_c);
4028 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_FUNCTION_MEMBER_P (x))
4030 t = push_overloaded_decl (x, PUSH_LOCAL);
4033 if (!namespace_bindings_p ())
4034 /* We do not need to create a binding for this name;
4035 push_overloaded_decl will have already done so if
4037 need_new_binding = 0;
4039 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
4041 t = push_overloaded_decl (x, PUSH_GLOBAL);
4043 add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
4047 /* If declaring a type as a typedef, copy the type (unless we're
4048 at line 0), and install this TYPE_DECL as the new type's typedef
4049 name. See the extensive comment in ../c-decl.c (pushdecl). */
4050 if (TREE_CODE (x) == TYPE_DECL)
4052 tree type = TREE_TYPE (x);
4053 if (DECL_SOURCE_LINE (x) == 0)
4055 if (TYPE_NAME (type) == 0)
4056 TYPE_NAME (type) = x;
4058 else if (type != error_mark_node && TYPE_NAME (type) != x
4059 /* We don't want to copy the type when all we're
4060 doing is making a TYPE_DECL for the purposes of
4062 && (!TYPE_NAME (type)
4063 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
4065 DECL_ORIGINAL_TYPE (x) = type;
4066 type = build_type_copy (type);
4067 TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
4068 TYPE_NAME (type) = x;
4069 TREE_TYPE (x) = type;
4072 if (type != error_mark_node
4074 && TYPE_IDENTIFIER (type))
4075 set_identifier_type_value_with_scope (DECL_NAME (x), type,
4076 current_binding_level);
4080 /* Multiple external decls of the same identifier ought to match.
4082 We get warnings about inline functions where they are defined.
4083 We get warnings about other functions from push_overloaded_decl.
4085 Avoid duplicate warnings where they are used. */
4086 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
4090 decl = IDENTIFIER_NAMESPACE_VALUE (name);
4091 if (decl && TREE_CODE (decl) == OVERLOAD)
4092 decl = OVL_FUNCTION (decl);
4094 if (decl && decl != error_mark_node
4095 && (DECL_EXTERNAL (decl) || TREE_PUBLIC (decl))
4096 /* If different sort of thing, we already gave an error. */
4097 && TREE_CODE (decl) == TREE_CODE (x)
4098 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
4100 pedwarn ("type mismatch with previous external decl", x);
4101 cp_pedwarn_at ("previous external decl of `%#D'", decl);
4105 /* This name is new in its binding level.
4106 Install the new declaration and return it. */
4107 if (namespace_bindings_p ())
4109 /* Install a global value. */
4111 /* If the first global decl has external linkage,
4112 warn if we later see static one. */
4113 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
4114 TREE_PUBLIC (name) = 1;
4116 /* Bind the name for the entity. */
4117 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
4119 && (TREE_CODE (x) == TYPE_DECL
4120 || TREE_CODE (x) == VAR_DECL
4121 || TREE_CODE (x) == NAMESPACE_DECL
4122 || TREE_CODE (x) == CONST_DECL
4123 || TREE_CODE (x) == TEMPLATE_DECL))
4124 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
4126 /* Don't forget if the function was used via an implicit decl. */
4127 if (IDENTIFIER_IMPLICIT_DECL (name)
4128 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
4131 /* Don't forget if its address was taken in that way. */
4132 if (IDENTIFIER_IMPLICIT_DECL (name)
4133 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
4134 TREE_ADDRESSABLE (x) = 1;
4136 /* Warn about mismatches against previous implicit decl. */
4137 if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
4138 /* If this real decl matches the implicit, don't complain. */
4139 && ! (TREE_CODE (x) == FUNCTION_DECL
4140 && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
4142 ("`%D' was previously implicitly declared to return `int'", x);
4144 /* If new decl is `static' and an `extern' was seen previously,
4146 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
4147 warn_extern_redeclared_static (x, t);
4151 /* Here to install a non-global value. */
4152 tree oldlocal = IDENTIFIER_VALUE (name);
4153 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
4155 if (need_new_binding)
4157 push_local_binding (name, x, 0);
4158 /* Because push_local_binding will hook X on to the
4159 current_binding_level's name list, we don't want to
4160 do that again below. */
4161 need_new_binding = 0;
4164 /* If this is a TYPE_DECL, push it into the type value slot. */
4165 if (TREE_CODE (x) == TYPE_DECL)
4166 set_identifier_type_value_with_scope (name, TREE_TYPE (x),
4167 current_binding_level);
4169 /* Clear out any TYPE_DECL shadowed by a namespace so that
4170 we won't think this is a type. The C struct hack doesn't
4171 go through namespaces. */
4172 if (TREE_CODE (x) == NAMESPACE_DECL)
4173 set_identifier_type_value_with_scope (name, NULL_TREE,
4174 current_binding_level);
4181 && TREE_CODE (oldlocal) == VAR_DECL
4182 && DECL_DEAD_FOR_LOCAL (oldlocal))
4183 oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal);
4185 if (oldlocal == NULL_TREE)
4186 oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d));
4189 /* If this is an extern function declaration, see if we
4190 have a global definition or declaration for the function. */
4191 if (oldlocal == NULL_TREE
4192 && DECL_EXTERNAL (x)
4193 && oldglobal != NULL_TREE
4194 && TREE_CODE (x) == FUNCTION_DECL
4195 && TREE_CODE (oldglobal) == FUNCTION_DECL)
4197 /* We have one. Their types must agree. */
4198 if (decls_match (x, oldglobal))
4202 warning ("extern declaration of `%#D' doesn't match", x);
4203 cp_warning_at ("global declaration `%#D'", oldglobal);
4206 /* If we have a local external declaration,
4207 and no file-scope declaration has yet been seen,
4208 then if we later have a file-scope decl it must not be static. */
4209 if (oldlocal == NULL_TREE
4210 && oldglobal == NULL_TREE
4211 && DECL_EXTERNAL (x)
4213 TREE_PUBLIC (name) = 1;
4215 /* Warn if shadowing an argument at the top level of the body. */
4216 if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
4217 /* Inline decls shadow nothing. */
4218 && !DECL_FROM_INLINE (x)
4219 && TREE_CODE (oldlocal) == PARM_DECL)
4223 /* Don't complain if it's from an enclosing function. */
4224 if (DECL_CONTEXT (oldlocal) == current_function_decl
4225 && TREE_CODE (x) != PARM_DECL)
4227 /* Go to where the parms should be and see if we find
4229 struct binding_level *b = current_binding_level->level_chain;
4232 if (b->parm_flag == 1)
4234 error ("declaration of `%#D' shadows a parameter",
4240 if (warn_shadow && !err)
4241 shadow_warning ("a parameter", name, oldlocal);
4244 /* Maybe warn if shadowing something else. */
4245 else if (warn_shadow && !DECL_EXTERNAL (x)
4246 /* No shadow warnings for internally generated vars. */
4247 && ! DECL_ARTIFICIAL (x)
4248 /* No shadow warnings for vars made for inlining. */
4249 && ! DECL_FROM_INLINE (x))
4251 if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
4252 && current_class_ptr
4253 && !TREE_STATIC (name))
4254 warning ("declaration of `%s' shadows a member of `this'",
4255 IDENTIFIER_POINTER (name));
4256 else if (oldlocal != NULL_TREE
4257 && TREE_CODE (oldlocal) == VAR_DECL)
4258 shadow_warning ("a previous local", name, oldlocal);
4259 else if (oldglobal != NULL_TREE
4260 && TREE_CODE (oldglobal) == VAR_DECL)
4261 /* XXX shadow warnings in outer-more namespaces */
4262 shadow_warning ("a global declaration", name, oldglobal);
4266 if (TREE_CODE (x) == FUNCTION_DECL)
4267 check_default_args (x);
4269 if (TREE_CODE (x) == VAR_DECL)
4270 maybe_register_incomplete_var (x);
4273 if (need_new_binding)
4274 add_decl_to_level (x,
4275 DECL_NAMESPACE_SCOPE_P (x)
4276 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
4277 : current_binding_level);
4282 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4283 caller to set DECL_CONTEXT properly. */
4286 pushdecl_with_scope (x, level)
4288 struct binding_level *level;
4290 register struct binding_level *b;
4291 tree function_decl = current_function_decl;
4293 current_function_decl = NULL_TREE;
4294 if (level->parm_flag == 2)
4296 b = class_binding_level;
4297 class_binding_level = level;
4298 pushdecl_class_level (x);
4299 class_binding_level = b;
4303 b = current_binding_level;
4304 current_binding_level = level;
4306 current_binding_level = b;
4308 current_function_decl = function_decl;
4312 /* Like pushdecl, only it places X in the current namespace,
4316 pushdecl_namespace_level (x)
4319 register struct binding_level *b = current_binding_level;
4322 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
4324 /* Now, the type_shadowed stack may screw us. Munge it so it does
4326 if (TREE_CODE (x) == TYPE_DECL)
4328 tree name = DECL_NAME (x);
4330 tree *ptr = (tree *)0;
4331 for (; b != global_binding_level; b = b->level_chain)
4333 tree shadowed = b->type_shadowed;
4334 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
4335 if (TREE_PURPOSE (shadowed) == name)
4337 ptr = &TREE_VALUE (shadowed);
4338 /* Can't break out of the loop here because sometimes
4339 a binding level will have duplicate bindings for
4340 PT names. It's gross, but I haven't time to fix it. */
4343 newval = TREE_TYPE (x);
4344 if (ptr == (tree *)0)
4346 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4347 up here if this is changed to an assertion. --KR */
4348 SET_IDENTIFIER_TYPE_VALUE (name, newval);
4358 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4362 pushdecl_top_level (x)
4365 push_to_top_level ();
4366 x = pushdecl_namespace_level (x);
4367 pop_from_top_level ();
4371 /* Make the declaration of X appear in CLASS scope. */
4374 pushdecl_class_level (x)
4377 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4378 scope looks for the pre-mangled name. */
4381 if (TREE_CODE (x) == OVERLOAD)
4382 x = OVL_CURRENT (x);
4383 name = DECL_NAME (x);
4387 push_class_level_binding (name, x);
4388 if (TREE_CODE (x) == TYPE_DECL)
4389 set_identifier_type_value (name, TREE_TYPE (x));
4391 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
4395 for (f = TYPE_FIELDS (TREE_TYPE (x));
4398 pushdecl_class_level (f);
4402 /* Enter DECL into the symbol table, if that's appropriate. Returns
4403 DECL, or a modified version thereof. */
4406 maybe_push_decl (decl)
4409 tree type = TREE_TYPE (decl);
4411 /* Add this decl to the current binding level, but not if it comes
4412 from another scope, e.g. a static member variable. TEM may equal
4413 DECL or it may be a previous decl of the same name. */
4414 if (decl == error_mark_node
4415 || (TREE_CODE (decl) != PARM_DECL
4416 && DECL_CONTEXT (decl) != NULL_TREE
4417 /* Definitions of namespace members outside their namespace are
4419 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
4420 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
4421 || TREE_CODE (type) == UNKNOWN_TYPE
4422 /* The declaration of a template specialization does not affect
4423 the functions available for overload resolution, so we do not
4425 || (TREE_CODE (decl) == FUNCTION_DECL
4426 && DECL_TEMPLATE_SPECIALIZATION (decl)))
4429 return pushdecl (decl);
4432 /* Make the declaration(s) of X appear in CLASS scope
4433 under the name NAME. */
4436 push_class_level_binding (name, x)
4441 /* The class_binding_level will be NULL if x is a template
4442 parameter name in a member template. */
4443 if (!class_binding_level)
4446 /* Make sure that this new member does not have the same name
4447 as a template parameter. */
4448 if (TYPE_BEING_DEFINED (current_class_type))
4449 check_template_shadow (x);
4451 /* If this declaration shadows a declaration from an enclosing
4452 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4453 we leave this class. Record the shadowed declaration here. */
4454 binding = IDENTIFIER_BINDING (name);
4456 && ((TREE_CODE (x) == OVERLOAD
4457 && BINDING_VALUE (binding)
4458 && is_overloaded_fn (BINDING_VALUE (binding)))
4459 || INHERITED_VALUE_BINDING_P (binding)))
4464 /* If the old binding was from a base class, and was for a tag
4465 name, slide it over to make room for the new binding. The
4466 old binding is still visible if explicitly qualified with a
4468 if (INHERITED_VALUE_BINDING_P (binding)
4469 && BINDING_VALUE (binding)
4470 && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
4471 && DECL_ARTIFICIAL (BINDING_VALUE (binding))
4472 && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
4474 old_decl = BINDING_TYPE (binding);
4475 BINDING_TYPE (binding) = BINDING_VALUE (binding);
4476 BINDING_VALUE (binding) = NULL_TREE;
4477 INHERITED_VALUE_BINDING_P (binding) = 0;
4480 old_decl = BINDING_VALUE (binding);
4482 /* Find the previous binding of name on the class-shadowed
4483 list, and update it. */
4484 for (shadow = class_binding_level->class_shadowed;
4486 shadow = TREE_CHAIN (shadow))
4487 if (TREE_PURPOSE (shadow) == name
4488 && TREE_TYPE (shadow) == old_decl)
4490 BINDING_VALUE (binding) = x;
4491 INHERITED_VALUE_BINDING_P (binding) = 0;
4492 TREE_TYPE (shadow) = x;
4493 IDENTIFIER_CLASS_VALUE (name) = x;
4498 /* If we didn't replace an existing binding, put the binding on the
4499 stack of bindings for the identifier, and update the shadowed list. */
4500 if (push_class_binding (name, x))
4502 class_binding_level->class_shadowed
4503 = tree_cons (name, NULL,
4504 class_binding_level->class_shadowed);
4505 /* Record the value we are binding NAME to so that we can know
4506 what to pop later. */
4507 TREE_TYPE (class_binding_level->class_shadowed) = x;
4511 /* Insert another USING_DECL into the current binding level, returning
4512 this declaration. If this is a redeclaration, do nothing, and
4513 return NULL_TREE if this not in namespace scope (in namespace
4514 scope, a using decl might extend any previous bindings). */
4517 push_using_decl (scope, name)
4523 my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4524 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4525 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4526 if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4529 return namespace_bindings_p () ? decl : NULL_TREE;
4530 decl = build_lang_decl (USING_DECL, name, void_type_node);
4531 DECL_INITIAL (decl) = scope;
4532 TREE_CHAIN (decl) = current_binding_level->usings;
4533 current_binding_level->usings = decl;
4537 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4538 changed (i.e. there was already a directive), or the fresh
4539 TREE_LIST otherwise. */
4542 push_using_directive (used)
4545 tree ud = current_binding_level->using_directives;
4546 tree iter, ancestor;
4548 /* Check if we already have this. */
4549 if (purpose_member (used, ud) != NULL_TREE)
4552 /* Recursively add all namespaces used. */
4553 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4554 push_using_directive (TREE_PURPOSE (iter));
4556 ancestor = namespace_ancestor (current_decl_namespace (), used);
4557 ud = current_binding_level->using_directives;
4558 ud = tree_cons (used, ancestor, ud);
4559 current_binding_level->using_directives = ud;
4563 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4564 other definitions already in place. We get around this by making
4565 the value of the identifier point to a list of all the things that
4566 want to be referenced by that name. It is then up to the users of
4567 that name to decide what to do with that list.
4569 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4570 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4572 FLAGS is a bitwise-or of the following values:
4573 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4575 PUSH_USING: DECL is being pushed as the result of a using
4578 The value returned may be a previous declaration if we guessed wrong
4579 about what language DECL should belong to (C or C++). Otherwise,
4580 it's always DECL (and never something that's not a _DECL). */
4583 push_overloaded_decl (decl, flags)
4587 tree name = DECL_NAME (decl);
4590 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4593 old = namespace_binding (name, DECL_CONTEXT (decl));
4595 old = lookup_name_current_level (name);
4599 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4601 tree t = TREE_TYPE (old);
4602 if (IS_AGGR_TYPE (t) && warn_shadow
4603 && (! DECL_IN_SYSTEM_HEADER (decl)
4604 || ! DECL_IN_SYSTEM_HEADER (old)))
4605 warning ("`%#D' hides constructor for `%#T'", decl, t);
4608 else if (is_overloaded_fn (old))
4612 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4614 tree fn = OVL_CURRENT (tmp);
4616 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4617 && !(flags & PUSH_USING)
4618 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4619 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4620 error ("`%#D' conflicts with previous using declaration `%#D'",
4623 if (duplicate_decls (decl, fn))
4627 else if (old == error_mark_node)
4628 /* Ignore the undefined symbol marker. */
4632 cp_error_at ("previous non-function declaration `%#D'", old);
4633 error ("conflicts with function declaration `%#D'", decl);
4638 if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4640 if (old && TREE_CODE (old) != OVERLOAD)
4641 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4643 new_binding = ovl_cons (decl, old);
4644 if (flags & PUSH_USING)
4645 OVL_USED (new_binding) = 1;
4648 /* NAME is not ambiguous. */
4652 set_namespace_binding (name, current_namespace, new_binding);
4655 /* We only create an OVERLOAD if there was a previous binding at
4656 this level, or if decl is a template. In the former case, we
4657 need to remove the old binding and replace it with the new
4658 binding. We must also run through the NAMES on the binding
4659 level where the name was bound to update the chain. */
4661 if (TREE_CODE (new_binding) == OVERLOAD && old)
4665 for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4667 d = &TREE_CHAIN (*d))
4669 || (TREE_CODE (*d) == TREE_LIST
4670 && TREE_VALUE (*d) == old))
4672 if (TREE_CODE (*d) == TREE_LIST)
4673 /* Just replace the old binding with the new. */
4674 TREE_VALUE (*d) = new_binding;
4676 /* Build a TREE_LIST to wrap the OVERLOAD. */
4677 *d = tree_cons (NULL_TREE, new_binding,
4680 /* And update the CPLUS_BINDING node. */
4681 BINDING_VALUE (IDENTIFIER_BINDING (name))
4686 /* We should always find a previous binding in this case. */
4690 /* Install the new binding. */
4691 push_local_binding (name, new_binding, flags);
4697 /* Generate an implicit declaration for identifier FUNCTIONID
4698 as a function of type int (). Print a warning if appropriate. */
4701 implicitly_declare (functionid)
4706 /* We used to reuse an old implicit decl here,
4707 but this loses with inline functions because it can clobber
4708 the saved decl chains. */
4709 decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4711 DECL_EXTERNAL (decl) = 1;
4712 TREE_PUBLIC (decl) = 1;
4714 /* ISO standard says implicit declarations are in the innermost block.
4715 So we record the decl in the standard fashion. */
4717 rest_of_decl_compilation (decl, NULL, 0, 0);
4720 /* Only one warning per identifier. */
4721 && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4723 pedwarn ("implicit declaration of function `%#D'", decl);
4726 SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4731 /* Return zero if the declaration NEWDECL is valid
4732 when the declaration OLDDECL (assumed to be for the same name)
4733 has already been seen.
4734 Otherwise return an error message format string with a %s
4735 where the identifier should go. */
4738 redeclaration_error_message (newdecl, olddecl)
4739 tree newdecl, olddecl;
4741 if (TREE_CODE (newdecl) == TYPE_DECL)
4743 /* Because C++ can put things into name space for free,
4744 constructs like "typedef struct foo { ... } foo"
4745 would look like an erroneous redeclaration. */
4746 if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4749 return "redefinition of `%#D'";
4751 else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4753 /* If this is a pure function, its olddecl will actually be
4754 the original initialization to `0' (which we force to call
4755 abort()). Don't complain about redefinition in this case. */
4756 if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl))
4759 /* If both functions come from different namespaces, this is not
4760 a redeclaration - this is a conflict with a used function. */
4761 if (DECL_NAMESPACE_SCOPE_P (olddecl)
4762 && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4763 return "`%D' conflicts with used function";
4765 /* We'll complain about linkage mismatches in
4766 warn_extern_redeclared_static. */
4768 /* Defining the same name twice is no good. */
4769 if (DECL_INITIAL (olddecl) != NULL_TREE
4770 && DECL_INITIAL (newdecl) != NULL_TREE)
4772 if (DECL_NAME (olddecl) == NULL_TREE)
4773 return "`%#D' not declared in class";
4775 return "redefinition of `%#D'";
4779 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4781 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4782 && (DECL_TEMPLATE_RESULT (newdecl)
4783 != DECL_TEMPLATE_RESULT (olddecl))
4784 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4785 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4786 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4787 && COMPLETE_TYPE_P (TREE_TYPE (newdecl))
4788 && COMPLETE_TYPE_P (TREE_TYPE (olddecl))))
4789 return "redefinition of `%#D'";
4792 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl))
4794 /* Objects declared at top level: */
4795 /* If at least one is a reference, it's ok. */
4796 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4798 /* Reject two definitions. */
4799 return "redefinition of `%#D'";
4803 /* Objects declared with block scope: */
4804 /* Reject two definitions, and reject a definition
4805 together with an external reference. */
4806 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4807 return "redeclaration of `%#D'";
4812 /* Create a new label, named ID. */
4815 make_label_decl (id, local_p)
4821 decl = build_decl (LABEL_DECL, id, void_type_node);
4823 /* Make sure every label has an rtx. */
4826 DECL_CONTEXT (decl) = current_function_decl;
4827 DECL_MODE (decl) = VOIDmode;
4828 C_DECLARED_LABEL_FLAG (decl) = local_p;
4830 /* Say where one reference is to the label, for the sake of the
4831 error if it is not defined. */
4832 DECL_SOURCE_LINE (decl) = lineno;
4833 DECL_SOURCE_FILE (decl) = input_filename;
4835 /* Record the fact that this identifier is bound to this label. */
4836 SET_IDENTIFIER_LABEL_VALUE (id, decl);
4841 /* Record this label on the list of used labels so that we can check
4842 at the end of the function to see whether or not the label was
4843 actually defined, and so we can check when the label is defined whether
4844 this use is valid. */
4850 if (named_label_uses == NULL
4851 || named_label_uses->names_in_scope != current_binding_level->names
4852 || named_label_uses->label_decl != decl)
4854 struct named_label_use_list *new_ent;
4855 new_ent = ((struct named_label_use_list *)
4856 ggc_alloc (sizeof (struct named_label_use_list)));
4857 new_ent->label_decl = decl;
4858 new_ent->names_in_scope = current_binding_level->names;
4859 new_ent->binding_level = current_binding_level;
4860 new_ent->lineno_o_goto = lineno;
4861 new_ent->filename_o_goto = input_filename;
4862 new_ent->next = named_label_uses;
4863 named_label_uses = new_ent;
4867 /* Look for a label named ID in the current function. If one cannot
4868 be found, create one. (We keep track of used, but undefined,
4869 labels, and complain about them at the end of a function.) */
4876 struct named_label_list *ent;
4878 /* You can't use labels at global scope. */
4879 if (current_function_decl == NULL_TREE)
4881 error ("label `%s' referenced outside of any function",
4882 IDENTIFIER_POINTER (id));
4886 /* See if we've already got this label. */
4887 decl = IDENTIFIER_LABEL_VALUE (id);
4888 if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl)
4891 /* Record this label on the list of labels used in this function.
4892 We do this before calling make_label_decl so that we get the
4893 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4894 ent = ((struct named_label_list *)
4895 ggc_alloc_cleared (sizeof (struct named_label_list)));
4896 ent->old_value = IDENTIFIER_LABEL_VALUE (id);
4897 ent->next = named_labels;
4900 /* We need a new label. */
4901 decl = make_label_decl (id, /*local_p=*/0);
4903 /* Now fill in the information we didn't have before. */
4904 ent->label_decl = decl;
4909 /* Declare a local label named ID. */
4912 declare_local_label (id)
4917 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4918 this scope we can restore the old value of
4919 IDENTIFIER_TYPE_VALUE. */
4920 current_binding_level->shadowed_labels
4921 = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4922 current_binding_level->shadowed_labels);
4923 /* Look for the label. */
4924 decl = make_label_decl (id, /*local_p=*/1);
4925 /* Now fill in the information we didn't have before. */
4926 TREE_VALUE (current_binding_level->shadowed_labels) = decl;
4931 /* Returns nonzero if it is ill-formed to jump past the declaration of
4932 DECL. Returns 2 if it's also a real problem. */
4935 decl_jump_unsafe (decl)
4938 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
4941 if (DECL_INITIAL (decl) == NULL_TREE
4942 && pod_type_p (TREE_TYPE (decl)))
4945 /* This is really only important if we're crossing an initialization.
4946 The POD stuff is just pedantry; why should it matter if the class
4947 contains a field of pointer to member type? */
4948 if (DECL_INITIAL (decl)
4949 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))))
4954 /* Check that a single previously seen jump to a newly defined label
4955 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4956 the jump context; NAMES are the names in scope in LEVEL at the jump
4957 context; FILE and LINE are the source position of the jump or 0. */
4960 check_previous_goto_1 (decl, level, names, file, line)
4962 struct binding_level *level;
4969 struct binding_level *b = current_binding_level;
4970 for (; b; b = b->level_chain)
4972 tree new_decls = b->names;
4973 tree old_decls = (b == level ? names : NULL_TREE);
4974 for (; new_decls != old_decls;
4975 new_decls = TREE_CHAIN (new_decls))
4977 int problem = decl_jump_unsafe (new_decls);
4984 pedwarn ("jump to label `%D'", decl);
4986 pedwarn ("jump to case label");
4989 pedwarn_with_file_and_line (file, line, " from here");
4994 cp_error_at (" crosses initialization of `%#D'",
4997 cp_pedwarn_at (" enters scope of non-POD `%#D'",
5003 if ((b->is_try_scope || b->is_catch_scope) && ! saw_eh)
5008 pedwarn ("jump to label `%D'", decl);
5010 pedwarn ("jump to case label");
5013 pedwarn_with_file_and_line (file, line, " from here");
5016 if (b->is_try_scope)
5017 error (" enters try block");
5019 error (" enters catch block");
5026 check_previous_goto (use)
5027 struct named_label_use_list *use;
5029 check_previous_goto_1 (use->label_decl, use->binding_level,
5030 use->names_in_scope, use->filename_o_goto,
5031 use->lineno_o_goto);
5035 check_switch_goto (level)
5036 struct binding_level *level;
5038 check_previous_goto_1 (NULL_TREE, level, level->names, NULL, 0);
5041 /* Check that any previously seen jumps to a newly defined label DECL
5042 are OK. Called by define_label. */
5045 check_previous_gotos (decl)
5048 struct named_label_use_list **usep;
5050 if (! TREE_USED (decl))
5053 for (usep = &named_label_uses; *usep; )
5055 struct named_label_use_list *use = *usep;
5056 if (use->label_decl == decl)
5058 check_previous_goto (use);
5062 usep = &(use->next);
5066 /* Check that a new jump to a label DECL is OK. Called by
5067 finish_goto_stmt. */
5075 struct named_label_list *lab;
5077 /* We can't know where a computed goto is jumping. So we assume
5079 if (! DECL_P (decl))
5082 /* If the label hasn't been defined yet, defer checking. */
5083 if (! DECL_INITIAL (decl))
5089 for (lab = named_labels; lab; lab = lab->next)
5090 if (decl == lab->label_decl)
5093 /* If the label is not on named_labels it's a gcc local label, so
5094 it must be in an outer scope, so jumping to it is always OK. */
5098 if ((lab->in_try_scope || lab->in_catch_scope || lab->bad_decls)
5101 cp_pedwarn_at ("jump to label `%D'", decl);
5102 pedwarn (" from here");
5106 for (bad = lab->bad_decls; bad; bad = TREE_CHAIN (bad))
5108 tree b = TREE_VALUE (bad);
5109 int u = decl_jump_unsafe (b);
5111 if (u > 1 && DECL_ARTIFICIAL (b))
5112 /* Can't skip init of __exception_info. */
5113 cp_error_at (" enters catch block", b);
5115 cp_error_at (" skips initialization of `%#D'", b);
5117 cp_pedwarn_at (" enters scope of non-POD `%#D'", b);
5120 if (lab->in_try_scope)
5121 error (" enters try block");
5122 else if (lab->in_catch_scope)
5123 error (" enters catch block");
5126 /* Define a label, specifying the location in the source file.
5127 Return the LABEL_DECL node for the label, if the definition is valid.
5128 Otherwise return 0. */
5131 define_label (filename, line, name)
5132 const char *filename;
5136 tree decl = lookup_label (name);
5137 struct named_label_list *ent;
5138 register struct binding_level *p;
5140 for (ent = named_labels; ent; ent = ent->next)
5141 if (ent->label_decl == decl)
5144 /* After labels, make any new cleanups in the function go into their
5145 own new (temporary) binding contour. */
5146 for (p = current_binding_level; !(p->parm_flag); p = p->level_chain)
5147 p->more_cleanups_ok = 0;
5149 if (name == get_identifier ("wchar_t"))
5150 pedwarn ("label named wchar_t");
5152 if (DECL_INITIAL (decl) != NULL_TREE)
5154 error ("duplicate label `%D'", decl);
5159 /* Mark label as having been defined. */
5160 DECL_INITIAL (decl) = error_mark_node;
5161 /* Say where in the source. */
5162 DECL_SOURCE_FILE (decl) = filename;
5163 DECL_SOURCE_LINE (decl) = line;
5166 ent->names_in_scope = current_binding_level->names;
5167 ent->binding_level = current_binding_level;
5169 check_previous_gotos (decl);
5176 struct binding_level *level;
5177 struct cp_switch *next;
5178 /* The SWITCH_STMT being built. */
5180 /* A splay-tree mapping the low element of a case range to the high
5181 element, or NULL_TREE if there is no high element. Used to
5182 determine whether or not a new case label duplicates an old case
5183 label. We need a tree, rather than simply a hash table, because
5184 of the GNU case range extension. */
5188 /* A stack of the currently active switch statements. The innermost
5189 switch statement is on the top of the stack. There is no need to
5190 mark the stack for garbage collection because it is only active
5191 during the processing of the body of a function, and we never
5192 collect at that point. */
5194 static struct cp_switch *switch_stack;
5196 /* Called right after a switch-statement condition is parsed.
5197 SWITCH_STMT is the switch statement being parsed. */
5200 push_switch (switch_stmt)
5204 = (struct cp_switch *) xmalloc (sizeof (struct cp_switch));
5205 p->level = current_binding_level;
5206 p->next = switch_stack;
5207 p->switch_stmt = switch_stmt;
5208 p->cases = splay_tree_new (case_compare, NULL, NULL);
5215 struct cp_switch *cs;
5218 splay_tree_delete (cs->cases);
5219 switch_stack = switch_stack->next;
5223 /* Note that we've seen a definition of a case label, and complain if this
5224 is a bad place for one. */
5227 finish_case_label (low_value, high_value)
5232 register struct binding_level *p;
5237 error ("case label not within a switch statement");
5239 error ("case label `%E' not within a switch statement",
5242 error ("`default' label not within a switch statement");
5246 if (processing_template_decl)
5250 /* For templates, just add the case label; we'll do semantic
5251 analysis at instantiation-time. */
5252 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
5253 return add_stmt (build_case_label (low_value, high_value, label));
5256 /* Find the condition on which this switch statement depends. */
5257 cond = SWITCH_COND (switch_stack->switch_stmt);
5258 if (cond && TREE_CODE (cond) == TREE_LIST)
5259 cond = TREE_VALUE (cond);
5261 r = c_add_case_label (switch_stack->cases, cond, low_value, high_value);
5262 if (r == error_mark_node)
5265 check_switch_goto (switch_stack->level);
5267 /* After labels, make any new cleanups in the function go into their
5268 own new (temporary) binding contour. */
5269 for (p = current_binding_level; !(p->parm_flag); p = p->level_chain)
5270 p->more_cleanups_ok = 0;
5275 /* Return the list of declarations of the current level.
5276 Note that this list is in reverse order unless/until
5277 you nreverse it; and when you do nreverse it, you must
5278 store the result back using `storedecls' or you will lose. */
5283 return current_binding_level->names;
5286 /* Return the list of type-tags (for structs, etc) of the current level. */
5291 return current_binding_level->tags;
5294 /* Store the list of declarations of the current level.
5295 This is done for the parameter declarations of a function being defined,
5296 after they are modified in the light of any missing parameters. */
5302 current_binding_level->names = decls;
5305 /* Similarly, store the list of tags of the current level. */
5311 current_binding_level->tags = tags;
5314 /* Return the type that should be used when TYPE's name is preceded
5315 by a tag such as 'struct' or 'union', or null if the name cannot
5316 be used in this way.
5318 For example, when processing the third line of:
5324 lookup of A will find the typedef. Given A's typedef, this function
5325 will return the type associated with "struct A". For the tag to be
5326 anything other than TYPE, TYPE must be a typedef whose original type
5327 has the same name and context as TYPE itself.
5329 It is not valid for a typedef of an anonymous type to be used with
5332 typedef struct { ... } B;
5335 Return null for this case. */
5338 follow_tag_typedef (type)
5343 original = original_type (type);
5344 if (! TYPE_NAME (original))
5346 if (TYPE_IDENTIFIER (original) == TYPE_IDENTIFIER (type)
5347 && (CP_DECL_CONTEXT (TYPE_NAME (original))
5348 == CP_DECL_CONTEXT (TYPE_NAME (type)))
5349 && !(CLASS_TYPE_P (original) && TYPE_WAS_ANONYMOUS (original)))
5355 /* Given NAME, an IDENTIFIER_NODE,
5356 return the structure (or union or enum) definition for that name.
5357 Searches binding levels from BINDING_LEVEL up to the global level.
5358 If THISLEVEL_ONLY is nonzero, searches only the specified context
5359 (but skips any tag-transparent contexts to find one that is
5360 meaningful for tags).
5361 FORM says which kind of type the caller wants;
5362 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5363 If the wrong kind of type is found, and it's not a template, an error is
5367 lookup_tag (form, name, binding_level, thislevel_only)
5368 enum tree_code form;
5370 struct binding_level *binding_level;
5373 register struct binding_level *level;
5374 /* Non-zero if, we should look past a template parameter level, even
5375 if THISLEVEL_ONLY. */
5376 int allow_template_parms_p = 1;
5378 for (level = binding_level; level; level = level->level_chain)
5381 if (ANON_AGGRNAME_P (name))
5382 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5384 /* There's no need for error checking here, because
5385 anon names are unique throughout the compilation. */
5386 if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
5387 return TREE_VALUE (tail);
5389 else if (level->namespace_p)
5390 /* Do namespace lookup. */
5391 for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
5393 tree old = binding_for_name (name, tail);
5395 /* If we just skipped past a template parameter level,
5396 even though THISLEVEL_ONLY, and we find a template
5397 class declaration, then we use the _TYPE node for the
5398 template. See the example below. */
5399 if (thislevel_only && !allow_template_parms_p
5400 && old && BINDING_VALUE (old)
5401 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
5402 old = TREE_TYPE (BINDING_VALUE (old));
5404 old = BINDING_TYPE (old);
5408 /* We've found something at this binding level. If it is
5409 a typedef, extract the tag it refers to. Lookup fails
5410 if the typedef doesn't refer to a taggable type. */
5411 old = follow_tag_typedef (old);
5414 if (TREE_CODE (old) != form
5415 && (form == ENUMERAL_TYPE
5416 || TREE_CODE (old) == ENUMERAL_TYPE))
5418 error ("`%#D' redeclared as %C", old, form);
5423 if (thislevel_only || tail == global_namespace)
5427 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5429 if (TREE_PURPOSE (tail) == name)
5431 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
5434 && (form == ENUMERAL_TYPE || code == ENUMERAL_TYPE))
5436 /* Definition isn't the kind we were looking for. */
5437 error ("`%#D' redeclared as %C", TREE_VALUE (tail), form);
5440 return TREE_VALUE (tail);
5443 if (thislevel_only && ! level->tag_transparent)
5445 if (level->template_parms_p && allow_template_parms_p)
5447 /* We must deal with cases like this:
5449 template <class T> struct S;
5450 template <class T> struct S {};
5452 When looking up `S', for the second declaration, we
5453 would like to find the first declaration. But, we
5454 are in the pseudo-global level created for the
5455 template parameters, rather than the (surrounding)
5456 namespace level. Thus, we keep going one more level,
5457 even though THISLEVEL_ONLY is non-zero. */
5458 allow_template_parms_p = 0;
5470 set_current_level_tags_transparency (tags_transparent)
5471 int tags_transparent;
5473 current_binding_level->tag_transparent = tags_transparent;
5477 /* Given a type, find the tag that was defined for it and return the tag name.
5478 Otherwise return 0. However, the value can never be 0
5479 in the cases in which this is used.
5481 C++: If NAME is non-zero, this is the new name to install. This is
5482 done when replacing anonymous tags with real tag names. */
5485 lookup_tag_reverse (type, name)
5489 register struct binding_level *level;
5491 for (level = current_binding_level; level; level = level->level_chain)
5494 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5496 if (TREE_VALUE (tail) == type)
5499 TREE_PURPOSE (tail) = name;
5500 return TREE_PURPOSE (tail);
5507 /* Look up NAME in the NAMESPACE. */
5510 lookup_namespace_name (namespace, name)
5511 tree namespace, name;
5514 tree template_id = NULL_TREE;
5516 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5518 if (TREE_CODE (name) == NAMESPACE_DECL)
5519 /* This happens for A::B<int> when B is a namespace. */
5521 else if (TREE_CODE (name) == TEMPLATE_DECL)
5523 /* This happens for A::B where B is a template, and there are no
5524 template arguments. */
5525 error ("invalid use of `%D'", name);
5526 return error_mark_node;
5529 namespace = ORIGINAL_NAMESPACE (namespace);
5531 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5534 name = TREE_OPERAND (name, 0);
5535 if (TREE_CODE (name) == OVERLOAD)
5536 name = DECL_NAME (OVL_CURRENT (name));
5537 else if (DECL_P (name))
5538 name = DECL_NAME (name);
5541 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5543 val = make_node (CPLUS_BINDING);
5544 if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5545 return error_mark_node;
5547 if (BINDING_VALUE (val))
5549 val = BINDING_VALUE (val);
5553 if (DECL_CLASS_TEMPLATE_P (val))
5554 val = lookup_template_class (val,
5555 TREE_OPERAND (template_id, 1),
5556 /*in_decl=*/NULL_TREE,
5557 /*context=*/NULL_TREE,
5558 /*entering_scope=*/0,
5559 tf_error | tf_warning);
5560 else if (DECL_FUNCTION_TEMPLATE_P (val)
5561 || TREE_CODE (val) == OVERLOAD)
5562 val = lookup_template_function (val,
5563 TREE_OPERAND (template_id, 1));
5566 error ("`%D::%D' is not a template",
5568 return error_mark_node;
5572 /* If we have a single function from a using decl, pull it out. */
5573 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5574 val = OVL_FUNCTION (val);
5576 /* Ignore built-in functions that haven't been prototyped yet. */
5577 if (!val || !DECL_P(val)
5578 || !DECL_LANG_SPECIFIC(val)
5579 || !DECL_ANTICIPATED (val))
5583 error ("`%D' undeclared in namespace `%D'", name, namespace);
5584 return error_mark_node;
5587 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5589 static unsigned long
5597 hash = (((unsigned long) TYPE_CONTEXT (t))
5598 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t))));
5603 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5606 typename_compare (k1, k2)
5617 d1 = TYPE_NAME (t1);
5618 d2 = TYPE_NAME (t2);
5620 return (DECL_NAME (d1) == DECL_NAME (d2)
5621 && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2))
5622 && ((TREE_TYPE (t1) != NULL_TREE)
5623 == (TREE_TYPE (t2) != NULL_TREE))
5624 && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5625 && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5628 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5629 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5630 is non-NULL, this type is being created by the implicit typename
5631 extension, and BASE_TYPE is a type named `t' in some base class of
5632 `T' which depends on template parameters.
5634 Returns the new TYPENAME_TYPE. */
5637 build_typename_type (context, name, fullname, base_type)
5645 struct hash_entry *e;
5647 static struct hash_table ht;
5651 static struct hash_table *h = &ht;
5653 hash_table_init (&ht, &hash_newfunc, &typename_hash, &typename_compare);
5654 ggc_add_tree_hash_table_root (&h, 1);
5657 /* Build the TYPENAME_TYPE. */
5658 t = make_aggr_type (TYPENAME_TYPE);
5659 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5660 TYPENAME_TYPE_FULLNAME (t) = fullname;
5661 TREE_TYPE (t) = base_type;
5663 /* Build the corresponding TYPE_DECL. */
5664 d = build_decl (TYPE_DECL, name, t);
5665 TYPE_NAME (TREE_TYPE (d)) = d;
5666 TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5667 DECL_CONTEXT (d) = FROB_CONTEXT (context);
5668 DECL_ARTIFICIAL (d) = 1;
5670 /* See if we already have this type. */
5671 e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0);
5675 /* Insert the type into the table. */
5676 hash_lookup (&ht, t, /*create=*/true, /*copy=*/0);
5681 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5682 unless an error occurs, in which case error_mark_node is returned.
5683 If we locate a non-artificial TYPE_DECL and TF_KEEP_TYPE_DECL is
5684 set, we return that, rather than the _TYPE it corresponds to, in
5685 other cases we look through the type decl. If TF_ERROR is set,
5686 complain about errors, otherwise be quiet. */
5689 make_typename_type (context, name, complain)
5691 tsubst_flags_t complain;
5697 if (!(TYPE_LANG_SPECIFIC (name)
5698 && (CLASSTYPE_IS_TEMPLATE (name)
5699 || CLASSTYPE_USE_TEMPLATE (name))))
5700 name = TYPE_IDENTIFIER (name);
5702 /* Create a TEMPLATE_ID_EXPR for the type. */
5703 name = build_nt (TEMPLATE_ID_EXPR,
5704 CLASSTYPE_TI_TEMPLATE (name),
5705 CLASSTYPE_TI_ARGS (name));
5707 else if (TREE_CODE (name) == TYPE_DECL)
5708 name = DECL_NAME (name);
5712 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5714 name = TREE_OPERAND (name, 0);
5715 if (TREE_CODE (name) == TEMPLATE_DECL)
5716 name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5718 if (TREE_CODE (name) == TEMPLATE_DECL)
5720 error ("`%D' used without template parameters", name);
5721 return error_mark_node;
5723 if (TREE_CODE (name) != IDENTIFIER_NODE)
5726 if (TREE_CODE (context) == NAMESPACE_DECL)
5728 /* We can get here from typename_sub0 in the explicit_template_type
5729 expansion. Just fail. */
5730 if (complain & tf_error)
5731 error ("no class template named `%#T' in `%#T'",
5733 return error_mark_node;
5736 if (! uses_template_parms (context)
5737 || currently_open_class (context))
5739 if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5741 tree tmpl = NULL_TREE;
5742 if (IS_AGGR_TYPE (context))
5743 tmpl = lookup_field (context, name, 0, 0);
5744 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5746 if (complain & tf_error)
5747 error ("no class template named `%#T' in `%#T'",
5749 return error_mark_node;
5752 return lookup_template_class (tmpl,
5753 TREE_OPERAND (fullname, 1),
5755 /*entering_scope=*/0,
5756 tf_error | tf_warning);
5762 if (!IS_AGGR_TYPE (context))
5764 if (complain & tf_error)
5765 error ("no type named `%#T' in `%#T'", name, context);
5766 return error_mark_node;
5769 t = lookup_field (context, name, 0, 1);
5772 if (DECL_ARTIFICIAL (t) || !(complain & tf_keep_type_decl))
5774 if (IMPLICIT_TYPENAME_P (t))
5776 /* Lookup found an implicit typename that we had
5777 injected into the current scope. Doing things
5778 properly would have located the exact same type,
5779 so there is no error here. We must remove the
5780 implicitness so that we do not warn about it. */
5782 TREE_TYPE (t) = NULL_TREE;
5790 /* If the CONTEXT is not a template type, then either the field is
5791 there now or its never going to be. */
5792 if (!uses_template_parms (context))
5794 if (complain & tf_error)
5795 error ("no type named `%#T' in `%#T'", name, context);
5796 return error_mark_node;
5800 return build_typename_type (context, name, fullname, NULL_TREE);
5803 /* Resolve `CONTEXT::template NAME'. Returns an appropriate type,
5804 unless an error occurs, in which case error_mark_node is returned.
5805 If we locate a TYPE_DECL, we return that, rather than the _TYPE it
5806 corresponds to. If COMPLAIN zero, don't complain about any errors
5810 make_unbound_class_template (context, name, complain)
5818 name = TYPE_IDENTIFIER (name);
5819 else if (DECL_P (name))
5820 name = DECL_NAME (name);
5821 if (TREE_CODE (name) != IDENTIFIER_NODE)
5824 if (!uses_template_parms (context)
5825 || currently_open_class (context))
5827 tree tmpl = NULL_TREE;
5829 if (IS_AGGR_TYPE (context))
5830 tmpl = lookup_field (context, name, 0, 0);
5832 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5835 error ("no class template named `%#T' in `%#T'", name, context);
5836 return error_mark_node;
5839 if (!enforce_access (context, tmpl))
5840 return error_mark_node;
5845 /* Build the UNBOUND_CLASS_TEMPLATE. */
5846 t = make_aggr_type (UNBOUND_CLASS_TEMPLATE);
5847 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5848 TREE_TYPE (t) = NULL_TREE;
5850 /* Build the corresponding TEMPLATE_DECL. */
5851 d = build_decl (TEMPLATE_DECL, name, t);
5852 TYPE_NAME (TREE_TYPE (d)) = d;
5853 TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5854 DECL_CONTEXT (d) = FROB_CONTEXT (context);
5855 DECL_ARTIFICIAL (d) = 1;
5860 /* Select the right _DECL from multiple choices. */
5863 select_decl (binding, flags)
5868 val = BINDING_VALUE (binding);
5870 if (LOOKUP_NAMESPACES_ONLY (flags))
5872 /* We are not interested in types. */
5873 if (val && TREE_CODE (val) == NAMESPACE_DECL)
5878 /* If we could have a type and
5879 we have nothing or we need a type and have none. */
5880 if (BINDING_TYPE (binding)
5881 && (!val || ((flags & LOOKUP_PREFER_TYPES)
5882 && TREE_CODE (val) != TYPE_DECL)))
5883 val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5884 /* Don't return non-types if we really prefer types. */
5885 else if (val && LOOKUP_TYPES_ONLY (flags) && TREE_CODE (val) != TYPE_DECL
5886 && (TREE_CODE (val) != TEMPLATE_DECL
5887 || !DECL_CLASS_TEMPLATE_P (val)))
5893 /* Unscoped lookup of a global: iterate over current namespaces,
5894 considering using-directives. If SPACESP is non-NULL, store a list
5895 of the namespaces we've considered in it. */
5898 unqualified_namespace_lookup (name, flags, spacesp)
5903 tree b = make_node (CPLUS_BINDING);
5904 tree initial = current_decl_namespace ();
5905 tree scope = initial;
5907 struct binding_level *level;
5908 tree val = NULL_TREE;
5911 *spacesp = NULL_TREE;
5913 for (; !val; scope = CP_DECL_CONTEXT (scope))
5916 *spacesp = tree_cons (scope, NULL_TREE, *spacesp);
5917 val = binding_for_name (name, scope);
5919 /* Ignore anticipated built-in functions. */
5920 if (val && BINDING_VALUE (val)
5921 && DECL_P (BINDING_VALUE (val))
5922 && DECL_LANG_SPECIFIC (BINDING_VALUE (val))
5923 && DECL_ANTICIPATED (BINDING_VALUE (val)))
5925 BINDING_VALUE (b) = NULL_TREE;
5926 BINDING_TYPE (b) = NULL_TREE;
5930 /* Initialize binding for this context. */
5931 BINDING_VALUE (b) = BINDING_VALUE (val);
5932 BINDING_TYPE (b) = BINDING_TYPE (val);
5935 /* Add all _DECLs seen through local using-directives. */
5936 for (level = current_binding_level;
5937 !level->namespace_p;
5938 level = level->level_chain)
5939 if (!lookup_using_namespace (name, b, level->using_directives,
5940 scope, flags, spacesp))
5941 /* Give up because of error. */
5942 return error_mark_node;
5944 /* Add all _DECLs seen through global using-directives. */
5945 /* XXX local and global using lists should work equally. */
5949 if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5950 scope, flags, spacesp))
5951 /* Give up because of error. */
5952 return error_mark_node;
5953 if (siter == scope) break;
5954 siter = CP_DECL_CONTEXT (siter);
5957 val = select_decl (b, flags);
5958 if (scope == global_namespace)
5964 /* Combine prefer_type and namespaces_only into flags. */
5967 lookup_flags (prefer_type, namespaces_only)
5968 int prefer_type, namespaces_only;
5970 if (namespaces_only)
5971 return LOOKUP_PREFER_NAMESPACES;
5972 if (prefer_type > 1)
5973 return LOOKUP_PREFER_TYPES;
5974 if (prefer_type > 0)
5975 return LOOKUP_PREFER_BOTH;
5979 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5980 ignore it or not. Subroutine of lookup_name_real. */
5983 qualify_lookup (val, flags)
5987 if (val == NULL_TREE)
5989 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5991 if ((flags & LOOKUP_PREFER_TYPES)
5992 && (TREE_CODE (val) == TYPE_DECL
5993 || ((flags & LOOKUP_TEMPLATES_EXPECTED)
5994 && DECL_CLASS_TEMPLATE_P (val))))
5996 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
6001 /* Any other BINDING overrides an implicit TYPENAME. Warn about
6005 warn_about_implicit_typename_lookup (typename, binding)
6009 tree subtype = TREE_TYPE (TREE_TYPE (typename));
6010 tree name = DECL_NAME (typename);
6012 if (! (TREE_CODE (binding) == TEMPLATE_DECL
6013 && CLASSTYPE_TEMPLATE_INFO (subtype)
6014 && CLASSTYPE_TI_TEMPLATE (subtype) == binding)
6015 && ! (TREE_CODE (binding) == TYPE_DECL
6016 && same_type_p (TREE_TYPE (binding), subtype)))
6018 warning ("lookup of `%D' finds `%#D'",
6020 warning (" instead of `%D' from dependent base class",
6022 warning (" (use `typename %T::%D' if that's what you meant)",
6023 constructor_name (current_class_type), name);
6027 /* Look up NAME in the current binding level and its superiors in the
6028 namespace of variables, functions and typedefs. Return a ..._DECL
6029 node of some kind representing its definition if there is only one
6030 such declaration, or return a TREE_LIST with all the overloaded
6031 definitions if there are many, or return 0 if it is undefined.
6033 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
6034 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
6035 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
6036 Otherwise we prefer non-TYPE_DECLs.
6038 If NONCLASS is non-zero, we don't look for the NAME in class scope,
6039 using IDENTIFIER_CLASS_VALUE. */
6042 lookup_name_real (name, prefer_type, nonclass, namespaces_only)
6044 int prefer_type, nonclass, namespaces_only;
6047 tree val = NULL_TREE;
6049 tree from_obj = NULL_TREE;
6051 int val_is_implicit_typename = 0;
6053 /* Hack: copy flag set by parser, if set. */
6054 if (only_namespace_names)
6055 namespaces_only = 1;
6057 if (prefer_type == -2)
6059 extern int looking_for_typename;
6060 tree type = NULL_TREE;
6063 prefer_type = looking_for_typename;
6065 flags = lookup_flags (prefer_type, namespaces_only);
6066 /* If the next thing is '<', class templates are types. */
6067 if (looking_for_template)
6068 flags |= LOOKUP_TEMPLATES_EXPECTED;
6072 else if (got_object != error_mark_node)
6077 if (type == error_mark_node)
6078 return error_mark_node;
6079 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
6080 type = TREE_TYPE (type);
6083 type = complete_type (type);
6085 if (TREE_CODE (type) == VOID_TYPE)
6086 type = global_namespace;
6087 if (TREE_CODE (type) == NAMESPACE_DECL)
6089 val = make_node (CPLUS_BINDING);
6090 flags |= LOOKUP_COMPLAIN;
6091 if (!qualified_lookup_using_namespace (name, type, val, flags))
6093 val = select_decl (val, flags);
6095 else if (! IS_AGGR_TYPE (type)
6096 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
6097 || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM
6098 || TREE_CODE (type) == TYPENAME_TYPE)
6099 /* Someone else will give an error about this if needed. */
6101 else if (type == current_class_type)
6102 val = IDENTIFIER_CLASS_VALUE (name);
6105 val = lookup_member (type, name, 0, prefer_type);
6106 type_access_control (type, val);
6108 /* Restore the containing TYPENAME_TYPE if we looked
6109 through it before. */
6110 if (got_scope && got_scope != type
6111 && val && TREE_CODE (val) == TYPE_DECL
6112 && TREE_CODE (TREE_TYPE (val)) == TYPENAME_TYPE)
6113 TYPE_CONTEXT (TREE_TYPE (val)) = got_scope;
6121 else if (got_object && val)
6129 flags = lookup_flags (prefer_type, namespaces_only);
6130 /* If we're not parsing, we need to complain. */
6131 flags |= LOOKUP_COMPLAIN;
6134 /* First, look in non-namespace scopes. */
6136 if (current_class_type == NULL_TREE)
6139 for (t = IDENTIFIER_BINDING (name); t; t = TREE_CHAIN (t))
6143 if (!LOCAL_BINDING_P (t) && nonclass)
6144 /* We're not looking for class-scoped bindings, so keep going. */
6147 /* If this is the kind of thing we're looking for, we're done. */
6148 if (qualify_lookup (BINDING_VALUE (t), flags))
6149 binding = BINDING_VALUE (t);
6150 else if ((flags & LOOKUP_PREFER_TYPES)
6151 && qualify_lookup (BINDING_TYPE (t), flags))
6152 binding = BINDING_TYPE (t);
6154 binding = NULL_TREE;
6156 /* Handle access control on types from enclosing or base classes. */
6157 if (binding && ! yylex
6158 && BINDING_LEVEL (t) && BINDING_LEVEL (t)->parm_flag == 2)
6159 type_access_control (BINDING_LEVEL (t)->this_class, binding);
6162 && (!val || !IMPLICIT_TYPENAME_TYPE_DECL_P (binding)))
6164 if (val_is_implicit_typename && !yylex)
6165 warn_about_implicit_typename_lookup (val, binding);
6167 val_is_implicit_typename
6168 = IMPLICIT_TYPENAME_TYPE_DECL_P (val);
6169 if (!val_is_implicit_typename)
6174 /* Now lookup in namespace scopes. */
6175 if (!val || val_is_implicit_typename)
6177 t = unqualified_namespace_lookup (name, flags, 0);
6180 if (val_is_implicit_typename && !yylex)
6181 warn_about_implicit_typename_lookup (val, t);
6189 /* This should only warn about types used in qualified-ids. */
6190 if (from_obj && from_obj != val)
6192 if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL
6193 && TREE_CODE (val) == TYPE_DECL
6194 && ! same_type_p (TREE_TYPE (from_obj), TREE_TYPE (val)))
6196 lookup of `%D' in the scope of `%#T' (`%#D') \
6197 does not match lookup in the current scope (`%#D')",
6198 name, got_object, from_obj, val);
6200 /* We don't change val to from_obj if got_object depends on
6201 template parms because that breaks implicit typename for
6202 destructor calls. */
6203 if (! uses_template_parms (got_object))
6207 /* If we have a single function from a using decl, pull it out. */
6208 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
6209 val = OVL_FUNCTION (val);
6218 lookup_name_nonclass (name)
6221 return lookup_name_real (name, 0, 1, 0);
6225 lookup_function_nonclass (name, args)
6229 return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
6233 lookup_name_namespace_only (name)
6236 /* type-or-namespace, nonclass, namespace_only */
6237 return lookup_name_real (name, 1, 1, 1);
6241 lookup_name (name, prefer_type)
6245 return lookup_name_real (name, prefer_type, 0, 0);
6248 /* Similar to `lookup_name' but look only in the innermost non-class
6252 lookup_name_current_level (name)
6255 struct binding_level *b;
6258 b = current_binding_level;
6259 while (b->parm_flag == 2)
6264 t = IDENTIFIER_NAMESPACE_VALUE (name);
6266 /* extern "C" function() */
6267 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
6270 else if (IDENTIFIER_BINDING (name)
6271 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
6275 if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
6276 return IDENTIFIER_VALUE (name);
6288 /* Like lookup_name_current_level, but for types. */
6291 lookup_type_current_level (name)
6294 register tree t = NULL_TREE;
6296 my_friendly_assert (! current_binding_level->namespace_p, 980716);
6298 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
6299 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
6301 struct binding_level *b = current_binding_level;
6304 if (purpose_member (name, b->type_shadowed))
6305 return REAL_IDENTIFIER_TYPE_VALUE (name);
6317 begin_only_namespace_names ()
6319 only_namespace_names = 1;
6323 end_only_namespace_names ()
6325 only_namespace_names = 0;
6328 /* Push the declarations of builtin types into the namespace.
6329 RID_INDEX is the index of the builtin type
6330 in the array RID_POINTERS. NAME is the name used when looking
6331 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6334 record_builtin_type (rid_index, name, type)
6339 tree rname = NULL_TREE, tname = NULL_TREE;
6340 tree tdecl = NULL_TREE;
6342 if ((int) rid_index < (int) RID_MAX)
6343 rname = ridpointers[(int) rid_index];
6345 tname = get_identifier (name);
6347 TYPE_BUILT_IN (type) = 1;
6351 tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
6352 set_identifier_type_value (tname, NULL_TREE);
6353 if ((int) rid_index < (int) RID_MAX)
6354 /* Built-in types live in the global namespace. */
6355 SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
6357 if (rname != NULL_TREE)
6359 if (tname != NULL_TREE)
6361 set_identifier_type_value (rname, NULL_TREE);
6362 SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
6366 tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
6367 set_identifier_type_value (rname, NULL_TREE);
6372 /* Record one of the standard Java types.
6373 * Declare it as having the given NAME.
6374 * If SIZE > 0, it is the size of one of the integral types;
6375 * otherwise it is the negative of the size of one of the other types. */
6378 record_builtin_java_type (name, size)
6384 type = make_signed_type (size);
6385 else if (size > -32)
6386 { /* "__java_char" or ""__java_boolean". */
6387 type = make_unsigned_type (-size);
6388 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6391 { /* "__java_float" or ""__java_double". */
6392 type = make_node (REAL_TYPE);
6393 TYPE_PRECISION (type) = - size;
6396 record_builtin_type (RID_MAX, name, type);
6397 decl = TYPE_NAME (type);
6399 /* Suppress generate debug symbol entries for these types,
6400 since for normal C++ they are just clutter.
6401 However, push_lang_context undoes this if extern "Java" is seen. */
6402 DECL_IGNORED_P (decl) = 1;
6404 TYPE_FOR_JAVA (type) = 1;
6408 /* Push a type into the namespace so that the back-ends ignore it. */
6411 record_unknown_type (type, name)
6415 tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
6416 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6417 DECL_IGNORED_P (decl) = 1;
6418 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
6419 TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
6420 TYPE_ALIGN (type) = 1;
6421 TYPE_USER_ALIGN (type) = 0;
6422 TYPE_MODE (type) = TYPE_MODE (void_type_node);
6425 /* An string for which we should create an IDENTIFIER_NODE at
6428 typedef struct predefined_identifier
6430 /* The name of the identifier. */
6431 const char *const name;
6432 /* The place where the IDENTIFIER_NODE should be stored. */
6434 /* Non-zero if this is the name of a constructor or destructor. */
6435 const int ctor_or_dtor_p;
6436 } predefined_identifier;
6438 /* Create all the predefined identifiers. */
6441 initialize_predefined_identifiers ()
6443 const predefined_identifier *pid;
6445 /* A table of identifiers to create at startup. */
6446 static const predefined_identifier predefined_identifiers[] = {
6447 { "C++", &lang_name_cplusplus, 0 },
6448 { "C", &lang_name_c, 0 },
6449 { "Java", &lang_name_java, 0 },
6450 { CTOR_NAME, &ctor_identifier, 1 },
6451 { "__base_ctor", &base_ctor_identifier, 1 },
6452 { "__comp_ctor", &complete_ctor_identifier, 1 },
6453 { DTOR_NAME, &dtor_identifier, 1 },
6454 { "__comp_dtor", &complete_dtor_identifier, 1 },
6455 { "__base_dtor", &base_dtor_identifier, 1 },
6456 { "__deleting_dtor", &deleting_dtor_identifier, 1 },
6457 { IN_CHARGE_NAME, &in_charge_identifier, 0 },
6458 { "nelts", &nelts_identifier, 0 },
6459 { THIS_NAME, &this_identifier, 0 },
6460 { VTABLE_DELTA_NAME, &delta_identifier, 0 },
6461 { VTABLE_PFN_NAME, &pfn_identifier, 0 },
6462 { "_vptr", &vptr_identifier, 0 },
6463 { "__vtt_parm", &vtt_parm_identifier, 0 },
6464 { "std", &std_identifier, 0 },
6468 for (pid = predefined_identifiers; pid->name; ++pid)
6470 *pid->node = get_identifier (pid->name);
6471 if (pid->ctor_or_dtor_p)
6472 IDENTIFIER_CTOR_OR_DTOR_P (*pid->node) = 1;
6476 /* Create the predefined scalar types of C,
6477 and some nodes representing standard constants (0, 1, (void *)0).
6478 Initialize the global binding level.
6479 Make definitions for built-in primitive functions. */
6482 cxx_init_decl_processing ()
6485 tree void_ftype_ptr;
6487 /* Create all the identifiers we need. */
6488 initialize_predefined_identifiers ();
6490 /* Fill in back-end hooks. */
6491 init_lang_status = &push_cp_function_context;
6492 free_lang_status = &pop_cp_function_context;
6493 mark_lang_status = &mark_cp_function_context;
6494 lang_missing_noreturn_ok_p = &cp_missing_noreturn_ok_p;
6500 /* Create the global variables. */
6501 push_to_top_level ();
6503 /* Enter the global namespace. */
6504 my_friendly_assert (global_namespace == NULL_TREE, 375);
6505 push_namespace (get_identifier ("::"));
6506 global_namespace = current_namespace;
6507 current_lang_name = NULL_TREE;
6509 /* Adjust various flags based on command-line settings. */
6510 if (! flag_permissive && ! pedantic)
6511 flag_pedantic_errors = 1;
6512 if (!flag_no_inline)
6514 flag_inline_trees = 1;
6517 if (flag_inline_functions)
6519 flag_inline_trees = 2;
6520 flag_inline_functions = 0;
6524 current_lang_name = lang_name_c;
6526 current_function_decl = NULL_TREE;
6527 current_binding_level = NULL_BINDING_LEVEL;
6528 free_binding_level = NULL_BINDING_LEVEL;
6530 build_common_tree_nodes (flag_signed_char);
6532 error_mark_list = build_tree_list (error_mark_node, error_mark_node);
6533 TREE_TYPE (error_mark_list) = error_mark_node;
6535 /* Make the binding_level structure for global names. */
6537 global_binding_level = current_binding_level;
6538 /* The global level is the namespace level of ::. */
6539 NAMESPACE_LEVEL (global_namespace) = global_binding_level;
6540 declare_namespace_level ();
6542 /* Create the `std' namespace. */
6543 push_namespace (std_identifier);
6544 std_node = current_namespace;
6547 lang_attribute_table = cp_attribute_table;
6549 c_common_nodes_and_builtins ();
6551 java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6552 java_short_type_node = record_builtin_java_type ("__java_short", 16);
6553 java_int_type_node = record_builtin_java_type ("__java_int", 32);
6554 java_long_type_node = record_builtin_java_type ("__java_long", 64);
6555 java_float_type_node = record_builtin_java_type ("__java_float", -32);
6556 java_double_type_node = record_builtin_java_type ("__java_double", -64);
6557 java_char_type_node = record_builtin_java_type ("__java_char", -16);
6558 java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6560 integer_two_node = build_int_2 (2, 0);
6561 TREE_TYPE (integer_two_node) = integer_type_node;
6562 integer_three_node = build_int_2 (3, 0);
6563 TREE_TYPE (integer_three_node) = integer_type_node;
6565 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6566 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6567 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6568 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6569 TYPE_PRECISION (boolean_type_node) = 1;
6570 record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6571 boolean_false_node = build_int_2 (0, 0);
6572 TREE_TYPE (boolean_false_node) = boolean_type_node;
6573 boolean_true_node = build_int_2 (1, 0);
6574 TREE_TYPE (boolean_true_node) = boolean_type_node;
6576 signed_size_zero_node = build_int_2 (0, 0);
6577 TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype));
6579 empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE);
6582 record_builtin_type (RID_MAX, NULL, string_type_node);
6585 delta_type_node = ptrdiff_type_node;
6586 vtable_index_type = ptrdiff_type_node;
6588 vtt_parm_type = build_pointer_type (const_ptr_type_node);
6589 lang_type_promotes_to = convert_type_from_ellipsis;
6591 void_ftype = build_function_type (void_type_node, void_list_node);
6592 void_ftype_ptr = build_function_type (void_type_node,
6593 tree_cons (NULL_TREE,
6597 = build_exception_variant (void_ftype_ptr, empty_except_spec);
6599 /* C++ extensions */
6601 unknown_type_node = make_node (UNKNOWN_TYPE);
6602 record_unknown_type (unknown_type_node, "unknown type");
6604 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6605 TREE_TYPE (unknown_type_node) = unknown_type_node;
6607 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6609 TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6610 TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6613 /* Make sure we get a unique function type, so we can give
6614 its pointer type a name. (This wins for gdb.) */
6615 tree vfunc_type = make_node (FUNCTION_TYPE);
6616 TREE_TYPE (vfunc_type) = integer_type_node;
6617 TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6618 layout_type (vfunc_type);
6620 vtable_entry_type = build_pointer_type (vfunc_type);
6622 record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6625 = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6626 layout_type (vtbl_type_node);
6627 vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6628 record_builtin_type (RID_MAX, NULL, vtbl_type_node);
6629 vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6630 layout_type (vtbl_ptr_type_node);
6631 record_builtin_type (RID_MAX, NULL, vtbl_ptr_type_node);
6633 push_namespace (get_identifier ("__cxxabiv1"));
6634 abi_node = current_namespace;
6637 global_type_node = make_node (LANG_TYPE);
6638 record_unknown_type (global_type_node, "global type");
6641 current_lang_name = lang_name_cplusplus;
6644 tree bad_alloc_type_node, newtype, deltype;
6645 tree ptr_ftype_sizetype;
6647 push_namespace (std_identifier);
6648 bad_alloc_type_node = xref_tag
6649 (class_type_node, get_identifier ("bad_alloc"), 1);
6652 = build_function_type (ptr_type_node,
6653 tree_cons (NULL_TREE,
6656 newtype = build_exception_variant
6657 (ptr_ftype_sizetype, add_exception_specifier
6658 (NULL_TREE, bad_alloc_type_node, -1));
6659 deltype = build_exception_variant (void_ftype_ptr, empty_except_spec);
6660 push_cp_library_fn (NEW_EXPR, newtype);
6661 push_cp_library_fn (VEC_NEW_EXPR, newtype);
6662 global_delete_fndecl = push_cp_library_fn (DELETE_EXPR, deltype);
6663 push_cp_library_fn (VEC_DELETE_EXPR, deltype);
6667 = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype);
6669 /* Perform other language dependent initializations. */
6670 init_class_processing ();
6671 init_init_processing ();
6672 init_search_processing ();
6673 init_rtti_processing ();
6675 if (flag_exceptions)
6676 init_exception_processing ();
6678 if (! supports_one_only ())
6681 make_fname_decl = cp_make_fname_decl;
6682 start_fname_decls ();
6684 /* Show we use EH for cleanups. */
6685 using_eh_for_cleanups ();
6687 /* Maintain consistency. Perhaps we should just complain if they
6688 say -fwritable-strings? */
6689 if (flag_writable_strings)
6690 flag_const_strings = 0;
6692 /* Add GC roots for all of our global variables. */
6693 ggc_add_tree_root (c_global_trees, sizeof c_global_trees / sizeof(tree));
6694 ggc_add_tree_root (cp_global_trees, sizeof cp_global_trees / sizeof(tree));
6695 ggc_add_tree_root (&integer_three_node, 1);
6696 ggc_add_tree_root (&integer_two_node, 1);
6697 ggc_add_tree_root (&signed_size_zero_node, 1);
6698 ggc_add_tree_root (&size_one_node, 1);
6699 ggc_add_tree_root (&size_zero_node, 1);
6700 ggc_add_root (&global_binding_level, 1, sizeof global_binding_level,
6701 mark_binding_level);
6702 ggc_add_root (&scope_chain, 1, sizeof scope_chain, &mark_saved_scope);
6703 ggc_add_tree_root (&static_ctors, 1);
6704 ggc_add_tree_root (&static_dtors, 1);
6705 ggc_add_tree_root (&lastiddecl, 1);
6707 ggc_add_tree_root (&last_function_parms, 1);
6708 ggc_add_tree_root (&error_mark_list, 1);
6710 ggc_add_tree_root (&global_namespace, 1);
6711 ggc_add_tree_root (&global_type_node, 1);
6712 ggc_add_tree_root (&anonymous_namespace_name, 1);
6714 ggc_add_tree_root (&got_object, 1);
6715 ggc_add_tree_root (&got_scope, 1);
6717 ggc_add_tree_root (¤t_lang_name, 1);
6718 ggc_add_tree_root (&static_aggregates, 1);
6719 ggc_add_tree_root (&free_bindings, 1);
6720 ggc_add_tree_root (&incomplete_vars, 1);
6723 /* Generate an initializer for a function naming variable from
6724 NAME. NAME may be NULL, in which case we generate a special
6725 ERROR_MARK node which should be replaced later. */
6728 cp_fname_init (name)
6731 tree domain = NULL_TREE;
6733 tree init = NULL_TREE;
6738 length = strlen (name);
6739 domain = build_index_type (size_int (length));
6740 init = build_string (length + 1, name);
6743 type = build_qualified_type (char_type_node, TYPE_QUAL_CONST);
6744 type = build_cplus_array_type (type, domain);
6747 TREE_TYPE (init) = type;
6749 /* We don't know the value until instantiation time. Make
6750 something which will be digested now, but replaced later. */
6751 init = build (ERROR_MARK, type);
6756 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6757 decl, NAME is the initialization string and TYPE_DEP indicates whether
6758 NAME depended on the type of the function. We make use of that to detect
6759 __PRETTY_FUNCTION__ inside a template fn. This is being done
6760 lazily at the point of first use, so we musn't push the decl now. */
6763 cp_make_fname_decl (id, type_dep)
6767 const char *const name = (type_dep && processing_template_decl
6768 ? NULL : fname_as_string (type_dep));
6769 tree init = cp_fname_init (name);
6770 tree decl = build_decl (VAR_DECL, id, TREE_TYPE (init));
6772 /* As we don't push the decl here, we must set the context. */
6773 DECL_CONTEXT (decl) = current_function_decl;
6774 DECL_PRETTY_FUNCTION_P (decl) = type_dep;
6776 TREE_STATIC (decl) = 1;
6777 TREE_READONLY (decl) = 1;
6778 DECL_ARTIFICIAL (decl) = 1;
6779 DECL_INITIAL (decl) = init;
6781 TREE_USED (decl) = 1;
6783 cp_finish_decl (decl, init, NULL_TREE, LOOKUP_ONLYCONVERTING);
6788 /* Make a definition for a builtin function named NAME in the current
6789 namespace, whose data type is TYPE and whose context is CONTEXT.
6790 TYPE should be a function type with argument types.
6792 CLASS and CODE tell later passes how to compile calls to this function.
6793 See tree.h for possible values.
6795 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6796 the name to be called if we can't opencode the function. */
6799 builtin_function_1 (name, type, context, code, class, libname)
6804 enum built_in_class class;
6805 const char *libname;
6807 tree decl = build_library_fn_1 (get_identifier (name), ERROR_MARK, type);
6808 DECL_BUILT_IN_CLASS (decl) = class;
6809 DECL_FUNCTION_CODE (decl) = code;
6810 DECL_CONTEXT (decl) = context;
6812 /* The return builtins leave the current function. */
6813 if (code == BUILT_IN_RETURN || code == BUILT_IN_EH_RETURN)
6814 TREE_THIS_VOLATILE (decl) = 1;
6818 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6819 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6820 function in the namespace. */
6822 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (libname));
6823 make_decl_rtl (decl, NULL);
6825 /* Warn if a function in the namespace for users
6826 is used without an occasion to consider it declared. */
6827 if (name[0] != '_' || name[1] != '_')
6828 DECL_ANTICIPATED (decl) = 1;
6830 /* Possibly apply some default attributes to this built-in function. */
6831 decl_attributes (&decl, NULL_TREE, 0);
6836 /* Entry point for the benefit of c_common_nodes_and_builtins.
6838 Make a defintion for a builtin function named NAME and whose data type
6839 is TYPE. TYPE should be a function type with argument types. This
6840 function places the anticipated declaration in the global namespace
6841 and additionally in the std namespace if appropriate.
6843 CLASS and CODE tell later passes how to compile calls to this function.
6844 See tree.h for possible values.
6846 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6847 the name to be called if we can't opencode the function. */
6850 builtin_function (name, type, code, class, libname)
6854 enum built_in_class class;
6855 const char *libname;
6857 /* All builtins that don't begin with an '_' should additionally
6858 go in the 'std' namespace. */
6861 push_namespace (std_identifier);
6862 builtin_function_1 (name, type, std_node, code, class, libname);
6866 return builtin_function_1 (name, type, NULL_TREE, code, class, libname);
6869 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6870 function. Not called directly. */
6873 build_library_fn_1 (name, operator_code, type)
6875 enum tree_code operator_code;
6878 tree fn = build_lang_decl (FUNCTION_DECL, name, type);
6879 DECL_EXTERNAL (fn) = 1;
6880 TREE_PUBLIC (fn) = 1;
6881 DECL_ARTIFICIAL (fn) = 1;
6882 TREE_NOTHROW (fn) = 1;
6883 SET_OVERLOADED_OPERATOR_CODE (fn, operator_code);
6884 SET_DECL_LANGUAGE (fn, lang_c);
6888 /* Returns the _DECL for a library function with C linkage.
6889 We assume that such functions never throw; if this is incorrect,
6890 callers should unset TREE_NOTHROW. */
6893 build_library_fn (name, type)
6897 return build_library_fn_1 (name, ERROR_MARK, type);
6900 /* Returns the _DECL for a library function with C++ linkage. */
6903 build_cp_library_fn (name, operator_code, type)
6905 enum tree_code operator_code;
6908 tree fn = build_library_fn_1 (name, operator_code, type);
6909 TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type);
6910 DECL_CONTEXT (fn) = FROB_CONTEXT (current_namespace);
6911 SET_DECL_LANGUAGE (fn, lang_cplusplus);
6912 set_mangled_name_for_decl (fn);
6916 /* Like build_library_fn, but takes a C string instead of an
6920 build_library_fn_ptr (name, type)
6924 return build_library_fn (get_identifier (name), type);
6927 /* Like build_cp_library_fn, but takes a C string instead of an
6931 build_cp_library_fn_ptr (name, type)
6935 return build_cp_library_fn (get_identifier (name), ERROR_MARK, type);
6938 /* Like build_library_fn, but also pushes the function so that we will
6939 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6942 push_library_fn (name, type)
6945 tree fn = build_library_fn (name, type);
6946 pushdecl_top_level (fn);
6950 /* Like build_cp_library_fn, but also pushes the function so that it
6951 will be found by normal lookup. */
6954 push_cp_library_fn (operator_code, type)
6955 enum tree_code operator_code;
6958 tree fn = build_cp_library_fn (ansi_opname (operator_code),
6965 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6969 push_void_library_fn (name, parmtypes)
6970 tree name, parmtypes;
6972 tree type = build_function_type (void_type_node, parmtypes);
6973 return push_library_fn (name, type);
6976 /* Like push_library_fn, but also note that this function throws
6977 and does not return. Used for __throw_foo and the like. */
6980 push_throw_library_fn (name, type)
6983 tree fn = push_library_fn (name, type);
6984 TREE_THIS_VOLATILE (fn) = 1;
6985 TREE_NOTHROW (fn) = 0;
6989 /* Apply default attributes to a function, if a system function with default
6993 insert_default_attributes (decl)
6996 if (!DECL_EXTERN_C_FUNCTION_P (decl))
6998 if (!TREE_PUBLIC (decl))
7000 c_common_insert_default_attributes (decl);
7003 /* When we call finish_struct for an anonymous union, we create
7004 default copy constructors and such. But, an anonymous union
7005 shouldn't have such things; this function undoes the damage to the
7006 anonymous union type T.
7008 (The reason that we create the synthesized methods is that we don't
7009 distinguish `union { int i; }' from `typedef union { int i; } U'.
7010 The first is an anonymous union; the second is just an ordinary
7014 fixup_anonymous_aggr (t)
7019 /* Wipe out memory of synthesized methods */
7020 TYPE_HAS_CONSTRUCTOR (t) = 0;
7021 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
7022 TYPE_HAS_INIT_REF (t) = 0;
7023 TYPE_HAS_CONST_INIT_REF (t) = 0;
7024 TYPE_HAS_ASSIGN_REF (t) = 0;
7025 TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
7027 /* Splice the implicitly generated functions out of the TYPE_METHODS
7029 q = &TYPE_METHODS (t);
7032 if (DECL_ARTIFICIAL (*q))
7033 *q = TREE_CHAIN (*q);
7035 q = &TREE_CHAIN (*q);
7038 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
7039 if (TYPE_METHODS (t))
7040 cp_error_at ("an anonymous union cannot have function members", t);
7042 /* Anonymous aggregates cannot have fields with ctors, dtors or complex
7043 assignment operators (because they cannot have these methods themselves).
7044 For anonymous unions this is already checked because they are not allowed
7045 in any union, otherwise we have to check it. */
7046 if (TREE_CODE (t) != UNION_TYPE)
7050 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
7051 if (TREE_CODE (field) == FIELD_DECL)
7053 type = TREE_TYPE (field);
7054 if (CLASS_TYPE_P (type))
7056 if (TYPE_NEEDS_CONSTRUCTING (type))
7057 cp_error_at ("member %#D' with constructor not allowed in anonymous aggregate",
7059 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7060 cp_error_at ("member %#D' with destructor not allowed in anonymous aggregate",
7062 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type))
7063 cp_error_at ("member %#D' with copy assignment operator not allowed in anonymous aggregate",
7070 /* Make sure that a declaration with no declarator is well-formed, i.e.
7071 just defines a tagged type or anonymous union.
7073 Returns the type defined, if any. */
7076 check_tag_decl (declspecs)
7081 int saw_typedef = 0;
7082 tree ob_modifier = NULL_TREE;
7084 register tree t = NULL_TREE;
7086 for (link = declspecs; link; link = TREE_CHAIN (link))
7088 register tree value = TREE_VALUE (link);
7091 || TREE_CODE (value) == TYPE_DECL
7092 || (TREE_CODE (value) == IDENTIFIER_NODE
7093 && IDENTIFIER_GLOBAL_VALUE (value)
7094 && TREE_CODE (IDENTIFIER_GLOBAL_VALUE (value)) == TYPE_DECL))
7098 if (found_type == 2 && TREE_CODE (value) == IDENTIFIER_NODE)
7100 if (! in_system_header)
7101 pedwarn ("redeclaration of C++ built-in type `%T'", value);
7106 && ((TREE_CODE (value) != TYPENAME_TYPE && IS_AGGR_TYPE (value))
7107 || TREE_CODE (value) == ENUMERAL_TYPE))
7109 my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
7113 else if (value == ridpointers[(int) RID_TYPEDEF])
7115 else if (value == ridpointers[(int) RID_FRIEND])
7117 if (current_class_type == NULL_TREE
7118 || current_scope () != current_class_type)
7119 ob_modifier = value;
7123 else if (value == ridpointers[(int) RID_STATIC]
7124 || value == ridpointers[(int) RID_EXTERN]
7125 || value == ridpointers[(int) RID_AUTO]
7126 || value == ridpointers[(int) RID_REGISTER]
7127 || value == ridpointers[(int) RID_INLINE]
7128 || value == ridpointers[(int) RID_VIRTUAL]
7129 || value == ridpointers[(int) RID_CONST]
7130 || value == ridpointers[(int) RID_VOLATILE]
7131 || value == ridpointers[(int) RID_EXPLICIT])
7132 ob_modifier = value;
7136 error ("multiple types in one declaration");
7138 if (t == NULL_TREE && ! saw_friend)
7139 pedwarn ("declaration does not declare anything");
7141 /* Check for an anonymous union. */
7142 else if (t && IS_AGGR_TYPE_CODE (TREE_CODE (t))
7143 && TYPE_ANONYMOUS_P (t))
7145 /* 7/3 In a simple-declaration, the optional init-declarator-list
7146 can be omitted only when declaring a class (clause 9) or
7147 enumeration (7.2), that is, when the decl-specifier-seq contains
7148 either a class-specifier, an elaborated-type-specifier with
7149 a class-key (9.1), or an enum-specifier. In these cases and
7150 whenever a class-specifier or enum-specifier is present in the
7151 decl-specifier-seq, the identifiers in these specifiers are among
7152 the names being declared by the declaration (as class-name,
7153 enum-names, or enumerators, depending on the syntax). In such
7154 cases, and except for the declaration of an unnamed bit-field (9.6),
7155 the decl-specifier-seq shall introduce one or more names into the
7156 program, or shall redeclare a name introduced by a previous
7157 declaration. [Example:
7158 enum { }; // ill-formed
7159 typedef class { }; // ill-formed
7163 error ("missing type-name in typedef-declaration");
7166 /* Anonymous unions are objects, so they can have specifiers. */;
7167 SET_ANON_AGGR_TYPE_P (t);
7169 if (TREE_CODE (t) != UNION_TYPE && pedantic && ! in_system_header)
7170 pedwarn ("ISO C++ prohibits anonymous structs");
7173 else if (ob_modifier)
7175 if (ob_modifier == ridpointers[(int) RID_INLINE]
7176 || ob_modifier == ridpointers[(int) RID_VIRTUAL])
7177 error ("`%D' can only be specified for functions", ob_modifier);
7178 else if (ob_modifier == ridpointers[(int) RID_FRIEND])
7179 error ("`%D' can only be specified inside a class", ob_modifier);
7180 else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
7181 error ("`%D' can only be specified for constructors",
7184 error ("`%D' can only be specified for objects and functions",
7191 /* Called when a declaration is seen that contains no names to declare.
7192 If its type is a reference to a structure, union or enum inherited
7193 from a containing scope, shadow that tag name for the current scope
7194 with a forward reference.
7195 If its type defines a new named structure or union
7196 or defines an enum, it is valid but we need not do anything here.
7197 Otherwise, it is an error.
7199 C++: may have to grok the declspecs to learn about static,
7200 complain for anonymous unions. */
7203 shadow_tag (declspecs)
7206 tree t = check_tag_decl (declspecs);
7209 maybe_process_partial_specialization (t);
7211 /* This is where the variables in an anonymous union are
7212 declared. An anonymous union declaration looks like:
7214 because there is no declarator after the union, the parser
7215 sends that declaration here. */
7216 if (t && ANON_AGGR_TYPE_P (t))
7218 fixup_anonymous_aggr (t);
7220 if (TYPE_FIELDS (t))
7222 tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
7224 finish_anon_union (decl);
7229 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7232 groktypename (typename)
7237 if (TREE_CODE (typename) != TREE_LIST)
7239 split_specs_attrs (TREE_PURPOSE (typename), &specs, &attrs);
7240 type = grokdeclarator (TREE_VALUE (typename), specs,
7241 TYPENAME, 0, &attrs);
7243 cplus_decl_attributes (&type, attrs, 0);
7247 /* Decode a declarator in an ordinary declaration or data definition.
7248 This is called as soon as the type information and variable name
7249 have been parsed, before parsing the initializer if any.
7250 Here we create the ..._DECL node, fill in its type,
7251 and put it on the list of decls for the current context.
7252 The ..._DECL node is returned as the value.
7254 Exception: for arrays where the length is not specified,
7255 the type is left null, to be filled in by `cp_finish_decl'.
7257 Function definitions do not come here; they go to start_function
7258 instead. However, external and forward declarations of functions
7259 do go through here. Structure field declarations are done by
7260 grokfield and not through here. */
7263 start_decl (declarator, declspecs, initialized, attributes, prefix_attributes)
7264 tree declarator, declspecs;
7266 tree attributes, prefix_attributes;
7269 register tree type, tem;
7271 extern int have_extern_spec;
7272 extern int used_extern_spec;
7275 /* See code below that used this. */
7276 int init_written = initialized;
7279 /* This should only be done once on the top most decl. */
7280 if (have_extern_spec && !used_extern_spec)
7282 declspecs = tree_cons (NULL_TREE, get_identifier ("extern"),
7284 used_extern_spec = 1;
7287 /* An object declared as __attribute__((deprecated)) suppresses
7288 warnings of uses of other deprecated items. */
7289 if (lookup_attribute ("deprecated", attributes))
7290 deprecated_state = DEPRECATED_SUPPRESS;
7292 attributes = chainon (attributes, prefix_attributes);
7294 decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
7297 deprecated_state = DEPRECATED_NORMAL;
7299 if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
7302 type = TREE_TYPE (decl);
7304 if (type == error_mark_node)
7307 context = DECL_CONTEXT (decl);
7309 if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
7310 && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
7312 /* When parsing the initializer, lookup should use the object's
7314 push_decl_namespace (context);
7317 /* We are only interested in class contexts, later. */
7318 if (context && TREE_CODE (context) == NAMESPACE_DECL)
7319 context = NULL_TREE;
7322 /* Is it valid for this decl to have an initializer at all?
7323 If not, set INITIALIZED to zero, which will indirectly
7324 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7325 switch (TREE_CODE (decl))
7328 /* typedef foo = bar means give foo the same type as bar.
7329 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7330 Any other case of an initialization in a TYPE_DECL is an error. */
7331 if (pedantic || list_length (declspecs) > 1)
7333 error ("typedef `%D' is initialized", decl);
7339 error ("function `%#D' is initialized like a variable", decl);
7349 if (! toplevel_bindings_p ()
7350 && DECL_EXTERNAL (decl))
7351 warning ("declaration of `%#D' has `extern' and is initialized",
7353 DECL_EXTERNAL (decl) = 0;
7354 if (toplevel_bindings_p ())
7355 TREE_STATIC (decl) = 1;
7357 /* Tell `pushdecl' this is an initialized decl
7358 even though we don't yet have the initializer expression.
7359 Also tell `cp_finish_decl' it may store the real initializer. */
7360 DECL_INITIAL (decl) = error_mark_node;
7363 /* Set attributes here so if duplicate decl, will have proper attributes. */
7364 cplus_decl_attributes (&decl, attributes, 0);
7366 /* If #pragma weak was used, mark the decl weak now. */
7367 if (current_binding_level == global_binding_level)
7368 maybe_apply_pragma_weak (decl);
7370 if (TREE_CODE (decl) == FUNCTION_DECL
7371 && DECL_DECLARED_INLINE_P (decl)
7372 && DECL_UNINLINABLE (decl)
7373 && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl)))
7374 warning_with_decl (decl,
7375 "inline function `%s' given attribute noinline");
7377 if (context && COMPLETE_TYPE_P (complete_type (context)))
7379 push_nested_class (context, 2);
7381 if (TREE_CODE (decl) == VAR_DECL)
7383 tree field = lookup_field (context, DECL_NAME (decl), 0, 0);
7384 if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
7385 error ("`%#D' is not a static member of `%#T'", decl, context);
7388 if (DECL_CONTEXT (field) != context)
7390 pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7391 DECL_CONTEXT (field), DECL_NAME (decl),
7392 context, DECL_NAME (decl));
7393 DECL_CONTEXT (decl) = DECL_CONTEXT (field);
7395 /* Static data member are tricky; an in-class initialization
7396 still doesn't provide a definition, so the in-class
7397 declaration will have DECL_EXTERNAL set, but will have an
7398 initialization. Thus, duplicate_decls won't warn
7399 about this situation, and so we check here. */
7400 if (DECL_INITIAL (decl) && DECL_INITIAL (field))
7401 error ("duplicate initialization of %D", decl);
7402 if (duplicate_decls (decl, field))
7408 tree field = check_classfn (context, decl);
7409 if (field && duplicate_decls (decl, field))
7413 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7414 DECL_IN_AGGR_P (decl) = 0;
7415 if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
7416 || CLASSTYPE_TEMPLATE_INSTANTIATION (context))
7418 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
7419 /* [temp.expl.spec] An explicit specialization of a static data
7420 member of a template is a definition if the declaration
7421 includes an initializer; otherwise, it is a declaration.
7423 We check for processing_specialization so this only applies
7424 to the new specialization syntax. */
7425 if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
7426 DECL_EXTERNAL (decl) = 1;
7429 if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
7430 pedwarn ("declaration of `%#D' outside of class is not definition",
7434 /* Enter this declaration into the symbol table. */
7435 tem = maybe_push_decl (decl);
7437 if (processing_template_decl)
7438 tem = push_template_decl (tem);
7440 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7441 /* Tell the back-end to use or not use .common as appropriate. If we say
7442 -fconserve-space, we want this to save .data space, at the expense of
7443 wrong semantics. If we say -fno-conserve-space, we want this to
7444 produce errors about redefs; to do this we force variables into the
7446 DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem);
7449 if (! processing_template_decl)
7459 tree type = TREE_TYPE (decl);
7460 int initialized = (DECL_INITIAL (decl) != NULL_TREE);
7462 if (type == error_mark_node)
7465 maybe_push_cleanup_level (type);
7468 /* Is it valid for this decl to have an initializer at all?
7469 If not, set INITIALIZED to zero, which will indirectly
7470 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7472 /* Don't allow initializations for incomplete types except for
7473 arrays which might be completed by the initialization. */
7474 if (COMPLETE_TYPE_P (complete_type (type)))
7475 ; /* A complete type is ok. */
7476 else if (TREE_CODE (type) != ARRAY_TYPE)
7478 error ("variable `%#D' has initializer but incomplete type",
7481 type = TREE_TYPE (decl) = error_mark_node;
7483 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type))))
7485 if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
7486 error ("elements of array `%#D' have incomplete type", decl);
7487 /* else we already gave an error in start_decl. */
7493 && TREE_CODE (decl) != TYPE_DECL
7494 && TREE_CODE (decl) != TEMPLATE_DECL
7495 && type != error_mark_node
7496 && IS_AGGR_TYPE (type)
7497 && ! DECL_EXTERNAL (decl))
7499 if ((! processing_template_decl || ! uses_template_parms (type))
7500 && !COMPLETE_TYPE_P (complete_type (type)))
7502 error ("aggregate `%#D' has incomplete type and cannot be defined",
7504 /* Change the type so that assemble_variable will give
7505 DECL an rtl we can live with: (mem (const_int 0)). */
7506 type = TREE_TYPE (decl) = error_mark_node;
7510 /* If any base type in the hierarchy of TYPE needs a constructor,
7511 then we set initialized to 1. This way any nodes which are
7512 created for the purposes of initializing this aggregate
7513 will live as long as it does. This is necessary for global
7514 aggregates which do not have their initializers processed until
7515 the end of the file. */
7516 initialized = TYPE_NEEDS_CONSTRUCTING (type);
7521 DECL_INITIAL (decl) = NULL_TREE;
7524 /* Handle initialization of references.
7525 These three arguments are from `cp_finish_decl', and have the
7526 same meaning here that they do there.
7528 Quotes on semantics can be found in ARM 8.4.3. */
7531 grok_reference_init (decl, type, init)
7532 tree decl, type, init;
7536 if (init == NULL_TREE)
7538 if ((DECL_LANG_SPECIFIC (decl) == 0
7539 || DECL_IN_AGGR_P (decl) == 0)
7540 && ! DECL_THIS_EXTERN (decl))
7541 error ("`%D' declared as reference but not initialized", decl);
7545 if (init == error_mark_node)
7548 if (TREE_CODE (init) == CONSTRUCTOR)
7550 error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl);
7554 if (TREE_CODE (init) == TREE_LIST)
7555 init = build_compound_expr (init);
7557 if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
7558 init = convert_from_reference (init);
7560 if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
7561 && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
7563 /* Note: default conversion is only called in very special cases. */
7564 init = default_conversion (init);
7567 /* Convert INIT to the reference type TYPE. This may involve the
7568 creation of a temporary, whose lifetime must be the same as that
7569 of the reference. If so, a DECL_STMT for the temporary will be
7570 added just after the DECL_STMT for DECL. That's why we don't set
7571 DECL_INITIAL for local references (instead assigning to them
7572 explicitly); we need to allow the temporary to be initialized
7574 tmp = convert_to_reference
7575 (type, init, CONV_IMPLICIT,
7576 LOOKUP_ONLYCONVERTING|LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND,
7579 if (tmp == error_mark_node)
7581 else if (tmp == NULL_TREE)
7583 error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
7587 if (TREE_STATIC (decl) && !TREE_CONSTANT (tmp))
7590 DECL_INITIAL (decl) = tmp;
7595 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7596 mucking with forces it does not comprehend (i.e. initialization with a
7597 constructor). If we are at global scope and won't go into COMMON, fill
7598 it in with a dummy CONSTRUCTOR to force the variable into .data;
7599 otherwise we can use error_mark_node. */
7602 obscure_complex_init (decl, init)
7605 if (! flag_no_inline && TREE_STATIC (decl))
7607 if (extract_init (decl, init))
7611 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7612 if (toplevel_bindings_p () && ! DECL_COMMON (decl))
7613 DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE,
7617 DECL_INITIAL (decl) = error_mark_node;
7622 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7623 array until we finish parsing the initializer. If that's the
7624 situation we're in, update DECL accordingly. */
7627 maybe_deduce_size_from_array_init (decl, init)
7631 tree type = TREE_TYPE (decl);
7633 if (TREE_CODE (type) == ARRAY_TYPE
7634 && TYPE_DOMAIN (type) == NULL_TREE
7635 && TREE_CODE (decl) != TYPE_DECL)
7637 /* do_default is really a C-ism to deal with tentative definitions.
7638 But let's leave it here to ease the eventual merge. */
7639 int do_default = !DECL_EXTERNAL (decl);
7640 tree initializer = init ? init : DECL_INITIAL (decl);
7641 int failure = complete_array_type (type, initializer, do_default);
7644 error ("initializer fails to determine size of `%D'", decl);
7649 error ("array size missing in `%D'", decl);
7650 /* If a `static' var's size isn't known, make it extern as
7651 well as static, so it does not get allocated. If it's not
7652 `static', then don't mark it extern; finish_incomplete_decl
7653 will give it a default size and it will get allocated. */
7654 else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7655 DECL_EXTERNAL (decl) = 1;
7658 if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7659 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7661 error ("zero-size array `%D'", decl);
7663 layout_decl (decl, 0);
7667 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7668 any appropriate error messages regarding the layout. */
7671 layout_var_decl (decl)
7674 tree type = TREE_TYPE (decl);
7676 tree ttype = target_type (type);
7679 /* If we haven't already layed out this declaration, do so now.
7680 Note that we must not call complete type for an external object
7681 because it's type might involve templates that we are not
7682 supposed to isntantiate yet. (And it's perfectly legal to say
7683 `extern X x' for some incomplete type `X'.) */
7684 if (!DECL_EXTERNAL (decl))
7685 complete_type (type);
7686 if (!DECL_SIZE (decl) && COMPLETE_TYPE_P (type))
7687 layout_decl (decl, 0);
7689 if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7691 /* An automatic variable with an incomplete type: that is an error.
7692 Don't talk about array types here, since we took care of that
7693 message in grokdeclarator. */
7694 error ("storage size of `%D' isn't known", decl);
7695 TREE_TYPE (decl) = error_mark_node;
7698 /* Keep this code around in case we later want to control debug info
7699 based on whether a type is "used". (jason 1999-11-11) */
7701 else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7702 /* Let debugger know it should output info for this type. */
7703 note_debug_info_needed (ttype);
7705 if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7706 note_debug_info_needed (DECL_CONTEXT (decl));
7709 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7710 && DECL_SIZE (decl) != NULL_TREE
7711 && ! TREE_CONSTANT (DECL_SIZE (decl)))
7713 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7714 constant_expression_warning (DECL_SIZE (decl));
7716 error ("storage size of `%D' isn't constant", decl);
7719 if (TREE_STATIC (decl)
7720 && !DECL_ARTIFICIAL (decl)
7721 && current_function_decl
7722 && DECL_CONTEXT (decl) == current_function_decl)
7723 push_local_name (decl);
7726 /* If a local static variable is declared in an inline function, or if
7727 we have a weak definition, we must endeavor to create only one
7728 instance of the variable at link-time. */
7731 maybe_commonize_var (decl)
7734 /* Static data in a function with comdat linkage also has comdat
7736 if (TREE_STATIC (decl)
7737 /* Don't mess with __FUNCTION__. */
7738 && ! DECL_ARTIFICIAL (decl)
7739 && current_function_decl
7740 && DECL_CONTEXT (decl) == current_function_decl
7741 && (DECL_DECLARED_INLINE_P (current_function_decl)
7742 || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7743 && TREE_PUBLIC (current_function_decl))
7745 /* If flag_weak, we don't need to mess with this, as we can just
7746 make the function weak, and let it refer to its unique local
7747 copy. This works because we don't allow the function to be
7751 if (DECL_INTERFACE_KNOWN (current_function_decl))
7753 TREE_PUBLIC (decl) = 1;
7754 DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7756 else if (DECL_INITIAL (decl) == NULL_TREE
7757 || DECL_INITIAL (decl) == error_mark_node)
7759 TREE_PUBLIC (decl) = 1;
7760 DECL_COMMON (decl) = 1;
7762 /* else we lose. We can only do this if we can use common,
7763 which we can't if it has been initialized. */
7765 if (!TREE_PUBLIC (decl))
7767 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7768 cp_warning_at (" you can work around this by removing the initializer", decl);
7772 comdat_linkage (decl);
7774 else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
7775 /* Set it up again; we might have set DECL_INITIAL since the last
7777 comdat_linkage (decl);
7780 /* Issue an error message if DECL is an uninitialized const variable. */
7783 check_for_uninitialized_const_var (decl)
7786 tree type = TREE_TYPE (decl);
7788 /* ``Unless explicitly declared extern, a const object does not have
7789 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7791 if (TREE_CODE (decl) == VAR_DECL
7792 && TREE_CODE (type) != REFERENCE_TYPE
7793 && CP_TYPE_CONST_P (type)
7794 && !TYPE_NEEDS_CONSTRUCTING (type)
7795 && !DECL_INITIAL (decl))
7796 error ("uninitialized const `%D'", decl);
7799 /* Verify INIT (the initializer for DECL), and record the
7800 initialization in DECL_INITIAL, if appropriate. Returns a new
7804 check_initializer (decl, init)
7810 if (TREE_CODE (decl) == FIELD_DECL)
7813 type = TREE_TYPE (decl);
7815 /* If `start_decl' didn't like having an initialization, ignore it now. */
7816 if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7819 /* Check the initializer. */
7822 /* Things that are going to be initialized need to have complete
7824 TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl));
7826 if (type == error_mark_node)
7827 /* We will have already complained. */
7829 else if (COMPLETE_TYPE_P (type) && !TREE_CONSTANT (TYPE_SIZE (type)))
7831 error ("variable-sized object `%D' may not be initialized", decl);
7834 else if (TREE_CODE (type) == ARRAY_TYPE
7835 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (type))))
7837 error ("elements of array `%#D' have incomplete type", decl);
7840 else if (TREE_CODE (type) != ARRAY_TYPE && !COMPLETE_TYPE_P (type))
7842 error ("`%D' has incomplete type", decl);
7843 TREE_TYPE (decl) = error_mark_node;
7848 if (TREE_CODE (decl) == CONST_DECL)
7850 my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7852 DECL_INITIAL (decl) = init;
7854 my_friendly_assert (init != NULL_TREE, 149);
7857 else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE)
7859 init = grok_reference_init (decl, type, init);
7861 init = obscure_complex_init (decl, init);
7865 if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7867 if (TREE_CODE (type) == ARRAY_TYPE)
7868 init = digest_init (type, init, (tree *) 0);
7869 else if (TREE_CODE (init) == CONSTRUCTOR
7870 && TREE_HAS_CONSTRUCTOR (init))
7872 if (TYPE_NON_AGGREGATE_CLASS (type))
7874 error ("`%D' must be initialized by constructor, not by `{...}'",
7876 init = error_mark_node;
7879 goto dont_use_constructor;
7884 dont_use_constructor:
7885 if (TREE_CODE (init) != TREE_VEC)
7886 init = store_init_value (decl, init);
7890 /* We must hide the initializer so that expand_decl
7891 won't try to do something it does not understand. */
7892 init = obscure_complex_init (decl, init);
7894 else if (DECL_EXTERNAL (decl))
7896 else if (TYPE_P (type)
7897 && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type)))
7899 tree core_type = strip_array_types (type);
7901 if (! TYPE_NEEDS_CONSTRUCTING (core_type))
7903 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type))
7904 error ("structure `%D' with uninitialized const members", decl);
7905 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))
7906 error ("structure `%D' with uninitialized reference members",
7910 check_for_uninitialized_const_var (decl);
7912 if (COMPLETE_TYPE_P (type) && TYPE_NEEDS_CONSTRUCTING (type))
7913 init = obscure_complex_init (decl, NULL_TREE);
7917 check_for_uninitialized_const_var (decl);
7922 /* If DECL is not a local variable, give it RTL. */
7925 make_rtl_for_nonlocal_decl (decl, init, asmspec)
7928 const char *asmspec;
7930 int toplev = toplevel_bindings_p ();
7933 /* Handle non-variables up front. */
7934 if (TREE_CODE (decl) != VAR_DECL)
7936 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7940 /* If we see a class member here, it should be a static data
7942 if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl))
7944 my_friendly_assert (TREE_STATIC (decl), 19990828);
7945 /* An in-class declaration of a static data member should be
7946 external; it is only a declaration, and not a definition. */
7947 if (init == NULL_TREE)
7948 my_friendly_assert (DECL_EXTERNAL (decl), 20000723);
7951 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7954 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (asmspec));
7955 /* The `register' keyword, when used together with an
7956 asm-specification, indicates that the variable should be
7957 placed in a particular register. */
7958 if (DECL_REGISTER (decl))
7959 DECL_C_HARD_REGISTER (decl) = 1;
7962 /* We don't create any RTL for local variables. */
7963 if (DECL_FUNCTION_SCOPE_P (decl) && !TREE_STATIC (decl))
7966 /* We defer emission of local statics until the corresponding
7967 DECL_STMT is expanded. */
7968 defer_p = DECL_FUNCTION_SCOPE_P (decl) || DECL_VIRTUAL_P (decl);
7970 /* We try to defer namespace-scope static constants so that they are
7971 not emitted into the object file unnecessarily. */
7972 if (!DECL_VIRTUAL_P (decl)
7973 && TREE_READONLY (decl)
7974 && DECL_INITIAL (decl) != NULL_TREE
7975 && DECL_INITIAL (decl) != error_mark_node
7976 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl))
7978 && !TREE_PUBLIC (decl))
7980 /* Fool with the linkage of static consts according to #pragma
7982 if (!interface_unknown && !TREE_PUBLIC (decl))
7984 TREE_PUBLIC (decl) = 1;
7985 DECL_EXTERNAL (decl) = interface_only;
7990 /* Likewise for template instantiations. */
7991 else if (DECL_COMDAT (decl))
7994 /* If we're deferring the variable, we only need to make RTL if
7995 there's an ASMSPEC. Otherwise, we'll lazily create it later when
7996 we need it. (There's no way to lazily create RTL for things that
7997 have assembly specs because the information about the specifier
7998 isn't stored in the tree, yet) */
7999 if (defer_p && asmspec)
8000 make_decl_rtl (decl, asmspec);
8001 /* If we're not deferring, go ahead and assemble the variable. */
8003 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
8006 /* The old ARM scoping rules injected variables declared in the
8007 initialization statement of a for-statement into the surrounding
8008 scope. We support this usage, in order to be backward-compatible.
8009 DECL is a just-declared VAR_DECL; if necessary inject its
8010 declaration into the surrounding scope. */
8013 maybe_inject_for_scope_var (decl)
8016 if (!DECL_NAME (decl))
8019 if (current_binding_level->is_for_scope)
8021 struct binding_level *outer
8022 = current_binding_level->level_chain;
8024 /* Check to see if the same name is already bound at the outer
8025 level, either because it was directly declared, or because a
8026 dead for-decl got preserved. In either case, the code would
8027 not have been valid under the ARM scope rules, so clear
8028 is_for_scope for the current_binding_level.
8030 Otherwise, we need to preserve the temp slot for decl to last
8031 into the outer binding level. */
8034 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
8036 if (outer_binding && BINDING_LEVEL (outer_binding) == outer
8037 && (TREE_CODE (BINDING_VALUE (outer_binding))
8039 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
8041 BINDING_VALUE (outer_binding)
8042 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
8043 current_binding_level->is_for_scope = 0;
8045 else if (DECL_IN_MEMORY_P (decl))
8046 preserve_temp_slots (DECL_RTL (decl));
8050 /* Generate code to initialize DECL (a local variable). */
8053 initialize_local_var (decl, init, flags)
8058 tree type = TREE_TYPE (decl);
8060 /* If the type is bogus, don't bother initializing the variable. */
8061 if (type == error_mark_node)
8064 if (DECL_SIZE (decl) == NULL_TREE && !TREE_STATIC (decl))
8066 /* If we used it already as memory, it must stay in memory. */
8067 DECL_INITIAL (decl) = NULL_TREE;
8068 TREE_ADDRESSABLE (decl) = TREE_USED (decl);
8071 /* Local statics are handled differently from ordinary automatic
8073 if (TREE_STATIC (decl))
8075 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
8076 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
8077 expand_static_init (decl, init);
8081 if (DECL_SIZE (decl) && type != error_mark_node)
8085 /* Compute and store the initial value. */
8086 already_used = TREE_USED (decl) || TREE_USED (type);
8088 if (init || TYPE_NEEDS_CONSTRUCTING (type))
8090 int saved_stmts_are_full_exprs_p;
8092 my_friendly_assert (building_stmt_tree (), 20000906);
8093 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p ();
8094 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
8095 finish_expr_stmt (build_aggr_init (decl, init, flags));
8096 current_stmt_tree ()->stmts_are_full_exprs_p =
8097 saved_stmts_are_full_exprs_p;
8100 /* Set this to 0 so we can tell whether an aggregate which was
8101 initialized was ever used. Don't do this if it has a
8102 destructor, so we don't complain about the 'resource
8103 allocation is initialization' idiom. Now set
8104 attribute((unused)) on types so decls of that type will be
8105 marked used. (see TREE_USED, above.) */
8106 if (TYPE_NEEDS_CONSTRUCTING (type)
8108 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type)
8109 && DECL_NAME (decl))
8110 TREE_USED (decl) = 0;
8111 else if (already_used)
8112 TREE_USED (decl) = 1;
8116 /* Generate code to destroy DECL (a local variable). */
8119 destroy_local_var (decl)
8122 tree type = TREE_TYPE (decl);
8125 /* Only variables get cleaned up. */
8126 if (TREE_CODE (decl) != VAR_DECL)
8129 /* And only things with destructors need cleaning up. */
8130 if (type == error_mark_node
8131 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
8134 if (TREE_CODE (decl) == VAR_DECL &&
8135 (DECL_EXTERNAL (decl) || TREE_STATIC (decl)))
8136 /* We don't clean up things that aren't defined in this
8137 translation unit, or that need a static cleanup. The latter
8138 are handled by finish_file. */
8141 /* Compute the cleanup. */
8142 cleanup = maybe_build_cleanup (decl);
8144 /* Record the cleanup required for this declaration. */
8145 if (DECL_SIZE (decl) && cleanup)
8146 finish_decl_cleanup (decl, cleanup);
8149 /* Finish processing of a declaration;
8150 install its line number and initial value.
8151 If the length of an array type is not known before,
8152 it must be determined now, from the initial value, or it is an error.
8154 INIT holds the value of an initializer that should be allowed to escape
8157 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8158 if the (init) syntax was used. */
8161 cp_finish_decl (decl, init, asmspec_tree, flags)
8167 tree ttype = NULL_TREE;
8168 const char *asmspec = NULL;
8169 int was_readonly = 0;
8174 error ("assignment (not initialization) in declaration");
8178 /* If a name was specified, get the string. */
8179 if (current_binding_level == global_binding_level)
8180 asmspec_tree = maybe_apply_renaming_pragma (decl, asmspec_tree);
8182 asmspec = TREE_STRING_POINTER (asmspec_tree);
8184 if (init && TREE_CODE (init) == NAMESPACE_DECL)
8186 error ("cannot initialize `%D' to namespace `%D'",
8191 if (current_class_type
8192 && CP_DECL_CONTEXT (decl) == current_class_type
8193 && TYPE_BEING_DEFINED (current_class_type)
8194 && (DECL_INITIAL (decl) || init))
8195 DECL_INITIALIZED_IN_CLASS_P (decl) = 1;
8197 if (TREE_CODE (decl) == VAR_DECL
8198 && DECL_CONTEXT (decl)
8199 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
8200 && DECL_CONTEXT (decl) != current_namespace
8203 /* Leave the namespace of the object. */
8204 pop_decl_namespace ();
8207 type = TREE_TYPE (decl);
8209 if (type == error_mark_node)
8212 if (TYPE_HAS_MUTABLE_P (type))
8213 TREE_READONLY (decl) = 0;
8215 if (processing_template_decl)
8217 /* Add this declaration to the statement-tree. */
8218 if (at_function_scope_p ()
8219 && TREE_CODE (decl) != RESULT_DECL)
8220 add_decl_stmt (decl);
8222 if (init && DECL_INITIAL (decl))
8223 DECL_INITIAL (decl) = init;
8227 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8228 my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828);
8230 /* Take care of TYPE_DECLs up front. */
8231 if (TREE_CODE (decl) == TYPE_DECL)
8233 if (init && DECL_INITIAL (decl))
8235 /* typedef foo = bar; store the type of bar as the type of foo. */
8236 TREE_TYPE (decl) = type = TREE_TYPE (init);
8237 DECL_INITIAL (decl) = init = NULL_TREE;
8239 if (type != error_mark_node
8240 && IS_AGGR_TYPE (type) && DECL_NAME (decl))
8242 if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
8243 warning ("shadowing previous type declaration of `%#D'", decl);
8244 set_identifier_type_value (DECL_NAME (decl), type);
8245 CLASSTYPE_GOT_SEMICOLON (type) = 1;
8248 /* If we have installed this as the canonical typedef for this
8249 type, and that type has not been defined yet, delay emitting
8250 the debug information for it, as we will emit it later. */
8251 if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
8252 && !COMPLETE_TYPE_P (TREE_TYPE (decl)))
8253 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
8255 rest_of_decl_compilation (decl, NULL,
8256 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
8260 if (TREE_CODE (decl) != FUNCTION_DECL)
8261 ttype = target_type (type);
8263 if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
8264 && TYPE_NEEDS_CONSTRUCTING (type))
8266 /* Currently, GNU C++ puts constants in text space, making them
8267 impossible to initialize. In the future, one would hope for
8268 an operating system which understood the difference between
8269 initialization and the running of a program. */
8271 TREE_READONLY (decl) = 0;
8274 if (TREE_CODE (decl) == FIELD_DECL && asmspec)
8276 /* This must override the asm specifier which was placed by
8277 grokclassfn. Lay this out fresh. */
8278 SET_DECL_RTL (TREE_TYPE (decl), NULL_RTX);
8279 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (asmspec));
8280 make_decl_rtl (decl, asmspec);
8283 /* Deduce size of array from initialization, if not already known. */
8284 init = check_initializer (decl, init);
8285 maybe_deduce_size_from_array_init (decl, init);
8287 /* Add this declaration to the statement-tree. This needs to happen
8288 after the call to check_initializer so that the DECL_STMT for a
8289 reference temp is added before the DECL_STMT for the reference itself. */
8290 if (building_stmt_tree ()
8291 && at_function_scope_p ()
8292 && TREE_CODE (decl) != RESULT_DECL)
8293 add_decl_stmt (decl);
8295 if (TREE_CODE (decl) == VAR_DECL)
8296 layout_var_decl (decl);
8298 /* Output the assembler code and/or RTL code for variables and functions,
8299 unless the type is an undefined structure or union.
8300 If not, it will get done when the type is completed. */
8301 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
8302 || TREE_CODE (decl) == RESULT_DECL)
8304 if (TREE_CODE (decl) == VAR_DECL)
8305 maybe_commonize_var (decl);
8307 make_rtl_for_nonlocal_decl (decl, init, asmspec);
8309 if (TREE_CODE (type) == FUNCTION_TYPE
8310 || TREE_CODE (type) == METHOD_TYPE)
8311 abstract_virtuals_error (decl,
8312 strip_array_types (TREE_TYPE (type)));
8314 abstract_virtuals_error (decl, strip_array_types (type));
8316 if (TREE_CODE (decl) == FUNCTION_DECL)
8318 else if (DECL_EXTERNAL (decl)
8319 && ! (DECL_LANG_SPECIFIC (decl)
8320 && DECL_NOT_REALLY_EXTERN (decl)))
8323 DECL_INITIAL (decl) = init;
8325 else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
8327 /* This is a local declaration. */
8328 if (doing_semantic_analysis_p ())
8329 maybe_inject_for_scope_var (decl);
8330 /* Initialize the local variable. But, if we're building a
8331 statement-tree, we'll do the initialization when we
8333 if (processing_template_decl)
8335 if (init || DECL_INITIAL (decl) == error_mark_node)
8336 DECL_INITIAL (decl) = init;
8340 /* If we're not building RTL, then we need to do so
8342 my_friendly_assert (building_stmt_tree (), 20000906);
8343 /* Initialize the variable. */
8344 initialize_local_var (decl, init, flags);
8345 /* Clean up the variable. */
8346 destroy_local_var (decl);
8349 else if (TREE_STATIC (decl) && type != error_mark_node)
8351 /* Cleanups for static variables are handled by `finish_file'. */
8352 if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
8353 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
8354 expand_static_init (decl, init);
8358 /* Undo call to `pushclass' that was done in `start_decl'
8359 due to initialization of qualified member variable.
8360 I.e., Foo::x = 10; */
8362 tree context = CP_DECL_CONTEXT (decl);
8365 && (TREE_CODE (decl) == VAR_DECL
8366 /* We also have a pushclass done that we need to undo here
8367 if we're at top level and declare a method. */
8368 || TREE_CODE (decl) == FUNCTION_DECL)
8369 /* If size hasn't been set, we're still defining it,
8370 and therefore inside the class body; don't pop
8371 the binding level.. */
8372 && COMPLETE_TYPE_P (context)
8373 && context == current_class_type)
8374 pop_nested_class ();
8381 TREE_READONLY (decl) = 1;
8384 /* This is here for a midend callback from c-common.c */
8387 finish_decl (decl, init, asmspec_tree)
8391 cp_finish_decl (decl, init, asmspec_tree, 0);
8394 /* Returns a declaration for a VAR_DECL as if:
8396 extern "C" TYPE NAME;
8398 had been seen. Used to create compiler-generated global
8402 declare_global_var (name, type)
8408 push_to_top_level ();
8409 decl = build_decl (VAR_DECL, name, type);
8410 TREE_PUBLIC (decl) = 1;
8411 DECL_EXTERNAL (decl) = 1;
8412 DECL_ARTIFICIAL (decl) = 1;
8414 cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
8415 pop_from_top_level ();
8420 /* Returns a pointer to the `atexit' function. Note that if
8421 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8422 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8436 if (flag_use_cxa_atexit)
8438 /* The declaration for `__cxa_atexit' is:
8440 int __cxa_atexit (void (*)(void *), void *, void *)
8442 We build up the argument types and then then function type
8445 /* First, build the pointer-to-function type for the first
8447 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8448 fn_type = build_function_type (void_type_node, arg_types);
8449 fn_ptr_type = build_pointer_type (fn_type);
8450 /* Then, build the rest of the argument types. */
8451 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8452 arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
8453 arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types);
8454 /* And the final __cxa_atexit type. */
8455 fn_type = build_function_type (integer_type_node, arg_types);
8456 fn_ptr_type = build_pointer_type (fn_type);
8457 name = "__cxa_atexit";
8461 /* The declaration for `atexit' is:
8463 int atexit (void (*)());
8465 We build up the argument types and then then function type
8467 fn_type = build_function_type (void_type_node, void_list_node);
8468 fn_ptr_type = build_pointer_type (fn_type);
8469 arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node);
8470 /* Build the final atexit type. */
8471 fn_type = build_function_type (integer_type_node, arg_types);
8475 /* Now, build the function declaration. */
8476 push_lang_context (lang_name_c);
8477 atexit_fndecl = build_library_fn_ptr (name, fn_type);
8478 mark_used (atexit_fndecl);
8479 pop_lang_context ();
8480 atexit_node = default_conversion (atexit_fndecl);
8485 /* Returns the __dso_handle VAR_DECL. */
8488 get_dso_handle_node ()
8490 if (dso_handle_node)
8491 return dso_handle_node;
8493 /* Declare the variable. */
8494 dso_handle_node = declare_global_var (get_identifier ("__dso_handle"),
8497 return dso_handle_node;
8500 /* Begin a new function with internal linkage whose job will be simply
8501 to destroy some particular variable. */
8506 static int counter = 0;
8507 int old_interface_unknown = interface_unknown;
8513 push_to_top_level ();
8515 /* No need to mangle this. */
8516 push_lang_context (lang_name_c);
8518 interface_unknown = 1;
8520 /* Build the parameter-types. */
8521 parmtypes = void_list_node;
8522 /* Functions passed to __cxa_atexit take an additional parameter.
8523 We'll just ignore it. After we implement the new calling
8524 convention for destructors, we can eliminate the use of
8525 additional cleanup functions entirely in the -fnew-abi case. */
8526 if (flag_use_cxa_atexit)
8527 parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes);
8528 /* Build the function type itself. */
8529 fntype = build_function_type (void_type_node, parmtypes);
8530 /* Build the name of the function. */
8531 sprintf (name, "__tcf_%d", counter++);
8532 /* Build the function declaration. */
8533 fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype);
8534 /* It's a function with internal linkage, generated by the
8536 TREE_PUBLIC (fndecl) = 0;
8537 DECL_ARTIFICIAL (fndecl) = 1;
8538 /* Make the function `inline' so that it is only emitted if it is
8539 actually needed. It is unlikely that it will be inlined, since
8540 it is only called via a function pointer, but we avoid unnecessary
8541 emissions this way. */
8542 DECL_INLINE (fndecl) = 1;
8543 /* Build the parameter. */
8544 if (flag_use_cxa_atexit)
8548 parmdecl = build_decl (PARM_DECL, NULL_TREE, ptr_type_node);
8549 DECL_CONTEXT (parmdecl) = fndecl;
8550 DECL_ARG_TYPE (parmdecl) = ptr_type_node;
8551 TREE_USED (parmdecl) = 1;
8552 DECL_ARGUMENTS (fndecl) = parmdecl;
8556 start_function (/*specs=*/NULL_TREE, fndecl, NULL_TREE, SF_PRE_PARSED);
8558 interface_unknown = old_interface_unknown;
8560 pop_lang_context ();
8562 return current_function_decl;
8565 /* Finish the cleanup function begun by start_cleanup_fn. */
8570 expand_body (finish_function (0));
8572 pop_from_top_level ();
8575 /* Generate code to handle the destruction of DECL, an object with
8576 static storage duration. */
8579 register_dtor_fn (decl)
8587 int saved_flag_access_control;
8589 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
8592 /* Call build_cleanup before we enter the anonymous function so that
8593 any access checks will be done relative to the current scope,
8594 rather than the scope of the anonymous function. */
8595 build_cleanup (decl);
8597 /* Now start the function. */
8598 cleanup = start_cleanup_fn ();
8600 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8601 to the original function, rather than the anonymous one. That
8602 will make the back-end think that nested functions are in use,
8603 which causes confusion. */
8604 saved_flag_access_control = flag_access_control;
8605 flag_access_control = 0;
8606 fcall = build_cleanup (decl);
8607 flag_access_control = saved_flag_access_control;
8609 /* Create the body of the anonymous function. */
8610 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
8611 finish_expr_stmt (fcall);
8612 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
8615 /* Call atexit with the cleanup function. */
8616 mark_addressable (cleanup);
8617 cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
8618 if (flag_use_cxa_atexit)
8620 args = tree_cons (NULL_TREE,
8621 build_unary_op (ADDR_EXPR, get_dso_handle_node (), 0),
8623 args = tree_cons (NULL_TREE, null_pointer_node, args);
8624 args = tree_cons (NULL_TREE, cleanup, args);
8627 args = tree_cons (NULL_TREE, cleanup, NULL_TREE);
8628 finish_expr_stmt (build_function_call (get_atexit_node (), args));
8632 expand_static_init (decl, init)
8636 tree oldstatic = value_member (decl, static_aggregates);
8640 if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
8641 error ("multiple initializations given for `%D'", decl);
8643 else if (! toplevel_bindings_p ())
8645 /* Emit code to perform this initialization but once. */
8652 /* Emit code to perform this initialization but once. This code
8655 static int guard = 0;
8657 // Do initialization.
8659 // Register variable for destruction at end of program.
8662 Note that the `temp' variable is only set to 1 *after* the
8663 initialization is complete. This ensures that an exception,
8664 thrown during the construction, will cause the variable to
8665 reinitialized when we pass through this code again, as per:
8669 If the initialization exits by throwing an exception, the
8670 initialization is not complete, so it will be tried again
8671 the next time control enters the declaration.
8673 In theory, this process should be thread-safe, too; multiple
8674 threads should not be able to initialize the variable more
8675 than once. We don't yet attempt to ensure thread-safety. */
8677 /* Create the guard variable. */
8678 guard = get_guard (decl);
8680 /* Begin the conditional initialization. */
8681 if_stmt = begin_if_stmt ();
8682 finish_if_stmt_cond (get_guard_cond (guard), if_stmt);
8683 then_clause = begin_compound_stmt (/*has_no_scope=*/0);
8685 /* Do the initialization itself. */
8686 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
8687 || (init && TREE_CODE (init) == TREE_LIST))
8688 assignment = build_aggr_init (decl, init, 0);
8690 /* The initialization we're doing here is just a bitwise
8692 assignment = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
8694 assignment = NULL_TREE;
8696 /* Once the assignment is complete, set TEMP to 1. Since the
8697 construction of the static object is complete at this point,
8698 we want to make sure TEMP is set to 1 even if a temporary
8699 constructed during the initialization throws an exception
8700 when it is destroyed. So, we combine the initialization and
8701 the assignment to TEMP into a single expression, ensuring
8702 that when we call finish_expr_stmt the cleanups will not be
8703 run until after TEMP is set to 1. */
8704 guard_init = set_guard (guard);
8707 assignment = tree_cons (NULL_TREE, assignment,
8708 build_tree_list (NULL_TREE,
8710 assignment = build_compound_expr (assignment);
8713 assignment = guard_init;
8714 finish_expr_stmt (assignment);
8716 /* Use atexit to register a function for destroying this static
8718 register_dtor_fn (decl);
8720 finish_compound_stmt (/*has_no_scope=*/0, then_clause);
8721 finish_then_clause (if_stmt);
8725 static_aggregates = tree_cons (init, decl, static_aggregates);
8728 /* Finish the declaration of a catch-parameter. */
8731 start_handler_parms (declspecs, declarator)
8738 decl = grokdeclarator (declarator, declspecs, CATCHPARM,
8740 if (decl == NULL_TREE)
8741 error ("invalid catch parameter");
8750 /* Make TYPE a complete type based on INITIAL_VALUE.
8751 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8752 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8755 complete_array_type (type, initial_value, do_default)
8756 tree type, initial_value;
8759 register tree maxindex = NULL_TREE;
8764 /* An array of character type can be initialized from a
8765 brace-enclosed string constant. */
8766 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type)))
8767 && TREE_CODE (initial_value) == CONSTRUCTOR
8768 && CONSTRUCTOR_ELTS (initial_value)
8769 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value)))
8771 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value)) == NULL_TREE)
8772 initial_value = TREE_VALUE (CONSTRUCTOR_ELTS (initial_value));
8774 /* Note MAXINDEX is really the maximum index, one less than the
8776 if (TREE_CODE (initial_value) == STRING_CST)
8779 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8780 maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8783 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8785 tree elts = CONSTRUCTOR_ELTS (initial_value);
8787 maxindex = ssize_int (-1);
8788 for (; elts; elts = TREE_CHAIN (elts))
8790 if (TREE_PURPOSE (elts))
8791 maxindex = TREE_PURPOSE (elts);
8793 maxindex = size_binop (PLUS_EXPR, maxindex, ssize_int (1));
8795 maxindex = copy_node (maxindex);
8799 /* Make an error message unless that happened already. */
8800 if (initial_value != error_mark_node)
8803 initial_value = NULL_TREE;
8805 /* Prevent further error messages. */
8806 maxindex = build_int_2 (0, 0);
8813 maxindex = build_int_2 (0, 0);
8822 domain = build_index_type (maxindex);
8823 TYPE_DOMAIN (type) = domain;
8825 if (! TREE_TYPE (maxindex))
8826 TREE_TYPE (maxindex) = domain;
8828 itype = TREE_TYPE (initial_value);
8831 if (itype && !TYPE_DOMAIN (itype))
8832 TYPE_DOMAIN (itype) = domain;
8833 /* The type of the main variant should never be used for arrays
8834 of different sizes. It should only ever be completed with the
8835 size of the array. */
8836 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8837 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain;
8840 /* Lay out the type now that we can get the real answer. */
8847 /* Return zero if something is declared to be a member of type
8848 CTYPE when in the context of CUR_TYPE. STRING is the error
8849 message to print in that case. Otherwise, quietly return 1. */
8852 member_function_or_else (ctype, cur_type, flags)
8853 tree ctype, cur_type;
8854 enum overload_flags flags;
8856 if (ctype && ctype != cur_type)
8858 if (flags == DTOR_FLAG)
8859 error ("destructor for alien class `%T' cannot be a member",
8862 error ("constructor for alien class `%T' cannot be a member",
8869 /* Subroutine of `grokdeclarator'. */
8871 /* Generate errors possibly applicable for a given set of specifiers.
8872 This is for ARM $7.1.2. */
8875 bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises)
8878 int virtualp, quals, friendp, raises, inlinep;
8881 error ("`%D' declared as a `virtual' %s", object, type);
8883 error ("`%D' declared as an `inline' %s", object, type);
8885 error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8888 cp_error_at ("`%D' declared as a friend", object);
8890 && (TREE_CODE (object) == TYPE_DECL
8891 || (!TYPE_PTRFN_P (TREE_TYPE (object))
8892 && !TYPE_REFFN_P (TREE_TYPE (object))
8893 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object)))))
8894 cp_error_at ("`%D' declared with an exception specification", object);
8897 /* CTYPE is class type, or null if non-class.
8898 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8900 DECLARATOR is the function's name.
8901 VIRTUALP is truthvalue of whether the function is virtual or not.
8902 FLAGS are to be passed through to `grokclassfn'.
8903 QUALS are qualifiers indicating whether the function is `const'
8905 RAISES is a list of exceptions that this function can raise.
8906 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8907 not look, and -1 if we should not call `grokclassfn' at all.
8909 Returns `NULL_TREE' if something goes wrong, after issuing
8910 applicable error messages. */
8913 grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals,
8914 raises, check, friendp, publicp, inlinep, funcdef_flag,
8915 template_count, in_namespace)
8918 tree orig_declarator;
8920 enum overload_flags flags;
8922 int check, friendp, publicp, inlinep, funcdef_flag, template_count;
8926 int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8927 int has_default_arg = 0;
8931 type = build_exception_variant (type, raises);
8933 decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8934 /* Propagate volatile out from type to decl. */
8935 if (TYPE_VOLATILE (type))
8936 TREE_THIS_VOLATILE (decl) = 1;
8938 /* If this decl has namespace scope, set that up. */
8940 set_decl_namespace (decl, in_namespace, friendp);
8942 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8944 /* `main' and builtins have implicit 'C' linkage. */
8945 if ((MAIN_NAME_P (declarator)
8946 || (IDENTIFIER_LENGTH (declarator) > 10
8947 && IDENTIFIER_POINTER (declarator)[0] == '_'
8948 && IDENTIFIER_POINTER (declarator)[1] == '_'
8949 && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8950 && current_lang_name == lang_name_cplusplus
8951 && ctype == NULL_TREE
8952 /* NULL_TREE means global namespace. */
8953 && DECL_CONTEXT (decl) == NULL_TREE)
8954 SET_DECL_LANGUAGE (decl, lang_c);
8956 /* Should probably propagate const out from type to decl I bet (mrs). */
8959 DECL_STATIC_FUNCTION_P (decl) = 1;
8960 DECL_CONTEXT (decl) = ctype;
8964 DECL_CONTEXT (decl) = ctype;
8966 if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8968 if (processing_template_decl)
8969 error ("cannot declare `::main' to be a template");
8971 error ("cannot declare `::main' to be inline");
8973 error ("cannot declare `::main' to be static");
8974 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
8976 error ("`main' must return `int'");
8981 /* Members of anonymous types and local classes have no linkage; make
8983 /* FIXME what if it gets a name from typedef? */
8984 if (ctype && (TYPE_ANONYMOUS_P (ctype)
8985 || decl_function_context (TYPE_MAIN_DECL (ctype))))
8990 /* [basic.link]: A name with no linkage (notably, the name of a class
8991 or enumeration declared in a local scope) shall not be used to
8992 declare an entity with linkage.
8994 Only check this for public decls for now. */
8995 t = no_linkage_check (TREE_TYPE (decl));
8998 if (TYPE_ANONYMOUS_P (t))
9000 if (DECL_EXTERN_C_P (decl))
9001 /* Allow this; it's pretty common in C. */;
9004 pedwarn ("non-local function `%#D' uses anonymous type",
9006 if (DECL_ORIGINAL_TYPE (TYPE_NAME (t)))
9008 `%#D' does not refer to the unqualified type, so it is not used for linkage",
9013 pedwarn ("non-local function `%#D' uses local type `%T'",
9018 TREE_PUBLIC (decl) = publicp;
9021 DECL_INTERFACE_KNOWN (decl) = 1;
9022 DECL_NOT_REALLY_EXTERN (decl) = 1;
9025 /* If the declaration was declared inline, mark it as such. */
9027 DECL_DECLARED_INLINE_P (decl) = 1;
9028 /* We inline functions that are explicitly declared inline, or, when
9029 the user explicitly asks us to, all functions. */
9030 if (DECL_DECLARED_INLINE_P (decl) || flag_inline_trees == 2)
9031 DECL_INLINE (decl) = 1;
9033 DECL_EXTERNAL (decl) = 1;
9034 if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
9036 error ("%smember function `%D' cannot have `%T' method qualifier",
9037 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
9041 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
9042 grok_op_properties (decl, friendp);
9044 if (ctype && decl_function_context (decl))
9045 DECL_NO_STATIC_CHAIN (decl) = 1;
9047 for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
9048 if (TREE_PURPOSE (t)
9049 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
9051 has_default_arg = 1;
9056 && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
9060 ("defining explicit specialization `%D' in friend declaration",
9064 tree fns = TREE_OPERAND (orig_declarator, 0);
9065 tree args = TREE_OPERAND (orig_declarator, 1);
9067 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
9069 /* Something like `template <class T> friend void f<T>()'. */
9070 error ("invalid use of template-id `%D' in declaration of primary template",
9076 /* A friend declaration of the form friend void f<>(). Record
9077 the information in the TEMPLATE_ID_EXPR. */
9078 SET_DECL_IMPLICIT_INSTANTIATION (decl);
9080 if (TREE_CODE (fns) == COMPONENT_REF)
9082 /* Due to bison parser ickiness, we will have already looked
9083 up an operator_name or PFUNCNAME within the current class
9084 (see template_id in parse.y). If the current class contains
9085 such a name, we'll get a COMPONENT_REF here. Undo that. */
9087 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns, 0))
9088 == current_class_type, 20001120);
9089 fns = TREE_OPERAND (fns, 1);
9091 my_friendly_assert (TREE_CODE (fns) == IDENTIFIER_NODE
9092 || TREE_CODE (fns) == LOOKUP_EXPR
9093 || TREE_CODE (fns) == OVERLOAD, 20001120);
9094 DECL_TEMPLATE_INFO (decl) = tree_cons (fns, args, NULL_TREE);
9096 if (has_default_arg)
9098 error ("default arguments are not allowed in declaration of friend template specialization `%D'",
9105 error ("`inline' is not allowed in declaration of friend template specialization `%D'",
9112 if (has_default_arg)
9113 add_defarg_fn (decl);
9116 /* Make the init_value nonzero so pushdecl knows this is not
9117 tentative. error_mark_node is replaced later with the BLOCK. */
9118 DECL_INITIAL (decl) = error_mark_node;
9120 if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl))
9121 TREE_NOTHROW (decl) = 1;
9123 /* Caller will do the rest of this. */
9127 if (flags == NO_SPECIAL && ctype && constructor_name (ctype) == declarator)
9128 DECL_CONSTRUCTOR_P (decl) = 1;
9130 /* Function gets the ugly name, field gets the nice one. This call
9131 may change the type of the function (because of default
9133 if (ctype != NULL_TREE)
9134 grokclassfn (ctype, decl, flags, quals);
9136 decl = check_explicit_specialization (orig_declarator, decl,
9138 2 * (funcdef_flag != 0) +
9139 4 * (friendp != 0));
9140 if (decl == error_mark_node)
9143 if (ctype != NULL_TREE
9144 && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
9149 old_decl = check_classfn (ctype, decl);
9151 if (old_decl && TREE_CODE (old_decl) == TEMPLATE_DECL)
9152 /* Because grokfndecl is always supposed to return a
9153 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9154 here. We depend on our callers to figure out that its
9155 really a template that's being returned. */
9156 old_decl = DECL_TEMPLATE_RESULT (old_decl);
9158 if (old_decl && DECL_STATIC_FUNCTION_P (old_decl)
9159 && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
9161 /* Remove the `this' parm added by grokclassfn.
9162 XXX Isn't this done in start_function, too? */
9163 revert_static_member_fn (decl);
9164 last_function_parms = TREE_CHAIN (last_function_parms);
9166 if (old_decl && DECL_ARTIFICIAL (old_decl))
9167 error ("definition of implicitly-declared `%D'", old_decl);
9171 /* Since we've smashed OLD_DECL to its
9172 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9173 if (TREE_CODE (decl) == TEMPLATE_DECL)
9174 decl = DECL_TEMPLATE_RESULT (decl);
9176 /* Attempt to merge the declarations. This can fail, in
9177 the case of some illegal specialization declarations. */
9178 if (!duplicate_decls (decl, old_decl))
9179 error ("no `%#D' member function declared in class `%T'",
9185 if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl))
9188 if (ctype == NULL_TREE || check)
9192 DECL_VIRTUAL_P (decl) = 1;
9198 grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace)
9201 RID_BIT_TYPE *specbits_in;
9207 RID_BIT_TYPE specbits;
9209 specbits = *specbits_in;
9211 if (TREE_CODE (type) == OFFSET_TYPE)
9213 /* If you declare a static member so that it
9214 can be initialized, the code will reach here. */
9215 tree basetype = TYPE_OFFSET_BASETYPE (type);
9216 type = TREE_TYPE (type);
9217 decl = build_lang_decl (VAR_DECL, declarator, type);
9218 DECL_CONTEXT (decl) = basetype;
9225 context = in_namespace;
9226 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits))
9227 context = current_namespace;
9229 context = NULL_TREE;
9231 /* For namespace-scope variables, declared in a template, we
9232 need the full lang_decl. The same is true for
9233 namespace-scope variables that do not have C++ language
9236 && (processing_template_decl
9237 || current_lang_name != lang_name_cplusplus))
9238 decl = build_lang_decl (VAR_DECL, declarator, type);
9240 decl = build_decl (VAR_DECL, declarator, type);
9243 set_decl_namespace (decl, context, 0);
9245 context = DECL_CONTEXT (decl);
9246 if (declarator && context && current_lang_name != lang_name_c)
9247 /* We can't mangle lazily here because we don't have any
9248 way to recover whether or not a variable was `extern
9254 set_decl_namespace (decl, in_namespace, 0);
9256 if (RIDBIT_SETP (RID_EXTERN, specbits))
9258 DECL_THIS_EXTERN (decl) = 1;
9259 DECL_EXTERNAL (decl) = !initialized;
9262 /* In class context, static means one per class,
9263 public access, and static storage. */
9264 if (DECL_CLASS_SCOPE_P (decl))
9266 TREE_PUBLIC (decl) = 1;
9267 TREE_STATIC (decl) = 1;
9268 DECL_EXTERNAL (decl) = 0;
9270 /* At top level, either `static' or no s.c. makes a definition
9271 (perhaps tentative), and absence of `static' makes it public. */
9272 else if (toplevel_bindings_p ())
9274 TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
9275 && (DECL_THIS_EXTERN (decl) || ! constp));
9276 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
9278 /* Not at top level, only `static' makes a static definition. */
9281 TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
9282 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
9285 if (TREE_PUBLIC (decl))
9287 /* [basic.link]: A name with no linkage (notably, the name of a class
9288 or enumeration declared in a local scope) shall not be used to
9289 declare an entity with linkage.
9291 Only check this for public decls for now. */
9292 tree t = no_linkage_check (TREE_TYPE (decl));
9295 if (TYPE_ANONYMOUS_P (t))
9296 /* Ignore for now; `enum { foo } e' is pretty common. */;
9298 pedwarn ("non-local variable `%#D' uses local type `%T'",
9306 /* Create and return a canonical pointer to member function type, for
9307 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9310 build_ptrmemfunc_type (type)
9315 tree unqualified_variant = NULL_TREE;
9317 if (type == error_mark_node)
9320 /* If a canonical type already exists for this type, use it. We use
9321 this method instead of type_hash_canon, because it only does a
9322 simple equality check on the list of field members. */
9324 if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
9327 /* Make sure that we always have the unqualified pointer-to-member
9329 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
9331 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type));
9333 t = make_aggr_type (RECORD_TYPE);
9334 /* Let the front-end know this is a pointer to member function... */
9335 TYPE_PTRMEMFUNC_FLAG (t) = 1;
9336 /* ... and not really an aggregate. */
9337 SET_IS_AGGR_TYPE (t, 0);
9339 fields[0] = build_decl (FIELD_DECL, pfn_identifier, type);
9340 fields[1] = build_decl (FIELD_DECL, delta_identifier,
9342 finish_builtin_type (t, "__ptrmemfunc_type", fields, 1, ptr_type_node);
9344 /* Zap out the name so that the back-end will give us the debugging
9345 information for this anonymous RECORD_TYPE. */
9346 TYPE_NAME (t) = NULL_TREE;
9348 /* If this is not the unqualified form of this pointer-to-member
9349 type, set the TYPE_MAIN_VARIANT for this type to be the
9350 unqualified type. Since they are actually RECORD_TYPEs that are
9351 not variants of each other, we must do this manually. */
9352 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
9354 t = build_qualified_type (t, cp_type_quals (type));
9355 TYPE_MAIN_VARIANT (t) = unqualified_variant;
9356 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant);
9357 TYPE_NEXT_VARIANT (unqualified_variant) = t;
9360 /* Cache this pointer-to-member type so that we can find it again
9362 TYPE_SET_PTRMEMFUNC_TYPE (type, t);
9364 /* Seems to be wanted. */
9365 CLASSTYPE_GOT_SEMICOLON (t) = 1;
9370 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9371 Check to see that the definition is valid. Issue appropriate error
9372 messages. Return 1 if the definition is particularly bad, or 0
9376 check_static_variable_definition (decl, type)
9380 /* Motion 10 at San Diego: If a static const integral data member is
9381 initialized with an integral constant expression, the initializer
9382 may appear either in the declaration (within the class), or in
9383 the definition, but not both. If it appears in the class, the
9384 member is a member constant. The file-scope definition is always
9386 if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
9388 error ("invalid in-class initialization of static data member of non-integral type `%T'",
9390 /* If we just return the declaration, crashes will sometimes
9391 occur. We therefore return void_type_node, as if this was a
9392 friend declaration, to cause callers to completely ignore
9393 this declaration. */
9396 else if (!CP_TYPE_CONST_P (type))
9397 error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9399 else if (pedantic && !INTEGRAL_TYPE_P (type))
9400 pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
9405 /* Given the SIZE (i.e., number of elements) in an array, compute an
9406 appropriate index type for the array. If non-NULL, NAME is the
9407 name of the thing being declared. */
9410 compute_array_index_type (name, size)
9416 /* If this involves a template parameter, it will be a constant at
9417 instantiation time, but we don't know what the value is yet.
9418 Even if no template parameters are involved, we may an expression
9419 that is not a constant; we don't even simplify `1 + 2' when
9420 processing a template. */
9421 if (processing_template_decl)
9423 /* Resolve a qualified reference to an enumerator or static
9424 const data member of ours. */
9425 if (TREE_CODE (size) == SCOPE_REF
9426 && TREE_OPERAND (size, 0) == current_class_type)
9428 tree t = lookup_field (current_class_type,
9429 TREE_OPERAND (size, 1), 0, 0);
9434 return build_index_type (build_min (MINUS_EXPR, sizetype,
9435 size, integer_one_node));
9438 /* The size might be the result of a cast. */
9439 STRIP_TYPE_NOPS (size);
9441 /* It might be a const variable or enumeration constant. */
9442 size = decl_constant_value (size);
9444 /* The array bound must be an integer type. */
9445 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
9446 && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
9447 && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
9450 error ("size of array `%D' has non-integer type", name);
9452 error ("size of array has non-integer type");
9453 size = integer_one_node;
9456 /* Normally, the array-bound will be a constant. */
9457 if (TREE_CODE (size) == INTEGER_CST)
9459 /* Check to see if the array bound overflowed. Make that an
9460 error, no matter how generous we're being. */
9461 int old_flag_pedantic_errors = flag_pedantic_errors;
9462 int old_pedantic = pedantic;
9463 pedantic = flag_pedantic_errors = 1;
9464 constant_expression_warning (size);
9465 pedantic = old_pedantic;
9466 flag_pedantic_errors = old_flag_pedantic_errors;
9468 /* An array must have a positive number of elements. */
9469 if (INT_CST_LT (size, integer_zero_node))
9472 error ("size of array `%D' is negative", name);
9474 error ("size of array is negative");
9475 size = integer_one_node;
9477 /* Except that an extension we allow zero-sized arrays. We
9478 always allow them in system headers because glibc uses
9480 else if (integer_zerop (size) && pedantic && !in_system_header)
9483 pedwarn ("ISO C++ forbids zero-size array `%D'", name);
9485 pedwarn ("ISO C++ forbids zero-size array");
9488 else if (TREE_CONSTANT (size))
9490 /* `(int) &fn' is not a valid array bound. */
9492 error ("size of array `%D' is not an integral constant-expression",
9495 error ("size of array is not an integral constant-expression");
9498 /* Compute the index of the largest element in the array. It is
9499 one less than the number of elements in the array. */
9501 = fold (cp_build_binary_op (MINUS_EXPR,
9502 cp_convert (ssizetype, size),
9503 cp_convert (ssizetype,
9504 integer_one_node)));
9506 /* Check for variable-sized arrays. We allow such things as an
9507 extension, even though they are not allowed in ANSI/ISO C++. */
9508 if (!TREE_CONSTANT (itype))
9513 pedwarn ("ISO C++ forbids variable-size array `%D'",
9516 pedwarn ("ISO C++ forbids variable-size array");
9519 /* Create a variable-sized array index type. */
9520 itype = variable_size (itype);
9522 /* Make sure that there was no overflow when creating to a signed
9523 index type. (For example, on a 32-bit machine, an array with
9524 size 2^32 - 1 is too big.) */
9525 else if (TREE_OVERFLOW (itype))
9527 error ("overflow in array dimension");
9528 TREE_OVERFLOW (itype) = 0;
9531 /* Create and return the appropriate index type. */
9532 return build_index_type (itype);
9535 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9536 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9540 create_array_type_for_decl (name, type, size)
9545 tree itype = NULL_TREE;
9546 const char* error_msg;
9548 /* If things have already gone awry, bail now. */
9549 if (type == error_mark_node || size == error_mark_node)
9550 return error_mark_node;
9552 /* Assume that everything will go OK. */
9555 /* There are some types which cannot be array elements. */
9556 switch (TREE_CODE (type))
9559 error_msg = "array of void";
9563 error_msg = "array of functions";
9566 case REFERENCE_TYPE:
9567 error_msg = "array of references";
9571 error_msg = "array of data members";
9575 error_msg = "array of function members";
9582 /* If something went wrong, issue an error-message and return. */
9586 error ("declaration of `%D' as %s", name, error_msg);
9588 error ("creating %s", error_msg);
9590 return error_mark_node;
9595 The constant expressions that specify the bounds of the arrays
9596 can be omitted only for the first member of the sequence. */
9597 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
9600 error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9603 error ("multidimensional array must have bounds for all dimensions except the first");
9605 return error_mark_node;
9608 /* Figure out the index type for the array. */
9610 itype = compute_array_index_type (name, size);
9612 return build_cplus_array_type (type, itype);
9615 /* Check that it's OK to declare a function with the indicated TYPE.
9616 SFK indicates the kind of special function (if any) that this
9617 function is. OPTYPE is the type given in a conversion operator
9618 declaration. Returns the actual return type of the function; that
9619 may be different than TYPE if an error occurs, or for certain
9620 special functions. */
9623 check_special_function_return_type (sfk, type, optype)
9624 special_function_kind sfk;
9630 case sfk_constructor:
9632 error ("return type specification for constructor invalid");
9634 type = void_type_node;
9637 case sfk_destructor:
9639 error ("return type specification for destructor invalid");
9640 type = void_type_node;
9643 case sfk_conversion:
9644 if (type && !same_type_p (type, optype))
9645 error ("operator `%T' declared to return `%T'", optype, type);
9647 pedwarn ("return type specified for `operator %T'", optype);
9659 /* Given declspecs and a declarator,
9660 determine the name and type of the object declared
9661 and construct a ..._DECL node for it.
9662 (In one case we can return a ..._TYPE node instead.
9663 For invalid input we sometimes return 0.)
9665 DECLSPECS is a chain of tree_list nodes whose value fields
9666 are the storage classes and type specifiers.
9668 DECL_CONTEXT says which syntactic context this declaration is in:
9669 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9670 FUNCDEF for a function definition. Like NORMAL but a few different
9671 error messages in each case. Return value may be zero meaning
9672 this definition is too screwy to try to parse.
9673 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9674 handle member functions (which have FIELD context).
9675 Return value may be zero meaning this definition is too screwy to
9677 PARM for a parameter declaration (either within a function prototype
9678 or before a function body). Make a PARM_DECL, or return void_type_node.
9679 CATCHPARM for a parameter declaration before a catch clause.
9680 TYPENAME if for a typename (in a cast or sizeof).
9681 Don't make a DECL node; just return the ..._TYPE node.
9682 FIELD for a struct or union field; make a FIELD_DECL.
9683 BITFIELD for a field with specified width.
9684 INITIALIZED is 1 if the decl has an initializer.
9686 ATTRLIST is a pointer to the list of attributes, which may be NULL
9687 if there are none; *ATTRLIST may be modified if attributes from inside
9688 the declarator should be applied to the declaration.
9690 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9691 It may also be so in the PARM case, for a prototype where the
9692 argument type is specified but not the name.
9694 This function is where the complicated C meanings of `static'
9695 and `extern' are interpreted.
9697 For C++, if there is any monkey business to do, the function which
9698 calls this one must do it, i.e., prepending instance variables,
9699 renaming overloaded function names, etc.
9701 Note that for this C++, it is an error to define a method within a class
9702 which does not belong to that class.
9704 Except in the case where SCOPE_REFs are implicitly known (such as
9705 methods within a class being redundantly qualified),
9706 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9707 (class_name::decl_name). The caller must also deal with this.
9709 If a constructor or destructor is seen, and the context is FIELD,
9710 then the type gains the attribute TREE_HAS_x. If such a declaration
9711 is erroneous, NULL_TREE is returned.
9713 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9714 function, these are the qualifiers to give to the `this' pointer. We
9715 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9717 May return void_type_node if the declarator turned out to be a friend.
9718 See grokfield for details. */
9721 grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist)
9724 enum decl_context decl_context;
9728 RID_BIT_TYPE specbits;
9731 tree type = NULL_TREE;
9734 int virtualp, explicitp, friendp, inlinep, staticp;
9735 int explicit_int = 0;
9736 int explicit_char = 0;
9737 int defaulted_int = 0;
9738 int extern_langp = 0;
9739 tree dependant_name = NULL_TREE;
9741 tree typedef_decl = NULL_TREE;
9743 tree typedef_type = NULL_TREE;
9744 int funcdef_flag = 0;
9745 enum tree_code innermost_code = ERROR_MARK;
9748 /* See the code below that used this. */
9749 tree decl_attr = NULL_TREE;
9751 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9752 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9753 tree init = NULL_TREE;
9755 /* Keep track of what sort of function is being processed
9756 so that we can warn about default return values, or explicit
9757 return values which do not match prescribed defaults. */
9758 special_function_kind sfk = sfk_none;
9760 tree dname = NULL_TREE;
9761 tree ctype = current_class_type;
9762 tree ctor_return_type = NULL_TREE;
9763 enum overload_flags flags = NO_SPECIAL;
9764 tree quals = NULL_TREE;
9765 tree raises = NULL_TREE;
9766 int template_count = 0;
9767 tree in_namespace = NULL_TREE;
9768 tree returned_attrs = NULL_TREE;
9770 RIDBIT_RESET_ALL (specbits);
9771 if (decl_context == FUNCDEF)
9772 funcdef_flag = 1, decl_context = NORMAL;
9773 else if (decl_context == MEMFUNCDEF)
9774 funcdef_flag = -1, decl_context = FIELD;
9775 else if (decl_context == BITFIELD)
9776 bitfield = 1, decl_context = FIELD;
9778 /* Look inside a declarator for the name being declared
9779 and get it as a string, for an error message. */
9781 tree *next = &declarator;
9785 while (next && *next)
9788 switch (TREE_CODE (decl))
9791 /* For attributes. */
9792 next = &TREE_VALUE (decl);
9797 next = &TREE_OPERAND (decl, 0);
9800 case BIT_NOT_EXPR: /* For C++ destructors! */
9802 tree name = TREE_OPERAND (decl, 0);
9803 tree rename = NULL_TREE;
9805 my_friendly_assert (flags == NO_SPECIAL, 152);
9807 sfk = sfk_destructor;
9808 if (TREE_CODE (name) == TYPE_DECL)
9809 TREE_OPERAND (decl, 0) = name = constructor_name (name);
9810 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
9811 if (ctype == NULL_TREE)
9813 if (current_class_type == NULL_TREE)
9815 error ("destructors must be member functions");
9820 tree t = constructor_name (current_class_name);
9827 tree t = constructor_name (ctype);
9834 error ("destructor `%T' must match class name `%T'",
9836 TREE_OPERAND (decl, 0) = rename;
9842 case ADDR_EXPR: /* C++ reference declaration */
9847 innermost_code = TREE_CODE (decl);
9848 next = &TREE_OPERAND (decl, 0);
9852 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl)))
9854 /* This is actually a variable declaration using
9855 constructor syntax. We need to call start_decl and
9856 cp_finish_decl so we can get the variable
9861 *next = TREE_OPERAND (decl, 0);
9862 init = CALL_DECLARATOR_PARMS (decl);
9866 attributes = *attrlist;
9870 attributes = NULL_TREE;
9873 decl = start_decl (declarator, declspecs, 1,
9874 attributes, NULL_TREE);
9875 decl_type_access_control (decl);
9878 /* Look for __unused__ attribute */
9879 if (TREE_USED (TREE_TYPE (decl)))
9880 TREE_USED (decl) = 1;
9881 finish_decl (decl, init, NULL_TREE);
9884 error ("invalid declarator");
9887 innermost_code = TREE_CODE (decl);
9888 if (decl_context == FIELD && ctype == NULL_TREE)
9889 ctype = current_class_type;
9891 && TREE_OPERAND (decl, 0)
9892 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
9893 && ((DECL_NAME (TREE_OPERAND (decl, 0))
9894 == constructor_name_full (ctype))
9895 || (DECL_NAME (TREE_OPERAND (decl, 0))
9896 == constructor_name (ctype)))))
9897 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9898 next = &TREE_OPERAND (decl, 0);
9900 if (ctype != NULL_TREE
9901 && decl != NULL_TREE && flags != DTOR_FLAG
9902 && decl == constructor_name (ctype))
9904 sfk = sfk_constructor;
9905 ctor_return_type = ctype;
9910 case TEMPLATE_ID_EXPR:
9912 tree fns = TREE_OPERAND (decl, 0);
9914 if (TREE_CODE (fns) == LOOKUP_EXPR)
9915 fns = TREE_OPERAND (fns, 0);
9918 if (TREE_CODE (dname) == COMPONENT_REF)
9919 dname = TREE_OPERAND (dname, 1);
9920 if (TREE_CODE (dname) != IDENTIFIER_NODE)
9922 my_friendly_assert (is_overloaded_fn (dname),
9924 dname = DECL_NAME (get_first_fn (dname));
9929 case IDENTIFIER_NODE:
9930 if (TREE_CODE (decl) == IDENTIFIER_NODE)
9935 if (C_IS_RESERVED_WORD (dname))
9937 error ("declarator-id missing; using reserved word `%D'",
9939 name = IDENTIFIER_POINTER (dname);
9941 else if (!IDENTIFIER_TYPENAME_P (dname))
9942 name = IDENTIFIER_POINTER (dname);
9945 my_friendly_assert (flags == NO_SPECIAL, 154);
9946 flags = TYPENAME_FLAG;
9947 ctor_return_type = TREE_TYPE (dname);
9948 sfk = sfk_conversion;
9949 if (IDENTIFIER_GLOBAL_VALUE (dname)
9950 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname))
9952 name = IDENTIFIER_POINTER (dname);
9954 name = "<invalid operator>";
9961 /* Perform error checking, and decide on a ctype. */
9962 tree cname = TREE_OPERAND (decl, 0);
9963 if (cname == NULL_TREE)
9965 else if (TREE_CODE (cname) == NAMESPACE_DECL)
9968 in_namespace = TREE_OPERAND (decl, 0);
9969 TREE_OPERAND (decl, 0) = NULL_TREE;
9971 else if (! is_aggr_type (cname, 1))
9972 TREE_OPERAND (decl, 0) = NULL_TREE;
9973 /* Must test TREE_OPERAND (decl, 1), in case user gives
9974 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9975 else if (TREE_OPERAND (decl, 1)
9976 && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9978 else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9979 || TREE_CODE (cname) == BOUND_TEMPLATE_TEMPLATE_PARM)
9981 /* This might be declaring a member of a template
9982 parm to be a friend. */
9984 dependant_name = TREE_OPERAND (decl, 1);
9986 else if (ctype == NULL_TREE)
9988 else if (TREE_COMPLEXITY (decl) == current_class_depth)
9989 TREE_OPERAND (decl, 0) = ctype;
9992 if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9994 error ("type `%T' is not derived from type `%T'",
9996 TREE_OPERAND (decl, 0) = NULL_TREE;
10002 if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
10003 && ((DECL_NAME (TREE_OPERAND (decl, 1))
10004 == constructor_name_full (ctype))
10005 || (DECL_NAME (TREE_OPERAND (decl, 1))
10006 == constructor_name (ctype))))
10007 TREE_OPERAND (decl, 1) = constructor_name (ctype);
10008 next = &TREE_OPERAND (decl, 1);
10012 if (TREE_CODE (decl) == IDENTIFIER_NODE
10013 && constructor_name (ctype) == decl)
10015 sfk = sfk_constructor;
10016 ctor_return_type = ctype;
10018 else if (TREE_CODE (decl) == BIT_NOT_EXPR
10019 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
10020 && (constructor_name (ctype) == TREE_OPERAND (decl, 0)
10021 || constructor_name_full (ctype) == TREE_OPERAND (decl, 0)))
10023 sfk = sfk_destructor;
10024 ctor_return_type = ctype;
10026 TREE_OPERAND (decl, 0) = constructor_name (ctype);
10027 next = &TREE_OPERAND (decl, 0);
10038 /* Parse error puts this typespec where
10039 a declarator should go. */
10040 error ("`%T' specified as declarator-id", DECL_NAME (decl));
10041 if (TREE_TYPE (decl) == current_class_type)
10042 error (" perhaps you want `%T' for a constructor",
10043 current_class_name);
10044 dname = DECL_NAME (decl);
10045 name = IDENTIFIER_POINTER (dname);
10047 /* Avoid giving two errors for this. */
10048 IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
10050 declspecs = tree_cons (NULL_TREE, integer_type_node, declspecs);
10056 internal_error ("`%D' as declarator", decl);
10061 /* A function definition's declarator must have the form of
10062 a function declarator. */
10064 if (funcdef_flag && innermost_code != CALL_EXPR)
10067 if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
10068 && innermost_code != CALL_EXPR
10069 && ! (ctype && declspecs == NULL_TREE))
10071 error ("declaration of `%D' as non-function", dname);
10072 return void_type_node;
10075 /* Anything declared one level down from the top level
10076 must be one of the parameters of a function
10077 (because the body is at least two levels down). */
10079 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
10080 by not allowing C++ class definitions to specify their parameters
10081 with xdecls (must be spec.d in the parmlist).
10083 Since we now wait to push a class scope until we are sure that
10084 we are in a legitimate method context, we must set oldcname
10085 explicitly (since current_class_name is not yet alive).
10087 We also want to avoid calling this a PARM if it is in a namespace. */
10089 if (decl_context == NORMAL && !toplevel_bindings_p ())
10091 struct binding_level *b = current_binding_level;
10092 current_binding_level = b->level_chain;
10093 if (current_binding_level != 0 && toplevel_bindings_p ())
10094 decl_context = PARM;
10095 current_binding_level = b;
10099 name = decl_context == PARM ? "parameter" : "type name";
10101 /* Look through the decl specs and record which ones appear.
10102 Some typespecs are defined as built-in typenames.
10103 Others, the ones that are modifiers of other types,
10104 are represented by bits in SPECBITS: set the bits for
10105 the modifiers that appear. Storage class keywords are also in SPECBITS.
10107 If there is a typedef name or a type, store the type in TYPE.
10108 This includes builtin typedefs such as `int'.
10110 Set EXPLICIT_INT if the type is `int' or `char' and did not
10111 come from a user typedef.
10113 Set LONGLONG if `long' is mentioned twice.
10115 For C++, constructors and destructors have their own fast treatment. */
10117 for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
10122 /* Certain parse errors slip through. For example,
10123 `int class;' is not caught by the parser. Try
10124 weakly to recover here. */
10125 if (TREE_CODE (spec) != TREE_LIST)
10128 id = TREE_VALUE (spec);
10130 /* If the entire declaration is itself tagged as deprecated then
10131 suppress reports of deprecated items. */
10132 if (!adding_implicit_members && id && TREE_DEPRECATED (id))
10134 if (deprecated_state != DEPRECATED_SUPPRESS)
10135 warn_deprecated_use (id);
10138 if (TREE_CODE (id) == IDENTIFIER_NODE)
10140 if (id == ridpointers[(int) RID_INT]
10141 || id == ridpointers[(int) RID_CHAR]
10142 || id == ridpointers[(int) RID_BOOL]
10143 || id == ridpointers[(int) RID_WCHAR])
10147 if (id == ridpointers[(int) RID_BOOL])
10148 error ("`bool' is now a keyword");
10150 error ("extraneous `%T' ignored", id);
10154 if (id == ridpointers[(int) RID_INT])
10156 else if (id == ridpointers[(int) RID_CHAR])
10158 type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
10162 /* C++ aggregate types. */
10163 if (IDENTIFIER_HAS_TYPE_VALUE (id))
10166 error ("multiple declarations `%T' and `%T'", type, id);
10168 type = IDENTIFIER_TYPE_VALUE (id);
10172 for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
10174 if (ridpointers[i] == id)
10176 if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
10178 if (pedantic && ! in_system_header && warn_long_long)
10179 pedwarn ("ISO C++ does not support `long long'");
10181 error ("`long long long' is too long for GCC");
10185 else if (RIDBIT_SETP (i, specbits))
10186 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
10187 if (i == (int)RID_EXTERN
10188 && TREE_PURPOSE (spec) == error_mark_node)
10189 /* This extern was part of a language linkage. */
10191 RIDBIT_SET (i, specbits);
10196 else if (TREE_CODE (id) == TYPE_DECL)
10199 error ("multiple declarations `%T' and `%T'", type,
10203 type = TREE_TYPE (id);
10204 TREE_VALUE (spec) = type;
10210 error ("two or more data types in declaration of `%s'", name);
10211 else if (TREE_CODE (id) == IDENTIFIER_NODE)
10213 register tree t = lookup_name (id, 1);
10214 if (!t || TREE_CODE (t) != TYPE_DECL)
10215 error ("`%s' fails to be a typedef or built in type",
10216 IDENTIFIER_POINTER (id));
10219 type = TREE_TYPE (t);
10223 else if (id != error_mark_node)
10224 /* Can't change CLASS nodes into RECORD nodes here! */
10231 /* See the code below that used this. */
10233 decl_attr = DECL_ATTRIBUTES (typedef_decl);
10235 typedef_type = type;
10237 /* No type at all: default to `int', and set DEFAULTED_INT
10238 because it was not a user-defined typedef. */
10240 if (type == NULL_TREE
10241 && (RIDBIT_SETP (RID_SIGNED, specbits)
10242 || RIDBIT_SETP (RID_UNSIGNED, specbits)
10243 || RIDBIT_SETP (RID_LONG, specbits)
10244 || RIDBIT_SETP (RID_SHORT, specbits)))
10246 /* These imply 'int'. */
10247 type = integer_type_node;
10251 if (sfk != sfk_none)
10252 type = check_special_function_return_type (sfk, type,
10254 else if (type == NULL_TREE)
10260 /* We handle `main' specially here, because 'main () { }' is so
10261 common. With no options, it is allowed. With -Wreturn-type,
10262 it is a warning. It is only an error with -pedantic-errors. */
10263 is_main = (funcdef_flag
10264 && dname && MAIN_NAME_P (dname)
10265 && ctype == NULL_TREE
10266 && in_namespace == NULL_TREE
10267 && current_namespace == global_namespace);
10269 if (in_system_header || flag_ms_extensions)
10270 /* Allow it, sigh. */;
10271 else if (pedantic || ! is_main)
10272 pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10274 else if (warn_return_type)
10275 warning ("ISO C++ forbids declaration of `%s' with no type",
10278 type = integer_type_node;
10281 if (type && IMPLICIT_TYPENAME_P (type))
10283 /* The implicit typename extension is deprecated and will be
10284 removed. Warn about its use now. */
10285 warning ("`%T' is implicitly a typename", type);
10286 cp_deprecated ("implicit typename");
10288 /* Now remove its implicitness, so that we don't warn again.
10289 For instance this might be a typedef, and we do not want to
10290 warn on uses of the typedef itself. Simply clearing the
10291 TREE_TYPE is insufficient. */
10292 type = copy_node (type);
10293 TREE_TYPE (type) = NULL_TREE;
10298 /* Now process the modifiers that were specified
10299 and check for invalid combinations. */
10301 /* Long double is a special combination. */
10303 if (RIDBIT_SETP (RID_LONG, specbits)
10304 && TYPE_MAIN_VARIANT (type) == double_type_node)
10306 RIDBIT_RESET (RID_LONG, specbits);
10307 type = build_qualified_type (long_double_type_node,
10308 cp_type_quals (type));
10311 /* Check all other uses of type modifiers. */
10313 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10314 || RIDBIT_SETP (RID_SIGNED, specbits)
10315 || RIDBIT_SETP (RID_LONG, specbits)
10316 || RIDBIT_SETP (RID_SHORT, specbits))
10320 if (TREE_CODE (type) == REAL_TYPE)
10321 error ("short, signed or unsigned invalid for `%s'", name);
10322 else if (TREE_CODE (type) != INTEGER_TYPE)
10323 error ("long, short, signed or unsigned invalid for `%s'", name);
10324 else if (RIDBIT_SETP (RID_LONG, specbits)
10325 && RIDBIT_SETP (RID_SHORT, specbits))
10326 error ("long and short specified together for `%s'", name);
10327 else if ((RIDBIT_SETP (RID_LONG, specbits)
10328 || RIDBIT_SETP (RID_SHORT, specbits))
10330 error ("long or short specified with char for `%s'", name);
10331 else if ((RIDBIT_SETP (RID_LONG, specbits)
10332 || RIDBIT_SETP (RID_SHORT, specbits))
10333 && TREE_CODE (type) == REAL_TYPE)
10334 error ("long or short specified with floating type for `%s'", name);
10335 else if (RIDBIT_SETP (RID_SIGNED, specbits)
10336 && RIDBIT_SETP (RID_UNSIGNED, specbits))
10337 error ("signed and unsigned given together for `%s'", name);
10341 if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
10343 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10345 if (flag_pedantic_errors)
10350 /* Discard the type modifiers if they are invalid. */
10353 RIDBIT_RESET (RID_UNSIGNED, specbits);
10354 RIDBIT_RESET (RID_SIGNED, specbits);
10355 RIDBIT_RESET (RID_LONG, specbits);
10356 RIDBIT_RESET (RID_SHORT, specbits);
10361 if (RIDBIT_SETP (RID_COMPLEX, specbits)
10362 && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
10364 error ("complex invalid for `%s'", name);
10365 RIDBIT_RESET (RID_COMPLEX, specbits);
10368 /* Decide whether an integer type is signed or not.
10369 Optionally treat bitfields as signed by default. */
10370 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10373 It is implementation-defined whether a plain (neither
10374 explicitly signed or unsigned) char, short, int, or long
10375 bit-field is signed or unsigned.
10377 Naturally, we extend this to long long as well. Note that
10378 this does not include wchar_t. */
10379 || (bitfield && !flag_signed_bitfields
10380 && RIDBIT_NOTSETP (RID_SIGNED, specbits)
10381 /* A typedef for plain `int' without `signed' can be
10382 controlled just like plain `int', but a typedef for
10383 `signed int' cannot be so controlled. */
10385 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))
10386 && (TREE_CODE (type) == INTEGER_TYPE
10387 || TREE_CODE (type) == CHAR_TYPE)
10388 && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node)))
10391 type = long_long_unsigned_type_node;
10392 else if (RIDBIT_SETP (RID_LONG, specbits))
10393 type = long_unsigned_type_node;
10394 else if (RIDBIT_SETP (RID_SHORT, specbits))
10395 type = short_unsigned_type_node;
10396 else if (type == char_type_node)
10397 type = unsigned_char_type_node;
10398 else if (typedef_decl)
10399 type = unsigned_type (type);
10401 type = unsigned_type_node;
10403 else if (RIDBIT_SETP (RID_SIGNED, specbits)
10404 && type == char_type_node)
10405 type = signed_char_type_node;
10407 type = long_long_integer_type_node;
10408 else if (RIDBIT_SETP (RID_LONG, specbits))
10409 type = long_integer_type_node;
10410 else if (RIDBIT_SETP (RID_SHORT, specbits))
10411 type = short_integer_type_node;
10413 if (RIDBIT_SETP (RID_COMPLEX, specbits))
10415 /* If we just have "complex", it is equivalent to
10416 "complex double", but if any modifiers at all are specified it is
10417 the complex form of TYPE. E.g, "complex short" is
10418 "complex short int". */
10420 if (defaulted_int && ! longlong
10421 && ! (RIDBIT_SETP (RID_LONG, specbits)
10422 || RIDBIT_SETP (RID_SHORT, specbits)
10423 || RIDBIT_SETP (RID_SIGNED, specbits)
10424 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
10425 type = complex_double_type_node;
10426 else if (type == integer_type_node)
10427 type = complex_integer_type_node;
10428 else if (type == float_type_node)
10429 type = complex_float_type_node;
10430 else if (type == double_type_node)
10431 type = complex_double_type_node;
10432 else if (type == long_double_type_node)
10433 type = complex_long_double_type_node;
10435 type = build_complex_type (type);
10438 type_quals = TYPE_UNQUALIFIED;
10439 if (RIDBIT_SETP (RID_CONST, specbits))
10440 type_quals |= TYPE_QUAL_CONST;
10441 if (RIDBIT_SETP (RID_VOLATILE, specbits))
10442 type_quals |= TYPE_QUAL_VOLATILE;
10443 if (RIDBIT_SETP (RID_RESTRICT, specbits))
10444 type_quals |= TYPE_QUAL_RESTRICT;
10445 if (sfk == sfk_conversion && type_quals != TYPE_UNQUALIFIED)
10446 error ("qualifiers are not allowed on declaration of `operator %T'",
10449 type_quals |= cp_type_quals (type);
10450 type = cp_build_qualified_type_real
10451 (type, type_quals, ((typedef_decl && !DECL_ARTIFICIAL (typedef_decl)
10452 ? tf_ignore_bad_quals : 0) | tf_error | tf_warning));
10453 /* We might have ignored or rejected some of the qualifiers. */
10454 type_quals = cp_type_quals (type);
10457 inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
10458 virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
10459 RIDBIT_RESET (RID_VIRTUAL, specbits);
10460 explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
10461 RIDBIT_RESET (RID_EXPLICIT, specbits);
10463 if (RIDBIT_SETP (RID_STATIC, specbits))
10464 staticp = 1 + (decl_context == FIELD);
10466 if (virtualp && staticp == 2)
10468 error ("member `%D' cannot be declared both virtual and static",
10472 friendp = RIDBIT_SETP (RID_FRIEND, specbits);
10473 RIDBIT_RESET (RID_FRIEND, specbits);
10475 if (dependant_name && !friendp)
10477 error ("`%T::%D' is not a valid declarator", ctype, dependant_name);
10478 return void_type_node;
10481 /* Warn if two storage classes are given. Default to `auto'. */
10483 if (RIDBIT_ANY_SET (specbits))
10485 if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
10486 if (RIDBIT_SETP (RID_EXTERN, specbits) && !extern_langp) nclasses++;
10487 if (decl_context == PARM && nclasses > 0)
10488 error ("storage class specifiers invalid in parameter declarations");
10489 if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10491 if (decl_context == PARM)
10492 error ("typedef declaration invalid in parameter declaration");
10495 if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
10496 if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
10497 if (!nclasses && !friendp && extern_langp)
10501 /* Give error if `virtual' is used outside of class declaration. */
10503 && (current_class_name == NULL_TREE || decl_context != FIELD))
10505 error ("virtual outside class declaration");
10509 /* Static anonymous unions are dealt with here. */
10510 if (staticp && decl_context == TYPENAME
10511 && TREE_CODE (declspecs) == TREE_LIST
10512 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs)))
10513 decl_context = FIELD;
10515 /* Warn about storage classes that are invalid for certain
10516 kinds of declarations (parameters, typenames, etc.). */
10519 error ("multiple storage classes in declaration of `%s'", name);
10520 else if (decl_context != NORMAL && nclasses > 0)
10522 if ((decl_context == PARM || decl_context == CATCHPARM)
10523 && (RIDBIT_SETP (RID_REGISTER, specbits)
10524 || RIDBIT_SETP (RID_AUTO, specbits)))
10526 else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10528 else if (decl_context == FIELD
10529 /* C++ allows static class elements */
10530 && RIDBIT_SETP (RID_STATIC, specbits))
10531 /* C++ also allows inlines and signed and unsigned elements,
10532 but in those cases we don't come in here. */
10536 if (decl_context == FIELD)
10538 tree tmp = NULL_TREE;
10539 register int op = 0;
10543 /* Avoid trying to get an operand off an identifier node. */
10544 if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10547 tmp = TREE_OPERAND (declarator, 0);
10548 op = IDENTIFIER_OPNAME_P (tmp);
10549 if (IDENTIFIER_TYPENAME_P (tmp))
10551 if (IDENTIFIER_GLOBAL_VALUE (tmp)
10552 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp))
10554 name = IDENTIFIER_POINTER (tmp);
10556 name = "<invalid operator>";
10559 error ("storage class specified for %s `%s'",
10560 op ? "member operator" : "field",
10565 if (decl_context == PARM || decl_context == CATCHPARM)
10566 error ("storage class specified for parameter `%s'", name);
10568 error ("storage class specified for typename");
10570 RIDBIT_RESET (RID_REGISTER, specbits);
10571 RIDBIT_RESET (RID_AUTO, specbits);
10572 RIDBIT_RESET (RID_EXTERN, specbits);
10575 else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
10577 if (toplevel_bindings_p ())
10579 /* It's common practice (and completely valid) to have a const
10580 be initialized and declared extern. */
10581 if (!(type_quals & TYPE_QUAL_CONST))
10582 warning ("`%s' initialized and declared `extern'", name);
10585 error ("`%s' has both `extern' and initializer", name);
10587 else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
10588 && ! toplevel_bindings_p ())
10589 error ("nested function `%s' declared `extern'", name);
10590 else if (toplevel_bindings_p ())
10592 if (RIDBIT_SETP (RID_AUTO, specbits))
10593 error ("top-level declaration of `%s' specifies `auto'", name);
10596 if (nclasses > 0 && friendp)
10597 error ("storage class specifiers invalid in friend function declarations");
10599 /* Now figure out the structure of the declarator proper.
10600 Descend through it, creating more complex types, until we reach
10601 the declared identifier (or NULL_TREE, in an absolute declarator). */
10603 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
10604 && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
10606 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10607 an INDIRECT_REF (for *...),
10608 a CALL_EXPR (for ...(...)),
10609 an identifier (for the name being declared)
10610 or a null pointer (for the place in an absolute declarator
10611 where the name was omitted).
10612 For the last two cases, we have just exited the loop.
10614 For C++ it could also be
10615 a SCOPE_REF (for class :: ...). In this case, we have converted
10616 sensible names to types, and those are the values we use to
10617 qualify the member name.
10618 an ADDR_EXPR (for &...),
10619 a BIT_NOT_EXPR (for destructors)
10621 At this point, TYPE is the type of elements of an array,
10622 or for a function to return, or for a pointer to point to.
10623 After this sequence of ifs, TYPE is the type of the
10624 array or function or pointer, and DECLARATOR has had its
10625 outermost layer removed. */
10627 if (type == error_mark_node)
10629 if (TREE_CODE (declarator) == SCOPE_REF)
10630 declarator = TREE_OPERAND (declarator, 1);
10632 declarator = TREE_OPERAND (declarator, 0);
10635 if (quals != NULL_TREE
10636 && (declarator == NULL_TREE
10637 || TREE_CODE (declarator) != SCOPE_REF))
10639 if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
10640 ctype = TYPE_METHOD_BASETYPE (type);
10641 if (ctype != NULL_TREE)
10643 tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
10644 grok_method_quals (ctype, dummy, quals);
10645 type = TREE_TYPE (dummy);
10646 ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
10651 switch (TREE_CODE (declarator))
10655 /* We encode a declarator with embedded attributes using
10657 tree attrs = TREE_PURPOSE (declarator);
10661 declarator = TREE_VALUE (declarator);
10662 inner_decl = declarator;
10663 while (inner_decl != NULL_TREE
10664 && TREE_CODE (inner_decl) == TREE_LIST)
10665 inner_decl = TREE_VALUE (inner_decl);
10667 if (inner_decl == NULL_TREE
10668 || TREE_CODE (inner_decl) == IDENTIFIER_NODE)
10669 attr_flags |= (int) ATTR_FLAG_DECL_NEXT;
10670 if (TREE_CODE (inner_decl) == CALL_EXPR)
10671 attr_flags |= (int) ATTR_FLAG_FUNCTION_NEXT;
10672 if (TREE_CODE (inner_decl) == ARRAY_REF)
10673 attr_flags |= (int) ATTR_FLAG_ARRAY_NEXT;
10674 returned_attrs = decl_attributes (&type,
10675 chainon (returned_attrs, attrs),
10682 register tree size;
10684 size = TREE_OPERAND (declarator, 1);
10686 /* VC++ spells a zero-sized array with []. */
10687 if (size == NULL_TREE && decl_context == FIELD && ! staticp
10688 && ! RIDBIT_SETP (RID_TYPEDEF, specbits))
10689 size = integer_zero_node;
10691 declarator = TREE_OPERAND (declarator, 0);
10693 type = create_array_type_for_decl (dname, type, size);
10695 /* VLAs never work as fields. */
10696 if (decl_context == FIELD && !processing_template_decl
10697 && TREE_CODE (type) == ARRAY_TYPE
10698 && TYPE_DOMAIN (type) != NULL_TREE
10699 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
10701 error ("size of member `%D' is not constant", dname);
10702 /* Proceed with arbitrary constant size, so that offset
10703 computations don't get confused. */
10704 type = create_array_type_for_decl (dname, TREE_TYPE (type),
10716 tree inner_parms = CALL_DECLARATOR_PARMS (declarator);
10717 tree inner_decl = TREE_OPERAND (declarator, 0);
10719 /* Declaring a function type.
10720 Make sure we have a valid type for the function to return. */
10722 /* We now know that the TYPE_QUALS don't apply to the
10723 decl, but to its return type. */
10724 type_quals = TYPE_UNQUALIFIED;
10726 /* Warn about some types functions can't return. */
10728 if (TREE_CODE (type) == FUNCTION_TYPE)
10730 error ("`%s' declared as function returning a function", name);
10731 type = integer_type_node;
10733 if (TREE_CODE (type) == ARRAY_TYPE)
10735 error ("`%s' declared as function returning an array", name);
10736 type = integer_type_node;
10739 if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
10740 inner_decl = TREE_OPERAND (inner_decl, 1);
10742 if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
10743 inner_decl = dname;
10745 /* Pick up type qualifiers which should be applied to `this'. */
10746 quals = CALL_DECLARATOR_QUALS (declarator);
10748 /* Pick up the exception specifications. */
10749 raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator);
10751 /* Say it's a definition only for the CALL_EXPR
10752 closest to the identifier. */
10755 && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
10756 || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
10757 || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
10759 if (ctype == NULL_TREE
10760 && decl_context == FIELD
10762 && (friendp == 0 || dname == current_class_name))
10763 ctype = current_class_type;
10765 if (ctype && sfk == sfk_conversion)
10766 TYPE_HAS_CONVERSION (ctype) = 1;
10767 if (ctype && constructor_name (ctype) == dname)
10769 /* We are within a class's scope. If our declarator name
10770 is the same as the class name, and we are defining
10771 a function, then it is a constructor/destructor, and
10772 therefore returns a void type. */
10774 if (flags == DTOR_FLAG)
10776 /* ISO C++ 12.4/2. A destructor may not be
10777 declared const or volatile. A destructor may
10780 error ("destructor cannot be static member function");
10783 error ("destructors may not be `%s'",
10784 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10787 if (decl_context == FIELD)
10789 if (! member_function_or_else (ctype,
10790 current_class_type,
10792 return void_type_node;
10795 else /* It's a constructor. */
10797 if (explicitp == 1)
10799 /* ISO C++ 12.1. A constructor may not be
10800 declared const or volatile. A constructor may
10801 not be virtual. A constructor may not be
10804 error ("constructor cannot be static member function");
10807 pedwarn ("constructors cannot be declared virtual");
10812 error ("constructors may not be `%s'",
10813 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10817 RID_BIT_TYPE tmp_bits;
10818 memcpy (&tmp_bits, &specbits, sizeof (RID_BIT_TYPE));
10819 RIDBIT_RESET (RID_INLINE, tmp_bits);
10820 RIDBIT_RESET (RID_STATIC, tmp_bits);
10821 if (RIDBIT_ANY_SET (tmp_bits))
10822 error ("return value type specifier for constructor ignored");
10824 if (decl_context == FIELD)
10826 if (! member_function_or_else (ctype,
10827 current_class_type,
10829 return void_type_node;
10830 TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10831 if (sfk != sfk_constructor)
10835 if (decl_context == FIELD)
10841 error ("can't initialize friend function `%s'", name);
10844 /* Cannot be both friend and virtual. */
10845 error ("virtual functions cannot be friends");
10846 RIDBIT_RESET (RID_FRIEND, specbits);
10849 if (decl_context == NORMAL)
10850 error ("friend declaration not in class definition");
10851 if (current_function_decl && funcdef_flag)
10852 error ("can't define friend function `%s' in a local class definition",
10856 /* Construct the function type and go to the next
10857 inner layer of declarator. */
10859 declarator = TREE_OPERAND (declarator, 0);
10861 /* FIXME: This is where default args should be fully
10864 arg_types = grokparms (inner_parms);
10866 if (declarator && flags == DTOR_FLAG)
10868 /* A destructor declared in the body of a class will
10869 be represented as a BIT_NOT_EXPR. But, we just
10870 want the underlying IDENTIFIER. */
10871 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10872 declarator = TREE_OPERAND (declarator, 0);
10874 if (arg_types != void_list_node)
10876 error ("destructors may not have parameters");
10877 arg_types = void_list_node;
10878 last_function_parms = NULL_TREE;
10882 /* ANSI says that `const int foo ();'
10883 does not make the function foo const. */
10884 type = build_function_type (type, arg_types);
10888 for (t = arg_types; t; t = TREE_CHAIN (t))
10889 if (TREE_PURPOSE (t)
10890 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
10892 add_defarg_fn (type);
10901 /* Filter out pointers-to-references and references-to-references.
10902 We can get these if a TYPE_DECL is used. */
10904 if (TREE_CODE (type) == REFERENCE_TYPE)
10906 error ("cannot declare %s to references",
10907 TREE_CODE (declarator) == ADDR_EXPR
10908 ? "references" : "pointers");
10909 declarator = TREE_OPERAND (declarator, 0);
10913 if (TREE_CODE (type) == OFFSET_TYPE
10914 && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE
10915 || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE))
10917 error ("cannot declare pointer to `%#T' member",
10919 type = TREE_TYPE (type);
10922 /* Merge any constancy or volatility into the target type
10923 for the pointer. */
10925 /* We now know that the TYPE_QUALS don't apply to the decl,
10926 but to the target of the pointer. */
10927 type_quals = TYPE_UNQUALIFIED;
10929 if (TREE_CODE (declarator) == ADDR_EXPR)
10931 if (TREE_CODE (type) == VOID_TYPE)
10932 error ("invalid type: `void &'");
10934 type = build_reference_type (type);
10936 else if (TREE_CODE (type) == METHOD_TYPE)
10937 type = build_ptrmemfunc_type (build_pointer_type (type));
10939 type = build_pointer_type (type);
10941 /* Process a list of type modifier keywords (such as
10942 const or volatile) that were given inside the `*' or `&'. */
10944 if (TREE_TYPE (declarator))
10946 register tree typemodlist;
10952 for (typemodlist = TREE_TYPE (declarator); typemodlist;
10953 typemodlist = TREE_CHAIN (typemodlist))
10955 tree qualifier = TREE_VALUE (typemodlist);
10957 if (qualifier == ridpointers[(int) RID_CONST])
10960 type_quals |= TYPE_QUAL_CONST;
10962 else if (qualifier == ridpointers[(int) RID_VOLATILE])
10965 type_quals |= TYPE_QUAL_VOLATILE;
10967 else if (qualifier == ridpointers[(int) RID_RESTRICT])
10970 type_quals |= TYPE_QUAL_RESTRICT;
10975 error ("invalid type modifier within pointer declarator");
10979 pedwarn ("duplicate `const'");
10981 pedwarn ("duplicate `volatile'");
10983 pedwarn ("duplicate `restrict'");
10984 type = cp_build_qualified_type (type, type_quals);
10985 type_quals = cp_type_quals (type);
10987 declarator = TREE_OPERAND (declarator, 0);
10993 /* We have converted type names to NULL_TREE if the
10994 name was bogus, or to a _TYPE node, if not.
10996 The variable CTYPE holds the type we will ultimately
10997 resolve to. The code here just needs to build
10998 up appropriate member types. */
10999 tree sname = TREE_OPERAND (declarator, 1);
11002 /* Destructors can have their visibilities changed as well. */
11003 if (TREE_CODE (sname) == BIT_NOT_EXPR)
11004 sname = TREE_OPERAND (sname, 0);
11006 if (TREE_COMPLEXITY (declarator) == 0)
11007 /* This needs to be here, in case we are called
11008 multiple times. */ ;
11009 else if (TREE_COMPLEXITY (declarator) == -1)
11010 /* Namespace member. */
11011 pop_decl_namespace ();
11012 else if (friendp && (TREE_COMPLEXITY (declarator) < 2))
11013 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
11014 else if (! IS_AGGR_TYPE_CODE
11015 (TREE_CODE (TREE_OPERAND (declarator, 0))))
11017 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
11019 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
11020 that refer to ctype. They couldn't be resolved earlier
11021 because we hadn't pushed into the class yet.
11022 Example: resolve 'B<T>::type' in
11023 'B<typename B<T>::type> B<T>::f () { }'. */
11024 if (current_template_parms
11025 && uses_template_parms (type)
11026 && uses_template_parms (current_class_type))
11028 tree args = current_template_args ();
11029 type = tsubst (type, args, tf_error | tf_warning,
11033 /* This pop_nested_class corresponds to the
11034 push_nested_class used to push into class scope for
11035 parsing the argument list of a function decl, in
11037 pop_nested_class ();
11038 TREE_COMPLEXITY (declarator) = current_class_depth;
11043 if (TREE_OPERAND (declarator, 0) == NULL_TREE)
11045 /* We had a reference to a global decl, or
11046 perhaps we were given a non-aggregate typedef,
11047 in which case we cleared this out, and should just
11048 keep going as though it wasn't there. */
11049 declarator = sname;
11052 ctype = TREE_OPERAND (declarator, 0);
11055 while (t != NULL_TREE && CLASS_TYPE_P (t))
11057 /* You're supposed to have one `template <...>'
11058 for every template class, but you don't need one
11059 for a full specialization. For example:
11061 template <class T> struct S{};
11062 template <> struct S<int> { void f(); };
11063 void S<int>::f () {}
11065 is correct; there shouldn't be a `template <>' for
11066 the definition of `S<int>::f'. */
11067 if (CLASSTYPE_TEMPLATE_INFO (t)
11068 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t)
11069 || uses_template_parms (CLASSTYPE_TI_ARGS (t)))
11070 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t)))
11071 template_count += 1;
11073 t = TYPE_MAIN_DECL (t);
11074 t = DECL_CONTEXT (t);
11077 if (sname == NULL_TREE)
11080 if (TREE_CODE (sname) == IDENTIFIER_NODE)
11082 /* This is the `standard' use of the scoping operator:
11083 basetype :: member . */
11085 if (ctype == current_class_type)
11091 Is this ill-formed? */
11094 pedwarn ("extra qualification `%T::' on member `%s' ignored",
11097 else if (TREE_CODE (type) == FUNCTION_TYPE)
11099 if (current_class_type == NULL_TREE || friendp)
11100 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11101 TYPE_ARG_TYPES (type));
11104 error ("cannot declare member function `%T::%s' within `%T'",
11105 ctype, name, current_class_type);
11106 return void_type_node;
11109 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
11110 || COMPLETE_TYPE_P (complete_type (ctype)))
11112 /* Have to move this code elsewhere in this function.
11113 this code is used for i.e., typedef int A::M; M *pm;
11115 It is? How? jason 10/2/94 */
11117 if (current_class_type)
11119 error ("cannot declare member `%T::%s' within `%T'",
11120 ctype, name, current_class_type);
11121 return void_type_node;
11123 type = build_offset_type (ctype, type);
11127 incomplete_type_error (NULL_TREE, ctype);
11128 return error_mark_node;
11131 declarator = sname;
11133 else if (TREE_CODE (sname) == SCOPE_REF)
11138 declarator = TREE_OPERAND (declarator, 1);
11139 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
11140 /* In this case, we will deal with it later. */
11144 if (TREE_CODE (type) == FUNCTION_TYPE)
11145 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11146 TYPE_ARG_TYPES (type));
11148 type = build_offset_type (ctype, type);
11155 declarator = TREE_OPERAND (declarator, 0);
11160 case ENUMERAL_TYPE:
11161 declarator = NULL_TREE;
11165 declarator = NULL_TREE;
11173 if (returned_attrs)
11176 *attrlist = chainon (returned_attrs, *attrlist);
11178 attrlist = &returned_attrs;
11181 /* Now TYPE has the actual type. */
11183 /* Did array size calculations overflow? */
11185 if (TREE_CODE (type) == ARRAY_TYPE
11186 && COMPLETE_TYPE_P (type)
11187 && TREE_OVERFLOW (TYPE_SIZE (type)))
11189 error ("size of array `%s' is too large", name);
11190 /* If we proceed with the array type as it is, we'll eventually
11191 crash in tree_low_cst(). */
11192 type = error_mark_node;
11195 if (explicitp == 1 || (explicitp && friendp))
11197 /* [dcl.fct.spec] The explicit specifier shall only be used in
11198 declarations of constructors within a class definition. */
11199 error ("only declarations of constructors can be `explicit'");
11203 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11205 if (current_class_name == NULL_TREE || decl_context == PARM || friendp)
11207 error ("non-member `%s' cannot be declared `mutable'", name);
11208 RIDBIT_RESET (RID_MUTABLE, specbits);
11210 else if (decl_context == TYPENAME || RIDBIT_SETP (RID_TYPEDEF, specbits))
11212 error ("non-object member `%s' cannot be declared `mutable'", name);
11213 RIDBIT_RESET (RID_MUTABLE, specbits);
11215 else if (TREE_CODE (type) == FUNCTION_TYPE
11216 || TREE_CODE (type) == METHOD_TYPE)
11218 error ("function `%s' cannot be declared `mutable'", name);
11219 RIDBIT_RESET (RID_MUTABLE, specbits);
11223 error ("static `%s' cannot be declared `mutable'", name);
11224 RIDBIT_RESET (RID_MUTABLE, specbits);
11226 else if (type_quals & TYPE_QUAL_CONST)
11228 error ("const `%s' cannot be declared `mutable'", name);
11229 RIDBIT_RESET (RID_MUTABLE, specbits);
11233 if (declarator == NULL_TREE
11234 || TREE_CODE (declarator) == IDENTIFIER_NODE
11235 || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR
11236 && (TREE_CODE (type) == FUNCTION_TYPE
11237 || TREE_CODE (type) == METHOD_TYPE)))
11239 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11241 error ("template-id `%D' used as a declarator", declarator);
11242 declarator = dname;
11245 /* Unexpected declarator format. */
11248 /* If this is declaring a typedef name, return a TYPE_DECL. */
11250 if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
11254 /* Note that the grammar rejects storage classes
11255 in typenames, fields or parameters. */
11256 if (current_lang_name == lang_name_java)
11257 TYPE_FOR_JAVA (type) = 1;
11259 if (decl_context == FIELD)
11261 if (declarator == constructor_name (current_class_type))
11262 pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11264 decl = build_lang_decl (TYPE_DECL, declarator, type);
11268 decl = build_decl (TYPE_DECL, declarator, type);
11269 if (!current_function_decl)
11270 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
11273 /* If the user declares "typedef struct {...} foo" then the
11274 struct will have an anonymous name. Fill that name in now.
11275 Nothing can refer to it, so nothing needs know about the name
11277 if (type != error_mark_node
11279 && TYPE_NAME (type)
11280 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
11281 && TYPE_ANONYMOUS_P (type)
11282 /* Don't do this if there are attributes. */
11283 && (!attrlist || !*attrlist)
11284 && cp_type_quals (type) == TYPE_UNQUALIFIED)
11286 tree oldname = TYPE_NAME (type);
11289 /* Replace the anonymous name with the real name everywhere. */
11290 lookup_tag_reverse (type, declarator);
11291 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
11292 if (TYPE_NAME (t) == oldname)
11293 TYPE_NAME (t) = decl;
11295 if (TYPE_LANG_SPECIFIC (type))
11296 TYPE_WAS_ANONYMOUS (type) = 1;
11298 /* If this is a typedef within a template class, the nested
11299 type is a (non-primary) template. The name for the
11300 template needs updating as well. */
11301 if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
11302 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
11303 = TYPE_IDENTIFIER (type);
11305 /* FIXME remangle member functions; member functions of a
11306 type with external linkage have external linkage. */
11309 if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE)
11311 cp_error_at ("typedef name may not be class-qualified", decl);
11316 if (ctype == NULL_TREE)
11318 if (TREE_CODE (type) != METHOD_TYPE)
11319 cp_error_at ("invalid type qualifier for non-member function type", decl);
11321 ctype = TYPE_METHOD_BASETYPE (type);
11323 if (ctype != NULL_TREE)
11324 grok_method_quals (ctype, decl, quals);
11327 if (RIDBIT_SETP (RID_SIGNED, specbits)
11328 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
11329 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
11331 bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
11332 inlinep, friendp, raises != NULL_TREE);
11335 error ("typedef declaration includes an initializer");
11340 /* Detect the case of an array type of unspecified size
11341 which came, as such, direct from a typedef name.
11342 We must copy the type, so that the array's domain can be
11343 individually set by the object's initializer. */
11345 if (type && typedef_type
11346 && TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
11347 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (typedef_type))
11348 type = build_cplus_array_type (TREE_TYPE (type), NULL_TREE);
11350 /* Detect where we're using a typedef of function type to declare a
11351 function. last_function_parms will not be set, so we must create
11354 if (type == typedef_type && TREE_CODE (type) == FUNCTION_TYPE)
11356 tree decls = NULL_TREE;
11359 for (args = TYPE_ARG_TYPES (type); args; args = TREE_CHAIN (args))
11361 tree decl = build_decl (PARM_DECL, NULL_TREE, TREE_VALUE (args));
11363 TREE_CHAIN (decl) = decls;
11367 last_function_parms = nreverse (decls);
11370 /* If this is a type name (such as, in a cast or sizeof),
11371 compute the type and return it now. */
11373 if (decl_context == TYPENAME)
11375 /* Note that the grammar rejects storage classes
11376 in typenames, fields or parameters. */
11377 if (type_quals != TYPE_UNQUALIFIED)
11378 type_quals = TYPE_UNQUALIFIED;
11380 /* Special case: "friend class foo" looks like a TYPENAME context. */
11383 if (type_quals != TYPE_UNQUALIFIED)
11385 error ("type qualifiers specified for friend class declaration");
11386 type_quals = TYPE_UNQUALIFIED;
11390 error ("`inline' specified for friend class declaration");
11394 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11395 But don't allow implicit typenames except with a class-key. */
11396 if (!current_aggr && (TREE_CODE (type) != TYPENAME_TYPE
11397 || IMPLICIT_TYPENAME_P (type)))
11399 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11400 pedwarn ("template parameters cannot be friends");
11401 else if (TREE_CODE (type) == TYPENAME_TYPE)
11403 friend declaration requires class-key, i.e. `friend class %T::%T'",
11404 constructor_name (current_class_type),
11405 TYPE_IDENTIFIER (type));
11408 friend declaration requires class-key, i.e. `friend %#T'",
11412 /* Only try to do this stuff if we didn't already give up. */
11413 if (type != integer_type_node)
11415 decl_type_access_control (TYPE_NAME (type));
11417 /* A friendly class? */
11418 if (current_class_type)
11419 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
11421 error ("trying to make class `%T' a friend of global scope",
11424 type = void_type_node;
11429 if (ctype == NULL_TREE)
11431 if (TREE_CODE (type) != METHOD_TYPE)
11432 error ("invalid qualifiers on non-member function type");
11434 ctype = TYPE_METHOD_BASETYPE (type);
11438 tree dummy = build_decl (TYPE_DECL, declarator, type);
11439 grok_method_quals (ctype, dummy, quals);
11440 type = TREE_TYPE (dummy);
11446 else if (declarator == NULL_TREE && decl_context != PARM
11447 && decl_context != CATCHPARM
11448 && TREE_CODE (type) != UNION_TYPE
11451 error ("abstract declarator `%T' used as declaration", type);
11452 declarator = make_anon_name ();
11455 /* `void' at top level (not within pointer)
11456 is allowed only in typedefs or type names.
11457 We don't complain about parms either, but that is because
11458 a better error message can be made later. */
11460 if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
11463 error ("unnamed variable or field declared void");
11464 else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
11466 if (IDENTIFIER_OPNAME_P (declarator))
11469 error ("variable or field `%s' declared void", name);
11472 error ("variable or field declared void");
11473 type = integer_type_node;
11476 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11477 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11479 if (decl_context == PARM || decl_context == CATCHPARM)
11481 if (ctype || in_namespace)
11482 error ("cannot use `::' in parameter declaration");
11484 /* A parameter declared as an array of T is really a pointer to T.
11485 One declared as a function is really a pointer to a function.
11486 One declared as a member is really a pointer to member. */
11488 if (TREE_CODE (type) == ARRAY_TYPE)
11490 /* Transfer const-ness of array into that of type pointed to. */
11491 type = build_pointer_type (TREE_TYPE (type));
11492 type_quals = TYPE_UNQUALIFIED;
11494 else if (TREE_CODE (type) == FUNCTION_TYPE)
11495 type = build_pointer_type (type);
11496 else if (TREE_CODE (type) == OFFSET_TYPE)
11497 type = build_pointer_type (type);
11501 register tree decl;
11503 if (decl_context == PARM)
11505 decl = build_decl (PARM_DECL, declarator, type);
11507 bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
11508 inlinep, friendp, raises != NULL_TREE);
11510 /* Compute the type actually passed in the parmlist,
11511 for the case where there is no prototype.
11512 (For example, shorts and chars are passed as ints.)
11513 When there is a prototype, this is overridden later. */
11515 DECL_ARG_TYPE (decl) = type_promotes_to (type);
11517 else if (decl_context == FIELD)
11519 if (type == error_mark_node)
11521 /* Happens when declaring arrays of sizes which
11522 are error_mark_node, for example. */
11525 else if (in_namespace && !friendp)
11527 /* Something like struct S { int N::j; }; */
11528 error ("invalid use of `::'");
11531 else if (TREE_CODE (type) == FUNCTION_TYPE)
11534 tree function_context;
11536 /* We catch the others as conflicts with the builtin
11538 if (friendp && declarator == ridpointers[(int) RID_SIGNED])
11540 error ("function `%D' cannot be declared friend",
11547 if (ctype == NULL_TREE)
11548 ctype = current_class_type;
11550 if (ctype == NULL_TREE)
11552 error ("can't make `%D' into a method -- not in a class",
11554 return void_type_node;
11557 /* ``A union may [ ... ] not [ have ] virtual functions.''
11559 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
11561 error ("function `%D' declared virtual inside a union",
11563 return void_type_node;
11566 if (declarator == ansi_opname (NEW_EXPR)
11567 || declarator == ansi_opname (VEC_NEW_EXPR)
11568 || declarator == ansi_opname (DELETE_EXPR)
11569 || declarator == ansi_opname (VEC_DELETE_EXPR))
11573 error ("`%D' cannot be declared virtual, since it is always static",
11578 else if (staticp < 2)
11579 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11580 TYPE_ARG_TYPES (type));
11583 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11584 function_context = (ctype != NULL_TREE) ?
11585 decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
11586 publicp = (! friendp || ! staticp)
11587 && function_context == NULL_TREE;
11588 decl = grokfndecl (ctype, type,
11589 TREE_CODE (declarator) != TEMPLATE_ID_EXPR
11590 ? declarator : dname,
11592 virtualp, flags, quals, raises,
11593 friendp ? -1 : 0, friendp, publicp, inlinep,
11594 funcdef_flag, template_count, in_namespace);
11595 if (decl == NULL_TREE)
11598 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11599 /* The decl and setting of decl_attr is also turned off. */
11600 decl = build_decl_attribute_variant (decl, decl_attr);
11603 /* [class.conv.ctor]
11605 A constructor declared without the function-specifier
11606 explicit that can be called with a single parameter
11607 specifies a conversion from the type of its first
11608 parameter to the type of its class. Such a constructor
11609 is called a converting constructor. */
11610 if (explicitp == 2)
11611 DECL_NONCONVERTING_P (decl) = 1;
11612 else if (DECL_CONSTRUCTOR_P (decl))
11614 /* The constructor can be called with exactly one
11615 parameter if there is at least one parameter, and
11616 any subsequent parameters have default arguments.
11617 Ignore any compiler-added parms. */
11618 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (decl);
11620 if (arg_types == void_list_node
11622 && TREE_CHAIN (arg_types)
11623 && TREE_CHAIN (arg_types) != void_list_node
11624 && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
11625 DECL_NONCONVERTING_P (decl) = 1;
11628 else if (TREE_CODE (type) == METHOD_TYPE)
11630 /* We only get here for friend declarations of
11631 members of other classes. */
11632 /* All method decls are public, so tell grokfndecl to set
11633 TREE_PUBLIC, also. */
11634 decl = grokfndecl (ctype, type, declarator, declarator,
11635 virtualp, flags, quals, raises,
11636 friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
11637 template_count, in_namespace);
11638 if (decl == NULL_TREE)
11641 else if (!staticp && ! processing_template_decl
11642 && !COMPLETE_TYPE_P (complete_type (type))
11643 && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
11646 error ("field `%D' has incomplete type", declarator);
11648 error ("name `%T' has incomplete type", type);
11650 /* If we're instantiating a template, tell them which
11651 instantiation made the field's type be incomplete. */
11652 if (current_class_type
11653 && TYPE_NAME (current_class_type)
11654 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
11655 && declspecs && TREE_VALUE (declspecs)
11656 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
11657 error (" in instantiation of template `%T'",
11658 current_class_type);
11660 type = error_mark_node;
11667 error ("`%s' is neither function nor member function; cannot be declared friend",
11668 IDENTIFIER_POINTER (declarator));
11676 /* Friends are treated specially. */
11677 if (ctype == current_class_type)
11678 warning ("member functions are implicitly friends of their class");
11681 tree t = NULL_TREE;
11682 if (decl && DECL_NAME (decl))
11684 if (template_class_depth (current_class_type) == 0)
11687 = check_explicit_specialization
11689 template_count, 2 * (funcdef_flag != 0) + 4);
11690 if (decl == error_mark_node)
11691 return error_mark_node;
11694 t = do_friend (ctype, declarator, decl,
11695 last_function_parms, *attrlist,
11696 flags, quals, funcdef_flag);
11698 if (t && funcdef_flag)
11701 return void_type_node;
11705 /* Structure field. It may not be a function, except for C++ */
11707 if (decl == NULL_TREE)
11713 /* An attempt is being made to initialize a non-static
11714 member. But, from [class.mem]:
11716 4 A member-declarator can contain a
11717 constant-initializer only if it declares a static
11718 member (_class.static_) of integral or enumeration
11719 type, see _class.static.data_.
11721 This used to be relatively common practice, but
11722 the rest of the compiler does not correctly
11723 handle the initialization unless the member is
11724 static so we make it static below. */
11725 pedwarn ("ISO C++ forbids initialization of member `%D'",
11727 pedwarn ("making `%D' static", declarator);
11731 if (uses_template_parms (type))
11732 /* We'll check at instantiation time. */
11734 else if (check_static_variable_definition (declarator,
11736 /* If we just return the declaration, crashes
11737 will sometimes occur. We therefore return
11738 void_type_node, as if this was a friend
11739 declaration, to cause callers to completely
11740 ignore this declaration. */
11741 return void_type_node;
11744 /* 9.2p13 [class.mem] */
11745 if (declarator == constructor_name (current_class_type)
11746 /* The standard does not allow non-static data members
11747 here either, but we agreed at the 10/99 meeting
11748 to change that in TC 1 so that they are allowed in
11749 classes with no user-defined constructors. */
11751 pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11756 /* C++ allows static class members. All other work
11757 for this is done by grokfield. */
11758 decl = build_lang_decl (VAR_DECL, declarator, type);
11759 TREE_STATIC (decl) = 1;
11760 /* In class context, 'static' means public access. */
11761 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
11765 decl = build_decl (FIELD_DECL, declarator, type);
11766 DECL_NONADDRESSABLE_P (decl) = bitfield;
11767 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11769 DECL_MUTABLE_P (decl) = 1;
11770 RIDBIT_RESET (RID_MUTABLE, specbits);
11774 bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
11775 inlinep, friendp, raises != NULL_TREE);
11778 else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
11780 tree original_name;
11786 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11787 original_name = dname;
11789 original_name = declarator;
11791 if (RIDBIT_SETP (RID_AUTO, specbits))
11792 error ("storage class `auto' invalid for function `%s'", name);
11793 else if (RIDBIT_SETP (RID_REGISTER, specbits))
11794 error ("storage class `register' invalid for function `%s'", name);
11796 /* Function declaration not at top level.
11797 Storage classes other than `extern' are not allowed
11798 and `extern' makes no difference. */
11799 if (! toplevel_bindings_p ()
11800 && (RIDBIT_SETP (RID_STATIC, specbits)
11801 || RIDBIT_SETP (RID_INLINE, specbits))
11804 if (RIDBIT_SETP (RID_STATIC, specbits))
11805 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
11807 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
11810 if (ctype == NULL_TREE)
11814 error ("virtual non-class function `%s'", name);
11818 else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
11819 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11820 TYPE_ARG_TYPES (type));
11822 /* Record presence of `static'. */
11823 publicp = (ctype != NULL_TREE
11824 || RIDBIT_SETP (RID_EXTERN, specbits)
11825 || !RIDBIT_SETP (RID_STATIC, specbits));
11827 decl = grokfndecl (ctype, type, original_name, declarator,
11828 virtualp, flags, quals, raises,
11830 publicp, inlinep, funcdef_flag,
11831 template_count, in_namespace);
11832 if (decl == NULL_TREE)
11837 int illegal_static = 0;
11839 /* Don't allow a static member function in a class, and forbid
11840 declaring main to be static. */
11841 if (TREE_CODE (type) == METHOD_TYPE)
11843 pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11844 illegal_static = 1;
11846 else if (current_function_decl)
11848 /* FIXME need arm citation */
11849 error ("cannot declare static function inside another function");
11850 illegal_static = 1;
11853 if (illegal_static)
11856 RIDBIT_RESET (RID_STATIC, specbits);
11862 /* It's a variable. */
11864 /* An uninitialized decl with `extern' is a reference. */
11865 decl = grokvardecl (type, declarator, &specbits,
11867 (type_quals & TYPE_QUAL_CONST) != 0,
11869 bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11870 inlinep, friendp, raises != NULL_TREE);
11874 DECL_CONTEXT (decl) = ctype;
11877 pedwarn ("`static' may not be used when defining (as opposed to declaring) a static data member");
11879 RIDBIT_RESET (RID_STATIC, specbits);
11881 if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11883 error ("static member `%D' declared `register'", decl);
11884 RIDBIT_RESET (RID_REGISTER, specbits);
11886 if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11888 pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11890 RIDBIT_RESET (RID_EXTERN, specbits);
11895 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE, specbits), 19990927);
11897 /* Record `register' declaration for warnings on &
11898 and in case doing stupid register allocation. */
11900 if (RIDBIT_SETP (RID_REGISTER, specbits))
11901 DECL_REGISTER (decl) = 1;
11903 if (RIDBIT_SETP (RID_EXTERN, specbits))
11904 DECL_THIS_EXTERN (decl) = 1;
11906 if (RIDBIT_SETP (RID_STATIC, specbits))
11907 DECL_THIS_STATIC (decl) = 1;
11909 /* Record constancy and volatility. There's no need to do this
11910 when processing a template; we'll do this for the instantiated
11911 declaration based on the type of DECL. */
11912 if (!processing_template_decl)
11913 c_apply_type_quals_to_decl (type_quals, decl);
11919 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11920 An empty exprlist is a parmlist. An exprlist which
11921 contains only identifiers at the global level
11922 is a parmlist. Otherwise, it is an exprlist. */
11925 parmlist_is_exprlist (exprs)
11928 if (exprs == NULL_TREE || TREE_PARMLIST (exprs))
11931 if (toplevel_bindings_p ())
11933 /* At the global level, if these are all identifiers,
11934 then it is a parmlist. */
11937 if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE)
11939 exprs = TREE_CHAIN (exprs);
11946 /* Subroutine of start_function. Ensure that each of the parameter
11947 types (as listed in PARMS) is complete, as is required for a
11948 function definition. */
11951 require_complete_types_for_parms (parms)
11954 for (; parms; parms = TREE_CHAIN (parms))
11956 if (VOID_TYPE_P (TREE_TYPE (parms)))
11957 /* grokparms will have already issued an error */
11958 TREE_TYPE (parms) = error_mark_node;
11959 else if (complete_type_or_else (TREE_TYPE (parms), parms))
11960 layout_decl (parms, 0);
11962 TREE_TYPE (parms) = error_mark_node;
11966 /* Returns non-zero if T is a local variable. */
11969 local_variable_p (t)
11972 if ((TREE_CODE (t) == VAR_DECL
11973 /* A VAR_DECL with a context that is a _TYPE is a static data
11975 && !TYPE_P (CP_DECL_CONTEXT (t))
11976 /* Any other non-local variable must be at namespace scope. */
11977 && !DECL_NAMESPACE_SCOPE_P (t))
11978 || (TREE_CODE (t) == PARM_DECL))
11984 /* Returns non-zero if T is an automatic local variable or a label.
11985 (These are the declarations that need to be remapped when the code
11986 containing them is duplicated.) */
11989 nonstatic_local_decl_p (t)
11992 return ((local_variable_p (t) && !TREE_STATIC (t))
11993 || TREE_CODE (t) == LABEL_DECL
11994 || TREE_CODE (t) == RESULT_DECL);
11997 /* Like local_variable_p, but suitable for use as a tree-walking
12001 local_variable_p_walkfn (tp, walk_subtrees, data)
12003 int *walk_subtrees ATTRIBUTE_UNUSED;
12004 void *data ATTRIBUTE_UNUSED;
12006 return ((local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp))
12007 ? *tp : NULL_TREE);
12010 /* Check that ARG, which is a default-argument expression for a
12011 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
12012 something goes wrong. DECL may also be a _TYPE node, rather than a
12013 DECL, if there is no DECL available. */
12016 check_default_argument (decl, arg)
12023 if (TREE_CODE (arg) == DEFAULT_ARG)
12024 /* We get a DEFAULT_ARG when looking at an in-class declaration
12025 with a default argument. Ignore the argument for now; we'll
12026 deal with it after the class is complete. */
12029 if (processing_template_decl || uses_template_parms (arg))
12030 /* We don't do anything checking until instantiation-time. Note
12031 that there may be uninstantiated arguments even for an
12032 instantiated function, since default arguments are not
12033 instantiated until they are needed. */
12042 decl_type = TREE_TYPE (decl);
12044 if (arg == error_mark_node
12045 || decl == error_mark_node
12046 || TREE_TYPE (arg) == error_mark_node
12047 || decl_type == error_mark_node)
12048 /* Something already went wrong. There's no need to check
12050 return error_mark_node;
12052 /* [dcl.fct.default]
12054 A default argument expression is implicitly converted to the
12056 if (!TREE_TYPE (arg)
12057 || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
12060 error ("default argument for `%#D' has type `%T'",
12061 decl, TREE_TYPE (arg));
12063 error ("default argument for parameter of type `%T' has type `%T'",
12064 decl_type, TREE_TYPE (arg));
12066 return error_mark_node;
12069 /* [dcl.fct.default]
12071 Local variables shall not be used in default argument
12074 The keyword `this' shall not be used in a default argument of a
12075 member function. */
12076 var = walk_tree_without_duplicates (&arg, local_variable_p_walkfn,
12080 error ("default argument `%E' uses local variable `%D'",
12082 return error_mark_node;
12089 /* Decode the list of parameter types for a function type.
12090 Given the list of things declared inside the parens,
12091 return a list of types.
12093 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
12094 flag. If unset, we append void_list_node. A parmlist declared
12095 as `(void)' is accepted as the empty parmlist.
12097 Also set last_function_parms to the chain of PARM_DECLs. */
12100 grokparms (first_parm)
12103 tree result = NULL_TREE;
12104 tree decls = NULL_TREE;
12105 int ellipsis = !first_parm || PARMLIST_ELLIPSIS_P (first_parm);
12109 my_friendly_assert (!first_parm || TREE_PARMLIST (first_parm), 20001115);
12111 for (parm = first_parm; parm != NULL_TREE; parm = chain)
12113 tree type = NULL_TREE;
12114 tree decl = TREE_VALUE (parm);
12115 tree init = TREE_PURPOSE (parm);
12118 chain = TREE_CHAIN (parm);
12119 /* @@ weak defense against parse errors. */
12120 if (TREE_CODE (decl) != VOID_TYPE
12121 && TREE_CODE (decl) != TREE_LIST)
12123 /* Give various messages as the need arises. */
12124 if (TREE_CODE (decl) == STRING_CST)
12125 error ("invalid string constant `%E'", decl);
12126 else if (TREE_CODE (decl) == INTEGER_CST)
12127 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12131 if (parm == void_list_node)
12134 split_specs_attrs (TREE_PURPOSE (decl), &specs, &attrs);
12135 decl = grokdeclarator (TREE_VALUE (decl), specs,
12136 PARM, init != NULL_TREE, &attrs);
12137 if (! decl || TREE_TYPE (decl) == error_mark_node)
12141 cplus_decl_attributes (&decl, attrs, 0);
12143 type = TREE_TYPE (decl);
12144 if (VOID_TYPE_P (type))
12146 if (same_type_p (type, void_type_node)
12147 && !DECL_NAME (decl) && !result && !chain && !ellipsis)
12148 /* this is a parmlist of `(void)', which is ok. */
12150 incomplete_type_error (decl, type);
12151 /* It's not a good idea to actually create parameters of
12152 type `void'; other parts of the compiler assume that a
12153 void type terminates the parameter list. */
12154 type = error_mark_node;
12155 TREE_TYPE (decl) = error_mark_node;
12158 if (type != error_mark_node)
12160 /* Top-level qualifiers on the parameters are
12161 ignored for function types. */
12162 type = TYPE_MAIN_VARIANT (type);
12163 if (TREE_CODE (type) == METHOD_TYPE)
12165 error ("parameter `%D' invalidly declared method type", decl);
12166 type = build_pointer_type (type);
12167 TREE_TYPE (decl) = type;
12169 else if (TREE_CODE (type) == OFFSET_TYPE)
12171 error ("parameter `%D' invalidly declared offset type", decl);
12172 type = build_pointer_type (type);
12173 TREE_TYPE (decl) = type;
12175 else if (abstract_virtuals_error (decl, type))
12176 any_error = 1; /* Seems like a good idea. */
12177 else if (POINTER_TYPE_P (type))
12179 /* [dcl.fct]/6, parameter types cannot contain pointers
12180 (references) to arrays of unknown bound. */
12181 tree t = TREE_TYPE (type);
12182 int ptr = TYPE_PTR_P (type);
12186 if (TYPE_PTR_P (t))
12188 else if (TREE_CODE (t) != ARRAY_TYPE)
12190 else if (!TYPE_DOMAIN (t))
12194 if (TREE_CODE (t) == ARRAY_TYPE)
12195 error ("parameter `%D' includes %s to array of unknown bound `%T'",
12196 decl, ptr ? "pointer" : "reference", t);
12199 DECL_ARG_TYPE (decl) = TREE_TYPE (decl);
12200 if (PROMOTE_PROTOTYPES
12201 && INTEGRAL_TYPE_P (type)
12202 && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
12203 DECL_ARG_TYPE (decl) = integer_type_node;
12204 if (!any_error && init)
12205 init = check_default_argument (decl, init);
12210 TREE_CHAIN (decl) = decls;
12212 result = tree_cons (init, type, result);
12214 decls = nreverse (decls);
12215 result = nreverse (result);
12217 result = chainon (result, void_list_node);
12218 last_function_parms = decls;
12224 /* D is a constructor or overloaded `operator='.
12226 Let T be the class in which D is declared. Then, this function
12229 -1 if D's is an ill-formed constructor or copy assignment operator
12230 whose first parameter is of type `T'.
12231 0 if D is not a copy constructor or copy assignment
12233 1 if D is a copy constructor or copy assignment operator whose
12234 first parameter is a reference to const qualified T.
12235 2 if D is a copy constructor or copy assignment operator whose
12236 first parameter is a reference to non-const qualified T.
12238 This function can be used as a predicate. Positive values indicate
12239 a copy constructor and non-zero values indicate a copy assignment
12250 my_friendly_assert (DECL_FUNCTION_MEMBER_P (d), 20011208);
12252 if (DECL_TEMPLATE_INFO (d) && is_member_template (DECL_TI_TEMPLATE (d)))
12253 /* Instantiations of template member functions are never copy
12254 functions. Note that member functions of templated classes are
12255 represented as template functions internally, and we must
12256 accept those as copy functions. */
12259 args = FUNCTION_FIRST_USER_PARMTYPE (d);
12263 arg_type = TREE_VALUE (args);
12265 if (TYPE_MAIN_VARIANT (arg_type) == DECL_CONTEXT (d))
12267 /* Pass by value copy assignment operator. */
12270 else if (TREE_CODE (arg_type) == REFERENCE_TYPE
12271 && TYPE_MAIN_VARIANT (TREE_TYPE (arg_type)) == DECL_CONTEXT (d))
12273 if (CP_TYPE_CONST_P (TREE_TYPE (arg_type)))
12279 args = TREE_CHAIN (args);
12281 if (args && args != void_list_node && !TREE_PURPOSE (args))
12282 /* There are more non-optional args. */
12288 /* Remember any special properties of member function DECL. */
12290 void grok_special_member_properties (decl)
12293 if (!DECL_NONSTATIC_MEMBER_FUNCTION_P(decl))
12294 ; /* Not special. */
12295 else if (DECL_CONSTRUCTOR_P (decl))
12297 int ctor = copy_fn_p (decl);
12303 A non-template constructor for class X is a copy
12304 constructor if its first parameter is of type X&, const
12305 X&, volatile X& or const volatile X&, and either there
12306 are no other parameters or else all other parameters have
12307 default arguments. */
12308 TYPE_HAS_INIT_REF (DECL_CONTEXT (decl)) = 1;
12310 TYPE_HAS_CONST_INIT_REF (DECL_CONTEXT (decl)) = 1;
12312 else if (sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (decl)))
12313 TYPE_HAS_DEFAULT_CONSTRUCTOR (DECL_CONTEXT (decl)) = 1;
12315 else if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
12319 A non-template assignment operator for class X is a copy
12320 assignment operator if its parameter is of type X, X&, const
12321 X&, volatile X& or const volatile X&. */
12323 int assop = copy_fn_p (decl);
12327 TYPE_HAS_ASSIGN_REF (DECL_CONTEXT (decl)) = 1;
12329 TYPE_HAS_CONST_ASSIGN_REF (DECL_CONTEXT (decl)) = 1;
12330 if (DECL_PURE_VIRTUAL_P (decl))
12331 TYPE_HAS_ABSTRACT_ASSIGN_REF (DECL_CONTEXT (decl)) = 1;
12336 /* Check a constructor DECL has the correct form. Complains
12337 if the class has a constructor of the form X(X). */
12340 grok_ctor_properties (ctype, decl)
12343 int ctor_parm = copy_fn_p (decl);
12349 A declaration of a constructor for a class X is ill-formed if
12350 its first parameter is of type (optionally cv-qualified) X
12351 and either there are no other parameters or else all other
12352 parameters have default arguments.
12354 We *don't* complain about member template instantiations that
12355 have this form, though; they can occur as we try to decide
12356 what constructor to use during overload resolution. Since
12357 overload resolution will never prefer such a constructor to
12358 the non-template copy constructor (which is either explicitly
12359 or implicitly defined), there's no need to worry about their
12360 existence. Theoretically, they should never even be
12361 instantiated, but that's hard to forestall. */
12362 error ("invalid constructor; you probably meant `%T (const %T&)'",
12364 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
12371 /* An operator with this code is unary, but can also be binary. */
12375 enum tree_code code;
12377 return (code == INDIRECT_REF
12378 || code == ADDR_EXPR
12379 || code == CONVERT_EXPR
12380 || code == NEGATE_EXPR
12381 || code == PREINCREMENT_EXPR
12382 || code == PREDECREMENT_EXPR);
12385 /* An operator with this name can only be unary. */
12389 enum tree_code code;
12391 return (code == TRUTH_NOT_EXPR
12392 || code == BIT_NOT_EXPR
12393 || code == COMPONENT_REF
12394 || code == TYPE_EXPR);
12397 /* Do a little sanity-checking on how they declared their operator. */
12400 grok_op_properties (decl, friendp)
12404 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
12406 int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
12407 tree name = DECL_NAME (decl);
12408 enum tree_code operator_code;
12411 /* Count the number of arguments. */
12412 for (argtype = argtypes, arity = 0;
12413 argtype && argtype != void_list_node;
12414 argtype = TREE_CHAIN (argtype))
12417 if (current_class_type == NULL_TREE)
12420 if (DECL_CONV_FN_P (decl))
12421 operator_code = TYPE_EXPR;
12425 #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \
12426 if (ansi_opname (CODE) == name) \
12428 operator_code = (CODE); \
12431 else if (ansi_assopname (CODE) == name) \
12433 operator_code = (CODE); \
12434 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12438 #include "operators.def"
12439 #undef DEF_OPERATOR
12444 my_friendly_assert (operator_code != LAST_CPLUS_TREE_CODE, 20000526);
12445 SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12449 switch (operator_code)
12452 TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
12456 TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
12459 case COMPONENT_REF:
12461 TYPE_OVERLOADS_ARROW (current_class_type) = 1;
12465 TYPE_HAS_NEW_OPERATOR (current_class_type) = 1;
12469 TYPE_GETS_DELETE (current_class_type) |= 1;
12473 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type) = 1;
12476 case VEC_DELETE_EXPR:
12477 TYPE_GETS_DELETE (current_class_type) |= 2;
12485 if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR)
12487 /* When the compiler encounters the definition of A::operator new, it
12488 doesn't look at the class declaration to find out if it's static. */
12490 revert_static_member_fn (decl);
12492 TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
12494 else if (operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR)
12497 revert_static_member_fn (decl);
12499 TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
12503 /* An operator function must either be a non-static member function
12504 or have at least one parameter of a class, a reference to a class,
12505 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12506 if (! methodp || DECL_STATIC_FUNCTION_P (decl))
12508 if (operator_code == TYPE_EXPR
12509 || operator_code == CALL_EXPR
12510 || operator_code == COMPONENT_REF
12511 || operator_code == ARRAY_REF
12512 || operator_code == NOP_EXPR)
12513 error ("`%D' must be a nonstatic member function", decl);
12518 if (DECL_STATIC_FUNCTION_P (decl))
12519 error ("`%D' must be either a non-static member function or a non-member function", decl);
12522 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
12524 tree arg = TREE_VALUE (p);
12525 if (TREE_CODE (arg) == REFERENCE_TYPE)
12526 arg = TREE_TYPE (arg);
12528 /* This lets bad template code slip through. */
12529 if (IS_AGGR_TYPE (arg)
12530 || TREE_CODE (arg) == ENUMERAL_TYPE
12531 || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
12532 || TREE_CODE (arg) == BOUND_TEMPLATE_TEMPLATE_PARM)
12536 ("`%D' must have an argument of class or enumerated type",
12543 if (operator_code == CALL_EXPR)
12544 return; /* No restrictions on args. */
12546 if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
12548 tree t = TREE_TYPE (name);
12551 int ref = (TREE_CODE (t) == REFERENCE_TYPE);
12552 const char *what = 0;
12555 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
12557 if (TREE_CODE (t) == VOID_TYPE)
12559 else if (t == current_class_type)
12560 what = "the same type";
12561 /* Don't force t to be complete here. */
12562 else if (IS_AGGR_TYPE (t)
12563 && COMPLETE_TYPE_P (t)
12564 && DERIVED_FROM_P (t, current_class_type))
12565 what = "a base class";
12568 warning ("conversion to %s%s will never use a type conversion operator",
12569 ref ? "a reference to " : "", what);
12572 if (operator_code == COND_EXPR)
12575 error ("ISO C++ prohibits overloading operator ?:");
12577 else if (ambi_op_p (operator_code))
12580 /* We pick the one-argument operator codes by default, so
12581 we don't have to change anything. */
12583 else if (arity == 2)
12585 /* If we thought this was a unary operator, we now know
12586 it to be a binary operator. */
12587 switch (operator_code)
12590 operator_code = MULT_EXPR;
12594 operator_code = BIT_AND_EXPR;
12598 operator_code = PLUS_EXPR;
12602 operator_code = MINUS_EXPR;
12605 case PREINCREMENT_EXPR:
12606 operator_code = POSTINCREMENT_EXPR;
12609 case PREDECREMENT_EXPR:
12610 operator_code = POSTDECREMENT_EXPR;
12617 SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12619 if ((operator_code == POSTINCREMENT_EXPR
12620 || operator_code == POSTDECREMENT_EXPR)
12621 && ! processing_template_decl
12622 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
12625 error ("postfix `%D' must take `int' as its argument",
12629 ("postfix `%D' must take `int' as its second argument",
12636 error ("`%D' must take either zero or one argument", decl);
12638 error ("`%D' must take either one or two arguments", decl);
12641 /* More Effective C++ rule 6. */
12643 && (operator_code == POSTINCREMENT_EXPR
12644 || operator_code == POSTDECREMENT_EXPR
12645 || operator_code == PREINCREMENT_EXPR
12646 || operator_code == PREDECREMENT_EXPR))
12648 tree arg = TREE_VALUE (argtypes);
12649 tree ret = TREE_TYPE (TREE_TYPE (decl));
12650 if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
12651 arg = TREE_TYPE (arg);
12652 arg = TYPE_MAIN_VARIANT (arg);
12653 if (operator_code == PREINCREMENT_EXPR
12654 || operator_code == PREDECREMENT_EXPR)
12656 if (TREE_CODE (ret) != REFERENCE_TYPE
12657 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
12659 warning ("prefix `%D' should return `%T'", decl,
12660 build_reference_type (arg));
12664 if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
12665 warning ("postfix `%D' should return `%T'", decl, arg);
12669 else if (unary_op_p (operator_code))
12674 error ("`%D' must take `void'", decl);
12676 error ("`%D' must take exactly one argument", decl);
12679 else /* if (binary_op_p (operator_code)) */
12684 error ("`%D' must take exactly one argument", decl);
12686 error ("`%D' must take exactly two arguments", decl);
12689 /* More Effective C++ rule 7. */
12691 && (operator_code == TRUTH_ANDIF_EXPR
12692 || operator_code == TRUTH_ORIF_EXPR
12693 || operator_code == COMPOUND_EXPR))
12694 warning ("user-defined `%D' always evaluates both arguments",
12698 /* Effective C++ rule 23. */
12701 && !DECL_ASSIGNMENT_OPERATOR_P (decl)
12702 && (operator_code == PLUS_EXPR
12703 || operator_code == MINUS_EXPR
12704 || operator_code == TRUNC_DIV_EXPR
12705 || operator_code == MULT_EXPR
12706 || operator_code == TRUNC_MOD_EXPR)
12707 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
12708 warning ("`%D' should return by value", decl);
12710 /* [over.oper]/8 */
12711 for (; argtypes && argtypes != void_list_node;
12712 argtypes = TREE_CHAIN (argtypes))
12713 if (TREE_PURPOSE (argtypes))
12715 TREE_PURPOSE (argtypes) = NULL_TREE;
12716 if (operator_code == POSTINCREMENT_EXPR
12717 || operator_code == POSTDECREMENT_EXPR)
12720 pedwarn ("`%D' cannot have default arguments", decl);
12723 error ("`%D' cannot have default arguments", decl);
12729 static const char *
12731 enum tag_types code;
12748 /* Get the struct, enum or union (CODE says which) with tag NAME.
12749 Define the tag as a forward-reference if it is not defined.
12751 C++: If a class derivation is given, process it here, and report
12752 an error if multiple derivation declarations are not identical.
12754 If this is a definition, come in through xref_tag and only look in
12755 the current frame for the name (since C++ allows new names in any
12759 xref_tag (code_type_node, name, globalize)
12760 tree code_type_node;
12764 enum tag_types tag_code;
12765 enum tree_code code;
12766 register tree ref, t;
12767 struct binding_level *b = current_binding_level;
12768 tree attributes = NULL_TREE;
12769 tree context = NULL_TREE;
12771 /* If we are called from the parser, code_type_node will sometimes be a
12772 TREE_LIST. This indicates that the user wrote
12773 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12775 if (TREE_CODE (code_type_node) == TREE_LIST)
12777 attributes = TREE_PURPOSE (code_type_node);
12778 code_type_node = TREE_VALUE (code_type_node);
12781 tag_code = (enum tag_types) tree_low_cst (code_type_node, 1);
12786 code = RECORD_TYPE;
12792 code = ENUMERAL_TYPE;
12798 /* If a cross reference is requested, look up the type
12799 already defined for this tag and return it. */
12803 name = TYPE_IDENTIFIER (t);
12806 t = IDENTIFIER_TYPE_VALUE (name);
12808 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12809 if (t && globalize && TREE_CODE (t) == TYPENAME_TYPE)
12811 static int explained;
12814 warning ("`%s %T' declares a new type at namespace scope",
12815 tag_name (tag_code), name);
12817 warning (" names from dependent base classes are not visible to unqualified name lookup - to refer to the inherited type, say `%s %T::%T'",
12818 tag_name (tag_code),
12819 constructor_name (current_class_type),
12820 TYPE_IDENTIFIER (t));
12822 /* We need to remove the class scope binding for the
12823 TYPENAME_TYPE as otherwise poplevel_class gets confused. */
12824 for (shadowed = b->class_shadowed;
12826 shadowed = TREE_CHAIN (shadowed))
12827 if (TREE_TYPE (shadowed) == TYPE_NAME (t))
12829 TREE_PURPOSE (shadowed) = NULL_TREE;
12834 if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
12835 && TREE_CODE (t) != BOUND_TEMPLATE_TEMPLATE_PARM)
12840 /* If we know we are defining this tag, only look it up in
12841 this scope and don't try to find it as a type. */
12842 ref = lookup_tag (code, name, b, 1);
12848 ref = follow_tag_typedef (t);
12850 /* [dcl.type.elab] If the identifier resolves to a
12851 typedef-name or a template type-parameter, the
12852 elaborated-type-specifier is ill-formed. */
12855 pedwarn ("using typedef-name `%D' after `%s'",
12856 TYPE_NAME (t), tag_name (tag_code));
12859 else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
12860 error ("using template type parameter `%T' after `%s'",
12861 t, tag_name (tag_code));
12864 ref = lookup_tag (code, name, b, 0);
12868 /* Try finding it as a type declaration. If that wins,
12870 ref = lookup_name (name, 1);
12872 if (ref != NULL_TREE
12873 && processing_template_decl
12874 && DECL_CLASS_TEMPLATE_P (ref)
12875 && template_class_depth (current_class_type) == 0)
12876 /* Since GLOBALIZE is true, we're declaring a global
12877 template, so we want this type. */
12878 ref = DECL_TEMPLATE_RESULT (ref);
12880 if (ref && TREE_CODE (ref) == TYPE_DECL
12881 && TREE_CODE (TREE_TYPE (ref)) == code)
12882 ref = TREE_TYPE (ref);
12887 if (ref && current_class_type
12888 && template_class_depth (current_class_type)
12889 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12891 /* Since GLOBALIZE is non-zero, we are not looking at a
12892 definition of this tag. Since, in addition, we are currently
12893 processing a (member) template declaration of a template
12894 class, we must be very careful; consider:
12901 { template <class V>
12902 friend struct S1; };
12904 Here, the S2::S1 declaration should not be confused with the
12905 outer declaration. In particular, the inner version should
12906 have a template parameter of level 2, not level 1. This
12907 would be particularly important if the member declaration
12910 template <class V = U> friend struct S1;
12912 say, when we should tsubst into `U' when instantiating
12913 S2. On the other hand, when presented with:
12923 we must find the inner binding eventually. We
12924 accomplish this by making sure that the new type we
12925 create to represent this declaration has the right
12927 context = TYPE_CONTEXT (ref);
12934 /* If no such tag is yet defined, create a forward-reference node
12935 and record it as the "definition".
12936 When a real declaration of this type is found,
12937 the forward-reference will be altered into a real type. */
12938 if (code == ENUMERAL_TYPE)
12940 error ("use of enum `%#D' without previous declaration", name);
12942 ref = make_node (ENUMERAL_TYPE);
12944 /* Give the type a default layout like unsigned int
12945 to avoid crashing if it does not get defined. */
12946 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12947 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12948 TYPE_USER_ALIGN (ref) = 0;
12949 TREE_UNSIGNED (ref) = 1;
12950 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12951 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12952 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12954 /* Enable us to recognize when a type is created in class context.
12955 To do nested classes correctly, this should probably be cleared
12956 out when we leave this classes scope. Currently this in only
12957 done in `start_enum'. */
12959 pushtag (name, ref, globalize);
12963 struct binding_level *old_b = class_binding_level;
12965 ref = make_aggr_type (code);
12966 TYPE_CONTEXT (ref) = context;
12968 #ifdef NONNESTED_CLASSES
12969 /* Class types don't nest the way enums do. */
12970 class_binding_level = (struct binding_level *)0;
12972 pushtag (name, ref, globalize);
12973 class_binding_level = old_b;
12978 if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12979 redeclare_class_template (ref, current_template_parms);
12982 TYPE_ATTRIBUTES (ref) = attributes;
12988 xref_tag_from_type (old, id, globalize)
12992 tree code_type_node;
12994 if (TREE_CODE (old) == RECORD_TYPE)
12995 code_type_node = (CLASSTYPE_DECLARED_CLASS (old)
12996 ? class_type_node : record_type_node);
12998 code_type_node = union_type_node;
13000 if (id == NULL_TREE)
13001 id = TYPE_IDENTIFIER (old);
13003 return xref_tag (code_type_node, id, globalize);
13006 /* REF is a type (named NAME), for which we have just seen some
13007 baseclasses. BINFO is a list of those baseclasses; the
13008 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
13009 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
13010 struct, or union. */
13013 xref_basetypes (code_type_node, name, ref, binfo)
13014 tree code_type_node;
13015 tree name ATTRIBUTE_UNUSED;
13019 /* In the declaration `A : X, Y, ... Z' we mark all the types
13020 (A, X, Y, ..., Z) so we can check for duplicates. */
13025 enum tag_types tag_code;
13027 /* If we are called from the parser, code_type_node will sometimes be a
13028 TREE_LIST. This indicates that the user wrote
13029 "class __attribute__ ((foo)) bar". Extract the attributes so that
13030 tree_low_cst doesn't crash. */
13031 if (TREE_CODE (code_type_node) == TREE_LIST)
13032 code_type_node = TREE_VALUE (code_type_node);
13034 tag_code = (enum tag_types) tree_low_cst (code_type_node, 1);
13036 if (tag_code == union_type)
13038 error ("derived union `%T' invalid", ref);
13042 len = list_length (binfo);
13044 /* First, make sure that any templates in base-classes are
13045 instantiated. This ensures that if we call ourselves recursively
13046 we do not get confused about which classes are marked and which
13048 for (base = binfo; base; base = TREE_CHAIN (base))
13049 complete_type (TREE_VALUE (base));
13051 SET_CLASSTYPE_MARKED (ref);
13052 BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len);
13054 for (i = 0; binfo; binfo = TREE_CHAIN (binfo))
13056 /* The base of a derived struct is public by default. */
13058 = (TREE_PURPOSE (binfo) == access_public_node
13059 || TREE_PURPOSE (binfo) == access_public_virtual_node
13060 || (tag_code != class_type
13061 && (TREE_PURPOSE (binfo) == access_default_node
13062 || TREE_PURPOSE (binfo) == access_default_virtual_node)));
13064 = (TREE_PURPOSE (binfo) == access_protected_node
13065 || TREE_PURPOSE (binfo) == access_protected_virtual_node);
13067 = (TREE_PURPOSE (binfo) == access_private_virtual_node
13068 || TREE_PURPOSE (binfo) == access_protected_virtual_node
13069 || TREE_PURPOSE (binfo) == access_public_virtual_node
13070 || TREE_PURPOSE (binfo) == access_default_virtual_node);
13071 tree basetype = TREE_VALUE (binfo);
13074 if (basetype && TREE_CODE (basetype) == TYPE_DECL)
13075 basetype = TREE_TYPE (basetype);
13077 || (TREE_CODE (basetype) != RECORD_TYPE
13078 && TREE_CODE (basetype) != TYPENAME_TYPE
13079 && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
13080 && TREE_CODE (basetype) != BOUND_TEMPLATE_TEMPLATE_PARM))
13082 error ("base type `%T' fails to be a struct or class type",
13083 TREE_VALUE (binfo));
13087 /* This code replaces similar code in layout_basetypes.
13088 We put the complete_type first for implicit `typename'. */
13089 if (!COMPLETE_TYPE_P (basetype)
13090 && ! (current_template_parms && uses_template_parms (basetype)))
13092 error ("base class `%T' has incomplete type", basetype);
13097 if (CLASSTYPE_MARKED (basetype))
13099 if (basetype == ref)
13100 error ("recursive type `%T' undefined", basetype);
13102 error ("duplicate base type `%T' invalid", basetype);
13106 if (TYPE_FOR_JAVA (basetype)
13107 && (current_lang_depth () == 0))
13108 TYPE_FOR_JAVA (ref) = 1;
13110 /* Note that the BINFO records which describe individual
13111 inheritances are *not* shared in the lattice! They
13112 cannot be shared because a given baseclass may be
13113 inherited with different `accessibility' by different
13114 derived classes. (Each BINFO record describing an
13115 individual inheritance contains flags which say what
13116 the `accessibility' of that particular inheritance is.) */
13119 = make_binfo (size_zero_node, basetype,
13120 CLASS_TYPE_P (basetype)
13121 ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE,
13122 CLASS_TYPE_P (basetype)
13123 ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE);
13125 TREE_VEC_ELT (binfos, i) = base_binfo;
13126 TREE_VIA_PUBLIC (base_binfo) = via_public;
13127 TREE_VIA_PROTECTED (base_binfo) = via_protected;
13128 TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
13129 BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref);
13131 /* We need to unshare the binfos now so that lookups during class
13132 definition work. */
13133 unshare_base_binfos (base_binfo);
13135 SET_CLASSTYPE_MARKED (basetype);
13137 /* We are free to modify these bits because they are meaningless
13138 at top level, and BASETYPE is a top-level type. */
13139 if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
13141 TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
13142 /* Converting to a virtual base class requires looking
13143 up the offset of the virtual base. */
13144 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
13147 if (CLASS_TYPE_P (basetype))
13149 TYPE_HAS_NEW_OPERATOR (ref)
13150 |= TYPE_HAS_NEW_OPERATOR (basetype);
13151 TYPE_HAS_ARRAY_NEW_OPERATOR (ref)
13152 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype);
13153 TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
13154 /* If the base-class uses multiple inheritance, so do we. */
13155 TYPE_USES_MULTIPLE_INHERITANCE (ref)
13156 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype);
13157 /* Likewise, if converting to a base of the base may require
13158 code, then we may need to generate code to convert to a
13160 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref)
13161 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype);
13168 TREE_VEC_LENGTH (binfos) = i;
13170 BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE;
13174 TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
13175 /* If there is more than one non-empty they cannot be at the same
13177 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
13180 /* Unmark all the types. */
13182 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i)));
13183 CLEAR_CLASSTYPE_MARKED (ref);
13185 /* Now that we know all the base-classes, set up the list of virtual
13187 get_vbase_types (ref);
13191 /* Begin compiling the definition of an enumeration type.
13192 NAME is its name (or null if anonymous).
13193 Returns the type object, as yet incomplete.
13194 Also records info about it so that build_enumerator
13195 may be used to declare the individual values as they are read. */
13201 register tree enumtype = NULL_TREE;
13202 struct binding_level *b = current_binding_level;
13204 /* If this is the real definition for a previous forward reference,
13205 fill in the contents in the same object that used to be the
13206 forward reference. */
13208 if (name != NULL_TREE)
13209 enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
13211 if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
13213 error ("multiple definition of `%#T'", enumtype);
13214 cp_error_at ("previous definition here", enumtype);
13215 /* Clear out TYPE_VALUES, and start again. */
13216 TYPE_VALUES (enumtype) = NULL_TREE;
13220 enumtype = make_node (ENUMERAL_TYPE);
13221 pushtag (name, enumtype, 0);
13227 /* After processing and defining all the values of an enumeration type,
13228 install their decls in the enumeration type and finish it off.
13229 ENUMTYPE is the type object and VALUES a list of name-value pairs. */
13232 finish_enum (enumtype)
13244 /* We built up the VALUES in reverse order. */
13245 TYPE_VALUES (enumtype) = nreverse (TYPE_VALUES (enumtype));
13249 Following the closing brace of an enum-specifier, each
13250 enumerator has the type of its enumeration. Prior to the
13251 closing brace, the type of each enumerator is the type of
13252 its initializing value. */
13253 for (pair = TYPE_VALUES (enumtype); pair; pair = TREE_CHAIN (pair))
13254 TREE_TYPE (TREE_VALUE (pair)) = enumtype;
13256 /* For a enum defined in a template, all further processing is
13257 postponed until the template is instantiated. */
13258 if (processing_template_decl)
13260 tree scope = current_scope ();
13261 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
13262 add_stmt (build_min (TAG_DEFN, enumtype));
13268 /* Figure out what the minimum and maximum values of the enumerators
13270 if (TYPE_VALUES (enumtype))
13272 minnode = maxnode = NULL_TREE;
13274 for (pair = TYPE_VALUES (enumtype);
13276 pair = TREE_CHAIN (pair))
13280 value = DECL_INITIAL (TREE_VALUE (pair));
13283 minnode = maxnode = value;
13284 else if (tree_int_cst_lt (maxnode, value))
13286 else if (tree_int_cst_lt (value, minnode))
13291 minnode = maxnode = integer_zero_node;
13293 /* Compute the number of bits require to represent all values of the
13294 enumeration. We must do this before the type of MINNODE and
13295 MAXNODE are transformed, since min_precision relies on the
13296 TREE_TYPE of the value it is passed. */
13297 unsignedp = tree_int_cst_sgn (minnode) >= 0;
13298 lowprec = min_precision (minnode, unsignedp);
13299 highprec = min_precision (maxnode, unsignedp);
13300 precision = MAX (lowprec, highprec);
13302 /* Set the TREE_TYPE for the values as well. That's so that when we
13303 call decl_constant_value we get an entity of the right type (but
13304 with the constant value). In addition, transform the TYPE_VALUES
13305 list to contain the values, rather than the CONST_DECLs for them. */
13306 for (pair = TYPE_VALUES (enumtype); pair; pair = TREE_CHAIN (pair))
13308 tree value = DECL_INITIAL (TREE_VALUE (pair));
13310 TREE_TYPE (value) = enumtype;
13311 TREE_VALUE (pair) = value;
13314 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13315 TYPE_SIZE (enumtype) = NULL_TREE;
13316 TYPE_PRECISION (enumtype) = precision;
13318 fixup_unsigned_type (enumtype);
13320 fixup_signed_type (enumtype);
13322 if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
13323 /* Use the width of the narrowest normal C type which is wide
13325 TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size
13328 TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
13330 TYPE_SIZE (enumtype) = NULL_TREE;
13331 layout_type (enumtype);
13333 /* Fix up all variant types of this enum type. */
13334 for (t = TYPE_MAIN_VARIANT (enumtype); t; t = TYPE_NEXT_VARIANT (t))
13336 TYPE_VALUES (t) = TYPE_VALUES (enumtype);
13337 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (enumtype);
13338 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (enumtype);
13339 TYPE_SIZE (t) = TYPE_SIZE (enumtype);
13340 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (enumtype);
13341 TYPE_MODE (t) = TYPE_MODE (enumtype);
13342 TYPE_PRECISION (t) = TYPE_PRECISION (enumtype);
13343 TYPE_ALIGN (t) = TYPE_ALIGN (enumtype);
13344 TYPE_USER_ALIGN (t) = TYPE_USER_ALIGN (enumtype);
13345 TREE_UNSIGNED (t) = TREE_UNSIGNED (enumtype);
13348 /* Finish debugging output for this type. */
13349 rest_of_type_compilation (enumtype, namespace_bindings_p ());
13352 /* Build and install a CONST_DECL for an enumeration constant of the
13353 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13354 Assignment of sequential values by default is handled here. */
13357 build_enumerator (name, value, enumtype)
13367 /* Remove no-op casts from the value. */
13369 STRIP_TYPE_NOPS (value);
13371 if (! processing_template_decl)
13373 /* Validate and default VALUE. */
13374 if (value != NULL_TREE)
13376 value = decl_constant_value (value);
13378 if (TREE_CODE (value) == INTEGER_CST)
13380 value = default_conversion (value);
13381 constant_expression_warning (value);
13385 error ("enumerator value for `%D' not integer constant", name);
13390 /* Default based on previous value. */
13391 if (value == NULL_TREE && ! processing_template_decl)
13395 if (TYPE_VALUES (enumtype))
13397 /* The next value is the previous value ... */
13398 prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype)));
13399 /* ... plus one. */
13400 value = cp_build_binary_op (PLUS_EXPR,
13404 if (tree_int_cst_lt (value, prev_value))
13405 error ("overflow in enumeration values at `%D'", name);
13408 value = integer_zero_node;
13411 /* Remove no-op casts from the value. */
13413 STRIP_TYPE_NOPS (value);
13415 /* To fix MAX_VAL enum consts. (bkoz) */
13416 TREE_TYPE (value) = integer_type_node;
13420 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13421 Even in other cases, we will later (in finish_enum) be setting
13422 the type of VALUE. But, we don't need to make a copy if this
13423 VALUE is one of the enumeration constants for this same
13424 enumeration type. */
13425 for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values))
13426 if (TREE_VALUE (values) == value)
13428 /* If we didn't break out of the loop, then we do need a copy. */
13429 if (!values && value)
13430 value = copy_node (value);
13432 /* C++ associates enums with global, function, or class declarations. */
13433 context = current_scope ();
13435 /* Build the actual enumeration constant. Note that the enumeration
13436 constants have the type of their initializers until the
13437 enumeration is complete:
13441 Following the closing brace of an enum-specifier, each enumer-
13442 ator has the type of its enumeration. Prior to the closing
13443 brace, the type of each enumerator is the type of its
13444 initializing value.
13446 In finish_enum we will reset the type. Of course, if we're
13447 processing a template, there may be no value. */
13448 type = value ? TREE_TYPE (value) : NULL_TREE;
13450 if (context && context == current_class_type)
13451 /* This enum declaration is local to the class. We need the full
13452 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13453 decl = build_lang_decl (CONST_DECL, name, type);
13455 /* It's a global enum, or it's local to a function. (Note local to
13456 a function could mean local to a class method. */
13457 decl = build_decl (CONST_DECL, name, type);
13459 DECL_CONTEXT (decl) = FROB_CONTEXT (context);
13460 DECL_INITIAL (decl) = value;
13461 TREE_READONLY (decl) = 1;
13463 if (context && context == current_class_type)
13464 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13465 on the TYPE_FIELDS list for `S'. (That's so that you can say
13466 things like `S::i' later.) */
13467 finish_member_declaration (decl);
13471 /* Add this enumeration constant to the list for this type. */
13472 TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype));
13476 /* We're defining DECL. Make sure that it's type is OK. */
13479 check_function_type (decl, current_function_parms)
13481 tree current_function_parms;
13483 tree fntype = TREE_TYPE (decl);
13484 tree return_type = complete_type (TREE_TYPE (fntype));
13486 /* In a function definition, arg types must be complete. */
13487 require_complete_types_for_parms (current_function_parms);
13489 if (!COMPLETE_OR_VOID_TYPE_P (return_type))
13491 error ("return type `%#T' is incomplete", TREE_TYPE (fntype));
13493 /* Make it return void instead, but don't change the
13494 type of the DECL_RESULT, in case we have a named return value. */
13495 if (TREE_CODE (fntype) == METHOD_TYPE)
13497 tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
13499 = build_cplus_method_type (ctype,
13501 FUNCTION_ARG_CHAIN (decl));
13505 = build_function_type (void_type_node,
13506 TYPE_ARG_TYPES (TREE_TYPE (decl)));
13508 = build_exception_variant (fntype,
13509 TYPE_RAISES_EXCEPTIONS (fntype));
13512 abstract_virtuals_error (decl, TREE_TYPE (fntype));
13515 /* Create the FUNCTION_DECL for a function definition.
13516 DECLSPECS and DECLARATOR are the parts of the declaration;
13517 they describe the function's name and the type it returns,
13518 but twisted together in a fashion that parallels the syntax of C.
13520 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13521 DECLARATOR is really the DECL for the function we are about to
13522 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13523 indicating that the function is an inline defined in-class.
13525 This function creates a binding context for the function body
13526 as well as setting up the FUNCTION_DECL in current_function_decl.
13528 Returns 1 on success. If the DECLARATOR is not suitable for a function
13529 (it defines a datum instead), we return 0, which tells
13530 yyparse to report a parse error.
13532 For C++, we must first check whether that datum makes any sense.
13533 For example, "class A local_a(1,2);" means that variable local_a
13534 is an aggregate of type A, which should have a constructor
13535 applied to it with the argument list [1, 2]. */
13538 start_function (declspecs, declarator, attrs, flags)
13539 tree declspecs, declarator, attrs;
13543 tree ctype = NULL_TREE;
13546 extern int have_extern_spec;
13547 extern int used_extern_spec;
13548 int doing_friend = 0;
13549 struct binding_level *bl;
13550 tree current_function_parms;
13552 /* Sanity check. */
13553 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
13554 my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
13556 /* This should only be done once on the top most decl. */
13557 if (have_extern_spec && !used_extern_spec)
13559 declspecs = tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
13560 used_extern_spec = 1;
13563 if (flags & SF_PRE_PARSED)
13565 decl1 = declarator;
13567 fntype = TREE_TYPE (decl1);
13568 if (TREE_CODE (fntype) == METHOD_TYPE)
13569 ctype = TYPE_METHOD_BASETYPE (fntype);
13571 /* ISO C++ 11.4/5. A friend function defined in a class is in
13572 the (lexical) scope of the class in which it is defined. */
13573 if (!ctype && DECL_FRIEND_P (decl1))
13575 ctype = DECL_FRIEND_CONTEXT (decl1);
13577 /* CTYPE could be null here if we're dealing with a template;
13578 for example, `inline friend float foo()' inside a template
13579 will have no CTYPE set. */
13580 if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
13586 last_function_parms = DECL_ARGUMENTS (decl1);
13590 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL);
13591 /* If the declarator is not suitable for a function definition,
13592 cause a syntax error. */
13593 if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL)
13596 cplus_decl_attributes (&decl1, attrs, 0);
13598 /* If #pragma weak was used, mark the decl weak now. */
13599 if (current_binding_level == global_binding_level)
13600 maybe_apply_pragma_weak (decl1);
13602 fntype = TREE_TYPE (decl1);
13604 restype = TREE_TYPE (fntype);
13605 if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
13607 error ("semicolon missing after declaration of `%#T'", restype);
13608 shadow_tag (build_tree_list (NULL_TREE, restype));
13609 CLASSTYPE_GOT_SEMICOLON (restype) = 1;
13610 if (TREE_CODE (fntype) == FUNCTION_TYPE)
13611 fntype = build_function_type (integer_type_node,
13612 TYPE_ARG_TYPES (fntype));
13614 fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
13616 TYPE_ARG_TYPES (fntype));
13617 TREE_TYPE (decl1) = fntype;
13620 if (TREE_CODE (fntype) == METHOD_TYPE)
13621 ctype = TYPE_METHOD_BASETYPE (fntype);
13622 else if (DECL_MAIN_P (decl1))
13624 /* If this doesn't return integer_type, complain. */
13625 if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
13627 if (pedantic || warn_return_type)
13628 pedwarn ("return type for `main' changed to `int'");
13629 TREE_TYPE (decl1) = fntype = default_function_type;
13634 if (DECL_DECLARED_INLINE_P (decl1)
13635 && lookup_attribute ("noinline", attrs))
13636 warning_with_decl (decl1,
13637 "inline function `%s' given attribute noinline");
13639 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl1))
13640 /* This is a constructor, we must ensure that any default args
13641 introduced by this definition are propagated to the clones
13642 now. The clones are used directly in overload resolution. */
13643 adjust_clone_args (decl1);
13645 /* Sometimes we don't notice that a function is a static member, and
13646 build a METHOD_TYPE for it. Fix that up now. */
13647 if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1)
13648 && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE)
13650 revert_static_member_fn (decl1);
13651 last_function_parms = TREE_CHAIN (last_function_parms);
13655 /* Warn if function was previously implicitly declared
13656 (but not if we warned then). */
13657 if (! warn_implicit
13658 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
13659 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
13661 /* Set up current_class_type, and enter the scope of the class, if
13664 push_nested_class (ctype, 1);
13665 else if (DECL_STATIC_FUNCTION_P (decl1))
13666 push_nested_class (DECL_CONTEXT (decl1), 2);
13668 /* Now that we have entered the scope of the class, we must restore
13669 the bindings for any template parameters surrounding DECL1, if it
13670 is an inline member template. (Order is important; consider the
13671 case where a template parameter has the same name as a field of
13672 the class.) It is not until after this point that
13673 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13674 if (flags & SF_INCLASS_INLINE)
13675 maybe_begin_member_template_processing (decl1);
13677 /* Effective C++ rule 15. */
13679 && DECL_OVERLOADED_OPERATOR_P (decl1) == NOP_EXPR
13680 && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
13681 warning ("`operator=' should return a reference to `*this'");
13683 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13684 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13685 if (!DECL_INITIAL (decl1))
13686 DECL_INITIAL (decl1) = error_mark_node;
13688 /* This function exists in static storage.
13689 (This does not mean `static' in the C sense!) */
13690 TREE_STATIC (decl1) = 1;
13692 /* We must call push_template_decl after current_class_type is set
13693 up. (If we are processing inline definitions after exiting a
13694 class scope, current_class_type will be NULL_TREE until set above
13695 by push_nested_class.) */
13696 if (processing_template_decl)
13697 decl1 = push_template_decl (decl1);
13699 /* We are now in the scope of the function being defined. */
13700 current_function_decl = decl1;
13702 /* Save the parm names or decls from this function's declarator
13703 where store_parm_decls will find them. */
13704 current_function_parms = last_function_parms;
13706 /* Make sure the parameter and return types are reasonable. When
13707 you declare a function, these types can be incomplete, but they
13708 must be complete when you define the function. */
13709 if (! processing_template_decl)
13710 check_function_type (decl1, current_function_parms);
13712 /* Build the return declaration for the function. */
13713 restype = TREE_TYPE (fntype);
13714 /* Promote the value to int before returning it. */
13715 if (c_promoting_integer_type_p (restype))
13716 restype = type_promotes_to (restype);
13717 if (DECL_RESULT (decl1) == NULL_TREE)
13719 DECL_RESULT (decl1)
13720 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13721 c_apply_type_quals_to_decl (cp_type_quals (restype),
13722 DECL_RESULT (decl1));
13725 /* Initialize RTL machinery. We cannot do this until
13726 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13727 even when processing a template; this is how we get
13728 CFUN set up, and our per-function variables initialized.
13729 FIXME factor out the non-RTL stuff. */
13730 bl = current_binding_level;
13731 init_function_start (decl1, input_filename, lineno);
13732 current_binding_level = bl;
13734 /* Even though we're inside a function body, we still don't want to
13735 call expand_expr to calculate the size of a variable-sized array.
13736 We haven't necessarily assigned RTL to all variables yet, so it's
13737 not safe to try to expand expressions involving them. */
13738 immediate_size_expand = 0;
13739 cfun->x_dont_save_pending_sizes_p = 1;
13741 /* Start the statement-tree, start the tree now. */
13742 begin_stmt_tree (&DECL_SAVED_TREE (decl1));
13744 /* Let the user know we're compiling this function. */
13745 announce_function (decl1);
13747 /* Record the decl so that the function name is defined.
13748 If we already have a decl for this name, and it is a FUNCTION_DECL,
13749 use the old decl. */
13750 if (!processing_template_decl && !(flags & SF_PRE_PARSED))
13752 /* A specialization is not used to guide overload resolution. */
13753 if (!DECL_TEMPLATE_SPECIALIZATION (decl1)
13754 && ! DECL_FUNCTION_MEMBER_P (decl1))
13755 decl1 = pushdecl (decl1);
13758 /* We need to set the DECL_CONTEXT. */
13759 if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
13760 DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
13761 /* And make sure we have enough default args. */
13762 check_default_args (decl1);
13764 fntype = TREE_TYPE (decl1);
13767 /* Reset these in case the call to pushdecl changed them. */
13768 current_function_decl = decl1;
13769 cfun->decl = decl1;
13771 /* If we are (erroneously) defining a function that we have already
13772 defined before, wipe out what we knew before. */
13773 if (!DECL_PENDING_INLINE_P (decl1)
13774 && DECL_SAVED_FUNCTION_DATA (decl1))
13776 free (DECL_SAVED_FUNCTION_DATA (decl1));
13777 DECL_SAVED_FUNCTION_DATA (decl1) = NULL;
13780 if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1))
13782 /* We know that this was set up by `grokclassfn'. We do not
13783 wait until `store_parm_decls', since evil parse errors may
13784 never get us to that point. Here we keep the consistency
13785 between `current_class_type' and `current_class_ptr'. */
13786 tree t = DECL_ARGUMENTS (decl1);
13788 my_friendly_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL,
13790 my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE,
13793 cp_function_chain->x_current_class_ref
13794 = build_indirect_ref (t, NULL);
13795 cp_function_chain->x_current_class_ptr = t;
13797 /* Constructors and destructors need to know whether they're "in
13798 charge" of initializing virtual base classes. */
13799 t = TREE_CHAIN (t);
13800 if (DECL_HAS_IN_CHARGE_PARM_P (decl1))
13802 current_in_charge_parm = t;
13803 t = TREE_CHAIN (t);
13805 if (DECL_HAS_VTT_PARM_P (decl1))
13807 if (DECL_NAME (t) != vtt_parm_identifier)
13809 current_vtt_parm = t;
13813 if (DECL_INTERFACE_KNOWN (decl1))
13815 tree ctx = decl_function_context (decl1);
13817 if (DECL_NOT_REALLY_EXTERN (decl1))
13818 DECL_EXTERNAL (decl1) = 0;
13820 if (ctx != NULL_TREE && DECL_DECLARED_INLINE_P (ctx)
13821 && TREE_PUBLIC (ctx))
13822 /* This is a function in a local class in an extern inline
13824 comdat_linkage (decl1);
13826 /* If this function belongs to an interface, it is public.
13827 If it belongs to someone else's interface, it is also external.
13828 This only affects inlines and template instantiations. */
13829 else if (interface_unknown == 0
13830 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13831 || flag_alt_external_templates))
13833 if (DECL_DECLARED_INLINE_P (decl1)
13834 || DECL_TEMPLATE_INSTANTIATION (decl1)
13835 || processing_template_decl)
13837 DECL_EXTERNAL (decl1)
13839 || (DECL_DECLARED_INLINE_P (decl1)
13840 && ! flag_implement_inlines
13841 && !DECL_VINDEX (decl1)));
13843 /* For WIN32 we also want to put these in linkonce sections. */
13844 maybe_make_one_only (decl1);
13847 DECL_EXTERNAL (decl1) = 0;
13848 DECL_NOT_REALLY_EXTERN (decl1) = 0;
13849 DECL_INTERFACE_KNOWN (decl1) = 1;
13851 else if (interface_unknown && interface_only
13852 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13853 || flag_alt_external_templates))
13855 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13856 interface, we will have interface_only set but not
13857 interface_known. In that case, we don't want to use the normal
13858 heuristics because someone will supply a #pragma implementation
13859 elsewhere, and deducing it here would produce a conflict. */
13860 comdat_linkage (decl1);
13861 DECL_EXTERNAL (decl1) = 0;
13862 DECL_INTERFACE_KNOWN (decl1) = 1;
13863 DECL_DEFER_OUTPUT (decl1) = 1;
13867 /* This is a definition, not a reference.
13868 So clear DECL_EXTERNAL. */
13869 DECL_EXTERNAL (decl1) = 0;
13871 if ((DECL_DECLARED_INLINE_P (decl1)
13872 || DECL_TEMPLATE_INSTANTIATION (decl1))
13873 && ! DECL_INTERFACE_KNOWN (decl1)
13874 /* Don't try to defer nested functions for now. */
13875 && ! decl_function_context (decl1))
13876 DECL_DEFER_OUTPUT (decl1) = 1;
13878 DECL_INTERFACE_KNOWN (decl1) = 1;
13882 current_binding_level->parm_flag = 1;
13886 if (DECL_DESTRUCTOR_P (decl1))
13888 dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13889 DECL_CONTEXT (dtor_label) = current_function_decl;
13892 start_fname_decls ();
13894 store_parm_decls (current_function_parms);
13899 /* Store the parameter declarations into the current function declaration.
13900 This is called after parsing the parameter declarations, before
13901 digesting the body of the function.
13903 Also install to binding contour return value identifier, if any. */
13906 store_parm_decls (current_function_parms)
13907 tree current_function_parms;
13909 register tree fndecl = current_function_decl;
13910 register tree parm;
13912 /* This is a chain of any other decls that came in among the parm
13913 declarations. If a parm is declared with enum {foo, bar} x;
13914 then CONST_DECLs for foo and bar are put here. */
13915 tree nonparms = NULL_TREE;
13917 if (current_function_parms)
13919 /* This case is when the function was defined with an ANSI prototype.
13920 The parms already have decls, so we need not do anything here
13921 except record them as in effect
13922 and complain if any redundant old-style parm decls were written. */
13924 tree specparms = current_function_parms;
13927 /* Must clear this because it might contain TYPE_DECLs declared
13929 storedecls (NULL_TREE);
13931 /* If we're doing semantic analysis, then we'll call pushdecl
13932 for each of these. We must do them in reverse order so that
13933 they end in the correct forward order. */
13934 specparms = nreverse (specparms);
13936 for (parm = specparms; parm; parm = next)
13938 next = TREE_CHAIN (parm);
13939 if (TREE_CODE (parm) == PARM_DECL)
13941 if (DECL_NAME (parm) == NULL_TREE
13942 || TREE_CODE (parm) != VOID_TYPE)
13945 error ("parameter `%D' declared void", parm);
13949 /* If we find an enum constant or a type tag,
13950 put it aside for the moment. */
13951 TREE_CHAIN (parm) = NULL_TREE;
13952 nonparms = chainon (nonparms, parm);
13956 /* Get the decls in their original chain order and record in the
13957 function. This is all and only the PARM_DECLs that were
13958 pushed into scope by the loop above. */
13959 DECL_ARGUMENTS (fndecl) = getdecls ();
13960 storetags (gettags ());
13963 DECL_ARGUMENTS (fndecl) = NULL_TREE;
13965 /* Now store the final chain of decls for the arguments
13966 as the decl-chain of the current lexical scope.
13967 Put the enumerators in as well, at the front so that
13968 DECL_ARGUMENTS is not modified. */
13969 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
13971 /* Do the starting of the exception specifications, if we have any. */
13972 if (flag_exceptions && !processing_template_decl
13973 && flag_enforce_eh_specs
13974 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13975 current_eh_spec_block = begin_eh_spec_block ();
13979 /* We have finished doing semantic analysis on DECL, but have not yet
13980 generated RTL for its body. Save away our current state, so that
13981 when we want to generate RTL later we know what to do. */
13984 save_function_data (decl)
13987 struct cp_language_function *f;
13989 /* Save the language-specific per-function data so that we can
13990 get it back when we really expand this function. */
13991 my_friendly_assert (!DECL_PENDING_INLINE_P (decl),
13995 f = ((struct cp_language_function *)
13996 xmalloc (sizeof (struct cp_language_function)));
13997 memcpy (f, cp_function_chain, sizeof (struct cp_language_function));
13998 DECL_SAVED_FUNCTION_DATA (decl) = f;
14000 /* Clear out the bits we don't need. */
14001 f->base.x_stmt_tree.x_last_stmt = NULL_TREE;
14002 f->base.x_stmt_tree.x_last_expr_type = NULL_TREE;
14003 f->x_named_label_uses = NULL;
14004 f->bindings = NULL;
14005 f->x_local_names = NULL;
14007 /* When we get back here again, we will be expanding. */
14008 f->x_expanding_p = 1;
14010 /* If we've already decided that we cannot inline this function, we
14011 must remember that fact when we actually go to expand the
14013 if (current_function_cannot_inline)
14015 f->cannot_inline = current_function_cannot_inline;
14016 DECL_INLINE (decl) = 0;
14020 /* Add a note to mark the beginning of the main body of the constructor.
14021 This is used to set up the data structures for the cleanup regions for
14022 fully-constructed bases and members. */
14025 begin_constructor_body ()
14027 tree ctor_stmt = build_stmt (CTOR_STMT);
14028 CTOR_BEGIN_P (ctor_stmt) = 1;
14029 add_stmt (ctor_stmt);
14032 /* Add a note to mark the end of the main body of the constructor. This is
14033 used to end the cleanup regions for fully-constructed bases and
14037 finish_constructor_body ()
14039 /* Mark the end of the cleanups for a partially constructed object.
14041 ??? These should really be handled automatically by closing the block,
14042 as with the destructor cleanups; the only difference is that these are
14043 only run if an exception is thrown. */
14044 add_stmt (build_stmt (CTOR_STMT));
14047 /* Do all the processing for the beginning of a destructor; set up the
14048 vtable pointers and cleanups for bases and members. */
14051 begin_destructor_body ()
14054 tree compound_stmt;
14056 /* If the dtor is empty, and we know there is not any possible
14057 way we could use any vtable entries, before they are possibly
14058 set by a base class dtor, we don't have to setup the vtables,
14059 as we know that any base class dtor will set up any vtables
14060 it needs. We avoid MI, because one base class dtor can do a
14061 virtual dispatch to an overridden function that would need to
14062 have a non-related vtable set up, we cannot avoid setting up
14063 vtables in that case. We could change this to see if there
14064 is just one vtable.
14066 ??? In the destructor for a class, the vtables are set
14067 appropriately for that class. There will be no non-related
14068 vtables. jason 2001-12-11. */
14069 if_stmt = begin_if_stmt ();
14071 /* If it is not safe to avoid setting up the vtables, then
14072 someone will change the condition to be boolean_true_node.
14073 (Actually, for now, we do not have code to set the condition
14074 appropriately, so we just assume that we always need to
14075 initialize the vtables.) */
14076 finish_if_stmt_cond (boolean_true_node, if_stmt);
14077 current_vcalls_possible_p = &IF_COND (if_stmt);
14079 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
14081 /* Make all virtual function table pointers in non-virtual base
14082 classes point to CURRENT_CLASS_TYPE's virtual function
14084 initialize_vtbl_ptrs (current_class_ptr);
14086 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
14087 finish_then_clause (if_stmt);
14091 /* At the end of every destructor we generate code to delete the object if
14092 necessary. Do that now. */
14095 finish_destructor_body ()
14099 /* And perform cleanups for our bases and members. */
14100 perform_base_cleanups ();
14102 /* In a virtual destructor, we must call delete. */
14103 if (DECL_VIRTUAL_P (current_function_decl))
14106 tree virtual_size = c_sizeof (current_class_type);
14110 At the point of definition of a virtual destructor (including
14111 an implicit definition), non-placement operator delete shall
14112 be looked up in the scope of the destructor's class and if
14113 found shall be accessible and unambiguous. */
14114 exprstmt = build_op_delete_call
14115 (DELETE_EXPR, current_class_ptr, virtual_size,
14116 LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
14118 if_stmt = begin_if_stmt ();
14119 finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
14120 current_in_charge_parm,
14123 finish_expr_stmt (exprstmt);
14124 finish_then_clause (if_stmt);
14129 /* Do the necessary processing for the beginning of a function body, which
14130 in this case includes member-initializers, but not the catch clauses of
14131 a function-try-block. Currently, this means opening a binding level
14132 for the member-initializers (in a ctor) and member cleanups (in a dtor).
14133 In other functions, this isn't necessary, but it doesn't hurt. */
14136 begin_function_body ()
14140 if (processing_template_decl)
14141 /* Do nothing now. */;
14143 /* Always keep the BLOCK node associated with the outermost pair of
14144 curly braces of a function. These are needed for correct
14145 operation of dwarfout.c. */
14146 keep_next_level (1);
14148 stmt = begin_compound_stmt (0);
14149 COMPOUND_STMT_BODY_BLOCK (stmt) = 1;
14151 if (processing_template_decl)
14152 /* Do nothing now. */;
14153 else if (DECL_CONSTRUCTOR_P (current_function_decl))
14154 begin_constructor_body ();
14155 else if (DECL_DESTRUCTOR_P (current_function_decl))
14156 begin_destructor_body ();
14161 /* Do the processing for the end of a function body. Currently, this means
14162 closing out the cleanups for fully-constructed bases and members, and in
14163 the case of the destructor, deleting the object if desired. Again, this
14164 is only meaningful for [cd]tors, since they are the only functions where
14165 there is a significant distinction between the main body and any
14166 function catch clauses. Handling, say, main() return semantics here
14167 would be wrong, as flowing off the end of a function catch clause for
14168 main() would also need to return 0. */
14171 finish_function_body (compstmt)
14174 if (processing_template_decl)
14175 /* Do nothing now. */;
14176 else if (DECL_DESTRUCTOR_P (current_function_decl))
14177 /* Any return from a destructor will end up here. Put it before the
14178 cleanups so that an explicit return doesn't duplicate them. */
14179 add_stmt (build_stmt (LABEL_STMT, dtor_label));
14181 /* Close the block; in a destructor, run the member cleanups. */
14182 finish_compound_stmt (0, compstmt);
14184 if (processing_template_decl)
14185 /* Do nothing now. */;
14186 else if (DECL_CONSTRUCTOR_P (current_function_decl))
14187 finish_constructor_body ();
14188 else if (DECL_DESTRUCTOR_P (current_function_decl))
14189 finish_destructor_body ();
14192 /* Finish up a function declaration and compile that function
14193 all the way to assembler language output. The free the storage
14194 for the function definition.
14196 FLAGS is a bitwise or of the following values:
14198 We just finished processing the body of an in-class inline
14199 function definition. (This processing will have taken place
14200 after the class definition is complete.) */
14203 finish_function (flags)
14206 register tree fndecl = current_function_decl;
14207 tree fntype, ctype = NULL_TREE;
14208 int inclass_inline = (flags & 2) != 0;
14211 /* When we get some parse errors, we can end up without a
14212 current_function_decl, so cope. */
14213 if (fndecl == NULL_TREE)
14214 return error_mark_node;
14216 nested = function_depth > 1;
14217 fntype = TREE_TYPE (fndecl);
14219 /* TREE_READONLY (fndecl) = 1;
14220 This caused &foo to be of type ptr-to-const-function
14221 which then got a warning when stored in a ptr-to-function variable. */
14223 my_friendly_assert (building_stmt_tree (), 20000911);
14225 finish_fname_decls ();
14227 /* For a cloned function, we've already got all the code we need;
14228 there's no need to add any extra bits. */
14229 if (!DECL_CLONED_FUNCTION_P (fndecl))
14231 if (DECL_MAIN_P (current_function_decl))
14233 /* Make it so that `main' always returns 0 by default. */
14235 finish_return_stmt (integer_one_node);
14237 finish_return_stmt (integer_zero_node);
14241 /* Finish dealing with exception specifiers. */
14242 if (flag_exceptions && !processing_template_decl
14243 && flag_enforce_eh_specs
14244 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
14245 finish_eh_spec_block (TYPE_RAISES_EXCEPTIONS
14246 (TREE_TYPE (current_function_decl)),
14247 current_eh_spec_block);
14250 /* If we're saving up tree structure, tie off the function now. */
14251 finish_stmt_tree (&DECL_SAVED_TREE (fndecl));
14253 /* This must come after expand_function_end because cleanups might
14254 have declarations (from inline functions) that need to go into
14255 this function's blocks. */
14257 /* If the current binding level isn't the outermost binding level
14258 for this function, either there is a bug, or we have experienced
14259 syntax errors and the statement tree is malformed. */
14260 if (current_binding_level->parm_flag != 1)
14262 /* Make sure we have already experienced errors. */
14263 if (errorcount == 0)
14266 /* Throw away the broken statement tree and extra binding
14268 DECL_SAVED_TREE (fndecl) = build_stmt (COMPOUND_STMT, NULL_TREE);
14270 while (current_binding_level->parm_flag != 1)
14272 if (current_binding_level->parm_flag == 2)
14273 pop_nested_class ();
14275 poplevel (0, 0, 0);
14278 poplevel (1, 0, 1);
14280 /* Set up the named return value optimization, if we can. Here, we
14281 eliminate the copy from the nrv into the RESULT_DECL and any cleanup
14282 for the nrv. genrtl_start_function and declare_return_variable
14283 handle making the nrv and RESULT_DECL share space. */
14284 if (current_function_return_value)
14286 tree r = current_function_return_value;
14287 /* This is only worth doing for fns that return in memory--and
14288 simpler, since we don't have to worry about promoted modes. */
14289 if (r != error_mark_node
14290 && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))))
14292 DECL_ALIGN (r) = DECL_ALIGN (DECL_RESULT (fndecl));
14293 walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl),
14294 nullify_returns_r, r);
14297 /* Clear it so genrtl_start_function and declare_return_variable
14298 know we're not optimizing. */
14299 current_function_return_value = NULL_TREE;
14302 /* Remember that we were in class scope. */
14303 if (current_class_name)
14304 ctype = current_class_type;
14306 /* Must mark the RESULT_DECL as being in this function. */
14307 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
14309 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14310 to the FUNCTION_DECL node itself. */
14311 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
14313 /* Save away current state, if appropriate. */
14314 if (!processing_template_decl)
14315 save_function_data (fndecl);
14317 /* If this function calls `setjmp' it cannot be inlined. When
14318 `longjmp' is called it is not guaranteed to restore the value of
14319 local variables that have been modified since the call to
14320 `setjmp'. So, if were to inline this function into some caller
14321 `c', then when we `longjmp', we might not restore all variables
14322 in `c'. (It might seem, at first blush, that there's no way for
14323 this function to modify local variables in `c', but their
14324 addresses may have been stored somewhere accessible to this
14326 if (!processing_template_decl && calls_setjmp_p (fndecl))
14327 DECL_UNINLINABLE (fndecl) = 1;
14329 /* Complain if there's just no return statement. */
14330 if (warn_return_type
14331 && !processing_template_decl
14332 && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE
14333 && !current_function_returns_value && !current_function_returns_null
14334 /* Don't complain if we abort or throw. */
14335 && !current_function_returns_abnormally
14336 && !DECL_NAME (DECL_RESULT (fndecl))
14337 /* Normally, with -Wreturn-type, flow will complain. Unless we're an
14338 inline function, as we might never be compiled separately. */
14339 && DECL_INLINE (fndecl))
14340 warning ("no return statement in function returning non-void");
14342 /* Clear out memory we no longer need. */
14343 free_after_parsing (cfun);
14344 /* Since we never call rest_of_compilation, we never clear
14345 CFUN. Do so explicitly. */
14346 free_after_compilation (cfun);
14349 /* If this is a in-class inline definition, we may have to pop the
14350 bindings for the template parameters that we added in
14351 maybe_begin_member_template_processing when start_function was
14353 if (inclass_inline)
14354 maybe_end_member_template_processing ();
14356 /* Leave the scope of the class. */
14358 pop_nested_class ();
14364 /* Let the error reporting routines know that we're outside a
14365 function. For a nested function, this value is used in
14366 pop_cp_function_context and then reset via pop_function_context. */
14367 current_function_decl = NULL_TREE;
14372 /* Create the FUNCTION_DECL for a function definition.
14373 DECLSPECS and DECLARATOR are the parts of the declaration;
14374 they describe the return type and the name of the function,
14375 but twisted together in a fashion that parallels the syntax of C.
14377 This function creates a binding context for the function body
14378 as well as setting up the FUNCTION_DECL in current_function_decl.
14380 Returns a FUNCTION_DECL on success.
14382 If the DECLARATOR is not suitable for a function (it defines a datum
14383 instead), we return 0, which tells yyparse to report a parse error.
14385 May return void_type_node indicating that this method is actually
14386 a friend. See grokfield for more details.
14388 Came here with a `.pushlevel' .
14390 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14391 CHANGES TO CODE IN `grokfield'. */
14394 start_method (declspecs, declarator, attrlist)
14395 tree declarator, declspecs, attrlist;
14397 tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
14400 /* Something too ugly to handle. */
14401 if (fndecl == NULL_TREE)
14405 cplus_decl_attributes (&fndecl, attrlist, 0);
14407 /* Pass friends other than inline friend functions back. */
14408 if (fndecl == void_type_node)
14411 if (TREE_CODE (fndecl) != FUNCTION_DECL)
14412 /* Not a function, tell parser to report parse error. */
14415 if (DECL_IN_AGGR_P (fndecl))
14417 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
14419 if (DECL_CONTEXT (fndecl)
14420 && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
14421 error ("`%D' is already defined in class `%T'", fndecl,
14422 DECL_CONTEXT (fndecl));
14424 return void_type_node;
14427 check_template_shadow (fndecl);
14429 DECL_DECLARED_INLINE_P (fndecl) = 1;
14431 if (flag_default_inline)
14432 DECL_INLINE (fndecl) = 1;
14434 /* We process method specializations in finish_struct_1. */
14435 if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
14436 fndecl = push_template_decl (fndecl);
14438 if (! DECL_FRIEND_P (fndecl))
14440 if (TREE_CHAIN (fndecl))
14442 fndecl = copy_node (fndecl);
14443 TREE_CHAIN (fndecl) = NULL_TREE;
14445 grok_special_member_properties (fndecl);
14448 cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0);
14450 /* Make a place for the parms */
14452 current_binding_level->parm_flag = 1;
14454 DECL_IN_AGGR_P (fndecl) = 1;
14458 /* Go through the motions of finishing a function definition.
14459 We don't compile this method until after the whole class has
14462 FINISH_METHOD must return something that looks as though it
14463 came from GROKFIELD (since we are defining a method, after all).
14465 This is called after parsing the body of the function definition.
14466 STMTS is the chain of statements that makes up the function body.
14468 DECL is the ..._DECL that `start_method' provided. */
14471 finish_method (decl)
14474 register tree fndecl = decl;
14477 register tree link;
14479 if (decl == void_type_node)
14482 old_initial = DECL_INITIAL (fndecl);
14484 /* Undo the level for the parms (from start_method).
14485 This is like poplevel, but it causes nothing to be
14486 saved. Saving information here confuses symbol-table
14487 output routines. Besides, this information will
14488 be correctly output when this method is actually
14491 /* Clear out the meanings of the local variables of this level;
14492 also record in each decl which block it belongs to. */
14494 for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
14496 if (DECL_NAME (link) != NULL_TREE)
14497 pop_binding (DECL_NAME (link), link);
14498 my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
14499 DECL_CONTEXT (link) = NULL_TREE;
14502 poplevel (0, 0, 0);
14504 DECL_INITIAL (fndecl) = old_initial;
14506 /* We used to check if the context of FNDECL was different from
14507 current_class_type as another way to get inside here. This didn't work
14508 for String.cc in libg++. */
14509 if (DECL_FRIEND_P (fndecl))
14511 CLASSTYPE_INLINE_FRIENDS (current_class_type)
14512 = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
14513 decl = void_type_node;
14520 /* VAR is a VAR_DECL. If its type is incomplete, remember VAR so that
14521 we can lay it out later, when and if its type becomes complete. */
14524 maybe_register_incomplete_var (var)
14527 my_friendly_assert (TREE_CODE (var) == VAR_DECL, 20020406);
14529 /* Keep track of variables with incomplete types. */
14530 if (!processing_template_decl && TREE_TYPE (var) != error_mark_node
14531 && DECL_EXTERNAL (var))
14533 tree inner_type = TREE_TYPE (var);
14535 while (TREE_CODE (inner_type) == ARRAY_TYPE)
14536 inner_type = TREE_TYPE (inner_type);
14537 inner_type = TYPE_MAIN_VARIANT (inner_type);
14539 if ((!COMPLETE_TYPE_P (inner_type) && CLASS_TYPE_P (inner_type))
14540 /* RTTI TD entries are created while defining the type_info. */
14541 || (TYPE_LANG_SPECIFIC (inner_type)
14542 && TYPE_BEING_DEFINED (inner_type)))
14543 incomplete_vars = tree_cons (inner_type, var, incomplete_vars);
14547 /* Called when a class type (given by TYPE) is defined. If there are
14548 any existing VAR_DECLs whose type hsa been completed by this
14549 declaration, update them now. */
14552 complete_vars (type)
14555 tree *list = &incomplete_vars;
14557 my_friendly_assert (CLASS_TYPE_P (type), 20020406);
14560 if (same_type_p (type, TREE_PURPOSE (*list)))
14562 tree var = TREE_VALUE (*list);
14563 /* Complete the type of the variable. The VAR_DECL itself
14564 will be laid out in expand_expr. */
14565 complete_type (TREE_TYPE (var));
14566 /* Remove this entry from the list. */
14567 *list = TREE_CHAIN (*list);
14570 list = &TREE_CHAIN (*list);
14574 /* If DECL is of a type which needs a cleanup, build that cleanup
14578 maybe_build_cleanup (decl)
14581 tree type = TREE_TYPE (decl);
14583 if (type != error_mark_node && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
14585 int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14588 if (TREE_CODE (type) == ARRAY_TYPE)
14592 mark_addressable (decl);
14593 rval = build_unary_op (ADDR_EXPR, decl, 0);
14596 /* Optimize for space over speed here. */
14597 if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14598 || flag_expensive_optimizations)
14599 flags |= LOOKUP_NONVIRTUAL;
14601 rval = build_delete (TREE_TYPE (rval), rval,
14602 sfk_complete_destructor, flags, 0);
14604 if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14605 && ! TYPE_HAS_DESTRUCTOR (type))
14606 rval = build_compound_expr (tree_cons (NULL_TREE, rval,
14607 build_tree_list (NULL_TREE, build_vbase_delete (type, decl))));
14614 /* When a stmt has been parsed, this function is called. */
14619 /* Always assume this statement was not an expression statement. If
14620 it actually was an expression statement, its our callers
14621 responsibility to fix this up. */
14622 last_expr_type = NULL_TREE;
14625 /* DECL was originally constructed as a non-static member function,
14626 but turned out to be static. Update it accordingly. */
14629 revert_static_member_fn (decl)
14633 tree function = TREE_TYPE (decl);
14634 tree args = TYPE_ARG_TYPES (function);
14636 if (cp_type_quals (TREE_TYPE (TREE_VALUE (args)))
14637 != TYPE_UNQUALIFIED)
14638 error ("static member function `%#D' declared with type qualifiers",
14641 args = TREE_CHAIN (args);
14642 tmp = build_function_type (TREE_TYPE (function), args);
14643 tmp = build_qualified_type (tmp, cp_type_quals (function));
14644 tmp = build_exception_variant (tmp,
14645 TYPE_RAISES_EXCEPTIONS (function));
14646 TREE_TYPE (decl) = tmp;
14647 if (DECL_ARGUMENTS (decl))
14648 DECL_ARGUMENTS (decl) = TREE_CHAIN (DECL_ARGUMENTS (decl));
14649 DECL_STATIC_FUNCTION_P (decl) = 1;
14652 /* Initialize the variables used during compilation of a C++
14656 push_cp_function_context (f)
14657 struct function *f;
14659 struct cp_language_function *p
14660 = ((struct cp_language_function *)
14661 xcalloc (1, sizeof (struct cp_language_function)));
14662 f->language = (struct language_function *) p;
14664 /* It takes an explicit call to expand_body to generate RTL for a
14668 /* Whenever we start a new function, we destroy temporaries in the
14670 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
14673 /* Free the language-specific parts of F, now that we've finished
14674 compiling the function. */
14677 pop_cp_function_context (f)
14678 struct function *f;
14682 struct cp_language_function *cp =
14683 (struct cp_language_function *) f->language;
14684 if (cp->x_local_names)
14685 VARRAY_FREE (cp->x_local_names);
14686 free (f->language);
14691 /* Mark P for GC. */
14694 mark_lang_function (p)
14695 struct cp_language_function *p;
14700 mark_c_language_function (&p->base);
14702 ggc_mark_tree (p->x_dtor_label);
14703 ggc_mark_tree (p->x_current_class_ptr);
14704 ggc_mark_tree (p->x_current_class_ref);
14705 ggc_mark_tree (p->x_eh_spec_block);
14706 ggc_mark_tree_varray (p->x_local_names);
14708 mark_named_label_lists (&p->x_named_labels, &p->x_named_label_uses);
14709 mark_binding_level (&p->bindings);
14710 mark_pending_inlines (&p->unparsed_inlines);
14713 /* Mark the language-specific data in F for GC. */
14716 mark_cp_function_context (f)
14717 struct function *f;
14719 mark_lang_function ((struct cp_language_function *) f->language);
14726 enum tree_code code = TREE_CODE (t);
14727 if (code == IDENTIFIER_NODE)
14729 struct lang_identifier *li = (struct lang_identifier *) t;
14730 struct lang_id2 *li2 = li->x;
14731 ggc_mark_tree (li->namespace_bindings);
14732 ggc_mark_tree (li->bindings);
14733 ggc_mark_tree (li->class_value);
14734 ggc_mark_tree (li->class_template_info);
14738 ggc_mark_tree (li2->label_value);
14739 ggc_mark_tree (li2->implicit_decl);
14740 ggc_mark_tree (li2->error_locus);
14743 else if (code == CPLUS_BINDING)
14745 if (BINDING_HAS_LEVEL_P (t))
14746 mark_binding_level (&BINDING_LEVEL (t));
14748 ggc_mark_tree (BINDING_SCOPE (t));
14749 ggc_mark_tree (BINDING_VALUE (t));
14751 else if (code == OVERLOAD)
14752 ggc_mark_tree (OVL_FUNCTION (t));
14753 else if (code == TEMPLATE_PARM_INDEX)
14754 ggc_mark_tree (TEMPLATE_PARM_DECL (t));
14755 else if (TREE_CODE_CLASS (code) == 'd')
14757 struct lang_decl *ld = DECL_LANG_SPECIFIC (t);
14762 c_mark_lang_decl (&ld->decl_flags.base);
14763 if (!DECL_GLOBAL_CTOR_P (t)
14764 && !DECL_GLOBAL_DTOR_P (t)
14765 && !DECL_THUNK_P (t)
14766 && !DECL_DISCRIMINATOR_P (t))
14767 ggc_mark_tree (ld->decl_flags.u2.access);
14768 else if (DECL_THUNK_P (t))
14769 ggc_mark_tree (ld->decl_flags.u2.vcall_offset);
14770 if (TREE_CODE (t) != NAMESPACE_DECL)
14771 ggc_mark_tree (ld->decl_flags.u.template_info);
14773 mark_binding_level (&NAMESPACE_LEVEL (t));
14774 if (CAN_HAVE_FULL_LANG_DECL_P (t))
14776 ggc_mark_tree (ld->befriending_classes);
14777 ggc_mark_tree (ld->context);
14778 ggc_mark_tree (ld->cloned_function);
14779 if (TREE_CODE (t) == TYPE_DECL)
14780 ggc_mark_tree (ld->u.sorted_fields);
14781 else if (TREE_CODE (t) == FUNCTION_DECL
14782 && !DECL_PENDING_INLINE_P (t))
14783 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t));
14787 else if (TREE_CODE_CLASS (code) == 't')
14789 struct lang_type *lt = TYPE_LANG_SPECIFIC (t);
14791 if (lt && !(TREE_CODE (t) == POINTER_TYPE
14792 && TREE_CODE (TREE_TYPE (t)) == METHOD_TYPE))
14795 ggc_mark_tree (lt->primary_base);
14796 ggc_mark_tree (lt->vfields);
14797 ggc_mark_tree (lt->vbases);
14798 ggc_mark_tree (lt->tags);
14799 ggc_mark_tree (lt->size);
14800 ggc_mark_tree (lt->pure_virtuals);
14801 ggc_mark_tree (lt->friend_classes);
14802 ggc_mark_tree (lt->rtti);
14803 ggc_mark_tree (lt->methods);
14804 ggc_mark_tree (lt->template_info);
14805 ggc_mark_tree (lt->befriending_classes);
14808 /* In the case of pointer-to-member function types, the
14809 TYPE_LANG_SPECIFIC is really just a tree. */
14810 ggc_mark_tree ((tree) lt);
14814 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14815 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14818 identifier_global_value (t)
14821 return IDENTIFIER_GLOBAL_VALUE (t);
14824 /* Build the void_list_node (void_type_node having been created). */
14826 build_void_list_node ()
14828 tree t = build_tree_list (NULL_TREE, void_type_node);
14829 TREE_PARMLIST (t) = 1;
14834 cp_missing_noreturn_ok_p (decl)
14837 /* A missing noreturn is ok for the `main' function. */
14838 return DECL_MAIN_P (decl);