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