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"
49 #include "tree-mudflap.h"
51 #include "tree-inline.h"
53 extern cpp_reader *parse_in;
55 /* This structure contains information about the initializations
56 and/or destructions required for a particular priority level. */
57 typedef struct priority_info_s {
58 /* Nonzero if there have been any initializations at this priority
59 throughout the translation unit. */
60 int initializations_p;
61 /* Nonzero if there have been any destructions at this priority
62 throughout the translation unit. */
66 static void mark_vtable_entries (tree);
67 static void grok_function_init (tree, tree);
68 static bool maybe_emit_vtables (tree);
69 static tree build_anon_union_vars (tree);
70 static bool acceptable_java_type (tree);
71 static tree start_objects (int, int);
72 static void finish_objects (int, int, tree);
73 static tree start_static_storage_duration_function (unsigned);
74 static void finish_static_storage_duration_function (tree);
75 static priority_info get_priority_info (int);
76 static void do_static_initialization (tree, tree);
77 static void do_static_destruction (tree);
78 static tree start_static_initialization_or_destruction (tree, int);
79 static void finish_static_initialization_or_destruction (tree);
80 static void generate_ctor_or_dtor_function (bool, int, location_t *);
81 static int generate_ctor_and_dtor_functions_for_priority (splay_tree_node,
83 static tree prune_vars_needing_no_initialization (tree *);
84 static void write_out_vars (tree);
85 static void import_export_class (tree);
86 static tree get_guard_bits (tree);
88 /* A list of static class variables. This is needed, because a
89 static class variable can be declared inside the class without
90 an initializer, and then initialized, statically, outside the class. */
91 static GTY(()) varray_type pending_statics;
92 #define pending_statics_used \
93 (pending_statics ? pending_statics->elements_used : 0)
95 /* A list of functions which were declared inline, but which we
96 may need to emit outline anyway. */
97 static GTY(()) varray_type deferred_fns;
98 #define deferred_fns_used \
99 (deferred_fns ? deferred_fns->elements_used : 0)
101 /* Flag used when debugging spew.c */
103 extern int spew_debug;
105 /* Nonzero if we're done parsing and into end-of-file activities. */
109 /* Functions called along with real static constructors and destructors. */
115 /* Incorporate `const' and `volatile' qualifiers for member functions.
116 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
117 QUALS is a list of qualifiers. Returns any explicit
118 top-level qualifiers of the method's this pointer, anything other than
119 TYPE_UNQUALIFIED will be an extension. */
122 grok_method_quals (tree ctype, tree function, tree quals)
124 tree fntype = TREE_TYPE (function);
125 tree raises = TYPE_RAISES_EXCEPTIONS (fntype);
126 int type_quals = TYPE_UNQUALIFIED;
127 int dup_quals = TYPE_UNQUALIFIED;
128 int this_quals = TYPE_UNQUALIFIED;
132 int tq = cp_type_qual_from_rid (TREE_VALUE (quals));
134 if ((type_quals | this_quals) & tq)
136 else if (tq & TYPE_QUAL_RESTRICT)
140 quals = TREE_CHAIN (quals);
144 if (dup_quals != TYPE_UNQUALIFIED)
145 error ("duplicate type qualifiers in %s declaration",
146 TREE_CODE (function) == FUNCTION_DECL
147 ? "member function" : "type");
149 ctype = cp_build_qualified_type (ctype, type_quals);
150 fntype = build_method_type_directly (ctype, TREE_TYPE (fntype),
151 (TREE_CODE (fntype) == METHOD_TYPE
152 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
153 : TYPE_ARG_TYPES (fntype)));
155 fntype = build_exception_variant (fntype, raises);
157 TREE_TYPE (function) = fntype;
161 /* A subroutine of the parser, to handle a component list. */
164 grok_x_components (tree specs)
168 specs = strip_attrs (specs);
170 check_tag_decl (specs);
171 t = groktypename (build_tree_list (specs, NULL_TREE));
173 /* The only case where we need to do anything additional here is an
174 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
175 if (t == NULL_TREE || !ANON_AGGR_TYPE_P (t))
178 fixup_anonymous_aggr (t);
179 finish_member_declaration (build_decl (FIELD_DECL, NULL_TREE, t));
182 /* Build a PARM_DECL with NAME and TYPE, and set DECL_ARG_TYPE
186 cp_build_parm_decl (tree name, tree type)
188 tree parm = build_decl (PARM_DECL, name, type);
189 /* DECL_ARG_TYPE is only used by the back end and the back end never
191 if (!processing_template_decl)
192 DECL_ARG_TYPE (parm) = type_passed_as (type);
196 /* Returns a PARM_DECL for a parameter of the indicated TYPE, with the
200 build_artificial_parm (tree name, tree type)
202 tree parm = cp_build_parm_decl (name, type);
203 DECL_ARTIFICIAL (parm) = 1;
204 /* All our artificial parms are implicitly `const'; they cannot be
206 TREE_READONLY (parm) = 1;
210 /* Constructors for types with virtual baseclasses need an "in-charge" flag
211 saying whether this constructor is responsible for initialization of
212 virtual baseclasses or not. All destructors also need this "in-charge"
213 flag, which additionally determines whether or not the destructor should
214 free the memory for the object.
216 This function adds the "in-charge" flag to member function FN if
217 appropriate. It is called from grokclassfn and tsubst.
218 FN must be either a constructor or destructor.
220 The in-charge flag follows the 'this' parameter, and is followed by the
221 VTT parm (if any), then the user-written parms. */
224 maybe_retrofit_in_chrg (tree fn)
226 tree basetype, arg_types, parms, parm, fntype;
228 /* If we've already add the in-charge parameter don't do it again. */
229 if (DECL_HAS_IN_CHARGE_PARM_P (fn))
232 /* When processing templates we can't know, in general, whether or
233 not we're going to have virtual baseclasses. */
234 if (processing_template_decl)
237 /* We don't need an in-charge parameter for constructors that don't
238 have virtual bases. */
239 if (DECL_CONSTRUCTOR_P (fn)
240 && !TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn)))
243 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
244 basetype = TREE_TYPE (TREE_VALUE (arg_types));
245 arg_types = TREE_CHAIN (arg_types);
247 parms = TREE_CHAIN (DECL_ARGUMENTS (fn));
249 /* If this is a subobject constructor or destructor, our caller will
250 pass us a pointer to our VTT. */
251 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn)))
253 parm = build_artificial_parm (vtt_parm_identifier, vtt_parm_type);
255 /* First add it to DECL_ARGUMENTS between 'this' and the real args... */
256 TREE_CHAIN (parm) = parms;
259 /* ...and then to TYPE_ARG_TYPES. */
260 arg_types = hash_tree_chain (vtt_parm_type, arg_types);
262 DECL_HAS_VTT_PARM_P (fn) = 1;
265 /* Then add the in-charge parm (before the VTT parm). */
266 parm = build_artificial_parm (in_charge_identifier, integer_type_node);
267 TREE_CHAIN (parm) = parms;
269 arg_types = hash_tree_chain (integer_type_node, arg_types);
271 /* Insert our new parameter(s) into the list. */
272 TREE_CHAIN (DECL_ARGUMENTS (fn)) = parms;
274 /* And rebuild the function type. */
275 fntype = build_method_type_directly (basetype, TREE_TYPE (TREE_TYPE (fn)),
277 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
278 fntype = build_exception_variant (fntype,
279 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
280 TREE_TYPE (fn) = fntype;
282 /* Now we've got the in-charge parameter. */
283 DECL_HAS_IN_CHARGE_PARM_P (fn) = 1;
286 /* Classes overload their constituent function names automatically.
287 When a function name is declared in a record structure,
288 its name is changed to it overloaded name. Since names for
289 constructors and destructors can conflict, we place a leading
292 CNAME is the name of the class we are grokking for.
294 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
296 FLAGS contains bits saying what's special about today's
297 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
299 If FUNCTION is a destructor, then we must add the `auto-delete' field
300 as a second parameter. There is some hair associated with the fact
301 that we must "declare" this variable in the manner consistent with the
302 way the rest of the arguments were declared.
304 QUALS are the qualifiers for the this pointer. */
307 grokclassfn (tree ctype, tree function, enum overload_flags flags, tree quals)
309 tree fn_name = DECL_NAME (function);
310 int this_quals = TYPE_UNQUALIFIED;
312 /* Even within an `extern "C"' block, members get C++ linkage. See
313 [dcl.link] for details. */
314 SET_DECL_LANGUAGE (function, lang_cplusplus);
316 if (fn_name == NULL_TREE)
318 error ("name missing for member function");
319 fn_name = get_identifier ("<anonymous>");
320 DECL_NAME (function) = fn_name;
324 this_quals = grok_method_quals (ctype, function, quals);
326 if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
328 /* Must add the class instance variable up front. */
329 /* Right now we just make this a pointer. But later
330 we may wish to make it special. */
331 tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function)));
335 /* The `this' parameter is implicitly `const'; it cannot be
337 this_quals |= TYPE_QUAL_CONST;
338 qual_type = cp_build_qualified_type (type, this_quals);
339 parm = build_artificial_parm (this_identifier, qual_type);
340 c_apply_type_quals_to_decl (this_quals, parm);
341 TREE_CHAIN (parm) = DECL_ARGUMENTS (function);
342 DECL_ARGUMENTS (function) = parm;
345 DECL_CONTEXT (function) = ctype;
347 if (flags == DTOR_FLAG)
348 DECL_DESTRUCTOR_P (function) = 1;
350 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
351 maybe_retrofit_in_chrg (function);
354 /* Create an ARRAY_REF, checking for the user doing things backwards
358 grok_array_decl (tree array_expr, tree index_exp)
362 tree orig_array_expr = array_expr;
363 tree orig_index_exp = index_exp;
365 if (error_operand_p (array_expr) || error_operand_p (index_exp))
366 return error_mark_node;
368 if (processing_template_decl)
370 if (type_dependent_expression_p (array_expr)
371 || type_dependent_expression_p (index_exp))
372 return build_min_nt (ARRAY_REF, array_expr, index_exp);
373 array_expr = build_non_dependent_expr (array_expr);
374 index_exp = build_non_dependent_expr (index_exp);
377 type = TREE_TYPE (array_expr);
378 my_friendly_assert (type, 20030626);
379 type = non_reference (type);
381 /* If they have an `operator[]', use that. */
382 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
383 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL,
384 array_expr, index_exp, NULL_TREE,
385 /*overloaded_p=*/NULL);
390 /* Otherwise, create an ARRAY_REF for a pointer or array type.
391 It is a little-known fact that, if `a' is an array and `i' is
392 an int, you can write `i[a]', which means the same thing as
394 if (TREE_CODE (type) == ARRAY_TYPE)
397 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, false);
399 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
402 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, false);
404 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr,
406 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp,
409 if ((p1 && i2) && (i1 && p2))
410 error ("ambiguous conversion for array subscript");
413 array_expr = p1, index_exp = i2;
415 array_expr = p2, index_exp = i1;
418 error ("invalid types `%T[%T]' for array subscript",
419 type, TREE_TYPE (index_exp));
420 return error_mark_node;
423 if (array_expr == error_mark_node || index_exp == error_mark_node)
424 error ("ambiguous conversion for array subscript");
426 expr = build_array_ref (array_expr, index_exp);
428 if (processing_template_decl && expr != error_mark_node)
429 return build_min_non_dep (ARRAY_REF, expr,
430 orig_array_expr, orig_index_exp);
434 /* Given the cast expression EXP, checking out its validity. Either return
435 an error_mark_node if there was an unavoidable error, return a cast to
436 void for trying to delete a pointer w/ the value 0, or return the
437 call to delete. If DOING_VEC is true, we handle things differently
438 for doing an array delete.
439 Implements ARM $5.3.4. This is called from the parser. */
442 delete_sanity (tree exp, tree size, bool doing_vec, int use_global_delete)
446 if (exp == error_mark_node)
449 if (processing_template_decl)
451 t = build_min (DELETE_EXPR, void_type_node, exp, size);
452 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
453 DELETE_EXPR_USE_VEC (t) = doing_vec;
454 TREE_SIDE_EFFECTS (t) = 1;
458 exp = convert_from_reference (exp);
460 /* An array can't have been allocated by new, so complain. */
461 if (TREE_CODE (exp) == VAR_DECL
462 && TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
463 warning ("deleting array `%#D'", exp);
465 t = build_expr_type_conversion (WANT_POINTER, exp, true);
467 if (t == NULL_TREE || t == error_mark_node)
469 error ("type `%#T' argument given to `delete', expected pointer",
471 return error_mark_node;
474 type = TREE_TYPE (t);
476 /* As of Valley Forge, you can delete a pointer to const. */
478 /* You can't delete functions. */
479 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
481 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
482 return error_mark_node;
485 /* Deleting ptr to void is undefined behavior [expr.delete/3]. */
486 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
488 warning ("deleting `%T' is undefined", type);
492 /* Deleting a pointer with the value zero is valid and has no effect. */
493 if (integer_zerop (t))
494 return build1 (NOP_EXPR, void_type_node, t);
497 return build_vec_delete (t, /*maxindex=*/NULL_TREE,
498 sfk_deleting_destructor,
501 return build_delete (type, t, sfk_deleting_destructor,
502 LOOKUP_NORMAL, use_global_delete);
505 /* Report an error if the indicated template declaration is not the
506 sort of thing that should be a member template. */
509 check_member_template (tree tmpl)
513 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
514 decl = DECL_TEMPLATE_RESULT (tmpl);
516 if (TREE_CODE (decl) == FUNCTION_DECL
517 || (TREE_CODE (decl) == TYPE_DECL
518 && IS_AGGR_TYPE (TREE_TYPE (decl))))
520 if (current_function_decl)
521 /* 14.5.2.2 [temp.mem]
523 A local class shall not have member templates. */
524 error ("invalid declaration of member template `%#D' in local class",
527 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
529 /* 14.5.2.3 [temp.mem]
531 A member function template shall not be virtual. */
533 ("invalid use of `virtual' in template declaration of `%#D'",
535 DECL_VIRTUAL_P (decl) = 0;
538 /* The debug-information generating code doesn't know what to do
539 with member templates. */
540 DECL_IGNORED_P (tmpl) = 1;
543 error ("template declaration of `%#D'", decl);
546 /* Return true iff TYPE is a valid Java parameter or return type. */
549 acceptable_java_type (tree type)
551 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
553 if (TREE_CODE (type) == POINTER_TYPE || TREE_CODE (type) == REFERENCE_TYPE)
555 type = TREE_TYPE (type);
556 if (TREE_CODE (type) == RECORD_TYPE)
559 if (! TYPE_FOR_JAVA (type))
561 if (! CLASSTYPE_TEMPLATE_INFO (type))
563 args = CLASSTYPE_TI_ARGS (type);
564 i = TREE_VEC_LENGTH (args);
567 type = TREE_VEC_ELT (args, i);
568 if (TREE_CODE (type) == POINTER_TYPE)
569 type = TREE_TYPE (type);
570 if (! TYPE_FOR_JAVA (type))
579 /* For a METHOD in a Java class CTYPE, return true if
580 the parameter and return types are valid Java types.
581 Otherwise, print appropriate error messages, and return false. */
584 check_java_method (tree method)
587 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
588 tree ret_type = TREE_TYPE (TREE_TYPE (method));
590 if (!acceptable_java_type (ret_type))
592 error ("Java method '%D' has non-Java return type `%T'",
597 arg_types = TREE_CHAIN (arg_types);
598 if (DECL_HAS_IN_CHARGE_PARM_P (method))
599 arg_types = TREE_CHAIN (arg_types);
600 if (DECL_HAS_VTT_PARM_P (method))
601 arg_types = TREE_CHAIN (arg_types);
603 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
605 tree type = TREE_VALUE (arg_types);
606 if (!acceptable_java_type (type))
608 error ("Java method '%D' has non-Java parameter type `%T'",
616 /* Sanity check: report error if this function FUNCTION is not
617 really a member of the class (CTYPE) it is supposed to belong to.
618 TEMPLATE_PARMS is used to specifiy the template parameters of a member
619 template passed as FUNCTION_DECL. If the member template is passed as a
620 TEMPLATE_DECL, it can be NULL since the parameters can be extracted
621 from the declaration. If the function is not a function template, it
623 It returns the original declaration for the function, or NULL_TREE
624 if no declaration was found (and an error was emitted). */
627 check_classfn (tree ctype, tree function, tree template_parms)
632 if (DECL_USE_TEMPLATE (function)
633 && !(TREE_CODE (function) == TEMPLATE_DECL
634 && DECL_TEMPLATE_SPECIALIZATION (function))
635 && is_member_template (DECL_TI_TEMPLATE (function)))
636 /* Since this is a specialization of a member template,
637 we're not going to find the declaration in the class.
640 struct S { template <typename T> void f(T); };
641 template <> void S::f(int);
643 we're not going to find `S::f(int)', but there's no
644 reason we should, either. We let our callers know we didn't
645 find the method, but we don't complain. */
648 /* Basic sanity check: for a template function, the template parameters
649 either were not passed, or they are the same of DECL_TEMPLATE_PARMS. */
650 if (TREE_CODE (function) == TEMPLATE_DECL)
652 my_friendly_assert (!template_parms
653 || comp_template_parms
655 DECL_TEMPLATE_PARMS (function)),
657 template_parms = DECL_TEMPLATE_PARMS (function);
660 /* OK, is this a definition of a member template? */
661 is_template = (template_parms != NULL_TREE);
663 ix = lookup_fnfields_1 (complete_type (ctype),
664 DECL_CONSTRUCTOR_P (function) ? ctor_identifier :
665 DECL_DESTRUCTOR_P (function) ? dtor_identifier :
666 DECL_NAME (function));
670 tree methods = CLASSTYPE_METHOD_VEC (ctype);
671 tree fndecls, fndecl = 0;
674 const char *format = NULL;
676 pop_p = push_scope (ctype);
677 for (fndecls = TREE_VEC_ELT (methods, ix);
678 fndecls; fndecls = OVL_NEXT (fndecls))
682 fndecl = OVL_CURRENT (fndecls);
683 p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
684 p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
686 /* We cannot simply call decls_match because this doesn't
687 work for static member functions that are pretending to
688 be methods, and because the name may have been changed by
691 /* Get rid of the this parameter on functions that become
693 if (DECL_STATIC_FUNCTION_P (fndecl)
694 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
695 p1 = TREE_CHAIN (p1);
697 /* A member template definition only matches a member template
699 if (is_template != (TREE_CODE (fndecl) == TEMPLATE_DECL))
702 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
703 TREE_TYPE (TREE_TYPE (fndecl)))
704 && compparms (p1, p2)
706 || comp_template_parms (template_parms,
707 DECL_TEMPLATE_PARMS (fndecl)))
708 && (DECL_TEMPLATE_SPECIALIZATION (function)
709 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
710 && (!DECL_TEMPLATE_SPECIALIZATION (function)
711 || (DECL_TI_TEMPLATE (function)
712 == DECL_TI_TEMPLATE (fndecl))))
718 return OVL_CURRENT (fndecls);
719 error ("prototype for `%#D' does not match any in class `%T'",
721 is_conv_op = DECL_CONV_FN_P (fndecl);
724 ix = CLASSTYPE_FIRST_CONVERSION_SLOT;
725 fndecls = TREE_VEC_ELT (methods, ix);
728 fndecl = OVL_CURRENT (fndecls);
729 fndecls = OVL_NEXT (fndecls);
731 if (!fndecls && is_conv_op)
733 if (TREE_VEC_LENGTH (methods) > ix)
736 fndecls = TREE_VEC_ELT (methods, ix);
737 if (!DECL_CONV_FN_P (OVL_CURRENT (fndecls)))
749 format = "candidates are: %#D";
751 format = "candidate is: %#D";
752 cp_error_at (format, fndecl);
755 else if (!COMPLETE_TYPE_P (ctype))
756 cxx_incomplete_type_error (function, ctype);
758 error ("no `%#D' member function declared in class `%T'",
761 /* If we did not find the method in the class, add it to avoid
762 spurious errors (unless the CTYPE is not yet defined, in which
763 case we'll only confuse ourselves when the function is declared
764 properly within the class. */
765 if (COMPLETE_TYPE_P (ctype))
766 add_method (ctype, function, /*error_p=*/1);
770 /* We have just processed the DECL, which is a static data member.
771 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
772 present, is the assembly-language name for the data member.
773 FLAGS is as for cp_finish_decl. */
776 finish_static_data_member_decl (tree decl, tree init, tree asmspec_tree,
779 my_friendly_assert (TREE_PUBLIC (decl), 0);
781 DECL_CONTEXT (decl) = current_class_type;
783 /* We cannot call pushdecl here, because that would fill in the
784 TREE_CHAIN of our decl. Instead, we modify cp_finish_decl to do
785 the right thing, namely, to put this decl out straight away. */
786 /* current_class_type can be NULL_TREE in case of error. */
787 if (!asmspec_tree && current_class_type)
788 DECL_INITIAL (decl) = error_mark_node;
790 if (! processing_template_decl)
792 if (!pending_statics)
793 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
794 VARRAY_PUSH_TREE (pending_statics, decl);
797 if (LOCAL_CLASS_P (current_class_type))
798 pedwarn ("local class `%#T' shall not have static data member `%#D'",
799 current_class_type, decl);
801 /* Static consts need not be initialized in the class definition. */
802 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
804 static int explained = 0;
806 error ("initializer invalid for static member with constructor");
809 error ("(an out of class initialization is required)");
814 /* Force the compiler to know when an uninitialized static const
815 member is being used. */
816 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
817 TREE_USED (decl) = 1;
818 DECL_INITIAL (decl) = init;
819 DECL_IN_AGGR_P (decl) = 1;
821 cp_finish_decl (decl, init, asmspec_tree, flags);
824 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
825 of a structure component, returning a _DECL node.
826 QUALS is a list of type qualifiers for this decl (such as for declaring
827 const member functions).
829 This is done during the parsing of the struct declaration.
830 The _DECL nodes are chained together and the lot of them
831 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
833 If class A defines that certain functions in class B are friends, then
834 the way I have set things up, it is B who is interested in permission
835 granted by A. However, it is in A's context that these declarations
836 are parsed. By returning a void_type_node, class A does not attempt
837 to incorporate the declarations of the friends within its structure.
839 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
840 CHANGES TO CODE IN `start_method'. */
843 grokfield (tree declarator, tree declspecs, tree init, tree asmspec_tree,
847 const char *asmspec = 0;
848 int flags = LOOKUP_ONLYCONVERTING;
850 if (declspecs == NULL_TREE
851 && TREE_CODE (declarator) == SCOPE_REF
852 && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
854 /* Access declaration */
855 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
857 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
859 return do_class_using_decl (declarator);
863 && TREE_CODE (init) == TREE_LIST
864 && TREE_VALUE (init) == error_mark_node
865 && TREE_CHAIN (init) == NULL_TREE)
868 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist);
869 if (! value || error_operand_p (value))
870 /* friend or constructor went bad. */
871 return error_mark_node;
873 if (TREE_CODE (value) == TYPE_DECL && init)
875 error ("typedef `%D' is initialized (use __typeof__ instead)", value);
879 /* Pass friendly classes back. */
880 if (value == void_type_node)
883 /* Pass friend decls back. */
884 if ((TREE_CODE (value) == FUNCTION_DECL
885 || TREE_CODE (value) == TEMPLATE_DECL)
886 && DECL_CONTEXT (value) != current_class_type)
889 if (DECL_NAME (value) != NULL_TREE
890 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
891 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
892 error ("member `%D' conflicts with virtual function table field name",
895 /* Stash away type declarations. */
896 if (TREE_CODE (value) == TYPE_DECL)
898 DECL_NONLOCAL (value) = 1;
899 DECL_CONTEXT (value) = current_class_type;
901 if (processing_template_decl)
902 value = push_template_decl (value);
907 if (DECL_IN_AGGR_P (value))
909 error ("`%D' is already defined in `%T'", value,
910 DECL_CONTEXT (value));
911 return void_type_node;
915 asmspec = TREE_STRING_POINTER (asmspec_tree);
919 if (TREE_CODE (value) == FUNCTION_DECL)
921 grok_function_init (value, init);
924 else if (pedantic && TREE_CODE (value) != VAR_DECL)
925 /* Already complained in grokdeclarator. */
929 /* We allow initializers to become parameters to base
931 if (TREE_CODE (init) == TREE_LIST)
933 if (TREE_CHAIN (init) == NULL_TREE)
934 init = TREE_VALUE (init);
936 init = digest_init (TREE_TYPE (value), init, (tree *)0);
939 if (!processing_template_decl)
941 if (TREE_CODE (init) == CONST_DECL)
942 init = DECL_INITIAL (init);
943 else if (TREE_READONLY_DECL_P (init))
944 init = decl_constant_value (init);
945 else if (TREE_CODE (init) == CONSTRUCTOR)
946 init = digest_init (TREE_TYPE (value), init, (tree *)0);
947 if (init != error_mark_node && ! TREE_CONSTANT (init))
949 /* We can allow references to things that are effectively
950 static, since references are initialized with the
952 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
953 || (TREE_STATIC (init) == 0
954 && (!DECL_P (init) || DECL_EXTERNAL (init) == 0)))
956 error ("field initializer is not constant");
957 init = error_mark_node;
964 if (processing_template_decl
965 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
967 value = push_template_decl (value);
968 if (error_operand_p (value))
969 return error_mark_node;
973 cplus_decl_attributes (&value, attrlist, 0);
975 if (TREE_CODE (value) == VAR_DECL)
977 finish_static_data_member_decl (value, init, asmspec_tree,
981 if (TREE_CODE (value) == FIELD_DECL)
984 error ("`asm' specifiers are not permitted on non-static data members");
985 if (DECL_INITIAL (value) == error_mark_node)
986 init = error_mark_node;
987 cp_finish_decl (value, init, NULL_TREE, flags);
988 DECL_INITIAL (value) = init;
989 DECL_IN_AGGR_P (value) = 1;
992 if (TREE_CODE (value) == FUNCTION_DECL)
996 /* This must override the asm specifier which was placed
997 by grokclassfn. Lay this out fresh. */
998 SET_DECL_RTL (value, NULL_RTX);
999 change_decl_assembler_name (value, get_identifier (asmspec));
1001 if (!DECL_FRIEND_P (value))
1002 grok_special_member_properties (value);
1004 cp_finish_decl (value, init, asmspec_tree, flags);
1006 /* Pass friends back this way. */
1007 if (DECL_FRIEND_P (value))
1008 return void_type_node;
1010 DECL_IN_AGGR_P (value) = 1;
1018 /* Like `grokfield', but for bitfields.
1019 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1022 grokbitfield (tree declarator, tree declspecs, tree width)
1024 tree value = grokdeclarator (declarator, declspecs, BITFIELD, 0, NULL);
1026 if (! value) return NULL_TREE; /* friends went bad. */
1028 /* Pass friendly classes back. */
1029 if (TREE_CODE (value) == VOID_TYPE)
1030 return void_type_node;
1032 if (TREE_CODE (value) == TYPE_DECL)
1034 error ("cannot declare `%D' to be a bit-field type", value);
1038 /* Usually, finish_struct_1 catches bitfields with invalid types.
1039 But, in the case of bitfields with function type, we confuse
1040 ourselves into thinking they are member functions, so we must
1042 if (TREE_CODE (value) == FUNCTION_DECL)
1044 error ("cannot declare bit-field `%D' with function type",
1049 if (DECL_IN_AGGR_P (value))
1051 error ("`%D' is already defined in the class %T", value,
1052 DECL_CONTEXT (value));
1053 return void_type_node;
1056 if (TREE_STATIC (value))
1058 error ("static member `%D' cannot be a bit-field", value);
1061 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1063 if (width != error_mark_node)
1065 constant_expression_warning (width);
1066 DECL_INITIAL (value) = width;
1067 SET_DECL_C_BIT_FIELD (value);
1070 DECL_IN_AGGR_P (value) = 1;
1074 /* When a function is declared with an initializer,
1075 do the right thing. Currently, there are two possibilities:
1080 // initialization possibility #1.
1081 virtual void f () = 0;
1103 // initialization possibility #2
1110 grok_function_init (tree decl, tree init)
1112 /* An initializer for a function tells how this function should
1114 tree type = TREE_TYPE (decl);
1116 if (TREE_CODE (type) == FUNCTION_TYPE)
1117 error ("initializer specified for non-member function `%D'", decl);
1118 else if (integer_zerop (init))
1119 DECL_PURE_VIRTUAL_P (decl) = 1;
1121 error ("invalid initializer for virtual method `%D'", decl);
1125 cplus_decl_attributes (tree *decl, tree attributes, int flags)
1127 if (*decl == NULL_TREE || *decl == void_type_node)
1130 if (TREE_CODE (*decl) == TEMPLATE_DECL)
1131 decl = &DECL_TEMPLATE_RESULT (*decl);
1133 decl_attributes (decl, attributes, flags);
1135 if (TREE_CODE (*decl) == TYPE_DECL)
1136 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl));
1139 /* Defer the compilation of the FN until the end of compilation. */
1144 if (DECL_DEFERRED_FN (fn))
1146 DECL_DEFERRED_FN (fn) = 1;
1147 DECL_DEFER_OUTPUT (fn) = 1;
1149 VARRAY_TREE_INIT (deferred_fns, 32, "deferred_fns");
1151 VARRAY_PUSH_TREE (deferred_fns, fn);
1154 /* Walks through the namespace- or function-scope anonymous union OBJECT,
1155 building appropriate ALIAS_DECLs. Returns one of the fields for use in
1156 the mangled name. */
1159 build_anon_union_vars (tree object)
1161 tree type = TREE_TYPE (object);
1162 tree main_decl = NULL_TREE;
1165 /* Rather than write the code to handle the non-union case,
1166 just give an error. */
1167 if (TREE_CODE (type) != UNION_TYPE)
1168 error ("anonymous struct not inside named type");
1170 for (field = TYPE_FIELDS (type);
1172 field = TREE_CHAIN (field))
1177 if (DECL_ARTIFICIAL (field))
1179 if (TREE_CODE (field) != FIELD_DECL)
1182 `%#D' invalid; an anonymous union can only have non-static data members",
1187 if (TREE_PRIVATE (field))
1188 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
1189 else if (TREE_PROTECTED (field))
1190 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
1192 if (processing_template_decl)
1193 ref = build_min_nt (COMPONENT_REF, object, DECL_NAME (field));
1195 ref = build_class_member_access_expr (object, field, NULL_TREE,
1198 if (DECL_NAME (field))
1200 decl = build_decl (ALIAS_DECL, DECL_NAME (field), TREE_TYPE (field));
1201 DECL_INITIAL (decl) = ref;
1202 TREE_PUBLIC (decl) = 0;
1203 TREE_STATIC (decl) = 0;
1204 DECL_EXTERNAL (decl) = 1;
1205 decl = pushdecl (decl);
1207 else if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1208 decl = build_anon_union_vars (ref);
1212 if (main_decl == NULL_TREE)
1219 /* Finish off the processing of a UNION_TYPE structure. If the union is an
1220 anonymous union, then all members must be laid out together. PUBLIC_P
1221 is nonzero if this union is not declared static. */
1224 finish_anon_union (tree anon_union_decl)
1226 tree type = TREE_TYPE (anon_union_decl);
1228 bool public_p = TREE_PUBLIC (anon_union_decl);
1230 /* The VAR_DECL's context is the same as the TYPE's context. */
1231 DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type));
1233 if (TYPE_FIELDS (type) == NULL_TREE)
1238 error ("namespace-scope anonymous aggregates must be static");
1242 main_decl = build_anon_union_vars (anon_union_decl);
1243 if (main_decl == NULL_TREE)
1245 warning ("anonymous union with no members");
1249 if (!processing_template_decl)
1251 /* Use main_decl to set the mangled name. */
1252 DECL_NAME (anon_union_decl) = DECL_NAME (main_decl);
1253 mangle_decl (anon_union_decl);
1254 DECL_NAME (anon_union_decl) = NULL_TREE;
1257 pushdecl (anon_union_decl);
1258 if (building_stmt_tree ()
1259 && at_function_scope_p ())
1260 add_decl_stmt (anon_union_decl);
1261 else if (!processing_template_decl)
1262 rest_of_decl_compilation (anon_union_decl, NULL,
1263 toplevel_bindings_p (), at_eof);
1266 /* Auxiliary functions to make type signatures for
1267 `operator new' and `operator delete' correspond to
1268 what compiler will be expecting. */
1271 coerce_new_type (tree type)
1274 tree args = TYPE_ARG_TYPES (type);
1276 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1278 if (!same_type_p (TREE_TYPE (type), ptr_type_node))
1279 e = 1, error ("`operator new' must return type `%T'", ptr_type_node);
1281 if (!args || args == void_list_node
1282 || !same_type_p (TREE_VALUE (args), size_type_node))
1285 if (args && args != void_list_node)
1286 args = TREE_CHAIN (args);
1287 pedwarn ("`operator new' takes type `size_t' (`%T') as first parameter", size_type_node);
1292 args = tree_cons (NULL_TREE, size_type_node, args);
1295 type = build_exception_variant
1296 (build_function_type (ptr_type_node, args),
1297 TYPE_RAISES_EXCEPTIONS (type));
1305 coerce_delete_type (tree type)
1308 tree args = TYPE_ARG_TYPES (type);
1310 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1312 if (!same_type_p (TREE_TYPE (type), void_type_node))
1313 e = 1, error ("`operator delete' must return type `%T'", void_type_node);
1315 if (!args || args == void_list_node
1316 || !same_type_p (TREE_VALUE (args), ptr_type_node))
1319 if (args && args != void_list_node)
1320 args = TREE_CHAIN (args);
1321 error ("`operator delete' takes type `%T' as first parameter", ptr_type_node);
1326 args = tree_cons (NULL_TREE, ptr_type_node, args);
1329 type = build_exception_variant
1330 (build_function_type (void_type_node, args),
1331 TYPE_RAISES_EXCEPTIONS (type));
1340 mark_vtable_entries (tree decl)
1342 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
1344 for (; entries; entries = TREE_CHAIN (entries))
1346 tree fnaddr = TREE_VALUE (entries);
1349 STRIP_NOPS (fnaddr);
1351 if (TREE_CODE (fnaddr) != ADDR_EXPR
1352 && TREE_CODE (fnaddr) != FDESC_EXPR)
1353 /* This entry is an offset: a virtual base class offset, a
1354 virtual call offset, an RTTI offset, etc. */
1357 fn = TREE_OPERAND (fnaddr, 0);
1358 TREE_ADDRESSABLE (fn) = 1;
1359 /* When we don't have vcall offsets, we output thunks whenever
1360 we output the vtables that contain them. With vcall offsets,
1361 we know all the thunks we'll need when we emit a virtual
1362 function, so we emit the thunks there instead. */
1363 if (DECL_THUNK_P (fn))
1364 use_thunk (fn, /*emit_p=*/0);
1369 /* Set DECL up to have the closest approximation of "initialized common"
1370 linkage available. */
1373 comdat_linkage (tree decl)
1376 make_decl_one_only (decl);
1377 else if (TREE_CODE (decl) == FUNCTION_DECL
1378 || (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)))
1379 /* We can just emit function and compiler-generated variables
1380 statically; having multiple copies is (for the most part) only
1383 There are two correctness issues, however: the address of a
1384 template instantiation with external linkage should be the
1385 same, independent of what translation unit asks for the
1386 address, and this will not hold when we emit multiple copies of
1387 the function. However, there's little else we can do.
1389 Also, by default, the typeinfo implementation assumes that
1390 there will be only one copy of the string used as the name for
1391 each type. Therefore, if weak symbols are unavailable, the
1392 run-time library should perform a more conservative check; it
1393 should perform a string comparison, rather than an address
1395 TREE_PUBLIC (decl) = 0;
1398 /* Static data member template instantiations, however, cannot
1399 have multiple copies. */
1400 if (DECL_INITIAL (decl) == 0
1401 || DECL_INITIAL (decl) == error_mark_node)
1402 DECL_COMMON (decl) = 1;
1403 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
1405 DECL_COMMON (decl) = 1;
1406 DECL_INITIAL (decl) = error_mark_node;
1408 else if (!DECL_EXPLICIT_INSTANTIATION (decl))
1410 /* We can't do anything useful; leave vars for explicit
1412 DECL_EXTERNAL (decl) = 1;
1413 DECL_NOT_REALLY_EXTERN (decl) = 0;
1417 if (DECL_LANG_SPECIFIC (decl))
1418 DECL_COMDAT (decl) = 1;
1421 /* For win32 we also want to put explicit instantiations in
1422 linkonce sections, so that they will be merged with implicit
1423 instantiations; otherwise we get duplicate symbol errors.
1424 For Darwin we do not want explicit instantiations to be
1428 maybe_make_one_only (tree decl)
1430 /* We used to say that this was not necessary on targets that support weak
1431 symbols, because the implicit instantiations will defer to the explicit
1432 one. However, that's not actually the case in SVR4; a strong definition
1433 after a weak one is an error. Also, not making explicit
1434 instantiations one_only means that we can end up with two copies of
1435 some template instantiations. */
1439 /* We can't set DECL_COMDAT on functions, or finish_file will think
1440 we can get away with not emitting them if they aren't used. We need
1441 to for variables so that cp_finish_decl will update their linkage,
1442 because their DECL_INITIAL may not have been set properly yet. */
1444 if (!TARGET_WEAK_NOT_IN_ARCHIVE_TOC
1445 || (! DECL_EXPLICIT_INSTANTIATION (decl)
1446 && ! DECL_TEMPLATE_SPECIALIZATION (decl)))
1448 make_decl_one_only (decl);
1450 if (TREE_CODE (decl) == VAR_DECL)
1452 DECL_COMDAT (decl) = 1;
1453 /* Mark it needed so we don't forget to emit it. */
1454 mark_decl_referenced (decl);
1459 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
1460 based on TYPE and other static flags.
1462 Note that anything public is tagged TREE_PUBLIC, whether
1463 it's public in this file or in another one. */
1466 import_export_vtable (tree decl, tree type, int final)
1468 if (DECL_INTERFACE_KNOWN (decl))
1471 if (TYPE_FOR_JAVA (type))
1473 TREE_PUBLIC (decl) = 1;
1474 DECL_EXTERNAL (decl) = 1;
1475 DECL_INTERFACE_KNOWN (decl) = 1;
1477 else if (CLASSTYPE_INTERFACE_KNOWN (type))
1479 TREE_PUBLIC (decl) = 1;
1480 DECL_EXTERNAL (decl) = CLASSTYPE_INTERFACE_ONLY (type);
1481 DECL_INTERFACE_KNOWN (decl) = 1;
1485 /* We can only wait to decide if we have real non-inline virtual
1486 functions in our class, or if we come from a template. */
1488 int found = (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
1489 || CLASSTYPE_KEY_METHOD (type) != NULL_TREE);
1491 if (final || ! found)
1493 comdat_linkage (decl);
1494 DECL_EXTERNAL (decl) = 0;
1498 TREE_PUBLIC (decl) = 1;
1499 DECL_EXTERNAL (decl) = 1;
1504 /* Determine whether or not we want to specifically import or export CTYPE,
1505 using various heuristics. */
1508 import_export_class (tree ctype)
1510 /* -1 for imported, 1 for exported. */
1511 int import_export = 0;
1513 /* It only makes sense to call this function at EOF. The reason is
1514 that this function looks at whether or not the first non-inline
1515 non-abstract virtual member function has been defined in this
1516 translation unit. But, we can't possibly know that until we've
1517 seen the entire translation unit. */
1518 my_friendly_assert (at_eof, 20000226);
1520 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1523 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
1524 we will have CLASSTYPE_INTERFACE_ONLY set but not
1525 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
1526 heuristic because someone will supply a #pragma implementation
1527 elsewhere, and deducing it here would produce a conflict. */
1528 if (CLASSTYPE_INTERFACE_ONLY (ctype))
1531 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
1533 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
1536 /* If we got -fno-implicit-templates, we import template classes that
1537 weren't explicitly instantiated. */
1538 if (import_export == 0
1539 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
1540 && ! flag_implicit_templates)
1543 /* Base our import/export status on that of the first non-inline,
1544 non-pure virtual function, if any. */
1545 if (import_export == 0
1546 && TYPE_POLYMORPHIC_P (ctype))
1548 tree method = CLASSTYPE_KEY_METHOD (ctype);
1550 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
1553 #ifdef MULTIPLE_SYMBOL_SPACES
1554 if (import_export == -1)
1560 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
1561 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
1565 /* Return true if VAR has already been provided to the back end; in that
1566 case VAR should not be modified further by the front end. */
1568 var_finalized_p (tree var)
1570 if (flag_unit_at_a_time)
1571 return cgraph_varpool_node (var)->finalized;
1573 return TREE_ASM_WRITTEN (var);
1576 /* If necessary, write out the vtables for the dynamic class CTYPE.
1577 Returns true if any vtables were emitted. */
1580 maybe_emit_vtables (tree ctype)
1584 bool needed = false;
1585 bool weaken_vtables;
1587 /* If the vtables for this class have already been emitted there is
1588 nothing more to do. */
1589 primary_vtbl = CLASSTYPE_VTABLES (ctype);
1590 if (var_finalized_p (primary_vtbl))
1592 /* Ignore dummy vtables made by get_vtable_decl. */
1593 if (TREE_TYPE (primary_vtbl) == void_type_node)
1596 import_export_class (ctype);
1597 import_export_vtable (primary_vtbl, ctype, 1);
1599 /* See if any of the vtables are needed. */
1600 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1601 if (!DECL_EXTERNAL (vtbl) && DECL_NEEDED_P (vtbl))
1605 /* If the references to this class' vtables are optimized away,
1606 still emit the appropriate debugging information. See
1608 if (DECL_COMDAT (primary_vtbl)
1609 && CLASSTYPE_DEBUG_REQUESTED (ctype))
1610 note_debug_info_needed (ctype);
1613 else if (TREE_PUBLIC (vtbl) && !DECL_COMDAT (vtbl))
1616 /* Determine whether to make vtables weak. The ABI requires that we
1617 do so. There are two cases in which we have to violate the ABI
1618 specification: targets where we don't have weak symbols
1619 (obviously), and targets where weak symbols don't appear in
1620 static archives' tables of contents. On such targets, avoiding
1621 undefined symbol link errors requires that we only make a symbol
1622 weak if we know that it will be emitted everywhere it's needed.
1623 So on such targets we don't make vtables weak in the common case
1624 where we're emitting a vtable of a nontemplate class in the
1625 translation unit containing the definition of a noninline key
1627 if (flag_weak && !TARGET_WEAK_NOT_IN_ARCHIVE_TOC)
1628 weaken_vtables = true;
1631 if (CLASSTYPE_USE_TEMPLATE (ctype))
1632 weaken_vtables = CLASSTYPE_IMPLICIT_INSTANTIATION (ctype);
1634 weaken_vtables = !CLASSTYPE_KEY_METHOD (ctype)
1635 || DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (ctype));
1638 weaken_vtables = false;
1640 /* The ABI requires that we emit all of the vtables if we emit any
1642 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1645 import_export_vtable (vtbl, ctype, 1);
1646 mark_vtable_entries (vtbl);
1648 /* If we know that DECL is needed, mark it as such for the varpool. */
1650 cgraph_varpool_mark_needed_node (cgraph_varpool_node (vtbl));
1652 if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0)
1654 /* It had better be all done at compile-time. */
1655 if (store_init_value (vtbl, DECL_INITIAL (vtbl)))
1659 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
1661 /* Mark the VAR_DECL node representing the vtable itself as a
1662 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
1663 It is rather important that such things be ignored because
1664 any effort to actually generate DWARF for them will run
1665 into trouble when/if we encounter code like:
1668 struct S { virtual void member (); };
1670 because the artificial declaration of the vtable itself (as
1671 manufactured by the g++ front end) will say that the vtable
1672 is a static member of `S' but only *after* the debug output
1673 for the definition of `S' has already been output. This causes
1674 grief because the DWARF entry for the definition of the vtable
1675 will try to refer back to an earlier *declaration* of the
1676 vtable as a static member of `S' and there won't be one.
1677 We might be able to arrange to have the "vtable static member"
1678 attached to the member list for `S' before the debug info for
1679 `S' get written (which would solve the problem) but that would
1680 require more intrusive changes to the g++ front end. */
1682 DECL_IGNORED_P (vtbl) = 1;
1685 /* Always make vtables weak. Or at least almost always; see above. */
1687 comdat_linkage (vtbl);
1689 rest_of_decl_compilation (vtbl, NULL, 1, 1);
1691 /* Because we're only doing syntax-checking, we'll never end up
1692 actually marking the variable as written. */
1693 if (flag_syntax_only)
1694 TREE_ASM_WRITTEN (vtbl) = 1;
1697 /* Since we're writing out the vtable here, also write the debug
1699 note_debug_info_needed (ctype);
1704 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
1705 inline function or template instantiation at end-of-file. */
1708 import_export_decl (tree decl)
1710 if (DECL_INTERFACE_KNOWN (decl))
1713 if (DECL_TEMPLATE_INSTANTIATION (decl)
1714 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1716 DECL_NOT_REALLY_EXTERN (decl) = 1;
1717 if ((DECL_IMPLICIT_INSTANTIATION (decl)
1718 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1719 && (flag_implicit_templates
1720 || (flag_implicit_inline_templates
1721 && TREE_CODE (decl) == FUNCTION_DECL
1722 && DECL_DECLARED_INLINE_P (decl))))
1724 if (!TREE_PUBLIC (decl))
1725 /* Templates are allowed to have internal linkage. See
1729 comdat_linkage (decl);
1733 DECL_EXTERNAL (decl) = 1;
1734 DECL_NOT_REALLY_EXTERN (decl) = 0;
1737 else if (DECL_FUNCTION_MEMBER_P (decl))
1739 if (!DECL_DECLARED_INLINE_P (decl))
1741 tree ctype = DECL_CONTEXT (decl);
1742 import_export_class (ctype);
1743 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1745 DECL_NOT_REALLY_EXTERN (decl)
1746 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
1747 || (DECL_DECLARED_INLINE_P (decl)
1748 && ! flag_implement_inlines
1749 && !DECL_VINDEX (decl)));
1751 if (!DECL_NOT_REALLY_EXTERN (decl))
1752 DECL_EXTERNAL (decl) = 1;
1754 /* Always make artificials weak. */
1755 if (DECL_ARTIFICIAL (decl) && flag_weak)
1756 comdat_linkage (decl);
1758 maybe_make_one_only (decl);
1762 comdat_linkage (decl);
1765 comdat_linkage (decl);
1767 DECL_INTERFACE_KNOWN (decl) = 1;
1770 /* Here, we only decide whether or not the tinfo node should be
1771 emitted with the vtable. IS_IN_LIBRARY is nonzero iff the
1772 typeinfo for TYPE should be in the runtime library. */
1775 import_export_tinfo (tree decl, tree type, bool is_in_library)
1777 if (DECL_INTERFACE_KNOWN (decl))
1780 if (IS_AGGR_TYPE (type))
1781 import_export_class (type);
1783 if (IS_AGGR_TYPE (type) && CLASSTYPE_INTERFACE_KNOWN (type)
1784 && TYPE_POLYMORPHIC_P (type)
1785 /* If -fno-rtti, we're not necessarily emitting this stuff with
1786 the class, so go ahead and emit it now. This can happen when
1787 a class is used in exception handling. */
1790 DECL_NOT_REALLY_EXTERN (decl) = !CLASSTYPE_INTERFACE_ONLY (type);
1791 DECL_COMDAT (decl) = 0;
1795 DECL_NOT_REALLY_EXTERN (decl) = 1;
1796 DECL_COMDAT (decl) = 1;
1799 /* Now override some cases. */
1801 DECL_COMDAT (decl) = 1;
1802 else if (is_in_library)
1803 DECL_COMDAT (decl) = 0;
1805 DECL_INTERFACE_KNOWN (decl) = 1;
1808 /* Return an expression that performs the destruction of DECL, which
1809 must be a VAR_DECL whose type has a non-trivial destructor, or is
1810 an array whose (innermost) elements have a non-trivial destructor. */
1813 build_cleanup (tree decl)
1816 tree type = TREE_TYPE (decl);
1818 /* This function should only be called for declarations that really
1819 require cleanups. */
1820 my_friendly_assert (!TYPE_HAS_TRIVIAL_DESTRUCTOR (type), 20030106);
1822 /* Treat all objects with destructors as used; the destructor may do
1823 something substantive. */
1826 if (TREE_CODE (type) == ARRAY_TYPE)
1830 cxx_mark_addressable (decl);
1831 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
1833 temp = build_delete (TREE_TYPE (temp), temp,
1834 sfk_complete_destructor,
1835 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
1839 /* Returns the initialization guard variable for the variable DECL,
1840 which has static storage duration. */
1843 get_guard (tree decl)
1848 sname = mangle_guard_variable (decl);
1849 guard = IDENTIFIER_GLOBAL_VALUE (sname);
1854 /* We use a type that is big enough to contain a mutex as well
1855 as an integer counter. */
1856 guard_type = long_long_integer_type_node;
1857 guard = build_decl (VAR_DECL, sname, guard_type);
1859 /* The guard should have the same linkage as what it guards. */
1860 TREE_PUBLIC (guard) = TREE_PUBLIC (decl);
1861 TREE_STATIC (guard) = TREE_STATIC (decl);
1862 DECL_COMMON (guard) = DECL_COMMON (decl);
1863 DECL_ONE_ONLY (guard) = DECL_ONE_ONLY (decl);
1864 if (TREE_PUBLIC (decl))
1865 DECL_WEAK (guard) = DECL_WEAK (decl);
1867 DECL_ARTIFICIAL (guard) = 1;
1868 TREE_USED (guard) = 1;
1869 pushdecl_top_level_and_finish (guard, NULL_TREE);
1874 /* Return those bits of the GUARD variable that should be set when the
1875 guarded entity is actually initialized. */
1878 get_guard_bits (tree guard)
1880 /* We only set the first byte of the guard, in order to leave room
1881 for a mutex in the high-order bits. */
1882 guard = build1 (ADDR_EXPR,
1883 build_pointer_type (TREE_TYPE (guard)),
1885 guard = build1 (NOP_EXPR,
1886 build_pointer_type (char_type_node),
1888 guard = build1 (INDIRECT_REF, char_type_node, guard);
1893 /* Return an expression which determines whether or not the GUARD
1894 variable has already been initialized. */
1897 get_guard_cond (tree guard)
1901 /* Check to see if the GUARD is zero. */
1902 guard = get_guard_bits (guard);
1903 guard_value = integer_zero_node;
1904 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
1905 guard_value = convert (TREE_TYPE (guard), guard_value);
1906 return cp_build_binary_op (EQ_EXPR, guard, guard_value);
1909 /* Return an expression which sets the GUARD variable, indicating that
1910 the variable being guarded has been initialized. */
1913 set_guard (tree guard)
1917 /* Set the GUARD to one. */
1918 guard = get_guard_bits (guard);
1919 guard_init = integer_one_node;
1920 if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard)))
1921 guard_init = convert (TREE_TYPE (guard), guard_init);
1922 return build_modify_expr (guard, NOP_EXPR, guard_init);
1925 /* Start the process of running a particular set of global constructors
1926 or destructors. Subroutine of do_[cd]tors. */
1929 start_objects (int method_type, int initp)
1935 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
1937 if (initp != DEFAULT_INIT_PRIORITY)
1947 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
1950 sprintf (type, "%c", method_type);
1952 fnname = get_file_function_name_long (type);
1954 start_function (void_list_node,
1955 make_call_declarator (fnname, void_list_node, NULL_TREE,
1957 NULL_TREE, SF_DEFAULT);
1959 /* It can be a static function as long as collect2 does not have
1960 to scan the object file to find its ctor/dtor routine. */
1961 TREE_PUBLIC (current_function_decl) = ! targetm.have_ctors_dtors;
1963 /* Mark this declaration as used to avoid spurious warnings. */
1964 TREE_USED (current_function_decl) = 1;
1966 /* Mark this function as a global constructor or destructor. */
1967 if (method_type == 'I')
1968 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
1970 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
1971 DECL_LANG_SPECIFIC (current_function_decl)->decl_flags.u2sel = 1;
1973 body = begin_compound_stmt (BCS_FN_BODY);
1975 /* We cannot allow these functions to be elided, even if they do not
1976 have external linkage. And, there's no point in deferring
1977 compilation of thes functions; they're all going to have to be
1979 DECL_INLINE (current_function_decl) = 0;
1980 DECL_UNINLINABLE (current_function_decl) = 1;
1985 /* Finish the process of running a particular set of global constructors
1986 or destructors. Subroutine of do_[cd]tors. */
1989 finish_objects (int method_type, int initp, tree body)
1994 finish_compound_stmt (body);
1995 fn = finish_function (0);
1996 expand_or_defer_fn (fn);
1998 /* When only doing semantic analysis, and no RTL generation, we
1999 can't call functions that directly emit assembly code; there is
2000 no assembly file in which to put the code. */
2001 if (flag_syntax_only)
2004 if (targetm.have_ctors_dtors)
2006 rtx fnsym = XEXP (DECL_RTL (fn), 0);
2007 if (method_type == 'I')
2008 (* targetm.asm_out.constructor) (fnsym, initp);
2010 (* targetm.asm_out.destructor) (fnsym, initp);
2014 /* The names of the parameters to the function created to handle
2015 initializations and destructions for objects with static storage
2017 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2018 #define PRIORITY_IDENTIFIER "__priority"
2020 /* The name of the function we create to handle initializations and
2021 destructions for objects with static storage duration. */
2022 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2024 /* The declaration for the __INITIALIZE_P argument. */
2025 static GTY(()) tree initialize_p_decl;
2027 /* The declaration for the __PRIORITY argument. */
2028 static GTY(()) tree priority_decl;
2030 /* The declaration for the static storage duration function. */
2031 static GTY(()) tree ssdf_decl;
2033 /* All the static storage duration functions created in this
2034 translation unit. */
2035 static GTY(()) varray_type ssdf_decls;
2037 /* A map from priority levels to information about that priority
2038 level. There may be many such levels, so efficient lookup is
2040 static splay_tree priority_info_map;
2042 /* Begins the generation of the function that will handle all
2043 initialization and destruction of objects with static storage
2044 duration. The function generated takes two parameters of type
2045 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2046 nonzero, it performs initializations. Otherwise, it performs
2047 destructions. It only performs those initializations or
2048 destructions with the indicated __PRIORITY. The generated function
2051 It is assumed that this function will only be called once per
2052 translation unit. */
2055 start_static_storage_duration_function (unsigned count)
2060 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2062 /* Create the identifier for this function. It will be of the form
2063 SSDF_IDENTIFIER_<number>. */
2064 sprintf (id, "%s_%u", SSDF_IDENTIFIER, count);
2066 /* Create the parameters. */
2067 parm_types = void_list_node;
2068 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2069 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2070 type = build_function_type (void_type_node, parm_types);
2072 /* Create the FUNCTION_DECL itself. */
2073 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2074 get_identifier (id),
2076 TREE_PUBLIC (ssdf_decl) = 0;
2077 DECL_ARTIFICIAL (ssdf_decl) = 1;
2079 /* Put this function in the list of functions to be called from the
2080 static constructors and destructors. */
2083 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2085 /* Take this opportunity to initialize the map from priority
2086 numbers to information about that priority level. */
2087 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2088 /*delete_key_fn=*/0,
2089 /*delete_value_fn=*/
2090 (splay_tree_delete_value_fn) &free);
2092 /* We always need to generate functions for the
2093 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2094 priorities later, we'll be sure to find the
2095 DEFAULT_INIT_PRIORITY. */
2096 get_priority_info (DEFAULT_INIT_PRIORITY);
2099 VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl);
2101 /* Create the argument list. */
2102 initialize_p_decl = cp_build_parm_decl
2103 (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node);
2104 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2105 TREE_USED (initialize_p_decl) = 1;
2106 priority_decl = cp_build_parm_decl
2107 (get_identifier (PRIORITY_IDENTIFIER), integer_type_node);
2108 DECL_CONTEXT (priority_decl) = ssdf_decl;
2109 TREE_USED (priority_decl) = 1;
2111 TREE_CHAIN (initialize_p_decl) = priority_decl;
2112 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2114 /* Put the function in the global scope. */
2115 pushdecl (ssdf_decl);
2117 /* Start the function itself. This is equivalent to declaring the
2120 static void __ssdf (int __initialize_p, init __priority_p);
2122 It is static because we only need to call this function from the
2123 various constructor and destructor functions for this module. */
2124 start_function (/*specs=*/NULL_TREE,
2126 /*attrs=*/NULL_TREE,
2129 /* Set up the scope of the outermost block in the function. */
2130 body = begin_compound_stmt (BCS_FN_BODY);
2132 /* This function must not be deferred because we are depending on
2133 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
2134 DECL_INLINE (ssdf_decl) = 0;
2135 DECL_UNINLINABLE (ssdf_decl) = 1;
2140 /* Finish the generation of the function which performs initialization
2141 and destruction of objects with static storage duration. After
2142 this point, no more such objects can be created. */
2145 finish_static_storage_duration_function (tree body)
2147 /* Close out the function. */
2148 finish_compound_stmt (body);
2149 expand_or_defer_fn (finish_function (0));
2152 /* Return the information about the indicated PRIORITY level. If no
2153 code to handle this level has yet been generated, generate the
2154 appropriate prologue. */
2156 static priority_info
2157 get_priority_info (int priority)
2162 n = splay_tree_lookup (priority_info_map,
2163 (splay_tree_key) priority);
2166 /* Create a new priority information structure, and insert it
2168 pi = xmalloc (sizeof (struct priority_info_s));
2169 pi->initializations_p = 0;
2170 pi->destructions_p = 0;
2171 splay_tree_insert (priority_info_map,
2172 (splay_tree_key) priority,
2173 (splay_tree_value) pi);
2176 pi = (priority_info) n->value;
2181 /* Set up to handle the initialization or destruction of DECL. If
2182 INITP is nonzero, we are initializing the variable. Otherwise, we
2183 are destroying it. */
2186 start_static_initialization_or_destruction (tree decl, int initp)
2188 tree guard_if_stmt = NULL_TREE;
2195 /* Figure out the priority for this declaration. */
2196 priority = DECL_INIT_PRIORITY (decl);
2198 priority = DEFAULT_INIT_PRIORITY;
2200 /* Remember that we had an initialization or finalization at this
2202 pi = get_priority_info (priority);
2204 pi->initializations_p = 1;
2206 pi->destructions_p = 1;
2208 /* Trick the compiler into thinking we are at the file and line
2209 where DECL was declared so that error-messages make sense, and so
2210 that the debugger will show somewhat sensible file and line
2212 input_location = DECL_SOURCE_LOCATION (decl);
2218 Access control for implicit calls to the constructors,
2219 the conversion functions, or the destructor called to
2220 create and destroy a static data member is performed as
2221 if these calls appeared in the scope of the member's
2224 we pretend we are in a static member function of the class of
2225 which the DECL is a member. */
2226 if (member_p (decl))
2228 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
2229 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
2232 /* Conditionalize this initialization on being in the right priority
2233 and being initializing/finalizing appropriately. */
2234 guard_if_stmt = begin_if_stmt ();
2235 cond = cp_build_binary_op (EQ_EXPR,
2237 build_int_2 (priority, 0));
2238 init_cond = initp ? integer_one_node : integer_zero_node;
2239 init_cond = cp_build_binary_op (EQ_EXPR,
2242 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
2244 /* Assume we don't need a guard. */
2246 /* We need a guard if this is an object with external linkage that
2247 might be initialized in more than one place. (For example, a
2248 static data member of a template, when the data member requires
2250 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
2251 || DECL_ONE_ONLY (decl)
2252 || DECL_WEAK (decl)))
2256 guard = get_guard (decl);
2258 /* When using __cxa_atexit, we just check the GUARD as we would
2259 for a local static. */
2260 if (flag_use_cxa_atexit)
2262 /* When using __cxa_atexit, we never try to destroy
2263 anything from a static destructor. */
2264 my_friendly_assert (initp, 20000629);
2265 guard_cond = get_guard_cond (guard);
2267 /* If we don't have __cxa_atexit, then we will be running
2268 destructors from .fini sections, or their equivalents. So,
2269 we need to know how many times we've tried to initialize this
2270 object. We do initializations only if the GUARD is zero,
2271 i.e., if we are the first to initialize the variable. We do
2272 destructions only if the GUARD is one, i.e., if we are the
2273 last to destroy the variable. */
2276 = cp_build_binary_op (EQ_EXPR,
2277 build_unary_op (PREINCREMENT_EXPR,
2283 = cp_build_binary_op (EQ_EXPR,
2284 build_unary_op (PREDECREMENT_EXPR,
2289 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, guard_cond);
2292 finish_if_stmt_cond (cond, guard_if_stmt);
2294 /* If we're using __cxa_atexit, we have not already set the GUARD,
2295 so we must do so now. */
2296 if (guard && initp && flag_use_cxa_atexit)
2297 finish_expr_stmt (set_guard (guard));
2299 return guard_if_stmt;
2302 /* We've just finished generating code to do an initialization or
2303 finalization. GUARD_IF_STMT is the if-statement we used to guard
2304 the initialization. */
2307 finish_static_initialization_or_destruction (tree guard_if_stmt)
2309 finish_then_clause (guard_if_stmt);
2310 finish_if_stmt (guard_if_stmt);
2312 /* Now that we're done with DECL we don't need to pretend to be a
2313 member of its class any longer. */
2314 DECL_CONTEXT (current_function_decl) = NULL_TREE;
2315 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
2318 /* Generate code to do the initialization of DECL, a VAR_DECL with
2319 static storage duration. The initialization is INIT. */
2322 do_static_initialization (tree decl, tree init)
2326 /* Set up for the initialization. */
2328 = start_static_initialization_or_destruction (decl,
2331 /* Perform the initialization. */
2333 finish_expr_stmt (init);
2335 /* If we're using __cxa_atexit, register a a function that calls the
2336 destructor for the object. */
2337 if (flag_use_cxa_atexit)
2338 register_dtor_fn (decl);
2341 finish_static_initialization_or_destruction (guard_if_stmt);
2344 /* Generate code to do the static destruction of DECL. If DECL may be
2345 initialized more than once in different object files, GUARD is the
2346 guard variable to check. PRIORITY is the priority for the
2350 do_static_destruction (tree decl)
2354 /* If we're using __cxa_atexit, then destructors are registered
2355 immediately after objects are initialized. */
2356 my_friendly_assert (!flag_use_cxa_atexit, 20000121);
2358 /* If we don't need a destructor, there's nothing to do. */
2359 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2362 /* Actually do the destruction. */
2363 guard_if_stmt = start_static_initialization_or_destruction (decl,
2365 finish_expr_stmt (build_cleanup (decl));
2366 finish_static_initialization_or_destruction (guard_if_stmt);
2369 /* VARS is a list of variables with static storage duration which may
2370 need initialization and/or finalization. Remove those variables
2371 that don't really need to be initialized or finalized, and return
2372 the resulting list. The order in which the variables appear in
2373 VARS is in reverse order of the order in which they should actually
2374 be initialized. The list we return is in the unreversed order;
2375 i.e., the first variable should be initialized first. */
2378 prune_vars_needing_no_initialization (tree *vars)
2381 tree result = NULL_TREE;
2386 tree decl = TREE_VALUE (t);
2387 tree init = TREE_PURPOSE (t);
2389 /* Deal gracefully with error. */
2390 if (decl == error_mark_node)
2392 var = &TREE_CHAIN (t);
2396 /* The only things that can be initialized are variables. */
2397 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
2399 /* If this object is not defined, we don't need to do anything
2401 if (DECL_EXTERNAL (decl))
2403 var = &TREE_CHAIN (t);
2407 /* Also, if the initializer already contains errors, we can bail
2409 if (init && TREE_CODE (init) == TREE_LIST
2410 && value_member (error_mark_node, init))
2412 var = &TREE_CHAIN (t);
2416 /* This variable is going to need initialization and/or
2417 finalization, so we add it to the list. */
2418 *var = TREE_CHAIN (t);
2419 TREE_CHAIN (t) = result;
2426 /* Make sure we have told the back end about all the variables in
2430 write_out_vars (tree vars)
2434 for (v = vars; v; v = TREE_CHAIN (v))
2435 if (!var_finalized_p (TREE_VALUE (v)))
2436 rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1);
2439 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
2440 (otherwise) that will initialize all gobal objects with static
2441 storage duration having the indicated PRIORITY. */
2444 generate_ctor_or_dtor_function (bool constructor_p, int priority,
2453 input_location = *locus;
2456 /* We use `I' to indicate initialization and `D' to indicate
2458 function_key = constructor_p ? 'I' : 'D';
2460 /* We emit the function lazily, to avoid generating empty
2461 global constructors and destructors. */
2464 /* Call the static storage duration function with appropriate
2467 for (i = 0; i < ssdf_decls->elements_used; ++i)
2469 fndecl = VARRAY_TREE (ssdf_decls, i);
2471 /* Calls to pure or const functions will expand to nothing. */
2472 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2475 body = start_objects (function_key, priority);
2477 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
2479 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
2481 finish_expr_stmt (build_function_call (fndecl, arguments));
2485 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
2486 calls to any functions marked with attributes indicating that
2487 they should be called at initialization- or destruction-time. */
2488 if (priority == DEFAULT_INIT_PRIORITY)
2492 for (fns = constructor_p ? static_ctors : static_dtors;
2494 fns = TREE_CHAIN (fns))
2496 fndecl = TREE_VALUE (fns);
2498 /* Calls to pure/const functions will expand to nothing. */
2499 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2502 body = start_objects (function_key, priority);
2503 finish_expr_stmt (build_function_call (fndecl, NULL_TREE));
2508 /* Close out the function. */
2510 finish_objects (function_key, priority, body);
2513 /* Generate constructor and destructor functions for the priority
2517 generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data)
2519 location_t *locus = data;
2520 int priority = (int) n->key;
2521 priority_info pi = (priority_info) n->value;
2523 /* Generate the functions themselves, but only if they are really
2525 if (pi->initializations_p
2526 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
2527 generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus);
2528 if (pi->destructions_p
2529 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
2530 generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus);
2532 /* Keep iterating. */
2536 /* Called via LANGHOOK_CALLGRAPH_ANALYZE_EXPR. It is supposed to mark
2537 decls referenced from frontend specific constructs; it will be called
2538 only for language-specific tree nodes.
2540 Here we must deal with member pointers. */
2543 cxx_callgraph_analyze_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2544 tree from ATTRIBUTE_UNUSED)
2548 if (flag_unit_at_a_time)
2549 switch (TREE_CODE (t))
2552 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
2553 cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t)));
2556 if (TREE_CODE (BASELINK_FUNCTIONS (t)) == FUNCTION_DECL)
2557 cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t)));
2567 /* This routine is called from the last rule in yyparse ().
2568 Its job is to create all the code needed to initialize and
2569 destroy the global aggregates. We do the destruction
2570 first, since that way we only need to reverse the decls once. */
2579 unsigned ssdf_count = 0;
2581 locus = input_location;
2584 /* Bad parse errors. Just forget about it. */
2585 if (! global_bindings_p () || current_class_type || decl_namespace_list)
2589 c_common_write_pch ();
2591 /* Otherwise, GDB can get confused, because in only knows
2592 about source for LINENO-1 lines. */
2595 interface_unknown = 1;
2598 /* We now have to write out all the stuff we put off writing out.
2601 o Template specializations that we have not yet instantiated,
2602 but which are needed.
2603 o Initialization and destruction for non-local objects with
2604 static storage duration. (Local objects with static storage
2605 duration are initialized when their scope is first entered,
2606 and are cleaned up via atexit.)
2607 o Virtual function tables.
2609 All of these may cause others to be needed. For example,
2610 instantiating one function may cause another to be needed, and
2611 generating the initializer for an object may cause templates to be
2612 instantiated, etc., etc. */
2614 timevar_push (TV_VARCONST);
2616 emit_support_tinfos ();
2621 size_t n_old, n_new;
2625 /* If there are templates that we've put off instantiating, do
2627 instantiate_pending_templates ();
2630 /* Write out virtual tables as required. Note that writing out
2631 the virtual table for a template class may cause the
2632 instantiation of members of that class. If we write out
2633 vtables then we remove the class from our list so we don't
2634 have to look at it again. */
2636 while (keyed_classes != NULL_TREE
2637 && maybe_emit_vtables (TREE_VALUE (keyed_classes)))
2640 keyed_classes = TREE_CHAIN (keyed_classes);
2646 tree next = TREE_CHAIN (t);
2650 if (maybe_emit_vtables (TREE_VALUE (next)))
2653 TREE_CHAIN (t) = TREE_CHAIN (next);
2658 next = TREE_CHAIN (t);
2662 /* Write out needed type info variables. We have to be careful
2663 looping through unemitted decls, because emit_tinfo_decl may
2664 cause other variables to be needed. We stick new elements
2665 (and old elements that we may need to reconsider) at the end
2666 of the array, then shift them back to the beginning once we're
2669 n_old = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls);
2670 for (i = 0; i < n_old; ++i)
2672 tree tinfo_decl = VARRAY_TREE (unemitted_tinfo_decls, i);
2673 if (emit_tinfo_decl (tinfo_decl))
2676 VARRAY_PUSH_TREE (unemitted_tinfo_decls, tinfo_decl);
2679 /* The only elements we want to keep are the new ones. Copy
2680 them to the beginning of the array, then get rid of the
2682 n_new = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) - n_old;
2684 memmove (&VARRAY_TREE (unemitted_tinfo_decls, 0),
2685 &VARRAY_TREE (unemitted_tinfo_decls, n_old),
2686 n_new * sizeof (tree));
2687 memset (&VARRAY_TREE (unemitted_tinfo_decls, n_new),
2688 0, n_old * sizeof (tree));
2689 VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) = n_new;
2691 /* The list of objects with static storage duration is built up
2692 in reverse order. We clear STATIC_AGGREGATES so that any new
2693 aggregates added during the initialization of these will be
2694 initialized in the correct order when we next come around the
2696 vars = prune_vars_needing_no_initialization (&static_aggregates);
2702 /* We need to start a new initialization function each time
2703 through the loop. That's because we need to know which
2704 vtables have been referenced, and TREE_SYMBOL_REFERENCED
2705 isn't computed until a function is finished, and written
2706 out. That's a deficiency in the back-end. When this is
2707 fixed, these initialization functions could all become
2708 inline, with resulting performance improvements. */
2711 /* Set the line and file, so that it is obviously not from
2713 input_location = locus;
2714 ssdf_body = start_static_storage_duration_function (ssdf_count);
2716 /* Make sure the back end knows about all the variables. */
2717 write_out_vars (vars);
2719 /* First generate code to do all the initializations. */
2720 for (v = vars; v; v = TREE_CHAIN (v))
2721 do_static_initialization (TREE_VALUE (v),
2724 /* Then, generate code to do all the destructions. Do these
2725 in reverse order so that the most recently constructed
2726 variable is the first destroyed. If we're using
2727 __cxa_atexit, then we don't need to do this; functions
2728 were registered at initialization time to destroy the
2730 if (!flag_use_cxa_atexit)
2732 vars = nreverse (vars);
2733 for (v = vars; v; v = TREE_CHAIN (v))
2734 do_static_destruction (TREE_VALUE (v));
2739 /* Finish up the static storage duration function for this
2741 input_location = locus;
2742 finish_static_storage_duration_function (ssdf_body);
2744 /* All those initializations and finalizations might cause
2745 us to need more inline functions, more template
2746 instantiations, etc. */
2752 for (i = 0; i < deferred_fns_used; ++i)
2754 tree decl = VARRAY_TREE (deferred_fns, i);
2756 /* Does it need synthesizing? */
2757 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
2759 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
2761 /* Even though we're already at the top-level, we push
2762 there again. That way, when we pop back a few lines
2763 hence, all of our state is restored. Otherwise,
2764 finish_function doesn't clean things up, and we end
2765 up with CURRENT_FUNCTION_DECL set. */
2766 push_to_top_level ();
2767 synthesize_method (decl);
2768 pop_from_top_level ();
2772 /* If the function has no body, avoid calling
2773 import_export_decl. On a system without weak symbols,
2774 calling import_export_decl will make an inline template
2775 instantiation "static", which will result in errors about
2776 the use of undefined functions if there is no body for
2777 the function. In fact, all the functions in this list
2778 *should* have a body. */
2779 if (!DECL_SAVED_TREE (decl))
2781 if (! DECL_DECLARED_INLINE_P (decl) || ! TREE_USED (decl))
2786 import_export_decl (decl);
2788 /* We lie to the back-end, pretending that some functions
2789 are not defined when they really are. This keeps these
2790 functions from being put out unnecessarily. But, we must
2791 stop lying when the functions are referenced, or if they
2792 are not comdat since they need to be put out now. This
2793 is done in a separate for cycle, because if some deferred
2794 function is contained in another deferred function later
2795 in deferred_fns varray, rest_of_compilation would skip
2796 this function and we really cannot expand the same
2798 if (DECL_NOT_REALLY_EXTERN (decl)
2799 && DECL_INITIAL (decl)
2800 && DECL_NEEDED_P (decl))
2801 DECL_EXTERNAL (decl) = 0;
2803 /* If we're going to need to write this function out, and
2804 there's already a body for it, create RTL for it now.
2805 (There might be no body if this is a method we haven't
2806 gotten around to synthesizing yet.) */
2807 if (!DECL_EXTERNAL (decl)
2808 && DECL_NEEDED_P (decl)
2809 && !TREE_ASM_WRITTEN (decl)
2810 && (!flag_unit_at_a_time
2811 || !cgraph_node (decl)->local.finalized))
2813 /* We will output the function; no longer consider it in this
2815 DECL_DEFER_OUTPUT (decl) = 0;
2816 /* Generate RTL for this function now that we know we
2818 expand_or_defer_fn (decl);
2819 /* If we're compiling -fsyntax-only pretend that this
2820 function has been written out so that we don't try to
2822 if (flag_syntax_only)
2823 TREE_ASM_WRITTEN (decl) = 1;
2828 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
2831 /* Static data members are just like namespace-scope globals. */
2832 for (i = 0; i < pending_statics_used; ++i)
2834 tree decl = VARRAY_TREE (pending_statics, i);
2835 if (var_finalized_p (decl))
2837 import_export_decl (decl);
2838 if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
2839 DECL_EXTERNAL (decl) = 0;
2842 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
2843 pending_statics_used))
2846 if (cgraph_assemble_pending_functions ())
2851 /* All used inline functions must have a definition at this point. */
2852 for (i = 0; i < deferred_fns_used; ++i)
2854 tree decl = VARRAY_TREE (deferred_fns, i);
2856 if (TREE_USED (decl) && DECL_DECLARED_INLINE_P (decl)
2857 && !(TREE_ASM_WRITTEN (decl) || DECL_SAVED_TREE (decl)
2858 /* An explicit instantiation can be used to specify
2859 that the body is in another unit. It will have
2860 already verified there was a definition. */
2861 || DECL_EXPLICIT_INSTANTIATION (decl)))
2863 cp_warning_at ("inline function `%D' used but never defined", decl);
2864 /* This symbol is effectively an "extern" declaration now.
2865 This is not strictly necessary, but removes a duplicate
2867 TREE_PUBLIC (decl) = 1;
2872 /* We give C linkage to static constructors and destructors. */
2873 push_lang_context (lang_name_c);
2875 /* Generate initialization and destruction functions for all
2876 priorities for which they are required. */
2877 if (priority_info_map)
2878 splay_tree_foreach (priority_info_map,
2879 generate_ctor_and_dtor_functions_for_priority,
2885 generate_ctor_or_dtor_function (/*constructor_p=*/true,
2886 DEFAULT_INIT_PRIORITY, &locus);
2888 generate_ctor_or_dtor_function (/*constructor_p=*/false,
2889 DEFAULT_INIT_PRIORITY, &locus);
2892 /* We're done with the splay-tree now. */
2893 if (priority_info_map)
2894 splay_tree_delete (priority_info_map);
2896 /* We're done with static constructors, so we can go back to "C++"
2898 pop_lang_context ();
2900 if (flag_unit_at_a_time)
2902 cgraph_finalize_compilation_unit ();
2906 /* Emit mudflap static registration function. This must be done
2907 after all the user functions have been expanded. */
2909 mudflap_finish_file ();
2911 /* Now, issue warnings about static, but not defined, functions,
2912 etc., and emit debugging information. */
2913 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
2914 if (pending_statics)
2915 check_global_declarations (&VARRAY_TREE (pending_statics, 0),
2916 pending_statics_used);
2920 /* The entire file is now complete. If requested, dump everything
2924 FILE *stream = dump_begin (TDI_tu, &flags);
2928 dump_node (global_namespace, flags & ~TDF_SLIM, stream);
2929 dump_end (TDI_tu, stream);
2933 timevar_pop (TV_VARCONST);
2935 if (flag_detailed_statistics)
2937 dump_tree_statistics ();
2938 dump_time_statistics ();
2940 input_location = locus;
2942 #ifdef ENABLE_CHECKING
2943 validate_conversion_obstack ();
2944 #endif /* ENABLE_CHECKING */
2947 /* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the
2948 function to call in parse-tree form; it has not yet been
2949 semantically analyzed. ARGS are the arguments to the function.
2950 They have already been semantically analyzed. */
2953 build_offset_ref_call_from_tree (tree fn, tree args)
2962 object = TREE_OPERAND (fn, 0);
2964 if (processing_template_decl)
2966 my_friendly_assert (TREE_CODE (fn) == DOTSTAR_EXPR
2967 || TREE_CODE (fn) == MEMBER_REF,
2969 if (type_dependent_expression_p (fn)
2970 || any_type_dependent_arguments_p (args))
2971 return build_min_nt (CALL_EXPR, fn, args, NULL_TREE);
2973 /* Transform the arguments and add the implicit "this"
2974 parameter. That must be done before the FN is transformed
2975 because we depend on the form of FN. */
2976 args = build_non_dependent_args (args);
2977 if (TREE_CODE (fn) == DOTSTAR_EXPR)
2978 object = build_unary_op (ADDR_EXPR, object, 0);
2979 object = build_non_dependent_expr (object);
2980 args = tree_cons (NULL_TREE, object, args);
2981 /* Now that the arguments are done, transform FN. */
2982 fn = build_non_dependent_expr (fn);
2985 /* A qualified name corresponding to a bound pointer-to-member is
2986 represented as an OFFSET_REF:
2988 struct B { void g(); };
2990 void B::g() { (this->*p)(); } */
2991 if (TREE_CODE (fn) == OFFSET_REF)
2993 tree object_addr = build_unary_op (ADDR_EXPR, object, 0);
2994 fn = TREE_OPERAND (fn, 1);
2995 fn = get_member_function_from_ptrfunc (&object_addr, fn);
2996 args = tree_cons (NULL_TREE, object_addr, args);
2999 expr = build_function_call (fn, args);
3000 if (processing_template_decl && expr != error_mark_node)
3001 return build_min_non_dep (CALL_EXPR, expr, orig_fn, orig_args, NULL_TREE);
3007 check_default_args (tree x)
3009 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
3010 bool saw_def = false;
3011 int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
3012 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
3014 if (TREE_PURPOSE (arg))
3018 cp_error_at ("default argument missing for parameter %P of `%+#D'",
3026 mark_used (tree decl)
3028 TREE_USED (decl) = 1;
3029 if (processing_template_decl || skip_evaluation)
3032 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl)
3033 && !TREE_ASM_WRITTEN (decl))
3034 /* Remember it, so we can check it was defined. */
3037 assemble_external (decl);
3039 /* Is it a synthesized method that needs to be synthesized? */
3040 if (TREE_CODE (decl) == FUNCTION_DECL
3041 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
3042 && DECL_ARTIFICIAL (decl)
3043 && !DECL_THUNK_P (decl)
3044 && ! DECL_INITIAL (decl)
3045 /* Kludge: don't synthesize for default args. */
3046 && current_function_decl)
3048 synthesize_method (decl);
3049 /* If we've already synthesized the method we don't need to
3050 instantiate it, so we can return right away. */
3054 /* If this is a function or variable that is an instance of some
3055 template, we now know that we will need to actually do the
3056 instantiation. We check that DECL is not an explicit
3057 instantiation because that is not checked in instantiate_decl. */
3058 if ((DECL_NON_THUNK_FUNCTION_P (decl) || TREE_CODE (decl) == VAR_DECL)
3059 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
3060 && (!DECL_EXPLICIT_INSTANTIATION (decl)
3061 || (TREE_CODE (decl) == FUNCTION_DECL
3062 && DECL_INLINE (DECL_TEMPLATE_RESULT
3063 (template_for_substitution (decl))))))
3067 /* Normally, we put off instantiating functions in order to
3068 improve compile times. Maintaining a stack of active
3069 functions is expensive, and the inliner knows to
3070 instantiate any functions it might need.
3072 However, if instantiating this function might help us mark
3073 the current function TREE_NOTHROW, we go ahead and
3076 This is not needed for unit-at-a-time since we reorder the functions
3077 in topological order anyway.
3079 defer = (!flag_exceptions
3080 || flag_unit_at_a_time
3082 || TREE_CODE (decl) != FUNCTION_DECL
3083 /* If the called function can't throw, we don't need to
3084 generate its body to find that out. */
3085 || TREE_NOTHROW (decl)
3087 || !current_function_decl
3088 /* If we already know the current function can't throw,
3089 then we don't need to work hard to prove it. */
3090 || TREE_NOTHROW (current_function_decl)
3091 /* If we already know that the current function *can*
3092 throw, there's no point in gathering more
3094 || cp_function_chain->can_throw);
3096 instantiate_decl (decl, defer, /*undefined_ok=*/0);
3100 #include "gt-cp-decl2.h"