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) = DECL_ARGUMENTS (function);
340 DECL_ARGUMENTS (function) = parm;
343 DECL_CONTEXT (function) = ctype;
345 if (flags == DTOR_FLAG)
346 DECL_DESTRUCTOR_P (function) = 1;
348 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
349 maybe_retrofit_in_chrg (function);
352 /* Create an ARRAY_REF, checking for the user doing things backwards
356 grok_array_decl (tree array_expr, tree index_exp)
360 tree orig_array_expr = array_expr;
361 tree orig_index_exp = index_exp;
363 if (error_operand_p (array_expr) || error_operand_p (index_exp))
364 return error_mark_node;
366 if (processing_template_decl)
368 if (type_dependent_expression_p (array_expr)
369 || type_dependent_expression_p (index_exp))
370 return build_min_nt (ARRAY_REF, array_expr, index_exp);
371 array_expr = build_non_dependent_expr (array_expr);
372 index_exp = build_non_dependent_expr (index_exp);
375 type = TREE_TYPE (array_expr);
376 my_friendly_assert (type, 20030626);
377 type = non_reference (type);
379 /* If they have an `operator[]', use that. */
380 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
381 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL,
382 array_expr, index_exp, NULL_TREE,
383 /*overloaded_p=*/NULL);
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;
452 TREE_SIDE_EFFECTS (t) = 1;
456 exp = convert_from_reference (exp);
458 /* An array can't have been allocated by new, so complain. */
459 if (TREE_CODE (exp) == VAR_DECL
460 && TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
461 warning ("deleting array `%#D'", exp);
463 t = build_expr_type_conversion (WANT_POINTER, exp, true);
465 if (t == NULL_TREE || t == error_mark_node)
467 error ("type `%#T' argument given to `delete', expected pointer",
469 return error_mark_node;
472 type = TREE_TYPE (t);
474 /* As of Valley Forge, you can delete a pointer to const. */
476 /* You can't delete functions. */
477 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
479 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
480 return error_mark_node;
483 /* Deleting ptr to void is undefined behavior [expr.delete/3]. */
484 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
486 warning ("deleting `%T' is undefined", type);
490 /* Deleting a pointer with the value zero is valid and has no effect. */
491 if (integer_zerop (t))
492 return build1 (NOP_EXPR, void_type_node, t);
495 return build_vec_delete (t, /*maxindex=*/NULL_TREE,
496 sfk_deleting_destructor,
499 return build_delete (type, t, sfk_deleting_destructor,
500 LOOKUP_NORMAL, use_global_delete);
503 /* Report an error if the indicated template declaration is not the
504 sort of thing that should be a member template. */
507 check_member_template (tree tmpl)
511 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
512 decl = DECL_TEMPLATE_RESULT (tmpl);
514 if (TREE_CODE (decl) == FUNCTION_DECL
515 || (TREE_CODE (decl) == TYPE_DECL
516 && IS_AGGR_TYPE (TREE_TYPE (decl))))
518 if (current_function_decl)
519 /* 14.5.2.2 [temp.mem]
521 A local class shall not have member templates. */
522 error ("invalid declaration of member template `%#D' in local class",
525 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
527 /* 14.5.2.3 [temp.mem]
529 A member function template shall not be virtual. */
531 ("invalid use of `virtual' in template declaration of `%#D'",
533 DECL_VIRTUAL_P (decl) = 0;
536 /* The debug-information generating code doesn't know what to do
537 with member templates. */
538 DECL_IGNORED_P (tmpl) = 1;
541 error ("template declaration of `%#D'", decl);
544 /* Return true iff TYPE is a valid Java parameter or return type. */
547 acceptable_java_type (tree type)
549 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
551 if (TREE_CODE (type) == POINTER_TYPE || TREE_CODE (type) == REFERENCE_TYPE)
553 type = TREE_TYPE (type);
554 if (TREE_CODE (type) == RECORD_TYPE)
557 if (! TYPE_FOR_JAVA (type))
559 if (! CLASSTYPE_TEMPLATE_INFO (type))
561 args = CLASSTYPE_TI_ARGS (type);
562 i = TREE_VEC_LENGTH (args);
565 type = TREE_VEC_ELT (args, i);
566 if (TREE_CODE (type) == POINTER_TYPE)
567 type = TREE_TYPE (type);
568 if (! TYPE_FOR_JAVA (type))
577 /* For a METHOD in a Java class CTYPE, return true if
578 the parameter and return types are valid Java types.
579 Otherwise, print appropriate error messages, and return false. */
582 check_java_method (tree method)
585 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
586 tree ret_type = TREE_TYPE (TREE_TYPE (method));
588 if (!acceptable_java_type (ret_type))
590 error ("Java method '%D' has non-Java return type `%T'",
595 arg_types = TREE_CHAIN (arg_types);
596 if (DECL_HAS_IN_CHARGE_PARM_P (method))
597 arg_types = TREE_CHAIN (arg_types);
598 if (DECL_HAS_VTT_PARM_P (method))
599 arg_types = TREE_CHAIN (arg_types);
601 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
603 tree type = TREE_VALUE (arg_types);
604 if (!acceptable_java_type (type))
606 error ("Java method '%D' has non-Java parameter type `%T'",
614 /* Sanity check: report error if this function FUNCTION is not
615 really a member of the class (CTYPE) it is supposed to belong to.
616 CNAME is the same here as it is for grokclassfn above.
617 TEMPLATE_HEADER_P is true when this declaration comes with a
621 check_classfn (tree ctype, tree function, bool template_header_p)
626 if (DECL_USE_TEMPLATE (function)
627 && !(TREE_CODE (function) == TEMPLATE_DECL
628 && DECL_TEMPLATE_SPECIALIZATION (function))
629 && is_member_template (DECL_TI_TEMPLATE (function)))
630 /* Since this is a specialization of a member template,
631 we're not going to find the declaration in the class.
634 struct S { template <typename T> void f(T); };
635 template <> void S::f(int);
637 we're not going to find `S::f(int)', but there's no
638 reason we should, either. We let our callers know we didn't
639 find the method, but we don't complain. */
642 /* OK, is this a definition of a member template? */
643 is_template = (TREE_CODE (function) == TEMPLATE_DECL
644 || template_header_p);
646 ix = lookup_fnfields_1 (complete_type (ctype),
647 DECL_CONSTRUCTOR_P (function) ? ctor_identifier :
648 DECL_DESTRUCTOR_P (function) ? dtor_identifier :
649 DECL_NAME (function));
653 tree methods = CLASSTYPE_METHOD_VEC (ctype);
654 tree fndecls, fndecl = 0;
657 const char *format = NULL;
659 pop_p = push_scope (ctype);
660 for (fndecls = TREE_VEC_ELT (methods, ix);
661 fndecls; fndecls = OVL_NEXT (fndecls))
665 fndecl = OVL_CURRENT (fndecls);
666 p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
667 p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
669 /* We cannot simply call decls_match because this doesn't
670 work for static member functions that are pretending to
671 be methods, and because the name may have been changed by
674 /* Get rid of the this parameter on functions that become
676 if (DECL_STATIC_FUNCTION_P (fndecl)
677 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
678 p1 = TREE_CHAIN (p1);
680 /* A member template definition only matches a member template
682 if (is_template != (TREE_CODE (fndecl) == TEMPLATE_DECL))
685 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
686 TREE_TYPE (TREE_TYPE (fndecl)))
687 && compparms (p1, p2)
688 && (DECL_TEMPLATE_SPECIALIZATION (function)
689 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
690 && (!DECL_TEMPLATE_SPECIALIZATION (function)
691 || (DECL_TI_TEMPLATE (function)
692 == DECL_TI_TEMPLATE (fndecl))))
698 return OVL_CURRENT (fndecls);
699 error ("prototype for `%#D' does not match any in class `%T'",
701 is_conv_op = DECL_CONV_FN_P (fndecl);
704 ix = CLASSTYPE_FIRST_CONVERSION_SLOT;
705 fndecls = TREE_VEC_ELT (methods, ix);
708 fndecl = OVL_CURRENT (fndecls);
709 fndecls = OVL_NEXT (fndecls);
711 if (!fndecls && is_conv_op)
713 if (TREE_VEC_LENGTH (methods) > ix)
716 fndecls = TREE_VEC_ELT (methods, ix);
717 if (!DECL_CONV_FN_P (OVL_CURRENT (fndecls)))
729 format = "candidates are: %#D";
731 format = "candidate is: %#D";
732 cp_error_at (format, fndecl);
735 else if (!COMPLETE_TYPE_P (ctype))
736 cxx_incomplete_type_error (function, ctype);
738 error ("no `%#D' member function declared in class `%T'",
741 /* If we did not find the method in the class, add it to avoid
742 spurious errors (unless the CTYPE is not yet defined, in which
743 case we'll only confuse ourselves when the function is declared
744 properly within the class. */
745 if (COMPLETE_TYPE_P (ctype))
746 add_method (ctype, function, /*error_p=*/1);
750 /* We have just processed the DECL, which is a static data member.
751 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
752 present, is the assembly-language name for the data member.
753 FLAGS is as for cp_finish_decl. */
756 finish_static_data_member_decl (tree decl, tree init, tree asmspec_tree,
759 my_friendly_assert (TREE_PUBLIC (decl), 0);
761 DECL_CONTEXT (decl) = current_class_type;
763 /* We cannot call pushdecl here, because that would fill in the
764 TREE_CHAIN of our decl. Instead, we modify cp_finish_decl to do
765 the right thing, namely, to put this decl out straight away. */
766 /* current_class_type can be NULL_TREE in case of error. */
767 if (!asmspec_tree && current_class_type)
768 DECL_INITIAL (decl) = error_mark_node;
770 if (! processing_template_decl)
772 if (!pending_statics)
773 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
774 VARRAY_PUSH_TREE (pending_statics, decl);
777 if (LOCAL_CLASS_P (current_class_type))
778 pedwarn ("local class `%#T' shall not have static data member `%#D'",
779 current_class_type, decl);
781 /* Static consts need not be initialized in the class definition. */
782 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
784 static int explained = 0;
786 error ("initializer invalid for static member with constructor");
789 error ("(an out of class initialization is required)");
794 /* Force the compiler to know when an uninitialized static const
795 member is being used. */
796 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
797 TREE_USED (decl) = 1;
798 DECL_INITIAL (decl) = init;
799 DECL_IN_AGGR_P (decl) = 1;
801 cp_finish_decl (decl, init, asmspec_tree, flags);
804 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
805 of a structure component, returning a _DECL node.
806 QUALS is a list of type qualifiers for this decl (such as for declaring
807 const member functions).
809 This is done during the parsing of the struct declaration.
810 The _DECL nodes are chained together and the lot of them
811 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
813 If class A defines that certain functions in class B are friends, then
814 the way I have set things up, it is B who is interested in permission
815 granted by A. However, it is in A's context that these declarations
816 are parsed. By returning a void_type_node, class A does not attempt
817 to incorporate the declarations of the friends within its structure.
819 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
820 CHANGES TO CODE IN `start_method'. */
823 grokfield (tree declarator, tree declspecs, tree init, tree asmspec_tree,
827 const char *asmspec = 0;
828 int flags = LOOKUP_ONLYCONVERTING;
830 if (declspecs == NULL_TREE
831 && TREE_CODE (declarator) == SCOPE_REF
832 && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
834 /* Access declaration */
835 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
837 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
839 return do_class_using_decl (declarator);
843 && TREE_CODE (init) == TREE_LIST
844 && TREE_VALUE (init) == error_mark_node
845 && TREE_CHAIN (init) == NULL_TREE)
848 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist);
849 if (! value || error_operand_p (value))
850 /* friend or constructor went bad. */
851 return error_mark_node;
853 if (TREE_CODE (value) == TYPE_DECL && init)
855 error ("typedef `%D' is initialized (use __typeof__ instead)", value);
859 /* Pass friendly classes back. */
860 if (value == void_type_node)
863 /* Pass friend decls back. */
864 if ((TREE_CODE (value) == FUNCTION_DECL
865 || TREE_CODE (value) == TEMPLATE_DECL)
866 && DECL_CONTEXT (value) != current_class_type)
869 if (DECL_NAME (value) != NULL_TREE
870 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
871 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
872 error ("member `%D' conflicts with virtual function table field name",
875 /* Stash away type declarations. */
876 if (TREE_CODE (value) == TYPE_DECL)
878 DECL_NONLOCAL (value) = 1;
879 DECL_CONTEXT (value) = current_class_type;
881 if (processing_template_decl)
882 value = push_template_decl (value);
887 if (DECL_IN_AGGR_P (value))
889 error ("`%D' is already defined in `%T'", value,
890 DECL_CONTEXT (value));
891 return void_type_node;
895 asmspec = TREE_STRING_POINTER (asmspec_tree);
899 if (TREE_CODE (value) == FUNCTION_DECL)
901 grok_function_init (value, init);
904 else if (pedantic && TREE_CODE (value) != VAR_DECL)
905 /* Already complained in grokdeclarator. */
909 /* We allow initializers to become parameters to base
911 if (TREE_CODE (init) == TREE_LIST)
913 if (TREE_CHAIN (init) == NULL_TREE)
914 init = TREE_VALUE (init);
916 init = digest_init (TREE_TYPE (value), init, (tree *)0);
919 if (!processing_template_decl)
921 if (TREE_CODE (init) == CONST_DECL)
922 init = DECL_INITIAL (init);
923 else if (TREE_READONLY_DECL_P (init))
924 init = decl_constant_value (init);
925 else if (TREE_CODE (init) == CONSTRUCTOR)
926 init = digest_init (TREE_TYPE (value), init, (tree *)0);
927 if (init != error_mark_node && ! TREE_CONSTANT (init))
929 /* We can allow references to things that are effectively
930 static, since references are initialized with the
932 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
933 || (TREE_STATIC (init) == 0
934 && (!DECL_P (init) || DECL_EXTERNAL (init) == 0)))
936 error ("field initializer is not constant");
937 init = error_mark_node;
944 if (processing_template_decl
945 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
947 value = push_template_decl (value);
948 if (error_operand_p (value))
949 return error_mark_node;
953 cplus_decl_attributes (&value, attrlist, 0);
955 if (TREE_CODE (value) == VAR_DECL)
957 finish_static_data_member_decl (value, init, asmspec_tree,
961 if (TREE_CODE (value) == FIELD_DECL)
964 error ("`asm' specifiers are not permitted on non-static data members");
965 if (DECL_INITIAL (value) == error_mark_node)
966 init = error_mark_node;
967 cp_finish_decl (value, init, NULL_TREE, flags);
968 DECL_INITIAL (value) = init;
969 DECL_IN_AGGR_P (value) = 1;
972 if (TREE_CODE (value) == FUNCTION_DECL)
976 /* This must override the asm specifier which was placed
977 by grokclassfn. Lay this out fresh. */
978 SET_DECL_RTL (value, NULL_RTX);
979 change_decl_assembler_name (value, get_identifier (asmspec));
981 if (!DECL_FRIEND_P (value))
982 grok_special_member_properties (value);
984 cp_finish_decl (value, init, asmspec_tree, flags);
986 /* Pass friends back this way. */
987 if (DECL_FRIEND_P (value))
988 return void_type_node;
990 DECL_IN_AGGR_P (value) = 1;
998 /* Like `grokfield', but for bitfields.
999 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1002 grokbitfield (tree declarator, tree declspecs, tree width)
1004 tree value = grokdeclarator (declarator, declspecs, BITFIELD, 0, NULL);
1006 if (! value) return NULL_TREE; /* friends went bad. */
1008 /* Pass friendly classes back. */
1009 if (TREE_CODE (value) == VOID_TYPE)
1010 return void_type_node;
1012 if (TREE_CODE (value) == TYPE_DECL)
1014 error ("cannot declare `%D' to be a bit-field type", value);
1018 /* Usually, finish_struct_1 catches bitfields with invalid types.
1019 But, in the case of bitfields with function type, we confuse
1020 ourselves into thinking they are member functions, so we must
1022 if (TREE_CODE (value) == FUNCTION_DECL)
1024 error ("cannot declare bit-field `%D' with function type",
1029 if (DECL_IN_AGGR_P (value))
1031 error ("`%D' is already defined in the class %T", value,
1032 DECL_CONTEXT (value));
1033 return void_type_node;
1036 if (TREE_STATIC (value))
1038 error ("static member `%D' cannot be a bit-field", value);
1041 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1043 if (width != error_mark_node)
1045 constant_expression_warning (width);
1046 DECL_INITIAL (value) = width;
1047 SET_DECL_C_BIT_FIELD (value);
1050 DECL_IN_AGGR_P (value) = 1;
1054 /* When a function is declared with an initializer,
1055 do the right thing. Currently, there are two possibilities:
1060 // initialization possibility #1.
1061 virtual void f () = 0;
1083 // initialization possibility #2
1090 grok_function_init (tree decl, tree init)
1092 /* An initializer for a function tells how this function should
1094 tree type = TREE_TYPE (decl);
1096 if (TREE_CODE (type) == FUNCTION_TYPE)
1097 error ("initializer specified for non-member function `%D'", decl);
1098 else if (integer_zerop (init))
1099 DECL_PURE_VIRTUAL_P (decl) = 1;
1101 error ("invalid initializer for virtual method `%D'", decl);
1105 cplus_decl_attributes (tree *decl, tree attributes, int flags)
1107 if (*decl == NULL_TREE || *decl == void_type_node)
1110 if (TREE_CODE (*decl) == TEMPLATE_DECL)
1111 decl = &DECL_TEMPLATE_RESULT (*decl);
1113 decl_attributes (decl, attributes, flags);
1115 if (TREE_CODE (*decl) == TYPE_DECL)
1116 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl));
1119 /* Defer the compilation of the FN until the end of compilation. */
1124 if (DECL_DEFERRED_FN (fn))
1126 DECL_DEFERRED_FN (fn) = 1;
1127 DECL_DEFER_OUTPUT (fn) = 1;
1129 VARRAY_TREE_INIT (deferred_fns, 32, "deferred_fns");
1131 VARRAY_PUSH_TREE (deferred_fns, fn);
1134 /* Walks through the namespace- or function-scope anonymous union OBJECT,
1135 building appropriate ALIAS_DECLs. Returns one of the fields for use in
1136 the mangled name. */
1139 build_anon_union_vars (tree object)
1141 tree type = TREE_TYPE (object);
1142 tree main_decl = NULL_TREE;
1145 /* Rather than write the code to handle the non-union case,
1146 just give an error. */
1147 if (TREE_CODE (type) != UNION_TYPE)
1148 error ("anonymous struct not inside named type");
1150 for (field = TYPE_FIELDS (type);
1152 field = TREE_CHAIN (field))
1157 if (DECL_ARTIFICIAL (field))
1159 if (TREE_CODE (field) != FIELD_DECL)
1162 `%#D' invalid; an anonymous union can only have non-static data members",
1167 if (TREE_PRIVATE (field))
1168 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
1169 else if (TREE_PROTECTED (field))
1170 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
1172 if (processing_template_decl)
1173 ref = build_min_nt (COMPONENT_REF, object, DECL_NAME (field));
1175 ref = build_class_member_access_expr (object, field, NULL_TREE,
1178 if (DECL_NAME (field))
1180 decl = build_decl (ALIAS_DECL, DECL_NAME (field), TREE_TYPE (field));
1181 DECL_INITIAL (decl) = ref;
1182 TREE_PUBLIC (decl) = 0;
1183 TREE_STATIC (decl) = 0;
1184 DECL_EXTERNAL (decl) = 1;
1185 decl = pushdecl (decl);
1187 else if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1188 decl = build_anon_union_vars (ref);
1192 if (main_decl == NULL_TREE)
1199 /* Finish off the processing of a UNION_TYPE structure. If the union is an
1200 anonymous union, then all members must be laid out together. PUBLIC_P
1201 is nonzero if this union is not declared static. */
1204 finish_anon_union (tree anon_union_decl)
1206 tree type = TREE_TYPE (anon_union_decl);
1208 bool public_p = TREE_PUBLIC (anon_union_decl);
1210 /* The VAR_DECL's context is the same as the TYPE's context. */
1211 DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type));
1213 if (TYPE_FIELDS (type) == NULL_TREE)
1218 error ("namespace-scope anonymous aggregates must be static");
1222 main_decl = build_anon_union_vars (anon_union_decl);
1223 if (main_decl == NULL_TREE)
1225 warning ("anonymous union with no members");
1229 if (!processing_template_decl)
1231 /* Use main_decl to set the mangled name. */
1232 DECL_NAME (anon_union_decl) = DECL_NAME (main_decl);
1233 mangle_decl (anon_union_decl);
1234 DECL_NAME (anon_union_decl) = NULL_TREE;
1237 pushdecl (anon_union_decl);
1238 if (building_stmt_tree ()
1239 && at_function_scope_p ())
1240 add_decl_stmt (anon_union_decl);
1241 else if (!processing_template_decl)
1242 rest_of_decl_compilation (anon_union_decl, NULL,
1243 toplevel_bindings_p (), at_eof);
1246 /* Auxiliary functions to make type signatures for
1247 `operator new' and `operator delete' correspond to
1248 what compiler will be expecting. */
1251 coerce_new_type (tree type)
1254 tree args = TYPE_ARG_TYPES (type);
1256 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1258 if (!same_type_p (TREE_TYPE (type), ptr_type_node))
1259 e = 1, error ("`operator new' must return type `%T'", ptr_type_node);
1261 if (!args || args == void_list_node
1262 || !same_type_p (TREE_VALUE (args), size_type_node))
1265 if (args && args != void_list_node)
1266 args = TREE_CHAIN (args);
1267 pedwarn ("`operator new' takes type `size_t' (`%T') as first parameter", size_type_node);
1272 args = tree_cons (NULL_TREE, size_type_node, args);
1275 type = build_exception_variant
1276 (build_function_type (ptr_type_node, args),
1277 TYPE_RAISES_EXCEPTIONS (type));
1285 coerce_delete_type (tree type)
1288 tree args = TYPE_ARG_TYPES (type);
1290 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1292 if (!same_type_p (TREE_TYPE (type), void_type_node))
1293 e = 1, error ("`operator delete' must return type `%T'", void_type_node);
1295 if (!args || args == void_list_node
1296 || !same_type_p (TREE_VALUE (args), ptr_type_node))
1299 if (args && args != void_list_node)
1300 args = TREE_CHAIN (args);
1301 error ("`operator delete' takes type `%T' as first parameter", ptr_type_node);
1306 args = tree_cons (NULL_TREE, ptr_type_node, args);
1309 type = build_exception_variant
1310 (build_function_type (void_type_node, args),
1311 TYPE_RAISES_EXCEPTIONS (type));
1320 mark_vtable_entries (tree decl)
1322 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
1324 for (; entries; entries = TREE_CHAIN (entries))
1326 tree fnaddr = TREE_VALUE (entries);
1329 STRIP_NOPS (fnaddr);
1331 if (TREE_CODE (fnaddr) != ADDR_EXPR
1332 && TREE_CODE (fnaddr) != FDESC_EXPR)
1333 /* This entry is an offset: a virtual base class offset, a
1334 virtual call offset, an RTTI offset, etc. */
1337 fn = TREE_OPERAND (fnaddr, 0);
1338 TREE_ADDRESSABLE (fn) = 1;
1339 /* When we don't have vcall offsets, we output thunks whenever
1340 we output the vtables that contain them. With vcall offsets,
1341 we know all the thunks we'll need when we emit a virtual
1342 function, so we emit the thunks there instead. */
1343 if (DECL_THUNK_P (fn))
1344 use_thunk (fn, /*emit_p=*/0);
1349 /* Set DECL up to have the closest approximation of "initialized common"
1350 linkage available. */
1353 comdat_linkage (tree decl)
1356 make_decl_one_only (decl);
1357 else if (TREE_CODE (decl) == FUNCTION_DECL
1358 || (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)))
1359 /* We can just emit function and compiler-generated variables
1360 statically; having multiple copies is (for the most part) only
1363 There are two correctness issues, however: the address of a
1364 template instantiation with external linkage should be the
1365 same, independent of what translation unit asks for the
1366 address, and this will not hold when we emit multiple copies of
1367 the function. However, there's little else we can do.
1369 Also, by default, the typeinfo implementation assumes that
1370 there will be only one copy of the string used as the name for
1371 each type. Therefore, if weak symbols are unavailable, the
1372 run-time library should perform a more conservative check; it
1373 should perform a string comparison, rather than an address
1375 TREE_PUBLIC (decl) = 0;
1378 /* Static data member template instantiations, however, cannot
1379 have multiple copies. */
1380 if (DECL_INITIAL (decl) == 0
1381 || DECL_INITIAL (decl) == error_mark_node)
1382 DECL_COMMON (decl) = 1;
1383 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
1385 DECL_COMMON (decl) = 1;
1386 DECL_INITIAL (decl) = error_mark_node;
1388 else if (!DECL_EXPLICIT_INSTANTIATION (decl))
1390 /* We can't do anything useful; leave vars for explicit
1392 DECL_EXTERNAL (decl) = 1;
1393 DECL_NOT_REALLY_EXTERN (decl) = 0;
1397 if (DECL_LANG_SPECIFIC (decl))
1398 DECL_COMDAT (decl) = 1;
1401 /* For win32 we also want to put explicit instantiations in
1402 linkonce sections, so that they will be merged with implicit
1403 instantiations; otherwise we get duplicate symbol errors. */
1406 maybe_make_one_only (tree decl)
1408 /* We used to say that this was not necessary on targets that support weak
1409 symbols, because the implicit instantiations will defer to the explicit
1410 one. However, that's not actually the case in SVR4; a strong definition
1411 after a weak one is an error. Also, not making explicit
1412 instantiations one_only means that we can end up with two copies of
1413 some template instantiations. */
1417 /* We can't set DECL_COMDAT on functions, or finish_file will think
1418 we can get away with not emitting them if they aren't used. We need
1419 to for variables so that cp_finish_decl will update their linkage,
1420 because their DECL_INITIAL may not have been set properly yet. */
1422 make_decl_one_only (decl);
1424 if (TREE_CODE (decl) == VAR_DECL)
1426 DECL_COMDAT (decl) = 1;
1427 /* Mark it needed so we don't forget to emit it. */
1428 mark_referenced (DECL_ASSEMBLER_NAME (decl));
1432 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
1433 based on TYPE and other static flags.
1435 Note that anything public is tagged TREE_PUBLIC, whether
1436 it's public in this file or in another one. */
1439 import_export_vtable (tree decl, tree type, int final)
1441 if (DECL_INTERFACE_KNOWN (decl))
1444 if (TYPE_FOR_JAVA (type))
1446 TREE_PUBLIC (decl) = 1;
1447 DECL_EXTERNAL (decl) = 1;
1448 DECL_INTERFACE_KNOWN (decl) = 1;
1450 else if (CLASSTYPE_INTERFACE_KNOWN (type))
1452 TREE_PUBLIC (decl) = 1;
1453 DECL_EXTERNAL (decl) = CLASSTYPE_INTERFACE_ONLY (type);
1454 DECL_INTERFACE_KNOWN (decl) = 1;
1458 /* We can only wait to decide if we have real non-inline virtual
1459 functions in our class, or if we come from a template. */
1461 int found = (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
1462 || CLASSTYPE_KEY_METHOD (type) != NULL_TREE);
1464 if (final || ! found)
1466 comdat_linkage (decl);
1467 DECL_EXTERNAL (decl) = 0;
1471 TREE_PUBLIC (decl) = 1;
1472 DECL_EXTERNAL (decl) = 1;
1477 /* Determine whether or not we want to specifically import or export CTYPE,
1478 using various heuristics. */
1481 import_export_class (tree ctype)
1483 /* -1 for imported, 1 for exported. */
1484 int import_export = 0;
1486 /* It only makes sense to call this function at EOF. The reason is
1487 that this function looks at whether or not the first non-inline
1488 non-abstract virtual member function has been defined in this
1489 translation unit. But, we can't possibly know that until we've
1490 seen the entire translation unit. */
1491 my_friendly_assert (at_eof, 20000226);
1493 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1496 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
1497 we will have CLASSTYPE_INTERFACE_ONLY set but not
1498 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
1499 heuristic because someone will supply a #pragma implementation
1500 elsewhere, and deducing it here would produce a conflict. */
1501 if (CLASSTYPE_INTERFACE_ONLY (ctype))
1504 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
1506 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
1509 /* If we got -fno-implicit-templates, we import template classes that
1510 weren't explicitly instantiated. */
1511 if (import_export == 0
1512 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
1513 && ! flag_implicit_templates)
1516 /* Base our import/export status on that of the first non-inline,
1517 non-pure virtual function, if any. */
1518 if (import_export == 0
1519 && TYPE_POLYMORPHIC_P (ctype))
1521 tree method = CLASSTYPE_KEY_METHOD (ctype);
1523 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
1526 #ifdef MULTIPLE_SYMBOL_SPACES
1527 if (import_export == -1)
1533 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
1534 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
1538 /* Return true if VAR has already been provided to the back end; in that
1539 case VAR should not be modified further by the front end. */
1541 var_finalized_p (tree var)
1543 if (flag_unit_at_a_time)
1544 return cgraph_varpool_node (var)->finalized;
1546 return TREE_ASM_WRITTEN (var);
1549 /* If necessary, write out the vtables for the dynamic class CTYPE.
1550 Returns true if any vtables were emitted. */
1553 maybe_emit_vtables (tree ctype)
1557 bool needed = false;
1559 /* If the vtables for this class have already been emitted there is
1560 nothing more to do. */
1561 primary_vtbl = CLASSTYPE_VTABLES (ctype);
1562 if (var_finalized_p (primary_vtbl))
1564 /* Ignore dummy vtables made by get_vtable_decl. */
1565 if (TREE_TYPE (primary_vtbl) == void_type_node)
1568 import_export_class (ctype);
1569 import_export_vtable (primary_vtbl, ctype, 1);
1571 /* See if any of the vtables are needed. */
1572 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1573 if (!DECL_EXTERNAL (vtbl) && DECL_NEEDED_P (vtbl))
1577 /* If the references to this class' vtables are optimized away,
1578 still emit the appropriate debugging information. See
1580 if (DECL_COMDAT (primary_vtbl)
1581 && CLASSTYPE_DEBUG_REQUESTED (ctype))
1582 note_debug_info_needed (ctype);
1585 else if (TREE_PUBLIC (vtbl) && !DECL_COMDAT (vtbl))
1589 /* The ABI requires that we emit all of the vtables if we emit any
1591 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1594 import_export_vtable (vtbl, ctype, 1);
1595 mark_vtable_entries (vtbl);
1597 /* If we know that DECL is needed, mark it as such for the varpool. */
1599 cgraph_varpool_mark_needed_node (cgraph_varpool_node (vtbl));
1601 if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0)
1603 /* It had better be all done at compile-time. */
1604 if (store_init_value (vtbl, DECL_INITIAL (vtbl)))
1608 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
1610 /* Mark the VAR_DECL node representing the vtable itself as a
1611 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
1612 It is rather important that such things be ignored because
1613 any effort to actually generate DWARF for them will run
1614 into trouble when/if we encounter code like:
1617 struct S { virtual void member (); };
1619 because the artificial declaration of the vtable itself (as
1620 manufactured by the g++ front end) will say that the vtable
1621 is a static member of `S' but only *after* the debug output
1622 for the definition of `S' has already been output. This causes
1623 grief because the DWARF entry for the definition of the vtable
1624 will try to refer back to an earlier *declaration* of the
1625 vtable as a static member of `S' and there won't be one.
1626 We might be able to arrange to have the "vtable static member"
1627 attached to the member list for `S' before the debug info for
1628 `S' get written (which would solve the problem) but that would
1629 require more intrusive changes to the g++ front end. */
1631 DECL_IGNORED_P (vtbl) = 1;
1634 /* Always make vtables weak. */
1636 comdat_linkage (vtbl);
1638 rest_of_decl_compilation (vtbl, NULL, 1, 1);
1640 /* Because we're only doing syntax-checking, we'll never end up
1641 actually marking the variable as written. */
1642 if (flag_syntax_only)
1643 TREE_ASM_WRITTEN (vtbl) = 1;
1646 /* Since we're writing out the vtable here, also write the debug
1648 note_debug_info_needed (ctype);
1653 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
1654 inline function or template instantiation at end-of-file. */
1657 import_export_decl (tree decl)
1659 if (DECL_INTERFACE_KNOWN (decl))
1662 if (DECL_TEMPLATE_INSTANTIATION (decl)
1663 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1665 DECL_NOT_REALLY_EXTERN (decl) = 1;
1666 if ((DECL_IMPLICIT_INSTANTIATION (decl)
1667 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1668 && (flag_implicit_templates
1669 || (flag_implicit_inline_templates
1670 && TREE_CODE (decl) == FUNCTION_DECL
1671 && DECL_DECLARED_INLINE_P (decl))))
1673 if (!TREE_PUBLIC (decl))
1674 /* Templates are allowed to have internal linkage. See
1678 comdat_linkage (decl);
1682 DECL_EXTERNAL (decl) = 1;
1683 DECL_NOT_REALLY_EXTERN (decl) = 0;
1686 else if (DECL_FUNCTION_MEMBER_P (decl))
1688 if (!DECL_DECLARED_INLINE_P (decl))
1690 tree ctype = DECL_CONTEXT (decl);
1691 import_export_class (ctype);
1692 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1694 DECL_NOT_REALLY_EXTERN (decl)
1695 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
1696 || (DECL_DECLARED_INLINE_P (decl)
1697 && ! flag_implement_inlines
1698 && !DECL_VINDEX (decl)));
1700 if (!DECL_NOT_REALLY_EXTERN (decl))
1701 DECL_EXTERNAL (decl) = 1;
1703 /* Always make artificials weak. */
1704 if (DECL_ARTIFICIAL (decl) && flag_weak)
1705 comdat_linkage (decl);
1707 maybe_make_one_only (decl);
1711 comdat_linkage (decl);
1714 comdat_linkage (decl);
1716 DECL_INTERFACE_KNOWN (decl) = 1;
1719 /* Here, we only decide whether or not the tinfo node should be
1720 emitted with the vtable. IS_IN_LIBRARY is nonzero iff the
1721 typeinfo for TYPE should be in the runtime library. */
1724 import_export_tinfo (tree decl, tree type, bool is_in_library)
1726 if (DECL_INTERFACE_KNOWN (decl))
1729 if (IS_AGGR_TYPE (type))
1730 import_export_class (type);
1732 if (IS_AGGR_TYPE (type) && CLASSTYPE_INTERFACE_KNOWN (type)
1733 && TYPE_POLYMORPHIC_P (type)
1734 /* If -fno-rtti, we're not necessarily emitting this stuff with
1735 the class, so go ahead and emit it now. This can happen when
1736 a class is used in exception handling. */
1739 DECL_NOT_REALLY_EXTERN (decl) = !CLASSTYPE_INTERFACE_ONLY (type);
1740 DECL_COMDAT (decl) = 0;
1744 DECL_NOT_REALLY_EXTERN (decl) = 1;
1745 DECL_COMDAT (decl) = 1;
1748 /* Now override some cases. */
1750 DECL_COMDAT (decl) = 1;
1751 else if (is_in_library)
1752 DECL_COMDAT (decl) = 0;
1754 DECL_INTERFACE_KNOWN (decl) = 1;
1757 /* Return an expression that performs the destruction of DECL, which
1758 must be a VAR_DECL whose type has a non-trivial destructor, or is
1759 an array whose (innermost) elements have a non-trivial destructor. */
1762 build_cleanup (tree decl)
1765 tree type = TREE_TYPE (decl);
1767 /* This function should only be called for declarations that really
1768 require cleanups. */
1769 my_friendly_assert (!TYPE_HAS_TRIVIAL_DESTRUCTOR (type), 20030106);
1771 /* Treat all objects with destructors as used; the destructor may do
1772 something substantive. */
1775 if (TREE_CODE (type) == ARRAY_TYPE)
1779 cxx_mark_addressable (decl);
1780 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
1782 temp = build_delete (TREE_TYPE (temp), temp,
1783 sfk_complete_destructor,
1784 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
1788 /* Returns the initialization guard variable for the variable DECL,
1789 which has static storage duration. */
1792 get_guard (tree decl)
1797 sname = mangle_guard_variable (decl);
1798 guard = IDENTIFIER_GLOBAL_VALUE (sname);
1803 /* We use a type that is big enough to contain a mutex as well
1804 as an integer counter. */
1805 guard_type = long_long_integer_type_node;
1806 guard = build_decl (VAR_DECL, sname, guard_type);
1808 /* The guard should have the same linkage as what it guards. */
1809 TREE_PUBLIC (guard) = TREE_PUBLIC (decl);
1810 TREE_STATIC (guard) = TREE_STATIC (decl);
1811 DECL_COMMON (guard) = DECL_COMMON (decl);
1812 DECL_ONE_ONLY (guard) = DECL_ONE_ONLY (decl);
1813 if (TREE_PUBLIC (decl))
1814 DECL_WEAK (guard) = DECL_WEAK (decl);
1816 DECL_ARTIFICIAL (guard) = 1;
1817 TREE_USED (guard) = 1;
1818 pushdecl_top_level_and_finish (guard, NULL_TREE);
1823 /* Return those bits of the GUARD variable that should be set when the
1824 guarded entity is actually initialized. */
1827 get_guard_bits (tree guard)
1829 /* We only set the first byte of the guard, in order to leave room
1830 for a mutex in the high-order bits. */
1831 guard = build1 (ADDR_EXPR,
1832 build_pointer_type (TREE_TYPE (guard)),
1834 guard = build1 (NOP_EXPR,
1835 build_pointer_type (char_type_node),
1837 guard = build1 (INDIRECT_REF, char_type_node, guard);
1842 /* Return an expression which determines whether or not the GUARD
1843 variable has already been initialized. */
1846 get_guard_cond (tree guard)
1850 /* Check to see if the GUARD is zero. */
1851 guard = get_guard_bits (guard);
1852 guard_value = integer_zero_node;
1853 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
1854 guard_value = convert (TREE_TYPE (guard), guard_value);
1855 return cp_build_binary_op (EQ_EXPR, guard, guard_value);
1858 /* Return an expression which sets the GUARD variable, indicating that
1859 the variable being guarded has been initialized. */
1862 set_guard (tree guard)
1866 /* Set the GUARD to one. */
1867 guard = get_guard_bits (guard);
1868 guard_init = integer_one_node;
1869 if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard)))
1870 guard_init = convert (TREE_TYPE (guard), guard_init);
1871 return build_modify_expr (guard, NOP_EXPR, guard_init);
1874 /* Start the process of running a particular set of global constructors
1875 or destructors. Subroutine of do_[cd]tors. */
1878 start_objects (int method_type, int initp)
1884 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
1886 if (initp != DEFAULT_INIT_PRIORITY)
1896 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
1899 sprintf (type, "%c", method_type);
1901 fnname = get_file_function_name_long (type);
1903 start_function (void_list_node,
1904 make_call_declarator (fnname, void_list_node, NULL_TREE,
1906 NULL_TREE, SF_DEFAULT);
1908 /* It can be a static function as long as collect2 does not have
1909 to scan the object file to find its ctor/dtor routine. */
1910 TREE_PUBLIC (current_function_decl) = ! targetm.have_ctors_dtors;
1912 /* Mark this declaration as used to avoid spurious warnings. */
1913 TREE_USED (current_function_decl) = 1;
1915 /* Mark this function as a global constructor or destructor. */
1916 if (method_type == 'I')
1917 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
1919 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
1920 DECL_LANG_SPECIFIC (current_function_decl)->decl_flags.u2sel = 1;
1922 body = begin_compound_stmt (/*has_no_scope=*/false);
1924 /* We cannot allow these functions to be elided, even if they do not
1925 have external linkage. And, there's no point in deferring
1926 compilation of thes functions; they're all going to have to be
1928 current_function_cannot_inline
1929 = "static constructors and destructors cannot be inlined";
1934 /* Finish the process of running a particular set of global constructors
1935 or destructors. Subroutine of do_[cd]tors. */
1938 finish_objects (int method_type, int initp, tree body)
1943 finish_compound_stmt (body);
1944 fn = finish_function (0);
1945 expand_or_defer_fn (fn);
1947 /* When only doing semantic analysis, and no RTL generation, we
1948 can't call functions that directly emit assembly code; there is
1949 no assembly file in which to put the code. */
1950 if (flag_syntax_only)
1953 if (targetm.have_ctors_dtors)
1955 rtx fnsym = XEXP (DECL_RTL (fn), 0);
1956 if (method_type == 'I')
1957 (* targetm.asm_out.constructor) (fnsym, initp);
1959 (* targetm.asm_out.destructor) (fnsym, initp);
1963 /* The names of the parameters to the function created to handle
1964 initializations and destructions for objects with static storage
1966 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
1967 #define PRIORITY_IDENTIFIER "__priority"
1969 /* The name of the function we create to handle initializations and
1970 destructions for objects with static storage duration. */
1971 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
1973 /* The declaration for the __INITIALIZE_P argument. */
1974 static GTY(()) tree initialize_p_decl;
1976 /* The declaration for the __PRIORITY argument. */
1977 static GTY(()) tree priority_decl;
1979 /* The declaration for the static storage duration function. */
1980 static GTY(()) tree ssdf_decl;
1982 /* All the static storage duration functions created in this
1983 translation unit. */
1984 static GTY(()) varray_type ssdf_decls;
1986 /* A map from priority levels to information about that priority
1987 level. There may be many such levels, so efficient lookup is
1989 static splay_tree priority_info_map;
1991 /* Begins the generation of the function that will handle all
1992 initialization and destruction of objects with static storage
1993 duration. The function generated takes two parameters of type
1994 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
1995 nonzero, it performs initializations. Otherwise, it performs
1996 destructions. It only performs those initializations or
1997 destructions with the indicated __PRIORITY. The generated function
2000 It is assumed that this function will only be called once per
2001 translation unit. */
2004 start_static_storage_duration_function (unsigned count)
2009 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2011 /* Create the identifier for this function. It will be of the form
2012 SSDF_IDENTIFIER_<number>. */
2013 sprintf (id, "%s_%u", SSDF_IDENTIFIER, count);
2015 /* Create the parameters. */
2016 parm_types = void_list_node;
2017 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2018 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2019 type = build_function_type (void_type_node, parm_types);
2021 /* Create the FUNCTION_DECL itself. */
2022 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2023 get_identifier (id),
2025 TREE_PUBLIC (ssdf_decl) = 0;
2026 DECL_ARTIFICIAL (ssdf_decl) = 1;
2028 /* Put this function in the list of functions to be called from the
2029 static constructors and destructors. */
2032 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2034 /* Take this opportunity to initialize the map from priority
2035 numbers to information about that priority level. */
2036 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2037 /*delete_key_fn=*/0,
2038 /*delete_value_fn=*/
2039 (splay_tree_delete_value_fn) &free);
2041 /* We always need to generate functions for the
2042 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2043 priorities later, we'll be sure to find the
2044 DEFAULT_INIT_PRIORITY. */
2045 get_priority_info (DEFAULT_INIT_PRIORITY);
2048 VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl);
2050 /* Create the argument list. */
2051 initialize_p_decl = cp_build_parm_decl
2052 (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node);
2053 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2054 TREE_USED (initialize_p_decl) = 1;
2055 priority_decl = cp_build_parm_decl
2056 (get_identifier (PRIORITY_IDENTIFIER), integer_type_node);
2057 DECL_CONTEXT (priority_decl) = ssdf_decl;
2058 TREE_USED (priority_decl) = 1;
2060 TREE_CHAIN (initialize_p_decl) = priority_decl;
2061 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2063 /* Put the function in the global scope. */
2064 pushdecl (ssdf_decl);
2066 /* Start the function itself. This is equivalent to declaring the
2069 static void __ssdf (int __initialize_p, init __priority_p);
2071 It is static because we only need to call this function from the
2072 various constructor and destructor functions for this module. */
2073 start_function (/*specs=*/NULL_TREE,
2075 /*attrs=*/NULL_TREE,
2078 /* Set up the scope of the outermost block in the function. */
2079 body = begin_compound_stmt (/*has_no_scope=*/false);
2081 /* This function must not be deferred because we are depending on
2082 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
2083 current_function_cannot_inline
2084 = "static storage duration functions cannot be inlined";
2089 /* Finish the generation of the function which performs initialization
2090 and destruction of objects with static storage duration. After
2091 this point, no more such objects can be created. */
2094 finish_static_storage_duration_function (tree body)
2096 /* Close out the function. */
2097 finish_compound_stmt (body);
2098 expand_or_defer_fn (finish_function (0));
2101 /* Return the information about the indicated PRIORITY level. If no
2102 code to handle this level has yet been generated, generate the
2103 appropriate prologue. */
2105 static priority_info
2106 get_priority_info (int priority)
2111 n = splay_tree_lookup (priority_info_map,
2112 (splay_tree_key) priority);
2115 /* Create a new priority information structure, and insert it
2117 pi = xmalloc (sizeof (struct priority_info_s));
2118 pi->initializations_p = 0;
2119 pi->destructions_p = 0;
2120 splay_tree_insert (priority_info_map,
2121 (splay_tree_key) priority,
2122 (splay_tree_value) pi);
2125 pi = (priority_info) n->value;
2130 /* Set up to handle the initialization or destruction of DECL. If
2131 INITP is nonzero, we are initializing the variable. Otherwise, we
2132 are destroying it. */
2135 start_static_initialization_or_destruction (tree decl, int initp)
2137 tree guard_if_stmt = NULL_TREE;
2144 /* Figure out the priority for this declaration. */
2145 priority = DECL_INIT_PRIORITY (decl);
2147 priority = DEFAULT_INIT_PRIORITY;
2149 /* Remember that we had an initialization or finalization at this
2151 pi = get_priority_info (priority);
2153 pi->initializations_p = 1;
2155 pi->destructions_p = 1;
2157 /* Trick the compiler into thinking we are at the file and line
2158 where DECL was declared so that error-messages make sense, and so
2159 that the debugger will show somewhat sensible file and line
2161 input_location = DECL_SOURCE_LOCATION (decl);
2167 Access control for implicit calls to the constructors,
2168 the conversion functions, or the destructor called to
2169 create and destroy a static data member is performed as
2170 if these calls appeared in the scope of the member's
2173 we pretend we are in a static member function of the class of
2174 which the DECL is a member. */
2175 if (member_p (decl))
2177 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
2178 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
2181 /* Conditionalize this initialization on being in the right priority
2182 and being initializing/finalizing appropriately. */
2183 guard_if_stmt = begin_if_stmt ();
2184 cond = cp_build_binary_op (EQ_EXPR,
2186 build_int_2 (priority, 0));
2187 init_cond = initp ? integer_one_node : integer_zero_node;
2188 init_cond = cp_build_binary_op (EQ_EXPR,
2191 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
2193 /* Assume we don't need a guard. */
2195 /* We need a guard if this is an object with external linkage that
2196 might be initialized in more than one place. (For example, a
2197 static data member of a template, when the data member requires
2199 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
2200 || DECL_ONE_ONLY (decl)
2201 || DECL_WEAK (decl)))
2205 guard = get_guard (decl);
2207 /* When using __cxa_atexit, we just check the GUARD as we would
2208 for a local static. */
2209 if (flag_use_cxa_atexit)
2211 /* When using __cxa_atexit, we never try to destroy
2212 anything from a static destructor. */
2213 my_friendly_assert (initp, 20000629);
2214 guard_cond = get_guard_cond (guard);
2216 /* If we don't have __cxa_atexit, then we will be running
2217 destructors from .fini sections, or their equivalents. So,
2218 we need to know how many times we've tried to initialize this
2219 object. We do initializations only if the GUARD is zero,
2220 i.e., if we are the first to initialize the variable. We do
2221 destructions only if the GUARD is one, i.e., if we are the
2222 last to destroy the variable. */
2225 = cp_build_binary_op (EQ_EXPR,
2226 build_unary_op (PREINCREMENT_EXPR,
2232 = cp_build_binary_op (EQ_EXPR,
2233 build_unary_op (PREDECREMENT_EXPR,
2238 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, guard_cond);
2241 finish_if_stmt_cond (cond, guard_if_stmt);
2243 /* If we're using __cxa_atexit, we have not already set the GUARD,
2244 so we must do so now. */
2245 if (guard && initp && flag_use_cxa_atexit)
2246 finish_expr_stmt (set_guard (guard));
2248 return guard_if_stmt;
2251 /* We've just finished generating code to do an initialization or
2252 finalization. GUARD_IF_STMT is the if-statement we used to guard
2253 the initialization. */
2256 finish_static_initialization_or_destruction (tree guard_if_stmt)
2258 finish_then_clause (guard_if_stmt);
2261 /* Now that we're done with DECL we don't need to pretend to be a
2262 member of its class any longer. */
2263 DECL_CONTEXT (current_function_decl) = NULL_TREE;
2264 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
2267 /* Generate code to do the initialization of DECL, a VAR_DECL with
2268 static storage duration. The initialization is INIT. */
2271 do_static_initialization (tree decl, tree init)
2275 /* Set up for the initialization. */
2277 = start_static_initialization_or_destruction (decl,
2280 /* Perform the initialization. */
2282 finish_expr_stmt (init);
2284 /* If we're using __cxa_atexit, register a a function that calls the
2285 destructor for the object. */
2286 if (flag_use_cxa_atexit)
2287 register_dtor_fn (decl);
2290 finish_static_initialization_or_destruction (guard_if_stmt);
2293 /* Generate code to do the static destruction of DECL. If DECL may be
2294 initialized more than once in different object files, GUARD is the
2295 guard variable to check. PRIORITY is the priority for the
2299 do_static_destruction (tree decl)
2303 /* If we're using __cxa_atexit, then destructors are registered
2304 immediately after objects are initialized. */
2305 my_friendly_assert (!flag_use_cxa_atexit, 20000121);
2307 /* If we don't need a destructor, there's nothing to do. */
2308 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2311 /* Actually do the destruction. */
2312 guard_if_stmt = start_static_initialization_or_destruction (decl,
2314 finish_expr_stmt (build_cleanup (decl));
2315 finish_static_initialization_or_destruction (guard_if_stmt);
2318 /* VARS is a list of variables with static storage duration which may
2319 need initialization and/or finalization. Remove those variables
2320 that don't really need to be initialized or finalized, and return
2321 the resulting list. The order in which the variables appear in
2322 VARS is in reverse order of the order in which they should actually
2323 be initialized. The list we return is in the unreversed order;
2324 i.e., the first variable should be initialized first. */
2327 prune_vars_needing_no_initialization (tree *vars)
2330 tree result = NULL_TREE;
2335 tree decl = TREE_VALUE (t);
2336 tree init = TREE_PURPOSE (t);
2338 /* Deal gracefully with error. */
2339 if (decl == error_mark_node)
2341 var = &TREE_CHAIN (t);
2345 /* The only things that can be initialized are variables. */
2346 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
2348 /* If this object is not defined, we don't need to do anything
2350 if (DECL_EXTERNAL (decl))
2352 var = &TREE_CHAIN (t);
2356 /* Also, if the initializer already contains errors, we can bail
2358 if (init && TREE_CODE (init) == TREE_LIST
2359 && value_member (error_mark_node, init))
2361 var = &TREE_CHAIN (t);
2365 /* This variable is going to need initialization and/or
2366 finalization, so we add it to the list. */
2367 *var = TREE_CHAIN (t);
2368 TREE_CHAIN (t) = result;
2375 /* Make sure we have told the back end about all the variables in
2379 write_out_vars (tree vars)
2383 for (v = vars; v; v = TREE_CHAIN (v))
2384 if (!var_finalized_p (TREE_VALUE (v)))
2385 rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1);
2388 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
2389 (otherwise) that will initialize all gobal objects with static
2390 storage duration having the indicated PRIORITY. */
2393 generate_ctor_or_dtor_function (bool constructor_p, int priority,
2402 input_location = *locus;
2405 /* We use `I' to indicate initialization and `D' to indicate
2407 function_key = constructor_p ? 'I' : 'D';
2409 /* We emit the function lazily, to avoid generating empty
2410 global constructors and destructors. */
2413 /* Call the static storage duration function with appropriate
2416 for (i = 0; i < ssdf_decls->elements_used; ++i)
2418 fndecl = VARRAY_TREE (ssdf_decls, i);
2420 /* Calls to pure or const functions will expand to nothing. */
2421 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2424 body = start_objects (function_key, priority);
2426 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
2428 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
2430 finish_expr_stmt (build_function_call (fndecl, arguments));
2434 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
2435 calls to any functions marked with attributes indicating that
2436 they should be called at initialization- or destruction-time. */
2437 if (priority == DEFAULT_INIT_PRIORITY)
2441 for (fns = constructor_p ? static_ctors : static_dtors;
2443 fns = TREE_CHAIN (fns))
2445 fndecl = TREE_VALUE (fns);
2447 /* Calls to pure/const functions will expand to nothing. */
2448 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2451 body = start_objects (function_key, priority);
2452 finish_expr_stmt (build_function_call (fndecl, NULL_TREE));
2457 /* Close out the function. */
2459 finish_objects (function_key, priority, body);
2462 /* Generate constructor and destructor functions for the priority
2466 generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data)
2468 location_t *locus = data;
2469 int priority = (int) n->key;
2470 priority_info pi = (priority_info) n->value;
2472 /* Generate the functions themselves, but only if they are really
2474 if (pi->initializations_p
2475 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
2476 generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus);
2477 if (pi->destructions_p
2478 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
2479 generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus);
2481 /* Keep iterating. */
2485 /* Called via LANGHOOK_CALLGRAPH_ANALYZE_EXPR. It is supposed to mark
2486 decls referenced from frontend specific constructs; it will be called
2487 only for language-specific tree nodes.
2489 Here we must deal with member pointers. */
2492 cxx_callgraph_analyze_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2493 tree from ATTRIBUTE_UNUSED)
2497 if (flag_unit_at_a_time)
2498 switch (TREE_CODE (t))
2501 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
2502 cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t)));
2505 if (TREE_CODE (BASELINK_FUNCTIONS (t)) == FUNCTION_DECL)
2506 cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t)));
2516 /* This routine is called from the last rule in yyparse ().
2517 Its job is to create all the code needed to initialize and
2518 destroy the global aggregates. We do the destruction
2519 first, since that way we only need to reverse the decls once. */
2528 unsigned ssdf_count = 0;
2530 locus = input_location;
2533 /* Bad parse errors. Just forget about it. */
2534 if (! global_bindings_p () || current_class_type || decl_namespace_list)
2538 c_common_write_pch ();
2540 /* Otherwise, GDB can get confused, because in only knows
2541 about source for LINENO-1 lines. */
2544 interface_unknown = 1;
2547 /* We now have to write out all the stuff we put off writing out.
2550 o Template specializations that we have not yet instantiated,
2551 but which are needed.
2552 o Initialization and destruction for non-local objects with
2553 static storage duration. (Local objects with static storage
2554 duration are initialized when their scope is first entered,
2555 and are cleaned up via atexit.)
2556 o Virtual function tables.
2558 All of these may cause others to be needed. For example,
2559 instantiating one function may cause another to be needed, and
2560 generating the initializer for an object may cause templates to be
2561 instantiated, etc., etc. */
2563 timevar_push (TV_VARCONST);
2565 emit_support_tinfos ();
2570 size_t n_old, n_new;
2574 /* If there are templates that we've put off instantiating, do
2576 instantiate_pending_templates ();
2579 /* Write out virtual tables as required. Note that writing out
2580 the virtual table for a template class may cause the
2581 instantiation of members of that class. If we write out
2582 vtables then we remove the class from our list so we don't
2583 have to look at it again. */
2585 while (keyed_classes != NULL_TREE
2586 && maybe_emit_vtables (TREE_VALUE (keyed_classes)))
2589 keyed_classes = TREE_CHAIN (keyed_classes);
2595 tree next = TREE_CHAIN (t);
2599 if (maybe_emit_vtables (TREE_VALUE (next)))
2602 TREE_CHAIN (t) = TREE_CHAIN (next);
2607 next = TREE_CHAIN (t);
2611 /* Write out needed type info variables. We have to be careful
2612 looping through unemitted decls, because emit_tinfo_decl may
2613 cause other variables to be needed. We stick new elements
2614 (and old elements that we may need to reconsider) at the end
2615 of the array, then shift them back to the beginning once we're
2618 n_old = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls);
2619 for (i = 0; i < n_old; ++i)
2621 tree tinfo_decl = VARRAY_TREE (unemitted_tinfo_decls, i);
2622 if (emit_tinfo_decl (tinfo_decl))
2625 VARRAY_PUSH_TREE (unemitted_tinfo_decls, tinfo_decl);
2628 /* The only elements we want to keep are the new ones. Copy
2629 them to the beginning of the array, then get rid of the
2631 n_new = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) - n_old;
2633 memmove (&VARRAY_TREE (unemitted_tinfo_decls, 0),
2634 &VARRAY_TREE (unemitted_tinfo_decls, n_old),
2635 n_new * sizeof (tree));
2636 memset (&VARRAY_TREE (unemitted_tinfo_decls, n_new),
2637 0, n_old * sizeof (tree));
2638 VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) = n_new;
2640 /* The list of objects with static storage duration is built up
2641 in reverse order. We clear STATIC_AGGREGATES so that any new
2642 aggregates added during the initialization of these will be
2643 initialized in the correct order when we next come around the
2645 vars = prune_vars_needing_no_initialization (&static_aggregates);
2651 /* We need to start a new initialization function each time
2652 through the loop. That's because we need to know which
2653 vtables have been referenced, and TREE_SYMBOL_REFERENCED
2654 isn't computed until a function is finished, and written
2655 out. That's a deficiency in the back-end. When this is
2656 fixed, these initialization functions could all become
2657 inline, with resulting performance improvements. */
2660 /* Set the line and file, so that it is obviously not from
2662 input_location = locus;
2663 ssdf_body = start_static_storage_duration_function (ssdf_count);
2665 /* Make sure the back end knows about all the variables. */
2666 write_out_vars (vars);
2668 /* First generate code to do all the initializations. */
2669 for (v = vars; v; v = TREE_CHAIN (v))
2670 do_static_initialization (TREE_VALUE (v),
2673 /* Then, generate code to do all the destructions. Do these
2674 in reverse order so that the most recently constructed
2675 variable is the first destroyed. If we're using
2676 __cxa_atexit, then we don't need to do this; functions
2677 were registered at initialization time to destroy the
2679 if (!flag_use_cxa_atexit)
2681 vars = nreverse (vars);
2682 for (v = vars; v; v = TREE_CHAIN (v))
2683 do_static_destruction (TREE_VALUE (v));
2688 /* Finish up the static storage duration function for this
2690 input_location = locus;
2691 finish_static_storage_duration_function (ssdf_body);
2693 /* All those initializations and finalizations might cause
2694 us to need more inline functions, more template
2695 instantiations, etc. */
2701 for (i = 0; i < deferred_fns_used; ++i)
2703 tree decl = VARRAY_TREE (deferred_fns, i);
2705 /* Does it need synthesizing? */
2706 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
2708 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
2710 /* Even though we're already at the top-level, we push
2711 there again. That way, when we pop back a few lines
2712 hence, all of our state is restored. Otherwise,
2713 finish_function doesn't clean things up, and we end
2714 up with CURRENT_FUNCTION_DECL set. */
2715 push_to_top_level ();
2716 synthesize_method (decl);
2717 pop_from_top_level ();
2721 /* If the function has no body, avoid calling
2722 import_export_decl. On a system without weak symbols,
2723 calling import_export_decl will make an inline template
2724 instantiation "static", which will result in errors about
2725 the use of undefined functions if there is no body for
2727 if (!DECL_SAVED_TREE (decl))
2730 import_export_decl (decl);
2732 /* We lie to the back-end, pretending that some functions
2733 are not defined when they really are. This keeps these
2734 functions from being put out unnecessarily. But, we must
2735 stop lying when the functions are referenced, or if they
2736 are not comdat since they need to be put out now. This
2737 is done in a separate for cycle, because if some deferred
2738 function is contained in another deferred function later
2739 in deferred_fns varray, rest_of_compilation would skip
2740 this function and we really cannot expand the same
2742 if (DECL_NOT_REALLY_EXTERN (decl)
2743 && DECL_INITIAL (decl)
2744 && DECL_NEEDED_P (decl))
2745 DECL_EXTERNAL (decl) = 0;
2747 /* If we're going to need to write this function out, and
2748 there's already a body for it, create RTL for it now.
2749 (There might be no body if this is a method we haven't
2750 gotten around to synthesizing yet.) */
2751 if (!DECL_EXTERNAL (decl)
2752 && DECL_NEEDED_P (decl)
2753 && DECL_SAVED_TREE (decl)
2754 && !TREE_ASM_WRITTEN (decl)
2755 && (!flag_unit_at_a_time
2756 || !cgraph_node (decl)->local.finalized))
2758 /* We will output the function; no longer consider it in this
2760 DECL_DEFER_OUTPUT (decl) = 0;
2761 /* Generate RTL for this function now that we know we
2763 expand_or_defer_fn (decl);
2764 /* If we're compiling -fsyntax-only pretend that this
2765 function has been written out so that we don't try to
2767 if (flag_syntax_only)
2768 TREE_ASM_WRITTEN (decl) = 1;
2773 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
2776 /* Static data members are just like namespace-scope globals. */
2777 for (i = 0; i < pending_statics_used; ++i)
2779 tree decl = VARRAY_TREE (pending_statics, i);
2780 if (var_finalized_p (decl))
2782 import_export_decl (decl);
2783 if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
2784 DECL_EXTERNAL (decl) = 0;
2787 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
2788 pending_statics_used))
2791 if (cgraph_assemble_pending_functions ())
2796 /* All used inline functions must have a definition at this point. */
2797 for (i = 0; i < deferred_fns_used; ++i)
2799 tree decl = VARRAY_TREE (deferred_fns, i);
2801 if (TREE_USED (decl) && DECL_DECLARED_INLINE_P (decl)
2802 && !(TREE_ASM_WRITTEN (decl) || DECL_SAVED_TREE (decl)
2803 /* An explicit instantiation can be used to specify
2804 that the body is in another unit. It will have
2805 already verified there was a definition. */
2806 || DECL_EXPLICIT_INSTANTIATION (decl)))
2808 cp_warning_at ("inline function `%D' used but never defined", decl);
2809 /* This symbol is effectively an "extern" declaration now.
2810 This is not strictly necessary, but removes a duplicate
2812 TREE_PUBLIC (decl) = 1;
2817 /* We give C linkage to static constructors and destructors. */
2818 push_lang_context (lang_name_c);
2820 /* Generate initialization and destruction functions for all
2821 priorities for which they are required. */
2822 if (priority_info_map)
2823 splay_tree_foreach (priority_info_map,
2824 generate_ctor_and_dtor_functions_for_priority,
2830 generate_ctor_or_dtor_function (/*constructor_p=*/true,
2831 DEFAULT_INIT_PRIORITY, &locus);
2833 generate_ctor_or_dtor_function (/*constructor_p=*/false,
2834 DEFAULT_INIT_PRIORITY, &locus);
2837 /* We're done with the splay-tree now. */
2838 if (priority_info_map)
2839 splay_tree_delete (priority_info_map);
2841 /* We're done with static constructors, so we can go back to "C++"
2843 pop_lang_context ();
2845 if (flag_unit_at_a_time)
2847 cgraph_finalize_compilation_unit ();
2851 /* Now, issue warnings about static, but not defined, functions,
2852 etc., and emit debugging information. */
2853 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
2854 if (pending_statics)
2855 check_global_declarations (&VARRAY_TREE (pending_statics, 0),
2856 pending_statics_used);
2860 /* The entire file is now complete. If requested, dump everything
2864 FILE *stream = dump_begin (TDI_all, &flags);
2868 dump_node (global_namespace, flags & ~TDF_SLIM, stream);
2869 dump_end (TDI_all, stream);
2873 timevar_pop (TV_VARCONST);
2875 if (flag_detailed_statistics)
2877 dump_tree_statistics ();
2878 dump_time_statistics ();
2880 input_location = locus;
2883 /* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the
2884 function to call in parse-tree form; it has not yet been
2885 semantically analyzed. ARGS are the arguments to the function.
2886 They have already been semantically analyzed. */
2889 build_offset_ref_call_from_tree (tree fn, tree args)
2898 object = TREE_OPERAND (fn, 0);
2900 if (processing_template_decl)
2902 my_friendly_assert (TREE_CODE (fn) == DOTSTAR_EXPR
2903 || TREE_CODE (fn) == MEMBER_REF,
2905 if (type_dependent_expression_p (fn)
2906 || any_type_dependent_arguments_p (args))
2907 return build_min_nt (CALL_EXPR, fn, args);
2909 /* Transform the arguments and add the implicit "this"
2910 parameter. That must be done before the FN is transformed
2911 because we depend on the form of FN. */
2912 args = build_non_dependent_args (args);
2913 if (TREE_CODE (fn) == DOTSTAR_EXPR)
2914 object = build_unary_op (ADDR_EXPR, object, 0);
2915 object = build_non_dependent_expr (object);
2916 args = tree_cons (NULL_TREE, object, args);
2917 /* Now that the arguments are done, transform FN. */
2918 fn = build_non_dependent_expr (fn);
2921 /* A qualified name corresponding to a bound pointer-to-member is
2922 represented as an OFFSET_REF:
2924 struct B { void g(); };
2926 void B::g() { (this->*p)(); } */
2927 if (TREE_CODE (fn) == OFFSET_REF)
2929 tree object_addr = build_unary_op (ADDR_EXPR, object, 0);
2930 fn = TREE_OPERAND (fn, 1);
2931 fn = get_member_function_from_ptrfunc (&object_addr, fn);
2932 args = tree_cons (NULL_TREE, object_addr, args);
2935 expr = build_function_call (fn, args);
2936 if (processing_template_decl && expr != error_mark_node)
2937 return build_min_non_dep (CALL_EXPR, expr, orig_fn, orig_args);
2943 check_default_args (tree x)
2945 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
2946 bool saw_def = false;
2947 int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
2948 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
2950 if (TREE_PURPOSE (arg))
2954 cp_error_at ("default argument missing for parameter %P of `%+#D'",
2962 mark_used (tree decl)
2964 TREE_USED (decl) = 1;
2965 if (processing_template_decl || skip_evaluation)
2968 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl)
2969 && !TREE_ASM_WRITTEN (decl))
2970 /* Remember it, so we can check it was defined. */
2973 assemble_external (decl);
2975 /* Is it a synthesized method that needs to be synthesized? */
2976 if (TREE_CODE (decl) == FUNCTION_DECL
2977 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
2978 && DECL_ARTIFICIAL (decl)
2979 && !DECL_THUNK_P (decl)
2980 && ! DECL_INITIAL (decl)
2981 /* Kludge: don't synthesize for default args. */
2982 && current_function_decl)
2984 synthesize_method (decl);
2985 /* If we've already synthesized the method we don't need to
2986 instantiate it, so we can return right away. */
2990 /* If this is a function or variable that is an instance of some
2991 template, we now know that we will need to actually do the
2992 instantiation. We check that DECL is not an explicit
2993 instantiation because that is not checked in instantiate_decl. */
2994 if ((DECL_NON_THUNK_FUNCTION_P (decl) || TREE_CODE (decl) == VAR_DECL)
2995 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
2996 && (!DECL_EXPLICIT_INSTANTIATION (decl)
2997 || (TREE_CODE (decl) == FUNCTION_DECL
2998 && DECL_INLINE (DECL_TEMPLATE_RESULT
2999 (template_for_substitution (decl))))))
3003 /* Normally, we put off instantiating functions in order to
3004 improve compile times. Maintaining a stack of active
3005 functions is expensive, and the inliner knows to
3006 instantiate any functions it might need.
3008 However, if instantiating this function might help us mark
3009 the current function TREE_NOTHROW, we go ahead and
3012 This is not needed for unit-at-a-time since we reorder the functions
3013 in topological order anyway.
3015 defer = (!flag_exceptions
3016 || flag_unit_at_a_time
3018 || TREE_CODE (decl) != FUNCTION_DECL
3019 /* If the called function can't throw, we don't need to
3020 generate its body to find that out. */
3021 || TREE_NOTHROW (decl)
3023 || !current_function_decl
3024 /* If we already know the current function can't throw,
3025 then we don't need to work hard to prove it. */
3026 || TREE_NOTHROW (current_function_decl)
3027 /* If we already know that the current function *can*
3028 throw, there's no point in gathering more
3030 || cp_function_chain->can_throw);
3032 instantiate_decl (decl, defer);
3036 #include "gt-cp-decl2.h"