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"
50 #include "tree-inline.h"
51 extern cpp_reader *parse_in;
53 /* This structure contains information about the initializations
54 and/or destructions required for a particular priority level. */
55 typedef struct priority_info_s {
56 /* Nonzero if there have been any initializations at this priority
57 throughout the translation unit. */
58 int initializations_p;
59 /* Nonzero if there have been any destructions at this priority
60 throughout the translation unit. */
64 static void mark_vtable_entries (tree);
65 static void grok_function_init (tree, tree);
66 static bool maybe_emit_vtables (tree);
67 static tree build_anon_union_vars (tree);
68 static bool acceptable_java_type (tree);
69 static tree start_objects (int, int);
70 static void finish_objects (int, int, tree);
71 static tree start_static_storage_duration_function (unsigned);
72 static void finish_static_storage_duration_function (tree);
73 static priority_info get_priority_info (int);
74 static void do_static_initialization (tree, tree);
75 static void do_static_destruction (tree);
76 static tree start_static_initialization_or_destruction (tree, int);
77 static void finish_static_initialization_or_destruction (tree);
78 static void generate_ctor_or_dtor_function (bool, int, location_t *);
79 static int generate_ctor_and_dtor_functions_for_priority (splay_tree_node,
81 static tree prune_vars_needing_no_initialization (tree *);
82 static void write_out_vars (tree);
83 static void import_export_class (tree);
84 static tree get_guard_bits (tree);
86 /* A list of static class variables. This is needed, because a
87 static class variable can be declared inside the class without
88 an initializer, and then initialized, statically, outside the class. */
89 static GTY(()) varray_type pending_statics;
90 #define pending_statics_used \
91 (pending_statics ? pending_statics->elements_used : 0)
93 /* A list of functions which were declared inline, but which we
94 may need to emit outline anyway. */
95 static GTY(()) varray_type deferred_fns;
96 #define deferred_fns_used \
97 (deferred_fns ? deferred_fns->elements_used : 0)
99 /* Flag used when debugging spew.c */
101 extern int spew_debug;
103 /* Nonzero if we're done parsing and into end-of-file activities. */
107 /* Functions called along with real static constructors and destructors. */
113 /* Incorporate `const' and `volatile' qualifiers for member functions.
114 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
115 QUALS is a list of qualifiers. Returns any explicit
116 top-level qualifiers of the method's this pointer, anything other than
117 TYPE_UNQUALIFIED will be an extension. */
120 grok_method_quals (tree ctype, tree function, tree quals)
122 tree fntype = TREE_TYPE (function);
123 tree raises = TYPE_RAISES_EXCEPTIONS (fntype);
124 int type_quals = TYPE_UNQUALIFIED;
125 int dup_quals = TYPE_UNQUALIFIED;
126 int this_quals = TYPE_UNQUALIFIED;
130 int tq = cp_type_qual_from_rid (TREE_VALUE (quals));
132 if ((type_quals | this_quals) & tq)
134 else if (tq & TYPE_QUAL_RESTRICT)
138 quals = TREE_CHAIN (quals);
142 if (dup_quals != TYPE_UNQUALIFIED)
143 error ("duplicate type qualifiers in %s declaration",
144 TREE_CODE (function) == FUNCTION_DECL
145 ? "member function" : "type");
147 ctype = cp_build_qualified_type (ctype, type_quals);
148 fntype = build_method_type_directly (ctype, TREE_TYPE (fntype),
149 (TREE_CODE (fntype) == METHOD_TYPE
150 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
151 : TYPE_ARG_TYPES (fntype)));
153 fntype = build_exception_variant (fntype, raises);
155 TREE_TYPE (function) = fntype;
159 /* A subroutine of the parser, to handle a component list. */
162 grok_x_components (tree specs)
166 specs = strip_attrs (specs);
168 check_tag_decl (specs);
169 t = groktypename (build_tree_list (specs, NULL_TREE));
171 /* The only case where we need to do anything additional here is an
172 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
173 if (t == NULL_TREE || !ANON_AGGR_TYPE_P (t))
176 fixup_anonymous_aggr (t);
177 finish_member_declaration (build_decl (FIELD_DECL, NULL_TREE, t));
180 /* Build a PARM_DECL with NAME and TYPE, and set DECL_ARG_TYPE
184 cp_build_parm_decl (tree name, tree type)
186 tree parm = build_decl (PARM_DECL, name, type);
187 /* DECL_ARG_TYPE is only used by the back end and the back end never
189 if (!processing_template_decl)
190 DECL_ARG_TYPE (parm) = type_passed_as (type);
194 /* Returns a PARM_DECL for a parameter of the indicated TYPE, with the
198 build_artificial_parm (tree name, tree type)
200 tree parm = cp_build_parm_decl (name, type);
201 DECL_ARTIFICIAL (parm) = 1;
202 /* All our artificial parms are implicitly `const'; they cannot be
204 TREE_READONLY (parm) = 1;
208 /* Constructors for types with virtual baseclasses need an "in-charge" flag
209 saying whether this constructor is responsible for initialization of
210 virtual baseclasses or not. All destructors also need this "in-charge"
211 flag, which additionally determines whether or not the destructor should
212 free the memory for the object.
214 This function adds the "in-charge" flag to member function FN if
215 appropriate. It is called from grokclassfn and tsubst.
216 FN must be either a constructor or destructor.
218 The in-charge flag follows the 'this' parameter, and is followed by the
219 VTT parm (if any), then the user-written parms. */
222 maybe_retrofit_in_chrg (tree fn)
224 tree basetype, arg_types, parms, parm, fntype;
226 /* If we've already add the in-charge parameter don't do it again. */
227 if (DECL_HAS_IN_CHARGE_PARM_P (fn))
230 /* When processing templates we can't know, in general, whether or
231 not we're going to have virtual baseclasses. */
232 if (processing_template_decl)
235 /* We don't need an in-charge parameter for constructors that don't
236 have virtual bases. */
237 if (DECL_CONSTRUCTOR_P (fn)
238 && !TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn)))
241 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
242 basetype = TREE_TYPE (TREE_VALUE (arg_types));
243 arg_types = TREE_CHAIN (arg_types);
245 parms = TREE_CHAIN (DECL_ARGUMENTS (fn));
247 /* If this is a subobject constructor or destructor, our caller will
248 pass us a pointer to our VTT. */
249 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn)))
251 parm = build_artificial_parm (vtt_parm_identifier, vtt_parm_type);
253 /* First add it to DECL_ARGUMENTS between 'this' and the real args... */
254 TREE_CHAIN (parm) = parms;
257 /* ...and then to TYPE_ARG_TYPES. */
258 arg_types = hash_tree_chain (vtt_parm_type, arg_types);
260 DECL_HAS_VTT_PARM_P (fn) = 1;
263 /* Then add the in-charge parm (before the VTT parm). */
264 parm = build_artificial_parm (in_charge_identifier, integer_type_node);
265 TREE_CHAIN (parm) = parms;
267 arg_types = hash_tree_chain (integer_type_node, arg_types);
269 /* Insert our new parameter(s) into the list. */
270 TREE_CHAIN (DECL_ARGUMENTS (fn)) = parms;
272 /* And rebuild the function type. */
273 fntype = build_method_type_directly (basetype, TREE_TYPE (TREE_TYPE (fn)),
275 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
276 fntype = build_exception_variant (fntype,
277 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
278 TREE_TYPE (fn) = fntype;
280 /* Now we've got the in-charge parameter. */
281 DECL_HAS_IN_CHARGE_PARM_P (fn) = 1;
284 /* Classes overload their constituent function names automatically.
285 When a function name is declared in a record structure,
286 its name is changed to it overloaded name. Since names for
287 constructors and destructors can conflict, we place a leading
290 CNAME is the name of the class we are grokking for.
292 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
294 FLAGS contains bits saying what's special about today's
295 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
297 If FUNCTION is a destructor, then we must add the `auto-delete' field
298 as a second parameter. There is some hair associated with the fact
299 that we must "declare" this variable in the manner consistent with the
300 way the rest of the arguments were declared.
302 QUALS are the qualifiers for the this pointer. */
305 grokclassfn (tree ctype, tree function, enum overload_flags flags, tree quals)
307 tree fn_name = DECL_NAME (function);
308 int this_quals = TYPE_UNQUALIFIED;
310 /* Even within an `extern "C"' block, members get C++ linkage. See
311 [dcl.link] for details. */
312 SET_DECL_LANGUAGE (function, lang_cplusplus);
314 if (fn_name == NULL_TREE)
316 error ("name missing for member function");
317 fn_name = get_identifier ("<anonymous>");
318 DECL_NAME (function) = fn_name;
322 this_quals = grok_method_quals (ctype, function, quals);
324 if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
326 /* Must add the class instance variable up front. */
327 /* Right now we just make this a pointer. But later
328 we may wish to make it special. */
329 tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function)));
333 /* The `this' parameter is implicitly `const'; it cannot be
335 this_quals |= TYPE_QUAL_CONST;
336 qual_type = cp_build_qualified_type (type, this_quals);
337 parm = build_artificial_parm (this_identifier, qual_type);
338 c_apply_type_quals_to_decl (this_quals, parm);
339 TREE_CHAIN (parm) = last_function_parms;
340 last_function_parms = parm;
343 DECL_ARGUMENTS (function) = last_function_parms;
344 DECL_CONTEXT (function) = ctype;
346 if (flags == DTOR_FLAG)
347 DECL_DESTRUCTOR_P (function) = 1;
349 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
350 maybe_retrofit_in_chrg (function);
353 /* Create an ARRAY_REF, checking for the user doing things backwards
357 grok_array_decl (tree array_expr, tree index_exp)
361 tree orig_array_expr = array_expr;
362 tree orig_index_exp = index_exp;
364 if (error_operand_p (array_expr) || error_operand_p (index_exp))
365 return error_mark_node;
367 if (processing_template_decl)
369 if (type_dependent_expression_p (array_expr)
370 || type_dependent_expression_p (index_exp))
371 return build_min_nt (ARRAY_REF, array_expr, index_exp);
372 array_expr = build_non_dependent_expr (array_expr);
373 index_exp = build_non_dependent_expr (index_exp);
376 type = TREE_TYPE (array_expr);
377 my_friendly_assert (type, 20030626);
378 type = non_reference (type);
380 /* If they have an `operator[]', use that. */
381 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
382 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL,
383 array_expr, index_exp, NULL_TREE);
388 /* Otherwise, create an ARRAY_REF for a pointer or array type.
389 It is a little-known fact that, if `a' is an array and `i' is
390 an int, you can write `i[a]', which means the same thing as
392 if (TREE_CODE (type) == ARRAY_TYPE)
395 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, false);
397 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
400 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, false);
402 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr,
404 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp,
407 if ((p1 && i2) && (i1 && p2))
408 error ("ambiguous conversion for array subscript");
411 array_expr = p1, index_exp = i2;
413 array_expr = p2, index_exp = i1;
416 error ("invalid types `%T[%T]' for array subscript",
417 type, TREE_TYPE (index_exp));
418 return error_mark_node;
421 if (array_expr == error_mark_node || index_exp == error_mark_node)
422 error ("ambiguous conversion for array subscript");
424 expr = build_array_ref (array_expr, index_exp);
426 if (processing_template_decl && expr != error_mark_node)
427 return build_min_non_dep (ARRAY_REF, expr,
428 orig_array_expr, orig_index_exp);
432 /* Given the cast expression EXP, checking out its validity. Either return
433 an error_mark_node if there was an unavoidable error, return a cast to
434 void for trying to delete a pointer w/ the value 0, or return the
435 call to delete. If DOING_VEC is true, we handle things differently
436 for doing an array delete.
437 Implements ARM $5.3.4. This is called from the parser. */
440 delete_sanity (tree exp, tree size, bool doing_vec, int use_global_delete)
444 if (exp == error_mark_node)
447 if (processing_template_decl)
449 t = build_min (DELETE_EXPR, void_type_node, exp, size);
450 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
451 DELETE_EXPR_USE_VEC (t) = doing_vec;
455 exp = convert_from_reference (exp);
457 /* An array can't have been allocated by new, so complain. */
458 if (TREE_CODE (exp) == VAR_DECL
459 && TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
460 warning ("deleting array `%#D'", exp);
462 t = build_expr_type_conversion (WANT_POINTER, exp, true);
464 if (t == NULL_TREE || t == error_mark_node)
466 error ("type `%#T' argument given to `delete', expected pointer",
468 return error_mark_node;
471 type = TREE_TYPE (t);
473 /* As of Valley Forge, you can delete a pointer to const. */
475 /* You can't delete functions. */
476 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
478 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
479 return error_mark_node;
482 /* Deleting ptr to void is undefined behavior [expr.delete/3]. */
483 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
485 warning ("deleting `%T' is undefined", type);
489 /* Deleting a pointer with the value zero is valid and has no effect. */
490 if (integer_zerop (t))
491 return build1 (NOP_EXPR, void_type_node, t);
494 return build_vec_delete (t, /*maxindex=*/NULL_TREE,
495 sfk_deleting_destructor,
498 return build_delete (type, t, sfk_deleting_destructor,
499 LOOKUP_NORMAL, use_global_delete);
502 /* Report an error if the indicated template declaration is not the
503 sort of thing that should be a member template. */
506 check_member_template (tree tmpl)
510 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
511 decl = DECL_TEMPLATE_RESULT (tmpl);
513 if (TREE_CODE (decl) == FUNCTION_DECL
514 || (TREE_CODE (decl) == TYPE_DECL
515 && IS_AGGR_TYPE (TREE_TYPE (decl))))
517 if (current_function_decl)
518 /* 14.5.2.2 [temp.mem]
520 A local class shall not have member templates. */
521 error ("invalid declaration of member template `%#D' in local class",
524 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
526 /* 14.5.2.3 [temp.mem]
528 A member function template shall not be virtual. */
530 ("invalid use of `virtual' in template declaration of `%#D'",
532 DECL_VIRTUAL_P (decl) = 0;
535 /* The debug-information generating code doesn't know what to do
536 with member templates. */
537 DECL_IGNORED_P (tmpl) = 1;
540 error ("template declaration of `%#D'", decl);
543 /* Return true iff TYPE is a valid Java parameter or return type. */
546 acceptable_java_type (tree type)
548 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
550 if (TREE_CODE (type) == POINTER_TYPE || TREE_CODE (type) == REFERENCE_TYPE)
552 type = TREE_TYPE (type);
553 if (TREE_CODE (type) == RECORD_TYPE)
556 if (! TYPE_FOR_JAVA (type))
558 if (! CLASSTYPE_TEMPLATE_INFO (type))
560 args = CLASSTYPE_TI_ARGS (type);
561 i = TREE_VEC_LENGTH (args);
564 type = TREE_VEC_ELT (args, i);
565 if (TREE_CODE (type) == POINTER_TYPE)
566 type = TREE_TYPE (type);
567 if (! TYPE_FOR_JAVA (type))
576 /* For a METHOD in a Java class CTYPE, return true if
577 the parameter and return types are valid Java types.
578 Otherwise, print appropriate error messages, and return false. */
581 check_java_method (tree method)
584 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
585 tree ret_type = TREE_TYPE (TREE_TYPE (method));
587 if (!acceptable_java_type (ret_type))
589 error ("Java method '%D' has non-Java return type `%T'",
594 arg_types = TREE_CHAIN (arg_types);
595 if (DECL_HAS_IN_CHARGE_PARM_P (method))
596 arg_types = TREE_CHAIN (arg_types);
597 if (DECL_HAS_VTT_PARM_P (method))
598 arg_types = TREE_CHAIN (arg_types);
600 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
602 tree type = TREE_VALUE (arg_types);
603 if (!acceptable_java_type (type))
605 error ("Java method '%D' has non-Java parameter type `%T'",
613 /* Sanity check: report error if this function FUNCTION is not
614 really a member of the class (CTYPE) it is supposed to belong to.
615 CNAME is the same here as it is for grokclassfn above.
616 TEMPLATE_HEADER_P is true when this declaration comes with a
620 check_classfn (tree ctype, tree function, bool template_header_p)
625 if (DECL_USE_TEMPLATE (function)
626 && !(TREE_CODE (function) == TEMPLATE_DECL
627 && DECL_TEMPLATE_SPECIALIZATION (function))
628 && is_member_template (DECL_TI_TEMPLATE (function)))
629 /* Since this is a specialization of a member template,
630 we're not going to find the declaration in the class.
633 struct S { template <typename T> void f(T); };
634 template <> void S::f(int);
636 we're not going to find `S::f(int)', but there's no
637 reason we should, either. We let our callers know we didn't
638 find the method, but we don't complain. */
641 /* OK, is this a definition of a member template? */
642 is_template = (TREE_CODE (function) == TEMPLATE_DECL
643 || template_header_p);
645 ix = lookup_fnfields_1 (complete_type (ctype),
646 DECL_CONSTRUCTOR_P (function) ? ctor_identifier :
647 DECL_DESTRUCTOR_P (function) ? dtor_identifier :
648 DECL_NAME (function));
652 tree methods = CLASSTYPE_METHOD_VEC (ctype);
653 tree fndecls, fndecl = 0;
656 const char *format = NULL;
658 pop_p = push_scope (ctype);
659 for (fndecls = TREE_VEC_ELT (methods, ix);
660 fndecls; fndecls = OVL_NEXT (fndecls))
664 fndecl = OVL_CURRENT (fndecls);
665 p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
666 p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
668 /* We cannot simply call decls_match because this doesn't
669 work for static member functions that are pretending to
670 be methods, and because the name may have been changed by
673 /* Get rid of the this parameter on functions that become
675 if (DECL_STATIC_FUNCTION_P (fndecl)
676 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
677 p1 = TREE_CHAIN (p1);
679 /* A member template definition only matches a member template
681 if (is_template != (TREE_CODE (fndecl) == TEMPLATE_DECL))
684 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
685 TREE_TYPE (TREE_TYPE (fndecl)))
686 && compparms (p1, p2)
687 && (DECL_TEMPLATE_SPECIALIZATION (function)
688 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
689 && (!DECL_TEMPLATE_SPECIALIZATION (function)
690 || (DECL_TI_TEMPLATE (function)
691 == DECL_TI_TEMPLATE (fndecl))))
697 return OVL_CURRENT (fndecls);
698 error ("prototype for `%#D' does not match any in class `%T'",
700 is_conv_op = DECL_CONV_FN_P (fndecl);
703 ix = CLASSTYPE_FIRST_CONVERSION_SLOT;
704 fndecls = TREE_VEC_ELT (methods, ix);
707 fndecl = OVL_CURRENT (fndecls);
708 fndecls = OVL_NEXT (fndecls);
710 if (!fndecls && is_conv_op)
712 if (TREE_VEC_LENGTH (methods) > ix)
715 fndecls = TREE_VEC_ELT (methods, ix);
716 if (!DECL_CONV_FN_P (OVL_CURRENT (fndecls)))
728 format = "candidates are: %#D";
730 format = "candidate is: %#D";
731 cp_error_at (format, fndecl);
734 else if (!COMPLETE_TYPE_P (ctype))
735 cxx_incomplete_type_error (function, ctype);
737 error ("no `%#D' member function declared in class `%T'",
740 /* If we did not find the method in the class, add it to avoid
741 spurious errors (unless the CTYPE is not yet defined, in which
742 case we'll only confuse ourselves when the function is declared
743 properly within the class. */
744 if (COMPLETE_TYPE_P (ctype))
745 add_method (ctype, function, /*error_p=*/1);
749 /* We have just processed the DECL, which is a static data member.
750 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
751 present, is the assembly-language name for the data member.
752 FLAGS is as for cp_finish_decl. */
755 finish_static_data_member_decl (tree decl, tree init, tree asmspec_tree,
758 my_friendly_assert (TREE_PUBLIC (decl), 0);
760 DECL_CONTEXT (decl) = current_class_type;
762 /* We cannot call pushdecl here, because that would fill in the
763 TREE_CHAIN of our decl. Instead, we modify cp_finish_decl to do
764 the right thing, namely, to put this decl out straight away. */
765 /* current_class_type can be NULL_TREE in case of error. */
766 if (!asmspec_tree && current_class_type)
767 DECL_INITIAL (decl) = error_mark_node;
769 if (! processing_template_decl)
771 if (!pending_statics)
772 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
773 VARRAY_PUSH_TREE (pending_statics, decl);
776 if (LOCAL_CLASS_P (current_class_type))
777 pedwarn ("local class `%#T' shall not have static data member `%#D'",
778 current_class_type, decl);
780 /* Static consts need not be initialized in the class definition. */
781 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
783 static int explained = 0;
785 error ("initializer invalid for static member with constructor");
788 error ("(an out of class initialization is required)");
793 /* Force the compiler to know when an uninitialized static const
794 member is being used. */
795 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
796 TREE_USED (decl) = 1;
797 DECL_INITIAL (decl) = init;
798 DECL_IN_AGGR_P (decl) = 1;
800 cp_finish_decl (decl, init, asmspec_tree, flags);
803 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
804 of a structure component, returning a _DECL node.
805 QUALS is a list of type qualifiers for this decl (such as for declaring
806 const member functions).
808 This is done during the parsing of the struct declaration.
809 The _DECL nodes are chained together and the lot of them
810 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
812 If class A defines that certain functions in class B are friends, then
813 the way I have set things up, it is B who is interested in permission
814 granted by A. However, it is in A's context that these declarations
815 are parsed. By returning a void_type_node, class A does not attempt
816 to incorporate the declarations of the friends within its structure.
818 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
819 CHANGES TO CODE IN `start_method'. */
822 grokfield (tree declarator, tree declspecs, tree init, tree asmspec_tree,
826 const char *asmspec = 0;
827 int flags = LOOKUP_ONLYCONVERTING;
829 if (declspecs == NULL_TREE
830 && TREE_CODE (declarator) == SCOPE_REF
831 && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
833 /* Access declaration */
834 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
836 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
838 return do_class_using_decl (declarator);
842 && TREE_CODE (init) == TREE_LIST
843 && TREE_VALUE (init) == error_mark_node
844 && TREE_CHAIN (init) == NULL_TREE)
847 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist);
848 if (! value || error_operand_p (value))
849 /* friend or constructor went bad. */
850 return error_mark_node;
852 if (TREE_CODE (value) == TYPE_DECL && init)
854 error ("typedef `%D' is initialized (use __typeof__ instead)", value);
858 /* Pass friendly classes back. */
859 if (value == void_type_node)
862 /* Pass friend decls back. */
863 if ((TREE_CODE (value) == FUNCTION_DECL
864 || TREE_CODE (value) == TEMPLATE_DECL)
865 && DECL_CONTEXT (value) != current_class_type)
868 if (DECL_NAME (value) != NULL_TREE
869 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
870 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
871 error ("member `%D' conflicts with virtual function table field name",
874 /* Stash away type declarations. */
875 if (TREE_CODE (value) == TYPE_DECL)
877 DECL_NONLOCAL (value) = 1;
878 DECL_CONTEXT (value) = current_class_type;
880 if (processing_template_decl)
881 value = push_template_decl (value);
886 if (DECL_IN_AGGR_P (value))
888 error ("`%D' is already defined in `%T'", value,
889 DECL_CONTEXT (value));
890 return void_type_node;
894 asmspec = TREE_STRING_POINTER (asmspec_tree);
898 if (TREE_CODE (value) == FUNCTION_DECL)
900 grok_function_init (value, init);
903 else if (pedantic && TREE_CODE (value) != VAR_DECL)
904 /* Already complained in grokdeclarator. */
908 /* We allow initializers to become parameters to base
910 if (TREE_CODE (init) == TREE_LIST)
912 if (TREE_CHAIN (init) == NULL_TREE)
913 init = TREE_VALUE (init);
915 init = digest_init (TREE_TYPE (value), init, (tree *)0);
918 if (!processing_template_decl)
920 if (TREE_CODE (init) == CONST_DECL)
921 init = DECL_INITIAL (init);
922 else if (TREE_READONLY_DECL_P (init))
923 init = decl_constant_value (init);
924 else if (TREE_CODE (init) == CONSTRUCTOR)
925 init = digest_init (TREE_TYPE (value), init, (tree *)0);
926 if (init != error_mark_node && ! TREE_CONSTANT (init))
928 /* We can allow references to things that are effectively
929 static, since references are initialized with the
931 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
932 || (TREE_STATIC (init) == 0
933 && (!DECL_P (init) || DECL_EXTERNAL (init) == 0)))
935 error ("field initializer is not constant");
936 init = error_mark_node;
943 if (processing_template_decl
944 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
946 value = push_template_decl (value);
947 if (error_operand_p (value))
948 return error_mark_node;
952 cplus_decl_attributes (&value, attrlist, 0);
954 if (TREE_CODE (value) == VAR_DECL)
956 finish_static_data_member_decl (value, init, asmspec_tree,
960 if (TREE_CODE (value) == FIELD_DECL)
963 error ("`asm' specifiers are not permitted on non-static data members");
964 if (DECL_INITIAL (value) == error_mark_node)
965 init = error_mark_node;
966 cp_finish_decl (value, init, NULL_TREE, flags);
967 DECL_INITIAL (value) = init;
968 DECL_IN_AGGR_P (value) = 1;
971 if (TREE_CODE (value) == FUNCTION_DECL)
975 /* This must override the asm specifier which was placed
976 by grokclassfn. Lay this out fresh. */
977 SET_DECL_RTL (value, NULL_RTX);
978 change_decl_assembler_name (value, get_identifier (asmspec));
980 if (!DECL_FRIEND_P (value))
981 grok_special_member_properties (value);
983 cp_finish_decl (value, init, asmspec_tree, flags);
985 /* Pass friends back this way. */
986 if (DECL_FRIEND_P (value))
987 return void_type_node;
989 DECL_IN_AGGR_P (value) = 1;
997 /* Like `grokfield', but for bitfields.
998 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1001 grokbitfield (tree declarator, tree declspecs, tree width)
1003 tree value = grokdeclarator (declarator, declspecs, BITFIELD, 0, NULL);
1005 if (! value) return NULL_TREE; /* friends went bad. */
1007 /* Pass friendly classes back. */
1008 if (TREE_CODE (value) == VOID_TYPE)
1009 return void_type_node;
1011 if (TREE_CODE (value) == TYPE_DECL)
1013 error ("cannot declare `%D' to be a bit-field type", value);
1017 /* Usually, finish_struct_1 catches bitfields with invalid types.
1018 But, in the case of bitfields with function type, we confuse
1019 ourselves into thinking they are member functions, so we must
1021 if (TREE_CODE (value) == FUNCTION_DECL)
1023 error ("cannot declare bit-field `%D' with function type",
1028 if (DECL_IN_AGGR_P (value))
1030 error ("`%D' is already defined in the class %T", value,
1031 DECL_CONTEXT (value));
1032 return void_type_node;
1035 if (TREE_STATIC (value))
1037 error ("static member `%D' cannot be a bit-field", value);
1040 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1042 if (width != error_mark_node)
1044 constant_expression_warning (width);
1045 DECL_INITIAL (value) = width;
1046 SET_DECL_C_BIT_FIELD (value);
1049 DECL_IN_AGGR_P (value) = 1;
1053 /* When a function is declared with an initializer,
1054 do the right thing. Currently, there are two possibilities:
1059 // initialization possibility #1.
1060 virtual void f () = 0;
1082 // initialization possibility #2
1089 grok_function_init (tree decl, tree init)
1091 /* An initializer for a function tells how this function should
1093 tree type = TREE_TYPE (decl);
1095 if (TREE_CODE (type) == FUNCTION_TYPE)
1096 error ("initializer specified for non-member function `%D'", decl);
1097 else if (integer_zerop (init))
1098 DECL_PURE_VIRTUAL_P (decl) = 1;
1100 error ("invalid initializer for virtual method `%D'", decl);
1104 cplus_decl_attributes (tree *decl, tree attributes, int flags)
1106 if (*decl == NULL_TREE || *decl == void_type_node)
1109 if (TREE_CODE (*decl) == TEMPLATE_DECL)
1110 decl = &DECL_TEMPLATE_RESULT (*decl);
1112 decl_attributes (decl, attributes, flags);
1114 if (TREE_CODE (*decl) == TYPE_DECL)
1115 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl));
1118 /* Defer the compilation of the FN until the end of compilation. */
1123 if (DECL_DEFERRED_FN (fn))
1125 DECL_DEFERRED_FN (fn) = 1;
1126 DECL_DEFER_OUTPUT (fn) = 1;
1128 VARRAY_TREE_INIT (deferred_fns, 32, "deferred_fns");
1130 VARRAY_PUSH_TREE (deferred_fns, fn);
1133 /* Walks through the namespace- or function-scope anonymous union OBJECT,
1134 building appropriate ALIAS_DECLs. Returns one of the fields for use in
1135 the mangled name. */
1138 build_anon_union_vars (tree object)
1140 tree type = TREE_TYPE (object);
1141 tree main_decl = NULL_TREE;
1144 /* Rather than write the code to handle the non-union case,
1145 just give an error. */
1146 if (TREE_CODE (type) != UNION_TYPE)
1147 error ("anonymous struct not inside named type");
1149 for (field = TYPE_FIELDS (type);
1151 field = TREE_CHAIN (field))
1156 if (DECL_ARTIFICIAL (field))
1158 if (TREE_CODE (field) != FIELD_DECL)
1161 `%#D' invalid; an anonymous union can only have non-static data members",
1166 if (TREE_PRIVATE (field))
1167 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
1168 else if (TREE_PROTECTED (field))
1169 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
1171 if (processing_template_decl)
1172 ref = build_min_nt (COMPONENT_REF, object, DECL_NAME (field));
1174 ref = build_class_member_access_expr (object, field, NULL_TREE,
1177 if (DECL_NAME (field))
1179 decl = build_decl (ALIAS_DECL, DECL_NAME (field), TREE_TYPE (field));
1180 DECL_INITIAL (decl) = ref;
1181 TREE_PUBLIC (decl) = 0;
1182 TREE_STATIC (decl) = 0;
1183 DECL_EXTERNAL (decl) = 1;
1184 decl = pushdecl (decl);
1186 else if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1187 decl = build_anon_union_vars (ref);
1191 if (main_decl == NULL_TREE)
1198 /* Finish off the processing of a UNION_TYPE structure. If the union is an
1199 anonymous union, then all members must be laid out together. PUBLIC_P
1200 is nonzero if this union is not declared static. */
1203 finish_anon_union (tree anon_union_decl)
1205 tree type = TREE_TYPE (anon_union_decl);
1207 bool public_p = TREE_PUBLIC (anon_union_decl);
1209 /* The VAR_DECL's context is the same as the TYPE's context. */
1210 DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type));
1212 if (TYPE_FIELDS (type) == NULL_TREE)
1217 error ("namespace-scope anonymous aggregates must be static");
1221 main_decl = build_anon_union_vars (anon_union_decl);
1222 if (main_decl == NULL_TREE)
1224 warning ("anonymous union with no members");
1228 if (!processing_template_decl)
1230 /* Use main_decl to set the mangled name. */
1231 DECL_NAME (anon_union_decl) = DECL_NAME (main_decl);
1232 mangle_decl (anon_union_decl);
1233 DECL_NAME (anon_union_decl) = NULL_TREE;
1236 pushdecl (anon_union_decl);
1237 if (building_stmt_tree ()
1238 && at_function_scope_p ())
1239 add_decl_stmt (anon_union_decl);
1240 else if (!processing_template_decl)
1241 rest_of_decl_compilation (anon_union_decl, NULL,
1242 toplevel_bindings_p (), at_eof);
1245 /* Auxiliary functions to make type signatures for
1246 `operator new' and `operator delete' correspond to
1247 what compiler will be expecting. */
1250 coerce_new_type (tree type)
1253 tree args = TYPE_ARG_TYPES (type);
1255 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1257 if (!same_type_p (TREE_TYPE (type), ptr_type_node))
1258 e = 1, error ("`operator new' must return type `%T'", ptr_type_node);
1260 if (!args || args == void_list_node
1261 || !same_type_p (TREE_VALUE (args), size_type_node))
1264 if (args && args != void_list_node)
1265 args = TREE_CHAIN (args);
1266 pedwarn ("`operator new' takes type `size_t' (`%T') as first parameter", size_type_node);
1271 args = tree_cons (NULL_TREE, size_type_node, args);
1274 type = build_exception_variant
1275 (build_function_type (ptr_type_node, args),
1276 TYPE_RAISES_EXCEPTIONS (type));
1284 coerce_delete_type (tree type)
1287 tree args = TYPE_ARG_TYPES (type);
1289 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1291 if (!same_type_p (TREE_TYPE (type), void_type_node))
1292 e = 1, error ("`operator delete' must return type `%T'", void_type_node);
1294 if (!args || args == void_list_node
1295 || !same_type_p (TREE_VALUE (args), ptr_type_node))
1298 if (args && args != void_list_node)
1299 args = TREE_CHAIN (args);
1300 error ("`operator delete' takes type `%T' as first parameter", ptr_type_node);
1305 args = tree_cons (NULL_TREE, ptr_type_node, args);
1308 type = build_exception_variant
1309 (build_function_type (void_type_node, args),
1310 TYPE_RAISES_EXCEPTIONS (type));
1319 mark_vtable_entries (tree decl)
1321 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
1323 for (; entries; entries = TREE_CHAIN (entries))
1325 tree fnaddr = TREE_VALUE (entries);
1328 STRIP_NOPS (fnaddr);
1330 if (TREE_CODE (fnaddr) != ADDR_EXPR
1331 && TREE_CODE (fnaddr) != FDESC_EXPR)
1332 /* This entry is an offset: a virtual base class offset, a
1333 virtual call offset, an RTTI offset, etc. */
1336 fn = TREE_OPERAND (fnaddr, 0);
1337 TREE_ADDRESSABLE (fn) = 1;
1338 /* When we don't have vcall offsets, we output thunks whenever
1339 we output the vtables that contain them. With vcall offsets,
1340 we know all the thunks we'll need when we emit a virtual
1341 function, so we emit the thunks there instead. */
1342 if (DECL_THUNK_P (fn))
1343 use_thunk (fn, /*emit_p=*/0);
1348 /* Set DECL up to have the closest approximation of "initialized common"
1349 linkage available. */
1352 comdat_linkage (tree decl)
1355 make_decl_one_only (decl);
1356 else if (TREE_CODE (decl) == FUNCTION_DECL
1357 || (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)))
1358 /* We can just emit function and compiler-generated variables
1359 statically; having multiple copies is (for the most part) only
1362 There are two correctness issues, however: the address of a
1363 template instantiation with external linkage should be the
1364 same, independent of what translation unit asks for the
1365 address, and this will not hold when we emit multiple copies of
1366 the function. However, there's little else we can do.
1368 Also, by default, the typeinfo implementation assumes that
1369 there will be only one copy of the string used as the name for
1370 each type. Therefore, if weak symbols are unavailable, the
1371 run-time library should perform a more conservative check; it
1372 should perform a string comparison, rather than an address
1374 TREE_PUBLIC (decl) = 0;
1377 /* Static data member template instantiations, however, cannot
1378 have multiple copies. */
1379 if (DECL_INITIAL (decl) == 0
1380 || DECL_INITIAL (decl) == error_mark_node)
1381 DECL_COMMON (decl) = 1;
1382 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
1384 DECL_COMMON (decl) = 1;
1385 DECL_INITIAL (decl) = error_mark_node;
1387 else if (!DECL_EXPLICIT_INSTANTIATION (decl))
1389 /* We can't do anything useful; leave vars for explicit
1391 DECL_EXTERNAL (decl) = 1;
1392 DECL_NOT_REALLY_EXTERN (decl) = 0;
1396 if (DECL_LANG_SPECIFIC (decl))
1397 DECL_COMDAT (decl) = 1;
1400 /* For win32 we also want to put explicit instantiations in
1401 linkonce sections, so that they will be merged with implicit
1402 instantiations; otherwise we get duplicate symbol errors. */
1405 maybe_make_one_only (tree decl)
1407 /* We used to say that this was not necessary on targets that support weak
1408 symbols, because the implicit instantiations will defer to the explicit
1409 one. However, that's not actually the case in SVR4; a strong definition
1410 after a weak one is an error. Also, not making explicit
1411 instantiations one_only means that we can end up with two copies of
1412 some template instantiations. */
1416 /* We can't set DECL_COMDAT on functions, or finish_file will think
1417 we can get away with not emitting them if they aren't used. We need
1418 to for variables so that cp_finish_decl will update their linkage,
1419 because their DECL_INITIAL may not have been set properly yet. */
1421 make_decl_one_only (decl);
1423 if (TREE_CODE (decl) == VAR_DECL)
1425 DECL_COMDAT (decl) = 1;
1426 /* Mark it needed so we don't forget to emit it. */
1427 mark_referenced (DECL_ASSEMBLER_NAME (decl));
1431 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
1432 based on TYPE and other static flags.
1434 Note that anything public is tagged TREE_PUBLIC, whether
1435 it's public in this file or in another one. */
1438 import_export_vtable (tree decl, tree type, int final)
1440 if (DECL_INTERFACE_KNOWN (decl))
1443 if (TYPE_FOR_JAVA (type))
1445 TREE_PUBLIC (decl) = 1;
1446 DECL_EXTERNAL (decl) = 1;
1447 DECL_INTERFACE_KNOWN (decl) = 1;
1449 else if (CLASSTYPE_INTERFACE_KNOWN (type))
1451 TREE_PUBLIC (decl) = 1;
1452 DECL_EXTERNAL (decl) = CLASSTYPE_INTERFACE_ONLY (type);
1453 DECL_INTERFACE_KNOWN (decl) = 1;
1457 /* We can only wait to decide if we have real non-inline virtual
1458 functions in our class, or if we come from a template. */
1460 int found = (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
1461 || CLASSTYPE_KEY_METHOD (type) != NULL_TREE);
1463 if (final || ! found)
1465 comdat_linkage (decl);
1466 DECL_EXTERNAL (decl) = 0;
1470 TREE_PUBLIC (decl) = 1;
1471 DECL_EXTERNAL (decl) = 1;
1476 /* Determine whether or not we want to specifically import or export CTYPE,
1477 using various heuristics. */
1480 import_export_class (tree ctype)
1482 /* -1 for imported, 1 for exported. */
1483 int import_export = 0;
1485 /* It only makes sense to call this function at EOF. The reason is
1486 that this function looks at whether or not the first non-inline
1487 non-abstract virtual member function has been defined in this
1488 translation unit. But, we can't possibly know that until we've
1489 seen the entire translation unit. */
1490 my_friendly_assert (at_eof, 20000226);
1492 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1495 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
1496 we will have CLASSTYPE_INTERFACE_ONLY set but not
1497 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
1498 heuristic because someone will supply a #pragma implementation
1499 elsewhere, and deducing it here would produce a conflict. */
1500 if (CLASSTYPE_INTERFACE_ONLY (ctype))
1503 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
1505 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
1508 /* If we got -fno-implicit-templates, we import template classes that
1509 weren't explicitly instantiated. */
1510 if (import_export == 0
1511 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
1512 && ! flag_implicit_templates)
1515 /* Base our import/export status on that of the first non-inline,
1516 non-pure virtual function, if any. */
1517 if (import_export == 0
1518 && TYPE_POLYMORPHIC_P (ctype))
1520 tree method = CLASSTYPE_KEY_METHOD (ctype);
1522 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
1525 #ifdef MULTIPLE_SYMBOL_SPACES
1526 if (import_export == -1)
1532 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
1533 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
1537 /* Return true if VAR has already been provided to the back end; in that
1538 case VAR should not be modified further by the front end. */
1540 var_finalized_p (tree var)
1542 if (flag_unit_at_a_time)
1543 return cgraph_varpool_node (var)->finalized;
1545 return TREE_ASM_WRITTEN (var);
1548 /* If necessary, write out the vtables for the dynamic class CTYPE.
1549 Returns true if any vtables were emitted. */
1552 maybe_emit_vtables (tree ctype)
1556 bool needed = false;
1558 /* If the vtables for this class have already been emitted there is
1559 nothing more to do. */
1560 primary_vtbl = CLASSTYPE_VTABLES (ctype);
1561 if (var_finalized_p (primary_vtbl))
1563 /* Ignore dummy vtables made by get_vtable_decl. */
1564 if (TREE_TYPE (primary_vtbl) == void_type_node)
1567 import_export_class (ctype);
1568 import_export_vtable (primary_vtbl, ctype, 1);
1570 /* See if any of the vtables are needed. */
1571 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1572 if (!DECL_EXTERNAL (vtbl) && DECL_NEEDED_P (vtbl))
1576 /* If the references to this class' vtables are optimized away,
1577 still emit the appropriate debugging information. See
1579 if (DECL_COMDAT (primary_vtbl)
1580 && CLASSTYPE_DEBUG_REQUESTED (ctype))
1581 note_debug_info_needed (ctype);
1584 else if (TREE_PUBLIC (vtbl) && !DECL_COMDAT (vtbl))
1588 /* The ABI requires that we emit all of the vtables if we emit any
1590 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1593 import_export_vtable (vtbl, ctype, 1);
1594 mark_vtable_entries (vtbl);
1596 /* If we know that DECL is needed, mark it as such for the varpool. */
1598 cgraph_varpool_mark_needed_node (cgraph_varpool_node (vtbl));
1600 if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0)
1602 /* It had better be all done at compile-time. */
1603 if (store_init_value (vtbl, DECL_INITIAL (vtbl)))
1607 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
1609 /* Mark the VAR_DECL node representing the vtable itself as a
1610 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
1611 It is rather important that such things be ignored because
1612 any effort to actually generate DWARF for them will run
1613 into trouble when/if we encounter code like:
1616 struct S { virtual void member (); };
1618 because the artificial declaration of the vtable itself (as
1619 manufactured by the g++ front end) will say that the vtable
1620 is a static member of `S' but only *after* the debug output
1621 for the definition of `S' has already been output. This causes
1622 grief because the DWARF entry for the definition of the vtable
1623 will try to refer back to an earlier *declaration* of the
1624 vtable as a static member of `S' and there won't be one.
1625 We might be able to arrange to have the "vtable static member"
1626 attached to the member list for `S' before the debug info for
1627 `S' get written (which would solve the problem) but that would
1628 require more intrusive changes to the g++ front end. */
1630 DECL_IGNORED_P (vtbl) = 1;
1633 /* Always make vtables weak. */
1635 comdat_linkage (vtbl);
1637 rest_of_decl_compilation (vtbl, NULL, 1, 1);
1639 /* Because we're only doing syntax-checking, we'll never end up
1640 actually marking the variable as written. */
1641 if (flag_syntax_only)
1642 TREE_ASM_WRITTEN (vtbl) = 1;
1645 /* Since we're writing out the vtable here, also write the debug
1647 note_debug_info_needed (ctype);
1652 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
1653 inline function or template instantiation at end-of-file. */
1656 import_export_decl (tree decl)
1658 if (DECL_INTERFACE_KNOWN (decl))
1661 if (DECL_TEMPLATE_INSTANTIATION (decl)
1662 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1664 DECL_NOT_REALLY_EXTERN (decl) = 1;
1665 if ((DECL_IMPLICIT_INSTANTIATION (decl)
1666 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1667 && (flag_implicit_templates
1668 || (flag_implicit_inline_templates
1669 && TREE_CODE (decl) == FUNCTION_DECL
1670 && DECL_DECLARED_INLINE_P (decl))))
1672 if (!TREE_PUBLIC (decl))
1673 /* Templates are allowed to have internal linkage. See
1677 comdat_linkage (decl);
1681 DECL_EXTERNAL (decl) = 1;
1682 DECL_NOT_REALLY_EXTERN (decl) = 0;
1685 else if (DECL_FUNCTION_MEMBER_P (decl))
1687 if (!DECL_DECLARED_INLINE_P (decl))
1689 tree ctype = DECL_CONTEXT (decl);
1690 import_export_class (ctype);
1691 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1693 DECL_NOT_REALLY_EXTERN (decl)
1694 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
1695 || (DECL_DECLARED_INLINE_P (decl)
1696 && ! flag_implement_inlines
1697 && !DECL_VINDEX (decl)));
1699 if (!DECL_NOT_REALLY_EXTERN (decl))
1700 DECL_EXTERNAL (decl) = 1;
1702 /* Always make artificials weak. */
1703 if (DECL_ARTIFICIAL (decl) && flag_weak)
1704 comdat_linkage (decl);
1706 maybe_make_one_only (decl);
1710 comdat_linkage (decl);
1713 comdat_linkage (decl);
1715 DECL_INTERFACE_KNOWN (decl) = 1;
1718 /* Here, we only decide whether or not the tinfo node should be
1719 emitted with the vtable. IS_IN_LIBRARY is nonzero iff the
1720 typeinfo for TYPE should be in the runtime library. */
1723 import_export_tinfo (tree decl, tree type, bool is_in_library)
1725 if (DECL_INTERFACE_KNOWN (decl))
1728 if (IS_AGGR_TYPE (type))
1729 import_export_class (type);
1731 if (IS_AGGR_TYPE (type) && CLASSTYPE_INTERFACE_KNOWN (type)
1732 && TYPE_POLYMORPHIC_P (type)
1733 /* If -fno-rtti, we're not necessarily emitting this stuff with
1734 the class, so go ahead and emit it now. This can happen when
1735 a class is used in exception handling. */
1738 DECL_NOT_REALLY_EXTERN (decl) = !CLASSTYPE_INTERFACE_ONLY (type);
1739 DECL_COMDAT (decl) = 0;
1743 DECL_NOT_REALLY_EXTERN (decl) = 1;
1744 DECL_COMDAT (decl) = 1;
1747 /* Now override some cases. */
1749 DECL_COMDAT (decl) = 1;
1750 else if (is_in_library)
1751 DECL_COMDAT (decl) = 0;
1753 DECL_INTERFACE_KNOWN (decl) = 1;
1756 /* Return an expression that performs the destruction of DECL, which
1757 must be a VAR_DECL whose type has a non-trivial destructor, or is
1758 an array whose (innermost) elements have a non-trivial destructor. */
1761 build_cleanup (tree decl)
1764 tree type = TREE_TYPE (decl);
1766 /* This function should only be called for declarations that really
1767 require cleanups. */
1768 my_friendly_assert (!TYPE_HAS_TRIVIAL_DESTRUCTOR (type), 20030106);
1770 /* Treat all objects with destructors as used; the destructor may do
1771 something substantive. */
1774 if (TREE_CODE (type) == ARRAY_TYPE)
1778 cxx_mark_addressable (decl);
1779 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
1781 temp = build_delete (TREE_TYPE (temp), temp,
1782 sfk_complete_destructor,
1783 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
1787 /* Returns the initialization guard variable for the variable DECL,
1788 which has static storage duration. */
1791 get_guard (tree decl)
1796 sname = mangle_guard_variable (decl);
1797 guard = IDENTIFIER_GLOBAL_VALUE (sname);
1802 /* We use a type that is big enough to contain a mutex as well
1803 as an integer counter. */
1804 guard_type = long_long_integer_type_node;
1805 guard = build_decl (VAR_DECL, sname, guard_type);
1807 /* The guard should have the same linkage as what it guards. */
1808 TREE_PUBLIC (guard) = TREE_PUBLIC (decl);
1809 TREE_STATIC (guard) = TREE_STATIC (decl);
1810 DECL_COMMON (guard) = DECL_COMMON (decl);
1811 DECL_ONE_ONLY (guard) = DECL_ONE_ONLY (decl);
1812 if (TREE_PUBLIC (decl))
1813 DECL_WEAK (guard) = DECL_WEAK (decl);
1815 DECL_ARTIFICIAL (guard) = 1;
1816 TREE_USED (guard) = 1;
1817 pushdecl_top_level_and_finish (guard, NULL_TREE);
1822 /* Return those bits of the GUARD variable that should be set when the
1823 guarded entity is actually initialized. */
1826 get_guard_bits (tree guard)
1828 /* We only set the first byte of the guard, in order to leave room
1829 for a mutex in the high-order bits. */
1830 guard = build1 (ADDR_EXPR,
1831 build_pointer_type (TREE_TYPE (guard)),
1833 guard = build1 (NOP_EXPR,
1834 build_pointer_type (char_type_node),
1836 guard = build1 (INDIRECT_REF, char_type_node, guard);
1841 /* Return an expression which determines whether or not the GUARD
1842 variable has already been initialized. */
1845 get_guard_cond (tree guard)
1849 /* Check to see if the GUARD is zero. */
1850 guard = get_guard_bits (guard);
1851 guard_value = integer_zero_node;
1852 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
1853 guard_value = convert (TREE_TYPE (guard), guard_value);
1854 return cp_build_binary_op (EQ_EXPR, guard, guard_value);
1857 /* Return an expression which sets the GUARD variable, indicating that
1858 the variable being guarded has been initialized. */
1861 set_guard (tree guard)
1865 /* Set the GUARD to one. */
1866 guard = get_guard_bits (guard);
1867 guard_init = integer_one_node;
1868 if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard)))
1869 guard_init = convert (TREE_TYPE (guard), guard_init);
1870 return build_modify_expr (guard, NOP_EXPR, guard_init);
1873 /* Start the process of running a particular set of global constructors
1874 or destructors. Subroutine of do_[cd]tors. */
1877 start_objects (int method_type, int initp)
1883 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
1885 if (initp != DEFAULT_INIT_PRIORITY)
1895 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
1898 sprintf (type, "%c", method_type);
1900 fnname = get_file_function_name_long (type);
1902 start_function (void_list_node,
1903 make_call_declarator (fnname, void_list_node, NULL_TREE,
1905 NULL_TREE, SF_DEFAULT);
1907 /* It can be a static function as long as collect2 does not have
1908 to scan the object file to find its ctor/dtor routine. */
1909 TREE_PUBLIC (current_function_decl) = ! targetm.have_ctors_dtors;
1911 /* Mark this declaration as used to avoid spurious warnings. */
1912 TREE_USED (current_function_decl) = 1;
1914 /* Mark this function as a global constructor or destructor. */
1915 if (method_type == 'I')
1916 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
1918 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
1919 DECL_LANG_SPECIFIC (current_function_decl)->decl_flags.u2sel = 1;
1921 body = begin_compound_stmt (/*has_no_scope=*/false);
1923 /* We cannot allow these functions to be elided, even if they do not
1924 have external linkage. And, there's no point in deferring
1925 compilation of thes functions; they're all going to have to be
1927 current_function_cannot_inline
1928 = "static constructors and destructors cannot be inlined";
1933 /* Finish the process of running a particular set of global constructors
1934 or destructors. Subroutine of do_[cd]tors. */
1937 finish_objects (int method_type, int initp, tree body)
1942 finish_compound_stmt (body);
1943 fn = finish_function (0);
1944 expand_or_defer_fn (fn);
1946 /* When only doing semantic analysis, and no RTL generation, we
1947 can't call functions that directly emit assembly code; there is
1948 no assembly file in which to put the code. */
1949 if (flag_syntax_only)
1952 if (targetm.have_ctors_dtors)
1954 rtx fnsym = XEXP (DECL_RTL (fn), 0);
1955 if (method_type == 'I')
1956 (* targetm.asm_out.constructor) (fnsym, initp);
1958 (* targetm.asm_out.destructor) (fnsym, initp);
1962 /* The names of the parameters to the function created to handle
1963 initializations and destructions for objects with static storage
1965 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
1966 #define PRIORITY_IDENTIFIER "__priority"
1968 /* The name of the function we create to handle initializations and
1969 destructions for objects with static storage duration. */
1970 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
1972 /* The declaration for the __INITIALIZE_P argument. */
1973 static GTY(()) tree initialize_p_decl;
1975 /* The declaration for the __PRIORITY argument. */
1976 static GTY(()) tree priority_decl;
1978 /* The declaration for the static storage duration function. */
1979 static GTY(()) tree ssdf_decl;
1981 /* All the static storage duration functions created in this
1982 translation unit. */
1983 static GTY(()) varray_type ssdf_decls;
1985 /* A map from priority levels to information about that priority
1986 level. There may be many such levels, so efficient lookup is
1988 static splay_tree priority_info_map;
1990 /* Begins the generation of the function that will handle all
1991 initialization and destruction of objects with static storage
1992 duration. The function generated takes two parameters of type
1993 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
1994 nonzero, it performs initializations. Otherwise, it performs
1995 destructions. It only performs those initializations or
1996 destructions with the indicated __PRIORITY. The generated function
1999 It is assumed that this function will only be called once per
2000 translation unit. */
2003 start_static_storage_duration_function (unsigned count)
2008 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2010 /* Create the identifier for this function. It will be of the form
2011 SSDF_IDENTIFIER_<number>. */
2012 sprintf (id, "%s_%u", SSDF_IDENTIFIER, count);
2014 /* Create the parameters. */
2015 parm_types = void_list_node;
2016 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2017 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2018 type = build_function_type (void_type_node, parm_types);
2020 /* Create the FUNCTION_DECL itself. */
2021 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2022 get_identifier (id),
2024 TREE_PUBLIC (ssdf_decl) = 0;
2025 DECL_ARTIFICIAL (ssdf_decl) = 1;
2027 /* Put this function in the list of functions to be called from the
2028 static constructors and destructors. */
2031 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2033 /* Take this opportunity to initialize the map from priority
2034 numbers to information about that priority level. */
2035 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2036 /*delete_key_fn=*/0,
2037 /*delete_value_fn=*/
2038 (splay_tree_delete_value_fn) &free);
2040 /* We always need to generate functions for the
2041 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2042 priorities later, we'll be sure to find the
2043 DEFAULT_INIT_PRIORITY. */
2044 get_priority_info (DEFAULT_INIT_PRIORITY);
2047 VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl);
2049 /* Create the argument list. */
2050 initialize_p_decl = cp_build_parm_decl
2051 (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node);
2052 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2053 TREE_USED (initialize_p_decl) = 1;
2054 priority_decl = cp_build_parm_decl
2055 (get_identifier (PRIORITY_IDENTIFIER), integer_type_node);
2056 DECL_CONTEXT (priority_decl) = ssdf_decl;
2057 TREE_USED (priority_decl) = 1;
2059 TREE_CHAIN (initialize_p_decl) = priority_decl;
2060 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2062 /* Put the function in the global scope. */
2063 pushdecl (ssdf_decl);
2065 /* Start the function itself. This is equivalent to declaring the
2068 static void __ssdf (int __initialize_p, init __priority_p);
2070 It is static because we only need to call this function from the
2071 various constructor and destructor functions for this module. */
2072 start_function (/*specs=*/NULL_TREE,
2074 /*attrs=*/NULL_TREE,
2077 /* Set up the scope of the outermost block in the function. */
2078 body = begin_compound_stmt (/*has_no_scope=*/false);
2080 /* This function must not be deferred because we are depending on
2081 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
2082 current_function_cannot_inline
2083 = "static storage duration functions cannot be inlined";
2088 /* Finish the generation of the function which performs initialization
2089 and destruction of objects with static storage duration. After
2090 this point, no more such objects can be created. */
2093 finish_static_storage_duration_function (tree body)
2095 /* Close out the function. */
2096 finish_compound_stmt (body);
2097 expand_or_defer_fn (finish_function (0));
2100 /* Return the information about the indicated PRIORITY level. If no
2101 code to handle this level has yet been generated, generate the
2102 appropriate prologue. */
2104 static priority_info
2105 get_priority_info (int priority)
2110 n = splay_tree_lookup (priority_info_map,
2111 (splay_tree_key) priority);
2114 /* Create a new priority information structure, and insert it
2116 pi = xmalloc (sizeof (struct priority_info_s));
2117 pi->initializations_p = 0;
2118 pi->destructions_p = 0;
2119 splay_tree_insert (priority_info_map,
2120 (splay_tree_key) priority,
2121 (splay_tree_value) pi);
2124 pi = (priority_info) n->value;
2129 /* Set up to handle the initialization or destruction of DECL. If
2130 INITP is nonzero, we are initializing the variable. Otherwise, we
2131 are destroying it. */
2134 start_static_initialization_or_destruction (tree decl, int initp)
2136 tree guard_if_stmt = NULL_TREE;
2143 /* Figure out the priority for this declaration. */
2144 priority = DECL_INIT_PRIORITY (decl);
2146 priority = DEFAULT_INIT_PRIORITY;
2148 /* Remember that we had an initialization or finalization at this
2150 pi = get_priority_info (priority);
2152 pi->initializations_p = 1;
2154 pi->destructions_p = 1;
2156 /* Trick the compiler into thinking we are at the file and line
2157 where DECL was declared so that error-messages make sense, and so
2158 that the debugger will show somewhat sensible file and line
2160 input_location = DECL_SOURCE_LOCATION (decl);
2166 Access control for implicit calls to the constructors,
2167 the conversion functions, or the destructor called to
2168 create and destroy a static data member is performed as
2169 if these calls appeared in the scope of the member's
2172 we pretend we are in a static member function of the class of
2173 which the DECL is a member. */
2174 if (member_p (decl))
2176 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
2177 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
2180 /* Conditionalize this initialization on being in the right priority
2181 and being initializing/finalizing appropriately. */
2182 guard_if_stmt = begin_if_stmt ();
2183 cond = cp_build_binary_op (EQ_EXPR,
2185 build_int_2 (priority, 0));
2186 init_cond = initp ? integer_one_node : integer_zero_node;
2187 init_cond = cp_build_binary_op (EQ_EXPR,
2190 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
2192 /* Assume we don't need a guard. */
2194 /* We need a guard if this is an object with external linkage that
2195 might be initialized in more than one place. (For example, a
2196 static data member of a template, when the data member requires
2198 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
2199 || DECL_ONE_ONLY (decl)
2200 || DECL_WEAK (decl)))
2204 guard = get_guard (decl);
2206 /* When using __cxa_atexit, we just check the GUARD as we would
2207 for a local static. */
2208 if (flag_use_cxa_atexit)
2210 /* When using __cxa_atexit, we never try to destroy
2211 anything from a static destructor. */
2212 my_friendly_assert (initp, 20000629);
2213 guard_cond = get_guard_cond (guard);
2215 /* If we don't have __cxa_atexit, then we will be running
2216 destructors from .fini sections, or their equivalents. So,
2217 we need to know how many times we've tried to initialize this
2218 object. We do initializations only if the GUARD is zero,
2219 i.e., if we are the first to initialize the variable. We do
2220 destructions only if the GUARD is one, i.e., if we are the
2221 last to destroy the variable. */
2224 = cp_build_binary_op (EQ_EXPR,
2225 build_unary_op (PREINCREMENT_EXPR,
2231 = cp_build_binary_op (EQ_EXPR,
2232 build_unary_op (PREDECREMENT_EXPR,
2237 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, guard_cond);
2240 finish_if_stmt_cond (cond, guard_if_stmt);
2242 /* If we're using __cxa_atexit, we have not already set the GUARD,
2243 so we must do so now. */
2244 if (guard && initp && flag_use_cxa_atexit)
2245 finish_expr_stmt (set_guard (guard));
2247 return guard_if_stmt;
2250 /* We've just finished generating code to do an initialization or
2251 finalization. GUARD_IF_STMT is the if-statement we used to guard
2252 the initialization. */
2255 finish_static_initialization_or_destruction (tree guard_if_stmt)
2257 finish_then_clause (guard_if_stmt);
2260 /* Now that we're done with DECL we don't need to pretend to be a
2261 member of its class any longer. */
2262 DECL_CONTEXT (current_function_decl) = NULL_TREE;
2263 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
2266 /* Generate code to do the initialization of DECL, a VAR_DECL with
2267 static storage duration. The initialization is INIT. */
2270 do_static_initialization (tree decl, tree init)
2274 /* Set up for the initialization. */
2276 = start_static_initialization_or_destruction (decl,
2279 /* Perform the initialization. */
2281 finish_expr_stmt (init);
2283 /* If we're using __cxa_atexit, register a a function that calls the
2284 destructor for the object. */
2285 if (flag_use_cxa_atexit)
2286 register_dtor_fn (decl);
2289 finish_static_initialization_or_destruction (guard_if_stmt);
2292 /* Generate code to do the static destruction of DECL. If DECL may be
2293 initialized more than once in different object files, GUARD is the
2294 guard variable to check. PRIORITY is the priority for the
2298 do_static_destruction (tree decl)
2302 /* If we're using __cxa_atexit, then destructors are registered
2303 immediately after objects are initialized. */
2304 my_friendly_assert (!flag_use_cxa_atexit, 20000121);
2306 /* If we don't need a destructor, there's nothing to do. */
2307 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2310 /* Actually do the destruction. */
2311 guard_if_stmt = start_static_initialization_or_destruction (decl,
2313 finish_expr_stmt (build_cleanup (decl));
2314 finish_static_initialization_or_destruction (guard_if_stmt);
2317 /* VARS is a list of variables with static storage duration which may
2318 need initialization and/or finalization. Remove those variables
2319 that don't really need to be initialized or finalized, and return
2320 the resulting list. The order in which the variables appear in
2321 VARS is in reverse order of the order in which they should actually
2322 be initialized. The list we return is in the unreversed order;
2323 i.e., the first variable should be initialized first. */
2326 prune_vars_needing_no_initialization (tree *vars)
2329 tree result = NULL_TREE;
2334 tree decl = TREE_VALUE (t);
2335 tree init = TREE_PURPOSE (t);
2337 /* Deal gracefully with error. */
2338 if (decl == error_mark_node)
2340 var = &TREE_CHAIN (t);
2344 /* The only things that can be initialized are variables. */
2345 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
2347 /* If this object is not defined, we don't need to do anything
2349 if (DECL_EXTERNAL (decl))
2351 var = &TREE_CHAIN (t);
2355 /* Also, if the initializer already contains errors, we can bail
2357 if (init && TREE_CODE (init) == TREE_LIST
2358 && value_member (error_mark_node, init))
2360 var = &TREE_CHAIN (t);
2364 /* This variable is going to need initialization and/or
2365 finalization, so we add it to the list. */
2366 *var = TREE_CHAIN (t);
2367 TREE_CHAIN (t) = result;
2374 /* Make sure we have told the back end about all the variables in
2378 write_out_vars (tree vars)
2382 for (v = vars; v; v = TREE_CHAIN (v))
2383 if (!var_finalized_p (TREE_VALUE (v)))
2384 rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1);
2387 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
2388 (otherwise) that will initialize all gobal objects with static
2389 storage duration having the indicated PRIORITY. */
2392 generate_ctor_or_dtor_function (bool constructor_p, int priority,
2401 input_location = *locus;
2404 /* We use `I' to indicate initialization and `D' to indicate
2406 function_key = constructor_p ? 'I' : 'D';
2408 /* We emit the function lazily, to avoid generating empty
2409 global constructors and destructors. */
2412 /* Call the static storage duration function with appropriate
2415 for (i = 0; i < ssdf_decls->elements_used; ++i)
2417 fndecl = VARRAY_TREE (ssdf_decls, i);
2419 /* Calls to pure or const functions will expand to nothing. */
2420 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2423 body = start_objects (function_key, priority);
2425 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
2427 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
2429 finish_expr_stmt (build_function_call (fndecl, arguments));
2433 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
2434 calls to any functions marked with attributes indicating that
2435 they should be called at initialization- or destruction-time. */
2436 if (priority == DEFAULT_INIT_PRIORITY)
2440 for (fns = constructor_p ? static_ctors : static_dtors;
2442 fns = TREE_CHAIN (fns))
2444 fndecl = TREE_VALUE (fns);
2446 /* Calls to pure/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);
2451 finish_expr_stmt (build_function_call (fndecl, NULL_TREE));
2456 /* Close out the function. */
2458 finish_objects (function_key, priority, body);
2461 /* Generate constructor and destructor functions for the priority
2465 generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data)
2467 location_t *locus = data;
2468 int priority = (int) n->key;
2469 priority_info pi = (priority_info) n->value;
2471 /* Generate the functions themselves, but only if they are really
2473 if (pi->initializations_p
2474 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
2475 generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus);
2476 if (pi->destructions_p
2477 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
2478 generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus);
2480 /* Keep iterating. */
2484 /* Called via LANGHOOK_CALLGRAPH_ANALYZE_EXPR. It is supposed to mark
2485 decls referenced from frontend specific constructs; it will be called
2486 only for language-specific tree nodes.
2488 Here we must deal with member pointers. */
2491 cxx_callgraph_analyze_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2492 tree from ATTRIBUTE_UNUSED)
2496 if (flag_unit_at_a_time)
2497 switch (TREE_CODE (t))
2500 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
2501 cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t)));
2504 if (TREE_CODE (BASELINK_FUNCTIONS (t)) == FUNCTION_DECL)
2505 cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t)));
2515 /* This routine is called from the last rule in yyparse ().
2516 Its job is to create all the code needed to initialize and
2517 destroy the global aggregates. We do the destruction
2518 first, since that way we only need to reverse the decls once. */
2527 unsigned ssdf_count = 0;
2529 locus = input_location;
2532 /* Bad parse errors. Just forget about it. */
2533 if (! global_bindings_p () || current_class_type || decl_namespace_list)
2537 c_common_write_pch ();
2539 /* Otherwise, GDB can get confused, because in only knows
2540 about source for LINENO-1 lines. */
2543 interface_unknown = 1;
2546 /* We now have to write out all the stuff we put off writing out.
2549 o Template specializations that we have not yet instantiated,
2550 but which are needed.
2551 o Initialization and destruction for non-local objects with
2552 static storage duration. (Local objects with static storage
2553 duration are initialized when their scope is first entered,
2554 and are cleaned up via atexit.)
2555 o Virtual function tables.
2557 All of these may cause others to be needed. For example,
2558 instantiating one function may cause another to be needed, and
2559 generating the initializer for an object may cause templates to be
2560 instantiated, etc., etc. */
2562 timevar_push (TV_VARCONST);
2564 emit_support_tinfos ();
2569 size_t n_old, n_new;
2573 /* If there are templates that we've put off instantiating, do
2575 instantiate_pending_templates ();
2578 /* Write out virtual tables as required. Note that writing out
2579 the virtual table for a template class may cause the
2580 instantiation of members of that class. If we write out
2581 vtables then we remove the class from our list so we don't
2582 have to look at it again. */
2584 while (keyed_classes != NULL_TREE
2585 && maybe_emit_vtables (TREE_VALUE (keyed_classes)))
2588 keyed_classes = TREE_CHAIN (keyed_classes);
2594 tree next = TREE_CHAIN (t);
2598 if (maybe_emit_vtables (TREE_VALUE (next)))
2601 TREE_CHAIN (t) = TREE_CHAIN (next);
2606 next = TREE_CHAIN (t);
2610 /* Write out needed type info variables. We have to be careful
2611 looping through unemitted decls, because emit_tinfo_decl may
2612 cause other variables to be needed. We stick new elements
2613 (and old elements that we may need to reconsider) at the end
2614 of the array, then shift them back to the beginning once we're
2617 n_old = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls);
2618 for (i = 0; i < n_old; ++i)
2620 tree tinfo_decl = VARRAY_TREE (unemitted_tinfo_decls, i);
2621 if (emit_tinfo_decl (tinfo_decl))
2624 VARRAY_PUSH_TREE (unemitted_tinfo_decls, tinfo_decl);
2627 /* The only elements we want to keep are the new ones. Copy
2628 them to the beginning of the array, then get rid of the
2630 n_new = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) - n_old;
2632 memmove (&VARRAY_TREE (unemitted_tinfo_decls, 0),
2633 &VARRAY_TREE (unemitted_tinfo_decls, n_old),
2634 n_new * sizeof (tree));
2635 memset (&VARRAY_TREE (unemitted_tinfo_decls, n_new),
2636 0, n_old * sizeof (tree));
2637 VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) = n_new;
2639 /* The list of objects with static storage duration is built up
2640 in reverse order. We clear STATIC_AGGREGATES so that any new
2641 aggregates added during the initialization of these will be
2642 initialized in the correct order when we next come around the
2644 vars = prune_vars_needing_no_initialization (&static_aggregates);
2650 /* We need to start a new initialization function each time
2651 through the loop. That's because we need to know which
2652 vtables have been referenced, and TREE_SYMBOL_REFERENCED
2653 isn't computed until a function is finished, and written
2654 out. That's a deficiency in the back-end. When this is
2655 fixed, these initialization functions could all become
2656 inline, with resulting performance improvements. */
2659 /* Set the line and file, so that it is obviously not from
2661 input_location = locus;
2662 ssdf_body = start_static_storage_duration_function (ssdf_count);
2664 /* Make sure the back end knows about all the variables. */
2665 write_out_vars (vars);
2667 /* First generate code to do all the initializations. */
2668 for (v = vars; v; v = TREE_CHAIN (v))
2669 do_static_initialization (TREE_VALUE (v),
2672 /* Then, generate code to do all the destructions. Do these
2673 in reverse order so that the most recently constructed
2674 variable is the first destroyed. If we're using
2675 __cxa_atexit, then we don't need to do this; functions
2676 were registered at initialization time to destroy the
2678 if (!flag_use_cxa_atexit)
2680 vars = nreverse (vars);
2681 for (v = vars; v; v = TREE_CHAIN (v))
2682 do_static_destruction (TREE_VALUE (v));
2687 /* Finish up the static storage duration function for this
2689 input_location = locus;
2690 finish_static_storage_duration_function (ssdf_body);
2692 /* All those initializations and finalizations might cause
2693 us to need more inline functions, more template
2694 instantiations, etc. */
2700 for (i = 0; i < deferred_fns_used; ++i)
2702 tree decl = VARRAY_TREE (deferred_fns, i);
2704 /* Does it need synthesizing? */
2705 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
2707 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
2709 /* Even though we're already at the top-level, we push
2710 there again. That way, when we pop back a few lines
2711 hence, all of our state is restored. Otherwise,
2712 finish_function doesn't clean things up, and we end
2713 up with CURRENT_FUNCTION_DECL set. */
2714 push_to_top_level ();
2715 synthesize_method (decl);
2716 pop_from_top_level ();
2720 /* If the function has no body, avoid calling
2721 import_export_decl. On a system without weak symbols,
2722 calling import_export_decl will make an inline template
2723 instantiation "static", which will result in errors about
2724 the use of undefined functions if there is no body for
2726 if (!DECL_SAVED_TREE (decl))
2729 import_export_decl (decl);
2731 /* We lie to the back-end, pretending that some functions
2732 are not defined when they really are. This keeps these
2733 functions from being put out unnecessarily. But, we must
2734 stop lying when the functions are referenced, or if they
2735 are not comdat since they need to be put out now. This
2736 is done in a separate for cycle, because if some deferred
2737 function is contained in another deferred function later
2738 in deferred_fns varray, rest_of_compilation would skip
2739 this function and we really cannot expand the same
2741 if (DECL_NOT_REALLY_EXTERN (decl)
2742 && DECL_INITIAL (decl)
2743 && DECL_NEEDED_P (decl))
2744 DECL_EXTERNAL (decl) = 0;
2746 /* If we're going to need to write this function out, and
2747 there's already a body for it, create RTL for it now.
2748 (There might be no body if this is a method we haven't
2749 gotten around to synthesizing yet.) */
2750 if (!DECL_EXTERNAL (decl)
2751 && DECL_NEEDED_P (decl)
2752 && DECL_SAVED_TREE (decl)
2753 && !TREE_ASM_WRITTEN (decl)
2754 && (!flag_unit_at_a_time
2755 || !cgraph_node (decl)->local.finalized))
2757 /* We will output the function; no longer consider it in this
2759 DECL_DEFER_OUTPUT (decl) = 0;
2760 /* Generate RTL for this function now that we know we
2762 expand_or_defer_fn (decl);
2763 /* If we're compiling -fsyntax-only pretend that this
2764 function has been written out so that we don't try to
2766 if (flag_syntax_only)
2767 TREE_ASM_WRITTEN (decl) = 1;
2772 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
2775 /* Static data members are just like namespace-scope globals. */
2776 for (i = 0; i < pending_statics_used; ++i)
2778 tree decl = VARRAY_TREE (pending_statics, i);
2779 if (var_finalized_p (decl))
2781 import_export_decl (decl);
2782 if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
2783 DECL_EXTERNAL (decl) = 0;
2786 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
2787 pending_statics_used))
2790 if (cgraph_assemble_pending_functions ())
2795 /* All used inline functions must have a definition at this point. */
2796 for (i = 0; i < deferred_fns_used; ++i)
2798 tree decl = VARRAY_TREE (deferred_fns, i);
2800 if (TREE_USED (decl) && DECL_DECLARED_INLINE_P (decl)
2801 && !(TREE_ASM_WRITTEN (decl) || DECL_SAVED_TREE (decl)
2802 /* An explicit instantiation can be used to specify
2803 that the body is in another unit. It will have
2804 already verified there was a definition. */
2805 || DECL_EXPLICIT_INSTANTIATION (decl)))
2807 cp_warning_at ("inline function `%D' used but never defined", decl);
2808 /* This symbol is effectively an "extern" declaration now.
2809 This is not strictly necessary, but removes a duplicate
2811 TREE_PUBLIC (decl) = 1;
2816 /* We give C linkage to static constructors and destructors. */
2817 push_lang_context (lang_name_c);
2819 /* Generate initialization and destruction functions for all
2820 priorities for which they are required. */
2821 if (priority_info_map)
2822 splay_tree_foreach (priority_info_map,
2823 generate_ctor_and_dtor_functions_for_priority,
2829 generate_ctor_or_dtor_function (/*constructor_p=*/true,
2830 DEFAULT_INIT_PRIORITY, &locus);
2832 generate_ctor_or_dtor_function (/*constructor_p=*/false,
2833 DEFAULT_INIT_PRIORITY, &locus);
2836 /* We're done with the splay-tree now. */
2837 if (priority_info_map)
2838 splay_tree_delete (priority_info_map);
2840 /* We're done with static constructors, so we can go back to "C++"
2842 pop_lang_context ();
2844 if (flag_unit_at_a_time)
2846 cgraph_finalize_compilation_unit ();
2850 /* Now, issue warnings about static, but not defined, functions,
2851 etc., and emit debugging information. */
2852 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
2853 if (pending_statics)
2854 check_global_declarations (&VARRAY_TREE (pending_statics, 0),
2855 pending_statics_used);
2859 /* The entire file is now complete. If requested, dump everything
2863 FILE *stream = dump_begin (TDI_all, &flags);
2867 dump_node (global_namespace, flags & ~TDF_SLIM, stream);
2868 dump_end (TDI_all, stream);
2872 timevar_pop (TV_VARCONST);
2874 if (flag_detailed_statistics)
2876 dump_tree_statistics ();
2877 dump_time_statistics ();
2879 input_location = locus;
2881 #ifdef ENABLE_CHECKING
2882 validate_conversion_obstack ();
2883 #endif /* ENABLE_CHECKING */
2886 /* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the
2887 function to call in parse-tree form; it has not yet been
2888 semantically analyzed. ARGS are the arguments to the function.
2889 They have already been semantically analyzed. */
2892 build_offset_ref_call_from_tree (tree fn, tree args)
2901 object = TREE_OPERAND (fn, 0);
2903 if (processing_template_decl)
2905 my_friendly_assert (TREE_CODE (fn) == DOTSTAR_EXPR
2906 || TREE_CODE (fn) == MEMBER_REF,
2908 if (type_dependent_expression_p (fn)
2909 || any_type_dependent_arguments_p (args))
2910 return build_min_nt (CALL_EXPR, fn, args);
2912 /* Transform the arguments and add the implicit "this"
2913 parameter. That must be done before the FN is transformed
2914 because we depend on the form of FN. */
2915 args = build_non_dependent_args (args);
2916 if (TREE_CODE (fn) == DOTSTAR_EXPR)
2917 object = build_unary_op (ADDR_EXPR, object, 0);
2918 object = build_non_dependent_expr (object);
2919 args = tree_cons (NULL_TREE, object, args);
2920 /* Now that the arguments are done, transform FN. */
2921 fn = build_non_dependent_expr (fn);
2924 /* A qualified name corresponding to a bound pointer-to-member is
2925 represented as an OFFSET_REF:
2927 struct B { void g(); };
2929 void B::g() { (this->*p)(); } */
2930 if (TREE_CODE (fn) == OFFSET_REF)
2932 tree object_addr = build_unary_op (ADDR_EXPR, object, 0);
2933 fn = TREE_OPERAND (fn, 1);
2934 fn = get_member_function_from_ptrfunc (&object_addr, fn);
2935 args = tree_cons (NULL_TREE, object_addr, args);
2938 expr = build_function_call (fn, args);
2939 if (processing_template_decl && expr != error_mark_node)
2940 return build_min_non_dep (CALL_EXPR, expr, orig_fn, orig_args);
2946 check_default_args (tree x)
2948 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
2949 bool saw_def = false;
2950 int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
2951 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
2953 if (TREE_PURPOSE (arg))
2957 cp_error_at ("default argument missing for parameter %P of `%+#D'",
2965 mark_used (tree decl)
2967 TREE_USED (decl) = 1;
2968 if (processing_template_decl || skip_evaluation)
2971 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl)
2972 && !TREE_ASM_WRITTEN (decl))
2973 /* Remember it, so we can check it was defined. */
2976 assemble_external (decl);
2978 /* Is it a synthesized method that needs to be synthesized? */
2979 if (TREE_CODE (decl) == FUNCTION_DECL
2980 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
2981 && DECL_ARTIFICIAL (decl)
2982 && !DECL_THUNK_P (decl)
2983 && ! DECL_INITIAL (decl)
2984 /* Kludge: don't synthesize for default args. */
2985 && current_function_decl)
2987 synthesize_method (decl);
2988 /* If we've already synthesized the method we don't need to
2989 instantiate it, so we can return right away. */
2993 /* If this is a function or variable that is an instance of some
2994 template, we now know that we will need to actually do the
2995 instantiation. We check that DECL is not an explicit
2996 instantiation because that is not checked in instantiate_decl. */
2997 if ((DECL_NON_THUNK_FUNCTION_P (decl) || TREE_CODE (decl) == VAR_DECL)
2998 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
2999 && (!DECL_EXPLICIT_INSTANTIATION (decl)
3000 || (TREE_CODE (decl) == FUNCTION_DECL
3001 && DECL_INLINE (DECL_TEMPLATE_RESULT
3002 (template_for_substitution (decl))))))
3006 /* Normally, we put off instantiating functions in order to
3007 improve compile times. Maintaining a stack of active
3008 functions is expensive, and the inliner knows to
3009 instantiate any functions it might need.
3011 However, if instantiating this function might help us mark
3012 the current function TREE_NOTHROW, we go ahead and
3015 This is not needed for unit-at-a-time since we reorder the functions
3016 in topological order anyway.
3018 defer = (!flag_exceptions
3019 || flag_unit_at_a_time
3021 || TREE_CODE (decl) != FUNCTION_DECL
3022 /* If the called function can't throw, we don't need to
3023 generate its body to find that out. */
3024 || TREE_NOTHROW (decl)
3026 /* If we already know the current function can't throw,
3027 then we don't need to work hard to prove it. */
3028 || TREE_NOTHROW (current_function_decl)
3029 /* If we already know that the current function *can*
3030 throw, there's no point in gathering more
3032 || cp_function_chain->can_throw);
3034 instantiate_decl (decl, defer);
3038 #include "gt-cp-decl2.h"