1 /* Process declarations and variables for C++ compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
4 Hacked 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"
48 #include "tree-mudflap.h"
50 #include "tree-inline.h"
52 extern cpp_reader *parse_in;
54 /* This structure contains information about the initializations
55 and/or destructions required for a particular priority level. */
56 typedef struct priority_info_s {
57 /* Nonzero if there have been any initializations at this priority
58 throughout the translation unit. */
59 int initializations_p;
60 /* Nonzero if there have been any destructions at this priority
61 throughout the translation unit. */
65 static void mark_vtable_entries (tree);
66 static void grok_function_init (tree, tree);
67 static bool maybe_emit_vtables (tree);
68 static tree build_anon_union_vars (tree);
69 static bool acceptable_java_type (tree);
70 static tree start_objects (int, int);
71 static void finish_objects (int, int, tree);
72 static tree start_static_storage_duration_function (unsigned);
73 static void finish_static_storage_duration_function (tree);
74 static priority_info get_priority_info (int);
75 static void do_static_initialization (tree, tree);
76 static void do_static_destruction (tree);
77 static tree start_static_initialization_or_destruction (tree, int);
78 static void finish_static_initialization_or_destruction (tree);
79 static void generate_ctor_or_dtor_function (bool, int, location_t *);
80 static int generate_ctor_and_dtor_functions_for_priority (splay_tree_node,
82 static tree prune_vars_needing_no_initialization (tree *);
83 static void write_out_vars (tree);
84 static void import_export_class (tree);
85 static tree get_guard_bits (tree);
87 /* A list of static class variables. This is needed, because a
88 static class variable can be declared inside the class without
89 an initializer, and then initialized, statically, outside the class. */
90 static GTY(()) varray_type pending_statics;
91 #define pending_statics_used \
92 (pending_statics ? pending_statics->elements_used : 0)
94 /* A list of functions which were declared inline, but which we
95 may need to emit outline anyway. */
96 static GTY(()) varray_type deferred_fns;
97 #define deferred_fns_used \
98 (deferred_fns ? deferred_fns->elements_used : 0)
100 /* Flag used when debugging spew.c */
102 extern int spew_debug;
104 /* Nonzero if we're done parsing and into end-of-file activities. */
108 /* Functions called along with real static constructors and destructors. */
114 /* Incorporate `const' and `volatile' qualifiers for member functions.
115 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
116 QUALS is a list of qualifiers. Returns any explicit
117 top-level qualifiers of the method's this pointer, anything other than
118 TYPE_UNQUALIFIED will be an extension. */
121 grok_method_quals (tree ctype, tree function, cp_cv_quals quals)
123 tree fntype = TREE_TYPE (function);
124 tree raises = TYPE_RAISES_EXCEPTIONS (fntype);
125 int type_quals = TYPE_UNQUALIFIED;
126 int this_quals = TYPE_UNQUALIFIED;
128 type_quals = quals & ~TYPE_QUAL_RESTRICT;
129 this_quals = quals & TYPE_QUAL_RESTRICT;
131 ctype = cp_build_qualified_type (ctype, type_quals);
132 fntype = build_method_type_directly (ctype, TREE_TYPE (fntype),
133 (TREE_CODE (fntype) == METHOD_TYPE
134 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
135 : TYPE_ARG_TYPES (fntype)));
137 fntype = build_exception_variant (fntype, raises);
139 TREE_TYPE (function) = fntype;
143 /* Build a PARM_DECL with NAME and TYPE, and set DECL_ARG_TYPE
147 cp_build_parm_decl (tree name, tree type)
149 tree parm = build_decl (PARM_DECL, name, type);
150 /* DECL_ARG_TYPE is only used by the back end and the back end never
152 if (!processing_template_decl)
153 DECL_ARG_TYPE (parm) = type_passed_as (type);
157 /* Returns a PARM_DECL for a parameter of the indicated TYPE, with the
161 build_artificial_parm (tree name, tree type)
163 tree parm = cp_build_parm_decl (name, type);
164 DECL_ARTIFICIAL (parm) = 1;
165 /* All our artificial parms are implicitly `const'; they cannot be
167 TREE_READONLY (parm) = 1;
171 /* Constructors for types with virtual baseclasses need an "in-charge" flag
172 saying whether this constructor is responsible for initialization of
173 virtual baseclasses or not. All destructors also need this "in-charge"
174 flag, which additionally determines whether or not the destructor should
175 free the memory for the object.
177 This function adds the "in-charge" flag to member function FN if
178 appropriate. It is called from grokclassfn and tsubst.
179 FN must be either a constructor or destructor.
181 The in-charge flag follows the 'this' parameter, and is followed by the
182 VTT parm (if any), then the user-written parms. */
185 maybe_retrofit_in_chrg (tree fn)
187 tree basetype, arg_types, parms, parm, fntype;
189 /* If we've already add the in-charge parameter don't do it again. */
190 if (DECL_HAS_IN_CHARGE_PARM_P (fn))
193 /* When processing templates we can't know, in general, whether or
194 not we're going to have virtual baseclasses. */
195 if (processing_template_decl)
198 /* We don't need an in-charge parameter for constructors that don't
199 have virtual bases. */
200 if (DECL_CONSTRUCTOR_P (fn)
201 && !TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn)))
204 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
205 basetype = TREE_TYPE (TREE_VALUE (arg_types));
206 arg_types = TREE_CHAIN (arg_types);
208 parms = TREE_CHAIN (DECL_ARGUMENTS (fn));
210 /* If this is a subobject constructor or destructor, our caller will
211 pass us a pointer to our VTT. */
212 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn)))
214 parm = build_artificial_parm (vtt_parm_identifier, vtt_parm_type);
216 /* First add it to DECL_ARGUMENTS between 'this' and the real args... */
217 TREE_CHAIN (parm) = parms;
220 /* ...and then to TYPE_ARG_TYPES. */
221 arg_types = hash_tree_chain (vtt_parm_type, arg_types);
223 DECL_HAS_VTT_PARM_P (fn) = 1;
226 /* Then add the in-charge parm (before the VTT parm). */
227 parm = build_artificial_parm (in_charge_identifier, integer_type_node);
228 TREE_CHAIN (parm) = parms;
230 arg_types = hash_tree_chain (integer_type_node, arg_types);
232 /* Insert our new parameter(s) into the list. */
233 TREE_CHAIN (DECL_ARGUMENTS (fn)) = parms;
235 /* And rebuild the function type. */
236 fntype = build_method_type_directly (basetype, TREE_TYPE (TREE_TYPE (fn)),
238 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
239 fntype = build_exception_variant (fntype,
240 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
241 TREE_TYPE (fn) = fntype;
243 /* Now we've got the in-charge parameter. */
244 DECL_HAS_IN_CHARGE_PARM_P (fn) = 1;
247 /* Classes overload their constituent function names automatically.
248 When a function name is declared in a record structure,
249 its name is changed to it overloaded name. Since names for
250 constructors and destructors can conflict, we place a leading
253 CNAME is the name of the class we are grokking for.
255 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
257 FLAGS contains bits saying what's special about today's
258 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
260 If FUNCTION is a destructor, then we must add the `auto-delete' field
261 as a second parameter. There is some hair associated with the fact
262 that we must "declare" this variable in the manner consistent with the
263 way the rest of the arguments were declared.
265 QUALS are the qualifiers for the this pointer. */
268 grokclassfn (tree ctype, tree function, enum overload_flags flags,
271 tree fn_name = DECL_NAME (function);
272 cp_cv_quals this_quals = TYPE_UNQUALIFIED;
274 /* Even within an `extern "C"' block, members get C++ linkage. See
275 [dcl.link] for details. */
276 SET_DECL_LANGUAGE (function, lang_cplusplus);
278 if (fn_name == NULL_TREE)
280 error ("name missing for member function");
281 fn_name = get_identifier ("<anonymous>");
282 DECL_NAME (function) = fn_name;
286 this_quals = grok_method_quals (ctype, function, quals);
288 if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
290 /* Must add the class instance variable up front. */
291 /* Right now we just make this a pointer. But later
292 we may wish to make it special. */
293 tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function)));
297 /* The `this' parameter is implicitly `const'; it cannot be
299 this_quals |= TYPE_QUAL_CONST;
300 qual_type = cp_build_qualified_type (type, this_quals);
301 parm = build_artificial_parm (this_identifier, qual_type);
302 c_apply_type_quals_to_decl (this_quals, parm);
303 TREE_CHAIN (parm) = DECL_ARGUMENTS (function);
304 DECL_ARGUMENTS (function) = parm;
307 DECL_CONTEXT (function) = ctype;
309 if (flags == DTOR_FLAG)
310 DECL_DESTRUCTOR_P (function) = 1;
312 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
313 maybe_retrofit_in_chrg (function);
316 /* Create an ARRAY_REF, checking for the user doing things backwards
320 grok_array_decl (tree array_expr, tree index_exp)
324 tree orig_array_expr = array_expr;
325 tree orig_index_exp = index_exp;
327 if (error_operand_p (array_expr) || error_operand_p (index_exp))
328 return error_mark_node;
330 if (processing_template_decl)
332 if (type_dependent_expression_p (array_expr)
333 || type_dependent_expression_p (index_exp))
334 return build_min_nt (ARRAY_REF, array_expr, index_exp,
335 NULL_TREE, NULL_TREE);
336 array_expr = build_non_dependent_expr (array_expr);
337 index_exp = build_non_dependent_expr (index_exp);
340 type = TREE_TYPE (array_expr);
341 my_friendly_assert (type, 20030626);
342 type = non_reference (type);
344 /* If they have an `operator[]', use that. */
345 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
346 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL,
347 array_expr, index_exp, NULL_TREE,
348 /*overloaded_p=*/NULL);
353 /* Otherwise, create an ARRAY_REF for a pointer or array type.
354 It is a little-known fact that, if `a' is an array and `i' is
355 an int, you can write `i[a]', which means the same thing as
357 if (TREE_CODE (type) == ARRAY_TYPE)
360 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, false);
362 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
365 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, false);
367 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr,
369 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp,
372 if ((p1 && i2) && (i1 && p2))
373 error ("ambiguous conversion for array subscript");
376 array_expr = p1, index_exp = i2;
378 array_expr = p2, index_exp = i1;
381 error ("invalid types `%T[%T]' for array subscript",
382 type, TREE_TYPE (index_exp));
383 return error_mark_node;
386 if (array_expr == error_mark_node || index_exp == error_mark_node)
387 error ("ambiguous conversion for array subscript");
389 expr = build_array_ref (array_expr, index_exp);
391 if (processing_template_decl && expr != error_mark_node)
392 return build_min_non_dep (ARRAY_REF, expr, orig_array_expr, orig_index_exp,
393 NULL_TREE, NULL_TREE);
397 /* Given the cast expression EXP, checking out its validity. Either return
398 an error_mark_node if there was an unavoidable error, return a cast to
399 void for trying to delete a pointer w/ the value 0, or return the
400 call to delete. If DOING_VEC is true, we handle things differently
401 for doing an array delete.
402 Implements ARM $5.3.4. This is called from the parser. */
405 delete_sanity (tree exp, tree size, bool doing_vec, int use_global_delete)
409 if (exp == error_mark_node)
412 if (processing_template_decl)
414 t = build_min (DELETE_EXPR, void_type_node, exp, size);
415 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
416 DELETE_EXPR_USE_VEC (t) = doing_vec;
417 TREE_SIDE_EFFECTS (t) = 1;
421 exp = convert_from_reference (exp);
423 /* An array can't have been allocated by new, so complain. */
424 if (TREE_CODE (exp) == VAR_DECL
425 && TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
426 warning ("deleting array `%#D'", exp);
428 t = build_expr_type_conversion (WANT_POINTER, exp, true);
430 if (t == NULL_TREE || t == error_mark_node)
432 error ("type `%#T' argument given to `delete', expected pointer",
434 return error_mark_node;
437 type = TREE_TYPE (t);
439 /* As of Valley Forge, you can delete a pointer to const. */
441 /* You can't delete functions. */
442 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
444 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
445 return error_mark_node;
448 /* Deleting ptr to void is undefined behavior [expr.delete/3]. */
449 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
451 warning ("deleting `%T' is undefined", type);
455 /* Deleting a pointer with the value zero is valid and has no effect. */
456 if (integer_zerop (t))
457 return build1 (NOP_EXPR, void_type_node, t);
460 return build_vec_delete (t, /*maxindex=*/NULL_TREE,
461 sfk_deleting_destructor,
464 return build_delete (type, t, sfk_deleting_destructor,
465 LOOKUP_NORMAL, use_global_delete);
468 /* Report an error if the indicated template declaration is not the
469 sort of thing that should be a member template. */
472 check_member_template (tree tmpl)
476 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
477 decl = DECL_TEMPLATE_RESULT (tmpl);
479 if (TREE_CODE (decl) == FUNCTION_DECL
480 || (TREE_CODE (decl) == TYPE_DECL
481 && IS_AGGR_TYPE (TREE_TYPE (decl))))
483 if (current_function_decl)
484 /* 14.5.2.2 [temp.mem]
486 A local class shall not have member templates. */
487 error ("invalid declaration of member template `%#D' in local class",
490 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
492 /* 14.5.2.3 [temp.mem]
494 A member function template shall not be virtual. */
496 ("invalid use of `virtual' in template declaration of `%#D'",
498 DECL_VIRTUAL_P (decl) = 0;
501 /* The debug-information generating code doesn't know what to do
502 with member templates. */
503 DECL_IGNORED_P (tmpl) = 1;
506 error ("template declaration of `%#D'", decl);
509 /* Return true iff TYPE is a valid Java parameter or return type. */
512 acceptable_java_type (tree type)
514 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
516 if (TREE_CODE (type) == POINTER_TYPE || TREE_CODE (type) == REFERENCE_TYPE)
518 type = TREE_TYPE (type);
519 if (TREE_CODE (type) == RECORD_TYPE)
522 if (! TYPE_FOR_JAVA (type))
524 if (! CLASSTYPE_TEMPLATE_INFO (type))
526 args = CLASSTYPE_TI_ARGS (type);
527 i = TREE_VEC_LENGTH (args);
530 type = TREE_VEC_ELT (args, i);
531 if (TREE_CODE (type) == POINTER_TYPE)
532 type = TREE_TYPE (type);
533 if (! TYPE_FOR_JAVA (type))
542 /* For a METHOD in a Java class CTYPE, return true if
543 the parameter and return types are valid Java types.
544 Otherwise, print appropriate error messages, and return false. */
547 check_java_method (tree method)
550 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
551 tree ret_type = TREE_TYPE (TREE_TYPE (method));
553 if (!acceptable_java_type (ret_type))
555 error ("Java method '%D' has non-Java return type `%T'",
560 arg_types = TREE_CHAIN (arg_types);
561 if (DECL_HAS_IN_CHARGE_PARM_P (method))
562 arg_types = TREE_CHAIN (arg_types);
563 if (DECL_HAS_VTT_PARM_P (method))
564 arg_types = TREE_CHAIN (arg_types);
566 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
568 tree type = TREE_VALUE (arg_types);
569 if (!acceptable_java_type (type))
571 error ("Java method '%D' has non-Java parameter type `%T'",
579 /* Sanity check: report error if this function FUNCTION is not
580 really a member of the class (CTYPE) it is supposed to belong to.
581 TEMPLATE_PARMS is used to specifiy the template parameters of a member
582 template passed as FUNCTION_DECL. If the member template is passed as a
583 TEMPLATE_DECL, it can be NULL since the parameters can be extracted
584 from the declaration. If the function is not a function template, it
586 It returns the original declaration for the function, or NULL_TREE
587 if no declaration was found (and an error was emitted). */
590 check_classfn (tree ctype, tree function, tree template_parms)
595 if (DECL_USE_TEMPLATE (function)
596 && !(TREE_CODE (function) == TEMPLATE_DECL
597 && DECL_TEMPLATE_SPECIALIZATION (function))
598 && is_member_template (DECL_TI_TEMPLATE (function)))
599 /* Since this is a specialization of a member template,
600 we're not going to find the declaration in the class.
603 struct S { template <typename T> void f(T); };
604 template <> void S::f(int);
606 we're not going to find `S::f(int)', but there's no
607 reason we should, either. We let our callers know we didn't
608 find the method, but we don't complain. */
611 /* Basic sanity check: for a template function, the template parameters
612 either were not passed, or they are the same of DECL_TEMPLATE_PARMS. */
613 if (TREE_CODE (function) == TEMPLATE_DECL)
615 my_friendly_assert (!template_parms
616 || comp_template_parms
618 DECL_TEMPLATE_PARMS (function)),
620 template_parms = DECL_TEMPLATE_PARMS (function);
623 /* OK, is this a definition of a member template? */
624 is_template = (template_parms != NULL_TREE);
626 ix = lookup_fnfields_1 (complete_type (ctype),
627 DECL_CONSTRUCTOR_P (function) ? ctor_identifier :
628 DECL_DESTRUCTOR_P (function) ? dtor_identifier :
629 DECL_NAME (function));
633 VEC(tree) *methods = CLASSTYPE_METHOD_VEC (ctype);
634 tree fndecls, fndecl = 0;
637 const char *format = NULL;
639 pop_p = push_scope (ctype);
640 for (fndecls = VEC_index (tree, methods, ix);
641 fndecls; fndecls = OVL_NEXT (fndecls))
645 fndecl = OVL_CURRENT (fndecls);
646 p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
647 p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
649 /* We cannot simply call decls_match because this doesn't
650 work for static member functions that are pretending to
651 be methods, and because the name may have been changed by
654 /* Get rid of the this parameter on functions that become
656 if (DECL_STATIC_FUNCTION_P (fndecl)
657 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
658 p1 = TREE_CHAIN (p1);
660 /* A member template definition only matches a member template
662 if (is_template != (TREE_CODE (fndecl) == TEMPLATE_DECL))
665 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
666 TREE_TYPE (TREE_TYPE (fndecl)))
667 && compparms (p1, p2)
669 || comp_template_parms (template_parms,
670 DECL_TEMPLATE_PARMS (fndecl)))
671 && (DECL_TEMPLATE_SPECIALIZATION (function)
672 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
673 && (!DECL_TEMPLATE_SPECIALIZATION (function)
674 || (DECL_TI_TEMPLATE (function)
675 == DECL_TI_TEMPLATE (fndecl))))
681 return OVL_CURRENT (fndecls);
682 error ("prototype for `%#D' does not match any in class `%T'",
684 is_conv_op = DECL_CONV_FN_P (fndecl);
687 ix = CLASSTYPE_FIRST_CONVERSION_SLOT;
688 fndecls = VEC_index (tree, methods, ix);
691 fndecl = OVL_CURRENT (fndecls);
692 fndecls = OVL_NEXT (fndecls);
694 if (!fndecls && is_conv_op)
696 if (VEC_length (tree, methods) > (size_t) ++ix)
698 fndecls = VEC_index (tree, methods, ix);
699 if (!DECL_CONV_FN_P (OVL_CURRENT (fndecls)))
711 format = "candidates are: %#D";
713 format = "candidate is: %#D";
714 cp_error_at (format, fndecl);
717 else if (!COMPLETE_TYPE_P (ctype))
718 cxx_incomplete_type_error (function, ctype);
720 error ("no `%#D' member function declared in class `%T'",
723 /* If we did not find the method in the class, add it to avoid
724 spurious errors (unless the CTYPE is not yet defined, in which
725 case we'll only confuse ourselves when the function is declared
726 properly within the class. */
727 if (COMPLETE_TYPE_P (ctype))
728 add_method (ctype, function);
732 /* DECL is a function with vague linkage. Remember it so that at the
733 end of the translation unit we can decide whether or not to emit
737 note_vague_linkage_fn (tree decl)
739 if (!DECL_DEFERRED_FN (decl))
741 DECL_DEFERRED_FN (decl) = 1;
742 DECL_DEFER_OUTPUT (decl) = 1;
744 VARRAY_TREE_INIT (deferred_fns, 32, "deferred_fns");
745 VARRAY_PUSH_TREE (deferred_fns, decl);
749 /* Like note_vague_linkage_fn but for variables. */
752 note_vague_linkage_var (tree var)
754 if (!pending_statics)
755 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
756 VARRAY_PUSH_TREE (pending_statics, var);
759 /* We have just processed the DECL, which is a static data member.
760 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
761 present, is the assembly-language name for the data member.
762 FLAGS is as for cp_finish_decl. */
765 finish_static_data_member_decl (tree decl, tree init, tree asmspec_tree,
768 my_friendly_assert (TREE_PUBLIC (decl), 0);
770 DECL_CONTEXT (decl) = current_class_type;
772 /* We cannot call pushdecl here, because that would fill in the
773 TREE_CHAIN of our decl. Instead, we modify cp_finish_decl to do
774 the right thing, namely, to put this decl out straight away. */
775 /* current_class_type can be NULL_TREE in case of error. */
776 if (!asmspec_tree && current_class_type)
777 DECL_INITIAL (decl) = error_mark_node;
779 if (! processing_template_decl)
780 note_vague_linkage_var (decl);
782 if (LOCAL_CLASS_P (current_class_type))
783 pedwarn ("local class `%#T' shall not have static data member `%#D'",
784 current_class_type, decl);
786 /* Static consts need not be initialized in the class definition. */
787 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
789 static int explained = 0;
791 error ("initializer invalid for static member with constructor");
794 error ("(an out of class initialization is required)");
799 /* Force the compiler to know when an uninitialized static const
800 member is being used. */
801 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
802 TREE_USED (decl) = 1;
803 DECL_INITIAL (decl) = init;
804 DECL_IN_AGGR_P (decl) = 1;
806 cp_finish_decl (decl, init, asmspec_tree, flags);
809 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
810 of a structure component, returning a _DECL node.
811 QUALS is a list of type qualifiers for this decl (such as for declaring
812 const member functions).
814 This is done during the parsing of the struct declaration.
815 The _DECL nodes are chained together and the lot of them
816 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
818 If class A defines that certain functions in class B are friends, then
819 the way I have set things up, it is B who is interested in permission
820 granted by A. However, it is in A's context that these declarations
821 are parsed. By returning a void_type_node, class A does not attempt
822 to incorporate the declarations of the friends within its structure.
824 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
825 CHANGES TO CODE IN `start_method'. */
828 grokfield (const cp_declarator *declarator,
829 cp_decl_specifier_seq *declspecs,
830 tree init, tree asmspec_tree,
834 const char *asmspec = 0;
835 int flags = LOOKUP_ONLYCONVERTING;
837 if (!declspecs->any_specifiers_p
838 && declarator->kind == cdk_id
839 && TREE_CODE (declarator->u.id.name) == SCOPE_REF
840 && (TREE_CODE (TREE_OPERAND (declarator->u.id.name, 1))
842 /* Access declaration */
843 return do_class_using_decl (declarator->u.id.name);
846 && TREE_CODE (init) == TREE_LIST
847 && TREE_VALUE (init) == error_mark_node
848 && TREE_CHAIN (init) == NULL_TREE)
851 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist);
852 if (! value || error_operand_p (value))
853 /* friend or constructor went bad. */
854 return error_mark_node;
856 if (TREE_CODE (value) == TYPE_DECL && init)
858 error ("typedef `%D' is initialized (use __typeof__ instead)", value);
862 /* Pass friendly classes back. */
863 if (value == void_type_node)
866 /* Pass friend decls back. */
867 if ((TREE_CODE (value) == FUNCTION_DECL
868 || TREE_CODE (value) == TEMPLATE_DECL)
869 && DECL_CONTEXT (value) != current_class_type)
872 if (DECL_NAME (value) != NULL_TREE
873 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
874 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
875 error ("member `%D' conflicts with virtual function table field name",
878 /* Stash away type declarations. */
879 if (TREE_CODE (value) == TYPE_DECL)
881 DECL_NONLOCAL (value) = 1;
882 DECL_CONTEXT (value) = current_class_type;
884 if (processing_template_decl)
885 value = push_template_decl (value);
890 if (DECL_IN_AGGR_P (value))
892 error ("`%D' is already defined in `%T'", value,
893 DECL_CONTEXT (value));
894 return void_type_node;
898 asmspec = TREE_STRING_POINTER (asmspec_tree);
902 if (TREE_CODE (value) == FUNCTION_DECL)
904 grok_function_init (value, init);
907 else if (pedantic && TREE_CODE (value) != VAR_DECL)
908 /* Already complained in grokdeclarator. */
912 /* We allow initializers to become parameters to base
914 if (TREE_CODE (init) == TREE_LIST)
916 if (TREE_CHAIN (init) == NULL_TREE)
917 init = TREE_VALUE (init);
919 init = digest_init (TREE_TYPE (value), init, (tree *)0);
922 if (!processing_template_decl)
924 if (TREE_CODE (init) == CONST_DECL)
925 init = DECL_INITIAL (init);
926 else if (TREE_READONLY_DECL_P (init))
927 init = decl_constant_value (init);
928 else if (TREE_CODE (init) == CONSTRUCTOR)
929 init = digest_init (TREE_TYPE (value), init, (tree *)0);
930 if (init != error_mark_node && ! TREE_CONSTANT (init))
932 /* We can allow references to things that are effectively
933 static, since references are initialized with the
935 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
936 || (TREE_STATIC (init) == 0
937 && (!DECL_P (init) || DECL_EXTERNAL (init) == 0)))
939 error ("field initializer is not constant");
940 init = error_mark_node;
947 if (processing_template_decl
948 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
950 value = push_template_decl (value);
951 if (error_operand_p (value))
952 return error_mark_node;
956 cplus_decl_attributes (&value, attrlist, 0);
958 if (TREE_CODE (value) == VAR_DECL)
960 finish_static_data_member_decl (value, init, asmspec_tree,
964 if (TREE_CODE (value) == FIELD_DECL)
967 error ("`asm' specifiers are not permitted on non-static data members");
968 if (DECL_INITIAL (value) == error_mark_node)
969 init = error_mark_node;
970 cp_finish_decl (value, init, NULL_TREE, flags);
971 DECL_INITIAL (value) = init;
972 DECL_IN_AGGR_P (value) = 1;
975 if (TREE_CODE (value) == FUNCTION_DECL)
978 set_user_assembler_name (value, asmspec);
979 if (!DECL_FRIEND_P (value))
980 grok_special_member_properties (value);
982 cp_finish_decl (value, init, asmspec_tree, flags);
984 /* Pass friends back this way. */
985 if (DECL_FRIEND_P (value))
986 return void_type_node;
988 DECL_IN_AGGR_P (value) = 1;
996 /* Like `grokfield', but for bitfields.
997 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1000 grokbitfield (const cp_declarator *declarator,
1001 cp_decl_specifier_seq *declspecs, tree width)
1003 tree value = grokdeclarator (declarator, declspecs, BITFIELD, 0, NULL);
1005 if (! value) return NULL_TREE; /* friends went bad. */
1007 /* Pass friendly classes back. */
1008 if (TREE_CODE (value) == VOID_TYPE)
1009 return void_type_node;
1011 if (TREE_CODE (value) == TYPE_DECL)
1013 error ("cannot declare `%D' to be a bit-field type", value);
1017 /* Usually, finish_struct_1 catches bitfields with invalid types.
1018 But, in the case of bitfields with function type, we confuse
1019 ourselves into thinking they are member functions, so we must
1021 if (TREE_CODE (value) == FUNCTION_DECL)
1023 error ("cannot declare bit-field `%D' with function type",
1028 if (DECL_IN_AGGR_P (value))
1030 error ("`%D' is already defined in the class %T", value,
1031 DECL_CONTEXT (value));
1032 return void_type_node;
1035 if (TREE_STATIC (value))
1037 error ("static member `%D' cannot be a bit-field", value);
1040 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1042 if (width != error_mark_node)
1044 constant_expression_warning (width);
1045 DECL_INITIAL (value) = width;
1046 SET_DECL_C_BIT_FIELD (value);
1049 DECL_IN_AGGR_P (value) = 1;
1053 /* When a function is declared with an initializer,
1054 do the right thing. Currently, there are two possibilities:
1059 // initialization possibility #1.
1060 virtual void f () = 0;
1082 // initialization possibility #2
1089 grok_function_init (tree decl, tree init)
1091 /* An initializer for a function tells how this function should
1093 tree type = TREE_TYPE (decl);
1095 if (TREE_CODE (type) == FUNCTION_TYPE)
1096 error ("initializer specified for non-member function `%D'", decl);
1097 else if (integer_zerop (init))
1098 DECL_PURE_VIRTUAL_P (decl) = 1;
1100 error ("invalid initializer for virtual method `%D'", decl);
1104 cplus_decl_attributes (tree *decl, tree attributes, int flags)
1106 if (*decl == NULL_TREE || *decl == void_type_node)
1109 if (TREE_CODE (*decl) == TEMPLATE_DECL)
1110 decl = &DECL_TEMPLATE_RESULT (*decl);
1112 decl_attributes (decl, attributes, flags);
1114 if (TREE_CODE (*decl) == TYPE_DECL)
1115 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl));
1118 /* Walks through the namespace- or function-scope anonymous union OBJECT,
1119 building appropriate ALIAS_DECLs. Returns one of the fields for use in
1120 the mangled name. */
1123 build_anon_union_vars (tree object)
1125 tree type = TREE_TYPE (object);
1126 tree main_decl = NULL_TREE;
1129 /* Rather than write the code to handle the non-union case,
1130 just give an error. */
1131 if (TREE_CODE (type) != UNION_TYPE)
1132 error ("anonymous struct not inside named type");
1134 for (field = TYPE_FIELDS (type);
1136 field = TREE_CHAIN (field))
1141 if (DECL_ARTIFICIAL (field))
1143 if (TREE_CODE (field) != FIELD_DECL)
1146 `%#D' invalid; an anonymous union can only have non-static data members",
1151 if (TREE_PRIVATE (field))
1152 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
1153 else if (TREE_PROTECTED (field))
1154 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
1156 if (processing_template_decl)
1157 ref = build_min_nt (COMPONENT_REF, object,
1158 DECL_NAME (field), NULL_TREE);
1160 ref = build_class_member_access_expr (object, field, NULL_TREE,
1163 if (DECL_NAME (field))
1165 decl = build_decl (ALIAS_DECL, DECL_NAME (field), TREE_TYPE (field));
1166 DECL_INITIAL (decl) = ref;
1167 TREE_PUBLIC (decl) = 0;
1168 TREE_STATIC (decl) = 0;
1169 DECL_EXTERNAL (decl) = 1;
1170 decl = pushdecl (decl);
1172 else if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1173 decl = build_anon_union_vars (ref);
1177 if (main_decl == NULL_TREE)
1184 /* Finish off the processing of a UNION_TYPE structure. If the union is an
1185 anonymous union, then all members must be laid out together. PUBLIC_P
1186 is nonzero if this union is not declared static. */
1189 finish_anon_union (tree anon_union_decl)
1191 tree type = TREE_TYPE (anon_union_decl);
1193 bool public_p = TREE_PUBLIC (anon_union_decl);
1195 /* The VAR_DECL's context is the same as the TYPE's context. */
1196 DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type));
1198 if (TYPE_FIELDS (type) == NULL_TREE)
1203 error ("namespace-scope anonymous aggregates must be static");
1207 main_decl = build_anon_union_vars (anon_union_decl);
1208 if (main_decl == NULL_TREE)
1210 warning ("anonymous union with no members");
1214 if (!processing_template_decl)
1216 /* Use main_decl to set the mangled name. */
1217 DECL_NAME (anon_union_decl) = DECL_NAME (main_decl);
1218 mangle_decl (anon_union_decl);
1219 DECL_NAME (anon_union_decl) = NULL_TREE;
1222 pushdecl (anon_union_decl);
1223 if (building_stmt_tree ()
1224 && at_function_scope_p ())
1225 add_decl_expr (anon_union_decl);
1226 else if (!processing_template_decl)
1227 rest_of_decl_compilation (anon_union_decl,
1228 toplevel_bindings_p (), at_eof);
1231 /* Auxiliary functions to make type signatures for
1232 `operator new' and `operator delete' correspond to
1233 what compiler will be expecting. */
1236 coerce_new_type (tree type)
1239 tree args = TYPE_ARG_TYPES (type);
1241 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1243 if (!same_type_p (TREE_TYPE (type), ptr_type_node))
1244 e = 1, error ("`operator new' must return type `%T'", ptr_type_node);
1246 if (!args || args == void_list_node
1247 || !same_type_p (TREE_VALUE (args), size_type_node))
1250 if (args && args != void_list_node)
1251 args = TREE_CHAIN (args);
1252 pedwarn ("`operator new' takes type `size_t' (`%T') as first parameter", size_type_node);
1257 args = tree_cons (NULL_TREE, size_type_node, args);
1260 type = build_exception_variant
1261 (build_function_type (ptr_type_node, args),
1262 TYPE_RAISES_EXCEPTIONS (type));
1270 coerce_delete_type (tree type)
1273 tree args = TYPE_ARG_TYPES (type);
1275 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1277 if (!same_type_p (TREE_TYPE (type), void_type_node))
1278 e = 1, error ("`operator delete' must return type `%T'", void_type_node);
1280 if (!args || args == void_list_node
1281 || !same_type_p (TREE_VALUE (args), ptr_type_node))
1284 if (args && args != void_list_node)
1285 args = TREE_CHAIN (args);
1286 error ("`operator delete' takes type `%T' as first parameter", ptr_type_node);
1291 args = tree_cons (NULL_TREE, ptr_type_node, args);
1294 type = build_exception_variant
1295 (build_function_type (void_type_node, args),
1296 TYPE_RAISES_EXCEPTIONS (type));
1305 mark_vtable_entries (tree decl)
1307 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
1309 for (; entries; entries = TREE_CHAIN (entries))
1311 tree fnaddr = TREE_VALUE (entries);
1314 STRIP_NOPS (fnaddr);
1316 if (TREE_CODE (fnaddr) != ADDR_EXPR
1317 && TREE_CODE (fnaddr) != FDESC_EXPR)
1318 /* This entry is an offset: a virtual base class offset, a
1319 virtual call offset, an RTTI offset, etc. */
1322 fn = TREE_OPERAND (fnaddr, 0);
1323 TREE_ADDRESSABLE (fn) = 1;
1324 /* When we don't have vcall offsets, we output thunks whenever
1325 we output the vtables that contain them. With vcall offsets,
1326 we know all the thunks we'll need when we emit a virtual
1327 function, so we emit the thunks there instead. */
1328 if (DECL_THUNK_P (fn))
1329 use_thunk (fn, /*emit_p=*/0);
1334 /* Set DECL up to have the closest approximation of "initialized common"
1335 linkage available. */
1338 comdat_linkage (tree decl)
1341 make_decl_one_only (decl);
1342 else if (TREE_CODE (decl) == FUNCTION_DECL
1343 || (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)))
1344 /* We can just emit function and compiler-generated variables
1345 statically; having multiple copies is (for the most part) only
1348 There are two correctness issues, however: the address of a
1349 template instantiation with external linkage should be the
1350 same, independent of what translation unit asks for the
1351 address, and this will not hold when we emit multiple copies of
1352 the function. However, there's little else we can do.
1354 Also, by default, the typeinfo implementation assumes that
1355 there will be only one copy of the string used as the name for
1356 each type. Therefore, if weak symbols are unavailable, the
1357 run-time library should perform a more conservative check; it
1358 should perform a string comparison, rather than an address
1360 TREE_PUBLIC (decl) = 0;
1363 /* Static data member template instantiations, however, cannot
1364 have multiple copies. */
1365 if (DECL_INITIAL (decl) == 0
1366 || DECL_INITIAL (decl) == error_mark_node)
1367 DECL_COMMON (decl) = 1;
1368 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
1370 DECL_COMMON (decl) = 1;
1371 DECL_INITIAL (decl) = error_mark_node;
1373 else if (!DECL_EXPLICIT_INSTANTIATION (decl))
1375 /* We can't do anything useful; leave vars for explicit
1377 DECL_EXTERNAL (decl) = 1;
1378 DECL_NOT_REALLY_EXTERN (decl) = 0;
1382 if (DECL_LANG_SPECIFIC (decl))
1383 DECL_COMDAT (decl) = 1;
1386 /* For win32 we also want to put explicit instantiations in
1387 linkonce sections, so that they will be merged with implicit
1388 instantiations; otherwise we get duplicate symbol errors.
1389 For Darwin we do not want explicit instantiations to be
1393 maybe_make_one_only (tree decl)
1395 /* We used to say that this was not necessary on targets that support weak
1396 symbols, because the implicit instantiations will defer to the explicit
1397 one. However, that's not actually the case in SVR4; a strong definition
1398 after a weak one is an error. Also, not making explicit
1399 instantiations one_only means that we can end up with two copies of
1400 some template instantiations. */
1404 /* We can't set DECL_COMDAT on functions, or finish_file will think
1405 we can get away with not emitting them if they aren't used. We need
1406 to for variables so that cp_finish_decl will update their linkage,
1407 because their DECL_INITIAL may not have been set properly yet. */
1409 if (!TARGET_WEAK_NOT_IN_ARCHIVE_TOC
1410 || (! DECL_EXPLICIT_INSTANTIATION (decl)
1411 && ! DECL_TEMPLATE_SPECIALIZATION (decl)))
1413 make_decl_one_only (decl);
1415 if (TREE_CODE (decl) == VAR_DECL)
1417 DECL_COMDAT (decl) = 1;
1418 /* Mark it needed so we don't forget to emit it. */
1419 mark_decl_referenced (decl);
1424 /* Determine whether or not we want to specifically import or export CTYPE,
1425 using various heuristics. */
1428 import_export_class (tree ctype)
1430 /* -1 for imported, 1 for exported. */
1431 int import_export = 0;
1433 /* It only makes sense to call this function at EOF. The reason is
1434 that this function looks at whether or not the first non-inline
1435 non-abstract virtual member function has been defined in this
1436 translation unit. But, we can't possibly know that until we've
1437 seen the entire translation unit. */
1438 my_friendly_assert (at_eof, 20000226);
1440 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1443 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
1444 we will have CLASSTYPE_INTERFACE_ONLY set but not
1445 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
1446 heuristic because someone will supply a #pragma implementation
1447 elsewhere, and deducing it here would produce a conflict. */
1448 if (CLASSTYPE_INTERFACE_ONLY (ctype))
1451 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
1453 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
1455 else if (CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
1456 && !flag_implicit_templates)
1457 /* For a template class, without -fimplicit-templates, check the
1458 repository. If the virtual table is assigned to this
1459 translation unit, then export the class; otherwise, import
1461 import_export = repo_export_class_p (ctype) ? 1 : -1;
1462 else if (TYPE_POLYMORPHIC_P (ctype))
1464 /* The ABI specifies that the virtual table and associated
1465 information are emitted with the key method, if any. */
1466 tree method = CLASSTYPE_KEY_METHOD (ctype);
1467 /* If weak symbol support is not available, then we must be
1468 careful not to emit the vtable when the key function is
1469 inline. An inline function can be defined in multiple
1470 translation units. If we were to emit the vtable in each
1471 translation unit containing a definition, we would get
1472 multiple definition errors at link-time. */
1473 if (method && (flag_weak || ! DECL_DECLARED_INLINE_P (method)))
1474 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
1477 #ifdef MULTIPLE_SYMBOL_SPACES
1478 if (import_export == -1)
1482 /* Allow backends the chance to overrule the decision. */
1483 if (targetm.cxx.import_export_class)
1484 import_export = targetm.cxx.import_export_class (ctype, import_export);
1488 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
1489 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
1493 /* Return true if VAR has already been provided to the back end; in that
1494 case VAR should not be modified further by the front end. */
1496 var_finalized_p (tree var)
1498 return cgraph_varpool_node (var)->finalized;
1501 /* DECL is a VAR_DECL or FUNCTION_DECL which, for whatever reason,
1502 must be emitted in this translation unit. Mark it as such. */
1505 mark_needed (tree decl)
1507 /* It's possible that we no longer need to set
1508 TREE_SYMBOL_REFERENCED here directly, but doing so is
1510 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)) = 1;
1511 mark_decl_referenced (decl);
1514 /* DECL is either a FUNCTION_DECL or a VAR_DECL. This function
1515 returns true if a definition of this entity should be provided in
1516 this object file. Callers use this function to determine whether
1517 or not to let the back end know that a definition of DECL is
1518 available in this translation unit. */
1521 decl_needed_p (tree decl)
1523 my_friendly_assert (TREE_CODE (decl) == VAR_DECL
1524 || TREE_CODE (decl) == FUNCTION_DECL,
1526 /* This function should only be called at the end of the translation
1527 unit. We cannot be sure of whether or not something will be
1528 COMDAT until that point. */
1529 my_friendly_assert (at_eof, 20040726);
1531 /* All entities with external linkage that are not COMDAT should be
1532 emitted; they may be referred to from other object files. */
1533 if (TREE_PUBLIC (decl) && !DECL_COMDAT (decl))
1535 /* If this entity was used, let the back-end see it; it will decide
1536 whether or not to emit it into the object file. */
1537 if (TREE_USED (decl)
1538 || (DECL_ASSEMBLER_NAME_SET_P (decl)
1539 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))))
1541 /* Otherwise, DECL does not need to be emitted -- yet. A subsequent
1542 reference to DECL might cause it to be emitted later. */
1546 /* If necessary, write out the vtables for the dynamic class CTYPE.
1547 Returns true if any vtables were emitted. */
1550 maybe_emit_vtables (tree ctype)
1556 /* If the vtables for this class have already been emitted there is
1557 nothing more to do. */
1558 primary_vtbl = CLASSTYPE_VTABLES (ctype);
1559 if (var_finalized_p (primary_vtbl))
1561 /* Ignore dummy vtables made by get_vtable_decl. */
1562 if (TREE_TYPE (primary_vtbl) == void_type_node)
1565 /* See if any of the vtables are needed. */
1566 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1568 import_export_decl (vtbl);
1569 if (DECL_NOT_REALLY_EXTERN (vtbl) && decl_needed_p (vtbl))
1574 /* If the references to this class' vtables are optimized away,
1575 still emit the appropriate debugging information. See
1577 if (DECL_COMDAT (primary_vtbl)
1578 && CLASSTYPE_DEBUG_REQUESTED (ctype))
1579 note_debug_info_needed (ctype);
1583 /* The ABI requires that we emit all of the vtables if we emit any
1585 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1587 /* Mark entities references from the virtual table as used. */
1588 mark_vtable_entries (vtbl);
1590 if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0)
1592 /* It had better be all done at compile-time. */
1593 if (store_init_value (vtbl, DECL_INITIAL (vtbl)))
1598 DECL_EXTERNAL (vtbl) = 0;
1599 rest_of_decl_compilation (vtbl, 1, 1);
1601 /* Because we're only doing syntax-checking, we'll never end up
1602 actually marking the variable as written. */
1603 if (flag_syntax_only)
1604 TREE_ASM_WRITTEN (vtbl) = 1;
1607 /* Since we're writing out the vtable here, also write the debug
1609 note_debug_info_needed (ctype);
1614 /* Determine the ELF symbol visibility for DECL. */
1617 determine_visibility (tree decl)
1621 /* Cloned constructors and destructors get the same visibility as
1622 the underlying function. That should be set up in
1623 maybe_clone_body. */
1624 if (DECL_CLONED_FUNCTION_P (decl))
1627 if (DECL_CLASS_SCOPE_P (decl))
1628 class_type = DECL_CONTEXT (decl);
1629 else if (TREE_CODE (decl) == VAR_DECL
1630 && DECL_TINFO_P (decl)
1631 && CLASS_TYPE_P (TREE_TYPE (DECL_NAME (decl))))
1632 class_type = TREE_TYPE (DECL_NAME (decl));
1635 /* Virtual tables have DECL_CONTEXT set to their associated class,
1636 so they are automatically handled above. */
1637 my_friendly_assert (!(TREE_CODE (decl) == VAR_DECL
1638 && DECL_VTABLE_OR_VTT_P (decl)), 20040803);
1639 /* Entities not associated with any class just get the
1640 visibility specified by their attributes. */
1644 /* By default, static data members and function members receive
1645 the visibility of their containing class. */
1647 && (TREE_CODE (decl) == VAR_DECL
1648 || TREE_CODE (decl) == FUNCTION_DECL)
1649 && !lookup_attribute ("visibility", DECL_ATTRIBUTES (decl)))
1651 if (TREE_CODE (decl) == FUNCTION_DECL
1652 && DECL_DECLARED_INLINE_P (decl)
1653 && visibility_options.inlines_hidden)
1655 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
1656 DECL_VISIBILITY_SPECIFIED (decl) = 1;
1660 DECL_VISIBILITY (decl) = CLASSTYPE_VISIBILITY (class_type);
1661 DECL_VISIBILITY_SPECIFIED (decl)
1662 = CLASSTYPE_VISIBILITY_SPECIFIED (class_type);
1667 /* DECL is a FUNCTION_DECL or VAR_DECL. If the object file linkage
1668 for DECL has not already been determined, do so now by setting
1669 DECL_EXTERNAL, DECL_COMDAT and other related flags. Until this
1670 function is called entities with vague linkage whose definitions
1671 are available must have TREE_PUBLIC set.
1673 If this function decides to place DECL in COMDAT, it will set
1674 appropriate flags -- but will not clear DECL_EXTERNAL. It is up to
1675 the caller to decide whether or not to clear DECL_EXTERNAL. Some
1676 callers defer that decision until it is clear that DECL is actually
1680 import_export_decl (tree decl)
1686 if (DECL_INTERFACE_KNOWN (decl))
1689 /* We cannot determine what linkage to give to an entity with vague
1690 linkage until the end of the file. For example, a virtual table
1691 for a class will be defined if and only if the key method is
1692 defined in this translation unit. As a further example, consider
1693 that when compiling a translation unit that uses PCH file with
1694 "-frepo" it would be incorrect to make decisions about what
1695 entities to emit when building the PCH; those decisions must be
1696 delayed until the repository information has been processed. */
1697 my_friendly_assert (at_eof, 20040727);
1698 /* Object file linkage for explicit instantiations is handled in
1699 mark_decl_instantiated. For static variables in functions with
1700 vague linkage, maybe_commonize_var is used.
1702 Therefore, the only declarations that should be provided to this
1703 function are those with external linkage that:
1705 * implicit instantiations of function templates
1709 * implicit instantiations of static data members of class
1716 Furthermore, all entities that reach this point must have a
1717 definition available in this translation unit.
1719 The following assertions check these conditions. */
1720 my_friendly_assert (TREE_CODE (decl) == FUNCTION_DECL
1721 || TREE_CODE (decl) == VAR_DECL,
1723 /* Any code that creates entities with TREE_PUBLIC cleared should
1724 also set DECL_INTERFACE_KNOWN. */
1725 my_friendly_assert (TREE_PUBLIC (decl), 20040725);
1726 if (TREE_CODE (decl) == FUNCTION_DECL)
1727 my_friendly_assert (DECL_IMPLICIT_INSTANTIATION (decl)
1728 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl)
1729 || DECL_DECLARED_INLINE_P (decl),
1732 my_friendly_assert (DECL_IMPLICIT_INSTANTIATION (decl)
1733 || DECL_VTABLE_OR_VTT_P (decl)
1734 || DECL_TINFO_P (decl),
1736 /* Check that a definition of DECL is available in this translation
1738 my_friendly_assert (!DECL_REALLY_EXTERN (decl), 20040725);
1740 /* Assume that DECL will not have COMDAT linkage. */
1742 /* Assume that DECL will not be imported into this translation
1746 /* See if the repository tells us whether or not to emit DECL in
1747 this translation unit. */
1748 emit_p = repo_emit_p (decl);
1751 else if (emit_p == 1)
1753 /* The repository indicates that this entity should be defined
1754 here. Make sure the back end honors that request. */
1755 if (TREE_CODE (decl) == VAR_DECL)
1757 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)
1758 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
1761 FOR_EACH_CLONE (clone, decl)
1762 mark_needed (clone);
1766 /* Output the definition as an ordinary strong definition. */
1767 DECL_EXTERNAL (decl) = 0;
1768 DECL_INTERFACE_KNOWN (decl) = 1;
1773 /* We have already decided what to do with this DECL; there is no
1774 need to check anything further. */
1776 else if (TREE_CODE (decl) == VAR_DECL && DECL_VTABLE_OR_VTT_P (decl))
1778 tree type = DECL_CONTEXT (decl);
1779 import_export_class (type);
1780 if (TYPE_FOR_JAVA (type))
1782 else if (CLASSTYPE_INTERFACE_KNOWN (type)
1783 && CLASSTYPE_INTERFACE_ONLY (type))
1785 else if (TARGET_WEAK_NOT_IN_ARCHIVE_TOC
1786 && !CLASSTYPE_USE_TEMPLATE (type)
1787 && CLASSTYPE_KEY_METHOD (type)
1788 && !DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (type)))
1789 /* The ABI requires that all virtual tables be emitted with
1790 COMDAT linkage. However, on systems where COMDAT symbols
1791 don't show up in the table of contents for a static
1792 archive, the linker will report errors about undefined
1793 symbols because it will not see the virtual table
1794 definition. Therefore, in the case that we know that the
1795 virtual table will be emitted in only one translation
1796 unit, we make the virtual table an ordinary definition
1797 with external linkage. */
1798 DECL_EXTERNAL (decl) = 0;
1799 else if (CLASSTYPE_INTERFACE_KNOWN (type))
1801 /* TYPE is being exported from this translation unit, so DECL
1802 should be defined here. The ABI requires COMDAT
1803 linkage. Normally, we only emit COMDAT things when they
1804 are needed; make sure that we realize that this entity is
1809 else if (!flag_implicit_templates
1810 && CLASSTYPE_IMPLICIT_INSTANTIATION (type))
1815 else if (TREE_CODE (decl) == VAR_DECL && DECL_TINFO_P (decl))
1817 tree type = TREE_TYPE (DECL_NAME (decl));
1818 if (CLASS_TYPE_P (type))
1820 import_export_class (type);
1821 if (CLASSTYPE_INTERFACE_KNOWN (type)
1822 && TYPE_POLYMORPHIC_P (type)
1823 && CLASSTYPE_INTERFACE_ONLY (type)
1824 /* If -fno-rtti was specified, then we cannot be sure
1825 that RTTI information will be emitted with the
1826 virtual table of the class, so we must emit it
1827 wherever it is used. */
1833 if (CLASSTYPE_INTERFACE_KNOWN (type)
1834 && !CLASSTYPE_INTERFACE_ONLY (type))
1841 else if (DECL_TEMPLATE_INSTANTIATION (decl)
1842 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1844 /* DECL is an implicit instantiation of a function or static
1846 if (flag_implicit_templates
1847 || (flag_implicit_inline_templates
1848 && TREE_CODE (decl) == FUNCTION_DECL
1849 && DECL_DECLARED_INLINE_P (decl)))
1852 /* If we are not implicitly generating templates, then mark
1853 this entity as undefined in this translation unit. */
1856 else if (DECL_FUNCTION_MEMBER_P (decl))
1858 if (!DECL_DECLARED_INLINE_P (decl))
1860 tree ctype = DECL_CONTEXT (decl);
1861 import_export_class (ctype);
1862 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1864 DECL_NOT_REALLY_EXTERN (decl)
1865 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
1866 || (DECL_DECLARED_INLINE_P (decl)
1867 && ! flag_implement_inlines
1868 && !DECL_VINDEX (decl)));
1870 if (!DECL_NOT_REALLY_EXTERN (decl))
1871 DECL_EXTERNAL (decl) = 1;
1873 /* Always make artificials weak. */
1874 if (DECL_ARTIFICIAL (decl) && flag_weak)
1877 maybe_make_one_only (decl);
1888 /* If we are importing DECL into this translation unit, mark is
1889 an undefined here. */
1890 DECL_EXTERNAL (decl) = 1;
1891 DECL_NOT_REALLY_EXTERN (decl) = 0;
1895 /* If we decided to put DECL in COMDAT, mark it accordingly at
1897 comdat_linkage (decl);
1900 DECL_INTERFACE_KNOWN (decl) = 1;
1903 /* Return an expression that performs the destruction of DECL, which
1904 must be a VAR_DECL whose type has a non-trivial destructor, or is
1905 an array whose (innermost) elements have a non-trivial destructor. */
1908 build_cleanup (tree decl)
1911 tree type = TREE_TYPE (decl);
1913 /* This function should only be called for declarations that really
1914 require cleanups. */
1915 my_friendly_assert (!TYPE_HAS_TRIVIAL_DESTRUCTOR (type), 20030106);
1917 /* Treat all objects with destructors as used; the destructor may do
1918 something substantive. */
1921 if (TREE_CODE (type) == ARRAY_TYPE)
1925 cxx_mark_addressable (decl);
1926 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
1928 temp = build_delete (TREE_TYPE (temp), temp,
1929 sfk_complete_destructor,
1930 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
1934 /* Returns the initialization guard variable for the variable DECL,
1935 which has static storage duration. */
1938 get_guard (tree decl)
1943 sname = mangle_guard_variable (decl);
1944 guard = IDENTIFIER_GLOBAL_VALUE (sname);
1949 /* We use a type that is big enough to contain a mutex as well
1950 as an integer counter. */
1951 guard_type = targetm.cxx.guard_type ();
1952 guard = build_decl (VAR_DECL, sname, guard_type);
1954 /* The guard should have the same linkage as what it guards. */
1955 TREE_PUBLIC (guard) = TREE_PUBLIC (decl);
1956 TREE_STATIC (guard) = TREE_STATIC (decl);
1957 DECL_COMMON (guard) = DECL_COMMON (decl);
1958 DECL_ONE_ONLY (guard) = DECL_ONE_ONLY (decl);
1959 if (TREE_PUBLIC (decl))
1960 DECL_WEAK (guard) = DECL_WEAK (decl);
1962 DECL_ARTIFICIAL (guard) = 1;
1963 TREE_USED (guard) = 1;
1964 pushdecl_top_level_and_finish (guard, NULL_TREE);
1969 /* Return those bits of the GUARD variable that should be set when the
1970 guarded entity is actually initialized. */
1973 get_guard_bits (tree guard)
1975 if (!targetm.cxx.guard_mask_bit ())
1977 /* We only set the first byte of the guard, in order to leave room
1978 for a mutex in the high-order bits. */
1979 guard = build1 (ADDR_EXPR,
1980 build_pointer_type (TREE_TYPE (guard)),
1982 guard = build1 (NOP_EXPR,
1983 build_pointer_type (char_type_node),
1985 guard = build1 (INDIRECT_REF, char_type_node, guard);
1991 /* Return an expression which determines whether or not the GUARD
1992 variable has already been initialized. */
1995 get_guard_cond (tree guard)
1999 /* Check to see if the GUARD is zero. */
2000 guard = get_guard_bits (guard);
2002 /* Mask off all but the low bit. */
2003 if (targetm.cxx.guard_mask_bit ())
2005 guard_value = integer_one_node;
2006 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
2007 guard_value = convert (TREE_TYPE (guard), guard_value);
2008 guard = cp_build_binary_op (BIT_AND_EXPR, guard, guard_value);
2011 guard_value = integer_zero_node;
2012 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
2013 guard_value = convert (TREE_TYPE (guard), guard_value);
2014 return cp_build_binary_op (EQ_EXPR, guard, guard_value);
2017 /* Return an expression which sets the GUARD variable, indicating that
2018 the variable being guarded has been initialized. */
2021 set_guard (tree guard)
2025 /* Set the GUARD to one. */
2026 guard = get_guard_bits (guard);
2027 guard_init = integer_one_node;
2028 if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard)))
2029 guard_init = convert (TREE_TYPE (guard), guard_init);
2030 return build_modify_expr (guard, NOP_EXPR, guard_init);
2033 /* Start the process of running a particular set of global constructors
2034 or destructors. Subroutine of do_[cd]tors. */
2037 start_objects (int method_type, int initp)
2043 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2045 if (initp != DEFAULT_INIT_PRIORITY)
2055 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
2058 sprintf (type, "%c", method_type);
2060 fndecl = build_lang_decl (FUNCTION_DECL,
2061 get_file_function_name_long (type),
2062 build_function_type (void_type_node,
2064 start_preparsed_function (fndecl, /*attrs=*/NULL_TREE, SF_PRE_PARSED);
2066 /* It can be a static function as long as collect2 does not have
2067 to scan the object file to find its ctor/dtor routine. */
2068 TREE_PUBLIC (current_function_decl) = ! targetm.have_ctors_dtors;
2070 /* Mark this declaration as used to avoid spurious warnings. */
2071 TREE_USED (current_function_decl) = 1;
2073 /* Mark this function as a global constructor or destructor. */
2074 if (method_type == 'I')
2075 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
2077 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
2078 DECL_LANG_SPECIFIC (current_function_decl)->decl_flags.u2sel = 1;
2080 body = begin_compound_stmt (BCS_FN_BODY);
2082 /* We cannot allow these functions to be elided, even if they do not
2083 have external linkage. And, there's no point in deferring
2084 compilation of thes functions; they're all going to have to be
2086 DECL_INLINE (current_function_decl) = 0;
2087 DECL_UNINLINABLE (current_function_decl) = 1;
2092 /* Finish the process of running a particular set of global constructors
2093 or destructors. Subroutine of do_[cd]tors. */
2096 finish_objects (int method_type, int initp, tree body)
2101 finish_compound_stmt (body);
2102 fn = finish_function (0);
2103 expand_or_defer_fn (fn);
2105 /* When only doing semantic analysis, and no RTL generation, we
2106 can't call functions that directly emit assembly code; there is
2107 no assembly file in which to put the code. */
2108 if (flag_syntax_only)
2111 if (targetm.have_ctors_dtors)
2113 rtx fnsym = XEXP (DECL_RTL (fn), 0);
2114 if (method_type == 'I')
2115 (* targetm.asm_out.constructor) (fnsym, initp);
2117 (* targetm.asm_out.destructor) (fnsym, initp);
2121 /* The names of the parameters to the function created to handle
2122 initializations and destructions for objects with static storage
2124 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2125 #define PRIORITY_IDENTIFIER "__priority"
2127 /* The name of the function we create to handle initializations and
2128 destructions for objects with static storage duration. */
2129 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2131 /* The declaration for the __INITIALIZE_P argument. */
2132 static GTY(()) tree initialize_p_decl;
2134 /* The declaration for the __PRIORITY argument. */
2135 static GTY(()) tree priority_decl;
2137 /* The declaration for the static storage duration function. */
2138 static GTY(()) tree ssdf_decl;
2140 /* All the static storage duration functions created in this
2141 translation unit. */
2142 static GTY(()) varray_type ssdf_decls;
2144 /* A map from priority levels to information about that priority
2145 level. There may be many such levels, so efficient lookup is
2147 static splay_tree priority_info_map;
2149 /* Begins the generation of the function that will handle all
2150 initialization and destruction of objects with static storage
2151 duration. The function generated takes two parameters of type
2152 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2153 nonzero, it performs initializations. Otherwise, it performs
2154 destructions. It only performs those initializations or
2155 destructions with the indicated __PRIORITY. The generated function
2158 It is assumed that this function will only be called once per
2159 translation unit. */
2162 start_static_storage_duration_function (unsigned count)
2167 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2169 /* Create the identifier for this function. It will be of the form
2170 SSDF_IDENTIFIER_<number>. */
2171 sprintf (id, "%s_%u", SSDF_IDENTIFIER, count);
2173 /* Create the parameters. */
2174 parm_types = void_list_node;
2175 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2176 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2177 type = build_function_type (void_type_node, parm_types);
2179 /* Create the FUNCTION_DECL itself. */
2180 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2181 get_identifier (id),
2183 TREE_PUBLIC (ssdf_decl) = 0;
2184 DECL_ARTIFICIAL (ssdf_decl) = 1;
2186 /* Put this function in the list of functions to be called from the
2187 static constructors and destructors. */
2190 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2192 /* Take this opportunity to initialize the map from priority
2193 numbers to information about that priority level. */
2194 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2195 /*delete_key_fn=*/0,
2196 /*delete_value_fn=*/
2197 (splay_tree_delete_value_fn) &free);
2199 /* We always need to generate functions for the
2200 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2201 priorities later, we'll be sure to find the
2202 DEFAULT_INIT_PRIORITY. */
2203 get_priority_info (DEFAULT_INIT_PRIORITY);
2206 VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl);
2208 /* Create the argument list. */
2209 initialize_p_decl = cp_build_parm_decl
2210 (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node);
2211 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2212 TREE_USED (initialize_p_decl) = 1;
2213 priority_decl = cp_build_parm_decl
2214 (get_identifier (PRIORITY_IDENTIFIER), integer_type_node);
2215 DECL_CONTEXT (priority_decl) = ssdf_decl;
2216 TREE_USED (priority_decl) = 1;
2218 TREE_CHAIN (initialize_p_decl) = priority_decl;
2219 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2221 /* Put the function in the global scope. */
2222 pushdecl (ssdf_decl);
2224 /* Start the function itself. This is equivalent to declaring the
2227 static void __ssdf (int __initialize_p, init __priority_p);
2229 It is static because we only need to call this function from the
2230 various constructor and destructor functions for this module. */
2231 start_preparsed_function (ssdf_decl,
2232 /*attrs=*/NULL_TREE,
2235 /* Set up the scope of the outermost block in the function. */
2236 body = begin_compound_stmt (BCS_FN_BODY);
2238 /* This function must not be deferred because we are depending on
2239 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
2240 DECL_INLINE (ssdf_decl) = 0;
2241 DECL_UNINLINABLE (ssdf_decl) = 1;
2246 /* Finish the generation of the function which performs initialization
2247 and destruction of objects with static storage duration. After
2248 this point, no more such objects can be created. */
2251 finish_static_storage_duration_function (tree body)
2253 /* Close out the function. */
2254 finish_compound_stmt (body);
2255 expand_or_defer_fn (finish_function (0));
2258 /* Return the information about the indicated PRIORITY level. If no
2259 code to handle this level has yet been generated, generate the
2260 appropriate prologue. */
2262 static priority_info
2263 get_priority_info (int priority)
2268 n = splay_tree_lookup (priority_info_map,
2269 (splay_tree_key) priority);
2272 /* Create a new priority information structure, and insert it
2274 pi = xmalloc (sizeof (struct priority_info_s));
2275 pi->initializations_p = 0;
2276 pi->destructions_p = 0;
2277 splay_tree_insert (priority_info_map,
2278 (splay_tree_key) priority,
2279 (splay_tree_value) pi);
2282 pi = (priority_info) n->value;
2287 /* Set up to handle the initialization or destruction of DECL. If
2288 INITP is nonzero, we are initializing the variable. Otherwise, we
2289 are destroying it. */
2292 start_static_initialization_or_destruction (tree decl, int initp)
2294 tree guard_if_stmt = NULL_TREE;
2301 /* Figure out the priority for this declaration. */
2302 priority = DECL_INIT_PRIORITY (decl);
2304 priority = DEFAULT_INIT_PRIORITY;
2306 /* Remember that we had an initialization or finalization at this
2308 pi = get_priority_info (priority);
2310 pi->initializations_p = 1;
2312 pi->destructions_p = 1;
2314 /* Trick the compiler into thinking we are at the file and line
2315 where DECL was declared so that error-messages make sense, and so
2316 that the debugger will show somewhat sensible file and line
2318 input_location = DECL_SOURCE_LOCATION (decl);
2324 Access control for implicit calls to the constructors,
2325 the conversion functions, or the destructor called to
2326 create and destroy a static data member is performed as
2327 if these calls appeared in the scope of the member's
2330 we pretend we are in a static member function of the class of
2331 which the DECL is a member. */
2332 if (member_p (decl))
2334 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
2335 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
2338 /* Conditionalize this initialization on being in the right priority
2339 and being initializing/finalizing appropriately. */
2340 guard_if_stmt = begin_if_stmt ();
2341 cond = cp_build_binary_op (EQ_EXPR,
2343 build_int_2 (priority, 0));
2344 init_cond = initp ? integer_one_node : integer_zero_node;
2345 init_cond = cp_build_binary_op (EQ_EXPR,
2348 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
2350 /* Assume we don't need a guard. */
2352 /* We need a guard if this is an object with external linkage that
2353 might be initialized in more than one place. (For example, a
2354 static data member of a template, when the data member requires
2356 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
2357 || DECL_ONE_ONLY (decl)
2358 || DECL_WEAK (decl)))
2362 guard = get_guard (decl);
2364 /* When using __cxa_atexit, we just check the GUARD as we would
2365 for a local static. */
2366 if (flag_use_cxa_atexit)
2368 /* When using __cxa_atexit, we never try to destroy
2369 anything from a static destructor. */
2370 my_friendly_assert (initp, 20000629);
2371 guard_cond = get_guard_cond (guard);
2373 /* If we don't have __cxa_atexit, then we will be running
2374 destructors from .fini sections, or their equivalents. So,
2375 we need to know how many times we've tried to initialize this
2376 object. We do initializations only if the GUARD is zero,
2377 i.e., if we are the first to initialize the variable. We do
2378 destructions only if the GUARD is one, i.e., if we are the
2379 last to destroy the variable. */
2382 = cp_build_binary_op (EQ_EXPR,
2383 build_unary_op (PREINCREMENT_EXPR,
2389 = cp_build_binary_op (EQ_EXPR,
2390 build_unary_op (PREDECREMENT_EXPR,
2395 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, guard_cond);
2398 finish_if_stmt_cond (cond, guard_if_stmt);
2400 /* If we're using __cxa_atexit, we have not already set the GUARD,
2401 so we must do so now. */
2402 if (guard && initp && flag_use_cxa_atexit)
2403 finish_expr_stmt (set_guard (guard));
2405 return guard_if_stmt;
2408 /* We've just finished generating code to do an initialization or
2409 finalization. GUARD_IF_STMT is the if-statement we used to guard
2410 the initialization. */
2413 finish_static_initialization_or_destruction (tree guard_if_stmt)
2415 finish_then_clause (guard_if_stmt);
2416 finish_if_stmt (guard_if_stmt);
2418 /* Now that we're done with DECL we don't need to pretend to be a
2419 member of its class any longer. */
2420 DECL_CONTEXT (current_function_decl) = NULL_TREE;
2421 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
2424 /* Generate code to do the initialization of DECL, a VAR_DECL with
2425 static storage duration. The initialization is INIT. */
2428 do_static_initialization (tree decl, tree init)
2432 /* Set up for the initialization. */
2434 = start_static_initialization_or_destruction (decl,
2437 /* Perform the initialization. */
2439 finish_expr_stmt (init);
2441 /* If we're using __cxa_atexit, register a a function that calls the
2442 destructor for the object. */
2443 if (flag_use_cxa_atexit)
2444 register_dtor_fn (decl);
2447 finish_static_initialization_or_destruction (guard_if_stmt);
2450 /* Generate code to do the static destruction of DECL. If DECL may be
2451 initialized more than once in different object files, GUARD is the
2452 guard variable to check. PRIORITY is the priority for the
2456 do_static_destruction (tree decl)
2460 /* If we're using __cxa_atexit, then destructors are registered
2461 immediately after objects are initialized. */
2462 my_friendly_assert (!flag_use_cxa_atexit, 20000121);
2464 /* If we don't need a destructor, there's nothing to do. */
2465 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2468 /* Actually do the destruction. */
2469 guard_if_stmt = start_static_initialization_or_destruction (decl,
2471 finish_expr_stmt (build_cleanup (decl));
2472 finish_static_initialization_or_destruction (guard_if_stmt);
2475 /* VARS is a list of variables with static storage duration which may
2476 need initialization and/or finalization. Remove those variables
2477 that don't really need to be initialized or finalized, and return
2478 the resulting list. The order in which the variables appear in
2479 VARS is in reverse order of the order in which they should actually
2480 be initialized. The list we return is in the unreversed order;
2481 i.e., the first variable should be initialized first. */
2484 prune_vars_needing_no_initialization (tree *vars)
2487 tree result = NULL_TREE;
2492 tree decl = TREE_VALUE (t);
2493 tree init = TREE_PURPOSE (t);
2495 /* Deal gracefully with error. */
2496 if (decl == error_mark_node)
2498 var = &TREE_CHAIN (t);
2502 /* The only things that can be initialized are variables. */
2503 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
2505 /* If this object is not defined, we don't need to do anything
2507 if (DECL_EXTERNAL (decl))
2509 var = &TREE_CHAIN (t);
2513 /* Also, if the initializer already contains errors, we can bail
2515 if (init && TREE_CODE (init) == TREE_LIST
2516 && value_member (error_mark_node, init))
2518 var = &TREE_CHAIN (t);
2522 /* This variable is going to need initialization and/or
2523 finalization, so we add it to the list. */
2524 *var = TREE_CHAIN (t);
2525 TREE_CHAIN (t) = result;
2532 /* Make sure we have told the back end about all the variables in
2536 write_out_vars (tree vars)
2540 for (v = vars; v; v = TREE_CHAIN (v))
2542 tree var = TREE_VALUE (v);
2543 if (!var_finalized_p (var))
2545 import_export_decl (var);
2546 rest_of_decl_compilation (var, 1, 1);
2551 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
2552 (otherwise) that will initialize all gobal objects with static
2553 storage duration having the indicated PRIORITY. */
2556 generate_ctor_or_dtor_function (bool constructor_p, int priority,
2565 input_location = *locus;
2566 #ifdef USE_MAPPED_LOCATION
2572 /* We use `I' to indicate initialization and `D' to indicate
2574 function_key = constructor_p ? 'I' : 'D';
2576 /* We emit the function lazily, to avoid generating empty
2577 global constructors and destructors. */
2580 /* Call the static storage duration function with appropriate
2583 for (i = 0; i < ssdf_decls->elements_used; ++i)
2585 fndecl = VARRAY_TREE (ssdf_decls, i);
2587 /* Calls to pure or const functions will expand to nothing. */
2588 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2591 body = start_objects (function_key, priority);
2593 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
2595 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
2597 finish_expr_stmt (build_function_call (fndecl, arguments));
2601 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
2602 calls to any functions marked with attributes indicating that
2603 they should be called at initialization- or destruction-time. */
2604 if (priority == DEFAULT_INIT_PRIORITY)
2608 for (fns = constructor_p ? static_ctors : static_dtors;
2610 fns = TREE_CHAIN (fns))
2612 fndecl = TREE_VALUE (fns);
2614 /* Calls to pure/const functions will expand to nothing. */
2615 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2618 body = start_objects (function_key, priority);
2619 finish_expr_stmt (build_function_call (fndecl, NULL_TREE));
2624 /* Close out the function. */
2626 finish_objects (function_key, priority, body);
2629 /* Generate constructor and destructor functions for the priority
2633 generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data)
2635 location_t *locus = data;
2636 int priority = (int) n->key;
2637 priority_info pi = (priority_info) n->value;
2639 /* Generate the functions themselves, but only if they are really
2641 if (pi->initializations_p
2642 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
2643 generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus);
2644 if (pi->destructions_p
2645 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
2646 generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus);
2648 /* Keep iterating. */
2652 /* Called via LANGHOOK_CALLGRAPH_ANALYZE_EXPR. It is supposed to mark
2653 decls referenced from frontend specific constructs; it will be called
2654 only for language-specific tree nodes.
2656 Here we must deal with member pointers. */
2659 cxx_callgraph_analyze_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2660 tree from ATTRIBUTE_UNUSED)
2664 switch (TREE_CODE (t))
2667 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
2668 cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t)));
2671 if (TREE_CODE (BASELINK_FUNCTIONS (t)) == FUNCTION_DECL)
2672 cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t)));
2675 if (DECL_VTABLE_OR_VTT_P (t))
2677 /* The ABI requires that all virtual tables be emitted
2678 whenever one of them is. */
2680 for (vtbl = CLASSTYPE_VTABLES (DECL_CONTEXT (t));
2682 vtbl = TREE_CHAIN (vtbl))
2683 mark_decl_referenced (vtbl);
2685 else if (DECL_CONTEXT (t)
2686 && TREE_CODE (DECL_CONTEXT (t)) == FUNCTION_DECL)
2687 /* If we need a static variable in a function, then we
2688 need the containing function. */
2689 mark_decl_referenced (DECL_CONTEXT (t));
2698 /* This routine is called from the last rule in yyparse ().
2699 Its job is to create all the code needed to initialize and
2700 destroy the global aggregates. We do the destruction
2701 first, since that way we only need to reverse the decls once. */
2710 unsigned ssdf_count = 0;
2712 locus = input_location;
2715 /* Bad parse errors. Just forget about it. */
2716 if (! global_bindings_p () || current_class_type || decl_namespace_list)
2720 c_common_write_pch ();
2722 #ifdef USE_MAPPED_LOCATION
2725 /* Otherwise, GDB can get confused, because in only knows
2726 about source for LINENO-1 lines. */
2730 interface_unknown = 1;
2733 /* We now have to write out all the stuff we put off writing out.
2736 o Template specializations that we have not yet instantiated,
2737 but which are needed.
2738 o Initialization and destruction for non-local objects with
2739 static storage duration. (Local objects with static storage
2740 duration are initialized when their scope is first entered,
2741 and are cleaned up via atexit.)
2742 o Virtual function tables.
2744 All of these may cause others to be needed. For example,
2745 instantiating one function may cause another to be needed, and
2746 generating the initializer for an object may cause templates to be
2747 instantiated, etc., etc. */
2749 timevar_push (TV_VARCONST);
2751 emit_support_tinfos ();
2756 size_t n_old, n_new;
2760 /* If there are templates that we've put off instantiating, do
2762 instantiate_pending_templates ();
2765 /* Write out virtual tables as required. Note that writing out
2766 the virtual table for a template class may cause the
2767 instantiation of members of that class. If we write out
2768 vtables then we remove the class from our list so we don't
2769 have to look at it again. */
2771 while (keyed_classes != NULL_TREE
2772 && maybe_emit_vtables (TREE_VALUE (keyed_classes)))
2775 keyed_classes = TREE_CHAIN (keyed_classes);
2781 tree next = TREE_CHAIN (t);
2785 if (maybe_emit_vtables (TREE_VALUE (next)))
2788 TREE_CHAIN (t) = TREE_CHAIN (next);
2793 next = TREE_CHAIN (t);
2797 /* Write out needed type info variables. We have to be careful
2798 looping through unemitted decls, because emit_tinfo_decl may
2799 cause other variables to be needed. We stick new elements
2800 (and old elements that we may need to reconsider) at the end
2801 of the array, then shift them back to the beginning once we're
2804 n_old = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls);
2805 for (i = 0; i < n_old; ++i)
2807 tree tinfo_decl = VARRAY_TREE (unemitted_tinfo_decls, i);
2808 if (emit_tinfo_decl (tinfo_decl))
2811 VARRAY_PUSH_TREE (unemitted_tinfo_decls, tinfo_decl);
2814 /* The only elements we want to keep are the new ones. Copy
2815 them to the beginning of the array, then get rid of the
2817 n_new = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) - n_old;
2819 memmove (&VARRAY_TREE (unemitted_tinfo_decls, 0),
2820 &VARRAY_TREE (unemitted_tinfo_decls, n_old),
2821 n_new * sizeof (tree));
2822 memset (&VARRAY_TREE (unemitted_tinfo_decls, n_new),
2823 0, n_old * sizeof (tree));
2824 VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) = n_new;
2826 /* The list of objects with static storage duration is built up
2827 in reverse order. We clear STATIC_AGGREGATES so that any new
2828 aggregates added during the initialization of these will be
2829 initialized in the correct order when we next come around the
2831 vars = prune_vars_needing_no_initialization (&static_aggregates);
2837 /* We need to start a new initialization function each time
2838 through the loop. That's because we need to know which
2839 vtables have been referenced, and TREE_SYMBOL_REFERENCED
2840 isn't computed until a function is finished, and written
2841 out. That's a deficiency in the back-end. When this is
2842 fixed, these initialization functions could all become
2843 inline, with resulting performance improvements. */
2846 /* Set the line and file, so that it is obviously not from
2848 input_location = locus;
2849 ssdf_body = start_static_storage_duration_function (ssdf_count);
2851 /* Make sure the back end knows about all the variables. */
2852 write_out_vars (vars);
2854 /* First generate code to do all the initializations. */
2855 for (v = vars; v; v = TREE_CHAIN (v))
2856 do_static_initialization (TREE_VALUE (v),
2859 /* Then, generate code to do all the destructions. Do these
2860 in reverse order so that the most recently constructed
2861 variable is the first destroyed. If we're using
2862 __cxa_atexit, then we don't need to do this; functions
2863 were registered at initialization time to destroy the
2865 if (!flag_use_cxa_atexit)
2867 vars = nreverse (vars);
2868 for (v = vars; v; v = TREE_CHAIN (v))
2869 do_static_destruction (TREE_VALUE (v));
2874 /* Finish up the static storage duration function for this
2876 input_location = locus;
2877 finish_static_storage_duration_function (ssdf_body);
2879 /* All those initializations and finalizations might cause
2880 us to need more inline functions, more template
2881 instantiations, etc. */
2884 #ifdef USE_MAPPED_LOCATION
2891 /* Go through the set of inline functions whose bodies have not
2892 been emitted yet. If out-of-line copies of these functions
2893 are required, emit them. */
2894 for (i = 0; i < deferred_fns_used; ++i)
2896 tree decl = VARRAY_TREE (deferred_fns, i);
2898 /* Does it need synthesizing? */
2899 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
2900 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
2902 /* Even though we're already at the top-level, we push
2903 there again. That way, when we pop back a few lines
2904 hence, all of our state is restored. Otherwise,
2905 finish_function doesn't clean things up, and we end
2906 up with CURRENT_FUNCTION_DECL set. */
2907 push_to_top_level ();
2908 synthesize_method (decl);
2909 pop_from_top_level ();
2913 if (!DECL_SAVED_TREE (decl))
2916 import_export_decl (decl);
2918 /* We lie to the back-end, pretending that some functions
2919 are not defined when they really are. This keeps these
2920 functions from being put out unnecessarily. But, we must
2921 stop lying when the functions are referenced, or if they
2922 are not comdat since they need to be put out now. This
2923 is done in a separate for cycle, because if some deferred
2924 function is contained in another deferred function later
2925 in deferred_fns varray, rest_of_compilation would skip
2926 this function and we really cannot expand the same
2928 if (DECL_NOT_REALLY_EXTERN (decl)
2929 && DECL_INITIAL (decl)
2930 && decl_needed_p (decl))
2931 DECL_EXTERNAL (decl) = 0;
2933 /* If we're going to need to write this function out, and
2934 there's already a body for it, create RTL for it now.
2935 (There might be no body if this is a method we haven't
2936 gotten around to synthesizing yet.) */
2937 if (!DECL_EXTERNAL (decl)
2938 && decl_needed_p (decl)
2939 && !TREE_ASM_WRITTEN (decl)
2940 && !cgraph_node (decl)->local.finalized)
2942 /* We will output the function; no longer consider it in this
2944 DECL_DEFER_OUTPUT (decl) = 0;
2945 /* Generate RTL for this function now that we know we
2947 expand_or_defer_fn (decl);
2948 /* If we're compiling -fsyntax-only pretend that this
2949 function has been written out so that we don't try to
2951 if (flag_syntax_only)
2952 TREE_ASM_WRITTEN (decl) = 1;
2957 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
2960 /* Static data members are just like namespace-scope globals. */
2961 for (i = 0; i < pending_statics_used; ++i)
2963 tree decl = VARRAY_TREE (pending_statics, i);
2964 if (var_finalized_p (decl) || DECL_REALLY_EXTERN (decl))
2966 import_export_decl (decl);
2967 /* If this static data member is needed, provide it to the
2969 if (DECL_NOT_REALLY_EXTERN (decl) && decl_needed_p (decl))
2970 DECL_EXTERNAL (decl) = 0;
2973 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
2974 pending_statics_used))
2977 /* Ask the back end to emit functions and variables that are
2978 enqued. These emissions may result in marking more entities
2980 if (cgraph_assemble_pending_functions ())
2982 if (cgraph_varpool_assemble_pending_decls ())
2987 /* All used inline functions must have a definition at this point. */
2988 for (i = 0; i < deferred_fns_used; ++i)
2990 tree decl = VARRAY_TREE (deferred_fns, i);
2992 if (/* Check online inline functions that were actually used. */
2993 TREE_USED (decl) && DECL_DECLARED_INLINE_P (decl)
2994 /* But not defined. */
2995 && DECL_REALLY_EXTERN (decl)
2996 /* If we decided to emit this function in another
2997 translation unit, the fact that the definition was
2998 missing here likely indicates only that the repository
2999 decided to place the function elsewhere. With -Winline,
3000 we will still warn if we could not inline the
3002 && !flag_use_repository
3003 /* An explicit instantiation can be used to specify
3004 that the body is in another unit. It will have
3005 already verified there was a definition. */
3006 && !DECL_EXPLICIT_INSTANTIATION (decl))
3008 cp_warning_at ("inline function `%D' used but never defined", decl);
3009 /* This symbol is effectively an "extern" declaration now.
3010 This is not strictly necessary, but removes a duplicate
3012 TREE_PUBLIC (decl) = 1;
3016 /* We give C linkage to static constructors and destructors. */
3017 push_lang_context (lang_name_c);
3019 /* Generate initialization and destruction functions for all
3020 priorities for which they are required. */
3021 if (priority_info_map)
3022 splay_tree_foreach (priority_info_map,
3023 generate_ctor_and_dtor_functions_for_priority,
3029 generate_ctor_or_dtor_function (/*constructor_p=*/true,
3030 DEFAULT_INIT_PRIORITY, &locus);
3032 generate_ctor_or_dtor_function (/*constructor_p=*/false,
3033 DEFAULT_INIT_PRIORITY, &locus);
3036 /* We're done with the splay-tree now. */
3037 if (priority_info_map)
3038 splay_tree_delete (priority_info_map);
3040 /* We're done with static constructors, so we can go back to "C++"
3042 pop_lang_context ();
3044 cgraph_finalize_compilation_unit ();
3047 /* Emit mudflap static registration function. This must be done
3048 after all the user functions have been expanded. */
3050 mudflap_finish_file ();
3052 /* Now, issue warnings about static, but not defined, functions,
3053 etc., and emit debugging information. */
3054 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
3055 if (pending_statics)
3056 check_global_declarations (&VARRAY_TREE (pending_statics, 0),
3057 pending_statics_used);
3061 /* The entire file is now complete. If requested, dump everything
3065 FILE *stream = dump_begin (TDI_tu, &flags);
3069 dump_node (global_namespace, flags & ~TDF_SLIM, stream);
3070 dump_end (TDI_tu, stream);
3074 timevar_pop (TV_VARCONST);
3076 if (flag_detailed_statistics)
3078 dump_tree_statistics ();
3079 dump_time_statistics ();
3081 input_location = locus;
3083 #ifdef ENABLE_CHECKING
3084 validate_conversion_obstack ();
3085 #endif /* ENABLE_CHECKING */
3088 /* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the
3089 function to call in parse-tree form; it has not yet been
3090 semantically analyzed. ARGS are the arguments to the function.
3091 They have already been semantically analyzed. */
3094 build_offset_ref_call_from_tree (tree fn, tree args)
3103 object = TREE_OPERAND (fn, 0);
3105 if (processing_template_decl)
3107 my_friendly_assert (TREE_CODE (fn) == DOTSTAR_EXPR
3108 || TREE_CODE (fn) == MEMBER_REF,
3110 if (type_dependent_expression_p (fn)
3111 || any_type_dependent_arguments_p (args))
3112 return build_min_nt (CALL_EXPR, fn, args, NULL_TREE);
3114 /* Transform the arguments and add the implicit "this"
3115 parameter. That must be done before the FN is transformed
3116 because we depend on the form of FN. */
3117 args = build_non_dependent_args (args);
3118 if (TREE_CODE (fn) == DOTSTAR_EXPR)
3119 object = build_unary_op (ADDR_EXPR, object, 0);
3120 object = build_non_dependent_expr (object);
3121 args = tree_cons (NULL_TREE, object, args);
3122 /* Now that the arguments are done, transform FN. */
3123 fn = build_non_dependent_expr (fn);
3126 /* A qualified name corresponding to a bound pointer-to-member is
3127 represented as an OFFSET_REF:
3129 struct B { void g(); };
3131 void B::g() { (this->*p)(); } */
3132 if (TREE_CODE (fn) == OFFSET_REF)
3134 tree object_addr = build_unary_op (ADDR_EXPR, object, 0);
3135 fn = TREE_OPERAND (fn, 1);
3136 fn = get_member_function_from_ptrfunc (&object_addr, fn);
3137 args = tree_cons (NULL_TREE, object_addr, args);
3140 expr = build_function_call (fn, args);
3141 if (processing_template_decl && expr != error_mark_node)
3142 return build_min_non_dep (CALL_EXPR, expr, orig_fn, orig_args, NULL_TREE);
3148 check_default_args (tree x)
3150 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
3151 bool saw_def = false;
3152 int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
3153 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
3155 if (TREE_PURPOSE (arg))
3159 cp_error_at ("default argument missing for parameter %P of `%+#D'",
3167 mark_used (tree decl)
3169 TREE_USED (decl) = 1;
3170 if (processing_template_decl || skip_evaluation)
3173 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl)
3174 && !TREE_ASM_WRITTEN (decl))
3175 /* Remember it, so we can check it was defined. */
3177 if (DECL_DEFERRED_FN (decl))
3179 note_vague_linkage_fn (decl);
3182 assemble_external (decl);
3184 /* Is it a synthesized method that needs to be synthesized? */
3185 if (TREE_CODE (decl) == FUNCTION_DECL
3186 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
3187 && DECL_ARTIFICIAL (decl)
3188 && !DECL_THUNK_P (decl)
3189 && ! DECL_INITIAL (decl)
3190 /* Kludge: don't synthesize for default args. */
3191 && current_function_decl)
3193 synthesize_method (decl);
3194 /* If we've already synthesized the method we don't need to
3195 instantiate it, so we can return right away. */
3199 /* If this is a function or variable that is an instance of some
3200 template, we now know that we will need to actually do the
3201 instantiation. We check that DECL is not an explicit
3202 instantiation because that is not checked in instantiate_decl. */
3203 if ((DECL_NON_THUNK_FUNCTION_P (decl) || TREE_CODE (decl) == VAR_DECL)
3204 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
3205 && (!DECL_EXPLICIT_INSTANTIATION (decl)
3206 || (TREE_CODE (decl) == FUNCTION_DECL
3207 && DECL_INLINE (DECL_TEMPLATE_RESULT
3208 (template_for_substitution (decl))))))
3209 /* We put off instantiating functions in order to improve compile
3210 times. Maintaining a stack of active functions is expensive,
3211 and the inliner knows to instantiate any functions it might
3213 instantiate_decl (decl, /*defer_ok=*/true, /*undefined_ok=*/0);
3216 #include "gt-cp-decl2.h"