1 /* Process declarations and variables for C++ compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC 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 GCC 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 GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C++ front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
33 #include "coretypes.h"
40 #include "tree-inline.h"
51 #include "diagnostic.h"
55 static tree grokparms (tree);
56 static const char *redeclaration_error_message (tree, tree);
58 static void push_binding_level (struct cp_binding_level *, int,
60 static void pop_binding_level (void);
61 static void suspend_binding_level (void);
62 static void resume_binding_level (struct cp_binding_level *);
63 static struct cp_binding_level *make_binding_level (void);
64 static void declare_namespace_level (void);
65 static int decl_jump_unsafe (tree);
66 static void storedecls (tree);
67 static void require_complete_types_for_parms (tree);
68 static int ambi_op_p (enum tree_code);
69 static int unary_op_p (enum tree_code);
70 static tree store_bindings (tree, tree);
71 static tree lookup_tag_reverse (tree, tree);
72 static void push_local_name (tree);
73 static void warn_extern_redeclared_static (tree, tree);
74 static tree grok_reference_init (tree, tree, tree);
75 static tree grokfndecl (tree, tree, tree, tree, int,
76 enum overload_flags, tree,
77 tree, int, int, int, int, int, int, tree);
78 static tree grokvardecl (tree, tree, RID_BIT_TYPE *, int, int, tree);
79 static tree follow_tag_typedef (tree);
80 static tree lookup_tag (enum tree_code, tree,
81 struct cp_binding_level *, int);
82 static void set_identifier_type_value_with_scope
83 (tree, tree, struct cp_binding_level *);
84 static void record_unknown_type (tree, const char *);
85 static tree builtin_function_1 (const char *, tree, tree, int,
86 enum built_in_class, const char *,
88 static tree build_library_fn_1 (tree, enum tree_code, tree);
89 static int member_function_or_else (tree, tree, enum overload_flags);
90 static void bad_specifiers (tree, const char *, int, int, int, int,
92 static tree maybe_process_template_type_declaration
93 (tree, int, struct cp_binding_level*);
94 static void check_for_uninitialized_const_var (tree);
95 static hashval_t typename_hash (const void *);
96 static int typename_compare (const void *, const void *);
97 static void push_binding (tree, tree, struct cp_binding_level*);
98 static int add_binding (tree, tree);
99 static void pop_binding (tree, tree);
100 static tree local_variable_p_walkfn (tree *, int *, void *);
101 static tree find_binding (tree, tree);
102 static tree select_decl (tree, int);
103 static int lookup_flags (int, int);
104 static tree qualify_lookup (tree, int);
105 static tree record_builtin_java_type (const char *, int);
106 static const char *tag_name (enum tag_types code);
107 static void find_class_binding_level (void);
108 static struct cp_binding_level *innermost_nonclass_level (void);
109 static int walk_namespaces_r (tree, walk_namespaces_fn, void *);
110 static int walk_globals_r (tree, void*);
111 static int walk_vtables_r (tree, void*);
112 static void add_decl_to_level (tree, struct cp_binding_level *);
113 static tree make_label_decl (tree, int);
114 static void use_label (tree);
115 static void check_previous_goto_1 (tree, struct cp_binding_level *, tree,
117 static void check_previous_goto (struct named_label_use_list *);
118 static void check_switch_goto (struct cp_binding_level *);
119 static void check_previous_gotos (tree);
120 static void pop_label (tree, tree);
121 static void pop_labels (tree);
122 static void maybe_deduce_size_from_array_init (tree, tree);
123 static void layout_var_decl (tree);
124 static void maybe_commonize_var (tree);
125 static tree check_initializer (tree, tree, int);
126 static void make_rtl_for_nonlocal_decl (tree, tree, const char *);
127 static void save_function_data (tree);
128 static void check_function_type (tree, tree);
129 static void begin_constructor_body (void);
130 static void finish_constructor_body (void);
131 static void begin_destructor_body (void);
132 static void finish_destructor_body (void);
133 static tree create_array_type_for_decl (tree, tree, tree);
134 static tree get_atexit_node (void);
135 static tree get_dso_handle_node (void);
136 static tree start_cleanup_fn (void);
137 static void end_cleanup_fn (void);
138 static tree cp_make_fname_decl (tree, int);
139 static void initialize_predefined_identifiers (void);
140 static tree check_special_function_return_type
141 (special_function_kind, tree, tree);
142 static tree push_cp_library_fn (enum tree_code, tree);
143 static tree build_cp_library_fn (tree, enum tree_code, tree);
144 static void store_parm_decls (tree);
145 static int cp_missing_noreturn_ok_p (tree);
146 static void initialize_local_var (tree, tree);
147 static void expand_static_init (tree, tree);
148 static tree next_initializable_field (tree);
149 static tree reshape_init (tree, tree *);
150 static tree build_typename_type (tree, tree, tree);
152 #if defined (DEBUG_BINDING_LEVELS)
153 static void indent (void);
156 /* Erroneous argument lists can use this *IFF* they do not modify it. */
157 tree error_mark_list;
159 /* The following symbols are subsumed in the cp_global_trees array, and
160 listed here individually for documentation purposes.
163 tree wchar_decl_node;
165 tree vtable_entry_type;
166 tree delta_type_node;
167 tree __t_desc_type_node;
168 tree ti_desc_type_node;
169 tree bltn_desc_type_node, ptr_desc_type_node;
170 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
171 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
172 tree ptm_desc_type_node;
173 tree base_desc_type_node;
175 tree class_type_node, record_type_node, union_type_node, enum_type_node;
176 tree unknown_type_node;
178 Array type `vtable_entry_type[]'
181 tree vtbl_ptr_type_node;
188 A FUNCTION_DECL which can call `abort'. Not necessarily the
189 one that the user will declare, but sufficient to be called
190 by routines that want to abort the program.
194 The FUNCTION_DECL for the default `::operator delete'.
196 tree global_delete_fndecl;
199 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
204 tree cp_global_trees[CPTI_MAX];
206 /* Indicates that there is a type value in some namespace, although
207 that is not necessarily in scope at the moment. */
209 static GTY(()) tree global_type_node;
211 /* Used only for jumps to as-yet undefined labels, since jumps to
212 defined labels can have their validity checked immediately. */
214 struct named_label_use_list GTY(())
216 struct cp_binding_level *binding_level;
219 const char *filename_o_goto;
221 struct named_label_use_list *next;
224 #define named_label_uses cp_function_chain->x_named_label_uses
226 #define local_names cp_function_chain->x_local_names
228 /* A list of objects which have constructors or destructors
229 which reside in the global scope. The decl is stored in
230 the TREE_VALUE slot and the initializer is stored
231 in the TREE_PURPOSE slot. */
232 tree static_aggregates;
236 /* A node for the integer constants 2, and 3. */
238 tree integer_two_node, integer_three_node;
240 /* Similar, for last_function_parm_tags. */
241 tree last_function_parms;
243 /* A list of all LABEL_DECLs in the function that have names. Here so
244 we can clear out their names' definitions at the end of the
245 function, and so we can check the validity of jumps to these labels. */
247 struct named_label_list GTY(())
249 struct cp_binding_level *binding_level;
254 struct named_label_list *next;
255 unsigned int in_try_scope : 1;
256 unsigned int in_catch_scope : 1;
259 #define named_labels cp_function_chain->x_named_labels
261 /* The name of the anonymous namespace, throughout this translation
263 tree anonymous_namespace_name;
265 /* The number of function bodies which we are currently processing.
266 (Zero if we are at namespace scope, one inside the body of a
267 function, two inside the body of a function in a local class, etc.) */
270 /* States indicating how grokdeclarator() should handle declspecs marked
271 with __attribute__((deprecated)). An object declared as
272 __attribute__((deprecated)) suppresses warnings of uses of other
275 enum deprecated_states {
280 static enum deprecated_states deprecated_state = DEPRECATED_NORMAL;
282 /* Set by add_implicitly_declared_members() to keep those members from
283 being flagged as deprecated or reported as using deprecated
285 int adding_implicit_members = 0;
287 /* True if a declaration with an `extern' linkage specifier is being
289 bool have_extern_spec;
292 /* For each binding contour we allocate a binding_level structure
293 which records the names defined in that contour.
296 1) one for each function definition,
297 where internal declarations of the parameters appear.
298 2) one for each compound statement,
299 to record its declarations.
301 The current meaning of a name can be found by searching the levels
302 from the current one out to the global one.
304 Off to the side, may be the class_binding_level. This exists only
305 to catch class-local declarations. It is otherwise nonexistent.
307 Also there may be binding levels that catch cleanups that must be
308 run when exceptions occur. Thus, to see whether a name is bound in
309 the current scope, it is not enough to look in the
310 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
313 /* Note that the information in the `names' component of the global contour
314 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
316 struct cp_binding_level GTY(())
318 /* A chain of _DECL nodes for all variables, constants, functions,
319 and typedef types. These are in the reverse of the order
320 supplied. There may be OVERLOADs on this list, too, but they
321 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
324 /* Count of elements in names chain. */
327 /* A chain of NAMESPACE_DECL nodes. */
330 /* A chain of VTABLE_DECL nodes. */
333 /* A list of structure, union and enum definitions, for looking up
335 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
336 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
337 or ENUMERAL_TYPE node.
339 C++: the TREE_VALUE nodes can be simple types for
340 component_bindings. */
343 /* A list of USING_DECL nodes. */
346 /* A list of used namespaces. PURPOSE is the namespace,
347 VALUE the common ancestor with this binding_level's namespace. */
348 tree using_directives;
350 /* If this binding level is the binding level for a class, then
351 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
352 is the name of an entity bound in the class. The TREE_TYPE is
353 the DECL bound by this name in the class. */
356 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
357 is used for all binding levels. In addition the TREE_VALUE is the
358 IDENTIFIER_TYPE_VALUE before we entered the class. */
361 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
362 label in this scope. The TREE_PURPOSE is the previous value of
363 the IDENTIFIER_LABEL VALUE. */
364 tree shadowed_labels;
366 /* For each level (except not the global one),
367 a chain of BLOCK nodes for all the levels
368 that were entered and exited one level down. */
371 /* The _TYPE node for this level, if parm_flag == 2. */
374 /* The binding level which this one is contained in (inherits from). */
375 struct cp_binding_level *level_chain;
377 /* List of VAR_DECLS saved from a previous for statement.
378 These would be dead in ISO-conforming code, but might
379 be referenced in ARM-era code. These are stored in a
380 TREE_LIST; the TREE_VALUE is the actual declaration. */
381 tree dead_vars_from_for;
383 /* 1 for the level that holds the parameters of a function.
384 2 for the level that holds a class declaration. */
385 unsigned parm_flag : 2;
387 /* 1 means make a BLOCK for this level regardless of all else.
388 2 for temporary binding contours created by the compiler. */
391 /* Nonzero if this level "doesn't exist" for tags. */
392 unsigned tag_transparent : 1;
394 /* Nonzero if this level can safely have additional
395 cleanup-needing variables added to it. */
396 unsigned more_cleanups_ok : 1;
397 unsigned have_cleanups : 1;
399 /* Nonzero if this scope is for storing the decls for template
400 parameters and generic decls; these decls will be discarded and
401 replaced with a TEMPLATE_DECL. */
402 unsigned template_parms_p : 1;
404 /* Nonzero if this scope corresponds to the `<>' in a
405 `template <>' clause. Whenever this flag is set,
406 TEMPLATE_PARMS_P will be set as well. */
407 unsigned template_spec_p : 1;
409 /* This is set for a namespace binding level. */
410 unsigned namespace_p : 1;
412 /* True if this level is that of a for-statement where we need to
413 worry about ambiguous (ARM or ISO) scope rules. */
414 unsigned is_for_scope : 1;
416 /* True if this level corresponds to a TRY block. Currently this
417 information is only available while building the tree structure. */
418 unsigned is_try_scope : 1;
420 /* True if this level corresponds to a CATCH block. Currently this
421 information is only available while building the tree structure. */
422 unsigned is_catch_scope : 1;
424 /* Three bits left for this word. */
426 /* Binding depth at which this level began. */
427 unsigned binding_depth;
430 #define NULL_BINDING_LEVEL ((struct cp_binding_level *) NULL)
432 /* The binding level currently in effect. */
434 #define current_binding_level \
435 (cfun && cp_function_chain->bindings \
436 ? cp_function_chain->bindings \
437 : scope_chain->bindings)
439 /* The binding level of the current class, if any. */
441 #define class_binding_level scope_chain->class_bindings
443 /* A chain of binding_level structures awaiting reuse. */
445 static GTY((deletable (""))) struct cp_binding_level *free_binding_level;
447 /* The outermost binding level, for names of file scope.
448 This is created when the compiler is started and exists
449 through the entire run. */
451 static GTY(()) struct cp_binding_level *global_binding_level;
453 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
455 static int keep_next_level_flag;
457 /* A TREE_LIST of VAR_DECLs. The TREE_PURPOSE is a RECORD_TYPE or
458 UNION_TYPE; the TREE_VALUE is a VAR_DECL with that type. At the
459 time the VAR_DECL was declared, the type was incomplete. */
461 static GTY(()) tree incomplete_vars;
463 #if defined(DEBUG_BINDING_LEVELS)
464 static int binding_depth = 0;
465 static int is_class_level = 0;
472 for (i = 0; i < binding_depth*2; i++)
475 #endif /* defined(DEBUG_BINDING_LEVELS) */
477 static tree pushdecl_with_scope (tree, struct cp_binding_level *);
480 push_binding_level (struct cp_binding_level *newlevel,
484 /* Add this level to the front of the chain (stack) of levels that
486 memset ((char*) newlevel, 0, sizeof (struct cp_binding_level));
487 newlevel->level_chain = current_binding_level;
488 current_binding_level = newlevel;
489 newlevel->tag_transparent = tag_transparent;
490 newlevel->more_cleanups_ok = 1;
492 newlevel->keep = keep;
493 #if defined(DEBUG_BINDING_LEVELS)
494 newlevel->binding_depth = binding_depth;
496 fprintf (stderr, "push %s level 0x%08x line %d\n",
497 (is_class_level) ? "class" : "block", newlevel, lineno);
500 #endif /* defined(DEBUG_BINDING_LEVELS) */
503 /* Find the innermost enclosing class scope, and reset
504 CLASS_BINDING_LEVEL appropriately. */
507 find_class_binding_level (void)
509 struct cp_binding_level *level = current_binding_level;
511 while (level && level->parm_flag != 2)
512 level = level->level_chain;
513 if (level && level->parm_flag == 2)
514 class_binding_level = level;
516 class_binding_level = 0;
520 pop_binding_level (void)
522 if (global_binding_level)
524 /* Cannot pop a level, if there are none left to pop. */
525 if (current_binding_level == global_binding_level)
528 /* Pop the current level, and free the structure for reuse. */
529 #if defined(DEBUG_BINDING_LEVELS)
532 fprintf (stderr, "pop %s level 0x%08x line %d\n",
533 (is_class_level) ? "class" : "block",
534 current_binding_level, lineno);
535 if (is_class_level != (current_binding_level == class_binding_level))
538 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
541 #endif /* defined(DEBUG_BINDING_LEVELS) */
543 register struct cp_binding_level *level = current_binding_level;
544 current_binding_level = current_binding_level->level_chain;
545 level->level_chain = free_binding_level;
546 #if 0 /* defined(DEBUG_BINDING_LEVELS) */
547 if (level->binding_depth != binding_depth)
549 #endif /* defined(DEBUG_BINDING_LEVELS) */
550 free_binding_level = level;
551 find_class_binding_level ();
556 suspend_binding_level (void)
558 if (class_binding_level)
559 current_binding_level = class_binding_level;
561 if (global_binding_level)
563 /* Cannot suspend a level, if there are none left to suspend. */
564 if (current_binding_level == global_binding_level)
567 /* Suspend the current level. */
568 #if defined(DEBUG_BINDING_LEVELS)
571 fprintf (stderr, "suspend %s level 0x%08x line %d\n",
572 (is_class_level) ? "class" : "block",
573 current_binding_level, lineno);
574 if (is_class_level != (current_binding_level == class_binding_level))
577 fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
580 #endif /* defined(DEBUG_BINDING_LEVELS) */
581 current_binding_level = current_binding_level->level_chain;
582 find_class_binding_level ();
586 resume_binding_level (struct cp_binding_level* b)
588 /* Resuming binding levels is meant only for namespaces,
589 and those cannot nest into classes. */
590 my_friendly_assert(!class_binding_level, 386);
591 /* Also, resuming a non-directly nested namespace is a no-no. */
592 my_friendly_assert(b->level_chain == current_binding_level, 386);
593 current_binding_level = b;
594 #if defined(DEBUG_BINDING_LEVELS)
595 b->binding_depth = binding_depth;
597 fprintf (stderr, "resume %s level 0x%08x line %d\n",
598 (is_class_level) ? "class" : "block", b, lineno);
601 #endif /* defined(DEBUG_BINDING_LEVELS) */
604 /* Create a new `struct cp_binding_level'. */
607 struct cp_binding_level *
608 make_binding_level (void)
611 return (struct cp_binding_level *) ggc_alloc (sizeof (struct cp_binding_level));
614 /* Nonzero if we are currently in the global binding level. */
617 global_bindings_p (void)
619 return current_binding_level == global_binding_level;
622 /* Return the innermost binding level that is not for a class scope. */
624 static struct cp_binding_level *
625 innermost_nonclass_level (void)
627 struct cp_binding_level *b;
629 b = current_binding_level;
630 while (b->parm_flag == 2)
636 /* Nonzero if we are currently in a toplevel binding level. This
637 means either the global binding level or a namespace in a toplevel
638 binding level. Since there are no non-toplevel namespace levels,
639 this really means any namespace or template parameter level. We
640 also include a class whose context is toplevel. */
643 toplevel_bindings_p (void)
645 struct cp_binding_level *b = innermost_nonclass_level ();
647 return b->namespace_p || b->template_parms_p;
650 /* Nonzero if this is a namespace scope, or if we are defining a class
651 which is itself at namespace scope, or whose enclosing class is
652 such a class, etc. */
655 namespace_bindings_p (void)
657 struct cp_binding_level *b = innermost_nonclass_level ();
659 return b->namespace_p;
662 /* If KEEP is nonzero, make a BLOCK node for the next binding level,
663 unconditionally. Otherwise, use the normal logic to decide whether
664 or not to create a BLOCK. */
667 keep_next_level (int keep)
669 keep_next_level_flag = keep;
672 /* Nonzero if the current level needs to have a BLOCK made. */
677 return (current_binding_level->blocks != NULL_TREE
678 || current_binding_level->keep
679 || current_binding_level->names != NULL_TREE
680 || (current_binding_level->tags != NULL_TREE
681 && !current_binding_level->tag_transparent));
685 declare_namespace_level (void)
687 current_binding_level->namespace_p = 1;
690 /* Returns nonzero if this scope was created to store template
694 template_parm_scope_p (void)
696 return current_binding_level->template_parms_p;
699 /* Returns the kind of template specialization we are currently
700 processing, given that it's declaration contained N_CLASS_SCOPES
701 explicit scope qualifications. */
704 current_tmpl_spec_kind (int n_class_scopes)
706 int n_template_parm_scopes = 0;
707 int seen_specialization_p = 0;
708 int innermost_specialization_p = 0;
709 struct cp_binding_level *b;
711 /* Scan through the template parameter scopes. */
712 for (b = current_binding_level; b->template_parms_p; b = b->level_chain)
714 /* If we see a specialization scope inside a parameter scope,
715 then something is wrong. That corresponds to a declaration
718 template <class T> template <> ...
720 which is always invalid since [temp.expl.spec] forbids the
721 specialization of a class member template if the enclosing
722 class templates are not explicitly specialized as well. */
723 if (b->template_spec_p)
725 if (n_template_parm_scopes == 0)
726 innermost_specialization_p = 1;
728 seen_specialization_p = 1;
730 else if (seen_specialization_p == 1)
731 return tsk_invalid_member_spec;
733 ++n_template_parm_scopes;
736 /* Handle explicit instantiations. */
737 if (processing_explicit_instantiation)
739 if (n_template_parm_scopes != 0)
740 /* We've seen a template parameter list during an explicit
741 instantiation. For example:
743 template <class T> template void f(int);
745 This is erroneous. */
746 return tsk_invalid_expl_inst;
748 return tsk_expl_inst;
751 if (n_template_parm_scopes < n_class_scopes)
752 /* We've not seen enough template headers to match all the
753 specialized classes present. For example:
755 template <class T> void R<T>::S<T>::f(int);
757 This is invalid; there needs to be one set of template
758 parameters for each class. */
759 return tsk_insufficient_parms;
760 else if (n_template_parm_scopes == n_class_scopes)
761 /* We're processing a non-template declaration (even though it may
762 be a member of a template class.) For example:
764 template <class T> void S<T>::f(int);
766 The `class T' maches the `S<T>', leaving no template headers
767 corresponding to the `f'. */
769 else if (n_template_parm_scopes > n_class_scopes + 1)
770 /* We've got too many template headers. For example:
772 template <> template <class T> void f (T);
774 There need to be more enclosing classes. */
775 return tsk_excessive_parms;
777 /* This must be a template. It's of the form:
779 template <class T> template <class U> void S<T>::f(U);
781 This is a specialization if the innermost level was a
782 specialization; otherwise it's just a definition of the
784 return innermost_specialization_p ? tsk_expl_spec : tsk_template;
788 set_class_shadows (tree shadows)
790 class_binding_level->class_shadowed = shadows;
793 /* Enter a new binding level.
794 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
795 not for that of tags. */
798 pushlevel (int tag_transparent)
800 struct cp_binding_level *newlevel;
802 if (cfun && !doing_semantic_analysis_p ())
805 /* Reuse or create a struct for this binding level. */
806 #if defined(DEBUG_BINDING_LEVELS)
808 #else /* !defined(DEBUG_BINDING_LEVELS) */
809 if (free_binding_level)
810 #endif /* !defined(DEBUG_BINDING_LEVELS) */
812 newlevel = free_binding_level;
813 free_binding_level = free_binding_level->level_chain;
816 newlevel = make_binding_level ();
818 push_binding_level (newlevel, tag_transparent, keep_next_level_flag);
819 keep_next_level_flag = 0;
822 /* We're defining an object of type TYPE. If it needs a cleanup, but
823 we're not allowed to add any more objects with cleanups to the current
824 scope, create a new binding level. */
827 maybe_push_cleanup_level (tree type)
829 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
830 && current_binding_level->more_cleanups_ok == 0)
835 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
839 /* Enter a new scope. The KIND indicates what kind of scope is being
843 begin_scope (scope_kind sk)
853 current_binding_level->is_try_scope = 1;
857 current_binding_level->is_catch_scope = 1;
861 current_binding_level->is_for_scope = 1;
864 case sk_template_spec:
865 current_binding_level->template_spec_p = 1;
868 case sk_template_parms:
869 current_binding_level->template_parms_p = 1;
877 /* Exit the current scope. */
885 /* For a binding between a name and an entity at a block scope,
886 this is the `struct cp_binding_level' for the block. */
887 #define BINDING_LEVEL(NODE) \
888 (((struct tree_binding*)(NODE))->scope.level)
890 /* A free list of CPLUS_BINDING nodes, connected by their
893 static GTY((deletable (""))) tree free_bindings;
895 /* Make DECL the innermost binding for ID. The LEVEL is the binding
896 level at which this declaration is being bound. */
899 push_binding (tree id,
901 struct cp_binding_level* level)
907 binding = free_bindings;
908 free_bindings = TREE_CHAIN (binding);
911 binding = make_node (CPLUS_BINDING);
913 /* Now, fill in the binding information. */
914 BINDING_VALUE (binding) = decl;
915 BINDING_TYPE (binding) = NULL_TREE;
916 BINDING_LEVEL (binding) = level;
917 INHERITED_VALUE_BINDING_P (binding) = 0;
918 LOCAL_BINDING_P (binding) = (level != class_binding_level);
919 BINDING_HAS_LEVEL_P (binding) = 1;
921 /* And put it on the front of the list of bindings for ID. */
922 TREE_CHAIN (binding) = IDENTIFIER_BINDING (id);
923 IDENTIFIER_BINDING (id) = binding;
926 /* ID is already bound in the current scope. But, DECL is an
927 additional binding for ID in the same scope. This is the `struct
928 stat' hack whereby a non-typedef class-name or enum-name can be
929 bound at the same level as some other kind of entity. It's the
930 responsibility of the caller to check that inserting this name is
931 valid here. Returns nonzero if the new binding was successful. */
933 add_binding (tree id, tree decl)
935 tree binding = IDENTIFIER_BINDING (id);
938 timevar_push (TV_NAME_LOOKUP);
939 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
940 /* The new name is the type name. */
941 BINDING_TYPE (binding) = decl;
942 else if (!BINDING_VALUE (binding))
943 /* This situation arises when push_class_level_binding moves an
944 inherited type-binding out of the way to make room for a new
946 BINDING_VALUE (binding) = decl;
947 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
948 && DECL_ARTIFICIAL (BINDING_VALUE (binding)))
950 /* The old binding was a type name. It was placed in
951 BINDING_VALUE because it was thought, at the point it was
952 declared, to be the only entity with such a name. Move the
953 type name into the type slot; it is now hidden by the new
955 BINDING_TYPE (binding) = BINDING_VALUE (binding);
956 BINDING_VALUE (binding) = decl;
957 INHERITED_VALUE_BINDING_P (binding) = 0;
959 else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
960 && TREE_CODE (decl) == TYPE_DECL
961 && DECL_NAME (decl) == DECL_NAME (BINDING_VALUE (binding))
962 && (same_type_p (TREE_TYPE (decl),
963 TREE_TYPE (BINDING_VALUE (binding)))
964 /* If either type involves template parameters, we must
965 wait until instantiation. */
966 || uses_template_parms (TREE_TYPE (decl))
967 || uses_template_parms (TREE_TYPE (BINDING_VALUE (binding)))))
968 /* We have two typedef-names, both naming the same type to have
969 the same name. This is OK because of:
973 In a given scope, a typedef specifier can be used to redefine
974 the name of any type declared in that scope to refer to the
975 type to which it already refers. */
977 /* There can be two block-scope declarations of the same variable,
978 so long as they are `extern' declarations. */
979 else if (TREE_CODE (decl) == VAR_DECL
980 && TREE_CODE (BINDING_VALUE (binding)) == VAR_DECL
981 && DECL_EXTERNAL (decl)
982 && DECL_EXTERNAL (BINDING_VALUE (binding)))
984 duplicate_decls (decl, BINDING_VALUE (binding));
989 error ("declaration of `%#D'", decl);
990 cp_error_at ("conflicts with previous declaration `%#D'",
991 BINDING_VALUE (binding));
995 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ok);
998 /* Add DECL to the list of things declared in B. */
1001 add_decl_to_level (tree decl,
1002 struct cp_binding_level* b)
1004 if (TREE_CODE (decl) == NAMESPACE_DECL
1005 && !DECL_NAMESPACE_ALIAS (decl))
1007 TREE_CHAIN (decl) = b->namespaces;
1008 b->namespaces = decl;
1010 else if (TREE_CODE (decl) == VAR_DECL && DECL_VIRTUAL_P (decl))
1012 TREE_CHAIN (decl) = b->vtables;
1017 /* We build up the list in reverse order, and reverse it later if
1019 TREE_CHAIN (decl) = b->names;
1025 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1026 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1027 doesn't really belong to this binding level, that it got here
1028 through a using-declaration. */
1031 push_local_binding (tree id, tree decl, int flags)
1033 struct cp_binding_level *b;
1035 /* Skip over any local classes. This makes sense if we call
1036 push_local_binding with a friend decl of a local class. */
1037 b = current_binding_level;
1038 while (b->parm_flag == 2)
1041 if (lookup_name_current_level (id))
1043 /* Supplement the existing binding. */
1044 if (!add_binding (id, decl))
1045 /* It didn't work. Something else must be bound at this
1046 level. Do not add DECL to the list of things to pop
1051 /* Create a new binding. */
1052 push_binding (id, decl, b);
1054 if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
1055 /* We must put the OVERLOAD into a TREE_LIST since the
1056 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1057 decls that got here through a using-declaration. */
1058 decl = build_tree_list (NULL_TREE, decl);
1060 /* And put DECL on the list of things declared by the current
1062 add_decl_to_level (decl, b);
1065 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1066 binding was successful. */
1069 push_class_binding (tree id, tree decl)
1072 tree binding = IDENTIFIER_BINDING (id);
1075 timevar_push (TV_NAME_LOOKUP);
1076 /* Note that we declared this value so that we can issue an error if
1077 this is an invalid redeclaration of a name already used for some
1079 note_name_declared_in_class (id, decl);
1081 if (binding && BINDING_LEVEL (binding) == class_binding_level)
1082 /* Supplement the existing binding. */
1083 result = add_binding (id, decl);
1085 /* Create a new binding. */
1086 push_binding (id, decl, class_binding_level);
1088 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1089 class-level declaration. Note that we do not use DECL here
1090 because of the possibility of the `struct stat' hack; if DECL is
1091 a class-name or enum-name we might prefer a field-name, or some
1093 IDENTIFIER_CLASS_VALUE (id) = BINDING_VALUE (IDENTIFIER_BINDING (id));
1095 /* If this is a binding from a base class, mark it as such. */
1096 binding = IDENTIFIER_BINDING (id);
1097 if (BINDING_VALUE (binding) == decl && TREE_CODE (decl) != TREE_LIST)
1099 if (TREE_CODE (decl) == OVERLOAD)
1100 context = CP_DECL_CONTEXT (OVL_CURRENT (decl));
1103 my_friendly_assert (DECL_P (decl), 0);
1104 context = context_for_name_lookup (decl);
1107 if (is_properly_derived_from (current_class_type, context))
1108 INHERITED_VALUE_BINDING_P (binding) = 1;
1110 INHERITED_VALUE_BINDING_P (binding) = 0;
1112 else if (BINDING_VALUE (binding) == decl)
1113 /* We only encounter a TREE_LIST when push_class_decls detects an
1114 ambiguity. Such an ambiguity can be overridden by a definition
1116 INHERITED_VALUE_BINDING_P (binding) = 1;
1118 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, result);
1121 /* Remove the binding for DECL which should be the innermost binding
1125 pop_binding (tree id, tree decl)
1129 if (id == NULL_TREE)
1130 /* It's easiest to write the loops that call this function without
1131 checking whether or not the entities involved have names. We
1132 get here for such an entity. */
1135 /* Get the innermost binding for ID. */
1136 binding = IDENTIFIER_BINDING (id);
1138 /* The name should be bound. */
1139 my_friendly_assert (binding != NULL_TREE, 0);
1141 /* The DECL will be either the ordinary binding or the type
1142 binding for this identifier. Remove that binding. */
1143 if (BINDING_VALUE (binding) == decl)
1144 BINDING_VALUE (binding) = NULL_TREE;
1145 else if (BINDING_TYPE (binding) == decl)
1146 BINDING_TYPE (binding) = NULL_TREE;
1150 if (!BINDING_VALUE (binding) && !BINDING_TYPE (binding))
1152 /* We're completely done with the innermost binding for this
1153 identifier. Unhook it from the list of bindings. */
1154 IDENTIFIER_BINDING (id) = TREE_CHAIN (binding);
1156 /* Add it to the free list. */
1157 TREE_CHAIN (binding) = free_bindings;
1158 free_bindings = binding;
1160 /* Clear the BINDING_LEVEL so the garbage collector doesn't walk
1162 BINDING_LEVEL (binding) = NULL;
1166 /* When a label goes out of scope, check to see if that label was used
1167 in a valid manner, and issue any appropriate warnings or errors. */
1170 pop_label (tree label, tree old_value)
1172 if (!processing_template_decl && doing_semantic_analysis_p ())
1174 if (DECL_INITIAL (label) == NULL_TREE)
1176 cp_error_at ("label `%D' used but not defined", label);
1177 /* Avoid crashing later. */
1178 define_label (input_filename, 1, DECL_NAME (label));
1180 else if (warn_unused_label && !TREE_USED (label))
1181 cp_warning_at ("label `%D' defined but not used", label);
1184 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), old_value);
1187 /* At the end of a function, all labels declared within the function
1188 go out of scope. BLOCK is the top-level block for the
1192 pop_labels (tree block)
1194 struct named_label_list *link;
1196 /* Clear out the definitions of all label names, since their scopes
1198 for (link = named_labels; link; link = link->next)
1200 pop_label (link->label_decl, link->old_value);
1201 /* Put the labels into the "variables" of the top-level block,
1202 so debugger can see them. */
1203 TREE_CHAIN (link->label_decl) = BLOCK_VARS (block);
1204 BLOCK_VARS (block) = link->label_decl;
1207 named_labels = NULL;
1210 /* Exit a binding level.
1211 Pop the level off, and restore the state of the identifier-decl mappings
1212 that were in effect when this level was entered.
1214 If KEEP == 1, this level had explicit declarations, so
1215 and create a "block" (a BLOCK node) for the level
1216 to record its declarations and subblocks for symbol table output.
1218 If FUNCTIONBODY is nonzero, this level is the body of a function,
1219 so create a block as if KEEP were set and also clear out all
1222 If REVERSE is nonzero, reverse the order of decls before putting
1223 them into the BLOCK. */
1226 poplevel (int keep, int reverse, int functionbody)
1229 /* The chain of decls was accumulated in reverse order.
1230 Put it into forward order, just for cleanliness. */
1232 int tmp = functionbody;
1233 int real_functionbody;
1236 tree block = NULL_TREE;
1238 int leaving_for_scope;
1240 timevar_push (TV_NAME_LOOKUP);
1241 if (cfun && !doing_semantic_analysis_p ())
1242 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
1244 my_friendly_assert (current_binding_level->parm_flag != 2,
1247 real_functionbody = (current_binding_level->keep == 2
1248 ? ((functionbody = 0), tmp) : functionbody);
1249 tags = functionbody >= 0 ? current_binding_level->tags : 0;
1250 subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;
1252 my_friendly_assert (!current_binding_level->class_shadowed,
1255 /* We used to use KEEP == 2 to indicate that the new block should go
1256 at the beginning of the list of blocks at this binding level,
1257 rather than the end. This hack is no longer used. */
1258 my_friendly_assert (keep == 0 || keep == 1, 0);
1260 if (current_binding_level->keep == 1)
1263 /* Any uses of undefined labels, and any defined labels, now operate
1264 under constraints of next binding contour. */
1265 if (cfun && !functionbody)
1267 struct cp_binding_level *level_chain;
1268 level_chain = current_binding_level->level_chain;
1271 struct named_label_use_list *uses;
1272 struct named_label_list *labels;
1273 for (labels = named_labels; labels; labels = labels->next)
1274 if (labels->binding_level == current_binding_level)
1277 if (current_binding_level->is_try_scope)
1278 labels->in_try_scope = 1;
1279 if (current_binding_level->is_catch_scope)
1280 labels->in_catch_scope = 1;
1281 for (decl = labels->names_in_scope; decl;
1282 decl = TREE_CHAIN (decl))
1283 if (decl_jump_unsafe (decl))
1284 labels->bad_decls = tree_cons (NULL_TREE, decl,
1286 labels->binding_level = level_chain;
1287 labels->names_in_scope = level_chain->names;
1290 for (uses = named_label_uses; uses; uses = uses->next)
1291 if (uses->binding_level == current_binding_level)
1293 uses->binding_level = level_chain;
1294 uses->names_in_scope = level_chain->names;
1299 /* Get the decls in the order they were written.
1300 Usually current_binding_level->names is in reverse order.
1301 But parameter decls were previously put in forward order. */
1304 current_binding_level->names
1305 = decls = nreverse (current_binding_level->names);
1307 decls = current_binding_level->names;
1309 /* Output any nested inline functions within this block
1310 if they weren't already output. */
1311 for (decl = decls; decl; decl = TREE_CHAIN (decl))
1312 if (TREE_CODE (decl) == FUNCTION_DECL
1313 && ! TREE_ASM_WRITTEN (decl)
1314 && DECL_INITIAL (decl) != NULL_TREE
1315 && TREE_ADDRESSABLE (decl)
1316 && decl_function_context (decl) == current_function_decl)
1318 /* If this decl was copied from a file-scope decl
1319 on account of a block-scope extern decl,
1320 propagate TREE_ADDRESSABLE to the file-scope decl. */
1321 if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE)
1322 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
1325 push_function_context ();
1326 output_inline_function (decl);
1327 pop_function_context ();
1331 /* When not in function-at-a-time mode, expand_end_bindings will
1332 warn about unused variables. But, in function-at-a-time mode
1333 expand_end_bindings is not passed the list of variables in the
1334 current scope, and therefore no warning is emitted. So, we
1335 explicitly warn here. */
1336 if (!processing_template_decl)
1337 warn_about_unused_variables (getdecls ());
1339 /* If there were any declarations or structure tags in that level,
1340 or if this level is a function body,
1341 create a BLOCK to record them for the life of this function. */
1343 if (keep == 1 || functionbody)
1344 block = make_node (BLOCK);
1345 if (block != NULL_TREE)
1347 BLOCK_VARS (block) = decls;
1348 BLOCK_SUBBLOCKS (block) = subblocks;
1351 /* In each subblock, record that this is its superior. */
1353 for (link = subblocks; link; link = TREE_CHAIN (link))
1354 BLOCK_SUPERCONTEXT (link) = block;
1356 /* We still support the old for-scope rules, whereby the variables
1357 in a for-init statement were in scope after the for-statement
1358 ended. We only use the new rules if flag_new_for_scope is
1361 = current_binding_level->is_for_scope && flag_new_for_scope == 1;
1363 /* Remove declarations for all the DECLs in this level. */
1364 for (link = decls; link; link = TREE_CHAIN (link))
1366 if (leaving_for_scope && TREE_CODE (link) == VAR_DECL
1367 && DECL_NAME (link))
1370 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link)));
1374 ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link));
1376 ns_binding = NULL_TREE;
1379 && (BINDING_LEVEL (outer_binding)
1380 == current_binding_level->level_chain))
1381 /* We have something like:
1386 and we are leaving the `for' scope. There's no reason to
1387 keep the binding of the inner `i' in this case. */
1388 pop_binding (DECL_NAME (link), link);
1389 else if ((outer_binding
1390 && (TREE_CODE (BINDING_VALUE (outer_binding))
1393 && TREE_CODE (ns_binding) == TYPE_DECL))
1394 /* Here, we have something like:
1402 We must pop the for-scope binding so we know what's a
1403 type and what isn't. */
1404 pop_binding (DECL_NAME (link), link);
1407 /* Mark this VAR_DECL as dead so that we can tell we left it
1408 there only for backward compatibility. */
1409 DECL_DEAD_FOR_LOCAL (link) = 1;
1411 /* Keep track of what should of have happenned when we
1412 popped the binding. */
1413 if (outer_binding && BINDING_VALUE (outer_binding))
1414 DECL_SHADOWED_FOR_VAR (link)
1415 = BINDING_VALUE (outer_binding);
1417 /* Add it to the list of dead variables in the next
1418 outermost binding to that we can remove these when we
1419 leave that binding. */
1420 current_binding_level->level_chain->dead_vars_from_for
1421 = tree_cons (NULL_TREE, link,
1422 current_binding_level->level_chain->
1423 dead_vars_from_for);
1425 /* Although we don't pop the CPLUS_BINDING, we do clear
1426 its BINDING_LEVEL since the level is going away now. */
1427 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link)))
1433 /* Remove the binding. */
1435 if (TREE_CODE (decl) == TREE_LIST)
1436 decl = TREE_VALUE (decl);
1438 pop_binding (DECL_NAME (decl), decl);
1439 else if (TREE_CODE (decl) == OVERLOAD)
1440 pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl);
1446 /* Remove declarations for any `for' variables from inner scopes
1447 that we kept around. */
1448 for (link = current_binding_level->dead_vars_from_for;
1449 link; link = TREE_CHAIN (link))
1450 pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));
1452 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1453 for (link = current_binding_level->type_shadowed;
1454 link; link = TREE_CHAIN (link))
1455 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));
1457 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1458 for (link = current_binding_level->shadowed_labels;
1460 link = TREE_CHAIN (link))
1461 pop_label (TREE_VALUE (link), TREE_PURPOSE (link));
1463 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1464 list if a `using' declaration put them there. The debugging
1465 back-ends won't understand OVERLOAD, so we remove them here.
1466 Because the BLOCK_VARS are (temporarily) shared with
1467 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1468 popped all the bindings. */
1473 for (d = &BLOCK_VARS (block); *d; )
1475 if (TREE_CODE (*d) == TREE_LIST)
1476 *d = TREE_CHAIN (*d);
1478 d = &TREE_CHAIN (*d);
1482 /* If the level being exited is the top level of a function,
1483 check over all the labels. */
1486 /* Since this is the top level block of a function, the vars are
1487 the function's parameters. Don't leave them in the BLOCK
1488 because they are found in the FUNCTION_DECL instead. */
1489 BLOCK_VARS (block) = 0;
1493 tmp = current_binding_level->keep;
1495 pop_binding_level ();
1497 DECL_INITIAL (current_function_decl) = block;
1499 current_binding_level->blocks
1500 = chainon (current_binding_level->blocks, block);
1502 /* If we did not make a block for the level just exited,
1503 any blocks made for inner levels
1504 (since they cannot be recorded as subblocks in that level)
1505 must be carried forward so they will later become subblocks
1506 of something else. */
1508 current_binding_level->blocks
1509 = chainon (current_binding_level->blocks, subblocks);
1511 /* Each and every BLOCK node created here in `poplevel' is important
1512 (e.g. for proper debugging information) so if we created one
1513 earlier, mark it as "used". */
1515 TREE_USED (block) = 1;
1517 /* Take care of compiler's internal binding structures. */
1523 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1526 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts)) = block;
1527 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts)) = block;
1530 block = poplevel (keep, reverse, functionbody);
1533 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, block);
1536 /* Delete the node BLOCK from the current binding level.
1537 This is used for the block inside a stmt expr ({...})
1538 so that the block can be reinserted where appropriate. */
1541 delete_block (tree block)
1544 if (current_binding_level->blocks == block)
1545 current_binding_level->blocks = TREE_CHAIN (block);
1546 for (t = current_binding_level->blocks; t;)
1548 if (TREE_CHAIN (t) == block)
1549 TREE_CHAIN (t) = TREE_CHAIN (block);
1553 TREE_CHAIN (block) = NULL_TREE;
1554 /* Clear TREE_USED which is always set by poplevel.
1555 The flag is set again if insert_block is called. */
1556 TREE_USED (block) = 0;
1559 /* Insert BLOCK at the end of the list of subblocks of the
1560 current binding level. This is used when a BIND_EXPR is expanded,
1561 to handle the BLOCK node inside the BIND_EXPR. */
1564 insert_block (tree block)
1566 TREE_USED (block) = 1;
1567 current_binding_level->blocks
1568 = chainon (current_binding_level->blocks, block);
1571 /* Set the BLOCK node for the innermost scope
1572 (the one we are currently in). */
1575 set_block (tree block ATTRIBUTE_UNUSED )
1577 /* The RTL expansion machinery requires us to provide this callback,
1578 but it is not applicable in function-at-a-time mode. */
1579 my_friendly_assert (cfun && !doing_semantic_analysis_p (), 20000911);
1582 /* Do a pushlevel for class declarations. */
1585 pushlevel_class (void)
1587 register struct cp_binding_level *newlevel;
1589 /* Reuse or create a struct for this binding level. */
1590 #if defined(DEBUG_BINDING_LEVELS)
1592 #else /* !defined(DEBUG_BINDING_LEVELS) */
1593 if (free_binding_level)
1594 #endif /* !defined(DEBUG_BINDING_LEVELS) */
1596 newlevel = free_binding_level;
1597 free_binding_level = free_binding_level->level_chain;
1600 newlevel = make_binding_level ();
1602 #if defined(DEBUG_BINDING_LEVELS)
1604 #endif /* defined(DEBUG_BINDING_LEVELS) */
1606 push_binding_level (newlevel, 0, 0);
1608 class_binding_level = current_binding_level;
1609 class_binding_level->parm_flag = 2;
1610 class_binding_level->this_class = current_class_type;
1613 /* ...and a poplevel for class declarations. */
1616 poplevel_class (void)
1618 register struct cp_binding_level *level = class_binding_level;
1621 timevar_push (TV_NAME_LOOKUP);
1622 my_friendly_assert (level != 0, 354);
1624 /* If we're leaving a toplevel class, don't bother to do the setting
1625 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1626 shouldn't even be used when current_class_type isn't set, and second,
1627 if we don't touch it here, we're able to use the cache effect if the
1628 next time we're entering a class scope, it is the same class. */
1629 if (current_class_depth != 1)
1631 struct cp_binding_level* b;
1633 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1634 for (shadowed = level->class_shadowed;
1636 shadowed = TREE_CHAIN (shadowed))
1637 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = NULL_TREE;
1639 /* Find the next enclosing class, and recreate
1640 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1641 b = level->level_chain;
1642 while (b && b->parm_flag != 2)
1646 for (shadowed = b->class_shadowed;
1648 shadowed = TREE_CHAIN (shadowed))
1652 t = IDENTIFIER_BINDING (TREE_PURPOSE (shadowed));
1653 while (t && BINDING_LEVEL (t) != b)
1657 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed))
1658 = BINDING_VALUE (t);
1662 /* Remember to save what IDENTIFIER's were bound in this scope so we
1663 can recover from cache misses. */
1665 previous_class_type = current_class_type;
1666 previous_class_values = class_binding_level->class_shadowed;
1668 for (shadowed = level->type_shadowed;
1670 shadowed = TREE_CHAIN (shadowed))
1671 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
1673 /* Remove the bindings for all of the class-level declarations. */
1674 for (shadowed = level->class_shadowed;
1676 shadowed = TREE_CHAIN (shadowed))
1677 pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed));
1679 /* Now, pop out of the binding level which we created up in the
1680 `pushlevel_class' routine. */
1681 #if defined(DEBUG_BINDING_LEVELS)
1683 #endif /* defined(DEBUG_BINDING_LEVELS) */
1685 pop_binding_level ();
1686 timevar_pop (TV_NAME_LOOKUP);
1689 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1690 for any names in enclosing classes. */
1693 clear_identifier_class_values (void)
1697 if (!class_binding_level)
1700 for (t = class_binding_level->class_shadowed;
1703 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
1706 /* Returns nonzero if T is a virtual function table. */
1709 vtable_decl_p (tree t, void* data ATTRIBUTE_UNUSED )
1711 return (TREE_CODE (t) == VAR_DECL && DECL_VIRTUAL_P (t));
1714 /* Returns nonzero if T is a TYPE_DECL for a type with virtual
1718 vtype_decl_p (tree t, void *data ATTRIBUTE_UNUSED )
1720 return (TREE_CODE (t) == TYPE_DECL
1721 && TREE_CODE (TREE_TYPE (t)) == RECORD_TYPE
1722 && TYPE_POLYMORPHIC_P (TREE_TYPE (t)));
1725 /* Return the declarations that are members of the namespace NS. */
1728 cp_namespace_decls (tree ns)
1730 return NAMESPACE_LEVEL (ns)->names;
1733 struct walk_globals_data {
1734 walk_globals_pred p;
1739 /* Walk the vtable declarations in NAMESPACE. Whenever one is found
1740 for which P returns nonzero, call F with its address. If any call
1741 to F returns a nonzero value, return a nonzero value. */
1744 walk_vtables_r (tree namespace, void* data)
1746 struct walk_globals_data* wgd = (struct walk_globals_data *) data;
1747 walk_globals_fn f = wgd->f;
1748 void *d = wgd->data;
1749 tree decl = NAMESPACE_LEVEL (namespace)->vtables;
1752 for (; decl ; decl = TREE_CHAIN (decl))
1753 result |= (*f) (&decl, d);
1758 /* Walk the vtable declarations. Whenever one is found for which P
1759 returns nonzero, call F with its address. If any call to F
1760 returns a nonzero value, return a nonzero value. */
1762 walk_vtables (walk_globals_pred p, walk_globals_fn f, void *data)
1764 struct walk_globals_data wgd;
1769 return walk_namespaces (walk_vtables_r, &wgd);
1772 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1773 itself, calling F for each. The DATA is passed to F as well. */
1776 walk_namespaces_r (tree namespace, walk_namespaces_fn f, void* data)
1779 tree current = NAMESPACE_LEVEL (namespace)->namespaces;
1781 result |= (*f) (namespace, data);
1783 for (; current; current = TREE_CHAIN (current))
1784 result |= walk_namespaces_r (current, f, data);
1789 /* Walk all the namespaces, calling F for each. The DATA is passed to
1793 walk_namespaces (walk_namespaces_fn f, void* data)
1795 return walk_namespaces_r (global_namespace, f, data);
1798 /* Walk the global declarations in NAMESPACE. Whenever one is found
1799 for which P returns nonzero, call F with its address. If any call
1800 to F returns a nonzero value, return a nonzero value. */
1803 walk_globals_r (tree namespace, void* data)
1805 struct walk_globals_data* wgd = (struct walk_globals_data *) data;
1806 walk_globals_pred p = wgd->p;
1807 walk_globals_fn f = wgd->f;
1808 void *d = wgd->data;
1812 t = &NAMESPACE_LEVEL (namespace)->names;
1819 result |= (*f) (t, d);
1821 /* If F changed *T, then *T still points at the next item to
1824 t = &TREE_CHAIN (*t);
1830 /* Walk the global declarations. Whenever one is found for which P
1831 returns true, call F with its address. If any call to F
1832 returns true, return true. */
1835 walk_globals (walk_globals_pred p, walk_globals_fn f, void *data)
1837 struct walk_globals_data wgd;
1842 return walk_namespaces (walk_globals_r, &wgd);
1845 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1846 DATA is non-NULL, this is the last time we will call
1847 wrapup_global_declarations for this NAMESPACE. */
1850 wrapup_globals_for_namespace (tree namespace, void* data)
1852 tree globals = cp_namespace_decls (namespace);
1853 int len = NAMESPACE_LEVEL (namespace)->names_size;
1854 tree *vec = (tree *) alloca (sizeof (tree) * len);
1858 int last_time = (data != 0);
1860 /* Process the decls in reverse order--earliest first.
1861 Put them into VEC from back to front, then take out from front. */
1862 for (i = 0, decl = globals; i < len; i++, decl = TREE_CHAIN (decl))
1863 vec[len - i - 1] = decl;
1867 check_global_declarations (vec, len);
1871 /* Write out any globals that need to be output. */
1872 result = wrapup_global_declarations (vec, len);
1878 /* For debugging. */
1879 static int no_print_functions = 0;
1880 static int no_print_builtins = 0;
1883 print_binding_level (struct cp_binding_level* lvl)
1887 fprintf (stderr, " blocks=");
1888 fprintf (stderr, HOST_PTR_PRINTF, lvl->blocks);
1889 if (lvl->tag_transparent)
1890 fprintf (stderr, " tag-transparent");
1891 if (lvl->more_cleanups_ok)
1892 fprintf (stderr, " more-cleanups-ok");
1893 if (lvl->have_cleanups)
1894 fprintf (stderr, " have-cleanups");
1895 fprintf (stderr, "\n");
1898 fprintf (stderr, " names:\t");
1899 /* We can probably fit 3 names to a line? */
1900 for (t = lvl->names; t; t = TREE_CHAIN (t))
1902 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
1904 if (no_print_builtins
1905 && (TREE_CODE (t) == TYPE_DECL)
1906 && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>")))
1909 /* Function decls tend to have longer names. */
1910 if (TREE_CODE (t) == FUNCTION_DECL)
1917 fprintf (stderr, "\n\t");
1920 print_node_brief (stderr, "", t, 0);
1921 if (t == error_mark_node)
1925 fprintf (stderr, "\n");
1929 fprintf (stderr, " tags:\t");
1931 for (t = lvl->tags; t; t = TREE_CHAIN (t))
1933 if (TREE_PURPOSE (t) == NULL_TREE)
1935 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1942 fprintf (stderr, "\n\t");
1945 if (TREE_PURPOSE (t) == NULL_TREE)
1947 print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0);
1948 fprintf (stderr, ">");
1950 else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
1951 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1954 print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0);
1955 print_node_brief (stderr, "", TREE_VALUE (t), 0);
1956 fprintf (stderr, ">");
1960 fprintf (stderr, "\n");
1962 if (lvl->class_shadowed)
1964 fprintf (stderr, " class-shadowed:");
1965 for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t))
1967 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1969 fprintf (stderr, "\n");
1971 if (lvl->type_shadowed)
1973 fprintf (stderr, " type-shadowed:");
1974 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
1976 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1978 fprintf (stderr, "\n");
1983 print_other_binding_stack (struct cp_binding_level *stack)
1985 struct cp_binding_level *level;
1986 for (level = stack; level != global_binding_level; level = level->level_chain)
1988 fprintf (stderr, "binding level ");
1989 fprintf (stderr, HOST_PTR_PRINTF, level);
1990 fprintf (stderr, "\n");
1991 print_binding_level (level);
1996 print_binding_stack (void)
1998 struct cp_binding_level *b;
1999 fprintf (stderr, "current_binding_level=");
2000 fprintf (stderr, HOST_PTR_PRINTF, current_binding_level);
2001 fprintf (stderr, "\nclass_binding_level=");
2002 fprintf (stderr, HOST_PTR_PRINTF, class_binding_level);
2003 fprintf (stderr, "\nglobal_binding_level=");
2004 fprintf (stderr, HOST_PTR_PRINTF, global_binding_level);
2005 fprintf (stderr, "\n");
2006 if (class_binding_level)
2008 for (b = class_binding_level; b; b = b->level_chain)
2009 if (b == current_binding_level)
2012 b = class_binding_level;
2014 b = current_binding_level;
2017 b = current_binding_level;
2018 print_other_binding_stack (b);
2019 fprintf (stderr, "global:\n");
2020 print_binding_level (global_binding_level);
2023 /* Namespace binding access routines: The namespace_bindings field of
2024 the identifier is polymorphic, with three possible values:
2025 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2026 indicating the BINDING_VALUE of global_namespace. */
2028 /* Check whether the a binding for the name to scope is known.
2029 Assumes that the bindings of the name are already a list
2030 of bindings. Returns the binding found, or NULL_TREE. */
2033 find_binding (tree name, tree scope)
2035 tree iter, prev = NULL_TREE;
2037 timevar_push (TV_NAME_LOOKUP);
2038 scope = ORIGINAL_NAMESPACE (scope);
2040 for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter;
2041 iter = TREE_CHAIN (iter))
2043 my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374);
2044 if (BINDING_SCOPE (iter) == scope)
2046 /* Move binding found to the front of the list, so
2047 subsequent lookups will find it faster. */
2050 TREE_CHAIN (prev) = TREE_CHAIN (iter);
2051 TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name);
2052 IDENTIFIER_NAMESPACE_BINDINGS (name) = iter;
2054 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, iter);
2058 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
2061 /* Always returns a binding for name in scope. If the
2062 namespace_bindings is not a list, convert it to one first.
2063 If no binding is found, make a new one. */
2066 binding_for_name (tree name, tree scope)
2068 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2071 scope = ORIGINAL_NAMESPACE (scope);
2073 if (b && TREE_CODE (b) != CPLUS_BINDING)
2075 /* Get rid of optimization for global scope. */
2076 IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE;
2077 BINDING_VALUE (binding_for_name (name, global_namespace)) = b;
2078 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2080 if (b && (result = find_binding (name, scope)))
2082 /* Not found, make a new one. */
2083 result = make_node (CPLUS_BINDING);
2084 TREE_CHAIN (result) = b;
2085 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
2086 BINDING_SCOPE (result) = scope;
2087 BINDING_TYPE (result) = NULL_TREE;
2088 BINDING_VALUE (result) = NULL_TREE;
2092 /* Return the binding value for name in scope, considering that
2093 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2096 namespace_binding (tree name, tree scope)
2098 tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2101 if (scope == NULL_TREE)
2102 scope = global_namespace;
2103 if (TREE_CODE (b) != CPLUS_BINDING)
2104 return (scope == global_namespace) ? b : NULL_TREE;
2105 name = find_binding (name,scope);
2106 if (name == NULL_TREE)
2108 return BINDING_VALUE (name);
2111 /* Set the binding value for name in scope. If modifying the binding
2112 of global_namespace is attempted, try to optimize it. */
2115 set_namespace_binding (tree name, tree scope, tree val)
2119 timevar_push (TV_NAME_LOOKUP);
2120 if (scope == NULL_TREE)
2121 scope = global_namespace;
2123 if (scope == global_namespace)
2125 b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2126 if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING)
2128 IDENTIFIER_NAMESPACE_BINDINGS (name) = val;
2129 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, (void)0);
2132 b = binding_for_name (name, scope);
2133 BINDING_VALUE (b) = val;
2134 timevar_pop (TV_NAME_LOOKUP);
2137 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2138 select a name that is unique to this compilation unit. */
2141 push_namespace (tree name)
2145 int implicit_use = 0;
2148 timevar_push (TV_NAME_LOOKUP);
2150 if (!global_namespace)
2152 /* This must be ::. */
2153 my_friendly_assert (name == get_identifier ("::"), 377);
2158 /* The name of anonymous namespace is unique for the translation
2160 if (!anonymous_namespace_name)
2161 anonymous_namespace_name = get_file_function_name ('N');
2162 name = anonymous_namespace_name;
2163 d = IDENTIFIER_NAMESPACE_VALUE (name);
2165 /* Reopening anonymous namespace. */
2171 /* Check whether this is an extended namespace definition. */
2172 d = IDENTIFIER_NAMESPACE_VALUE (name);
2173 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2176 if (DECL_NAMESPACE_ALIAS (d))
2178 error ("namespace alias `%D' not allowed here, assuming `%D'",
2179 d, DECL_NAMESPACE_ALIAS (d));
2180 d = DECL_NAMESPACE_ALIAS (d);
2187 /* Make a new namespace, binding the name to it. */
2188 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2189 /* The global namespace is not pushed, and the global binding
2190 level is set elsewhere. */
2193 DECL_CONTEXT (d) = FROB_CONTEXT (current_namespace);
2196 declare_namespace_level ();
2197 NAMESPACE_LEVEL (d) = current_binding_level;
2201 resume_binding_level (NAMESPACE_LEVEL (d));
2204 do_using_directive (d);
2205 /* Enter the name space. */
2206 current_namespace = d;
2208 timevar_pop (TV_NAME_LOOKUP);
2211 /* Pop from the scope of the current namespace. */
2214 pop_namespace (void)
2216 my_friendly_assert (current_namespace != global_namespace, 20010801);
2217 current_namespace = CP_DECL_CONTEXT (current_namespace);
2218 /* The binding level is not popped, as it might be re-opened later. */
2219 suspend_binding_level ();
2222 /* Push into the scope of the namespace NS, even if it is deeply
2223 nested within another namespace. */
2226 push_nested_namespace (tree ns)
2228 if (ns == global_namespace)
2229 push_to_top_level ();
2232 push_nested_namespace (CP_DECL_CONTEXT (ns));
2233 push_namespace (DECL_NAME (ns));
2237 /* Pop back from the scope of the namespace NS, which was previously
2238 entered with push_nested_namespace. */
2241 pop_nested_namespace (tree ns)
2243 timevar_push (TV_NAME_LOOKUP);
2244 while (ns != global_namespace)
2247 ns = CP_DECL_CONTEXT (ns);
2250 pop_from_top_level ();
2251 timevar_pop (TV_NAME_LOOKUP);
2255 /* Subroutines for reverting temporarily to top-level for instantiation
2256 of templates and such. We actually need to clear out the class- and
2257 local-value slots of all identifiers, so that only the global values
2258 are at all visible. Simply setting current_binding_level to the global
2259 scope isn't enough, because more binding levels may be pushed. */
2260 struct saved_scope *scope_chain;
2263 store_bindings (tree names, tree old_bindings)
2266 tree search_bindings = old_bindings;
2268 timevar_push (TV_NAME_LOOKUP);
2269 for (t = names; t; t = TREE_CHAIN (t))
2271 tree binding, t1, id;
2273 if (TREE_CODE (t) == TREE_LIST)
2274 id = TREE_PURPOSE (t);
2279 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2280 we have no IDENTIFIER_BINDING if we have left the class
2281 scope, but cached the class-level declarations. */
2282 || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2285 for (t1 = search_bindings; t1; t1 = TREE_CHAIN (t1))
2286 if (TREE_VEC_ELT (t1, 0) == id)
2289 my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2290 binding = make_tree_vec (4);
2291 TREE_VEC_ELT (binding, 0) = id;
2292 TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2293 TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2294 TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2295 IDENTIFIER_BINDING (id) = NULL_TREE;
2296 IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2297 TREE_CHAIN (binding) = old_bindings;
2298 old_bindings = binding;
2302 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, old_bindings);
2306 maybe_push_to_top_level (int pseudo)
2308 struct saved_scope *s;
2309 struct cp_binding_level *b;
2313 timevar_push (TV_NAME_LOOKUP);
2314 s = (struct saved_scope *) ggc_alloc_cleared (sizeof (struct saved_scope));
2316 b = scope_chain ? current_binding_level : 0;
2318 /* If we're in the middle of some function, save our state. */
2322 push_function_context_to (NULL_TREE);
2327 old_bindings = NULL_TREE;
2328 if (scope_chain && previous_class_type)
2329 old_bindings = store_bindings (previous_class_values, old_bindings);
2331 /* Have to include global_binding_level, because class-level decls
2332 aren't listed anywhere useful. */
2333 for (; b; b = b->level_chain)
2337 /* Template IDs are inserted into the global level. If they were
2338 inserted into namespace level, finish_file wouldn't find them
2339 when doing pending instantiations. Therefore, don't stop at
2340 namespace level, but continue until :: . */
2341 if (b == global_binding_level || (pseudo && b->template_parms_p))
2344 old_bindings = store_bindings (b->names, old_bindings);
2345 /* We also need to check class_shadowed to save class-level type
2346 bindings, since pushclass doesn't fill in b->names. */
2347 if (b->parm_flag == 2)
2348 old_bindings = store_bindings (b->class_shadowed, old_bindings);
2350 /* Unwind type-value slots back to top level. */
2351 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2352 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2354 s->prev = scope_chain;
2355 s->old_bindings = old_bindings;
2357 s->need_pop_function_context = need_pop;
2358 s->function_decl = current_function_decl;
2359 s->last_parms = last_function_parms;
2360 s->check_access = flag_access_control;
2363 current_function_decl = NULL_TREE;
2364 VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base");
2365 current_lang_name = lang_name_cplusplus;
2366 current_namespace = global_namespace;
2367 timevar_pop (TV_NAME_LOOKUP);
2371 push_to_top_level (void)
2373 maybe_push_to_top_level (0);
2377 pop_from_top_level (void)
2379 struct saved_scope *s = scope_chain;
2382 timevar_push (TV_NAME_LOOKUP);
2383 /* Clear out class-level bindings cache. */
2384 if (previous_class_type)
2385 invalidate_class_lookup_cache ();
2387 current_lang_base = 0;
2389 scope_chain = s->prev;
2390 for (t = s->old_bindings; t; t = TREE_CHAIN (t))
2392 tree id = TREE_VEC_ELT (t, 0);
2394 SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2395 IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2396 IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2399 /* If we were in the middle of compiling a function, restore our
2401 if (s->need_pop_function_context)
2402 pop_function_context_from (NULL_TREE);
2403 current_function_decl = s->function_decl;
2404 last_function_parms = s->last_parms;
2405 timevar_pop (TV_NAME_LOOKUP);
2408 /* Push a definition of struct, union or enum tag "name".
2409 into binding_level "b". "type" should be the type node,
2410 We assume that the tag "name" is not already defined.
2412 Note that the definition may really be just a forward reference.
2413 In that case, the TYPE_SIZE will be a NULL_TREE.
2415 C++ gratuitously puts all these tags in the name space. */
2417 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2418 record the shadowed value for this binding contour. TYPE is
2419 the type that ID maps to. */
2422 set_identifier_type_value_with_scope (tree id,
2424 struct cp_binding_level* b)
2426 if (!b->namespace_p)
2428 /* Shadow the marker, not the real thing, so that the marker
2429 gets restored later. */
2430 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2432 = tree_cons (id, old_type_value, b->type_shadowed);
2436 tree binding = binding_for_name (id, current_namespace);
2437 BINDING_TYPE (binding) = type;
2438 /* Store marker instead of real type. */
2439 type = global_type_node;
2441 SET_IDENTIFIER_TYPE_VALUE (id, type);
2444 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2447 set_identifier_type_value (tree id, tree type)
2449 set_identifier_type_value_with_scope (id, type, current_binding_level);
2452 /* Return the type associated with id. */
2455 identifier_type_value (tree id)
2457 timevar_push (TV_NAME_LOOKUP);
2458 /* There is no type with that name, anywhere. */
2459 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2460 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
2461 /* This is not the type marker, but the real thing. */
2462 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2463 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, REAL_IDENTIFIER_TYPE_VALUE (id));
2464 /* Have to search for it. It must be on the global level, now.
2465 Ask lookup_name not to return non-types. */
2466 id = lookup_name_real (id, 2, 1, 0, LOOKUP_COMPLAIN);
2468 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_TYPE (id));
2469 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
2472 /* Pop off extraneous binding levels left over due to syntax errors.
2474 We don't pop past namespaces, as they might be valid. */
2477 pop_everything (void)
2479 #ifdef DEBUG_BINDING_LEVELS
2480 fprintf (stderr, "XXX entering pop_everything ()\n");
2482 while (!toplevel_bindings_p ())
2484 if (current_binding_level->parm_flag == 2)
2485 pop_nested_class ();
2489 #ifdef DEBUG_BINDING_LEVELS
2490 fprintf (stderr, "XXX leaving pop_everything ()\n");
2494 /* The type TYPE is being declared. If it is a class template, or a
2495 specialization of a class template, do any processing required and
2496 perform error-checking. If IS_FRIEND is nonzero, this TYPE is
2497 being declared a friend. B is the binding level at which this TYPE
2500 Returns the TYPE_DECL for TYPE, which may have been altered by this
2504 maybe_process_template_type_declaration (tree type,
2506 struct cp_binding_level* b)
2508 tree decl = TYPE_NAME (type);
2510 if (processing_template_parmlist)
2511 /* You can't declare a new template type in a template parameter
2512 list. But, you can declare a non-template type:
2514 template <class A*> struct S;
2516 is a forward-declaration of `A'. */
2520 maybe_check_template_type (type);
2522 my_friendly_assert (IS_AGGR_TYPE (type)
2523 || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2526 if (processing_template_decl)
2528 /* This may change after the call to
2529 push_template_decl_real, but we want the original value. */
2530 tree name = DECL_NAME (decl);
2532 decl = push_template_decl_real (decl, globalize);
2533 /* If the current binding level is the binding level for the
2534 template parameters (see the comment in
2535 begin_template_parm_list) and the enclosing level is a class
2536 scope, and we're not looking at a friend, push the
2537 declaration of the member class into the class scope. In the
2538 friend case, push_template_decl will already have put the
2539 friend into global scope, if appropriate. */
2540 if (TREE_CODE (type) != ENUMERAL_TYPE
2541 && !globalize && b->template_parms_p
2542 && b->level_chain->parm_flag == 2)
2544 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2545 /* Put this tag on the list of tags for the class, since
2546 that won't happen below because B is not the class
2547 binding level, but is instead the pseudo-global level. */
2548 b->level_chain->tags =
2549 tree_cons (name, type, b->level_chain->tags);
2550 if (!COMPLETE_TYPE_P (current_class_type))
2552 maybe_add_class_template_decl_list (current_class_type,
2553 type, /*friend_p=*/0);
2554 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2563 /* In C++, you don't have to write `struct S' to refer to `S'; you
2564 can just use `S'. We accomplish this by creating a TYPE_DECL as
2565 if the user had written `typedef struct S S'. Create and return
2566 the TYPE_DECL for TYPE. */
2569 create_implicit_typedef (tree name, tree type)
2573 decl = build_decl (TYPE_DECL, name, type);
2574 DECL_ARTIFICIAL (decl) = 1;
2575 /* There are other implicit type declarations, like the one *within*
2576 a class that allows you to write `S::S'. We must distinguish
2578 SET_DECL_IMPLICIT_TYPEDEF_P (decl);
2579 TYPE_NAME (type) = decl;
2584 /* Remember a local name for name-mangling purposes. */
2587 push_local_name (tree decl)
2592 timevar_push (TV_NAME_LOOKUP);
2594 VARRAY_TREE_INIT (local_names, 8, "local_names");
2596 name = DECL_NAME (decl);
2598 nelts = VARRAY_ACTIVE_SIZE (local_names);
2599 for (i = 0; i < nelts; i++)
2601 t = VARRAY_TREE (local_names, i);
2602 if (DECL_NAME (t) == name)
2604 if (!DECL_LANG_SPECIFIC (decl))
2605 retrofit_lang_decl (decl);
2606 DECL_LANG_SPECIFIC (decl)->decl_flags.u2sel = 1;
2607 if (DECL_LANG_SPECIFIC (t))
2608 DECL_DISCRIMINATOR (decl) = DECL_DISCRIMINATOR (t) + 1;
2610 DECL_DISCRIMINATOR (decl) = 1;
2612 VARRAY_TREE (local_names, i) = decl;
2613 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, (void)0);
2617 VARRAY_PUSH_TREE (local_names, decl);
2618 timevar_pop (TV_NAME_LOOKUP);
2621 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2622 Normally put it into the inner-most non-tag-transparent scope,
2623 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2624 The latter is needed for implicit declarations. */
2627 pushtag (tree name, tree type, int globalize)
2629 register struct cp_binding_level *b;
2631 timevar_push (TV_NAME_LOOKUP);
2632 b = current_binding_level;
2633 while (b->tag_transparent
2634 || (b->parm_flag == 2
2636 /* We may be defining a new type in the initializer
2637 of a static member variable. We allow this when
2638 not pedantic, and it is particularly useful for
2639 type punning via an anonymous union. */
2640 || COMPLETE_TYPE_P (b->this_class))))
2643 b->tags = tree_cons (name, type, b->tags);
2647 /* Do C++ gratuitous typedefing. */
2648 if (IDENTIFIER_TYPE_VALUE (name) != type)
2650 register tree d = NULL_TREE;
2652 tree context = TYPE_CONTEXT (type);
2656 tree cs = current_scope ();
2660 else if (cs != NULL_TREE && TYPE_P (cs))
2661 /* When declaring a friend class of a local class, we want
2662 to inject the newly named class into the scope
2663 containing the local class, not the namespace scope. */
2664 context = decl_function_context (get_type_decl (cs));
2667 context = current_namespace;
2669 if ((b->template_parms_p && b->level_chain->parm_flag == 2)
2670 || b->parm_flag == 2)
2673 if (current_lang_name == lang_name_java)
2674 TYPE_FOR_JAVA (type) = 1;
2676 d = create_implicit_typedef (name, type);
2677 DECL_CONTEXT (d) = FROB_CONTEXT (context);
2679 set_identifier_type_value_with_scope (name, type, b);
2681 d = maybe_process_template_type_declaration (type,
2684 if (b->parm_flag == 2)
2686 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2687 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2688 class. But if it's a member template class, we
2689 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2691 finish_member_declaration (d);
2693 pushdecl_class_level (d);
2696 d = pushdecl_with_scope (d, b);
2698 /* FIXME what if it gets a name from typedef? */
2699 if (ANON_AGGRNAME_P (name))
2700 DECL_IGNORED_P (d) = 1;
2702 TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2704 /* If this is a local class, keep track of it. We need this
2705 information for name-mangling, and so that it is possible to find
2706 all function definitions in a translation unit in a convenient
2707 way. (It's otherwise tricky to find a member function definition
2708 it's only pointed to from within a local class.) */
2709 if (TYPE_CONTEXT (type)
2710 && TREE_CODE (TYPE_CONTEXT (type)) == FUNCTION_DECL
2711 && !processing_template_decl)
2712 VARRAY_PUSH_TREE (local_classes, type);
2714 if (b->parm_flag == 2)
2716 if (!COMPLETE_TYPE_P (current_class_type))
2718 maybe_add_class_template_decl_list (current_class_type,
2719 type, /*friend_p=*/0);
2720 CLASSTYPE_TAGS (current_class_type) = b->tags;
2725 if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2726 /* Use the canonical TYPE_DECL for this node. */
2727 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2730 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2731 will be the tagged type we just added to the current
2732 binding level. This fake NULL-named TYPE_DECL node helps
2733 dwarfout.c to know when it needs to output a
2734 representation of a tagged type, and it also gives us a
2735 convenient place to record the "scope start" address for
2738 tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2739 TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2741 timevar_pop (TV_NAME_LOOKUP);
2744 /* Counter used to create anonymous type names. */
2746 static GTY(()) int anon_cnt;
2748 /* Return an IDENTIFIER which can be used as a name for
2749 anonymous structs and unions. */
2752 make_anon_name (void)
2756 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2757 return get_identifier (buf);
2760 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2761 This keeps dbxout from getting confused. */
2764 clear_anon_tags (void)
2766 register struct cp_binding_level *b;
2768 static int last_cnt = 0;
2770 /* Fast out if no new anon names were declared. */
2771 if (last_cnt == anon_cnt)
2774 b = current_binding_level;
2775 while (b->tag_transparent)
2780 /* A NULL purpose means we have already processed all tags
2781 from here to the end of the list. */
2782 if (TREE_PURPOSE (tags) == NULL_TREE)
2784 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2785 TREE_PURPOSE (tags) = NULL_TREE;
2786 tags = TREE_CHAIN (tags);
2788 last_cnt = anon_cnt;
2791 /* Subroutine of duplicate_decls: return truthvalue of whether
2792 or not types of these decls match.
2794 For C++, we must compare the parameter list so that `int' can match
2795 `int&' in a parameter position, but `int&' is not confused with
2799 decls_match (tree newdecl, tree olddecl)
2803 if (newdecl == olddecl)
2806 if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
2807 /* If the two DECLs are not even the same kind of thing, we're not
2808 interested in their types. */
2811 if (TREE_CODE (newdecl) == FUNCTION_DECL)
2813 tree f1 = TREE_TYPE (newdecl);
2814 tree f2 = TREE_TYPE (olddecl);
2815 tree p1 = TYPE_ARG_TYPES (f1);
2816 tree p2 = TYPE_ARG_TYPES (f2);
2818 if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)
2819 && ! (DECL_EXTERN_C_P (newdecl)
2820 && DECL_EXTERN_C_P (olddecl)))
2823 if (TREE_CODE (f1) != TREE_CODE (f2))
2826 if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
2828 if (p2 == NULL_TREE && DECL_EXTERN_C_P (olddecl)
2829 && (DECL_BUILT_IN (olddecl)
2830 #ifndef NO_IMPLICIT_EXTERN_C
2831 || (DECL_IN_SYSTEM_HEADER (newdecl) && !DECL_CLASS_SCOPE_P (newdecl))
2832 || (DECL_IN_SYSTEM_HEADER (olddecl) && !DECL_CLASS_SCOPE_P (olddecl))
2836 types_match = self_promoting_args_p (p1);
2837 if (p1 == void_list_node)
2838 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2840 #ifndef NO_IMPLICIT_EXTERN_C
2841 else if (p1 == NULL_TREE
2842 && (DECL_EXTERN_C_P (olddecl)
2843 && DECL_IN_SYSTEM_HEADER (olddecl)
2844 && !DECL_CLASS_SCOPE_P (olddecl))
2845 && (DECL_EXTERN_C_P (newdecl)
2846 && DECL_IN_SYSTEM_HEADER (newdecl)
2847 && !DECL_CLASS_SCOPE_P (newdecl)))
2849 types_match = self_promoting_args_p (p2);
2850 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2854 types_match = compparms (p1, p2);
2859 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
2861 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
2862 DECL_TEMPLATE_PARMS (olddecl)))
2865 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl))
2866 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)))
2869 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
2872 types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
2873 DECL_TEMPLATE_RESULT (newdecl));
2877 if (TREE_TYPE (newdecl) == error_mark_node)
2878 types_match = TREE_TYPE (olddecl) == error_mark_node;
2879 else if (TREE_TYPE (olddecl) == NULL_TREE)
2880 types_match = TREE_TYPE (newdecl) == NULL_TREE;
2881 else if (TREE_TYPE (newdecl) == NULL_TREE)
2884 types_match = comptypes (TREE_TYPE (newdecl),
2885 TREE_TYPE (olddecl),
2886 COMPARE_REDECLARATION);
2892 /* If NEWDECL is `static' and an `extern' was seen previously,
2893 warn about it. OLDDECL is the previous declaration.
2895 Note that this does not apply to the C++ case of declaring
2896 a variable `extern const' and then later `const'.
2898 Don't complain about built-in functions, since they are beyond
2899 the user's control. */
2902 warn_extern_redeclared_static (tree newdecl, tree olddecl)
2904 static const char *const explicit_extern_static_warning
2905 = "`%D' was declared `extern' and later `static'";
2906 static const char *const implicit_extern_static_warning
2907 = "`%D' was declared implicitly `extern' and later `static'";
2911 if (TREE_CODE (newdecl) == TYPE_DECL
2912 || TREE_CODE (newdecl) == TEMPLATE_DECL
2913 || TREE_CODE (newdecl) == CONST_DECL)
2916 /* Don't get confused by static member functions; that's a different
2918 if (TREE_CODE (newdecl) == FUNCTION_DECL
2919 && DECL_STATIC_FUNCTION_P (newdecl))
2922 /* If the old declaration was `static', or the new one isn't, then
2923 then everything is OK. */
2924 if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl))
2927 /* It's OK to declare a builtin function as `static'. */
2928 if (TREE_CODE (olddecl) == FUNCTION_DECL
2929 && DECL_ARTIFICIAL (olddecl))
2932 name = DECL_ASSEMBLER_NAME (newdecl);
2933 pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
2934 ? implicit_extern_static_warning
2935 : explicit_extern_static_warning, newdecl);
2936 cp_pedwarn_at ("previous declaration of `%D'", olddecl);
2939 /* Handle when a new declaration NEWDECL has the same name as an old
2940 one OLDDECL in the same binding contour. Prints an error message
2943 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2944 Otherwise, return 0. */
2947 duplicate_decls (tree newdecl, tree olddecl)
2949 unsigned olddecl_uid = DECL_UID (olddecl);
2950 int olddecl_friend = 0, types_match = 0;
2951 int new_defines_function = 0;
2953 if (newdecl == olddecl)
2956 types_match = decls_match (newdecl, olddecl);
2958 /* If either the type of the new decl or the type of the old decl is an
2959 error_mark_node, then that implies that we have already issued an
2960 error (earlier) for some bogus type specification, and in that case,
2961 it is rather pointless to harass the user with yet more error message
2962 about the same declaration, so just pretend the types match here. */
2963 if (TREE_TYPE (newdecl) == error_mark_node
2964 || TREE_TYPE (olddecl) == error_mark_node)
2967 if (DECL_P (olddecl)
2968 && TREE_CODE (newdecl) == FUNCTION_DECL
2969 && TREE_CODE (olddecl) == FUNCTION_DECL
2970 && (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl)))
2972 if (DECL_DECLARED_INLINE_P (newdecl)
2973 && DECL_UNINLINABLE (newdecl)
2974 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl)))
2975 /* Already warned elsewhere. */;
2976 else if (DECL_DECLARED_INLINE_P (olddecl)
2977 && DECL_UNINLINABLE (olddecl)
2978 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
2979 /* Already warned. */;
2980 else if (DECL_DECLARED_INLINE_P (newdecl)
2981 && DECL_UNINLINABLE (olddecl)
2982 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
2984 warning ("%Hfunction '%D' redeclared as inline",
2985 &DECL_SOURCE_LOCATION (newdecl), newdecl);
2986 warning ("%Hprevious declaration of '%D' with attribute noinline",
2987 &DECL_SOURCE_LOCATION (olddecl), olddecl);
2989 else if (DECL_DECLARED_INLINE_P (olddecl)
2990 && DECL_UNINLINABLE (newdecl)
2991 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl)))
2993 warning ("%Hfunction '%D' redeclared with attribute noinline",
2994 &DECL_SOURCE_LOCATION (newdecl), newdecl);
2995 warning ("%Hprevious declaration of '%D' was inline",
2996 &DECL_SOURCE_LOCATION (olddecl), olddecl);
3000 /* Check for redeclaration and other discrepancies. */
3001 if (TREE_CODE (olddecl) == FUNCTION_DECL
3002 && DECL_ARTIFICIAL (olddecl))
3004 if (TREE_CODE (newdecl) != FUNCTION_DECL)
3006 /* Avoid warnings redeclaring anticipated built-ins. */
3007 if (DECL_ANTICIPATED (olddecl))
3010 /* If you declare a built-in or predefined function name as static,
3011 the old definition is overridden, but optionally warn this was a
3012 bad choice of name. */
3013 if (! TREE_PUBLIC (newdecl))
3016 warning ("shadowing %s function `%#D'",
3017 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3019 /* Discard the old built-in function. */
3022 /* If the built-in is not ansi, then programs can override
3023 it even globally without an error. */
3024 else if (! DECL_BUILT_IN (olddecl))
3025 warning ("library function `%#D' redeclared as non-function `%#D'",
3029 error ("declaration of `%#D'", newdecl);
3030 error ("conflicts with built-in declaration `%#D'",
3035 else if (!types_match)
3037 /* Avoid warnings redeclaring anticipated built-ins. */
3038 if (DECL_ANTICIPATED (olddecl))
3039 ; /* Do nothing yet. */
3040 else if ((DECL_EXTERN_C_P (newdecl)
3041 && DECL_EXTERN_C_P (olddecl))
3042 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3043 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3045 /* A near match; override the builtin. */
3047 if (TREE_PUBLIC (newdecl))
3049 warning ("new declaration `%#D'", newdecl);
3050 warning ("ambiguates built-in declaration `%#D'",
3053 else if (warn_shadow)
3054 warning ("shadowing %s function `%#D'",
3055 DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3059 /* Discard the old built-in function. */
3062 /* Replace the old RTL to avoid problems with inlining. */
3063 SET_DECL_RTL (olddecl, DECL_RTL (newdecl));
3066 if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl))
3068 /* If a builtin function is redeclared as `static', merge
3069 the declarations, but make the original one static. */
3070 DECL_THIS_STATIC (olddecl) = 1;
3071 TREE_PUBLIC (olddecl) = 0;
3073 /* Make the old declaration consistent with the new one so
3074 that all remnants of the builtin-ness of this function
3075 will be banished. */
3076 SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl));
3077 SET_DECL_RTL (olddecl, DECL_RTL (newdecl));
3080 else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
3082 if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
3083 && TREE_CODE (newdecl) != TYPE_DECL
3084 && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
3085 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
3086 || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
3087 && TREE_CODE (olddecl) != TYPE_DECL
3088 && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
3089 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
3092 /* We do nothing special here, because C++ does such nasty
3093 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3094 get shadowed, and know that if we need to find a TYPE_DECL
3095 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3096 slot of the identifier. */
3100 if ((TREE_CODE (newdecl) == FUNCTION_DECL
3101 && DECL_FUNCTION_TEMPLATE_P (olddecl))
3102 || (TREE_CODE (olddecl) == FUNCTION_DECL
3103 && DECL_FUNCTION_TEMPLATE_P (newdecl)))
3106 error ("`%#D' redeclared as different kind of symbol", newdecl);
3107 if (TREE_CODE (olddecl) == TREE_LIST)
3108 olddecl = TREE_VALUE (olddecl);
3109 cp_error_at ("previous declaration of `%#D'", olddecl);
3111 /* New decl is completely inconsistent with the old one =>
3112 tell caller to replace the old one. */
3116 else if (!types_match)
3118 if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl))
3119 /* These are certainly not duplicate declarations; they're
3120 from different scopes. */
3123 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3125 /* The name of a class template may not be declared to refer to
3126 any other template, class, function, object, namespace, value,
3127 or type in the same scope. */
3128 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
3129 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3131 error ("declaration of template `%#D'", newdecl);
3132 cp_error_at ("conflicts with previous declaration `%#D'",
3135 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
3136 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
3137 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
3138 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
3139 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3140 DECL_TEMPLATE_PARMS (olddecl))
3141 /* Template functions can be disambiguated by
3143 && same_type_p (TREE_TYPE (TREE_TYPE (newdecl)),
3144 TREE_TYPE (TREE_TYPE (olddecl))))
3146 error ("new declaration `%#D'", newdecl);
3147 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3151 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3153 if (DECL_EXTERN_C_P (newdecl) && DECL_EXTERN_C_P (olddecl))
3155 error ("declaration of C function `%#D' conflicts with",
3157 cp_error_at ("previous declaration `%#D' here", olddecl);
3159 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3160 TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3162 error ("new declaration `%#D'", newdecl);
3163 cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3169 /* Already complained about this, so don't do so again. */
3170 else if (current_class_type == NULL_TREE
3171 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
3173 error ("conflicting types for `%#D'", newdecl);
3174 cp_error_at ("previous declaration as `%#D'", olddecl);
3177 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3178 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3179 && (!DECL_TEMPLATE_INFO (newdecl)
3180 || (DECL_TI_TEMPLATE (newdecl)
3181 != DECL_TI_TEMPLATE (olddecl))))
3182 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3183 && (!DECL_TEMPLATE_INFO (olddecl)
3184 || (DECL_TI_TEMPLATE (olddecl)
3185 != DECL_TI_TEMPLATE (newdecl))))))
3186 /* It's OK to have a template specialization and a non-template
3187 with the same type, or to have specializations of two
3188 different templates with the same type. Note that if one is a
3189 specialization, and the other is an instantiation of the same
3190 template, that we do not exit at this point. That situation
3191 can occur if we instantiate a template class, and then
3192 specialize one of its methods. This situation is valid, but
3193 the declarations must be merged in the usual way. */
3195 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3196 && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3197 && !DECL_USE_TEMPLATE (newdecl))
3198 || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3199 && !DECL_USE_TEMPLATE (olddecl))))
3200 /* One of the declarations is a template instantiation, and the
3201 other is not a template at all. That's OK. */
3203 else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3204 && DECL_NAMESPACE_ALIAS (newdecl)
3205 && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3206 /* Redeclaration of namespace alias, ignore it. */
3210 const char *errmsg = redeclaration_error_message (newdecl, olddecl);
3213 error (errmsg, newdecl);
3214 if (DECL_NAME (olddecl) != NULL_TREE)
3215 cp_error_at ((DECL_INITIAL (olddecl)
3216 && namespace_bindings_p ())
3217 ? "`%#D' previously defined here"
3218 : "`%#D' previously declared here", olddecl);
3221 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3222 && DECL_INITIAL (olddecl) != NULL_TREE
3223 && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3224 && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3226 /* Prototype decl follows defn w/o prototype. */
3227 cp_warning_at ("prototype for `%#D'", newdecl);
3228 cp_warning_at ("follows non-prototype definition here", olddecl);
3230 else if (TREE_CODE (olddecl) == FUNCTION_DECL
3231 && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3233 /* extern "C" int foo ();
3234 int foo () { bar (); }
3236 if (current_lang_depth () == 0)
3237 SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl));
3240 cp_error_at ("previous declaration of `%#D' with %L linkage",
3241 olddecl, DECL_LANGUAGE (olddecl));
3242 error ("conflicts with new declaration with %L linkage",
3243 DECL_LANGUAGE (newdecl));
3247 if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3249 else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3251 tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3252 tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3255 if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3256 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3258 for (; t1 && t1 != void_list_node;
3259 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3260 if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3262 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3265 pedwarn ("default argument given for parameter %d of `%#D'",
3267 cp_pedwarn_at ("after previous specification in `%#D'",
3272 error ("default argument given for parameter %d of `%#D'",
3274 cp_error_at ("after previous specification in `%#D'",
3279 if (DECL_DECLARED_INLINE_P (newdecl)
3280 && ! DECL_DECLARED_INLINE_P (olddecl)
3281 && TREE_ADDRESSABLE (olddecl) && warn_inline)
3283 warning ("`%#D' was used before it was declared inline",
3285 cp_warning_at ("previous non-inline declaration here",
3291 /* Do not merge an implicit typedef with an explicit one. In:
3295 typedef class A A __attribute__ ((foo));
3297 the attribute should apply only to the typedef. */
3298 if (TREE_CODE (olddecl) == TYPE_DECL
3299 && (DECL_IMPLICIT_TYPEDEF_P (olddecl)
3300 || DECL_IMPLICIT_TYPEDEF_P (newdecl)))
3303 /* If new decl is `static' and an `extern' was seen previously,
3305 warn_extern_redeclared_static (newdecl, olddecl);
3307 /* We have committed to returning 1 at this point. */
3308 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3310 /* Now that functions must hold information normally held
3311 by field decls, there is extra work to do so that
3312 declaration information does not get destroyed during
3314 if (DECL_VINDEX (olddecl))
3315 DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3316 if (DECL_CONTEXT (olddecl))
3317 DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3318 DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3319 DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3320 DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl);
3321 DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3322 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3323 DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl);
3324 if (DECL_OVERLOADED_OPERATOR_P (olddecl) != ERROR_MARK)
3325 SET_OVERLOADED_OPERATOR_CODE
3326 (newdecl, DECL_OVERLOADED_OPERATOR_P (olddecl));
3327 new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3329 /* Optionally warn about more than one declaration for the same
3330 name, but don't warn about a function declaration followed by a
3332 if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3333 && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3334 /* Don't warn about extern decl followed by definition. */
3335 && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3336 /* Don't warn about friends, let add_friend take care of it. */
3337 && ! (DECL_FRIEND_P (newdecl) || DECL_FRIEND_P (olddecl)))
3339 warning ("redundant redeclaration of `%D' in same scope", newdecl);
3340 cp_warning_at ("previous declaration of `%D'", olddecl);
3344 /* Deal with C++: must preserve virtual function table size. */
3345 if (TREE_CODE (olddecl) == TYPE_DECL)
3347 register tree newtype = TREE_TYPE (newdecl);
3348 register tree oldtype = TREE_TYPE (olddecl);
3350 if (newtype != error_mark_node && oldtype != error_mark_node
3351 && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3352 CLASSTYPE_FRIEND_CLASSES (newtype)
3353 = CLASSTYPE_FRIEND_CLASSES (oldtype);
3355 DECL_ORIGINAL_TYPE (newdecl) = DECL_ORIGINAL_TYPE (olddecl);
3358 /* Copy all the DECL_... slots specified in the new decl
3359 except for any that we copy here from the old type. */
3360 DECL_ATTRIBUTES (newdecl)
3361 = (*targetm.merge_decl_attributes) (olddecl, newdecl);
3363 if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3365 TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3366 DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3367 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3368 DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3370 /* If the new declaration is a definition, update the file and
3371 line information on the declaration. */
3372 if (DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)) == NULL_TREE
3373 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl)) != NULL_TREE)
3375 DECL_SOURCE_LOCATION (olddecl)
3376 = DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (olddecl))
3377 = DECL_SOURCE_LOCATION (newdecl);
3385 /* Automatically handles default parameters. */
3386 tree oldtype = TREE_TYPE (olddecl);
3389 /* Merge the data types specified in the two decls. */
3390 newtype = merge_types (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3392 /* If merge_types produces a non-typedef type, just use the old type. */
3393 if (TREE_CODE (newdecl) == TYPE_DECL
3394 && newtype == DECL_ORIGINAL_TYPE (newdecl))
3397 if (TREE_CODE (newdecl) == VAR_DECL)
3399 DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3400 DECL_INITIALIZED_P (newdecl) |= DECL_INITIALIZED_P (olddecl);
3403 /* Do this after calling `merge_types' so that default
3404 parameters don't confuse us. */
3405 else if (TREE_CODE (newdecl) == FUNCTION_DECL
3406 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3407 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3409 TREE_TYPE (newdecl) = build_exception_variant (newtype,
3410 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3411 TREE_TYPE (olddecl) = build_exception_variant (newtype,
3412 TYPE_RAISES_EXCEPTIONS (oldtype));
3414 if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3415 && DECL_SOURCE_LINE (olddecl) != 0
3417 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)),
3418 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1))
3420 error ("declaration of `%F' throws different exceptions",
3422 cp_error_at ("than previous declaration `%F'", olddecl);
3425 TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3427 /* Lay the type out, unless already done. */
3428 if (! same_type_p (newtype, oldtype)
3429 && TREE_TYPE (newdecl) != error_mark_node
3430 && !(processing_template_decl && uses_template_parms (newdecl)))
3431 layout_type (TREE_TYPE (newdecl));
3433 if ((TREE_CODE (newdecl) == VAR_DECL
3434 || TREE_CODE (newdecl) == PARM_DECL
3435 || TREE_CODE (newdecl) == RESULT_DECL
3436 || TREE_CODE (newdecl) == FIELD_DECL
3437 || TREE_CODE (newdecl) == TYPE_DECL)
3438 && !(processing_template_decl && uses_template_parms (newdecl)))
3439 layout_decl (newdecl, 0);
3441 /* Merge the type qualifiers. */
3442 if (TREE_READONLY (newdecl))
3443 TREE_READONLY (olddecl) = 1;
3444 if (TREE_THIS_VOLATILE (newdecl))
3445 TREE_THIS_VOLATILE (olddecl) = 1;
3447 /* Merge the initialization information. */
3448 if (DECL_INITIAL (newdecl) == NULL_TREE
3449 && DECL_INITIAL (olddecl) != NULL_TREE)
3451 DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3452 DECL_SOURCE_LOCATION (newdecl) = DECL_SOURCE_LOCATION (olddecl);
3453 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl)
3454 && DECL_LANG_SPECIFIC (newdecl)
3455 && DECL_LANG_SPECIFIC (olddecl))
3456 DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3459 /* Merge the section attribute.
3460 We want to issue an error if the sections conflict but that must be
3461 done later in decl_attributes since we are called before attributes
3463 if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3464 DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3466 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3468 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl)
3469 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl);
3470 DECL_NO_LIMIT_STACK (newdecl)
3471 |= DECL_NO_LIMIT_STACK (olddecl);
3472 /* Keep the old RTL. */
3473 COPY_DECL_RTL (olddecl, newdecl);
3475 else if (TREE_CODE (newdecl) == VAR_DECL
3476 && (DECL_SIZE (olddecl) || !DECL_SIZE (newdecl)))
3478 /* Keep the old RTL. We cannot keep the old RTL if the old
3479 declaration was for an incomplete object and the new
3480 declaration is not since many attributes of the RTL will
3482 COPY_DECL_RTL (olddecl, newdecl);
3485 /* If cannot merge, then use the new type and qualifiers,
3486 and don't preserve the old rtl. */
3489 /* Clean out any memory we had of the old declaration. */
3490 tree oldstatic = value_member (olddecl, static_aggregates);
3492 TREE_VALUE (oldstatic) = error_mark_node;
3494 TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3495 TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3496 TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3497 TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3500 /* Merge the storage class information. */
3501 merge_weak (newdecl, olddecl);
3503 DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3504 DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl);
3505 TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3506 TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3507 if (! DECL_EXTERNAL (olddecl))
3508 DECL_EXTERNAL (newdecl) = 0;
3510 if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3512 DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3513 DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3514 DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3515 DECL_TEMPLATE_INSTANTIATED (newdecl)
3516 |= DECL_TEMPLATE_INSTANTIATED (olddecl);
3517 /* Don't really know how much of the language-specific
3518 values we should copy from old to new. */
3519 DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3520 DECL_LANG_SPECIFIC (newdecl)->decl_flags.u2 =
3521 DECL_LANG_SPECIFIC (olddecl)->decl_flags.u2;
3522 DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3523 DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3524 DECL_INITIALIZED_IN_CLASS_P (newdecl)
3525 |= DECL_INITIALIZED_IN_CLASS_P (olddecl);
3526 olddecl_friend = DECL_FRIEND_P (olddecl);
3528 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3529 if (TREE_CODE (newdecl) == FUNCTION_DECL
3530 || DECL_FUNCTION_TEMPLATE_P (newdecl))
3532 DECL_BEFRIENDING_CLASSES (newdecl)
3533 = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
3534 DECL_BEFRIENDING_CLASSES (olddecl));
3535 DECL_THUNKS (newdecl) = DECL_THUNKS (olddecl);
3539 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3541 if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3542 && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3544 /* If newdecl is not a specialization, then it is not a
3545 template-related function at all. And that means that we
3546 should have exited above, returning 0. */
3547 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3550 if (TREE_USED (olddecl))
3551 /* From [temp.expl.spec]:
3553 If a template, a member template or the member of a class
3554 template is explicitly specialized then that
3555 specialization shall be declared before the first use of
3556 that specialization that would cause an implicit
3557 instantiation to take place, in every translation unit in
3558 which such a use occurs. */
3559 error ("explicit specialization of %D after first use",
3562 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3564 /* [temp.expl.spec/14] We don't inline explicit specialization
3565 just because the primary template says so. */
3569 if (DECL_PENDING_INLINE_INFO (newdecl) == 0)
3570 DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3572 DECL_DECLARED_INLINE_P (newdecl) |= DECL_DECLARED_INLINE_P (olddecl);
3574 /* If either decl says `inline', this fn is inline, unless
3575 its definition was passed already. */
3576 if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3577 DECL_INLINE (olddecl) = 1;
3578 DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3580 DECL_UNINLINABLE (newdecl) = DECL_UNINLINABLE (olddecl)
3581 = (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl));
3584 /* Preserve abstractness on cloned [cd]tors. */
3585 DECL_ABSTRACT (newdecl) = DECL_ABSTRACT (olddecl);
3589 SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl));
3590 COPY_DECL_ASSEMBLER_NAME (newdecl, olddecl);
3591 SET_DECL_RTL (olddecl, DECL_RTL (newdecl));
3593 if (! types_match || new_defines_function)
3595 /* These need to be copied so that the names are available.
3596 Note that if the types do match, we'll preserve inline
3597 info and other bits, but if not, we won't. */
3598 DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3599 DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3601 if (new_defines_function)
3602 /* If defining a function declared with other language
3603 linkage, use the previously declared language linkage. */
3604 SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl));
3605 else if (types_match)
3607 /* If redeclaring a builtin function, and not a definition,
3608 it stays built in. */
3609 if (DECL_BUILT_IN (olddecl))
3611 DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl);
3612 DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3613 /* If we're keeping the built-in definition, keep the rtl,
3614 regardless of declaration matches. */
3615 SET_DECL_RTL (newdecl, DECL_RTL (olddecl));
3618 DECL_NUM_STMTS (newdecl) = DECL_NUM_STMTS (olddecl);
3620 DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3621 /* Don't clear out the arguments if we're redefining a function. */
3622 if (DECL_ARGUMENTS (olddecl))
3623 DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3626 else if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3627 NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3629 /* Now preserve various other info from the definition. */
3630 TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3631 TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3632 DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3633 COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl);
3635 if (TREE_CODE (newdecl) == FUNCTION_DECL)
3639 function_size = sizeof (struct tree_decl);
3641 memcpy ((char *) olddecl + sizeof (struct tree_common),
3642 (char *) newdecl + sizeof (struct tree_common),
3643 function_size - sizeof (struct tree_common));
3645 if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3647 /* If newdecl is a template instantiation, it is possible that
3648 the following sequence of events has occurred:
3650 o A friend function was declared in a class template. The
3651 class template was instantiated.
3653 o The instantiation of the friend declaration was
3654 recorded on the instantiation list, and is newdecl.
3656 o Later, however, instantiate_class_template called pushdecl
3657 on the newdecl to perform name injection. But, pushdecl in
3658 turn called duplicate_decls when it discovered that another
3659 declaration of a global function with the same name already
3662 o Here, in duplicate_decls, we decided to clobber newdecl.
3664 If we're going to do that, we'd better make sure that
3665 olddecl, and not newdecl, is on the list of
3666 instantiations so that if we try to do the instantiation
3667 again we won't get the clobbered declaration. */
3669 tree tmpl = DECL_TI_TEMPLATE (newdecl);
3670 tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3672 for (; decls; decls = TREE_CHAIN (decls))
3673 if (TREE_VALUE (decls) == newdecl)
3674 TREE_VALUE (decls) = olddecl;
3679 memcpy ((char *) olddecl + sizeof (struct tree_common),
3680 (char *) newdecl + sizeof (struct tree_common),
3681 sizeof (struct tree_decl) - sizeof (struct tree_common)
3682 + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *));
3685 DECL_UID (olddecl) = olddecl_uid;
3687 DECL_FRIEND_P (olddecl) = 1;
3689 /* NEWDECL contains the merged attribute lists.
3690 Update OLDDECL to be the same. */
3691 DECL_ATTRIBUTES (olddecl) = DECL_ATTRIBUTES (newdecl);
3696 /* Record a decl-node X as belonging to the current lexical scope.
3697 Check for errors (such as an incompatible declaration for the same
3698 name already seen in the same scope).
3700 Returns either X or an old decl for the same name.
3701 If an old decl is returned, it may have been smashed
3702 to agree with what X says. */
3709 int need_new_binding;
3711 timevar_push (TV_NAME_LOOKUP);
3712 /* We shouldn't be calling pushdecl when we're generating RTL for a
3713 function that we already did semantic analysis on previously. */
3714 my_friendly_assert (!cfun || doing_semantic_analysis_p (),
3717 need_new_binding = 1;
3719 if (DECL_TEMPLATE_PARM_P (x))
3720 /* Template parameters have no context; they are not X::T even
3721 when declared within a class or namespace. */
3725 if (current_function_decl && x != current_function_decl
3726 /* A local declaration for a function doesn't constitute
3728 && !(TREE_CODE (x) == FUNCTION_DECL && !DECL_INITIAL (x))
3729 /* A local declaration for an `extern' variable is in the
3730 scope of the current namespace, not the current
3732 && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
3733 && !DECL_CONTEXT (x))
3734 DECL_CONTEXT (x) = current_function_decl;
3736 /* If this is the declaration for a namespace-scope function,
3737 but the declaration itself is in a local scope, mark the
3739 if (TREE_CODE (x) == FUNCTION_DECL
3740 && DECL_NAMESPACE_SCOPE_P (x)
3741 && current_function_decl
3742 && x != current_function_decl)
3743 DECL_LOCAL_FUNCTION_P (x) = 1;
3746 name = DECL_NAME (x);
3749 int different_binding_level = 0;
3751 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3752 name = TREE_OPERAND (name, 0);
3754 /* In case this decl was explicitly namespace-qualified, look it
3755 up in its namespace context. */
3756 if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x)
3757 && namespace_bindings_p ())
3758 t = namespace_binding (name, DECL_CONTEXT (x));
3760 t = lookup_name_current_level (name);
3762 /* [basic.link] If there is a visible declaration of an entity
3763 with linkage having the same name and type, ignoring entities
3764 declared outside the innermost enclosing namespace scope, the
3765 block scope declaration declares that same entity and
3766 receives the linkage of the previous declaration. */
3767 if (! t && current_function_decl && x != current_function_decl
3768 && (TREE_CODE (x) == FUNCTION_DECL || TREE_CODE (x) == VAR_DECL)
3769 && DECL_EXTERNAL (x))
3771 /* Look in block scope. */
3772 t = IDENTIFIER_VALUE (name);
3773 /* Or in the innermost namespace. */
3775 t = namespace_binding (name, DECL_CONTEXT (x));
3776 /* Does it have linkage? Note that if this isn't a DECL, it's an
3777 OVERLOAD, which is OK. */
3778 if (t && DECL_P (t) && ! (TREE_STATIC (t) || DECL_EXTERNAL (t)))
3781 different_binding_level = 1;
3784 /* If we are declaring a function, and the result of name-lookup
3785 was an OVERLOAD, look for an overloaded instance that is
3786 actually the same as the function we are declaring. (If
3787 there is one, we have to merge our declaration with the
3788 previous declaration.) */
3789 if (t && TREE_CODE (t) == OVERLOAD)
3793 if (TREE_CODE (x) == FUNCTION_DECL)
3794 for (match = t; match; match = OVL_NEXT (match))
3796 if (decls_match (OVL_CURRENT (match), x))
3800 /* Just choose one. */
3804 t = OVL_CURRENT (match);
3809 if (t == error_mark_node)
3811 /* error_mark_node is 0 for a while during initialization! */
3813 cp_error_at ("`%#D' used prior to declaration", x);
3815 else if (t != NULL_TREE)
3817 if (different_binding_level)
3819 if (decls_match (x, t))
3820 /* The standard only says that the local extern
3821 inherits linkage from the previous decl; in
3822 particular, default args are not shared. It would
3823 be nice to propagate inlining info, though. FIXME. */
3824 TREE_PUBLIC (x) = TREE_PUBLIC (t);
3826 else if (TREE_CODE (t) == PARM_DECL)
3828 if (DECL_CONTEXT (t) == NULL_TREE)
3829 /* This is probaby caused by too many errors, but calling
3830 abort will say that if errors have occurred. */
3833 /* Check for duplicate params. */
3834 if (duplicate_decls (x, t))
3835 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
3837 else if ((DECL_EXTERN_C_FUNCTION_P (x)
3838 || DECL_FUNCTION_TEMPLATE_P (x))
3839 && is_overloaded_fn (t))
3840 /* Don't do anything just yet. */;
3841 else if (t == wchar_decl_node)
3843 if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3844 pedwarn ("redeclaration of `wchar_t' as `%T'",
3847 /* Throw away the redeclaration. */
3848 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
3850 else if (TREE_CODE (t) != TREE_CODE (x))
3852 if (duplicate_decls (x, t))
3853 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
3855 else if (duplicate_decls (x, t))
3857 if (TREE_CODE (t) == TYPE_DECL)
3858 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3859 else if (TREE_CODE (t) == FUNCTION_DECL)
3860 check_default_args (t);
3862 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
3864 else if (DECL_MAIN_P (x))
3866 /* A redeclaration of main, but not a duplicate of the
3871 This function shall not be overloaded. */
3872 cp_error_at ("invalid redeclaration of `%D'", t);
3873 error ("as `%D'", x);
3874 /* We don't try to push this declaration since that
3876 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
3880 check_template_shadow (x);
3882 /* If this is a function conjured up by the backend, massage it
3883 so it looks friendly. */
3884 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_LANG_SPECIFIC (x))
3886 retrofit_lang_decl (x);
3887 SET_DECL_LANGUAGE (x, lang_c);
3890 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_FUNCTION_MEMBER_P (x))
3892 t = push_overloaded_decl (x, PUSH_LOCAL);
3894 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
3895 if (!namespace_bindings_p ())
3896 /* We do not need to create a binding for this name;
3897 push_overloaded_decl will have already done so if
3899 need_new_binding = 0;
3901 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
3903 t = push_overloaded_decl (x, PUSH_GLOBAL);
3905 add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
3906 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
3909 /* If declaring a type as a typedef, copy the type (unless we're
3910 at line 0), and install this TYPE_DECL as the new type's typedef
3911 name. See the extensive comment in ../c-decl.c (pushdecl). */
3912 if (TREE_CODE (x) == TYPE_DECL)
3914 tree type = TREE_TYPE (x);
3915 if (DECL_SOURCE_LINE (x) == 0)
3917 if (TYPE_NAME (type) == 0)
3918 TYPE_NAME (type) = x;
3920 else if (type != error_mark_node && TYPE_NAME (type) != x
3921 /* We don't want to copy the type when all we're
3922 doing is making a TYPE_DECL for the purposes of
3924 && (!TYPE_NAME (type)
3925 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
3927 DECL_ORIGINAL_TYPE (x) = type;
3928 type = build_type_copy (type);
3929 TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
3930 TYPE_NAME (type) = x;
3931 TREE_TYPE (x) = type;
3934 if (type != error_mark_node
3936 && TYPE_IDENTIFIER (type))
3937 set_identifier_type_value_with_scope (DECL_NAME (x), type,
3938 current_binding_level);
3942 /* Multiple external decls of the same identifier ought to match.
3944 We get warnings about inline functions where they are defined.
3945 We get warnings about other functions from push_overloaded_decl.
3947 Avoid duplicate warnings where they are used. */
3948 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
3952 decl = IDENTIFIER_NAMESPACE_VALUE (name);
3953 if (decl && TREE_CODE (decl) == OVERLOAD)
3954 decl = OVL_FUNCTION (decl);
3956 if (decl && decl != error_mark_node
3957 && (DECL_EXTERNAL (decl) || TREE_PUBLIC (decl))
3958 /* If different sort of thing, we already gave an error. */
3959 && TREE_CODE (decl) == TREE_CODE (x)
3960 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
3962 pedwarn ("type mismatch with previous external decl", x);
3963 cp_pedwarn_at ("previous external decl of `%#D'", decl);
3967 /* This name is new in its binding level.
3968 Install the new declaration and return it. */
3969 if (namespace_bindings_p ())
3971 /* Install a global value. */
3973 /* If the first global decl has external linkage,
3974 warn if we later see static one. */
3975 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
3976 TREE_PUBLIC (name) = 1;
3978 /* Bind the name for the entity. */
3979 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
3981 && (TREE_CODE (x) == TYPE_DECL
3982 || TREE_CODE (x) == VAR_DECL
3983 || TREE_CODE (x) == ALIAS_DECL
3984 || TREE_CODE (x) == NAMESPACE_DECL
3985 || TREE_CODE (x) == CONST_DECL
3986 || TREE_CODE (x) == TEMPLATE_DECL))
3987 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
3989 /* Don't forget if the function was used via an implicit decl. */
3990 if (IDENTIFIER_IMPLICIT_DECL (name)
3991 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
3994 /* Don't forget if its address was taken in that way. */
3995 if (IDENTIFIER_IMPLICIT_DECL (name)
3996 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
3997 TREE_ADDRESSABLE (x) = 1;
3999 /* Warn about mismatches against previous implicit decl. */
4000 if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
4001 /* If this real decl matches the implicit, don't complain. */
4002 && ! (TREE_CODE (x) == FUNCTION_DECL
4003 && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
4005 ("`%D' was previously implicitly declared to return `int'", x);
4007 /* If new decl is `static' and an `extern' was seen previously,
4009 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
4010 warn_extern_redeclared_static (x, t);
4014 /* Here to install a non-global value. */
4015 tree oldlocal = IDENTIFIER_VALUE (name);
4016 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
4018 if (need_new_binding)
4020 push_local_binding (name, x, 0);
4021 /* Because push_local_binding will hook X on to the
4022 current_binding_level's name list, we don't want to
4023 do that again below. */
4024 need_new_binding = 0;
4027 /* If this is a TYPE_DECL, push it into the type value slot. */
4028 if (TREE_CODE (x) == TYPE_DECL)
4029 set_identifier_type_value_with_scope (name, TREE_TYPE (x),
4030 current_binding_level);
4032 /* Clear out any TYPE_DECL shadowed by a namespace so that
4033 we won't think this is a type. The C struct hack doesn't
4034 go through namespaces. */
4035 if (TREE_CODE (x) == NAMESPACE_DECL)
4036 set_identifier_type_value_with_scope (name, NULL_TREE,
4037 current_binding_level);
4044 && TREE_CODE (oldlocal) == VAR_DECL
4045 && DECL_DEAD_FOR_LOCAL (oldlocal))
4046 oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal);
4048 if (oldlocal == NULL_TREE)
4049 oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d));
4052 /* If this is an extern function declaration, see if we
4053 have a global definition or declaration for the function. */
4054 if (oldlocal == NULL_TREE
4055 && DECL_EXTERNAL (x)
4056 && oldglobal != NULL_TREE
4057 && TREE_CODE (x) == FUNCTION_DECL
4058 && TREE_CODE (oldglobal) == FUNCTION_DECL)
4060 /* We have one. Their types must agree. */
4061 if (decls_match (x, oldglobal))
4065 warning ("extern declaration of `%#D' doesn't match", x);
4066 cp_warning_at ("global declaration `%#D'", oldglobal);
4069 /* If we have a local external declaration,
4070 and no file-scope declaration has yet been seen,
4071 then if we later have a file-scope decl it must not be static. */
4072 if (oldlocal == NULL_TREE
4073 && oldglobal == NULL_TREE
4074 && DECL_EXTERNAL (x)
4076 TREE_PUBLIC (name) = 1;
4078 /* Warn if shadowing an argument at the top level of the body. */
4079 if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
4080 /* Inline decls shadow nothing. */
4081 && !DECL_FROM_INLINE (x)
4082 && TREE_CODE (oldlocal) == PARM_DECL)
4086 /* Don't complain if it's from an enclosing function. */
4087 if (DECL_CONTEXT (oldlocal) == current_function_decl
4088 && TREE_CODE (x) != PARM_DECL)
4090 /* Go to where the parms should be and see if we find
4092 struct cp_binding_level *b = current_binding_level->level_chain;
4094 /* Skip the ctor/dtor cleanup level. */
4098 if (b->parm_flag == 1)
4100 error ("declaration of `%#D' shadows a parameter",
4106 if (warn_shadow && !err)
4107 shadow_warning ("a parameter", name, oldlocal);
4110 /* Maybe warn if shadowing something else. */
4111 else if (warn_shadow && !DECL_EXTERNAL (x)
4112 /* No shadow warnings for internally generated vars. */
4113 && ! DECL_ARTIFICIAL (x)
4114 /* No shadow warnings for vars made for inlining. */
4115 && ! DECL_FROM_INLINE (x))
4117 if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
4118 && current_class_ptr
4119 && !TREE_STATIC (name))
4120 warning ("declaration of `%s' shadows a member of `this'",
4121 IDENTIFIER_POINTER (name));
4122 else if (oldlocal != NULL_TREE
4123 && TREE_CODE (oldlocal) == VAR_DECL)
4124 shadow_warning ("a previous local", name, oldlocal);
4125 else if (oldglobal != NULL_TREE
4126 && TREE_CODE (oldglobal) == VAR_DECL)
4127 /* XXX shadow warnings in outer-more namespaces */
4128 shadow_warning ("a global declaration", name, oldglobal);
4132 if (TREE_CODE (x) == FUNCTION_DECL)
4133 check_default_args (x);
4135 if (TREE_CODE (x) == VAR_DECL)
4136 maybe_register_incomplete_var (x);
4139 if (need_new_binding)
4140 add_decl_to_level (x,
4141 DECL_NAMESPACE_SCOPE_P (x)
4142 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
4143 : current_binding_level);
4145 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
4148 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4149 caller to set DECL_CONTEXT properly. */
4152 pushdecl_with_scope (tree x, struct cp_binding_level* level)
4154 register struct cp_binding_level *b;
4155 tree function_decl = current_function_decl;
4157 timevar_push (TV_NAME_LOOKUP);
4158 current_function_decl = NULL_TREE;
4159 if (level->parm_flag == 2)
4161 b = class_binding_level;
4162 class_binding_level = level;
4163 pushdecl_class_level (x);
4164 class_binding_level = b;
4168 b = current_binding_level;
4169 current_binding_level = level;
4171 current_binding_level = b;
4173 current_function_decl = function_decl;
4174 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
4177 /* Like pushdecl, only it places X in the current namespace,
4181 pushdecl_namespace_level (tree x)
4183 register struct cp_binding_level *b = current_binding_level;
4186 timevar_push (TV_NAME_LOOKUP);
4187 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
4189 /* Now, the type_shadowed stack may screw us. Munge it so it does
4191 if (TREE_CODE (x) == TYPE_DECL)
4193 tree name = DECL_NAME (x);
4195 tree *ptr = (tree *)0;
4196 for (; b != global_binding_level; b = b->level_chain)
4198 tree shadowed = b->type_shadowed;
4199 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
4200 if (TREE_PURPOSE (shadowed) == name)
4202 ptr = &TREE_VALUE (shadowed);
4203 /* Can't break out of the loop here because sometimes
4204 a binding level will have duplicate bindings for
4205 PT names. It's gross, but I haven't time to fix it. */
4208 newval = TREE_TYPE (x);
4209 if (ptr == (tree *)0)
4211 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4212 up here if this is changed to an assertion. --KR */
4213 SET_IDENTIFIER_TYPE_VALUE (name, newval);
4220 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4223 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4227 pushdecl_top_level (tree x)
4229 timevar_push (TV_NAME_LOOKUP);
4230 push_to_top_level ();
4231 x = pushdecl_namespace_level (x);
4232 pop_from_top_level ();
4233 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
4236 /* Make the declaration of X appear in CLASS scope. */
4239 pushdecl_class_level (tree x)
4243 timevar_push (TV_NAME_LOOKUP);
4244 /* Get the name of X. */
4245 if (TREE_CODE (x) == OVERLOAD)
4246 name = DECL_NAME (get_first_fn (x));
4248 name = DECL_NAME (x);
4252 push_class_level_binding (name, x);
4253 if (TREE_CODE (x) == TYPE_DECL)
4254 set_identifier_type_value (name, TREE_TYPE (x));
4256 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
4258 /* If X is an anonymous aggregate, all of its members are
4259 treated as if they were members of the class containing the
4260 aggregate, for naming purposes. */
4263 for (f = TYPE_FIELDS (TREE_TYPE (x)); f; f = TREE_CHAIN (f))
4264 pushdecl_class_level (f);
4266 timevar_pop (TV_NAME_LOOKUP);
4269 /* Enter DECL into the symbol table, if that's appropriate. Returns
4270 DECL, or a modified version thereof. */
4273 maybe_push_decl (tree decl)
4275 tree type = TREE_TYPE (decl);
4277 /* Add this decl to the current binding level, but not if it comes
4278 from another scope, e.g. a static member variable. TEM may equal
4279 DECL or it may be a previous decl of the same name. */
4280 if (decl == error_mark_node
4281 || (TREE_CODE (decl) != PARM_DECL
4282 && DECL_CONTEXT (decl) != NULL_TREE
4283 /* Definitions of namespace members outside their namespace are
4285 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
4286 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
4287 || TREE_CODE (type) == UNKNOWN_TYPE
4288 /* The declaration of a template specialization does not affect
4289 the functions available for overload resolution, so we do not
4291 || (TREE_CODE (decl) == FUNCTION_DECL
4292 && DECL_TEMPLATE_SPECIALIZATION (decl)))
4295 return pushdecl (decl);
4298 /* Make the declaration(s) of X appear in CLASS scope
4299 under the name NAME. */
4302 push_class_level_binding (tree name, tree x)
4305 timevar_push (TV_NAME_LOOKUP);
4306 /* The class_binding_level will be NULL if x is a template
4307 parameter name in a member template. */
4308 if (!class_binding_level)
4309 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, (void)0);
4311 /* Make sure that this new member does not have the same name
4312 as a template parameter. */
4313 if (TYPE_BEING_DEFINED (current_class_type))
4314 check_template_shadow (x);
4316 /* If this declaration shadows a declaration from an enclosing
4317 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4318 we leave this class. Record the shadowed declaration here. */
4319 binding = IDENTIFIER_BINDING (name);
4321 && ((TREE_CODE (x) == OVERLOAD
4322 && BINDING_VALUE (binding)
4323 && is_overloaded_fn (BINDING_VALUE (binding)))
4324 || INHERITED_VALUE_BINDING_P (binding)))
4329 /* If the old binding was from a base class, and was for a tag
4330 name, slide it over to make room for the new binding. The
4331 old binding is still visible if explicitly qualified with a
4333 if (INHERITED_VALUE_BINDING_P (binding)
4334 && BINDING_VALUE (binding)
4335 && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
4336 && DECL_ARTIFICIAL (BINDING_VALUE (binding))
4337 && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
4339 old_decl = BINDING_TYPE (binding);
4340 BINDING_TYPE (binding) = BINDING_VALUE (binding);
4341 BINDING_VALUE (binding) = NULL_TREE;
4342 INHERITED_VALUE_BINDING_P (binding) = 0;
4345 old_decl = BINDING_VALUE (binding);
4347 /* Find the previous binding of name on the class-shadowed
4348 list, and update it. */
4349 for (shadow = class_binding_level->class_shadowed;
4351 shadow = TREE_CHAIN (shadow))
4352 if (TREE_PURPOSE (shadow) == name
4353 && TREE_TYPE (shadow) == old_decl)
4355 BINDING_VALUE (binding) = x;
4356 INHERITED_VALUE_BINDING_P (binding) = 0;
4357 TREE_TYPE (shadow) = x;
4358 IDENTIFIER_CLASS_VALUE (name) = x;
4359 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, (void)0);
4363 /* If we didn't replace an existing binding, put the binding on the
4364 stack of bindings for the identifier, and update the shadowed list. */
4365 if (push_class_binding (name, x))
4367 class_binding_level->class_shadowed
4368 = tree_cons (name, NULL,
4369 class_binding_level->class_shadowed);
4370 /* Record the value we are binding NAME to so that we can know
4371 what to pop later. */
4372 TREE_TYPE (class_binding_level->class_shadowed) = x;
4374 timevar_pop (TV_NAME_LOOKUP);
4377 /* Insert another USING_DECL into the current binding level, returning
4378 this declaration. If this is a redeclaration, do nothing, and
4379 return NULL_TREE if this not in namespace scope (in namespace
4380 scope, a using decl might extend any previous bindings). */
4383 push_using_decl (tree scope, tree name)
4387 timevar_push (TV_NAME_LOOKUP);
4388 my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4389 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4390 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4391 if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4394 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP,
4395 namespace_bindings_p () ? decl : NULL_TREE);
4396 decl = build_lang_decl (USING_DECL, name, void_type_node);
4397 DECL_INITIAL (decl) = scope;
4398 TREE_CHAIN (decl) = current_binding_level->usings;
4399 current_binding_level->usings = decl;
4400 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
4403 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4404 changed (i.e. there was already a directive), or the fresh
4405 TREE_LIST otherwise. */
4408 push_using_directive (tree used)
4410 tree ud = current_binding_level->using_directives;
4411 tree iter, ancestor;
4413 timevar_push (TV_NAME_LOOKUP);
4414 /* Check if we already have this. */
4415 if (purpose_member (used, ud) != NULL_TREE)
4416 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
4418 /* Recursively add all namespaces used. */
4419 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4420 push_using_directive (TREE_PURPOSE (iter));
4422 ancestor = namespace_ancestor (current_decl_namespace (), used);
4423 ud = current_binding_level->using_directives;
4424 ud = tree_cons (used, ancestor, ud);
4425 current_binding_level->using_directives = ud;
4426 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ud);
4429 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4430 other definitions already in place. We get around this by making
4431 the value of the identifier point to a list of all the things that
4432 want to be referenced by that name. It is then up to the users of
4433 that name to decide what to do with that list.
4435 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4436 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4438 FLAGS is a bitwise-or of the following values:
4439 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4441 PUSH_USING: DECL is being pushed as the result of a using
4444 The value returned may be a previous declaration if we guessed wrong
4445 about what language DECL should belong to (C or C++). Otherwise,
4446 it's always DECL (and never something that's not a _DECL). */
4449 push_overloaded_decl (tree decl, int flags)
4451 tree name = DECL_NAME (decl);
4454 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4456 timevar_push (TV_NAME_LOOKUP);
4458 old = namespace_binding (name, DECL_CONTEXT (decl));
4460 old = lookup_name_current_level (name);
4464 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4466 tree t = TREE_TYPE (old);
4467 if (IS_AGGR_TYPE (t) && warn_shadow
4468 && (! DECL_IN_SYSTEM_HEADER (decl)
4469 || ! DECL_IN_SYSTEM_HEADER (old)))
4470 warning ("`%#D' hides constructor for `%#T'", decl, t);
4473 else if (is_overloaded_fn (old))
4477 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4479 tree fn = OVL_CURRENT (tmp);
4481 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4482 && !(flags & PUSH_USING)
4483 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4484 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4485 error ("`%#D' conflicts with previous using declaration `%#D'",
4488 if (duplicate_decls (decl, fn))
4489 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, fn);
4492 else if (old == error_mark_node)
4493 /* Ignore the undefined symbol marker. */
4497 cp_error_at ("previous non-function declaration `%#D'", old);
4498 error ("conflicts with function declaration `%#D'", decl);
4499 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
4503 if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4505 if (old && TREE_CODE (old) != OVERLOAD)
4506 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4508 new_binding = ovl_cons (decl, old);
4509 if (flags & PUSH_USING)
4510 OVL_USED (new_binding) = 1;
4513 /* NAME is not ambiguous. */
4517 set_namespace_binding (name, current_namespace, new_binding);
4520 /* We only create an OVERLOAD if there was a previous binding at
4521 this level, or if decl is a template. In the former case, we
4522 need to remove the old binding and replace it with the new
4523 binding. We must also run through the NAMES on the binding
4524 level where the name was bound to update the chain. */
4526 if (TREE_CODE (new_binding) == OVERLOAD && old)
4530 for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4532 d = &TREE_CHAIN (*d))
4534 || (TREE_CODE (*d) == TREE_LIST
4535 && TREE_VALUE (*d) == old))
4537 if (TREE_CODE (*d) == TREE_LIST)
4538 /* Just replace the old binding with the new. */
4539 TREE_VALUE (*d) = new_binding;
4541 /* Build a TREE_LIST to wrap the OVERLOAD. */
4542 *d = tree_cons (NULL_TREE, new_binding,
4545 /* And update the CPLUS_BINDING node. */
4546 BINDING_VALUE (IDENTIFIER_BINDING (name))
4548 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
4551 /* We should always find a previous binding in this case. */
4555 /* Install the new binding. */
4556 push_local_binding (name, new_binding, flags);
4559 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
4562 /* Generate an implicit declaration for identifier FUNCTIONID
4563 as a function of type int (). Print a warning if appropriate. */
4566 implicitly_declare (tree functionid)
4570 /* We used to reuse an old implicit decl here,
4571 but this loses with inline functions because it can clobber
4572 the saved decl chains. */
4573 decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4575 DECL_EXTERNAL (decl) = 1;
4576 TREE_PUBLIC (decl) = 1;
4578 /* ISO standard says implicit declarations are in the innermost block.
4579 So we record the decl in the standard fashion. */
4581 rest_of_decl_compilation (decl, NULL, 0, 0);
4584 /* Only one warning per identifier. */
4585 && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4587 pedwarn ("implicit declaration of function `%#D'", decl);
4590 SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4595 /* Return zero if the declaration NEWDECL is valid
4596 when the declaration OLDDECL (assumed to be for the same name)
4597 has already been seen.
4598 Otherwise return an error message format string with a %s
4599 where the identifier should go. */
4602 redeclaration_error_message (tree newdecl, tree olddecl)
4604 if (TREE_CODE (newdecl) == TYPE_DECL)
4606 /* Because C++ can put things into name space for free,
4607 constructs like "typedef struct foo { ... } foo"
4608 would look like an erroneous redeclaration. */
4609 if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4612 return "redefinition of `%#D'";
4614 else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4616 /* If this is a pure function, its olddecl will actually be
4617 the original initialization to `0' (which we force to call
4618 abort()). Don't complain about redefinition in this case. */
4619 if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl))
4622 /* If both functions come from different namespaces, this is not
4623 a redeclaration - this is a conflict with a used function. */
4624 if (DECL_NAMESPACE_SCOPE_P (olddecl)
4625 && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4626 return "`%D' conflicts with used function";
4628 /* We'll complain about linkage mismatches in
4629 warn_extern_redeclared_static. */
4631 /* Defining the same name twice is no good. */
4632 if (DECL_INITIAL (olddecl) != NULL_TREE
4633 && DECL_INITIAL (newdecl) != NULL_TREE)
4635 if (DECL_NAME (olddecl) == NULL_TREE)
4636 return "`%#D' not declared in class";
4638 return "redefinition of `%#D'";
4642 else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4644 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4645 && (DECL_TEMPLATE_RESULT (newdecl)
4646 != DECL_TEMPLATE_RESULT (olddecl))
4647 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4648 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4649 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4650 && COMPLETE_TYPE_P (TREE_TYPE (newdecl))
4651 && COMPLETE_TYPE_P (TREE_TYPE (olddecl))))
4652 return "redefinition of `%#D'";
4655 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl))
4657 /* Objects declared at top level: */
4658 /* If at least one is a reference, it's ok. */
4659 if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4661 /* Reject two definitions. */
4662 return "redefinition of `%#D'";
4666 /* Objects declared with block scope: */
4667 /* Reject two definitions, and reject a definition
4668 together with an external reference. */
4669 if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4670 return "redeclaration of `%#D'";
4675 /* Create a new label, named ID. */
4678 make_label_decl (tree id, int local_p)
4682 decl = build_decl (LABEL_DECL, id, void_type_node);
4684 /* Make sure every label has an rtx. */
4687 DECL_CONTEXT (decl) = current_function_decl;
4688 DECL_MODE (decl) = VOIDmode;
4689 C_DECLARED_LABEL_FLAG (decl) = local_p;
4691 /* Say where one reference is to the label, for the sake of the
4692 error if it is not defined. */
4693 DECL_SOURCE_LINE (decl) = lineno;
4694 DECL_SOURCE_FILE (decl) = input_filename;
4696 /* Record the fact that this identifier is bound to this label. */
4697 SET_IDENTIFIER_LABEL_VALUE (id, decl);
4702 /* Record this label on the list of used labels so that we can check
4703 at the end of the function to see whether or not the label was
4704 actually defined, and so we can check when the label is defined whether
4705 this use is valid. */
4708 use_label (tree decl)
4710 if (named_label_uses == NULL
4711 || named_label_uses->names_in_scope != current_binding_level->names
4712 || named_label_uses->label_decl != decl)
4714 struct named_label_use_list *new_ent;
4715 new_ent = ((struct named_label_use_list *)
4716 ggc_alloc (sizeof (struct named_label_use_list)));
4717 new_ent->label_decl = decl;
4718 new_ent->names_in_scope = current_binding_level->names;
4719 new_ent->binding_level = current_binding_level;
4720 new_ent->lineno_o_goto = lineno;
4721 new_ent->filename_o_goto = input_filename;
4722 new_ent->next = named_label_uses;
4723 named_label_uses = new_ent;
4727 /* Look for a label named ID in the current function. If one cannot
4728 be found, create one. (We keep track of used, but undefined,
4729 labels, and complain about them at the end of a function.) */
4732 lookup_label (tree id)
4735 struct named_label_list *ent;
4737 timevar_push (TV_NAME_LOOKUP);
4738 /* You can't use labels at global scope. */
4739 if (current_function_decl == NULL_TREE)
4741 error ("label `%s' referenced outside of any function",
4742 IDENTIFIER_POINTER (id));
4743 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
4746 /* See if we've already got this label. */
4747 decl = IDENTIFIER_LABEL_VALUE (id);
4748 if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl)
4749 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
4751 /* Record this label on the list of labels used in this function.
4752 We do this before calling make_label_decl so that we get the
4753 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4754 ent = ((struct named_label_list *)
4755 ggc_alloc_cleared (sizeof (struct named_label_list)));
4756 ent->old_value = IDENTIFIER_LABEL_VALUE (id);
4757 ent->next = named_labels;
4760 /* We need a new label. */
4761 decl = make_label_decl (id, /*local_p=*/0);
4763 /* Now fill in the information we didn't have before. */
4764 ent->label_decl = decl;
4766 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
4769 /* Declare a local label named ID. */
4772 declare_local_label (tree id)
4776 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4777 this scope we can restore the old value of
4778 IDENTIFIER_TYPE_VALUE. */
4779 current_binding_level->shadowed_labels
4780 = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4781 current_binding_level->shadowed_labels);
4782 /* Look for the label. */
4783 decl = make_label_decl (id, /*local_p=*/1);
4784 /* Now fill in the information we didn't have before. */
4785 TREE_VALUE (current_binding_level->shadowed_labels) = decl;
4790 /* Returns nonzero if it is ill-formed to jump past the declaration of
4791 DECL. Returns 2 if it's also a real problem. */
4794 decl_jump_unsafe (tree decl)
4796 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
4799 if (DECL_INITIAL (decl) == NULL_TREE
4800 && pod_type_p (TREE_TYPE (decl)))
4803 /* This is really only important if we're crossing an initialization.
4804 The POD stuff is just pedantry; why should it matter if the class
4805 contains a field of pointer to member type? */
4806 if (DECL_INITIAL (decl)
4807 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))))
4812 /* Check that a single previously seen jump to a newly defined label
4813 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4814 the jump context; NAMES are the names in scope in LEVEL at the jump
4815 context; FILE and LINE are the source position of the jump or 0. */
4818 check_previous_goto_1 (tree decl,
4819 struct cp_binding_level* level,
4826 struct cp_binding_level *b = current_binding_level;
4827 for (; b; b = b->level_chain)
4829 tree new_decls = b->names;
4830 tree old_decls = (b == level ? names : NULL_TREE);
4831 for (; new_decls != old_decls;
4832 new_decls = TREE_CHAIN (new_decls))
4834 int problem = decl_jump_unsafe (new_decls);
4841 pedwarn ("jump to label `%D'", decl);
4843 pedwarn ("jump to case label");
4846 pedwarn_with_file_and_line (file, line, " from here");
4851 cp_error_at (" crosses initialization of `%#D'",
4854 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4860 if ((b->is_try_scope || b->is_catch_scope) && ! saw_eh)
4865 pedwarn ("jump to label `%D'", decl);
4867 pedwarn ("jump to case label");
4870 pedwarn_with_file_and_line (file, line, " from here");
4873 if (b->is_try_scope)
4874 error (" enters try block");
4876 error (" enters catch block");
4883 check_previous_goto (struct named_label_use_list* use)
4885 check_previous_goto_1 (use->label_decl, use->binding_level,
4886 use->names_in_scope, use->filename_o_goto,
4887 use->lineno_o_goto);
4891 check_switch_goto (struct cp_binding_level* level)
4893 check_previous_goto_1 (NULL_TREE, level, level->names, NULL, 0);
4896 /* Check that any previously seen jumps to a newly defined label DECL
4897 are OK. Called by define_label. */
4900 check_previous_gotos (tree decl)
4902 struct named_label_use_list **usep;
4904 if (! TREE_USED (decl))
4907 for (usep = &named_label_uses; *usep; )
4909 struct named_label_use_list *use = *usep;
4910 if (use->label_decl == decl)
4912 check_previous_goto (use);
4916 usep = &(use->next);
4920 /* Check that a new jump to a label DECL is OK. Called by
4921 finish_goto_stmt. */
4924 check_goto (tree decl)
4928 struct named_label_list *lab;
4930 /* We can't know where a computed goto is jumping. So we assume
4932 if (! DECL_P (decl))
4935 /* If the label hasn't been defined yet, defer checking. */
4936 if (! DECL_INITIAL (decl))
4942 for (lab = named_labels; lab; lab = lab->next)
4943 if (decl == lab->label_decl)
4946 /* If the label is not on named_labels it's a gcc local label, so
4947 it must be in an outer scope, so jumping to it is always OK. */
4951 if ((lab->in_try_scope || lab->in_catch_scope || lab->bad_decls)
4954 cp_pedwarn_at ("jump to label `%D'", decl);
4955 pedwarn (" from here");
4959 for (bad = lab->bad_decls; bad; bad = TREE_CHAIN (bad))
4961 tree b = TREE_VALUE (bad);
4962 int u = decl_jump_unsafe (b);
4964 if (u > 1 && DECL_ARTIFICIAL (b))
4965 /* Can't skip init of __exception_info. */
4966 cp_error_at (" enters catch block", b);
4968 cp_error_at (" skips initialization of `%#D'", b);
4970 cp_pedwarn_at (" enters scope of non-POD `%#D'", b);
4973 if (lab->in_try_scope)
4974 error (" enters try block");
4975 else if (lab->in_catch_scope)
4976 error (" enters catch block");
4979 /* Define a label, specifying the location in the source file.
4980 Return the LABEL_DECL node for the label, if the definition is valid.
4981 Otherwise return 0. */
4984 define_label (const char* filename, int line, tree name)
4986 tree decl = lookup_label (name);
4987 struct named_label_list *ent;
4988 register struct cp_binding_level *p;
4990 timevar_push (TV_NAME_LOOKUP);
4991 for (ent = named_labels; ent; ent = ent->next)
4992 if (ent->label_decl == decl)
4995 /* After labels, make any new cleanups in the function go into their
4996 own new (temporary) binding contour. */
4997 for (p = current_binding_level; !(p->parm_flag); p = p->level_chain)
4998 p->more_cleanups_ok = 0;
5000 if (name == get_identifier ("wchar_t"))
5001 pedwarn ("label named wchar_t");
5003 if (DECL_INITIAL (decl) != NULL_TREE)
5005 error ("duplicate label `%D'", decl);
5006 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
5010 /* Mark label as having been defined. */
5011 DECL_INITIAL (decl) = error_mark_node;
5012 /* Say where in the source. */
5013 DECL_SOURCE_FILE (decl) = filename;
5014 DECL_SOURCE_LINE (decl) = line;
5017 ent->names_in_scope = current_binding_level->names;
5018 ent->binding_level = current_binding_level;
5020 check_previous_gotos (decl);
5021 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
5023 timevar_pop (TV_NAME_LOOKUP);
5028 struct cp_binding_level *level;
5029 struct cp_switch *next;
5030 /* The SWITCH_STMT being built. */
5032 /* A splay-tree mapping the low element of a case range to the high
5033 element, or NULL_TREE if there is no high element. Used to
5034 determine whether or not a new case label duplicates an old case
5035 label. We need a tree, rather than simply a hash table, because
5036 of the GNU case range extension. */
5040 /* A stack of the currently active switch statements. The innermost
5041 switch statement is on the top of the stack. There is no need to
5042 mark the stack for garbage collection because it is only active
5043 during the processing of the body of a function, and we never
5044 collect at that point. */
5046 static struct cp_switch *switch_stack;
5048 /* Called right after a switch-statement condition is parsed.
5049 SWITCH_STMT is the switch statement being parsed. */
5052 push_switch (tree switch_stmt)
5055 = (struct cp_switch *) xmalloc (sizeof (struct cp_switch));
5056 p->level = current_binding_level;
5057 p->next = switch_stack;
5058 p->switch_stmt = switch_stmt;
5059 p->cases = splay_tree_new (case_compare, NULL, NULL);
5066 struct cp_switch *cs;
5069 splay_tree_delete (cs->cases);
5070 switch_stack = switch_stack->next;
5074 /* Note that we've seen a definition of a case label, and complain if this
5075 is a bad place for one. */
5078 finish_case_label (tree low_value, tree high_value)
5081 register struct cp_binding_level *p;
5086 error ("case label not within a switch statement");
5088 error ("case label `%E' not within a switch statement",
5091 error ("`default' label not within a switch statement");
5095 if (processing_template_decl)
5099 /* For templates, just add the case label; we'll do semantic
5100 analysis at instantiation-time. */
5101 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
5102 return add_stmt (build_case_label (low_value, high_value, label));
5105 /* Find the condition on which this switch statement depends. */
5106 cond = SWITCH_COND (switch_stack->switch_stmt);
5107 if (cond && TREE_CODE (cond) == TREE_LIST)
5108 cond = TREE_VALUE (cond);
5110 r = c_add_case_label (switch_stack->cases, cond, low_value, high_value);
5112 check_switch_goto (switch_stack->level);
5114 /* After labels, make any new cleanups in the function go into their
5115 own new (temporary) binding contour. */
5116 for (p = current_binding_level; !(p->parm_flag); p = p->level_chain)
5117 p->more_cleanups_ok = 0;
5122 /* Return the list of declarations of the current level.
5123 Note that this list is in reverse order unless/until
5124 you nreverse it; and when you do nreverse it, you must
5125 store the result back using `storedecls' or you will lose. */
5130 return current_binding_level->names;
5133 /* Return the list of type-tags (for structs, etc) of the current level. */
5138 return current_binding_level->tags;
5141 /* Store the list of declarations of the current level.
5142 This is done for the parameter declarations of a function being defined,
5143 after they are modified in the light of any missing parameters. */
5146 storedecls (tree decls)
5148 current_binding_level->names = decls;
5151 /* Similarly, store the list of tags of the current level. */
5154 storetags (tree tags)
5156 current_binding_level->tags = tags;
5159 /* Return the type that should be used when TYPE's name is preceded
5160 by a tag such as 'struct' or 'union', or null if the name cannot
5161 be used in this way.
5163 For example, when processing the third line of:
5169 lookup of A will find the typedef. Given A's typedef, this function
5170 will return the type associated with "struct A". For the tag to be
5171 anything other than TYPE, TYPE must be a typedef whose original type
5172 has the same name and context as TYPE itself.
5174 It is not valid for a typedef of an anonymous type to be used with
5177 typedef struct { ... } B;
5180 Return null for this case. */
5183 follow_tag_typedef (tree type)
5187 original = original_type (type);
5188 if (! TYPE_NAME (original))
5190 if (TYPE_IDENTIFIER (original) == TYPE_IDENTIFIER (type)
5191 && (CP_DECL_CONTEXT (TYPE_NAME (original))
5192 == CP_DECL_CONTEXT (TYPE_NAME (type)))
5193 && !(CLASS_TYPE_P (original) && TYPE_WAS_ANONYMOUS (original)))
5199 /* Given NAME, an IDENTIFIER_NODE,
5200 return the structure (or union or enum) definition for that name.
5201 Searches binding levels from BINDING_LEVEL up to the global level.
5202 If THISLEVEL_ONLY is nonzero, searches only the specified context
5203 (but skips any tag-transparent contexts to find one that is
5204 meaningful for tags).
5205 FORM says which kind of type the caller wants;
5206 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5207 If the wrong kind of type is found, and it's not a template, an error is
5211 lookup_tag (enum tree_code form,
5213 struct cp_binding_level* binding_level,
5216 register struct cp_binding_level *level;
5217 /* Nonzero if, we should look past a template parameter level, even
5218 if THISLEVEL_ONLY. */
5219 int allow_template_parms_p = 1;
5221 timevar_push (TV_NAME_LOOKUP);
5222 for (level = binding_level; level; level = level->level_chain)
5225 if (ANON_AGGRNAME_P (name))
5226 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5228 /* There's no need for error checking here, because
5229 anon names are unique throughout the compilation. */
5230 if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
5231 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_VALUE (tail));
5233 else if (level->namespace_p)
5234 /* Do namespace lookup. */
5235 for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
5237 tree old = binding_for_name (name, tail);
5239 /* If we just skipped past a template parameter level,
5240 even though THISLEVEL_ONLY, and we find a template
5241 class declaration, then we use the _TYPE node for the
5242 template. See the example below. */
5243 if (thislevel_only && !allow_template_parms_p
5244 && old && BINDING_VALUE (old)
5245 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
5246 old = TREE_TYPE (BINDING_VALUE (old));
5248 old = BINDING_TYPE (old);
5252 /* We've found something at this binding level. If it is
5253 a typedef, extract the tag it refers to. Lookup fails
5254 if the typedef doesn't refer to a taggable type. */
5255 old = follow_tag_typedef (old);
5257 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
5258 if (TREE_CODE (old) != form
5259 && (form == ENUMERAL_TYPE
5260 || TREE_CODE (old) == ENUMERAL_TYPE))
5262 error ("`%#D' redeclared as %C", old, form);
5263 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
5265 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, old);
5267 if (thislevel_only || tail == global_namespace)
5268 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
5271 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5273 if (TREE_PURPOSE (tail) == name)
5275 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
5278 && (form == ENUMERAL_TYPE || code == ENUMERAL_TYPE))
5280 /* Definition isn't the kind we were looking for. */
5281 error ("`%#D' redeclared as %C", TREE_VALUE (tail), form);
5282 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
5284 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_VALUE (tail));
5287 if (thislevel_only && ! level->tag_transparent)
5289 if (level->template_parms_p && allow_template_parms_p)
5291 /* We must deal with cases like this:
5293 template <class T> struct S;
5294 template <class T> struct S {};
5296 When looking up `S', for the second declaration, we
5297 would like to find the first declaration. But, we
5298 are in the pseudo-global level created for the
5299 template parameters, rather than the (surrounding)
5300 namespace level. Thus, we keep going one more level,
5301 even though THISLEVEL_ONLY is nonzero. */
5302 allow_template_parms_p = 0;
5306 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
5309 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
5312 /* Given a type, find the tag that was defined for it and return the tag name.
5313 Otherwise return 0. However, the value can never be 0
5314 in the cases in which this is used.
5316 C++: If NAME is nonzero, this is the new name to install. This is
5317 done when replacing anonymous tags with real tag names. */
5320 lookup_tag_reverse (tree type, tree name)
5322 register struct cp_binding_level *level;
5324 timevar_push (TV_NAME_LOOKUP);
5325 for (level = current_binding_level; level; level = level->level_chain)
5328 for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5330 if (TREE_VALUE (tail) == type)
5333 TREE_PURPOSE (tail) = name;
5334 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_PURPOSE (tail));
5338 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
5341 /* Look up NAME in the NAMESPACE. */
5344 lookup_namespace_name (tree namespace, tree name)
5347 tree template_id = NULL_TREE;
5349 timevar_push (TV_NAME_LOOKUP);
5350 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5352 if (TREE_CODE (name) == NAMESPACE_DECL)
5353 /* This happens for A::B<int> when B is a namespace. */
5354 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, name);
5355 else if (TREE_CODE (name) == TEMPLATE_DECL)
5357 /* This happens for A::B where B is a template, and there are no
5358 template arguments. */
5359 error ("invalid use of `%D'", name);
5360 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
5363 namespace = ORIGINAL_NAMESPACE (namespace);
5365 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5368 name = TREE_OPERAND (name, 0);
5369 if (TREE_CODE (name) == OVERLOAD)
5370 name = DECL_NAME (OVL_CURRENT (name));
5371 else if (DECL_P (name))
5372 name = DECL_NAME (name);
5375 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5377 val = make_node (CPLUS_BINDING);
5378 if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5379 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
5381 if (BINDING_VALUE (val))
5383 val = BINDING_VALUE (val);
5387 if (DECL_CLASS_TEMPLATE_P (val))
5388 val = lookup_template_class (val,
5389 TREE_OPERAND (template_id, 1),
5390 /*in_decl=*/NULL_TREE,
5391 /*context=*/NULL_TREE,
5392 /*entering_scope=*/0,
5393 tf_error | tf_warning);
5394 else if (DECL_FUNCTION_TEMPLATE_P (val)
5395 || TREE_CODE (val) == OVERLOAD)
5396 val = lookup_template_function (val,
5397 TREE_OPERAND (template_id, 1));
5400 error ("`%D::%D' is not a template",
5402 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
5406 /* If we have a single function from a using decl, pull it out. */
5407 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5408 val = OVL_FUNCTION (val);
5410 /* Ignore built-in functions that haven't been prototyped yet. */
5411 if (!val || !DECL_P(val)
5412 || !DECL_LANG_SPECIFIC(val)
5413 || !DECL_ANTICIPATED (val))
5414 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
5417 error ("`%D' undeclared in namespace `%D'", name, namespace);
5418 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
5421 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5424 typename_hash (const void* k)
5429 hash = (htab_hash_pointer (TYPE_CONTEXT (t))
5430 ^ htab_hash_pointer (DECL_NAME (TYPE_NAME (t))));
5435 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5438 typename_compare (const void * k1, const void * k2)
5447 d1 = TYPE_NAME (t1);
5448 d2 = TYPE_NAME (t2);
5450 return (DECL_NAME (d1) == DECL_NAME (d2)
5451 && TYPE_CONTEXT (t1) == TYPE_CONTEXT (t2)
5452 && ((TREE_TYPE (t1) != NULL_TREE)
5453 == (TREE_TYPE (t2) != NULL_TREE))
5454 && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5455 && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5458 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5459 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5460 is non-NULL, this type is being created by the implicit typename
5461 extension, and BASE_TYPE is a type named `t' in some base class of
5462 `T' which depends on template parameters.
5464 Returns the new TYPENAME_TYPE. */
5466 static GTY ((param_is (union tree_node))) htab_t typename_htab;
5469 build_typename_type (tree context, tree name, tree fullname)
5475 if (typename_htab == NULL)
5477 typename_htab = htab_create_ggc (61, &typename_hash,
5478 &typename_compare, NULL);
5481 /* Build the TYPENAME_TYPE. */
5482 t = make_aggr_type (TYPENAME_TYPE);
5483 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5484 TYPENAME_TYPE_FULLNAME (t) = fullname;
5486 /* Build the corresponding TYPE_DECL. */
5487 d = build_decl (TYPE_DECL, name, t);
5488 TYPE_NAME (TREE_TYPE (d)) = d;
5489 TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5490 DECL_CONTEXT (d) = FROB_CONTEXT (context);
5491 DECL_ARTIFICIAL (d) = 1;
5493 /* See if we already have this type. */
5494 e = htab_find_slot (typename_htab, t, INSERT);
5503 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5504 unless an error occurs, in which case error_mark_node is returned.
5505 If we locate a non-artificial TYPE_DECL and TF_KEEP_TYPE_DECL is
5506 set, we return that, rather than the _TYPE it corresponds to, in
5507 other cases we look through the type decl. If TF_ERROR is set,
5508 complain about errors, otherwise be quiet. */
5511 make_typename_type (tree context, tree name, tsubst_flags_t complain)
5517 if (!(TYPE_LANG_SPECIFIC (name)
5518 && (CLASSTYPE_IS_TEMPLATE (name)
5519 || CLASSTYPE_USE_TEMPLATE (name))))
5520 name = TYPE_IDENTIFIER (name);
5522 /* Create a TEMPLATE_ID_EXPR for the type. */
5523 name = build_nt (TEMPLATE_ID_EXPR,
5524 CLASSTYPE_TI_TEMPLATE (name),
5525 CLASSTYPE_TI_ARGS (name));
5527 else if (TREE_CODE (name) == TYPE_DECL)
5528 name = DECL_NAME (name);
5532 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5534 name = TREE_OPERAND (name, 0);
5535 if (TREE_CODE (name) == TEMPLATE_DECL)
5536 name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5538 if (TREE_CODE (name) == TEMPLATE_DECL)
5540 error ("`%D' used without template parameters", name);
5541 return error_mark_node;
5543 if (TREE_CODE (name) != IDENTIFIER_NODE)
5546 if (TREE_CODE (context) == NAMESPACE_DECL)
5548 /* We can get here from typename_sub0 in the explicit_template_type
5549 expansion. Just fail. */
5550 if (complain & tf_error)
5551 error ("no class template named `%#T' in `%#T'",
5553 return error_mark_node;
5556 if (! uses_template_parms (context)
5557 || currently_open_class (context))
5559 if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5561 tree tmpl = NULL_TREE;
5562 if (IS_AGGR_TYPE (context))
5563 tmpl = lookup_field (context, name, 0, false);
5564 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5566 if (complain & tf_error)
5567 error ("no class template named `%#T' in `%#T'",
5569 return error_mark_node;
5572 if (complain & tf_error)
5574 if (complain & tf_parsing)
5575 perform_or_defer_access_check (context, tmpl);
5577 enforce_access (context, tmpl);
5580 return lookup_template_class (tmpl,
5581 TREE_OPERAND (fullname, 1),
5583 /*entering_scope=*/0,
5584 tf_error | tf_warning);
5590 if (!IS_AGGR_TYPE (context))
5592 if (complain & tf_error)
5593 error ("no type named `%#T' in `%#T'", name, context);
5594 return error_mark_node;
5597 t = lookup_field (context, name, 0, true);
5600 if (TREE_CODE (t) != TYPE_DECL)
5602 if (complain & tf_error)
5603 error ("no type named `%#T' in `%#T'", name, context);
5604 return error_mark_node;
5607 if (complain & tf_error)
5609 if (complain & tf_parsing)
5610 perform_or_defer_access_check (context, t);
5612 enforce_access (context, t);
5615 if (DECL_ARTIFICIAL (t) || !(complain & tf_keep_type_decl))
5623 /* If the CONTEXT is not a template type, then either the field is
5624 there now or its never going to be. */
5625 if (!uses_template_parms (context))
5627 if (complain & tf_error)
5628 error ("no type named `%#T' in `%#T'", name, context);
5629 return error_mark_node;
5632 return build_typename_type (context, name, fullname);
5635 /* Resolve `CONTEXT::template NAME'. Returns an appropriate type,
5636 unless an error occurs, in which case error_mark_node is returned.
5637 If we locate a TYPE_DECL, we return that, rather than the _TYPE it
5638 corresponds to. If COMPLAIN zero, don't complain about any errors
5642 make_unbound_class_template (tree context, tree name, tsubst_flags_t complain)
5648 name = TYPE_IDENTIFIER (name);
5649 else if (DECL_P (name))
5650 name = DECL_NAME (name);
5651 if (TREE_CODE (name) != IDENTIFIER_NODE)
5654 if (!uses_template_parms (context)
5655 || currently_open_class (context))
5657 tree tmpl = NULL_TREE;
5659 if (IS_AGGR_TYPE (context))
5660 tmpl = lookup_field (context, name, 0, false);
5662 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5664 if (complain & tf_error)
5665 error ("no class template named `%#T' in `%#T'", name, context);
5666 return error_mark_node;
5669 if (complain & tf_error)
5671 if (complain & tf_parsing)
5672 perform_or_defer_access_check (context, tmpl);
5674 enforce_access (context, tmpl);
5680 /* Build the UNBOUND_CLASS_TEMPLATE. */
5681 t = make_aggr_type (UNBOUND_CLASS_TEMPLATE);
5682 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5683 TREE_TYPE (t) = NULL_TREE;
5685 /* Build the corresponding TEMPLATE_DECL. */
5686 d = build_decl (TEMPLATE_DECL, name, t);
5687 TYPE_NAME (TREE_TYPE (d)) = d;
5688 TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5689 DECL_CONTEXT (d) = FROB_CONTEXT (context);
5690 DECL_ARTIFICIAL (d) = 1;
5695 /* Select the right _DECL from multiple choices. */
5698 select_decl (tree binding, int flags)
5701 val = BINDING_VALUE (binding);
5703 timevar_push (TV_NAME_LOOKUP);
5704 if (LOOKUP_NAMESPACES_ONLY (flags))
5706 /* We are not interested in types. */
5707 if (val && TREE_CODE (val) == NAMESPACE_DECL)
5708 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
5709 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
5712 /* If we could have a type and
5713 we have nothing or we need a type and have none. */
5714 if (BINDING_TYPE (binding)
5715 && (!val || ((flags & LOOKUP_PREFER_TYPES)
5716 && TREE_CODE (val) != TYPE_DECL)))
5717 val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5718 /* Don't return non-types if we really prefer types. */
5719 else if (val && LOOKUP_TYPES_ONLY (flags) && TREE_CODE (val) != TYPE_DECL
5720 && (TREE_CODE (val) != TEMPLATE_DECL
5721 || !DECL_CLASS_TEMPLATE_P (val)))
5724 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
5727 /* Unscoped lookup of a global: iterate over current namespaces,
5728 considering using-directives. If SPACESP is non-NULL, store a list
5729 of the namespaces we've considered in it. */
5732 unqualified_namespace_lookup (tree name, int flags, tree* spacesp)
5734 tree b = make_node (CPLUS_BINDING);
5735 tree initial = current_decl_namespace ();
5736 tree scope = initial;
5738 struct cp_binding_level *level;
5739 tree val = NULL_TREE;
5741 timevar_push (TV_NAME_LOOKUP);
5743 *spacesp = NULL_TREE;
5745 for (; !val; scope = CP_DECL_CONTEXT (scope))
5748 *spacesp = tree_cons (scope, NULL_TREE, *spacesp);
5749 val = binding_for_name (name, scope);
5751 /* Ignore anticipated built-in functions. */
5752 if (val && BINDING_VALUE (val)
5753 && DECL_P (BINDING_VALUE (val))
5754 && DECL_LANG_SPECIFIC (BINDING_VALUE (val))
5755 && DECL_ANTICIPATED (BINDING_VALUE (val)))
5757 BINDING_VALUE (b) = NULL_TREE;
5758 BINDING_TYPE (b) = NULL_TREE;
5762 /* Initialize binding for this context. */
5763 BINDING_VALUE (b) = BINDING_VALUE (val);
5764 BINDING_TYPE (b) = BINDING_TYPE (val);
5767 /* Add all _DECLs seen through local using-directives. */
5768 for (level = current_binding_level;
5769 !level->namespace_p;
5770 level = level->level_chain)
5771 if (!lookup_using_namespace (name, b, level->using_directives,
5772 scope, flags, spacesp))
5773 /* Give up because of error. */
5774 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
5776 /* Add all _DECLs seen through global using-directives. */
5777 /* XXX local and global using lists should work equally. */
5781 if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5782 scope, flags, spacesp))
5783 /* Give up because of error. */
5784 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
5785 if (siter == scope) break;
5786 siter = CP_DECL_CONTEXT (siter);
5789 val = select_decl (b, flags);
5790 if (scope == global_namespace)
5793 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
5796 /* Combine prefer_type and namespaces_only into flags. */
5799 lookup_flags (int prefer_type, int namespaces_only)
5801 if (namespaces_only)
5802 return LOOKUP_PREFER_NAMESPACES;
5803 if (prefer_type > 1)
5804 return LOOKUP_PREFER_TYPES;
5805 if (prefer_type > 0)
5806 return LOOKUP_PREFER_BOTH;
5810 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5811 ignore it or not. Subroutine of lookup_name_real. */
5814 qualify_lookup (tree val, int flags)
5816 if (val == NULL_TREE)
5818 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5820 if ((flags & LOOKUP_PREFER_TYPES) && TREE_CODE (val) == TYPE_DECL)
5822 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
5827 /* Look up NAME (an IDENTIFIER_NODE) in SCOPE (either a NAMESPACE_DECL
5828 or a class TYPE). If IS_TYPE_P is TRUE, then ignore non-type
5831 Returns a DECL (or OVERLOAD, or BASELINK) representing the
5832 declaration found. */
5835 lookup_qualified_name (tree scope, tree name, bool is_type_p, int flags)
5837 if (TREE_CODE (scope) == NAMESPACE_DECL)
5841 val = make_node (CPLUS_BINDING);
5842 flags |= LOOKUP_COMPLAIN;
5844 flags |= LOOKUP_PREFER_TYPES;
5845 if (!qualified_lookup_using_namespace (name, scope, val, flags))
5847 return select_decl (val, flags);
5850 return lookup_member (scope, name, 0, is_type_p);
5853 /* Check to see whether or not DECL is a variable that would have been
5854 in scope under the ARM, but is not in scope under the ANSI/ISO
5855 standard. If so, issue an error message. If name lookup would
5856 work in both cases, but return a different result, this function
5857 returns the result of ANSI/ISO lookup. Otherwise, it returns
5861 check_for_out_of_scope_variable (tree decl)
5865 /* We only care about out of scope variables. */
5866 if (!(TREE_CODE (decl) == VAR_DECL && DECL_DEAD_FOR_LOCAL (decl)))
5869 shadowed = DECL_SHADOWED_FOR_VAR (decl);
5870 while (shadowed != NULL_TREE && TREE_CODE (shadowed) == VAR_DECL
5871 && DECL_DEAD_FOR_LOCAL (shadowed))
5872 shadowed = DECL_SHADOWED_FOR_VAR (shadowed);
5874 shadowed = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (decl));
5877 if (!DECL_ERROR_REPORTED (decl))
5879 warning ("name lookup of `%D' changed",
5881 cp_warning_at (" matches this `%D' under ISO standard rules",
5883 cp_warning_at (" matches this `%D' under old rules", decl);
5884 DECL_ERROR_REPORTED (decl) = 1;
5889 /* If we have already complained about this declaration, there's no
5890 need to do it again. */
5891 if (DECL_ERROR_REPORTED (decl))
5894 DECL_ERROR_REPORTED (decl) = 1;
5895 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
5897 error ("name lookup of `%D' changed for new ISO `for' scoping",
5899 cp_error_at (" cannot use obsolete binding at `%D' because it has a destructor", decl);
5900 return error_mark_node;
5904 pedwarn ("name lookup of `%D' changed for new ISO `for' scoping",
5906 cp_pedwarn_at (" using obsolete binding at `%D'", decl);
5912 /* Look up NAME in the current binding level and its superiors in the
5913 namespace of variables, functions and typedefs. Return a ..._DECL
5914 node of some kind representing its definition if there is only one
5915 such declaration, or return a TREE_LIST with all the overloaded
5916 definitions if there are many, or return 0 if it is undefined.
5918 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5919 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5920 Otherwise we prefer non-TYPE_DECLs.
5922 If NONCLASS is nonzero, we don't look for the NAME in class scope,
5923 using IDENTIFIER_CLASS_VALUE. */
5926 lookup_name_real (tree name,
5929 int namespaces_only,
5933 tree val = NULL_TREE;
5935 timevar_push (TV_NAME_LOOKUP);
5936 /* Conversion operators are handled specially because ordinary
5937 unqualified name lookup will not find template conversion
5939 if (IDENTIFIER_TYPENAME_P (name))
5941 struct cp_binding_level *level;
5943 for (level = current_binding_level;
5944 level && !level->namespace_p;
5945 level = level->level_chain)
5950 /* A conversion operator can only be declared in a class
5952 if (level->parm_flag != 2)
5955 /* Lookup the conversion operator in the class. */
5956 class_type = level->this_class;
5957 operators = lookup_fnfields (class_type, name, /*protect=*/0);
5959 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, operators);
5962 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
5965 flags |= lookup_flags (prefer_type, namespaces_only);
5967 /* First, look in non-namespace scopes. */
5969 if (current_class_type == NULL_TREE)
5972 for (t = IDENTIFIER_BINDING (name); t; t = TREE_CHAIN (t))
5976 if (!LOCAL_BINDING_P (t) && nonclass)
5977 /* We're not looking for class-scoped bindings, so keep going. */
5980 /* If this is the kind of thing we're looking for, we're done. */
5981 if (qualify_lookup (BINDING_VALUE (t), flags))
5982 binding = BINDING_VALUE (t);
5983 else if ((flags & LOOKUP_PREFER_TYPES)
5984 && qualify_lookup (BINDING_TYPE (t), flags))
5985 binding = BINDING_TYPE (t);
5987 binding = NULL_TREE;
5996 /* Now lookup in namespace scopes. */
5999 t = unqualified_namespace_lookup (name, flags, 0);
6006 /* If we have a single function from a using decl, pull it out. */
6007 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
6008 val = OVL_FUNCTION (val);
6011 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
6015 lookup_name_nonclass (tree name)
6017 return lookup_name_real (name, 0, 1, 0, LOOKUP_COMPLAIN);
6021 lookup_function_nonclass (tree name, tree args)
6023 return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
6027 lookup_name (tree name, int prefer_type)
6029 return lookup_name_real (name, prefer_type, 0, 0, LOOKUP_COMPLAIN);
6032 /* Similar to `lookup_name' but look only in the innermost non-class
6036 lookup_name_current_level (tree name)
6038 struct cp_binding_level *b;
6041 timevar_push (TV_NAME_LOOKUP);
6042 b = current_binding_level;
6043 while (b->parm_flag == 2)
6048 t = IDENTIFIER_NAMESPACE_VALUE (name);
6050 /* extern "C" function() */
6051 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
6054 else if (IDENTIFIER_BINDING (name)
6055 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
6059 if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
6060 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, IDENTIFIER_VALUE (name));
6069 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
6072 /* Like lookup_name_current_level, but for types. */
6075 lookup_type_current_level (tree name)
6077 register tree t = NULL_TREE;
6079 timevar_push (TV_NAME_LOOKUP);
6080 my_friendly_assert (! current_binding_level->namespace_p, 980716);
6082 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
6083 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
6085 struct cp_binding_level *b = current_binding_level;
6088 if (purpose_member (name, b->type_shadowed))
6089 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP,
6090 REAL_IDENTIFIER_TYPE_VALUE (name));
6098 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
6102 /* Push the declarations of builtin types into the namespace.
6103 RID_INDEX is the index of the builtin type
6104 in the array RID_POINTERS. NAME is the name used when looking
6105 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6108 record_builtin_type (enum rid rid_index,
6112 tree rname = NULL_TREE, tname = NULL_TREE;
6113 tree tdecl = NULL_TREE;
6115 if ((int) rid_index < (int) RID_MAX)
6116 rname = ridpointers[(int) rid_index];
6118 tname = get_identifier (name);
6122 tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
6123 set_identifier_type_value (tname, NULL_TREE);
6124 if ((int) rid_index < (int) RID_MAX)
6125 /* Built-in types live in the global namespace. */
6126 SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
6128 if (rname != NULL_TREE)
6130 if (tname != NULL_TREE)
6132 set_identifier_type_value (rname, NULL_TREE);
6133 SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
6137 tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
6138 set_identifier_type_value (rname, NULL_TREE);
6143 /* Record one of the standard Java types.
6144 * Declare it as having the given NAME.
6145 * If SIZE > 0, it is the size of one of the integral types;
6146 * otherwise it is the negative of the size of one of the other types. */
6149 record_builtin_java_type (const char* name, int size)
6153 type = make_signed_type (size);
6154 else if (size > -32)
6155 { /* "__java_char" or ""__java_boolean". */
6156 type = make_unsigned_type (-size);
6157 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6160 { /* "__java_float" or ""__java_double". */
6161 type = make_node (REAL_TYPE);
6162 TYPE_PRECISION (type) = - size;
6165 record_builtin_type (RID_MAX, name, type);
6166 decl = TYPE_NAME (type);
6168 /* Suppress generate debug symbol entries for these types,
6169 since for normal C++ they are just clutter.
6170 However, push_lang_context undoes this if extern "Java" is seen. */
6171 DECL_IGNORED_P (decl) = 1;
6173 TYPE_FOR_JAVA (type) = 1;
6177 /* Push a type into the namespace so that the back-ends ignore it. */
6180 record_unknown_type (tree type, const char* name)
6182 tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
6183 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6184 DECL_IGNORED_P (decl) = 1;
6185 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
6186 TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
6187 TYPE_ALIGN (type) = 1;
6188 TYPE_USER_ALIGN (type) = 0;
6189 TYPE_MODE (type) = TYPE_MODE (void_type_node);
6192 /* An string for which we should create an IDENTIFIER_NODE at
6195 typedef struct predefined_identifier
6197 /* The name of the identifier. */
6198 const char *const name;
6199 /* The place where the IDENTIFIER_NODE should be stored. */
6201 /* Nonzero if this is the name of a constructor or destructor. */
6202 const int ctor_or_dtor_p;
6203 } predefined_identifier;
6205 /* Create all the predefined identifiers. */
6208 initialize_predefined_identifiers (void)
6210 const predefined_identifier *pid;
6212 /* A table of identifiers to create at startup. */
6213 static const predefined_identifier predefined_identifiers[] = {
6214 { "C++", &lang_name_cplusplus, 0 },
6215 { "C", &lang_name_c, 0 },
6216 { "Java", &lang_name_java, 0 },
6217 { CTOR_NAME, &ctor_identifier, 1 },
6218 { "__base_ctor", &base_ctor_identifier, 1 },
6219 { "__comp_ctor", &complete_ctor_identifier, 1 },
6220 { DTOR_NAME, &dtor_identifier, 1 },
6221 { "__comp_dtor", &complete_dtor_identifier, 1 },
6222 { "__base_dtor", &base_dtor_identifier, 1 },
6223 { "__deleting_dtor", &deleting_dtor_identifier, 1 },
6224 { IN_CHARGE_NAME, &in_charge_identifier, 0 },
6225 { "nelts", &nelts_identifier, 0 },
6226 { THIS_NAME, &this_identifier, 0 },
6227 { VTABLE_DELTA_NAME, &delta_identifier, 0 },
6228 { VTABLE_PFN_NAME, &pfn_identifier, 0 },
6229 { "_vptr", &vptr_identifier, 0 },
6230 { "__vtt_parm", &vtt_parm_identifier, 0 },
6231 { "std", &std_identifier, 0 },
6235 for (pid = predefined_identifiers; pid->name; ++pid)
6237 *pid->node = get_identifier (pid->name);
6238 if (pid->ctor_or_dtor_p)
6239 IDENTIFIER_CTOR_OR_DTOR_P (*pid->node) = 1;
6243 /* Create the predefined scalar types of C,
6244 and some nodes representing standard constants (0, 1, (void *)0).
6245 Initialize the global binding level.
6246 Make definitions for built-in primitive functions. */
6249 cxx_init_decl_processing (void)
6252 tree void_ftype_ptr;
6254 /* Create all the identifiers we need. */
6255 initialize_predefined_identifiers ();
6257 /* Fill in back-end hooks. */
6258 lang_missing_noreturn_ok_p = &cp_missing_noreturn_ok_p;
6260 /* Create the global variables. */
6261 push_to_top_level ();
6263 /* Enter the global namespace. */
6264 my_friendly_assert (global_namespace == NULL_TREE, 375);
6265 push_namespace (get_identifier ("::"));
6266 global_namespace = current_namespace;
6267 current_lang_name = NULL_TREE;
6269 /* Adjust various flags based on command-line settings. */
6270 if (! flag_permissive && ! pedantic)
6271 flag_pedantic_errors = 1;
6272 if (!flag_no_inline)
6274 flag_inline_trees = 1;
6277 if (flag_inline_functions)
6279 flag_inline_trees = 2;
6280 flag_inline_functions = 0;
6283 /* Force minimum function alignment if using the least significant
6284 bit of function pointers to store the virtual bit. */
6285 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
6286 && force_align_functions_log < 1)
6287 force_align_functions_log = 1;
6290 current_lang_name = lang_name_c;
6292 current_function_decl = NULL_TREE;
6293 current_binding_level = NULL_BINDING_LEVEL;
6294 free_binding_level = NULL_BINDING_LEVEL;
6296 build_common_tree_nodes (flag_signed_char);
6298 error_mark_list = build_tree_list (error_mark_node, error_mark_node);
6299 TREE_TYPE (error_mark_list) = error_mark_node;
6301 /* Make the binding_level structure for global names. */
6303 global_binding_level = current_binding_level;
6304 /* The global level is the namespace level of ::. */
6305 NAMESPACE_LEVEL (global_namespace) = global_binding_level;
6306 declare_namespace_level ();
6308 /* Create the `std' namespace. */
6309 push_namespace (std_identifier);
6310 std_node = current_namespace;
6313 c_common_nodes_and_builtins ();
6315 java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6316 java_short_type_node = record_builtin_java_type ("__java_short", 16);
6317 java_int_type_node = record_builtin_java_type ("__java_int", 32);
6318 java_long_type_node = record_builtin_java_type ("__java_long", 64);
6319 java_float_type_node = record_builtin_java_type ("__java_float", -32);
6320 java_double_type_node = record_builtin_java_type ("__java_double", -64);
6321 java_char_type_node = record_builtin_java_type ("__java_char", -16);
6322 java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6324 integer_two_node = build_int_2 (2, 0);
6325 TREE_TYPE (integer_two_node) = integer_type_node;
6326 integer_three_node = build_int_2 (3, 0);
6327 TREE_TYPE (integer_three_node) = integer_type_node;
6329 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6330 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6331 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6332 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6333 TYPE_PRECISION (boolean_type_node) = 1;
6334 record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6335 boolean_false_node = build_int_2 (0, 0);
6336 TREE_TYPE (boolean_false_node) = boolean_type_node;
6337 boolean_true_node = build_int_2 (1, 0);
6338 TREE_TYPE (boolean_true_node) = boolean_type_node;
6340 empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE);
6343 record_builtin_type (RID_MAX, NULL, string_type_node);
6346 delta_type_node = ptrdiff_type_node;
6347 vtable_index_type = ptrdiff_type_node;
6349 vtt_parm_type = build_pointer_type (const_ptr_type_node);
6350 void_ftype = build_function_type (void_type_node, void_list_node);
6351 void_ftype_ptr = build_function_type (void_type_node,
6352 tree_cons (NULL_TREE,
6356 = build_exception_variant (void_ftype_ptr, empty_except_spec);
6358 /* C++ extensions */
6360 unknown_type_node = make_node (UNKNOWN_TYPE);
6361 record_unknown_type (unknown_type_node, "unknown type");
6363 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6364 TREE_TYPE (unknown_type_node) = unknown_type_node;
6366 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6368 TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6369 TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6372 /* Make sure we get a unique function type, so we can give
6373 its pointer type a name. (This wins for gdb.) */
6374 tree vfunc_type = make_node (FUNCTION_TYPE);
6375 TREE_TYPE (vfunc_type) = integer_type_node;
6376 TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6377 layout_type (vfunc_type);
6379 vtable_entry_type = build_pointer_type (vfunc_type);
6381 record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6384 = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6385 layout_type (vtbl_type_node);
6386 vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6387 record_builtin_type (RID_MAX, NULL, vtbl_type_node);
6388 vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6389 layout_type (vtbl_ptr_type_node);
6390 record_builtin_type (RID_MAX, NULL, vtbl_ptr_type_node);
6392 push_namespace (get_identifier ("__cxxabiv1"));
6393 abi_node = current_namespace;
6396 global_type_node = make_node (LANG_TYPE);
6397 record_unknown_type (global_type_node, "global type");
6400 current_lang_name = lang_name_cplusplus;
6403 tree bad_alloc_type_node, newtype, deltype;
6404 tree ptr_ftype_sizetype;
6406 push_namespace (std_identifier);
6408 = xref_tag (class_type, get_identifier ("bad_alloc"),
6409 /*attributes=*/NULL_TREE, 1);
6412 = build_function_type (ptr_type_node,
6413 tree_cons (NULL_TREE,
6416 newtype = build_exception_variant
6417 (ptr_ftype_sizetype, add_exception_specifier
6418 (NULL_TREE, bad_alloc_type_node, -1));
6419 deltype = build_exception_variant (void_ftype_ptr, empty_except_spec);
6420 push_cp_library_fn (NEW_EXPR, newtype);
6421 push_cp_library_fn (VEC_NEW_EXPR, newtype);
6422 global_delete_fndecl = push_cp_library_fn (DELETE_EXPR, deltype);
6423 push_cp_library_fn (VEC_DELETE_EXPR, deltype);
6427 = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype);
6429 /* Perform other language dependent initializations. */
6430 init_class_processing ();
6431 init_search_processing ();
6432 init_rtti_processing ();
6434 if (flag_exceptions)
6435 init_exception_processing ();
6437 if (! supports_one_only ())
6440 make_fname_decl = cp_make_fname_decl;
6441 start_fname_decls ();
6443 /* Show we use EH for cleanups. */
6444 using_eh_for_cleanups ();
6446 /* Maintain consistency. Perhaps we should just complain if they
6447 say -fwritable-strings? */
6448 if (flag_writable_strings)
6449 flag_const_strings = 0;
6452 /* Generate an initializer for a function naming variable from
6453 NAME. NAME may be NULL, in which case we generate a special
6454 ERROR_MARK node which should be replaced later. */
6457 cp_fname_init (const char* name)
6459 tree domain = NULL_TREE;
6461 tree init = NULL_TREE;
6466 length = strlen (name);
6467 domain = build_index_type (size_int (length));
6468 init = build_string (length + 1, name);
6471 type = build_qualified_type (char_type_node, TYPE_QUAL_CONST);
6472 type = build_cplus_array_type (type, domain);
6475 TREE_TYPE (init) = type;
6477 /* We don't know the value until instantiation time. Make
6478 something which will be digested now, but replaced later. */
6479 init = build (ERROR_MARK, type);
6484 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6485 decl, NAME is the initialization string and TYPE_DEP indicates whether
6486 NAME depended on the type of the function. We make use of that to detect
6487 __PRETTY_FUNCTION__ inside a template fn. This is being done
6488 lazily at the point of first use, so we musn't push the decl now. */
6491 cp_make_fname_decl (tree id, int type_dep)
6493 const char *const name = (type_dep && processing_template_decl
6494 ? NULL : fname_as_string (type_dep));
6495 tree init = cp_fname_init (name);
6496 tree decl = build_decl (VAR_DECL, id, TREE_TYPE (init));
6498 /* As we're using pushdecl_with_scope, we must set the context. */
6499 DECL_CONTEXT (decl) = current_function_decl;
6500 DECL_PRETTY_FUNCTION_P (decl) = type_dep;
6502 TREE_STATIC (decl) = 1;
6503 TREE_READONLY (decl) = 1;
6504 DECL_ARTIFICIAL (decl) = 1;
6505 DECL_INITIAL (decl) = init;
6507 TREE_USED (decl) = 1;
6509 if (current_function_decl)
6511 struct cp_binding_level *b = current_binding_level;
6512 while (b->level_chain->parm_flag == 0)
6514 pushdecl_with_scope (decl, b);
6517 cp_finish_decl (decl, init, NULL_TREE, LOOKUP_ONLYCONVERTING);
6522 /* Make a definition for a builtin function named NAME in the current
6523 namespace, whose data type is TYPE and whose context is CONTEXT.
6524 TYPE should be a function type with argument types.
6526 CLASS and CODE tell later passes how to compile calls to this function.
6527 See tree.h for possible values.
6529 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6530 the name to be called if we can't opencode the function.
6531 If ATTRS is nonzero, use that for the function's attribute
6535 builtin_function_1 (const char* name,
6539 enum built_in_class class,
6540 const char* libname,
6543 tree decl = build_library_fn_1 (get_identifier (name), ERROR_MARK, type);
6544 DECL_BUILT_IN_CLASS (decl) = class;
6545 DECL_FUNCTION_CODE (decl) = code;
6546 DECL_CONTEXT (decl) = context;
6550 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6551 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6552 function in the namespace. */
6554 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (libname));
6555 make_decl_rtl (decl, NULL);
6557 /* Warn if a function in the namespace for users
6558 is used without an occasion to consider it declared. */
6559 if (name[0] != '_' || name[1] != '_')
6560 DECL_ANTICIPATED (decl) = 1;
6562 /* Possibly apply some default attributes to this built-in function. */
6564 decl_attributes (&decl, attrs, ATTR_FLAG_BUILT_IN);
6566 decl_attributes (&decl, NULL_TREE, 0);
6571 /* Entry point for the benefit of c_common_nodes_and_builtins.
6573 Make a defintion for a builtin function named NAME and whose data type
6574 is TYPE. TYPE should be a function type with argument types. This
6575 function places the anticipated declaration in the global namespace
6576 and additionally in the std namespace if appropriate.
6578 CLASS and CODE tell later passes how to compile calls to this function.
6579 See tree.h for possible values.
6581 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6582 the name to be called if we can't opencode the function.
6584 If ATTRS is nonzero, use that for the function's attribute
6588 builtin_function (const char* name,
6591 enum built_in_class class,
6592 const char* libname,
6595 /* All builtins that don't begin with an '_' should additionally
6596 go in the 'std' namespace. */
6599 push_namespace (std_identifier);
6600 builtin_function_1 (name, type, std_node, code, class, libname, attrs);
6604 return builtin_function_1 (name, type, NULL_TREE, code,
6605 class, libname, attrs);
6608 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6609 function. Not called directly. */
6612 build_library_fn_1 (tree name, enum tree_code operator_code, tree type)
6614 tree fn = build_lang_decl (FUNCTION_DECL, name, type);
6615 DECL_EXTERNAL (fn) = 1;
6616 TREE_PUBLIC (fn) = 1;
6617 DECL_ARTIFICIAL (fn) = 1;
6618 TREE_NOTHROW (fn) = 1;
6619 SET_OVERLOADED_OPERATOR_CODE (fn, operator_code);
6620 SET_DECL_LANGUAGE (fn, lang_c);
6624 /* Returns the _DECL for a library function with C linkage.
6625 We assume that such functions never throw; if this is incorrect,
6626 callers should unset TREE_NOTHROW. */
6629 build_library_fn (tree name, tree type)
6631 return build_library_fn_1 (name, ERROR_MARK, type);
6634 /* Returns the _DECL for a library function with C++ linkage. */
6637 build_cp_library_fn (tree name, enum tree_code operator_code, tree type)
6639 tree fn = build_library_fn_1 (name, operator_code, type);
6640 TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type);
6641 DECL_CONTEXT (fn) = FROB_CONTEXT (current_namespace);
6642 SET_DECL_LANGUAGE (fn, lang_cplusplus);
6643 set_mangled_name_for_decl (fn);
6647 /* Like build_library_fn, but takes a C string instead of an
6651 build_library_fn_ptr (const char* name, tree type)
6653 return build_library_fn (get_identifier (name), type);
6656 /* Like build_cp_library_fn, but takes a C string instead of an
6660 build_cp_library_fn_ptr (const char* name, tree type)
6662 return build_cp_library_fn (get_identifier (name), ERROR_MARK, type);
6665 /* Like build_library_fn, but also pushes the function so that we will
6666 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6669 push_library_fn (tree name, tree type)
6671 tree fn = build_library_fn (name, type);
6672 pushdecl_top_level (fn);
6676 /* Like build_cp_library_fn, but also pushes the function so that it
6677 will be found by normal lookup. */
6680 push_cp_library_fn (enum tree_code operator_code, tree type)
6682 tree fn = build_cp_library_fn (ansi_opname (operator_code),
6689 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6693 push_void_library_fn (tree name, tree parmtypes)
6695 tree type = build_function_type (void_type_node, parmtypes);
6696 return push_library_fn (name, type);
6699 /* Like push_library_fn, but also note that this function throws
6700 and does not return. Used for __throw_foo and the like. */
6703 push_throw_library_fn (tree name, tree type)
6705 tree fn = push_library_fn (name, type);
6706 TREE_THIS_VOLATILE (fn) = 1;
6707 TREE_NOTHROW (fn) = 0;
6711 /* Apply default attributes to a function, if a system function with default
6715 cxx_insert_default_attributes (tree decl)
6717 if (!DECL_EXTERN_C_FUNCTION_P (decl))
6719 if (!TREE_PUBLIC (decl))
6721 c_common_insert_default_attributes (decl);
6724 /* When we call finish_struct for an anonymous union, we create
6725 default copy constructors and such. But, an anonymous union
6726 shouldn't have such things; this function undoes the damage to the
6727 anonymous union type T.
6729 (The reason that we create the synthesized methods is that we don't
6730 distinguish `union { int i; }' from `typedef union { int i; } U'.
6731 The first is an anonymous union; the second is just an ordinary
6735 fixup_anonymous_aggr (tree t)
6739 /* Wipe out memory of synthesized methods */
6740 TYPE_HAS_CONSTRUCTOR (t) = 0;
6741 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
6742 TYPE_HAS_INIT_REF (t) = 0;
6743 TYPE_HAS_CONST_INIT_REF (t) = 0;
6744 TYPE_HAS_ASSIGN_REF (t) = 0;
6745 TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
6747 /* Splice the implicitly generated functions out of the TYPE_METHODS
6749 q = &TYPE_METHODS (t);
6752 if (DECL_ARTIFICIAL (*q))
6753 *q = TREE_CHAIN (*q);
6755 q = &TREE_CHAIN (*q);
6758 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6759 if (TYPE_METHODS (t))
6760 cp_error_at ("an anonymous union cannot have function members", t);
6762 /* Anonymous aggregates cannot have fields with ctors, dtors or complex
6763 assignment operators (because they cannot have these methods themselves).
6764 For anonymous unions this is already checked because they are not allowed
6765 in any union, otherwise we have to check it. */
6766 if (TREE_CODE (t) != UNION_TYPE)
6770 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
6771 if (TREE_CODE (field) == FIELD_DECL)
6773 type = TREE_TYPE (field);
6774 if (CLASS_TYPE_P (type))
6776 if (TYPE_NEEDS_CONSTRUCTING (type))
6777 cp_error_at ("member %#D' with constructor not allowed in anonymous aggregate",
6779 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
6780 cp_error_at ("member %#D' with destructor not allowed in anonymous aggregate",
6782 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type))
6783 cp_error_at ("member %#D' with copy assignment operator not allowed in anonymous aggregate",
6790 /* Make sure that a declaration with no declarator is well-formed, i.e.
6791 just declares a tagged type or anonymous union.
6793 Returns the type declared; or NULL_TREE if none. */
6796 check_tag_decl (tree declspecs)
6800 int saw_typedef = 0;
6801 tree ob_modifier = NULL_TREE;
6803 /* If a class, struct, or enum type is declared by the DECLSPECS
6804 (i.e, if a class-specifier, enum-specifier, or non-typename
6805 elaborated-type-specifier appears in the DECLSPECS),
6806 DECLARED_TYPE is set to the corresponding type. */
6807 tree declared_type = NULL_TREE;
6808 bool error_p = false;
6810 for (link = declspecs; link; link = TREE_CHAIN (link))
6812 tree value = TREE_VALUE (link);
6815 || TREE_CODE (value) == TYPE_DECL
6816 || (TREE_CODE (value) == IDENTIFIER_NODE
6817 && IDENTIFIER_GLOBAL_VALUE (value)
6818 && TREE_CODE (IDENTIFIER_GLOBAL_VALUE (value)) == TYPE_DECL))
6822 if (found_type == 2 && TREE_CODE (value) == IDENTIFIER_NODE)
6824 if (! in_system_header)
6825 pedwarn ("redeclaration of C++ built-in type `%T'", value);
6830 && ((TREE_CODE (value) != TYPENAME_TYPE && IS_AGGR_TYPE (value))
6831 || TREE_CODE (value) == ENUMERAL_TYPE))
6833 my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
6834 declared_type = value;
6837 else if (value == ridpointers[(int) RID_TYPEDEF])
6839 else if (value == ridpointers[(int) RID_FRIEND])
6841 if (current_class_type == NULL_TREE
6842 || current_scope () != current_class_type)
6843 ob_modifier = value;
6847 else if (value == ridpointers[(int) RID_STATIC]
6848 || value == ridpointers[(int) RID_EXTERN]
6849 || value == ridpointers[(int) RID_AUTO]
6850 || value == ridpointers[(int) RID_REGISTER]
6851 || value == ridpointers[(int) RID_INLINE]
6852 || value == ridpointers[(int) RID_VIRTUAL]
6853 || value == ridpointers[(int) RID_CONST]
6854 || value == ridpointers[(int) RID_VOLATILE]
6855 || value == ridpointers[(int) RID_EXPLICIT]
6856 || value == ridpointers[(int) RID_THREAD])
6857 ob_modifier = value;
6858 else if (value == error_mark_node)
6863 error ("multiple types in one declaration");
6865 if (declared_type == NULL_TREE && ! saw_friend && !error_p)
6866 pedwarn ("declaration does not declare anything");
6867 /* Check for an anonymous union. */
6868 else if (declared_type && IS_AGGR_TYPE_CODE (TREE_CODE (declared_type))
6869 && TYPE_ANONYMOUS_P (declared_type))
6871 /* 7/3 In a simple-declaration, the optional init-declarator-list
6872 can be omitted only when declaring a class (clause 9) or
6873 enumeration (7.2), that is, when the decl-specifier-seq contains
6874 either a class-specifier, an elaborated-type-specifier with
6875 a class-key (9.1), or an enum-specifier. In these cases and
6876 whenever a class-specifier or enum-specifier is present in the
6877 decl-specifier-seq, the identifiers in these specifiers are among
6878 the names being declared by the declaration (as class-name,
6879 enum-names, or enumerators, depending on the syntax). In such
6880 cases, and except for the declaration of an unnamed bit-field (9.6),
6881 the decl-specifier-seq shall introduce one or more names into the
6882 program, or shall redeclare a name introduced by a previous
6883 declaration. [Example:
6884 enum { }; // ill-formed
6885 typedef class { }; // ill-formed
6889 error ("missing type-name in typedef-declaration");
6892 /* Anonymous unions are objects, so they can have specifiers. */;
6893 SET_ANON_AGGR_TYPE_P (declared_type);
6895 if (TREE_CODE (declared_type) != UNION_TYPE && pedantic
6896 && !in_system_header)
6897 pedwarn ("ISO C++ prohibits anonymous structs");
6900 else if (ob_modifier)
6902 if (ob_modifier == ridpointers[(int) RID_INLINE]
6903 || ob_modifier == ridpointers[(int) RID_VIRTUAL])
6904 error ("`%D' can only be specified for functions", ob_modifier);
6905 else if (ob_modifier == ridpointers[(int) RID_FRIEND])
6906 error ("`%D' can only be specified inside a class", ob_modifier);
6907 else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
6908 error ("`%D' can only be specified for constructors",
6911 error ("`%D' can only be specified for objects and functions",
6915 return declared_type;
6918 /* Called when a declaration is seen that contains no names to declare.
6919 If its type is a reference to a structure, union or enum inherited
6920 from a containing scope, shadow that tag name for the current scope
6921 with a forward reference.
6922 If its type defines a new named structure or union
6923 or defines an enum, it is valid but we need not do anything here.
6924 Otherwise, it is an error.
6926 C++: may have to grok the declspecs to learn about static,
6927 complain for anonymous unions.
6929 Returns the TYPE declared -- or NULL_TREE if none. */
6932 shadow_tag (tree declspecs)
6934 tree t = check_tag_decl (declspecs);
6939 maybe_process_partial_specialization (t);
6941 /* This is where the variables in an anonymous union are
6942 declared. An anonymous union declaration looks like:
6944 because there is no declarator after the union, the parser
6945 sends that declaration here. */
6946 if (ANON_AGGR_TYPE_P (t))
6948 fixup_anonymous_aggr (t);
6950 if (TYPE_FIELDS (t))
6952 tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
6954 finish_anon_union (decl);
6961 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6964 groktypename (tree typename)
6968 if (TREE_CODE (typename) != TREE_LIST)
6970 split_specs_attrs (TREE_PURPOSE (typename), &specs, &attrs);
6971 type = grokdeclarator (TREE_VALUE (typename), specs,
6972 TYPENAME, 0, &attrs);
6974 cplus_decl_attributes (&type, attrs, 0);
6978 /* Decode a declarator in an ordinary declaration or data definition.
6979 This is called as soon as the type information and variable name
6980 have been parsed, before parsing the initializer if any.
6981 Here we create the ..._DECL node, fill in its type,
6982 and put it on the list of decls for the current context.
6983 The ..._DECL node is returned as the value.
6985 Exception: for arrays where the length is not specified,
6986 the type is left null, to be filled in by `cp_finish_decl'.
6988 Function definitions do not come here; they go to start_function
6989 instead. However, external and forward declarations of functions
6990 do go through here. Structure field declarations are done by
6991 grokfield and not through here. */
6994 start_decl (tree declarator,
6998 tree prefix_attributes)
7001 register tree type, tem;
7004 /* This should only be done once on the top most decl. */
7005 if (have_extern_spec)
7007 declspecs = tree_cons (NULL_TREE, get_identifier ("extern"),
7009 have_extern_spec = false;
7012 /* An object declared as __attribute__((deprecated)) suppresses
7013 warnings of uses of other deprecated items. */
7014 if (lookup_attribute ("deprecated", attributes))
7015 deprecated_state = DEPRECATED_SUPPRESS;
7017 attributes = chainon (attributes, prefix_attributes);
7019 decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
7022 deprecated_state = DEPRECATED_NORMAL;
7024 if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
7027 type = TREE_TYPE (decl);
7029 if (type == error_mark_node)
7032 context = DECL_CONTEXT (decl);
7034 if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
7035 && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
7037 /* When parsing the initializer, lookup should use the object's
7039 push_decl_namespace (context);
7042 /* We are only interested in class contexts, later. */
7043 if (context && TREE_CODE (context) == NAMESPACE_DECL)
7044 context = NULL_TREE;
7047 /* Is it valid for this decl to have an initializer at all?
7048 If not, set INITIALIZED to zero, which will indirectly
7049 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7050 switch (TREE_CODE (decl))
7053 error ("typedef `%D' is initialized (use __typeof__ instead)", decl);
7058 error ("function `%#D' is initialized like a variable", decl);
7068 if (! toplevel_bindings_p ()
7069 && DECL_EXTERNAL (decl))
7070 warning ("declaration of `%#D' has `extern' and is initialized",
7072 DECL_EXTERNAL (decl) = 0;
7073 if (toplevel_bindings_p ())
7074 TREE_STATIC (decl) = 1;
7076 /* Tell `pushdecl' this is an initialized decl
7077 even though we don't yet have the initializer expression.
7078 Also tell `cp_finish_decl' it may store the real initializer. */
7079 DECL_INITIAL (decl) = error_mark_node;
7082 /* Set attributes here so if duplicate decl, will have proper attributes. */
7083 cplus_decl_attributes (&decl, attributes, 0);
7085 /* If #pragma weak was used, mark the decl weak now. */
7086 if (current_binding_level == global_binding_level)
7087 maybe_apply_pragma_weak (decl);
7089 if (TREE_CODE (decl) == FUNCTION_DECL
7090 && DECL_DECLARED_INLINE_P (decl)
7091 && DECL_UNINLINABLE (decl)
7092 && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl)))
7093 warning ("%Hinline function '%D' given attribute noinline",
7094 &DECL_SOURCE_LOCATION (decl), decl);
7096 if (context && COMPLETE_TYPE_P (complete_type (context)))
7098 push_nested_class (context);
7100 if (TREE_CODE (decl) == VAR_DECL)
7102 tree field = lookup_field (context, DECL_NAME (decl), 0, false);
7103 if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
7104 error ("`%#D' is not a static member of `%#T'", decl, context);
7107 if (DECL_CONTEXT (field) != context)
7109 if (!same_type_p (DECL_CONTEXT (field), context))
7110 pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7111 DECL_CONTEXT (field), DECL_NAME (decl),
7112 context, DECL_NAME (decl));
7113 DECL_CONTEXT (decl) = DECL_CONTEXT (field);
7115 /* Static data member are tricky; an in-class initialization
7116 still doesn't provide a definition, so the in-class
7117 declaration will have DECL_EXTERNAL set, but will have an
7118 initialization. Thus, duplicate_decls won't warn
7119 about this situation, and so we check here. */
7120 if (DECL_INITIAL (decl) && DECL_INITIAL (field))
7121 error ("duplicate initialization of %D", decl);
7122 if (duplicate_decls (decl, field))
7128 tree field = check_classfn (context, decl);
7129 if (field && duplicate_decls (decl, field))
7133 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7134 DECL_IN_AGGR_P (decl) = 0;
7135 if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
7136 || CLASSTYPE_TEMPLATE_INSTANTIATION (context))
7138 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
7139 /* [temp.expl.spec] An explicit specialization of a static data
7140 member of a template is a definition if the declaration
7141 includes an initializer; otherwise, it is a declaration.
7143 We check for processing_specialization so this only applies
7144 to the new specialization syntax. */
7145 if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
7146 DECL_EXTERNAL (decl) = 1;
7149 if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
7150 pedwarn ("declaration of `%#D' outside of class is not definition",
7154 /* Enter this declaration into the symbol table. */
7155 tem = maybe_push_decl (decl);
7157 if (processing_template_decl)
7158 tem = push_template_decl (tem);
7160 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7161 /* Tell the back-end to use or not use .common as appropriate. If we say
7162 -fconserve-space, we want this to save .data space, at the expense of
7163 wrong semantics. If we say -fno-conserve-space, we want this to
7164 produce errors about redefs; to do this we force variables into the
7166 DECL_COMMON (tem) = ((TREE_CODE (tem) != VAR_DECL
7167 || !DECL_THREAD_LOCAL (tem))
7168 && (flag_conserve_space || ! TREE_PUBLIC (tem)));
7171 if (! processing_template_decl)
7178 start_decl_1 (tree decl)
7180 tree type = TREE_TYPE (decl);
7181 int initialized = (DECL_INITIAL (decl) != NULL_TREE);
7183 if (type == error_mark_node)
7186 maybe_push_cleanup_level (type);
7189 /* Is it valid for this decl to have an initializer at all?
7190 If not, set INITIALIZED to zero, which will indirectly
7191 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7193 /* Don't allow initializations for incomplete types except for
7194 arrays which might be completed by the initialization. */
7195 if (COMPLETE_TYPE_P (complete_type (type)))
7196 ; /* A complete type is ok. */
7197 else if (TREE_CODE (type) != ARRAY_TYPE)
7199 error ("variable `%#D' has initializer but incomplete type",
7202 type = TREE_TYPE (decl) = error_mark_node;
7204 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type))))
7206 if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
7207 error ("elements of array `%#D' have incomplete type", decl);
7208 /* else we already gave an error in start_decl. */
7214 && TREE_CODE (decl) != TYPE_DECL
7215 && TREE_CODE (decl) != TEMPLATE_DECL
7216 && type != error_mark_node
7217 && IS_AGGR_TYPE (type)
7218 && ! DECL_EXTERNAL (decl))
7220 if ((! processing_template_decl || ! uses_template_parms (type))
7221 && !COMPLETE_TYPE_P (complete_type (type)))
7223 error ("aggregate `%#D' has incomplete type and cannot be defined",
7225 /* Change the type so that assemble_variable will give
7226 DECL an rtl we can live with: (mem (const_int 0)). */
7227 type = TREE_TYPE (decl) = error_mark_node;
7231 /* If any base type in the hierarchy of TYPE needs a constructor,
7232 then we set initialized to 1. This way any nodes which are
7233 created for the purposes of initializing this aggregate
7234 will live as long as it does. This is necessary for global
7235 aggregates which do not have their initializers processed until
7236 the end of the file. */
7237 initialized = TYPE_NEEDS_CONSTRUCTING (type);
7242 DECL_INITIAL (decl) = NULL_TREE;
7245 /* Handle initialization of references.
7246 These three arguments are from `cp_finish_decl', and have the
7247 same meaning here that they do there.
7249 Quotes on semantics can be found in ARM 8.4.3. */
7252 grok_reference_init (tree decl, tree type, tree init)
7256 if (init == NULL_TREE)
7258 if ((DECL_LANG_SPECIFIC (decl) == 0
7259 || DECL_IN_AGGR_P (decl) == 0)
7260 && ! DECL_THIS_EXTERN (decl))
7261 error ("`%D' declared as reference but not initialized", decl);
7265 if (TREE_CODE (init) == CONSTRUCTOR)
7267 error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl);
7271 if (TREE_CODE (init) == TREE_LIST)
7272 init = build_compound_expr (init);
7274 if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
7275 init = convert_from_reference (init);
7277 if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
7278 && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
7280 /* Note: default conversion is only called in very special cases. */
7281 init = default_conversion (init);
7284 /* Convert INIT to the reference type TYPE. This may involve the
7285 creation of a temporary, whose lifetime must be the same as that
7286 of the reference. If so, a DECL_STMT for the temporary will be
7287 added just after the DECL_STMT for DECL. That's why we don't set
7288 DECL_INITIAL for local references (instead assigning to them
7289 explicitly); we need to allow the temporary to be initialized
7291 tmp = convert_to_reference
7292 (type, init, CONV_IMPLICIT,
7293 LOOKUP_ONLYCONVERTING|LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND,
7296 if (tmp == error_mark_node)
7298 else if (tmp == NULL_TREE)
7300 error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
7304 if (TREE_STATIC (decl) && !TREE_CONSTANT (tmp))
7307 DECL_INITIAL (decl) = tmp;
7312 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7313 array until we finish parsing the initializer. If that's the
7314 situation we're in, update DECL accordingly. */
7317 maybe_deduce_size_from_array_init (tree decl, tree init)
7319 tree type = TREE_TYPE (decl);
7321 if (TREE_CODE (type) == ARRAY_TYPE
7322 && TYPE_DOMAIN (type) == NULL_TREE
7323 && TREE_CODE (decl) != TYPE_DECL)
7325 /* do_default is really a C-ism to deal with tentative definitions.
7326 But let's leave it here to ease the eventual merge. */
7327 int do_default = !DECL_EXTERNAL (decl);
7328 tree initializer = init ? init : DECL_INITIAL (decl);
7329 int failure = complete_array_type (type, initializer, do_default);
7332 error ("initializer fails to determine size of `%D'", decl);
7337 error ("array size missing in `%D'", decl);
7338 /* If a `static' var's size isn't known, make it extern as
7339 well as static, so it does not get allocated. If it's not
7340 `static', then don't mark it extern; finish_incomplete_decl
7341 will give it a default size and it will get allocated. */
7342 else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7343 DECL_EXTERNAL (decl) = 1;
7346 if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7347 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7349 error ("zero-size array `%D'", decl);
7351 layout_decl (decl, 0);
7355 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7356 any appropriate error messages regarding the layout. */
7359 layout_var_decl (tree decl)
7361 tree type = TREE_TYPE (decl);
7363 tree ttype = target_type (type);
7366 /* If we haven't already layed out this declaration, do so now.
7367 Note that we must not call complete type for an external object
7368 because it's type might involve templates that we are not
7369 supposed to isntantiate yet. (And it's perfectly valid to say
7370 `extern X x' for some incomplete type `X'.) */
7371 if (!DECL_EXTERNAL (decl))
7372 complete_type (type);
7373 if (!DECL_SIZE (decl)
7374 && TREE_TYPE (decl) != error_mark_node
7375 && (COMPLETE_TYPE_P (type)
7376 || (TREE_CODE (type) == ARRAY_TYPE
7377 && !TYPE_DOMAIN (type)
7378 && COMPLETE_TYPE_P (TREE_TYPE (type)))))
7379 layout_decl (decl, 0);
7381 if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7383 /* An automatic variable with an incomplete type: that is an error.
7384 Don't talk about array types here, since we took care of that
7385 message in grokdeclarator. */
7386 error ("storage size of `%D' isn't known", decl);
7387 TREE_TYPE (decl) = error_mark_node;
7390 /* Keep this code around in case we later want to control debug info
7391 based on whether a type is "used". (jason 1999-11-11) */
7393 else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7394 /* Let debugger know it should output info for this type. */
7395 note_debug_info_needed (ttype);
7397 if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7398 note_debug_info_needed (DECL_CONTEXT (decl));
7401 if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7402 && DECL_SIZE (decl) != NULL_TREE
7403 && ! TREE_CONSTANT (DECL_SIZE (decl)))
7405 if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7406 constant_expression_warning (DECL_SIZE (decl));
7408 error ("storage size of `%D' isn't constant", decl);
7411 if (TREE_STATIC (decl)
7412 && !DECL_ARTIFICIAL (decl)
7413 && current_function_decl
7414 && DECL_CONTEXT (decl) == current_function_decl)
7415 push_local_name (decl);
7418 /* If a local static variable is declared in an inline function, or if
7419 we have a weak definition, we must endeavor to create only one
7420 instance of the variable at link-time. */
7423 maybe_commonize_var (tree decl)
7425 /* Static data in a function with comdat linkage also has comdat
7427 if (TREE_STATIC (decl)
7428 /* Don't mess with __FUNCTION__. */
7429 && ! DECL_ARTIFICIAL (decl)
7430 && current_function_decl
7431 && DECL_CONTEXT (decl) == current_function_decl
7432 && (DECL_DECLARED_INLINE_P (current_function_decl)
7433 || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7434 && TREE_PUBLIC (current_function_decl))
7436 /* If flag_weak, we don't need to mess with this, as we can just
7437 make the function weak, and let it refer to its unique local
7438 copy. This works because we don't allow the function to be
7442 if (DECL_INTERFACE_KNOWN (current_function_decl))
7444 TREE_PUBLIC (decl) = 1;
7445 DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7447 else if (DECL_INITIAL (decl) == NULL_TREE
7448 || DECL_INITIAL (decl) == error_mark_node)
7450 TREE_PUBLIC (decl) = 1;
7451 DECL_COMMON (decl) = 1;
7453 /* else we lose. We can only do this if we can use common,
7454 which we can't if it has been initialized. */
7456 if (!TREE_PUBLIC (decl))
7458 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7459 cp_warning_at (" you can work around this by removing the initializer", decl);
7463 comdat_linkage (decl);
7465 else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
7466 /* Set it up again; we might have set DECL_INITIAL since the last
7468 comdat_linkage (decl);
7471 /* Issue an error message if DECL is an uninitialized const variable. */
7474 check_for_uninitialized_const_var (tree decl)
7476 tree type = TREE_TYPE (decl);
7478 /* ``Unless explicitly declared extern, a const object does not have
7479 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7481 if (TREE_CODE (decl) == VAR_DECL
7482 && TREE_CODE (type) != REFERENCE_TYPE
7483 && CP_TYPE_CONST_P (type)
7484 && !TYPE_NEEDS_CONSTRUCTING (type)
7485 && !DECL_INITIAL (decl))
7486 error ("uninitialized const `%D'", decl);
7489 /* FIELD is a FIELD_DECL or NULL. In the former case, the value
7490 returned is the next FIELD_DECL (possibly FIELD itself) that can be
7491 initialized. If there are no more such fields, the return value
7495 next_initializable_field (tree field)
7498 && (TREE_CODE (field) != FIELD_DECL
7499 || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field))
7500 || DECL_ARTIFICIAL (field)))
7501 field = TREE_CHAIN (field);
7506 /* Undo the brace-elision allowed by [dcl.init.aggr] in a
7507 brace-enclosed aggregate initializer.
7509 *INITP is one of a list of initializers describing a brace-enclosed
7510 initializer for an entity of the indicated aggregate TYPE. It may
7511 not presently match the shape of the TYPE; for example:
7513 struct S { int a; int b; };
7514 struct S a[] = { 1, 2, 3, 4 };
7516 Here *INITP will point to TREE_LIST of four elements, rather than a
7517 list of two elements, each itself a list of two elements. This
7518 routine transforms INIT from the former form into the latter. The
7519 revised initializer is returned. */
7522 reshape_init (tree type, tree *initp)
7526 tree old_init_value;
7528 bool brace_enclosed_p;
7531 old_init_value = (TREE_CODE (*initp) == TREE_LIST
7532 ? TREE_VALUE (*initp) : old_init);
7534 /* For some parse errors, OLD_INIT_VALUE may be NULL. */
7535 if (!old_init_value)
7537 my_friendly_assert (TREE_CODE (old_init) == TREE_LIST, 20021202);
7538 TREE_VALUE (old_init) = error_mark_node;
7542 /* If the initializer is brace-enclosed, pull initializers from the
7543 enclosed elements. Advance past the brace-enclosed initializer
7545 if (TREE_CODE (old_init_value) == CONSTRUCTOR
7546 && TREE_HAS_CONSTRUCTOR (old_init_value))
7548 *initp = TREE_CHAIN (old_init);
7549 TREE_CHAIN (old_init) = NULL_TREE;
7550 inits = CONSTRUCTOR_ELTS (old_init_value);
7552 brace_enclosed_p = true;
7557 brace_enclosed_p = false;
7560 /* A non-aggregate type is always initialized with a single
7562 if (!CP_AGGREGATE_TYPE_P (type))
7564 *initp = TREE_CHAIN (old_init);
7565 TREE_CHAIN (old_init) = NULL_TREE;
7566 /* It is invalid to initialize a non-aggregate type with a
7567 brace-enclosed initializer. */
7568 if (brace_enclosed_p)
7570 error ("brace-enclosed initializer used to initialize `%T'",
7572 if (TREE_CODE (old_init) == TREE_LIST)
7573 TREE_VALUE (old_init) = error_mark_node;
7575 old_init = error_mark_node;
7583 All implicit type conversions (clause _conv_) are considered when
7584 initializing the aggregate member with an initializer from an
7585 initializer-list. If the initializer can initialize a member,
7586 the member is initialized. Otherwise, if the member is itself a
7587 non-empty subaggregate, brace elision is assumed and the
7588 initializer is considered for the initialization of the first
7589 member of the subaggregate. */
7590 if (CLASS_TYPE_P (type)
7591 && !brace_enclosed_p
7592 && can_convert_arg (type, TREE_TYPE (old_init_value), old_init_value))
7594 *initp = TREE_CHAIN (old_init);
7595 TREE_CHAIN (old_init) = NULL_TREE;
7599 if (TREE_CODE (old_init_value) == STRING_CST
7600 && TREE_CODE (type) == ARRAY_TYPE
7601 && char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type))))
7603 /* [dcl.init.string]
7605 A char array (whether plain char, signed char, or unsigned char)
7606 can be initialized by a string-literal (optionally enclosed in
7607 braces); a wchar_t array can be initialized by a wide
7608 string-literal (optionally enclosed in braces). */
7609 new_init = old_init;
7610 /* Move past the initializer. */
7611 *initp = TREE_CHAIN (old_init);
7612 TREE_CHAIN (old_init) = NULL_TREE;
7616 /* Build a CONSTRUCTOR to hold the contents of the aggregate. */
7617 new_init = build (CONSTRUCTOR, type, NULL_TREE, NULL_TREE);
7618 TREE_HAS_CONSTRUCTOR (new_init) = 1;
7620 if (CLASS_TYPE_P (type))
7624 field = next_initializable_field (TYPE_FIELDS (type));
7630 An initializer for an aggregate member that is an
7631 empty class shall have the form of an empty
7632 initializer-list {}. */
7633 if (!brace_enclosed_p)
7634 error ("initializer for `%T' must be brace-enclosed",
7639 /* Loop through the initializable fields, gathering
7641 /* FIXME support non-trivial labeled initializers. */
7642 while (*initp && field)
7646 field_init = reshape_init (TREE_TYPE (field), initp);
7647 TREE_CHAIN (field_init) = CONSTRUCTOR_ELTS (new_init);
7648 CONSTRUCTOR_ELTS (new_init) = field_init;
7651 When a union is initialized with a brace-enclosed
7652 initializer, the braces shall only contain an
7653 initializer for the first member of the union. */
7654 if (TREE_CODE (type) == UNION_TYPE)
7656 field = next_initializable_field (TREE_CHAIN (field));
7660 else if (TREE_CODE (type) == ARRAY_TYPE)
7665 /* If the bound of the array is known, take no more initializers
7666 than are allowed. */
7667 max_index = (TYPE_DOMAIN (type)
7668 ? array_type_nelts (type) : NULL_TREE);
7669 /* Loop through the array elements, gathering initializers. */
7670 for (index = size_zero_node;
7671 *initp && (!max_index || !tree_int_cst_lt (max_index, index));
7672 index = size_binop (PLUS_EXPR, index, size_one_node))
7676 element_init = reshape_init (TREE_TYPE (type), initp);
7677 TREE_CHAIN (element_init) = CONSTRUCTOR_ELTS (new_init);
7678 CONSTRUCTOR_ELTS (new_init) = element_init;
7679 if (TREE_PURPOSE (element_init))
7680 index = TREE_PURPOSE (element_init);
7686 /* The initializers were placed in reverse order in the
7688 CONSTRUCTOR_ELTS (new_init) = nreverse (CONSTRUCTOR_ELTS (new_init));
7690 if (TREE_CODE (old_init) == TREE_LIST)
7691 new_init = build_tree_list (TREE_PURPOSE (old_init), new_init);
7694 /* If this was a brace-enclosed initializer and all of the
7695 initializers were not used up, there is a problem. */
7696 if (brace_enclosed_p && *initp)
7697 error ("too many initializers for `%T'", type);
7702 /* Verify INIT (the initializer for DECL), and record the
7703 initialization in DECL_INITIAL, if appropriate.
7705 If the return value is non-NULL, it is an expression that must be
7706 evaluated dynamically to initialize DECL. */
7709 check_initializer (tree decl, tree init, int flags)
7711 tree type = TREE_TYPE (decl);
7713 /* If `start_decl' didn't like having an initialization, ignore it now. */
7714 if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7717 /* If an initializer is present, DECL_INITIAL has been
7718 error_mark_node, to indicate that an as-of-yet unevaluated
7719 initialization will occur. From now on, DECL_INITIAL reflects
7720 the static initialization -- if any -- of DECL. */
7721 DECL_INITIAL (decl) = NULL_TREE;
7723 /* Things that are going to be initialized need to have complete
7725 TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl));
7727 if (type == error_mark_node)
7728 /* We will have already complained. */
7730 else if (init && COMPLETE_TYPE_P (type)
7731 && !TREE_CONSTANT (TYPE_SIZE (type)))
7733 error ("variable-sized object `%D' may not be initialized", decl);
7736 else if (TREE_CODE (type) == ARRAY_TYPE
7737 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (type))))
7739 error ("elements of array `%#D' have incomplete type", decl);
7742 else if (TREE_CODE (type) != ARRAY_TYPE && !COMPLETE_TYPE_P (type))
7744 error ("`%D' has incomplete type", decl);
7745 TREE_TYPE (decl) = error_mark_node;
7749 if (TREE_CODE (decl) == CONST_DECL)
7751 my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7753 DECL_INITIAL (decl) = init;
7755 my_friendly_assert (init != NULL_TREE, 149);
7758 else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE)
7759 init = grok_reference_init (decl, type, init);
7762 if (TREE_CODE (init) == CONSTRUCTOR && TREE_HAS_CONSTRUCTOR (init))
7764 /* [dcl.init] paragraph 13,
7765 If T is a scalar type, then a declaration of the form
7770 reshape_init will complain about the extra braces,
7771 and doesn't do anything useful in the case where TYPE is
7772 scalar, so just don't call it. */
7773 if (CP_AGGREGATE_TYPE_P (type))
7774 init = reshape_init (type, &init);
7777 /* If DECL has an array type without a specific bound, deduce the
7778 array size from the initializer. */
7779 maybe_deduce_size_from_array_init (decl, init);
7780 type = TREE_TYPE (decl);
7781 if (TREE_CODE (init) == CONSTRUCTOR && TREE_HAS_CONSTRUCTOR (init))
7782 TREE_TYPE (init) = type;
7784 if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7786 if (TREE_CODE (type) == ARRAY_TYPE)
7787 goto initialize_aggr;
7788 else if (TREE_CODE (init) == CONSTRUCTOR
7789 && TREE_HAS_CONSTRUCTOR (init))
7791 if (TYPE_NON_AGGREGATE_CLASS (type))
7793 error ("`%D' must be initialized by constructor, not by `{...}'",
7795 init = error_mark_node;
7798 goto dont_use_constructor;
7802 int saved_stmts_are_full_exprs_p;
7805 saved_stmts_are_full_exprs_p = 0;
7806 if (building_stmt_tree ())
7808 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p ();
7809 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
7811 init = build_aggr_init (decl, init, flags);
7812 if (building_stmt_tree ())
7813 current_stmt_tree ()->stmts_are_full_exprs_p =
7814 saved_stmts_are_full_exprs_p;
7820 dont_use_constructor:
7821 if (TREE_CODE (init) != TREE_VEC)
7822 init = store_init_value (decl, init);
7825 else if (DECL_EXTERNAL (decl))
7827 else if (TYPE_P (type) && TYPE_NEEDS_CONSTRUCTING (type))
7828 goto initialize_aggr;
7829 else if (IS_AGGR_TYPE (type))
7831 tree core_type = strip_array_types (type);
7833 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type))
7834 error ("structure `%D' with uninitialized const members", decl);
7835 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))
7836 error ("structure `%D' with uninitialized reference members",
7839 check_for_uninitialized_const_var (decl);
7842 check_for_uninitialized_const_var (decl);
7844 if (init && init != error_mark_node)
7845 init = build (INIT_EXPR, type, decl, init);
7850 /* If DECL is not a local variable, give it RTL. */
7853 make_rtl_for_nonlocal_decl (tree decl, tree init, const char* asmspec)
7855 int toplev = toplevel_bindings_p ();
7858 /* Handle non-variables up front. */
7859 if (TREE_CODE (decl) != VAR_DECL)
7861 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7865 /* If we see a class member here, it should be a static data
7867 if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl))
7869 my_friendly_assert (TREE_STATIC (decl), 19990828);
7870 /* An in-class declaration of a static data member should be
7871 external; it is only a declaration, and not a definition. */
7872 if (init == NULL_TREE)
7873 my_friendly_assert (DECL_EXTERNAL (decl), 20000723);
7876 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7879 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (asmspec));
7880 /* The `register' keyword, when used together with an
7881 asm-specification, indicates that the variable should be
7882 placed in a particular register. */
7883 if (DECL_REGISTER (decl))
7884 DECL_C_HARD_REGISTER (decl) = 1;
7887 /* We don't create any RTL for local variables. */
7888 if (DECL_FUNCTION_SCOPE_P (decl) && !TREE_STATIC (decl))
7891 /* We defer emission of local statics until the corresponding
7892 DECL_STMT is expanded. */
7893 defer_p = DECL_FUNCTION_SCOPE_P (decl) || DECL_VIRTUAL_P (decl);
7895 /* We try to defer namespace-scope static constants so that they are
7896 not emitted into the object file unnecessarily. */
7897 if (!DECL_VIRTUAL_P (decl)
7898 && TREE_READONLY (decl)
7899 && DECL_INITIAL (decl) != NULL_TREE
7900 && DECL_INITIAL (decl) != error_mark_node
7901 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl))
7903 && !TREE_PUBLIC (decl))
7905 /* Fool with the linkage of static consts according to #pragma
7907 if (!interface_unknown && !TREE_PUBLIC (decl))
7909 TREE_PUBLIC (decl) = 1;
7910 DECL_EXTERNAL (decl) = interface_only;
7915 /* Likewise for template instantiations. */
7916 else if (DECL_COMDAT (decl))
7919 /* If we're deferring the variable, we only need to make RTL if
7920 there's an ASMSPEC. Otherwise, we'll lazily create it later when
7921 we need it. (There's no way to lazily create RTL for things that
7922 have assembly specs because the information about the specifier
7923 isn't stored in the tree, yet) */
7924 if (defer_p && asmspec)
7925 make_decl_rtl (decl, asmspec);
7926 /* If we're not deferring, go ahead and assemble the variable. */
7928 rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7931 /* The old ARM scoping rules injected variables declared in the
7932 initialization statement of a for-statement into the surrounding
7933 scope. We support this usage, in order to be backward-compatible.
7934 DECL is a just-declared VAR_DECL; if necessary inject its
7935 declaration into the surrounding scope. */
7938 maybe_inject_for_scope_var (tree decl)
7940 timevar_push (TV_NAME_LOOKUP);
7941 if (!DECL_NAME (decl))
7942 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, (void)0);
7944 /* Declarations of __FUNCTION__ and its ilk appear magically when
7945 the variable is first used. If that happens to be inside a
7946 for-loop, we don't want to do anything special. */
7947 if (DECL_PRETTY_FUNCTION_P (decl))
7948 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, (void)0);
7950 if (current_binding_level->is_for_scope)
7952 struct cp_binding_level *outer
7953 = current_binding_level->level_chain;
7955 /* Check to see if the same name is already bound at the outer
7956 level, either because it was directly declared, or because a
7957 dead for-decl got preserved. In either case, the code would
7958 not have been valid under the ARM scope rules, so clear
7959 is_for_scope for the current_binding_level.
7961 Otherwise, we need to preserve the temp slot for decl to last
7962 into the outer binding level. */
7965 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
7967 if (outer_binding && BINDING_LEVEL (outer_binding) == outer
7968 && (TREE_CODE (BINDING_VALUE (outer_binding))
7970 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
7972 BINDING_VALUE (outer_binding)
7973 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
7974 current_binding_level->is_for_scope = 0;
7977 timevar_pop (TV_NAME_LOOKUP);
7980 /* Generate code to initialize DECL (a local variable). */
7983 initialize_local_var (tree decl, tree init)
7985 tree type = TREE_TYPE (decl);
7987 my_friendly_assert (TREE_CODE (decl) == VAR_DECL
7988 || TREE_CODE (decl) == RESULT_DECL,
7990 my_friendly_assert (!TREE_STATIC (decl), 20021010);
7992 if (DECL_SIZE (decl) == NULL_TREE)
7994 /* If we used it already as memory, it must stay in memory. */
7995 DECL_INITIAL (decl) = NULL_TREE;
7996 TREE_ADDRESSABLE (decl) = TREE_USED (decl);
7999 if (DECL_SIZE (decl) && type != error_mark_node)
8003 /* Compute and store the initial value. */
8004 already_used = TREE_USED (decl) || TREE_USED (type);
8006 /* Perform the initialization. */
8009 int saved_stmts_are_full_exprs_p;
8011 my_friendly_assert (building_stmt_tree (), 20000906);
8012 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p ();
8013 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
8014 finish_expr_stmt (init);
8015 current_stmt_tree ()->stmts_are_full_exprs_p =
8016 saved_stmts_are_full_exprs_p;
8019 /* Set this to 0 so we can tell whether an aggregate which was
8020 initialized was ever used. Don't do this if it has a
8021 destructor, so we don't complain about the 'resource
8022 allocation is initialization' idiom. Now set
8023 attribute((unused)) on types so decls of that type will be
8024 marked used. (see TREE_USED, above.) */
8025 if (TYPE_NEEDS_CONSTRUCTING (type)
8027 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type)
8028 && DECL_NAME (decl))
8029 TREE_USED (decl) = 0;
8030 else if (already_used)
8031 TREE_USED (decl) = 1;
8034 /* Generate a cleanup, if necessary. */
8035 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
8039 /* Compute the cleanup. */
8040 cleanup = cxx_maybe_build_cleanup (decl);
8042 /* Record the cleanup required for this declaration. */
8043 if (DECL_SIZE (decl) && cleanup)
8044 finish_decl_cleanup (decl, cleanup);
8048 /* Finish processing of a declaration;
8049 install its line number and initial value.
8050 If the length of an array type is not known before,
8051 it must be determined now, from the initial value, or it is an error.
8053 INIT holds the value of an initializer that should be allowed to escape
8056 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8057 if the (init) syntax was used. */
8060 cp_finish_decl (tree decl, tree init, tree asmspec_tree, int flags)
8063 tree ttype = NULL_TREE;
8064 const char *asmspec = NULL;
8065 int was_readonly = 0;
8070 error ("assignment (not initialization) in declaration");
8074 /* If a name was specified, get the string. */
8075 if (current_binding_level == global_binding_level)
8076 asmspec_tree = maybe_apply_renaming_pragma (decl, asmspec_tree);
8078 asmspec = TREE_STRING_POINTER (asmspec_tree);
8080 if (init && TREE_CODE (init) == NAMESPACE_DECL)
8082 error ("cannot initialize `%D' to namespace `%D'",
8087 if (current_class_type
8088 && CP_DECL_CONTEXT (decl) == current_class_type
8089 && TYPE_BEING_DEFINED (current_class_type)
8090 && (DECL_INITIAL (decl) || init))
8091 DECL_INITIALIZED_IN_CLASS_P (decl) = 1;
8093 if (TREE_CODE (decl) == VAR_DECL
8094 && DECL_CONTEXT (decl)
8095 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
8096 && DECL_CONTEXT (decl) != current_namespace
8099 /* Leave the namespace of the object. */
8100 pop_decl_namespace ();
8103 type = TREE_TYPE (decl);
8105 if (type == error_mark_node)
8108 if (TYPE_HAS_MUTABLE_P (type))
8109 TREE_READONLY (decl) = 0;
8111 if (processing_template_decl)
8113 /* Add this declaration to the statement-tree. */
8114 if (at_function_scope_p ()
8115 && TREE_CODE (decl) != RESULT_DECL)
8116 add_decl_stmt (decl);
8118 if (init && DECL_INITIAL (decl))
8119 DECL_INITIAL (decl) = init;
8123 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8124 my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828);
8126 /* Take care of TYPE_DECLs up front. */
8127 if (TREE_CODE (decl) == TYPE_DECL)
8129 if (type != error_mark_node
8130 && IS_AGGR_TYPE (type) && DECL_NAME (decl))
8132 if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
8133 warning ("shadowing previous type declaration of `%#D'", decl);
8134 set_identifier_type_value (DECL_NAME (decl), type);
8135 CLASSTYPE_GOT_SEMICOLON (type) = 1;
8138 /* If we have installed this as the canonical typedef for this
8139 type, and that type has not been defined yet, delay emitting
8140 the debug information for it, as we will emit it later. */
8141 if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
8142 && !COMPLETE_TYPE_P (TREE_TYPE (decl)))
8143 TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
8145 rest_of_decl_compilation (decl, NULL,
8146 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
8150 if (TREE_CODE (decl) != FUNCTION_DECL)
8151 ttype = target_type (type);
8153 if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
8154 && TYPE_NEEDS_CONSTRUCTING (type))
8156 /* Currently, GNU C++ puts constants in text space, making them
8157 impossible to initialize. In the future, one would hope for
8158 an operating system which understood the difference between
8159 initialization and the running of a program. */
8161 TREE_READONLY (decl) = 0;
8164 if (TREE_CODE (decl) == FIELD_DECL && asmspec)
8166 /* This must override the asm specifier which was placed by
8167 grokclassfn. Lay this out fresh. */
8168 SET_DECL_RTL (TREE_TYPE (decl), NULL_RTX);
8169 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (asmspec));
8170 make_decl_rtl (decl, asmspec);
8172 else if (TREE_CODE (decl) == RESULT_DECL)
8173 init = check_initializer (decl, init, flags);
8174 else if (TREE_CODE (decl) == VAR_DECL)
8176 /* Only PODs can have thread-local storage. Other types may require
8177 various kinds of non-trivial initialization. */
8178 if (DECL_THREAD_LOCAL (decl) && !pod_type_p (TREE_TYPE (decl)))
8179 error ("`%D' cannot be thread-local because it has non-POD type `%T'",
8180 decl, TREE_TYPE (decl));
8181 /* Convert the initializer to the type of DECL, if we have not
8182 already initialized DECL. */
8183 if (!DECL_INITIALIZED_P (decl)
8184 /* If !DECL_EXTERNAL then DECL is being defined. In the
8185 case of a static data member initialized inside the
8186 class-specifier, there can be an initializer even if DECL
8187 is *not* defined. */
8188 && (!DECL_EXTERNAL (decl) || init))
8190 init = check_initializer (decl, init, flags);
8191 /* Thread-local storage cannot be dynamically initialized. */
8192 if (DECL_THREAD_LOCAL (decl) && init)
8194 error ("`%D' is thread-local and so cannot be dynamically "
8195 "initialized", decl);
8202 The memory occupied by any object of static storage
8203 duration is zero-initialized at program startup before
8204 any other initialization takes place.
8206 We cannot create an appropriate initializer until after
8207 the type of DECL is finalized. If DECL_INITIAL is set,
8208 then the DECL is statically initialized, and any
8209 necessary zero-initialization has already been performed. */
8210 if (TREE_STATIC (decl) && !DECL_INITIAL (decl))
8211 DECL_INITIAL (decl) = build_zero_init (TREE_TYPE (decl),
8212 /*nelts=*/NULL_TREE,
8213 /*static_storage_p=*/true);
8214 /* Remember that the initialization for this variable has
8216 DECL_INITIALIZED_P (decl) = 1;
8218 /* If the variable has an array type, lay out the type, even if
8219 there is no initializer. It is valid to index through the
8220 array, and we must get TYPE_ALIGN set correctly on the array
8222 else if (TREE_CODE (type) == ARRAY_TYPE)
8226 /* Add this declaration to the statement-tree. This needs to happen
8227 after the call to check_initializer so that the DECL_STMT for a
8228 reference temp is added before the DECL_STMT for the reference itself. */
8229 if (building_stmt_tree ()
8230 && at_function_scope_p ()
8231 && TREE_CODE (decl) != RESULT_DECL)
8232 add_decl_stmt (decl);
8234 if (TREE_CODE (decl) == VAR_DECL)
8235 layout_var_decl (decl);
8237 /* Output the assembler code and/or RTL code for variables and functions,
8238 unless the type is an undefined structure or union.
8239 If not, it will get done when the type is completed. */
8240 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
8241 || TREE_CODE (decl) == RESULT_DECL)
8243 if (TREE_CODE (decl) == VAR_DECL)
8244 maybe_commonize_var (decl);
8246 make_rtl_for_nonlocal_decl (decl, init, asmspec);
8248 if (TREE_CODE (type) == FUNCTION_TYPE
8249 || TREE_CODE (type) == METHOD_TYPE)
8250 abstract_virtuals_error (decl,
8251 strip_array_types (TREE_TYPE (type)));
8253 abstract_virtuals_error (decl, strip_array_types (type));
8255 if (TREE_CODE (decl) == FUNCTION_DECL
8256 || TREE_TYPE (decl) == error_mark_node)
8257 /* No initialization required. */
8259 else if (DECL_EXTERNAL (decl)
8260 && ! (DECL_LANG_SPECIFIC (decl)
8261 && DECL_NOT_REALLY_EXTERN (decl)))
8264 DECL_INITIAL (decl) = init;
8268 /* A variable definition. */
8269 if (DECL_FUNCTION_SCOPE_P (decl))
8271 /* This is a local declaration. */
8272 if (doing_semantic_analysis_p ())
8273 maybe_inject_for_scope_var (decl);
8274 /* Initialize the local variable. */
8275 if (processing_template_decl)
8277 if (init || DECL_INITIAL (decl) == error_mark_node)
8278 DECL_INITIAL (decl) = init;
8280 else if (!TREE_STATIC (decl))
8281 initialize_local_var (decl, init);
8284 if (TREE_STATIC (decl))
8285 expand_static_init (decl, init);
8289 /* Undo call to `pushclass' that was done in `start_decl'
8290 due to initialization of qualified member variable.
8291 I.e., Foo::x = 10; */
8293 tree context = CP_DECL_CONTEXT (decl);
8296 && (TREE_CODE (decl) == VAR_DECL
8297 /* We also have a pushclass done that we need to undo here
8298 if we're at top level and declare a method. */
8299 || TREE_CODE (decl) == FUNCTION_DECL)
8300 /* If size hasn't been set, we're still defining it,
8301 and therefore inside the class body; don't pop
8302 the binding level.. */
8303 && COMPLETE_TYPE_P (context)
8304 && context == current_class_type)
8305 pop_nested_class ();
8312 TREE_READONLY (decl) = 1;
8315 /* This is here for a midend callback from c-common.c */
8318 finish_decl (tree decl, tree init, tree asmspec_tree)
8320 cp_finish_decl (decl, init, asmspec_tree, 0);
8323 /* Returns a declaration for a VAR_DECL as if:
8325 extern "C" TYPE NAME;
8327 had been seen. Used to create compiler-generated global
8331 declare_global_var (tree name, tree type)
8335 push_to_top_level ();
8336 decl = build_decl (VAR_DECL, name, type);
8337 TREE_PUBLIC (decl) = 1;
8338 DECL_EXTERNAL (decl) = 1;
8339 DECL_ARTIFICIAL (decl) = 1;
8341 cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
8342 pop_from_top_level ();
8347 /* Returns a pointer to the `atexit' function. Note that if
8348 FLAG_USE_CXA_ATEXIT is nonzero, then this will actually be the new
8349 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8352 get_atexit_node (void)
8363 if (flag_use_cxa_atexit)
8365 /* The declaration for `__cxa_atexit' is:
8367 int __cxa_atexit (void (*)(void *), void *, void *)
8369 We build up the argument types and then then function type
8372 /* First, build the pointer-to-function type for the first
8374 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8375 fn_type = build_function_type (void_type_node, arg_types);
8376 fn_ptr_type = build_pointer_type (fn_type);
8377 /* Then, build the rest of the argument types. */
8378 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8379 arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
8380 arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types);
8381 /* And the final __cxa_atexit type. */
8382 fn_type = build_function_type (integer_type_node, arg_types);
8383 fn_ptr_type = build_pointer_type (fn_type);
8384 name = "__cxa_atexit";
8388 /* The declaration for `atexit' is:
8390 int atexit (void (*)());
8392 We build up the argument types and then then function type
8394 fn_type = build_function_type (void_type_node, void_list_node);
8395 fn_ptr_type = build_pointer_type (fn_type);
8396 arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node);
8397 /* Build the final atexit type. */
8398 fn_type = build_function_type (integer_type_node, arg_types);
8402 /* Now, build the function declaration. */
8403 push_lang_context (lang_name_c);
8404 atexit_fndecl = build_library_fn_ptr (name, fn_type);
8405 mark_used (atexit_fndecl);
8406 pop_lang_context ();
8407 atexit_node = default_conversion (atexit_fndecl);
8412 /* Returns the __dso_handle VAR_DECL. */
8415 get_dso_handle_node (void)
8417 if (dso_handle_node)
8418 return dso_handle_node;
8420 /* Declare the variable. */
8421 dso_handle_node = declare_global_var (get_identifier ("__dso_handle"),
8424 return dso_handle_node;
8427 /* Begin a new function with internal linkage whose job will be simply
8428 to destroy some particular variable. */
8431 start_cleanup_fn (void)
8433 static int counter = 0;
8434 int old_interface_only = interface_only;
8435 int old_interface_unknown = interface_unknown;
8441 push_to_top_level ();
8443 /* No need to mangle this. */
8444 push_lang_context (lang_name_c);
8447 interface_unknown = 1;
8449 /* Build the parameter-types. */
8450 parmtypes = void_list_node;
8451 /* Functions passed to __cxa_atexit take an additional parameter.
8452 We'll just ignore it. After we implement the new calling
8453 convention for destructors, we can eliminate the use of
8454 additional cleanup functions entirely in the -fnew-abi case. */
8455 if (flag_use_cxa_atexit)
8456 parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes);
8457 /* Build the function type itself. */
8458 fntype = build_function_type (void_type_node, parmtypes);
8459 /* Build the name of the function. */
8460 sprintf (name, "__tcf_%d", counter++);
8461 /* Build the function declaration. */
8462 fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype);
8463 /* It's a function with internal linkage, generated by the
8465 TREE_PUBLIC (fndecl) = 0;
8466 DECL_ARTIFICIAL (fndecl) = 1;
8467 /* Make the function `inline' so that it is only emitted if it is
8468 actually needed. It is unlikely that it will be inlined, since
8469 it is only called via a function pointer, but we avoid unnecessary
8470 emissions this way. */
8471 DECL_INLINE (fndecl) = 1;
8472 /* Build the parameter. */
8473 if (flag_use_cxa_atexit)
8477 parmdecl = cp_build_parm_decl (NULL_TREE, ptr_type_node);
8478 DECL_CONTEXT (parmdecl) = fndecl;
8479 TREE_USED (parmdecl) = 1;
8480 DECL_ARGUMENTS (fndecl) = parmdecl;
8484 start_function (/*specs=*/NULL_TREE, fndecl, NULL_TREE, SF_PRE_PARSED);
8486 interface_unknown = old_interface_unknown;
8487 interface_only = old_interface_only;
8489 pop_lang_context ();
8491 return current_function_decl;
8494 /* Finish the cleanup function begun by start_cleanup_fn. */
8497 end_cleanup_fn (void)
8499 expand_body (finish_function (0));
8501 pop_from_top_level ();
8504 /* Generate code to handle the destruction of DECL, an object with
8505 static storage duration. */
8508 register_dtor_fn (tree decl)
8514 int saved_flag_access_control;
8516 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
8519 /* Call build_cleanup before we enter the anonymous function so that
8520 any access checks will be done relative to the current scope,
8521 rather than the scope of the anonymous function. */
8522 build_cleanup (decl);
8524 /* Now start the function. */
8525 cleanup = start_cleanup_fn ();
8527 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8528 to the original function, rather than the anonymous one. That
8529 will make the back-end think that nested functions are in use,
8530 which causes confusion. */
8531 saved_flag_access_control = flag_access_control;
8532 scope_chain->check_access = flag_access_control = 0;
8533 fcall = build_cleanup (decl);
8534 scope_chain->check_access = flag_access_control = saved_flag_access_control;
8536 /* Create the body of the anonymous function. */
8537 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
8538 finish_expr_stmt (fcall);
8539 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
8542 /* Call atexit with the cleanup function. */
8543 cxx_mark_addressable (cleanup);
8544 cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
8545 if (flag_use_cxa_atexit)
8547 args = tree_cons (NULL_TREE,
8548 build_unary_op (ADDR_EXPR, get_dso_handle_node (), 0),
8550 args = tree_cons (NULL_TREE, null_pointer_node, args);
8551 args = tree_cons (NULL_TREE, cleanup, args);
8554 args = tree_cons (NULL_TREE, cleanup, NULL_TREE);
8555 finish_expr_stmt (build_function_call (get_atexit_node (), args));
8558 /* DECL is a VAR_DECL with static storage duration. INIT, if present,
8559 is its initializer. Generate code to handle the construction
8560 and destruction of DECL. */
8563 expand_static_init (tree decl, tree init)
8567 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 20021010);
8568 my_friendly_assert (TREE_STATIC (decl), 20021010);
8570 /* Some variables require no initialization. */
8572 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
8573 && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
8576 oldstatic = value_member (decl, static_aggregates);
8580 if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
8581 error ("multiple initializations given for `%D'", decl);
8583 else if (! toplevel_bindings_p ())
8585 /* Emit code to perform this initialization but once. */
8592 /* Emit code to perform this initialization but once. This code
8595 static int guard = 0;
8597 // Do initialization.
8599 // Register variable for destruction at end of program.
8602 Note that the `temp' variable is only set to 1 *after* the
8603 initialization is complete. This ensures that an exception,
8604 thrown during the construction, will cause the variable to
8605 reinitialized when we pass through this code again, as per:
8609 If the initialization exits by throwing an exception, the
8610 initialization is not complete, so it will be tried again
8611 the next time control enters the declaration.
8613 In theory, this process should be thread-safe, too; multiple
8614 threads should not be able to initialize the variable more
8615 than once. We don't yet attempt to ensure thread-safety. */
8617 /* Create the guard variable. */
8618 guard = get_guard (decl);
8620 /* Begin the conditional initialization. */
8621 if_stmt = begin_if_stmt ();
8622 finish_if_stmt_cond (get_guard_cond (guard), if_stmt);
8623 then_clause = begin_compound_stmt (/*has_no_scope=*/0);
8625 /* Do the initialization itself. */
8626 assignment = init ? init : NULL_TREE;
8628 /* Once the assignment is complete, set TEMP to 1. Since the
8629 construction of the static object is complete at this point,
8630 we want to make sure TEMP is set to 1 even if a temporary
8631 constructed during the initialization throws an exception
8632 when it is destroyed. So, we combine the initialization and
8633 the assignment to TEMP into a single expression, ensuring
8634 that when we call finish_expr_stmt the cleanups will not be
8635 run until after TEMP is set to 1. */
8636 guard_init = set_guard (guard);
8639 assignment = tree_cons (NULL_TREE, assignment,
8640 build_tree_list (NULL_TREE,
8642 assignment = build_compound_expr (assignment);
8645 assignment = guard_init;
8646 finish_expr_stmt (assignment);
8648 /* Use atexit to register a function for destroying this static
8650 register_dtor_fn (decl);
8652 finish_compound_stmt (/*has_no_scope=*/0, then_clause);
8653 finish_then_clause (if_stmt);
8657 static_aggregates = tree_cons (init, decl, static_aggregates);
8660 /* Finish the declaration of a catch-parameter. */
8663 start_handler_parms (tree declspecs, tree declarator)
8668 decl = grokdeclarator (declarator, declspecs, CATCHPARM,
8670 if (decl == NULL_TREE)
8671 error ("invalid catch parameter");
8680 /* Make TYPE a complete type based on INITIAL_VALUE.
8681 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8682 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8685 complete_array_type (tree type, tree initial_value, int do_default)
8687 register tree maxindex = NULL_TREE;
8692 /* An array of character type can be initialized from a
8693 brace-enclosed string constant. */
8694 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type)))
8695 && TREE_CODE (initial_value) == CONSTRUCTOR
8696 && CONSTRUCTOR_ELTS (initial_value)
8697 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value)))
8699 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value)) == NULL_TREE)
8700 initial_value = TREE_VALUE (CONSTRUCTOR_ELTS (initial_value));
8702 /* Note MAXINDEX is really the maximum index, one less than the
8704 if (TREE_CODE (initial_value) == STRING_CST)
8707 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8708 maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8711 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8713 tree elts = CONSTRUCTOR_ELTS (initial_value);
8715 maxindex = ssize_int (-1);
8716 for (; elts; elts = TREE_CHAIN (elts))
8718 if (TREE_PURPOSE (elts))
8719 maxindex = TREE_PURPOSE (elts);
8721 maxindex = size_binop (PLUS_EXPR, maxindex, ssize_int (1));
8723 maxindex = copy_node (maxindex);
8727 /* Make an error message unless that happened already. */
8728 if (initial_value != error_mark_node)
8731 initial_value = NULL_TREE;
8733 /* Prevent further error messages. */
8734 maxindex = build_int_2 (0, 0);
8741 maxindex = build_int_2 (0, 0);
8750 domain = build_index_type (maxindex);
8751 TYPE_DOMAIN (type) = domain;
8753 if (! TREE_TYPE (maxindex))
8754 TREE_TYPE (maxindex) = domain;
8756 itype = TREE_TYPE (initial_value);
8759 if (itype && !TYPE_DOMAIN (itype))
8760 TYPE_DOMAIN (itype) = domain;
8761 /* The type of the main variant should never be used for arrays
8762 of different sizes. It should only ever be completed with the
8763 size of the array. */
8764 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8765 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain;
8768 /* Lay out the type now that we can get the real answer. */
8775 /* Return zero if something is declared to be a member of type
8776 CTYPE when in the context of CUR_TYPE. STRING is the error
8777 message to print in that case. Otherwise, quietly return 1. */
8780 member_function_or_else (tree ctype, tree cur_type, enum overload_flags flags)
8782 if (ctype && ctype != cur_type)
8784 if (flags == DTOR_FLAG)
8785 error ("destructor for alien class `%T' cannot be a member",
8788 error ("constructor for alien class `%T' cannot be a member",
8795 /* Subroutine of `grokdeclarator'. */
8797 /* Generate errors possibly applicable for a given set of specifiers.
8798 This is for ARM $7.1.2. */
8801 bad_specifiers (tree object,
8810 error ("`%D' declared as a `virtual' %s", object, type);
8812 error ("`%D' declared as an `inline' %s", object, type);
8814 error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8817 cp_error_at ("`%D' declared as a friend", object);
8819 && (TREE_CODE (object) == TYPE_DECL
8820 || (!TYPE_PTRFN_P (TREE_TYPE (object))
8821 && !TYPE_REFFN_P (TREE_TYPE (object))
8822 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object)))))
8823 cp_error_at ("`%D' declared with an exception specification", object);
8826 /* CTYPE is class type, or null if non-class.
8827 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8829 DECLARATOR is the function's name.
8830 VIRTUALP is truthvalue of whether the function is virtual or not.
8831 FLAGS are to be passed through to `grokclassfn'.
8832 QUALS are qualifiers indicating whether the function is `const'
8834 RAISES is a list of exceptions that this function can raise.
8835 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8836 not look, and -1 if we should not call `grokclassfn' at all.
8838 Returns `NULL_TREE' if something goes wrong, after issuing
8839 applicable error messages. */
8842 grokfndecl (tree ctype,
8845 tree orig_declarator,
8847 enum overload_flags flags,
8859 int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8860 int has_default_arg = 0;
8864 type = build_exception_variant (type, raises);
8866 decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8867 /* Propagate volatile out from type to decl. */
8868 if (TYPE_VOLATILE (type))
8869 TREE_THIS_VOLATILE (decl) = 1;
8871 /* If this decl has namespace scope, set that up. */
8873 set_decl_namespace (decl, in_namespace, friendp);
8875 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8877 /* `main' and builtins have implicit 'C' linkage. */
8878 if ((MAIN_NAME_P (declarator)
8879 || (IDENTIFIER_LENGTH (declarator) > 10
8880 && IDENTIFIER_POINTER (declarator)[0] == '_'
8881 && IDENTIFIER_POINTER (declarator)[1] == '_'
8882 && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8883 && current_lang_name == lang_name_cplusplus
8884 && ctype == NULL_TREE
8885 /* NULL_TREE means global namespace. */
8886 && DECL_CONTEXT (decl) == NULL_TREE)
8887 SET_DECL_LANGUAGE (decl, lang_c);
8889 /* Should probably propagate const out from type to decl I bet (mrs). */
8892 DECL_STATIC_FUNCTION_P (decl) = 1;
8893 DECL_CONTEXT (decl) = ctype;
8897 DECL_CONTEXT (decl) = ctype;
8899 if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8901 if (processing_template_decl)
8902 error ("cannot declare `::main' to be a template");
8904 error ("cannot declare `::main' to be inline");
8906 error ("cannot declare `::main' to be static");
8907 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
8909 error ("`main' must return `int'");
8914 /* Members of anonymous types and local classes have no linkage; make
8916 /* FIXME what if it gets a name from typedef? */
8917 if (ctype && (TYPE_ANONYMOUS_P (ctype)
8918 || decl_function_context (TYPE_MAIN_DECL (ctype))))
8923 /* [basic.link]: A name with no linkage (notably, the name of a class
8924 or enumeration declared in a local scope) shall not be used to
8925 declare an entity with linkage.
8927 Only check this for public decls for now. */
8928 t = no_linkage_check (TREE_TYPE (decl));
8931 if (TYPE_ANONYMOUS_P (t))
8933 if (DECL_EXTERN_C_P (decl))
8934 /* Allow this; it's pretty common in C. */;
8937 pedwarn ("non-local function `%#D' uses anonymous type",
8939 if (DECL_ORIGINAL_TYPE (TYPE_NAME (t)))
8941 `%#D' does not refer to the unqualified type, so it is not used for linkage",
8946 pedwarn ("non-local function `%#D' uses local type `%T'",
8951 TREE_PUBLIC (decl) = publicp;
8954 DECL_INTERFACE_KNOWN (decl) = 1;
8955 DECL_NOT_REALLY_EXTERN (decl) = 1;
8958 DID_INLINE_FUNC (decl) = 0;
8959 /* If the declaration was declared inline, mark it as such. */
8961 DECL_DECLARED_INLINE_P (decl) = 1;
8962 /* We inline functions that are explicitly declared inline, or, when
8963 the user explicitly asks us to, all functions. */
8964 if (DECL_DECLARED_INLINE_P (decl))
8965 DECL_INLINE (decl) = 1;
8966 if (flag_inline_trees == 2 && !DECL_INLINE (decl))
8968 DID_INLINE_FUNC (decl) = 1;
8969 DECL_INLINE (decl) = 1;
8972 DECL_EXTERNAL (decl) = 1;
8973 if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
8975 error ("%smember function `%D' cannot have `%T' method qualifier",
8976 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
8980 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
8981 grok_op_properties (decl, friendp);
8983 if (ctype && decl_function_context (decl))
8984 DECL_NO_STATIC_CHAIN (decl) = 1;
8986 for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
8987 if (TREE_PURPOSE (t)
8988 && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
8990 has_default_arg = 1;
8995 && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
8999 ("defining explicit specialization `%D' in friend declaration",
9003 tree fns = TREE_OPERAND (orig_declarator, 0);
9004 tree args = TREE_OPERAND (orig_declarator, 1);
9006 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
9008 /* Something like `template <class T> friend void f<T>()'. */
9009 error ("invalid use of template-id `%D' in declaration of primary template",
9015 /* A friend declaration of the form friend void f<>(). Record
9016 the information in the TEMPLATE_ID_EXPR. */
9017 SET_DECL_IMPLICIT_INSTANTIATION (decl);
9019 if (TREE_CODE (fns) == COMPONENT_REF)
9021 /* Due to bison parser ickiness, we will have already looked
9022 up an operator_name or PFUNCNAME within the current class
9023 (see template_id in parse.y). If the current class contains
9024 such a name, we'll get a COMPONENT_REF here. Undo that. */
9026 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns, 0))
9027 == current_class_type, 20001120);
9028 fns = TREE_OPERAND (fns, 1);
9030 my_friendly_assert (TREE_CODE (fns) == IDENTIFIER_NODE
9031 || TREE_CODE (fns) == LOOKUP_EXPR
9032 || TREE_CODE (fns) == OVERLOAD, 20001120);
9033 DECL_TEMPLATE_INFO (decl) = tree_cons (fns, args, NULL_TREE);
9035 if (has_default_arg)
9037 error ("default arguments are not allowed in declaration of friend template specialization `%D'",
9044 error ("`inline' is not allowed in declaration of friend template specialization `%D'",
9052 /* Make the init_value nonzero so pushdecl knows this is not
9053 tentative. error_mark_node is replaced later with the BLOCK. */
9054 DECL_INITIAL (decl) = error_mark_node;
9056 if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl))
9057 TREE_NOTHROW (decl) = 1;
9059 /* Caller will do the rest of this. */
9063 if (flags == NO_SPECIAL && ctype && constructor_name_p (declarator, ctype))
9064 DECL_CONSTRUCTOR_P (decl) = 1;
9066 /* Function gets the ugly name, field gets the nice one. This call
9067 may change the type of the function (because of default
9069 if (ctype != NULL_TREE)
9070 grokclassfn (ctype, decl, flags, quals);
9072 decl = check_explicit_specialization (orig_declarator, decl,
9074 2 * (funcdef_flag != 0) +
9075 4 * (friendp != 0));
9076 if (decl == error_mark_node)
9079 if (ctype != NULL_TREE
9080 && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
9085 old_decl = check_classfn (ctype, decl);
9087 if (old_decl && TREE_CODE (old_decl) == TEMPLATE_DECL)
9088 /* Because grokfndecl is always supposed to return a
9089 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9090 here. We depend on our callers to figure out that its
9091 really a template that's being returned. */
9092 old_decl = DECL_TEMPLATE_RESULT (old_decl);
9094 if (old_decl && DECL_STATIC_FUNCTION_P (old_decl)
9095 && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
9097 /* Remove the `this' parm added by grokclassfn.
9098 XXX Isn't this done in start_function, too? */
9099 revert_static_member_fn (decl);
9100 last_function_parms = TREE_CHAIN (last_function_parms);
9102 if (old_decl && DECL_ARTIFICIAL (old_decl))
9103 error ("definition of implicitly-declared `%D'", old_decl);
9107 /* Since we've smashed OLD_DECL to its
9108 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9109 if (TREE_CODE (decl) == TEMPLATE_DECL)
9110 decl = DECL_TEMPLATE_RESULT (decl);
9112 /* Attempt to merge the declarations. This can fail, in
9113 the case of some invalid specialization declarations. */
9115 if (!duplicate_decls (decl, old_decl))
9116 error ("no `%#D' member function declared in class `%T'",
9123 if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl))
9126 if (ctype == NULL_TREE || check)
9130 DECL_VIRTUAL_P (decl) = 1;
9135 /* Create a VAR_DECL named NAME with the indicated TYPE.
9137 If SCOPE is non-NULL, it is the class type or namespace containing
9138 the variable. If SCOPE is NULL, the variable should is created in
9139 the innermost enclosings scope. */
9142 grokvardecl (tree type,
9144 RID_BIT_TYPE * specbits_in,
9150 RID_BIT_TYPE specbits;
9152 my_friendly_assert (!name || TREE_CODE (name) == IDENTIFIER_NODE,
9155 specbits = *specbits_in;
9157 /* Compute the scope in which to place the variable. */
9160 /* An explicit "extern" specifier indicates a namespace-scope
9162 if (RIDBIT_SETP (RID_EXTERN, specbits))
9163 scope = current_namespace;
9164 else if (!at_function_scope_p ())
9166 scope = current_scope ();
9168 scope = current_namespace;
9173 && (/* If the variable is a namespace-scope variable declared in a
9174 template, we need DECL_LANG_SPECIFIC. */
9175 (TREE_CODE (scope) == NAMESPACE_DECL && processing_template_decl)
9176 /* Similarly for namespace-scope variables with language linkage
9178 || (TREE_CODE (scope) == NAMESPACE_DECL
9179 && current_lang_name != lang_name_cplusplus)
9180 /* Similarly for static data members. */
9182 decl = build_lang_decl (VAR_DECL, name, type);
9184 decl = build_decl (VAR_DECL, name, type);
9186 if (scope && TREE_CODE (scope) == NAMESPACE_DECL)
9187 set_decl_namespace (decl, scope, 0);
9189 DECL_CONTEXT (decl) = scope;
9191 if (name && scope && current_lang_name != lang_name_c)
9192 /* We can't mangle lazily here because we don't have any
9193 way to recover whether or not a variable was `extern
9197 if (RIDBIT_SETP (RID_EXTERN, specbits))
9199 DECL_THIS_EXTERN (decl) = 1;
9200 DECL_EXTERNAL (decl) = !initialized;
9203 /* In class context, static means one per class,
9204 public access, and static storage. */
9205 if (DECL_CLASS_SCOPE_P (decl))
9207 TREE_PUBLIC (decl) = 1;
9208 TREE_STATIC (decl) = 1;
9209 DECL_EXTERNAL (decl) = 0;
9211 /* At top level, either `static' or no s.c. makes a definition
9212 (perhaps tentative), and absence of `static' makes it public. */
9213 else if (toplevel_bindings_p ())
9215 TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
9216 && (DECL_THIS_EXTERN (decl) || ! constp));
9217 TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
9219 /* Not at top level, only `static' makes a static definition. */
9222 TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
9223 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
9226 if (RIDBIT_SETP (RID_THREAD, specbits))
9228 if (targetm.have_tls)
9229 DECL_THREAD_LOCAL (decl) = 1;
9231 /* A mere warning is sure to result in improper semantics
9232 at runtime. Don't bother to allow this to compile. */
9233 error ("thread-local storage not supported for this target");
9236 if (TREE_PUBLIC (decl))
9238 /* [basic.link]: A name with no linkage (notably, the name of a class
9239 or enumeration declared in a local scope) shall not be used to
9240 declare an entity with linkage.
9242 Only check this for public decls for now. */
9243 tree t = no_linkage_check (TREE_TYPE (decl));
9246 if (TYPE_ANONYMOUS_P (t))
9247 /* Ignore for now; `enum { foo } e' is pretty common. */;
9249 pedwarn ("non-local variable `%#D' uses local type `%T'",
9257 /* Create and return a canonical pointer to member function type, for
9258 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9261 build_ptrmemfunc_type (tree type)
9265 tree unqualified_variant = NULL_TREE;
9267 if (type == error_mark_node)
9270 /* If a canonical type already exists for this type, use it. We use
9271 this method instead of type_hash_canon, because it only does a
9272 simple equality check on the list of field members. */
9274 if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
9277 /* Make sure that we always have the unqualified pointer-to-member
9279 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
9281 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type));
9283 t = make_aggr_type (RECORD_TYPE);
9284 /* Let the front-end know this is a pointer to member function... */
9285 TYPE_PTRMEMFUNC_FLAG (t) = 1;
9286 /* ... and not really an aggregate. */
9287 SET_IS_AGGR_TYPE (t, 0);
9289 field = build_decl (FIELD_DECL, pfn_identifier, type);
9292 field = build_decl (FIELD_DECL, delta_identifier, delta_type_node);
9293 TREE_CHAIN (field) = fields;
9296 finish_builtin_struct (t, "__ptrmemfunc_type", fields, ptr_type_node);
9298 /* Zap out the name so that the back-end will give us the debugging
9299 information for this anonymous RECORD_TYPE. */
9300 TYPE_NAME (t) = NULL_TREE;
9302 /* If this is not the unqualified form of this pointer-to-member
9303 type, set the TYPE_MAIN_VARIANT for this type to be the
9304 unqualified type. Since they are actually RECORD_TYPEs that are
9305 not variants of each other, we must do this manually. */
9306 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
9308 t = build_qualified_type (t, cp_type_quals (type));
9309 TYPE_MAIN_VARIANT (t) = unqualified_variant;
9310 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant);
9311 TYPE_NEXT_VARIANT (unqualified_variant) = t;
9314 /* Cache this pointer-to-member type so that we can find it again
9316 TYPE_SET_PTRMEMFUNC_TYPE (type, t);
9318 /* Seems to be wanted. */
9319 CLASSTYPE_GOT_SEMICOLON (t) = 1;
9324 /* Create and return a pointer to data member type. */
9327 build_ptrmem_type (tree class_type, tree member_type)
9329 return build_pointer_type (build_offset_type (class_type, member_type));
9332 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9333 Check to see that the definition is valid. Issue appropriate error
9334 messages. Return 1 if the definition is particularly bad, or 0
9338 check_static_variable_definition (tree decl, tree type)
9340 /* Motion 10 at San Diego: If a static const integral data member is
9341 initialized with an integral constant expression, the initializer
9342 may appear either in the declaration (within the class), or in
9343 the definition, but not both. If it appears in the class, the
9344 member is a member constant. The file-scope definition is always
9346 if (!ARITHMETIC_TYPE_P (type) && TREE_CODE (type) != ENUMERAL_TYPE)
9348 error ("invalid in-class initialization of static data member of non-integral type `%T'",
9350 /* If we just return the declaration, crashes will sometimes
9351 occur. We therefore return void_type_node, as if this was a
9352 friend declaration, to cause callers to completely ignore
9353 this declaration. */
9356 else if (!CP_TYPE_CONST_P (type))
9357 error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9359 else if (pedantic && !INTEGRAL_TYPE_P (type))
9360 pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
9365 /* Given the SIZE (i.e., number of elements) in an array, compute an
9366 appropriate index type for the array. If non-NULL, NAME is the
9367 name of the thing being declared. */
9370 compute_array_index_type (tree name, tree size)
9374 /* If this involves a template parameter, it will be a constant at
9375 instantiation time, but we don't know what the value is yet.
9376 Even if no template parameters are involved, we may an expression
9377 that is not a constant; we don't even simplify `1 + 2' when
9378 processing a template. */
9379 if (processing_template_decl)
9381 /* Resolve a qualified reference to an enumerator or static
9382 const data member of ours. */
9383 if (TREE_CODE (size) == SCOPE_REF
9384 && TREE_OPERAND (size, 0) == current_class_type)
9386 tree t = lookup_field (current_class_type,
9387 TREE_OPERAND (size, 1), 0, false);
9392 return build_index_type (build_min (MINUS_EXPR, sizetype,
9393 size, integer_one_node));
9396 /* The size might be the result of a cast. */
9397 STRIP_TYPE_NOPS (size);
9399 /* It might be a const variable or enumeration constant. */
9400 size = decl_constant_value (size);
9402 /* The array bound must be an integer type. */
9403 if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
9404 && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
9405 && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
9408 error ("size of array `%D' has non-integer type", name);
9410 error ("size of array has non-integer type");
9411 size = integer_one_node;
9414 /* Normally, the array-bound will be a constant. */
9415 if (TREE_CODE (size) == INTEGER_CST)
9417 /* Check to see if the array bound overflowed. Make that an
9418 error, no matter how generous we're being. */
9419 int old_flag_pedantic_errors = flag_pedantic_errors;
9420 int old_pedantic = pedantic;
9421 pedantic = flag_pedantic_errors = 1;
9422 constant_expression_warning (size);
9423 pedantic = old_pedantic;
9424 flag_pedantic_errors = old_flag_pedantic_errors;
9426 /* An array must have a positive number of elements. */
9427 if (INT_CST_LT (size, integer_zero_node))
9430 error ("size of array `%D' is negative", name);
9432 error ("size of array is negative");
9433 size = integer_one_node;
9435 /* Except that an extension we allow zero-sized arrays. We
9436 always allow them in system headers because glibc uses
9438 else if (integer_zerop (size) && pedantic && !in_system_header)
9441 pedwarn ("ISO C++ forbids zero-size array `%D'", name);
9443 pedwarn ("ISO C++ forbids zero-size array");
9446 else if (TREE_CONSTANT (size))
9448 /* `(int) &fn' is not a valid array bound. */
9450 error ("size of array `%D' is not an integral constant-expression",
9453 error ("size of array is not an integral constant-expression");
9456 /* Compute the index of the largest element in the array. It is
9457 one less than the number of elements in the array. */
9459 = fold (cp_build_binary_op (MINUS_EXPR,
9460 cp_convert (ssizetype, size),
9461 cp_convert (ssizetype,
9462 integer_one_node)));
9464 /* Check for variable-sized arrays. We allow such things as an
9465 extension, even though they are not allowed in ANSI/ISO C++. */
9466 if (!TREE_CONSTANT (itype))
9471 pedwarn ("ISO C++ forbids variable-size array `%D'",
9474 pedwarn ("ISO C++ forbids variable-size array");
9477 /* Create a variable-sized array index type. */
9478 itype = variable_size (itype);
9480 /* Make sure that there was no overflow when creating to a signed
9481 index type. (For example, on a 32-bit machine, an array with
9482 size 2^32 - 1 is too big.) */
9483 else if (TREE_OVERFLOW (itype))
9485 error ("overflow in array dimension");
9486 TREE_OVERFLOW (itype) = 0;
9489 /* Create and return the appropriate index type. */
9490 return build_index_type (itype);
9493 /* Returns the scope (if any) in which the entity declared by
9494 DECLARATOR will be located. If the entity was declared with an
9495 unqualified name, NULL_TREE is returned. */
9498 get_scope_of_declarator (tree declarator)
9503 switch (TREE_CODE (declarator))
9509 /* For any of these, the main declarator is the first operand. */
9510 return get_scope_of_declarator (TREE_OPERAND
9514 /* For a pointer-to-member, continue descending. */
9515 if (TREE_CODE (TREE_OPERAND (declarator, 1))
9517 return get_scope_of_declarator (TREE_OPERAND
9519 /* Otherwise, if the declarator-id is a SCOPE_REF, the scope in
9520 which the declaration occurs is the first operand. */
9521 return TREE_OPERAND (declarator, 0);
9524 /* Attributes to be applied. The declarator is TREE_VALUE. */
9525 return get_scope_of_declarator (TREE_VALUE (declarator));
9528 /* Otherwise, we have a declarator-id which is not a qualified
9529 name; the entity will be declared in the current scope. */
9534 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9535 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9539 create_array_type_for_decl (tree name, tree type, tree size)
9541 tree itype = NULL_TREE;
9542 const char* error_msg;
9544 /* If things have already gone awry, bail now. */
9545 if (type == error_mark_node || size == error_mark_node)
9546 return error_mark_node;
9548 /* Assume that everything will go OK. */
9551 /* There are some types which cannot be array elements. */
9552 switch (TREE_CODE (type))
9555 error_msg = "array of void";
9559 error_msg = "array of functions";
9562 case REFERENCE_TYPE:
9563 error_msg = "array of references";
9567 error_msg = "array of data members";
9571 error_msg = "array of function members";
9578 /* If something went wrong, issue an error-message and return. */
9582 error ("declaration of `%D' as %s", name, error_msg);
9584 error ("creating %s", error_msg);
9586 return error_mark_node;
9591 The constant expressions that specify the bounds of the arrays
9592 can be omitted only for the first member of the sequence. */
9593 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
9596 error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9599 error ("multidimensional array must have bounds for all dimensions except the first");
9601 return error_mark_node;
9604 /* Figure out the index type for the array. */
9606 itype = compute_array_index_type (name, size);
9608 return build_cplus_array_type (type, itype);
9611 /* Check that it's OK to declare a function with the indicated TYPE.
9612 SFK indicates the kind of special function (if any) that this
9613 function is. OPTYPE is the type given in a conversion operator
9614 declaration. Returns the actual return type of the function; that
9615 may be different than TYPE if an error occurs, or for certain
9616 special functions. */
9619 check_special_function_return_type (special_function_kind sfk,
9625 case sfk_constructor:
9627 error ("return type specification for constructor invalid");
9629 type = void_type_node;
9632 case sfk_destructor:
9634 error ("return type specification for destructor invalid");
9635 type = void_type_node;
9638 case sfk_conversion:
9639 if (type && !same_type_p (type, optype))
9640 error ("operator `%T' declared to return `%T'", optype, type);
9642 pedwarn ("return type specified for `operator %T'", optype);
9654 /* Given declspecs and a declarator (abstract or otherwise), determine
9655 the name and type of the object declared and construct a DECL node
9658 DECLSPECS is a chain of tree_list nodes whose value fields
9659 are the storage classes and type specifiers.
9661 DECL_CONTEXT says which syntactic context this declaration is in:
9662 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9663 FUNCDEF for a function definition. Like NORMAL but a few different
9664 error messages in each case. Return value may be zero meaning
9665 this definition is too screwy to try to parse.
9666 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9667 handle member functions (which have FIELD context).
9668 Return value may be zero meaning this definition is too screwy to
9670 PARM for a parameter declaration (either within a function prototype
9671 or before a function body). Make a PARM_DECL, or return void_type_node.
9672 CATCHPARM for a parameter declaration before a catch clause.
9673 TYPENAME if for a typename (in a cast or sizeof).
9674 Don't make a DECL node; just return the ..._TYPE node.
9675 FIELD for a struct or union field; make a FIELD_DECL.
9676 BITFIELD for a field with specified width.
9677 INITIALIZED is 1 if the decl has an initializer.
9679 ATTRLIST is a pointer to the list of attributes, which may be NULL
9680 if there are none; *ATTRLIST may be modified if attributes from inside
9681 the declarator should be applied to the declaration.
9683 When this function is called, scoping variables (such as
9684 CURRENT_CLASS_TYPE) should reflect the scope in which the
9685 declaration occurs, not the scope in which the new declaration will
9686 be placed. For example, on:
9690 when grokdeclarator is called for `S::f', the CURRENT_CLASS_TYPE
9691 should not be `S'. */
9694 grokdeclarator (tree declarator,
9696 enum decl_context decl_context,
9700 RID_BIT_TYPE specbits;
9703 tree type = NULL_TREE;
9706 int virtualp, explicitp, friendp, inlinep, staticp;
9707 int explicit_int = 0;
9708 int explicit_char = 0;
9709 int defaulted_int = 0;
9710 int extern_langp = 0;
9711 tree dependant_name = NULL_TREE;
9713 tree typedef_decl = NULL_TREE;
9715 tree typedef_type = NULL_TREE;
9716 int funcdef_flag = 0;
9717 enum tree_code innermost_code = ERROR_MARK;
9720 /* See the code below that used this. */
9721 tree decl_attr = NULL_TREE;
9724 /* Keep track of what sort of function is being processed
9725 so that we can warn about default return values, or explicit
9726 return values which do not match prescribed defaults. */
9727 special_function_kind sfk = sfk_none;
9729 tree dname = NULL_TREE;
9730 tree ctype = current_class_type;
9731 tree ctor_return_type = NULL_TREE;
9732 enum overload_flags flags = NO_SPECIAL;
9733 tree quals = NULL_TREE;
9734 tree raises = NULL_TREE;
9735 int template_count = 0;
9736 tree in_namespace = NULL_TREE;
9737 tree returned_attrs = NULL_TREE;
9738 tree scope = NULL_TREE;
9740 RIDBIT_RESET_ALL (specbits);
9741 if (decl_context == FUNCDEF)
9742 funcdef_flag = 1, decl_context = NORMAL;
9743 else if (decl_context == MEMFUNCDEF)
9744 funcdef_flag = -1, decl_context = FIELD;
9745 else if (decl_context == BITFIELD)
9746 bitfield = 1, decl_context = FIELD;
9748 /* Look inside a declarator for the name being declared
9749 and get it as a string, for an error message. */
9751 tree *next = &declarator;
9755 while (next && *next)
9758 switch (TREE_CODE (decl))
9761 /* For attributes. */
9762 next = &TREE_VALUE (decl);
9767 next = &TREE_OPERAND (decl, 0);
9770 case BIT_NOT_EXPR: /* For C++ destructors! */
9772 tree name = TREE_OPERAND (decl, 0);
9773 tree rename = NULL_TREE;
9775 my_friendly_assert (flags == NO_SPECIAL, 152);
9777 sfk = sfk_destructor;
9779 TREE_OPERAND (decl, 0) = name = constructor_name (name);
9780 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
9781 if (ctype == NULL_TREE)
9783 if (current_class_type == NULL_TREE)
9785 error ("destructors must be member functions");
9790 tree t = constructor_name (current_class_type);
9797 tree t = constructor_name (ctype);
9804 error ("destructor `%T' must match class name `%T'",
9806 TREE_OPERAND (decl, 0) = rename;
9812 case ADDR_EXPR: /* C++ reference declaration */
9817 innermost_code = TREE_CODE (decl);
9818 next = &TREE_OPERAND (decl, 0);
9822 innermost_code = TREE_CODE (decl);
9823 if (decl_context == FIELD && ctype == NULL_TREE)
9824 ctype = current_class_type;
9826 && TREE_OPERAND (decl, 0)
9827 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
9828 && constructor_name_p (DECL_NAME (TREE_OPERAND (decl, 0)),
9830 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9831 next = &TREE_OPERAND (decl, 0);
9833 if (ctype != NULL_TREE
9834 && decl != NULL_TREE && flags != DTOR_FLAG
9835 && constructor_name_p (decl, ctype))
9837 sfk = sfk_constructor;
9838 ctor_return_type = ctype;
9843 case TEMPLATE_ID_EXPR:
9845 tree fns = TREE_OPERAND (decl, 0);
9847 if (TREE_CODE (fns) == LOOKUP_EXPR)
9848 fns = TREE_OPERAND (fns, 0);
9851 if (TREE_CODE (dname) == COMPONENT_REF)
9852 dname = TREE_OPERAND (dname, 1);
9853 if (TREE_CODE (dname) != IDENTIFIER_NODE)
9855 my_friendly_assert (is_overloaded_fn (dname),
9857 dname = DECL_NAME (get_first_fn (dname));
9862 case IDENTIFIER_NODE:
9863 if (TREE_CODE (decl) == IDENTIFIER_NODE)
9868 if (C_IS_RESERVED_WORD (dname))
9870 error ("declarator-id missing; using reserved word `%D'",
9872 name = IDENTIFIER_POINTER (dname);
9874 else if (!IDENTIFIER_TYPENAME_P (dname))
9875 name = IDENTIFIER_POINTER (dname);
9878 my_friendly_assert (flags == NO_SPECIAL, 154);
9879 flags = TYPENAME_FLAG;
9880 ctor_return_type = TREE_TYPE (dname);
9881 sfk = sfk_conversion;
9882 if (IDENTIFIER_GLOBAL_VALUE (dname)
9883 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname))
9885 name = IDENTIFIER_POINTER (dname);
9887 name = "<invalid operator>";
9894 /* Perform error checking, and decide on a ctype. */
9895 tree cname = TREE_OPERAND (decl, 0);
9896 if (cname == NULL_TREE)
9898 else if (TREE_CODE (cname) == NAMESPACE_DECL)
9901 in_namespace = TREE_OPERAND (decl, 0);
9903 else if (! is_aggr_type (cname, 1))
9905 /* Must test TREE_OPERAND (decl, 1), in case user gives
9906 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9907 else if (TREE_OPERAND (decl, 1)
9908 && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9910 else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9911 || TREE_CODE (cname) == BOUND_TEMPLATE_TEMPLATE_PARM)
9913 /* This might be declaring a member of a template
9914 parm to be a friend. */
9916 dependant_name = TREE_OPERAND (decl, 1);
9918 else if (ctype == NULL_TREE)
9920 else if (TREE_COMPLEXITY (decl) == current_class_depth)
9924 if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9926 error ("type `%T' is not derived from type `%T'",
9934 /* It is valid to write:
9936 class C { void f(); };
9940 The standard is not clear about whether `typedef const C D' is
9941 legal; as of 2002-09-15 the committee is considering
9942 that question. EDG 3.0 allows that syntax.
9943 Therefore, we do as well. */
9945 ctype = TYPE_MAIN_VARIANT (ctype);
9946 /* Update the declarator so that when we process it
9947 again the correct type is present. */
9948 TREE_OPERAND (decl, 0) = ctype;
9950 if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
9951 && constructor_name_p (DECL_NAME (TREE_OPERAND (decl, 1)),
9953 TREE_OPERAND (decl, 1) = constructor_name (ctype);
9954 next = &TREE_OPERAND (decl, 1);
9958 if (TREE_CODE (decl) == IDENTIFIER_NODE
9959 && constructor_name_p (decl, ctype))
9961 sfk = sfk_constructor;
9962 ctor_return_type = ctype;
9964 else if (TREE_CODE (decl) == BIT_NOT_EXPR
9965 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
9966 && constructor_name_p (TREE_OPERAND (decl, 0),
9969 sfk = sfk_destructor;
9970 ctor_return_type = ctype;
9972 TREE_OPERAND (decl, 0) = constructor_name (ctype);
9973 next = &TREE_OPERAND (decl, 0);
9984 /* Parse error puts this typespec where
9985 a declarator should go. */
9986 error ("`%T' specified as declarator-id", DECL_NAME (decl));
9987 if (TREE_TYPE (decl) == current_class_type)
9988 error (" perhaps you want `%T' for a constructor",
9989 current_class_name);
9990 dname = DECL_NAME (decl);
9991 name = IDENTIFIER_POINTER (dname);
9993 /* Avoid giving two errors for this. */
9994 IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
9996 declspecs = tree_cons (NULL_TREE, integer_type_node, declspecs);
10002 next = &BASELINK_FUNCTIONS (decl);
10005 case TEMPLATE_DECL:
10006 /* Sometimes, we see a template-name used as part of a
10007 decl-specifier like in
10008 std::allocator alloc;
10009 Handle that gracefully. */
10010 error ("invalid use of template-name '%E' in a declarator", decl);
10011 return error_mark_node;
10015 my_friendly_assert (0, 20020917);
10020 /* A function definition's declarator must have the form of
10021 a function declarator. */
10023 if (funcdef_flag && innermost_code != CALL_EXPR)
10026 if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
10027 && innermost_code != CALL_EXPR
10028 && ! (ctype && declspecs == NULL_TREE))
10030 error ("declaration of `%D' as non-function", dname);
10031 return void_type_node;
10034 /* Anything declared one level down from the top level
10035 must be one of the parameters of a function
10036 (because the body is at least two levels down). */
10038 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
10039 by not allowing C++ class definitions to specify their parameters
10040 with xdecls (must be spec.d in the parmlist).
10042 Since we now wait to push a class scope until we are sure that
10043 we are in a legitimate method context, we must set oldcname
10044 explicitly (since current_class_name is not yet alive).
10046 We also want to avoid calling this a PARM if it is in a namespace. */
10048 if (decl_context == NORMAL && !toplevel_bindings_p ())
10050 struct cp_binding_level *b = current_binding_level;
10051 current_binding_level = b->level_chain;
10052 if (current_binding_level != 0 && toplevel_bindings_p ())
10053 decl_context = PARM;
10054 current_binding_level = b;
10058 name = decl_context == PARM ? "parameter" : "type name";
10060 /* Look through the decl specs and record which ones appear.
10061 Some typespecs are defined as built-in typenames.
10062 Others, the ones that are modifiers of other types,
10063 are represented by bits in SPECBITS: set the bits for
10064 the modifiers that appear. Storage class keywords are also in SPECBITS.
10066 If there is a typedef name or a type, store the type in TYPE.
10067 This includes builtin typedefs such as `int'.
10069 Set EXPLICIT_INT if the type is `int' or `char' and did not
10070 come from a user typedef.
10072 Set LONGLONG if `long' is mentioned twice.
10074 For C++, constructors and destructors have their own fast treatment. */
10076 for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
10081 /* Certain parse errors slip through. For example,
10082 `int class;' is not caught by the parser. Try
10083 weakly to recover here. */
10084 if (TREE_CODE (spec) != TREE_LIST)
10087 id = TREE_VALUE (spec);
10089 /* If the entire declaration is itself tagged as deprecated then
10090 suppress reports of deprecated items. */
10091 if (!adding_implicit_members && id && TREE_DEPRECATED (id))
10093 if (deprecated_state != DEPRECATED_SUPPRESS)
10094 warn_deprecated_use (id);
10097 if (TREE_CODE (id) == IDENTIFIER_NODE)
10099 if (id == ridpointers[(int) RID_INT]
10100 || id == ridpointers[(int) RID_CHAR]
10101 || id == ridpointers[(int) RID_BOOL]
10102 || id == ridpointers[(int) RID_WCHAR])
10106 if (id == ridpointers[(int) RID_BOOL])
10107 error ("`bool' is now a keyword");
10109 error ("extraneous `%T' ignored", id);
10113 if (id == ridpointers[(int) RID_INT])
10115 else if (id == ridpointers[(int) RID_CHAR])
10117 type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
10121 /* C++ aggregate types. */
10122 if (IDENTIFIER_HAS_TYPE_VALUE (id))
10125 error ("multiple declarations `%T' and `%T'", type, id);
10127 type = IDENTIFIER_TYPE_VALUE (id);
10131 for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
10133 if (ridpointers[i] == id)
10135 if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
10137 if (pedantic && ! in_system_header && warn_long_long)
10138 pedwarn ("ISO C++ does not support `long long'");
10140 error ("`long long long' is too long for GCC");
10144 else if (RIDBIT_SETP (i, specbits))
10145 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
10147 /* Diagnose "__thread extern" or "__thread static". */
10148 if (RIDBIT_SETP (RID_THREAD, specbits))
10150 if (i == (int)RID_EXTERN)
10151 error ("`__thread' before `extern'");
10152 else if (i == (int)RID_STATIC)
10153 error ("`__thread' before `static'");
10156 if (i == (int)RID_EXTERN
10157 && TREE_PURPOSE (spec) == error_mark_node)
10158 /* This extern was part of a language linkage. */
10161 RIDBIT_SET (i, specbits);
10166 else if (TREE_CODE (id) == TYPE_DECL)
10169 error ("multiple declarations `%T' and `%T'", type,
10173 type = TREE_TYPE (id);
10174 TREE_VALUE (spec) = type;
10180 error ("two or more data types in declaration of `%s'", name);
10181 else if (TREE_CODE (id) == IDENTIFIER_NODE)
10183 register tree t = lookup_name (id, 1);
10184 if (!t || TREE_CODE (t) != TYPE_DECL)
10185 error ("`%s' fails to be a typedef or built in type",
10186 IDENTIFIER_POINTER (id));
10189 type = TREE_TYPE (t);
10193 else if (id != error_mark_node)
10194 /* Can't change CLASS nodes into RECORD nodes here! */
10201 /* See the code below that used this. */
10203 decl_attr = DECL_ATTRIBUTES (typedef_decl);
10205 typedef_type = type;
10207 /* No type at all: default to `int', and set DEFAULTED_INT
10208 because it was not a user-defined typedef. */
10210 if (type == NULL_TREE
10211 && (RIDBIT_SETP (RID_SIGNED, specbits)
10212 || RIDBIT_SETP (RID_UNSIGNED, specbits)
10213 || RIDBIT_SETP (RID_LONG, specbits)
10214 || RIDBIT_SETP (RID_SHORT, specbits)))
10216 /* These imply 'int'. */
10217 type = integer_type_node;
10221 if (sfk != sfk_none)
10222 type = check_special_function_return_type (sfk, type,
10224 else if (type == NULL_TREE)
10230 /* We handle `main' specially here, because 'main () { }' is so
10231 common. With no options, it is allowed. With -Wreturn-type,
10232 it is a warning. It is only an error with -pedantic-errors. */
10233 is_main = (funcdef_flag
10234 && dname && MAIN_NAME_P (dname)
10235 && ctype == NULL_TREE
10236 && in_namespace == NULL_TREE
10237 && current_namespace == global_namespace);
10239 if (in_system_header || flag_ms_extensions)
10240 /* Allow it, sigh. */;
10241 else if (pedantic || ! is_main)
10242 pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10244 else if (warn_return_type)
10245 warning ("ISO C++ forbids declaration of `%s' with no type",
10248 type = integer_type_node;
10253 /* Now process the modifiers that were specified
10254 and check for invalid combinations. */
10256 /* Long double is a special combination. */
10258 if (RIDBIT_SETP (RID_LONG, specbits)
10259 && TYPE_MAIN_VARIANT (type) == double_type_node)
10261 RIDBIT_RESET (RID_LONG, specbits);
10262 type = build_qualified_type (long_double_type_node,
10263 cp_type_quals (type));
10266 /* Check all other uses of type modifiers. */
10268 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10269 || RIDBIT_SETP (RID_SIGNED, specbits)
10270 || RIDBIT_SETP (RID_LONG, specbits)
10271 || RIDBIT_SETP (RID_SHORT, specbits))
10275 if (TREE_CODE (type) == REAL_TYPE)
10276 error ("short, signed or unsigned invalid for `%s'", name);
10277 else if (TREE_CODE (type) != INTEGER_TYPE)
10278 error ("long, short, signed or unsigned invalid for `%s'", name);
10279 else if (RIDBIT_SETP (RID_LONG, specbits)
10280 && RIDBIT_SETP (RID_SHORT, specbits))
10281 error ("long and short specified together for `%s'", name);
10282 else if ((RIDBIT_SETP (RID_LONG, specbits)
10283 || RIDBIT_SETP (RID_SHORT, specbits))
10285 error ("long or short specified with char for `%s'", name);
10286 else if ((RIDBIT_SETP (RID_LONG, specbits)
10287 || RIDBIT_SETP (RID_SHORT, specbits))
10288 && TREE_CODE (type) == REAL_TYPE)
10289 error ("long or short specified with floating type for `%s'", name);
10290 else if (RIDBIT_SETP (RID_SIGNED, specbits)
10291 && RIDBIT_SETP (RID_UNSIGNED, specbits))
10292 error ("signed and unsigned given together for `%s'", name);
10296 if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
10298 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10300 if (flag_pedantic_errors)
10305 /* Discard the type modifiers if they are invalid. */
10308 RIDBIT_RESET (RID_UNSIGNED, specbits);
10309 RIDBIT_RESET (RID_SIGNED, specbits);
10310 RIDBIT_RESET (RID_LONG, specbits);
10311 RIDBIT_RESET (RID_SHORT, specbits);
10316 if (RIDBIT_SETP (RID_COMPLEX, specbits)
10317 && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
10319 error ("complex invalid for `%s'", name);
10320 RIDBIT_RESET (RID_COMPLEX, specbits);
10323 /* Decide whether an integer type is signed or not.
10324 Optionally treat bitfields as signed by default. */
10325 if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10328 It is implementation-defined whether a plain (neither
10329 explicitly signed or unsigned) char, short, int, or long
10330 bit-field is signed or unsigned.
10332 Naturally, we extend this to long long as well. Note that
10333 this does not include wchar_t. */
10334 || (bitfield && !flag_signed_bitfields
10335 && RIDBIT_NOTSETP (RID_SIGNED, specbits)
10336 /* A typedef for plain `int' without `signed' can be
10337 controlled just like plain `int', but a typedef for
10338 `signed int' cannot be so controlled. */
10340 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))
10341 && (TREE_CODE (type) == INTEGER_TYPE
10342 || TREE_CODE (type) == CHAR_TYPE)
10343 && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node)))
10346 type = long_long_unsigned_type_node;
10347 else if (RIDBIT_SETP (RID_LONG, specbits))
10348 type = long_unsigned_type_node;
10349 else if (RIDBIT_SETP (RID_SHORT, specbits))
10350 type = short_unsigned_type_node;
10351 else if (type == char_type_node)
10352 type = unsigned_char_type_node;
10353 else if (typedef_decl)
10354 type = c_common_unsigned_type (type);
10356 type = unsigned_type_node;
10358 else if (RIDBIT_SETP (RID_SIGNED, specbits)
10359 && type == char_type_node)
10360 type = signed_char_type_node;
10362 type = long_long_integer_type_node;
10363 else if (RIDBIT_SETP (RID_LONG, specbits))
10364 type = long_integer_type_node;
10365 else if (RIDBIT_SETP (RID_SHORT, specbits))
10366 type = short_integer_type_node;
10368 if (RIDBIT_SETP (RID_COMPLEX, specbits))
10370 /* If we just have "complex", it is equivalent to
10371 "complex double", but if any modifiers at all are specified it is
10372 the complex form of TYPE. E.g, "complex short" is
10373 "complex short int". */
10375 if (defaulted_int && ! longlong
10376 && ! (RIDBIT_SETP (RID_LONG, specbits)
10377 || RIDBIT_SETP (RID_SHORT, specbits)
10378 || RIDBIT_SETP (RID_SIGNED, specbits)
10379 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
10380 type = complex_double_type_node;
10381 else if (type == integer_type_node)
10382 type = complex_integer_type_node;
10383 else if (type == float_type_node)
10384 type = complex_float_type_node;
10385 else if (type == double_type_node)
10386 type = complex_double_type_node;
10387 else if (type == long_double_type_node)
10388 type = complex_long_double_type_node;
10390 type = build_complex_type (type);
10393 type_quals = TYPE_UNQUALIFIED;
10394 if (RIDBIT_SETP (RID_CONST, specbits))
10395 type_quals |= TYPE_QUAL_CONST;
10396 if (RIDBIT_SETP (RID_VOLATILE, specbits))
10397 type_quals |= TYPE_QUAL_VOLATILE;
10398 if (RIDBIT_SETP (RID_RESTRICT, specbits))
10399 type_quals |= TYPE_QUAL_RESTRICT;
10400 if (sfk == sfk_conversion && type_quals != TYPE_UNQUALIFIED)
10401 error ("qualifiers are not allowed on declaration of `operator %T'",
10404 type_quals |= cp_type_quals (type);
10405 type = cp_build_qualified_type_real
10406 (type, type_quals, ((typedef_decl && !DECL_ARTIFICIAL (typedef_decl)
10407 ? tf_ignore_bad_quals : 0) | tf_error | tf_warning));
10408 /* We might have ignored or rejected some of the qualifiers. */
10409 type_quals = cp_type_quals (type);
10412 inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
10413 virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
10414 RIDBIT_RESET (RID_VIRTUAL, specbits);
10415 explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
10416 RIDBIT_RESET (RID_EXPLICIT, specbits);
10418 if (RIDBIT_SETP (RID_STATIC, specbits))
10419 staticp = 1 + (decl_context == FIELD);
10421 if (virtualp && staticp == 2)
10423 error ("member `%D' cannot be declared both virtual and static",
10427 friendp = RIDBIT_SETP (RID_FRIEND, specbits);
10428 RIDBIT_RESET (RID_FRIEND, specbits);
10430 if (dependant_name && !friendp)
10432 error ("`%T::%D' is not a valid declarator", ctype, dependant_name);
10433 return void_type_node;
10436 /* Warn if two storage classes are given. Default to `auto'. */
10438 if (RIDBIT_ANY_SET (specbits))
10440 if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
10441 if (RIDBIT_SETP (RID_EXTERN, specbits) && !extern_langp) nclasses++;
10442 if (RIDBIT_SETP (RID_THREAD, specbits)) nclasses++;
10443 if (decl_context == PARM && nclasses > 0)
10444 error ("storage class specifiers invalid in parameter declarations");
10445 if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10447 if (decl_context == PARM)
10448 error ("typedef declaration invalid in parameter declaration");
10451 if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
10452 if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
10453 if (!nclasses && !friendp && extern_langp)
10457 /* Give error if `virtual' is used outside of class declaration. */
10459 && (current_class_name == NULL_TREE || decl_context != FIELD))
10461 error ("virtual outside class declaration");
10465 /* Static anonymous unions are dealt with here. */
10466 if (staticp && decl_context == TYPENAME
10467 && TREE_CODE (declspecs) == TREE_LIST
10468 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs)))
10469 decl_context = FIELD;
10471 /* Warn about storage classes that are invalid for certain
10472 kinds of declarations (parameters, typenames, etc.). */
10474 /* "static __thread" and "extern __thread" are allowed. */
10476 && RIDBIT_SETP (RID_THREAD, specbits)
10477 && (RIDBIT_SETP (RID_EXTERN, specbits)
10478 || RIDBIT_SETP (RID_STATIC, specbits)))
10482 error ("multiple storage classes in declaration of `%s'", name);
10483 else if (decl_context != NORMAL && nclasses > 0)
10485 if ((decl_context == PARM || decl_context == CATCHPARM)
10486 && (RIDBIT_SETP (RID_REGISTER, specbits)
10487 || RIDBIT_SETP (RID_AUTO, specbits)))
10489 else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10491 else if (decl_context == FIELD
10492 /* C++ allows static class elements */
10493 && RIDBIT_SETP (RID_STATIC, specbits))
10494 /* C++ also allows inlines and signed and unsigned elements,
10495 but in those cases we don't come in here. */
10499 if (decl_context == FIELD)
10501 tree tmp = NULL_TREE;
10502 register int op = 0;
10506 /* Avoid trying to get an operand off an identifier node. */
10507 if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10510 tmp = TREE_OPERAND (declarator, 0);
10511 op = IDENTIFIER_OPNAME_P (tmp);
10512 if (IDENTIFIER_TYPENAME_P (tmp))
10514 if (IDENTIFIER_GLOBAL_VALUE (tmp)
10515 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp))
10517 name = IDENTIFIER_POINTER (tmp);
10519 name = "<invalid operator>";
10522 error ("storage class specified for %s `%s'",
10523 op ? "member operator" : "field",
10528 if (decl_context == PARM || decl_context == CATCHPARM)
10529 error ("storage class specified for parameter `%s'", name);
10531 error ("storage class specified for typename");
10533 RIDBIT_RESET (RID_REGISTER, specbits);
10534 RIDBIT_RESET (RID_AUTO, specbits);
10535 RIDBIT_RESET (RID_EXTERN, specbits);
10536 RIDBIT_RESET (RID_THREAD, specbits);
10539 else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
10541 if (toplevel_bindings_p ())
10543 /* It's common practice (and completely valid) to have a const
10544 be initialized and declared extern. */
10545 if (!(type_quals & TYPE_QUAL_CONST))
10546 warning ("`%s' initialized and declared `extern'", name);
10549 error ("`%s' has both `extern' and initializer", name);
10551 else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
10552 && ! toplevel_bindings_p ())
10553 error ("nested function `%s' declared `extern'", name);
10554 else if (toplevel_bindings_p ())
10556 if (RIDBIT_SETP (RID_AUTO, specbits))
10557 error ("top-level declaration of `%s' specifies `auto'", name);
10559 else if (RIDBIT_SETP (RID_THREAD, specbits)
10560 && !RIDBIT_SETP (RID_EXTERN, specbits)
10561 && !RIDBIT_SETP (RID_STATIC, specbits))
10563 error ("function-scope `%s' implicitly auto and declared `__thread'",
10565 RIDBIT_RESET (RID_THREAD, specbits);
10568 if (nclasses > 0 && friendp)
10569 error ("storage class specifiers invalid in friend function declarations");
10571 scope = get_scope_of_declarator (declarator);
10573 /* Now figure out the structure of the declarator proper.
10574 Descend through it, creating more complex types, until we reach
10575 the declared identifier (or NULL_TREE, in an abstract declarator). */
10577 while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
10578 && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
10580 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10581 an INDIRECT_REF (for *...),
10582 a CALL_EXPR (for ...(...)),
10583 an identifier (for the name being declared)
10584 or a null pointer (for the place in an absolute declarator
10585 where the name was omitted).
10586 For the last two cases, we have just exited the loop.
10588 For C++ it could also be
10589 a SCOPE_REF (for class :: ...). In this case, we have converted
10590 sensible names to types, and those are the values we use to
10591 qualify the member name.
10592 an ADDR_EXPR (for &...),
10593 a BIT_NOT_EXPR (for destructors)
10595 At this point, TYPE is the type of elements of an array,
10596 or for a function to return, or for a pointer to point to.
10597 After this sequence of ifs, TYPE is the type of the
10598 array or function or pointer, and DECLARATOR has had its
10599 outermost layer removed. */
10601 if (type == error_mark_node)
10603 if (TREE_CODE (declarator) == SCOPE_REF)
10604 declarator = TREE_OPERAND (declarator, 1);
10606 declarator = TREE_OPERAND (declarator, 0);
10609 if (quals != NULL_TREE
10610 && (declarator == NULL_TREE
10611 || TREE_CODE (declarator) != SCOPE_REF))
10613 if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
10614 ctype = TYPE_METHOD_BASETYPE (type);
10615 if (ctype != NULL_TREE)
10617 tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
10618 grok_method_quals (ctype, dummy, quals);
10619 type = TREE_TYPE (dummy);
10624 switch (TREE_CODE (declarator))
10628 /* We encode a declarator with embedded attributes using
10630 tree attrs = TREE_PURPOSE (declarator);
10634 declarator = TREE_VALUE (declarator);
10635 inner_decl = declarator;
10636 while (inner_decl != NULL_TREE
10637 && TREE_CODE (inner_decl) == TREE_LIST)
10638 inner_decl = TREE_VALUE (inner_decl);
10640 if (inner_decl == NULL_TREE
10641 || TREE_CODE (inner_decl) == IDENTIFIER_NODE)
10642 attr_flags |= (int) ATTR_FLAG_DECL_NEXT;
10643 if (TREE_CODE (inner_decl) == CALL_EXPR)
10644 attr_flags |= (int) ATTR_FLAG_FUNCTION_NEXT;
10645 if (TREE_CODE (inner_decl) == ARRAY_REF)
10646 attr_flags |= (int) ATTR_FLAG_ARRAY_NEXT;
10647 returned_attrs = decl_attributes (&type,
10648 chainon (returned_attrs, attrs),
10655 register tree size;
10657 size = TREE_OPERAND (declarator, 1);
10659 /* VC++ spells a zero-sized array with []. */
10660 if (size == NULL_TREE && decl_context == FIELD && ! staticp
10661 && ! RIDBIT_SETP (RID_TYPEDEF, specbits))
10662 size = integer_zero_node;
10664 declarator = TREE_OPERAND (declarator, 0);
10666 type = create_array_type_for_decl (dname, type, size);
10676 tree inner_parms = CALL_DECLARATOR_PARMS (declarator);
10677 tree inner_decl = TREE_OPERAND (declarator, 0);
10679 /* Declaring a function type.
10680 Make sure we have a valid type for the function to return. */
10682 /* We now know that the TYPE_QUALS don't apply to the
10683 decl, but to its return type. */
10684 type_quals = TYPE_UNQUALIFIED;
10686 /* Warn about some types functions can't return. */
10688 if (TREE_CODE (type) == FUNCTION_TYPE)
10690 error ("`%s' declared as function returning a function", name);
10691 type = integer_type_node;
10693 if (TREE_CODE (type) == ARRAY_TYPE)
10695 error ("`%s' declared as function returning an array", name);
10696 type = integer_type_node;
10699 if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
10700 inner_decl = TREE_OPERAND (inner_decl, 1);
10702 if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
10703 inner_decl = dname;
10705 /* Pick up type qualifiers which should be applied to `this'. */
10706 quals = CALL_DECLARATOR_QUALS (declarator);
10708 /* Pick up the exception specifications. */
10709 raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator);
10711 /* Say it's a definition only for the CALL_EXPR
10712 closest to the identifier. */
10715 && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
10716 || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
10717 || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
10719 if (ctype == NULL_TREE
10720 && decl_context == FIELD
10722 && (friendp == 0 || dname == current_class_name))
10723 ctype = current_class_type;
10725 if (ctype && sfk == sfk_conversion)
10726 TYPE_HAS_CONVERSION (ctype) = 1;
10727 if (ctype && constructor_name_p (dname, ctype))
10729 /* We are within a class's scope. If our declarator name
10730 is the same as the class name, and we are defining
10731 a function, then it is a constructor/destructor, and
10732 therefore returns a void type. */
10734 if (flags == DTOR_FLAG)
10736 /* ISO C++ 12.4/2. A destructor may not be
10737 declared const or volatile. A destructor may
10740 error ("destructor cannot be static member function");
10743 error ("destructors may not be `%s'",
10744 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10747 if (decl_context == FIELD)
10749 if (! member_function_or_else (ctype,
10750 current_class_type,
10752 return void_type_node;
10755 else /* It's a constructor. */
10757 if (explicitp == 1)
10759 /* ISO C++ 12.1. A constructor may not be
10760 declared const or volatile. A constructor may
10761 not be virtual. A constructor may not be
10764 error ("constructor cannot be static member function");
10767 pedwarn ("constructors cannot be declared virtual");
10772 error ("constructors may not be `%s'",
10773 IDENTIFIER_POINTER (TREE_VALUE (quals)));
10777 RID_BIT_TYPE tmp_bits;
10778 memcpy (&tmp_bits, &specbits, sizeof (RID_BIT_TYPE));
10779 RIDBIT_RESET (RID_INLINE, tmp_bits);
10780 RIDBIT_RESET (RID_STATIC, tmp_bits);
10781 if (RIDBIT_ANY_SET (tmp_bits))
10782 error ("return value type specifier for constructor ignored");
10784 if (decl_context == FIELD)
10786 if (! member_function_or_else (ctype,
10787 current_class_type,
10789 return void_type_node;
10790 TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10791 if (sfk != sfk_constructor)
10795 if (decl_context == FIELD)
10801 error ("can't initialize friend function `%s'", name);
10804 /* Cannot be both friend and virtual. */
10805 error ("virtual functions cannot be friends");
10806 RIDBIT_RESET (RID_FRIEND, specbits);
10809 if (decl_context == NORMAL)
10810 error ("friend declaration not in class definition");
10811 if (current_function_decl && funcdef_flag)
10812 error ("can't define friend function `%s' in a local class definition",
10816 /* Construct the function type and go to the next
10817 inner layer of declarator. */
10819 declarator = TREE_OPERAND (declarator, 0);
10821 /* FIXME: This is where default args should be fully
10824 arg_types = grokparms (inner_parms);
10826 if (declarator && flags == DTOR_FLAG)
10828 /* A destructor declared in the body of a class will
10829 be represented as a BIT_NOT_EXPR. But, we just
10830 want the underlying IDENTIFIER. */
10831 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10832 declarator = TREE_OPERAND (declarator, 0);
10834 if (arg_types != void_list_node)
10836 error ("destructors may not have parameters");
10837 arg_types = void_list_node;
10838 last_function_parms = NULL_TREE;
10842 /* ANSI says that `const int foo ();'
10843 does not make the function foo const. */
10844 type = build_function_type (type, arg_types);
10850 /* Filter out pointers-to-references and references-to-references.
10851 We can get these if a TYPE_DECL is used. */
10853 if (TREE_CODE (type) == REFERENCE_TYPE)
10855 error (TREE_CODE (declarator) == ADDR_EXPR
10856 ? "cannot declare reference to `%#T'"
10857 : "cannot declare pointer to `%#T'", type);
10858 type = TREE_TYPE (type);
10860 else if (VOID_TYPE_P (type)
10861 && (ctype || TREE_CODE (declarator) == ADDR_EXPR))
10862 error (ctype ? "cannot declare pointer to `%#T' member"
10863 : "cannot declare reference to `%#T'", type);
10865 /* Merge any constancy or volatility into the target type
10866 for the pointer. */
10868 /* We now know that the TYPE_QUALS don't apply to the decl,
10869 but to the target of the pointer. */
10870 type_quals = TYPE_UNQUALIFIED;
10872 if (TREE_CODE (declarator) == ADDR_EXPR)
10874 if (!VOID_TYPE_P (type))
10875 type = build_reference_type (type);
10877 else if (TREE_CODE (type) == METHOD_TYPE)
10878 type = build_ptrmemfunc_type (build_pointer_type (type));
10880 type = build_ptrmem_type (ctype, type);
10882 type = build_pointer_type (type);
10884 /* Process a list of type modifier keywords (such as
10885 const or volatile) that were given inside the `*' or `&'. */
10887 if (TREE_TYPE (declarator))
10889 register tree typemodlist;
10895 for (typemodlist = TREE_TYPE (declarator); typemodlist;
10896 typemodlist = TREE_CHAIN (typemodlist))
10898 tree qualifier = TREE_VALUE (typemodlist);
10900 if (qualifier == ridpointers[(int) RID_CONST])
10903 type_quals |= TYPE_QUAL_CONST;
10905 else if (qualifier == ridpointers[(int) RID_VOLATILE])
10908 type_quals |= TYPE_QUAL_VOLATILE;
10910 else if (qualifier == ridpointers[(int) RID_RESTRICT])
10913 type_quals |= TYPE_QUAL_RESTRICT;
10918 error ("invalid type modifier within pointer declarator");
10922 pedwarn ("duplicate `const'");
10924 pedwarn ("duplicate `volatile'");
10926 pedwarn ("duplicate `restrict'");
10927 type = cp_build_qualified_type (type, type_quals);
10928 type_quals = cp_type_quals (type);
10930 declarator = TREE_OPERAND (declarator, 0);
10936 /* We have converted type names to NULL_TREE if the
10937 name was bogus, or to a _TYPE node, if not.
10939 The variable CTYPE holds the type we will ultimately
10940 resolve to. The code here just needs to build
10941 up appropriate member types. */
10942 tree sname = TREE_OPERAND (declarator, 1);
10945 /* Destructors can have their visibilities changed as well. */
10946 if (TREE_CODE (sname) == BIT_NOT_EXPR)
10947 sname = TREE_OPERAND (sname, 0);
10949 if (TREE_OPERAND (declarator, 0) == NULL_TREE)
10951 /* We had a reference to a global decl, or
10952 perhaps we were given a non-aggregate typedef,
10953 in which case we cleared this out, and should just
10954 keep going as though it wasn't there. */
10955 declarator = sname;
10958 ctype = TREE_OPERAND (declarator, 0);
10961 while (t != NULL_TREE && CLASS_TYPE_P (t))
10963 /* You're supposed to have one `template <...>'
10964 for every template class, but you don't need one
10965 for a full specialization. For example:
10967 template <class T> struct S{};
10968 template <> struct S<int> { void f(); };
10969 void S<int>::f () {}
10971 is correct; there shouldn't be a `template <>' for
10972 the definition of `S<int>::f'. */
10973 if (CLASSTYPE_TEMPLATE_INFO (t)
10974 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t)
10975 || uses_template_parms (CLASSTYPE_TI_ARGS (t)))
10976 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t)))
10977 template_count += 1;
10979 t = TYPE_MAIN_DECL (t);
10980 t = DECL_CONTEXT (t);
10983 if (sname == NULL_TREE)
10986 if (TREE_CODE (sname) == IDENTIFIER_NODE)
10988 /* This is the `standard' use of the scoping operator:
10989 basetype :: member . */
10991 if (ctype == current_class_type)
10997 Is this ill-formed? */
11000 pedwarn ("extra qualification `%T::' on member `%s' ignored",
11003 else if (TREE_CODE (type) == FUNCTION_TYPE)
11005 if (current_class_type == NULL_TREE || friendp)
11006 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11007 TYPE_ARG_TYPES (type));
11010 error ("cannot declare member function `%T::%s' within `%T'",
11011 ctype, name, current_class_type);
11012 return error_mark_node;
11015 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
11016 || COMPLETE_TYPE_P (complete_type (ctype)))
11018 /* Have to move this code elsewhere in this function.
11019 this code is used for i.e., typedef int A::M; M *pm;
11021 It is? How? jason 10/2/94 */
11023 if (current_class_type)
11025 error ("cannot declare member `%T::%s' within `%T'",
11026 ctype, name, current_class_type);
11027 return void_type_node;
11032 cxx_incomplete_type_error (NULL_TREE, ctype);
11033 return error_mark_node;
11036 declarator = sname;
11038 else if (TREE_CODE (sname) == SCOPE_REF)
11043 declarator = TREE_OPERAND (declarator, 1);
11044 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
11045 /* In this case, we will deal with it later. */
11047 else if (TREE_CODE (type) == FUNCTION_TYPE)
11048 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11049 TYPE_ARG_TYPES (type));
11055 declarator = TREE_OPERAND (declarator, 0);
11059 declarator = BASELINK_FUNCTIONS (declarator);
11064 case ENUMERAL_TYPE:
11065 declarator = NULL_TREE;
11069 declarator = NULL_TREE;
11077 if (returned_attrs)
11080 *attrlist = chainon (returned_attrs, *attrlist);
11082 attrlist = &returned_attrs;
11085 /* Now TYPE has the actual type. */
11087 /* Did array size calculations overflow? */
11089 if (TREE_CODE (type) == ARRAY_TYPE
11090 && COMPLETE_TYPE_P (type)
11091 && TREE_OVERFLOW (TYPE_SIZE (type)))
11093 error ("size of array `%s' is too large", name);
11094 /* If we proceed with the array type as it is, we'll eventually
11095 crash in tree_low_cst(). */
11096 type = error_mark_node;
11099 if ((decl_context == FIELD || decl_context == PARM)
11100 && !processing_template_decl
11101 && variably_modified_type_p (type))
11103 if (decl_context == FIELD)
11104 error ("data member may not have variably modified type `%T'", type);
11106 error ("parameter may not have variably modified type `%T'", type);
11107 type = error_mark_node;
11110 if (explicitp == 1 || (explicitp && friendp))
11112 /* [dcl.fct.spec] The explicit specifier shall only be used in
11113 declarations of constructors within a class definition. */
11114 error ("only declarations of constructors can be `explicit'");
11118 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11120 if (current_class_name == NULL_TREE || decl_context == PARM || friendp)
11122 error ("non-member `%s' cannot be declared `mutable'", name);
11123 RIDBIT_RESET (RID_MUTABLE, specbits);
11125 else if (decl_context == TYPENAME || RIDBIT_SETP (RID_TYPEDEF, specbits))
11127 error ("non-object member `%s' cannot be declared `mutable'", name);
11128 RIDBIT_RESET (RID_MUTABLE, specbits);
11130 else if (TREE_CODE (type) == FUNCTION_TYPE
11131 || TREE_CODE (type) == METHOD_TYPE)
11133 error ("function `%s' cannot be declared `mutable'", name);
11134 RIDBIT_RESET (RID_MUTABLE, specbits);
11138 error ("static `%s' cannot be declared `mutable'", name);
11139 RIDBIT_RESET (RID_MUTABLE, specbits);
11141 else if (type_quals & TYPE_QUAL_CONST)
11143 error ("const `%s' cannot be declared `mutable'", name);
11144 RIDBIT_RESET (RID_MUTABLE, specbits);
11148 if (declarator == NULL_TREE
11149 || TREE_CODE (declarator) == IDENTIFIER_NODE
11150 || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR
11151 && (TREE_CODE (type) == FUNCTION_TYPE
11152 || TREE_CODE (type) == METHOD_TYPE)))
11154 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11156 error ("template-id `%D' used as a declarator", declarator);
11157 declarator = dname;
11160 /* Unexpected declarator format. */
11163 /* If this is declaring a typedef name, return a TYPE_DECL. */
11165 if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
11169 /* Note that the grammar rejects storage classes
11170 in typenames, fields or parameters. */
11171 if (current_lang_name == lang_name_java)
11172 TYPE_FOR_JAVA (type) = 1;
11174 if (decl_context == FIELD)
11176 if (constructor_name_p (declarator, current_class_type))
11177 pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11179 decl = build_lang_decl (TYPE_DECL, declarator, type);
11183 decl = build_decl (TYPE_DECL, declarator, type);
11184 if (in_namespace || ctype)
11185 cp_error_at ("typedef name may not be a nested-name-specifier",
11187 if (!current_function_decl)
11188 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
11191 /* If the user declares "typedef struct {...} foo" then the
11192 struct will have an anonymous name. Fill that name in now.
11193 Nothing can refer to it, so nothing needs know about the name
11195 if (type != error_mark_node
11197 && TYPE_NAME (type)
11198 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
11199 && TYPE_ANONYMOUS_P (type)
11200 /* Don't do this if there are attributes. */
11201 && (!attrlist || !*attrlist)
11202 && cp_type_quals (type) == TYPE_UNQUALIFIED)
11204 tree oldname = TYPE_NAME (type);
11207 /* Replace the anonymous name with the real name everywhere. */
11208 lookup_tag_reverse (type, declarator);
11209 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
11210 if (TYPE_NAME (t) == oldname)
11211 TYPE_NAME (t) = decl;
11213 if (TYPE_LANG_SPECIFIC (type))
11214 TYPE_WAS_ANONYMOUS (type) = 1;
11216 /* If this is a typedef within a template class, the nested
11217 type is a (non-primary) template. The name for the
11218 template needs updating as well. */
11219 if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
11220 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
11221 = TYPE_IDENTIFIER (type);
11223 /* FIXME remangle member functions; member functions of a
11224 type with external linkage have external linkage. */
11229 if (ctype == NULL_TREE)
11231 if (TREE_CODE (type) != METHOD_TYPE)
11232 cp_error_at ("invalid type qualifier for non-member function type", decl);
11234 ctype = TYPE_METHOD_BASETYPE (type);
11236 if (ctype != NULL_TREE)
11237 grok_method_quals (ctype, decl, quals);
11240 if (RIDBIT_SETP (RID_SIGNED, specbits)
11241 || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
11242 C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
11244 bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
11245 inlinep, friendp, raises != NULL_TREE);
11250 /* Detect the case of an array type of unspecified size
11251 which came, as such, direct from a typedef name.
11252 We must copy the type, so that the array's domain can be
11253 individually set by the object's initializer. */
11255 if (type && typedef_type
11256 && TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
11257 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (typedef_type))
11258 type = build_cplus_array_type (TREE_TYPE (type), NULL_TREE);
11260 /* Detect where we're using a typedef of function type to declare a
11261 function. last_function_parms will not be set, so we must create
11264 if (type == typedef_type && TREE_CODE (type) == FUNCTION_TYPE)
11266 tree decls = NULL_TREE;
11269 for (args = TYPE_ARG_TYPES (type); args; args = TREE_CHAIN (args))
11271 tree decl = cp_build_parm_decl (NULL_TREE, TREE_VALUE (args));
11273 TREE_CHAIN (decl) = decls;
11277 last_function_parms = nreverse (decls);
11280 /* If this is a type name (such as, in a cast or sizeof),
11281 compute the type and return it now. */
11283 if (decl_context == TYPENAME)
11285 /* Note that the grammar rejects storage classes
11286 in typenames, fields or parameters. */
11287 if (type_quals != TYPE_UNQUALIFIED)
11288 type_quals = TYPE_UNQUALIFIED;
11290 /* Special case: "friend class foo" looks like a TYPENAME context. */
11293 if (type_quals != TYPE_UNQUALIFIED)
11295 error ("type qualifiers specified for friend class declaration");
11296 type_quals = TYPE_UNQUALIFIED;
11300 error ("`inline' specified for friend class declaration");
11306 /* Don't allow friend declaration without a class-key. */
11307 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11308 pedwarn ("template parameters cannot be friends");
11309 else if (TREE_CODE (type) == TYPENAME_TYPE)
11310 pedwarn ("friend declaration requires class-key, "
11311 "i.e. `friend class %T::%D'",
11312 TYPE_CONTEXT (type), TYPENAME_TYPE_FULLNAME (type));
11314 pedwarn ("friend declaration requires class-key, "
11315 "i.e. `friend %#T'",
11319 /* Only try to do this stuff if we didn't already give up. */
11320 if (type != integer_type_node)
11322 /* A friendly class? */
11323 if (current_class_type)
11324 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
11326 error ("trying to make class `%T' a friend of global scope",
11329 type = void_type_node;
11334 if (ctype == NULL_TREE)
11336 if (TREE_CODE (type) != METHOD_TYPE)
11337 error ("invalid qualifiers on non-member function type");
11339 ctype = TYPE_METHOD_BASETYPE (type);
11343 tree dummy = build_decl (TYPE_DECL, declarator, type);
11344 grok_method_quals (ctype, dummy, quals);
11345 type = TREE_TYPE (dummy);
11351 else if (declarator == NULL_TREE && decl_context != PARM
11352 && decl_context != CATCHPARM
11353 && TREE_CODE (type) != UNION_TYPE
11356 error ("abstract declarator `%T' used as declaration", type);
11357 declarator = make_anon_name ();
11360 /* `void' at top level (not within pointer)
11361 is allowed only in typedefs or type names.
11362 We don't complain about parms either, but that is because
11363 a better error message can be made later. */
11365 if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
11368 error ("unnamed variable or field declared void");
11369 else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
11371 if (IDENTIFIER_OPNAME_P (declarator))
11374 error ("variable or field `%s' declared void", name);
11377 error ("variable or field declared void");
11378 type = integer_type_node;
11381 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11382 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11384 if (decl_context == PARM || decl_context == CATCHPARM)
11386 if (ctype || in_namespace)
11387 error ("cannot use `::' in parameter declaration");
11389 /* A parameter declared as an array of T is really a pointer to T.
11390 One declared as a function is really a pointer to a function.
11391 One declared as a member is really a pointer to member. */
11393 if (TREE_CODE (type) == ARRAY_TYPE)
11395 /* Transfer const-ness of array into that of type pointed to. */
11396 type = build_pointer_type (TREE_TYPE (type));
11397 type_quals = TYPE_UNQUALIFIED;
11399 else if (TREE_CODE (type) == FUNCTION_TYPE)
11400 type = build_pointer_type (type);
11401 else if (TREE_CODE (type) == OFFSET_TYPE)
11402 type = build_pointer_type (type);
11406 register tree decl;
11408 if (decl_context == PARM)
11410 decl = cp_build_parm_decl (declarator, type);
11412 bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
11413 inlinep, friendp, raises != NULL_TREE);
11415 else if (decl_context == FIELD)
11417 if (type == error_mark_node)
11419 /* Happens when declaring arrays of sizes which
11420 are error_mark_node, for example. */
11423 else if (in_namespace && !friendp)
11425 /* Something like struct S { int N::j; }; */
11426 error ("invalid use of `::'");
11429 else if (TREE_CODE (type) == FUNCTION_TYPE)
11432 tree function_context;
11434 /* We catch the others as conflicts with the builtin
11436 if (friendp && declarator == ridpointers[(int) RID_SIGNED])
11438 error ("function `%D' cannot be declared friend",
11445 if (ctype == NULL_TREE)
11446 ctype = current_class_type;
11448 if (ctype == NULL_TREE)
11450 error ("can't make `%D' into a method -- not in a class",
11452 return void_type_node;
11455 /* ``A union may [ ... ] not [ have ] virtual functions.''
11457 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
11459 error ("function `%D' declared virtual inside a union",
11461 return void_type_node;
11464 if (declarator == ansi_opname (NEW_EXPR)
11465 || declarator == ansi_opname (VEC_NEW_EXPR)
11466 || declarator == ansi_opname (DELETE_EXPR)
11467 || declarator == ansi_opname (VEC_DELETE_EXPR))
11471 error ("`%D' cannot be declared virtual, since it is always static",
11476 else if (staticp < 2)
11477 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11478 TYPE_ARG_TYPES (type));
11481 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11482 function_context = (ctype != NULL_TREE) ?
11483 decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
11484 publicp = (! friendp || ! staticp)
11485 && function_context == NULL_TREE;
11486 decl = grokfndecl (ctype, type,
11487 TREE_CODE (declarator) != TEMPLATE_ID_EXPR
11488 ? declarator : dname,
11490 virtualp, flags, quals, raises,
11491 friendp ? -1 : 0, friendp, publicp, inlinep,
11492 funcdef_flag, template_count, in_namespace);
11493 if (decl == NULL_TREE)
11496 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11497 /* The decl and setting of decl_attr is also turned off. */
11498 decl = build_decl_attribute_variant (decl, decl_attr);
11501 /* [class.conv.ctor]
11503 A constructor declared without the function-specifier
11504 explicit that can be called with a single parameter
11505 specifies a conversion from the type of its first
11506 parameter to the type of its class. Such a constructor
11507 is called a converting constructor. */
11508 if (explicitp == 2)
11509 DECL_NONCONVERTING_P (decl) = 1;
11510 else if (DECL_CONSTRUCTOR_P (decl))
11512 /* The constructor can be called with exactly one
11513 parameter if there is at least one parameter, and
11514 any subsequent parameters have default arguments.
11515 Ignore any compiler-added parms. */
11516 tree arg_types = FUNCTION_FIRST_USER_PARMTYPE (decl);
11518 if (arg_types == void_list_node
11520 && TREE_CHAIN (arg_types)
11521 && TREE_CHAIN (arg_types) != void_list_node
11522 && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
11523 DECL_NONCONVERTING_P (decl) = 1;
11526 else if (TREE_CODE (type) == METHOD_TYPE)
11528 /* We only get here for friend declarations of
11529 members of other classes. */
11530 /* All method decls are public, so tell grokfndecl to set
11531 TREE_PUBLIC, also. */
11532 decl = grokfndecl (ctype, type, declarator, declarator,
11533 virtualp, flags, quals, raises,
11534 friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
11535 template_count, in_namespace);
11536 if (decl == NULL_TREE)
11539 else if (!staticp && ! processing_template_decl
11540 && !COMPLETE_TYPE_P (complete_type (type))
11541 && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
11544 error ("field `%D' has incomplete type", declarator);
11546 error ("name `%T' has incomplete type", type);
11548 /* If we're instantiating a template, tell them which
11549 instantiation made the field's type be incomplete. */
11550 if (current_class_type
11551 && TYPE_NAME (current_class_type)
11552 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
11553 && declspecs && TREE_VALUE (declspecs)
11554 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
11555 error (" in instantiation of template `%T'",
11556 current_class_type);
11558 type = error_mark_node;
11565 error ("`%s' is neither function nor member function; cannot be declared friend",
11566 IDENTIFIER_POINTER (declarator));
11574 /* Friends are treated specially. */
11575 if (ctype == current_class_type)
11576 warning ("member functions are implicitly friends of their class");
11579 tree t = NULL_TREE;
11580 if (decl && DECL_NAME (decl))
11582 if (template_class_depth (current_class_type) == 0)
11585 = check_explicit_specialization
11587 template_count, 2 * (funcdef_flag != 0) + 4);
11588 if (decl == error_mark_node)
11589 return error_mark_node;
11592 t = do_friend (ctype, declarator, decl,
11593 last_function_parms, *attrlist,
11594 flags, quals, funcdef_flag);
11596 if (t && funcdef_flag)
11599 return void_type_node;
11603 /* Structure field. It may not be a function, except for C++ */
11605 if (decl == NULL_TREE)
11611 /* An attempt is being made to initialize a non-static
11612 member. But, from [class.mem]:
11614 4 A member-declarator can contain a
11615 constant-initializer only if it declares a static
11616 member (_class.static_) of integral or enumeration
11617 type, see _class.static.data_.
11619 This used to be relatively common practice, but
11620 the rest of the compiler does not correctly
11621 handle the initialization unless the member is
11622 static so we make it static below. */
11623 pedwarn ("ISO C++ forbids initialization of member `%D'",
11625 pedwarn ("making `%D' static", declarator);
11629 if (uses_template_parms (type))
11630 /* We'll check at instantiation time. */
11632 else if (check_static_variable_definition (declarator,
11634 /* If we just return the declaration, crashes
11635 will sometimes occur. We therefore return
11636 void_type_node, as if this was a friend
11637 declaration, to cause callers to completely
11638 ignore this declaration. */
11639 return void_type_node;
11642 /* 9.2p13 [class.mem] */
11643 if (constructor_name_p (declarator, current_class_type)
11644 /* The standard does not allow non-static data members
11645 here either, but we agreed at the 10/99 meeting
11646 to change that in TC 1 so that they are allowed in
11647 classes with no user-defined constructors. */
11649 pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11654 /* C++ allows static class members. All other work
11655 for this is done by grokfield. */
11656 decl = build_lang_decl (VAR_DECL, declarator, type);
11657 TREE_STATIC (decl) = 1;
11658 /* In class context, 'static' means public access. */
11659 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
11663 decl = build_decl (FIELD_DECL, declarator, type);
11664 DECL_NONADDRESSABLE_P (decl) = bitfield;
11665 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11667 DECL_MUTABLE_P (decl) = 1;
11668 RIDBIT_RESET (RID_MUTABLE, specbits);
11672 bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
11673 inlinep, friendp, raises != NULL_TREE);
11676 else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
11678 tree original_name;
11684 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11685 original_name = dname;
11687 original_name = declarator;
11689 if (RIDBIT_SETP (RID_AUTO, specbits))
11690 error ("storage class `auto' invalid for function `%s'", name);
11691 else if (RIDBIT_SETP (RID_REGISTER, specbits))
11692 error ("storage class `register' invalid for function `%s'", name);
11693 else if (RIDBIT_SETP (RID_THREAD, specbits))
11694 error ("storage class `__thread' invalid for function `%s'", name);
11696 /* Function declaration not at top level.
11697 Storage classes other than `extern' are not allowed
11698 and `extern' makes no difference. */
11699 if (! toplevel_bindings_p ()
11700 && (RIDBIT_SETP (RID_STATIC, specbits)
11701 || RIDBIT_SETP (RID_INLINE, specbits))
11704 if (RIDBIT_SETP (RID_STATIC, specbits))
11705 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
11707 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
11710 if (ctype == NULL_TREE)
11714 error ("virtual non-class function `%s'", name);
11718 else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
11719 type = build_cplus_method_type (ctype, TREE_TYPE (type),
11720 TYPE_ARG_TYPES (type));
11722 /* Record presence of `static'. */
11723 publicp = (ctype != NULL_TREE
11724 || RIDBIT_SETP (RID_EXTERN, specbits)
11725 || !RIDBIT_SETP (RID_STATIC, specbits));
11727 decl = grokfndecl (ctype, type, original_name, declarator,
11728 virtualp, flags, quals, raises,
11730 publicp, inlinep, funcdef_flag,
11731 template_count, in_namespace);
11732 if (decl == NULL_TREE)
11737 int invalid_static = 0;
11739 /* Don't allow a static member function in a class, and forbid
11740 declaring main to be static. */
11741 if (TREE_CODE (type) == METHOD_TYPE)
11743 pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11744 invalid_static = 1;
11746 else if (current_function_decl)
11748 /* FIXME need arm citation */
11749 error ("cannot declare static function inside another function");
11750 invalid_static = 1;
11753 if (invalid_static)
11756 RIDBIT_RESET (RID_STATIC, specbits);
11762 /* It's a variable. */
11764 /* An uninitialized decl with `extern' is a reference. */
11765 decl = grokvardecl (type, declarator, &specbits,
11767 (type_quals & TYPE_QUAL_CONST) != 0,
11768 ctype ? ctype : in_namespace);
11769 bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11770 inlinep, friendp, raises != NULL_TREE);
11774 DECL_CONTEXT (decl) = ctype;
11777 pedwarn ("`static' may not be used when defining (as opposed to declaring) a static data member");
11779 RIDBIT_RESET (RID_STATIC, specbits);
11781 if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11783 error ("static member `%D' declared `register'", decl);
11784 RIDBIT_RESET (RID_REGISTER, specbits);
11786 if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11788 pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11790 RIDBIT_RESET (RID_EXTERN, specbits);
11795 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE, specbits), 19990927);
11797 /* Record `register' declaration for warnings on &
11798 and in case doing stupid register allocation. */
11800 if (RIDBIT_SETP (RID_REGISTER, specbits))
11801 DECL_REGISTER (decl) = 1;
11803 if (RIDBIT_SETP (RID_EXTERN, specbits))
11804 DECL_THIS_EXTERN (decl) = 1;
11806 if (RIDBIT_SETP (RID_STATIC, specbits))
11807 DECL_THIS_STATIC (decl) = 1;
11809 /* Record constancy and volatility. There's no need to do this
11810 when processing a template; we'll do this for the instantiated
11811 declaration based on the type of DECL. */
11812 if (!processing_template_decl)
11813 c_apply_type_quals_to_decl (type_quals, decl);
11819 /* Subroutine of start_function. Ensure that each of the parameter
11820 types (as listed in PARMS) is complete, as is required for a
11821 function definition. */
11824 require_complete_types_for_parms (tree parms)
11826 for (; parms; parms = TREE_CHAIN (parms))
11828 if (VOID_TYPE_P (TREE_TYPE (parms)))
11829 /* grokparms will have already issued an error */
11830 TREE_TYPE (parms) = error_mark_node;
11831 else if (complete_type_or_else (TREE_TYPE (parms), parms))
11833 layout_decl (parms, 0);
11834 DECL_ARG_TYPE (parms) = type_passed_as (TREE_TYPE (parms));
11837 TREE_TYPE (parms) = error_mark_node;
11841 /* Returns nonzero if T is a local variable. */
11844 local_variable_p (tree t)
11846 if ((TREE_CODE (t) == VAR_DECL
11847 /* A VAR_DECL with a context that is a _TYPE is a static data
11849 && !TYPE_P (CP_DECL_CONTEXT (t))
11850 /* Any other non-local variable must be at namespace scope. */
11851 && !DECL_NAMESPACE_SCOPE_P (t))
11852 || (TREE_CODE (t) == PARM_DECL))
11858 /* Returns nonzero if T is an automatic local variable or a label.
11859 (These are the declarations that need to be remapped when the code
11860 containing them is duplicated.) */
11863 nonstatic_local_decl_p (tree t)
11865 return ((local_variable_p (t) && !TREE_STATIC (t))
11866 || TREE_CODE (t) == LABEL_DECL
11867 || TREE_CODE (t) == RESULT_DECL);
11870 /* Like local_variable_p, but suitable for use as a tree-walking
11874 local_variable_p_walkfn (tree* tp,
11875 int* walk_subtrees ATTRIBUTE_UNUSED ,
11876 void* data ATTRIBUTE_UNUSED )
11878 return ((local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp))
11879 ? *tp : NULL_TREE);
11882 /* Check that ARG, which is a default-argument expression for a
11883 parameter DECL, is valid. Returns ARG, or ERROR_MARK_NODE, if
11884 something goes wrong. DECL may also be a _TYPE node, rather than a
11885 DECL, if there is no DECL available. */
11888 check_default_argument (tree decl, tree arg)
11893 if (TREE_CODE (arg) == DEFAULT_ARG)
11894 /* We get a DEFAULT_ARG when looking at an in-class declaration
11895 with a default argument. Ignore the argument for now; we'll
11896 deal with it after the class is complete. */
11899 if (processing_template_decl || uses_template_parms (arg))
11900 /* We don't do anything checking until instantiation-time. Note
11901 that there may be uninstantiated arguments even for an
11902 instantiated function, since default arguments are not
11903 instantiated until they are needed. */
11912 decl_type = TREE_TYPE (decl);
11914 if (arg == error_mark_node
11915 || decl == error_mark_node
11916 || TREE_TYPE (arg) == error_mark_node
11917 || decl_type == error_mark_node)
11918 /* Something already went wrong. There's no need to check
11920 return error_mark_node;
11922 /* [dcl.fct.default]
11924 A default argument expression is implicitly converted to the
11926 if (!TREE_TYPE (arg)
11927 || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
11930 error ("default argument for `%#D' has type `%T'",
11931 decl, TREE_TYPE (arg));
11933 error ("default argument for parameter of type `%T' has type `%T'",
11934 decl_type, TREE_TYPE (arg));
11936 return error_mark_node;
11939 /* [dcl.fct.default]
11941 Local variables shall not be used in default argument
11944 The keyword `this' shall not be used in a default argument of a
11945 member function. */
11946 var = walk_tree_without_duplicates (&arg, local_variable_p_walkfn,
11950 error ("default argument `%E' uses local variable `%D'",
11952 return error_mark_node;
11959 /* Decode the list of parameter types for a function type.
11960 Given the list of things declared inside the parens,
11961 return a list of types.
11963 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11964 flag. If unset, we append void_list_node. A parmlist declared
11965 as `(void)' is accepted as the empty parmlist.
11967 Also set last_function_parms to the chain of PARM_DECLs. */
11970 grokparms (tree first_parm)
11972 tree result = NULL_TREE;
11973 tree decls = NULL_TREE;
11974 int ellipsis = !first_parm || PARMLIST_ELLIPSIS_P (first_parm);
11978 my_friendly_assert (!first_parm || TREE_PARMLIST (first_parm), 20001115);
11980 for (parm = first_parm; parm != NULL_TREE; parm = chain)
11982 tree type = NULL_TREE;
11983 tree decl = TREE_VALUE (parm);
11984 tree init = TREE_PURPOSE (parm);
11987 chain = TREE_CHAIN (parm);
11988 /* @@ weak defense against parse errors. */
11989 if (TREE_CODE (decl) != VOID_TYPE
11990 && TREE_CODE (decl) != TREE_LIST)
11992 /* Give various messages as the need arises. */
11993 if (TREE_CODE (decl) == STRING_CST)
11994 error ("invalid string constant `%E'", decl);
11995 else if (TREE_CODE (decl) == INTEGER_CST)
11996 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12000 if (parm == void_list_node)
12003 split_specs_attrs (TREE_PURPOSE (decl), &specs, &attrs);
12004 decl = grokdeclarator (TREE_VALUE (decl), specs,
12005 PARM, init != NULL_TREE, &attrs);
12006 if (! decl || TREE_TYPE (decl) == error_mark_node)
12010 cplus_decl_attributes (&decl, attrs, 0);
12012 type = TREE_TYPE (decl);
12013 if (VOID_TYPE_P (type))
12015 if (same_type_p (type, void_type_node)
12016 && !DECL_NAME (decl) && !result && !chain && !ellipsis)
12017 /* this is a parmlist of `(void)', which is ok. */
12019 cxx_incomplete_type_error (decl, type);
12020 /* It's not a good idea to actually create parameters of
12021 type `void'; other parts of the compiler assume that a
12022 void type terminates the parameter list. */
12023 type = error_mark_node;
12024 TREE_TYPE (decl) = error_mark_node;
12027 if (type != error_mark_node)
12029 /* Top-level qualifiers on the parameters are
12030 ignored for function types. */
12031 type = TYPE_MAIN_VARIANT (type);
12032 if (TREE_CODE (type) == METHOD_TYPE)
12034 error ("parameter `%D' invalidly declared method type", decl);
12035 type = build_pointer_type (type);
12036 TREE_TYPE (decl) = type;
12038 else if (TREE_CODE (type) == OFFSET_TYPE)
12040 error ("parameter `%D' invalidly declared offset type", decl);
12041 type = build_pointer_type (type);
12042 TREE_TYPE (decl) = type;
12044 else if (abstract_virtuals_error (decl, type))
12045 any_error = 1; /* Seems like a good idea. */
12046 else if (POINTER_TYPE_P (type))
12048 /* [dcl.fct]/6, parameter types cannot contain pointers
12049 (references) to arrays of unknown bound. */
12050 tree t = TREE_TYPE (type);
12051 int ptr = TYPE_PTR_P (type);
12055 if (TYPE_PTR_P (t))
12057 else if (TREE_CODE (t) != ARRAY_TYPE)
12059 else if (!TYPE_DOMAIN (t))
12063 if (TREE_CODE (t) == ARRAY_TYPE)
12064 error ("parameter `%D' includes %s to array of unknown bound `%T'",
12065 decl, ptr ? "pointer" : "reference", t);
12068 if (!any_error && init)
12069 init = check_default_argument (decl, init);
12074 TREE_CHAIN (decl) = decls;
12076 result = tree_cons (init, type, result);
12078 decls = nreverse (decls);
12079 result = nreverse (result);
12081 result = chainon (result, void_list_node);
12082 last_function_parms = decls;
12088 /* D is a constructor or overloaded `operator='.
12090 Let T be the class in which D is declared. Then, this function
12093 -1 if D's is an ill-formed constructor or copy assignment operator
12094 whose first parameter is of type `T'.
12095 0 if D is not a copy constructor or copy assignment
12097 1 if D is a copy constructor or copy assignment operator whose
12098 first parameter is a reference to const qualified T.
12099 2 if D is a copy constructor or copy assignment operator whose
12100 first parameter is a reference to non-const qualified T.
12102 This function can be used as a predicate. Positive values indicate
12103 a copy constructor and nonzero values indicate a copy assignment
12113 my_friendly_assert (DECL_FUNCTION_MEMBER_P (d), 20011208);
12115 if (DECL_TEMPLATE_INFO (d) && is_member_template (DECL_TI_TEMPLATE (d)))
12116 /* Instantiations of template member functions are never copy
12117 functions. Note that member functions of templated classes are
12118 represented as template functions internally, and we must
12119 accept those as copy functions. */
12122 args = FUNCTION_FIRST_USER_PARMTYPE (d);
12126 arg_type = TREE_VALUE (args);
12128 if (TYPE_MAIN_VARIANT (arg_type) == DECL_CONTEXT (d))
12130 /* Pass by value copy assignment operator. */
12133 else if (TREE_CODE (arg_type) == REFERENCE_TYPE
12134 && TYPE_MAIN_VARIANT (TREE_TYPE (arg_type)) == DECL_CONTEXT (d))
12136 if (CP_TYPE_CONST_P (TREE_TYPE (arg_type)))
12142 args = TREE_CHAIN (args);
12144 if (args && args != void_list_node && !TREE_PURPOSE (args))
12145 /* There are more non-optional args. */
12151 /* Remember any special properties of member function DECL. */
12153 void grok_special_member_properties (tree decl)
12155 if (!DECL_NONSTATIC_MEMBER_FUNCTION_P(decl))
12156 ; /* Not special. */
12157 else if (DECL_CONSTRUCTOR_P (decl))
12159 int ctor = copy_fn_p (decl);
12165 A non-template constructor for class X is a copy
12166 constructor if its first parameter is of type X&, const
12167 X&, volatile X& or const volatile X&, and either there
12168 are no other parameters or else all other parameters have
12169 default arguments. */
12170 TYPE_HAS_INIT_REF (DECL_CONTEXT (decl)) = 1;
12172 TYPE_HAS_CONST_INIT_REF (DECL_CONTEXT (decl)) = 1;
12174 else if (sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (decl)))
12175 TYPE_HAS_DEFAULT_CONSTRUCTOR (DECL_CONTEXT (decl)) = 1;
12177 else if (DECL_OVERLOADED_OPERATOR_P (decl) == NOP_EXPR)
12181 A non-template assignment operator for class X is a copy
12182 assignment operator if its parameter is of type X, X&, const
12183 X&, volatile X& or const volatile X&. */
12185 int assop = copy_fn_p (decl);
12189 TYPE_HAS_ASSIGN_REF (DECL_CONTEXT (decl)) = 1;
12191 TYPE_HAS_CONST_ASSIGN_REF (DECL_CONTEXT (decl)) = 1;
12192 if (DECL_PURE_VIRTUAL_P (decl))
12193 TYPE_HAS_ABSTRACT_ASSIGN_REF (DECL_CONTEXT (decl)) = 1;
12198 /* Check a constructor DECL has the correct form. Complains
12199 if the class has a constructor of the form X(X). */
12202 grok_ctor_properties (tree ctype, tree decl)
12204 int ctor_parm = copy_fn_p (decl);
12210 A declaration of a constructor for a class X is ill-formed if
12211 its first parameter is of type (optionally cv-qualified) X
12212 and either there are no other parameters or else all other
12213 parameters have default arguments.
12215 We *don't* complain about member template instantiations that
12216 have this form, though; they can occur as we try to decide
12217 what constructor to use during overload resolution. Since
12218 overload resolution will never prefer such a constructor to
12219 the non-template copy constructor (which is either explicitly
12220 or implicitly defined), there's no need to worry about their
12221 existence. Theoretically, they should never even be
12222 instantiated, but that's hard to forestall. */
12223 error ("invalid constructor; you probably meant `%T (const %T&)'",
12225 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
12232 /* An operator with this code is unary, but can also be binary. */
12235 ambi_op_p (enum tree_code code)
12237 return (code == INDIRECT_REF
12238 || code == ADDR_EXPR
12239 || code == CONVERT_EXPR
12240 || code == NEGATE_EXPR
12241 || code == PREINCREMENT_EXPR
12242 || code == PREDECREMENT_EXPR);
12245 /* An operator with this name can only be unary. */
12248 unary_op_p (enum tree_code code)
12250 return (code == TRUTH_NOT_EXPR
12251 || code == BIT_NOT_EXPR
12252 || code == COMPONENT_REF
12253 || code == TYPE_EXPR);
12256 /* Do a little sanity-checking on how they declared their operator. */
12259 grok_op_properties (tree decl, int friendp)
12261 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
12263 int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
12264 tree name = DECL_NAME (decl);
12265 enum tree_code operator_code;
12268 /* Count the number of arguments. */
12269 for (argtype = argtypes, arity = 0;
12270 argtype && argtype != void_list_node;
12271 argtype = TREE_CHAIN (argtype))
12274 if (current_class_type == NULL_TREE)
12277 if (DECL_CONV_FN_P (decl))
12278 operator_code = TYPE_EXPR;
12282 #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \
12283 if (ansi_opname (CODE) == name) \
12285 operator_code = (CODE); \
12288 else if (ansi_assopname (CODE) == name) \
12290 operator_code = (CODE); \
12291 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12295 #include "operators.def"
12296 #undef DEF_OPERATOR
12301 my_friendly_assert (operator_code != LAST_CPLUS_TREE_CODE, 20000526);
12302 SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12306 switch (operator_code)
12309 TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
12313 TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
12316 case COMPONENT_REF:
12318 TYPE_OVERLOADS_ARROW (current_class_type) = 1;
12322 TYPE_HAS_NEW_OPERATOR (current_class_type) = 1;
12326 TYPE_GETS_DELETE (current_class_type) |= 1;
12330 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type) = 1;
12333 case VEC_DELETE_EXPR:
12334 TYPE_GETS_DELETE (current_class_type) |= 2;
12342 if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR)
12344 /* When the compiler encounters the definition of A::operator new, it
12345 doesn't look at the class declaration to find out if it's static. */
12347 revert_static_member_fn (decl);
12349 TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
12351 else if (operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR)
12354 revert_static_member_fn (decl);
12356 TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
12360 /* An operator function must either be a non-static member function
12361 or have at least one parameter of a class, a reference to a class,
12362 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12363 if (! methodp || DECL_STATIC_FUNCTION_P (decl))
12365 if (operator_code == TYPE_EXPR
12366 || operator_code == CALL_EXPR
12367 || operator_code == COMPONENT_REF
12368 || operator_code == ARRAY_REF
12369 || operator_code == NOP_EXPR)
12370 error ("`%D' must be a nonstatic member function", decl);
12375 if (DECL_STATIC_FUNCTION_P (decl))
12376 error ("`%D' must be either a non-static member function or a non-member function", decl);
12379 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
12381 tree arg = TREE_VALUE (p);
12382 if (TREE_CODE (arg) == REFERENCE_TYPE)
12383 arg = TREE_TYPE (arg);
12385 /* This lets bad template code slip through. */
12386 if (IS_AGGR_TYPE (arg)
12387 || TREE_CODE (arg) == ENUMERAL_TYPE
12388 || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
12389 || TREE_CODE (arg) == BOUND_TEMPLATE_TEMPLATE_PARM)
12393 ("`%D' must have an argument of class or enumerated type",
12400 if (operator_code == CALL_EXPR)
12401 return; /* No restrictions on args. */
12403 if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
12405 tree t = TREE_TYPE (name);
12408 int ref = (TREE_CODE (t) == REFERENCE_TYPE);
12409 const char *what = 0;
12412 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
12414 if (TREE_CODE (t) == VOID_TYPE)
12416 else if (t == current_class_type)
12417 what = "the same type";
12418 /* Don't force t to be complete here. */
12419 else if (IS_AGGR_TYPE (t)
12420 && COMPLETE_TYPE_P (t)
12421 && DERIVED_FROM_P (t, current_class_type))
12422 what = "a base class";
12425 warning ("conversion to %s%s will never use a type conversion operator",
12426 ref ? "a reference to " : "", what);
12429 if (operator_code == COND_EXPR)
12432 error ("ISO C++ prohibits overloading operator ?:");
12434 else if (ambi_op_p (operator_code))
12437 /* We pick the one-argument operator codes by default, so
12438 we don't have to change anything. */
12440 else if (arity == 2)
12442 /* If we thought this was a unary operator, we now know
12443 it to be a binary operator. */
12444 switch (operator_code)
12447 operator_code = MULT_EXPR;
12451 operator_code = BIT_AND_EXPR;
12455 operator_code = PLUS_EXPR;
12459 operator_code = MINUS_EXPR;
12462 case PREINCREMENT_EXPR:
12463 operator_code = POSTINCREMENT_EXPR;
12466 case PREDECREMENT_EXPR:
12467 operator_code = POSTDECREMENT_EXPR;
12474 SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12476 if ((operator_code == POSTINCREMENT_EXPR
12477 || operator_code == POSTDECREMENT_EXPR)
12478 && ! processing_template_decl
12479 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
12482 error ("postfix `%D' must take `int' as its argument",
12486 ("postfix `%D' must take `int' as its second argument",
12493 error ("`%D' must take either zero or one argument", decl);
12495 error ("`%D' must take either one or two arguments", decl);
12498 /* More Effective C++ rule 6. */
12500 && (operator_code == POSTINCREMENT_EXPR
12501 || operator_code == POSTDECREMENT_EXPR
12502 || operator_code == PREINCREMENT_EXPR
12503 || operator_code == PREDECREMENT_EXPR))
12505 tree arg = TREE_VALUE (argtypes);
12506 tree ret = TREE_TYPE (TREE_TYPE (decl));
12507 if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
12508 arg = TREE_TYPE (arg);
12509 arg = TYPE_MAIN_VARIANT (arg);
12510 if (operator_code == PREINCREMENT_EXPR
12511 || operator_code == PREDECREMENT_EXPR)
12513 if (TREE_CODE (ret) != REFERENCE_TYPE
12514 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
12516 warning ("prefix `%D' should return `%T'", decl,
12517 build_reference_type (arg));
12521 if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
12522 warning ("postfix `%D' should return `%T'", decl, arg);
12526 else if (unary_op_p (operator_code))
12531 error ("`%D' must take `void'", decl);
12533 error ("`%D' must take exactly one argument", decl);
12536 else /* if (binary_op_p (operator_code)) */
12541 error ("`%D' must take exactly one argument", decl);
12543 error ("`%D' must take exactly two arguments", decl);
12546 /* More Effective C++ rule 7. */
12548 && (operator_code == TRUTH_ANDIF_EXPR
12549 || operator_code == TRUTH_ORIF_EXPR
12550 || operator_code == COMPOUND_EXPR))
12551 warning ("user-defined `%D' always evaluates both arguments",
12555 /* Effective C++ rule 23. */
12558 && !DECL_ASSIGNMENT_OPERATOR_P (decl)
12559 && (operator_code == PLUS_EXPR
12560 || operator_code == MINUS_EXPR
12561 || operator_code == TRUNC_DIV_EXPR
12562 || operator_code == MULT_EXPR
12563 || operator_code == TRUNC_MOD_EXPR)
12564 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
12565 warning ("`%D' should return by value", decl);
12567 /* [over.oper]/8 */
12568 for (; argtypes && argtypes != void_list_node;
12569 argtypes = TREE_CHAIN (argtypes))
12570 if (TREE_PURPOSE (argtypes))
12572 TREE_PURPOSE (argtypes) = NULL_TREE;
12573 if (operator_code == POSTINCREMENT_EXPR
12574 || operator_code == POSTDECREMENT_EXPR)
12577 pedwarn ("`%D' cannot have default arguments", decl);
12580 error ("`%D' cannot have default arguments", decl);
12586 static const char *
12587 tag_name (enum tag_types code)
12604 /* Get the struct, enum or union (CODE says which) with tag NAME.
12605 Define the tag as a forward-reference if it is not defined.
12607 C++: If a class derivation is given, process it here, and report
12608 an error if multiple derivation declarations are not identical.
12610 If this is a definition, come in through xref_tag and only look in
12611 the current frame for the name (since C++ allows new names in any
12615 xref_tag (enum tag_types tag_code, tree name, tree attributes,
12618 enum tree_code code;
12619 register tree ref, t;
12620 struct cp_binding_level *b = current_binding_level;
12621 tree context = NULL_TREE;
12623 timevar_push (TV_NAME_LOOKUP);
12628 code = RECORD_TYPE;
12634 code = ENUMERAL_TYPE;
12640 /* If a cross reference is requested, look up the type
12641 already defined for this tag and return it. */
12645 name = TYPE_IDENTIFIER (t);
12648 t = IDENTIFIER_TYPE_VALUE (name);
12650 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12651 if (t && globalize && TREE_CODE (t) == TYPENAME_TYPE)
12653 static int explained;
12656 warning ("`%s %T' declares a new type at namespace scope",
12657 tag_name (tag_code), name);
12659 warning (" names from dependent base classes are not visible to unqualified name lookup - to refer to the inherited type, say `%s %T::%T'",
12660 tag_name (tag_code),
12661 constructor_name (current_class_type),
12662 TYPE_IDENTIFIER (t));
12664 /* We need to remove the class scope binding for the
12665 TYPENAME_TYPE as otherwise poplevel_class gets confused. */
12666 for (shadowed = b->class_shadowed;
12668 shadowed = TREE_CHAIN (shadowed))
12669 if (TREE_TYPE (shadowed) == TYPE_NAME (t))
12671 TREE_PURPOSE (shadowed) = NULL_TREE;
12676 if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
12677 && TREE_CODE (t) != BOUND_TEMPLATE_TEMPLATE_PARM)
12682 /* If we know we are defining this tag, only look it up in
12683 this scope and don't try to find it as a type. */
12684 ref = lookup_tag (code, name, b, 1);
12690 ref = follow_tag_typedef (t);
12692 /* [dcl.type.elab] If the identifier resolves to a
12693 typedef-name or a template type-parameter, the
12694 elaborated-type-specifier is ill-formed. */
12697 pedwarn ("using typedef-name `%D' after `%s'",
12698 TYPE_NAME (t), tag_name (tag_code));
12701 else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
12702 error ("using template type parameter `%T' after `%s'",
12703 t, tag_name (tag_code));
12706 ref = lookup_tag (code, name, b, 0);
12710 /* Try finding it as a type declaration. If that wins,
12712 ref = lookup_name (name, 1);
12714 if (ref != NULL_TREE
12715 && processing_template_decl
12716 && DECL_CLASS_TEMPLATE_P (ref)
12717 && template_class_depth (current_class_type) == 0)
12718 /* Since GLOBALIZE is true, we're declaring a global
12719 template, so we want this type. */
12720 ref = DECL_TEMPLATE_RESULT (ref);
12722 if (ref && TREE_CODE (ref) == TYPE_DECL
12723 && TREE_CODE (TREE_TYPE (ref)) == code)
12724 ref = TREE_TYPE (ref);
12729 if (ref && current_class_type
12730 && template_class_depth (current_class_type)
12731 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12733 /* Since GLOBALIZE is nonzero, we are not looking at a
12734 definition of this tag. Since, in addition, we are currently
12735 processing a (member) template declaration of a template
12736 class, we must be very careful; consider:
12743 { template <class V>
12744 friend struct S1; };
12746 Here, the S2::S1 declaration should not be confused with the
12747 outer declaration. In particular, the inner version should
12748 have a template parameter of level 2, not level 1. This
12749 would be particularly important if the member declaration
12752 template <class V = U> friend struct S1;
12754 say, when we should tsubst into `U' when instantiating
12755 S2. On the other hand, when presented with:
12765 we must find the inner binding eventually. We
12766 accomplish this by making sure that the new type we
12767 create to represent this declaration has the right
12769 context = TYPE_CONTEXT (ref);
12776 /* If no such tag is yet defined, create a forward-reference node
12777 and record it as the "definition".
12778 When a real declaration of this type is found,
12779 the forward-reference will be altered into a real type. */
12780 if (code == ENUMERAL_TYPE)
12782 error ("use of enum `%#D' without previous declaration", name);
12784 ref = make_node (ENUMERAL_TYPE);
12786 /* Give the type a default layout like unsigned int
12787 to avoid crashing if it does not get defined. */
12788 TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12789 TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12790 TYPE_USER_ALIGN (ref) = 0;
12791 TREE_UNSIGNED (ref) = 1;
12792 TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12793 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12794 TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12796 /* Enable us to recognize when a type is created in class context.
12797 To do nested classes correctly, this should probably be cleared
12798 out when we leave this classes scope. Currently this in only
12799 done in `start_enum'. */
12801 pushtag (name, ref, globalize);
12805 struct cp_binding_level *old_b = class_binding_level;
12807 ref = make_aggr_type (code);
12808 TYPE_CONTEXT (ref) = context;
12810 #ifdef NONNESTED_CLASSES
12811 /* Class types don't nest the way enums do. */
12812 class_binding_level = (struct cp_binding_level *)0;
12814 pushtag (name, ref, globalize);
12815 class_binding_level = old_b;
12820 if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12821 redeclare_class_template (ref, current_template_parms);
12824 TYPE_ATTRIBUTES (ref) = attributes;
12826 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ref);
12830 xref_tag_from_type (tree old, tree id, int globalize)
12832 enum tag_types tag_kind;
12834 if (TREE_CODE (old) == RECORD_TYPE)
12835 tag_kind = (CLASSTYPE_DECLARED_CLASS (old) ? class_type : record_type);
12837 tag_kind = union_type;
12839 if (id == NULL_TREE)
12840 id = TYPE_IDENTIFIER (old);
12842 return xref_tag (tag_kind, id, /*attributes=*/NULL_TREE, globalize);
12845 /* REF is a type (named NAME), for which we have just seen some
12846 baseclasses. BASE_LIST is a list of those baseclasses; the
12847 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12848 the base-class. TREE_VIA_VIRTUAL indicates virtual
12849 inheritance. CODE_TYPE_NODE indicates whether REF is a class,
12850 struct, or union. */
12853 xref_basetypes (tree ref, tree base_list)
12855 /* In the declaration `A : X, Y, ... Z' we mark all the types
12856 (A, X, Y, ..., Z) so we can check for duplicates. */
12860 enum tag_types tag_code;
12862 if (TREE_CODE (ref) == UNION_TYPE)
12864 error ("derived union `%T' invalid", ref);
12868 tag_code = (CLASSTYPE_DECLARED_CLASS (ref) ? class_type : record_type);
12870 /* First, make sure that any templates in base-classes are
12871 instantiated. This ensures that if we call ourselves recursively
12872 we do not get confused about which classes are marked and which
12874 basep = &base_list;
12877 tree basetype = TREE_VALUE (*basep);
12878 if (!(processing_template_decl && uses_template_parms (basetype))
12879 && !complete_type_or_else (basetype, NULL))
12880 /* An incomplete type. Remove it from the list. */
12881 *basep = TREE_CHAIN (*basep);
12883 basep = &TREE_CHAIN (*basep);
12886 SET_CLASSTYPE_MARKED (ref);
12887 i = list_length (base_list);
12890 tree binfo = TYPE_BINFO (ref);
12891 tree binfos = make_tree_vec (i);
12892 tree accesses = make_tree_vec (i);
12894 BINFO_BASETYPES (binfo) = binfos;
12895 BINFO_BASEACCESSES (binfo) = accesses;
12897 for (i = 0; base_list; base_list = TREE_CHAIN (base_list))
12899 tree access = TREE_PURPOSE (base_list);
12900 int via_virtual = TREE_VIA_VIRTUAL (base_list);
12901 tree basetype = TREE_VALUE (base_list);
12904 if (access == access_default_node)
12905 /* The base of a derived struct is public by default. */
12906 access = (tag_code == class_type
12907 ? access_private_node : access_public_node);
12909 if (basetype && TREE_CODE (basetype) == TYPE_DECL)
12910 basetype = TREE_TYPE (basetype);
12912 || (TREE_CODE (basetype) != RECORD_TYPE
12913 && TREE_CODE (basetype) != TYPENAME_TYPE
12914 && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
12915 && TREE_CODE (basetype) != BOUND_TEMPLATE_TEMPLATE_PARM))
12917 error ("base type `%T' fails to be a struct or class type",
12922 if (CLASSTYPE_MARKED (basetype))
12924 if (basetype == ref)
12925 error ("recursive type `%T' undefined", basetype);
12927 error ("duplicate base type `%T' invalid", basetype);
12931 if (TYPE_FOR_JAVA (basetype)
12932 && (current_lang_depth () == 0))
12933 TYPE_FOR_JAVA (ref) = 1;
12935 if (CLASS_TYPE_P (basetype))
12937 base_binfo = TYPE_BINFO (basetype);
12938 /* This flag will be in the binfo of the base type, we must
12939 clear it after copying the base binfos. */
12940 BINFO_DEPENDENT_BASE_P (base_binfo)
12941 = dependent_type_p (basetype);
12944 base_binfo = make_binfo (size_zero_node, basetype,
12945 NULL_TREE, NULL_TREE);
12947 TREE_VEC_ELT (binfos, i) = base_binfo;
12948 TREE_VEC_ELT (accesses, i) = access;
12949 /* This flag will be in the binfo of the base type, we must
12950 clear it after copying the base binfos. */
12951 TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
12953 SET_CLASSTYPE_MARKED (basetype);
12955 /* We are free to modify these bits because they are meaningless
12956 at top level, and BASETYPE is a top-level type. */
12957 if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
12959 TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
12960 /* Converting to a virtual base class requires looking
12961 up the offset of the virtual base. */
12962 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
12965 if (CLASS_TYPE_P (basetype))
12967 TYPE_HAS_NEW_OPERATOR (ref)
12968 |= TYPE_HAS_NEW_OPERATOR (basetype);
12969 TYPE_HAS_ARRAY_NEW_OPERATOR (ref)
12970 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype);
12971 TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
12972 /* If the base-class uses multiple inheritance, so do we. */
12973 TYPE_USES_MULTIPLE_INHERITANCE (ref)
12974 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype);
12975 /* Likewise, if converting to a base of the base may require
12976 code, then we may need to generate code to convert to a
12978 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref)
12979 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype);
12984 TREE_VEC_LENGTH (accesses) = TREE_VEC_LENGTH (binfos) = i;
12986 BINFO_BASEACCESSES (binfo) = BINFO_BASETYPES (binfo) = NULL_TREE;
12990 TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
12991 /* If there is more than one non-empty they cannot be at the same
12993 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
12997 /* Copy the base binfos, collect the virtual bases and set the
12998 inheritance order chain. */
12999 copy_base_binfos (TYPE_BINFO (ref), ref, NULL_TREE);
13000 CLASSTYPE_VBASECLASSES (ref) = nreverse (CLASSTYPE_VBASECLASSES (ref));
13002 /* Unmark all the types. */
13005 tree basetype = BINFO_TYPE (BINFO_BASETYPE (TYPE_BINFO (ref), i));
13007 CLEAR_CLASSTYPE_MARKED (basetype);
13008 if (CLASS_TYPE_P (basetype))
13010 TREE_VIA_VIRTUAL (TYPE_BINFO (basetype)) = 0;
13011 BINFO_DEPENDENT_BASE_P (TYPE_BINFO (basetype)) = 0;
13014 CLEAR_CLASSTYPE_MARKED (ref);
13018 /* Begin compiling the definition of an enumeration type.
13019 NAME is its name (or null if anonymous).
13020 Returns the type object, as yet incomplete.
13021 Also records info about it so that build_enumerator
13022 may be used to declare the individual values as they are read. */
13025 start_enum (tree name)
13027 register tree enumtype = NULL_TREE;
13028 struct cp_binding_level *b = current_binding_level;
13030 /* If this is the real definition for a previous forward reference,
13031 fill in the contents in the same object that used to be the
13032 forward reference. */
13034 if (name != NULL_TREE)
13035 enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
13037 if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
13039 error ("multiple definition of `%#T'", enumtype);
13040 cp_error_at ("previous definition here", enumtype);
13041 /* Clear out TYPE_VALUES, and start again. */
13042 TYPE_VALUES (enumtype) = NULL_TREE;
13046 enumtype = make_node (ENUMERAL_TYPE);
13047 pushtag (name, enumtype, 0);
13053 /* After processing and defining all the values of an enumeration type,
13054 install their decls in the enumeration type and finish it off.
13055 ENUMTYPE is the type object and VALUES a list of name-value pairs. */
13058 finish_enum (tree enumtype)
13069 /* We built up the VALUES in reverse order. */
13070 TYPE_VALUES (enumtype) = nreverse (TYPE_VALUES (enumtype));
13072 /* For an enum defined in a template, all further processing is
13073 postponed until the template is instantiated. */
13074 if (processing_template_decl)
13076 if (at_function_scope_p ())
13077 add_stmt (build_min (TAG_DEFN, enumtype));
13081 if (TYPE_VALUES (enumtype))
13083 /* Initialize min and max values and figure out actual values in
13084 following 'for' loop. */
13085 minnode = maxnode = NULL_TREE;
13089 Following the closing brace of an enum-specifier, each
13090 enumerator has the type of its enumeration. Prior to the
13091 closing brace, the type of each enumerator is the type of
13092 its initializing value. */
13093 for (pair = TYPE_VALUES (enumtype); pair; pair = TREE_CHAIN (pair))
13098 /* If we are going to reset type then copy node first.
13099 It cannot be shared now. */
13100 if (TREE_TYPE (TREE_VALUE (pair)) != enumtype)
13102 if (DECL_INITIAL (TREE_VALUE (pair)))
13103 DECL_INITIAL (TREE_VALUE (pair)) =
13104 copy_node (DECL_INITIAL (TREE_VALUE (pair)));
13105 TREE_TYPE (TREE_VALUE (pair)) = enumtype;
13108 if (!processing_template_decl)
13110 /* Adjust min and max value. */
13111 value = DECL_INITIAL (TREE_VALUE (pair));
13114 minnode = maxnode = value;
13115 else if (tree_int_cst_lt (maxnode, value))
13117 else if (tree_int_cst_lt (value, minnode))
13123 minnode = maxnode = integer_zero_node;
13126 /* Compute the number of bits require to represent all values of the
13127 enumeration. We must do this before the type of MINNODE and
13128 MAXNODE are transformed, since min_precision relies on the
13129 TREE_TYPE of the value it is passed. */
13130 unsignedp = tree_int_cst_sgn (minnode) >= 0;
13131 lowprec = min_precision (minnode, unsignedp);
13132 highprec = min_precision (maxnode, unsignedp);
13133 precision = MAX (lowprec, highprec);
13135 /* Set the TREE_TYPE for the values as well. That's so that when we
13136 call decl_constant_value we get an entity of the right type (but
13137 with the constant value). In addition, transform the TYPE_VALUES
13138 list to contain the values, rather than the CONST_DECLs for them. */
13139 for (pair = TYPE_VALUES (enumtype); pair; pair = TREE_CHAIN (pair))
13141 tree value = DECL_INITIAL (TREE_VALUE (pair));
13143 TREE_TYPE (value) = enumtype;
13144 TREE_VALUE (pair) = value;
13147 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13148 TYPE_SIZE (enumtype) = NULL_TREE;
13149 TYPE_PRECISION (enumtype) = precision;
13151 fixup_unsigned_type (enumtype);
13153 fixup_signed_type (enumtype);
13155 if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
13156 /* Use the width of the narrowest normal C type which is wide
13158 TYPE_PRECISION (enumtype) = TYPE_PRECISION (c_common_type_for_size
13161 TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
13163 TYPE_SIZE (enumtype) = NULL_TREE;
13164 layout_type (enumtype);
13166 /* Fix up all variant types of this enum type. */
13167 for (t = TYPE_MAIN_VARIANT (enumtype); t; t = TYPE_NEXT_VARIANT (t))
13169 TYPE_VALUES (t) = TYPE_VALUES (enumtype);
13170 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (enumtype);
13171 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (enumtype);
13172 TYPE_SIZE (t) = TYPE_SIZE (enumtype);
13173 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (enumtype);
13174 TYPE_MODE (t) = TYPE_MODE (enumtype);
13175 TYPE_PRECISION (t) = TYPE_PRECISION (enumtype);
13176 TYPE_ALIGN (t) = TYPE_ALIGN (enumtype);
13177 TYPE_USER_ALIGN (t) = TYPE_USER_ALIGN (enumtype);
13178 TREE_UNSIGNED (t) = TREE_UNSIGNED (enumtype);
13181 /* Finish debugging output for this type. */
13182 rest_of_type_compilation (enumtype, namespace_bindings_p ());
13185 /* Build and install a CONST_DECL for an enumeration constant of the
13186 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13187 Assignment of sequential values by default is handled here. */
13190 build_enumerator (tree name, tree value, tree enumtype)
13196 /* Remove no-op casts from the value. */
13198 STRIP_TYPE_NOPS (value);
13200 if (! processing_template_decl)
13202 /* Validate and default VALUE. */
13203 if (value != NULL_TREE)
13205 value = decl_constant_value (value);
13207 if (TREE_CODE (value) == INTEGER_CST)
13209 value = default_conversion (value);
13210 constant_expression_warning (value);
13214 error ("enumerator value for `%D' not integer constant", name);
13219 /* Default based on previous value. */
13220 if (value == NULL_TREE)
13224 if (TYPE_VALUES (enumtype))
13226 /* The next value is the previous value ... */
13227 prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype)));
13228 /* ... plus one. */
13229 value = cp_build_binary_op (PLUS_EXPR,
13233 if (tree_int_cst_lt (value, prev_value))
13234 error ("overflow in enumeration values at `%D'", name);
13237 value = integer_zero_node;
13240 /* Remove no-op casts from the value. */
13242 STRIP_TYPE_NOPS (value);
13245 /* C++ associates enums with global, function, or class declarations. */
13246 context = current_scope ();
13248 /* Build the actual enumeration constant. Note that the enumeration
13249 constants have the type of their initializers until the
13250 enumeration is complete:
13254 Following the closing brace of an enum-specifier, each enumer-
13255 ator has the type of its enumeration. Prior to the closing
13256 brace, the type of each enumerator is the type of its
13257 initializing value.
13259 In finish_enum we will reset the type. Of course, if we're
13260 processing a template, there may be no value. */
13261 type = value ? TREE_TYPE (value) : NULL_TREE;
13263 if (context && context == current_class_type)
13264 /* This enum declaration is local to the class. We need the full
13265 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13266 decl = build_lang_decl (CONST_DECL, name, type);
13268 /* It's a global enum, or it's local to a function. (Note local to
13269 a function could mean local to a class method. */
13270 decl = build_decl (CONST_DECL, name, type);
13272 DECL_CONTEXT (decl) = FROB_CONTEXT (context);
13273 DECL_INITIAL (decl) = value;
13274 TREE_READONLY (decl) = 1;
13276 if (context && context == current_class_type)
13277 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13278 on the TYPE_FIELDS list for `S'. (That's so that you can say
13279 things like `S::i' later.) */
13280 finish_member_declaration (decl);
13284 /* Add this enumeration constant to the list for this type. */
13285 TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype));
13289 /* We're defining DECL. Make sure that it's type is OK. */
13292 check_function_type (tree decl, tree current_function_parms)
13294 tree fntype = TREE_TYPE (decl);
13295 tree return_type = complete_type (TREE_TYPE (fntype));
13297 /* In a function definition, arg types must be complete. */
13298 require_complete_types_for_parms (current_function_parms);
13300 if (!COMPLETE_OR_VOID_TYPE_P (return_type))
13302 error ("return type `%#T' is incomplete", TREE_TYPE (fntype));
13304 /* Make it return void instead, but don't change the
13305 type of the DECL_RESULT, in case we have a named return value. */
13306 if (TREE_CODE (fntype) == METHOD_TYPE)
13308 tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
13310 = build_cplus_method_type (ctype,
13312 FUNCTION_ARG_CHAIN (decl));
13316 = build_function_type (void_type_node,
13317 TYPE_ARG_TYPES (TREE_TYPE (decl)));
13319 = build_exception_variant (fntype,
13320 TYPE_RAISES_EXCEPTIONS (fntype));
13323 abstract_virtuals_error (decl, TREE_TYPE (fntype));
13326 /* Create the FUNCTION_DECL for a function definition.
13327 DECLSPECS and DECLARATOR are the parts of the declaration;
13328 they describe the function's name and the type it returns,
13329 but twisted together in a fashion that parallels the syntax of C.
13331 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13332 DECLARATOR is really the DECL for the function we are about to
13333 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13334 indicating that the function is an inline defined in-class.
13336 This function creates a binding context for the function body
13337 as well as setting up the FUNCTION_DECL in current_function_decl.
13339 Returns 1 on success. If the DECLARATOR is not suitable for a function
13340 (it defines a datum instead), we return 0, which tells
13341 yyparse to report a parse error.
13343 For C++, we must first check whether that datum makes any sense.
13344 For example, "class A local_a(1,2);" means that variable local_a
13345 is an aggregate of type A, which should have a constructor
13346 applied to it with the argument list [1, 2]. */
13349 start_function (tree declspecs, tree declarator, tree attrs, int flags)
13352 tree ctype = NULL_TREE;
13355 int doing_friend = 0;
13356 struct cp_binding_level *bl;
13357 tree current_function_parms;
13359 /* Sanity check. */
13360 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
13361 my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
13363 /* This should only be done once on the top most decl. */
13364 if (have_extern_spec)
13366 declspecs = tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
13367 have_extern_spec = false;
13370 if (flags & SF_PRE_PARSED)
13372 decl1 = declarator;
13374 fntype = TREE_TYPE (decl1);
13375 if (TREE_CODE (fntype) == METHOD_TYPE)
13376 ctype = TYPE_METHOD_BASETYPE (fntype);
13378 /* ISO C++ 11.4/5. A friend function defined in a class is in
13379 the (lexical) scope of the class in which it is defined. */
13380 if (!ctype && DECL_FRIEND_P (decl1))
13382 ctype = DECL_FRIEND_CONTEXT (decl1);
13384 /* CTYPE could be null here if we're dealing with a template;
13385 for example, `inline friend float foo()' inside a template
13386 will have no CTYPE set. */
13387 if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
13393 last_function_parms = DECL_ARGUMENTS (decl1);
13397 decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL);
13398 /* If the declarator is not suitable for a function definition,
13399 cause a syntax error. */
13400 if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL)
13403 cplus_decl_attributes (&decl1, attrs, 0);
13405 /* If #pragma weak was used, mark the decl weak now. */
13406 if (current_binding_level == global_binding_level)
13407 maybe_apply_pragma_weak (decl1);
13409 fntype = TREE_TYPE (decl1);
13411 restype = TREE_TYPE (fntype);
13412 if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
13414 error ("semicolon missing after declaration of `%#T'", restype);
13415 shadow_tag (build_tree_list (NULL_TREE, restype));
13416 CLASSTYPE_GOT_SEMICOLON (restype) = 1;
13417 if (TREE_CODE (fntype) == FUNCTION_TYPE)
13418 fntype = build_function_type (integer_type_node,
13419 TYPE_ARG_TYPES (fntype));
13421 fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
13423 TYPE_ARG_TYPES (fntype));
13424 TREE_TYPE (decl1) = fntype;
13427 if (TREE_CODE (fntype) == METHOD_TYPE)
13428 ctype = TYPE_METHOD_BASETYPE (fntype);
13429 else if (DECL_MAIN_P (decl1))
13431 /* If this doesn't return integer_type, complain. */
13432 if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
13434 if (pedantic || warn_return_type)
13435 pedwarn ("return type for `main' changed to `int'");
13436 TREE_TYPE (decl1) = fntype = default_function_type;
13441 if (DECL_DECLARED_INLINE_P (decl1)
13442 && lookup_attribute ("noinline", attrs))
13443 warning ("%Hinline function '%D' given attribute noinline",
13444 &DECL_SOURCE_LOCATION (decl1), decl1);
13446 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl1))
13447 /* This is a constructor, we must ensure that any default args
13448 introduced by this definition are propagated to the clones
13449 now. The clones are used directly in overload resolution. */
13450 adjust_clone_args (decl1);
13452 /* Sometimes we don't notice that a function is a static member, and
13453 build a METHOD_TYPE for it. Fix that up now. */
13454 if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1)
13455 && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE)
13457 revert_static_member_fn (decl1);
13458 last_function_parms = TREE_CHAIN (last_function_parms);
13462 /* Warn if function was previously implicitly declared
13463 (but not if we warned then). */
13464 if (! warn_implicit
13465 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
13466 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
13468 /* Set up current_class_type, and enter the scope of the class, if
13471 push_nested_class (ctype);
13472 else if (DECL_STATIC_FUNCTION_P (decl1))
13473 push_nested_class (DECL_CONTEXT (decl1));
13475 /* Now that we have entered the scope of the class, we must restore
13476 the bindings for any template parameters surrounding DECL1, if it
13477 is an inline member template. (Order is important; consider the
13478 case where a template parameter has the same name as a field of
13479 the class.) It is not until after this point that
13480 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13481 if (flags & SF_INCLASS_INLINE)
13482 maybe_begin_member_template_processing (decl1);
13484 /* Effective C++ rule 15. */
13486 && DECL_OVERLOADED_OPERATOR_P (decl1) == NOP_EXPR
13487 && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
13488 warning ("`operator=' should return a reference to `*this'");
13490 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13491 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13492 if (!DECL_INITIAL (decl1))
13493 DECL_INITIAL (decl1) = error_mark_node;
13495 /* This function exists in static storage.
13496 (This does not mean `static' in the C sense!) */
13497 TREE_STATIC (decl1) = 1;
13499 /* We must call push_template_decl after current_class_type is set
13500 up. (If we are processing inline definitions after exiting a
13501 class scope, current_class_type will be NULL_TREE until set above
13502 by push_nested_class.) */
13503 if (processing_template_decl)
13504 decl1 = push_template_decl (decl1);
13506 /* We are now in the scope of the function being defined. */
13507 current_function_decl = decl1;
13509 /* Save the parm names or decls from this function's declarator
13510 where store_parm_decls will find them. */
13511 current_function_parms = last_function_parms;
13513 /* Make sure the parameter and return types are reasonable. When
13514 you declare a function, these types can be incomplete, but they
13515 must be complete when you define the function. */
13516 if (! processing_template_decl)
13517 check_function_type (decl1, current_function_parms);
13519 /* Build the return declaration for the function. */
13520 restype = TREE_TYPE (fntype);
13521 /* Promote the value to int before returning it. */
13522 if (c_promoting_integer_type_p (restype))
13523 restype = type_promotes_to (restype);
13524 if (DECL_RESULT (decl1) == NULL_TREE)
13526 DECL_RESULT (decl1)
13527 = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13528 c_apply_type_quals_to_decl (cp_type_quals (restype),
13529 DECL_RESULT (decl1));
13532 /* Initialize RTL machinery. We cannot do this until
13533 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13534 even when processing a template; this is how we get
13535 CFUN set up, and our per-function variables initialized.
13536 FIXME factor out the non-RTL stuff. */
13537 bl = current_binding_level;
13538 init_function_start (decl1, input_filename, lineno);
13539 current_binding_level = bl;
13541 /* Even though we're inside a function body, we still don't want to
13542 call expand_expr to calculate the size of a variable-sized array.
13543 We haven't necessarily assigned RTL to all variables yet, so it's
13544 not safe to try to expand expressions involving them. */
13545 immediate_size_expand = 0;
13546 cfun->x_dont_save_pending_sizes_p = 1;
13548 /* Start the statement-tree, start the tree now. */
13549 begin_stmt_tree (&DECL_SAVED_TREE (decl1));
13551 /* Let the user know we're compiling this function. */
13552 announce_function (decl1);
13554 /* Record the decl so that the function name is defined.
13555 If we already have a decl for this name, and it is a FUNCTION_DECL,
13556 use the old decl. */
13557 if (!processing_template_decl && !(flags & SF_PRE_PARSED))
13559 /* A specialization is not used to guide overload resolution. */
13560 if (!DECL_TEMPLATE_SPECIALIZATION (decl1)
13561 && ! DECL_FUNCTION_MEMBER_P (decl1))
13562 decl1 = pushdecl (decl1);
13565 /* We need to set the DECL_CONTEXT. */
13566 if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
13567 DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
13568 /* And make sure we have enough default args. */
13569 check_default_args (decl1);
13571 fntype = TREE_TYPE (decl1);
13574 /* Reset these in case the call to pushdecl changed them. */
13575 current_function_decl = decl1;
13576 cfun->decl = decl1;
13578 /* If we are (erroneously) defining a function that we have already
13579 defined before, wipe out what we knew before. */
13580 if (!DECL_PENDING_INLINE_P (decl1))
13581 DECL_SAVED_FUNCTION_DATA (decl1) = NULL;
13583 if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1))
13585 /* We know that this was set up by `grokclassfn'. We do not
13586 wait until `store_parm_decls', since evil parse errors may
13587 never get us to that point. Here we keep the consistency
13588 between `current_class_type' and `current_class_ptr'. */
13589 tree t = DECL_ARGUMENTS (decl1);
13591 my_friendly_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL,
13593 my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE,
13596 cp_function_chain->x_current_class_ref
13597 = build_indirect_ref (t, NULL);
13598 cp_function_chain->x_current_class_ptr = t;
13600 /* Constructors and destructors need to know whether they're "in
13601 charge" of initializing virtual base classes. */
13602 t = TREE_CHAIN (t);
13603 if (DECL_HAS_IN_CHARGE_PARM_P (decl1))
13605 current_in_charge_parm = t;
13606 t = TREE_CHAIN (t);
13608 if (DECL_HAS_VTT_PARM_P (decl1))
13610 if (DECL_NAME (t) != vtt_parm_identifier)
13612 current_vtt_parm = t;
13616 if (DECL_INTERFACE_KNOWN (decl1))
13618 tree ctx = decl_function_context (decl1);
13620 if (DECL_NOT_REALLY_EXTERN (decl1))
13621 DECL_EXTERNAL (decl1) = 0;
13623 if (ctx != NULL_TREE && DECL_DECLARED_INLINE_P (ctx)
13624 && TREE_PUBLIC (ctx))
13625 /* This is a function in a local class in an extern inline
13627 comdat_linkage (decl1);
13629 /* If this function belongs to an interface, it is public.
13630 If it belongs to someone else's interface, it is also external.
13631 This only affects inlines and template instantiations. */
13632 else if (interface_unknown == 0
13633 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13634 || flag_alt_external_templates))
13636 if (DECL_DECLARED_INLINE_P (decl1)
13637 || DECL_TEMPLATE_INSTANTIATION (decl1)
13638 || processing_template_decl)
13640 DECL_EXTERNAL (decl1)
13642 || (DECL_DECLARED_INLINE_P (decl1)
13643 && ! flag_implement_inlines
13644 && !DECL_VINDEX (decl1)));
13646 /* For WIN32 we also want to put these in linkonce sections. */
13647 maybe_make_one_only (decl1);
13650 DECL_EXTERNAL (decl1) = 0;
13651 DECL_NOT_REALLY_EXTERN (decl1) = 0;
13652 DECL_INTERFACE_KNOWN (decl1) = 1;
13654 else if (interface_unknown && interface_only
13655 && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13656 || flag_alt_external_templates))
13658 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13659 interface, we will have interface_only set but not
13660 interface_known. In that case, we don't want to use the normal
13661 heuristics because someone will supply a #pragma implementation
13662 elsewhere, and deducing it here would produce a conflict. */
13663 comdat_linkage (decl1);
13664 DECL_EXTERNAL (decl1) = 0;
13665 DECL_INTERFACE_KNOWN (decl1) = 1;
13666 DECL_DEFER_OUTPUT (decl1) = 1;
13670 /* This is a definition, not a reference.
13671 So clear DECL_EXTERNAL. */
13672 DECL_EXTERNAL (decl1) = 0;
13674 if ((DECL_DECLARED_INLINE_P (decl1)
13675 || DECL_TEMPLATE_INSTANTIATION (decl1))
13676 && ! DECL_INTERFACE_KNOWN (decl1)
13677 /* Don't try to defer nested functions for now. */
13678 && ! decl_function_context (decl1))
13679 DECL_DEFER_OUTPUT (decl1) = 1;
13681 DECL_INTERFACE_KNOWN (decl1) = 1;
13685 current_binding_level->parm_flag = 1;
13689 if (DECL_DESTRUCTOR_P (decl1))
13691 dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13692 DECL_CONTEXT (dtor_label) = current_function_decl;
13695 start_fname_decls ();
13697 store_parm_decls (current_function_parms);
13702 /* Store the parameter declarations into the current function declaration.
13703 This is called after parsing the parameter declarations, before
13704 digesting the body of the function.
13706 Also install to binding contour return value identifier, if any. */
13709 store_parm_decls (tree current_function_parms)
13711 register tree fndecl = current_function_decl;
13712 register tree parm;
13714 /* This is a chain of any other decls that came in among the parm
13715 declarations. If a parm is declared with enum {foo, bar} x;
13716 then CONST_DECLs for foo and bar are put here. */
13717 tree nonparms = NULL_TREE;
13719 if (current_function_parms)
13721 /* This case is when the function was defined with an ANSI prototype.
13722 The parms already have decls, so we need not do anything here
13723 except record them as in effect
13724 and complain if any redundant old-style parm decls were written. */
13726 tree specparms = current_function_parms;
13729 /* Must clear this because it might contain TYPE_DECLs declared
13731 storedecls (NULL_TREE);
13733 /* If we're doing semantic analysis, then we'll call pushdecl
13734 for each of these. We must do them in reverse order so that
13735 they end in the correct forward order. */
13736 specparms = nreverse (specparms);
13738 for (parm = specparms; parm; parm = next)
13740 next = TREE_CHAIN (parm);
13741 if (TREE_CODE (parm) == PARM_DECL)
13743 if (DECL_NAME (parm) == NULL_TREE
13744 || TREE_CODE (parm) != VOID_TYPE)
13747 error ("parameter `%D' declared void", parm);
13751 /* If we find an enum constant or a type tag,
13752 put it aside for the moment. */
13753 TREE_CHAIN (parm) = NULL_TREE;
13754 nonparms = chainon (nonparms, parm);
13758 /* Get the decls in their original chain order and record in the
13759 function. This is all and only the PARM_DECLs that were
13760 pushed into scope by the loop above. */
13761 DECL_ARGUMENTS (fndecl) = getdecls ();
13762 storetags (gettags ());
13765 DECL_ARGUMENTS (fndecl) = NULL_TREE;
13767 /* Now store the final chain of decls for the arguments
13768 as the decl-chain of the current lexical scope.
13769 Put the enumerators in as well, at the front so that
13770 DECL_ARGUMENTS is not modified. */
13771 storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
13773 /* Do the starting of the exception specifications, if we have any. */
13774 if (flag_exceptions && !processing_template_decl
13775 && flag_enforce_eh_specs
13776 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
13777 current_eh_spec_block = begin_eh_spec_block ();
13781 /* We have finished doing semantic analysis on DECL, but have not yet
13782 generated RTL for its body. Save away our current state, so that
13783 when we want to generate RTL later we know what to do. */
13786 save_function_data (tree decl)
13788 struct language_function *f;
13790 /* Save the language-specific per-function data so that we can
13791 get it back when we really expand this function. */
13792 my_friendly_assert (!DECL_PENDING_INLINE_P (decl),
13796 f = ((struct language_function *)
13797 ggc_alloc (sizeof (struct language_function)));
13798 memcpy (f, cp_function_chain, sizeof (struct language_function));
13799 DECL_SAVED_FUNCTION_DATA (decl) = f;
13801 /* Clear out the bits we don't need. */
13802 f->base.x_stmt_tree.x_last_stmt = NULL_TREE;
13803 f->base.x_stmt_tree.x_last_expr_type = NULL_TREE;
13804 f->x_named_label_uses = NULL;
13805 f->bindings = NULL;
13806 f->x_local_names = NULL;
13808 /* When we get back here again, we will be expanding. */
13809 f->x_expanding_p = 1;
13811 /* If we've already decided that we cannot inline this function, we
13812 must remember that fact when we actually go to expand the
13814 if (current_function_cannot_inline)
13816 f->cannot_inline = current_function_cannot_inline;
13817 DECL_INLINE (decl) = 0;
13821 /* Add a note to mark the beginning of the main body of the constructor.
13822 This is used to set up the data structures for the cleanup regions for
13823 fully-constructed bases and members. */
13826 begin_constructor_body (void)
13830 /* Add a note to mark the end of the main body of the constructor. This is
13831 used to end the cleanup regions for fully-constructed bases and
13835 finish_constructor_body (void)
13839 /* Do all the processing for the beginning of a destructor; set up the
13840 vtable pointers and cleanups for bases and members. */
13843 begin_destructor_body (void)
13846 tree compound_stmt;
13848 /* If the dtor is empty, and we know there is not any possible
13849 way we could use any vtable entries, before they are possibly
13850 set by a base class dtor, we don't have to setup the vtables,
13851 as we know that any base class dtor will set up any vtables
13852 it needs. We avoid MI, because one base class dtor can do a
13853 virtual dispatch to an overridden function that would need to
13854 have a non-related vtable set up, we cannot avoid setting up
13855 vtables in that case. We could change this to see if there
13856 is just one vtable.
13858 ??? In the destructor for a class, the vtables are set
13859 appropriately for that class. There will be no non-related
13860 vtables. jason 2001-12-11. */
13861 if_stmt = begin_if_stmt ();
13863 /* If it is not safe to avoid setting up the vtables, then
13864 someone will change the condition to be boolean_true_node.
13865 (Actually, for now, we do not have code to set the condition
13866 appropriately, so we just assume that we always need to
13867 initialize the vtables.) */
13868 finish_if_stmt_cond (boolean_true_node, if_stmt);
13870 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
13872 /* Make all virtual function table pointers in non-virtual base
13873 classes point to CURRENT_CLASS_TYPE's virtual function
13875 initialize_vtbl_ptrs (current_class_ptr);
13877 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
13878 finish_then_clause (if_stmt);
13881 /* And insert cleanups for our bases and members so that they
13882 will be properly destroyed if we throw. */
13883 push_base_cleanups ();
13886 /* At the end of every destructor we generate code to delete the object if
13887 necessary. Do that now. */
13890 finish_destructor_body (void)
13894 /* Any return from a destructor will end up here; that way all base
13895 and member cleanups will be run when the function returns. */
13896 add_stmt (build_stmt (LABEL_STMT, dtor_label));
13898 /* In a virtual destructor, we must call delete. */
13899 if (DECL_VIRTUAL_P (current_function_decl))
13902 tree virtual_size = cxx_sizeof (current_class_type);
13906 At the point of definition of a virtual destructor (including
13907 an implicit definition), non-placement operator delete shall
13908 be looked up in the scope of the destructor's class and if
13909 found shall be accessible and unambiguous. */
13910 exprstmt = build_op_delete_call
13911 (DELETE_EXPR, current_class_ptr, virtual_size,
13912 LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
13914 if_stmt = begin_if_stmt ();
13915 finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
13916 current_in_charge_parm,
13919 finish_expr_stmt (exprstmt);
13920 finish_then_clause (if_stmt);
13925 /* Do the necessary processing for the beginning of a function body, which
13926 in this case includes member-initializers, but not the catch clauses of
13927 a function-try-block. Currently, this means opening a binding level
13928 for the member-initializers (in a ctor) and member cleanups (in a dtor).
13929 In other functions, this isn't necessary, but it doesn't hurt. */
13932 begin_function_body (void)
13936 if (processing_template_decl)
13937 /* Do nothing now. */;
13939 /* Always keep the BLOCK node associated with the outermost pair of
13940 curly braces of a function. These are needed for correct
13941 operation of dwarfout.c. */
13942 keep_next_level (1);
13944 stmt = begin_compound_stmt (0);
13945 COMPOUND_STMT_BODY_BLOCK (stmt) = 1;
13947 if (processing_template_decl)
13948 /* Do nothing now. */;
13949 else if (DECL_CONSTRUCTOR_P (current_function_decl))
13950 begin_constructor_body ();
13951 else if (DECL_DESTRUCTOR_P (current_function_decl))
13952 begin_destructor_body ();
13957 /* Do the processing for the end of a function body. Currently, this means
13958 closing out the cleanups for fully-constructed bases and members, and in
13959 the case of the destructor, deleting the object if desired. Again, this
13960 is only meaningful for [cd]tors, since they are the only functions where
13961 there is a significant distinction between the main body and any
13962 function catch clauses. Handling, say, main() return semantics here
13963 would be wrong, as flowing off the end of a function catch clause for
13964 main() would also need to return 0. */
13967 finish_function_body (tree compstmt)
13969 /* Close the block. */
13970 finish_compound_stmt (0, compstmt);
13972 if (processing_template_decl)
13973 /* Do nothing now. */;
13974 else if (DECL_CONSTRUCTOR_P (current_function_decl))
13975 finish_constructor_body ();
13976 else if (DECL_DESTRUCTOR_P (current_function_decl))
13977 finish_destructor_body ();
13980 /* Finish up a function declaration and compile that function
13981 all the way to assembler language output. The free the storage
13982 for the function definition.
13984 FLAGS is a bitwise or of the following values:
13986 We just finished processing the body of an in-class inline
13987 function definition. (This processing will have taken place
13988 after the class definition is complete.) */
13991 finish_function (int flags)
13993 register tree fndecl = current_function_decl;
13994 tree fntype, ctype = NULL_TREE;
13995 int inclass_inline = (flags & 2) != 0;
13998 /* When we get some parse errors, we can end up without a
13999 current_function_decl, so cope. */
14000 if (fndecl == NULL_TREE)
14001 return error_mark_node;
14003 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fndecl)
14004 && DECL_VIRTUAL_P (fndecl)
14005 && !processing_template_decl)
14007 tree fnclass = DECL_CONTEXT (fndecl);
14008 if (fndecl == CLASSTYPE_KEY_METHOD (fnclass))
14009 keyed_classes = tree_cons (NULL_TREE, fnclass, keyed_classes);
14012 nested = function_depth > 1;
14013 fntype = TREE_TYPE (fndecl);
14015 /* TREE_READONLY (fndecl) = 1;
14016 This caused &foo to be of type ptr-to-const-function
14017 which then got a warning when stored in a ptr-to-function variable. */
14019 my_friendly_assert (building_stmt_tree (), 20000911);
14021 finish_fname_decls ();
14023 /* For a cloned function, we've already got all the code we need;
14024 there's no need to add any extra bits. */
14025 if (!DECL_CLONED_FUNCTION_P (fndecl))
14027 if (DECL_MAIN_P (current_function_decl))
14029 /* Make it so that `main' always returns 0 by default. */
14031 finish_return_stmt (integer_one_node);
14033 finish_return_stmt (integer_zero_node);
14037 /* Finish dealing with exception specifiers. */
14038 if (flag_exceptions && !processing_template_decl
14039 && flag_enforce_eh_specs
14040 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
14041 finish_eh_spec_block (TYPE_RAISES_EXCEPTIONS
14042 (TREE_TYPE (current_function_decl)),
14043 current_eh_spec_block);
14046 /* If we're saving up tree structure, tie off the function now. */
14047 finish_stmt_tree (&DECL_SAVED_TREE (fndecl));
14049 /* This must come after expand_function_end because cleanups might
14050 have declarations (from inline functions) that need to go into
14051 this function's blocks. */
14053 /* If the current binding level isn't the outermost binding level
14054 for this function, either there is a bug, or we have experienced
14055 syntax errors and the statement tree is malformed. */
14056 if (current_binding_level->parm_flag != 1)
14058 /* Make sure we have already experienced errors. */
14059 if (errorcount == 0)
14062 /* Throw away the broken statement tree and extra binding
14064 DECL_SAVED_TREE (fndecl) = build_stmt (COMPOUND_STMT, NULL_TREE);
14066 while (current_binding_level->parm_flag != 1)
14068 if (current_binding_level->parm_flag == 2)
14069 pop_nested_class ();
14071 poplevel (0, 0, 0);
14074 poplevel (1, 0, 1);
14076 /* Set up the named return value optimization, if we can. Here, we
14077 eliminate the copy from the nrv into the RESULT_DECL and any cleanup
14078 for the nrv. genrtl_start_function and declare_return_variable
14079 handle making the nrv and RESULT_DECL share space. */
14080 if (current_function_return_value)
14082 tree r = current_function_return_value;
14083 /* This is only worth doing for fns that return in memory--and
14084 simpler, since we don't have to worry about promoted modes. */
14085 if (r != error_mark_node
14086 && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))))
14088 DECL_ALIGN (r) = DECL_ALIGN (DECL_RESULT (fndecl));
14089 walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl),
14090 nullify_returns_r, r);
14093 /* Clear it so genrtl_start_function and declare_return_variable
14094 know we're not optimizing. */
14095 current_function_return_value = NULL_TREE;
14098 /* Remember that we were in class scope. */
14099 if (current_class_name)
14100 ctype = current_class_type;
14102 /* Must mark the RESULT_DECL as being in this function. */
14103 DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
14105 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14106 to the FUNCTION_DECL node itself. */
14107 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
14109 /* Save away current state, if appropriate. */
14110 if (!processing_template_decl)
14111 save_function_data (fndecl);
14113 /* If this function calls `setjmp' it cannot be inlined. When
14114 `longjmp' is called it is not guaranteed to restore the value of
14115 local variables that have been modified since the call to
14116 `setjmp'. So, if were to inline this function into some caller
14117 `c', then when we `longjmp', we might not restore all variables
14118 in `c'. (It might seem, at first blush, that there's no way for
14119 this function to modify local variables in `c', but their
14120 addresses may have been stored somewhere accessible to this
14122 if (!processing_template_decl && calls_setjmp_p (fndecl))
14123 DECL_UNINLINABLE (fndecl) = 1;
14125 /* Complain if there's just no return statement. */
14126 if (warn_return_type
14127 && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE
14128 && !current_function_returns_value && !current_function_returns_null
14129 /* Don't complain if we abort or throw. */
14130 && !current_function_returns_abnormally
14131 && !DECL_NAME (DECL_RESULT (fndecl))
14132 /* Normally, with -Wreturn-type, flow will complain. Unless we're an
14133 inline function, as we might never be compiled separately. */
14134 && (DECL_INLINE (fndecl) || processing_template_decl))
14135 warning ("no return statement in function returning non-void");
14137 /* Clear out memory we no longer need. */
14138 free_after_parsing (cfun);
14139 /* Since we never call rest_of_compilation, we never clear
14140 CFUN. Do so explicitly. */
14141 free_after_compilation (cfun);
14144 /* If this is an in-class inline definition, we may have to pop the
14145 bindings for the template parameters that we added in
14146 maybe_begin_member_template_processing when start_function was
14148 if (inclass_inline)
14149 maybe_end_member_template_processing ();
14151 /* Leave the scope of the class. */
14153 pop_nested_class ();
14159 /* Let the error reporting routines know that we're outside a
14160 function. For a nested function, this value is used in
14161 cxx_pop_function_context and then reset via pop_function_context. */
14162 current_function_decl = NULL_TREE;
14167 /* Create the FUNCTION_DECL for a function definition.
14168 DECLSPECS and DECLARATOR are the parts of the declaration;
14169 they describe the return type and the name of the function,
14170 but twisted together in a fashion that parallels the syntax of C.
14172 This function creates a binding context for the function body
14173 as well as setting up the FUNCTION_DECL in current_function_decl.
14175 Returns a FUNCTION_DECL on success.
14177 If the DECLARATOR is not suitable for a function (it defines a datum
14178 instead), we return 0, which tells yyparse to report a parse error.
14180 May return void_type_node indicating that this method is actually
14181 a friend. See grokfield for more details.
14183 Came here with a `.pushlevel' .
14185 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14186 CHANGES TO CODE IN `grokfield'. */
14189 start_method (tree declspecs, tree declarator, tree attrlist)
14191 tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
14194 if (fndecl == error_mark_node)
14195 return error_mark_node;
14197 if (fndecl == NULL || TREE_CODE (fndecl) != FUNCTION_DECL)
14199 error ("invalid member function declaration");
14200 return error_mark_node;
14204 cplus_decl_attributes (&fndecl, attrlist, 0);
14206 /* Pass friends other than inline friend functions back. */
14207 if (fndecl == void_type_node)
14210 if (DECL_IN_AGGR_P (fndecl))
14212 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
14214 if (DECL_CONTEXT (fndecl)
14215 && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
14216 error ("`%D' is already defined in class `%T'", fndecl,
14217 DECL_CONTEXT (fndecl));
14219 return void_type_node;
14222 check_template_shadow (fndecl);
14224 DECL_DECLARED_INLINE_P (fndecl) = 1;
14226 DID_INLINE_FUNC (fndecl) = 0;
14227 if (flag_default_inline)
14228 DECL_INLINE (fndecl) = 1;
14230 /* We process method specializations in finish_struct_1. */
14231 if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
14232 fndecl = push_template_decl (fndecl);
14234 if (! DECL_FRIEND_P (fndecl))
14236 if (TREE_CHAIN (fndecl))
14238 fndecl = copy_node (fndecl);
14239 TREE_CHAIN (fndecl) = NULL_TREE;
14241 grok_special_member_properties (fndecl);
14244 cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0);
14246 /* Make a place for the parms */
14248 current_binding_level->parm_flag = 1;
14250 DECL_IN_AGGR_P (fndecl) = 1;
14254 /* Go through the motions of finishing a function definition.
14255 We don't compile this method until after the whole class has
14258 FINISH_METHOD must return something that looks as though it
14259 came from GROKFIELD (since we are defining a method, after all).
14261 This is called after parsing the body of the function definition.
14262 STMTS is the chain of statements that makes up the function body.
14264 DECL is the ..._DECL that `start_method' provided. */
14267 finish_method (tree decl)
14269 register tree fndecl = decl;
14272 register tree link;
14274 if (decl == void_type_node)
14277 old_initial = DECL_INITIAL (fndecl);
14279 /* Undo the level for the parms (from start_method).
14280 This is like poplevel, but it causes nothing to be
14281 saved. Saving information here confuses symbol-table
14282 output routines. Besides, this information will
14283 be correctly output when this method is actually
14286 /* Clear out the meanings of the local variables of this level;
14287 also record in each decl which block it belongs to. */
14289 for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
14291 if (DECL_NAME (link) != NULL_TREE)
14292 pop_binding (DECL_NAME (link), link);
14293 my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
14294 DECL_CONTEXT (link) = NULL_TREE;
14297 poplevel (0, 0, 0);
14299 DECL_INITIAL (fndecl) = old_initial;
14301 /* We used to check if the context of FNDECL was different from
14302 current_class_type as another way to get inside here. This didn't work
14303 for String.cc in libg++. */
14304 if (DECL_FRIEND_P (fndecl))
14306 CLASSTYPE_INLINE_FRIENDS (current_class_type)
14307 = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
14308 decl = void_type_node;
14315 /* VAR is a VAR_DECL. If its type is incomplete, remember VAR so that
14316 we can lay it out later, when and if its type becomes complete. */
14319 maybe_register_incomplete_var (tree var)
14321 my_friendly_assert (TREE_CODE (var) == VAR_DECL, 20020406);
14323 /* Keep track of variables with incomplete types. */
14324 if (!processing_template_decl && TREE_TYPE (var) != error_mark_node
14325 && DECL_EXTERNAL (var))
14327 tree inner_type = TREE_TYPE (var);
14329 while (TREE_CODE (inner_type) == ARRAY_TYPE)
14330 inner_type = TREE_TYPE (inner_type);
14331 inner_type = TYPE_MAIN_VARIANT (inner_type);
14333 if ((!COMPLETE_TYPE_P (inner_type) && CLASS_TYPE_P (inner_type))
14334 /* RTTI TD entries are created while defining the type_info. */
14335 || (TYPE_LANG_SPECIFIC (inner_type)
14336 && TYPE_BEING_DEFINED (inner_type)))
14337 incomplete_vars = tree_cons (inner_type, var, incomplete_vars);
14341 /* Called when a class type (given by TYPE) is defined. If there are
14342 any existing VAR_DECLs whose type hsa been completed by this
14343 declaration, update them now. */
14346 complete_vars (tree type)
14348 tree *list = &incomplete_vars;
14350 my_friendly_assert (CLASS_TYPE_P (type), 20020406);
14353 if (same_type_p (type, TREE_PURPOSE (*list)))
14355 tree var = TREE_VALUE (*list);
14356 /* Complete the type of the variable. The VAR_DECL itself
14357 will be laid out in expand_expr. */
14358 complete_type (TREE_TYPE (var));
14359 /* Remove this entry from the list. */
14360 *list = TREE_CHAIN (*list);
14363 list = &TREE_CHAIN (*list);
14367 /* If DECL is of a type which needs a cleanup, build that cleanup
14371 cxx_maybe_build_cleanup (tree decl)
14373 tree type = TREE_TYPE (decl);
14375 if (type != error_mark_node && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
14377 int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14380 if (TREE_CODE (type) == ARRAY_TYPE)
14384 cxx_mark_addressable (decl);
14385 rval = build_unary_op (ADDR_EXPR, decl, 0);
14388 /* Optimize for space over speed here. */
14389 if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14390 || flag_expensive_optimizations)
14391 flags |= LOOKUP_NONVIRTUAL;
14393 rval = build_delete (TREE_TYPE (rval), rval,
14394 sfk_complete_destructor, flags, 0);
14396 if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14397 && ! TYPE_HAS_DESTRUCTOR (type))
14398 rval = build_compound_expr (tree_cons (NULL_TREE, rval,
14399 build_tree_list (NULL_TREE, build_vbase_delete (type, decl))));
14406 /* When a stmt has been parsed, this function is called. */
14411 /* Always assume this statement was not an expression statement. If
14412 it actually was an expression statement, its our callers
14413 responsibility to fix this up. */
14414 last_expr_type = NULL_TREE;
14417 /* DECL was originally constructed as a non-static member function,
14418 but turned out to be static. Update it accordingly. */
14421 revert_static_member_fn (tree decl)
14424 tree function = TREE_TYPE (decl);
14425 tree args = TYPE_ARG_TYPES (function);
14427 if (cp_type_quals (TREE_TYPE (TREE_VALUE (args)))
14428 != TYPE_UNQUALIFIED)
14429 error ("static member function `%#D' declared with type qualifiers",
14432 args = TREE_CHAIN (args);
14433 tmp = build_function_type (TREE_TYPE (function), args);
14434 tmp = build_qualified_type (tmp, cp_type_quals (function));
14435 tmp = build_exception_variant (tmp,
14436 TYPE_RAISES_EXCEPTIONS (function));
14437 TREE_TYPE (decl) = tmp;
14438 if (DECL_ARGUMENTS (decl))
14439 DECL_ARGUMENTS (decl) = TREE_CHAIN (DECL_ARGUMENTS (decl));
14440 DECL_STATIC_FUNCTION_P (decl) = 1;
14443 /* Initialize the variables used during compilation of a C++
14447 cxx_push_function_context (struct function * f)
14449 struct language_function *p
14450 = ((struct language_function *)
14451 ggc_alloc_cleared (sizeof (struct language_function)));
14454 /* It takes an explicit call to expand_body to generate RTL for a
14458 /* Whenever we start a new function, we destroy temporaries in the
14460 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
14463 /* Free the language-specific parts of F, now that we've finished
14464 compiling the function. */
14467 cxx_pop_function_context (struct function * f)
14472 /* Return which tree structure is used by T, or TS_CP_GENERIC if T is
14473 one of the language-independent trees. */
14475 enum cp_tree_node_structure_enum
14476 cp_tree_node_structure (union lang_tree_node * t)
14478 switch (TREE_CODE (&t->generic))
14480 case DEFAULT_ARG: return TS_CP_DEFAULT_ARG;
14481 case IDENTIFIER_NODE: return TS_CP_IDENTIFIER;
14482 case CPLUS_BINDING: return TS_CP_BINDING;
14483 case OVERLOAD: return TS_CP_OVERLOAD;
14484 case TEMPLATE_PARM_INDEX: return TS_CP_TPI;
14485 case PTRMEM_CST: return TS_CP_PTRMEM;
14486 case BASELINK: return TS_CP_BASELINK;
14487 case WRAPPER: return TS_CP_WRAPPER;
14488 case SRCLOC: return TS_CP_SRCLOC;
14489 default: return TS_CP_GENERIC;
14493 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14494 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14497 identifier_global_value (tree t)
14499 return IDENTIFIER_GLOBAL_VALUE (t);
14502 /* Build the void_list_node (void_type_node having been created). */
14504 build_void_list_node (void)
14506 tree t = build_tree_list (NULL_TREE, void_type_node);
14507 TREE_PARMLIST (t) = 1;
14512 cp_missing_noreturn_ok_p (tree decl)
14514 /* A missing noreturn is ok for the `main' function. */
14515 return DECL_MAIN_P (decl);
14518 #include "gt-cp-decl.h"
14519 #include "gtype-cp.h"