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 /* We have just processed the DECL, which is a static data member.
733 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
734 present, is the assembly-language name for the data member.
735 FLAGS is as for cp_finish_decl. */
738 finish_static_data_member_decl (tree decl, tree init, tree asmspec_tree,
741 my_friendly_assert (TREE_PUBLIC (decl), 0);
743 DECL_CONTEXT (decl) = current_class_type;
745 /* We cannot call pushdecl here, because that would fill in the
746 TREE_CHAIN of our decl. Instead, we modify cp_finish_decl to do
747 the right thing, namely, to put this decl out straight away. */
748 /* current_class_type can be NULL_TREE in case of error. */
749 if (!asmspec_tree && current_class_type)
750 DECL_INITIAL (decl) = error_mark_node;
752 if (! processing_template_decl)
754 if (!pending_statics)
755 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
756 VARRAY_PUSH_TREE (pending_statics, decl);
759 if (LOCAL_CLASS_P (current_class_type))
760 pedwarn ("local class `%#T' shall not have static data member `%#D'",
761 current_class_type, decl);
763 /* Static consts need not be initialized in the class definition. */
764 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
766 static int explained = 0;
768 error ("initializer invalid for static member with constructor");
771 error ("(an out of class initialization is required)");
776 /* Force the compiler to know when an uninitialized static const
777 member is being used. */
778 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
779 TREE_USED (decl) = 1;
780 DECL_INITIAL (decl) = init;
781 DECL_IN_AGGR_P (decl) = 1;
783 cp_finish_decl (decl, init, asmspec_tree, flags);
786 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
787 of a structure component, returning a _DECL node.
788 QUALS is a list of type qualifiers for this decl (such as for declaring
789 const member functions).
791 This is done during the parsing of the struct declaration.
792 The _DECL nodes are chained together and the lot of them
793 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
795 If class A defines that certain functions in class B are friends, then
796 the way I have set things up, it is B who is interested in permission
797 granted by A. However, it is in A's context that these declarations
798 are parsed. By returning a void_type_node, class A does not attempt
799 to incorporate the declarations of the friends within its structure.
801 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
802 CHANGES TO CODE IN `start_method'. */
805 grokfield (const cp_declarator *declarator,
806 cp_decl_specifier_seq *declspecs,
807 tree init, tree asmspec_tree,
811 const char *asmspec = 0;
812 int flags = LOOKUP_ONLYCONVERTING;
814 if (!declspecs->any_specifiers_p
815 && declarator->kind == cdk_id
816 && TREE_CODE (declarator->u.id.name) == SCOPE_REF
817 && (TREE_CODE (TREE_OPERAND (declarator->u.id.name, 1))
819 /* Access declaration */
820 return do_class_using_decl (declarator->u.id.name);
823 && TREE_CODE (init) == TREE_LIST
824 && TREE_VALUE (init) == error_mark_node
825 && TREE_CHAIN (init) == NULL_TREE)
828 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist);
829 if (! value || error_operand_p (value))
830 /* friend or constructor went bad. */
831 return error_mark_node;
833 if (TREE_CODE (value) == TYPE_DECL && init)
835 error ("typedef `%D' is initialized (use __typeof__ instead)", value);
839 /* Pass friendly classes back. */
840 if (value == void_type_node)
843 /* Pass friend decls back. */
844 if ((TREE_CODE (value) == FUNCTION_DECL
845 || TREE_CODE (value) == TEMPLATE_DECL)
846 && DECL_CONTEXT (value) != current_class_type)
849 if (DECL_NAME (value) != NULL_TREE
850 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
851 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
852 error ("member `%D' conflicts with virtual function table field name",
855 /* Stash away type declarations. */
856 if (TREE_CODE (value) == TYPE_DECL)
858 DECL_NONLOCAL (value) = 1;
859 DECL_CONTEXT (value) = current_class_type;
861 if (processing_template_decl)
862 value = push_template_decl (value);
867 if (DECL_IN_AGGR_P (value))
869 error ("`%D' is already defined in `%T'", value,
870 DECL_CONTEXT (value));
871 return void_type_node;
875 asmspec = TREE_STRING_POINTER (asmspec_tree);
879 if (TREE_CODE (value) == FUNCTION_DECL)
881 grok_function_init (value, init);
884 else if (pedantic && TREE_CODE (value) != VAR_DECL)
885 /* Already complained in grokdeclarator. */
889 /* We allow initializers to become parameters to base
891 if (TREE_CODE (init) == TREE_LIST)
893 if (TREE_CHAIN (init) == NULL_TREE)
894 init = TREE_VALUE (init);
896 init = digest_init (TREE_TYPE (value), init, (tree *)0);
899 if (!processing_template_decl)
901 if (TREE_CODE (init) == CONST_DECL)
902 init = DECL_INITIAL (init);
903 else if (TREE_READONLY_DECL_P (init))
904 init = decl_constant_value (init);
905 else if (TREE_CODE (init) == CONSTRUCTOR)
906 init = digest_init (TREE_TYPE (value), init, (tree *)0);
907 if (init != error_mark_node && ! TREE_CONSTANT (init))
909 /* We can allow references to things that are effectively
910 static, since references are initialized with the
912 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
913 || (TREE_STATIC (init) == 0
914 && (!DECL_P (init) || DECL_EXTERNAL (init) == 0)))
916 error ("field initializer is not constant");
917 init = error_mark_node;
924 if (processing_template_decl
925 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
927 value = push_template_decl (value);
928 if (error_operand_p (value))
929 return error_mark_node;
933 cplus_decl_attributes (&value, attrlist, 0);
935 if (TREE_CODE (value) == VAR_DECL)
937 finish_static_data_member_decl (value, init, asmspec_tree,
941 if (TREE_CODE (value) == FIELD_DECL)
944 error ("`asm' specifiers are not permitted on non-static data members");
945 if (DECL_INITIAL (value) == error_mark_node)
946 init = error_mark_node;
947 cp_finish_decl (value, init, NULL_TREE, flags);
948 DECL_INITIAL (value) = init;
949 DECL_IN_AGGR_P (value) = 1;
952 if (TREE_CODE (value) == FUNCTION_DECL)
956 /* This must override the asm specifier which was placed
957 by grokclassfn. Lay this out fresh. */
958 SET_DECL_RTL (value, NULL_RTX);
959 change_decl_assembler_name (value, get_identifier (asmspec));
961 if (!DECL_FRIEND_P (value))
962 grok_special_member_properties (value);
964 cp_finish_decl (value, init, asmspec_tree, flags);
966 /* Pass friends back this way. */
967 if (DECL_FRIEND_P (value))
968 return void_type_node;
970 DECL_IN_AGGR_P (value) = 1;
978 /* Like `grokfield', but for bitfields.
979 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
982 grokbitfield (const cp_declarator *declarator,
983 cp_decl_specifier_seq *declspecs, tree width)
985 tree value = grokdeclarator (declarator, declspecs, BITFIELD, 0, NULL);
987 if (! value) return NULL_TREE; /* friends went bad. */
989 /* Pass friendly classes back. */
990 if (TREE_CODE (value) == VOID_TYPE)
991 return void_type_node;
993 if (TREE_CODE (value) == TYPE_DECL)
995 error ("cannot declare `%D' to be a bit-field type", value);
999 /* Usually, finish_struct_1 catches bitfields with invalid types.
1000 But, in the case of bitfields with function type, we confuse
1001 ourselves into thinking they are member functions, so we must
1003 if (TREE_CODE (value) == FUNCTION_DECL)
1005 error ("cannot declare bit-field `%D' with function type",
1010 if (DECL_IN_AGGR_P (value))
1012 error ("`%D' is already defined in the class %T", value,
1013 DECL_CONTEXT (value));
1014 return void_type_node;
1017 if (TREE_STATIC (value))
1019 error ("static member `%D' cannot be a bit-field", value);
1022 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1024 if (width != error_mark_node)
1026 constant_expression_warning (width);
1027 DECL_INITIAL (value) = width;
1028 SET_DECL_C_BIT_FIELD (value);
1031 DECL_IN_AGGR_P (value) = 1;
1035 /* When a function is declared with an initializer,
1036 do the right thing. Currently, there are two possibilities:
1041 // initialization possibility #1.
1042 virtual void f () = 0;
1064 // initialization possibility #2
1071 grok_function_init (tree decl, tree init)
1073 /* An initializer for a function tells how this function should
1075 tree type = TREE_TYPE (decl);
1077 if (TREE_CODE (type) == FUNCTION_TYPE)
1078 error ("initializer specified for non-member function `%D'", decl);
1079 else if (integer_zerop (init))
1080 DECL_PURE_VIRTUAL_P (decl) = 1;
1082 error ("invalid initializer for virtual method `%D'", decl);
1086 cplus_decl_attributes (tree *decl, tree attributes, int flags)
1088 if (*decl == NULL_TREE || *decl == void_type_node)
1091 if (TREE_CODE (*decl) == TEMPLATE_DECL)
1092 decl = &DECL_TEMPLATE_RESULT (*decl);
1094 decl_attributes (decl, attributes, flags);
1096 if (TREE_CODE (*decl) == TYPE_DECL)
1097 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl));
1100 /* Walks through the namespace- or function-scope anonymous union OBJECT,
1101 building appropriate ALIAS_DECLs. Returns one of the fields for use in
1102 the mangled name. */
1105 build_anon_union_vars (tree object)
1107 tree type = TREE_TYPE (object);
1108 tree main_decl = NULL_TREE;
1111 /* Rather than write the code to handle the non-union case,
1112 just give an error. */
1113 if (TREE_CODE (type) != UNION_TYPE)
1114 error ("anonymous struct not inside named type");
1116 for (field = TYPE_FIELDS (type);
1118 field = TREE_CHAIN (field))
1123 if (DECL_ARTIFICIAL (field))
1125 if (TREE_CODE (field) != FIELD_DECL)
1128 `%#D' invalid; an anonymous union can only have non-static data members",
1133 if (TREE_PRIVATE (field))
1134 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
1135 else if (TREE_PROTECTED (field))
1136 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
1138 if (processing_template_decl)
1139 ref = build_min_nt (COMPONENT_REF, object,
1140 DECL_NAME (field), NULL_TREE);
1142 ref = build_class_member_access_expr (object, field, NULL_TREE,
1145 if (DECL_NAME (field))
1147 decl = build_decl (ALIAS_DECL, DECL_NAME (field), TREE_TYPE (field));
1148 DECL_INITIAL (decl) = ref;
1149 TREE_PUBLIC (decl) = 0;
1150 TREE_STATIC (decl) = 0;
1151 DECL_EXTERNAL (decl) = 1;
1152 decl = pushdecl (decl);
1154 else if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1155 decl = build_anon_union_vars (ref);
1159 if (main_decl == NULL_TREE)
1166 /* Finish off the processing of a UNION_TYPE structure. If the union is an
1167 anonymous union, then all members must be laid out together. PUBLIC_P
1168 is nonzero if this union is not declared static. */
1171 finish_anon_union (tree anon_union_decl)
1173 tree type = TREE_TYPE (anon_union_decl);
1175 bool public_p = TREE_PUBLIC (anon_union_decl);
1177 /* The VAR_DECL's context is the same as the TYPE's context. */
1178 DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type));
1180 if (TYPE_FIELDS (type) == NULL_TREE)
1185 error ("namespace-scope anonymous aggregates must be static");
1189 main_decl = build_anon_union_vars (anon_union_decl);
1190 if (main_decl == NULL_TREE)
1192 warning ("anonymous union with no members");
1196 if (!processing_template_decl)
1198 /* Use main_decl to set the mangled name. */
1199 DECL_NAME (anon_union_decl) = DECL_NAME (main_decl);
1200 mangle_decl (anon_union_decl);
1201 DECL_NAME (anon_union_decl) = NULL_TREE;
1204 pushdecl (anon_union_decl);
1205 if (building_stmt_tree ()
1206 && at_function_scope_p ())
1207 add_decl_expr (anon_union_decl);
1208 else if (!processing_template_decl)
1209 rest_of_decl_compilation (anon_union_decl, NULL,
1210 toplevel_bindings_p (), at_eof);
1213 /* Auxiliary functions to make type signatures for
1214 `operator new' and `operator delete' correspond to
1215 what compiler will be expecting. */
1218 coerce_new_type (tree type)
1221 tree args = TYPE_ARG_TYPES (type);
1223 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1225 if (!same_type_p (TREE_TYPE (type), ptr_type_node))
1226 e = 1, error ("`operator new' must return type `%T'", ptr_type_node);
1228 if (!args || args == void_list_node
1229 || !same_type_p (TREE_VALUE (args), size_type_node))
1232 if (args && args != void_list_node)
1233 args = TREE_CHAIN (args);
1234 pedwarn ("`operator new' takes type `size_t' (`%T') as first parameter", size_type_node);
1239 args = tree_cons (NULL_TREE, size_type_node, args);
1242 type = build_exception_variant
1243 (build_function_type (ptr_type_node, args),
1244 TYPE_RAISES_EXCEPTIONS (type));
1252 coerce_delete_type (tree type)
1255 tree args = TYPE_ARG_TYPES (type);
1257 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1259 if (!same_type_p (TREE_TYPE (type), void_type_node))
1260 e = 1, error ("`operator delete' must return type `%T'", void_type_node);
1262 if (!args || args == void_list_node
1263 || !same_type_p (TREE_VALUE (args), ptr_type_node))
1266 if (args && args != void_list_node)
1267 args = TREE_CHAIN (args);
1268 error ("`operator delete' takes type `%T' as first parameter", ptr_type_node);
1273 args = tree_cons (NULL_TREE, ptr_type_node, args);
1276 type = build_exception_variant
1277 (build_function_type (void_type_node, args),
1278 TYPE_RAISES_EXCEPTIONS (type));
1287 mark_vtable_entries (tree decl)
1289 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
1291 for (; entries; entries = TREE_CHAIN (entries))
1293 tree fnaddr = TREE_VALUE (entries);
1296 STRIP_NOPS (fnaddr);
1298 if (TREE_CODE (fnaddr) != ADDR_EXPR
1299 && TREE_CODE (fnaddr) != FDESC_EXPR)
1300 /* This entry is an offset: a virtual base class offset, a
1301 virtual call offset, an RTTI offset, etc. */
1304 fn = TREE_OPERAND (fnaddr, 0);
1305 TREE_ADDRESSABLE (fn) = 1;
1306 /* When we don't have vcall offsets, we output thunks whenever
1307 we output the vtables that contain them. With vcall offsets,
1308 we know all the thunks we'll need when we emit a virtual
1309 function, so we emit the thunks there instead. */
1310 if (DECL_THUNK_P (fn))
1311 use_thunk (fn, /*emit_p=*/0);
1316 /* Set DECL up to have the closest approximation of "initialized common"
1317 linkage available. */
1320 comdat_linkage (tree decl)
1323 make_decl_one_only (decl);
1324 else if (TREE_CODE (decl) == FUNCTION_DECL
1325 || (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)))
1326 /* We can just emit function and compiler-generated variables
1327 statically; having multiple copies is (for the most part) only
1330 There are two correctness issues, however: the address of a
1331 template instantiation with external linkage should be the
1332 same, independent of what translation unit asks for the
1333 address, and this will not hold when we emit multiple copies of
1334 the function. However, there's little else we can do.
1336 Also, by default, the typeinfo implementation assumes that
1337 there will be only one copy of the string used as the name for
1338 each type. Therefore, if weak symbols are unavailable, the
1339 run-time library should perform a more conservative check; it
1340 should perform a string comparison, rather than an address
1342 TREE_PUBLIC (decl) = 0;
1345 /* Static data member template instantiations, however, cannot
1346 have multiple copies. */
1347 if (DECL_INITIAL (decl) == 0
1348 || DECL_INITIAL (decl) == error_mark_node)
1349 DECL_COMMON (decl) = 1;
1350 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
1352 DECL_COMMON (decl) = 1;
1353 DECL_INITIAL (decl) = error_mark_node;
1355 else if (!DECL_EXPLICIT_INSTANTIATION (decl))
1357 /* We can't do anything useful; leave vars for explicit
1359 DECL_EXTERNAL (decl) = 1;
1360 DECL_NOT_REALLY_EXTERN (decl) = 0;
1364 if (DECL_LANG_SPECIFIC (decl))
1365 DECL_COMDAT (decl) = 1;
1368 /* For win32 we also want to put explicit instantiations in
1369 linkonce sections, so that they will be merged with implicit
1370 instantiations; otherwise we get duplicate symbol errors.
1371 For Darwin we do not want explicit instantiations to be
1375 maybe_make_one_only (tree decl)
1377 /* We used to say that this was not necessary on targets that support weak
1378 symbols, because the implicit instantiations will defer to the explicit
1379 one. However, that's not actually the case in SVR4; a strong definition
1380 after a weak one is an error. Also, not making explicit
1381 instantiations one_only means that we can end up with two copies of
1382 some template instantiations. */
1386 /* We can't set DECL_COMDAT on functions, or finish_file will think
1387 we can get away with not emitting them if they aren't used. We need
1388 to for variables so that cp_finish_decl will update their linkage,
1389 because their DECL_INITIAL may not have been set properly yet. */
1391 if (!TARGET_WEAK_NOT_IN_ARCHIVE_TOC
1392 || (! DECL_EXPLICIT_INSTANTIATION (decl)
1393 && ! DECL_TEMPLATE_SPECIALIZATION (decl)))
1395 make_decl_one_only (decl);
1397 if (TREE_CODE (decl) == VAR_DECL)
1399 DECL_COMDAT (decl) = 1;
1400 /* Mark it needed so we don't forget to emit it. */
1401 mark_decl_referenced (decl);
1406 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
1407 based on TYPE and other static flags.
1409 Note that anything public is tagged TREE_PUBLIC, whether
1410 it's public in this file or in another one. */
1413 import_export_vtable (tree decl, tree type, int final)
1415 if (DECL_INTERFACE_KNOWN (decl))
1418 if (TYPE_FOR_JAVA (type))
1420 TREE_PUBLIC (decl) = 1;
1421 DECL_EXTERNAL (decl) = 1;
1422 DECL_INTERFACE_KNOWN (decl) = 1;
1424 else if (CLASSTYPE_INTERFACE_KNOWN (type))
1426 TREE_PUBLIC (decl) = 1;
1427 DECL_EXTERNAL (decl) = CLASSTYPE_INTERFACE_ONLY (type);
1428 DECL_INTERFACE_KNOWN (decl) = 1;
1432 /* We can only wait to decide if we have real non-inline virtual
1433 functions in our class, or if we come from a template. */
1435 int found = (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
1436 || CLASSTYPE_KEY_METHOD (type) != NULL_TREE);
1438 if (final || ! found)
1440 comdat_linkage (decl);
1441 DECL_EXTERNAL (decl) = 0;
1445 TREE_PUBLIC (decl) = 1;
1446 DECL_EXTERNAL (decl) = 1;
1451 /* Determine whether or not we want to specifically import or export CTYPE,
1452 using various heuristics. */
1455 import_export_class (tree ctype)
1457 /* -1 for imported, 1 for exported. */
1458 int import_export = 0;
1460 /* It only makes sense to call this function at EOF. The reason is
1461 that this function looks at whether or not the first non-inline
1462 non-abstract virtual member function has been defined in this
1463 translation unit. But, we can't possibly know that until we've
1464 seen the entire translation unit. */
1465 my_friendly_assert (at_eof, 20000226);
1467 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1470 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
1471 we will have CLASSTYPE_INTERFACE_ONLY set but not
1472 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
1473 heuristic because someone will supply a #pragma implementation
1474 elsewhere, and deducing it here would produce a conflict. */
1475 if (CLASSTYPE_INTERFACE_ONLY (ctype))
1478 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
1480 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
1483 /* If we got -fno-implicit-templates, we import template classes that
1484 weren't explicitly instantiated. */
1485 if (import_export == 0
1486 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
1487 && ! flag_implicit_templates)
1490 /* Base our import/export status on that of the first non-inline,
1491 non-pure virtual function, if any. */
1492 if (import_export == 0
1493 && TYPE_POLYMORPHIC_P (ctype))
1495 tree method = CLASSTYPE_KEY_METHOD (ctype);
1497 /* If weak symbol support is not available, then we must be
1498 careful not to emit the vtable when the key function is
1499 inline. An inline function can be defined in multiple
1500 translation units. If we were to emit the vtable in each
1501 translation unit containing a definition, we would get
1502 multiple definition errors at link-time. */
1503 if (method && (flag_weak || ! DECL_DECLARED_INLINE_P (method)))
1504 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
1507 #ifdef MULTIPLE_SYMBOL_SPACES
1508 if (import_export == -1)
1512 /* Allow backends the chance to overrule the decision. */
1513 if (targetm.cxx.import_export_class)
1514 import_export = targetm.cxx.import_export_class (ctype, import_export);
1518 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
1519 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
1523 /* Return true if VAR has already been provided to the back end; in that
1524 case VAR should not be modified further by the front end. */
1526 var_finalized_p (tree var)
1528 if (flag_unit_at_a_time)
1529 return cgraph_varpool_node (var)->finalized;
1531 return TREE_ASM_WRITTEN (var);
1534 /* If necessary, write out the vtables for the dynamic class CTYPE.
1535 Returns true if any vtables were emitted. */
1538 maybe_emit_vtables (tree ctype)
1542 bool needed = false;
1543 bool weaken_vtables;
1545 /* If the vtables for this class have already been emitted there is
1546 nothing more to do. */
1547 primary_vtbl = CLASSTYPE_VTABLES (ctype);
1548 if (var_finalized_p (primary_vtbl))
1550 /* Ignore dummy vtables made by get_vtable_decl. */
1551 if (TREE_TYPE (primary_vtbl) == void_type_node)
1554 import_export_class (ctype);
1556 /* See if any of the vtables are needed. */
1557 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1559 import_export_vtable (vtbl, ctype, 1);
1560 if (!DECL_EXTERNAL (vtbl) && DECL_NEEDED_P (vtbl))
1565 /* If the references to this class' vtables are optimized away,
1566 still emit the appropriate debugging information. See
1568 if (DECL_COMDAT (primary_vtbl)
1569 && CLASSTYPE_DEBUG_REQUESTED (ctype))
1570 note_debug_info_needed (ctype);
1573 else if (TREE_PUBLIC (vtbl) && !DECL_COMDAT (vtbl))
1576 /* Determine whether to make vtables weak. The ABI requires that we
1577 do so. There are two cases in which we have to violate the ABI
1578 specification: targets where we don't have weak symbols
1579 (obviously), and targets where weak symbols don't appear in
1580 static archives' tables of contents. On such targets, avoiding
1581 undefined symbol link errors requires that we only make a symbol
1582 weak if we know that it will be emitted everywhere it's needed.
1583 So on such targets we don't make vtables weak in the common case
1584 where we're emitting a vtable of a nontemplate class in the
1585 translation unit containing the definition of a noninline key
1587 if (flag_weak && !TARGET_WEAK_NOT_IN_ARCHIVE_TOC)
1588 weaken_vtables = true;
1591 if (CLASSTYPE_USE_TEMPLATE (ctype))
1592 weaken_vtables = CLASSTYPE_IMPLICIT_INSTANTIATION (ctype);
1594 weaken_vtables = !CLASSTYPE_KEY_METHOD (ctype)
1595 || DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (ctype));
1598 weaken_vtables = false;
1600 /* The ABI requires that we emit all of the vtables if we emit any
1602 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1605 import_export_vtable (vtbl, ctype, 1);
1606 mark_vtable_entries (vtbl);
1608 /* If we know that DECL is needed, mark it as such for the varpool. */
1610 cgraph_varpool_mark_needed_node (cgraph_varpool_node (vtbl));
1612 if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0)
1614 /* It had better be all done at compile-time. */
1615 if (store_init_value (vtbl, DECL_INITIAL (vtbl)))
1619 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
1621 /* Mark the VAR_DECL node representing the vtable itself as a
1622 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
1623 It is rather important that such things be ignored because
1624 any effort to actually generate DWARF for them will run
1625 into trouble when/if we encounter code like:
1628 struct S { virtual void member (); };
1630 because the artificial declaration of the vtable itself (as
1631 manufactured by the g++ front end) will say that the vtable
1632 is a static member of `S' but only *after* the debug output
1633 for the definition of `S' has already been output. This causes
1634 grief because the DWARF entry for the definition of the vtable
1635 will try to refer back to an earlier *declaration* of the
1636 vtable as a static member of `S' and there won't be one.
1637 We might be able to arrange to have the "vtable static member"
1638 attached to the member list for `S' before the debug info for
1639 `S' get written (which would solve the problem) but that would
1640 require more intrusive changes to the g++ front end. */
1642 DECL_IGNORED_P (vtbl) = 1;
1645 /* Always make vtables weak. Or at least almost always; see above. */
1647 comdat_linkage (vtbl);
1649 rest_of_decl_compilation (vtbl, NULL, 1, 1);
1651 /* Because we're only doing syntax-checking, we'll never end up
1652 actually marking the variable as written. */
1653 if (flag_syntax_only)
1654 TREE_ASM_WRITTEN (vtbl) = 1;
1657 /* Since we're writing out the vtable here, also write the debug
1659 note_debug_info_needed (ctype);
1664 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
1665 inline function or template instantiation at end-of-file. */
1668 import_export_decl (tree decl)
1670 if (DECL_INTERFACE_KNOWN (decl))
1673 if (DECL_TEMPLATE_INSTANTIATION (decl)
1674 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1676 DECL_NOT_REALLY_EXTERN (decl) = 1;
1677 if ((DECL_IMPLICIT_INSTANTIATION (decl)
1678 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1679 && (flag_implicit_templates
1680 || (flag_implicit_inline_templates
1681 && TREE_CODE (decl) == FUNCTION_DECL
1682 && DECL_DECLARED_INLINE_P (decl))))
1684 if (!TREE_PUBLIC (decl))
1685 /* Templates are allowed to have internal linkage. See
1689 comdat_linkage (decl);
1693 DECL_EXTERNAL (decl) = 1;
1694 DECL_NOT_REALLY_EXTERN (decl) = 0;
1697 else if (DECL_FUNCTION_MEMBER_P (decl))
1699 if (!DECL_DECLARED_INLINE_P (decl))
1701 tree ctype = DECL_CONTEXT (decl);
1702 import_export_class (ctype);
1703 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1705 DECL_NOT_REALLY_EXTERN (decl)
1706 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
1707 || (DECL_DECLARED_INLINE_P (decl)
1708 && ! flag_implement_inlines
1709 && !DECL_VINDEX (decl)));
1711 if (!DECL_NOT_REALLY_EXTERN (decl))
1712 DECL_EXTERNAL (decl) = 1;
1714 /* Always make artificials weak. */
1715 if (DECL_ARTIFICIAL (decl) && flag_weak)
1716 comdat_linkage (decl);
1718 maybe_make_one_only (decl);
1722 comdat_linkage (decl);
1725 comdat_linkage (decl);
1727 DECL_INTERFACE_KNOWN (decl) = 1;
1730 /* Here, we only decide whether or not the tinfo node should be
1731 emitted with the vtable. IS_IN_LIBRARY is nonzero iff the
1732 typeinfo for TYPE should be in the runtime library. */
1735 import_export_tinfo (tree decl, tree type, bool is_in_library)
1737 if (DECL_INTERFACE_KNOWN (decl))
1740 if (IS_AGGR_TYPE (type))
1741 import_export_class (type);
1743 if (IS_AGGR_TYPE (type) && CLASSTYPE_INTERFACE_KNOWN (type)
1744 && TYPE_POLYMORPHIC_P (type)
1745 /* If -fno-rtti, we're not necessarily emitting this stuff with
1746 the class, so go ahead and emit it now. This can happen when
1747 a class is used in exception handling. */
1750 DECL_NOT_REALLY_EXTERN (decl) = !CLASSTYPE_INTERFACE_ONLY (type);
1751 DECL_COMDAT (decl) = 0;
1755 DECL_NOT_REALLY_EXTERN (decl) = 1;
1756 DECL_COMDAT (decl) = 1;
1759 /* Now override some cases. */
1761 DECL_COMDAT (decl) = 1;
1762 else if (is_in_library)
1763 DECL_COMDAT (decl) = 0;
1765 DECL_INTERFACE_KNOWN (decl) = 1;
1768 /* Return an expression that performs the destruction of DECL, which
1769 must be a VAR_DECL whose type has a non-trivial destructor, or is
1770 an array whose (innermost) elements have a non-trivial destructor. */
1773 build_cleanup (tree decl)
1776 tree type = TREE_TYPE (decl);
1778 /* This function should only be called for declarations that really
1779 require cleanups. */
1780 my_friendly_assert (!TYPE_HAS_TRIVIAL_DESTRUCTOR (type), 20030106);
1782 /* Treat all objects with destructors as used; the destructor may do
1783 something substantive. */
1786 if (TREE_CODE (type) == ARRAY_TYPE)
1790 cxx_mark_addressable (decl);
1791 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
1793 temp = build_delete (TREE_TYPE (temp), temp,
1794 sfk_complete_destructor,
1795 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
1799 /* Returns the initialization guard variable for the variable DECL,
1800 which has static storage duration. */
1803 get_guard (tree decl)
1808 sname = mangle_guard_variable (decl);
1809 guard = IDENTIFIER_GLOBAL_VALUE (sname);
1814 /* We use a type that is big enough to contain a mutex as well
1815 as an integer counter. */
1816 guard_type = targetm.cxx.guard_type ();
1817 guard = build_decl (VAR_DECL, sname, guard_type);
1819 /* The guard should have the same linkage as what it guards. */
1820 TREE_PUBLIC (guard) = TREE_PUBLIC (decl);
1821 TREE_STATIC (guard) = TREE_STATIC (decl);
1822 DECL_COMMON (guard) = DECL_COMMON (decl);
1823 DECL_ONE_ONLY (guard) = DECL_ONE_ONLY (decl);
1824 if (TREE_PUBLIC (decl))
1825 DECL_WEAK (guard) = DECL_WEAK (decl);
1827 DECL_ARTIFICIAL (guard) = 1;
1828 TREE_USED (guard) = 1;
1829 pushdecl_top_level_and_finish (guard, NULL_TREE);
1834 /* Return those bits of the GUARD variable that should be set when the
1835 guarded entity is actually initialized. */
1838 get_guard_bits (tree guard)
1840 if (!targetm.cxx.guard_mask_bit ())
1842 /* We only set the first byte of the guard, in order to leave room
1843 for a mutex in the high-order bits. */
1844 guard = build1 (ADDR_EXPR,
1845 build_pointer_type (TREE_TYPE (guard)),
1847 guard = build1 (NOP_EXPR,
1848 build_pointer_type (char_type_node),
1850 guard = build1 (INDIRECT_REF, char_type_node, guard);
1856 /* Return an expression which determines whether or not the GUARD
1857 variable has already been initialized. */
1860 get_guard_cond (tree guard)
1864 /* Check to see if the GUARD is zero. */
1865 guard = get_guard_bits (guard);
1867 /* Mask off all but the low bit. */
1868 if (targetm.cxx.guard_mask_bit ())
1870 guard_value = integer_one_node;
1871 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
1872 guard_value = convert (TREE_TYPE (guard), guard_value);
1873 guard = cp_build_binary_op (BIT_AND_EXPR, guard, guard_value);
1876 guard_value = integer_zero_node;
1877 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
1878 guard_value = convert (TREE_TYPE (guard), guard_value);
1879 return cp_build_binary_op (EQ_EXPR, guard, guard_value);
1882 /* Return an expression which sets the GUARD variable, indicating that
1883 the variable being guarded has been initialized. */
1886 set_guard (tree guard)
1890 /* Set the GUARD to one. */
1891 guard = get_guard_bits (guard);
1892 guard_init = integer_one_node;
1893 if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard)))
1894 guard_init = convert (TREE_TYPE (guard), guard_init);
1895 return build_modify_expr (guard, NOP_EXPR, guard_init);
1898 /* Start the process of running a particular set of global constructors
1899 or destructors. Subroutine of do_[cd]tors. */
1902 start_objects (int method_type, int initp)
1908 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
1910 if (initp != DEFAULT_INIT_PRIORITY)
1920 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
1923 sprintf (type, "%c", method_type);
1925 fndecl = build_lang_decl (FUNCTION_DECL,
1926 get_file_function_name_long (type),
1927 build_function_type (void_type_node,
1929 start_preparsed_function (fndecl, /*attrs=*/NULL_TREE, SF_PRE_PARSED);
1931 /* It can be a static function as long as collect2 does not have
1932 to scan the object file to find its ctor/dtor routine. */
1933 TREE_PUBLIC (current_function_decl) = ! targetm.have_ctors_dtors;
1935 /* Mark this declaration as used to avoid spurious warnings. */
1936 TREE_USED (current_function_decl) = 1;
1938 /* Mark this function as a global constructor or destructor. */
1939 if (method_type == 'I')
1940 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
1942 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
1943 DECL_LANG_SPECIFIC (current_function_decl)->decl_flags.u2sel = 1;
1945 body = begin_compound_stmt (BCS_FN_BODY);
1947 /* We cannot allow these functions to be elided, even if they do not
1948 have external linkage. And, there's no point in deferring
1949 compilation of thes functions; they're all going to have to be
1951 DECL_INLINE (current_function_decl) = 0;
1952 DECL_UNINLINABLE (current_function_decl) = 1;
1957 /* Finish the process of running a particular set of global constructors
1958 or destructors. Subroutine of do_[cd]tors. */
1961 finish_objects (int method_type, int initp, tree body)
1966 finish_compound_stmt (body);
1967 fn = finish_function (0);
1968 expand_or_defer_fn (fn);
1970 /* When only doing semantic analysis, and no RTL generation, we
1971 can't call functions that directly emit assembly code; there is
1972 no assembly file in which to put the code. */
1973 if (flag_syntax_only)
1976 if (targetm.have_ctors_dtors)
1978 rtx fnsym = XEXP (DECL_RTL (fn), 0);
1979 if (method_type == 'I')
1980 (* targetm.asm_out.constructor) (fnsym, initp);
1982 (* targetm.asm_out.destructor) (fnsym, initp);
1986 /* The names of the parameters to the function created to handle
1987 initializations and destructions for objects with static storage
1989 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
1990 #define PRIORITY_IDENTIFIER "__priority"
1992 /* The name of the function we create to handle initializations and
1993 destructions for objects with static storage duration. */
1994 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
1996 /* The declaration for the __INITIALIZE_P argument. */
1997 static GTY(()) tree initialize_p_decl;
1999 /* The declaration for the __PRIORITY argument. */
2000 static GTY(()) tree priority_decl;
2002 /* The declaration for the static storage duration function. */
2003 static GTY(()) tree ssdf_decl;
2005 /* All the static storage duration functions created in this
2006 translation unit. */
2007 static GTY(()) varray_type ssdf_decls;
2009 /* A map from priority levels to information about that priority
2010 level. There may be many such levels, so efficient lookup is
2012 static splay_tree priority_info_map;
2014 /* Begins the generation of the function that will handle all
2015 initialization and destruction of objects with static storage
2016 duration. The function generated takes two parameters of type
2017 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2018 nonzero, it performs initializations. Otherwise, it performs
2019 destructions. It only performs those initializations or
2020 destructions with the indicated __PRIORITY. The generated function
2023 It is assumed that this function will only be called once per
2024 translation unit. */
2027 start_static_storage_duration_function (unsigned count)
2032 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2034 /* Create the identifier for this function. It will be of the form
2035 SSDF_IDENTIFIER_<number>. */
2036 sprintf (id, "%s_%u", SSDF_IDENTIFIER, count);
2038 /* Create the parameters. */
2039 parm_types = void_list_node;
2040 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2041 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2042 type = build_function_type (void_type_node, parm_types);
2044 /* Create the FUNCTION_DECL itself. */
2045 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2046 get_identifier (id),
2048 TREE_PUBLIC (ssdf_decl) = 0;
2049 DECL_ARTIFICIAL (ssdf_decl) = 1;
2051 /* Put this function in the list of functions to be called from the
2052 static constructors and destructors. */
2055 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2057 /* Take this opportunity to initialize the map from priority
2058 numbers to information about that priority level. */
2059 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2060 /*delete_key_fn=*/0,
2061 /*delete_value_fn=*/
2062 (splay_tree_delete_value_fn) &free);
2064 /* We always need to generate functions for the
2065 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2066 priorities later, we'll be sure to find the
2067 DEFAULT_INIT_PRIORITY. */
2068 get_priority_info (DEFAULT_INIT_PRIORITY);
2071 VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl);
2073 /* Create the argument list. */
2074 initialize_p_decl = cp_build_parm_decl
2075 (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node);
2076 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2077 TREE_USED (initialize_p_decl) = 1;
2078 priority_decl = cp_build_parm_decl
2079 (get_identifier (PRIORITY_IDENTIFIER), integer_type_node);
2080 DECL_CONTEXT (priority_decl) = ssdf_decl;
2081 TREE_USED (priority_decl) = 1;
2083 TREE_CHAIN (initialize_p_decl) = priority_decl;
2084 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2086 /* Put the function in the global scope. */
2087 pushdecl (ssdf_decl);
2089 /* Start the function itself. This is equivalent to declaring the
2092 static void __ssdf (int __initialize_p, init __priority_p);
2094 It is static because we only need to call this function from the
2095 various constructor and destructor functions for this module. */
2096 start_preparsed_function (ssdf_decl,
2097 /*attrs=*/NULL_TREE,
2100 /* Set up the scope of the outermost block in the function. */
2101 body = begin_compound_stmt (BCS_FN_BODY);
2103 /* This function must not be deferred because we are depending on
2104 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
2105 DECL_INLINE (ssdf_decl) = 0;
2106 DECL_UNINLINABLE (ssdf_decl) = 1;
2111 /* Finish the generation of the function which performs initialization
2112 and destruction of objects with static storage duration. After
2113 this point, no more such objects can be created. */
2116 finish_static_storage_duration_function (tree body)
2118 /* Close out the function. */
2119 finish_compound_stmt (body);
2120 expand_or_defer_fn (finish_function (0));
2123 /* Return the information about the indicated PRIORITY level. If no
2124 code to handle this level has yet been generated, generate the
2125 appropriate prologue. */
2127 static priority_info
2128 get_priority_info (int priority)
2133 n = splay_tree_lookup (priority_info_map,
2134 (splay_tree_key) priority);
2137 /* Create a new priority information structure, and insert it
2139 pi = xmalloc (sizeof (struct priority_info_s));
2140 pi->initializations_p = 0;
2141 pi->destructions_p = 0;
2142 splay_tree_insert (priority_info_map,
2143 (splay_tree_key) priority,
2144 (splay_tree_value) pi);
2147 pi = (priority_info) n->value;
2152 /* Set up to handle the initialization or destruction of DECL. If
2153 INITP is nonzero, we are initializing the variable. Otherwise, we
2154 are destroying it. */
2157 start_static_initialization_or_destruction (tree decl, int initp)
2159 tree guard_if_stmt = NULL_TREE;
2166 /* Figure out the priority for this declaration. */
2167 priority = DECL_INIT_PRIORITY (decl);
2169 priority = DEFAULT_INIT_PRIORITY;
2171 /* Remember that we had an initialization or finalization at this
2173 pi = get_priority_info (priority);
2175 pi->initializations_p = 1;
2177 pi->destructions_p = 1;
2179 /* Trick the compiler into thinking we are at the file and line
2180 where DECL was declared so that error-messages make sense, and so
2181 that the debugger will show somewhat sensible file and line
2183 input_location = DECL_SOURCE_LOCATION (decl);
2189 Access control for implicit calls to the constructors,
2190 the conversion functions, or the destructor called to
2191 create and destroy a static data member is performed as
2192 if these calls appeared in the scope of the member's
2195 we pretend we are in a static member function of the class of
2196 which the DECL is a member. */
2197 if (member_p (decl))
2199 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
2200 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
2203 /* Conditionalize this initialization on being in the right priority
2204 and being initializing/finalizing appropriately. */
2205 guard_if_stmt = begin_if_stmt ();
2206 cond = cp_build_binary_op (EQ_EXPR,
2208 build_int_2 (priority, 0));
2209 init_cond = initp ? integer_one_node : integer_zero_node;
2210 init_cond = cp_build_binary_op (EQ_EXPR,
2213 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
2215 /* Assume we don't need a guard. */
2217 /* We need a guard if this is an object with external linkage that
2218 might be initialized in more than one place. (For example, a
2219 static data member of a template, when the data member requires
2221 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
2222 || DECL_ONE_ONLY (decl)
2223 || DECL_WEAK (decl)))
2227 guard = get_guard (decl);
2229 /* When using __cxa_atexit, we just check the GUARD as we would
2230 for a local static. */
2231 if (flag_use_cxa_atexit)
2233 /* When using __cxa_atexit, we never try to destroy
2234 anything from a static destructor. */
2235 my_friendly_assert (initp, 20000629);
2236 guard_cond = get_guard_cond (guard);
2238 /* If we don't have __cxa_atexit, then we will be running
2239 destructors from .fini sections, or their equivalents. So,
2240 we need to know how many times we've tried to initialize this
2241 object. We do initializations only if the GUARD is zero,
2242 i.e., if we are the first to initialize the variable. We do
2243 destructions only if the GUARD is one, i.e., if we are the
2244 last to destroy the variable. */
2247 = cp_build_binary_op (EQ_EXPR,
2248 build_unary_op (PREINCREMENT_EXPR,
2254 = cp_build_binary_op (EQ_EXPR,
2255 build_unary_op (PREDECREMENT_EXPR,
2260 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, guard_cond);
2263 finish_if_stmt_cond (cond, guard_if_stmt);
2265 /* If we're using __cxa_atexit, we have not already set the GUARD,
2266 so we must do so now. */
2267 if (guard && initp && flag_use_cxa_atexit)
2268 finish_expr_stmt (set_guard (guard));
2270 return guard_if_stmt;
2273 /* We've just finished generating code to do an initialization or
2274 finalization. GUARD_IF_STMT is the if-statement we used to guard
2275 the initialization. */
2278 finish_static_initialization_or_destruction (tree guard_if_stmt)
2280 finish_then_clause (guard_if_stmt);
2281 finish_if_stmt (guard_if_stmt);
2283 /* Now that we're done with DECL we don't need to pretend to be a
2284 member of its class any longer. */
2285 DECL_CONTEXT (current_function_decl) = NULL_TREE;
2286 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
2289 /* Generate code to do the initialization of DECL, a VAR_DECL with
2290 static storage duration. The initialization is INIT. */
2293 do_static_initialization (tree decl, tree init)
2297 /* Set up for the initialization. */
2299 = start_static_initialization_or_destruction (decl,
2302 /* Perform the initialization. */
2304 finish_expr_stmt (init);
2306 /* If we're using __cxa_atexit, register a a function that calls the
2307 destructor for the object. */
2308 if (flag_use_cxa_atexit)
2309 register_dtor_fn (decl);
2312 finish_static_initialization_or_destruction (guard_if_stmt);
2315 /* Generate code to do the static destruction of DECL. If DECL may be
2316 initialized more than once in different object files, GUARD is the
2317 guard variable to check. PRIORITY is the priority for the
2321 do_static_destruction (tree decl)
2325 /* If we're using __cxa_atexit, then destructors are registered
2326 immediately after objects are initialized. */
2327 my_friendly_assert (!flag_use_cxa_atexit, 20000121);
2329 /* If we don't need a destructor, there's nothing to do. */
2330 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2333 /* Actually do the destruction. */
2334 guard_if_stmt = start_static_initialization_or_destruction (decl,
2336 finish_expr_stmt (build_cleanup (decl));
2337 finish_static_initialization_or_destruction (guard_if_stmt);
2340 /* VARS is a list of variables with static storage duration which may
2341 need initialization and/or finalization. Remove those variables
2342 that don't really need to be initialized or finalized, and return
2343 the resulting list. The order in which the variables appear in
2344 VARS is in reverse order of the order in which they should actually
2345 be initialized. The list we return is in the unreversed order;
2346 i.e., the first variable should be initialized first. */
2349 prune_vars_needing_no_initialization (tree *vars)
2352 tree result = NULL_TREE;
2357 tree decl = TREE_VALUE (t);
2358 tree init = TREE_PURPOSE (t);
2360 /* Deal gracefully with error. */
2361 if (decl == error_mark_node)
2363 var = &TREE_CHAIN (t);
2367 /* The only things that can be initialized are variables. */
2368 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
2370 /* If this object is not defined, we don't need to do anything
2372 if (DECL_EXTERNAL (decl))
2374 var = &TREE_CHAIN (t);
2378 /* Also, if the initializer already contains errors, we can bail
2380 if (init && TREE_CODE (init) == TREE_LIST
2381 && value_member (error_mark_node, init))
2383 var = &TREE_CHAIN (t);
2387 /* This variable is going to need initialization and/or
2388 finalization, so we add it to the list. */
2389 *var = TREE_CHAIN (t);
2390 TREE_CHAIN (t) = result;
2397 /* Make sure we have told the back end about all the variables in
2401 write_out_vars (tree vars)
2405 for (v = vars; v; v = TREE_CHAIN (v))
2406 if (!var_finalized_p (TREE_VALUE (v)))
2407 rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1);
2410 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
2411 (otherwise) that will initialize all gobal objects with static
2412 storage duration having the indicated PRIORITY. */
2415 generate_ctor_or_dtor_function (bool constructor_p, int priority,
2424 input_location = *locus;
2425 #ifdef USE_MAPPED_LOCATION
2431 /* We use `I' to indicate initialization and `D' to indicate
2433 function_key = constructor_p ? 'I' : 'D';
2435 /* We emit the function lazily, to avoid generating empty
2436 global constructors and destructors. */
2439 /* Call the static storage duration function with appropriate
2442 for (i = 0; i < ssdf_decls->elements_used; ++i)
2444 fndecl = VARRAY_TREE (ssdf_decls, i);
2446 /* Calls to pure or const functions will expand to nothing. */
2447 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2450 body = start_objects (function_key, priority);
2452 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
2454 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
2456 finish_expr_stmt (build_function_call (fndecl, arguments));
2460 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
2461 calls to any functions marked with attributes indicating that
2462 they should be called at initialization- or destruction-time. */
2463 if (priority == DEFAULT_INIT_PRIORITY)
2467 for (fns = constructor_p ? static_ctors : static_dtors;
2469 fns = TREE_CHAIN (fns))
2471 fndecl = TREE_VALUE (fns);
2473 /* Calls to pure/const functions will expand to nothing. */
2474 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2477 body = start_objects (function_key, priority);
2478 finish_expr_stmt (build_function_call (fndecl, NULL_TREE));
2483 /* Close out the function. */
2485 finish_objects (function_key, priority, body);
2488 /* Generate constructor and destructor functions for the priority
2492 generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data)
2494 location_t *locus = data;
2495 int priority = (int) n->key;
2496 priority_info pi = (priority_info) n->value;
2498 /* Generate the functions themselves, but only if they are really
2500 if (pi->initializations_p
2501 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
2502 generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus);
2503 if (pi->destructions_p
2504 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
2505 generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus);
2507 /* Keep iterating. */
2511 /* Called via LANGHOOK_CALLGRAPH_ANALYZE_EXPR. It is supposed to mark
2512 decls referenced from frontend specific constructs; it will be called
2513 only for language-specific tree nodes.
2515 Here we must deal with member pointers. */
2518 cxx_callgraph_analyze_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2519 tree from ATTRIBUTE_UNUSED)
2523 if (flag_unit_at_a_time)
2524 switch (TREE_CODE (t))
2527 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
2528 cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t)));
2531 if (TREE_CODE (BASELINK_FUNCTIONS (t)) == FUNCTION_DECL)
2532 cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t)));
2542 /* This routine is called from the last rule in yyparse ().
2543 Its job is to create all the code needed to initialize and
2544 destroy the global aggregates. We do the destruction
2545 first, since that way we only need to reverse the decls once. */
2554 unsigned ssdf_count = 0;
2556 locus = input_location;
2559 /* Bad parse errors. Just forget about it. */
2560 if (! global_bindings_p () || current_class_type || decl_namespace_list)
2564 c_common_write_pch ();
2566 #ifdef USE_MAPPED_LOCATION
2569 /* Otherwise, GDB can get confused, because in only knows
2570 about source for LINENO-1 lines. */
2574 interface_unknown = 1;
2577 /* We now have to write out all the stuff we put off writing out.
2580 o Template specializations that we have not yet instantiated,
2581 but which are needed.
2582 o Initialization and destruction for non-local objects with
2583 static storage duration. (Local objects with static storage
2584 duration are initialized when their scope is first entered,
2585 and are cleaned up via atexit.)
2586 o Virtual function tables.
2588 All of these may cause others to be needed. For example,
2589 instantiating one function may cause another to be needed, and
2590 generating the initializer for an object may cause templates to be
2591 instantiated, etc., etc. */
2593 timevar_push (TV_VARCONST);
2595 emit_support_tinfos ();
2600 size_t n_old, n_new;
2604 /* If there are templates that we've put off instantiating, do
2606 instantiate_pending_templates ();
2609 /* Write out virtual tables as required. Note that writing out
2610 the virtual table for a template class may cause the
2611 instantiation of members of that class. If we write out
2612 vtables then we remove the class from our list so we don't
2613 have to look at it again. */
2615 while (keyed_classes != NULL_TREE
2616 && maybe_emit_vtables (TREE_VALUE (keyed_classes)))
2619 keyed_classes = TREE_CHAIN (keyed_classes);
2625 tree next = TREE_CHAIN (t);
2629 if (maybe_emit_vtables (TREE_VALUE (next)))
2632 TREE_CHAIN (t) = TREE_CHAIN (next);
2637 next = TREE_CHAIN (t);
2641 /* Write out needed type info variables. We have to be careful
2642 looping through unemitted decls, because emit_tinfo_decl may
2643 cause other variables to be needed. We stick new elements
2644 (and old elements that we may need to reconsider) at the end
2645 of the array, then shift them back to the beginning once we're
2648 n_old = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls);
2649 for (i = 0; i < n_old; ++i)
2651 tree tinfo_decl = VARRAY_TREE (unemitted_tinfo_decls, i);
2652 if (emit_tinfo_decl (tinfo_decl))
2655 VARRAY_PUSH_TREE (unemitted_tinfo_decls, tinfo_decl);
2658 /* The only elements we want to keep are the new ones. Copy
2659 them to the beginning of the array, then get rid of the
2661 n_new = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) - n_old;
2663 memmove (&VARRAY_TREE (unemitted_tinfo_decls, 0),
2664 &VARRAY_TREE (unemitted_tinfo_decls, n_old),
2665 n_new * sizeof (tree));
2666 memset (&VARRAY_TREE (unemitted_tinfo_decls, n_new),
2667 0, n_old * sizeof (tree));
2668 VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) = n_new;
2670 /* The list of objects with static storage duration is built up
2671 in reverse order. We clear STATIC_AGGREGATES so that any new
2672 aggregates added during the initialization of these will be
2673 initialized in the correct order when we next come around the
2675 vars = prune_vars_needing_no_initialization (&static_aggregates);
2681 /* We need to start a new initialization function each time
2682 through the loop. That's because we need to know which
2683 vtables have been referenced, and TREE_SYMBOL_REFERENCED
2684 isn't computed until a function is finished, and written
2685 out. That's a deficiency in the back-end. When this is
2686 fixed, these initialization functions could all become
2687 inline, with resulting performance improvements. */
2690 /* Set the line and file, so that it is obviously not from
2692 input_location = locus;
2693 ssdf_body = start_static_storage_duration_function (ssdf_count);
2695 /* Make sure the back end knows about all the variables. */
2696 write_out_vars (vars);
2698 /* First generate code to do all the initializations. */
2699 for (v = vars; v; v = TREE_CHAIN (v))
2700 do_static_initialization (TREE_VALUE (v),
2703 /* Then, generate code to do all the destructions. Do these
2704 in reverse order so that the most recently constructed
2705 variable is the first destroyed. If we're using
2706 __cxa_atexit, then we don't need to do this; functions
2707 were registered at initialization time to destroy the
2709 if (!flag_use_cxa_atexit)
2711 vars = nreverse (vars);
2712 for (v = vars; v; v = TREE_CHAIN (v))
2713 do_static_destruction (TREE_VALUE (v));
2718 /* Finish up the static storage duration function for this
2720 input_location = locus;
2721 finish_static_storage_duration_function (ssdf_body);
2723 /* All those initializations and finalizations might cause
2724 us to need more inline functions, more template
2725 instantiations, etc. */
2728 #ifdef USE_MAPPED_LOCATION
2735 for (i = 0; i < deferred_fns_used; ++i)
2737 tree decl = VARRAY_TREE (deferred_fns, i);
2739 if (! DECL_DECLARED_INLINE_P (decl) || ! TREE_USED (decl))
2742 /* Does it need synthesizing? */
2743 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
2745 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
2747 /* Even though we're already at the top-level, we push
2748 there again. That way, when we pop back a few lines
2749 hence, all of our state is restored. Otherwise,
2750 finish_function doesn't clean things up, and we end
2751 up with CURRENT_FUNCTION_DECL set. */
2752 push_to_top_level ();
2753 synthesize_method (decl);
2754 pop_from_top_level ();
2758 if (!DECL_SAVED_TREE (decl))
2761 import_export_decl (decl);
2763 /* We lie to the back-end, pretending that some functions
2764 are not defined when they really are. This keeps these
2765 functions from being put out unnecessarily. But, we must
2766 stop lying when the functions are referenced, or if they
2767 are not comdat since they need to be put out now. This
2768 is done in a separate for cycle, because if some deferred
2769 function is contained in another deferred function later
2770 in deferred_fns varray, rest_of_compilation would skip
2771 this function and we really cannot expand the same
2773 if (DECL_NOT_REALLY_EXTERN (decl)
2774 && DECL_INITIAL (decl)
2775 && DECL_NEEDED_P (decl))
2776 DECL_EXTERNAL (decl) = 0;
2778 /* If we're going to need to write this function out, and
2779 there's already a body for it, create RTL for it now.
2780 (There might be no body if this is a method we haven't
2781 gotten around to synthesizing yet.) */
2782 if (!DECL_EXTERNAL (decl)
2783 && DECL_NEEDED_P (decl)
2784 && !TREE_ASM_WRITTEN (decl)
2785 && (!flag_unit_at_a_time
2786 || !cgraph_node (decl)->local.finalized))
2788 /* We will output the function; no longer consider it in this
2790 DECL_DEFER_OUTPUT (decl) = 0;
2791 /* Generate RTL for this function now that we know we
2793 expand_or_defer_fn (decl);
2794 /* If we're compiling -fsyntax-only pretend that this
2795 function has been written out so that we don't try to
2797 if (flag_syntax_only)
2798 TREE_ASM_WRITTEN (decl) = 1;
2803 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
2806 /* Static data members are just like namespace-scope globals. */
2807 for (i = 0; i < pending_statics_used; ++i)
2809 tree decl = VARRAY_TREE (pending_statics, i);
2810 if (var_finalized_p (decl))
2812 import_export_decl (decl);
2813 if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
2814 DECL_EXTERNAL (decl) = 0;
2817 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
2818 pending_statics_used))
2821 if (cgraph_assemble_pending_functions ())
2826 /* All used inline functions must have a definition at this point. */
2827 for (i = 0; i < deferred_fns_used; ++i)
2829 tree decl = VARRAY_TREE (deferred_fns, i);
2831 if (!TREE_ASM_WRITTEN (decl) && !DECL_SAVED_TREE (decl)
2832 /* An explicit instantiation can be used to specify
2833 that the body is in another unit. It will have
2834 already verified there was a definition. */
2835 && !DECL_EXPLICIT_INSTANTIATION (decl))
2837 cp_warning_at ("inline function `%D' used but never defined", decl);
2838 /* This symbol is effectively an "extern" declaration now.
2839 This is not strictly necessary, but removes a duplicate
2841 TREE_PUBLIC (decl) = 1;
2846 /* We give C linkage to static constructors and destructors. */
2847 push_lang_context (lang_name_c);
2849 /* Generate initialization and destruction functions for all
2850 priorities for which they are required. */
2851 if (priority_info_map)
2852 splay_tree_foreach (priority_info_map,
2853 generate_ctor_and_dtor_functions_for_priority,
2859 generate_ctor_or_dtor_function (/*constructor_p=*/true,
2860 DEFAULT_INIT_PRIORITY, &locus);
2862 generate_ctor_or_dtor_function (/*constructor_p=*/false,
2863 DEFAULT_INIT_PRIORITY, &locus);
2866 /* We're done with the splay-tree now. */
2867 if (priority_info_map)
2868 splay_tree_delete (priority_info_map);
2870 /* We're done with static constructors, so we can go back to "C++"
2872 pop_lang_context ();
2874 if (flag_unit_at_a_time)
2876 cgraph_finalize_compilation_unit ();
2880 /* Emit mudflap static registration function. This must be done
2881 after all the user functions have been expanded. */
2883 mudflap_finish_file ();
2885 /* Now, issue warnings about static, but not defined, functions,
2886 etc., and emit debugging information. */
2887 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
2888 if (pending_statics)
2889 check_global_declarations (&VARRAY_TREE (pending_statics, 0),
2890 pending_statics_used);
2894 /* The entire file is now complete. If requested, dump everything
2898 FILE *stream = dump_begin (TDI_tu, &flags);
2902 dump_node (global_namespace, flags & ~TDF_SLIM, stream);
2903 dump_end (TDI_tu, stream);
2907 timevar_pop (TV_VARCONST);
2909 if (flag_detailed_statistics)
2911 dump_tree_statistics ();
2912 dump_time_statistics ();
2914 input_location = locus;
2916 #ifdef ENABLE_CHECKING
2917 validate_conversion_obstack ();
2918 #endif /* ENABLE_CHECKING */
2921 /* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the
2922 function to call in parse-tree form; it has not yet been
2923 semantically analyzed. ARGS are the arguments to the function.
2924 They have already been semantically analyzed. */
2927 build_offset_ref_call_from_tree (tree fn, tree args)
2936 object = TREE_OPERAND (fn, 0);
2938 if (processing_template_decl)
2940 my_friendly_assert (TREE_CODE (fn) == DOTSTAR_EXPR
2941 || TREE_CODE (fn) == MEMBER_REF,
2943 if (type_dependent_expression_p (fn)
2944 || any_type_dependent_arguments_p (args))
2945 return build_min_nt (CALL_EXPR, fn, args, NULL_TREE);
2947 /* Transform the arguments and add the implicit "this"
2948 parameter. That must be done before the FN is transformed
2949 because we depend on the form of FN. */
2950 args = build_non_dependent_args (args);
2951 if (TREE_CODE (fn) == DOTSTAR_EXPR)
2952 object = build_unary_op (ADDR_EXPR, object, 0);
2953 object = build_non_dependent_expr (object);
2954 args = tree_cons (NULL_TREE, object, args);
2955 /* Now that the arguments are done, transform FN. */
2956 fn = build_non_dependent_expr (fn);
2959 /* A qualified name corresponding to a bound pointer-to-member is
2960 represented as an OFFSET_REF:
2962 struct B { void g(); };
2964 void B::g() { (this->*p)(); } */
2965 if (TREE_CODE (fn) == OFFSET_REF)
2967 tree object_addr = build_unary_op (ADDR_EXPR, object, 0);
2968 fn = TREE_OPERAND (fn, 1);
2969 fn = get_member_function_from_ptrfunc (&object_addr, fn);
2970 args = tree_cons (NULL_TREE, object_addr, args);
2973 expr = build_function_call (fn, args);
2974 if (processing_template_decl && expr != error_mark_node)
2975 return build_min_non_dep (CALL_EXPR, expr, orig_fn, orig_args, NULL_TREE);
2981 check_default_args (tree x)
2983 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
2984 bool saw_def = false;
2985 int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
2986 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
2988 if (TREE_PURPOSE (arg))
2992 cp_error_at ("default argument missing for parameter %P of `%+#D'",
3000 mark_used (tree decl)
3002 TREE_USED (decl) = 1;
3003 if (processing_template_decl || skip_evaluation)
3006 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl)
3007 && !TREE_ASM_WRITTEN (decl))
3008 /* Remember it, so we can check it was defined. */
3010 if (DECL_DEFERRED_FN (decl))
3012 DECL_DEFERRED_FN (decl) = 1;
3013 DECL_DEFER_OUTPUT (decl) = 1;
3015 VARRAY_TREE_INIT (deferred_fns, 32, "deferred_fns");
3017 VARRAY_PUSH_TREE (deferred_fns, decl);
3020 assemble_external (decl);
3022 /* Is it a synthesized method that needs to be synthesized? */
3023 if (TREE_CODE (decl) == FUNCTION_DECL
3024 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
3025 && DECL_ARTIFICIAL (decl)
3026 && !DECL_THUNK_P (decl)
3027 && ! DECL_INITIAL (decl)
3028 /* Kludge: don't synthesize for default args. */
3029 && current_function_decl)
3031 synthesize_method (decl);
3032 /* If we've already synthesized the method we don't need to
3033 instantiate it, so we can return right away. */
3037 /* If this is a function or variable that is an instance of some
3038 template, we now know that we will need to actually do the
3039 instantiation. We check that DECL is not an explicit
3040 instantiation because that is not checked in instantiate_decl. */
3041 if ((DECL_NON_THUNK_FUNCTION_P (decl) || TREE_CODE (decl) == VAR_DECL)
3042 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
3043 && (!DECL_EXPLICIT_INSTANTIATION (decl)
3044 || (TREE_CODE (decl) == FUNCTION_DECL
3045 && DECL_INLINE (DECL_TEMPLATE_RESULT
3046 (template_for_substitution (decl))))))
3050 /* Normally, we put off instantiating functions in order to
3051 improve compile times. Maintaining a stack of active
3052 functions is expensive, and the inliner knows to
3053 instantiate any functions it might need.
3055 However, if instantiating this function might help us mark
3056 the current function TREE_NOTHROW, we go ahead and
3059 This is not needed for unit-at-a-time since we reorder the functions
3060 in topological order anyway.
3062 defer = (!flag_exceptions
3063 || flag_unit_at_a_time
3065 || TREE_CODE (decl) != FUNCTION_DECL
3066 /* If the called function can't throw, we don't need to
3067 generate its body to find that out. */
3068 || TREE_NOTHROW (decl)
3070 || !current_function_decl
3071 /* If we already know the current function can't throw,
3072 then we don't need to work hard to prove it. */
3073 || TREE_NOTHROW (current_function_decl)
3074 /* If we already know that the current function *can*
3075 throw, there's no point in gathering more
3077 || cp_function_chain->can_throw);
3079 instantiate_decl (decl, defer, /*undefined_ok=*/0);
3083 #include "gt-cp-decl2.h"