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 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 /* Warn when -fexternal-templates is used and #pragma
160 interface/implementation is not used all the times it should be,
164 warn_if_unknown_interface (tree decl)
166 static int already_warned = 0;
167 if (already_warned++)
170 if (flag_alt_external_templates)
172 tree til = tinst_for_decl ();
173 location_t saved_loc = input_location;
177 input_line = TINST_LINE (til);
178 input_filename = TINST_FILE (til);
180 warning ("template `%#D' instantiated in file without #pragma interface",
182 input_location = saved_loc;
185 cp_warning_at ("template `%#D' defined in file without #pragma interface",
189 /* A subroutine of the parser, to handle a component list. */
192 grok_x_components (tree specs)
196 specs = strip_attrs (specs);
198 check_tag_decl (specs);
199 t = groktypename (build_tree_list (specs, NULL_TREE));
201 /* The only case where we need to do anything additional here is an
202 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
203 if (t == NULL_TREE || !ANON_AGGR_TYPE_P (t))
206 fixup_anonymous_aggr (t);
207 finish_member_declaration (build_decl (FIELD_DECL, NULL_TREE, t));
210 /* Build a PARM_DECL with NAME and TYPE, and set DECL_ARG_TYPE
214 cp_build_parm_decl (tree name, tree type)
216 tree parm = build_decl (PARM_DECL, name, type);
217 /* DECL_ARG_TYPE is only used by the back end and the back end never
219 if (!processing_template_decl)
220 DECL_ARG_TYPE (parm) = type_passed_as (type);
224 /* Returns a PARM_DECL for a parameter of the indicated TYPE, with the
228 build_artificial_parm (tree name, tree type)
230 tree parm = cp_build_parm_decl (name, type);
231 DECL_ARTIFICIAL (parm) = 1;
232 /* All our artificial parms are implicitly `const'; they cannot be
234 TREE_READONLY (parm) = 1;
238 /* Constructors for types with virtual baseclasses need an "in-charge" flag
239 saying whether this constructor is responsible for initialization of
240 virtual baseclasses or not. All destructors also need this "in-charge"
241 flag, which additionally determines whether or not the destructor should
242 free the memory for the object.
244 This function adds the "in-charge" flag to member function FN if
245 appropriate. It is called from grokclassfn and tsubst.
246 FN must be either a constructor or destructor.
248 The in-charge flag follows the 'this' parameter, and is followed by the
249 VTT parm (if any), then the user-written parms. */
252 maybe_retrofit_in_chrg (tree fn)
254 tree basetype, arg_types, parms, parm, fntype;
256 /* If we've already add the in-charge parameter don't do it again. */
257 if (DECL_HAS_IN_CHARGE_PARM_P (fn))
260 /* When processing templates we can't know, in general, whether or
261 not we're going to have virtual baseclasses. */
262 if (uses_template_parms (fn))
265 /* We don't need an in-charge parameter for constructors that don't
266 have virtual bases. */
267 if (DECL_CONSTRUCTOR_P (fn)
268 && !TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn)))
271 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
272 basetype = TREE_TYPE (TREE_VALUE (arg_types));
273 arg_types = TREE_CHAIN (arg_types);
275 parms = TREE_CHAIN (DECL_ARGUMENTS (fn));
277 /* If this is a subobject constructor or destructor, our caller will
278 pass us a pointer to our VTT. */
279 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn)))
281 parm = build_artificial_parm (vtt_parm_identifier, vtt_parm_type);
283 /* First add it to DECL_ARGUMENTS between 'this' and the real args... */
284 TREE_CHAIN (parm) = parms;
287 /* ...and then to TYPE_ARG_TYPES. */
288 arg_types = hash_tree_chain (vtt_parm_type, arg_types);
290 DECL_HAS_VTT_PARM_P (fn) = 1;
293 /* Then add the in-charge parm (before the VTT parm). */
294 parm = build_artificial_parm (in_charge_identifier, integer_type_node);
295 TREE_CHAIN (parm) = parms;
297 arg_types = hash_tree_chain (integer_type_node, arg_types);
299 /* Insert our new parameter(s) into the list. */
300 TREE_CHAIN (DECL_ARGUMENTS (fn)) = parms;
302 /* And rebuild the function type. */
303 fntype = build_method_type_directly (basetype, TREE_TYPE (TREE_TYPE (fn)),
305 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
306 fntype = build_exception_variant (fntype,
307 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
308 TREE_TYPE (fn) = fntype;
310 /* Now we've got the in-charge parameter. */
311 DECL_HAS_IN_CHARGE_PARM_P (fn) = 1;
314 /* Classes overload their constituent function names automatically.
315 When a function name is declared in a record structure,
316 its name is changed to it overloaded name. Since names for
317 constructors and destructors can conflict, we place a leading
320 CNAME is the name of the class we are grokking for.
322 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
324 FLAGS contains bits saying what's special about today's
325 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
327 If FUNCTION is a destructor, then we must add the `auto-delete' field
328 as a second parameter. There is some hair associated with the fact
329 that we must "declare" this variable in the manner consistent with the
330 way the rest of the arguments were declared.
332 QUALS are the qualifiers for the this pointer. */
335 grokclassfn (tree ctype, tree function, enum overload_flags flags, tree quals)
337 tree fn_name = DECL_NAME (function);
338 int this_quals = TYPE_UNQUALIFIED;
340 /* Even within an `extern "C"' block, members get C++ linkage. See
341 [dcl.link] for details. */
342 SET_DECL_LANGUAGE (function, lang_cplusplus);
344 if (fn_name == NULL_TREE)
346 error ("name missing for member function");
347 fn_name = get_identifier ("<anonymous>");
348 DECL_NAME (function) = fn_name;
352 this_quals = grok_method_quals (ctype, function, quals);
354 if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
356 /* Must add the class instance variable up front. */
357 /* Right now we just make this a pointer. But later
358 we may wish to make it special. */
359 tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function)));
363 /* The `this' parameter is implicitly `const'; it cannot be
365 this_quals |= TYPE_QUAL_CONST;
366 qual_type = cp_build_qualified_type (type, this_quals);
367 parm = build_artificial_parm (this_identifier, qual_type);
368 c_apply_type_quals_to_decl (this_quals, parm);
369 TREE_CHAIN (parm) = last_function_parms;
370 last_function_parms = parm;
373 DECL_ARGUMENTS (function) = last_function_parms;
374 DECL_CONTEXT (function) = ctype;
376 if (flags == DTOR_FLAG)
377 DECL_DESTRUCTOR_P (function) = 1;
379 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
380 maybe_retrofit_in_chrg (function);
383 /* Create an ARRAY_REF, checking for the user doing things backwards
387 grok_array_decl (tree array_expr, tree index_exp)
391 tree orig_array_expr = array_expr;
392 tree orig_index_exp = index_exp;
394 if (error_operand_p (array_expr) || error_operand_p (index_exp))
395 return error_mark_node;
397 if (processing_template_decl)
399 if (type_dependent_expression_p (array_expr)
400 || type_dependent_expression_p (index_exp))
401 return build_min_nt (ARRAY_REF, array_expr, index_exp);
402 array_expr = build_non_dependent_expr (array_expr);
403 index_exp = build_non_dependent_expr (index_exp);
406 type = TREE_TYPE (array_expr);
407 my_friendly_assert (type, 20030626);
408 type = non_reference (type);
410 /* If they have an `operator[]', use that. */
411 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
412 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL,
413 array_expr, index_exp, NULL_TREE);
418 /* Otherwise, create an ARRAY_REF for a pointer or array type.
419 It is a little-known fact that, if `a' is an array and `i' is
420 an int, you can write `i[a]', which means the same thing as
422 if (TREE_CODE (type) == ARRAY_TYPE)
425 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, false);
427 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
430 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, false);
432 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr,
434 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp,
437 if ((p1 && i2) && (i1 && p2))
438 error ("ambiguous conversion for array subscript");
441 array_expr = p1, index_exp = i2;
443 array_expr = p2, index_exp = i1;
446 error ("invalid types `%T[%T]' for array subscript",
447 type, TREE_TYPE (index_exp));
448 return error_mark_node;
451 if (array_expr == error_mark_node || index_exp == error_mark_node)
452 error ("ambiguous conversion for array subscript");
454 expr = build_array_ref (array_expr, index_exp);
456 if (processing_template_decl && expr != error_mark_node)
457 return build_min_non_dep (ARRAY_REF, expr,
458 orig_array_expr, orig_index_exp);
462 /* Given the cast expression EXP, checking out its validity. Either return
463 an error_mark_node if there was an unavoidable error, return a cast to
464 void for trying to delete a pointer w/ the value 0, or return the
465 call to delete. If DOING_VEC is 1, we handle things differently
466 for doing an array delete. If DOING_VEC is 2, they gave us the
467 array size as an argument to delete.
468 Implements ARM $5.3.4. This is called from the parser. */
471 delete_sanity (tree exp, tree size, int doing_vec, int use_global_delete)
474 /* For a regular vector delete (aka, no size argument) we will pass
475 this down as a NULL_TREE into build_vec_delete. */
476 tree maxindex = NULL_TREE;
478 if (exp == error_mark_node)
481 if (processing_template_decl)
483 t = build_min (DELETE_EXPR, void_type_node, exp, size);
484 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
485 DELETE_EXPR_USE_VEC (t) = doing_vec;
489 exp = convert_from_reference (exp);
490 t = build_expr_type_conversion (WANT_POINTER, exp, true);
492 if (t == NULL_TREE || t == error_mark_node)
494 error ("type `%#T' argument given to `delete', expected pointer",
496 return error_mark_node;
501 maxindex = cp_build_binary_op (MINUS_EXPR, size, integer_one_node);
502 pedwarn ("anachronistic use of array size in vector delete");
505 type = TREE_TYPE (t);
507 /* As of Valley Forge, you can delete a pointer to const. */
509 /* You can't delete functions. */
510 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
512 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
513 return error_mark_node;
516 /* Deleting ptr to void is undefined behavior [expr.delete/3]. */
517 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
519 warning ("deleting `%T' is undefined", type);
523 /* An array can't have been allocated by new, so complain. */
524 if (TREE_CODE (t) == ADDR_EXPR
525 && TREE_CODE (TREE_OPERAND (t, 0)) == VAR_DECL
526 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == ARRAY_TYPE)
527 warning ("deleting array `%#D'", TREE_OPERAND (t, 0));
529 /* Deleting a pointer with the value zero is valid and has no effect. */
530 if (integer_zerop (t))
531 return build1 (NOP_EXPR, void_type_node, t);
534 return build_vec_delete (t, maxindex, sfk_deleting_destructor,
537 return build_delete (type, t, sfk_deleting_destructor,
538 LOOKUP_NORMAL, use_global_delete);
541 /* Report an error if the indicated template declaration is not the
542 sort of thing that should be a member template. */
545 check_member_template (tree tmpl)
549 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
550 decl = DECL_TEMPLATE_RESULT (tmpl);
552 if (TREE_CODE (decl) == FUNCTION_DECL
553 || (TREE_CODE (decl) == TYPE_DECL
554 && IS_AGGR_TYPE (TREE_TYPE (decl))))
556 if (current_function_decl)
557 /* 14.5.2.2 [temp.mem]
559 A local class shall not have member templates. */
560 error ("invalid declaration of member template `%#D' in local class",
563 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
565 /* 14.5.2.3 [temp.mem]
567 A member function template shall not be virtual. */
569 ("invalid use of `virtual' in template declaration of `%#D'",
571 DECL_VIRTUAL_P (decl) = 0;
574 /* The debug-information generating code doesn't know what to do
575 with member templates. */
576 DECL_IGNORED_P (tmpl) = 1;
579 error ("template declaration of `%#D'", decl);
582 /* Return true iff TYPE is a valid Java parameter or return type. */
585 acceptable_java_type (tree type)
587 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
589 if (TREE_CODE (type) == POINTER_TYPE || TREE_CODE (type) == REFERENCE_TYPE)
591 type = TREE_TYPE (type);
592 if (TREE_CODE (type) == RECORD_TYPE)
595 if (! TYPE_FOR_JAVA (type))
597 if (! CLASSTYPE_TEMPLATE_INFO (type))
599 args = CLASSTYPE_TI_ARGS (type);
600 i = TREE_VEC_LENGTH (args);
603 type = TREE_VEC_ELT (args, i);
604 if (TREE_CODE (type) == POINTER_TYPE)
605 type = TREE_TYPE (type);
606 if (! TYPE_FOR_JAVA (type))
615 /* For a METHOD in a Java class CTYPE, return true if
616 the parameter and return types are valid Java types.
617 Otherwise, print appropriate error messages, and return false. */
620 check_java_method (tree method)
623 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
624 tree ret_type = TREE_TYPE (TREE_TYPE (method));
625 if (!acceptable_java_type (ret_type))
627 error ("Java method '%D' has non-Java return type `%T'",
631 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
633 tree type = TREE_VALUE (arg_types);
634 if (!acceptable_java_type (type))
636 error ("Java method '%D' has non-Java parameter type `%T'",
644 /* Sanity check: report error if this function FUNCTION is not
645 really a member of the class (CTYPE) it is supposed to belong to.
646 CNAME is the same here as it is for grokclassfn above. */
649 check_classfn (tree ctype, tree function)
654 if (DECL_USE_TEMPLATE (function)
655 && !(TREE_CODE (function) == TEMPLATE_DECL
656 && DECL_TEMPLATE_SPECIALIZATION (function))
657 && is_member_template (DECL_TI_TEMPLATE (function)))
658 /* Since this is a specialization of a member template,
659 we're not going to find the declaration in the class.
662 struct S { template <typename T> void f(T); };
663 template <> void S::f(int);
665 we're not going to find `S::f(int)', but there's no
666 reason we should, either. We let our callers know we didn't
667 find the method, but we don't complain. */
670 /* OK, is this a definition of a member template? */
671 is_template = (TREE_CODE (function) == TEMPLATE_DECL
672 || (processing_template_decl - template_class_depth (ctype)));
674 ix = lookup_fnfields_1 (complete_type (ctype),
675 DECL_CONSTRUCTOR_P (function) ? ctor_identifier :
676 DECL_DESTRUCTOR_P (function) ? dtor_identifier :
677 DECL_NAME (function));
681 tree methods = CLASSTYPE_METHOD_VEC (ctype);
682 tree fndecls, fndecl = 0;
684 const char *format = NULL;
687 for (fndecls = TREE_VEC_ELT (methods, ix);
688 fndecls; fndecls = OVL_NEXT (fndecls))
692 fndecl = OVL_CURRENT (fndecls);
693 p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
694 p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
696 /* We cannot simply call decls_match because this doesn't
697 work for static member functions that are pretending to
698 be methods, and because the name may have been changed by
701 /* Get rid of the this parameter on functions that become
703 if (DECL_STATIC_FUNCTION_P (fndecl)
704 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
705 p1 = TREE_CHAIN (p1);
707 /* A member template definition only matches a member template
709 if (is_template != (TREE_CODE (fndecl) == TEMPLATE_DECL))
712 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
713 TREE_TYPE (TREE_TYPE (fndecl)))
714 && compparms (p1, p2)
715 && (DECL_TEMPLATE_SPECIALIZATION (function)
716 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
717 && (!DECL_TEMPLATE_SPECIALIZATION (function)
718 || (DECL_TI_TEMPLATE (function)
719 == DECL_TI_TEMPLATE (fndecl))))
724 return OVL_CURRENT (fndecls);
725 error ("prototype for `%#D' does not match any in class `%T'",
727 is_conv_op = DECL_CONV_FN_P (fndecl);
730 ix = CLASSTYPE_FIRST_CONVERSION_SLOT;
731 fndecls = TREE_VEC_ELT (methods, ix);
734 fndecl = OVL_CURRENT (fndecls);
735 fndecls = OVL_NEXT (fndecls);
737 if (!fndecls && is_conv_op)
739 if (TREE_VEC_LENGTH (methods) > ix)
742 fndecls = TREE_VEC_ELT (methods, ix);
743 if (!DECL_CONV_FN_P (OVL_CURRENT (fndecls)))
755 format = "candidates are: %#D";
757 format = "candidate is: %#D";
758 cp_error_at (format, fndecl);
761 else if (!COMPLETE_TYPE_P (ctype))
762 cxx_incomplete_type_error (function, ctype);
764 error ("no `%#D' member function declared in class `%T'",
767 /* If we did not find the method in the class, add it to avoid
768 spurious errors (unless the CTYPE is not yet defined, in which
769 case we'll only confuse ourselves when the function is declared
770 properly within the class. */
771 if (COMPLETE_TYPE_P (ctype))
772 add_method (ctype, function, /*error_p=*/1);
776 /* We have just processed the DECL, which is a static data member.
777 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
778 present, is the assembly-language name for the data member.
779 FLAGS is as for cp_finish_decl. */
782 finish_static_data_member_decl (tree decl, tree init, tree asmspec_tree,
785 my_friendly_assert (TREE_PUBLIC (decl), 0);
787 DECL_CONTEXT (decl) = current_class_type;
789 /* We cannot call pushdecl here, because that would fill in the
790 TREE_CHAIN of our decl. Instead, we modify cp_finish_decl to do
791 the right thing, namely, to put this decl out straight away. */
792 /* current_class_type can be NULL_TREE in case of error. */
793 if (!asmspec_tree && current_class_type)
794 DECL_INITIAL (decl) = error_mark_node;
796 if (! processing_template_decl)
798 if (!pending_statics)
799 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
800 VARRAY_PUSH_TREE (pending_statics, decl);
803 if (LOCAL_CLASS_P (current_class_type))
804 pedwarn ("local class `%#T' shall not have static data member `%#D'",
805 current_class_type, decl);
807 /* Static consts need not be initialized in the class definition. */
808 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
810 static int explained = 0;
812 error ("initializer invalid for static member with constructor");
815 error ("(an out of class initialization is required)");
820 /* Force the compiler to know when an uninitialized static const
821 member is being used. */
822 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
823 TREE_USED (decl) = 1;
824 DECL_INITIAL (decl) = init;
825 DECL_IN_AGGR_P (decl) = 1;
827 cp_finish_decl (decl, init, asmspec_tree, flags);
830 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
831 of a structure component, returning a _DECL node.
832 QUALS is a list of type qualifiers for this decl (such as for declaring
833 const member functions).
835 This is done during the parsing of the struct declaration.
836 The _DECL nodes are chained together and the lot of them
837 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
839 If class A defines that certain functions in class B are friends, then
840 the way I have set things up, it is B who is interested in permission
841 granted by A. However, it is in A's context that these declarations
842 are parsed. By returning a void_type_node, class A does not attempt
843 to incorporate the declarations of the friends within its structure.
845 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
846 CHANGES TO CODE IN `start_method'. */
849 grokfield (tree declarator, tree declspecs, tree init, tree asmspec_tree,
853 const char *asmspec = 0;
854 int flags = LOOKUP_ONLYCONVERTING;
856 if (declspecs == NULL_TREE
857 && TREE_CODE (declarator) == SCOPE_REF
858 && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
860 /* Access declaration */
861 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
863 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
865 return do_class_using_decl (declarator);
869 && TREE_CODE (init) == TREE_LIST
870 && TREE_VALUE (init) == error_mark_node
871 && TREE_CHAIN (init) == NULL_TREE)
874 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist);
875 if (! value || value == error_mark_node)
876 /* friend or constructor went bad. */
878 if (TREE_TYPE (value) == error_mark_node)
879 return error_mark_node;
881 if (TREE_CODE (value) == TYPE_DECL && init)
883 error ("typedef `%D' is initialized (use __typeof__ instead)", value);
887 /* Pass friendly classes back. */
888 if (value == void_type_node)
891 /* Pass friend decls back. */
892 if ((TREE_CODE (value) == FUNCTION_DECL
893 || TREE_CODE (value) == TEMPLATE_DECL)
894 && DECL_CONTEXT (value) != current_class_type)
897 if (DECL_NAME (value) != NULL_TREE
898 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
899 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
900 error ("member `%D' conflicts with virtual function table field name",
903 /* Stash away type declarations. */
904 if (TREE_CODE (value) == TYPE_DECL)
906 DECL_NONLOCAL (value) = 1;
907 DECL_CONTEXT (value) = current_class_type;
909 if (processing_template_decl)
910 value = push_template_decl (value);
915 if (DECL_IN_AGGR_P (value))
917 error ("`%D' is already defined in `%T'", value,
918 DECL_CONTEXT (value));
919 return void_type_node;
923 asmspec = TREE_STRING_POINTER (asmspec_tree);
927 if (TREE_CODE (value) == FUNCTION_DECL)
929 grok_function_init (value, init);
932 else if (pedantic && TREE_CODE (value) != VAR_DECL)
933 /* Already complained in grokdeclarator. */
937 /* We allow initializers to become parameters to base
939 if (TREE_CODE (init) == TREE_LIST)
941 if (TREE_CHAIN (init) == NULL_TREE)
942 init = TREE_VALUE (init);
944 init = digest_init (TREE_TYPE (value), init, (tree *)0);
947 if (!processing_template_decl)
949 if (TREE_CODE (init) == CONST_DECL)
950 init = DECL_INITIAL (init);
951 else if (TREE_READONLY_DECL_P (init))
952 init = decl_constant_value (init);
953 else if (TREE_CODE (init) == CONSTRUCTOR)
954 init = digest_init (TREE_TYPE (value), init, (tree *)0);
955 if (init != error_mark_node && ! TREE_CONSTANT (init))
957 /* We can allow references to things that are effectively
958 static, since references are initialized with the
960 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
961 || (TREE_STATIC (init) == 0
962 && (!DECL_P (init) || DECL_EXTERNAL (init) == 0)))
964 error ("field initializer is not constant");
965 init = error_mark_node;
972 if (processing_template_decl
973 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
974 value = push_template_decl (value);
977 cplus_decl_attributes (&value, attrlist, 0);
979 if (TREE_CODE (value) == VAR_DECL)
981 finish_static_data_member_decl (value, init, asmspec_tree,
985 if (TREE_CODE (value) == FIELD_DECL)
988 error ("`asm' specifiers are not permitted on non-static data members");
989 if (DECL_INITIAL (value) == error_mark_node)
990 init = error_mark_node;
991 cp_finish_decl (value, init, NULL_TREE, flags);
992 DECL_INITIAL (value) = init;
993 DECL_IN_AGGR_P (value) = 1;
996 if (TREE_CODE (value) == FUNCTION_DECL)
1000 /* This must override the asm specifier which was placed
1001 by grokclassfn. Lay this out fresh. */
1002 SET_DECL_RTL (value, NULL_RTX);
1003 SET_DECL_ASSEMBLER_NAME (value, get_identifier (asmspec));
1005 if (!DECL_FRIEND_P (value))
1006 grok_special_member_properties (value);
1008 cp_finish_decl (value, init, asmspec_tree, flags);
1010 /* Pass friends back this way. */
1011 if (DECL_FRIEND_P (value))
1012 return void_type_node;
1014 DECL_IN_AGGR_P (value) = 1;
1022 /* Like `grokfield', but for bitfields.
1023 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1026 grokbitfield (tree declarator, tree declspecs, tree width)
1028 register tree value = grokdeclarator (declarator, declspecs, BITFIELD,
1031 if (! value) return NULL_TREE; /* friends went bad. */
1033 /* Pass friendly classes back. */
1034 if (TREE_CODE (value) == VOID_TYPE)
1035 return void_type_node;
1037 if (TREE_CODE (value) == TYPE_DECL)
1039 error ("cannot declare `%D' to be a bit-field type", value);
1043 /* Usually, finish_struct_1 catches bitfields with invalid types.
1044 But, in the case of bitfields with function type, we confuse
1045 ourselves into thinking they are member functions, so we must
1047 if (TREE_CODE (value) == FUNCTION_DECL)
1049 error ("cannot declare bit-field `%D' with function type",
1054 if (DECL_IN_AGGR_P (value))
1056 error ("`%D' is already defined in the class %T", value,
1057 DECL_CONTEXT (value));
1058 return void_type_node;
1061 if (TREE_STATIC (value))
1063 error ("static member `%D' cannot be a bit-field", value);
1066 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1068 if (width != error_mark_node)
1070 constant_expression_warning (width);
1071 DECL_INITIAL (value) = width;
1072 SET_DECL_C_BIT_FIELD (value);
1075 DECL_IN_AGGR_P (value) = 1;
1079 /* When a function is declared with an initializer,
1080 do the right thing. Currently, there are two possibilities:
1085 // initialization possibility #1.
1086 virtual void f () = 0;
1108 // initialization possibility #2
1115 grok_function_init (tree decl, tree init)
1117 /* An initializer for a function tells how this function should
1119 tree type = TREE_TYPE (decl);
1121 if (TREE_CODE (type) == FUNCTION_TYPE)
1122 error ("initializer specified for non-member function `%D'", decl);
1123 else if (integer_zerop (init))
1124 DECL_PURE_VIRTUAL_P (decl) = 1;
1126 error ("invalid initializer for virtual method `%D'", decl);
1130 cplus_decl_attributes (tree *decl, tree attributes, int flags)
1132 if (*decl == NULL_TREE || *decl == void_type_node)
1135 if (TREE_CODE (*decl) == TEMPLATE_DECL)
1136 decl = &DECL_TEMPLATE_RESULT (*decl);
1138 decl_attributes (decl, attributes, flags);
1140 if (TREE_CODE (*decl) == TYPE_DECL)
1141 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl));
1144 /* Defer the compilation of the FN until the end of compilation. */
1149 if (DECL_DEFERRED_FN (fn))
1151 DECL_DEFERRED_FN (fn) = 1;
1152 DECL_DEFER_OUTPUT (fn) = 1;
1154 VARRAY_TREE_INIT (deferred_fns, 32, "deferred_fns");
1156 VARRAY_PUSH_TREE (deferred_fns, fn);
1159 /* Walks through the namespace- or function-scope anonymous union OBJECT,
1160 building appropriate ALIAS_DECLs. Returns one of the fields for use in
1161 the mangled name. */
1164 build_anon_union_vars (tree object)
1166 tree type = TREE_TYPE (object);
1167 tree main_decl = NULL_TREE;
1170 /* Rather than write the code to handle the non-union case,
1171 just give an error. */
1172 if (TREE_CODE (type) != UNION_TYPE)
1173 error ("anonymous struct not inside named type");
1175 for (field = TYPE_FIELDS (type);
1177 field = TREE_CHAIN (field))
1182 if (DECL_ARTIFICIAL (field))
1184 if (TREE_CODE (field) != FIELD_DECL)
1187 `%#D' invalid; an anonymous union can only have non-static data members",
1192 if (TREE_PRIVATE (field))
1193 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
1194 else if (TREE_PROTECTED (field))
1195 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
1197 if (processing_template_decl)
1198 ref = build_min_nt (COMPONENT_REF, object, DECL_NAME (field));
1200 ref = build_class_member_access_expr (object, field, NULL_TREE,
1203 if (DECL_NAME (field))
1205 decl = build_decl (ALIAS_DECL, DECL_NAME (field), TREE_TYPE (field));
1206 DECL_INITIAL (decl) = ref;
1207 TREE_PUBLIC (decl) = 0;
1208 TREE_STATIC (decl) = 0;
1209 DECL_EXTERNAL (decl) = 1;
1210 decl = pushdecl (decl);
1212 else if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1213 decl = build_anon_union_vars (ref);
1217 if (main_decl == NULL_TREE)
1224 /* Finish off the processing of a UNION_TYPE structure. If the union is an
1225 anonymous union, then all members must be laid out together. PUBLIC_P
1226 is nonzero if this union is not declared static. */
1229 finish_anon_union (tree anon_union_decl)
1231 tree type = TREE_TYPE (anon_union_decl);
1233 bool public_p = TREE_PUBLIC (anon_union_decl);
1235 /* The VAR_DECL's context is the same as the TYPE's context. */
1236 DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type));
1238 if (TYPE_FIELDS (type) == NULL_TREE)
1243 error ("namespace-scope anonymous aggregates must be static");
1247 main_decl = build_anon_union_vars (anon_union_decl);
1248 if (main_decl == NULL_TREE)
1250 warning ("anonymous union with no members");
1254 if (!processing_template_decl)
1256 /* Use main_decl to set the mangled name. */
1257 DECL_NAME (anon_union_decl) = DECL_NAME (main_decl);
1258 mangle_decl (anon_union_decl);
1259 DECL_NAME (anon_union_decl) = NULL_TREE;
1262 pushdecl (anon_union_decl);
1263 if (building_stmt_tree ()
1264 && at_function_scope_p ())
1265 add_decl_stmt (anon_union_decl);
1266 else if (!processing_template_decl)
1267 rest_of_decl_compilation (anon_union_decl, NULL,
1268 toplevel_bindings_p (), at_eof);
1271 /* Auxiliary functions to make type signatures for
1272 `operator new' and `operator delete' correspond to
1273 what compiler will be expecting. */
1276 coerce_new_type (tree type)
1279 tree args = TYPE_ARG_TYPES (type);
1281 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1283 if (!same_type_p (TREE_TYPE (type), ptr_type_node))
1284 e = 1, error ("`operator new' must return type `%T'", ptr_type_node);
1286 if (!args || args == void_list_node
1287 || !same_type_p (TREE_VALUE (args), size_type_node))
1290 if (args && args != void_list_node)
1291 args = TREE_CHAIN (args);
1292 pedwarn ("`operator new' takes type `size_t' (`%T') as first parameter", size_type_node);
1297 args = tree_cons (NULL_TREE, size_type_node, args);
1300 type = build_exception_variant
1301 (build_function_type (ptr_type_node, args),
1302 TYPE_RAISES_EXCEPTIONS (type));
1310 coerce_delete_type (tree type)
1313 tree args = TYPE_ARG_TYPES (type);
1315 my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1317 if (!same_type_p (TREE_TYPE (type), void_type_node))
1318 e = 1, error ("`operator delete' must return type `%T'", void_type_node);
1320 if (!args || args == void_list_node
1321 || !same_type_p (TREE_VALUE (args), ptr_type_node))
1324 if (args && args != void_list_node)
1325 args = TREE_CHAIN (args);
1326 error ("`operator delete' takes type `%T' as first parameter", ptr_type_node);
1331 args = tree_cons (NULL_TREE, ptr_type_node, args);
1334 type = build_exception_variant
1335 (build_function_type (void_type_node, args),
1336 TYPE_RAISES_EXCEPTIONS (type));
1345 mark_vtable_entries (tree decl)
1347 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
1349 for (; entries; entries = TREE_CHAIN (entries))
1351 tree fnaddr = TREE_VALUE (entries);
1354 STRIP_NOPS (fnaddr);
1356 if (TREE_CODE (fnaddr) != ADDR_EXPR
1357 && TREE_CODE (fnaddr) != FDESC_EXPR)
1358 /* This entry is an offset: a virtual base class offset, a
1359 virtual call offset, an RTTI offset, etc. */
1362 fn = TREE_OPERAND (fnaddr, 0);
1363 TREE_ADDRESSABLE (fn) = 1;
1364 /* When we don't have vcall offsets, we output thunks whenever
1365 we output the vtables that contain them. With vcall offsets,
1366 we know all the thunks we'll need when we emit a virtual
1367 function, so we emit the thunks there instead. */
1368 if (DECL_THUNK_P (fn))
1369 use_thunk (fn, /*emit_p=*/0);
1374 /* Set DECL up to have the closest approximation of "initialized common"
1375 linkage available. */
1378 comdat_linkage (tree decl)
1381 make_decl_one_only (decl);
1382 else if (TREE_CODE (decl) == FUNCTION_DECL
1383 || (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)))
1384 /* We can just emit function and compiler-generated variables
1385 statically; having multiple copies is (for the most part) only
1388 There are two correctness issues, however: the address of a
1389 template instantiation with external linkage should be the
1390 same, independent of what translation unit asks for the
1391 address, and this will not hold when we emit multiple copies of
1392 the function. However, there's little else we can do.
1394 Also, by default, the typeinfo implementation assumes that
1395 there will be only one copy of the string used as the name for
1396 each type. Therefore, if weak symbols are unavailable, the
1397 run-time library should perform a more conservative check; it
1398 should perform a string comparison, rather than an address
1400 TREE_PUBLIC (decl) = 0;
1403 /* Static data member template instantiations, however, cannot
1404 have multiple copies. */
1405 if (DECL_INITIAL (decl) == 0
1406 || DECL_INITIAL (decl) == error_mark_node)
1407 DECL_COMMON (decl) = 1;
1408 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
1410 DECL_COMMON (decl) = 1;
1411 DECL_INITIAL (decl) = error_mark_node;
1413 else if (!DECL_EXPLICIT_INSTANTIATION (decl))
1415 /* We can't do anything useful; leave vars for explicit
1417 DECL_EXTERNAL (decl) = 1;
1418 DECL_NOT_REALLY_EXTERN (decl) = 0;
1422 if (DECL_LANG_SPECIFIC (decl))
1423 DECL_COMDAT (decl) = 1;
1426 /* For win32 we also want to put explicit instantiations in
1427 linkonce sections, so that they will be merged with implicit
1428 instantiations; otherwise we get duplicate symbol errors. */
1431 maybe_make_one_only (tree decl)
1433 /* We used to say that this was not necessary on targets that support weak
1434 symbols, because the implicit instantiations will defer to the explicit
1435 one. However, that's not actually the case in SVR4; a strong definition
1436 after a weak one is an error. Also, not making explicit
1437 instantiations one_only means that we can end up with two copies of
1438 some template instantiations. */
1442 /* We can't set DECL_COMDAT on functions, or finish_file will think
1443 we can get away with not emitting them if they aren't used. We need
1444 to for variables so that cp_finish_decl will update their linkage,
1445 because their DECL_INITIAL may not have been set properly yet. */
1447 make_decl_one_only (decl);
1449 if (TREE_CODE (decl) == VAR_DECL)
1451 DECL_COMDAT (decl) = 1;
1452 /* Mark it needed so we don't forget to emit it. */
1453 mark_referenced (DECL_ASSEMBLER_NAME (decl));
1457 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
1458 based on TYPE and other static flags.
1460 Note that anything public is tagged TREE_PUBLIC, whether
1461 it's public in this file or in another one. */
1464 import_export_vtable (tree decl, tree type, int final)
1466 if (DECL_INTERFACE_KNOWN (decl))
1469 if (TYPE_FOR_JAVA (type))
1471 TREE_PUBLIC (decl) = 1;
1472 DECL_EXTERNAL (decl) = 1;
1473 DECL_INTERFACE_KNOWN (decl) = 1;
1475 else if (CLASSTYPE_INTERFACE_KNOWN (type))
1477 TREE_PUBLIC (decl) = 1;
1478 DECL_EXTERNAL (decl) = CLASSTYPE_INTERFACE_ONLY (type);
1479 DECL_INTERFACE_KNOWN (decl) = 1;
1483 /* We can only wait to decide if we have real non-inline virtual
1484 functions in our class, or if we come from a template. */
1486 int found = (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
1487 || CLASSTYPE_KEY_METHOD (type) != NULL_TREE);
1489 if (final || ! found)
1491 comdat_linkage (decl);
1492 DECL_EXTERNAL (decl) = 0;
1496 TREE_PUBLIC (decl) = 1;
1497 DECL_EXTERNAL (decl) = 1;
1502 /* Determine whether or not we want to specifically import or export CTYPE,
1503 using various heuristics. */
1506 import_export_class (tree ctype)
1508 /* -1 for imported, 1 for exported. */
1509 int import_export = 0;
1511 /* It only makes sense to call this function at EOF. The reason is
1512 that this function looks at whether or not the first non-inline
1513 non-abstract virtual member function has been defined in this
1514 translation unit. But, we can't possibly know that until we've
1515 seen the entire translation unit. */
1516 my_friendly_assert (at_eof, 20000226);
1518 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1521 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
1522 we will have CLASSTYPE_INTERFACE_ONLY set but not
1523 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
1524 heuristic because someone will supply a #pragma implementation
1525 elsewhere, and deducing it here would produce a conflict. */
1526 if (CLASSTYPE_INTERFACE_ONLY (ctype))
1529 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
1531 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
1534 /* If we got -fno-implicit-templates, we import template classes that
1535 weren't explicitly instantiated. */
1536 if (import_export == 0
1537 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
1538 && ! flag_implicit_templates)
1541 /* Base our import/export status on that of the first non-inline,
1542 non-pure virtual function, if any. */
1543 if (import_export == 0
1544 && TYPE_POLYMORPHIC_P (ctype))
1546 tree method = CLASSTYPE_KEY_METHOD (ctype);
1548 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
1551 #ifdef MULTIPLE_SYMBOL_SPACES
1552 if (import_export == -1)
1558 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
1559 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
1563 /* Return true if VAR has already been provided to the back end; in that
1564 case VAR should not be modified further by the front end. */
1566 var_finalized_p (tree var)
1568 if (flag_unit_at_a_time)
1569 return cgraph_varpool_node (var)->finalized;
1571 return TREE_ASM_WRITTEN (var);
1574 /* If necessary, write out the vtables for the dynamic class CTYPE.
1575 Returns true if any vtables were emitted. */
1578 maybe_emit_vtables (tree ctype)
1582 bool needed = false;
1584 /* If the vtables for this class have already been emitted there is
1585 nothing more to do. */
1586 primary_vtbl = CLASSTYPE_VTABLES (ctype);
1587 if (var_finalized_p (primary_vtbl))
1589 /* Ignore dummy vtables made by get_vtable_decl. */
1590 if (TREE_TYPE (primary_vtbl) == void_type_node)
1593 import_export_class (ctype);
1594 import_export_vtable (primary_vtbl, ctype, 1);
1596 /* See if any of the vtables are needed. */
1597 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1598 if (!DECL_EXTERNAL (vtbl) && DECL_NEEDED_P (vtbl))
1602 /* If the references to this class' vtables are optimized away,
1603 still emit the appropriate debugging information. See
1605 if (DECL_COMDAT (primary_vtbl)
1606 && CLASSTYPE_DEBUG_REQUESTED (ctype))
1607 note_debug_info_needed (ctype);
1610 else if (TREE_PUBLIC (vtbl) && !DECL_COMDAT (vtbl))
1614 /* The ABI requires that we emit all of the vtables if we emit any
1616 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1619 import_export_vtable (vtbl, ctype, 1);
1620 mark_vtable_entries (vtbl);
1622 /* If we know that DECL is needed, mark it as such for the varpool. */
1624 cgraph_varpool_mark_needed_node (cgraph_varpool_node (vtbl));
1626 if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0)
1627 store_init_value (vtbl, DECL_INITIAL (vtbl));
1629 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
1631 /* Mark the VAR_DECL node representing the vtable itself as a
1632 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
1633 It is rather important that such things be ignored because
1634 any effort to actually generate DWARF for them will run
1635 into trouble when/if we encounter code like:
1638 struct S { virtual void member (); };
1640 because the artificial declaration of the vtable itself (as
1641 manufactured by the g++ front end) will say that the vtable
1642 is a static member of `S' but only *after* the debug output
1643 for the definition of `S' has already been output. This causes
1644 grief because the DWARF entry for the definition of the vtable
1645 will try to refer back to an earlier *declaration* of the
1646 vtable as a static member of `S' and there won't be one.
1647 We might be able to arrange to have the "vtable static member"
1648 attached to the member list for `S' before the debug info for
1649 `S' get written (which would solve the problem) but that would
1650 require more intrusive changes to the g++ front end. */
1652 DECL_IGNORED_P (vtbl) = 1;
1655 /* Always make vtables weak. */
1657 comdat_linkage (vtbl);
1659 rest_of_decl_compilation (vtbl, NULL, 1, 1);
1661 /* Because we're only doing syntax-checking, we'll never end up
1662 actually marking the variable as written. */
1663 if (flag_syntax_only)
1664 TREE_ASM_WRITTEN (vtbl) = 1;
1667 /* Since we're writing out the vtable here, also write the debug
1669 note_debug_info_needed (ctype);
1674 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
1675 inline function or template instantiation at end-of-file. */
1678 import_export_decl (tree decl)
1680 if (DECL_INTERFACE_KNOWN (decl))
1683 if (DECL_TEMPLATE_INSTANTIATION (decl)
1684 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1686 DECL_NOT_REALLY_EXTERN (decl) = 1;
1687 if ((DECL_IMPLICIT_INSTANTIATION (decl)
1688 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1689 && (flag_implicit_templates
1690 || (flag_implicit_inline_templates
1691 && TREE_CODE (decl) == FUNCTION_DECL
1692 && DECL_DECLARED_INLINE_P (decl))))
1694 if (!TREE_PUBLIC (decl))
1695 /* Templates are allowed to have internal linkage. See
1699 comdat_linkage (decl);
1703 DECL_EXTERNAL (decl) = 1;
1704 DECL_NOT_REALLY_EXTERN (decl) = 0;
1707 else if (DECL_FUNCTION_MEMBER_P (decl))
1709 if (!DECL_DECLARED_INLINE_P (decl))
1711 tree ctype = DECL_CONTEXT (decl);
1712 import_export_class (ctype);
1713 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1715 DECL_NOT_REALLY_EXTERN (decl)
1716 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
1717 || (DECL_DECLARED_INLINE_P (decl)
1718 && ! flag_implement_inlines
1719 && !DECL_VINDEX (decl)));
1721 if (!DECL_NOT_REALLY_EXTERN (decl))
1722 DECL_EXTERNAL (decl) = 1;
1724 /* Always make artificials weak. */
1725 if (DECL_ARTIFICIAL (decl) && flag_weak)
1726 comdat_linkage (decl);
1728 maybe_make_one_only (decl);
1732 comdat_linkage (decl);
1735 comdat_linkage (decl);
1737 DECL_INTERFACE_KNOWN (decl) = 1;
1740 /* Here, we only decide whether or not the tinfo node should be
1741 emitted with the vtable. IS_IN_LIBRARY is nonzero iff the
1742 typeinfo for TYPE should be in the runtime library. */
1745 import_export_tinfo (tree decl, tree type, bool is_in_library)
1747 if (DECL_INTERFACE_KNOWN (decl))
1750 if (IS_AGGR_TYPE (type))
1751 import_export_class (type);
1753 if (IS_AGGR_TYPE (type) && CLASSTYPE_INTERFACE_KNOWN (type)
1754 && TYPE_POLYMORPHIC_P (type)
1755 /* If -fno-rtti, we're not necessarily emitting this stuff with
1756 the class, so go ahead and emit it now. This can happen when
1757 a class is used in exception handling. */
1760 DECL_NOT_REALLY_EXTERN (decl) = !CLASSTYPE_INTERFACE_ONLY (type);
1761 DECL_COMDAT (decl) = 0;
1765 DECL_NOT_REALLY_EXTERN (decl) = 1;
1766 DECL_COMDAT (decl) = 1;
1769 /* Now override some cases. */
1771 DECL_COMDAT (decl) = 1;
1772 else if (is_in_library)
1773 DECL_COMDAT (decl) = 0;
1775 DECL_INTERFACE_KNOWN (decl) = 1;
1778 /* Return an expression that performs the destruction of DECL, which
1779 must be a VAR_DECL whose type has a non-trivial destructor, or is
1780 an array whose (innermost) elements have a non-trivial destructor. */
1783 build_cleanup (tree decl)
1786 tree type = TREE_TYPE (decl);
1788 /* This function should only be called for declarations that really
1789 require cleanups. */
1790 my_friendly_assert (!TYPE_HAS_TRIVIAL_DESTRUCTOR (type), 20030106);
1792 /* Treat all objects with destructors as used; the destructor may do
1793 something substantive. */
1796 if (TREE_CODE (type) == ARRAY_TYPE)
1800 cxx_mark_addressable (decl);
1801 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
1803 temp = build_delete (TREE_TYPE (temp), temp,
1804 sfk_complete_destructor,
1805 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
1809 /* Returns the initialization guard variable for the variable DECL,
1810 which has static storage duration. */
1813 get_guard (tree decl)
1818 sname = mangle_guard_variable (decl);
1819 guard = IDENTIFIER_GLOBAL_VALUE (sname);
1824 /* We use a type that is big enough to contain a mutex as well
1825 as an integer counter. */
1826 guard_type = long_long_integer_type_node;
1827 guard = build_decl (VAR_DECL, sname, guard_type);
1829 /* The guard should have the same linkage as what it guards. */
1830 TREE_PUBLIC (guard) = TREE_PUBLIC (decl);
1831 TREE_STATIC (guard) = TREE_STATIC (decl);
1832 DECL_COMMON (guard) = DECL_COMMON (decl);
1833 DECL_ONE_ONLY (guard) = DECL_ONE_ONLY (decl);
1834 if (TREE_PUBLIC (decl))
1835 DECL_WEAK (guard) = DECL_WEAK (decl);
1837 DECL_ARTIFICIAL (guard) = 1;
1838 TREE_USED (guard) = 1;
1839 pushdecl_top_level_and_finish (guard, NULL_TREE);
1844 /* Return those bits of the GUARD variable that should be set when the
1845 guarded entity is actually initialized. */
1848 get_guard_bits (tree guard)
1850 /* We only set the first byte of the guard, in order to leave room
1851 for a mutex in the high-order bits. */
1852 guard = build1 (ADDR_EXPR,
1853 build_pointer_type (TREE_TYPE (guard)),
1855 guard = build1 (NOP_EXPR,
1856 build_pointer_type (char_type_node),
1858 guard = build1 (INDIRECT_REF, char_type_node, guard);
1863 /* Return an expression which determines whether or not the GUARD
1864 variable has already been initialized. */
1867 get_guard_cond (tree guard)
1871 /* Check to see if the GUARD is zero. */
1872 guard = get_guard_bits (guard);
1873 guard_value = integer_zero_node;
1874 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
1875 guard_value = convert (TREE_TYPE (guard), guard_value);
1876 return cp_build_binary_op (EQ_EXPR, guard, guard_value);
1879 /* Return an expression which sets the GUARD variable, indicating that
1880 the variable being guarded has been initialized. */
1883 set_guard (tree guard)
1887 /* Set the GUARD to one. */
1888 guard = get_guard_bits (guard);
1889 guard_init = integer_one_node;
1890 if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard)))
1891 guard_init = convert (TREE_TYPE (guard), guard_init);
1892 return build_modify_expr (guard, NOP_EXPR, guard_init);
1895 /* Start the process of running a particular set of global constructors
1896 or destructors. Subroutine of do_[cd]tors. */
1899 start_objects (int method_type, int initp)
1905 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
1907 if (initp != DEFAULT_INIT_PRIORITY)
1917 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
1920 sprintf (type, "%c", method_type);
1922 fnname = get_file_function_name_long (type);
1924 start_function (void_list_node,
1925 make_call_declarator (fnname, void_list_node, NULL_TREE,
1927 NULL_TREE, SF_DEFAULT);
1929 /* It can be a static function as long as collect2 does not have
1930 to scan the object file to find its ctor/dtor routine. */
1931 TREE_PUBLIC (current_function_decl) = ! targetm.have_ctors_dtors;
1933 /* Mark this declaration as used to avoid spurious warnings. */
1934 TREE_USED (current_function_decl) = 1;
1936 /* Mark this function as a global constructor or destructor. */
1937 if (method_type == 'I')
1938 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
1940 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
1941 DECL_LANG_SPECIFIC (current_function_decl)->decl_flags.u2sel = 1;
1943 body = begin_compound_stmt (/*has_no_scope=*/false);
1945 /* We cannot allow these functions to be elided, even if they do not
1946 have external linkage. And, there's no point in deferring
1947 compilation of thes functions; they're all going to have to be
1949 current_function_cannot_inline
1950 = "static constructors and destructors cannot be inlined";
1955 /* Finish the process of running a particular set of global constructors
1956 or destructors. Subroutine of do_[cd]tors. */
1959 finish_objects (int method_type, int initp, tree body)
1964 finish_compound_stmt (body);
1965 fn = finish_function (0);
1966 expand_or_defer_fn (fn);
1968 /* When only doing semantic analysis, and no RTL generation, we
1969 can't call functions that directly emit assembly code; there is
1970 no assembly file in which to put the code. */
1971 if (flag_syntax_only)
1974 if (targetm.have_ctors_dtors)
1976 rtx fnsym = XEXP (DECL_RTL (fn), 0);
1977 if (method_type == 'I')
1978 (* targetm.asm_out.constructor) (fnsym, initp);
1980 (* targetm.asm_out.destructor) (fnsym, initp);
1984 /* The names of the parameters to the function created to handle
1985 initializations and destructions for objects with static storage
1987 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
1988 #define PRIORITY_IDENTIFIER "__priority"
1990 /* The name of the function we create to handle initializations and
1991 destructions for objects with static storage duration. */
1992 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
1994 /* The declaration for the __INITIALIZE_P argument. */
1995 static GTY(()) tree initialize_p_decl;
1997 /* The declaration for the __PRIORITY argument. */
1998 static GTY(()) tree priority_decl;
2000 /* The declaration for the static storage duration function. */
2001 static GTY(()) tree ssdf_decl;
2003 /* All the static storage duration functions created in this
2004 translation unit. */
2005 static GTY(()) varray_type ssdf_decls;
2007 /* A map from priority levels to information about that priority
2008 level. There may be many such levels, so efficient lookup is
2010 static splay_tree priority_info_map;
2012 /* Begins the generation of the function that will handle all
2013 initialization and destruction of objects with static storage
2014 duration. The function generated takes two parameters of type
2015 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2016 nonzero, it performs initializations. Otherwise, it performs
2017 destructions. It only performs those initializations or
2018 destructions with the indicated __PRIORITY. The generated function
2021 It is assumed that this function will only be called once per
2022 translation unit. */
2025 start_static_storage_duration_function (unsigned count)
2030 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2032 /* Create the identifier for this function. It will be of the form
2033 SSDF_IDENTIFIER_<number>. */
2034 sprintf (id, "%s_%u", SSDF_IDENTIFIER, count);
2036 /* Create the parameters. */
2037 parm_types = void_list_node;
2038 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2039 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2040 type = build_function_type (void_type_node, parm_types);
2042 /* Create the FUNCTION_DECL itself. */
2043 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2044 get_identifier (id),
2046 TREE_PUBLIC (ssdf_decl) = 0;
2047 DECL_ARTIFICIAL (ssdf_decl) = 1;
2049 /* Put this function in the list of functions to be called from the
2050 static constructors and destructors. */
2053 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2055 /* Take this opportunity to initialize the map from priority
2056 numbers to information about that priority level. */
2057 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2058 /*delete_key_fn=*/0,
2059 /*delete_value_fn=*/
2060 (splay_tree_delete_value_fn) &free);
2062 /* We always need to generate functions for the
2063 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2064 priorities later, we'll be sure to find the
2065 DEFAULT_INIT_PRIORITY. */
2066 get_priority_info (DEFAULT_INIT_PRIORITY);
2069 VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl);
2071 /* Create the argument list. */
2072 initialize_p_decl = cp_build_parm_decl
2073 (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node);
2074 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2075 TREE_USED (initialize_p_decl) = 1;
2076 priority_decl = cp_build_parm_decl
2077 (get_identifier (PRIORITY_IDENTIFIER), integer_type_node);
2078 DECL_CONTEXT (priority_decl) = ssdf_decl;
2079 TREE_USED (priority_decl) = 1;
2081 TREE_CHAIN (initialize_p_decl) = priority_decl;
2082 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2084 /* Put the function in the global scope. */
2085 pushdecl (ssdf_decl);
2087 /* Start the function itself. This is equivalent to declarating the
2090 static void __ssdf (int __initialize_p, init __priority_p);
2092 It is static because we only need to call this function from the
2093 various constructor and destructor functions for this module. */
2094 start_function (/*specs=*/NULL_TREE,
2096 /*attrs=*/NULL_TREE,
2099 /* Set up the scope of the outermost block in the function. */
2100 body = begin_compound_stmt (/*has_no_scope=*/false);
2102 /* This function must not be deferred because we are depending on
2103 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
2104 current_function_cannot_inline
2105 = "static storage duration functions cannot be inlined";
2110 /* Finish the generation of the function which performs initialization
2111 and destruction of objects with static storage duration. After
2112 this point, no more such objects can be created. */
2115 finish_static_storage_duration_function (tree body)
2117 /* Close out the function. */
2118 finish_compound_stmt (body);
2119 expand_or_defer_fn (finish_function (0));
2122 /* Return the information about the indicated PRIORITY level. If no
2123 code to handle this level has yet been generated, generate the
2124 appropriate prologue. */
2126 static priority_info
2127 get_priority_info (int priority)
2132 n = splay_tree_lookup (priority_info_map,
2133 (splay_tree_key) priority);
2136 /* Create a new priority information structure, and insert it
2138 pi = xmalloc (sizeof (struct priority_info_s));
2139 pi->initializations_p = 0;
2140 pi->destructions_p = 0;
2141 splay_tree_insert (priority_info_map,
2142 (splay_tree_key) priority,
2143 (splay_tree_value) pi);
2146 pi = (priority_info) n->value;
2151 /* Set up to handle the initialization or destruction of DECL. If
2152 INITP is nonzero, we are initializing the variable. Otherwise, we
2153 are destroying it. */
2156 start_static_initialization_or_destruction (tree decl, int initp)
2158 tree guard_if_stmt = NULL_TREE;
2165 /* Figure out the priority for this declaration. */
2166 priority = DECL_INIT_PRIORITY (decl);
2168 priority = DEFAULT_INIT_PRIORITY;
2170 /* Remember that we had an initialization or finalization at this
2172 pi = get_priority_info (priority);
2174 pi->initializations_p = 1;
2176 pi->destructions_p = 1;
2178 /* Trick the compiler into thinking we are at the file and line
2179 where DECL was declared so that error-messages make sense, and so
2180 that the debugger will show somewhat sensible file and line
2182 input_location = DECL_SOURCE_LOCATION (decl);
2188 Access control for implicit calls to the constructors,
2189 the conversion functions, or the destructor called to
2190 create and destroy a static data member is performed as
2191 if these calls appeared in the scope of the member's
2194 we pretend we are in a static member function of the class of
2195 which the DECL is a member. */
2196 if (member_p (decl))
2198 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
2199 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
2202 /* Conditionalize this initialization on being in the right priority
2203 and being initializing/finalizing appropriately. */
2204 guard_if_stmt = begin_if_stmt ();
2205 cond = cp_build_binary_op (EQ_EXPR,
2207 build_int_2 (priority, 0));
2208 init_cond = initp ? integer_one_node : integer_zero_node;
2209 init_cond = cp_build_binary_op (EQ_EXPR,
2212 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
2214 /* Assume we don't need a guard. */
2216 /* We need a guard if this is an object with external linkage that
2217 might be initialized in more than one place. (For example, a
2218 static data member of a template, when the data member requires
2220 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
2221 || DECL_ONE_ONLY (decl)
2222 || DECL_WEAK (decl)))
2226 guard = get_guard (decl);
2228 /* When using __cxa_atexit, we just check the GUARD as we would
2229 for a local static. */
2230 if (flag_use_cxa_atexit)
2232 /* When using __cxa_atexit, we never try to destroy
2233 anything from a static destructor. */
2234 my_friendly_assert (initp, 20000629);
2235 guard_cond = get_guard_cond (guard);
2237 /* If we don't have __cxa_atexit, then we will be running
2238 destructors from .fini sections, or their equivalents. So,
2239 we need to know how many times we've tried to initialize this
2240 object. We do initializations only if the GUARD is zero,
2241 i.e., if we are the first to initialize the variable. We do
2242 destructions only if the GUARD is one, i.e., if we are the
2243 last to destroy the variable. */
2246 = cp_build_binary_op (EQ_EXPR,
2247 build_unary_op (PREINCREMENT_EXPR,
2253 = cp_build_binary_op (EQ_EXPR,
2254 build_unary_op (PREDECREMENT_EXPR,
2259 cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, guard_cond);
2262 finish_if_stmt_cond (cond, guard_if_stmt);
2264 /* If we're using __cxa_atexit, we have not already set the GUARD,
2265 so we must do so now. */
2266 if (guard && initp && flag_use_cxa_atexit)
2267 finish_expr_stmt (set_guard (guard));
2269 return guard_if_stmt;
2272 /* We've just finished generating code to do an initialization or
2273 finalization. GUARD_IF_STMT is the if-statement we used to guard
2274 the initialization. */
2277 finish_static_initialization_or_destruction (tree guard_if_stmt)
2279 finish_then_clause (guard_if_stmt);
2282 /* Now that we're done with DECL we don't need to pretend to be a
2283 member of its class any longer. */
2284 DECL_CONTEXT (current_function_decl) = NULL_TREE;
2285 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
2288 /* Generate code to do the initialization of DECL, a VAR_DECL with
2289 static storage duration. The initialization is INIT. */
2292 do_static_initialization (tree decl, tree init)
2296 /* Set up for the initialization. */
2298 = start_static_initialization_or_destruction (decl,
2301 /* Perform the initialization. */
2303 finish_expr_stmt (init);
2305 /* If we're using __cxa_atexit, register a a function that calls the
2306 destructor for the object. */
2307 if (flag_use_cxa_atexit)
2308 register_dtor_fn (decl);
2311 finish_static_initialization_or_destruction (guard_if_stmt);
2314 /* Generate code to do the static destruction of DECL. If DECL may be
2315 initialized more than once in different object files, GUARD is the
2316 guard variable to check. PRIORITY is the priority for the
2320 do_static_destruction (tree decl)
2324 /* If we're using __cxa_atexit, then destructors are registered
2325 immediately after objects are initialized. */
2326 my_friendly_assert (!flag_use_cxa_atexit, 20000121);
2328 /* If we don't need a destructor, there's nothing to do. */
2329 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2332 /* Actually do the destruction. */
2333 guard_if_stmt = start_static_initialization_or_destruction (decl,
2335 finish_expr_stmt (build_cleanup (decl));
2336 finish_static_initialization_or_destruction (guard_if_stmt);
2339 /* VARS is a list of variables with static storage duration which may
2340 need initialization and/or finalization. Remove those variables
2341 that don't really need to be initialized or finalized, and return
2342 the resulting list. The order in which the variables appear in
2343 VARS is in reverse order of the order in which they should actually
2344 be initialized. The list we return is in the unreversed order;
2345 i.e., the first variable should be initialized first. */
2348 prune_vars_needing_no_initialization (tree *vars)
2351 tree result = NULL_TREE;
2356 tree decl = TREE_VALUE (t);
2357 tree init = TREE_PURPOSE (t);
2359 /* Deal gracefully with error. */
2360 if (decl == error_mark_node)
2362 var = &TREE_CHAIN (t);
2366 /* The only things that can be initialized are variables. */
2367 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
2369 /* If this object is not defined, we don't need to do anything
2371 if (DECL_EXTERNAL (decl))
2373 var = &TREE_CHAIN (t);
2377 /* Also, if the initializer already contains errors, we can bail
2379 if (init && TREE_CODE (init) == TREE_LIST
2380 && value_member (error_mark_node, init))
2382 var = &TREE_CHAIN (t);
2386 /* This variable is going to need initialization and/or
2387 finalization, so we add it to the list. */
2388 *var = TREE_CHAIN (t);
2389 TREE_CHAIN (t) = result;
2396 /* Make sure we have told the back end about all the variables in
2400 write_out_vars (tree vars)
2404 for (v = vars; v; v = TREE_CHAIN (v))
2405 if (!var_finalized_p (TREE_VALUE (v)))
2406 rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1);
2409 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
2410 (otherwise) that will initialize all gobal objects with static
2411 storage duration having the indicated PRIORITY. */
2414 generate_ctor_or_dtor_function (bool constructor_p, int priority,
2423 input_location = *locus;
2426 /* We use `I' to indicate initialization and `D' to indicate
2428 function_key = constructor_p ? 'I' : 'D';
2430 /* We emit the function lazily, to avoid generating empty
2431 global constructors and destructors. */
2434 /* Call the static storage duration function with appropriate
2437 for (i = 0; i < ssdf_decls->elements_used; ++i)
2439 fndecl = VARRAY_TREE (ssdf_decls, i);
2441 /* Calls to pure or const functions will expand to nothing. */
2442 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2445 body = start_objects (function_key, priority);
2447 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
2449 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
2451 finish_expr_stmt (build_function_call (fndecl, arguments));
2455 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
2456 calls to any functions marked with attributes indicating that
2457 they should be called at initialization- or destruction-time. */
2458 if (priority == DEFAULT_INIT_PRIORITY)
2462 for (fns = constructor_p ? static_ctors : static_dtors;
2464 fns = TREE_CHAIN (fns))
2466 fndecl = TREE_VALUE (fns);
2468 /* Calls to pure/const functions will expand to nothing. */
2469 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2472 body = start_objects (function_key, priority);
2473 finish_expr_stmt (build_function_call (fndecl, NULL_TREE));
2478 /* Close out the function. */
2480 finish_objects (function_key, priority, body);
2483 /* Generate constructor and destructor functions for the priority
2487 generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data)
2489 location_t *locus = data;
2490 int priority = (int) n->key;
2491 priority_info pi = (priority_info) n->value;
2493 /* Generate the functions themselves, but only if they are really
2495 if (pi->initializations_p
2496 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
2497 generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus);
2498 if (pi->destructions_p
2499 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
2500 generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus);
2502 /* Keep iterating. */
2506 /* Called via LANGHOOK_CALLGRAPH_ANALYZE_EXPR. It is supposed to mark
2507 decls referenced from frontend specific constructs; it will be called
2508 only for language-specific tree nodes.
2510 Here we must deal with member pointers. */
2513 cxx_callgraph_analyze_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2514 tree from ATTRIBUTE_UNUSED)
2518 if (flag_unit_at_a_time)
2519 switch (TREE_CODE (t))
2522 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
2523 cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t)));
2526 if (TREE_CODE (BASELINK_FUNCTIONS (t)) == FUNCTION_DECL)
2527 cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t)));
2537 /* This routine is called from the last rule in yyparse ().
2538 Its job is to create all the code needed to initialize and
2539 destroy the global aggregates. We do the destruction
2540 first, since that way we only need to reverse the decls once. */
2549 unsigned ssdf_count = 0;
2551 locus = input_location;
2554 /* Bad parse errors. Just forget about it. */
2555 if (! global_bindings_p () || current_class_type || decl_namespace_list)
2559 c_common_write_pch ();
2561 /* Otherwise, GDB can get confused, because in only knows
2562 about source for LINENO-1 lines. */
2565 interface_unknown = 1;
2568 /* We now have to write out all the stuff we put off writing out.
2571 o Template specializations that we have not yet instantiated,
2572 but which are needed.
2573 o Initialization and destruction for non-local objects with
2574 static storage duration. (Local objects with static storage
2575 duration are initialized when their scope is first entered,
2576 and are cleaned up via atexit.)
2577 o Virtual function tables.
2579 All of these may cause others to be needed. For example,
2580 instantiating one function may cause another to be needed, and
2581 generating the initializer for an object may cause templates to be
2582 instantiated, etc., etc. */
2584 timevar_push (TV_VARCONST);
2586 emit_support_tinfos ();
2591 size_t n_old, n_new;
2595 /* If there are templates that we've put off instantiating, do
2597 instantiate_pending_templates ();
2599 /* Write out virtual tables as required. Note that writing out
2600 the virtual table for a template class may cause the
2601 instantiation of members of that class. If we write out
2602 vtables then we remove the class from our list so we don't
2603 have to look at it again. */
2605 while (keyed_classes != NULL_TREE
2606 && maybe_emit_vtables (TREE_VALUE (keyed_classes)))
2609 keyed_classes = TREE_CHAIN (keyed_classes);
2615 tree next = TREE_CHAIN (t);
2619 if (maybe_emit_vtables (TREE_VALUE (next)))
2622 TREE_CHAIN (t) = TREE_CHAIN (next);
2627 next = TREE_CHAIN (t);
2631 /* Write out needed type info variables. We have to be careful
2632 looping through unemitted decls, because emit_tinfo_decl may
2633 cause other variables to be needed. We stick new elements
2634 (and old elements that we may need to reconsider) at the end
2635 of the array, then shift them back to the beginning once we're
2638 n_old = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls);
2639 for (i = 0; i < n_old; ++i)
2641 tree tinfo_decl = VARRAY_TREE (unemitted_tinfo_decls, i);
2642 if (emit_tinfo_decl (tinfo_decl))
2645 VARRAY_PUSH_TREE (unemitted_tinfo_decls, tinfo_decl);
2648 /* The only elements we want to keep are the new ones. Copy
2649 them to the beginning of the array, then get rid of the
2651 n_new = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) - n_old;
2653 memmove (&VARRAY_TREE (unemitted_tinfo_decls, 0),
2654 &VARRAY_TREE (unemitted_tinfo_decls, n_old),
2655 n_new * sizeof (tree));
2656 memset (&VARRAY_TREE (unemitted_tinfo_decls, n_new),
2657 0, n_old * sizeof (tree));
2658 VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) = n_new;
2660 /* The list of objects with static storage duration is built up
2661 in reverse order. We clear STATIC_AGGREGATES so that any new
2662 aggregates added during the initialization of these will be
2663 initialized in the correct order when we next come around the
2665 vars = prune_vars_needing_no_initialization (&static_aggregates);
2671 /* We need to start a new initialization function each time
2672 through the loop. That's because we need to know which
2673 vtables have been referenced, and TREE_SYMBOL_REFERENCED
2674 isn't computed until a function is finished, and written
2675 out. That's a deficiency in the back-end. When this is
2676 fixed, these initialization functions could all become
2677 inline, with resulting performance improvements. */
2680 /* Set the line and file, so that it is obviously not from
2682 input_location = locus;
2683 ssdf_body = start_static_storage_duration_function (ssdf_count);
2685 /* Make sure the back end knows about all the variables. */
2686 write_out_vars (vars);
2688 /* First generate code to do all the initializations. */
2689 for (v = vars; v; v = TREE_CHAIN (v))
2690 do_static_initialization (TREE_VALUE (v),
2693 /* Then, generate code to do all the destructions. Do these
2694 in reverse order so that the most recently constructed
2695 variable is the first destroyed. If we're using
2696 __cxa_atexit, then we don't need to do this; functions
2697 were registered at initialization time to destroy the
2699 if (!flag_use_cxa_atexit)
2701 vars = nreverse (vars);
2702 for (v = vars; v; v = TREE_CHAIN (v))
2703 do_static_destruction (TREE_VALUE (v));
2708 /* Finish up the static storage duration function for this
2710 input_location = locus;
2711 finish_static_storage_duration_function (ssdf_body);
2713 /* All those initializations and finalizations might cause
2714 us to need more inline functions, more template
2715 instantiations, etc. */
2721 for (i = 0; i < deferred_fns_used; ++i)
2723 tree decl = VARRAY_TREE (deferred_fns, i);
2725 /* Does it need synthesizing? */
2726 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
2728 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
2730 /* Even though we're already at the top-level, we push
2731 there again. That way, when we pop back a few lines
2732 hence, all of our state is restored. Otherwise,
2733 finish_function doesn't clean things up, and we end
2734 up with CURRENT_FUNCTION_DECL set. */
2735 push_to_top_level ();
2736 synthesize_method (decl);
2737 pop_from_top_level ();
2741 /* If the function has no body, avoid calling
2742 import_export_decl. On a system without weak symbols,
2743 calling import_export_decl will make an inline template
2744 instantiation "static", which will result in errors about
2745 the use of undefined functions if there is no body for
2747 if (!DECL_SAVED_TREE (decl))
2750 import_export_decl (decl);
2752 /* We lie to the back-end, pretending that some functions
2753 are not defined when they really are. This keeps these
2754 functions from being put out unnecessarily. But, we must
2755 stop lying when the functions are referenced, or if they
2756 are not comdat since they need to be put out now. This
2757 is done in a separate for cycle, because if some deferred
2758 function is contained in another deferred function later
2759 in deferred_fns varray, rest_of_compilation would skip
2760 this function and we really cannot expand the same
2762 if (DECL_NOT_REALLY_EXTERN (decl)
2763 && DECL_INITIAL (decl)
2764 && DECL_NEEDED_P (decl))
2765 DECL_EXTERNAL (decl) = 0;
2767 /* If we're going to need to write this function out, and
2768 there's already a body for it, create RTL for it now.
2769 (There might be no body if this is a method we haven't
2770 gotten around to synthesizing yet.) */
2771 if (!DECL_EXTERNAL (decl)
2772 && DECL_NEEDED_P (decl)
2773 && DECL_SAVED_TREE (decl)
2774 && !TREE_ASM_WRITTEN (decl)
2775 && (!flag_unit_at_a_time
2776 || !cgraph_node (decl)->local.finalized))
2778 /* We will output the function; no longer consider it in this
2780 DECL_DEFER_OUTPUT (decl) = 0;
2781 /* Generate RTL for this function now that we know we
2783 expand_or_defer_fn (decl);
2784 /* If we're compiling -fsyntax-only pretend that this
2785 function has been written out so that we don't try to
2787 if (flag_syntax_only)
2788 TREE_ASM_WRITTEN (decl) = 1;
2793 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
2796 /* Static data members are just like namespace-scope globals. */
2797 for (i = 0; i < pending_statics_used; ++i)
2799 tree decl = VARRAY_TREE (pending_statics, i);
2800 if (var_finalized_p (decl))
2802 import_export_decl (decl);
2803 if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
2804 DECL_EXTERNAL (decl) = 0;
2807 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
2808 pending_statics_used))
2811 if (cgraph_assemble_pending_functions ())
2816 /* All used inline functions must have a definition at this point. */
2817 for (i = 0; i < deferred_fns_used; ++i)
2819 tree decl = VARRAY_TREE (deferred_fns, i);
2821 if (TREE_USED (decl) && DECL_DECLARED_INLINE_P (decl)
2822 && !(TREE_ASM_WRITTEN (decl) || DECL_SAVED_TREE (decl)
2823 /* An explicit instantiation can be used to specify
2824 that the body is in another unit. It will have
2825 already verified there was a definition. */
2826 || DECL_EXPLICIT_INSTANTIATION (decl)))
2828 cp_warning_at ("inline function `%D' used but never defined", decl);
2829 /* This symbol is effectively an "extern" declaration now.
2830 This is not strictly necessary, but removes a duplicate
2832 TREE_PUBLIC (decl) = 1;
2837 /* We give C linkage to static constructors and destructors. */
2838 push_lang_context (lang_name_c);
2840 /* Generate initialization and destruction functions for all
2841 priorities for which they are required. */
2842 if (priority_info_map)
2843 splay_tree_foreach (priority_info_map,
2844 generate_ctor_and_dtor_functions_for_priority,
2850 generate_ctor_or_dtor_function (/*constructor_p=*/true,
2851 DEFAULT_INIT_PRIORITY, &locus);
2853 generate_ctor_or_dtor_function (/*constructor_p=*/false,
2854 DEFAULT_INIT_PRIORITY, &locus);
2857 /* We're done with the splay-tree now. */
2858 if (priority_info_map)
2859 splay_tree_delete (priority_info_map);
2861 /* We're done with static constructors, so we can go back to "C++"
2863 pop_lang_context ();
2865 if (flag_unit_at_a_time)
2867 cgraph_finalize_compilation_unit ();
2871 /* Now, issue warnings about static, but not defined, functions,
2872 etc., and emit debugging information. */
2873 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
2874 if (pending_statics)
2875 check_global_declarations (&VARRAY_TREE (pending_statics, 0),
2876 pending_statics_used);
2880 /* The entire file is now complete. If requested, dump everything
2884 FILE *stream = dump_begin (TDI_all, &flags);
2888 dump_node (global_namespace, flags & ~TDF_SLIM, stream);
2889 dump_end (TDI_all, stream);
2893 timevar_pop (TV_VARCONST);
2895 if (flag_detailed_statistics)
2897 dump_tree_statistics ();
2898 dump_time_statistics ();
2900 input_location = locus;
2903 /* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the
2904 function to call in parse-tree form; it has not yet been
2905 semantically analyzed. ARGS are the arguments to the function.
2906 They have already been semantically analyzed. */
2909 build_offset_ref_call_from_tree (tree fn, tree args)
2918 object = TREE_OPERAND (fn, 0);
2920 if (processing_template_decl)
2922 my_friendly_assert (TREE_CODE (fn) == DOTSTAR_EXPR
2923 || TREE_CODE (fn) == MEMBER_REF,
2925 if (type_dependent_expression_p (fn)
2926 || any_type_dependent_arguments_p (args))
2927 return build_min_nt (CALL_EXPR, fn, args);
2929 /* Transform the arguments and add the implicit "this"
2930 parameter. That must be done before the FN is transformed
2931 because we depend on the form of FN. */
2932 args = build_non_dependent_args (args);
2933 if (TREE_CODE (fn) == DOTSTAR_EXPR)
2934 object = build_unary_op (ADDR_EXPR, object, 0);
2935 object = build_non_dependent_expr (object);
2936 args = tree_cons (NULL_TREE, object, args);
2937 /* Now that the arguments are done, transform FN. */
2938 fn = build_non_dependent_expr (fn);
2941 /* A qualified name corresponding to a bound pointer-to-member is
2942 represented as an OFFSET_REF:
2944 struct B { void g(); };
2946 void B::g() { (this->*p)(); } */
2947 if (TREE_CODE (fn) == OFFSET_REF)
2949 tree object_addr = build_unary_op (ADDR_EXPR, object, 0);
2950 fn = TREE_OPERAND (fn, 1);
2951 fn = get_member_function_from_ptrfunc (&object_addr, fn);
2952 args = tree_cons (NULL_TREE, object_addr, args);
2955 expr = build_function_call (fn, args);
2956 if (processing_template_decl && expr != error_mark_node)
2957 return build_min_non_dep (CALL_EXPR, expr, orig_fn, orig_args);
2963 check_default_args (tree x)
2965 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
2966 bool saw_def = false;
2967 int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
2968 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
2970 if (TREE_PURPOSE (arg))
2974 cp_error_at ("default argument missing for parameter %P of `%+#D'",
2982 mark_used (tree decl)
2984 TREE_USED (decl) = 1;
2985 if (processing_template_decl || skip_evaluation)
2988 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl)
2989 && !TREE_ASM_WRITTEN (decl))
2990 /* Remember it, so we can check it was defined. */
2993 assemble_external (decl);
2995 /* Is it a synthesized method that needs to be synthesized? */
2996 if (TREE_CODE (decl) == FUNCTION_DECL
2997 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
2998 && DECL_ARTIFICIAL (decl)
2999 && !DECL_THUNK_P (decl)
3000 && ! DECL_INITIAL (decl)
3001 /* Kludge: don't synthesize for default args. */
3002 && current_function_decl)
3004 synthesize_method (decl);
3005 /* If we've already synthesized the method we don't need to
3006 instantiate it, so we can return right away. */
3010 /* If this is a function or variable that is an instance of some
3011 template, we now know that we will need to actually do the
3012 instantiation. We check that DECL is not an explicit
3013 instantiation because that is not checked in instantiate_decl. */
3014 if ((DECL_NON_THUNK_FUNCTION_P (decl) || TREE_CODE (decl) == VAR_DECL)
3015 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
3016 && (!DECL_EXPLICIT_INSTANTIATION (decl)
3017 || (TREE_CODE (decl) == FUNCTION_DECL
3018 && DECL_INLINE (DECL_TEMPLATE_RESULT
3019 (template_for_substitution (decl))))))
3023 /* Normally, we put off instantiating functions in order to
3024 improve compile times. Maintaining a stack of active
3025 functions is expensive, and the inliner knows to
3026 instantiate any functions it might need.
3028 However, if instantiating this function might help us mark
3029 the current function TREE_NOTHROW, we go ahead and
3030 instantiate it now. */
3031 defer = (!flag_exceptions
3032 || TREE_CODE (decl) != FUNCTION_DECL
3033 /* If the called function can't throw, we don't need to
3034 generate its body to find that out. */
3035 || TREE_NOTHROW (decl)
3037 /* If we already know the current function can't throw,
3038 then we don't need to work hard to prove it. */
3039 || TREE_NOTHROW (current_function_decl)
3040 /* If we already know that the current function *can*
3041 throw, there's no point in gathering more
3043 || cp_function_chain->can_throw);
3045 instantiate_decl (decl, defer);
3049 #include "gt-cp-decl2.h"