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