1 /* Basic IPA utilities for type inheritance graph construction and
3 Copyright (C) 2013-2014 Free Software Foundation, Inc.
4 Contributed by Jan Hubicka
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 ODR = One Definition Rule
24 In short, the ODR states that:
25 1 In any translation unit, a template, type, function, or object can
26 have no more than one definition. Some of these can have any number
27 of declarations. A definition provides an instance.
28 2 In the entire program, an object or non-inline function cannot have
29 more than one definition; if an object or function is used, it must
30 have exactly one definition. You can declare an object or function
31 that is never used, in which case you don't have to provide
32 a definition. In no event can there be more than one definition.
33 3 Some things, like types, templates, and extern inline functions, can
34 be defined in more than one translation unit. For a given entity,
35 each definition must be the same. Non-extern objects and functions
36 in different translation units are different entities, even if their
37 names and types are the same.
40 This is the Gimple representation of type information of a polymorphic call.
41 It contains two parameters:
42 otr_type is a type of class whose method is called.
43 otr_token is the index into virtual table where address is taken.
46 This is the type inheritance information attached to each tree
47 RECORD_TYPE by the C++ frotend. It provides information about base
48 types and virtual tables.
50 BINFO is linked to the RECORD_TYPE by TYPE_BINFO.
51 BINFO also links to its type by BINFO_TYPE and to the virtual table by
54 Base types of a given type are enumerated by BINFO_BASE_BINFO
55 vector. Members of this vectors are not BINFOs associated
56 with a base type. Rather they are new copies of BINFOs
57 (base BINFOs). Their virtual tables may differ from
58 virtual table of the base type. Also BINFO_OFFSET specifies
59 offset of the base within the type.
61 In the case of single inheritance, the virtual table is shared
62 and BINFO_VTABLE of base BINFO is NULL. In the case of multiple
63 inheritance the individual virtual tables are pointer to by
64 BINFO_VTABLE of base binfos (that differs of BINFO_VTABLE of
65 binfo associated to the base type).
67 BINFO lookup for a given base type and offset can be done by
68 get_binfo_at_offset. It returns proper BINFO whose virtual table
69 can be used for lookup of virtual methods associated with the
73 This is an index of virtual method in virtual table associated
74 to the type defining it. Token can be looked up from OBJ_TYPE_REF
75 or from DECL_VINDEX of a given virtual table.
77 polymorphic (indirect) call
78 This is callgraph represention of virtual method call. Every
79 polymorphic call contains otr_type and otr_token taken from
80 original OBJ_TYPE_REF at callgraph construction time.
84 build_type_inheritance_graph triggers a construction of the type inheritance
87 We reconstruct it based on types of methods we see in the unit.
88 This means that the graph is not complete. Types with no methods are not
89 inserted into the graph. Also types without virtual methods are not
90 represented at all, though it may be easy to add this.
92 The inheritance graph is represented as follows:
94 Vertices are structures odr_type. Every odr_type may correspond
95 to one or more tree type nodes that are equivalent by ODR rule.
96 (the multiple type nodes appear only with linktime optimization)
98 Edges are represented by odr_type->base and odr_type->derived_types.
99 At the moment we do not track offsets of types for multiple inheritance.
102 possible_polymorphic_call_targets returns, given an parameters found in
103 indirect polymorphic edge all possible polymorphic call targets of the call.
105 pass_ipa_devirt performs simple speculative devirtualization.
110 #include "coretypes.h"
113 #include "print-tree.h"
117 #include "tree-pass.h"
118 #include "pointer-set.h"
120 #include "hash-table.h"
122 #include "tree-pretty-print.h"
123 #include "ipa-utils.h"
124 #include "tree-ssa-alias.h"
125 #include "internal-fn.h"
126 #include "gimple-fold.h"
127 #include "gimple-expr.h"
129 #include "ipa-inline.h"
130 #include "diagnostic.h"
131 #include "tree-dfa.h"
132 #include "demangle.h"
134 #include "stor-layout.h"
137 static bool odr_types_equivalent_p (tree
, tree
, bool, bool *, pointer_set_t
*);
139 static bool odr_violation_reported
= false;
141 /* Dummy polymorphic call context. */
143 const ipa_polymorphic_call_context ipa_dummy_polymorphic_call_context
144 = {0, 0, NULL
, NULL
, false, true, true};
146 /* Pointer set of all call targets appearing in the cache. */
147 static pointer_set_t
*cached_polymorphic_call_targets
;
149 /* The node of type inheritance graph. For each type unique in
150 One Defintion Rule (ODR) sense, we produce one node linking all
151 main variants of types equivalent to it, bases and derived types. */
153 struct GTY(()) odr_type_d
157 /* All bases; built only for main variants of types */
158 vec
<odr_type
> GTY((skip
)) bases
;
159 /* All derrived types with virtual methods seen in unit;
160 built only for main variants oftypes */
161 vec
<odr_type
> GTY((skip
)) derived_types
;
163 /* All equivalent types, if more than one. */
164 vec
<tree
, va_gc
> *types
;
165 /* Set of all equivalent types, if NON-NULL. */
166 pointer_set_t
* GTY((skip
)) types_set
;
168 /* Unique ID indexing the type in odr_types array. */
170 /* Is it in anonymous namespace? */
171 bool anonymous_namespace
;
172 /* Do we know about all derivations of given type? */
173 bool all_derivations_known
;
174 /* Did we report ODR violation here? */
178 static bool contains_type_p (tree
, HOST_WIDE_INT
, tree
);
181 /* Return true if BINFO corresponds to a type with virtual methods.
183 Every type has several BINFOs. One is the BINFO associated by the type
184 while other represents bases of derived types. The BINFOs representing
185 bases do not have BINFO_VTABLE pointer set when this is the single
186 inheritance (because vtables are shared). Look up the BINFO of type
187 and check presence of its vtable. */
190 polymorphic_type_binfo_p (tree binfo
)
192 /* See if BINFO's type has an virtual table associtated with it. */
193 return BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (binfo
)));
196 /* Return TRUE if all derived types of T are known and thus
197 we may consider the walk of derived type complete.
199 This is typically true only for final anonymous namespace types and types
200 defined within functions (that may be COMDAT and thus shared across units,
201 but with the same set of derived types). */
204 type_all_derivations_known_p (tree t
)
206 if (TYPE_FINAL_P (t
))
210 if (type_in_anonymous_namespace_p (t
))
212 return (decl_function_context (TYPE_NAME (t
)) != NULL
);
215 /* Return TURE if type's constructors are all visible. */
218 type_all_ctors_visible_p (tree t
)
221 && cgraph_state
>= CGRAPH_STATE_CONSTRUCTION
222 /* We can not always use type_all_derivations_known_p.
223 For function local types we must assume case where
224 the function is COMDAT and shared in between units.
226 TODO: These cases are quite easy to get, but we need
227 to keep track of C++ privatizing via -Wno-weak
228 as well as the IPA privatizing. */
229 && type_in_anonymous_namespace_p (t
);
232 /* Return TRUE if type may have instance. */
235 type_possibly_instantiated_p (tree t
)
240 /* TODO: Add abstract types here. */
241 if (!type_all_ctors_visible_p (t
))
244 vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
245 if (TREE_CODE (vtable
) == POINTER_PLUS_EXPR
)
246 vtable
= TREE_OPERAND (TREE_OPERAND (vtable
, 0), 0);
247 vnode
= varpool_node::get (vtable
);
248 return vnode
&& vnode
->definition
;
251 /* One Definition Rule hashtable helpers. */
255 typedef odr_type_d value_type
;
256 typedef union tree_node compare_type
;
257 static inline hashval_t
hash (const value_type
*);
258 static inline bool equal (const value_type
*, const compare_type
*);
259 static inline void remove (value_type
*);
262 /* Return type that was declared with T's name so that T is an
263 qualified variant of it. */
266 main_odr_variant (const_tree t
)
268 if (TYPE_NAME (t
) && TREE_CODE (TYPE_NAME (t
)) == TYPE_DECL
)
269 return TREE_TYPE (TYPE_NAME (t
));
270 /* Unnamed types and non-C++ produced types can be compared by variants. */
272 return TYPE_MAIN_VARIANT (t
);
275 /* Produce hash based on type name. */
278 hash_type_name (tree t
)
280 gcc_checking_assert (main_odr_variant (t
) == t
);
282 /* If not in LTO, all main variants are unique, so we can do
285 return htab_hash_pointer (t
);
287 /* Anonymous types are unique. */
288 if (type_in_anonymous_namespace_p (t
))
289 return htab_hash_pointer (t
);
291 /* For polymorphic types, we can simply hash the virtual table. */
292 if (TREE_CODE (t
) == RECORD_TYPE
293 && TYPE_BINFO (t
) && BINFO_VTABLE (TYPE_BINFO (t
)))
295 tree v
= BINFO_VTABLE (TYPE_BINFO (t
));
298 if (TREE_CODE (v
) == POINTER_PLUS_EXPR
)
300 hash
= TREE_INT_CST_LOW (TREE_OPERAND (v
, 1));
301 v
= TREE_OPERAND (TREE_OPERAND (v
, 0), 0);
304 v
= DECL_ASSEMBLER_NAME (v
);
305 hash
= iterative_hash_hashval_t (hash
, htab_hash_pointer (v
));
309 /* Rest is not implemented yet. */
313 /* Return the computed hashcode for ODR_TYPE. */
316 odr_hasher::hash (const value_type
*odr_type
)
318 return hash_type_name (odr_type
->type
);
321 /* For languages with One Definition Rule, work out if
322 types are the same based on their name.
324 This is non-trivial for LTO where minnor differences in
325 the type representation may have prevented type merging
326 to merge two copies of otherwise equivalent type.
328 Until we start streaming mangled type names, this function works
329 only for polymorphic types. */
332 types_same_for_odr (const_tree type1
, const_tree type2
)
334 gcc_checking_assert (TYPE_P (type1
) && TYPE_P (type2
));
336 type1
= main_odr_variant (type1
);
337 type2
= main_odr_variant (type2
);
345 /* Check for anonymous namespaces. Those have !TREE_PUBLIC
346 on the corresponding TYPE_STUB_DECL. */
347 if (type_in_anonymous_namespace_p (type1
)
348 || type_in_anonymous_namespace_p (type2
))
351 /* See if types are obvoiusly different (i.e. different codes
352 or polymorphis wrt non-polymorphic). This is not strictly correct
353 for ODR violating programs, but we can't do better without streaming
355 if (TREE_CODE (type1
) != TREE_CODE (type2
))
357 if (TREE_CODE (type1
) == RECORD_TYPE
358 && (TYPE_BINFO (type1
) == NULL_TREE
) != (TYPE_BINFO (type1
) == NULL_TREE
))
360 if (TREE_CODE (type1
) == RECORD_TYPE
&& TYPE_BINFO (type1
)
361 && (BINFO_VTABLE (TYPE_BINFO (type1
)) == NULL_TREE
)
362 != (BINFO_VTABLE (TYPE_BINFO (type2
)) == NULL_TREE
))
365 /* At the moment we have no way to establish ODR equivlaence at LTO
366 other than comparing virtual table pointrs of polymorphic types.
367 Eventually we should start saving mangled names in TYPE_NAME.
368 Then this condition will become non-trivial. */
370 if (TREE_CODE (type1
) == RECORD_TYPE
371 && TYPE_BINFO (type1
) && TYPE_BINFO (type2
)
372 && BINFO_VTABLE (TYPE_BINFO (type1
))
373 && BINFO_VTABLE (TYPE_BINFO (type2
)))
375 tree v1
= BINFO_VTABLE (TYPE_BINFO (type1
));
376 tree v2
= BINFO_VTABLE (TYPE_BINFO (type2
));
377 gcc_assert (TREE_CODE (v1
) == POINTER_PLUS_EXPR
378 && TREE_CODE (v2
) == POINTER_PLUS_EXPR
);
379 return (operand_equal_p (TREE_OPERAND (v1
, 1),
380 TREE_OPERAND (v2
, 1), 0)
381 && DECL_ASSEMBLER_NAME
382 (TREE_OPERAND (TREE_OPERAND (v1
, 0), 0))
383 == DECL_ASSEMBLER_NAME
384 (TREE_OPERAND (TREE_OPERAND (v2
, 0), 0)));
390 /* Compare types T1 and T2 and return true if they are
394 odr_hasher::equal (const value_type
*t1
, const compare_type
*ct2
)
396 tree t2
= const_cast <tree
> (ct2
);
398 gcc_checking_assert (main_odr_variant (t2
) == t2
);
403 return types_same_for_odr (t1
->type
, t2
);
406 /* Free ODR type V. */
409 odr_hasher::remove (value_type
*v
)
412 v
->derived_types
.release ();
414 pointer_set_destroy (v
->types_set
);
418 /* ODR type hash used to lookup ODR type based on tree type node. */
420 typedef hash_table
<odr_hasher
> odr_hash_type
;
421 static odr_hash_type
*odr_hash
;
423 /* ODR types are also stored into ODR_TYPE vector to allow consistent
424 walking. Bases appear before derived types. Vector is garbage collected
425 so we won't end up visiting empty types. */
427 static GTY(()) vec
<odr_type
, va_gc
> *odr_types_ptr
;
428 #define odr_types (*odr_types_ptr)
430 /* Set TYPE_BINFO of TYPE and its variants to BINFO. */
432 set_type_binfo (tree type
, tree binfo
)
434 for (; type
; type
= TYPE_NEXT_VARIANT (type
))
435 if (COMPLETE_TYPE_P (type
))
436 TYPE_BINFO (type
) = binfo
;
438 gcc_assert (!TYPE_BINFO (type
));
441 /* Compare T2 and T2 based on name or structure. */
444 odr_subtypes_equivalent_p (tree t1
, tree t2
, pointer_set_t
*visited
)
448 /* This can happen in incomplete types that should be handled earlier. */
449 gcc_assert (t1
&& t2
);
451 t1
= main_odr_variant (t1
);
452 t2
= main_odr_variant (t2
);
455 if (TREE_CODE (t1
) != TREE_CODE (t2
))
457 if ((TYPE_NAME (t1
) == NULL_TREE
) != (TYPE_NAME (t2
) == NULL_TREE
))
459 if (TYPE_NAME (t1
) && DECL_NAME (TYPE_NAME (t1
)) != DECL_NAME (TYPE_NAME (t2
)))
462 /* Anonymous namespace types must match exactly. */
463 an1
= type_in_anonymous_namespace_p (t1
);
464 an2
= type_in_anonymous_namespace_p (t2
);
465 if (an1
!= an2
|| an1
)
468 /* For types where we can not establish ODR equivalency, recurse and deeply
470 if (TREE_CODE (t1
) != RECORD_TYPE
471 || !TYPE_BINFO (t1
) || !TYPE_BINFO (t2
)
472 || !polymorphic_type_binfo_p (TYPE_BINFO (t1
))
473 || !polymorphic_type_binfo_p (TYPE_BINFO (t2
)))
475 /* This should really be a pair hash, but for the moment we do not need
476 100% reliability and it would be better to compare all ODR types so
477 recursion here is needed only for component types. */
478 if (pointer_set_insert (visited
, t1
))
480 return odr_types_equivalent_p (t1
, t2
, false, NULL
, visited
);
482 return types_same_for_odr (t1
, t2
);
485 /* Output ODR violation warning about T1 and T2 with REASON.
486 Display location of ST1 and ST2 if REASON speaks about field or
488 If WARN is false, do nothing. Set WARNED if warning was indeed
492 warn_odr (tree t1
, tree t2
, tree st1
, tree st2
,
493 bool warn
, bool *warned
, const char *reason
)
495 tree decl2
= TYPE_NAME (t2
);
499 if (!warning_at (DECL_SOURCE_LOCATION (TYPE_NAME (t1
)), OPT_Wodr
,
500 "type %qT violates one definition rule",
505 else if (TREE_CODE (st1
) == FIELD_DECL
)
507 inform (DECL_SOURCE_LOCATION (decl2
),
508 "a different type is defined in another translation unit");
509 inform (DECL_SOURCE_LOCATION (st1
),
510 "the first difference of corresponding definitions is field %qD",
514 else if (TREE_CODE (st1
) == FUNCTION_DECL
)
516 inform (DECL_SOURCE_LOCATION (decl2
),
517 "a different type is defined in another translation unit");
518 inform (DECL_SOURCE_LOCATION (st1
),
519 "the first difference of corresponding definitions is method %qD",
525 inform (DECL_SOURCE_LOCATION (decl2
), reason
);
531 /* We already warned about ODR mismatch. T1 and T2 ought to be equivalent
532 because they are used on same place in ODR matching types.
533 They are not; inform the user. */
536 warn_types_mismatch (tree t1
, tree t2
)
538 if (!TYPE_NAME (t1
) || !TYPE_NAME (t2
))
540 /* In Firefox it is a common bug to have same types but in
541 different namespaces. Be a bit more informative on
543 if (TYPE_CONTEXT (t1
) && TYPE_CONTEXT (t2
)
544 && (((TREE_CODE (TYPE_CONTEXT (t1
)) == NAMESPACE_DECL
)
545 != (TREE_CODE (TYPE_CONTEXT (t2
)) == NAMESPACE_DECL
))
546 || (TREE_CODE (TYPE_CONTEXT (t1
)) == NAMESPACE_DECL
547 && (DECL_NAME (TYPE_CONTEXT (t1
)) !=
548 DECL_NAME (TYPE_CONTEXT (t2
))))))
549 inform (DECL_SOURCE_LOCATION (TYPE_NAME (t1
)),
550 "type %qT should match type %qT but is defined "
551 "in different namespace ",
554 inform (DECL_SOURCE_LOCATION (TYPE_NAME (t1
)),
555 "type %qT should match type %qT",
557 inform (DECL_SOURCE_LOCATION (TYPE_NAME (t2
)),
558 "the incompatible type is defined here");
561 /* Compare T1 and T2, report ODR violations if WARN is true and set
562 WARNED to true if anything is reported. Return true if types match.
563 If true is returned, the types are also compatible in the sense of
564 gimple_canonical_types_compatible_p. */
567 odr_types_equivalent_p (tree t1
, tree t2
, bool warn
, bool *warned
, pointer_set_t
*visited
)
569 /* Check first for the obvious case of pointer identity. */
572 gcc_assert (!type_in_anonymous_namespace_p (t1
));
573 gcc_assert (!type_in_anonymous_namespace_p (t2
));
575 /* Can't be the same type if the types don't have the same code. */
576 if (TREE_CODE (t1
) != TREE_CODE (t2
))
578 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
579 G_("a different type is defined in another translation unit"));
583 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
585 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
586 G_("a type with different qualifiers is defined in another "
587 "translation unit"));
591 if (comp_type_attributes (t1
, t2
) != 1)
593 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
594 G_("a type with attributes "
595 "is defined in another translation unit"));
599 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
602 for (v1
= TYPE_VALUES (t1
), v2
= TYPE_VALUES (t2
);
603 v1
&& v2
; v1
= TREE_CHAIN (v1
), v2
= TREE_CHAIN (v2
))
605 if (TREE_PURPOSE (v1
) != TREE_PURPOSE (v2
))
607 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
608 G_("an enum with different value name"
609 " is defined in another translation unit"));
612 if (TREE_VALUE (v1
) != TREE_VALUE (v2
)
613 && !operand_equal_p (DECL_INITIAL (TREE_VALUE (v1
)),
614 DECL_INITIAL (TREE_VALUE (v2
)), 0))
616 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
617 G_("an enum with different values is defined"
618 " in another translation unit"));
624 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
625 G_("an enum with mismatching number of values "
626 "is defined in another translation unit"));
631 /* Non-aggregate types can be handled cheaply. */
632 if (INTEGRAL_TYPE_P (t1
)
633 || SCALAR_FLOAT_TYPE_P (t1
)
634 || FIXED_POINT_TYPE_P (t1
)
635 || TREE_CODE (t1
) == VECTOR_TYPE
636 || TREE_CODE (t1
) == COMPLEX_TYPE
637 || TREE_CODE (t1
) == OFFSET_TYPE
638 || POINTER_TYPE_P (t1
))
640 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
642 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
643 G_("a type with different precision is defined "
644 "in another translation unit"));
647 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
))
649 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
650 G_("a type with different signedness is defined "
651 "in another translation unit"));
655 if (TREE_CODE (t1
) == INTEGER_TYPE
656 && TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
))
658 /* char WRT uint_8? */
659 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
660 G_("a different type is defined in another "
661 "translation unit"));
665 /* For canonical type comparisons we do not want to build SCCs
666 so we cannot compare pointed-to types. But we can, for now,
667 require the same pointed-to type kind and match what
668 useless_type_conversion_p would do. */
669 if (POINTER_TYPE_P (t1
))
671 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
672 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
674 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
675 G_("it is defined as a pointer in different address "
676 "space in another translation unit"));
680 if (!odr_subtypes_equivalent_p (TREE_TYPE (t1
), TREE_TYPE (t2
), visited
))
682 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
683 G_("it is defined as a pointer to different type "
684 "in another translation unit"));
686 warn_types_mismatch (TREE_TYPE (t1
), TREE_TYPE (t2
));
691 /* Tail-recurse to components. */
692 if ((TREE_CODE (t1
) == VECTOR_TYPE
|| TREE_CODE (t1
) == COMPLEX_TYPE
)
693 && !odr_subtypes_equivalent_p (TREE_TYPE (t1
), TREE_TYPE (t2
), visited
))
695 /* Probably specific enough. */
696 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
697 G_("a different type is defined "
698 "in another translation unit"));
700 warn_types_mismatch (TREE_TYPE (t1
), TREE_TYPE (t2
));
704 gcc_assert (operand_equal_p (TYPE_SIZE (t1
), TYPE_SIZE (t2
), 0));
705 gcc_assert (operand_equal_p (TYPE_SIZE_UNIT (t1
),
706 TYPE_SIZE_UNIT (t2
), 0));
707 gcc_assert (TYPE_MODE (t1
) == TYPE_MODE (t2
));
712 /* Do type-specific comparisons. */
713 switch (TREE_CODE (t1
))
717 /* Array types are the same if the element types are the same and
718 the number of elements are the same. */
719 if (!odr_subtypes_equivalent_p (TREE_TYPE (t1
), TREE_TYPE (t2
), visited
))
721 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
722 G_("a different type is defined in another "
723 "translation unit"));
725 warn_types_mismatch (TREE_TYPE (t1
), TREE_TYPE (t2
));
727 gcc_assert (TYPE_STRING_FLAG (t1
) == TYPE_STRING_FLAG (t2
));
728 gcc_assert (TYPE_NONALIASED_COMPONENT (t1
)
729 == TYPE_NONALIASED_COMPONENT (t2
));
731 tree i1
= TYPE_DOMAIN (t1
);
732 tree i2
= TYPE_DOMAIN (t2
);
734 /* For an incomplete external array, the type domain can be
735 NULL_TREE. Check this condition also. */
736 if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
739 tree min1
= TYPE_MIN_VALUE (i1
);
740 tree min2
= TYPE_MIN_VALUE (i2
);
741 tree max1
= TYPE_MAX_VALUE (i1
);
742 tree max2
= TYPE_MAX_VALUE (i2
);
744 /* In C++, minimums should be always 0. */
745 gcc_assert (min1
== min2
);
746 if (!operand_equal_p (max1
, max2
, 0))
748 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
749 G_("an array of different size is defined "
750 "in another translation unit"));
753 gcc_assert (operand_equal_p (TYPE_SIZE (t1
), TYPE_SIZE (t2
), 0));
754 gcc_assert (operand_equal_p (TYPE_SIZE_UNIT (t1
),
755 TYPE_SIZE_UNIT (t2
), 0));
761 /* Function types are the same if the return type and arguments types
763 if (!odr_subtypes_equivalent_p (TREE_TYPE (t1
), TREE_TYPE (t2
), visited
))
765 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
766 G_("has different return value "
767 "in another translation unit"));
769 warn_types_mismatch (TREE_TYPE (t1
), TREE_TYPE (t2
));
773 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
779 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
781 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
783 if (!odr_subtypes_equivalent_p
784 (TREE_VALUE (parms1
), TREE_VALUE (parms2
), visited
))
786 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
787 G_("has different parameters in another "
788 "translation unit"));
790 warn_types_mismatch (TREE_VALUE (parms1
),
791 TREE_VALUE (parms2
));
796 if (parms1
|| parms2
)
798 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
799 G_("has different parameters "
800 "in another translation unit"));
809 case QUAL_UNION_TYPE
:
813 /* For aggregate types, all the fields must be the same. */
814 if (COMPLETE_TYPE_P (t1
) && COMPLETE_TYPE_P (t2
))
816 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
818 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
820 /* Skip non-fields. */
821 while (f1
&& TREE_CODE (f1
) != FIELD_DECL
)
822 f1
= TREE_CHAIN (f1
);
823 while (f2
&& TREE_CODE (f2
) != FIELD_DECL
)
824 f2
= TREE_CHAIN (f2
);
827 if (DECL_ARTIFICIAL (f1
) != DECL_ARTIFICIAL (f2
))
829 if (DECL_NAME (f1
) != DECL_NAME (f2
)
830 && !DECL_ARTIFICIAL (f1
))
832 warn_odr (t1
, t2
, f1
, f2
, warn
, warned
,
833 G_("a field with different name is defined "
834 "in another translation unit"));
837 if (!odr_subtypes_equivalent_p (TREE_TYPE (f1
), TREE_TYPE (f2
), visited
))
839 /* Do not warn about artificial fields and just go into generic
840 field mismatch warning. */
841 if (DECL_ARTIFICIAL (f1
))
844 warn_odr (t1
, t2
, f1
, f2
, warn
, warned
,
845 G_("a field of same name but different type "
846 "is defined in another translation unit"));
848 warn_types_mismatch (TREE_TYPE (f1
), TREE_TYPE (f2
));
851 if (!gimple_compare_field_offset (f1
, f2
))
853 /* Do not warn about artificial fields and just go into generic
854 field mismatch warning. */
855 if (DECL_ARTIFICIAL (f1
))
857 warn_odr (t1
, t2
, t1
, t2
, warn
, warned
,
858 G_("fields has different layout "
859 "in another translation unit"));
862 gcc_assert (DECL_NONADDRESSABLE_P (f1
)
863 == DECL_NONADDRESSABLE_P (f2
));
866 /* If one aggregate has more fields than the other, they
870 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
871 G_("a type with different number of fields "
872 "is defined in another translation unit"));
875 if ((TYPE_MAIN_VARIANT (t1
) == t1
|| TYPE_MAIN_VARIANT (t2
) == t2
)
876 && (TYPE_METHODS (TYPE_MAIN_VARIANT (t1
))
877 != TYPE_METHODS (TYPE_MAIN_VARIANT (t2
))))
879 for (f1
= TYPE_METHODS (TYPE_MAIN_VARIANT (t1
)),
880 f2
= TYPE_METHODS (TYPE_MAIN_VARIANT (t2
));
881 f1
&& f2
; f1
= DECL_CHAIN (f1
), f2
= DECL_CHAIN (f2
))
883 if (DECL_ASSEMBLER_NAME (f1
) != DECL_ASSEMBLER_NAME (f2
))
885 warn_odr (t1
, t2
, f1
, f2
, warn
, warned
,
886 G_("a different method of same type "
887 "is defined in another translation unit"));
890 if (DECL_VIRTUAL_P (f1
) != DECL_VIRTUAL_P (f2
))
892 warn_odr (t1
, t2
, f1
, f2
, warn
, warned
,
893 G_("s definition that differs by virtual "
894 "keyword in another translation unit"));
897 if (DECL_VINDEX (f1
) != DECL_VINDEX (f2
))
899 warn_odr (t1
, t2
, f1
, f2
, warn
, warned
,
900 G_("virtual table layout differs in another "
901 "translation unit"));
904 if (odr_subtypes_equivalent_p (TREE_TYPE (f1
), TREE_TYPE (f2
), visited
))
906 warn_odr (t1
, t2
, f1
, f2
, warn
, warned
,
907 G_("method with incompatible type is defined "
908 "in another translation unit"));
914 warn_odr (t1
, t2
, NULL
, NULL
, warn
, warned
,
915 G_("a type with different number of methods "
916 "is defined in another translation unit"));
920 gcc_assert (operand_equal_p (TYPE_SIZE (t1
), TYPE_SIZE (t2
), 0));
921 gcc_assert (operand_equal_p (TYPE_SIZE_UNIT (t1
),
922 TYPE_SIZE_UNIT (t2
), 0));
933 /* TYPE is equivalent to VAL by ODR, but its tree representation differs
934 from VAL->type. This may happen in LTO where tree merging did not merge
935 all variants of the same type. It may or may not mean the ODR violation.
936 Add it to the list of duplicates and warn on some violations. */
939 add_type_duplicate (odr_type val
, tree type
)
941 bool build_bases
= false;
943 val
->types_set
= pointer_set_create ();
945 /* Always prefer complete type to be the leader. */
946 if (!COMPLETE_TYPE_P (val
->type
)
947 && COMPLETE_TYPE_P (type
))
956 /* See if this duplicate is new. */
957 if (!pointer_set_insert (val
->types_set
, type
))
960 bool base_mismatch
= false;
963 pointer_set_t
*visited
= pointer_set_create ();
965 gcc_assert (in_lto_p
);
966 vec_safe_push (val
->types
, type
);
968 /* First we compare memory layout. */
969 if (!odr_types_equivalent_p (val
->type
, type
, !flag_ltrans
&& !val
->odr_violated
,
973 odr_violation_reported
= true;
974 val
->odr_violated
= true;
975 if (cgraph_dump_file
)
977 fprintf (cgraph_dump_file
, "ODR violation\n");
979 print_node (cgraph_dump_file
, "", val
->type
, 0);
980 putc ('\n',cgraph_dump_file
);
981 print_node (cgraph_dump_file
, "", type
, 0);
982 putc ('\n',cgraph_dump_file
);
985 pointer_set_destroy (visited
);
987 /* Next sanity check that bases are the same. If not, we will end
988 up producing wrong answers. */
989 if (COMPLETE_TYPE_P (type
) && COMPLETE_TYPE_P (val
->type
)
990 && TREE_CODE (val
->type
) == RECORD_TYPE
991 && TREE_CODE (type
) == RECORD_TYPE
992 && TYPE_BINFO (val
->type
) && TYPE_BINFO (type
))
994 for (j
= 0, i
= 0; i
< BINFO_N_BASE_BINFOS (TYPE_BINFO (type
)); i
++)
995 if (polymorphic_type_binfo_p (BINFO_BASE_BINFO (TYPE_BINFO (type
), i
)))
997 odr_type base
= get_odr_type
999 (BINFO_BASE_BINFO (TYPE_BINFO (type
),
1002 if (val
->bases
.length () <= j
|| val
->bases
[j
] != base
)
1003 base_mismatch
= true;
1009 odr_violation_reported
= true;
1011 if (!warned
&& !val
->odr_violated
)
1012 warn_odr (type
, val
->type
, NULL
, NULL
, !warned
, &warned
,
1013 "a type with the same name but different bases is "
1014 "defined in another translation unit");
1015 val
->odr_violated
= true;
1016 if (cgraph_dump_file
)
1018 fprintf (cgraph_dump_file
, "ODR bse violation or merging bug?\n");
1020 print_node (cgraph_dump_file
, "", val
->type
, 0);
1021 putc ('\n',cgraph_dump_file
);
1022 print_node (cgraph_dump_file
, "", type
, 0);
1023 putc ('\n',cgraph_dump_file
);
1028 /* Regularize things a little. During LTO same types may come with
1029 different BINFOs. Either because their virtual table was
1030 not merged by tree merging and only later at decl merging or
1031 because one type comes with external vtable, while other
1032 with internal. We want to merge equivalent binfos to conserve
1033 memory and streaming overhead.
1035 The external vtables are more harmful: they contain references
1036 to external declarations of methods that may be defined in the
1037 merged LTO unit. For this reason we absolutely need to remove
1038 them and replace by internal variants. Not doing so will lead
1039 to incomplete answers from possible_polymorphic_call_targets. */
1040 if (!flag_ltrans
&& merge
1041 && TREE_CODE (val
->type
) == RECORD_TYPE
1042 && TREE_CODE (type
) == RECORD_TYPE
1043 && TYPE_BINFO (val
->type
) && TYPE_BINFO (type
)
1044 && TYPE_MAIN_VARIANT (type
) == type
1045 && TYPE_MAIN_VARIANT (val
->type
) == val
->type
1046 && BINFO_VTABLE (TYPE_BINFO (val
->type
))
1047 && BINFO_VTABLE (TYPE_BINFO (type
)))
1049 tree master_binfo
= TYPE_BINFO (val
->type
);
1050 tree v1
= BINFO_VTABLE (master_binfo
);
1051 tree v2
= BINFO_VTABLE (TYPE_BINFO (type
));
1053 if (TREE_CODE (v1
) == POINTER_PLUS_EXPR
)
1055 gcc_assert (TREE_CODE (v2
) == POINTER_PLUS_EXPR
1056 && operand_equal_p (TREE_OPERAND (v1
, 1),
1057 TREE_OPERAND (v2
, 1), 0));
1058 v1
= TREE_OPERAND (TREE_OPERAND (v1
, 0), 0);
1059 v2
= TREE_OPERAND (TREE_OPERAND (v2
, 0), 0);
1061 gcc_assert (DECL_ASSEMBLER_NAME (v1
)
1062 == DECL_ASSEMBLER_NAME (v2
));
1064 if (DECL_EXTERNAL (v1
) && !DECL_EXTERNAL (v2
))
1068 set_type_binfo (val
->type
, TYPE_BINFO (type
));
1069 for (i
= 0; i
< val
->types
->length (); i
++)
1071 if (TYPE_BINFO ((*val
->types
)[i
])
1073 set_type_binfo ((*val
->types
)[i
], TYPE_BINFO (type
));
1075 BINFO_TYPE (TYPE_BINFO (type
)) = val
->type
;
1078 set_type_binfo (type
, master_binfo
);
1084 /* Get ODR type hash entry for TYPE. If INSERT is true, create
1085 possibly new entry. */
1088 get_odr_type (tree type
, bool insert
)
1093 bool build_bases
= false;
1094 bool insert_to_odr_array
= false;
1097 type
= main_odr_variant (type
);
1099 hash
= hash_type_name (type
);
1101 = odr_hash
->find_slot_with_hash (type
, hash
, insert
? INSERT
: NO_INSERT
);
1105 /* See if we already have entry for type. */
1110 /* With LTO we need to support multiple tree representation of
1111 the same ODR type. */
1112 if (val
->type
!= type
)
1113 build_bases
= add_type_duplicate (val
, type
);
1117 val
= ggc_cleared_alloc
<odr_type_d
> ();
1120 val
->derived_types
= vNULL
;
1121 val
->anonymous_namespace
= type_in_anonymous_namespace_p (type
);
1122 build_bases
= COMPLETE_TYPE_P (val
->type
);
1123 insert_to_odr_array
= true;
1126 if (build_bases
&& TREE_CODE (type
) == RECORD_TYPE
&& TYPE_BINFO (type
)
1127 && type
== TYPE_MAIN_VARIANT (type
))
1129 tree binfo
= TYPE_BINFO (type
);
1132 gcc_assert (BINFO_TYPE (TYPE_BINFO (val
->type
)) = type
);
1134 val
->all_derivations_known
= type_all_derivations_known_p (type
);
1136 for (i
= 0; i
< BINFO_N_BASE_BINFOS (binfo
); i
++)
1137 /* For now record only polymorphic types. other are
1138 pointless for devirtualization and we can not precisely
1139 determine ODR equivalency of these during LTO. */
1140 if (polymorphic_type_binfo_p (BINFO_BASE_BINFO (binfo
, i
)))
1142 odr_type base
= get_odr_type (BINFO_TYPE (BINFO_BASE_BINFO (binfo
,
1145 gcc_assert (TYPE_MAIN_VARIANT (base
->type
) == base
->type
);
1146 base
->derived_types
.safe_push (val
);
1147 val
->bases
.safe_push (base
);
1148 if (base
->id
> base_id
)
1152 /* Ensure that type always appears after bases. */
1153 if (insert_to_odr_array
)
1156 val
->id
= odr_types
.length ();
1157 vec_safe_push (odr_types_ptr
, val
);
1159 else if (base_id
> val
->id
)
1161 odr_types
[val
->id
] = 0;
1162 /* Be sure we did not recorded any derived types; these may need
1164 gcc_assert (val
->derived_types
.length() == 0);
1166 val
->id
= odr_types
.length ();
1167 vec_safe_push (odr_types_ptr
, val
);
1172 /* Dump ODR type T and all its derrived type. INDENT specify indentation for
1173 recusive printing. */
1176 dump_odr_type (FILE *f
, odr_type t
, int indent
=0)
1179 fprintf (f
, "%*s type %i: ", indent
* 2, "", t
->id
);
1180 print_generic_expr (f
, t
->type
, TDF_SLIM
);
1181 fprintf (f
, "%s", t
->anonymous_namespace
? " (anonymous namespace)":"");
1182 fprintf (f
, "%s\n", t
->all_derivations_known
? " (derivations known)":"");
1183 if (TYPE_NAME (t
->type
))
1185 fprintf (f
, "%*s defined at: %s:%i\n", indent
* 2, "",
1186 DECL_SOURCE_FILE (TYPE_NAME (t
->type
)),
1187 DECL_SOURCE_LINE (TYPE_NAME (t
->type
)));
1189 if (t
->bases
.length ())
1191 fprintf (f
, "%*s base odr type ids: ", indent
* 2, "");
1192 for (i
= 0; i
< t
->bases
.length (); i
++)
1193 fprintf (f
, " %i", t
->bases
[i
]->id
);
1196 if (t
->derived_types
.length ())
1198 fprintf (f
, "%*s derived types:\n", indent
* 2, "");
1199 for (i
= 0; i
< t
->derived_types
.length (); i
++)
1200 dump_odr_type (f
, t
->derived_types
[i
], indent
+ 1);
1205 /* Dump the type inheritance graph. */
1208 dump_type_inheritance_graph (FILE *f
)
1213 fprintf (f
, "\n\nType inheritance graph:\n");
1214 for (i
= 0; i
< odr_types
.length (); i
++)
1216 if (odr_types
[i
] && odr_types
[i
]->bases
.length () == 0)
1217 dump_odr_type (f
, odr_types
[i
]);
1219 for (i
= 0; i
< odr_types
.length (); i
++)
1221 if (odr_types
[i
] && odr_types
[i
]->types
&& odr_types
[i
]->types
->length ())
1224 fprintf (f
, "Duplicate tree types for odr type %i\n", i
);
1225 print_node (f
, "", odr_types
[i
]->type
, 0);
1226 for (j
= 0; j
< odr_types
[i
]->types
->length (); j
++)
1229 fprintf (f
, "duplicate #%i\n", j
);
1230 print_node (f
, "", (*odr_types
[i
]->types
)[j
], 0);
1231 t
= (*odr_types
[i
]->types
)[j
];
1232 while (TYPE_P (t
) && TYPE_CONTEXT (t
))
1234 t
= TYPE_CONTEXT (t
);
1235 print_node (f
, "", t
, 0);
1243 /* Given method type T, return type of class it belongs to.
1244 Lookup this pointer and get its type. */
1247 method_class_type (const_tree t
)
1249 tree first_parm_type
= TREE_VALUE (TYPE_ARG_TYPES (t
));
1250 gcc_assert (TREE_CODE (t
) == METHOD_TYPE
);
1252 return TREE_TYPE (first_parm_type
);
1255 /* Initialize IPA devirt and build inheritance tree graph. */
1258 build_type_inheritance_graph (void)
1260 struct symtab_node
*n
;
1261 FILE *inheritance_dump_file
;
1266 timevar_push (TV_IPA_INHERITANCE
);
1267 inheritance_dump_file
= dump_begin (TDI_inheritance
, &flags
);
1268 odr_hash
= new odr_hash_type (23);
1270 /* We reconstruct the graph starting of types of all methods seen in the
1273 if (is_a
<cgraph_node
*> (n
)
1274 && DECL_VIRTUAL_P (n
->decl
)
1275 && n
->real_symbol_p ())
1276 get_odr_type (TYPE_MAIN_VARIANT (method_class_type (TREE_TYPE (n
->decl
))),
1279 /* Look also for virtual tables of types that do not define any methods.
1281 We need it in a case where class B has virtual base of class A
1282 re-defining its virtual method and there is class C with no virtual
1283 methods with B as virtual base.
1285 Here we output B's virtual method in two variant - for non-virtual
1286 and virtual inheritance. B's virtual table has non-virtual version,
1287 while C's has virtual.
1289 For this reason we need to know about C in order to include both
1290 variants of B. More correctly, record_target_from_binfo should
1291 add both variants of the method when walking B, but we have no
1292 link in between them.
1294 We rely on fact that either the method is exported and thus we
1295 assume it is called externally or C is in anonymous namespace and
1296 thus we will see the vtable. */
1298 else if (is_a
<varpool_node
*> (n
)
1299 && DECL_VIRTUAL_P (n
->decl
)
1300 && TREE_CODE (DECL_CONTEXT (n
->decl
)) == RECORD_TYPE
1301 && TYPE_BINFO (DECL_CONTEXT (n
->decl
))
1302 && polymorphic_type_binfo_p (TYPE_BINFO (DECL_CONTEXT (n
->decl
))))
1303 get_odr_type (TYPE_MAIN_VARIANT (DECL_CONTEXT (n
->decl
)), true);
1304 if (inheritance_dump_file
)
1306 dump_type_inheritance_graph (inheritance_dump_file
);
1307 dump_end (TDI_inheritance
, inheritance_dump_file
);
1309 timevar_pop (TV_IPA_INHERITANCE
);
1312 /* Return true if N has reference from live virtual table
1313 (and thus can be a destination of polymorphic call).
1314 Be conservatively correct when callgraph is not built or
1315 if the method may be referred externally. */
1318 referenced_from_vtable_p (struct cgraph_node
*node
)
1321 struct ipa_ref
*ref
;
1324 if (node
->externally_visible
1325 || node
->used_from_other_partition
)
1328 /* Keep this test constant time.
1329 It is unlikely this can happen except for the case where speculative
1330 devirtualization introduced many speculative edges to this node.
1331 In this case the target is very likely alive anyway. */
1332 if (node
->ref_list
.referring
.length () > 100)
1335 /* We need references built. */
1336 if (cgraph_state
<= CGRAPH_STATE_CONSTRUCTION
)
1339 for (i
= 0; node
->iterate_referring (i
, ref
); i
++)
1341 if ((ref
->use
== IPA_REF_ALIAS
1342 && referenced_from_vtable_p (dyn_cast
<cgraph_node
*> (ref
->referring
)))
1343 || (ref
->use
== IPA_REF_ADDR
1344 && TREE_CODE (ref
->referring
->decl
) == VAR_DECL
1345 && DECL_VIRTUAL_P (ref
->referring
->decl
)))
1353 /* If TARGET has associated node, record it in the NODES array.
1354 CAN_REFER specify if program can refer to the target directly.
1355 if TARGET is unknown (NULL) or it can not be inserted (for example because
1356 its body was already removed and there is no way to refer to it), clear
1360 maybe_record_node (vec
<cgraph_node
*> &nodes
,
1361 tree target
, pointer_set_t
*inserted
,
1365 struct cgraph_node
*target_node
, *alias_target
;
1366 enum availability avail
;
1368 /* cxa_pure_virtual and __builtin_unreachable do not need to be added into
1369 list of targets; the runtime effect of calling them is undefined.
1370 Only "real" virtual methods should be accounted. */
1371 if (target
&& TREE_CODE (TREE_TYPE (target
)) != METHOD_TYPE
)
1376 /* The only case when method of anonymous namespace becomes unreferable
1377 is when we completely optimized it out. */
1380 || !type_in_anonymous_namespace_p (DECL_CONTEXT (target
)))
1388 target_node
= cgraph_node::get (target
);
1390 /* Preffer alias target over aliases, so we do not get confused by
1394 alias_target
= target_node
->ultimate_alias_target (&avail
);
1395 if (target_node
!= alias_target
1396 && avail
>= AVAIL_AVAILABLE
1397 && target_node
->get_availability ())
1398 target_node
= alias_target
;
1401 /* Method can only be called by polymorphic call if any
1402 of vtables refering to it are alive.
1404 While this holds for non-anonymous functions, too, there are
1405 cases where we want to keep them in the list; for example
1406 inline functions with -fno-weak are static, but we still
1407 may devirtualize them when instance comes from other unit.
1408 The same holds for LTO.
1410 Currently we ignore these functions in speculative devirtualization.
1411 ??? Maybe it would make sense to be more aggressive for LTO even
1414 && type_in_anonymous_namespace_p (DECL_CONTEXT (target
))
1416 || !referenced_from_vtable_p (target_node
)))
1418 /* See if TARGET is useful function we can deal with. */
1419 else if (target_node
!= NULL
1420 && (TREE_PUBLIC (target
)
1421 || DECL_EXTERNAL (target
)
1422 || target_node
->definition
)
1423 && target_node
->real_symbol_p ())
1425 gcc_assert (!target_node
->global
.inlined_to
);
1426 gcc_assert (target_node
->real_symbol_p ());
1427 if (!pointer_set_insert (inserted
, target_node
->decl
))
1429 pointer_set_insert (cached_polymorphic_call_targets
,
1431 nodes
.safe_push (target_node
);
1435 && (!type_in_anonymous_namespace_p
1436 (DECL_CONTEXT (target
))
1441 /* See if BINFO's type match OUTER_TYPE. If so, lookup
1442 BINFO of subtype of OTR_TYPE at OFFSET and in that BINFO find
1443 method in vtable and insert method to NODES array
1444 or BASES_TO_CONSIDER if this array is non-NULL.
1445 Otherwise recurse to base BINFOs.
1446 This match what get_binfo_at_offset does, but with offset
1449 TYPE_BINFOS is a stack of BINFOS of types with defined
1450 virtual table seen on way from class type to BINFO.
1452 MATCHED_VTABLES tracks virtual tables we already did lookup
1453 for virtual function in. INSERTED tracks nodes we already
1456 ANONYMOUS is true if BINFO is part of anonymous namespace.
1458 Clear COMPLETEP when we hit unreferable target.
1462 record_target_from_binfo (vec
<cgraph_node
*> &nodes
,
1463 vec
<tree
> *bases_to_consider
,
1466 vec
<tree
> &type_binfos
,
1467 HOST_WIDE_INT otr_token
,
1469 HOST_WIDE_INT offset
,
1470 pointer_set_t
*inserted
,
1471 pointer_set_t
*matched_vtables
,
1475 tree type
= BINFO_TYPE (binfo
);
1480 if (BINFO_VTABLE (binfo
))
1481 type_binfos
.safe_push (binfo
);
1482 if (types_same_for_odr (type
, outer_type
))
1485 tree type_binfo
= NULL
;
1487 /* Lookup BINFO with virtual table. For normal types it is always last
1489 for (i
= type_binfos
.length () - 1; i
>= 0; i
--)
1490 if (BINFO_OFFSET (type_binfos
[i
]) == BINFO_OFFSET (binfo
))
1492 type_binfo
= type_binfos
[i
];
1495 if (BINFO_VTABLE (binfo
))
1497 /* If this is duplicated BINFO for base shared by virtual inheritance,
1498 we may not have its associated vtable. This is not a problem, since
1499 we will walk it on the other path. */
1502 tree inner_binfo
= get_binfo_at_offset (type_binfo
,
1506 gcc_assert (odr_violation_reported
);
1509 /* For types in anonymous namespace first check if the respective vtable
1510 is alive. If not, we know the type can't be called. */
1511 if (!flag_ltrans
&& anonymous
)
1513 tree vtable
= BINFO_VTABLE (inner_binfo
);
1514 varpool_node
*vnode
;
1516 if (TREE_CODE (vtable
) == POINTER_PLUS_EXPR
)
1517 vtable
= TREE_OPERAND (TREE_OPERAND (vtable
, 0), 0);
1518 vnode
= varpool_node::get (vtable
);
1519 if (!vnode
|| !vnode
->definition
)
1522 gcc_assert (inner_binfo
);
1523 if (bases_to_consider
1524 ? !pointer_set_contains (matched_vtables
, BINFO_VTABLE (inner_binfo
))
1525 : !pointer_set_insert (matched_vtables
, BINFO_VTABLE (inner_binfo
)))
1528 tree target
= gimple_get_virt_method_for_binfo (otr_token
,
1531 if (!bases_to_consider
)
1532 maybe_record_node (nodes
, target
, inserted
, can_refer
, completep
);
1533 /* Destructors are never called via construction vtables. */
1534 else if (!target
|| !DECL_CXX_DESTRUCTOR_P (target
))
1535 bases_to_consider
->safe_push (target
);
1541 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1542 /* Walking bases that have no virtual method is pointless excercise. */
1543 if (polymorphic_type_binfo_p (base_binfo
))
1544 record_target_from_binfo (nodes
, bases_to_consider
, base_binfo
, otr_type
,
1546 otr_token
, outer_type
, offset
, inserted
,
1547 matched_vtables
, anonymous
, completep
);
1548 if (BINFO_VTABLE (binfo
))
1552 /* Lookup virtual methods matching OTR_TYPE (with OFFSET and OTR_TOKEN)
1553 of TYPE, insert them to NODES, recurse into derived nodes.
1554 INSERTED is used to avoid duplicate insertions of methods into NODES.
1555 MATCHED_VTABLES are used to avoid duplicate walking vtables.
1556 Clear COMPLETEP if unreferable target is found.
1558 If CONSIDER_CONSTURCTION is true, record to BASES_TO_CONSDIER
1559 all cases where BASE_SKIPPED is true (because the base is abstract
1563 possible_polymorphic_call_targets_1 (vec
<cgraph_node
*> &nodes
,
1564 pointer_set_t
*inserted
,
1565 pointer_set_t
*matched_vtables
,
1568 HOST_WIDE_INT otr_token
,
1570 HOST_WIDE_INT offset
,
1572 vec
<tree
> &bases_to_consider
,
1573 bool consider_construction
)
1575 tree binfo
= TYPE_BINFO (type
->type
);
1577 vec
<tree
> type_binfos
= vNULL
;
1578 bool possibly_instantiated
= type_possibly_instantiated_p (type
->type
);
1580 /* We may need to consider types w/o instances because of possible derived
1581 types using their methods either directly or via construction vtables.
1582 We are safe to skip them when all derivations are known, since we will
1584 This is done by recording them to BASES_TO_CONSIDER array. */
1585 if (possibly_instantiated
|| consider_construction
)
1587 record_target_from_binfo (nodes
,
1588 (!possibly_instantiated
1589 && type_all_derivations_known_p (type
->type
))
1590 ? &bases_to_consider
: NULL
,
1591 binfo
, otr_type
, type_binfos
, otr_token
,
1593 inserted
, matched_vtables
,
1594 type
->anonymous_namespace
, completep
);
1596 type_binfos
.release ();
1597 for (i
= 0; i
< type
->derived_types
.length (); i
++)
1598 possible_polymorphic_call_targets_1 (nodes
, inserted
,
1601 type
->derived_types
[i
],
1602 otr_token
, outer_type
, offset
, completep
,
1603 bases_to_consider
, consider_construction
);
1606 /* Cache of queries for polymorphic call targets.
1608 Enumerating all call targets may get expensive when there are many
1609 polymorphic calls in the program, so we memoize all the previous
1610 queries and avoid duplicated work. */
1612 struct polymorphic_call_target_d
1614 HOST_WIDE_INT otr_token
;
1615 ipa_polymorphic_call_context context
;
1617 vec
<cgraph_node
*> targets
;
1618 int nonconstruction_targets
;
1622 /* Polymorphic call target cache helpers. */
1624 struct polymorphic_call_target_hasher
1626 typedef polymorphic_call_target_d value_type
;
1627 typedef polymorphic_call_target_d compare_type
;
1628 static inline hashval_t
hash (const value_type
*);
1629 static inline bool equal (const value_type
*, const compare_type
*);
1630 static inline void remove (value_type
*);
1633 /* Return the computed hashcode for ODR_QUERY. */
1636 polymorphic_call_target_hasher::hash (const value_type
*odr_query
)
1640 hash
= iterative_hash_host_wide_int
1641 (odr_query
->otr_token
,
1642 odr_query
->type
->id
);
1643 hash
= iterative_hash_hashval_t (TYPE_UID (odr_query
->context
.outer_type
),
1645 hash
= iterative_hash_host_wide_int (odr_query
->context
.offset
, hash
);
1646 if (odr_query
->context
.speculative_outer_type
)
1648 hash
= iterative_hash_hashval_t
1649 (TYPE_UID (odr_query
->context
.speculative_outer_type
), hash
);
1650 hash
= iterative_hash_host_wide_int (odr_query
->context
.speculative_offset
,
1653 return iterative_hash_hashval_t
1654 (((int)odr_query
->context
.maybe_in_construction
<< 2)
1655 | ((int)odr_query
->context
.speculative_maybe_derived_type
<< 1)
1656 | (int)odr_query
->context
.maybe_derived_type
, hash
);
1659 /* Compare cache entries T1 and T2. */
1662 polymorphic_call_target_hasher::equal (const value_type
*t1
,
1663 const compare_type
*t2
)
1665 return (t1
->type
== t2
->type
&& t1
->otr_token
== t2
->otr_token
1666 && t1
->context
.offset
== t2
->context
.offset
1667 && t1
->context
.speculative_offset
== t2
->context
.speculative_offset
1668 && t1
->context
.outer_type
== t2
->context
.outer_type
1669 && t1
->context
.speculative_outer_type
== t2
->context
.speculative_outer_type
1670 && t1
->context
.maybe_in_construction
1671 == t2
->context
.maybe_in_construction
1672 && t1
->context
.maybe_derived_type
== t2
->context
.maybe_derived_type
1673 && (t1
->context
.speculative_maybe_derived_type
1674 == t2
->context
.speculative_maybe_derived_type
));
1677 /* Remove entry in polymorphic call target cache hash. */
1680 polymorphic_call_target_hasher::remove (value_type
*v
)
1682 v
->targets
.release ();
1686 /* Polymorphic call target query cache. */
1688 typedef hash_table
<polymorphic_call_target_hasher
>
1689 polymorphic_call_target_hash_type
;
1690 static polymorphic_call_target_hash_type
*polymorphic_call_target_hash
;
1692 /* Destroy polymorphic call target query cache. */
1695 free_polymorphic_call_targets_hash ()
1697 if (cached_polymorphic_call_targets
)
1699 delete polymorphic_call_target_hash
;
1700 polymorphic_call_target_hash
= NULL
;
1701 pointer_set_destroy (cached_polymorphic_call_targets
);
1702 cached_polymorphic_call_targets
= NULL
;
1706 /* When virtual function is removed, we may need to flush the cache. */
1709 devirt_node_removal_hook (struct cgraph_node
*n
, void *d ATTRIBUTE_UNUSED
)
1711 if (cached_polymorphic_call_targets
1712 && pointer_set_contains (cached_polymorphic_call_targets
, n
))
1713 free_polymorphic_call_targets_hash ();
1716 /* Return true when TYPE contains an polymorphic type and thus is interesting
1717 for devirtualization machinery. */
1720 contains_polymorphic_type_p (const_tree type
)
1722 type
= TYPE_MAIN_VARIANT (type
);
1724 if (RECORD_OR_UNION_TYPE_P (type
))
1726 if (TYPE_BINFO (type
)
1727 && polymorphic_type_binfo_p (TYPE_BINFO (type
)))
1729 for (tree fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
1730 if (TREE_CODE (fld
) == FIELD_DECL
1731 && !DECL_ARTIFICIAL (fld
)
1732 && contains_polymorphic_type_p (TREE_TYPE (fld
)))
1736 if (TREE_CODE (type
) == ARRAY_TYPE
)
1737 return contains_polymorphic_type_p (TREE_TYPE (type
));
1741 /* CONTEXT->OUTER_TYPE is a type of memory object where object of EXPECTED_TYPE
1742 is contained at CONTEXT->OFFSET. Walk the memory representation of
1743 CONTEXT->OUTER_TYPE and find the outermost class type that match
1744 EXPECTED_TYPE or contain EXPECTED_TYPE as a base. Update CONTEXT
1747 For example when CONTEXT represents type
1753 and we look for type at offset sizeof(int), we end up with B and offset 0.
1754 If the same is produced by multiple inheritance, we end up with A and offset
1757 If we can not find corresponding class, give up by setting
1758 CONTEXT->OUTER_TYPE to EXPECTED_TYPE and CONTEXT->OFFSET to NULL.
1759 Return true when lookup was sucesful. */
1762 get_class_context (ipa_polymorphic_call_context
*context
,
1765 tree type
= context
->outer_type
;
1766 HOST_WIDE_INT offset
= context
->offset
;
1767 bool speculative
= false;
1768 bool speculation_valid
= false;
1771 if (!context
->outer_type
)
1773 context
->outer_type
= expected_type
;
1774 context
->offset
= offset
;
1776 /* See if speculative type seem to be derrived from outer_type.
1777 Then speculation is valid only if it really is a derivate and derived types
1780 The test does not really look for derivate, but also accepts the case where
1781 outer_type is a field of speculative_outer_type. In this case eiter
1782 MAYBE_DERIVED_TYPE is false and we have full non-speculative information or
1783 the loop bellow will correctly update SPECULATIVE_OUTER_TYPE
1784 and SPECULATIVE_MAYBE_DERIVED_TYPE. */
1785 if (context
->speculative_outer_type
1786 && context
->speculative_offset
>= context
->offset
1787 && contains_type_p (context
->speculative_outer_type
,
1788 context
->offset
- context
->speculative_offset
,
1789 context
->outer_type
))
1790 speculation_valid
= context
->maybe_derived_type
;
1793 context
->speculative_outer_type
= NULL
;
1794 context
->speculative_offset
= 0;
1795 context
->speculative_maybe_derived_type
= false;
1798 /* Find the sub-object the constant actually refers to and mark whether it is
1799 an artificial one (as opposed to a user-defined one).
1801 This loop is performed twice; first time for outer_type and second time
1802 for speculative_outer_type. The second iteration has SPECULATIVE set. */
1805 HOST_WIDE_INT pos
, size
;
1808 /* On a match, just return what we found. */
1809 if (TREE_CODE (type
) == TREE_CODE (expected_type
)
1810 && types_same_for_odr (type
, expected_type
))
1814 gcc_assert (speculation_valid
);
1817 /* If we did not match the offset, just give up on speculation. */
1819 || (types_same_for_odr (context
->speculative_outer_type
,
1820 context
->outer_type
)
1821 && (context
->maybe_derived_type
1822 == context
->speculative_maybe_derived_type
)))
1824 context
->speculative_outer_type
= NULL
;
1825 context
->speculative_offset
= 0;
1831 /* Type can not contain itself on an non-zero offset. In that case
1839 /* If speculation is not valid or we determined type precisely,
1841 if (!speculation_valid
1842 || !context
->maybe_derived_type
)
1844 context
->speculative_outer_type
= NULL
;
1845 context
->speculative_offset
= 0;
1848 /* Otherwise look into speculation now. */
1852 type
= context
->speculative_outer_type
;
1853 offset
= context
->speculative_offset
;
1859 /* Walk fields and find corresponding on at OFFSET. */
1860 if (TREE_CODE (type
) == RECORD_TYPE
)
1862 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
1864 if (TREE_CODE (fld
) != FIELD_DECL
)
1867 pos
= int_bit_position (fld
);
1868 size
= tree_to_uhwi (DECL_SIZE (fld
));
1869 if (pos
<= offset
&& (pos
+ size
) > offset
)
1876 type
= TYPE_MAIN_VARIANT (TREE_TYPE (fld
));
1878 /* DECL_ARTIFICIAL represents a basetype. */
1879 if (!DECL_ARTIFICIAL (fld
))
1883 context
->outer_type
= type
;
1884 context
->offset
= offset
;
1885 /* As soon as we se an field containing the type,
1886 we know we are not looking for derivations. */
1887 context
->maybe_derived_type
= false;
1891 context
->speculative_outer_type
= type
;
1892 context
->speculative_offset
= offset
;
1893 context
->speculative_maybe_derived_type
= false;
1897 else if (TREE_CODE (type
) == ARRAY_TYPE
)
1899 tree subtype
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
1901 /* Give up if we don't know array size. */
1902 if (!tree_fits_shwi_p (TYPE_SIZE (subtype
))
1903 || !tree_to_shwi (TYPE_SIZE (subtype
)) <= 0)
1905 offset
= offset
% tree_to_shwi (TYPE_SIZE (subtype
));
1909 context
->outer_type
= type
;
1910 context
->offset
= offset
;
1911 context
->maybe_derived_type
= false;
1915 context
->speculative_outer_type
= type
;
1916 context
->speculative_offset
= offset
;
1917 context
->speculative_maybe_derived_type
= false;
1920 /* Give up on anything else. */
1925 /* If we failed to find subtype we look for, give up and fall back to the
1926 most generic query. */
1928 context
->speculative_outer_type
= NULL
;
1929 context
->speculative_offset
= 0;
1930 context
->speculative_maybe_derived_type
= false;
1933 context
->outer_type
= expected_type
;
1934 context
->offset
= 0;
1935 context
->maybe_derived_type
= true;
1936 context
->maybe_in_construction
= true;
1937 /* POD can be changed to an instance of a polymorphic type by
1938 placement new. Here we play safe and assume that any
1939 non-polymorphic type is POD. */
1940 if ((TREE_CODE (type
) != RECORD_TYPE
1941 || !TYPE_BINFO (type
)
1942 || !polymorphic_type_binfo_p (TYPE_BINFO (type
)))
1943 && (!TYPE_SIZE (type
)
1944 || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
1945 || (offset
+ tree_to_uhwi (TYPE_SIZE (expected_type
)) <=
1946 tree_to_uhwi (TYPE_SIZE (type
)))))
1951 /* Return true if OUTER_TYPE contains OTR_TYPE at OFFSET. */
1954 contains_type_p (tree outer_type
, HOST_WIDE_INT offset
,
1957 ipa_polymorphic_call_context context
= {offset
, 0,
1958 TYPE_MAIN_VARIANT (outer_type
),
1959 NULL
, false, true, false};
1960 return get_class_context (&context
, otr_type
);
1963 /* Lookup base of BINFO that has virtual table VTABLE with OFFSET. */
1966 subbinfo_with_vtable_at_offset (tree binfo
, unsigned HOST_WIDE_INT offset
,
1969 tree v
= BINFO_VTABLE (binfo
);
1972 unsigned HOST_WIDE_INT this_offset
;
1976 if (!vtable_pointer_value_to_vtable (v
, &v
, &this_offset
))
1979 if (offset
== this_offset
1980 && DECL_ASSEMBLER_NAME (v
) == DECL_ASSEMBLER_NAME (vtable
))
1984 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1985 if (polymorphic_type_binfo_p (base_binfo
))
1987 base_binfo
= subbinfo_with_vtable_at_offset (base_binfo
, offset
, vtable
);
1994 /* T is known constant value of virtual table pointer.
1995 Store virtual table to V and its offset to OFFSET.
1996 Return false if T does not look like virtual table reference. */
1999 vtable_pointer_value_to_vtable (const_tree t
, tree
*v
,
2000 unsigned HOST_WIDE_INT
*offset
)
2002 /* We expect &MEM[(void *)&virtual_table + 16B].
2003 We obtain object's BINFO from the context of the virtual table.
2004 This one contains pointer to virtual table represented via
2005 POINTER_PLUS_EXPR. Verify that this pointer match to what
2006 we propagated through.
2008 In the case of virtual inheritance, the virtual tables may
2009 be nested, i.e. the offset may be different from 16 and we may
2010 need to dive into the type representation. */
2011 if (TREE_CODE (t
) == ADDR_EXPR
2012 && TREE_CODE (TREE_OPERAND (t
, 0)) == MEM_REF
2013 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (t
, 0), 0)) == ADDR_EXPR
2014 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (t
, 0), 1)) == INTEGER_CST
2015 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t
, 0), 0), 0))
2017 && DECL_VIRTUAL_P (TREE_OPERAND (TREE_OPERAND
2018 (TREE_OPERAND (t
, 0), 0), 0)))
2020 *v
= TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t
, 0), 0), 0);
2021 *offset
= tree_to_uhwi (TREE_OPERAND (TREE_OPERAND (t
, 0), 1));
2025 /* Alternative representation, used by C++ frontend is POINTER_PLUS_EXPR.
2026 We need to handle it when T comes from static variable initializer or
2028 if (TREE_CODE (t
) == POINTER_PLUS_EXPR
)
2030 *offset
= tree_to_uhwi (TREE_OPERAND (t
, 1));
2031 t
= TREE_OPERAND (t
, 0);
2036 if (TREE_CODE (t
) != ADDR_EXPR
)
2038 *v
= TREE_OPERAND (t
, 0);
2042 /* T is known constant value of virtual table pointer. Return BINFO of the
2046 vtable_pointer_value_to_binfo (const_tree t
)
2049 unsigned HOST_WIDE_INT offset
;
2051 if (!vtable_pointer_value_to_vtable (t
, &vtable
, &offset
))
2054 /* FIXME: for stores of construction vtables we return NULL,
2055 because we do not have BINFO for those. Eventually we should fix
2056 our representation to allow this case to be handled, too.
2057 In the case we see store of BINFO we however may assume
2058 that standard folding will be ale to cope with it. */
2059 return subbinfo_with_vtable_at_offset (TYPE_BINFO (DECL_CONTEXT (vtable
)),
2063 /* We know that the instance is stored in variable or parameter
2064 (not dynamically allocated) and we want to disprove the fact
2065 that it may be in construction at invocation of CALL.
2067 For the variable to be in construction we actually need to
2068 be in constructor of corresponding global variable or
2069 the inline stack of CALL must contain the constructor.
2070 Check this condition. This check works safely only before
2071 IPA passes, because inline stacks may become out of date
2075 decl_maybe_in_construction_p (tree base
, tree outer_type
,
2076 gimple call
, tree function
)
2078 outer_type
= TYPE_MAIN_VARIANT (outer_type
);
2079 gcc_assert (DECL_P (base
));
2081 /* After inlining the code unification optimizations may invalidate
2082 inline stacks. Also we need to give up on global variables after
2083 IPA, because addresses of these may have been propagated to their
2085 if (DECL_STRUCT_FUNCTION (function
)->after_inlining
)
2088 /* Pure functions can not do any changes on the dynamic type;
2089 that require writting to memory. */
2090 if (!auto_var_in_fn_p (base
, function
)
2091 && flags_from_decl_or_type (function
) & (ECF_PURE
| ECF_CONST
))
2094 for (tree block
= gimple_block (call
); block
&& TREE_CODE (block
) == BLOCK
;
2095 block
= BLOCK_SUPERCONTEXT (block
))
2096 if (BLOCK_ABSTRACT_ORIGIN (block
)
2097 && TREE_CODE (BLOCK_ABSTRACT_ORIGIN (block
)) == FUNCTION_DECL
)
2099 tree fn
= BLOCK_ABSTRACT_ORIGIN (block
);
2101 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
2102 || (!DECL_CXX_CONSTRUCTOR_P (fn
)
2103 || !DECL_CXX_DESTRUCTOR_P (fn
)))
2105 /* Watch for clones where we constant propagated the first
2106 argument (pointer to the instance). */
2107 fn
= DECL_ABSTRACT_ORIGIN (fn
);
2109 || !is_global_var (base
)
2110 || TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
2111 || (!DECL_CXX_CONSTRUCTOR_P (fn
)
2112 || !DECL_CXX_DESTRUCTOR_P (fn
)))
2115 if (flags_from_decl_or_type (fn
) & (ECF_PURE
| ECF_CONST
))
2118 /* FIXME: this can go away once we have ODR types equivalency on
2120 if (in_lto_p
&& !polymorphic_type_binfo_p (TYPE_BINFO (outer_type
)))
2122 tree type
= TYPE_MAIN_VARIANT (method_class_type (TREE_TYPE (fn
)));
2123 if (types_same_for_odr (type
, outer_type
))
2127 if (TREE_CODE (base
) == VAR_DECL
2128 && is_global_var (base
))
2130 if (TREE_CODE (TREE_TYPE (function
)) != METHOD_TYPE
2131 || (!DECL_CXX_CONSTRUCTOR_P (function
)
2132 || !DECL_CXX_DESTRUCTOR_P (function
)))
2134 if (!DECL_ABSTRACT_ORIGIN (function
))
2136 /* Watch for clones where we constant propagated the first
2137 argument (pointer to the instance). */
2138 function
= DECL_ABSTRACT_ORIGIN (function
);
2140 || TREE_CODE (TREE_TYPE (function
)) != METHOD_TYPE
2141 || (!DECL_CXX_CONSTRUCTOR_P (function
)
2142 || !DECL_CXX_DESTRUCTOR_P (function
)))
2145 /* FIXME: this can go away once we have ODR types equivalency on
2147 if (in_lto_p
&& !polymorphic_type_binfo_p (TYPE_BINFO (outer_type
)))
2149 tree type
= TYPE_MAIN_VARIANT (method_class_type (TREE_TYPE (function
)));
2150 if (types_same_for_odr (type
, outer_type
))
2156 /* Proudce polymorphic call context for call method of instance
2157 that is located within BASE (that is assumed to be a decl) at OFFSET. */
2160 get_polymorphic_call_info_for_decl (ipa_polymorphic_call_context
*context
,
2161 tree base
, HOST_WIDE_INT offset
)
2163 gcc_assert (DECL_P (base
));
2165 context
->outer_type
= TYPE_MAIN_VARIANT (TREE_TYPE (base
));
2166 context
->offset
= offset
;
2167 context
->speculative_outer_type
= NULL
;
2168 context
->speculative_offset
= 0;
2169 context
->speculative_maybe_derived_type
= true;
2170 /* Make very conservative assumption that all objects
2171 may be in construction.
2172 TODO: ipa-prop already contains code to tell better.
2174 context
->maybe_in_construction
= true;
2175 context
->maybe_derived_type
= false;
2178 /* CST is an invariant (address of decl), try to get meaningful
2179 polymorphic call context for polymorphic call of method
2180 if instance of OTR_TYPE that is located at OFFSET of this invariant.
2181 Return FALSE if nothing meaningful can be found. */
2184 get_polymorphic_call_info_from_invariant (ipa_polymorphic_call_context
*context
,
2187 HOST_WIDE_INT offset
)
2189 HOST_WIDE_INT offset2
, size
, max_size
;
2192 if (TREE_CODE (cst
) != ADDR_EXPR
)
2195 cst
= TREE_OPERAND (cst
, 0);
2196 base
= get_ref_base_and_extent (cst
, &offset2
, &size
, &max_size
);
2197 if (!DECL_P (base
) || max_size
== -1 || max_size
!= size
)
2200 /* Only type inconsistent programs can have otr_type that is
2201 not part of outer type. */
2202 if (!contains_type_p (TREE_TYPE (base
), offset
, otr_type
))
2205 get_polymorphic_call_info_for_decl (context
, base
, offset
);
2209 /* See if OP is SSA name initialized as a copy or by single assignment.
2210 If so, walk the SSA graph up. */
2213 walk_ssa_copies (tree op
)
2216 while (TREE_CODE (op
) == SSA_NAME
2217 && !SSA_NAME_IS_DEFAULT_DEF (op
)
2218 && SSA_NAME_DEF_STMT (op
)
2219 && gimple_assign_single_p (SSA_NAME_DEF_STMT (op
)))
2221 if (gimple_assign_load_p (SSA_NAME_DEF_STMT (op
)))
2223 op
= gimple_assign_rhs1 (SSA_NAME_DEF_STMT (op
));
2229 /* Given REF call in FNDECL, determine class of the polymorphic
2230 call (OTR_TYPE), its token (OTR_TOKEN) and CONTEXT.
2231 CALL is optional argument giving the actual statement (usually call) where
2232 the context is used.
2233 Return pointer to object described by the context */
2236 get_polymorphic_call_info (tree fndecl
,
2239 HOST_WIDE_INT
*otr_token
,
2240 ipa_polymorphic_call_context
*context
,
2244 *otr_type
= obj_type_ref_class (ref
);
2245 *otr_token
= tree_to_uhwi (OBJ_TYPE_REF_TOKEN (ref
));
2247 /* Set up basic info in case we find nothing interesting in the analysis. */
2248 context
->speculative_outer_type
= NULL
;
2249 context
->speculative_offset
= 0;
2250 context
->speculative_maybe_derived_type
= true;
2251 context
->outer_type
= TYPE_MAIN_VARIANT (*otr_type
);
2252 context
->offset
= 0;
2253 base_pointer
= OBJ_TYPE_REF_OBJECT (ref
);
2254 context
->maybe_derived_type
= true;
2255 context
->maybe_in_construction
= true;
2257 /* Walk SSA for outer object. */
2260 base_pointer
= walk_ssa_copies (base_pointer
);
2261 if (TREE_CODE (base_pointer
) == ADDR_EXPR
)
2263 HOST_WIDE_INT size
, max_size
;
2264 HOST_WIDE_INT offset2
;
2265 tree base
= get_ref_base_and_extent (TREE_OPERAND (base_pointer
, 0),
2266 &offset2
, &size
, &max_size
);
2268 /* If this is a varying address, punt. */
2269 if ((TREE_CODE (base
) == MEM_REF
|| DECL_P (base
))
2271 && max_size
== size
)
2273 /* We found dereference of a pointer. Type of the pointer
2274 and MEM_REF is meaningless, but we can look futher. */
2275 if (TREE_CODE (base
) == MEM_REF
)
2277 base_pointer
= TREE_OPERAND (base
, 0);
2279 += offset2
+ mem_ref_offset (base
).to_short_addr () * BITS_PER_UNIT
;
2280 context
->outer_type
= NULL
;
2282 /* We found base object. In this case the outer_type
2284 else if (DECL_P (base
))
2286 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (base
)));
2288 /* Only type inconsistent programs can have otr_type that is
2289 not part of outer type. */
2290 if (!contains_type_p (TREE_TYPE (base
),
2291 context
->offset
+ offset2
, *otr_type
))
2293 /* Use OTR_TOKEN = INT_MAX as a marker of probably type inconsistent
2294 code sequences; we arrange the calls to be builtin_unreachable
2296 *otr_token
= INT_MAX
;
2297 return base_pointer
;
2299 get_polymorphic_call_info_for_decl (context
, base
,
2300 context
->offset
+ offset2
);
2301 if (context
->maybe_in_construction
&& call
)
2302 context
->maybe_in_construction
2303 = decl_maybe_in_construction_p (base
,
2304 context
->outer_type
,
2306 current_function_decl
);
2307 return base_pointer
;
2315 else if (TREE_CODE (base_pointer
) == POINTER_PLUS_EXPR
2316 && tree_fits_uhwi_p (TREE_OPERAND (base_pointer
, 1)))
2318 context
->offset
+= tree_to_shwi (TREE_OPERAND (base_pointer
, 1))
2320 base_pointer
= TREE_OPERAND (base_pointer
, 0);
2327 /* Try to determine type of the outer object. */
2328 if (TREE_CODE (base_pointer
) == SSA_NAME
2329 && SSA_NAME_IS_DEFAULT_DEF (base_pointer
)
2330 && TREE_CODE (SSA_NAME_VAR (base_pointer
)) == PARM_DECL
)
2332 /* See if parameter is THIS pointer of a method. */
2333 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
2334 && SSA_NAME_VAR (base_pointer
) == DECL_ARGUMENTS (fndecl
))
2337 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (base_pointer
)));
2338 gcc_assert (TREE_CODE (context
->outer_type
) == RECORD_TYPE
);
2340 /* Dynamic casting has possibly upcasted the type
2341 in the hiearchy. In this case outer type is less
2342 informative than inner type and we should forget
2344 if (!contains_type_p (context
->outer_type
, context
->offset
,
2347 context
->outer_type
= NULL
;
2348 return base_pointer
;
2351 /* If the function is constructor or destructor, then
2352 the type is possibly in construction, but we know
2353 it is not derived type. */
2354 if (DECL_CXX_CONSTRUCTOR_P (fndecl
)
2355 || DECL_CXX_DESTRUCTOR_P (fndecl
))
2357 context
->maybe_in_construction
= true;
2358 context
->maybe_derived_type
= false;
2362 context
->maybe_derived_type
= true;
2363 context
->maybe_in_construction
= false;
2365 return base_pointer
;
2367 /* Non-PODs passed by value are really passed by invisible
2368 reference. In this case we also know the type of the
2370 if (DECL_BY_REFERENCE (SSA_NAME_VAR (base_pointer
)))
2373 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (base_pointer
)));
2374 gcc_assert (!POINTER_TYPE_P (context
->outer_type
));
2375 /* Only type inconsistent programs can have otr_type that is
2376 not part of outer type. */
2377 if (!contains_type_p (context
->outer_type
, context
->offset
,
2380 /* Use OTR_TOKEN = INT_MAX as a marker of probably type inconsistent
2381 code sequences; we arrange the calls to be builtin_unreachable
2383 *otr_token
= INT_MAX
;
2384 return base_pointer
;
2386 context
->maybe_derived_type
= false;
2387 context
->maybe_in_construction
= false;
2388 return base_pointer
;
2392 tree base_type
= TREE_TYPE (base_pointer
);
2394 if (TREE_CODE (base_pointer
) == SSA_NAME
2395 && SSA_NAME_IS_DEFAULT_DEF (base_pointer
)
2396 && TREE_CODE (SSA_NAME_VAR (base_pointer
)) != PARM_DECL
)
2398 /* Use OTR_TOKEN = INT_MAX as a marker of probably type inconsistent
2399 code sequences; we arrange the calls to be builtin_unreachable
2401 *otr_token
= INT_MAX
;
2402 return base_pointer
;
2404 if (TREE_CODE (base_pointer
) == SSA_NAME
2405 && SSA_NAME_DEF_STMT (base_pointer
)
2406 && gimple_assign_single_p (SSA_NAME_DEF_STMT (base_pointer
)))
2407 base_type
= TREE_TYPE (gimple_assign_rhs1
2408 (SSA_NAME_DEF_STMT (base_pointer
)));
2410 if (POINTER_TYPE_P (base_type
)
2411 && contains_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (base_type
)),
2415 context
->speculative_outer_type
= TYPE_MAIN_VARIANT
2416 (TREE_TYPE (base_type
));
2417 context
->speculative_offset
= context
->offset
;
2418 context
->speculative_maybe_derived_type
= true;
2420 /* TODO: There are multiple ways to derive a type. For instance
2421 if BASE_POINTER is passed to an constructor call prior our refernece.
2422 We do not make this type of flow sensitive analysis yet. */
2423 return base_pointer
;
2426 /* Walk bases of OUTER_TYPE that contain OTR_TYPE at OFFSET.
2427 Lookup their respecitve virtual methods for OTR_TOKEN and OTR_TYPE
2428 and insert them to NODES.
2430 MATCHED_VTABLES and INSERTED is used to avoid duplicated work. */
2433 record_targets_from_bases (tree otr_type
,
2434 HOST_WIDE_INT otr_token
,
2436 HOST_WIDE_INT offset
,
2437 vec
<cgraph_node
*> &nodes
,
2438 pointer_set_t
*inserted
,
2439 pointer_set_t
*matched_vtables
,
2444 HOST_WIDE_INT pos
, size
;
2448 if (types_same_for_odr (outer_type
, otr_type
))
2451 for (fld
= TYPE_FIELDS (outer_type
); fld
; fld
= DECL_CHAIN (fld
))
2453 if (TREE_CODE (fld
) != FIELD_DECL
)
2456 pos
= int_bit_position (fld
);
2457 size
= tree_to_shwi (DECL_SIZE (fld
));
2458 if (pos
<= offset
&& (pos
+ size
) > offset
2459 /* Do not get confused by zero sized bases. */
2460 && polymorphic_type_binfo_p (TYPE_BINFO (TREE_TYPE (fld
))))
2463 /* Within a class type we should always find correcponding fields. */
2464 gcc_assert (fld
&& TREE_CODE (TREE_TYPE (fld
)) == RECORD_TYPE
);
2466 /* Nonbasetypes should have been stripped by outer_class_type. */
2467 gcc_assert (DECL_ARTIFICIAL (fld
));
2469 outer_type
= TREE_TYPE (fld
);
2472 base_binfo
= get_binfo_at_offset (TYPE_BINFO (outer_type
),
2476 gcc_assert (odr_violation_reported
);
2479 gcc_assert (base_binfo
);
2480 if (!pointer_set_insert (matched_vtables
, BINFO_VTABLE (base_binfo
)))
2483 tree target
= gimple_get_virt_method_for_binfo (otr_token
,
2486 if (!target
|| ! DECL_CXX_DESTRUCTOR_P (target
))
2487 maybe_record_node (nodes
, target
, inserted
, can_refer
, completep
);
2488 pointer_set_insert (matched_vtables
, BINFO_VTABLE (base_binfo
));
2493 /* When virtual table is removed, we may need to flush the cache. */
2496 devirt_variable_node_removal_hook (varpool_node
*n
,
2497 void *d ATTRIBUTE_UNUSED
)
2499 if (cached_polymorphic_call_targets
2500 && DECL_VIRTUAL_P (n
->decl
)
2501 && type_in_anonymous_namespace_p (DECL_CONTEXT (n
->decl
)))
2502 free_polymorphic_call_targets_hash ();
2505 /* Return vector containing possible targets of polymorphic call of type
2506 OTR_TYPE caling method OTR_TOKEN within type of OTR_OUTER_TYPE and OFFSET.
2507 If INCLUDE_BASES is true, walk also base types of OUTER_TYPES containig
2508 OTR_TYPE and include their virtual method. This is useful for types
2509 possibly in construction or destruction where the virtual table may
2510 temporarily change to one of base types. INCLUDE_DERIVER_TYPES make
2511 us to walk the inheritance graph for all derivations.
2513 OTR_TOKEN == INT_MAX is used to mark calls that are provably
2514 undefined and should be redirected to unreachable.
2516 If COMPLETEP is non-NULL, store true if the list is complete.
2517 CACHE_TOKEN (if non-NULL) will get stored to an unique ID of entry
2518 in the target cache. If user needs to visit every target list
2519 just once, it can memoize them.
2521 NONCONSTRUCTION_TARGETS specify number of targets with asumption that
2522 the type is not in the construction. Those targets appear first in the
2525 Returned vector is placed into cache. It is NOT caller's responsibility
2526 to free it. The vector can be freed on cgraph_remove_node call if
2527 the particular node is a virtual function present in the cache. */
2530 possible_polymorphic_call_targets (tree otr_type
,
2531 HOST_WIDE_INT otr_token
,
2532 ipa_polymorphic_call_context context
,
2535 int *nonconstruction_targetsp
)
2537 static struct cgraph_node_hook_list
*node_removal_hook_holder
;
2538 pointer_set_t
*inserted
;
2539 pointer_set_t
*matched_vtables
;
2540 vec
<cgraph_node
*> nodes
= vNULL
;
2541 vec
<tree
> bases_to_consider
= vNULL
;
2542 odr_type type
, outer_type
;
2543 polymorphic_call_target_d key
;
2544 polymorphic_call_target_d
**slot
;
2549 bool skipped
= false;
2551 otr_type
= TYPE_MAIN_VARIANT (otr_type
);
2553 /* If ODR is not initialized, return empty incomplete list. */
2559 *cache_token
= NULL
;
2560 if (nonconstruction_targetsp
)
2561 *nonconstruction_targetsp
= 0;
2565 /* If we hit type inconsistency, just return empty list of targets. */
2566 if (otr_token
== INT_MAX
)
2571 *cache_token
= NULL
;
2572 if (nonconstruction_targetsp
)
2573 *nonconstruction_targetsp
= 0;
2577 type
= get_odr_type (otr_type
, true);
2579 /* Recording type variants would wast results cache. */
2580 gcc_assert (!context
.outer_type
2581 || TYPE_MAIN_VARIANT (context
.outer_type
) == context
.outer_type
);
2583 /* Lookup the outer class type we want to walk. */
2584 if (context
.outer_type
2585 && !get_class_context (&context
, otr_type
))
2590 *cache_token
= NULL
;
2591 if (nonconstruction_targetsp
)
2592 *nonconstruction_targetsp
= 0;
2596 /* Check that get_class_context kept the main variant. */
2597 gcc_assert (!context
.outer_type
2598 || TYPE_MAIN_VARIANT (context
.outer_type
) == context
.outer_type
);
2600 /* We canonicalize our query, so we do not need extra hashtable entries. */
2602 /* Without outer type, we have no use for offset. Just do the
2603 basic search from innter type */
2604 if (!context
.outer_type
)
2606 context
.outer_type
= otr_type
;
2609 /* We need to update our hiearchy if the type does not exist. */
2610 outer_type
= get_odr_type (context
.outer_type
, true);
2611 /* If the type is complete, there are no derivations. */
2612 if (TYPE_FINAL_P (outer_type
->type
))
2613 context
.maybe_derived_type
= false;
2615 /* Initialize query cache. */
2616 if (!cached_polymorphic_call_targets
)
2618 cached_polymorphic_call_targets
= pointer_set_create ();
2619 polymorphic_call_target_hash
2620 = new polymorphic_call_target_hash_type (23);
2621 if (!node_removal_hook_holder
)
2623 node_removal_hook_holder
=
2624 cgraph_add_node_removal_hook (&devirt_node_removal_hook
, NULL
);
2625 varpool_add_node_removal_hook (&devirt_variable_node_removal_hook
,
2630 /* Lookup cached answer. */
2632 key
.otr_token
= otr_token
;
2633 key
.context
= context
;
2634 slot
= polymorphic_call_target_hash
->find_slot (&key
, INSERT
);
2636 *cache_token
= (void *)*slot
;
2640 *completep
= (*slot
)->complete
;
2641 if (nonconstruction_targetsp
)
2642 *nonconstruction_targetsp
= (*slot
)->nonconstruction_targets
;
2643 return (*slot
)->targets
;
2648 /* Do actual search. */
2649 timevar_push (TV_IPA_VIRTUAL_CALL
);
2650 *slot
= XCNEW (polymorphic_call_target_d
);
2652 *cache_token
= (void *)*slot
;
2653 (*slot
)->type
= type
;
2654 (*slot
)->otr_token
= otr_token
;
2655 (*slot
)->context
= context
;
2657 inserted
= pointer_set_create ();
2658 matched_vtables
= pointer_set_create ();
2660 /* First see virtual method of type itself. */
2661 binfo
= get_binfo_at_offset (TYPE_BINFO (outer_type
->type
),
2662 context
.offset
, otr_type
);
2664 target
= gimple_get_virt_method_for_binfo (otr_token
, binfo
,
2668 gcc_assert (odr_violation_reported
);
2672 /* Destructors are never called through construction virtual tables,
2673 because the type is always known. */
2674 if (target
&& DECL_CXX_DESTRUCTOR_P (target
))
2675 context
.maybe_in_construction
= false;
2679 /* In the case we get complete method, we don't need
2680 to walk derivations. */
2681 if (DECL_FINAL_P (target
))
2682 context
.maybe_derived_type
= false;
2685 /* If OUTER_TYPE is abstract, we know we are not seeing its instance. */
2686 if (type_possibly_instantiated_p (outer_type
->type
))
2687 maybe_record_node (nodes
, target
, inserted
, can_refer
, &complete
);
2691 gcc_assert (in_lto_p
|| context
.maybe_derived_type
);
2695 pointer_set_insert (matched_vtables
, BINFO_VTABLE (binfo
));
2697 /* Next walk recursively all derived types. */
2698 if (context
.maybe_derived_type
)
2700 /* For anonymous namespace types we can attempt to build full type.
2701 All derivations must be in this unit (unless we see partial unit). */
2702 if (!type
->all_derivations_known
)
2704 for (i
= 0; i
< outer_type
->derived_types
.length(); i
++)
2705 possible_polymorphic_call_targets_1 (nodes
, inserted
,
2708 outer_type
->derived_types
[i
],
2709 otr_token
, outer_type
->type
,
2710 context
.offset
, &complete
,
2712 context
.maybe_in_construction
);
2715 /* Finally walk bases, if asked to. */
2716 (*slot
)->nonconstruction_targets
= nodes
.length();
2718 /* Destructors are never called through construction virtual tables,
2719 because the type is always known. One of entries may be cxa_pure_virtual
2720 so look to at least two of them. */
2721 if (context
.maybe_in_construction
)
2722 for (i
=0 ; i
< MIN (nodes
.length (), 2); i
++)
2723 if (DECL_CXX_DESTRUCTOR_P (nodes
[i
]->decl
))
2724 context
.maybe_in_construction
= false;
2725 if (context
.maybe_in_construction
)
2727 if (type
!= outer_type
2729 || (context
.maybe_derived_type
2730 && !type_all_derivations_known_p (outer_type
->type
))))
2731 record_targets_from_bases (otr_type
, otr_token
, outer_type
->type
,
2732 context
.offset
, nodes
, inserted
,
2733 matched_vtables
, &complete
);
2735 maybe_record_node (nodes
, target
, inserted
, can_refer
, &complete
);
2736 for (i
= 0; i
< bases_to_consider
.length(); i
++)
2737 maybe_record_node (nodes
, bases_to_consider
[i
], inserted
, can_refer
, &complete
);
2739 bases_to_consider
.release();
2741 (*slot
)->targets
= nodes
;
2742 (*slot
)->complete
= complete
;
2744 *completep
= complete
;
2745 if (nonconstruction_targetsp
)
2746 *nonconstruction_targetsp
= (*slot
)->nonconstruction_targets
;
2748 pointer_set_destroy (inserted
);
2749 pointer_set_destroy (matched_vtables
);
2750 timevar_pop (TV_IPA_VIRTUAL_CALL
);
2754 /* Dump all possible targets of a polymorphic call. */
2757 dump_possible_polymorphic_call_targets (FILE *f
,
2759 HOST_WIDE_INT otr_token
,
2760 const ipa_polymorphic_call_context
&ctx
)
2762 vec
<cgraph_node
*> targets
;
2764 odr_type type
= get_odr_type (TYPE_MAIN_VARIANT (otr_type
), false);
2766 int nonconstruction
;
2770 targets
= possible_polymorphic_call_targets (otr_type
, otr_token
,
2772 &final
, NULL
, &nonconstruction
);
2773 fprintf (f
, " Targets of polymorphic call of type %i:", type
->id
);
2774 print_generic_expr (f
, type
->type
, TDF_SLIM
);
2775 fprintf (f
, " token %i\n", (int)otr_token
);
2776 if (ctx
.outer_type
|| ctx
.offset
)
2778 fprintf (f
, " Contained in type:");
2779 print_generic_expr (f
, ctx
.outer_type
, TDF_SLIM
);
2780 fprintf (f
, " at offset "HOST_WIDE_INT_PRINT_DEC
"\n",
2784 fprintf (f
, " %s%s%s\n ",
2785 final
? "This is a complete list." :
2786 "This is partial list; extra targets may be defined in other units.",
2787 ctx
.maybe_in_construction
? " (base types included)" : "",
2788 ctx
.maybe_derived_type
? " (derived types included)" : "");
2789 for (i
= 0; i
< targets
.length (); i
++)
2792 if (i
== (unsigned)nonconstruction
)
2793 fprintf (f
, "\n If the type is in construction,"
2794 " then additional tarets are:\n"
2797 name
= cplus_demangle_v3 (targets
[i
]->asm_name (), 0);
2798 fprintf (f
, " %s/%i", name
? name
: targets
[i
]->name (), targets
[i
]->order
);
2801 if (!targets
[i
]->definition
)
2802 fprintf (f
, " (no definition%s)",
2803 DECL_DECLARED_INLINE_P (targets
[i
]->decl
)
2806 fprintf (f
, "\n\n");
2810 /* Return true if N can be possibly target of a polymorphic call of
2811 OTR_TYPE/OTR_TOKEN. */
2814 possible_polymorphic_call_target_p (tree otr_type
,
2815 HOST_WIDE_INT otr_token
,
2816 const ipa_polymorphic_call_context
&ctx
,
2817 struct cgraph_node
*n
)
2819 vec
<cgraph_node
*> targets
;
2821 enum built_in_function fcode
;
2824 if (TREE_CODE (TREE_TYPE (n
->decl
)) == FUNCTION_TYPE
2825 && ((fcode
= DECL_FUNCTION_CODE (n
->decl
))
2826 == BUILT_IN_UNREACHABLE
2827 || fcode
== BUILT_IN_TRAP
))
2832 targets
= possible_polymorphic_call_targets (otr_type
, otr_token
, ctx
, &final
);
2833 for (i
= 0; i
< targets
.length (); i
++)
2834 if (n
->semantically_equivalent_p (targets
[i
]))
2837 /* At a moment we allow middle end to dig out new external declarations
2838 as a targets of polymorphic calls. */
2839 if (!final
&& !n
->definition
)
2845 /* After callgraph construction new external nodes may appear.
2846 Add them into the graph. */
2849 update_type_inheritance_graph (void)
2851 struct cgraph_node
*n
;
2855 free_polymorphic_call_targets_hash ();
2856 timevar_push (TV_IPA_INHERITANCE
);
2857 /* We reconstruct the graph starting from types of all methods seen in the
2859 FOR_EACH_FUNCTION (n
)
2860 if (DECL_VIRTUAL_P (n
->decl
)
2862 && n
->real_symbol_p ())
2863 get_odr_type (method_class_type (TYPE_MAIN_VARIANT (TREE_TYPE (n
->decl
))),
2865 timevar_pop (TV_IPA_INHERITANCE
);
2869 /* Return true if N looks like likely target of a polymorphic call.
2870 Rule out cxa_pure_virtual, noreturns, function declared cold and
2871 other obvious cases. */
2874 likely_target_p (struct cgraph_node
*n
)
2877 /* cxa_pure_virtual and similar things are not likely. */
2878 if (TREE_CODE (TREE_TYPE (n
->decl
)) != METHOD_TYPE
)
2880 flags
= flags_from_decl_or_type (n
->decl
);
2881 if (flags
& ECF_NORETURN
)
2883 if (lookup_attribute ("cold",
2884 DECL_ATTRIBUTES (n
->decl
)))
2886 if (n
->frequency
< NODE_FREQUENCY_NORMAL
)
2888 /* If there are no virtual tables refering the target alive,
2889 the only way the target can be called is an instance comming from other
2890 compilation unit; speculative devirtualization is build around an
2891 assumption that won't happen. */
2892 if (!referenced_from_vtable_p (n
))
2897 /* The ipa-devirt pass.
2898 When polymorphic call has only one likely target in the unit,
2899 turn it into speculative call. */
2904 struct cgraph_node
*n
;
2905 struct pointer_set_t
*bad_call_targets
= pointer_set_create ();
2906 struct cgraph_edge
*e
;
2908 int npolymorphic
= 0, nspeculated
= 0, nconverted
= 0, ncold
= 0;
2909 int nmultiple
= 0, noverwritable
= 0, ndevirtualized
= 0, nnotdefined
= 0;
2910 int nwrong
= 0, nok
= 0, nexternal
= 0, nartificial
= 0;
2912 FOR_EACH_DEFINED_FUNCTION (n
)
2914 bool update
= false;
2915 if (dump_file
&& n
->indirect_calls
)
2916 fprintf (dump_file
, "\n\nProcesing function %s/%i\n",
2917 n
->name (), n
->order
);
2918 for (e
= n
->indirect_calls
; e
; e
= e
->next_callee
)
2919 if (e
->indirect_info
->polymorphic
)
2921 struct cgraph_node
*likely_target
= NULL
;
2924 int nonconstruction_targets
;
2925 vec
<cgraph_node
*>targets
2926 = possible_polymorphic_call_targets
2927 (e
, &final
, &cache_token
, &nonconstruction_targets
);
2931 dump_possible_polymorphic_call_targets
2936 if (!cgraph_maybe_hot_edge_p (e
))
2939 fprintf (dump_file
, "Call is cold\n\n");
2946 fprintf (dump_file
, "Call is aready speculated\n\n");
2949 /* When dumping see if we agree with speculation. */
2953 if (pointer_set_contains (bad_call_targets
,
2957 fprintf (dump_file
, "Target list is known to be useless\n\n");
2961 for (i
= 0; i
< targets
.length (); i
++)
2962 if (likely_target_p (targets
[i
]))
2966 if (i
< (unsigned) nonconstruction_targets
)
2968 likely_target
= NULL
;
2970 fprintf (dump_file
, "More than one likely target\n\n");
2975 likely_target
= targets
[i
];
2979 pointer_set_insert (bad_call_targets
, cache_token
);
2982 /* This is reached only when dumping; check if we agree or disagree
2983 with the speculation. */
2986 struct cgraph_edge
*e2
;
2987 struct ipa_ref
*ref
;
2988 cgraph_speculative_call_info (e
, e2
, e
, ref
);
2989 if (e2
->callee
->ultimate_alias_target ()
2990 == likely_target
->ultimate_alias_target ())
2992 fprintf (dump_file
, "We agree with speculation\n\n");
2997 fprintf (dump_file
, "We disagree with speculation\n\n");
3002 if (!likely_target
->definition
)
3005 fprintf (dump_file
, "Target is not an definition\n\n");
3009 /* Do not introduce new references to external symbols. While we
3010 can handle these just well, it is common for programs to
3011 incorrectly with headers defining methods they are linked
3013 if (DECL_EXTERNAL (likely_target
->decl
))
3016 fprintf (dump_file
, "Target is external\n\n");
3020 /* Don't use an implicitly-declared destructor (c++/58678). */
3021 struct cgraph_node
*non_thunk_target
3022 = likely_target
->function_symbol ();
3023 if (DECL_ARTIFICIAL (non_thunk_target
->decl
)
3024 && DECL_COMDAT (non_thunk_target
->decl
))
3027 fprintf (dump_file
, "Target is artificial\n\n");
3031 if (likely_target
->get_availability () <= AVAIL_INTERPOSABLE
3032 && likely_target
->can_be_discarded_p ())
3035 fprintf (dump_file
, "Target is overwritable\n\n");
3039 else if (dbg_cnt (devirt
))
3041 if (dump_enabled_p ())
3043 location_t locus
= gimple_location_safe (e
->call_stmt
);
3044 dump_printf_loc (MSG_OPTIMIZED_LOCATIONS
, locus
,
3045 "speculatively devirtualizing call in %s/%i to %s/%i\n",
3046 n
->name (), n
->order
,
3047 likely_target
->name (),
3048 likely_target
->order
);
3050 if (!likely_target
->can_be_discarded_p ())
3053 alias
= dyn_cast
<cgraph_node
*> (likely_target
->noninterposable_alias ());
3055 likely_target
= alias
;
3059 cgraph_turn_edge_to_speculative
3060 (e
, likely_target
, e
->count
* 8 / 10, e
->frequency
* 8 / 10);
3064 inline_update_overall_summary (n
);
3066 pointer_set_destroy (bad_call_targets
);
3070 "%i polymorphic calls, %i devirtualized,"
3071 " %i speculatively devirtualized, %i cold\n"
3072 "%i have multiple targets, %i overwritable,"
3073 " %i already speculated (%i agree, %i disagree),"
3074 " %i external, %i not defined, %i artificial\n",
3075 npolymorphic
, ndevirtualized
, nconverted
, ncold
,
3076 nmultiple
, noverwritable
, nspeculated
, nok
, nwrong
,
3077 nexternal
, nnotdefined
, nartificial
);
3078 return ndevirtualized
? TODO_remove_functions
: 0;
3083 const pass_data pass_data_ipa_devirt
=
3085 IPA_PASS
, /* type */
3086 "devirt", /* name */
3087 OPTGROUP_NONE
, /* optinfo_flags */
3088 TV_IPA_DEVIRT
, /* tv_id */
3089 0, /* properties_required */
3090 0, /* properties_provided */
3091 0, /* properties_destroyed */
3092 0, /* todo_flags_start */
3093 ( TODO_dump_symtab
), /* todo_flags_finish */
3096 class pass_ipa_devirt
: public ipa_opt_pass_d
3099 pass_ipa_devirt (gcc::context
*ctxt
)
3100 : ipa_opt_pass_d (pass_data_ipa_devirt
, ctxt
,
3101 NULL
, /* generate_summary */
3102 NULL
, /* write_summary */
3103 NULL
, /* read_summary */
3104 NULL
, /* write_optimization_summary */
3105 NULL
, /* read_optimization_summary */
3106 NULL
, /* stmt_fixup */
3107 0, /* function_transform_todo_flags_start */
3108 NULL
, /* function_transform */
3109 NULL
) /* variable_transform */
3112 /* opt_pass methods: */
3113 virtual bool gate (function
*)
3115 return (flag_devirtualize
3116 && flag_devirtualize_speculatively
3120 virtual unsigned int execute (function
*) { return ipa_devirt (); }
3122 }; // class pass_ipa_devirt
3127 make_pass_ipa_devirt (gcc::context
*ctxt
)
3129 return new pass_ipa_devirt (ctxt
);
3132 #include "gt-ipa-devirt.h"