]>
Commit | Line | Data |
---|---|---|
ea900239 | 1 | /* Utilities for ipa analysis. |
8d9254fc | 2 | Copyright (C) 2004-2020 Free Software Foundation, Inc. |
ea900239 DB |
3 | Contributed by Kenneth Zadeck <zadeck@naturalbridge.com> |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 9 | Software Foundation; either version 3, or (at your option) any later |
ea900239 DB |
10 | version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
ea900239 DB |
20 | |
21 | #ifndef GCC_IPA_UTILS_H | |
22 | #define GCC_IPA_UTILS_H | |
ea900239 | 23 | |
ea900239 DB |
24 | struct ipa_dfs_info { |
25 | int dfn_number; | |
26 | int low_link; | |
11026b51 MJ |
27 | /* This field will have the samy value for any two nodes in the same strongly |
28 | connected component. */ | |
29 | int scc_no; | |
c5274326 | 30 | bool new_node; |
ea900239 DB |
31 | bool on_stack; |
32 | struct cgraph_node* next_cycle; | |
33 | PTR aux; | |
34 | }; | |
35 | ||
a1981458 | 36 | |
ea900239 | 37 | /* In ipa-utils.c */ |
af8bca3c | 38 | void ipa_print_order (FILE*, const char *, struct cgraph_node**, int); |
45272fd2 | 39 | int ipa_reduced_postorder (struct cgraph_node **, bool, |
af8bca3c MJ |
40 | bool (*ignore_edge) (struct cgraph_edge *)); |
41 | void ipa_free_postorder_info (void); | |
d52f5295 | 42 | vec<cgraph_node *> ipa_get_nodes_in_cycle (struct cgraph_node *); |
4cb13597 | 43 | bool ipa_edge_within_scc (struct cgraph_edge *); |
af8bca3c | 44 | int ipa_reverse_postorder (struct cgraph_node **); |
ea900239 | 45 | tree get_base_var (tree); |
5e581212 | 46 | void ipa_merge_profiles (struct cgraph_node *dst, |
b730d1c9 | 47 | struct cgraph_node *src, bool preserve_body = false); |
fc11f321 | 48 | bool recursive_call_p (tree, tree); |
ea900239 | 49 | |
08f835dc JH |
50 | /* In ipa-profile.c */ |
51 | bool ipa_propagate_frequency (struct cgraph_node *node); | |
52 | ||
eefe9a99 JH |
53 | /* In ipa-devirt.c */ |
54 | ||
55 | struct odr_type_d; | |
56 | typedef odr_type_d *odr_type; | |
2bc2379b | 57 | extern bool thunk_expansion; |
eefe9a99 | 58 | void build_type_inheritance_graph (void); |
c1b8f25d | 59 | void rebuild_type_inheritance_graph (void); |
0e1474e5 | 60 | void update_type_inheritance_graph (void); |
eefe9a99 JH |
61 | vec <cgraph_node *> |
62 | possible_polymorphic_call_targets (tree, HOST_WIDE_INT, | |
68377e53 | 63 | ipa_polymorphic_call_context, |
6f8091fc | 64 | bool *copletep = NULL, |
ec77d61f | 65 | void **cache_token = NULL, |
2f28755f | 66 | bool speuclative = false); |
eefe9a99 | 67 | odr_type get_odr_type (tree, bool insert = false); |
259d29e3 | 68 | bool odr_type_p (const_tree); |
355fe088 | 69 | bool possible_polymorphic_call_target_p (tree ref, gimple *stmt, struct cgraph_node *n); |
68377e53 | 70 | void dump_possible_polymorphic_call_targets (FILE *, tree, HOST_WIDE_INT, |
c1dd347c JH |
71 | const ipa_polymorphic_call_context &, |
72 | bool verbose = true); | |
0e1474e5 | 73 | bool possible_polymorphic_call_target_p (tree, HOST_WIDE_INT, |
68377e53 | 74 | const ipa_polymorphic_call_context &, |
d570d364 | 75 | struct cgraph_node *); |
967ca9b9 | 76 | tree polymorphic_ctor_dtor_p (tree, bool); |
00a0ea64 | 77 | tree inlined_polymorphic_ctor_dtor_block_p (tree, bool); |
355fe088 | 78 | bool decl_maybe_in_construction_p (tree, tree, gimple *, tree); |
d570d364 JH |
79 | tree vtable_pointer_value_to_binfo (const_tree); |
80 | bool vtable_pointer_value_to_vtable (const_tree, tree *, unsigned HOST_WIDE_INT *); | |
aa803cc7 | 81 | tree subbinfo_with_vtable_at_offset (tree, unsigned HOST_WIDE_INT, tree); |
56b1f114 | 82 | void compare_virtual_tables (varpool_node *, varpool_node *); |
aa803cc7 | 83 | bool type_all_derivations_known_p (const_tree); |
4d6eb35a | 84 | bool type_known_to_have_no_derivations_p (tree); |
d570d364 | 85 | bool contains_polymorphic_type_p (const_tree); |
1ee85ee1 | 86 | void register_odr_type (tree); |
aa803cc7 | 87 | bool types_must_be_same_for_odr (tree, tree); |
420672bc | 88 | bool types_odr_comparable (tree, tree); |
5ce97055 JH |
89 | cgraph_node *try_speculative_devirtualization (tree, HOST_WIDE_INT, |
90 | ipa_polymorphic_call_context); | |
6542950e JH |
91 | void warn_types_mismatch (tree t1, tree t2, location_t loc1 = UNKNOWN_LOCATION, |
92 | location_t loc2 = UNKNOWN_LOCATION); | |
259d29e3 JH |
93 | bool odr_or_derived_type_p (const_tree t); |
94 | bool odr_types_equivalent_p (tree type1, tree type2); | |
d840d7a2 | 95 | bool odr_type_violation_reported_p (tree type); |
e4b44fd7 | 96 | tree prevailing_odr_type (tree type); |
a0276c00 JH |
97 | void enable_odr_based_tbaa (tree type); |
98 | bool odr_based_tbaa_p (const_tree type); | |
99 | void set_type_canonical_for_odr_type (tree type, tree canonical); | |
eefe9a99 JH |
100 | |
101 | /* Return vector containing possible targets of polymorphic call E. | |
1c5fd343 | 102 | If COMPLETEP is non-NULL, store true if the list is complete. |
eefe9a99 JH |
103 | CACHE_TOKEN (if non-NULL) will get stored to an unique ID of entry |
104 | in the target cache. If user needs to visit every target list | |
105 | just once, it can memoize them. | |
106 | ||
107 | Returned vector is placed into cache. It is NOT caller's responsibility | |
108 | to free it. The vector can be freed on cgraph_remove_node call if | |
109 | the particular node is a virtual function present in the cache. */ | |
110 | ||
111 | inline vec <cgraph_node *> | |
112 | possible_polymorphic_call_targets (struct cgraph_edge *e, | |
6f8091fc | 113 | bool *completep = NULL, |
ec77d61f | 114 | void **cache_token = NULL, |
2f28755f | 115 | bool speculative = false) |
eefe9a99 | 116 | { |
4d7cf10d | 117 | ipa_polymorphic_call_context context(e); |
6f8091fc | 118 | |
eefe9a99 JH |
119 | return possible_polymorphic_call_targets (e->indirect_info->otr_type, |
120 | e->indirect_info->otr_token, | |
68377e53 | 121 | context, |
6f8091fc | 122 | completep, cache_token, |
2f28755f | 123 | speculative); |
68377e53 JH |
124 | } |
125 | ||
126 | /* Same as above but taking OBJ_TYPE_REF as an parameter. */ | |
127 | ||
128 | inline vec <cgraph_node *> | |
058d0a90 | 129 | possible_polymorphic_call_targets (tree ref, |
355fe088 | 130 | gimple *call, |
6f8091fc | 131 | bool *completep = NULL, |
68377e53 JH |
132 | void **cache_token = NULL) |
133 | { | |
6f8091fc | 134 | ipa_polymorphic_call_context context (current_function_decl, ref, call); |
61dd6a2e | 135 | |
058d0a90 | 136 | return possible_polymorphic_call_targets (obj_type_ref_class (ref), |
68377e53 | 137 | tree_to_uhwi |
058d0a90 | 138 | (OBJ_TYPE_REF_TOKEN (ref)), |
61dd6a2e | 139 | context, |
6f8091fc | 140 | completep, cache_token); |
eefe9a99 JH |
141 | } |
142 | ||
143 | /* Dump possible targets of a polymorphic call E into F. */ | |
b8698a0f | 144 | |
eefe9a99 | 145 | inline void |
c1dd347c JH |
146 | dump_possible_polymorphic_call_targets (FILE *f, struct cgraph_edge *e, |
147 | bool verbose = true) | |
eefe9a99 | 148 | { |
4d7cf10d | 149 | ipa_polymorphic_call_context context(e); |
6f8091fc | 150 | |
eefe9a99 | 151 | dump_possible_polymorphic_call_targets (f, e->indirect_info->otr_type, |
68377e53 | 152 | e->indirect_info->otr_token, |
c1dd347c | 153 | context, verbose); |
eefe9a99 | 154 | } |
0e1474e5 JH |
155 | |
156 | /* Return true if N can be possibly target of a polymorphic call of | |
157 | E. */ | |
158 | ||
159 | inline bool | |
160 | possible_polymorphic_call_target_p (struct cgraph_edge *e, | |
161 | struct cgraph_node *n) | |
162 | { | |
4d7cf10d | 163 | ipa_polymorphic_call_context context(e); |
6f8091fc | 164 | |
0e1474e5 | 165 | return possible_polymorphic_call_target_p (e->indirect_info->otr_type, |
68377e53 JH |
166 | e->indirect_info->otr_token, |
167 | context, n); | |
0e1474e5 | 168 | } |
450ad0cd | 169 | |
aa803cc7 JH |
170 | /* Return true if BINFO corresponds to a type with virtual methods. |
171 | ||
172 | Every type has several BINFOs. One is the BINFO associated by the type | |
173 | while other represents bases of derived types. The BINFOs representing | |
174 | bases do not have BINFO_VTABLE pointer set when this is the single | |
175 | inheritance (because vtables are shared). Look up the BINFO of type | |
176 | and check presence of its vtable. */ | |
177 | ||
178 | inline bool | |
179 | polymorphic_type_binfo_p (const_tree binfo) | |
180 | { | |
1be0e58d JH |
181 | return (BINFO_TYPE (binfo) && TYPE_BINFO (BINFO_TYPE (binfo)) |
182 | && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (binfo)))); | |
aa803cc7 | 183 | } |
a6c5361c JH |
184 | |
185 | /* Return true if T is a type with linkage defined. */ | |
186 | ||
187 | inline bool | |
188 | type_with_linkage_p (const_tree t) | |
189 | { | |
420672bc | 190 | gcc_checking_assert (TYPE_MAIN_VARIANT (t) == t); |
2ebbdb6c JH |
191 | if (!TYPE_NAME (t) || TREE_CODE (TYPE_NAME (t)) != TYPE_DECL) |
192 | return false; | |
193 | ||
686a56a8 | 194 | /* After free_lang_data was run we can recongize |
2ebbdb6c JH |
195 | types with linkage by presence of mangled name. */ |
196 | if (DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (t))) | |
197 | return true; | |
198 | ||
9a97772f | 199 | if (in_lto_p) |
a6c5361c | 200 | return false; |
686a56a8 | 201 | |
9a97772f JH |
202 | /* We used to check for TYPE_STUB_DECL but that is set to NULL for forward |
203 | declarations. */ | |
a6c5361c JH |
204 | |
205 | if (!RECORD_OR_UNION_TYPE_P (t) && TREE_CODE (t) != ENUMERAL_TYPE) | |
206 | return false; | |
207 | ||
208 | /* Builtin types do not define linkage, their TYPE_CONTEXT is NULL. */ | |
209 | if (!TYPE_CONTEXT (t)) | |
210 | return false; | |
211 | ||
f4af4019 JH |
212 | gcc_checking_assert (TREE_CODE (t) == ENUMERAL_TYPE || TYPE_CXX_ODR_P (t)); |
213 | ||
a6c5361c JH |
214 | return true; |
215 | } | |
216 | ||
217 | /* Return true if T is in anonymous namespace. | |
218 | This works only on those C++ types with linkage defined. */ | |
219 | ||
220 | inline bool | |
221 | type_in_anonymous_namespace_p (const_tree t) | |
222 | { | |
223 | gcc_checking_assert (type_with_linkage_p (t)); | |
224 | ||
2ebbdb6c JH |
225 | /* free_lang_data clears TYPE_STUB_DECL but sets assembler name to |
226 | "<anon>" */ | |
227 | if (DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (t))) | |
228 | return !strcmp ("<anon>", | |
229 | IDENTIFIER_POINTER | |
230 | (DECL_ASSEMBLER_NAME (TYPE_NAME (t)))); | |
231 | else if (!TYPE_STUB_DECL (t)) | |
232 | return false; | |
233 | else | |
234 | return !TREE_PUBLIC (TYPE_STUB_DECL (t)); | |
a6c5361c JH |
235 | } |
236 | ||
237 | /* Return true of T is type with One Definition Rule info attached. | |
238 | It means that either it is anonymous type or it has assembler name | |
239 | set. */ | |
240 | ||
241 | inline bool | |
242 | odr_type_p (const_tree t) | |
243 | { | |
244 | /* We do not have this information when not in LTO, but we do not need | |
245 | to care, since it is used only for type merging. */ | |
246 | gcc_checking_assert (in_lto_p || flag_lto); | |
686a56a8 JH |
247 | return TYPE_NAME (t) && TREE_CODE (TYPE_NAME (t)) == TYPE_DECL |
248 | && DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (t)); | |
a6c5361c JH |
249 | } |
250 | ||
74fee042 ML |
251 | /* If TYPE has mangled ODR name, return it. Otherwise return NULL. |
252 | The function works only when free_lang_data is run. */ | |
253 | ||
254 | inline const char * | |
255 | get_odr_name_for_type (tree type) | |
256 | { | |
257 | tree type_name = TYPE_NAME (type); | |
258 | if (type_name == NULL_TREE | |
c175aa77 | 259 | || TREE_CODE (type_name) != TYPE_DECL |
74fee042 ML |
260 | || !DECL_ASSEMBLER_NAME_SET_P (type_name)) |
261 | return NULL; | |
262 | ||
263 | return IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (type_name)); | |
264 | } | |
265 | ||
ea900239 | 266 | #endif /* GCC_IPA_UTILS_H */ |