]>
Commit | Line | Data |
---|---|---|
eefe9a99 JH |
1 | /* Basic IPA utilities for type inheritance graph construction and |
2 | devirtualization. | |
85ec4feb | 3 | Copyright (C) 2013-2018 Free Software Foundation, Inc. |
eefe9a99 JH |
4 | Contributed by Jan Hubicka |
5 | ||
6 | This file is part of GCC. | |
7 | ||
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 | |
11 | version. | |
12 | ||
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 | |
16 | for more details. | |
17 | ||
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/>. */ | |
21 | ||
d6ae9a6d | 22 | /* Brief vocabulary: |
eefe9a99 JH |
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. | |
38 | ||
39 | OTR = OBJ_TYPE_REF | |
0e1474e5 | 40 | This is the Gimple representation of type information of a polymorphic call. |
eefe9a99 JH |
41 | It contains two parameters: |
42 | otr_type is a type of class whose method is called. | |
0e1474e5 | 43 | otr_token is the index into virtual table where address is taken. |
eefe9a99 JH |
44 | |
45 | BINFO | |
46 | This is the type inheritance information attached to each tree | |
d6ae9a6d | 47 | RECORD_TYPE by the C++ frontend. It provides information about base |
eefe9a99 JH |
48 | types and virtual tables. |
49 | ||
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 | |
52 | BINFO_VTABLE. | |
53 | ||
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 | |
0e1474e5 | 58 | virtual table of the base type. Also BINFO_OFFSET specifies |
eefe9a99 JH |
59 | offset of the base within the type. |
60 | ||
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 | |
609570b4 | 64 | BINFO_VTABLE of base binfos (that differs of BINFO_VTABLE of |
eefe9a99 JH |
65 | binfo associated to the base type). |
66 | ||
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 | |
70 | base type. | |
71 | ||
72 | token | |
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 | |
0e1474e5 | 75 | or from DECL_VINDEX of a given virtual table. |
eefe9a99 JH |
76 | |
77 | polymorphic (indirect) call | |
d6ae9a6d | 78 | This is callgraph representation of virtual method call. Every |
eefe9a99 JH |
79 | polymorphic call contains otr_type and otr_token taken from |
80 | original OBJ_TYPE_REF at callgraph construction time. | |
81 | ||
82 | What we do here: | |
83 | ||
84 | build_type_inheritance_graph triggers a construction of the type inheritance | |
85 | graph. | |
86 | ||
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 | |
0e1474e5 | 89 | inserted into the graph. Also types without virtual methods are not |
eefe9a99 | 90 | represented at all, though it may be easy to add this. |
609570b4 | 91 | |
eefe9a99 JH |
92 | The inheritance graph is represented as follows: |
93 | ||
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) | |
97 | ||
0e1474e5 | 98 | Edges are represented by odr_type->base and odr_type->derived_types. |
eefe9a99 JH |
99 | At the moment we do not track offsets of types for multiple inheritance. |
100 | Adding this is easy. | |
101 | ||
102 | possible_polymorphic_call_targets returns, given an parameters found in | |
103 | indirect polymorphic edge all possible polymorphic call targets of the call. | |
bbc9396b JH |
104 | |
105 | pass_ipa_devirt performs simple speculative devirtualization. | |
eefe9a99 JH |
106 | */ |
107 | ||
108 | #include "config.h" | |
109 | #include "system.h" | |
110 | #include "coretypes.h" | |
c7131fb2 | 111 | #include "backend.h" |
957060b5 | 112 | #include "rtl.h" |
4d648807 | 113 | #include "tree.h" |
c7131fb2 | 114 | #include "gimple.h" |
957060b5 AM |
115 | #include "alloc-pool.h" |
116 | #include "tree-pass.h" | |
957060b5 AM |
117 | #include "cgraph.h" |
118 | #include "lto-streamer.h" | |
40e23961 | 119 | #include "fold-const.h" |
d8a2d370 DN |
120 | #include "print-tree.h" |
121 | #include "calls.h" | |
eefe9a99 | 122 | #include "ipa-utils.h" |
2fb9a547 | 123 | #include "gimple-fold.h" |
dd912cb8 | 124 | #include "symbol-summary.h" |
8bc5448f | 125 | #include "tree-vrp.h" |
c582198b | 126 | #include "ipa-prop.h" |
27d020cf | 127 | #include "ipa-fnsummary.h" |
ec77d61f | 128 | #include "demangle.h" |
2b5f0895 | 129 | #include "dbgcnt.h" |
7d0aa05b | 130 | #include "gimple-pretty-print.h" |
c59f7203 | 131 | #include "intl.h" |
314e6352 ML |
132 | #include "stringpool.h" |
133 | #include "attribs.h" | |
c59f7203 | 134 | |
2c132d34 | 135 | /* Hash based set of pairs of types. */ |
50686850 | 136 | struct type_pair |
2c132d34 JH |
137 | { |
138 | tree first; | |
139 | tree second; | |
50686850 | 140 | }; |
2c132d34 | 141 | |
b32ca1df | 142 | template <> |
6c38fbc6 NS |
143 | struct default_hash_traits <type_pair> |
144 | : typed_noop_remove <type_pair> | |
2c132d34 | 145 | { |
6c38fbc6 NS |
146 | GTY((skip)) typedef type_pair value_type; |
147 | GTY((skip)) typedef type_pair compare_type; | |
2c132d34 JH |
148 | static hashval_t |
149 | hash (type_pair p) | |
150 | { | |
151 | return TYPE_UID (p.first) ^ TYPE_UID (p.second); | |
152 | } | |
153 | static bool | |
154 | is_empty (type_pair p) | |
155 | { | |
156 | return p.first == NULL; | |
157 | } | |
158 | static bool | |
159 | is_deleted (type_pair p ATTRIBUTE_UNUSED) | |
160 | { | |
161 | return false; | |
162 | } | |
163 | static bool | |
164 | equal (const type_pair &a, const type_pair &b) | |
165 | { | |
166 | return a.first==b.first && a.second == b.second; | |
167 | } | |
168 | static void | |
169 | mark_empty (type_pair &e) | |
170 | { | |
171 | e.first = NULL; | |
172 | } | |
173 | }; | |
174 | ||
6e2830c3 | 175 | static bool odr_types_equivalent_p (tree, tree, bool, bool *, |
b32ca1df | 176 | hash_set<type_pair> *, |
6542950e | 177 | location_t, location_t); |
ec77d61f JH |
178 | |
179 | static bool odr_violation_reported = false; | |
68377e53 | 180 | |
eefe9a99 | 181 | |
0e1474e5 | 182 | /* Pointer set of all call targets appearing in the cache. */ |
6e2830c3 | 183 | static hash_set<cgraph_node *> *cached_polymorphic_call_targets; |
0e1474e5 | 184 | |
eefe9a99 | 185 | /* The node of type inheritance graph. For each type unique in |
609570b4 | 186 | One Definition Rule (ODR) sense, we produce one node linking all |
eefe9a99 JH |
187 | main variants of types equivalent to it, bases and derived types. */ |
188 | ||
189 | struct GTY(()) odr_type_d | |
190 | { | |
eefe9a99 JH |
191 | /* leader type. */ |
192 | tree type; | |
d6ae9a6d | 193 | /* All bases; built only for main variants of types. */ |
eefe9a99 | 194 | vec<odr_type> GTY((skip)) bases; |
d6ae9a6d SL |
195 | /* All derived types with virtual methods seen in unit; |
196 | built only for main variants of types. */ | |
eefe9a99 | 197 | vec<odr_type> GTY((skip)) derived_types; |
0e1474e5 | 198 | |
61a74079 JH |
199 | /* All equivalent types, if more than one. */ |
200 | vec<tree, va_gc> *types; | |
201 | /* Set of all equivalent types, if NON-NULL. */ | |
6e2830c3 | 202 | hash_set<tree> * GTY((skip)) types_set; |
61a74079 | 203 | |
0e1474e5 JH |
204 | /* Unique ID indexing the type in odr_types array. */ |
205 | int id; | |
eefe9a99 JH |
206 | /* Is it in anonymous namespace? */ |
207 | bool anonymous_namespace; | |
2d1644bf JH |
208 | /* Do we know about all derivations of given type? */ |
209 | bool all_derivations_known; | |
549bcbd1 JH |
210 | /* Did we report ODR violation here? */ |
211 | bool odr_violated; | |
b1905808 JH |
212 | /* Set when virtual table without RTTI previaled table with. */ |
213 | bool rtti_broken; | |
eefe9a99 JH |
214 | }; |
215 | ||
2d1644bf JH |
216 | /* Return TRUE if all derived types of T are known and thus |
217 | we may consider the walk of derived type complete. | |
218 | ||
219 | This is typically true only for final anonymous namespace types and types | |
220 | defined within functions (that may be COMDAT and thus shared across units, | |
221 | but with the same set of derived types). */ | |
222 | ||
aa803cc7 JH |
223 | bool |
224 | type_all_derivations_known_p (const_tree t) | |
2d1644bf JH |
225 | { |
226 | if (TYPE_FINAL_P (t)) | |
227 | return true; | |
228 | if (flag_ltrans) | |
229 | return false; | |
5ce97055 JH |
230 | /* Non-C++ types may have IDENTIFIER_NODE here, do not crash. */ |
231 | if (!TYPE_NAME (t) || TREE_CODE (TYPE_NAME (t)) != TYPE_DECL) | |
232 | return true; | |
2d1644bf JH |
233 | if (type_in_anonymous_namespace_p (t)) |
234 | return true; | |
235 | return (decl_function_context (TYPE_NAME (t)) != NULL); | |
236 | } | |
237 | ||
d6ae9a6d | 238 | /* Return TRUE if type's constructors are all visible. */ |
2d1644bf JH |
239 | |
240 | static bool | |
241 | type_all_ctors_visible_p (tree t) | |
242 | { | |
243 | return !flag_ltrans | |
3dafb85c | 244 | && symtab->state >= CONSTRUCTION |
2d1644bf JH |
245 | /* We can not always use type_all_derivations_known_p. |
246 | For function local types we must assume case where | |
609570b4 | 247 | the function is COMDAT and shared in between units. |
2d1644bf JH |
248 | |
249 | TODO: These cases are quite easy to get, but we need | |
250 | to keep track of C++ privatizing via -Wno-weak | |
251 | as well as the IPA privatizing. */ | |
252 | && type_in_anonymous_namespace_p (t); | |
253 | } | |
254 | ||
255 | /* Return TRUE if type may have instance. */ | |
256 | ||
257 | static bool | |
258 | type_possibly_instantiated_p (tree t) | |
259 | { | |
260 | tree vtable; | |
261 | varpool_node *vnode; | |
262 | ||
263 | /* TODO: Add abstract types here. */ | |
264 | if (!type_all_ctors_visible_p (t)) | |
265 | return true; | |
266 | ||
267 | vtable = BINFO_VTABLE (TYPE_BINFO (t)); | |
268 | if (TREE_CODE (vtable) == POINTER_PLUS_EXPR) | |
269 | vtable = TREE_OPERAND (TREE_OPERAND (vtable, 0), 0); | |
9041d2e6 | 270 | vnode = varpool_node::get (vtable); |
2d1644bf JH |
271 | return vnode && vnode->definition; |
272 | } | |
273 | ||
609570b4 JH |
274 | /* Hash used to unify ODR types based on their mangled name and for anonymous |
275 | namespace types. */ | |
eefe9a99 | 276 | |
7edd9b15 | 277 | struct odr_name_hasher : pointer_hash <odr_type_d> |
eefe9a99 | 278 | { |
67f58944 TS |
279 | typedef union tree_node *compare_type; |
280 | static inline hashval_t hash (const odr_type_d *); | |
281 | static inline bool equal (const odr_type_d *, const tree_node *); | |
282 | static inline void remove (odr_type_d *); | |
eefe9a99 JH |
283 | }; |
284 | ||
609570b4 JH |
285 | /* Has used to unify ODR types based on their associated virtual table. |
286 | This hash is needed to keep -fno-lto-odr-type-merging to work and contains | |
287 | only polymorphic types. Types with mangled names are inserted to both. */ | |
288 | ||
289 | struct odr_vtable_hasher:odr_name_hasher | |
290 | { | |
67f58944 TS |
291 | static inline hashval_t hash (const odr_type_d *); |
292 | static inline bool equal (const odr_type_d *, const tree_node *); | |
609570b4 JH |
293 | }; |
294 | ||
549bcbd1 JH |
295 | /* Return type that was declared with T's name so that T is an |
296 | qualified variant of it. */ | |
297 | ||
298 | static inline tree | |
299 | main_odr_variant (const_tree t) | |
300 | { | |
301 | if (TYPE_NAME (t) && TREE_CODE (TYPE_NAME (t)) == TYPE_DECL) | |
302 | return TREE_TYPE (TYPE_NAME (t)); | |
303 | /* Unnamed types and non-C++ produced types can be compared by variants. */ | |
304 | else | |
305 | return TYPE_MAIN_VARIANT (t); | |
306 | } | |
307 | ||
609570b4 JH |
308 | static bool |
309 | can_be_name_hashed_p (tree t) | |
310 | { | |
e7a677ca | 311 | return (!in_lto_p || odr_type_p (t)); |
609570b4 JH |
312 | } |
313 | ||
314 | /* Hash type by its ODR name. */ | |
eefe9a99 | 315 | |
549bcbd1 | 316 | static hashval_t |
609570b4 | 317 | hash_odr_name (const_tree t) |
eefe9a99 | 318 | { |
549bcbd1 | 319 | gcc_checking_assert (main_odr_variant (t) == t); |
eefe9a99 JH |
320 | |
321 | /* If not in LTO, all main variants are unique, so we can do | |
322 | pointer hash. */ | |
323 | if (!in_lto_p) | |
324 | return htab_hash_pointer (t); | |
325 | ||
326 | /* Anonymous types are unique. */ | |
e7a677ca | 327 | if (type_with_linkage_p (t) && type_in_anonymous_namespace_p (t)) |
eefe9a99 JH |
328 | return htab_hash_pointer (t); |
329 | ||
609570b4 JH |
330 | gcc_checking_assert (TYPE_NAME (t) |
331 | && DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (t))); | |
332 | return IDENTIFIER_HASH_VALUE (DECL_ASSEMBLER_NAME (TYPE_NAME (t))); | |
333 | } | |
1ee85ee1 | 334 | |
609570b4 | 335 | /* Return the computed hashcode for ODR_TYPE. */ |
61a74079 | 336 | |
609570b4 | 337 | inline hashval_t |
67f58944 | 338 | odr_name_hasher::hash (const odr_type_d *odr_type) |
609570b4 JH |
339 | { |
340 | return hash_odr_name (odr_type->type); | |
341 | } | |
342 | ||
343 | static bool | |
344 | can_be_vtable_hashed_p (tree t) | |
345 | { | |
346 | /* vtable hashing can distinguish only main variants. */ | |
347 | if (TYPE_MAIN_VARIANT (t) != t) | |
348 | return false; | |
349 | /* Anonymous namespace types are always handled by name hash. */ | |
e7a677ca | 350 | if (type_with_linkage_p (t) && type_in_anonymous_namespace_p (t)) |
609570b4 JH |
351 | return false; |
352 | return (TREE_CODE (t) == RECORD_TYPE | |
353 | && TYPE_BINFO (t) && BINFO_VTABLE (TYPE_BINFO (t))); | |
354 | } | |
355 | ||
356 | /* Hash type by assembler name of its vtable. */ | |
357 | ||
358 | static hashval_t | |
359 | hash_odr_vtable (const_tree t) | |
360 | { | |
361 | tree v = BINFO_VTABLE (TYPE_BINFO (TYPE_MAIN_VARIANT (t))); | |
362 | inchash::hash hstate; | |
363 | ||
364 | gcc_checking_assert (in_lto_p); | |
365 | gcc_checking_assert (!type_in_anonymous_namespace_p (t)); | |
366 | gcc_checking_assert (TREE_CODE (t) == RECORD_TYPE | |
367 | && TYPE_BINFO (t) && BINFO_VTABLE (TYPE_BINFO (t))); | |
368 | gcc_checking_assert (main_odr_variant (t) == t); | |
61a74079 | 369 | |
609570b4 JH |
370 | if (TREE_CODE (v) == POINTER_PLUS_EXPR) |
371 | { | |
372 | add_expr (TREE_OPERAND (v, 1), hstate); | |
373 | v = TREE_OPERAND (TREE_OPERAND (v, 0), 0); | |
61a74079 JH |
374 | } |
375 | ||
449e9a33 | 376 | hstate.add_hwi (IDENTIFIER_HASH_VALUE (DECL_ASSEMBLER_NAME (v))); |
609570b4 | 377 | return hstate.end (); |
eefe9a99 JH |
378 | } |
379 | ||
380 | /* Return the computed hashcode for ODR_TYPE. */ | |
381 | ||
382 | inline hashval_t | |
67f58944 | 383 | odr_vtable_hasher::hash (const odr_type_d *odr_type) |
eefe9a99 | 384 | { |
609570b4 | 385 | return hash_odr_vtable (odr_type->type); |
eefe9a99 JH |
386 | } |
387 | ||
549bcbd1 JH |
388 | /* For languages with One Definition Rule, work out if |
389 | types are the same based on their name. | |
609570b4 | 390 | |
d6ae9a6d | 391 | This is non-trivial for LTO where minor differences in |
549bcbd1 JH |
392 | the type representation may have prevented type merging |
393 | to merge two copies of otherwise equivalent type. | |
394 | ||
395 | Until we start streaming mangled type names, this function works | |
609570b4 JH |
396 | only for polymorphic types. |
397 | ||
398 | When STRICT is true, we compare types by their names for purposes of | |
399 | ODR violation warnings. When strict is false, we consider variants | |
56aae4b7 | 400 | equivalent, because it is all that matters for devirtualization machinery. |
609570b4 | 401 | */ |
549bcbd1 JH |
402 | |
403 | bool | |
609570b4 | 404 | types_same_for_odr (const_tree type1, const_tree type2, bool strict) |
549bcbd1 JH |
405 | { |
406 | gcc_checking_assert (TYPE_P (type1) && TYPE_P (type2)); | |
407 | ||
408 | type1 = main_odr_variant (type1); | |
409 | type2 = main_odr_variant (type2); | |
609570b4 JH |
410 | if (!strict) |
411 | { | |
412 | type1 = TYPE_MAIN_VARIANT (type1); | |
413 | type2 = TYPE_MAIN_VARIANT (type2); | |
414 | } | |
549bcbd1 JH |
415 | |
416 | if (type1 == type2) | |
417 | return true; | |
418 | ||
419 | if (!in_lto_p) | |
420 | return false; | |
421 | ||
422 | /* Check for anonymous namespaces. Those have !TREE_PUBLIC | |
423 | on the corresponding TYPE_STUB_DECL. */ | |
e7a677ca JH |
424 | if ((type_with_linkage_p (type1) && type_in_anonymous_namespace_p (type1)) |
425 | || (type_with_linkage_p (type2) && type_in_anonymous_namespace_p (type2))) | |
549bcbd1 JH |
426 | return false; |
427 | ||
01a92e70 | 428 | |
1ee85ee1 JH |
429 | /* ODR name of the type is set in DECL_ASSEMBLER_NAME of its TYPE_NAME. |
430 | ||
d6ae9a6d | 431 | Ideally we should never need types without ODR names here. It can however |
1ee85ee1 | 432 | happen in two cases: |
549bcbd1 | 433 | |
1ee85ee1 JH |
434 | 1) for builtin types that are not streamed but rebuilt in lto/lto-lang.c |
435 | Here testing for equivalence is safe, since their MAIN_VARIANTs are | |
436 | unique. | |
437 | 2) for units streamed with -fno-lto-odr-type-merging. Here we can't | |
438 | establish precise ODR equivalency, but for correctness we care only | |
439 | about equivalency on complete polymorphic types. For these we can | |
440 | compare assembler names of their virtual tables. */ | |
441 | if ((!TYPE_NAME (type1) || !DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (type1))) | |
442 | || (!TYPE_NAME (type2) || !DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (type2)))) | |
549bcbd1 | 443 | { |
d6ae9a6d SL |
444 | /* See if types are obviously different (i.e. different codes |
445 | or polymorphic wrt non-polymorphic). This is not strictly correct | |
1ee85ee1 JH |
446 | for ODR violating programs, but we can't do better without streaming |
447 | ODR names. */ | |
448 | if (TREE_CODE (type1) != TREE_CODE (type2)) | |
449 | return false; | |
450 | if (TREE_CODE (type1) == RECORD_TYPE | |
609570b4 | 451 | && (TYPE_BINFO (type1) == NULL_TREE) |
28ee8b98 | 452 | != (TYPE_BINFO (type2) == NULL_TREE)) |
1ee85ee1 JH |
453 | return false; |
454 | if (TREE_CODE (type1) == RECORD_TYPE && TYPE_BINFO (type1) | |
455 | && (BINFO_VTABLE (TYPE_BINFO (type1)) == NULL_TREE) | |
456 | != (BINFO_VTABLE (TYPE_BINFO (type2)) == NULL_TREE)) | |
457 | return false; | |
458 | ||
d6ae9a6d SL |
459 | /* At the moment we have no way to establish ODR equivalence at LTO |
460 | other than comparing virtual table pointers of polymorphic types. | |
1ee85ee1 JH |
461 | Eventually we should start saving mangled names in TYPE_NAME. |
462 | Then this condition will become non-trivial. */ | |
463 | ||
464 | if (TREE_CODE (type1) == RECORD_TYPE | |
465 | && TYPE_BINFO (type1) && TYPE_BINFO (type2) | |
466 | && BINFO_VTABLE (TYPE_BINFO (type1)) | |
467 | && BINFO_VTABLE (TYPE_BINFO (type2))) | |
468 | { | |
469 | tree v1 = BINFO_VTABLE (TYPE_BINFO (type1)); | |
470 | tree v2 = BINFO_VTABLE (TYPE_BINFO (type2)); | |
471 | gcc_assert (TREE_CODE (v1) == POINTER_PLUS_EXPR | |
472 | && TREE_CODE (v2) == POINTER_PLUS_EXPR); | |
473 | return (operand_equal_p (TREE_OPERAND (v1, 1), | |
474 | TREE_OPERAND (v2, 1), 0) | |
475 | && DECL_ASSEMBLER_NAME | |
476 | (TREE_OPERAND (TREE_OPERAND (v1, 0), 0)) | |
477 | == DECL_ASSEMBLER_NAME | |
478 | (TREE_OPERAND (TREE_OPERAND (v2, 0), 0))); | |
479 | } | |
480 | gcc_unreachable (); | |
549bcbd1 | 481 | } |
1ee85ee1 JH |
482 | return (DECL_ASSEMBLER_NAME (TYPE_NAME (type1)) |
483 | == DECL_ASSEMBLER_NAME (TYPE_NAME (type2))); | |
549bcbd1 JH |
484 | } |
485 | ||
a1981458 JH |
486 | /* Return true if we can decide on ODR equivalency. |
487 | ||
488 | In non-LTO it is always decide, in LTO however it depends in the type has | |
609570b4 JH |
489 | ODR info attached. |
490 | ||
491 | When STRICT is false, compare main variants. */ | |
a1981458 | 492 | |
aa803cc7 | 493 | bool |
609570b4 | 494 | types_odr_comparable (tree t1, tree t2, bool strict) |
a1981458 JH |
495 | { |
496 | return (!in_lto_p | |
6542950e JH |
497 | || (strict ? (main_odr_variant (t1) == main_odr_variant (t2) |
498 | && main_odr_variant (t1)) | |
609570b4 | 499 | : TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2)) |
a1981458 JH |
500 | || (odr_type_p (t1) && odr_type_p (t2)) |
501 | || (TREE_CODE (t1) == RECORD_TYPE && TREE_CODE (t2) == RECORD_TYPE | |
502 | && TYPE_BINFO (t1) && TYPE_BINFO (t2) | |
503 | && polymorphic_type_binfo_p (TYPE_BINFO (t1)) | |
504 | && polymorphic_type_binfo_p (TYPE_BINFO (t2)))); | |
505 | } | |
506 | ||
507 | /* Return true if T1 and T2 are ODR equivalent. If ODR equivalency is not | |
508 | known, be conservative and return false. */ | |
509 | ||
aa803cc7 | 510 | bool |
a1981458 JH |
511 | types_must_be_same_for_odr (tree t1, tree t2) |
512 | { | |
513 | if (types_odr_comparable (t1, t2)) | |
514 | return types_same_for_odr (t1, t2); | |
515 | else | |
609570b4 | 516 | return TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2); |
a1981458 | 517 | } |
549bcbd1 | 518 | |
259d29e3 JH |
519 | /* If T is compound type, return type it is based on. */ |
520 | ||
521 | static tree | |
522 | compound_type_base (const_tree t) | |
523 | { | |
524 | if (TREE_CODE (t) == ARRAY_TYPE | |
525 | || POINTER_TYPE_P (t) | |
526 | || TREE_CODE (t) == COMPLEX_TYPE | |
527 | || VECTOR_TYPE_P (t)) | |
528 | return TREE_TYPE (t); | |
529 | if (TREE_CODE (t) == METHOD_TYPE) | |
530 | return TYPE_METHOD_BASETYPE (t); | |
531 | if (TREE_CODE (t) == OFFSET_TYPE) | |
532 | return TYPE_OFFSET_BASETYPE (t); | |
533 | return NULL_TREE; | |
534 | } | |
535 | ||
536 | /* Return true if T is either ODR type or compound type based from it. | |
537 | If the function return true, we know that T is a type originating from C++ | |
538 | source even at link-time. */ | |
539 | ||
540 | bool | |
541 | odr_or_derived_type_p (const_tree t) | |
542 | { | |
543 | do | |
544 | { | |
545 | if (odr_type_p (t)) | |
546 | return true; | |
547 | /* Function type is a tricky one. Basically we can consider it | |
548 | ODR derived if return type or any of the parameters is. | |
549 | We need to check all parameters because LTO streaming merges | |
550 | common types (such as void) and they are not considered ODR then. */ | |
551 | if (TREE_CODE (t) == FUNCTION_TYPE) | |
552 | { | |
553 | if (TYPE_METHOD_BASETYPE (t)) | |
554 | t = TYPE_METHOD_BASETYPE (t); | |
555 | else | |
556 | { | |
557 | if (TREE_TYPE (t) && odr_or_derived_type_p (TREE_TYPE (t))) | |
558 | return true; | |
559 | for (t = TYPE_ARG_TYPES (t); t; t = TREE_CHAIN (t)) | |
560 | if (odr_or_derived_type_p (TREE_VALUE (t))) | |
561 | return true; | |
562 | return false; | |
563 | } | |
564 | } | |
565 | else | |
566 | t = compound_type_base (t); | |
567 | } | |
568 | while (t); | |
569 | return t; | |
570 | } | |
571 | ||
0e1474e5 | 572 | /* Compare types T1 and T2 and return true if they are |
eefe9a99 JH |
573 | equivalent. */ |
574 | ||
575 | inline bool | |
67f58944 | 576 | odr_name_hasher::equal (const odr_type_d *o1, const tree_node *t2) |
eefe9a99 | 577 | { |
609570b4 | 578 | tree t1 = o1->type; |
eefe9a99 | 579 | |
549bcbd1 | 580 | gcc_checking_assert (main_odr_variant (t2) == t2); |
609570b4 JH |
581 | gcc_checking_assert (main_odr_variant (t1) == t1); |
582 | if (t1 == t2) | |
eefe9a99 JH |
583 | return true; |
584 | if (!in_lto_p) | |
585 | return false; | |
609570b4 JH |
586 | /* Check for anonymous namespaces. Those have !TREE_PUBLIC |
587 | on the corresponding TYPE_STUB_DECL. */ | |
e7a677ca JH |
588 | if ((type_with_linkage_p (t1) && type_in_anonymous_namespace_p (t1)) |
589 | || (type_with_linkage_p (t2) && type_in_anonymous_namespace_p (t2))) | |
609570b4 JH |
590 | return false; |
591 | gcc_checking_assert (DECL_ASSEMBLER_NAME (TYPE_NAME (t1))); | |
592 | gcc_checking_assert (DECL_ASSEMBLER_NAME (TYPE_NAME (t2))); | |
593 | return (DECL_ASSEMBLER_NAME (TYPE_NAME (t1)) | |
594 | == DECL_ASSEMBLER_NAME (TYPE_NAME (t2))); | |
595 | } | |
596 | ||
597 | /* Compare types T1 and T2 and return true if they are | |
598 | equivalent. */ | |
599 | ||
600 | inline bool | |
67f58944 | 601 | odr_vtable_hasher::equal (const odr_type_d *o1, const tree_node *t2) |
609570b4 JH |
602 | { |
603 | tree t1 = o1->type; | |
604 | ||
605 | gcc_checking_assert (main_odr_variant (t2) == t2); | |
606 | gcc_checking_assert (main_odr_variant (t1) == t1); | |
607 | gcc_checking_assert (in_lto_p); | |
608 | t1 = TYPE_MAIN_VARIANT (t1); | |
609 | t2 = TYPE_MAIN_VARIANT (t2); | |
610 | if (t1 == t2) | |
611 | return true; | |
612 | tree v1 = BINFO_VTABLE (TYPE_BINFO (t1)); | |
613 | tree v2 = BINFO_VTABLE (TYPE_BINFO (t2)); | |
614 | return (operand_equal_p (TREE_OPERAND (v1, 1), | |
615 | TREE_OPERAND (v2, 1), 0) | |
616 | && DECL_ASSEMBLER_NAME | |
617 | (TREE_OPERAND (TREE_OPERAND (v1, 0), 0)) | |
618 | == DECL_ASSEMBLER_NAME | |
619 | (TREE_OPERAND (TREE_OPERAND (v2, 0), 0))); | |
eefe9a99 JH |
620 | } |
621 | ||
0e1474e5 | 622 | /* Free ODR type V. */ |
eefe9a99 JH |
623 | |
624 | inline void | |
67f58944 | 625 | odr_name_hasher::remove (odr_type_d *v) |
eefe9a99 JH |
626 | { |
627 | v->bases.release (); | |
628 | v->derived_types.release (); | |
61a74079 | 629 | if (v->types_set) |
6e2830c3 | 630 | delete v->types_set; |
eefe9a99 JH |
631 | ggc_free (v); |
632 | } | |
633 | ||
d6ae9a6d | 634 | /* ODR type hash used to look up ODR type based on tree type node. */ |
eefe9a99 | 635 | |
609570b4 | 636 | typedef hash_table<odr_name_hasher> odr_hash_type; |
c203e8a7 | 637 | static odr_hash_type *odr_hash; |
609570b4 JH |
638 | typedef hash_table<odr_vtable_hasher> odr_vtable_hash_type; |
639 | static odr_vtable_hash_type *odr_vtable_hash; | |
eefe9a99 JH |
640 | |
641 | /* ODR types are also stored into ODR_TYPE vector to allow consistent | |
642 | walking. Bases appear before derived types. Vector is garbage collected | |
643 | so we won't end up visiting empty types. */ | |
644 | ||
645 | static GTY(()) vec <odr_type, va_gc> *odr_types_ptr; | |
646 | #define odr_types (*odr_types_ptr) | |
647 | ||
c7e1befa JH |
648 | /* Set TYPE_BINFO of TYPE and its variants to BINFO. */ |
649 | void | |
650 | set_type_binfo (tree type, tree binfo) | |
651 | { | |
652 | for (; type; type = TYPE_NEXT_VARIANT (type)) | |
653 | if (COMPLETE_TYPE_P (type)) | |
654 | TYPE_BINFO (type) = binfo; | |
655 | else | |
656 | gcc_assert (!TYPE_BINFO (type)); | |
657 | } | |
658 | ||
59a8062a | 659 | /* Compare T1 and T2 based on name or structure. */ |
c59f7203 JH |
660 | |
661 | static bool | |
88b16508 | 662 | odr_subtypes_equivalent_p (tree t1, tree t2, |
b32ca1df | 663 | hash_set<type_pair> *visited, |
6542950e | 664 | location_t loc1, location_t loc2) |
c59f7203 | 665 | { |
c59f7203 JH |
666 | |
667 | /* This can happen in incomplete types that should be handled earlier. */ | |
668 | gcc_assert (t1 && t2); | |
669 | ||
670 | t1 = main_odr_variant (t1); | |
671 | t2 = main_odr_variant (t2); | |
672 | if (t1 == t2) | |
673 | return true; | |
c59f7203 JH |
674 | |
675 | /* Anonymous namespace types must match exactly. */ | |
e7a677ca JH |
676 | if ((type_with_linkage_p (t1) && type_in_anonymous_namespace_p (t1)) |
677 | || (type_with_linkage_p (t2) && type_in_anonymous_namespace_p (t2))) | |
c59f7203 JH |
678 | return false; |
679 | ||
9d8fc086 | 680 | /* For ODR types be sure to compare their names. |
59a8062a | 681 | To support -Wno-odr-type-merging we allow one type to be non-ODR |
9d8fc086 | 682 | and other ODR even though it is a violation. */ |
609570b4 | 683 | if (types_odr_comparable (t1, t2, true)) |
c59f7203 | 684 | { |
609570b4 | 685 | if (!types_same_for_odr (t1, t2, true)) |
2c132d34 | 686 | return false; |
2265b6fe EB |
687 | /* Limit recursion: if subtypes are ODR types and we know that they are |
688 | same, be happy. We need to call get_odr_type on both subtypes since | |
689 | we don't know which among t1 and t2 defines the common ODR type and | |
690 | therefore which call will report the ODR violation, if any. */ | |
691 | if (!odr_type_p (t1) | |
692 | || !odr_type_p (t2) | |
59a8062a EB |
693 | || !COMPLETE_TYPE_P (t1) |
694 | || !COMPLETE_TYPE_P (t2) | |
2265b6fe EB |
695 | || (!get_odr_type (t1, true)->odr_violated |
696 | && !get_odr_type (t2, true)->odr_violated)) | |
2c132d34 | 697 | return true; |
c59f7203 | 698 | } |
1ee85ee1 | 699 | |
d6ae9a6d | 700 | /* Component types, builtins and possibly violating ODR types |
2c132d34 JH |
701 | have to be compared structurally. */ |
702 | if (TREE_CODE (t1) != TREE_CODE (t2)) | |
703 | return false; | |
32496fdd JH |
704 | if (AGGREGATE_TYPE_P (t1) |
705 | && (TYPE_NAME (t1) == NULL_TREE) != (TYPE_NAME (t2) == NULL_TREE)) | |
2c132d34 | 706 | return false; |
2c132d34 JH |
707 | |
708 | type_pair pair={t1,t2}; | |
709 | if (TYPE_UID (t1) > TYPE_UID (t2)) | |
710 | { | |
711 | pair.first = t2; | |
712 | pair.second = t1; | |
713 | } | |
714 | if (visited->add (pair)) | |
715 | return true; | |
6542950e | 716 | return odr_types_equivalent_p (t1, t2, false, NULL, visited, loc1, loc2); |
c59f7203 JH |
717 | } |
718 | ||
f8a1abf8 JH |
719 | /* Return true if DECL1 and DECL2 are identical methods. Consider |
720 | name equivalent to name.localalias.xyz. */ | |
721 | ||
722 | static bool | |
723 | methods_equal_p (tree decl1, tree decl2) | |
724 | { | |
725 | if (DECL_ASSEMBLER_NAME (decl1) == DECL_ASSEMBLER_NAME (decl2)) | |
726 | return true; | |
727 | const char sep = symbol_table::symbol_suffix_separator (); | |
728 | ||
729 | const char *name1 = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl1)); | |
730 | const char *ptr1 = strchr (name1, sep); | |
731 | int len1 = ptr1 ? ptr1 - name1 : strlen (name1); | |
732 | ||
733 | const char *name2 = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl2)); | |
734 | const char *ptr2 = strchr (name2, sep); | |
735 | int len2 = ptr2 ? ptr2 - name2 : strlen (name2); | |
736 | ||
737 | if (len1 != len2) | |
738 | return false; | |
739 | return !strncmp (name1, name2, len1); | |
740 | } | |
741 | ||
56b1f114 | 742 | /* Compare two virtual tables, PREVAILING and VTABLE and output ODR |
d6ae9a6d | 743 | violation warnings. */ |
56b1f114 JH |
744 | |
745 | void | |
746 | compare_virtual_tables (varpool_node *prevailing, varpool_node *vtable) | |
747 | { | |
748 | int n1, n2; | |
b1905808 | 749 | |
56b1f114 JH |
750 | if (DECL_VIRTUAL_P (prevailing->decl) != DECL_VIRTUAL_P (vtable->decl)) |
751 | { | |
752 | odr_violation_reported = true; | |
753 | if (DECL_VIRTUAL_P (prevailing->decl)) | |
754 | { | |
755 | varpool_node *tmp = prevailing; | |
756 | prevailing = vtable; | |
757 | vtable = tmp; | |
758 | } | |
88b16508 JH |
759 | if (warning_at (DECL_SOURCE_LOCATION |
760 | (TYPE_NAME (DECL_CONTEXT (vtable->decl))), | |
56b1f114 JH |
761 | OPT_Wodr, |
762 | "virtual table of type %qD violates one definition rule", | |
763 | DECL_CONTEXT (vtable->decl))) | |
764 | inform (DECL_SOURCE_LOCATION (prevailing->decl), | |
765 | "variable of same assembler name as the virtual table is " | |
766 | "defined in another translation unit"); | |
767 | return; | |
768 | } | |
769 | if (!prevailing->definition || !vtable->definition) | |
770 | return; | |
b1905808 JH |
771 | |
772 | /* If we do not stream ODR type info, do not bother to do useful compare. */ | |
773 | if (!TYPE_BINFO (DECL_CONTEXT (vtable->decl)) | |
774 | || !polymorphic_type_binfo_p (TYPE_BINFO (DECL_CONTEXT (vtable->decl)))) | |
775 | return; | |
776 | ||
777 | odr_type class_type = get_odr_type (DECL_CONTEXT (vtable->decl), true); | |
778 | ||
779 | if (class_type->odr_violated) | |
780 | return; | |
781 | ||
56b1f114 JH |
782 | for (n1 = 0, n2 = 0; true; n1++, n2++) |
783 | { | |
784 | struct ipa_ref *ref1, *ref2; | |
785 | bool end1, end2; | |
88b16508 | 786 | |
56b1f114 JH |
787 | end1 = !prevailing->iterate_reference (n1, ref1); |
788 | end2 = !vtable->iterate_reference (n2, ref2); | |
88b16508 JH |
789 | |
790 | /* !DECL_VIRTUAL_P means RTTI entry; | |
791 | We warn when RTTI is lost because non-RTTI previals; we silently | |
792 | accept the other case. */ | |
793 | while (!end2 | |
794 | && (end1 | |
f8a1abf8 JH |
795 | || (methods_equal_p (ref1->referred->decl, |
796 | ref2->referred->decl) | |
b1905808 JH |
797 | && TREE_CODE (ref1->referred->decl) == FUNCTION_DECL)) |
798 | && TREE_CODE (ref2->referred->decl) != FUNCTION_DECL) | |
56b1f114 | 799 | { |
b1905808 JH |
800 | if (!class_type->rtti_broken |
801 | && warning_at (DECL_SOURCE_LOCATION | |
802 | (TYPE_NAME (DECL_CONTEXT (vtable->decl))), | |
803 | OPT_Wodr, | |
804 | "virtual table of type %qD contains RTTI " | |
805 | "information", | |
806 | DECL_CONTEXT (vtable->decl))) | |
56b1f114 | 807 | { |
88b16508 JH |
808 | inform (DECL_SOURCE_LOCATION |
809 | (TYPE_NAME (DECL_CONTEXT (prevailing->decl))), | |
810 | "but is prevailed by one without from other translation " | |
811 | "unit"); | |
812 | inform (DECL_SOURCE_LOCATION | |
813 | (TYPE_NAME (DECL_CONTEXT (prevailing->decl))), | |
56b1f114 | 814 | "RTTI will not work on this type"); |
b1905808 | 815 | class_type->rtti_broken = true; |
56b1f114 JH |
816 | } |
817 | n2++; | |
818 | end2 = !vtable->iterate_reference (n2, ref2); | |
819 | } | |
88b16508 JH |
820 | while (!end1 |
821 | && (end2 | |
f8a1abf8 | 822 | || (methods_equal_p (ref2->referred->decl, ref1->referred->decl) |
b1905808 JH |
823 | && TREE_CODE (ref2->referred->decl) == FUNCTION_DECL)) |
824 | && TREE_CODE (ref1->referred->decl) != FUNCTION_DECL) | |
56b1f114 JH |
825 | { |
826 | n1++; | |
b1905808 | 827 | end1 = !prevailing->iterate_reference (n1, ref1); |
56b1f114 | 828 | } |
88b16508 JH |
829 | |
830 | /* Finished? */ | |
831 | if (end1 && end2) | |
832 | { | |
833 | /* Extra paranoia; compare the sizes. We do not have information | |
834 | about virtual inheritance offsets, so just be sure that these | |
609570b4 | 835 | match. |
88b16508 JH |
836 | Do this as very last check so the not very informative error |
837 | is not output too often. */ | |
838 | if (DECL_SIZE (prevailing->decl) != DECL_SIZE (vtable->decl)) | |
839 | { | |
b1905808 | 840 | class_type->odr_violated = true; |
88b16508 | 841 | if (warning_at (DECL_SOURCE_LOCATION |
b1905808 JH |
842 | (TYPE_NAME (DECL_CONTEXT (vtable->decl))), |
843 | OPT_Wodr, | |
88b16508 JH |
844 | "virtual table of type %qD violates " |
845 | "one definition rule ", | |
846 | DECL_CONTEXT (vtable->decl))) | |
847 | { | |
609570b4 | 848 | inform (DECL_SOURCE_LOCATION |
88b16508 JH |
849 | (TYPE_NAME (DECL_CONTEXT (prevailing->decl))), |
850 | "the conflicting type defined in another translation " | |
851 | "unit has virtual table of different size"); | |
852 | } | |
853 | } | |
854 | return; | |
855 | } | |
856 | ||
857 | if (!end1 && !end2) | |
858 | { | |
f8a1abf8 | 859 | if (methods_equal_p (ref1->referred->decl, ref2->referred->decl)) |
88b16508 JH |
860 | continue; |
861 | ||
b1905808 JH |
862 | class_type->odr_violated = true; |
863 | ||
88b16508 JH |
864 | /* If the loops above stopped on non-virtual pointer, we have |
865 | mismatch in RTTI information mangling. */ | |
b1905808 JH |
866 | if (TREE_CODE (ref1->referred->decl) != FUNCTION_DECL |
867 | && TREE_CODE (ref2->referred->decl) != FUNCTION_DECL) | |
88b16508 JH |
868 | { |
869 | if (warning_at (DECL_SOURCE_LOCATION | |
b1905808 JH |
870 | (TYPE_NAME (DECL_CONTEXT (vtable->decl))), |
871 | OPT_Wodr, | |
88b16508 JH |
872 | "virtual table of type %qD violates " |
873 | "one definition rule ", | |
874 | DECL_CONTEXT (vtable->decl))) | |
875 | { | |
609570b4 | 876 | inform (DECL_SOURCE_LOCATION |
88b16508 JH |
877 | (TYPE_NAME (DECL_CONTEXT (prevailing->decl))), |
878 | "the conflicting type defined in another translation " | |
609570b4 | 879 | "unit with different RTTI information"); |
88b16508 JH |
880 | } |
881 | return; | |
882 | } | |
883 | /* At this point both REF1 and REF2 points either to virtual table | |
884 | or virtual method. If one points to virtual table and other to | |
885 | method we can complain the same way as if one table was shorter | |
886 | than other pointing out the extra method. */ | |
88b16508 JH |
887 | if (TREE_CODE (ref1->referred->decl) |
888 | != TREE_CODE (ref2->referred->decl)) | |
889 | { | |
8813a647 | 890 | if (VAR_P (ref1->referred->decl)) |
88b16508 | 891 | end1 = true; |
8813a647 | 892 | else if (VAR_P (ref2->referred->decl)) |
88b16508 JH |
893 | end2 = true; |
894 | } | |
895 | } | |
896 | ||
b1905808 JH |
897 | class_type->odr_violated = true; |
898 | ||
88b16508 JH |
899 | /* Complain about size mismatch. Either we have too many virutal |
900 | functions or too many virtual table pointers. */ | |
56b1f114 JH |
901 | if (end1 || end2) |
902 | { | |
903 | if (end1) | |
904 | { | |
905 | varpool_node *tmp = prevailing; | |
906 | prevailing = vtable; | |
907 | vtable = tmp; | |
908 | ref1 = ref2; | |
909 | } | |
910 | if (warning_at (DECL_SOURCE_LOCATION | |
b1905808 JH |
911 | (TYPE_NAME (DECL_CONTEXT (vtable->decl))), |
912 | OPT_Wodr, | |
56b1f114 JH |
913 | "virtual table of type %qD violates " |
914 | "one definition rule", | |
915 | DECL_CONTEXT (vtable->decl))) | |
916 | { | |
88b16508 JH |
917 | if (TREE_CODE (ref1->referring->decl) == FUNCTION_DECL) |
918 | { | |
919 | inform (DECL_SOURCE_LOCATION | |
920 | (TYPE_NAME (DECL_CONTEXT (prevailing->decl))), | |
921 | "the conflicting type defined in another translation " | |
922 | "unit"); | |
923 | inform (DECL_SOURCE_LOCATION | |
924 | (TYPE_NAME (DECL_CONTEXT (ref1->referring->decl))), | |
925 | "contains additional virtual method %qD", | |
926 | ref1->referred->decl); | |
927 | } | |
928 | else | |
929 | { | |
930 | inform (DECL_SOURCE_LOCATION | |
931 | (TYPE_NAME (DECL_CONTEXT (prevailing->decl))), | |
932 | "the conflicting type defined in another translation " | |
026c3cfd | 933 | "unit has virtual table with more entries"); |
88b16508 | 934 | } |
56b1f114 JH |
935 | } |
936 | return; | |
937 | } | |
88b16508 JH |
938 | |
939 | /* And in the last case we have either mistmatch in between two virtual | |
940 | methods or two virtual table pointers. */ | |
941 | if (warning_at (DECL_SOURCE_LOCATION | |
b1905808 | 942 | (TYPE_NAME (DECL_CONTEXT (vtable->decl))), OPT_Wodr, |
88b16508 JH |
943 | "virtual table of type %qD violates " |
944 | "one definition rule ", | |
945 | DECL_CONTEXT (vtable->decl))) | |
56b1f114 | 946 | { |
88b16508 | 947 | if (TREE_CODE (ref1->referred->decl) == FUNCTION_DECL) |
56b1f114 | 948 | { |
609570b4 | 949 | inform (DECL_SOURCE_LOCATION |
56b1f114 JH |
950 | (TYPE_NAME (DECL_CONTEXT (prevailing->decl))), |
951 | "the conflicting type defined in another translation " | |
952 | "unit"); | |
88b16508 JH |
953 | gcc_assert (TREE_CODE (ref2->referred->decl) |
954 | == FUNCTION_DECL); | |
f8a1abf8 JH |
955 | inform (DECL_SOURCE_LOCATION |
956 | (ref1->referred->ultimate_alias_target ()->decl), | |
957 | "virtual method %qD", | |
958 | ref1->referred->ultimate_alias_target ()->decl); | |
959 | inform (DECL_SOURCE_LOCATION | |
960 | (ref2->referred->ultimate_alias_target ()->decl), | |
56b1f114 | 961 | "ought to match virtual method %qD but does not", |
f8a1abf8 | 962 | ref2->referred->ultimate_alias_target ()->decl); |
56b1f114 | 963 | } |
88b16508 | 964 | else |
609570b4 | 965 | inform (DECL_SOURCE_LOCATION |
88b16508 JH |
966 | (TYPE_NAME (DECL_CONTEXT (prevailing->decl))), |
967 | "the conflicting type defined in another translation " | |
026c3cfd | 968 | "unit has virtual table with different contents"); |
88b16508 | 969 | return; |
56b1f114 JH |
970 | } |
971 | } | |
972 | } | |
973 | ||
c59f7203 JH |
974 | /* Output ODR violation warning about T1 and T2 with REASON. |
975 | Display location of ST1 and ST2 if REASON speaks about field or | |
976 | method of the type. | |
977 | If WARN is false, do nothing. Set WARNED if warning was indeed | |
978 | output. */ | |
979 | ||
980 | void | |
981 | warn_odr (tree t1, tree t2, tree st1, tree st2, | |
982 | bool warn, bool *warned, const char *reason) | |
983 | { | |
984 | tree decl2 = TYPE_NAME (t2); | |
88b16508 JH |
985 | if (warned) |
986 | *warned = false; | |
c59f7203 | 987 | |
b1905808 | 988 | if (!warn || !TYPE_NAME(t1)) |
c59f7203 | 989 | return; |
b1905808 | 990 | |
eaeec5ec JH |
991 | /* ODR warnings are output druing LTO streaming; we must apply location |
992 | cache for potential warnings to be output correctly. */ | |
36ceb0e3 JH |
993 | if (lto_location_cache::current_cache) |
994 | lto_location_cache::current_cache->apply_location_cache (); | |
eaeec5ec | 995 | |
c59f7203 | 996 | if (!warning_at (DECL_SOURCE_LOCATION (TYPE_NAME (t1)), OPT_Wodr, |
6542950e | 997 | "type %qT violates the C++ One Definition Rule", |
c59f7203 JH |
998 | t1)) |
999 | return; | |
2c132d34 | 1000 | if (!st1 && !st2) |
c59f7203 | 1001 | ; |
2c132d34 JH |
1002 | /* For FIELD_DECL support also case where one of fields is |
1003 | NULL - this is used when the structures have mismatching number of | |
1004 | elements. */ | |
1005 | else if (!st1 || TREE_CODE (st1) == FIELD_DECL) | |
c59f7203 JH |
1006 | { |
1007 | inform (DECL_SOURCE_LOCATION (decl2), | |
1008 | "a different type is defined in another translation unit"); | |
2c132d34 JH |
1009 | if (!st1) |
1010 | { | |
1011 | st1 = st2; | |
1012 | st2 = NULL; | |
1013 | } | |
c59f7203 JH |
1014 | inform (DECL_SOURCE_LOCATION (st1), |
1015 | "the first difference of corresponding definitions is field %qD", | |
1016 | st1); | |
2c132d34 JH |
1017 | if (st2) |
1018 | decl2 = st2; | |
c59f7203 JH |
1019 | } |
1020 | else if (TREE_CODE (st1) == FUNCTION_DECL) | |
1021 | { | |
1022 | inform (DECL_SOURCE_LOCATION (decl2), | |
1023 | "a different type is defined in another translation unit"); | |
1024 | inform (DECL_SOURCE_LOCATION (st1), | |
1025 | "the first difference of corresponding definitions is method %qD", | |
1026 | st1); | |
1027 | decl2 = st2; | |
1028 | } | |
1029 | else | |
1030 | return; | |
1031 | inform (DECL_SOURCE_LOCATION (decl2), reason); | |
1032 | ||
1033 | if (warned) | |
1034 | *warned = true; | |
1035 | } | |
1036 | ||
6542950e JH |
1037 | /* Return ture if T1 and T2 are incompatible and we want to recusively |
1038 | dive into them from warn_type_mismatch to give sensible answer. */ | |
1039 | ||
1040 | static bool | |
1041 | type_mismatch_p (tree t1, tree t2) | |
1042 | { | |
1043 | if (odr_or_derived_type_p (t1) && odr_or_derived_type_p (t2) | |
1044 | && !odr_types_equivalent_p (t1, t2)) | |
1045 | return true; | |
1046 | return !types_compatible_p (t1, t2); | |
1047 | } | |
1048 | ||
1049 | ||
1050 | /* Types T1 and T2 was found to be incompatible in a context they can't | |
1051 | (either used to declare a symbol of same assembler name or unified by | |
1052 | ODR rule). We already output warning about this, but if possible, output | |
1053 | extra information on how the types mismatch. | |
1054 | ||
1055 | This is hard to do in general. We basically handle the common cases. | |
1056 | ||
1057 | If LOC1 and LOC2 are meaningful locations, use it in the case the types | |
1058 | themselves do no thave one.*/ | |
c59f7203 JH |
1059 | |
1060 | void | |
6542950e | 1061 | warn_types_mismatch (tree t1, tree t2, location_t loc1, location_t loc2) |
c59f7203 | 1062 | { |
6542950e JH |
1063 | /* Location of type is known only if it has TYPE_NAME and the name is |
1064 | TYPE_DECL. */ | |
1065 | location_t loc_t1 = TYPE_NAME (t1) && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL | |
1066 | ? DECL_SOURCE_LOCATION (TYPE_NAME (t1)) | |
1067 | : UNKNOWN_LOCATION; | |
1068 | location_t loc_t2 = TYPE_NAME (t2) && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL | |
1069 | ? DECL_SOURCE_LOCATION (TYPE_NAME (t2)) | |
1070 | : UNKNOWN_LOCATION; | |
1071 | bool loc_t2_useful = false; | |
1072 | ||
1073 | /* With LTO it is a common case that the location of both types match. | |
1074 | See if T2 has a location that is different from T1. If so, we will | |
1075 | inform user about the location. | |
1076 | Do not consider the location passed to us in LOC1/LOC2 as those are | |
1077 | already output. */ | |
1078 | if (loc_t2 > BUILTINS_LOCATION && loc_t2 != loc_t1) | |
1079 | { | |
1080 | if (loc_t1 <= BUILTINS_LOCATION) | |
1081 | loc_t2_useful = true; | |
1082 | else | |
1083 | { | |
1084 | expanded_location xloc1 = expand_location (loc_t1); | |
1085 | expanded_location xloc2 = expand_location (loc_t2); | |
1086 | ||
1087 | if (strcmp (xloc1.file, xloc2.file) | |
1088 | || xloc1.line != xloc2.line | |
1089 | || xloc1.column != xloc2.column) | |
1090 | loc_t2_useful = true; | |
1091 | } | |
1092 | } | |
1093 | ||
1094 | if (loc_t1 <= BUILTINS_LOCATION) | |
1095 | loc_t1 = loc1; | |
1096 | if (loc_t2 <= BUILTINS_LOCATION) | |
1097 | loc_t2 = loc2; | |
1098 | ||
1099 | location_t loc = loc_t1 <= BUILTINS_LOCATION ? loc_t2 : loc_t1; | |
1100 | ||
1101 | /* It is a quite common bug to reference anonymous namespace type in | |
1102 | non-anonymous namespace class. */ | |
1103 | if ((type_with_linkage_p (t1) && type_in_anonymous_namespace_p (t1)) | |
1104 | || (type_with_linkage_p (t2) && type_in_anonymous_namespace_p (t2))) | |
1105 | { | |
1106 | if (type_with_linkage_p (t1) && !type_in_anonymous_namespace_p (t1)) | |
1107 | { | |
1108 | std::swap (t1, t2); | |
1109 | std::swap (loc_t1, loc_t2); | |
1110 | } | |
1111 | gcc_assert (TYPE_NAME (t1) && TYPE_NAME (t2) | |
1112 | && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL | |
1113 | && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL); | |
1114 | /* Most of the time, the type names will match, do not be unnecesarily | |
1115 | verbose. */ | |
1116 | if (IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (t1))) | |
1117 | != IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (t2)))) | |
1118 | inform (loc_t1, | |
1119 | "type %qT defined in anonymous namespace can not match " | |
1120 | "type %qT across the translation unit boundary", | |
1121 | t1, t2); | |
1122 | else | |
1123 | inform (loc_t1, | |
1124 | "type %qT defined in anonymous namespace can not match " | |
1125 | "across the translation unit boundary", | |
1126 | t1); | |
1127 | if (loc_t2_useful) | |
1128 | inform (loc_t2, | |
1129 | "the incompatible type defined in another translation unit"); | |
1130 | return; | |
1131 | } | |
1132 | /* If types have mangled ODR names and they are different, it is most | |
1133 | informative to output those. | |
1134 | This also covers types defined in different namespaces. */ | |
b1905808 | 1135 | if (TYPE_NAME (t1) && TYPE_NAME (t2) |
6542950e JH |
1136 | && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL |
1137 | && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL | |
b1905808 JH |
1138 | && DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (t1)) |
1139 | && DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (t2)) | |
1140 | && DECL_ASSEMBLER_NAME (TYPE_NAME (t1)) | |
1141 | != DECL_ASSEMBLER_NAME (TYPE_NAME (t2))) | |
1142 | { | |
1143 | char *name1 = xstrdup (cplus_demangle | |
1144 | (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (TYPE_NAME (t1))), | |
1145 | DMGL_PARAMS | DMGL_ANSI | DMGL_TYPES)); | |
1146 | char *name2 = cplus_demangle | |
1147 | (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (TYPE_NAME (t2))), | |
1148 | DMGL_PARAMS | DMGL_ANSI | DMGL_TYPES); | |
1149 | if (name1 && name2 && strcmp (name1, name2)) | |
1150 | { | |
6542950e | 1151 | inform (loc_t1, |
2f6f187a | 1152 | "type name %qs should match type name %qs", |
b1905808 | 1153 | name1, name2); |
6542950e JH |
1154 | if (loc_t2_useful) |
1155 | inform (loc_t2, | |
1156 | "the incompatible type is defined here"); | |
b1905808 JH |
1157 | free (name1); |
1158 | return; | |
1159 | } | |
1160 | free (name1); | |
1161 | } | |
6542950e | 1162 | /* A tricky case are compound types. Often they appear the same in source |
b1905808 JH |
1163 | code and the mismatch is dragged in by type they are build from. |
1164 | Look for those differences in subtypes and try to be informative. In other | |
1165 | cases just output nothing because the source code is probably different | |
1166 | and in this case we already output a all necessary info. */ | |
c59f7203 | 1167 | if (!TYPE_NAME (t1) || !TYPE_NAME (t2)) |
b1905808 JH |
1168 | { |
1169 | if (TREE_CODE (t1) == TREE_CODE (t2)) | |
1170 | { | |
b1905808 JH |
1171 | if (TREE_CODE (t1) == ARRAY_TYPE |
1172 | && COMPLETE_TYPE_P (t1) && COMPLETE_TYPE_P (t2)) | |
1173 | { | |
1174 | tree i1 = TYPE_DOMAIN (t1); | |
1175 | tree i2 = TYPE_DOMAIN (t2); | |
1176 | ||
1177 | if (i1 && i2 | |
1178 | && TYPE_MAX_VALUE (i1) | |
1179 | && TYPE_MAX_VALUE (i2) | |
1180 | && !operand_equal_p (TYPE_MAX_VALUE (i1), | |
1181 | TYPE_MAX_VALUE (i2), 0)) | |
1182 | { | |
6542950e | 1183 | inform (loc, |
b1905808 JH |
1184 | "array types have different bounds"); |
1185 | return; | |
1186 | } | |
1187 | } | |
1188 | if ((POINTER_TYPE_P (t1) || TREE_CODE (t1) == ARRAY_TYPE) | |
6542950e JH |
1189 | && type_mismatch_p (TREE_TYPE (t1), TREE_TYPE (t2))) |
1190 | warn_types_mismatch (TREE_TYPE (t1), TREE_TYPE (t2), loc_t1, loc_t2); | |
b1905808 JH |
1191 | else if (TREE_CODE (t1) == METHOD_TYPE |
1192 | || TREE_CODE (t1) == FUNCTION_TYPE) | |
1193 | { | |
ad5bc324 | 1194 | tree parms1 = NULL, parms2 = NULL; |
b1905808 JH |
1195 | int count = 1; |
1196 | ||
6542950e | 1197 | if (type_mismatch_p (TREE_TYPE (t1), TREE_TYPE (t2))) |
b1905808 | 1198 | { |
6542950e JH |
1199 | inform (loc, "return value type mismatch"); |
1200 | warn_types_mismatch (TREE_TYPE (t1), TREE_TYPE (t2), loc_t1, | |
1201 | loc_t2); | |
b1905808 JH |
1202 | return; |
1203 | } | |
ad5bc324 JH |
1204 | if (prototype_p (t1) && prototype_p (t2)) |
1205 | for (parms1 = TYPE_ARG_TYPES (t1), parms2 = TYPE_ARG_TYPES (t2); | |
1206 | parms1 && parms2; | |
1207 | parms1 = TREE_CHAIN (parms1), parms2 = TREE_CHAIN (parms2), | |
1208 | count++) | |
1209 | { | |
6542950e | 1210 | if (type_mismatch_p (TREE_VALUE (parms1), TREE_VALUE (parms2))) |
ad5bc324 JH |
1211 | { |
1212 | if (count == 1 && TREE_CODE (t1) == METHOD_TYPE) | |
6542950e | 1213 | inform (loc, |
ad5bc324 JH |
1214 | "implicit this pointer type mismatch"); |
1215 | else | |
6542950e | 1216 | inform (loc, |
ad5bc324 JH |
1217 | "type mismatch in parameter %i", |
1218 | count - (TREE_CODE (t1) == METHOD_TYPE)); | |
1219 | warn_types_mismatch (TREE_VALUE (parms1), | |
6542950e JH |
1220 | TREE_VALUE (parms2), |
1221 | loc_t1, loc_t2); | |
ad5bc324 JH |
1222 | return; |
1223 | } | |
1224 | } | |
b1905808 JH |
1225 | if (parms1 || parms2) |
1226 | { | |
6542950e | 1227 | inform (loc, |
b1905808 JH |
1228 | "types have different parameter counts"); |
1229 | return; | |
1230 | } | |
1231 | } | |
1232 | } | |
1233 | return; | |
1234 | } | |
6542950e JH |
1235 | |
1236 | if (types_odr_comparable (t1, t2, true) | |
1237 | && types_same_for_odr (t1, t2, true)) | |
1238 | inform (loc_t1, | |
d8c9bc36 | 1239 | "type %qT itself violates the C++ One Definition Rule", t1); |
6542950e JH |
1240 | /* Prevent pointless warnings like "struct aa" should match "struct aa". */ |
1241 | else if (TYPE_NAME (t1) == TYPE_NAME (t2) | |
1242 | && TREE_CODE (t1) == TREE_CODE (t2) && !loc_t2_useful) | |
c59f7203 | 1243 | return; |
c59f7203 | 1244 | else |
6542950e | 1245 | inform (loc_t1, "type %qT should match type %qT", |
c59f7203 | 1246 | t1, t2); |
6542950e JH |
1247 | if (loc_t2_useful) |
1248 | inform (loc_t2, "the incompatible type is defined here"); | |
c59f7203 JH |
1249 | } |
1250 | ||
1251 | /* Compare T1 and T2, report ODR violations if WARN is true and set | |
1252 | WARNED to true if anything is reported. Return true if types match. | |
1253 | If true is returned, the types are also compatible in the sense of | |
6542950e JH |
1254 | gimple_canonical_types_compatible_p. |
1255 | If LOC1 and LOC2 is not UNKNOWN_LOCATION it may be used to output a warning | |
1256 | about the type if the type itself do not have location. */ | |
c59f7203 JH |
1257 | |
1258 | static bool | |
7d8adcba | 1259 | odr_types_equivalent_p (tree t1, tree t2, bool warn, bool *warned, |
b32ca1df | 1260 | hash_set<type_pair> *visited, |
6542950e | 1261 | location_t loc1, location_t loc2) |
c59f7203 JH |
1262 | { |
1263 | /* Check first for the obvious case of pointer identity. */ | |
1264 | if (t1 == t2) | |
1265 | return true; | |
e7a677ca JH |
1266 | gcc_assert (!type_with_linkage_p (t1) || !type_in_anonymous_namespace_p (t1)); |
1267 | gcc_assert (!type_with_linkage_p (t2) || !type_in_anonymous_namespace_p (t2)); | |
c59f7203 JH |
1268 | |
1269 | /* Can't be the same type if the types don't have the same code. */ | |
1270 | if (TREE_CODE (t1) != TREE_CODE (t2)) | |
1271 | { | |
1272 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1273 | G_("a different type is defined in another translation unit")); | |
1274 | return false; | |
1275 | } | |
1276 | ||
1277 | if (TYPE_QUALS (t1) != TYPE_QUALS (t2)) | |
1278 | { | |
1279 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1280 | G_("a type with different qualifiers is defined in another " | |
1281 | "translation unit")); | |
1282 | return false; | |
1283 | } | |
1284 | ||
259d29e3 JH |
1285 | if ((type_with_linkage_p (t1) && type_in_anonymous_namespace_p (t1)) |
1286 | || (type_with_linkage_p (t2) && type_in_anonymous_namespace_p (t2))) | |
1287 | { | |
1288 | /* We can not trip this when comparing ODR types, only when trying to | |
1289 | match different ODR derivations from different declarations. | |
1290 | So WARN should be always false. */ | |
1291 | gcc_assert (!warn); | |
1292 | return false; | |
1293 | } | |
1294 | ||
c59f7203 JH |
1295 | if (comp_type_attributes (t1, t2) != 1) |
1296 | { | |
1297 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
ad5bc324 | 1298 | G_("a type with different attributes " |
c59f7203 JH |
1299 | "is defined in another translation unit")); |
1300 | return false; | |
1301 | } | |
1302 | ||
88b16508 JH |
1303 | if (TREE_CODE (t1) == ENUMERAL_TYPE |
1304 | && TYPE_VALUES (t1) && TYPE_VALUES (t2)) | |
c59f7203 JH |
1305 | { |
1306 | tree v1, v2; | |
1307 | for (v1 = TYPE_VALUES (t1), v2 = TYPE_VALUES (t2); | |
1308 | v1 && v2 ; v1 = TREE_CHAIN (v1), v2 = TREE_CHAIN (v2)) | |
1309 | { | |
1310 | if (TREE_PURPOSE (v1) != TREE_PURPOSE (v2)) | |
1311 | { | |
1312 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1313 | G_("an enum with different value name" | |
1314 | " is defined in another translation unit")); | |
1315 | return false; | |
1316 | } | |
1317 | if (TREE_VALUE (v1) != TREE_VALUE (v2) | |
1318 | && !operand_equal_p (DECL_INITIAL (TREE_VALUE (v1)), | |
1319 | DECL_INITIAL (TREE_VALUE (v2)), 0)) | |
1320 | { | |
1321 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1322 | G_("an enum with different values is defined" | |
1323 | " in another translation unit")); | |
1324 | return false; | |
1325 | } | |
1326 | } | |
1327 | if (v1 || v2) | |
1328 | { | |
1329 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1330 | G_("an enum with mismatching number of values " | |
1331 | "is defined in another translation unit")); | |
1332 | return false; | |
1333 | } | |
1334 | } | |
1335 | ||
1336 | /* Non-aggregate types can be handled cheaply. */ | |
1337 | if (INTEGRAL_TYPE_P (t1) | |
1338 | || SCALAR_FLOAT_TYPE_P (t1) | |
1339 | || FIXED_POINT_TYPE_P (t1) | |
1340 | || TREE_CODE (t1) == VECTOR_TYPE | |
1341 | || TREE_CODE (t1) == COMPLEX_TYPE | |
1342 | || TREE_CODE (t1) == OFFSET_TYPE | |
1343 | || POINTER_TYPE_P (t1)) | |
1344 | { | |
1345 | if (TYPE_PRECISION (t1) != TYPE_PRECISION (t2)) | |
1346 | { | |
1347 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1348 | G_("a type with different precision is defined " | |
1349 | "in another translation unit")); | |
1350 | return false; | |
1351 | } | |
1352 | if (TYPE_UNSIGNED (t1) != TYPE_UNSIGNED (t2)) | |
1353 | { | |
1354 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1355 | G_("a type with different signedness is defined " | |
1356 | "in another translation unit")); | |
1357 | return false; | |
1358 | } | |
1359 | ||
1360 | if (TREE_CODE (t1) == INTEGER_TYPE | |
1361 | && TYPE_STRING_FLAG (t1) != TYPE_STRING_FLAG (t2)) | |
1362 | { | |
1363 | /* char WRT uint_8? */ | |
1364 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1365 | G_("a different type is defined in another " | |
1366 | "translation unit")); | |
1367 | return false; | |
1368 | } | |
1369 | ||
1370 | /* For canonical type comparisons we do not want to build SCCs | |
1371 | so we cannot compare pointed-to types. But we can, for now, | |
1372 | require the same pointed-to type kind and match what | |
1373 | useless_type_conversion_p would do. */ | |
1374 | if (POINTER_TYPE_P (t1)) | |
1375 | { | |
1376 | if (TYPE_ADDR_SPACE (TREE_TYPE (t1)) | |
1377 | != TYPE_ADDR_SPACE (TREE_TYPE (t2))) | |
1378 | { | |
1379 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1380 | G_("it is defined as a pointer in different address " | |
1381 | "space in another translation unit")); | |
1382 | return false; | |
1383 | } | |
1384 | ||
6542950e JH |
1385 | if (!odr_subtypes_equivalent_p (TREE_TYPE (t1), TREE_TYPE (t2), |
1386 | visited, loc1, loc2)) | |
c59f7203 JH |
1387 | { |
1388 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1389 | G_("it is defined as a pointer to different type " | |
1390 | "in another translation unit")); | |
1391 | if (warn && warned) | |
6542950e JH |
1392 | warn_types_mismatch (TREE_TYPE (t1), TREE_TYPE (t2), |
1393 | loc1, loc2); | |
c59f7203 JH |
1394 | return false; |
1395 | } | |
1396 | } | |
1397 | ||
c59f7203 | 1398 | if ((TREE_CODE (t1) == VECTOR_TYPE || TREE_CODE (t1) == COMPLEX_TYPE) |
6542950e JH |
1399 | && !odr_subtypes_equivalent_p (TREE_TYPE (t1), TREE_TYPE (t2), |
1400 | visited, loc1, loc2)) | |
c59f7203 JH |
1401 | { |
1402 | /* Probably specific enough. */ | |
1403 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1404 | G_("a different type is defined " | |
1405 | "in another translation unit")); | |
1406 | if (warn && warned) | |
6542950e | 1407 | warn_types_mismatch (TREE_TYPE (t1), TREE_TYPE (t2), loc1, loc2); |
c59f7203 JH |
1408 | return false; |
1409 | } | |
c59f7203 | 1410 | } |
c59f7203 | 1411 | /* Do type-specific comparisons. */ |
2c132d34 | 1412 | else switch (TREE_CODE (t1)) |
c59f7203 JH |
1413 | { |
1414 | case ARRAY_TYPE: | |
1415 | { | |
1416 | /* Array types are the same if the element types are the same and | |
1417 | the number of elements are the same. */ | |
6542950e JH |
1418 | if (!odr_subtypes_equivalent_p (TREE_TYPE (t1), TREE_TYPE (t2), |
1419 | visited, loc1, loc2)) | |
c59f7203 JH |
1420 | { |
1421 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1422 | G_("a different type is defined in another " | |
1423 | "translation unit")); | |
1424 | if (warn && warned) | |
6542950e | 1425 | warn_types_mismatch (TREE_TYPE (t1), TREE_TYPE (t2), loc1, loc2); |
c59f7203 JH |
1426 | } |
1427 | gcc_assert (TYPE_STRING_FLAG (t1) == TYPE_STRING_FLAG (t2)); | |
1428 | gcc_assert (TYPE_NONALIASED_COMPONENT (t1) | |
1429 | == TYPE_NONALIASED_COMPONENT (t2)); | |
1430 | ||
1431 | tree i1 = TYPE_DOMAIN (t1); | |
1432 | tree i2 = TYPE_DOMAIN (t2); | |
1433 | ||
1434 | /* For an incomplete external array, the type domain can be | |
1435 | NULL_TREE. Check this condition also. */ | |
1436 | if (i1 == NULL_TREE || i2 == NULL_TREE) | |
1437 | return true; | |
1438 | ||
1439 | tree min1 = TYPE_MIN_VALUE (i1); | |
1440 | tree min2 = TYPE_MIN_VALUE (i2); | |
1441 | tree max1 = TYPE_MAX_VALUE (i1); | |
1442 | tree max2 = TYPE_MAX_VALUE (i2); | |
1443 | ||
1444 | /* In C++, minimums should be always 0. */ | |
1445 | gcc_assert (min1 == min2); | |
1446 | if (!operand_equal_p (max1, max2, 0)) | |
1447 | { | |
1448 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1449 | G_("an array of different size is defined " | |
1450 | "in another translation unit")); | |
1451 | return false; | |
1452 | } | |
c59f7203 | 1453 | } |
2c132d34 | 1454 | break; |
c59f7203 JH |
1455 | |
1456 | case METHOD_TYPE: | |
1457 | case FUNCTION_TYPE: | |
1458 | /* Function types are the same if the return type and arguments types | |
1459 | are the same. */ | |
6542950e JH |
1460 | if (!odr_subtypes_equivalent_p (TREE_TYPE (t1), TREE_TYPE (t2), |
1461 | visited, loc1, loc2)) | |
c59f7203 JH |
1462 | { |
1463 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1464 | G_("has different return value " | |
1465 | "in another translation unit")); | |
1466 | if (warn && warned) | |
6542950e | 1467 | warn_types_mismatch (TREE_TYPE (t1), TREE_TYPE (t2), loc1, loc2); |
c59f7203 JH |
1468 | return false; |
1469 | } | |
1470 | ||
ad5bc324 JH |
1471 | if (TYPE_ARG_TYPES (t1) == TYPE_ARG_TYPES (t2) |
1472 | || !prototype_p (t1) || !prototype_p (t2)) | |
c59f7203 JH |
1473 | return true; |
1474 | else | |
1475 | { | |
1476 | tree parms1, parms2; | |
1477 | ||
1478 | for (parms1 = TYPE_ARG_TYPES (t1), parms2 = TYPE_ARG_TYPES (t2); | |
1479 | parms1 && parms2; | |
1480 | parms1 = TREE_CHAIN (parms1), parms2 = TREE_CHAIN (parms2)) | |
1481 | { | |
1482 | if (!odr_subtypes_equivalent_p | |
6542950e JH |
1483 | (TREE_VALUE (parms1), TREE_VALUE (parms2), visited, |
1484 | loc1, loc2)) | |
c59f7203 JH |
1485 | { |
1486 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1487 | G_("has different parameters in another " | |
1488 | "translation unit")); | |
1489 | if (warn && warned) | |
1490 | warn_types_mismatch (TREE_VALUE (parms1), | |
6542950e | 1491 | TREE_VALUE (parms2), loc1, loc2); |
c59f7203 JH |
1492 | return false; |
1493 | } | |
1494 | } | |
1495 | ||
1496 | if (parms1 || parms2) | |
1497 | { | |
1498 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1499 | G_("has different parameters " | |
1500 | "in another translation unit")); | |
1501 | return false; | |
1502 | } | |
1503 | ||
1504 | return true; | |
1505 | } | |
1506 | ||
1507 | case RECORD_TYPE: | |
1508 | case UNION_TYPE: | |
1509 | case QUAL_UNION_TYPE: | |
1510 | { | |
1511 | tree f1, f2; | |
1512 | ||
1513 | /* For aggregate types, all the fields must be the same. */ | |
1514 | if (COMPLETE_TYPE_P (t1) && COMPLETE_TYPE_P (t2)) | |
1515 | { | |
b1905808 JH |
1516 | if (TYPE_BINFO (t1) && TYPE_BINFO (t2) |
1517 | && polymorphic_type_binfo_p (TYPE_BINFO (t1)) | |
1518 | != polymorphic_type_binfo_p (TYPE_BINFO (t2))) | |
1519 | { | |
1520 | if (polymorphic_type_binfo_p (TYPE_BINFO (t1))) | |
1521 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1522 | G_("a type defined in another translation unit " | |
1523 | "is not polymorphic")); | |
1524 | else | |
1525 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1526 | G_("a type defined in another translation unit " | |
1527 | "is polymorphic")); | |
1528 | return false; | |
1529 | } | |
c59f7203 JH |
1530 | for (f1 = TYPE_FIELDS (t1), f2 = TYPE_FIELDS (t2); |
1531 | f1 || f2; | |
1532 | f1 = TREE_CHAIN (f1), f2 = TREE_CHAIN (f2)) | |
1533 | { | |
1534 | /* Skip non-fields. */ | |
1535 | while (f1 && TREE_CODE (f1) != FIELD_DECL) | |
1536 | f1 = TREE_CHAIN (f1); | |
1537 | while (f2 && TREE_CODE (f2) != FIELD_DECL) | |
1538 | f2 = TREE_CHAIN (f2); | |
1539 | if (!f1 || !f2) | |
1540 | break; | |
88b16508 JH |
1541 | if (DECL_VIRTUAL_P (f1) != DECL_VIRTUAL_P (f2)) |
1542 | { | |
1543 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1544 | G_("a type with different virtual table pointers" | |
1545 | " is defined in another translation unit")); | |
1546 | return false; | |
1547 | } | |
c59f7203 | 1548 | if (DECL_ARTIFICIAL (f1) != DECL_ARTIFICIAL (f2)) |
88b16508 JH |
1549 | { |
1550 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1551 | G_("a type with different bases is defined " | |
1552 | "in another translation unit")); | |
1553 | return false; | |
1554 | } | |
c59f7203 JH |
1555 | if (DECL_NAME (f1) != DECL_NAME (f2) |
1556 | && !DECL_ARTIFICIAL (f1)) | |
1557 | { | |
1558 | warn_odr (t1, t2, f1, f2, warn, warned, | |
1559 | G_("a field with different name is defined " | |
1560 | "in another translation unit")); | |
1561 | return false; | |
1562 | } | |
88b16508 | 1563 | if (!odr_subtypes_equivalent_p (TREE_TYPE (f1), |
6542950e JH |
1564 | TREE_TYPE (f2), visited, |
1565 | loc1, loc2)) | |
c59f7203 | 1566 | { |
88b16508 JH |
1567 | /* Do not warn about artificial fields and just go into |
1568 | generic field mismatch warning. */ | |
c59f7203 JH |
1569 | if (DECL_ARTIFICIAL (f1)) |
1570 | break; | |
1571 | ||
1572 | warn_odr (t1, t2, f1, f2, warn, warned, | |
1573 | G_("a field of same name but different type " | |
1574 | "is defined in another translation unit")); | |
1575 | if (warn && warned) | |
6542950e | 1576 | warn_types_mismatch (TREE_TYPE (f1), TREE_TYPE (f2), loc1, loc2); |
c59f7203 JH |
1577 | return false; |
1578 | } | |
1579 | if (!gimple_compare_field_offset (f1, f2)) | |
1580 | { | |
88b16508 JH |
1581 | /* Do not warn about artificial fields and just go into |
1582 | generic field mismatch warning. */ | |
c59f7203 JH |
1583 | if (DECL_ARTIFICIAL (f1)) |
1584 | break; | |
88b16508 | 1585 | warn_odr (t1, t2, f1, f2, warn, warned, |
d8c9bc36 | 1586 | G_("fields have different layout " |
c59f7203 JH |
1587 | "in another translation unit")); |
1588 | return false; | |
1589 | } | |
1590 | gcc_assert (DECL_NONADDRESSABLE_P (f1) | |
1591 | == DECL_NONADDRESSABLE_P (f2)); | |
1592 | } | |
1593 | ||
1594 | /* If one aggregate has more fields than the other, they | |
1595 | are not the same. */ | |
1596 | if (f1 || f2) | |
1597 | { | |
88b16508 JH |
1598 | if ((f1 && DECL_VIRTUAL_P (f1)) || (f2 && DECL_VIRTUAL_P (f2))) |
1599 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1600 | G_("a type with different virtual table pointers" | |
1601 | " is defined in another translation unit")); | |
b1905808 JH |
1602 | else if ((f1 && DECL_ARTIFICIAL (f1)) |
1603 | || (f2 && DECL_ARTIFICIAL (f2))) | |
88b16508 JH |
1604 | warn_odr (t1, t2, NULL, NULL, warn, warned, |
1605 | G_("a type with different bases is defined " | |
1606 | "in another translation unit")); | |
2c132d34 JH |
1607 | else |
1608 | warn_odr (t1, t2, f1, f2, warn, warned, | |
88b16508 | 1609 | G_("a type with different number of fields " |
2c132d34 JH |
1610 | "is defined in another translation unit")); |
1611 | ||
c59f7203 JH |
1612 | return false; |
1613 | } | |
c59f7203 | 1614 | } |
2c132d34 | 1615 | break; |
c59f7203 | 1616 | } |
2c132d34 | 1617 | case VOID_TYPE: |
bb83a43d | 1618 | case NULLPTR_TYPE: |
2c132d34 | 1619 | break; |
c59f7203 JH |
1620 | |
1621 | default: | |
2c132d34 | 1622 | debug_tree (t1); |
c59f7203 JH |
1623 | gcc_unreachable (); |
1624 | } | |
2c132d34 JH |
1625 | |
1626 | /* Those are better to come last as they are utterly uninformative. */ | |
1627 | if (TYPE_SIZE (t1) && TYPE_SIZE (t2) | |
1628 | && !operand_equal_p (TYPE_SIZE (t1), TYPE_SIZE (t2), 0)) | |
1629 | { | |
1630 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1631 | G_("a type with different size " | |
1632 | "is defined in another translation unit")); | |
1633 | return false; | |
1634 | } | |
1635 | if (COMPLETE_TYPE_P (t1) && COMPLETE_TYPE_P (t2) | |
1636 | && TYPE_ALIGN (t1) != TYPE_ALIGN (t2)) | |
1637 | { | |
1638 | warn_odr (t1, t2, NULL, NULL, warn, warned, | |
1639 | G_("a type with different alignment " | |
1640 | "is defined in another translation unit")); | |
1641 | return false; | |
1642 | } | |
1643 | gcc_assert (!TYPE_SIZE_UNIT (t1) || !TYPE_SIZE_UNIT (t2) | |
1644 | || operand_equal_p (TYPE_SIZE_UNIT (t1), | |
1645 | TYPE_SIZE_UNIT (t2), 0)); | |
1646 | return true; | |
c59f7203 JH |
1647 | } |
1648 | ||
259d29e3 JH |
1649 | /* Return true if TYPE1 and TYPE2 are equivalent for One Definition Rule. */ |
1650 | ||
1651 | bool | |
1652 | odr_types_equivalent_p (tree type1, tree type2) | |
1653 | { | |
b2b29377 MM |
1654 | gcc_checking_assert (odr_or_derived_type_p (type1) |
1655 | && odr_or_derived_type_p (type2)); | |
259d29e3 | 1656 | |
b2b29377 | 1657 | hash_set<type_pair> visited; |
259d29e3 | 1658 | return odr_types_equivalent_p (type1, type2, false, NULL, |
6542950e | 1659 | &visited, UNKNOWN_LOCATION, UNKNOWN_LOCATION); |
259d29e3 JH |
1660 | } |
1661 | ||
61a74079 JH |
1662 | /* TYPE is equivalent to VAL by ODR, but its tree representation differs |
1663 | from VAL->type. This may happen in LTO where tree merging did not merge | |
609570b4 JH |
1664 | all variants of the same type or due to ODR violation. |
1665 | ||
1666 | Analyze and report ODR violations and add type to duplicate list. | |
1667 | If TYPE is more specified than VAL->type, prevail VAL->type. Also if | |
1668 | this is first time we see definition of a class return true so the | |
1669 | base types are analyzed. */ | |
61a74079 | 1670 | |
549bcbd1 | 1671 | static bool |
61a74079 JH |
1672 | add_type_duplicate (odr_type val, tree type) |
1673 | { | |
549bcbd1 | 1674 | bool build_bases = false; |
609570b4 | 1675 | bool prevail = false; |
b1905808 | 1676 | bool odr_must_violate = false; |
609570b4 | 1677 | |
61a74079 | 1678 | if (!val->types_set) |
6e2830c3 | 1679 | val->types_set = new hash_set<tree>; |
61a74079 | 1680 | |
730c436a JH |
1681 | /* Chose polymorphic type as leader (this happens only in case of ODR |
1682 | violations. */ | |
1683 | if ((TREE_CODE (type) == RECORD_TYPE && TYPE_BINFO (type) | |
1684 | && polymorphic_type_binfo_p (TYPE_BINFO (type))) | |
1685 | && (TREE_CODE (val->type) != RECORD_TYPE || !TYPE_BINFO (val->type) | |
1686 | || !polymorphic_type_binfo_p (TYPE_BINFO (val->type)))) | |
1687 | { | |
1688 | prevail = true; | |
1689 | build_bases = true; | |
1690 | } | |
549bcbd1 | 1691 | /* Always prefer complete type to be the leader. */ |
730c436a | 1692 | else if (!COMPLETE_TYPE_P (val->type) && COMPLETE_TYPE_P (type)) |
609570b4 JH |
1693 | { |
1694 | prevail = true; | |
1695 | build_bases = TYPE_BINFO (type); | |
1696 | } | |
88b16508 JH |
1697 | else if (COMPLETE_TYPE_P (val->type) && !COMPLETE_TYPE_P (type)) |
1698 | ; | |
1699 | else if (TREE_CODE (val->type) == ENUMERAL_TYPE | |
1700 | && TREE_CODE (type) == ENUMERAL_TYPE | |
1701 | && !TYPE_VALUES (val->type) && TYPE_VALUES (type)) | |
609570b4 | 1702 | prevail = true; |
88b16508 JH |
1703 | else if (TREE_CODE (val->type) == RECORD_TYPE |
1704 | && TREE_CODE (type) == RECORD_TYPE | |
1705 | && TYPE_BINFO (type) && !TYPE_BINFO (val->type)) | |
609570b4 JH |
1706 | { |
1707 | gcc_assert (!val->bases.length ()); | |
1708 | build_bases = true; | |
1709 | prevail = true; | |
1710 | } | |
88b16508 | 1711 | |
609570b4 | 1712 | if (prevail) |
6b4db501 | 1713 | std::swap (val->type, type); |
549bcbd1 | 1714 | |
609570b4 JH |
1715 | val->types_set->add (type); |
1716 | ||
1717 | /* If we now have a mangled name, be sure to record it to val->type | |
1718 | so ODR hash can work. */ | |
1719 | ||
1720 | if (can_be_name_hashed_p (type) && !can_be_name_hashed_p (val->type)) | |
1721 | SET_DECL_ASSEMBLER_NAME (TYPE_NAME (val->type), | |
1722 | DECL_ASSEMBLER_NAME (TYPE_NAME (type))); | |
1723 | ||
1724 | bool merge = true; | |
1725 | bool base_mismatch = false; | |
1726 | unsigned int i; | |
1727 | bool warned = false; | |
b32ca1df | 1728 | hash_set<type_pair> visited; |
609570b4 JH |
1729 | |
1730 | gcc_assert (in_lto_p); | |
1731 | vec_safe_push (val->types, type); | |
1732 | ||
b1905808 | 1733 | /* If both are class types, compare the bases. */ |
609570b4 JH |
1734 | if (COMPLETE_TYPE_P (type) && COMPLETE_TYPE_P (val->type) |
1735 | && TREE_CODE (val->type) == RECORD_TYPE | |
1736 | && TREE_CODE (type) == RECORD_TYPE | |
1737 | && TYPE_BINFO (val->type) && TYPE_BINFO (type)) | |
1738 | { | |
1739 | if (BINFO_N_BASE_BINFOS (TYPE_BINFO (type)) | |
1740 | != BINFO_N_BASE_BINFOS (TYPE_BINFO (val->type))) | |
1741 | { | |
b1905808 | 1742 | if (!flag_ltrans && !warned && !val->odr_violated) |
609570b4 JH |
1743 | { |
1744 | tree extra_base; | |
1745 | warn_odr (type, val->type, NULL, NULL, !warned, &warned, | |
1746 | "a type with the same name but different " | |
1747 | "number of polymorphic bases is " | |
1748 | "defined in another translation unit"); | |
b1905808 JH |
1749 | if (warned) |
1750 | { | |
1751 | if (BINFO_N_BASE_BINFOS (TYPE_BINFO (type)) | |
1752 | > BINFO_N_BASE_BINFOS (TYPE_BINFO (val->type))) | |
1753 | extra_base = BINFO_BASE_BINFO | |
1754 | (TYPE_BINFO (type), | |
1755 | BINFO_N_BASE_BINFOS (TYPE_BINFO (val->type))); | |
1756 | else | |
1757 | extra_base = BINFO_BASE_BINFO | |
1758 | (TYPE_BINFO (val->type), | |
1759 | BINFO_N_BASE_BINFOS (TYPE_BINFO (type))); | |
1760 | tree extra_base_type = BINFO_TYPE (extra_base); | |
1761 | inform (DECL_SOURCE_LOCATION (TYPE_NAME (extra_base_type)), | |
1762 | "the extra base is defined here"); | |
1763 | } | |
609570b4 JH |
1764 | } |
1765 | base_mismatch = true; | |
1766 | } | |
1767 | else | |
1768 | for (i = 0; i < BINFO_N_BASE_BINFOS (TYPE_BINFO (type)); i++) | |
1769 | { | |
1770 | tree base1 = BINFO_BASE_BINFO (TYPE_BINFO (type), i); | |
1771 | tree base2 = BINFO_BASE_BINFO (TYPE_BINFO (val->type), i); | |
1772 | tree type1 = BINFO_TYPE (base1); | |
1773 | tree type2 = BINFO_TYPE (base2); | |
549bcbd1 | 1774 | |
609570b4 JH |
1775 | if (types_odr_comparable (type1, type2)) |
1776 | { | |
1777 | if (!types_same_for_odr (type1, type2)) | |
1778 | base_mismatch = true; | |
1779 | } | |
1780 | else | |
259d29e3 JH |
1781 | if (!odr_types_equivalent_p (type1, type2)) |
1782 | base_mismatch = true; | |
609570b4 JH |
1783 | if (base_mismatch) |
1784 | { | |
1785 | if (!warned && !val->odr_violated) | |
1786 | { | |
1787 | warn_odr (type, val->type, NULL, NULL, | |
1788 | !warned, &warned, | |
1789 | "a type with the same name but different base " | |
1790 | "type is defined in another translation unit"); | |
1791 | if (warned) | |
6542950e JH |
1792 | warn_types_mismatch (type1, type2, |
1793 | UNKNOWN_LOCATION, UNKNOWN_LOCATION); | |
609570b4 JH |
1794 | } |
1795 | break; | |
1796 | } | |
1797 | if (BINFO_OFFSET (base1) != BINFO_OFFSET (base2)) | |
1798 | { | |
1799 | base_mismatch = true; | |
1800 | if (!warned && !val->odr_violated) | |
1801 | warn_odr (type, val->type, NULL, NULL, | |
1802 | !warned, &warned, | |
1803 | "a type with the same name but different base " | |
1804 | "layout is defined in another translation unit"); | |
1805 | break; | |
1806 | } | |
1807 | /* One of bases is not of complete type. */ | |
1808 | if (!TYPE_BINFO (type1) != !TYPE_BINFO (type2)) | |
1809 | { | |
1810 | /* If we have a polymorphic type info specified for TYPE1 | |
1811 | but not for TYPE2 we possibly missed a base when recording | |
1812 | VAL->type earlier. | |
1813 | Be sure this does not happen. */ | |
b1905808 JH |
1814 | if (TYPE_BINFO (type1) |
1815 | && polymorphic_type_binfo_p (TYPE_BINFO (type1)) | |
1816 | && !build_bases) | |
1817 | odr_must_violate = true; | |
609570b4 JH |
1818 | break; |
1819 | } | |
1820 | /* One base is polymorphic and the other not. | |
1821 | This ought to be diagnosed earlier, but do not ICE in the | |
1822 | checking bellow. */ | |
1823 | else if (TYPE_BINFO (type1) | |
1824 | && polymorphic_type_binfo_p (TYPE_BINFO (type1)) | |
1825 | != polymorphic_type_binfo_p (TYPE_BINFO (type2))) | |
1826 | { | |
b1905808 JH |
1827 | if (!warned && !val->odr_violated) |
1828 | warn_odr (type, val->type, NULL, NULL, | |
1829 | !warned, &warned, | |
1830 | "a base of the type is polymorphic only in one " | |
1831 | "translation unit"); | |
609570b4 JH |
1832 | base_mismatch = true; |
1833 | break; | |
1834 | } | |
1835 | } | |
609570b4 | 1836 | if (base_mismatch) |
61a74079 JH |
1837 | { |
1838 | merge = false; | |
ec77d61f | 1839 | odr_violation_reported = true; |
549bcbd1 | 1840 | val->odr_violated = true; |
609570b4 | 1841 | |
3dafb85c | 1842 | if (symtab->dump_file) |
61a74079 | 1843 | { |
609570b4 | 1844 | fprintf (symtab->dump_file, "ODR base violation\n"); |
61a74079 | 1845 | |
3dafb85c ML |
1846 | print_node (symtab->dump_file, "", val->type, 0); |
1847 | putc ('\n',symtab->dump_file); | |
1848 | print_node (symtab->dump_file, "", type, 0); | |
1849 | putc ('\n',symtab->dump_file); | |
61a74079 JH |
1850 | } |
1851 | } | |
609570b4 | 1852 | } |
61a74079 | 1853 | |
824721f0 DM |
1854 | /* Next compare memory layout. |
1855 | The DECL_SOURCE_LOCATIONs in this invocation came from LTO streaming. | |
1856 | We must apply the location cache to ensure that they are valid | |
1857 | before we can pass them to odr_types_equivalent_p (PR lto/83121). */ | |
1858 | if (lto_location_cache::current_cache) | |
1859 | lto_location_cache::current_cache->apply_location_cache (); | |
b1905808 JH |
1860 | if (!odr_types_equivalent_p (val->type, type, |
1861 | !flag_ltrans && !val->odr_violated && !warned, | |
6542950e JH |
1862 | &warned, &visited, |
1863 | DECL_SOURCE_LOCATION (TYPE_NAME (val->type)), | |
1864 | DECL_SOURCE_LOCATION (TYPE_NAME (type)))) | |
b1905808 JH |
1865 | { |
1866 | merge = false; | |
1867 | odr_violation_reported = true; | |
1868 | val->odr_violated = true; | |
b1905808 JH |
1869 | } |
1870 | gcc_assert (val->odr_violated || !odr_must_violate); | |
1871 | /* Sanity check that all bases will be build same way again. */ | |
b2b29377 MM |
1872 | if (flag_checking |
1873 | && COMPLETE_TYPE_P (type) && COMPLETE_TYPE_P (val->type) | |
b1905808 JH |
1874 | && TREE_CODE (val->type) == RECORD_TYPE |
1875 | && TREE_CODE (type) == RECORD_TYPE | |
1876 | && TYPE_BINFO (val->type) && TYPE_BINFO (type) | |
1877 | && !val->odr_violated | |
1878 | && !base_mismatch && val->bases.length ()) | |
1879 | { | |
1880 | unsigned int num_poly_bases = 0; | |
1881 | unsigned int j; | |
1882 | ||
1883 | for (i = 0; i < BINFO_N_BASE_BINFOS (TYPE_BINFO (type)); i++) | |
1884 | if (polymorphic_type_binfo_p (BINFO_BASE_BINFO | |
1885 | (TYPE_BINFO (type), i))) | |
1886 | num_poly_bases++; | |
1887 | gcc_assert (num_poly_bases == val->bases.length ()); | |
1888 | for (j = 0, i = 0; i < BINFO_N_BASE_BINFOS (TYPE_BINFO (type)); | |
1889 | i++) | |
1890 | if (polymorphic_type_binfo_p (BINFO_BASE_BINFO | |
1891 | (TYPE_BINFO (type), i))) | |
1892 | { | |
1893 | odr_type base = get_odr_type | |
1894 | (BINFO_TYPE | |
1895 | (BINFO_BASE_BINFO (TYPE_BINFO (type), | |
1896 | i)), | |
1897 | true); | |
1898 | gcc_assert (val->bases[j] == base); | |
1899 | j++; | |
1900 | } | |
1901 | } | |
b1905808 JH |
1902 | |
1903 | ||
609570b4 JH |
1904 | /* Regularize things a little. During LTO same types may come with |
1905 | different BINFOs. Either because their virtual table was | |
1906 | not merged by tree merging and only later at decl merging or | |
1907 | because one type comes with external vtable, while other | |
1908 | with internal. We want to merge equivalent binfos to conserve | |
1909 | memory and streaming overhead. | |
1910 | ||
1911 | The external vtables are more harmful: they contain references | |
1912 | to external declarations of methods that may be defined in the | |
1913 | merged LTO unit. For this reason we absolutely need to remove | |
1914 | them and replace by internal variants. Not doing so will lead | |
1915 | to incomplete answers from possible_polymorphic_call_targets. | |
1916 | ||
1917 | FIXME: disable for now; because ODR types are now build during | |
1918 | streaming in, the variants do not need to be linked to the type, | |
1919 | yet. We need to do the merging in cleanup pass to be implemented | |
1920 | soon. */ | |
1921 | if (!flag_ltrans && merge | |
1922 | && 0 | |
1923 | && TREE_CODE (val->type) == RECORD_TYPE | |
1924 | && TREE_CODE (type) == RECORD_TYPE | |
1925 | && TYPE_BINFO (val->type) && TYPE_BINFO (type) | |
1926 | && TYPE_MAIN_VARIANT (type) == type | |
1927 | && TYPE_MAIN_VARIANT (val->type) == val->type | |
1928 | && BINFO_VTABLE (TYPE_BINFO (val->type)) | |
1929 | && BINFO_VTABLE (TYPE_BINFO (type))) | |
1930 | { | |
1931 | tree master_binfo = TYPE_BINFO (val->type); | |
1932 | tree v1 = BINFO_VTABLE (master_binfo); | |
1933 | tree v2 = BINFO_VTABLE (TYPE_BINFO (type)); | |
7d8adcba | 1934 | |
609570b4 JH |
1935 | if (TREE_CODE (v1) == POINTER_PLUS_EXPR) |
1936 | { | |
1937 | gcc_assert (TREE_CODE (v2) == POINTER_PLUS_EXPR | |
1938 | && operand_equal_p (TREE_OPERAND (v1, 1), | |
1939 | TREE_OPERAND (v2, 1), 0)); | |
1940 | v1 = TREE_OPERAND (TREE_OPERAND (v1, 0), 0); | |
1941 | v2 = TREE_OPERAND (TREE_OPERAND (v2, 0), 0); | |
61a74079 | 1942 | } |
609570b4 JH |
1943 | gcc_assert (DECL_ASSEMBLER_NAME (v1) |
1944 | == DECL_ASSEMBLER_NAME (v2)); | |
61a74079 | 1945 | |
609570b4 | 1946 | if (DECL_EXTERNAL (v1) && !DECL_EXTERNAL (v2)) |
61a74079 | 1947 | { |
609570b4 | 1948 | unsigned int i; |
61a74079 | 1949 | |
609570b4 JH |
1950 | set_type_binfo (val->type, TYPE_BINFO (type)); |
1951 | for (i = 0; i < val->types->length (); i++) | |
61a74079 | 1952 | { |
609570b4 JH |
1953 | if (TYPE_BINFO ((*val->types)[i]) |
1954 | == master_binfo) | |
1955 | set_type_binfo ((*val->types)[i], TYPE_BINFO (type)); | |
61a74079 | 1956 | } |
609570b4 | 1957 | BINFO_TYPE (TYPE_BINFO (type)) = val->type; |
61a74079 | 1958 | } |
609570b4 JH |
1959 | else |
1960 | set_type_binfo (type, master_binfo); | |
61a74079 | 1961 | } |
549bcbd1 | 1962 | return build_bases; |
61a74079 JH |
1963 | } |
1964 | ||
eefe9a99 JH |
1965 | /* Get ODR type hash entry for TYPE. If INSERT is true, create |
1966 | possibly new entry. */ | |
1967 | ||
1968 | odr_type | |
1969 | get_odr_type (tree type, bool insert) | |
1970 | { | |
609570b4 JH |
1971 | odr_type_d **slot = NULL; |
1972 | odr_type_d **vtable_slot = NULL; | |
1973 | odr_type val = NULL; | |
eefe9a99 | 1974 | hashval_t hash; |
549bcbd1 JH |
1975 | bool build_bases = false; |
1976 | bool insert_to_odr_array = false; | |
1977 | int base_id = -1; | |
1978 | ||
1979 | type = main_odr_variant (type); | |
eefe9a99 | 1980 | |
609570b4 JH |
1981 | gcc_checking_assert (can_be_name_hashed_p (type) |
1982 | || can_be_vtable_hashed_p (type)); | |
1983 | ||
1984 | /* Lookup entry, first try name hash, fallback to vtable hash. */ | |
1985 | if (can_be_name_hashed_p (type)) | |
1986 | { | |
1987 | hash = hash_odr_name (type); | |
1988 | slot = odr_hash->find_slot_with_hash (type, hash, | |
1989 | insert ? INSERT : NO_INSERT); | |
1990 | } | |
1991 | if ((!slot || !*slot) && in_lto_p && can_be_vtable_hashed_p (type)) | |
1992 | { | |
1993 | hash = hash_odr_vtable (type); | |
1994 | vtable_slot = odr_vtable_hash->find_slot_with_hash (type, hash, | |
1995 | insert ? INSERT : NO_INSERT); | |
1996 | } | |
1997 | ||
1998 | if (!slot && !vtable_slot) | |
eefe9a99 JH |
1999 | return NULL; |
2000 | ||
2001 | /* See if we already have entry for type. */ | |
609570b4 | 2002 | if ((slot && *slot) || (vtable_slot && *vtable_slot)) |
eefe9a99 | 2003 | { |
609570b4 JH |
2004 | if (slot && *slot) |
2005 | { | |
2006 | val = *slot; | |
b2b29377 MM |
2007 | if (flag_checking |
2008 | && in_lto_p && can_be_vtable_hashed_p (type)) | |
609570b4 JH |
2009 | { |
2010 | hash = hash_odr_vtable (type); | |
2011 | vtable_slot = odr_vtable_hash->find_slot_with_hash (type, hash, | |
2012 | NO_INSERT); | |
2013 | gcc_assert (!vtable_slot || *vtable_slot == *slot); | |
2014 | vtable_slot = NULL; | |
2015 | } | |
609570b4 JH |
2016 | } |
2017 | else if (*vtable_slot) | |
2018 | val = *vtable_slot; | |
eefe9a99 | 2019 | |
609570b4 JH |
2020 | if (val->type != type |
2021 | && (!val->types_set || !val->types_set->add (type))) | |
2022 | { | |
2023 | gcc_assert (insert); | |
2024 | /* We have type duplicate, but it may introduce vtable name or | |
2025 | mangled name; be sure to keep hashes in sync. */ | |
2026 | if (in_lto_p && can_be_vtable_hashed_p (type) | |
2027 | && (!vtable_slot || !*vtable_slot)) | |
2028 | { | |
2029 | if (!vtable_slot) | |
2030 | { | |
2031 | hash = hash_odr_vtable (type); | |
2032 | vtable_slot = odr_vtable_hash->find_slot_with_hash | |
2033 | (type, hash, INSERT); | |
2034 | gcc_checking_assert (!*vtable_slot || *vtable_slot == val); | |
2035 | } | |
2036 | *vtable_slot = val; | |
2037 | } | |
2038 | if (slot && !*slot) | |
2039 | *slot = val; | |
2040 | build_bases = add_type_duplicate (val, type); | |
2041 | } | |
eefe9a99 JH |
2042 | } |
2043 | else | |
2044 | { | |
766090c2 | 2045 | val = ggc_cleared_alloc<odr_type_d> (); |
eefe9a99 JH |
2046 | val->type = type; |
2047 | val->bases = vNULL; | |
2048 | val->derived_types = vNULL; | |
e7a677ca JH |
2049 | if (type_with_linkage_p (type)) |
2050 | val->anonymous_namespace = type_in_anonymous_namespace_p (type); | |
2051 | else | |
2052 | val->anonymous_namespace = 0; | |
549bcbd1 JH |
2053 | build_bases = COMPLETE_TYPE_P (val->type); |
2054 | insert_to_odr_array = true; | |
609570b4 JH |
2055 | if (slot) |
2056 | *slot = val; | |
2057 | if (vtable_slot) | |
2058 | *vtable_slot = val; | |
549bcbd1 JH |
2059 | } |
2060 | ||
2061 | if (build_bases && TREE_CODE (type) == RECORD_TYPE && TYPE_BINFO (type) | |
4d6eb35a | 2062 | && type_with_linkage_p (type) |
549bcbd1 JH |
2063 | && type == TYPE_MAIN_VARIANT (type)) |
2064 | { | |
2065 | tree binfo = TYPE_BINFO (type); | |
2066 | unsigned int i; | |
2067 | ||
b1905808 | 2068 | gcc_assert (BINFO_TYPE (TYPE_BINFO (val->type)) == type); |
549bcbd1 | 2069 | |
2d1644bf | 2070 | val->all_derivations_known = type_all_derivations_known_p (type); |
eefe9a99 JH |
2071 | for (i = 0; i < BINFO_N_BASE_BINFOS (binfo); i++) |
2072 | /* For now record only polymorphic types. other are | |
2073 | pointless for devirtualization and we can not precisely | |
2074 | determine ODR equivalency of these during LTO. */ | |
2075 | if (polymorphic_type_binfo_p (BINFO_BASE_BINFO (binfo, i))) | |
2076 | { | |
b1905808 JH |
2077 | tree base_type= BINFO_TYPE (BINFO_BASE_BINFO (binfo, i)); |
2078 | odr_type base = get_odr_type (base_type, true); | |
2079 | gcc_assert (TYPE_MAIN_VARIANT (base_type) == base_type); | |
eefe9a99 JH |
2080 | base->derived_types.safe_push (val); |
2081 | val->bases.safe_push (base); | |
549bcbd1 JH |
2082 | if (base->id > base_id) |
2083 | base_id = base->id; | |
eefe9a99 | 2084 | } |
549bcbd1 JH |
2085 | } |
2086 | /* Ensure that type always appears after bases. */ | |
2087 | if (insert_to_odr_array) | |
2088 | { | |
eefe9a99 | 2089 | if (odr_types_ptr) |
c3284718 | 2090 | val->id = odr_types.length (); |
eefe9a99 JH |
2091 | vec_safe_push (odr_types_ptr, val); |
2092 | } | |
549bcbd1 JH |
2093 | else if (base_id > val->id) |
2094 | { | |
2095 | odr_types[val->id] = 0; | |
2096 | /* Be sure we did not recorded any derived types; these may need | |
2097 | renumbering too. */ | |
2098 | gcc_assert (val->derived_types.length() == 0); | |
61f46d0e | 2099 | val->id = odr_types.length (); |
549bcbd1 JH |
2100 | vec_safe_push (odr_types_ptr, val); |
2101 | } | |
eefe9a99 JH |
2102 | return val; |
2103 | } | |
2104 | ||
1ee85ee1 JH |
2105 | /* Add TYPE od ODR type hash. */ |
2106 | ||
2107 | void | |
2108 | register_odr_type (tree type) | |
2109 | { | |
2110 | if (!odr_hash) | |
609570b4 JH |
2111 | { |
2112 | odr_hash = new odr_hash_type (23); | |
2113 | if (in_lto_p) | |
2114 | odr_vtable_hash = new odr_vtable_hash_type (23); | |
2115 | } | |
32496fdd JH |
2116 | /* Arrange things to be nicer and insert main variants first. |
2117 | ??? fundamental prerecorded types do not have mangled names; this | |
2118 | makes it possible that non-ODR type is main_odr_variant of ODR type. | |
2119 | Things may get smoother if LTO FE set mangled name of those types same | |
2120 | way as C++ FE does. */ | |
4d6eb35a JH |
2121 | if (odr_type_p (main_odr_variant (TYPE_MAIN_VARIANT (type))) |
2122 | && odr_type_p (TYPE_MAIN_VARIANT (type))) | |
1ee85ee1 | 2123 | get_odr_type (TYPE_MAIN_VARIANT (type), true); |
32496fdd | 2124 | if (TYPE_MAIN_VARIANT (type) != type && odr_type_p (main_odr_variant (type))) |
1ee85ee1 JH |
2125 | get_odr_type (type, true); |
2126 | } | |
2127 | ||
aa803cc7 JH |
2128 | /* Return true if type is known to have no derivations. */ |
2129 | ||
2130 | bool | |
4d6eb35a | 2131 | type_known_to_have_no_derivations_p (tree t) |
aa803cc7 JH |
2132 | { |
2133 | return (type_all_derivations_known_p (t) | |
2134 | && (TYPE_FINAL_P (t) | |
2135 | || (odr_hash | |
2136 | && !get_odr_type (t, true)->derived_types.length()))); | |
2137 | } | |
2138 | ||
d6ae9a6d SL |
2139 | /* Dump ODR type T and all its derived types. INDENT specifies indentation for |
2140 | recursive printing. */ | |
eefe9a99 JH |
2141 | |
2142 | static void | |
2143 | dump_odr_type (FILE *f, odr_type t, int indent=0) | |
2144 | { | |
2145 | unsigned int i; | |
2146 | fprintf (f, "%*s type %i: ", indent * 2, "", t->id); | |
2147 | print_generic_expr (f, t->type, TDF_SLIM); | |
2d1644bf JH |
2148 | fprintf (f, "%s", t->anonymous_namespace ? " (anonymous namespace)":""); |
2149 | fprintf (f, "%s\n", t->all_derivations_known ? " (derivations known)":""); | |
eefe9a99 JH |
2150 | if (TYPE_NAME (t->type)) |
2151 | { | |
730c436a | 2152 | /*fprintf (f, "%*s defined at: %s:%i\n", indent * 2, "", |
eefe9a99 | 2153 | DECL_SOURCE_FILE (TYPE_NAME (t->type)), |
730c436a | 2154 | DECL_SOURCE_LINE (TYPE_NAME (t->type)));*/ |
88b16508 JH |
2155 | if (DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (t->type))) |
2156 | fprintf (f, "%*s mangled name: %s\n", indent * 2, "", | |
2157 | IDENTIFIER_POINTER | |
2158 | (DECL_ASSEMBLER_NAME (TYPE_NAME (t->type)))); | |
eefe9a99 | 2159 | } |
c3284718 | 2160 | if (t->bases.length ()) |
eefe9a99 JH |
2161 | { |
2162 | fprintf (f, "%*s base odr type ids: ", indent * 2, ""); | |
c3284718 | 2163 | for (i = 0; i < t->bases.length (); i++) |
eefe9a99 JH |
2164 | fprintf (f, " %i", t->bases[i]->id); |
2165 | fprintf (f, "\n"); | |
2166 | } | |
c3284718 | 2167 | if (t->derived_types.length ()) |
eefe9a99 JH |
2168 | { |
2169 | fprintf (f, "%*s derived types:\n", indent * 2, ""); | |
c3284718 | 2170 | for (i = 0; i < t->derived_types.length (); i++) |
eefe9a99 JH |
2171 | dump_odr_type (f, t->derived_types[i], indent + 1); |
2172 | } | |
2173 | fprintf (f, "\n"); | |
2174 | } | |
2175 | ||
2176 | /* Dump the type inheritance graph. */ | |
2177 | ||
2178 | static void | |
2179 | dump_type_inheritance_graph (FILE *f) | |
2180 | { | |
2181 | unsigned int i; | |
0e1474e5 JH |
2182 | if (!odr_types_ptr) |
2183 | return; | |
eefe9a99 | 2184 | fprintf (f, "\n\nType inheritance graph:\n"); |
c3284718 | 2185 | for (i = 0; i < odr_types.length (); i++) |
eefe9a99 | 2186 | { |
549bcbd1 | 2187 | if (odr_types[i] && odr_types[i]->bases.length () == 0) |
eefe9a99 JH |
2188 | dump_odr_type (f, odr_types[i]); |
2189 | } | |
c3284718 | 2190 | for (i = 0; i < odr_types.length (); i++) |
61a74079 | 2191 | { |
549bcbd1 | 2192 | if (odr_types[i] && odr_types[i]->types && odr_types[i]->types->length ()) |
61a74079 JH |
2193 | { |
2194 | unsigned int j; | |
2195 | fprintf (f, "Duplicate tree types for odr type %i\n", i); | |
2196 | print_node (f, "", odr_types[i]->type, 0); | |
c3284718 | 2197 | for (j = 0; j < odr_types[i]->types->length (); j++) |
61a74079 JH |
2198 | { |
2199 | tree t; | |
2200 | fprintf (f, "duplicate #%i\n", j); | |
2201 | print_node (f, "", (*odr_types[i]->types)[j], 0); | |
2202 | t = (*odr_types[i]->types)[j]; | |
2203 | while (TYPE_P (t) && TYPE_CONTEXT (t)) | |
2204 | { | |
2205 | t = TYPE_CONTEXT (t); | |
2206 | print_node (f, "", t, 0); | |
2207 | } | |
2208 | putc ('\n',f); | |
2209 | } | |
2210 | } | |
2211 | } | |
eefe9a99 JH |
2212 | } |
2213 | ||
eefe9a99 JH |
2214 | /* Initialize IPA devirt and build inheritance tree graph. */ |
2215 | ||
2216 | void | |
2217 | build_type_inheritance_graph (void) | |
2218 | { | |
b270b096 | 2219 | struct symtab_node *n; |
eefe9a99 | 2220 | FILE *inheritance_dump_file; |
1a817418 | 2221 | dump_flags_t flags; |
eefe9a99 | 2222 | |
c203e8a7 | 2223 | if (odr_hash) |
eefe9a99 JH |
2224 | return; |
2225 | timevar_push (TV_IPA_INHERITANCE); | |
2226 | inheritance_dump_file = dump_begin (TDI_inheritance, &flags); | |
c203e8a7 | 2227 | odr_hash = new odr_hash_type (23); |
609570b4 JH |
2228 | if (in_lto_p) |
2229 | odr_vtable_hash = new odr_vtable_hash_type (23); | |
eefe9a99 JH |
2230 | |
2231 | /* We reconstruct the graph starting of types of all methods seen in the | |
6af801f5 | 2232 | unit. */ |
b270b096 | 2233 | FOR_EACH_SYMBOL (n) |
7de90a6c | 2234 | if (is_a <cgraph_node *> (n) |
b270b096 | 2235 | && DECL_VIRTUAL_P (n->decl) |
d52f5295 | 2236 | && n->real_symbol_p ()) |
70e7f2a2 | 2237 | get_odr_type (TYPE_METHOD_BASETYPE (TREE_TYPE (n->decl)), true); |
b270b096 JH |
2238 | |
2239 | /* Look also for virtual tables of types that do not define any methods. | |
2240 | ||
2241 | We need it in a case where class B has virtual base of class A | |
2242 | re-defining its virtual method and there is class C with no virtual | |
2243 | methods with B as virtual base. | |
2244 | ||
2245 | Here we output B's virtual method in two variant - for non-virtual | |
2246 | and virtual inheritance. B's virtual table has non-virtual version, | |
2247 | while C's has virtual. | |
2248 | ||
2249 | For this reason we need to know about C in order to include both | |
2250 | variants of B. More correctly, record_target_from_binfo should | |
2251 | add both variants of the method when walking B, but we have no | |
2252 | link in between them. | |
2253 | ||
2254 | We rely on fact that either the method is exported and thus we | |
2255 | assume it is called externally or C is in anonymous namespace and | |
2256 | thus we will see the vtable. */ | |
2257 | ||
7de90a6c | 2258 | else if (is_a <varpool_node *> (n) |
b270b096 JH |
2259 | && DECL_VIRTUAL_P (n->decl) |
2260 | && TREE_CODE (DECL_CONTEXT (n->decl)) == RECORD_TYPE | |
2261 | && TYPE_BINFO (DECL_CONTEXT (n->decl)) | |
2262 | && polymorphic_type_binfo_p (TYPE_BINFO (DECL_CONTEXT (n->decl)))) | |
549bcbd1 | 2263 | get_odr_type (TYPE_MAIN_VARIANT (DECL_CONTEXT (n->decl)), true); |
eefe9a99 JH |
2264 | if (inheritance_dump_file) |
2265 | { | |
2266 | dump_type_inheritance_graph (inheritance_dump_file); | |
2267 | dump_end (TDI_inheritance, inheritance_dump_file); | |
2268 | } | |
2269 | timevar_pop (TV_IPA_INHERITANCE); | |
2270 | } | |
2271 | ||
ccb05ef2 JH |
2272 | /* Return true if N has reference from live virtual table |
2273 | (and thus can be a destination of polymorphic call). | |
2274 | Be conservatively correct when callgraph is not built or | |
2275 | if the method may be referred externally. */ | |
2276 | ||
2277 | static bool | |
2278 | referenced_from_vtable_p (struct cgraph_node *node) | |
2279 | { | |
2280 | int i; | |
2281 | struct ipa_ref *ref; | |
2282 | bool found = false; | |
2283 | ||
2284 | if (node->externally_visible | |
7d0aa05b | 2285 | || DECL_EXTERNAL (node->decl) |
ccb05ef2 JH |
2286 | || node->used_from_other_partition) |
2287 | return true; | |
2288 | ||
2289 | /* Keep this test constant time. | |
2290 | It is unlikely this can happen except for the case where speculative | |
2291 | devirtualization introduced many speculative edges to this node. | |
2292 | In this case the target is very likely alive anyway. */ | |
2293 | if (node->ref_list.referring.length () > 100) | |
2294 | return true; | |
2295 | ||
2296 | /* We need references built. */ | |
3dafb85c | 2297 | if (symtab->state <= CONSTRUCTION) |
ccb05ef2 JH |
2298 | return true; |
2299 | ||
d122681a | 2300 | for (i = 0; node->iterate_referring (i, ref); i++) |
ccb05ef2 | 2301 | if ((ref->use == IPA_REF_ALIAS |
d52f5295 | 2302 | && referenced_from_vtable_p (dyn_cast<cgraph_node *> (ref->referring))) |
ccb05ef2 | 2303 | || (ref->use == IPA_REF_ADDR |
8813a647 | 2304 | && VAR_P (ref->referring->decl) |
ccb05ef2 JH |
2305 | && DECL_VIRTUAL_P (ref->referring->decl))) |
2306 | { | |
2307 | found = true; | |
2308 | break; | |
2309 | } | |
2310 | return found; | |
2311 | } | |
2312 | ||
ceda2c69 JH |
2313 | /* Return if TARGET is cxa_pure_virtual. */ |
2314 | ||
2315 | static bool | |
2316 | is_cxa_pure_virtual_p (tree target) | |
2317 | { | |
2318 | return target && TREE_CODE (TREE_TYPE (target)) != METHOD_TYPE | |
2319 | && DECL_NAME (target) | |
a01f151f | 2320 | && id_equal (DECL_NAME (target), |
ceda2c69 JH |
2321 | "__cxa_pure_virtual"); |
2322 | } | |
2323 | ||
68377e53 | 2324 | /* If TARGET has associated node, record it in the NODES array. |
ec77d61f JH |
2325 | CAN_REFER specify if program can refer to the target directly. |
2326 | if TARGET is unknown (NULL) or it can not be inserted (for example because | |
2327 | its body was already removed and there is no way to refer to it), clear | |
2328 | COMPLETEP. */ | |
eefe9a99 JH |
2329 | |
2330 | static void | |
2331 | maybe_record_node (vec <cgraph_node *> &nodes, | |
6e2830c3 | 2332 | tree target, hash_set<tree> *inserted, |
ec77d61f | 2333 | bool can_refer, |
68377e53 | 2334 | bool *completep) |
eefe9a99 | 2335 | { |
958c1d61 JH |
2336 | struct cgraph_node *target_node, *alias_target; |
2337 | enum availability avail; | |
ceda2c69 | 2338 | bool pure_virtual = is_cxa_pure_virtual_p (target); |
88f592e3 | 2339 | |
ceda2c69 | 2340 | /* __builtin_unreachable do not need to be added into |
88f592e3 JH |
2341 | list of targets; the runtime effect of calling them is undefined. |
2342 | Only "real" virtual methods should be accounted. */ | |
ceda2c69 | 2343 | if (target && TREE_CODE (TREE_TYPE (target)) != METHOD_TYPE && !pure_virtual) |
88f592e3 | 2344 | return; |
eefe9a99 | 2345 | |
ec77d61f JH |
2346 | if (!can_refer) |
2347 | { | |
2348 | /* The only case when method of anonymous namespace becomes unreferable | |
2349 | is when we completely optimized it out. */ | |
2350 | if (flag_ltrans | |
2351 | || !target | |
88f592e3 | 2352 | || !type_in_anonymous_namespace_p (DECL_CONTEXT (target))) |
ec77d61f JH |
2353 | *completep = false; |
2354 | return; | |
2355 | } | |
2356 | ||
88f592e3 | 2357 | if (!target) |
68377e53 JH |
2358 | return; |
2359 | ||
d52f5295 | 2360 | target_node = cgraph_node::get (target); |
68377e53 | 2361 | |
d6ae9a6d | 2362 | /* Prefer alias target over aliases, so we do not get confused by |
958c1d61 JH |
2363 | fake duplicates. */ |
2364 | if (target_node) | |
2365 | { | |
d52f5295 | 2366 | alias_target = target_node->ultimate_alias_target (&avail); |
958c1d61 JH |
2367 | if (target_node != alias_target |
2368 | && avail >= AVAIL_AVAILABLE | |
d52f5295 | 2369 | && target_node->get_availability ()) |
958c1d61 JH |
2370 | target_node = alias_target; |
2371 | } | |
2372 | ||
ccb05ef2 | 2373 | /* Method can only be called by polymorphic call if any |
d6ae9a6d | 2374 | of vtables referring to it are alive. |
ccb05ef2 JH |
2375 | |
2376 | While this holds for non-anonymous functions, too, there are | |
2377 | cases where we want to keep them in the list; for example | |
2378 | inline functions with -fno-weak are static, but we still | |
2379 | may devirtualize them when instance comes from other unit. | |
2380 | The same holds for LTO. | |
2381 | ||
2382 | Currently we ignore these functions in speculative devirtualization. | |
2383 | ??? Maybe it would make sense to be more aggressive for LTO even | |
d6ae9a6d | 2384 | elsewhere. */ |
ccb05ef2 | 2385 | if (!flag_ltrans |
ceda2c69 | 2386 | && !pure_virtual |
ccb05ef2 JH |
2387 | && type_in_anonymous_namespace_p (DECL_CONTEXT (target)) |
2388 | && (!target_node | |
2389 | || !referenced_from_vtable_p (target_node))) | |
2390 | ; | |
2391 | /* See if TARGET is useful function we can deal with. */ | |
2392 | else if (target_node != NULL | |
2393 | && (TREE_PUBLIC (target) | |
2394 | || DECL_EXTERNAL (target) | |
2395 | || target_node->definition) | |
d52f5295 | 2396 | && target_node->real_symbol_p ()) |
0e1474e5 | 2397 | { |
68377e53 | 2398 | gcc_assert (!target_node->global.inlined_to); |
d52f5295 | 2399 | gcc_assert (target_node->real_symbol_p ()); |
84278ed9 | 2400 | /* When sanitizing, do not assume that __cxa_pure_virtual is not called |
d27ecc49 | 2401 | by valid program. */ |
84278ed9 | 2402 | if (flag_sanitize & SANITIZE_UNREACHABLE) |
d27ecc49 | 2403 | ; |
ceda2c69 JH |
2404 | /* Only add pure virtual if it is the only possible target. This way |
2405 | we will preserve the diagnostics about pure virtual called in many | |
2406 | cases without disabling optimization in other. */ | |
d27ecc49 | 2407 | else if (pure_virtual) |
ceda2c69 JH |
2408 | { |
2409 | if (nodes.length ()) | |
2410 | return; | |
2411 | } | |
2412 | /* If we found a real target, take away cxa_pure_virtual. */ | |
2413 | else if (!pure_virtual && nodes.length () == 1 | |
2414 | && is_cxa_pure_virtual_p (nodes[0]->decl)) | |
2415 | nodes.pop (); | |
2416 | if (pure_virtual && nodes.length ()) | |
2417 | return; | |
6e2830c3 | 2418 | if (!inserted->add (target)) |
68377e53 | 2419 | { |
6e2830c3 | 2420 | cached_polymorphic_call_targets->add (target_node); |
68377e53 JH |
2421 | nodes.safe_push (target_node); |
2422 | } | |
0e1474e5 | 2423 | } |
8479ed2c JH |
2424 | else if (!completep) |
2425 | ; | |
2426 | /* We have definition of __cxa_pure_virtual that is not accessible (it is | |
2427 | optimized out or partitioned to other unit) so we can not add it. When | |
2428 | not sanitizing, there is nothing to do. | |
2429 | Otherwise declare the list incomplete. */ | |
2430 | else if (pure_virtual) | |
2431 | { | |
2432 | if (flag_sanitize & SANITIZE_UNREACHABLE) | |
2433 | *completep = false; | |
2434 | } | |
2435 | else if (flag_ltrans | |
2436 | || !type_in_anonymous_namespace_p (DECL_CONTEXT (target))) | |
0439a947 | 2437 | *completep = false; |
eefe9a99 JH |
2438 | } |
2439 | ||
d6ae9a6d | 2440 | /* See if BINFO's type matches OUTER_TYPE. If so, look up |
68377e53 | 2441 | BINFO of subtype of OTR_TYPE at OFFSET and in that BINFO find |
2d1644bf JH |
2442 | method in vtable and insert method to NODES array |
2443 | or BASES_TO_CONSIDER if this array is non-NULL. | |
eefe9a99 | 2444 | Otherwise recurse to base BINFOs. |
d6ae9a6d | 2445 | This matches what get_binfo_at_offset does, but with offset |
eefe9a99 JH |
2446 | being unknown. |
2447 | ||
a3788dde JH |
2448 | TYPE_BINFOS is a stack of BINFOS of types with defined |
2449 | virtual table seen on way from class type to BINFO. | |
eefe9a99 JH |
2450 | |
2451 | MATCHED_VTABLES tracks virtual tables we already did lookup | |
68377e53 JH |
2452 | for virtual function in. INSERTED tracks nodes we already |
2453 | inserted. | |
3462aa02 JH |
2454 | |
2455 | ANONYMOUS is true if BINFO is part of anonymous namespace. | |
ec77d61f JH |
2456 | |
2457 | Clear COMPLETEP when we hit unreferable target. | |
eefe9a99 JH |
2458 | */ |
2459 | ||
2460 | static void | |
68377e53 | 2461 | record_target_from_binfo (vec <cgraph_node *> &nodes, |
2d1644bf | 2462 | vec <tree> *bases_to_consider, |
68377e53 JH |
2463 | tree binfo, |
2464 | tree otr_type, | |
a3788dde | 2465 | vec <tree> &type_binfos, |
68377e53 JH |
2466 | HOST_WIDE_INT otr_token, |
2467 | tree outer_type, | |
2468 | HOST_WIDE_INT offset, | |
6e2830c3 TS |
2469 | hash_set<tree> *inserted, |
2470 | hash_set<tree> *matched_vtables, | |
ec77d61f JH |
2471 | bool anonymous, |
2472 | bool *completep) | |
eefe9a99 JH |
2473 | { |
2474 | tree type = BINFO_TYPE (binfo); | |
2475 | int i; | |
2476 | tree base_binfo; | |
2477 | ||
eefe9a99 | 2478 | |
a3788dde JH |
2479 | if (BINFO_VTABLE (binfo)) |
2480 | type_binfos.safe_push (binfo); | |
68377e53 | 2481 | if (types_same_for_odr (type, outer_type)) |
eefe9a99 | 2482 | { |
a3788dde JH |
2483 | int i; |
2484 | tree type_binfo = NULL; | |
2485 | ||
d6ae9a6d | 2486 | /* Look up BINFO with virtual table. For normal types it is always last |
a3788dde JH |
2487 | binfo on stack. */ |
2488 | for (i = type_binfos.length () - 1; i >= 0; i--) | |
2489 | if (BINFO_OFFSET (type_binfos[i]) == BINFO_OFFSET (binfo)) | |
2490 | { | |
2491 | type_binfo = type_binfos[i]; | |
2492 | break; | |
2493 | } | |
2494 | if (BINFO_VTABLE (binfo)) | |
2495 | type_binfos.pop (); | |
2496 | /* If this is duplicated BINFO for base shared by virtual inheritance, | |
2497 | we may not have its associated vtable. This is not a problem, since | |
2498 | we will walk it on the other path. */ | |
2499 | if (!type_binfo) | |
6d6af792 | 2500 | return; |
68377e53 JH |
2501 | tree inner_binfo = get_binfo_at_offset (type_binfo, |
2502 | offset, otr_type); | |
ec77d61f JH |
2503 | if (!inner_binfo) |
2504 | { | |
2505 | gcc_assert (odr_violation_reported); | |
2506 | return; | |
2507 | } | |
3462aa02 JH |
2508 | /* For types in anonymous namespace first check if the respective vtable |
2509 | is alive. If not, we know the type can't be called. */ | |
2510 | if (!flag_ltrans && anonymous) | |
2511 | { | |
68377e53 | 2512 | tree vtable = BINFO_VTABLE (inner_binfo); |
2c8326a5 | 2513 | varpool_node *vnode; |
3462aa02 JH |
2514 | |
2515 | if (TREE_CODE (vtable) == POINTER_PLUS_EXPR) | |
2516 | vtable = TREE_OPERAND (TREE_OPERAND (vtable, 0), 0); | |
9041d2e6 | 2517 | vnode = varpool_node::get (vtable); |
67348ccc | 2518 | if (!vnode || !vnode->definition) |
3462aa02 JH |
2519 | return; |
2520 | } | |
68377e53 | 2521 | gcc_assert (inner_binfo); |
2d1644bf | 2522 | if (bases_to_consider |
6e2830c3 TS |
2523 | ? !matched_vtables->contains (BINFO_VTABLE (inner_binfo)) |
2524 | : !matched_vtables->add (BINFO_VTABLE (inner_binfo))) | |
68377e53 | 2525 | { |
ec77d61f JH |
2526 | bool can_refer; |
2527 | tree target = gimple_get_virt_method_for_binfo (otr_token, | |
2528 | inner_binfo, | |
2529 | &can_refer); | |
2d1644bf JH |
2530 | if (!bases_to_consider) |
2531 | maybe_record_node (nodes, target, inserted, can_refer, completep); | |
2532 | /* Destructors are never called via construction vtables. */ | |
2533 | else if (!target || !DECL_CXX_DESTRUCTOR_P (target)) | |
2534 | bases_to_consider->safe_push (target); | |
68377e53 | 2535 | } |
eefe9a99 JH |
2536 | return; |
2537 | } | |
2538 | ||
2539 | /* Walk bases. */ | |
2540 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
d6ae9a6d | 2541 | /* Walking bases that have no virtual method is pointless exercise. */ |
eefe9a99 | 2542 | if (polymorphic_type_binfo_p (base_binfo)) |
2d1644bf | 2543 | record_target_from_binfo (nodes, bases_to_consider, base_binfo, otr_type, |
a3788dde | 2544 | type_binfos, |
68377e53 | 2545 | otr_token, outer_type, offset, inserted, |
ec77d61f | 2546 | matched_vtables, anonymous, completep); |
a3788dde JH |
2547 | if (BINFO_VTABLE (binfo)) |
2548 | type_binfos.pop (); | |
eefe9a99 JH |
2549 | } |
2550 | ||
d6ae9a6d | 2551 | /* Look up virtual methods matching OTR_TYPE (with OFFSET and OTR_TOKEN) |
eefe9a99 JH |
2552 | of TYPE, insert them to NODES, recurse into derived nodes. |
2553 | INSERTED is used to avoid duplicate insertions of methods into NODES. | |
ec77d61f | 2554 | MATCHED_VTABLES are used to avoid duplicate walking vtables. |
2d1644bf JH |
2555 | Clear COMPLETEP if unreferable target is found. |
2556 | ||
d6ae9a6d | 2557 | If CONSIDER_CONSTRUCTION is true, record to BASES_TO_CONSIDER |
2d1644bf JH |
2558 | all cases where BASE_SKIPPED is true (because the base is abstract |
2559 | class). */ | |
eefe9a99 JH |
2560 | |
2561 | static void | |
2562 | possible_polymorphic_call_targets_1 (vec <cgraph_node *> &nodes, | |
6e2830c3 TS |
2563 | hash_set<tree> *inserted, |
2564 | hash_set<tree> *matched_vtables, | |
eefe9a99 JH |
2565 | tree otr_type, |
2566 | odr_type type, | |
68377e53 JH |
2567 | HOST_WIDE_INT otr_token, |
2568 | tree outer_type, | |
ec77d61f | 2569 | HOST_WIDE_INT offset, |
2d1644bf JH |
2570 | bool *completep, |
2571 | vec <tree> &bases_to_consider, | |
2572 | bool consider_construction) | |
eefe9a99 JH |
2573 | { |
2574 | tree binfo = TYPE_BINFO (type->type); | |
2575 | unsigned int i; | |
1be0e58d | 2576 | auto_vec <tree, 8> type_binfos; |
2d1644bf JH |
2577 | bool possibly_instantiated = type_possibly_instantiated_p (type->type); |
2578 | ||
2579 | /* We may need to consider types w/o instances because of possible derived | |
2580 | types using their methods either directly or via construction vtables. | |
2581 | We are safe to skip them when all derivations are known, since we will | |
2582 | handle them later. | |
2583 | This is done by recording them to BASES_TO_CONSIDER array. */ | |
2584 | if (possibly_instantiated || consider_construction) | |
2585 | { | |
2586 | record_target_from_binfo (nodes, | |
2587 | (!possibly_instantiated | |
2588 | && type_all_derivations_known_p (type->type)) | |
2589 | ? &bases_to_consider : NULL, | |
2590 | binfo, otr_type, type_binfos, otr_token, | |
2591 | outer_type, offset, | |
2592 | inserted, matched_vtables, | |
2593 | type->anonymous_namespace, completep); | |
2594 | } | |
c3284718 | 2595 | for (i = 0; i < type->derived_types.length (); i++) |
eefe9a99 JH |
2596 | possible_polymorphic_call_targets_1 (nodes, inserted, |
2597 | matched_vtables, | |
2598 | otr_type, | |
2599 | type->derived_types[i], | |
2d1644bf JH |
2600 | otr_token, outer_type, offset, completep, |
2601 | bases_to_consider, consider_construction); | |
eefe9a99 JH |
2602 | } |
2603 | ||
2604 | /* Cache of queries for polymorphic call targets. | |
2605 | ||
2606 | Enumerating all call targets may get expensive when there are many | |
2607 | polymorphic calls in the program, so we memoize all the previous | |
2608 | queries and avoid duplicated work. */ | |
2609 | ||
2610 | struct polymorphic_call_target_d | |
2611 | { | |
eefe9a99 | 2612 | HOST_WIDE_INT otr_token; |
68377e53 JH |
2613 | ipa_polymorphic_call_context context; |
2614 | odr_type type; | |
eefe9a99 | 2615 | vec <cgraph_node *> targets; |
91bc34a9 | 2616 | tree decl_warning; |
2f28755f JH |
2617 | int type_warning; |
2618 | bool complete; | |
2619 | bool speculative; | |
eefe9a99 JH |
2620 | }; |
2621 | ||
2622 | /* Polymorphic call target cache helpers. */ | |
2623 | ||
7edd9b15 RS |
2624 | struct polymorphic_call_target_hasher |
2625 | : pointer_hash <polymorphic_call_target_d> | |
eefe9a99 | 2626 | { |
67f58944 TS |
2627 | static inline hashval_t hash (const polymorphic_call_target_d *); |
2628 | static inline bool equal (const polymorphic_call_target_d *, | |
2629 | const polymorphic_call_target_d *); | |
2630 | static inline void remove (polymorphic_call_target_d *); | |
eefe9a99 JH |
2631 | }; |
2632 | ||
2633 | /* Return the computed hashcode for ODR_QUERY. */ | |
2634 | ||
2635 | inline hashval_t | |
67f58944 | 2636 | polymorphic_call_target_hasher::hash (const polymorphic_call_target_d *odr_query) |
eefe9a99 | 2637 | { |
d313d45f AK |
2638 | inchash::hash hstate (odr_query->otr_token); |
2639 | ||
449e9a33 | 2640 | hstate.add_hwi (odr_query->type->id); |
d313d45f | 2641 | hstate.merge_hash (TYPE_UID (odr_query->context.outer_type)); |
449e9a33 | 2642 | hstate.add_hwi (odr_query->context.offset); |
68377e53 | 2643 | |
3339f0bc JH |
2644 | if (odr_query->context.speculative_outer_type) |
2645 | { | |
d313d45f | 2646 | hstate.merge_hash (TYPE_UID (odr_query->context.speculative_outer_type)); |
449e9a33 | 2647 | hstate.add_hwi (odr_query->context.speculative_offset); |
3339f0bc | 2648 | } |
2f28755f | 2649 | hstate.add_flag (odr_query->speculative); |
d313d45f AK |
2650 | hstate.add_flag (odr_query->context.maybe_in_construction); |
2651 | hstate.add_flag (odr_query->context.maybe_derived_type); | |
2652 | hstate.add_flag (odr_query->context.speculative_maybe_derived_type); | |
2653 | hstate.commit_flag (); | |
2654 | return hstate.end (); | |
eefe9a99 JH |
2655 | } |
2656 | ||
2657 | /* Compare cache entries T1 and T2. */ | |
2658 | ||
2659 | inline bool | |
67f58944 TS |
2660 | polymorphic_call_target_hasher::equal (const polymorphic_call_target_d *t1, |
2661 | const polymorphic_call_target_d *t2) | |
eefe9a99 | 2662 | { |
68377e53 | 2663 | return (t1->type == t2->type && t1->otr_token == t2->otr_token |
2f28755f | 2664 | && t1->speculative == t2->speculative |
68377e53 | 2665 | && t1->context.offset == t2->context.offset |
3339f0bc | 2666 | && t1->context.speculative_offset == t2->context.speculative_offset |
68377e53 | 2667 | && t1->context.outer_type == t2->context.outer_type |
3339f0bc | 2668 | && t1->context.speculative_outer_type == t2->context.speculative_outer_type |
68377e53 JH |
2669 | && t1->context.maybe_in_construction |
2670 | == t2->context.maybe_in_construction | |
3339f0bc JH |
2671 | && t1->context.maybe_derived_type == t2->context.maybe_derived_type |
2672 | && (t1->context.speculative_maybe_derived_type | |
2673 | == t2->context.speculative_maybe_derived_type)); | |
eefe9a99 JH |
2674 | } |
2675 | ||
2676 | /* Remove entry in polymorphic call target cache hash. */ | |
2677 | ||
2678 | inline void | |
67f58944 | 2679 | polymorphic_call_target_hasher::remove (polymorphic_call_target_d *v) |
eefe9a99 JH |
2680 | { |
2681 | v->targets.release (); | |
2682 | free (v); | |
2683 | } | |
2684 | ||
2685 | /* Polymorphic call target query cache. */ | |
2686 | ||
c203e8a7 | 2687 | typedef hash_table<polymorphic_call_target_hasher> |
eefe9a99 | 2688 | polymorphic_call_target_hash_type; |
c203e8a7 | 2689 | static polymorphic_call_target_hash_type *polymorphic_call_target_hash; |
eefe9a99 JH |
2690 | |
2691 | /* Destroy polymorphic call target query cache. */ | |
2692 | ||
2693 | static void | |
2694 | free_polymorphic_call_targets_hash () | |
2695 | { | |
0e1474e5 JH |
2696 | if (cached_polymorphic_call_targets) |
2697 | { | |
c203e8a7 TS |
2698 | delete polymorphic_call_target_hash; |
2699 | polymorphic_call_target_hash = NULL; | |
6e2830c3 | 2700 | delete cached_polymorphic_call_targets; |
0e1474e5 JH |
2701 | cached_polymorphic_call_targets = NULL; |
2702 | } | |
eefe9a99 JH |
2703 | } |
2704 | ||
2705 | /* When virtual function is removed, we may need to flush the cache. */ | |
2706 | ||
2707 | static void | |
2708 | devirt_node_removal_hook (struct cgraph_node *n, void *d ATTRIBUTE_UNUSED) | |
2709 | { | |
0e1474e5 | 2710 | if (cached_polymorphic_call_targets |
6e2830c3 | 2711 | && cached_polymorphic_call_targets->contains (n)) |
eefe9a99 JH |
2712 | free_polymorphic_call_targets_hash (); |
2713 | } | |
2714 | ||
d6ae9a6d | 2715 | /* Look up base of BINFO that has virtual table VTABLE with OFFSET. */ |
390675c8 | 2716 | |
aa803cc7 | 2717 | tree |
85942f45 JH |
2718 | subbinfo_with_vtable_at_offset (tree binfo, unsigned HOST_WIDE_INT offset, |
2719 | tree vtable) | |
390675c8 JH |
2720 | { |
2721 | tree v = BINFO_VTABLE (binfo); | |
2722 | int i; | |
2723 | tree base_binfo; | |
85942f45 | 2724 | unsigned HOST_WIDE_INT this_offset; |
390675c8 | 2725 | |
85942f45 JH |
2726 | if (v) |
2727 | { | |
2728 | if (!vtable_pointer_value_to_vtable (v, &v, &this_offset)) | |
2729 | gcc_unreachable (); | |
2730 | ||
2731 | if (offset == this_offset | |
2732 | && DECL_ASSEMBLER_NAME (v) == DECL_ASSEMBLER_NAME (vtable)) | |
2733 | return binfo; | |
2734 | } | |
390675c8 | 2735 | |
390675c8 JH |
2736 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) |
2737 | if (polymorphic_type_binfo_p (base_binfo)) | |
2738 | { | |
2739 | base_binfo = subbinfo_with_vtable_at_offset (base_binfo, offset, vtable); | |
2740 | if (base_binfo) | |
2741 | return base_binfo; | |
2742 | } | |
2743 | return NULL; | |
2744 | } | |
2745 | ||
85942f45 JH |
2746 | /* T is known constant value of virtual table pointer. |
2747 | Store virtual table to V and its offset to OFFSET. | |
2748 | Return false if T does not look like virtual table reference. */ | |
390675c8 | 2749 | |
85942f45 | 2750 | bool |
d570d364 JH |
2751 | vtable_pointer_value_to_vtable (const_tree t, tree *v, |
2752 | unsigned HOST_WIDE_INT *offset) | |
390675c8 JH |
2753 | { |
2754 | /* We expect &MEM[(void *)&virtual_table + 16B]. | |
2755 | We obtain object's BINFO from the context of the virtual table. | |
2756 | This one contains pointer to virtual table represented via | |
d6ae9a6d | 2757 | POINTER_PLUS_EXPR. Verify that this pointer matches what |
390675c8 JH |
2758 | we propagated through. |
2759 | ||
2760 | In the case of virtual inheritance, the virtual tables may | |
2761 | be nested, i.e. the offset may be different from 16 and we may | |
2762 | need to dive into the type representation. */ | |
85942f45 | 2763 | if (TREE_CODE (t) == ADDR_EXPR |
390675c8 JH |
2764 | && TREE_CODE (TREE_OPERAND (t, 0)) == MEM_REF |
2765 | && TREE_CODE (TREE_OPERAND (TREE_OPERAND (t, 0), 0)) == ADDR_EXPR | |
2766 | && TREE_CODE (TREE_OPERAND (TREE_OPERAND (t, 0), 1)) == INTEGER_CST | |
2767 | && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 0), 0), 0)) | |
2768 | == VAR_DECL) | |
2769 | && DECL_VIRTUAL_P (TREE_OPERAND (TREE_OPERAND | |
2770 | (TREE_OPERAND (t, 0), 0), 0))) | |
2771 | { | |
85942f45 JH |
2772 | *v = TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 0), 0), 0); |
2773 | *offset = tree_to_uhwi (TREE_OPERAND (TREE_OPERAND (t, 0), 1)); | |
2774 | return true; | |
390675c8 | 2775 | } |
85942f45 JH |
2776 | |
2777 | /* Alternative representation, used by C++ frontend is POINTER_PLUS_EXPR. | |
2778 | We need to handle it when T comes from static variable initializer or | |
2779 | BINFO. */ | |
2780 | if (TREE_CODE (t) == POINTER_PLUS_EXPR) | |
2781 | { | |
2782 | *offset = tree_to_uhwi (TREE_OPERAND (t, 1)); | |
2783 | t = TREE_OPERAND (t, 0); | |
2784 | } | |
2785 | else | |
2786 | *offset = 0; | |
2787 | ||
2788 | if (TREE_CODE (t) != ADDR_EXPR) | |
2789 | return false; | |
2790 | *v = TREE_OPERAND (t, 0); | |
2791 | return true; | |
2792 | } | |
2793 | ||
2794 | /* T is known constant value of virtual table pointer. Return BINFO of the | |
2795 | instance type. */ | |
2796 | ||
2797 | tree | |
d570d364 | 2798 | vtable_pointer_value_to_binfo (const_tree t) |
85942f45 JH |
2799 | { |
2800 | tree vtable; | |
2801 | unsigned HOST_WIDE_INT offset; | |
2802 | ||
2803 | if (!vtable_pointer_value_to_vtable (t, &vtable, &offset)) | |
2804 | return NULL_TREE; | |
2805 | ||
2806 | /* FIXME: for stores of construction vtables we return NULL, | |
2807 | because we do not have BINFO for those. Eventually we should fix | |
2808 | our representation to allow this case to be handled, too. | |
2809 | In the case we see store of BINFO we however may assume | |
d6ae9a6d | 2810 | that standard folding will be able to cope with it. */ |
85942f45 JH |
2811 | return subbinfo_with_vtable_at_offset (TYPE_BINFO (DECL_CONTEXT (vtable)), |
2812 | offset, vtable); | |
390675c8 JH |
2813 | } |
2814 | ||
68377e53 | 2815 | /* Walk bases of OUTER_TYPE that contain OTR_TYPE at OFFSET. |
d6ae9a6d SL |
2816 | Look up their respective virtual methods for OTR_TOKEN and OTR_TYPE |
2817 | and insert them in NODES. | |
68377e53 JH |
2818 | |
2819 | MATCHED_VTABLES and INSERTED is used to avoid duplicated work. */ | |
2820 | ||
2821 | static void | |
2822 | record_targets_from_bases (tree otr_type, | |
2823 | HOST_WIDE_INT otr_token, | |
2824 | tree outer_type, | |
2825 | HOST_WIDE_INT offset, | |
ec77d61f | 2826 | vec <cgraph_node *> &nodes, |
6e2830c3 TS |
2827 | hash_set<tree> *inserted, |
2828 | hash_set<tree> *matched_vtables, | |
68377e53 JH |
2829 | bool *completep) |
2830 | { | |
2831 | while (true) | |
2832 | { | |
2833 | HOST_WIDE_INT pos, size; | |
2834 | tree base_binfo; | |
2835 | tree fld; | |
2836 | ||
2837 | if (types_same_for_odr (outer_type, otr_type)) | |
2838 | return; | |
2839 | ||
2840 | for (fld = TYPE_FIELDS (outer_type); fld; fld = DECL_CHAIN (fld)) | |
2841 | { | |
2842 | if (TREE_CODE (fld) != FIELD_DECL) | |
2843 | continue; | |
2844 | ||
2845 | pos = int_bit_position (fld); | |
2846 | size = tree_to_shwi (DECL_SIZE (fld)); | |
ec77d61f JH |
2847 | if (pos <= offset && (pos + size) > offset |
2848 | /* Do not get confused by zero sized bases. */ | |
2849 | && polymorphic_type_binfo_p (TYPE_BINFO (TREE_TYPE (fld)))) | |
68377e53 JH |
2850 | break; |
2851 | } | |
d6ae9a6d | 2852 | /* Within a class type we should always find corresponding fields. */ |
68377e53 JH |
2853 | gcc_assert (fld && TREE_CODE (TREE_TYPE (fld)) == RECORD_TYPE); |
2854 | ||
d6ae9a6d | 2855 | /* Nonbase types should have been stripped by outer_class_type. */ |
68377e53 JH |
2856 | gcc_assert (DECL_ARTIFICIAL (fld)); |
2857 | ||
2858 | outer_type = TREE_TYPE (fld); | |
2859 | offset -= pos; | |
2860 | ||
2861 | base_binfo = get_binfo_at_offset (TYPE_BINFO (outer_type), | |
2862 | offset, otr_type); | |
ec77d61f JH |
2863 | if (!base_binfo) |
2864 | { | |
2865 | gcc_assert (odr_violation_reported); | |
2866 | return; | |
2867 | } | |
68377e53 | 2868 | gcc_assert (base_binfo); |
6e2830c3 | 2869 | if (!matched_vtables->add (BINFO_VTABLE (base_binfo))) |
68377e53 | 2870 | { |
ec77d61f JH |
2871 | bool can_refer; |
2872 | tree target = gimple_get_virt_method_for_binfo (otr_token, | |
2873 | base_binfo, | |
2874 | &can_refer); | |
2d1644bf JH |
2875 | if (!target || ! DECL_CXX_DESTRUCTOR_P (target)) |
2876 | maybe_record_node (nodes, target, inserted, can_refer, completep); | |
6e2830c3 | 2877 | matched_vtables->add (BINFO_VTABLE (base_binfo)); |
68377e53 JH |
2878 | } |
2879 | } | |
2880 | } | |
2881 | ||
3462aa02 JH |
2882 | /* When virtual table is removed, we may need to flush the cache. */ |
2883 | ||
2884 | static void | |
2c8326a5 | 2885 | devirt_variable_node_removal_hook (varpool_node *n, |
3462aa02 JH |
2886 | void *d ATTRIBUTE_UNUSED) |
2887 | { | |
2888 | if (cached_polymorphic_call_targets | |
67348ccc DM |
2889 | && DECL_VIRTUAL_P (n->decl) |
2890 | && type_in_anonymous_namespace_p (DECL_CONTEXT (n->decl))) | |
3462aa02 JH |
2891 | free_polymorphic_call_targets_hash (); |
2892 | } | |
2893 | ||
91bc34a9 | 2894 | /* Record about how many calls would benefit from given type to be final. */ |
7d0aa05b | 2895 | |
91bc34a9 JH |
2896 | struct odr_type_warn_count |
2897 | { | |
9716cc3e | 2898 | tree type; |
91bc34a9 | 2899 | int count; |
3995f3a2 | 2900 | profile_count dyn_count; |
91bc34a9 JH |
2901 | }; |
2902 | ||
2903 | /* Record about how many calls would benefit from given method to be final. */ | |
7d0aa05b | 2904 | |
91bc34a9 JH |
2905 | struct decl_warn_count |
2906 | { | |
2907 | tree decl; | |
2908 | int count; | |
3995f3a2 | 2909 | profile_count dyn_count; |
91bc34a9 JH |
2910 | }; |
2911 | ||
2912 | /* Information about type and decl warnings. */ | |
7d0aa05b | 2913 | |
91bc34a9 JH |
2914 | struct final_warning_record |
2915 | { | |
53b73588 ML |
2916 | /* If needed grow type_warnings vector and initialize new decl_warn_count |
2917 | to have dyn_count set to profile_count::zero (). */ | |
2918 | void grow_type_warnings (unsigned newlen); | |
2919 | ||
3995f3a2 | 2920 | profile_count dyn_count; |
ed37a6cf | 2921 | auto_vec<odr_type_warn_count> type_warnings; |
91bc34a9 JH |
2922 | hash_map<tree, decl_warn_count> decl_warnings; |
2923 | }; | |
53b73588 ML |
2924 | |
2925 | void | |
2926 | final_warning_record::grow_type_warnings (unsigned newlen) | |
2927 | { | |
2928 | unsigned len = type_warnings.length (); | |
2929 | if (newlen > len) | |
2930 | { | |
2931 | type_warnings.safe_grow_cleared (newlen); | |
2932 | for (unsigned i = len; i < newlen; i++) | |
2933 | type_warnings[i].dyn_count = profile_count::zero (); | |
2934 | } | |
2935 | } | |
2936 | ||
91bc34a9 JH |
2937 | struct final_warning_record *final_warning_records; |
2938 | ||
eefe9a99 | 2939 | /* Return vector containing possible targets of polymorphic call of type |
d6ae9a6d SL |
2940 | OTR_TYPE calling method OTR_TOKEN within type of OTR_OUTER_TYPE and OFFSET. |
2941 | If INCLUDE_BASES is true, walk also base types of OUTER_TYPES containing | |
68377e53 JH |
2942 | OTR_TYPE and include their virtual method. This is useful for types |
2943 | possibly in construction or destruction where the virtual table may | |
2944 | temporarily change to one of base types. INCLUDE_DERIVER_TYPES make | |
2945 | us to walk the inheritance graph for all derivations. | |
2946 | ||
add5c763 | 2947 | If COMPLETEP is non-NULL, store true if the list is complete. |
eefe9a99 JH |
2948 | CACHE_TOKEN (if non-NULL) will get stored to an unique ID of entry |
2949 | in the target cache. If user needs to visit every target list | |
2950 | just once, it can memoize them. | |
2951 | ||
2f28755f JH |
2952 | If SPECULATIVE is set, the list will not contain targets that |
2953 | are not speculatively taken. | |
ec77d61f | 2954 | |
eefe9a99 JH |
2955 | Returned vector is placed into cache. It is NOT caller's responsibility |
2956 | to free it. The vector can be freed on cgraph_remove_node call if | |
2957 | the particular node is a virtual function present in the cache. */ | |
2958 | ||
2959 | vec <cgraph_node *> | |
2960 | possible_polymorphic_call_targets (tree otr_type, | |
2961 | HOST_WIDE_INT otr_token, | |
68377e53 JH |
2962 | ipa_polymorphic_call_context context, |
2963 | bool *completep, | |
ec77d61f | 2964 | void **cache_token, |
2f28755f | 2965 | bool speculative) |
eefe9a99 JH |
2966 | { |
2967 | static struct cgraph_node_hook_list *node_removal_hook_holder; | |
add5c763 | 2968 | vec <cgraph_node *> nodes = vNULL; |
1be0e58d | 2969 | auto_vec <tree, 8> bases_to_consider; |
68377e53 | 2970 | odr_type type, outer_type; |
eefe9a99 JH |
2971 | polymorphic_call_target_d key; |
2972 | polymorphic_call_target_d **slot; | |
2973 | unsigned int i; | |
2974 | tree binfo, target; | |
ec77d61f | 2975 | bool complete; |
b2d82f2d | 2976 | bool can_refer = false; |
2d1644bf | 2977 | bool skipped = false; |
eefe9a99 | 2978 | |
c7e1befa JH |
2979 | otr_type = TYPE_MAIN_VARIANT (otr_type); |
2980 | ||
d6ae9a6d | 2981 | /* If ODR is not initialized or the context is invalid, return empty |
6f8091fc | 2982 | incomplete list. */ |
b41e0d29 | 2983 | if (!odr_hash || context.invalid || !TYPE_BINFO (otr_type)) |
3e86c6a8 JH |
2984 | { |
2985 | if (completep) | |
6f8091fc | 2986 | *completep = context.invalid; |
beb683ab MJ |
2987 | if (cache_token) |
2988 | *cache_token = NULL; | |
3e86c6a8 JH |
2989 | return nodes; |
2990 | } | |
2991 | ||
91bc34a9 | 2992 | /* Do not bother to compute speculative info when user do not asks for it. */ |
2f28755f | 2993 | if (!speculative || !context.speculative_outer_type) |
4d7cf10d | 2994 | context.clear_speculation (); |
91bc34a9 | 2995 | |
68377e53 | 2996 | type = get_odr_type (otr_type, true); |
eefe9a99 | 2997 | |
d6ae9a6d | 2998 | /* Recording type variants would waste results cache. */ |
c7e1befa JH |
2999 | gcc_assert (!context.outer_type |
3000 | || TYPE_MAIN_VARIANT (context.outer_type) == context.outer_type); | |
3001 | ||
d6ae9a6d | 3002 | /* Look up the outer class type we want to walk. |
a1981458 | 3003 | If we fail to do so, the context is invalid. */ |
a0fd3373 | 3004 | if ((context.outer_type || context.speculative_outer_type) |
4d7cf10d | 3005 | && !context.restrict_to_inner_class (otr_type)) |
3e86c6a8 JH |
3006 | { |
3007 | if (completep) | |
a1981458 | 3008 | *completep = true; |
beb683ab MJ |
3009 | if (cache_token) |
3010 | *cache_token = NULL; | |
3e86c6a8 JH |
3011 | return nodes; |
3012 | } | |
a1981458 | 3013 | gcc_assert (!context.invalid); |
eefe9a99 | 3014 | |
4d7cf10d | 3015 | /* Check that restrict_to_inner_class kept the main variant. */ |
c7e1befa JH |
3016 | gcc_assert (!context.outer_type |
3017 | || TYPE_MAIN_VARIANT (context.outer_type) == context.outer_type); | |
3018 | ||
79c7de84 | 3019 | /* We canonicalize our query, so we do not need extra hashtable entries. */ |
68377e53 JH |
3020 | |
3021 | /* Without outer type, we have no use for offset. Just do the | |
d6ae9a6d | 3022 | basic search from inner type. */ |
68377e53 | 3023 | if (!context.outer_type) |
6ff65dd7 | 3024 | context.clear_outer_type (otr_type); |
d6ae9a6d | 3025 | /* We need to update our hierarchy if the type does not exist. */ |
68377e53 | 3026 | outer_type = get_odr_type (context.outer_type, true); |
ec77d61f | 3027 | /* If the type is complete, there are no derivations. */ |
68377e53 JH |
3028 | if (TYPE_FINAL_P (outer_type->type)) |
3029 | context.maybe_derived_type = false; | |
eefe9a99 JH |
3030 | |
3031 | /* Initialize query cache. */ | |
3032 | if (!cached_polymorphic_call_targets) | |
3033 | { | |
6e2830c3 | 3034 | cached_polymorphic_call_targets = new hash_set<cgraph_node *>; |
c203e8a7 TS |
3035 | polymorphic_call_target_hash |
3036 | = new polymorphic_call_target_hash_type (23); | |
eefe9a99 | 3037 | if (!node_removal_hook_holder) |
3462aa02 JH |
3038 | { |
3039 | node_removal_hook_holder = | |
3dafb85c ML |
3040 | symtab->add_cgraph_removal_hook (&devirt_node_removal_hook, NULL); |
3041 | symtab->add_varpool_removal_hook (&devirt_variable_node_removal_hook, | |
3462aa02 JH |
3042 | NULL); |
3043 | } | |
eefe9a99 JH |
3044 | } |
3045 | ||
21a9ce6e JH |
3046 | if (in_lto_p) |
3047 | { | |
3048 | if (context.outer_type != otr_type) | |
3049 | context.outer_type | |
3050 | = get_odr_type (context.outer_type, true)->type; | |
3051 | if (context.speculative_outer_type) | |
3052 | context.speculative_outer_type | |
3053 | = get_odr_type (context.speculative_outer_type, true)->type; | |
3054 | } | |
3055 | ||
d6ae9a6d | 3056 | /* Look up cached answer. */ |
eefe9a99 JH |
3057 | key.type = type; |
3058 | key.otr_token = otr_token; | |
2f28755f | 3059 | key.speculative = speculative; |
68377e53 | 3060 | key.context = context; |
c203e8a7 | 3061 | slot = polymorphic_call_target_hash->find_slot (&key, INSERT); |
eefe9a99 JH |
3062 | if (cache_token) |
3063 | *cache_token = (void *)*slot; | |
3064 | if (*slot) | |
68377e53 JH |
3065 | { |
3066 | if (completep) | |
ec77d61f | 3067 | *completep = (*slot)->complete; |
91bc34a9 JH |
3068 | if ((*slot)->type_warning && final_warning_records) |
3069 | { | |
3070 | final_warning_records->type_warnings[(*slot)->type_warning - 1].count++; | |
3995f3a2 JH |
3071 | if (!final_warning_records->type_warnings |
3072 | [(*slot)->type_warning - 1].dyn_count.initialized_p ()) | |
3073 | final_warning_records->type_warnings | |
3074 | [(*slot)->type_warning - 1].dyn_count = profile_count::zero (); | |
3075 | if (final_warning_records->dyn_count > 0) | |
3076 | final_warning_records->type_warnings[(*slot)->type_warning - 1].dyn_count | |
3077 | = final_warning_records->type_warnings[(*slot)->type_warning - 1].dyn_count | |
3078 | + final_warning_records->dyn_count; | |
91bc34a9 | 3079 | } |
2f28755f | 3080 | if (!speculative && (*slot)->decl_warning && final_warning_records) |
91bc34a9 JH |
3081 | { |
3082 | struct decl_warn_count *c = | |
3083 | final_warning_records->decl_warnings.get ((*slot)->decl_warning); | |
3084 | c->count++; | |
3995f3a2 JH |
3085 | if (final_warning_records->dyn_count > 0) |
3086 | c->dyn_count += final_warning_records->dyn_count; | |
91bc34a9 | 3087 | } |
68377e53 JH |
3088 | return (*slot)->targets; |
3089 | } | |
3090 | ||
ec77d61f | 3091 | complete = true; |
eefe9a99 JH |
3092 | |
3093 | /* Do actual search. */ | |
3094 | timevar_push (TV_IPA_VIRTUAL_CALL); | |
3095 | *slot = XCNEW (polymorphic_call_target_d); | |
3096 | if (cache_token) | |
68377e53 | 3097 | *cache_token = (void *)*slot; |
eefe9a99 JH |
3098 | (*slot)->type = type; |
3099 | (*slot)->otr_token = otr_token; | |
68377e53 | 3100 | (*slot)->context = context; |
2f28755f | 3101 | (*slot)->speculative = speculative; |
eefe9a99 | 3102 | |
6e2830c3 TS |
3103 | hash_set<tree> inserted; |
3104 | hash_set<tree> matched_vtables; | |
eefe9a99 | 3105 | |
91bc34a9 | 3106 | /* First insert targets we speculatively identified as likely. */ |
a0fd3373 JH |
3107 | if (context.speculative_outer_type) |
3108 | { | |
3109 | odr_type speculative_outer_type; | |
91bc34a9 JH |
3110 | bool speculation_complete = true; |
3111 | ||
d6ae9a6d SL |
3112 | /* First insert target from type itself and check if it may have |
3113 | derived types. */ | |
a0fd3373 JH |
3114 | speculative_outer_type = get_odr_type (context.speculative_outer_type, true); |
3115 | if (TYPE_FINAL_P (speculative_outer_type->type)) | |
3116 | context.speculative_maybe_derived_type = false; | |
3117 | binfo = get_binfo_at_offset (TYPE_BINFO (speculative_outer_type->type), | |
3118 | context.speculative_offset, otr_type); | |
3119 | if (binfo) | |
3120 | target = gimple_get_virt_method_for_binfo (otr_token, binfo, | |
3121 | &can_refer); | |
3122 | else | |
3123 | target = NULL; | |
3124 | ||
91bc34a9 JH |
3125 | /* In the case we get complete method, we don't need |
3126 | to walk derivations. */ | |
3127 | if (target && DECL_FINAL_P (target)) | |
3128 | context.speculative_maybe_derived_type = false; | |
a0fd3373 | 3129 | if (type_possibly_instantiated_p (speculative_outer_type->type)) |
91bc34a9 | 3130 | maybe_record_node (nodes, target, &inserted, can_refer, &speculation_complete); |
a0fd3373 | 3131 | if (binfo) |
6e2830c3 | 3132 | matched_vtables.add (BINFO_VTABLE (binfo)); |
91bc34a9 | 3133 | |
9716cc3e | 3134 | |
a0fd3373 JH |
3135 | /* Next walk recursively all derived types. */ |
3136 | if (context.speculative_maybe_derived_type) | |
91bc34a9 JH |
3137 | for (i = 0; i < speculative_outer_type->derived_types.length(); i++) |
3138 | possible_polymorphic_call_targets_1 (nodes, &inserted, | |
3139 | &matched_vtables, | |
3140 | otr_type, | |
3141 | speculative_outer_type->derived_types[i], | |
3142 | otr_token, speculative_outer_type->type, | |
3143 | context.speculative_offset, | |
3144 | &speculation_complete, | |
3145 | bases_to_consider, | |
3146 | false); | |
a0fd3373 JH |
3147 | } |
3148 | ||
2f28755f | 3149 | if (!speculative || !nodes.length ()) |
68377e53 | 3150 | { |
2f28755f JH |
3151 | /* First see virtual method of type itself. */ |
3152 | binfo = get_binfo_at_offset (TYPE_BINFO (outer_type->type), | |
3153 | context.offset, otr_type); | |
3154 | if (binfo) | |
3155 | target = gimple_get_virt_method_for_binfo (otr_token, binfo, | |
3156 | &can_refer); | |
3157 | else | |
3158 | { | |
3159 | gcc_assert (odr_violation_reported); | |
3160 | target = NULL; | |
3161 | } | |
68377e53 | 3162 | |
2f28755f JH |
3163 | /* Destructors are never called through construction virtual tables, |
3164 | because the type is always known. */ | |
3165 | if (target && DECL_CXX_DESTRUCTOR_P (target)) | |
3166 | context.maybe_in_construction = false; | |
ec77d61f | 3167 | |
2f28755f JH |
3168 | if (target) |
3169 | { | |
3170 | /* In the case we get complete method, we don't need | |
3171 | to walk derivations. */ | |
3172 | if (DECL_FINAL_P (target)) | |
3173 | context.maybe_derived_type = false; | |
3174 | } | |
2d1644bf | 3175 | |
2f28755f JH |
3176 | /* If OUTER_TYPE is abstract, we know we are not seeing its instance. */ |
3177 | if (type_possibly_instantiated_p (outer_type->type)) | |
3178 | maybe_record_node (nodes, target, &inserted, can_refer, &complete); | |
3179 | else | |
3180 | skipped = true; | |
79c7de84 | 3181 | |
2f28755f JH |
3182 | if (binfo) |
3183 | matched_vtables.add (BINFO_VTABLE (binfo)); | |
eefe9a99 | 3184 | |
2f28755f JH |
3185 | /* Next walk recursively all derived types. */ |
3186 | if (context.maybe_derived_type) | |
91bc34a9 | 3187 | { |
2f28755f JH |
3188 | for (i = 0; i < outer_type->derived_types.length(); i++) |
3189 | possible_polymorphic_call_targets_1 (nodes, &inserted, | |
3190 | &matched_vtables, | |
3191 | otr_type, | |
3192 | outer_type->derived_types[i], | |
3193 | otr_token, outer_type->type, | |
3194 | context.offset, &complete, | |
3195 | bases_to_consider, | |
3196 | context.maybe_in_construction); | |
3197 | ||
3198 | if (!outer_type->all_derivations_known) | |
91bc34a9 | 3199 | { |
079cd854 | 3200 | if (!speculative && final_warning_records |
448476ff | 3201 | && nodes.length () == 1 |
079cd854 | 3202 | && TREE_CODE (TREE_TYPE (nodes[0]->decl)) == METHOD_TYPE) |
91bc34a9 | 3203 | { |
2f28755f | 3204 | if (complete |
2f28755f JH |
3205 | && warn_suggest_final_types |
3206 | && !outer_type->derived_types.length ()) | |
91bc34a9 | 3207 | { |
53b73588 ML |
3208 | final_warning_records->grow_type_warnings |
3209 | (outer_type->id); | |
2f28755f | 3210 | final_warning_records->type_warnings[outer_type->id].count++; |
3995f3a2 JH |
3211 | if (!final_warning_records->type_warnings |
3212 | [outer_type->id].dyn_count.initialized_p ()) | |
3213 | final_warning_records->type_warnings | |
3214 | [outer_type->id].dyn_count = profile_count::zero (); | |
2f28755f JH |
3215 | final_warning_records->type_warnings[outer_type->id].dyn_count |
3216 | += final_warning_records->dyn_count; | |
3217 | final_warning_records->type_warnings[outer_type->id].type | |
3218 | = outer_type->type; | |
3219 | (*slot)->type_warning = outer_type->id + 1; | |
91bc34a9 | 3220 | } |
2f28755f JH |
3221 | if (complete |
3222 | && warn_suggest_final_methods | |
2f28755f JH |
3223 | && types_same_for_odr (DECL_CONTEXT (nodes[0]->decl), |
3224 | outer_type->type)) | |
91bc34a9 | 3225 | { |
2f28755f JH |
3226 | bool existed; |
3227 | struct decl_warn_count &c = | |
3228 | final_warning_records->decl_warnings.get_or_insert | |
3229 | (nodes[0]->decl, &existed); | |
3230 | ||
3231 | if (existed) | |
3232 | { | |
3233 | c.count++; | |
3234 | c.dyn_count += final_warning_records->dyn_count; | |
3235 | } | |
3236 | else | |
3237 | { | |
3238 | c.count = 1; | |
3239 | c.dyn_count = final_warning_records->dyn_count; | |
3240 | c.decl = nodes[0]->decl; | |
3241 | } | |
3242 | (*slot)->decl_warning = nodes[0]->decl; | |
91bc34a9 | 3243 | } |
91bc34a9 | 3244 | } |
2f28755f | 3245 | complete = false; |
91bc34a9 | 3246 | } |
91bc34a9 | 3247 | } |
2d1644bf | 3248 | |
2f28755f JH |
3249 | if (!speculative) |
3250 | { | |
3251 | /* Destructors are never called through construction virtual tables, | |
d6ae9a6d SL |
3252 | because the type is always known. One of entries may be |
3253 | cxa_pure_virtual so look to at least two of them. */ | |
2f28755f JH |
3254 | if (context.maybe_in_construction) |
3255 | for (i =0 ; i < MIN (nodes.length (), 2); i++) | |
3256 | if (DECL_CXX_DESTRUCTOR_P (nodes[i]->decl)) | |
3257 | context.maybe_in_construction = false; | |
3258 | if (context.maybe_in_construction) | |
3259 | { | |
3260 | if (type != outer_type | |
3261 | && (!skipped | |
3262 | || (context.maybe_derived_type | |
3263 | && !type_all_derivations_known_p (outer_type->type)))) | |
3264 | record_targets_from_bases (otr_type, otr_token, outer_type->type, | |
3265 | context.offset, nodes, &inserted, | |
3266 | &matched_vtables, &complete); | |
3267 | if (skipped) | |
3268 | maybe_record_node (nodes, target, &inserted, can_refer, &complete); | |
3269 | for (i = 0; i < bases_to_consider.length(); i++) | |
3270 | maybe_record_node (nodes, bases_to_consider[i], &inserted, can_refer, &complete); | |
3271 | } | |
3272 | } | |
2d1644bf | 3273 | } |
ec77d61f | 3274 | |
eefe9a99 | 3275 | (*slot)->targets = nodes; |
ec77d61f | 3276 | (*slot)->complete = complete; |
68377e53 | 3277 | if (completep) |
ec77d61f | 3278 | *completep = complete; |
eefe9a99 | 3279 | |
eefe9a99 JH |
3280 | timevar_pop (TV_IPA_VIRTUAL_CALL); |
3281 | return nodes; | |
3282 | } | |
3283 | ||
91bc34a9 JH |
3284 | bool |
3285 | add_decl_warning (const tree &key ATTRIBUTE_UNUSED, const decl_warn_count &value, | |
3286 | vec<const decl_warn_count*> *vec) | |
3287 | { | |
3288 | vec->safe_push (&value); | |
3289 | return true; | |
3290 | } | |
3291 | ||
2f28755f JH |
3292 | /* Dump target list TARGETS into FILE. */ |
3293 | ||
3294 | static void | |
3295 | dump_targets (FILE *f, vec <cgraph_node *> targets) | |
3296 | { | |
3297 | unsigned int i; | |
3298 | ||
3299 | for (i = 0; i < targets.length (); i++) | |
3300 | { | |
3301 | char *name = NULL; | |
3302 | if (in_lto_p) | |
3303 | name = cplus_demangle_v3 (targets[i]->asm_name (), 0); | |
464d0118 ML |
3304 | fprintf (f, " %s/%i", name ? name : targets[i]->name (), |
3305 | targets[i]->order); | |
2f28755f JH |
3306 | if (in_lto_p) |
3307 | free (name); | |
3308 | if (!targets[i]->definition) | |
3309 | fprintf (f, " (no definition%s)", | |
3310 | DECL_DECLARED_INLINE_P (targets[i]->decl) | |
3311 | ? " inline" : ""); | |
3312 | } | |
3313 | fprintf (f, "\n"); | |
3314 | } | |
3315 | ||
eefe9a99 JH |
3316 | /* Dump all possible targets of a polymorphic call. */ |
3317 | ||
3318 | void | |
3319 | dump_possible_polymorphic_call_targets (FILE *f, | |
68377e53 JH |
3320 | tree otr_type, |
3321 | HOST_WIDE_INT otr_token, | |
3322 | const ipa_polymorphic_call_context &ctx) | |
eefe9a99 JH |
3323 | { |
3324 | vec <cgraph_node *> targets; | |
3325 | bool final; | |
549bcbd1 | 3326 | odr_type type = get_odr_type (TYPE_MAIN_VARIANT (otr_type), false); |
2f28755f | 3327 | unsigned int len; |
eefe9a99 JH |
3328 | |
3329 | if (!type) | |
3330 | return; | |
3331 | targets = possible_polymorphic_call_targets (otr_type, otr_token, | |
68377e53 | 3332 | ctx, |
2f28755f | 3333 | &final, NULL, false); |
68377e53 | 3334 | fprintf (f, " Targets of polymorphic call of type %i:", type->id); |
eefe9a99 | 3335 | print_generic_expr (f, type->type, TDF_SLIM); |
ec77d61f | 3336 | fprintf (f, " token %i\n", (int)otr_token); |
a1981458 JH |
3337 | |
3338 | ctx.dump (f); | |
ec77d61f | 3339 | |
a0fd3373 | 3340 | fprintf (f, " %s%s%s%s\n ", |
ec77d61f | 3341 | final ? "This is a complete list." : |
68377e53 JH |
3342 | "This is partial list; extra targets may be defined in other units.", |
3343 | ctx.maybe_in_construction ? " (base types included)" : "", | |
a0fd3373 JH |
3344 | ctx.maybe_derived_type ? " (derived types included)" : "", |
3345 | ctx.speculative_maybe_derived_type ? " (speculative derived types included)" : ""); | |
2f28755f JH |
3346 | len = targets.length (); |
3347 | dump_targets (f, targets); | |
3348 | ||
3349 | targets = possible_polymorphic_call_targets (otr_type, otr_token, | |
3350 | ctx, | |
3351 | &final, NULL, true); | |
2f28755f | 3352 | if (targets.length () != len) |
ec77d61f | 3353 | { |
2f28755f JH |
3354 | fprintf (f, " Speculative targets:"); |
3355 | dump_targets (f, targets); | |
ec77d61f | 3356 | } |
3ebd8e62 ML |
3357 | /* Ugly: during callgraph construction the target cache may get populated |
3358 | before all targets are found. While this is harmless (because all local | |
3359 | types are discovered and only in those case we devirtualize fully and we | |
3360 | don't do speculative devirtualization before IPA stage) it triggers | |
3361 | assert here when dumping at that stage also populates the case with | |
3362 | speculative targets. Quietly ignore this. */ | |
3363 | gcc_assert (symtab->state < IPA_SSA || targets.length () <= len); | |
2f28755f | 3364 | fprintf (f, "\n"); |
eefe9a99 JH |
3365 | } |
3366 | ||
0e1474e5 JH |
3367 | |
3368 | /* Return true if N can be possibly target of a polymorphic call of | |
3369 | OTR_TYPE/OTR_TOKEN. */ | |
3370 | ||
3371 | bool | |
3372 | possible_polymorphic_call_target_p (tree otr_type, | |
3373 | HOST_WIDE_INT otr_token, | |
68377e53 | 3374 | const ipa_polymorphic_call_context &ctx, |
0e1474e5 JH |
3375 | struct cgraph_node *n) |
3376 | { | |
3377 | vec <cgraph_node *> targets; | |
3378 | unsigned int i; | |
68377e53 | 3379 | enum built_in_function fcode; |
450ad0cd | 3380 | bool final; |
0e1474e5 | 3381 | |
68377e53 | 3382 | if (TREE_CODE (TREE_TYPE (n->decl)) == FUNCTION_TYPE |
d27ecc49 | 3383 | && ((fcode = DECL_FUNCTION_CODE (n->decl)) == BUILT_IN_UNREACHABLE |
68377e53 JH |
3384 | || fcode == BUILT_IN_TRAP)) |
3385 | return true; | |
3386 | ||
ceda2c69 JH |
3387 | if (is_cxa_pure_virtual_p (n->decl)) |
3388 | return true; | |
3389 | ||
c203e8a7 | 3390 | if (!odr_hash) |
0e1474e5 | 3391 | return true; |
68377e53 | 3392 | targets = possible_polymorphic_call_targets (otr_type, otr_token, ctx, &final); |
0e1474e5 | 3393 | for (i = 0; i < targets.length (); i++) |
d52f5295 | 3394 | if (n->semantically_equivalent_p (targets[i])) |
0e1474e5 | 3395 | return true; |
450ad0cd JH |
3396 | |
3397 | /* At a moment we allow middle end to dig out new external declarations | |
3398 | as a targets of polymorphic calls. */ | |
67348ccc | 3399 | if (!final && !n->definition) |
450ad0cd | 3400 | return true; |
0e1474e5 JH |
3401 | return false; |
3402 | } | |
3403 | ||
3404 | ||
6f8091fc JH |
3405 | |
3406 | /* Return true if N can be possibly target of a polymorphic call of | |
3407 | OBJ_TYPE_REF expression REF in STMT. */ | |
3408 | ||
3409 | bool | |
3410 | possible_polymorphic_call_target_p (tree ref, | |
355fe088 | 3411 | gimple *stmt, |
6f8091fc JH |
3412 | struct cgraph_node *n) |
3413 | { | |
3414 | ipa_polymorphic_call_context context (current_function_decl, ref, stmt); | |
3415 | tree call_fn = gimple_call_fn (stmt); | |
3416 | ||
3417 | return possible_polymorphic_call_target_p (obj_type_ref_class (call_fn), | |
3418 | tree_to_uhwi | |
3419 | (OBJ_TYPE_REF_TOKEN (call_fn)), | |
3420 | context, | |
3421 | n); | |
3422 | } | |
3423 | ||
3424 | ||
0e1474e5 JH |
3425 | /* After callgraph construction new external nodes may appear. |
3426 | Add them into the graph. */ | |
3427 | ||
3428 | void | |
3429 | update_type_inheritance_graph (void) | |
3430 | { | |
3431 | struct cgraph_node *n; | |
3432 | ||
c203e8a7 | 3433 | if (!odr_hash) |
0e1474e5 JH |
3434 | return; |
3435 | free_polymorphic_call_targets_hash (); | |
3436 | timevar_push (TV_IPA_INHERITANCE); | |
68377e53 | 3437 | /* We reconstruct the graph starting from types of all methods seen in the |
6af801f5 | 3438 | unit. */ |
0e1474e5 | 3439 | FOR_EACH_FUNCTION (n) |
67348ccc DM |
3440 | if (DECL_VIRTUAL_P (n->decl) |
3441 | && !n->definition | |
d52f5295 | 3442 | && n->real_symbol_p ()) |
70e7f2a2 | 3443 | get_odr_type (TYPE_METHOD_BASETYPE (TREE_TYPE (n->decl)), true); |
0e1474e5 JH |
3444 | timevar_pop (TV_IPA_INHERITANCE); |
3445 | } | |
bbc9396b JH |
3446 | |
3447 | ||
3448 | /* Return true if N looks like likely target of a polymorphic call. | |
3449 | Rule out cxa_pure_virtual, noreturns, function declared cold and | |
3450 | other obvious cases. */ | |
3451 | ||
3452 | bool | |
3453 | likely_target_p (struct cgraph_node *n) | |
3454 | { | |
3455 | int flags; | |
3456 | /* cxa_pure_virtual and similar things are not likely. */ | |
67348ccc | 3457 | if (TREE_CODE (TREE_TYPE (n->decl)) != METHOD_TYPE) |
bbc9396b | 3458 | return false; |
67348ccc | 3459 | flags = flags_from_decl_or_type (n->decl); |
bbc9396b JH |
3460 | if (flags & ECF_NORETURN) |
3461 | return false; | |
3462 | if (lookup_attribute ("cold", | |
67348ccc | 3463 | DECL_ATTRIBUTES (n->decl))) |
bbc9396b JH |
3464 | return false; |
3465 | if (n->frequency < NODE_FREQUENCY_NORMAL) | |
3466 | return false; | |
d6ae9a6d SL |
3467 | /* If there are no live virtual tables referring the target, |
3468 | the only way the target can be called is an instance coming from other | |
3469 | compilation unit; speculative devirtualization is built around an | |
ccb05ef2 JH |
3470 | assumption that won't happen. */ |
3471 | if (!referenced_from_vtable_p (n)) | |
3472 | return false; | |
bbc9396b JH |
3473 | return true; |
3474 | } | |
3475 | ||
d6ae9a6d | 3476 | /* Compare type warning records P1 and P2 and choose one with larger count; |
91bc34a9 JH |
3477 | helper for qsort. */ |
3478 | ||
3479 | int | |
3480 | type_warning_cmp (const void *p1, const void *p2) | |
3481 | { | |
3482 | const odr_type_warn_count *t1 = (const odr_type_warn_count *)p1; | |
3483 | const odr_type_warn_count *t2 = (const odr_type_warn_count *)p2; | |
3484 | ||
3485 | if (t1->dyn_count < t2->dyn_count) | |
3486 | return 1; | |
3487 | if (t1->dyn_count > t2->dyn_count) | |
3488 | return -1; | |
3489 | return t2->count - t1->count; | |
3490 | } | |
3491 | ||
d6ae9a6d | 3492 | /* Compare decl warning records P1 and P2 and choose one with larger count; |
91bc34a9 JH |
3493 | helper for qsort. */ |
3494 | ||
3495 | int | |
3496 | decl_warning_cmp (const void *p1, const void *p2) | |
3497 | { | |
3498 | const decl_warn_count *t1 = *(const decl_warn_count * const *)p1; | |
3499 | const decl_warn_count *t2 = *(const decl_warn_count * const *)p2; | |
3500 | ||
3501 | if (t1->dyn_count < t2->dyn_count) | |
3502 | return 1; | |
3503 | if (t1->dyn_count > t2->dyn_count) | |
3504 | return -1; | |
3505 | return t2->count - t1->count; | |
3506 | } | |
3507 | ||
5ce97055 | 3508 | |
d6ae9a6d | 3509 | /* Try to speculatively devirtualize call to OTR_TYPE with OTR_TOKEN with |
5ce97055 JH |
3510 | context CTX. */ |
3511 | ||
3512 | struct cgraph_node * | |
3513 | try_speculative_devirtualization (tree otr_type, HOST_WIDE_INT otr_token, | |
3514 | ipa_polymorphic_call_context ctx) | |
3515 | { | |
3516 | vec <cgraph_node *>targets | |
3517 | = possible_polymorphic_call_targets | |
3518 | (otr_type, otr_token, ctx, NULL, NULL, true); | |
3519 | unsigned int i; | |
3520 | struct cgraph_node *likely_target = NULL; | |
3521 | ||
3522 | for (i = 0; i < targets.length (); i++) | |
3523 | if (likely_target_p (targets[i])) | |
3524 | { | |
3525 | if (likely_target) | |
3526 | return NULL; | |
3527 | likely_target = targets[i]; | |
3528 | } | |
3529 | if (!likely_target | |
3530 | ||!likely_target->definition | |
3531 | || DECL_EXTERNAL (likely_target->decl)) | |
3532 | return NULL; | |
3533 | ||
3534 | /* Don't use an implicitly-declared destructor (c++/58678). */ | |
3535 | struct cgraph_node *non_thunk_target | |
3536 | = likely_target->function_symbol (); | |
3537 | if (DECL_ARTIFICIAL (non_thunk_target->decl)) | |
3538 | return NULL; | |
3539 | if (likely_target->get_availability () <= AVAIL_INTERPOSABLE | |
3540 | && likely_target->can_be_discarded_p ()) | |
3541 | return NULL; | |
3542 | return likely_target; | |
3543 | } | |
3544 | ||
bbc9396b | 3545 | /* The ipa-devirt pass. |
3462aa02 | 3546 | When polymorphic call has only one likely target in the unit, |
d6ae9a6d | 3547 | turn it into a speculative call. */ |
bbc9396b JH |
3548 | |
3549 | static unsigned int | |
3550 | ipa_devirt (void) | |
3551 | { | |
3552 | struct cgraph_node *n; | |
6e2830c3 | 3553 | hash_set<void *> bad_call_targets; |
bbc9396b JH |
3554 | struct cgraph_edge *e; |
3555 | ||
3556 | int npolymorphic = 0, nspeculated = 0, nconverted = 0, ncold = 0; | |
3557 | int nmultiple = 0, noverwritable = 0, ndevirtualized = 0, nnotdefined = 0; | |
570215f9 | 3558 | int nwrong = 0, nok = 0, nexternal = 0, nartificial = 0; |
68c9467f | 3559 | int ndropped = 0; |
bbc9396b | 3560 | |
4cd5658b MT |
3561 | if (!odr_types_ptr) |
3562 | return 0; | |
3563 | ||
609570b4 JH |
3564 | if (dump_file) |
3565 | dump_type_inheritance_graph (dump_file); | |
3566 | ||
91bc34a9 JH |
3567 | /* We can output -Wsuggest-final-methods and -Wsuggest-final-types warnings. |
3568 | This is implemented by setting up final_warning_records that are updated | |
3569 | by get_polymorphic_call_targets. | |
3570 | We need to clear cache in this case to trigger recomputation of all | |
3571 | entries. */ | |
3572 | if (warn_suggest_final_methods || warn_suggest_final_types) | |
3573 | { | |
3574 | final_warning_records = new (final_warning_record); | |
3995f3a2 | 3575 | final_warning_records->dyn_count = profile_count::zero (); |
53b73588 | 3576 | final_warning_records->grow_type_warnings (odr_types.length ()); |
91bc34a9 JH |
3577 | free_polymorphic_call_targets_hash (); |
3578 | } | |
3579 | ||
bbc9396b JH |
3580 | FOR_EACH_DEFINED_FUNCTION (n) |
3581 | { | |
3582 | bool update = false; | |
2bf86c84 JH |
3583 | if (!opt_for_fn (n->decl, flag_devirtualize)) |
3584 | continue; | |
bbc9396b | 3585 | if (dump_file && n->indirect_calls) |
464d0118 ML |
3586 | fprintf (dump_file, "\n\nProcesing function %s\n", |
3587 | n->dump_name ()); | |
bbc9396b JH |
3588 | for (e = n->indirect_calls; e; e = e->next_callee) |
3589 | if (e->indirect_info->polymorphic) | |
3590 | { | |
3591 | struct cgraph_node *likely_target = NULL; | |
3592 | void *cache_token; | |
3593 | bool final; | |
91bc34a9 JH |
3594 | |
3595 | if (final_warning_records) | |
1bad9c18 | 3596 | final_warning_records->dyn_count = e->count.ipa (); |
91bc34a9 | 3597 | |
bbc9396b JH |
3598 | vec <cgraph_node *>targets |
3599 | = possible_polymorphic_call_targets | |
2f28755f | 3600 | (e, &final, &cache_token, true); |
bbc9396b JH |
3601 | unsigned int i; |
3602 | ||
2f28755f JH |
3603 | /* Trigger warnings by calculating non-speculative targets. */ |
3604 | if (warn_suggest_final_methods || warn_suggest_final_types) | |
3605 | possible_polymorphic_call_targets (e); | |
3606 | ||
bbc9396b JH |
3607 | if (dump_file) |
3608 | dump_possible_polymorphic_call_targets | |
3609 | (dump_file, e); | |
3462aa02 | 3610 | |
bbc9396b JH |
3611 | npolymorphic++; |
3612 | ||
68c9467f JH |
3613 | /* See if the call can be devirtualized by means of ipa-prop's |
3614 | polymorphic call context propagation. If not, we can just | |
3615 | forget about this call being polymorphic and avoid some heavy | |
3616 | lifting in remove_unreachable_nodes that will otherwise try to | |
3617 | keep all possible targets alive until inlining and in the inliner | |
3618 | itself. | |
3619 | ||
3620 | This may need to be revisited once we add further ways to use | |
3621 | the may edges, but it is a resonable thing to do right now. */ | |
3622 | ||
3623 | if ((e->indirect_info->param_index == -1 | |
3624 | || (!opt_for_fn (n->decl, flag_devirtualize_speculatively) | |
3625 | && e->indirect_info->vptr_changed)) | |
3626 | && !flag_ltrans_devirtualize) | |
3627 | { | |
3628 | e->indirect_info->polymorphic = false; | |
3629 | ndropped++; | |
3630 | if (dump_file) | |
3631 | fprintf (dump_file, "Dropping polymorphic call info;" | |
3632 | " it can not be used by ipa-prop\n"); | |
3633 | } | |
3634 | ||
2bf86c84 | 3635 | if (!opt_for_fn (n->decl, flag_devirtualize_speculatively)) |
91bc34a9 JH |
3636 | continue; |
3637 | ||
3dafb85c | 3638 | if (!e->maybe_hot_p ()) |
bbc9396b JH |
3639 | { |
3640 | if (dump_file) | |
ec77d61f | 3641 | fprintf (dump_file, "Call is cold\n\n"); |
bbc9396b JH |
3642 | ncold++; |
3643 | continue; | |
3644 | } | |
3645 | if (e->speculative) | |
3646 | { | |
3647 | if (dump_file) | |
d6ae9a6d | 3648 | fprintf (dump_file, "Call is already speculated\n\n"); |
bbc9396b JH |
3649 | nspeculated++; |
3650 | ||
3651 | /* When dumping see if we agree with speculation. */ | |
3652 | if (!dump_file) | |
3653 | continue; | |
3654 | } | |
6e2830c3 | 3655 | if (bad_call_targets.contains (cache_token)) |
bbc9396b JH |
3656 | { |
3657 | if (dump_file) | |
ec77d61f | 3658 | fprintf (dump_file, "Target list is known to be useless\n\n"); |
bbc9396b JH |
3659 | nmultiple++; |
3660 | continue; | |
3661 | } | |
c3284718 | 3662 | for (i = 0; i < targets.length (); i++) |
bbc9396b JH |
3663 | if (likely_target_p (targets[i])) |
3664 | { | |
3665 | if (likely_target) | |
3666 | { | |
2f28755f JH |
3667 | likely_target = NULL; |
3668 | if (dump_file) | |
3669 | fprintf (dump_file, "More than one likely target\n\n"); | |
3670 | nmultiple++; | |
bbc9396b JH |
3671 | break; |
3672 | } | |
3673 | likely_target = targets[i]; | |
3674 | } | |
3675 | if (!likely_target) | |
3676 | { | |
6e2830c3 | 3677 | bad_call_targets.add (cache_token); |
bbc9396b JH |
3678 | continue; |
3679 | } | |
3680 | /* This is reached only when dumping; check if we agree or disagree | |
3681 | with the speculation. */ | |
3682 | if (e->speculative) | |
3683 | { | |
3684 | struct cgraph_edge *e2; | |
3685 | struct ipa_ref *ref; | |
3dafb85c | 3686 | e->speculative_call_info (e2, e, ref); |
d52f5295 ML |
3687 | if (e2->callee->ultimate_alias_target () |
3688 | == likely_target->ultimate_alias_target ()) | |
bbc9396b | 3689 | { |
ec77d61f | 3690 | fprintf (dump_file, "We agree with speculation\n\n"); |
bbc9396b JH |
3691 | nok++; |
3692 | } | |
3693 | else | |
3694 | { | |
ec77d61f | 3695 | fprintf (dump_file, "We disagree with speculation\n\n"); |
bbc9396b JH |
3696 | nwrong++; |
3697 | } | |
3698 | continue; | |
3699 | } | |
67348ccc | 3700 | if (!likely_target->definition) |
bbc9396b JH |
3701 | { |
3702 | if (dump_file) | |
d6ae9a6d | 3703 | fprintf (dump_file, "Target is not a definition\n\n"); |
bbc9396b JH |
3704 | nnotdefined++; |
3705 | continue; | |
3706 | } | |
3707 | /* Do not introduce new references to external symbols. While we | |
3708 | can handle these just well, it is common for programs to | |
3709 | incorrectly with headers defining methods they are linked | |
3710 | with. */ | |
67348ccc | 3711 | if (DECL_EXTERNAL (likely_target->decl)) |
bbc9396b JH |
3712 | { |
3713 | if (dump_file) | |
ec77d61f | 3714 | fprintf (dump_file, "Target is external\n\n"); |
bbc9396b JH |
3715 | nexternal++; |
3716 | continue; | |
3717 | } | |
570215f9 JM |
3718 | /* Don't use an implicitly-declared destructor (c++/58678). */ |
3719 | struct cgraph_node *non_thunk_target | |
d52f5295 | 3720 | = likely_target->function_symbol (); |
89632536 | 3721 | if (DECL_ARTIFICIAL (non_thunk_target->decl)) |
570215f9 JM |
3722 | { |
3723 | if (dump_file) | |
3724 | fprintf (dump_file, "Target is artificial\n\n"); | |
3725 | nartificial++; | |
3726 | continue; | |
3727 | } | |
d52f5295 ML |
3728 | if (likely_target->get_availability () <= AVAIL_INTERPOSABLE |
3729 | && likely_target->can_be_discarded_p ()) | |
bbc9396b JH |
3730 | { |
3731 | if (dump_file) | |
ec77d61f | 3732 | fprintf (dump_file, "Target is overwritable\n\n"); |
bbc9396b JH |
3733 | noverwritable++; |
3734 | continue; | |
3735 | } | |
2b5f0895 | 3736 | else if (dbg_cnt (devirt)) |
bbc9396b | 3737 | { |
2b5f0895 XDL |
3738 | if (dump_enabled_p ()) |
3739 | { | |
807b7d62 | 3740 | location_t locus = gimple_location_safe (e->call_stmt); |
2b5f0895 | 3741 | dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, locus, |
464d0118 ML |
3742 | "speculatively devirtualizing call " |
3743 | "in %s to %s\n", | |
3744 | n->dump_name (), | |
3745 | likely_target->dump_name ()); | |
2b5f0895 | 3746 | } |
d52f5295 | 3747 | if (!likely_target->can_be_discarded_p ()) |
5b79657a JH |
3748 | { |
3749 | cgraph_node *alias; | |
d52f5295 | 3750 | alias = dyn_cast<cgraph_node *> (likely_target->noninterposable_alias ()); |
5b79657a JH |
3751 | if (alias) |
3752 | likely_target = alias; | |
3753 | } | |
bbc9396b JH |
3754 | nconverted++; |
3755 | update = true; | |
3dafb85c | 3756 | e->make_speculative |
1bad9c18 | 3757 | (likely_target, e->count.apply_scale (8, 10)); |
bbc9396b JH |
3758 | } |
3759 | } | |
3760 | if (update) | |
0bceb671 | 3761 | ipa_update_overall_fn_summary (n); |
bbc9396b | 3762 | } |
91bc34a9 JH |
3763 | if (warn_suggest_final_methods || warn_suggest_final_types) |
3764 | { | |
3765 | if (warn_suggest_final_types) | |
3766 | { | |
3767 | final_warning_records->type_warnings.qsort (type_warning_cmp); | |
3768 | for (unsigned int i = 0; | |
3769 | i < final_warning_records->type_warnings.length (); i++) | |
3770 | if (final_warning_records->type_warnings[i].count) | |
3771 | { | |
9716cc3e | 3772 | tree type = final_warning_records->type_warnings[i].type; |
26e82579 | 3773 | int count = final_warning_records->type_warnings[i].count; |
3995f3a2 | 3774 | profile_count dyn_count |
26e82579 JH |
3775 | = final_warning_records->type_warnings[i].dyn_count; |
3776 | ||
3995f3a2 | 3777 | if (!(dyn_count > 0)) |
26e82579 JH |
3778 | warning_n (DECL_SOURCE_LOCATION (TYPE_NAME (type)), |
3779 | OPT_Wsuggest_final_types, count, | |
3780 | "Declaring type %qD final " | |
3781 | "would enable devirtualization of %i call", | |
3782 | "Declaring type %qD final " | |
3783 | "would enable devirtualization of %i calls", | |
3784 | type, | |
3785 | count); | |
3786 | else | |
3787 | warning_n (DECL_SOURCE_LOCATION (TYPE_NAME (type)), | |
3788 | OPT_Wsuggest_final_types, count, | |
3789 | "Declaring type %qD final " | |
3790 | "would enable devirtualization of %i call " | |
3791 | "executed %lli times", | |
3792 | "Declaring type %qD final " | |
3793 | "would enable devirtualization of %i calls " | |
3794 | "executed %lli times", | |
3795 | type, | |
3796 | count, | |
3995f3a2 | 3797 | (long long) dyn_count.to_gcov_type ()); |
91bc34a9 JH |
3798 | } |
3799 | } | |
3800 | ||
3801 | if (warn_suggest_final_methods) | |
3802 | { | |
ed37a6cf | 3803 | auto_vec<const decl_warn_count*> decl_warnings_vec; |
91bc34a9 JH |
3804 | |
3805 | final_warning_records->decl_warnings.traverse | |
3806 | <vec<const decl_warn_count *> *, add_decl_warning> (&decl_warnings_vec); | |
3807 | decl_warnings_vec.qsort (decl_warning_cmp); | |
3808 | for (unsigned int i = 0; i < decl_warnings_vec.length (); i++) | |
3809 | { | |
3810 | tree decl = decl_warnings_vec[i]->decl; | |
3811 | int count = decl_warnings_vec[i]->count; | |
3995f3a2 JH |
3812 | profile_count dyn_count |
3813 | = decl_warnings_vec[i]->dyn_count; | |
26e82579 | 3814 | |
3995f3a2 | 3815 | if (!(dyn_count > 0)) |
26e82579 JH |
3816 | if (DECL_CXX_DESTRUCTOR_P (decl)) |
3817 | warning_n (DECL_SOURCE_LOCATION (decl), | |
3818 | OPT_Wsuggest_final_methods, count, | |
3819 | "Declaring virtual destructor of %qD final " | |
3820 | "would enable devirtualization of %i call", | |
3821 | "Declaring virtual destructor of %qD final " | |
3822 | "would enable devirtualization of %i calls", | |
3823 | DECL_CONTEXT (decl), count); | |
3824 | else | |
3825 | warning_n (DECL_SOURCE_LOCATION (decl), | |
3826 | OPT_Wsuggest_final_methods, count, | |
3827 | "Declaring method %qD final " | |
3828 | "would enable devirtualization of %i call", | |
3829 | "Declaring method %qD final " | |
3830 | "would enable devirtualization of %i calls", | |
3831 | decl, count); | |
3832 | else if (DECL_CXX_DESTRUCTOR_P (decl)) | |
3833 | warning_n (DECL_SOURCE_LOCATION (decl), | |
3834 | OPT_Wsuggest_final_methods, count, | |
3835 | "Declaring virtual destructor of %qD final " | |
3836 | "would enable devirtualization of %i call " | |
3837 | "executed %lli times", | |
3838 | "Declaring virtual destructor of %qD final " | |
3839 | "would enable devirtualization of %i calls " | |
3840 | "executed %lli times", | |
3995f3a2 JH |
3841 | DECL_CONTEXT (decl), count, |
3842 | (long long)dyn_count.to_gcov_type ()); | |
26e82579 JH |
3843 | else |
3844 | warning_n (DECL_SOURCE_LOCATION (decl), | |
3845 | OPT_Wsuggest_final_methods, count, | |
3846 | "Declaring method %qD final " | |
3847 | "would enable devirtualization of %i call " | |
3848 | "executed %lli times", | |
3849 | "Declaring method %qD final " | |
3850 | "would enable devirtualization of %i calls " | |
3851 | "executed %lli times", | |
3995f3a2 JH |
3852 | decl, count, |
3853 | (long long)dyn_count.to_gcov_type ()); | |
91bc34a9 JH |
3854 | } |
3855 | } | |
ed37a6cf | 3856 | |
91bc34a9 JH |
3857 | delete (final_warning_records); |
3858 | final_warning_records = 0; | |
3859 | } | |
bbc9396b JH |
3860 | |
3861 | if (dump_file) | |
3862 | fprintf (dump_file, | |
3863 | "%i polymorphic calls, %i devirtualized," | |
3864 | " %i speculatively devirtualized, %i cold\n" | |
3865 | "%i have multiple targets, %i overwritable," | |
3866 | " %i already speculated (%i agree, %i disagree)," | |
68c9467f | 3867 | " %i external, %i not defined, %i artificial, %i infos dropped\n", |
bbc9396b JH |
3868 | npolymorphic, ndevirtualized, nconverted, ncold, |
3869 | nmultiple, noverwritable, nspeculated, nok, nwrong, | |
68c9467f JH |
3870 | nexternal, nnotdefined, nartificial, ndropped); |
3871 | return ndevirtualized || ndropped ? TODO_remove_functions : 0; | |
bbc9396b JH |
3872 | } |
3873 | ||
bbc9396b JH |
3874 | namespace { |
3875 | ||
3876 | const pass_data pass_data_ipa_devirt = | |
3877 | { | |
3878 | IPA_PASS, /* type */ | |
3879 | "devirt", /* name */ | |
3880 | OPTGROUP_NONE, /* optinfo_flags */ | |
bbc9396b JH |
3881 | TV_IPA_DEVIRT, /* tv_id */ |
3882 | 0, /* properties_required */ | |
3883 | 0, /* properties_provided */ | |
3884 | 0, /* properties_destroyed */ | |
3885 | 0, /* todo_flags_start */ | |
3886 | ( TODO_dump_symtab ), /* todo_flags_finish */ | |
3887 | }; | |
3888 | ||
3889 | class pass_ipa_devirt : public ipa_opt_pass_d | |
3890 | { | |
3891 | public: | |
c3284718 RS |
3892 | pass_ipa_devirt (gcc::context *ctxt) |
3893 | : ipa_opt_pass_d (pass_data_ipa_devirt, ctxt, | |
3894 | NULL, /* generate_summary */ | |
3895 | NULL, /* write_summary */ | |
3896 | NULL, /* read_summary */ | |
3897 | NULL, /* write_optimization_summary */ | |
3898 | NULL, /* read_optimization_summary */ | |
3899 | NULL, /* stmt_fixup */ | |
3900 | 0, /* function_transform_todo_flags_start */ | |
3901 | NULL, /* function_transform */ | |
3902 | NULL) /* variable_transform */ | |
bbc9396b JH |
3903 | {} |
3904 | ||
3905 | /* opt_pass methods: */ | |
1a3d085c TS |
3906 | virtual bool gate (function *) |
3907 | { | |
2bf86c84 JH |
3908 | /* In LTO, always run the IPA passes and decide on function basis if the |
3909 | pass is enabled. */ | |
3910 | if (in_lto_p) | |
3911 | return true; | |
1a3d085c | 3912 | return (flag_devirtualize |
91bc34a9 JH |
3913 | && (flag_devirtualize_speculatively |
3914 | || (warn_suggest_final_methods | |
3915 | || warn_suggest_final_types)) | |
1a3d085c TS |
3916 | && optimize); |
3917 | } | |
3918 | ||
be55bfe6 | 3919 | virtual unsigned int execute (function *) { return ipa_devirt (); } |
bbc9396b JH |
3920 | |
3921 | }; // class pass_ipa_devirt | |
3922 | ||
3923 | } // anon namespace | |
3924 | ||
3925 | ipa_opt_pass_d * | |
3926 | make_pass_ipa_devirt (gcc::context *ctxt) | |
3927 | { | |
3928 | return new pass_ipa_devirt (ctxt); | |
3929 | } | |
3930 | ||
eefe9a99 | 3931 | #include "gt-ipa-devirt.h" |