]>
Commit | Line | Data |
---|---|---|
b84d4347 | 1 | /* Interprocedural Identical Code Folding pass |
85ec4feb | 2 | Copyright (C) 2014-2018 Free Software Foundation, Inc. |
b84d4347 ML |
3 | |
4 | Contributed by Jan Hubicka <hubicka@ucw.cz> and Martin Liska <mliska@suse.cz> | |
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 | ||
22 | /* Interprocedural Identical Code Folding for functions and | |
23 | read-only variables. | |
24 | ||
25 | The goal of this transformation is to discover functions and read-only | |
26 | variables which do have exactly the same semantics. | |
27 | ||
28 | In case of functions, | |
29 | we could either create a virtual clone or do a simple function wrapper | |
30 | that will call equivalent function. If the function is just locally visible, | |
31 | all function calls can be redirected. For read-only variables, we create | |
32 | aliases if possible. | |
33 | ||
34 | Optimization pass arranges as follows: | |
35 | 1) All functions and read-only variables are visited and internal | |
36 | data structure, either sem_function or sem_variables is created. | |
37 | 2) For every symbol from the previous step, VAR_DECL and FUNCTION_DECL are | |
38 | saved and matched to corresponding sem_items. | |
39 | 3) These declaration are ignored for equality check and are solved | |
40 | by Value Numbering algorithm published by Alpert, Zadeck in 1992. | |
41 | 4) We compute hash value for each symbol. | |
42 | 5) Congruence classes are created based on hash value. If hash value are | |
43 | equal, equals function is called and symbols are deeply compared. | |
44 | We must prove that all SSA names, declarations and other items | |
45 | correspond. | |
46 | 6) Value Numbering is executed for these classes. At the end of the process | |
47 | all symbol members in remaining classes can be merged. | |
48 | 7) Merge operation creates alias in case of read-only variables. For | |
49 | callgraph node, we must decide if we can redirect local calls, | |
50 | create an alias or a thunk. | |
51 | ||
52 | */ | |
53 | ||
54 | #include "config.h" | |
2c384ad8 | 55 | #define INCLUDE_LIST |
b84d4347 ML |
56 | #include "system.h" |
57 | #include "coretypes.h" | |
c7131fb2 | 58 | #include "backend.h" |
957060b5 AM |
59 | #include "target.h" |
60 | #include "rtl.h" | |
40e23961 | 61 | #include "tree.h" |
b84d4347 | 62 | #include "gimple.h" |
957060b5 AM |
63 | #include "alloc-pool.h" |
64 | #include "tree-pass.h" | |
c7131fb2 | 65 | #include "ssa.h" |
957060b5 AM |
66 | #include "cgraph.h" |
67 | #include "coverage.h" | |
68 | #include "gimple-pretty-print.h" | |
69 | #include "data-streamer.h" | |
c7131fb2 | 70 | #include "fold-const.h" |
36566b39 | 71 | #include "calls.h" |
36566b39 | 72 | #include "varasm.h" |
b84d4347 | 73 | #include "gimple-iterator.h" |
b84d4347 | 74 | #include "tree-cfg.h" |
dd912cb8 | 75 | #include "symbol-summary.h" |
c582198b | 76 | #include "ipa-prop.h" |
27d020cf | 77 | #include "ipa-fnsummary.h" |
b84d4347 | 78 | #include "except.h" |
b84d4347 ML |
79 | #include "attribs.h" |
80 | #include "print-tree.h" | |
b84d4347 | 81 | #include "ipa-utils.h" |
b84d4347 ML |
82 | #include "ipa-icf-gimple.h" |
83 | #include "ipa-icf.h" | |
46305737 | 84 | #include "stor-layout.h" |
7aeb92b4 | 85 | #include "dbgcnt.h" |
63570af0 | 86 | #include "tree-vector-builder.h" |
b84d4347 ML |
87 | |
88 | using namespace ipa_icf_gimple; | |
89 | ||
90 | namespace ipa_icf { | |
5ebd0e61 | 91 | |
69f6b1f4 JH |
92 | /* Initialization and computation of symtab node hash, there data |
93 | are propagated later on. */ | |
94 | ||
95 | static sem_item_optimizer *optimizer = NULL; | |
96 | ||
5ebd0e61 ML |
97 | /* Constructor. */ |
98 | ||
99 | symbol_compare_collection::symbol_compare_collection (symtab_node *node) | |
100 | { | |
101 | m_references.create (0); | |
102 | m_interposables.create (0); | |
103 | ||
104 | ipa_ref *ref; | |
105 | ||
106 | if (is_a <varpool_node *> (node) && DECL_VIRTUAL_P (node->decl)) | |
107 | return; | |
108 | ||
977b01e3 | 109 | for (unsigned i = 0; node->iterate_reference (i, ref); i++) |
5ebd0e61 | 110 | { |
5ebd0e61 ML |
111 | if (ref->address_matters_p ()) |
112 | m_references.safe_push (ref->referred); | |
113 | ||
114 | if (ref->referred->get_availability () <= AVAIL_INTERPOSABLE) | |
115 | { | |
0a7246ee | 116 | if (ref->address_matters_p ()) |
5ebd0e61 ML |
117 | m_references.safe_push (ref->referred); |
118 | else | |
119 | m_interposables.safe_push (ref->referred); | |
120 | } | |
121 | } | |
122 | ||
123 | if (is_a <cgraph_node *> (node)) | |
124 | { | |
125 | cgraph_node *cnode = dyn_cast <cgraph_node *> (node); | |
126 | ||
127 | for (cgraph_edge *e = cnode->callees; e; e = e->next_callee) | |
128 | if (e->callee->get_availability () <= AVAIL_INTERPOSABLE) | |
129 | m_interposables.safe_push (e->callee); | |
130 | } | |
131 | } | |
132 | ||
b84d4347 ML |
133 | /* Constructor for key value pair, where _ITEM is key and _INDEX is a target. */ |
134 | ||
fedf2718 ML |
135 | sem_usage_pair::sem_usage_pair (sem_item *_item, unsigned int _index) |
136 | : item (_item), index (_index) | |
b84d4347 ML |
137 | { |
138 | } | |
139 | ||
fedf2718 ML |
140 | sem_item::sem_item (sem_item_type _type, bitmap_obstack *stack) |
141 | : type (_type), m_hash (-1), m_hash_set (false) | |
b84d4347 ML |
142 | { |
143 | setup (stack); | |
144 | } | |
145 | ||
b84d4347 | 146 | sem_item::sem_item (sem_item_type _type, symtab_node *_node, |
fedf2718 ML |
147 | bitmap_obstack *stack) |
148 | : type (_type), node (_node), m_hash (-1), m_hash_set (false) | |
b84d4347 ML |
149 | { |
150 | decl = node->decl; | |
151 | setup (stack); | |
152 | } | |
153 | ||
154 | /* Add reference to a semantic TARGET. */ | |
155 | ||
156 | void | |
157 | sem_item::add_reference (sem_item *target) | |
158 | { | |
159 | refs.safe_push (target); | |
160 | unsigned index = refs.length (); | |
161 | target->usages.safe_push (new sem_usage_pair(this, index)); | |
162 | bitmap_set_bit (target->usage_index_bitmap, index); | |
163 | refs_set.add (target->node); | |
164 | } | |
165 | ||
166 | /* Initialize internal data structures. Bitmap STACK is used for | |
167 | bitmap memory allocation process. */ | |
168 | ||
169 | void | |
170 | sem_item::setup (bitmap_obstack *stack) | |
171 | { | |
172 | gcc_checking_assert (node); | |
173 | ||
174 | refs.create (0); | |
175 | tree_refs.create (0); | |
176 | usages.create (0); | |
177 | usage_index_bitmap = BITMAP_ALLOC (stack); | |
178 | } | |
179 | ||
180 | sem_item::~sem_item () | |
181 | { | |
182 | for (unsigned i = 0; i < usages.length (); i++) | |
183 | delete usages[i]; | |
184 | ||
185 | refs.release (); | |
186 | tree_refs.release (); | |
187 | usages.release (); | |
188 | ||
189 | BITMAP_FREE (usage_index_bitmap); | |
190 | } | |
191 | ||
192 | /* Dump function for debugging purpose. */ | |
193 | ||
194 | DEBUG_FUNCTION void | |
195 | sem_item::dump (void) | |
196 | { | |
197 | if (dump_file) | |
198 | { | |
464d0118 ML |
199 | fprintf (dump_file, "[%s] %s (tree:%p)\n", type == FUNC ? "func" : "var", |
200 | node->dump_name (), (void *) node->decl); | |
b84d4347 ML |
201 | fprintf (dump_file, " hash: %u\n", get_hash ()); |
202 | fprintf (dump_file, " references: "); | |
203 | ||
204 | for (unsigned i = 0; i < refs.length (); i++) | |
1aec2ecc | 205 | fprintf (dump_file, "%s%s ", refs[i]->node->name (), |
b84d4347 ML |
206 | i < refs.length() - 1 ? "," : ""); |
207 | ||
208 | fprintf (dump_file, "\n"); | |
209 | } | |
210 | } | |
211 | ||
f657d665 ML |
212 | /* Return true if target supports alias symbols. */ |
213 | ||
214 | bool | |
215 | sem_item::target_supports_symbol_aliases_p (void) | |
216 | { | |
217 | #if !defined (ASM_OUTPUT_DEF) || (!defined(ASM_OUTPUT_WEAK_ALIAS) && !defined (ASM_WEAKEN_DECL)) | |
218 | return false; | |
219 | #else | |
220 | return true; | |
221 | #endif | |
222 | } | |
223 | ||
808b6bb7 ML |
224 | void sem_item::set_hash (hashval_t hash) |
225 | { | |
226 | m_hash = hash; | |
fedf2718 | 227 | m_hash_set = true; |
808b6bb7 ML |
228 | } |
229 | ||
b84d4347 ML |
230 | /* Semantic function constructor that uses STACK as bitmap memory stack. */ |
231 | ||
fedf2718 ML |
232 | sem_function::sem_function (bitmap_obstack *stack) |
233 | : sem_item (FUNC, stack), m_checker (NULL), m_compared_func (NULL) | |
b84d4347 | 234 | { |
b84d4347 ML |
235 | bb_sizes.create (0); |
236 | bb_sorted.create (0); | |
237 | } | |
238 | ||
fedf2718 ML |
239 | sem_function::sem_function (cgraph_node *node, bitmap_obstack *stack) |
240 | : sem_item (FUNC, node, stack), m_checker (NULL), m_compared_func (NULL) | |
b84d4347 | 241 | { |
b84d4347 ML |
242 | bb_sizes.create (0); |
243 | bb_sorted.create (0); | |
244 | } | |
245 | ||
246 | sem_function::~sem_function () | |
247 | { | |
248 | for (unsigned i = 0; i < bb_sorted.length (); i++) | |
e27d328a | 249 | delete (bb_sorted[i]); |
b84d4347 | 250 | |
b84d4347 ML |
251 | bb_sizes.release (); |
252 | bb_sorted.release (); | |
253 | } | |
254 | ||
255 | /* Calculates hash value based on a BASIC_BLOCK. */ | |
256 | ||
257 | hashval_t | |
258 | sem_function::get_bb_hash (const sem_bb *basic_block) | |
259 | { | |
260 | inchash::hash hstate; | |
261 | ||
262 | hstate.add_int (basic_block->nondbg_stmt_count); | |
263 | hstate.add_int (basic_block->edge_count); | |
264 | ||
265 | return hstate.end (); | |
266 | } | |
267 | ||
268 | /* References independent hash function. */ | |
269 | ||
270 | hashval_t | |
271 | sem_function::get_hash (void) | |
272 | { | |
fedf2718 | 273 | if (!m_hash_set) |
b84d4347 ML |
274 | { |
275 | inchash::hash hstate; | |
276 | hstate.add_int (177454); /* Random number for function type. */ | |
277 | ||
278 | hstate.add_int (arg_count); | |
279 | hstate.add_int (cfg_checksum); | |
280 | hstate.add_int (gcode_hash); | |
281 | ||
282 | for (unsigned i = 0; i < bb_sorted.length (); i++) | |
283 | hstate.merge_hash (get_bb_hash (bb_sorted[i])); | |
284 | ||
285 | for (unsigned i = 0; i < bb_sizes.length (); i++) | |
286 | hstate.add_int (bb_sizes[i]); | |
287 | ||
69f6b1f4 JH |
288 | /* Add common features of declaration itself. */ |
289 | if (DECL_FUNCTION_SPECIFIC_TARGET (decl)) | |
449e9a33 | 290 | hstate.add_hwi |
69f6b1f4 JH |
291 | (cl_target_option_hash |
292 | (TREE_TARGET_OPTION (DECL_FUNCTION_SPECIFIC_TARGET (decl)))); | |
293 | if (DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl)) | |
449e9a33 | 294 | hstate.add_hwi |
69f6b1f4 JH |
295 | (cl_optimization_hash |
296 | (TREE_OPTIMIZATION (DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl)))); | |
69f6b1f4 JH |
297 | hstate.add_flag (DECL_CXX_CONSTRUCTOR_P (decl)); |
298 | hstate.add_flag (DECL_CXX_DESTRUCTOR_P (decl)); | |
299 | ||
808b6bb7 | 300 | set_hash (hstate.end ()); |
b84d4347 ML |
301 | } |
302 | ||
808b6bb7 | 303 | return m_hash; |
b84d4347 ML |
304 | } |
305 | ||
b3587b99 JH |
306 | /* Return ture if A1 and A2 represent equivalent function attribute lists. |
307 | Based on comp_type_attributes. */ | |
308 | ||
309 | bool | |
310 | sem_item::compare_attributes (const_tree a1, const_tree a2) | |
311 | { | |
312 | const_tree a; | |
313 | if (a1 == a2) | |
314 | return true; | |
315 | for (a = a1; a != NULL_TREE; a = TREE_CHAIN (a)) | |
316 | { | |
317 | const struct attribute_spec *as; | |
318 | const_tree attr; | |
319 | ||
320 | as = lookup_attribute_spec (get_attribute_name (a)); | |
321 | /* TODO: We can introduce as->affects_decl_identity | |
322 | and as->affects_decl_reference_identity if attribute mismatch | |
323 | gets a common reason to give up on merging. It may not be worth | |
324 | the effort. | |
325 | For example returns_nonnull affects only references, while | |
326 | optimize attribute can be ignored because it is already lowered | |
327 | into flags representation and compared separately. */ | |
328 | if (!as) | |
329 | continue; | |
330 | ||
331 | attr = lookup_attribute (as->name, CONST_CAST_TREE (a2)); | |
332 | if (!attr || !attribute_value_equal (a, attr)) | |
333 | break; | |
334 | } | |
335 | if (!a) | |
336 | { | |
337 | for (a = a2; a != NULL_TREE; a = TREE_CHAIN (a)) | |
338 | { | |
339 | const struct attribute_spec *as; | |
340 | ||
341 | as = lookup_attribute_spec (get_attribute_name (a)); | |
342 | if (!as) | |
343 | continue; | |
344 | ||
345 | if (!lookup_attribute (as->name, CONST_CAST_TREE (a1))) | |
346 | break; | |
347 | /* We don't need to compare trees again, as we did this | |
348 | already in first loop. */ | |
349 | } | |
350 | if (!a) | |
351 | return true; | |
352 | } | |
353 | /* TODO: As in comp_type_attributes we may want to introduce target hook. */ | |
354 | return false; | |
355 | } | |
356 | ||
977b01e3 JH |
357 | /* Compare properties of symbols N1 and N2 that does not affect semantics of |
358 | symbol itself but affects semantics of its references from USED_BY (which | |
359 | may be NULL if it is unknown). If comparsion is false, symbols | |
360 | can still be merged but any symbols referring them can't. | |
361 | ||
362 | If ADDRESS is true, do extra checking needed for IPA_REF_ADDR. | |
363 | ||
364 | TODO: We can also split attributes to those that determine codegen of | |
365 | a function body/variable constructor itself and those that are used when | |
366 | referring to it. */ | |
367 | ||
368 | bool | |
369 | sem_item::compare_referenced_symbol_properties (symtab_node *used_by, | |
370 | symtab_node *n1, | |
371 | symtab_node *n2, | |
372 | bool address) | |
373 | { | |
374 | if (is_a <cgraph_node *> (n1)) | |
375 | { | |
376 | /* Inline properties matters: we do now want to merge uses of inline | |
377 | function to uses of normal function because inline hint would be lost. | |
378 | We however can merge inline function to noinline because the alias | |
379 | will keep its DECL_DECLARED_INLINE flag. | |
380 | ||
381 | Also ignore inline flag when optimizing for size or when function | |
382 | is known to not be inlinable. | |
383 | ||
384 | TODO: the optimize_size checks can also be assumed to be true if | |
385 | unit has no !optimize_size functions. */ | |
386 | ||
387 | if ((!used_by || address || !is_a <cgraph_node *> (used_by) | |
388 | || !opt_for_fn (used_by->decl, optimize_size)) | |
389 | && !opt_for_fn (n1->decl, optimize_size) | |
390 | && n1->get_availability () > AVAIL_INTERPOSABLE | |
391 | && (!DECL_UNINLINABLE (n1->decl) || !DECL_UNINLINABLE (n2->decl))) | |
392 | { | |
393 | if (DECL_DISREGARD_INLINE_LIMITS (n1->decl) | |
394 | != DECL_DISREGARD_INLINE_LIMITS (n2->decl)) | |
395 | return return_false_with_msg | |
396 | ("DECL_DISREGARD_INLINE_LIMITS are different"); | |
397 | ||
398 | if (DECL_DECLARED_INLINE_P (n1->decl) | |
399 | != DECL_DECLARED_INLINE_P (n2->decl)) | |
400 | return return_false_with_msg ("inline attributes are different"); | |
401 | } | |
402 | ||
403 | if (DECL_IS_OPERATOR_NEW (n1->decl) | |
404 | != DECL_IS_OPERATOR_NEW (n2->decl)) | |
405 | return return_false_with_msg ("operator new flags are different"); | |
406 | } | |
407 | ||
408 | /* Merging two definitions with a reference to equivalent vtables, but | |
409 | belonging to a different type may result in ipa-polymorphic-call analysis | |
410 | giving a wrong answer about the dynamic type of instance. */ | |
411 | if (is_a <varpool_node *> (n1)) | |
412 | { | |
413 | if ((DECL_VIRTUAL_P (n1->decl) || DECL_VIRTUAL_P (n2->decl)) | |
414 | && (DECL_VIRTUAL_P (n1->decl) != DECL_VIRTUAL_P (n2->decl) | |
415 | || !types_must_be_same_for_odr (DECL_CONTEXT (n1->decl), | |
416 | DECL_CONTEXT (n2->decl))) | |
417 | && (!used_by || !is_a <cgraph_node *> (used_by) || address | |
418 | || opt_for_fn (used_by->decl, flag_devirtualize))) | |
419 | return return_false_with_msg | |
420 | ("references to virtual tables can not be merged"); | |
b3587b99 JH |
421 | |
422 | if (address && DECL_ALIGN (n1->decl) != DECL_ALIGN (n2->decl)) | |
423 | return return_false_with_msg ("alignment mismatch"); | |
424 | ||
425 | /* For functions we compare attributes in equals_wpa, because we do | |
426 | not know what attributes may cause codegen differences, but for | |
427 | variables just compare attributes for references - the codegen | |
428 | for constructors is affected only by those attributes that we lower | |
429 | to explicit representation (such as DECL_ALIGN or DECL_SECTION). */ | |
430 | if (!compare_attributes (DECL_ATTRIBUTES (n1->decl), | |
431 | DECL_ATTRIBUTES (n2->decl))) | |
432 | return return_false_with_msg ("different var decl attributes"); | |
433 | if (comp_type_attributes (TREE_TYPE (n1->decl), | |
434 | TREE_TYPE (n2->decl)) != 1) | |
435 | return return_false_with_msg ("different var type attributes"); | |
977b01e3 JH |
436 | } |
437 | ||
438 | /* When matching virtual tables, be sure to also match information | |
439 | relevant for polymorphic call analysis. */ | |
440 | if (used_by && is_a <varpool_node *> (used_by) | |
441 | && DECL_VIRTUAL_P (used_by->decl)) | |
442 | { | |
443 | if (DECL_VIRTUAL_P (n1->decl) != DECL_VIRTUAL_P (n2->decl)) | |
444 | return return_false_with_msg ("virtual flag mismatch"); | |
445 | if (DECL_VIRTUAL_P (n1->decl) && is_a <cgraph_node *> (n1) | |
446 | && (DECL_FINAL_P (n1->decl) != DECL_FINAL_P (n2->decl))) | |
447 | return return_false_with_msg ("final flag mismatch"); | |
448 | } | |
449 | return true; | |
450 | } | |
451 | ||
452 | /* Hash properties that are compared by compare_referenced_symbol_properties. */ | |
453 | ||
454 | void | |
455 | sem_item::hash_referenced_symbol_properties (symtab_node *ref, | |
456 | inchash::hash &hstate, | |
457 | bool address) | |
458 | { | |
459 | if (is_a <cgraph_node *> (ref)) | |
460 | { | |
d57c9945 | 461 | if ((type != FUNC || address || !opt_for_fn (decl, optimize_size)) |
977b01e3 JH |
462 | && !opt_for_fn (ref->decl, optimize_size) |
463 | && !DECL_UNINLINABLE (ref->decl)) | |
464 | { | |
465 | hstate.add_flag (DECL_DISREGARD_INLINE_LIMITS (ref->decl)); | |
466 | hstate.add_flag (DECL_DECLARED_INLINE_P (ref->decl)); | |
467 | } | |
468 | hstate.add_flag (DECL_IS_OPERATOR_NEW (ref->decl)); | |
469 | } | |
470 | else if (is_a <varpool_node *> (ref)) | |
471 | { | |
472 | hstate.add_flag (DECL_VIRTUAL_P (ref->decl)); | |
b3587b99 JH |
473 | if (address) |
474 | hstate.add_int (DECL_ALIGN (ref->decl)); | |
977b01e3 JH |
475 | } |
476 | } | |
477 | ||
478 | ||
b84d4347 ML |
479 | /* For a given symbol table nodes N1 and N2, we check that FUNCTION_DECLs |
480 | point to a same function. Comparison can be skipped if IGNORED_NODES | |
b6cddc7f | 481 | contains these nodes. ADDRESS indicate if address is taken. */ |
b84d4347 ML |
482 | |
483 | bool | |
977b01e3 | 484 | sem_item::compare_symbol_references ( |
b6cddc7f ML |
485 | hash_map <symtab_node *, sem_item *> &ignored_nodes, |
486 | symtab_node *n1, symtab_node *n2, bool address) | |
b84d4347 | 487 | { |
b6cddc7f ML |
488 | enum availability avail1, avail2; |
489 | ||
fe75bd20 JH |
490 | if (n1 == n2) |
491 | return true; | |
492 | ||
523f0450 JH |
493 | /* Never match variable and function. */ |
494 | if (is_a <varpool_node *> (n1) != is_a <varpool_node *> (n2)) | |
495 | return false; | |
496 | ||
977b01e3 JH |
497 | if (!compare_referenced_symbol_properties (node, n1, n2, address)) |
498 | return false; | |
b6cddc7f ML |
499 | if (address && n1->equal_address_to (n2) == 1) |
500 | return true; | |
501 | if (!address && n1->semantically_equivalent_p (n2)) | |
b84d4347 ML |
502 | return true; |
503 | ||
b6cddc7f ML |
504 | n1 = n1->ultimate_alias_target (&avail1); |
505 | n2 = n2->ultimate_alias_target (&avail2); | |
506 | ||
d7e2ff72 JH |
507 | if (avail1 > AVAIL_INTERPOSABLE && ignored_nodes.get (n1) |
508 | && avail2 > AVAIL_INTERPOSABLE && ignored_nodes.get (n2)) | |
b6cddc7f | 509 | return true; |
b84d4347 ML |
510 | |
511 | return return_false_with_msg ("different references"); | |
512 | } | |
513 | ||
514 | /* If cgraph edges E1 and E2 are indirect calls, verify that | |
515 | ECF flags are the same. */ | |
516 | ||
517 | bool sem_function::compare_edge_flags (cgraph_edge *e1, cgraph_edge *e2) | |
518 | { | |
519 | if (e1->indirect_info && e2->indirect_info) | |
520 | { | |
521 | int e1_flags = e1->indirect_info->ecf_flags; | |
522 | int e2_flags = e2->indirect_info->ecf_flags; | |
523 | ||
524 | if (e1_flags != e2_flags) | |
525 | return return_false_with_msg ("ICF flags are different"); | |
526 | } | |
527 | else if (e1->indirect_info || e2->indirect_info) | |
528 | return false; | |
529 | ||
530 | return true; | |
531 | } | |
532 | ||
b3587b99 JH |
533 | /* Return true if parameter I may be used. */ |
534 | ||
535 | bool | |
536 | sem_function::param_used_p (unsigned int i) | |
537 | { | |
538 | if (ipa_node_params_sum == NULL) | |
b0187578 | 539 | return true; |
b3587b99 JH |
540 | |
541 | struct ipa_node_params *parms_info = IPA_NODE_REF (get_node ()); | |
542 | ||
f65f1ae3 MJ |
543 | if (vec_safe_length (parms_info->descriptors) <= i) |
544 | return true; | |
b3587b99 JH |
545 | |
546 | return ipa_is_param_used (IPA_NODE_REF (get_node ()), i); | |
547 | } | |
548 | ||
1628e36b JH |
549 | /* Perform additional check needed to match types function parameters that are |
550 | used. Unlike for normal decls it matters if type is TYPE_RESTRICT and we | |
551 | make an assumption that REFERENCE_TYPE parameters are always non-NULL. */ | |
552 | ||
553 | bool | |
554 | sem_function::compatible_parm_types_p (tree parm1, tree parm2) | |
555 | { | |
556 | /* Be sure that parameters are TBAA compatible. */ | |
557 | if (!func_checker::compatible_types_p (parm1, parm2)) | |
558 | return return_false_with_msg ("parameter type is not compatible"); | |
559 | ||
560 | if (POINTER_TYPE_P (parm1) | |
561 | && (TYPE_RESTRICT (parm1) != TYPE_RESTRICT (parm2))) | |
562 | return return_false_with_msg ("argument restrict flag mismatch"); | |
563 | ||
564 | /* nonnull_arg_p implies non-zero range to REFERENCE types. */ | |
565 | if (POINTER_TYPE_P (parm1) | |
566 | && TREE_CODE (parm1) != TREE_CODE (parm2) | |
567 | && opt_for_fn (decl, flag_delete_null_pointer_checks)) | |
568 | return return_false_with_msg ("pointer wrt reference mismatch"); | |
569 | ||
570 | return true; | |
571 | } | |
572 | ||
b84d4347 ML |
573 | /* Fast equality function based on knowledge known in WPA. */ |
574 | ||
575 | bool | |
576 | sem_function::equals_wpa (sem_item *item, | |
577 | hash_map <symtab_node *, sem_item *> &ignored_nodes) | |
578 | { | |
579 | gcc_assert (item->type == FUNC); | |
fb5c322e JH |
580 | cgraph_node *cnode = dyn_cast <cgraph_node *> (node); |
581 | cgraph_node *cnode2 = dyn_cast <cgraph_node *> (item->node); | |
b84d4347 ML |
582 | |
583 | m_compared_func = static_cast<sem_function *> (item); | |
584 | ||
fb5c322e JH |
585 | if (cnode->thunk.thunk_p != cnode2->thunk.thunk_p) |
586 | return return_false_with_msg ("thunk_p mismatch"); | |
587 | ||
588 | if (cnode->thunk.thunk_p) | |
589 | { | |
590 | if (cnode->thunk.fixed_offset != cnode2->thunk.fixed_offset) | |
591 | return return_false_with_msg ("thunk fixed_offset mismatch"); | |
592 | if (cnode->thunk.virtual_value != cnode2->thunk.virtual_value) | |
593 | return return_false_with_msg ("thunk virtual_value mismatch"); | |
594 | if (cnode->thunk.this_adjusting != cnode2->thunk.this_adjusting) | |
595 | return return_false_with_msg ("thunk this_adjusting mismatch"); | |
596 | if (cnode->thunk.virtual_offset_p != cnode2->thunk.virtual_offset_p) | |
597 | return return_false_with_msg ("thunk virtual_offset_p mismatch"); | |
598 | if (cnode->thunk.add_pointer_bounds_args | |
599 | != cnode2->thunk.add_pointer_bounds_args) | |
600 | return return_false_with_msg ("thunk add_pointer_bounds_args mismatch"); | |
601 | } | |
602 | ||
c4234544 JH |
603 | /* Compare special function DECL attributes. */ |
604 | if (DECL_FUNCTION_PERSONALITY (decl) | |
605 | != DECL_FUNCTION_PERSONALITY (item->decl)) | |
606 | return return_false_with_msg ("function personalities are different"); | |
607 | ||
c4234544 JH |
608 | if (DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) |
609 | != DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (item->decl)) | |
610 | return return_false_with_msg ("intrument function entry exit " | |
611 | "attributes are different"); | |
612 | ||
613 | if (DECL_NO_LIMIT_STACK (decl) != DECL_NO_LIMIT_STACK (item->decl)) | |
614 | return return_false_with_msg ("no stack limit attributes are different"); | |
615 | ||
060cfff4 | 616 | if (DECL_CXX_CONSTRUCTOR_P (decl) != DECL_CXX_CONSTRUCTOR_P (item->decl)) |
69f6b1f4 | 617 | return return_false_with_msg ("DECL_CXX_CONSTRUCTOR mismatch"); |
060cfff4 JH |
618 | |
619 | if (DECL_CXX_DESTRUCTOR_P (decl) != DECL_CXX_DESTRUCTOR_P (item->decl)) | |
69f6b1f4 | 620 | return return_false_with_msg ("DECL_CXX_DESTRUCTOR mismatch"); |
060cfff4 | 621 | |
b3587b99 JH |
622 | /* TODO: pure/const flags mostly matters only for references, except for |
623 | the fact that codegen takes LOOPING flag as a hint that loops are | |
624 | finite. We may arrange the code to always pick leader that has least | |
625 | specified flags and then this can go into comparing symbol properties. */ | |
c4234544 JH |
626 | if (flags_from_decl_or_type (decl) != flags_from_decl_or_type (item->decl)) |
627 | return return_false_with_msg ("decl_or_type flags are different"); | |
628 | ||
060cfff4 JH |
629 | /* Do not match polymorphic constructors of different types. They calls |
630 | type memory location for ipa-polymorphic-call and we do not want | |
631 | it to get confused by wrong type. */ | |
632 | if (DECL_CXX_CONSTRUCTOR_P (decl) | |
633 | && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE) | |
634 | { | |
635 | if (TREE_CODE (TREE_TYPE (item->decl)) != METHOD_TYPE) | |
636 | return return_false_with_msg ("DECL_CXX_CONSTURCTOR type mismatch"); | |
637 | else if (!func_checker::compatible_polymorphic_types_p | |
70e7f2a2 JH |
638 | (TYPE_METHOD_BASETYPE (TREE_TYPE (decl)), |
639 | TYPE_METHOD_BASETYPE (TREE_TYPE (item->decl)), false)) | |
060cfff4 JH |
640 | return return_false_with_msg ("ctor polymorphic type mismatch"); |
641 | } | |
642 | ||
c4234544 JH |
643 | /* Checking function TARGET and OPTIMIZATION flags. */ |
644 | cl_target_option *tar1 = target_opts_for_fn (decl); | |
645 | cl_target_option *tar2 = target_opts_for_fn (item->decl); | |
646 | ||
647 | if (tar1 != tar2 && !cl_target_option_eq (tar1, tar2)) | |
648 | { | |
649 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
650 | { | |
651 | fprintf (dump_file, "target flags difference"); | |
652 | cl_target_option_print_diff (dump_file, 2, tar1, tar2); | |
653 | } | |
654 | ||
655 | return return_false_with_msg ("Target flags are different"); | |
656 | } | |
657 | ||
658 | cl_optimization *opt1 = opts_for_fn (decl); | |
659 | cl_optimization *opt2 = opts_for_fn (item->decl); | |
660 | ||
661 | if (opt1 != opt2 && memcmp (opt1, opt2, sizeof(cl_optimization))) | |
662 | { | |
663 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
664 | { | |
665 | fprintf (dump_file, "optimization flags difference"); | |
666 | cl_optimization_print_diff (dump_file, 2, opt1, opt2); | |
667 | } | |
668 | ||
669 | return return_false_with_msg ("optimization flags are different"); | |
670 | } | |
671 | ||
672 | /* Result type checking. */ | |
1628e36b JH |
673 | if (!func_checker::compatible_types_p |
674 | (TREE_TYPE (TREE_TYPE (decl)), | |
675 | TREE_TYPE (TREE_TYPE (m_compared_func->decl)))) | |
c4234544 JH |
676 | return return_false_with_msg ("result types are different"); |
677 | ||
b84d4347 | 678 | /* Checking types of arguments. */ |
1628e36b JH |
679 | tree list1 = TYPE_ARG_TYPES (TREE_TYPE (decl)), |
680 | list2 = TYPE_ARG_TYPES (TREE_TYPE (m_compared_func->decl)); | |
681 | for (unsigned i = 0; list1 && list2; | |
682 | list1 = TREE_CHAIN (list1), list2 = TREE_CHAIN (list2), i++) | |
b84d4347 | 683 | { |
1628e36b JH |
684 | tree parm1 = TREE_VALUE (list1); |
685 | tree parm2 = TREE_VALUE (list2); | |
686 | ||
b84d4347 | 687 | /* This guard is here for function pointer with attributes (pr59927.c). */ |
1628e36b | 688 | if (!parm1 || !parm2) |
b84d4347 ML |
689 | return return_false_with_msg ("NULL argument type"); |
690 | ||
1628e36b JH |
691 | /* Verify that types are compatible to ensure that both functions |
692 | have same calling conventions. */ | |
693 | if (!types_compatible_p (parm1, parm2)) | |
694 | return return_false_with_msg ("parameter types are not compatible"); | |
b3587b99 | 695 | |
b3587b99 JH |
696 | if (!param_used_p (i)) |
697 | continue; | |
1628e36b JH |
698 | |
699 | /* Perform additional checks for used parameters. */ | |
700 | if (!compatible_parm_types_p (parm1, parm2)) | |
701 | return false; | |
b84d4347 ML |
702 | } |
703 | ||
1628e36b JH |
704 | if (list1 || list2) |
705 | return return_false_with_msg ("Mismatched number of parameters"); | |
706 | ||
b84d4347 ML |
707 | if (node->num_references () != item->node->num_references ()) |
708 | return return_false_with_msg ("different number of references"); | |
709 | ||
b3587b99 JH |
710 | /* Checking function attributes. |
711 | This is quadratic in number of attributes */ | |
fe75bd20 JH |
712 | if (comp_type_attributes (TREE_TYPE (decl), |
713 | TREE_TYPE (item->decl)) != 1) | |
714 | return return_false_with_msg ("different type attributes"); | |
b3587b99 JH |
715 | if (!compare_attributes (DECL_ATTRIBUTES (decl), |
716 | DECL_ATTRIBUTES (item->decl))) | |
717 | return return_false_with_msg ("different decl attributes"); | |
fe75bd20 | 718 | |
060cfff4 JH |
719 | /* The type of THIS pointer type memory location for |
720 | ipa-polymorphic-call-analysis. */ | |
721 | if (opt_for_fn (decl, flag_devirtualize) | |
722 | && (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE | |
723 | || TREE_CODE (TREE_TYPE (item->decl)) == METHOD_TYPE) | |
b3587b99 | 724 | && param_used_p (0) |
060cfff4 JH |
725 | && compare_polymorphic_p ()) |
726 | { | |
727 | if (TREE_CODE (TREE_TYPE (decl)) != TREE_CODE (TREE_TYPE (item->decl))) | |
728 | return return_false_with_msg ("METHOD_TYPE and FUNCTION_TYPE mismatch"); | |
729 | if (!func_checker::compatible_polymorphic_types_p | |
70e7f2a2 JH |
730 | (TYPE_METHOD_BASETYPE (TREE_TYPE (decl)), |
731 | TYPE_METHOD_BASETYPE (TREE_TYPE (item->decl)), false)) | |
060cfff4 JH |
732 | return return_false_with_msg ("THIS pointer ODR type mismatch"); |
733 | } | |
734 | ||
b84d4347 ML |
735 | ipa_ref *ref = NULL, *ref2 = NULL; |
736 | for (unsigned i = 0; node->iterate_reference (i, ref); i++) | |
737 | { | |
738 | item->node->iterate_reference (i, ref2); | |
739 | ||
b3587b99 JH |
740 | if (ref->use != ref2->use) |
741 | return return_false_with_msg ("reference use mismatch"); | |
742 | ||
977b01e3 | 743 | if (!compare_symbol_references (ignored_nodes, ref->referred, |
b6cddc7f ML |
744 | ref2->referred, |
745 | ref->address_matters_p ())) | |
b84d4347 ML |
746 | return false; |
747 | } | |
748 | ||
749 | cgraph_edge *e1 = dyn_cast <cgraph_node *> (node)->callees; | |
750 | cgraph_edge *e2 = dyn_cast <cgraph_node *> (item->node)->callees; | |
751 | ||
752 | while (e1 && e2) | |
753 | { | |
977b01e3 | 754 | if (!compare_symbol_references (ignored_nodes, e1->callee, |
b6cddc7f | 755 | e2->callee, false)) |
b84d4347 | 756 | return false; |
b3587b99 JH |
757 | if (!compare_edge_flags (e1, e2)) |
758 | return false; | |
b84d4347 ML |
759 | |
760 | e1 = e1->next_callee; | |
761 | e2 = e2->next_callee; | |
762 | } | |
763 | ||
764 | if (e1 || e2) | |
b3587b99 JH |
765 | return return_false_with_msg ("different number of calls"); |
766 | ||
767 | e1 = dyn_cast <cgraph_node *> (node)->indirect_calls; | |
768 | e2 = dyn_cast <cgraph_node *> (item->node)->indirect_calls; | |
769 | ||
770 | while (e1 && e2) | |
771 | { | |
772 | if (!compare_edge_flags (e1, e2)) | |
773 | return false; | |
774 | ||
775 | e1 = e1->next_callee; | |
776 | e2 = e2->next_callee; | |
777 | } | |
778 | ||
779 | if (e1 || e2) | |
780 | return return_false_with_msg ("different number of indirect calls"); | |
b84d4347 ML |
781 | |
782 | return true; | |
783 | } | |
784 | ||
3ab93359 ML |
785 | /* Update hash by address sensitive references. We iterate over all |
786 | sensitive references (address_matters_p) and we hash ultime alias | |
787 | target of these nodes, which can improve a semantic item hash. | |
977b01e3 JH |
788 | |
789 | Also hash in referenced symbols properties. This can be done at any time | |
790 | (as the properties should not change), but it is convenient to do it here | |
791 | while we walk the references anyway. */ | |
3ab93359 ML |
792 | |
793 | void | |
794 | sem_item::update_hash_by_addr_refs (hash_map <symtab_node *, | |
795 | sem_item *> &m_symtab_node_map) | |
796 | { | |
3ab93359 | 797 | ipa_ref* ref; |
808b6bb7 | 798 | inchash::hash hstate (get_hash ()); |
977b01e3 JH |
799 | |
800 | for (unsigned i = 0; node->iterate_reference (i, ref); i++) | |
3ab93359 | 801 | { |
b3587b99 | 802 | hstate.add_int (ref->use); |
977b01e3 JH |
803 | hash_referenced_symbol_properties (ref->referred, hstate, |
804 | ref->use == IPA_REF_ADDR); | |
3ab93359 | 805 | if (ref->address_matters_p () || !m_symtab_node_map.get (ref->referred)) |
f45be077 | 806 | hstate.add_int (ref->referred->ultimate_alias_target ()->order); |
3ab93359 ML |
807 | } |
808 | ||
809 | if (is_a <cgraph_node *> (node)) | |
810 | { | |
811 | for (cgraph_edge *e = dyn_cast <cgraph_node *> (node)->callers; e; | |
812 | e = e->next_caller) | |
813 | { | |
814 | sem_item **result = m_symtab_node_map.get (e->callee); | |
977b01e3 | 815 | hash_referenced_symbol_properties (e->callee, hstate, false); |
3ab93359 | 816 | if (!result) |
f45be077 | 817 | hstate.add_int (e->callee->ultimate_alias_target ()->order); |
3ab93359 ML |
818 | } |
819 | } | |
820 | ||
808b6bb7 | 821 | set_hash (hstate.end ()); |
3ab93359 ML |
822 | } |
823 | ||
824 | /* Update hash by computed local hash values taken from different | |
977b01e3 JH |
825 | semantic items. |
826 | TODO: stronger SCC based hashing would be desirable here. */ | |
3ab93359 ML |
827 | |
828 | void | |
829 | sem_item::update_hash_by_local_refs (hash_map <symtab_node *, | |
830 | sem_item *> &m_symtab_node_map) | |
831 | { | |
977b01e3 | 832 | ipa_ref* ref; |
808b6bb7 | 833 | inchash::hash state (get_hash ()); |
977b01e3 JH |
834 | |
835 | for (unsigned j = 0; node->iterate_reference (j, ref); j++) | |
3ab93359 | 836 | { |
3ab93359 ML |
837 | sem_item **result = m_symtab_node_map.get (ref->referring); |
838 | if (result) | |
808b6bb7 | 839 | state.merge_hash ((*result)->get_hash ()); |
3ab93359 ML |
840 | } |
841 | ||
842 | if (type == FUNC) | |
843 | { | |
844 | for (cgraph_edge *e = dyn_cast <cgraph_node *> (node)->callees; e; | |
845 | e = e->next_callee) | |
846 | { | |
847 | sem_item **result = m_symtab_node_map.get (e->caller); | |
848 | if (result) | |
808b6bb7 | 849 | state.merge_hash ((*result)->get_hash ()); |
3ab93359 ML |
850 | } |
851 | } | |
852 | ||
853 | global_hash = state.end (); | |
854 | } | |
855 | ||
b84d4347 ML |
856 | /* Returns true if the item equals to ITEM given as argument. */ |
857 | ||
858 | bool | |
859 | sem_function::equals (sem_item *item, | |
fb5c322e | 860 | hash_map <symtab_node *, sem_item *> &) |
b84d4347 ML |
861 | { |
862 | gcc_assert (item->type == FUNC); | |
fb5c322e | 863 | bool eq = equals_private (item); |
b84d4347 ML |
864 | |
865 | if (m_checker != NULL) | |
866 | { | |
867 | delete m_checker; | |
868 | m_checker = NULL; | |
869 | } | |
870 | ||
871 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
872 | fprintf (dump_file, | |
464d0118 ML |
873 | "Equals called for: %s:%s with result: %s\n\n", |
874 | node->dump_name (), | |
875 | item->node->dump_name (), | |
1aec2ecc | 876 | eq ? "true" : "false"); |
b84d4347 ML |
877 | |
878 | return eq; | |
879 | } | |
880 | ||
881 | /* Processes function equality comparison. */ | |
882 | ||
883 | bool | |
fb5c322e | 884 | sem_function::equals_private (sem_item *item) |
b84d4347 ML |
885 | { |
886 | if (item->type != FUNC) | |
887 | return false; | |
888 | ||
889 | basic_block bb1, bb2; | |
890 | edge e1, e2; | |
891 | edge_iterator ei1, ei2; | |
b84d4347 ML |
892 | bool result = true; |
893 | tree arg1, arg2; | |
894 | ||
895 | m_compared_func = static_cast<sem_function *> (item); | |
896 | ||
897 | gcc_assert (decl != item->decl); | |
898 | ||
899 | if (bb_sorted.length () != m_compared_func->bb_sorted.length () | |
900 | || edge_count != m_compared_func->edge_count | |
901 | || cfg_checksum != m_compared_func->cfg_checksum) | |
902 | return return_false (); | |
903 | ||
b84d4347 ML |
904 | m_checker = new func_checker (decl, m_compared_func->decl, |
905 | compare_polymorphic_p (), | |
906 | false, | |
907 | &refs_set, | |
908 | &m_compared_func->refs_set); | |
1628e36b JH |
909 | arg1 = DECL_ARGUMENTS (decl); |
910 | arg2 = DECL_ARGUMENTS (m_compared_func->decl); | |
911 | for (unsigned i = 0; | |
912 | arg1 && arg2; arg1 = DECL_CHAIN (arg1), arg2 = DECL_CHAIN (arg2), i++) | |
913 | { | |
914 | if (!types_compatible_p (TREE_TYPE (arg1), TREE_TYPE (arg2))) | |
915 | return return_false_with_msg ("argument types are not compatible"); | |
916 | if (!param_used_p (i)) | |
917 | continue; | |
918 | /* Perform additional checks for used parameters. */ | |
919 | if (!compatible_parm_types_p (TREE_TYPE (arg1), TREE_TYPE (arg2))) | |
920 | return false; | |
921 | if (!m_checker->compare_decl (arg1, arg2)) | |
922 | return return_false (); | |
923 | } | |
924 | if (arg1 || arg2) | |
925 | return return_false_with_msg ("Mismatched number of arguments"); | |
b84d4347 | 926 | |
fb5c322e JH |
927 | if (!dyn_cast <cgraph_node *> (node)->has_gimple_body_p ()) |
928 | return true; | |
929 | ||
b84d4347 ML |
930 | /* Fill-up label dictionary. */ |
931 | for (unsigned i = 0; i < bb_sorted.length (); ++i) | |
932 | { | |
933 | m_checker->parse_labels (bb_sorted[i]); | |
934 | m_checker->parse_labels (m_compared_func->bb_sorted[i]); | |
935 | } | |
936 | ||
937 | /* Checking all basic blocks. */ | |
938 | for (unsigned i = 0; i < bb_sorted.length (); ++i) | |
939 | if(!m_checker->compare_bb (bb_sorted[i], m_compared_func->bb_sorted[i])) | |
940 | return return_false(); | |
941 | ||
942 | dump_message ("All BBs are equal\n"); | |
943 | ||
c190efcc ML |
944 | auto_vec <int> bb_dict; |
945 | ||
b84d4347 ML |
946 | /* Basic block edges check. */ |
947 | for (unsigned i = 0; i < bb_sorted.length (); ++i) | |
948 | { | |
b84d4347 ML |
949 | bb1 = bb_sorted[i]->bb; |
950 | bb2 = m_compared_func->bb_sorted[i]->bb; | |
951 | ||
952 | ei2 = ei_start (bb2->preds); | |
953 | ||
954 | for (ei1 = ei_start (bb1->preds); ei_cond (ei1, &e1); ei_next (&ei1)) | |
955 | { | |
956 | ei_cond (ei2, &e2); | |
957 | ||
958 | if (e1->flags != e2->flags) | |
959 | return return_false_with_msg ("flags comparison returns false"); | |
960 | ||
1216ea72 | 961 | if (!bb_dict_test (&bb_dict, e1->src->index, e2->src->index)) |
b84d4347 ML |
962 | return return_false_with_msg ("edge comparison returns false"); |
963 | ||
1216ea72 | 964 | if (!bb_dict_test (&bb_dict, e1->dest->index, e2->dest->index)) |
b84d4347 ML |
965 | return return_false_with_msg ("BB comparison returns false"); |
966 | ||
967 | if (!m_checker->compare_edge (e1, e2)) | |
968 | return return_false_with_msg ("edge comparison returns false"); | |
969 | ||
970 | ei_next (&ei2); | |
971 | } | |
972 | } | |
973 | ||
974 | /* Basic block PHI nodes comparison. */ | |
975 | for (unsigned i = 0; i < bb_sorted.length (); i++) | |
976 | if (!compare_phi_node (bb_sorted[i]->bb, m_compared_func->bb_sorted[i]->bb)) | |
977 | return return_false_with_msg ("PHI node comparison returns false"); | |
978 | ||
979 | return result; | |
980 | } | |
981 | ||
106b5466 JH |
982 | /* Set LOCAL_P of NODE to true if DATA is non-NULL. |
983 | Helper for call_for_symbol_thunks_and_aliases. */ | |
984 | ||
985 | static bool | |
986 | set_local (cgraph_node *node, void *data) | |
987 | { | |
988 | node->local.local = data != NULL; | |
989 | return false; | |
990 | } | |
991 | ||
412049de | 992 | /* TREE_ADDRESSABLE of NODE to true. |
0a7246ee JH |
993 | Helper for call_for_symbol_thunks_and_aliases. */ |
994 | ||
995 | static bool | |
996 | set_addressable (varpool_node *node, void *) | |
997 | { | |
998 | TREE_ADDRESSABLE (node->decl) = 1; | |
999 | return false; | |
1000 | } | |
1001 | ||
412049de JH |
1002 | /* Clear DECL_RTL of NODE. |
1003 | Helper for call_for_symbol_thunks_and_aliases. */ | |
1004 | ||
1005 | static bool | |
1006 | clear_decl_rtl (symtab_node *node, void *) | |
1007 | { | |
1008 | SET_DECL_RTL (node->decl, NULL); | |
1009 | return false; | |
1010 | } | |
1011 | ||
0a7246ee JH |
1012 | /* Redirect all callers of N and its aliases to TO. Remove aliases if |
1013 | possible. Return number of redirections made. */ | |
1014 | ||
1015 | static int | |
1016 | redirect_all_callers (cgraph_node *n, cgraph_node *to) | |
1017 | { | |
1018 | int nredirected = 0; | |
1019 | ipa_ref *ref; | |
17d1bf76 | 1020 | cgraph_edge *e = n->callers; |
0a7246ee | 1021 | |
17d1bf76 | 1022 | while (e) |
0a7246ee | 1023 | { |
17d1bf76 ML |
1024 | /* Redirecting thunks to interposable symbols or symbols in other sections |
1025 | may not be supported by target output code. Play safe for now and | |
1026 | punt on redirection. */ | |
1027 | if (!e->caller->thunk.thunk_p) | |
1028 | { | |
1029 | struct cgraph_edge *nexte = e->next_caller; | |
1030 | e->redirect_callee (to); | |
1031 | e = nexte; | |
1032 | nredirected++; | |
1033 | } | |
1034 | else | |
1035 | e = e->next_callee; | |
0a7246ee JH |
1036 | } |
1037 | for (unsigned i = 0; n->iterate_direct_aliases (i, ref);) | |
1038 | { | |
1039 | bool removed = false; | |
1040 | cgraph_node *n_alias = dyn_cast <cgraph_node *> (ref->referring); | |
1041 | ||
1042 | if ((DECL_COMDAT_GROUP (n->decl) | |
1043 | && (DECL_COMDAT_GROUP (n->decl) | |
1044 | == DECL_COMDAT_GROUP (n_alias->decl))) | |
1045 | || (n_alias->get_availability () > AVAIL_INTERPOSABLE | |
1046 | && n->get_availability () > AVAIL_INTERPOSABLE)) | |
1047 | { | |
1048 | nredirected += redirect_all_callers (n_alias, to); | |
1049 | if (n_alias->can_remove_if_no_direct_calls_p () | |
17d1bf76 ML |
1050 | && !n_alias->call_for_symbol_and_aliases (cgraph_node::has_thunk_p, |
1051 | NULL, true) | |
0a7246ee JH |
1052 | && !n_alias->has_aliases_p ()) |
1053 | n_alias->remove (); | |
1054 | } | |
1055 | if (!removed) | |
1056 | i++; | |
1057 | } | |
1058 | return nredirected; | |
1059 | } | |
1060 | ||
b84d4347 ML |
1061 | /* Merges instance with an ALIAS_ITEM, where alias, thunk or redirection can |
1062 | be applied. */ | |
0a7246ee | 1063 | |
b84d4347 ML |
1064 | bool |
1065 | sem_function::merge (sem_item *alias_item) | |
1066 | { | |
1067 | gcc_assert (alias_item->type == FUNC); | |
1068 | ||
1069 | sem_function *alias_func = static_cast<sem_function *> (alias_item); | |
1070 | ||
1071 | cgraph_node *original = get_node (); | |
0a7246ee | 1072 | cgraph_node *local_original = NULL; |
b84d4347 | 1073 | cgraph_node *alias = alias_func->get_node (); |
b84d4347 | 1074 | |
0a7246ee | 1075 | bool create_wrapper = false; |
b84d4347 ML |
1076 | bool create_alias = false; |
1077 | bool redirect_callers = false; | |
0a7246ee JH |
1078 | bool remove = false; |
1079 | ||
b84d4347 | 1080 | bool original_discardable = false; |
c7a06bc1 | 1081 | bool original_discarded = false; |
b84d4347 | 1082 | |
0a7246ee JH |
1083 | bool original_address_matters = original->address_matters_p (); |
1084 | bool alias_address_matters = alias->address_matters_p (); | |
1085 | ||
257291fc JH |
1086 | if (DECL_EXTERNAL (alias->decl)) |
1087 | { | |
1088 | if (dump_file) | |
1089 | fprintf (dump_file, "Not unifying; alias is external.\n\n"); | |
1090 | return false; | |
1091 | } | |
1092 | ||
0a7246ee JH |
1093 | if (DECL_NO_INLINE_WARNING_P (original->decl) |
1094 | != DECL_NO_INLINE_WARNING_P (alias->decl)) | |
1095 | { | |
1096 | if (dump_file) | |
1097 | fprintf (dump_file, | |
1098 | "Not unifying; " | |
1099 | "DECL_NO_INLINE_WARNING mismatch.\n\n"); | |
1100 | return false; | |
1101 | } | |
1102 | ||
b84d4347 ML |
1103 | /* Do not attempt to mix functions from different user sections; |
1104 | we do not know what user intends with those. */ | |
1105 | if (((DECL_SECTION_NAME (original->decl) && !original->implicit_section) | |
1106 | || (DECL_SECTION_NAME (alias->decl) && !alias->implicit_section)) | |
1107 | && DECL_SECTION_NAME (original->decl) != DECL_SECTION_NAME (alias->decl)) | |
1108 | { | |
1109 | if (dump_file) | |
1110 | fprintf (dump_file, | |
0a7246ee JH |
1111 | "Not unifying; " |
1112 | "original and alias are in different sections.\n\n"); | |
b84d4347 ML |
1113 | return false; |
1114 | } | |
1115 | ||
fcb6fced ML |
1116 | if (!original->in_same_comdat_group_p (alias) |
1117 | || original->comdat_local_p ()) | |
1118 | { | |
1119 | if (dump_file) | |
1120 | fprintf (dump_file, | |
1121 | "Not unifying; alias nor wrapper cannot be created; " | |
1122 | "across comdat group boundary\n\n"); | |
1123 | ||
1124 | return false; | |
1125 | } | |
1126 | ||
b84d4347 | 1127 | /* See if original is in a section that can be discarded if the main |
c7a06bc1 | 1128 | symbol is not used. */ |
0a7246ee | 1129 | |
c7a06bc1 JH |
1130 | if (original->can_be_discarded_p ()) |
1131 | original_discardable = true; | |
1132 | /* Also consider case where we have resolution info and we know that | |
0a7246ee JH |
1133 | original's definition is not going to be used. In this case we can not |
1134 | create alias to original. */ | |
c7a06bc1 JH |
1135 | if (node->resolution != LDPR_UNKNOWN |
1136 | && !decl_binds_to_current_def_p (node->decl)) | |
1137 | original_discardable = original_discarded = true; | |
b84d4347 | 1138 | |
0a7246ee JH |
1139 | /* Creating a symtab alias is the optimal way to merge. |
1140 | It however can not be used in the following cases: | |
1141 | ||
1142 | 1) if ORIGINAL and ALIAS may be possibly compared for address equality. | |
1143 | 2) if ORIGINAL is in a section that may be discarded by linker or if | |
1144 | it is an external functions where we can not create an alias | |
1145 | (ORIGINAL_DISCARDABLE) | |
1146 | 3) if target do not support symbol aliases. | |
bbcdfb93 | 1147 | 4) original and alias lie in different comdat groups. |
0a7246ee JH |
1148 | |
1149 | If we can not produce alias, we will turn ALIAS into WRAPPER of ORIGINAL | |
1150 | and/or redirect all callers from ALIAS to ORIGINAL. */ | |
1151 | if ((original_address_matters && alias_address_matters) | |
bbcdfb93 JH |
1152 | || (original_discardable |
1153 | && (!DECL_COMDAT_GROUP (alias->decl) | |
1154 | || (DECL_COMDAT_GROUP (alias->decl) | |
1155 | != DECL_COMDAT_GROUP (original->decl)))) | |
c7a06bc1 | 1156 | || original_discarded |
bbcdfb93 JH |
1157 | || !sem_item::target_supports_symbol_aliases_p () |
1158 | || DECL_COMDAT_GROUP (alias->decl) != DECL_COMDAT_GROUP (original->decl)) | |
b84d4347 | 1159 | { |
0a7246ee JH |
1160 | /* First see if we can produce wrapper. */ |
1161 | ||
977b01e3 JH |
1162 | /* Symbol properties that matter for references must be preserved. |
1163 | TODO: We can produce wrapper, but we need to produce alias of ORIGINAL | |
1164 | with proper properties. */ | |
1165 | if (!sem_item::compare_referenced_symbol_properties (NULL, original, alias, | |
1166 | alias->address_taken)) | |
1167 | { | |
1168 | if (dump_file) | |
1169 | fprintf (dump_file, | |
1170 | "Wrapper cannot be created because referenced symbol " | |
1171 | "properties mismatch\n"); | |
1172 | } | |
0a7246ee JH |
1173 | /* Do not turn function in one comdat group into wrapper to another |
1174 | comdat group. Other compiler producing the body of the | |
1175 | another comdat group may make opossite decision and with unfortunate | |
1176 | linker choices this may close a loop. */ | |
977b01e3 JH |
1177 | else if (DECL_COMDAT_GROUP (original->decl) |
1178 | && DECL_COMDAT_GROUP (alias->decl) | |
1179 | && (DECL_COMDAT_GROUP (alias->decl) | |
1180 | != DECL_COMDAT_GROUP (original->decl))) | |
0a7246ee JH |
1181 | { |
1182 | if (dump_file) | |
1183 | fprintf (dump_file, | |
1184 | "Wrapper cannot be created because of COMDAT\n"); | |
1185 | } | |
4ebd491f EB |
1186 | else if (DECL_STATIC_CHAIN (alias->decl) |
1187 | || DECL_STATIC_CHAIN (original->decl)) | |
0a7246ee JH |
1188 | { |
1189 | if (dump_file) | |
1190 | fprintf (dump_file, | |
4ebd491f | 1191 | "Cannot create wrapper of nested function.\n"); |
0a7246ee JH |
1192 | } |
1193 | /* TODO: We can also deal with variadic functions never calling | |
1194 | VA_START. */ | |
1195 | else if (stdarg_p (TREE_TYPE (alias->decl))) | |
1196 | { | |
1197 | if (dump_file) | |
1198 | fprintf (dump_file, | |
1199 | "can not create wrapper of stdarg function.\n"); | |
1200 | } | |
0bceb671 JH |
1201 | else if (ipa_fn_summaries |
1202 | && ipa_fn_summaries->get (alias)->self_size <= 2) | |
0a7246ee JH |
1203 | { |
1204 | if (dump_file) | |
1205 | fprintf (dump_file, "Wrapper creation is not " | |
1206 | "profitable (function is too small).\n"); | |
1207 | } | |
1208 | /* If user paid attention to mark function noinline, assume it is | |
1209 | somewhat special and do not try to turn it into a wrapper that can | |
1210 | not be undone by inliner. */ | |
1211 | else if (lookup_attribute ("noinline", DECL_ATTRIBUTES (alias->decl))) | |
1212 | { | |
1213 | if (dump_file) | |
1214 | fprintf (dump_file, "Wrappers are not created for noinline.\n"); | |
1215 | } | |
1216 | else | |
1217 | create_wrapper = true; | |
1218 | ||
1219 | /* We can redirect local calls in the case both alias and orignal | |
1220 | are not interposable. */ | |
b84d4347 | 1221 | redirect_callers |
0a7246ee JH |
1222 | = alias->get_availability () > AVAIL_INTERPOSABLE |
1223 | && original->get_availability () > AVAIL_INTERPOSABLE | |
1224 | && !alias->instrumented_version; | |
977b01e3 JH |
1225 | /* TODO: We can redirect, but we need to produce alias of ORIGINAL |
1226 | with proper properties. */ | |
1227 | if (!sem_item::compare_referenced_symbol_properties (NULL, original, alias, | |
1228 | alias->address_taken)) | |
1229 | redirect_callers = false; | |
b84d4347 | 1230 | |
0a7246ee JH |
1231 | if (!redirect_callers && !create_wrapper) |
1232 | { | |
1233 | if (dump_file) | |
1234 | fprintf (dump_file, "Not unifying; can not redirect callers nor " | |
1235 | "produce wrapper\n\n"); | |
1236 | return false; | |
1237 | } | |
1238 | ||
1239 | /* Work out the symbol the wrapper should call. | |
1240 | If ORIGINAL is interposable, we need to call a local alias. | |
c7a06bc1 JH |
1241 | Also produce local alias (if possible) as an optimization. |
1242 | ||
1243 | Local aliases can not be created inside comdat groups because that | |
1244 | prevents inlining. */ | |
1245 | if (!original_discardable && !original->get_comdat_group ()) | |
0a7246ee JH |
1246 | { |
1247 | local_original | |
1248 | = dyn_cast <cgraph_node *> (original->noninterposable_alias ()); | |
1249 | if (!local_original | |
1250 | && original->get_availability () > AVAIL_INTERPOSABLE) | |
1251 | local_original = original; | |
0a7246ee JH |
1252 | } |
1253 | /* If we can not use local alias, fallback to the original | |
1254 | when possible. */ | |
1255 | else if (original->get_availability () > AVAIL_INTERPOSABLE) | |
1256 | local_original = original; | |
c7a06bc1 JH |
1257 | |
1258 | /* If original is COMDAT local, we can not really redirect calls outside | |
1259 | of its comdat group to it. */ | |
1260 | if (original->comdat_local_p ()) | |
1261 | redirect_callers = false; | |
0a7246ee JH |
1262 | if (!local_original) |
1263 | { | |
1264 | if (dump_file) | |
1265 | fprintf (dump_file, "Not unifying; " | |
1266 | "can not produce local alias.\n\n"); | |
1267 | return false; | |
1268 | } | |
f657d665 | 1269 | |
0a7246ee JH |
1270 | if (!redirect_callers && !create_wrapper) |
1271 | { | |
1272 | if (dump_file) | |
1273 | fprintf (dump_file, "Not unifying; " | |
1274 | "can not redirect callers nor produce a wrapper\n\n"); | |
1275 | return false; | |
1276 | } | |
1277 | if (!create_wrapper | |
17d1bf76 ML |
1278 | && !alias->call_for_symbol_and_aliases (cgraph_node::has_thunk_p, |
1279 | NULL, true) | |
0a7246ee JH |
1280 | && !alias->can_remove_if_no_direct_calls_p ()) |
1281 | { | |
1282 | if (dump_file) | |
1283 | fprintf (dump_file, "Not unifying; can not make wrapper and " | |
1284 | "function has other uses than direct calls\n\n"); | |
1285 | return false; | |
1286 | } | |
544dafa6 | 1287 | } |
0a7246ee JH |
1288 | else |
1289 | create_alias = true; | |
544dafa6 | 1290 | |
b84d4347 ML |
1291 | if (redirect_callers) |
1292 | { | |
0a7246ee | 1293 | int nredirected = redirect_all_callers (alias, local_original); |
b84d4347 | 1294 | |
0a7246ee JH |
1295 | if (nredirected) |
1296 | { | |
1297 | alias->icf_merged = true; | |
1298 | local_original->icf_merged = true; | |
b84d4347 | 1299 | |
0a7246ee JH |
1300 | if (dump_file && nredirected) |
1301 | fprintf (dump_file, "%i local calls have been " | |
1302 | "redirected.\n", nredirected); | |
b84d4347 ML |
1303 | } |
1304 | ||
0a7246ee JH |
1305 | /* If all callers was redirected, do not produce wrapper. */ |
1306 | if (alias->can_remove_if_no_direct_calls_p () | |
824ca15e | 1307 | && !DECL_VIRTUAL_P (alias->decl) |
0a7246ee JH |
1308 | && !alias->has_aliases_p ()) |
1309 | { | |
1310 | create_wrapper = false; | |
1311 | remove = true; | |
1312 | } | |
1313 | gcc_assert (!create_alias); | |
b84d4347 | 1314 | } |
b84d4347 ML |
1315 | else if (create_alias) |
1316 | { | |
1317 | alias->icf_merged = true; | |
1318 | ||
1319 | /* Remove the function's body. */ | |
1320 | ipa_merge_profiles (original, alias); | |
1321 | alias->release_body (true); | |
1322 | alias->reset (); | |
412049de JH |
1323 | /* Notice global symbol possibly produced RTL. */ |
1324 | ((symtab_node *)alias)->call_for_symbol_and_aliases (clear_decl_rtl, | |
1325 | NULL, true); | |
b84d4347 ML |
1326 | |
1327 | /* Create the alias. */ | |
1328 | cgraph_node::create_alias (alias_func->decl, decl); | |
1329 | alias->resolve_alias (original); | |
1330 | ||
106b5466 JH |
1331 | original->call_for_symbol_thunks_and_aliases |
1332 | (set_local, (void *)(size_t) original->local_p (), true); | |
9d4ded75 | 1333 | |
b84d4347 | 1334 | if (dump_file) |
0a7246ee | 1335 | fprintf (dump_file, "Unified; Function alias has been created.\n\n"); |
b84d4347 | 1336 | } |
0a7246ee | 1337 | if (create_wrapper) |
b84d4347 | 1338 | { |
0a7246ee JH |
1339 | gcc_assert (!create_alias); |
1340 | alias->icf_merged = true; | |
1341 | local_original->icf_merged = true; | |
b84d4347 | 1342 | |
3995f3a2 JH |
1343 | /* FIXME update local_original counts. */ |
1344 | ipa_merge_profiles (original, alias, true); | |
0a7246ee | 1345 | alias->create_wrapper (local_original); |
b84d4347 | 1346 | |
0a7246ee JH |
1347 | if (dump_file) |
1348 | fprintf (dump_file, "Unified; Wrapper has been created.\n\n"); | |
1349 | } | |
17d1bf76 ML |
1350 | |
1351 | /* It's possible that redirection can hit thunks that block | |
1352 | redirection opportunities. */ | |
1353 | gcc_assert (alias->icf_merged || remove || redirect_callers); | |
0a7246ee | 1354 | original->icf_merged = true; |
34b42fb0 | 1355 | |
88636b62 JH |
1356 | /* We use merged flag to track cases where COMDAT function is known to be |
1357 | compatible its callers. If we merged in non-COMDAT, we need to give up | |
1358 | on this optimization. */ | |
1359 | if (original->merged_comdat && !alias->merged_comdat) | |
1360 | { | |
1361 | if (dump_file) | |
1362 | fprintf (dump_file, "Dropping merged_comdat flag.\n\n"); | |
e9e70798 JH |
1363 | if (local_original) |
1364 | local_original->merged_comdat = false; | |
1365 | original->merged_comdat = false; | |
88636b62 | 1366 | } |
34b42fb0 | 1367 | |
0a7246ee JH |
1368 | if (remove) |
1369 | { | |
1370 | ipa_merge_profiles (original, alias); | |
1371 | alias->release_body (); | |
1372 | alias->reset (); | |
1373 | alias->body_removed = true; | |
b84d4347 | 1374 | alias->icf_merged = true; |
b84d4347 | 1375 | if (dump_file) |
0a7246ee | 1376 | fprintf (dump_file, "Unified; Function body was removed.\n"); |
b84d4347 | 1377 | } |
b84d4347 ML |
1378 | |
1379 | return true; | |
1380 | } | |
1381 | ||
1382 | /* Semantic item initialization function. */ | |
1383 | ||
1384 | void | |
1385 | sem_function::init (void) | |
1386 | { | |
1387 | if (in_lto_p) | |
70486010 | 1388 | get_node ()->get_untransformed_body (); |
b84d4347 ML |
1389 | |
1390 | tree fndecl = node->decl; | |
1391 | function *func = DECL_STRUCT_FUNCTION (fndecl); | |
1392 | ||
1393 | gcc_assert (func); | |
1394 | gcc_assert (SSANAMES (func)); | |
1395 | ||
1396 | ssa_names_size = SSANAMES (func)->length (); | |
1397 | node = node; | |
1398 | ||
1399 | decl = fndecl; | |
1400 | region_tree = func->eh->region_tree; | |
1401 | ||
1402 | /* iterating all function arguments. */ | |
1403 | arg_count = count_formal_params (fndecl); | |
1404 | ||
1405 | edge_count = n_edges_for_fn (func); | |
fb5c322e JH |
1406 | cgraph_node *cnode = dyn_cast <cgraph_node *> (node); |
1407 | if (!cnode->thunk.thunk_p) | |
1408 | { | |
1409 | cfg_checksum = coverage_compute_cfg_checksum (func); | |
b84d4347 | 1410 | |
fb5c322e | 1411 | inchash::hash hstate; |
b84d4347 | 1412 | |
fb5c322e JH |
1413 | basic_block bb; |
1414 | FOR_EACH_BB_FN (bb, func) | |
b84d4347 | 1415 | { |
fb5c322e | 1416 | unsigned nondbg_stmt_count = 0; |
b84d4347 | 1417 | |
fb5c322e JH |
1418 | edge e; |
1419 | for (edge_iterator ei = ei_start (bb->preds); ei_cond (ei, &e); | |
1420 | ei_next (&ei)) | |
1421 | cfg_checksum = iterative_hash_host_wide_int (e->flags, | |
1422 | cfg_checksum); | |
1423 | ||
1424 | for (gimple_stmt_iterator gsi = gsi_start_bb (bb); !gsi_end_p (gsi); | |
1425 | gsi_next (&gsi)) | |
b84d4347 | 1426 | { |
355fe088 | 1427 | gimple *stmt = gsi_stmt (gsi); |
fb5c322e JH |
1428 | |
1429 | if (gimple_code (stmt) != GIMPLE_DEBUG | |
1430 | && gimple_code (stmt) != GIMPLE_PREDICT) | |
1431 | { | |
1432 | hash_stmt (stmt, hstate); | |
1433 | nondbg_stmt_count++; | |
1434 | } | |
b84d4347 | 1435 | } |
b84d4347 | 1436 | |
5c5f0b65 | 1437 | hstate.commit_flag (); |
fb5c322e JH |
1438 | gcode_hash = hstate.end (); |
1439 | bb_sizes.safe_push (nondbg_stmt_count); | |
b84d4347 | 1440 | |
fb5c322e JH |
1441 | /* Inserting basic block to hash table. */ |
1442 | sem_bb *semantic_bb = new sem_bb (bb, nondbg_stmt_count, | |
1443 | EDGE_COUNT (bb->preds) | |
1444 | + EDGE_COUNT (bb->succs)); | |
b84d4347 | 1445 | |
fb5c322e JH |
1446 | bb_sorted.safe_push (semantic_bb); |
1447 | } | |
1448 | } | |
1449 | else | |
1450 | { | |
1451 | cfg_checksum = 0; | |
1452 | inchash::hash hstate; | |
449e9a33 RS |
1453 | hstate.add_hwi (cnode->thunk.fixed_offset); |
1454 | hstate.add_hwi (cnode->thunk.virtual_value); | |
fb5c322e JH |
1455 | hstate.add_flag (cnode->thunk.this_adjusting); |
1456 | hstate.add_flag (cnode->thunk.virtual_offset_p); | |
1457 | hstate.add_flag (cnode->thunk.add_pointer_bounds_args); | |
1458 | gcode_hash = hstate.end (); | |
1459 | } | |
b84d4347 ML |
1460 | } |
1461 | ||
a8d93817 JH |
1462 | /* Accumulate to HSTATE a hash of expression EXP. |
1463 | Identical to inchash::add_expr, but guaranteed to be stable across LTO | |
1464 | and DECL equality classes. */ | |
1465 | ||
1466 | void | |
1467 | sem_item::add_expr (const_tree exp, inchash::hash &hstate) | |
1468 | { | |
1469 | if (exp == NULL_TREE) | |
1470 | { | |
1471 | hstate.merge_hash (0); | |
1472 | return; | |
1473 | } | |
1474 | ||
1475 | /* Handled component can be matched in a cureful way proving equivalence | |
1476 | even if they syntactically differ. Just skip them. */ | |
1477 | STRIP_NOPS (exp); | |
1478 | while (handled_component_p (exp)) | |
1479 | exp = TREE_OPERAND (exp, 0); | |
1480 | ||
1481 | enum tree_code code = TREE_CODE (exp); | |
1482 | hstate.add_int (code); | |
1483 | ||
1484 | switch (code) | |
1485 | { | |
1486 | /* Use inchash::add_expr for everything that is LTO stable. */ | |
1487 | case VOID_CST: | |
1488 | case INTEGER_CST: | |
1489 | case REAL_CST: | |
1490 | case FIXED_CST: | |
1491 | case STRING_CST: | |
1492 | case COMPLEX_CST: | |
1493 | case VECTOR_CST: | |
1494 | inchash::add_expr (exp, hstate); | |
1495 | break; | |
1496 | case CONSTRUCTOR: | |
1497 | { | |
1498 | unsigned HOST_WIDE_INT idx; | |
1499 | tree value; | |
1500 | ||
449e9a33 | 1501 | hstate.add_hwi (int_size_in_bytes (TREE_TYPE (exp))); |
a8d93817 JH |
1502 | |
1503 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value) | |
1504 | if (value) | |
1505 | add_expr (value, hstate); | |
1506 | break; | |
1507 | } | |
1508 | case ADDR_EXPR: | |
1509 | case FDESC_EXPR: | |
1510 | add_expr (get_base_address (TREE_OPERAND (exp, 0)), hstate); | |
1511 | break; | |
1512 | case SSA_NAME: | |
1513 | case VAR_DECL: | |
1514 | case CONST_DECL: | |
1515 | case PARM_DECL: | |
449e9a33 | 1516 | hstate.add_hwi (int_size_in_bytes (TREE_TYPE (exp))); |
a8d93817 JH |
1517 | break; |
1518 | case MEM_REF: | |
1519 | case POINTER_PLUS_EXPR: | |
1520 | case MINUS_EXPR: | |
1521 | case RANGE_EXPR: | |
1522 | add_expr (TREE_OPERAND (exp, 0), hstate); | |
1523 | add_expr (TREE_OPERAND (exp, 1), hstate); | |
1524 | break; | |
1525 | case PLUS_EXPR: | |
1526 | { | |
1527 | inchash::hash one, two; | |
1528 | add_expr (TREE_OPERAND (exp, 0), one); | |
1529 | add_expr (TREE_OPERAND (exp, 1), two); | |
1530 | hstate.add_commutative (one, two); | |
1531 | } | |
1532 | break; | |
1533 | CASE_CONVERT: | |
449e9a33 | 1534 | hstate.add_hwi (int_size_in_bytes (TREE_TYPE (exp))); |
a8d93817 JH |
1535 | return add_expr (TREE_OPERAND (exp, 0), hstate); |
1536 | default: | |
1537 | break; | |
1538 | } | |
1539 | } | |
1540 | ||
69f6b1f4 JH |
1541 | /* Accumulate to HSTATE a hash of type t. |
1542 | TYpes that may end up being compatible after LTO type merging needs to have | |
1543 | the same hash. */ | |
1544 | ||
1545 | void | |
1546 | sem_item::add_type (const_tree type, inchash::hash &hstate) | |
1547 | { | |
1548 | if (type == NULL_TREE) | |
1549 | { | |
1550 | hstate.merge_hash (0); | |
1551 | return; | |
1552 | } | |
1553 | ||
1554 | type = TYPE_MAIN_VARIANT (type); | |
69f6b1f4 | 1555 | |
5e83f17d | 1556 | hstate.add_int (TYPE_MODE (type)); |
69f6b1f4 JH |
1557 | |
1558 | if (TREE_CODE (type) == COMPLEX_TYPE) | |
1559 | { | |
1560 | hstate.add_int (COMPLEX_TYPE); | |
1561 | sem_item::add_type (TREE_TYPE (type), hstate); | |
1562 | } | |
1563 | else if (INTEGRAL_TYPE_P (type)) | |
1564 | { | |
1565 | hstate.add_int (INTEGER_TYPE); | |
1566 | hstate.add_flag (TYPE_UNSIGNED (type)); | |
1567 | hstate.add_int (TYPE_PRECISION (type)); | |
1568 | } | |
1569 | else if (VECTOR_TYPE_P (type)) | |
1570 | { | |
1571 | hstate.add_int (VECTOR_TYPE); | |
1572 | hstate.add_int (TYPE_PRECISION (type)); | |
1573 | sem_item::add_type (TREE_TYPE (type), hstate); | |
1574 | } | |
1575 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
1576 | { | |
1577 | hstate.add_int (ARRAY_TYPE); | |
1578 | /* Do not hash size, so complete and incomplete types can match. */ | |
1579 | sem_item::add_type (TREE_TYPE (type), hstate); | |
1580 | } | |
1581 | else if (RECORD_OR_UNION_TYPE_P (type)) | |
1582 | { | |
a6df9d90 ML |
1583 | /* Incomplete types must be skipped here. */ |
1584 | if (!COMPLETE_TYPE_P (type)) | |
1585 | { | |
1586 | hstate.add_int (RECORD_TYPE); | |
1587 | return; | |
1588 | } | |
1589 | ||
69f6b1f4 JH |
1590 | hashval_t *val = optimizer->m_type_hash_cache.get (type); |
1591 | ||
1592 | if (!val) | |
1593 | { | |
1594 | inchash::hash hstate2; | |
1595 | unsigned nf; | |
1596 | tree f; | |
1597 | hashval_t hash; | |
1598 | ||
1599 | hstate2.add_int (RECORD_TYPE); | |
69f6b1f4 JH |
1600 | for (f = TYPE_FIELDS (type), nf = 0; f; f = TREE_CHAIN (f)) |
1601 | if (TREE_CODE (f) == FIELD_DECL) | |
1602 | { | |
1603 | add_type (TREE_TYPE (f), hstate2); | |
1604 | nf++; | |
1605 | } | |
1606 | ||
1607 | hstate2.add_int (nf); | |
1608 | hash = hstate2.end (); | |
449e9a33 | 1609 | hstate.add_hwi (hash); |
69f6b1f4 JH |
1610 | optimizer->m_type_hash_cache.put (type, hash); |
1611 | } | |
1612 | else | |
449e9a33 | 1613 | hstate.add_hwi (*val); |
69f6b1f4 JH |
1614 | } |
1615 | } | |
1616 | ||
b84d4347 ML |
1617 | /* Improve accumulated hash for HSTATE based on a gimple statement STMT. */ |
1618 | ||
1619 | void | |
355fe088 | 1620 | sem_function::hash_stmt (gimple *stmt, inchash::hash &hstate) |
b84d4347 ML |
1621 | { |
1622 | enum gimple_code code = gimple_code (stmt); | |
1623 | ||
a8d93817 | 1624 | hstate.add_int (code); |
b84d4347 | 1625 | |
a8d93817 | 1626 | switch (code) |
b84d4347 | 1627 | { |
69f6b1f4 JH |
1628 | case GIMPLE_SWITCH: |
1629 | add_expr (gimple_switch_index (as_a <gswitch *> (stmt)), hstate); | |
1630 | break; | |
a8d93817 | 1631 | case GIMPLE_ASSIGN: |
69f6b1f4 | 1632 | hstate.add_int (gimple_assign_rhs_code (stmt)); |
a8d93817 JH |
1633 | if (commutative_tree_code (gimple_assign_rhs_code (stmt)) |
1634 | || commutative_ternary_tree_code (gimple_assign_rhs_code (stmt))) | |
b84d4347 | 1635 | { |
a8d93817 | 1636 | inchash::hash one, two; |
b84d4347 | 1637 | |
a8d93817 | 1638 | add_expr (gimple_assign_rhs1 (stmt), one); |
69f6b1f4 | 1639 | add_type (TREE_TYPE (gimple_assign_rhs1 (stmt)), one); |
a8d93817 JH |
1640 | add_expr (gimple_assign_rhs2 (stmt), two); |
1641 | hstate.add_commutative (one, two); | |
69f6b1f4 JH |
1642 | if (commutative_ternary_tree_code (gimple_assign_rhs_code (stmt))) |
1643 | { | |
1644 | add_expr (gimple_assign_rhs3 (stmt), hstate); | |
1645 | add_type (TREE_TYPE (gimple_assign_rhs3 (stmt)), hstate); | |
1646 | } | |
a8d93817 | 1647 | add_expr (gimple_assign_lhs (stmt), hstate); |
69f6b1f4 | 1648 | add_type (TREE_TYPE (gimple_assign_lhs (stmt)), two); |
a8d93817 | 1649 | break; |
b84d4347 | 1650 | } |
191816a3 | 1651 | /* fall through */ |
a8d93817 JH |
1652 | case GIMPLE_CALL: |
1653 | case GIMPLE_ASM: | |
1654 | case GIMPLE_COND: | |
1655 | case GIMPLE_GOTO: | |
1656 | case GIMPLE_RETURN: | |
1657 | /* All these statements are equivalent if their operands are. */ | |
1658 | for (unsigned i = 0; i < gimple_num_ops (stmt); ++i) | |
69f6b1f4 JH |
1659 | { |
1660 | add_expr (gimple_op (stmt, i), hstate); | |
1661 | if (gimple_op (stmt, i)) | |
1662 | add_type (TREE_TYPE (gimple_op (stmt, i)), hstate); | |
1663 | } | |
5c5f0b65 IT |
1664 | /* Consider nocf_check attribute in hash as it affects code |
1665 | generation. */ | |
1666 | if (code == GIMPLE_CALL | |
1667 | && flag_cf_protection & CF_BRANCH) | |
1668 | hstate.add_flag (gimple_call_nocf_check_p (as_a <gcall *> (stmt))); | |
a8d93817 JH |
1669 | default: |
1670 | break; | |
b84d4347 ML |
1671 | } |
1672 | } | |
1673 | ||
1674 | ||
1675 | /* Return true if polymorphic comparison must be processed. */ | |
1676 | ||
1677 | bool | |
1678 | sem_function::compare_polymorphic_p (void) | |
1679 | { | |
060cfff4 JH |
1680 | struct cgraph_edge *e; |
1681 | ||
69f6b1f4 | 1682 | if (!opt_for_fn (get_node ()->decl, flag_devirtualize)) |
060cfff4 | 1683 | return false; |
69f6b1f4 | 1684 | if (get_node ()->indirect_calls != NULL) |
060cfff4 JH |
1685 | return true; |
1686 | /* TODO: We can do simple propagation determining what calls may lead to | |
1687 | a polymorphic call. */ | |
69f6b1f4 | 1688 | for (e = get_node ()->callees; e; e = e->next_callee) |
060cfff4 JH |
1689 | if (e->callee->definition |
1690 | && opt_for_fn (e->callee->decl, flag_devirtualize)) | |
1691 | return true; | |
1692 | return false; | |
b84d4347 ML |
1693 | } |
1694 | ||
1695 | /* For a given call graph NODE, the function constructs new | |
1696 | semantic function item. */ | |
1697 | ||
1698 | sem_function * | |
1699 | sem_function::parse (cgraph_node *node, bitmap_obstack *stack) | |
1700 | { | |
1701 | tree fndecl = node->decl; | |
1702 | function *func = DECL_STRUCT_FUNCTION (fndecl); | |
1703 | ||
fb5c322e | 1704 | if (!func || (!node->has_gimple_body_p () && !node->thunk.thunk_p)) |
b84d4347 ML |
1705 | return NULL; |
1706 | ||
1707 | if (lookup_attribute_by_prefix ("omp ", DECL_ATTRIBUTES (node->decl)) != NULL) | |
1708 | return NULL; | |
1709 | ||
97ad3aef CP |
1710 | if (lookup_attribute_by_prefix ("oacc ", |
1711 | DECL_ATTRIBUTES (node->decl)) != NULL) | |
1712 | return NULL; | |
1713 | ||
2a85ddbb ML |
1714 | /* PR ipa/70306. */ |
1715 | if (DECL_STATIC_CONSTRUCTOR (node->decl) | |
1716 | || DECL_STATIC_DESTRUCTOR (node->decl)) | |
1717 | return NULL; | |
1718 | ||
fedf2718 | 1719 | sem_function *f = new sem_function (node, stack); |
b84d4347 ML |
1720 | |
1721 | f->init (); | |
1722 | ||
1723 | return f; | |
1724 | } | |
1725 | ||
b84d4347 ML |
1726 | /* For given basic blocks BB1 and BB2 (from functions FUNC1 and FUNC), |
1727 | return true if phi nodes are semantically equivalent in these blocks . */ | |
1728 | ||
1729 | bool | |
1730 | sem_function::compare_phi_node (basic_block bb1, basic_block bb2) | |
1731 | { | |
538dd0b7 DM |
1732 | gphi_iterator si1, si2; |
1733 | gphi *phi1, *phi2; | |
b84d4347 ML |
1734 | unsigned size1, size2, i; |
1735 | tree t1, t2; | |
1736 | edge e1, e2; | |
1737 | ||
1738 | gcc_assert (bb1 != NULL); | |
1739 | gcc_assert (bb2 != NULL); | |
1740 | ||
1741 | si2 = gsi_start_phis (bb2); | |
1742 | for (si1 = gsi_start_phis (bb1); !gsi_end_p (si1); | |
1743 | gsi_next (&si1)) | |
1744 | { | |
1745 | gsi_next_nonvirtual_phi (&si1); | |
1746 | gsi_next_nonvirtual_phi (&si2); | |
1747 | ||
1748 | if (gsi_end_p (si1) && gsi_end_p (si2)) | |
1749 | break; | |
1750 | ||
1751 | if (gsi_end_p (si1) || gsi_end_p (si2)) | |
1752 | return return_false(); | |
1753 | ||
538dd0b7 DM |
1754 | phi1 = si1.phi (); |
1755 | phi2 = si2.phi (); | |
b84d4347 | 1756 | |
59f084e0 ML |
1757 | tree phi_result1 = gimple_phi_result (phi1); |
1758 | tree phi_result2 = gimple_phi_result (phi2); | |
1759 | ||
1760 | if (!m_checker->compare_operand (phi_result1, phi_result2)) | |
1761 | return return_false_with_msg ("PHI results are different"); | |
1762 | ||
b84d4347 ML |
1763 | size1 = gimple_phi_num_args (phi1); |
1764 | size2 = gimple_phi_num_args (phi2); | |
1765 | ||
1766 | if (size1 != size2) | |
1767 | return return_false (); | |
1768 | ||
1769 | for (i = 0; i < size1; ++i) | |
1770 | { | |
1771 | t1 = gimple_phi_arg (phi1, i)->def; | |
1772 | t2 = gimple_phi_arg (phi2, i)->def; | |
1773 | ||
1774 | if (!m_checker->compare_operand (t1, t2)) | |
1775 | return return_false (); | |
1776 | ||
1777 | e1 = gimple_phi_arg_edge (phi1, i); | |
1778 | e2 = gimple_phi_arg_edge (phi2, i); | |
1779 | ||
1780 | if (!m_checker->compare_edge (e1, e2)) | |
1781 | return return_false (); | |
1782 | } | |
1783 | ||
1784 | gsi_next (&si2); | |
1785 | } | |
1786 | ||
1787 | return true; | |
1788 | } | |
1789 | ||
1790 | /* Returns true if tree T can be compared as a handled component. */ | |
1791 | ||
1792 | bool | |
1793 | sem_function::icf_handled_component_p (tree t) | |
1794 | { | |
1795 | tree_code tc = TREE_CODE (t); | |
1796 | ||
e5115cf9 EB |
1797 | return (handled_component_p (t) |
1798 | || tc == ADDR_EXPR || tc == MEM_REF || tc == OBJ_TYPE_REF); | |
b84d4347 ML |
1799 | } |
1800 | ||
1801 | /* Basic blocks dictionary BB_DICT returns true if SOURCE index BB | |
1802 | corresponds to TARGET. */ | |
1803 | ||
1804 | bool | |
1216ea72 | 1805 | sem_function::bb_dict_test (vec<int> *bb_dict, int source, int target) |
b84d4347 | 1806 | { |
c190efcc ML |
1807 | source++; |
1808 | target++; | |
1809 | ||
1216ea72 TS |
1810 | if (bb_dict->length () <= (unsigned)source) |
1811 | bb_dict->safe_grow_cleared (source + 1); | |
c190efcc | 1812 | |
1216ea72 | 1813 | if ((*bb_dict)[source] == 0) |
b84d4347 | 1814 | { |
1216ea72 | 1815 | (*bb_dict)[source] = target; |
b84d4347 ML |
1816 | return true; |
1817 | } | |
1818 | else | |
1216ea72 | 1819 | return (*bb_dict)[source] == target; |
b84d4347 ML |
1820 | } |
1821 | ||
b84d4347 ML |
1822 | sem_variable::sem_variable (bitmap_obstack *stack): sem_item (VAR, stack) |
1823 | { | |
1824 | } | |
1825 | ||
fedf2718 ML |
1826 | sem_variable::sem_variable (varpool_node *node, bitmap_obstack *stack) |
1827 | : sem_item (VAR, node, stack) | |
b84d4347 ML |
1828 | { |
1829 | gcc_checking_assert (node); | |
1830 | gcc_checking_assert (get_node ()); | |
1831 | } | |
1832 | ||
46305737 JH |
1833 | /* Fast equality function based on knowledge known in WPA. */ |
1834 | ||
1835 | bool | |
1836 | sem_variable::equals_wpa (sem_item *item, | |
1837 | hash_map <symtab_node *, sem_item *> &ignored_nodes) | |
1838 | { | |
1839 | gcc_assert (item->type == VAR); | |
1840 | ||
1841 | if (node->num_references () != item->node->num_references ()) | |
1842 | return return_false_with_msg ("different number of references"); | |
1843 | ||
1844 | if (DECL_TLS_MODEL (decl) || DECL_TLS_MODEL (item->decl)) | |
1845 | return return_false_with_msg ("TLS model"); | |
1846 | ||
b3587b99 JH |
1847 | /* DECL_ALIGN is safe to merge, because we will always chose the largest |
1848 | alignment out of all aliases. */ | |
46305737 JH |
1849 | |
1850 | if (DECL_VIRTUAL_P (decl) != DECL_VIRTUAL_P (item->decl)) | |
1851 | return return_false_with_msg ("Virtual flag mismatch"); | |
1852 | ||
1853 | if (DECL_SIZE (decl) != DECL_SIZE (item->decl) | |
1854 | && ((!DECL_SIZE (decl) || !DECL_SIZE (item->decl)) | |
1855 | || !operand_equal_p (DECL_SIZE (decl), | |
1856 | DECL_SIZE (item->decl), OEP_ONLY_CONST))) | |
1857 | return return_false_with_msg ("size mismatch"); | |
1858 | ||
1859 | /* Do not attempt to mix data from different user sections; | |
1860 | we do not know what user intends with those. */ | |
1861 | if (((DECL_SECTION_NAME (decl) && !node->implicit_section) | |
1862 | || (DECL_SECTION_NAME (item->decl) && !item->node->implicit_section)) | |
1863 | && DECL_SECTION_NAME (decl) != DECL_SECTION_NAME (item->decl)) | |
1864 | return return_false_with_msg ("user section mismatch"); | |
1865 | ||
1866 | if (DECL_IN_TEXT_SECTION (decl) != DECL_IN_TEXT_SECTION (item->decl)) | |
1867 | return return_false_with_msg ("text section"); | |
1868 | ||
1869 | ipa_ref *ref = NULL, *ref2 = NULL; | |
1870 | for (unsigned i = 0; node->iterate_reference (i, ref); i++) | |
1871 | { | |
1872 | item->node->iterate_reference (i, ref2); | |
1873 | ||
b3587b99 JH |
1874 | if (ref->use != ref2->use) |
1875 | return return_false_with_msg ("reference use mismatch"); | |
1876 | ||
977b01e3 | 1877 | if (!compare_symbol_references (ignored_nodes, |
46305737 JH |
1878 | ref->referred, ref2->referred, |
1879 | ref->address_matters_p ())) | |
1880 | return false; | |
1881 | } | |
1882 | ||
1883 | return true; | |
1884 | } | |
1885 | ||
b84d4347 | 1886 | /* Returns true if the item equals to ITEM given as argument. */ |
c4c0f336 | 1887 | |
b84d4347 ML |
1888 | bool |
1889 | sem_variable::equals (sem_item *item, | |
c4c0f336 | 1890 | hash_map <symtab_node *, sem_item *> &) |
b84d4347 ML |
1891 | { |
1892 | gcc_assert (item->type == VAR); | |
c4c0f336 | 1893 | bool ret; |
b84d4347 | 1894 | |
c4c0f336 ML |
1895 | if (DECL_INITIAL (decl) == error_mark_node && in_lto_p) |
1896 | dyn_cast <varpool_node *>(node)->get_constructor (); | |
1897 | if (DECL_INITIAL (item->decl) == error_mark_node && in_lto_p) | |
1898 | dyn_cast <varpool_node *>(item->node)->get_constructor (); | |
b84d4347 | 1899 | |
9374ef82 ML |
1900 | /* As seen in PR ipa/65303 we have to compare variables types. */ |
1901 | if (!func_checker::compatible_types_p (TREE_TYPE (decl), | |
1902 | TREE_TYPE (item->decl))) | |
1903 | return return_false_with_msg ("variables types are different"); | |
1904 | ||
c4c0f336 ML |
1905 | ret = sem_variable::equals (DECL_INITIAL (decl), |
1906 | DECL_INITIAL (item->node->decl)); | |
1907 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1908 | fprintf (dump_file, | |
464d0118 ML |
1909 | "Equals called for vars: %s:%s with result: %s\n\n", |
1910 | node->dump_name (), item->node->dump_name (), | |
1911 | ret ? "true" : "false"); | |
b84d4347 | 1912 | |
c4c0f336 | 1913 | return ret; |
b84d4347 ML |
1914 | } |
1915 | ||
1916 | /* Compares trees T1 and T2 for semantic equality. */ | |
1917 | ||
1918 | bool | |
1919 | sem_variable::equals (tree t1, tree t2) | |
1920 | { | |
46305737 JH |
1921 | if (!t1 || !t2) |
1922 | return return_with_debug (t1 == t2); | |
1923 | if (t1 == t2) | |
1924 | return true; | |
b84d4347 ML |
1925 | tree_code tc1 = TREE_CODE (t1); |
1926 | tree_code tc2 = TREE_CODE (t2); | |
1927 | ||
1928 | if (tc1 != tc2) | |
46305737 | 1929 | return return_false_with_msg ("TREE_CODE mismatch"); |
b84d4347 ML |
1930 | |
1931 | switch (tc1) | |
1932 | { | |
1933 | case CONSTRUCTOR: | |
1934 | { | |
46305737 JH |
1935 | vec<constructor_elt, va_gc> *v1, *v2; |
1936 | unsigned HOST_WIDE_INT idx; | |
b84d4347 | 1937 | |
46305737 JH |
1938 | enum tree_code typecode = TREE_CODE (TREE_TYPE (t1)); |
1939 | if (typecode != TREE_CODE (TREE_TYPE (t2))) | |
1940 | return return_false_with_msg ("constructor type mismatch"); | |
b84d4347 | 1941 | |
46305737 JH |
1942 | if (typecode == ARRAY_TYPE) |
1943 | { | |
1944 | HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1)); | |
1945 | /* For arrays, check that the sizes all match. */ | |
1946 | if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)) | |
1947 | || size_1 == -1 | |
1948 | || size_1 != int_size_in_bytes (TREE_TYPE (t2))) | |
1949 | return return_false_with_msg ("constructor array size mismatch"); | |
1950 | } | |
1951 | else if (!func_checker::compatible_types_p (TREE_TYPE (t1), | |
1952 | TREE_TYPE (t2))) | |
1953 | return return_false_with_msg ("constructor type incompatible"); | |
b84d4347 | 1954 | |
46305737 JH |
1955 | v1 = CONSTRUCTOR_ELTS (t1); |
1956 | v2 = CONSTRUCTOR_ELTS (t2); | |
1957 | if (vec_safe_length (v1) != vec_safe_length (v2)) | |
1958 | return return_false_with_msg ("constructor number of elts mismatch"); | |
1959 | ||
1960 | for (idx = 0; idx < vec_safe_length (v1); ++idx) | |
1961 | { | |
1962 | constructor_elt *c1 = &(*v1)[idx]; | |
1963 | constructor_elt *c2 = &(*v2)[idx]; | |
1964 | ||
1965 | /* Check that each value is the same... */ | |
1966 | if (!sem_variable::equals (c1->value, c2->value)) | |
1967 | return false; | |
1968 | /* ... and that they apply to the same fields! */ | |
1969 | if (!sem_variable::equals (c1->index, c2->index)) | |
1970 | return false; | |
1971 | } | |
b84d4347 ML |
1972 | return true; |
1973 | } | |
1974 | case MEM_REF: | |
1975 | { | |
1976 | tree x1 = TREE_OPERAND (t1, 0); | |
1977 | tree x2 = TREE_OPERAND (t2, 0); | |
1978 | tree y1 = TREE_OPERAND (t1, 1); | |
1979 | tree y2 = TREE_OPERAND (t2, 1); | |
1980 | ||
060cfff4 | 1981 | if (!func_checker::compatible_types_p (TREE_TYPE (x1), TREE_TYPE (x2))) |
b84d4347 ML |
1982 | return return_false (); |
1983 | ||
1984 | /* Type of the offset on MEM_REF does not matter. */ | |
46305737 JH |
1985 | return return_with_debug (sem_variable::equals (x1, x2) |
1986 | && wi::to_offset (y1) | |
1987 | == wi::to_offset (y2)); | |
b84d4347 | 1988 | } |
b84d4347 | 1989 | case ADDR_EXPR: |
46305737 | 1990 | case FDESC_EXPR: |
b84d4347 ML |
1991 | { |
1992 | tree op1 = TREE_OPERAND (t1, 0); | |
1993 | tree op2 = TREE_OPERAND (t2, 0); | |
1994 | return sem_variable::equals (op1, op2); | |
1995 | } | |
46305737 | 1996 | /* References to other vars/decls are compared using ipa-ref. */ |
b84d4347 ML |
1997 | case FUNCTION_DECL: |
1998 | case VAR_DECL: | |
46305737 JH |
1999 | if (decl_in_symtab_p (t1) && decl_in_symtab_p (t2)) |
2000 | return true; | |
2001 | return return_false_with_msg ("Declaration mismatch"); | |
2002 | case CONST_DECL: | |
2003 | /* TODO: We can check CONST_DECL by its DECL_INITIAL, but for that we | |
2004 | need to process its VAR/FUNCTION references without relying on ipa-ref | |
2005 | compare. */ | |
b84d4347 ML |
2006 | case FIELD_DECL: |
2007 | case LABEL_DECL: | |
46305737 | 2008 | return return_false_with_msg ("Declaration mismatch"); |
b84d4347 | 2009 | case INTEGER_CST: |
46305737 JH |
2010 | /* Integer constants are the same only if the same width of type. */ |
2011 | if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2))) | |
2012 | return return_false_with_msg ("INTEGER_CST precision mismatch"); | |
2013 | if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))) | |
2014 | return return_false_with_msg ("INTEGER_CST mode mismatch"); | |
2015 | return return_with_debug (tree_int_cst_equal (t1, t2)); | |
b84d4347 | 2016 | case STRING_CST: |
46305737 JH |
2017 | if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))) |
2018 | return return_false_with_msg ("STRING_CST mode mismatch"); | |
2019 | if (TREE_STRING_LENGTH (t1) != TREE_STRING_LENGTH (t2)) | |
2020 | return return_false_with_msg ("STRING_CST length mismatch"); | |
2021 | if (memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2), | |
2022 | TREE_STRING_LENGTH (t1))) | |
2023 | return return_false_with_msg ("STRING_CST mismatch"); | |
2024 | return true; | |
2025 | case FIXED_CST: | |
2026 | /* Fixed constants are the same only if the same width of type. */ | |
2027 | if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2))) | |
2028 | return return_false_with_msg ("FIXED_CST precision mismatch"); | |
2029 | ||
2030 | return return_with_debug (FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), | |
2031 | TREE_FIXED_CST (t2))); | |
b84d4347 | 2032 | case COMPLEX_CST: |
46305737 JH |
2033 | return (sem_variable::equals (TREE_REALPART (t1), TREE_REALPART (t2)) |
2034 | && sem_variable::equals (TREE_IMAGPART (t1), TREE_IMAGPART (t2))); | |
2035 | case REAL_CST: | |
2036 | /* Real constants are the same only if the same width of type. */ | |
2037 | if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2))) | |
2038 | return return_false_with_msg ("REAL_CST precision mismatch"); | |
1a25c6b1 RS |
2039 | return return_with_debug (real_identical (&TREE_REAL_CST (t1), |
2040 | &TREE_REAL_CST (t2))); | |
46305737 JH |
2041 | case VECTOR_CST: |
2042 | { | |
928686b1 RS |
2043 | if (maybe_ne (VECTOR_CST_NELTS (t1), VECTOR_CST_NELTS (t2))) |
2044 | return return_false_with_msg ("VECTOR_CST nelts mismatch"); | |
46305737 | 2045 | |
63570af0 RS |
2046 | unsigned int count |
2047 | = tree_vector_builder::binary_encoded_nelts (t1, t2); | |
2048 | for (unsigned int i = 0; i < count; ++i) | |
2049 | if (!sem_variable::equals (VECTOR_CST_ENCODED_ELT (t1, i), | |
2050 | VECTOR_CST_ENCODED_ELT (t2, i))) | |
2051 | return false; | |
46305737 | 2052 | |
63570af0 | 2053 | return true; |
46305737 | 2054 | } |
b84d4347 | 2055 | case ARRAY_REF: |
46305737 JH |
2056 | case ARRAY_RANGE_REF: |
2057 | { | |
2058 | tree x1 = TREE_OPERAND (t1, 0); | |
2059 | tree x2 = TREE_OPERAND (t2, 0); | |
2060 | tree y1 = TREE_OPERAND (t1, 1); | |
2061 | tree y2 = TREE_OPERAND (t2, 1); | |
2062 | ||
3c031cbe | 2063 | if (!sem_variable::equals (x1, x2) || !sem_variable::equals (y1, y2)) |
46305737 JH |
2064 | return false; |
2065 | if (!sem_variable::equals (array_ref_low_bound (t1), | |
2066 | array_ref_low_bound (t2))) | |
2067 | return false; | |
2068 | if (!sem_variable::equals (array_ref_element_size (t1), | |
2069 | array_ref_element_size (t2))) | |
2070 | return false; | |
2071 | return true; | |
2072 | } | |
2073 | ||
2074 | case COMPONENT_REF: | |
b84d4347 | 2075 | case POINTER_PLUS_EXPR: |
46305737 JH |
2076 | case PLUS_EXPR: |
2077 | case MINUS_EXPR: | |
2078 | case RANGE_EXPR: | |
b84d4347 ML |
2079 | { |
2080 | tree x1 = TREE_OPERAND (t1, 0); | |
2081 | tree x2 = TREE_OPERAND (t2, 0); | |
2082 | tree y1 = TREE_OPERAND (t1, 1); | |
2083 | tree y2 = TREE_OPERAND (t2, 1); | |
2084 | ||
2085 | return sem_variable::equals (x1, x2) && sem_variable::equals (y1, y2); | |
2086 | } | |
46305737 JH |
2087 | |
2088 | CASE_CONVERT: | |
2089 | case VIEW_CONVERT_EXPR: | |
060cfff4 | 2090 | if (!func_checker::compatible_types_p (TREE_TYPE (t1), TREE_TYPE (t2))) |
46305737 JH |
2091 | return return_false (); |
2092 | return sem_variable::equals (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
b84d4347 ML |
2093 | case ERROR_MARK: |
2094 | return return_false_with_msg ("ERROR_MARK"); | |
2095 | default: | |
2096 | return return_false_with_msg ("Unknown TREE code reached"); | |
2097 | } | |
2098 | } | |
2099 | ||
2100 | /* Parser function that visits a varpool NODE. */ | |
2101 | ||
2102 | sem_variable * | |
2103 | sem_variable::parse (varpool_node *node, bitmap_obstack *stack) | |
2104 | { | |
6fb12821 ML |
2105 | if (TREE_THIS_VOLATILE (node->decl) || DECL_HARD_REGISTER (node->decl) |
2106 | || node->alias) | |
b84d4347 ML |
2107 | return NULL; |
2108 | ||
fedf2718 | 2109 | sem_variable *v = new sem_variable (node, stack); |
b84d4347 ML |
2110 | |
2111 | v->init (); | |
2112 | ||
2113 | return v; | |
2114 | } | |
2115 | ||
2116 | /* References independent hash function. */ | |
2117 | ||
2118 | hashval_t | |
2119 | sem_variable::get_hash (void) | |
2120 | { | |
fedf2718 | 2121 | if (m_hash_set) |
808b6bb7 | 2122 | return m_hash; |
3ab93359 | 2123 | |
a8d93817 JH |
2124 | /* All WPA streamed in symbols should have their hashes computed at compile |
2125 | time. At this point, the constructor may not be in memory at all. | |
2126 | DECL_INITIAL (decl) would be error_mark_node in that case. */ | |
2127 | gcc_assert (!node->lto_file_data); | |
2128 | tree ctor = DECL_INITIAL (decl); | |
b84d4347 ML |
2129 | inchash::hash hstate; |
2130 | ||
2131 | hstate.add_int (456346417); | |
a8d93817 | 2132 | if (DECL_SIZE (decl) && tree_fits_shwi_p (DECL_SIZE (decl))) |
449e9a33 | 2133 | hstate.add_hwi (tree_to_shwi (DECL_SIZE (decl))); |
a8d93817 | 2134 | add_expr (ctor, hstate); |
808b6bb7 | 2135 | set_hash (hstate.end ()); |
b84d4347 | 2136 | |
808b6bb7 | 2137 | return m_hash; |
b84d4347 ML |
2138 | } |
2139 | ||
2140 | /* Merges instance with an ALIAS_ITEM, where alias, thunk or redirection can | |
2141 | be applied. */ | |
2142 | ||
2143 | bool | |
2144 | sem_variable::merge (sem_item *alias_item) | |
2145 | { | |
2146 | gcc_assert (alias_item->type == VAR); | |
2147 | ||
f657d665 ML |
2148 | if (!sem_item::target_supports_symbol_aliases_p ()) |
2149 | { | |
2150 | if (dump_file) | |
0a7246ee JH |
2151 | fprintf (dump_file, "Not unifying; " |
2152 | "Symbol aliases are not supported by target\n\n"); | |
f657d665 ML |
2153 | return false; |
2154 | } | |
2155 | ||
257291fc JH |
2156 | if (DECL_EXTERNAL (alias_item->decl)) |
2157 | { | |
2158 | if (dump_file) | |
2159 | fprintf (dump_file, "Not unifying; alias is external.\n\n"); | |
2160 | return false; | |
2161 | } | |
2162 | ||
b84d4347 ML |
2163 | sem_variable *alias_var = static_cast<sem_variable *> (alias_item); |
2164 | ||
2165 | varpool_node *original = get_node (); | |
2166 | varpool_node *alias = alias_var->get_node (); | |
2167 | bool original_discardable = false; | |
2168 | ||
0a7246ee JH |
2169 | bool alias_address_matters = alias->address_matters_p (); |
2170 | ||
b84d4347 | 2171 | /* See if original is in a section that can be discarded if the main |
0a7246ee JH |
2172 | symbol is not used. |
2173 | Also consider case where we have resolution info and we know that | |
2174 | original's definition is not going to be used. In this case we can not | |
2175 | create alias to original. */ | |
2176 | if (original->can_be_discarded_p () | |
2177 | || (node->resolution != LDPR_UNKNOWN | |
2178 | && !decl_binds_to_current_def_p (node->decl))) | |
b84d4347 ML |
2179 | original_discardable = true; |
2180 | ||
2181 | gcc_assert (!TREE_ASM_WRITTEN (alias->decl)); | |
2182 | ||
0a7246ee JH |
2183 | /* Constant pool machinery is not quite ready for aliases. |
2184 | TODO: varasm code contains logic for merging DECL_IN_CONSTANT_POOL. | |
2185 | For LTO merging does not happen that is an important missing feature. | |
2186 | We can enable merging with LTO if the DECL_IN_CONSTANT_POOL | |
2187 | flag is dropped and non-local symbol name is assigned. */ | |
2188 | if (DECL_IN_CONSTANT_POOL (alias->decl) | |
2189 | || DECL_IN_CONSTANT_POOL (original->decl)) | |
b84d4347 ML |
2190 | { |
2191 | if (dump_file) | |
0a7246ee JH |
2192 | fprintf (dump_file, |
2193 | "Not unifying; constant pool variables.\n\n"); | |
2194 | return false; | |
2195 | } | |
b84d4347 | 2196 | |
0a7246ee JH |
2197 | /* Do not attempt to mix functions from different user sections; |
2198 | we do not know what user intends with those. */ | |
2199 | if (((DECL_SECTION_NAME (original->decl) && !original->implicit_section) | |
2200 | || (DECL_SECTION_NAME (alias->decl) && !alias->implicit_section)) | |
2201 | && DECL_SECTION_NAME (original->decl) != DECL_SECTION_NAME (alias->decl)) | |
2202 | { | |
2203 | if (dump_file) | |
2204 | fprintf (dump_file, | |
2205 | "Not unifying; " | |
2206 | "original and alias are in different sections.\n\n"); | |
b84d4347 ML |
2207 | return false; |
2208 | } | |
0a7246ee JH |
2209 | |
2210 | /* We can not merge if address comparsion metters. */ | |
a13f439f | 2211 | if (alias_address_matters && flag_merge_constants < 2) |
b84d4347 | 2212 | { |
0a7246ee JH |
2213 | if (dump_file) |
2214 | fprintf (dump_file, | |
fcbc975b | 2215 | "Not unifying; address of original may be compared.\n\n"); |
0a7246ee JH |
2216 | return false; |
2217 | } | |
90a7a40b AM |
2218 | |
2219 | if (DECL_ALIGN (original->decl) < DECL_ALIGN (alias->decl)) | |
2220 | { | |
2221 | if (dump_file) | |
2222 | fprintf (dump_file, "Not unifying; " | |
2223 | "original and alias have incompatible alignments\n\n"); | |
2224 | ||
2225 | return false; | |
2226 | } | |
2227 | ||
c7a06bc1 JH |
2228 | if (DECL_COMDAT_GROUP (original->decl) != DECL_COMDAT_GROUP (alias->decl)) |
2229 | { | |
2230 | if (dump_file) | |
2231 | fprintf (dump_file, "Not unifying; alias cannot be created; " | |
2232 | "across comdat group boundary\n\n"); | |
2233 | ||
2234 | return false; | |
2235 | } | |
b84d4347 | 2236 | |
c7a06bc1 | 2237 | if (original_discardable) |
0a7246ee JH |
2238 | { |
2239 | if (dump_file) | |
2240 | fprintf (dump_file, "Not unifying; alias cannot be created; " | |
2241 | "target is discardable\n\n"); | |
b84d4347 | 2242 | |
0a7246ee JH |
2243 | return false; |
2244 | } | |
2245 | else | |
2246 | { | |
2247 | gcc_assert (!original->alias); | |
2248 | gcc_assert (!alias->alias); | |
b84d4347 ML |
2249 | |
2250 | alias->analyzed = false; | |
2251 | ||
2252 | DECL_INITIAL (alias->decl) = NULL; | |
412049de JH |
2253 | ((symtab_node *)alias)->call_for_symbol_and_aliases (clear_decl_rtl, |
2254 | NULL, true); | |
d5e254e1 | 2255 | alias->need_bounds_init = false; |
b84d4347 | 2256 | alias->remove_all_references (); |
0a7246ee JH |
2257 | if (TREE_ADDRESSABLE (alias->decl)) |
2258 | original->call_for_symbol_and_aliases (set_addressable, NULL, true); | |
b84d4347 ML |
2259 | |
2260 | varpool_node::create_alias (alias_var->decl, decl); | |
2261 | alias->resolve_alias (original); | |
2262 | ||
2263 | if (dump_file) | |
5560d026 | 2264 | fprintf (dump_file, "Unified; Variable alias has been created.\n"); |
b84d4347 ML |
2265 | |
2266 | return true; | |
2267 | } | |
2268 | } | |
2269 | ||
b84d4347 ML |
2270 | /* Dump symbol to FILE. */ |
2271 | ||
2272 | void | |
2273 | sem_variable::dump_to_file (FILE *file) | |
2274 | { | |
2275 | gcc_assert (file); | |
2276 | ||
2277 | print_node (file, "", decl, 0); | |
2278 | fprintf (file, "\n\n"); | |
2279 | } | |
2280 | ||
b84d4347 ML |
2281 | unsigned int sem_item_optimizer::class_id = 0; |
2282 | ||
fedf2718 ML |
2283 | sem_item_optimizer::sem_item_optimizer () |
2284 | : worklist (0), m_classes (0), m_classes_count (0), m_cgraph_node_hooks (NULL), | |
0dbacfcf | 2285 | m_varpool_node_hooks (NULL), m_merged_variables () |
b84d4347 ML |
2286 | { |
2287 | m_items.create (0); | |
2288 | bitmap_obstack_initialize (&m_bmstack); | |
2289 | } | |
2290 | ||
2291 | sem_item_optimizer::~sem_item_optimizer () | |
2292 | { | |
2293 | for (unsigned int i = 0; i < m_items.length (); i++) | |
2294 | delete m_items[i]; | |
2295 | ||
3746a4b2 ML |
2296 | |
2297 | for (hash_table<congruence_class_hash>::iterator it = m_classes.begin (); | |
2298 | it != m_classes.end (); ++it) | |
b84d4347 | 2299 | { |
3746a4b2 ML |
2300 | for (unsigned int i = 0; i < (*it)->classes.length (); i++) |
2301 | delete (*it)->classes[i]; | |
b84d4347 | 2302 | |
3746a4b2 ML |
2303 | (*it)->classes.release (); |
2304 | free (*it); | |
b84d4347 ML |
2305 | } |
2306 | ||
2307 | m_items.release (); | |
2308 | ||
2309 | bitmap_obstack_release (&m_bmstack); | |
0dbacfcf | 2310 | m_merged_variables.release (); |
b84d4347 ML |
2311 | } |
2312 | ||
2313 | /* Write IPA ICF summary for symbols. */ | |
2314 | ||
2315 | void | |
2316 | sem_item_optimizer::write_summary (void) | |
2317 | { | |
2318 | unsigned int count = 0; | |
2319 | ||
2320 | output_block *ob = create_output_block (LTO_section_ipa_icf); | |
2321 | lto_symtab_encoder_t encoder = ob->decl_state->symtab_node_encoder; | |
2322 | ob->symbol = NULL; | |
2323 | ||
2324 | /* Calculate number of symbols to be serialized. */ | |
2325 | for (lto_symtab_encoder_iterator lsei = lsei_start_in_partition (encoder); | |
2326 | !lsei_end_p (lsei); | |
2327 | lsei_next_in_partition (&lsei)) | |
2328 | { | |
2329 | symtab_node *node = lsei_node (lsei); | |
2330 | ||
2331 | if (m_symtab_node_map.get (node)) | |
2332 | count++; | |
2333 | } | |
2334 | ||
2335 | streamer_write_uhwi (ob, count); | |
2336 | ||
2337 | /* Process all of the symbols. */ | |
2338 | for (lto_symtab_encoder_iterator lsei = lsei_start_in_partition (encoder); | |
2339 | !lsei_end_p (lsei); | |
2340 | lsei_next_in_partition (&lsei)) | |
2341 | { | |
2342 | symtab_node *node = lsei_node (lsei); | |
2343 | ||
2344 | sem_item **item = m_symtab_node_map.get (node); | |
2345 | ||
2346 | if (item && *item) | |
2347 | { | |
2348 | int node_ref = lto_symtab_encoder_encode (encoder, node); | |
2349 | streamer_write_uhwi_stream (ob->main_stream, node_ref); | |
2350 | ||
2351 | streamer_write_uhwi (ob, (*item)->get_hash ()); | |
2352 | } | |
2353 | } | |
2354 | ||
2355 | streamer_write_char_stream (ob->main_stream, 0); | |
2356 | produce_asm (ob, NULL); | |
2357 | destroy_output_block (ob); | |
2358 | } | |
2359 | ||
2360 | /* Reads a section from LTO stream file FILE_DATA. Input block for DATA | |
2361 | contains LEN bytes. */ | |
2362 | ||
2363 | void | |
2364 | sem_item_optimizer::read_section (lto_file_decl_data *file_data, | |
2365 | const char *data, size_t len) | |
2366 | { | |
df8391b4 JJ |
2367 | const lto_function_header *header |
2368 | = (const lto_function_header *) data; | |
b84d4347 ML |
2369 | const int cfg_offset = sizeof (lto_function_header); |
2370 | const int main_offset = cfg_offset + header->cfg_size; | |
2371 | const int string_offset = main_offset + header->main_size; | |
2372 | data_in *data_in; | |
2373 | unsigned int i; | |
2374 | unsigned int count; | |
2375 | ||
2376 | lto_input_block ib_main ((const char *) data + main_offset, 0, | |
db847fa8 | 2377 | header->main_size, file_data->mode_table); |
b84d4347 | 2378 | |
df8391b4 JJ |
2379 | data_in |
2380 | = lto_data_in_create (file_data, (const char *) data + string_offset, | |
2381 | header->string_size, vNULL); | |
b84d4347 ML |
2382 | |
2383 | count = streamer_read_uhwi (&ib_main); | |
2384 | ||
2385 | for (i = 0; i < count; i++) | |
2386 | { | |
2387 | unsigned int index; | |
2388 | symtab_node *node; | |
2389 | lto_symtab_encoder_t encoder; | |
2390 | ||
2391 | index = streamer_read_uhwi (&ib_main); | |
2392 | encoder = file_data->symtab_node_encoder; | |
2393 | node = lto_symtab_encoder_deref (encoder, index); | |
2394 | ||
2395 | hashval_t hash = streamer_read_uhwi (&ib_main); | |
2396 | ||
2397 | gcc_assert (node->definition); | |
2398 | ||
2399 | if (dump_file) | |
464d0118 ML |
2400 | fprintf (dump_file, "Symbol added: %s (tree: %p)\n", |
2401 | node->dump_asm_name (), (void *) node->decl); | |
b84d4347 ML |
2402 | |
2403 | if (is_a<cgraph_node *> (node)) | |
2404 | { | |
2405 | cgraph_node *cnode = dyn_cast <cgraph_node *> (node); | |
2406 | ||
fedf2718 ML |
2407 | sem_function *fn = new sem_function (cnode, &m_bmstack); |
2408 | fn->set_hash (hash); | |
2409 | m_items.safe_push (fn); | |
b84d4347 ML |
2410 | } |
2411 | else | |
2412 | { | |
2413 | varpool_node *vnode = dyn_cast <varpool_node *> (node); | |
2414 | ||
fedf2718 ML |
2415 | sem_variable *var = new sem_variable (vnode, &m_bmstack); |
2416 | var->set_hash (hash); | |
2417 | m_items.safe_push (var); | |
b84d4347 ML |
2418 | } |
2419 | } | |
2420 | ||
2421 | lto_free_section_data (file_data, LTO_section_ipa_icf, NULL, data, | |
2422 | len); | |
2423 | lto_data_in_delete (data_in); | |
2424 | } | |
2425 | ||
026c3cfd | 2426 | /* Read IPA ICF summary for symbols. */ |
b84d4347 ML |
2427 | |
2428 | void | |
2429 | sem_item_optimizer::read_summary (void) | |
2430 | { | |
2431 | lto_file_decl_data **file_data_vec = lto_get_file_decl_data (); | |
2432 | lto_file_decl_data *file_data; | |
2433 | unsigned int j = 0; | |
2434 | ||
2435 | while ((file_data = file_data_vec[j++])) | |
2436 | { | |
2437 | size_t len; | |
2438 | const char *data = lto_get_section_data (file_data, | |
2439 | LTO_section_ipa_icf, NULL, &len); | |
2440 | ||
2441 | if (data) | |
2442 | read_section (file_data, data, len); | |
2443 | } | |
2444 | } | |
2445 | ||
2446 | /* Register callgraph and varpool hooks. */ | |
2447 | ||
2448 | void | |
2449 | sem_item_optimizer::register_hooks (void) | |
2450 | { | |
e3e968e9 ML |
2451 | if (!m_cgraph_node_hooks) |
2452 | m_cgraph_node_hooks = symtab->add_cgraph_removal_hook | |
2453 | (&sem_item_optimizer::cgraph_removal_hook, this); | |
b84d4347 | 2454 | |
e3e968e9 ML |
2455 | if (!m_varpool_node_hooks) |
2456 | m_varpool_node_hooks = symtab->add_varpool_removal_hook | |
2457 | (&sem_item_optimizer::varpool_removal_hook, this); | |
b84d4347 ML |
2458 | } |
2459 | ||
2460 | /* Unregister callgraph and varpool hooks. */ | |
2461 | ||
2462 | void | |
2463 | sem_item_optimizer::unregister_hooks (void) | |
2464 | { | |
2465 | if (m_cgraph_node_hooks) | |
2466 | symtab->remove_cgraph_removal_hook (m_cgraph_node_hooks); | |
2467 | ||
2468 | if (m_varpool_node_hooks) | |
2469 | symtab->remove_varpool_removal_hook (m_varpool_node_hooks); | |
2470 | } | |
2471 | ||
2472 | /* Adds a CLS to hashtable associated by hash value. */ | |
2473 | ||
2474 | void | |
2475 | sem_item_optimizer::add_class (congruence_class *cls) | |
2476 | { | |
2477 | gcc_assert (cls->members.length ()); | |
2478 | ||
df8391b4 JJ |
2479 | congruence_class_group *group |
2480 | = get_group_by_hash (cls->members[0]->get_hash (), | |
2481 | cls->members[0]->type); | |
b84d4347 ML |
2482 | group->classes.safe_push (cls); |
2483 | } | |
2484 | ||
2485 | /* Gets a congruence class group based on given HASH value and TYPE. */ | |
2486 | ||
2487 | congruence_class_group * | |
2488 | sem_item_optimizer::get_group_by_hash (hashval_t hash, sem_item_type type) | |
2489 | { | |
2490 | congruence_class_group *item = XNEW (congruence_class_group); | |
2491 | item->hash = hash; | |
2492 | item->type = type; | |
2493 | ||
2494 | congruence_class_group **slot = m_classes.find_slot (item, INSERT); | |
2495 | ||
2496 | if (*slot) | |
2497 | free (item); | |
2498 | else | |
2499 | { | |
2500 | item->classes.create (1); | |
2501 | *slot = item; | |
2502 | } | |
2503 | ||
2504 | return *slot; | |
2505 | } | |
2506 | ||
2507 | /* Callgraph removal hook called for a NODE with a custom DATA. */ | |
2508 | ||
2509 | void | |
2510 | sem_item_optimizer::cgraph_removal_hook (cgraph_node *node, void *data) | |
2511 | { | |
2512 | sem_item_optimizer *optimizer = (sem_item_optimizer *) data; | |
2513 | optimizer->remove_symtab_node (node); | |
2514 | } | |
2515 | ||
2516 | /* Varpool removal hook called for a NODE with a custom DATA. */ | |
2517 | ||
2518 | void | |
2519 | sem_item_optimizer::varpool_removal_hook (varpool_node *node, void *data) | |
2520 | { | |
2521 | sem_item_optimizer *optimizer = (sem_item_optimizer *) data; | |
2522 | optimizer->remove_symtab_node (node); | |
2523 | } | |
2524 | ||
2525 | /* Remove symtab NODE triggered by symtab removal hooks. */ | |
2526 | ||
2527 | void | |
2528 | sem_item_optimizer::remove_symtab_node (symtab_node *node) | |
2529 | { | |
df8391b4 | 2530 | gcc_assert (!m_classes.elements ()); |
b84d4347 ML |
2531 | |
2532 | m_removed_items_set.add (node); | |
2533 | } | |
2534 | ||
2535 | void | |
2536 | sem_item_optimizer::remove_item (sem_item *item) | |
2537 | { | |
2538 | if (m_symtab_node_map.get (item->node)) | |
2539 | m_symtab_node_map.remove (item->node); | |
2540 | delete item; | |
2541 | } | |
2542 | ||
2543 | /* Removes all callgraph and varpool nodes that are marked by symtab | |
2544 | as deleted. */ | |
2545 | ||
2546 | void | |
2547 | sem_item_optimizer::filter_removed_items (void) | |
2548 | { | |
2549 | auto_vec <sem_item *> filtered; | |
2550 | ||
2551 | for (unsigned int i = 0; i < m_items.length(); i++) | |
2552 | { | |
2553 | sem_item *item = m_items[i]; | |
2554 | ||
90190bb3 ML |
2555 | if (m_removed_items_set.contains (item->node)) |
2556 | { | |
b84d4347 ML |
2557 | remove_item (item); |
2558 | continue; | |
90190bb3 | 2559 | } |
b84d4347 ML |
2560 | |
2561 | if (item->type == FUNC) | |
90190bb3 | 2562 | { |
b84d4347 ML |
2563 | cgraph_node *cnode = static_cast <sem_function *>(item)->get_node (); |
2564 | ||
060cfff4 | 2565 | if (in_lto_p && (cnode->alias || cnode->body_removed)) |
90190bb3 ML |
2566 | remove_item (item); |
2567 | else | |
2568 | filtered.safe_push (item); | |
2569 | } | |
2570 | else /* VAR. */ | |
2571 | { | |
2572 | if (!flag_ipa_icf_variables) | |
2573 | remove_item (item); | |
2574 | else | |
c4c0f336 ML |
2575 | { |
2576 | /* Filter out non-readonly variables. */ | |
2577 | tree decl = item->decl; | |
2578 | if (TREE_READONLY (decl)) | |
2579 | filtered.safe_push (item); | |
2580 | else | |
2581 | remove_item (item); | |
2582 | } | |
90190bb3 | 2583 | } |
b84d4347 ML |
2584 | } |
2585 | ||
2586 | /* Clean-up of released semantic items. */ | |
2587 | ||
2588 | m_items.release (); | |
2589 | for (unsigned int i = 0; i < filtered.length(); i++) | |
2590 | m_items.safe_push (filtered[i]); | |
2591 | } | |
2592 | ||
bd31fe14 ML |
2593 | /* Optimizer entry point which returns true in case it processes |
2594 | a merge operation. True is returned if there's a merge operation | |
2595 | processed. */ | |
b84d4347 | 2596 | |
bd31fe14 | 2597 | bool |
b84d4347 ML |
2598 | sem_item_optimizer::execute (void) |
2599 | { | |
2600 | filter_removed_items (); | |
8b048701 JJ |
2601 | unregister_hooks (); |
2602 | ||
3ab93359 ML |
2603 | build_graph (); |
2604 | update_hash_by_addr_refs (); | |
b84d4347 ML |
2605 | build_hash_based_classes (); |
2606 | ||
2607 | if (dump_file) | |
2608 | fprintf (dump_file, "Dump after hash based groups\n"); | |
2609 | dump_cong_classes (); | |
2610 | ||
2611 | for (unsigned int i = 0; i < m_items.length(); i++) | |
2612 | m_items[i]->init_wpa (); | |
2613 | ||
b84d4347 ML |
2614 | subdivide_classes_by_equality (true); |
2615 | ||
2616 | if (dump_file) | |
2617 | fprintf (dump_file, "Dump after WPA based types groups\n"); | |
2618 | ||
2619 | dump_cong_classes (); | |
2620 | ||
2621 | process_cong_reduction (); | |
b2b29377 | 2622 | checking_verify_classes (); |
b84d4347 ML |
2623 | |
2624 | if (dump_file) | |
2625 | fprintf (dump_file, "Dump after callgraph-based congruence reduction\n"); | |
2626 | ||
2627 | dump_cong_classes (); | |
2628 | ||
2629 | parse_nonsingleton_classes (); | |
2630 | subdivide_classes_by_equality (); | |
2631 | ||
2632 | if (dump_file) | |
2633 | fprintf (dump_file, "Dump after full equality comparison of groups\n"); | |
2634 | ||
2635 | dump_cong_classes (); | |
2636 | ||
2637 | unsigned int prev_class_count = m_classes_count; | |
2638 | ||
2639 | process_cong_reduction (); | |
2640 | dump_cong_classes (); | |
b2b29377 | 2641 | checking_verify_classes (); |
bd31fe14 | 2642 | bool merged_p = merge_classes (prev_class_count); |
b84d4347 ML |
2643 | |
2644 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
6c52831d | 2645 | symtab->dump (dump_file); |
bd31fe14 ML |
2646 | |
2647 | return merged_p; | |
b84d4347 ML |
2648 | } |
2649 | ||
2650 | /* Function responsible for visiting all potential functions and | |
2651 | read-only variables that can be merged. */ | |
2652 | ||
2653 | void | |
2654 | sem_item_optimizer::parse_funcs_and_vars (void) | |
2655 | { | |
2656 | cgraph_node *cnode; | |
2657 | ||
2658 | if (flag_ipa_icf_functions) | |
2659 | FOR_EACH_DEFINED_FUNCTION (cnode) | |
2660 | { | |
2661 | sem_function *f = sem_function::parse (cnode, &m_bmstack); | |
2662 | if (f) | |
2663 | { | |
2664 | m_items.safe_push (f); | |
2665 | m_symtab_node_map.put (cnode, f); | |
2666 | ||
2667 | if (dump_file) | |
1aec2ecc | 2668 | fprintf (dump_file, "Parsed function:%s\n", f->node->asm_name ()); |
b84d4347 ML |
2669 | |
2670 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
2671 | f->dump_to_file (dump_file); | |
2672 | } | |
2673 | else if (dump_file) | |
2674 | fprintf (dump_file, "Not parsed function:%s\n", cnode->asm_name ()); | |
2675 | } | |
2676 | ||
2677 | varpool_node *vnode; | |
2678 | ||
2679 | if (flag_ipa_icf_variables) | |
2680 | FOR_EACH_DEFINED_VARIABLE (vnode) | |
2681 | { | |
2682 | sem_variable *v = sem_variable::parse (vnode, &m_bmstack); | |
2683 | ||
2684 | if (v) | |
2685 | { | |
2686 | m_items.safe_push (v); | |
2687 | m_symtab_node_map.put (vnode, v); | |
2688 | } | |
2689 | } | |
2690 | } | |
2691 | ||
2692 | /* Makes pairing between a congruence class CLS and semantic ITEM. */ | |
2693 | ||
2694 | void | |
2695 | sem_item_optimizer::add_item_to_class (congruence_class *cls, sem_item *item) | |
2696 | { | |
2697 | item->index_in_class = cls->members.length (); | |
2698 | cls->members.safe_push (item); | |
2699 | item->cls = cls; | |
2700 | } | |
2701 | ||
3ab93359 ML |
2702 | /* For each semantic item, append hash values of references. */ |
2703 | ||
2704 | void | |
2705 | sem_item_optimizer::update_hash_by_addr_refs () | |
2706 | { | |
69f6b1f4 JH |
2707 | /* First, append to hash sensitive references and class type if it need to |
2708 | be matched for ODR. */ | |
3ab93359 | 2709 | for (unsigned i = 0; i < m_items.length (); i++) |
69f6b1f4 JH |
2710 | { |
2711 | m_items[i]->update_hash_by_addr_refs (m_symtab_node_map); | |
2712 | if (m_items[i]->type == FUNC) | |
2713 | { | |
2714 | if (TREE_CODE (TREE_TYPE (m_items[i]->decl)) == METHOD_TYPE | |
2715 | && contains_polymorphic_type_p | |
70e7f2a2 | 2716 | (TYPE_METHOD_BASETYPE (TREE_TYPE (m_items[i]->decl))) |
69f6b1f4 | 2717 | && (DECL_CXX_CONSTRUCTOR_P (m_items[i]->decl) |
b3587b99 | 2718 | || (static_cast<sem_function *> (m_items[i])->param_used_p (0) |
69f6b1f4 JH |
2719 | && static_cast<sem_function *> (m_items[i]) |
2720 | ->compare_polymorphic_p ()))) | |
2721 | { | |
2722 | tree class_type | |
70e7f2a2 | 2723 | = TYPE_METHOD_BASETYPE (TREE_TYPE (m_items[i]->decl)); |
808b6bb7 | 2724 | inchash::hash hstate (m_items[i]->get_hash ()); |
69f6b1f4 JH |
2725 | |
2726 | if (TYPE_NAME (class_type) | |
2727 | && DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (class_type))) | |
449e9a33 | 2728 | hstate.add_hwi |
69f6b1f4 JH |
2729 | (IDENTIFIER_HASH_VALUE |
2730 | (DECL_ASSEMBLER_NAME (TYPE_NAME (class_type)))); | |
2731 | ||
808b6bb7 | 2732 | m_items[i]->set_hash (hstate.end ()); |
69f6b1f4 JH |
2733 | } |
2734 | } | |
2735 | } | |
3ab93359 ML |
2736 | |
2737 | /* Once all symbols have enhanced hash value, we can append | |
2738 | hash values of symbols that are seen by IPA ICF and are | |
2739 | references by a semantic item. Newly computed values | |
2740 | are saved to global_hash member variable. */ | |
2741 | for (unsigned i = 0; i < m_items.length (); i++) | |
2742 | m_items[i]->update_hash_by_local_refs (m_symtab_node_map); | |
2743 | ||
2744 | /* Global hash value replace current hash values. */ | |
2745 | for (unsigned i = 0; i < m_items.length (); i++) | |
808b6bb7 | 2746 | m_items[i]->set_hash (m_items[i]->global_hash); |
3ab93359 ML |
2747 | } |
2748 | ||
b84d4347 ML |
2749 | /* Congruence classes are built by hash value. */ |
2750 | ||
2751 | void | |
2752 | sem_item_optimizer::build_hash_based_classes (void) | |
2753 | { | |
2754 | for (unsigned i = 0; i < m_items.length (); i++) | |
2755 | { | |
2756 | sem_item *item = m_items[i]; | |
2757 | ||
df8391b4 JJ |
2758 | congruence_class_group *group |
2759 | = get_group_by_hash (item->get_hash (), item->type); | |
b84d4347 ML |
2760 | |
2761 | if (!group->classes.length ()) | |
2762 | { | |
2763 | m_classes_count++; | |
2764 | group->classes.safe_push (new congruence_class (class_id++)); | |
2765 | } | |
2766 | ||
2767 | add_item_to_class (group->classes[0], item); | |
2768 | } | |
2769 | } | |
2770 | ||
2771 | /* Build references according to call graph. */ | |
2772 | ||
2773 | void | |
2774 | sem_item_optimizer::build_graph (void) | |
2775 | { | |
2776 | for (unsigned i = 0; i < m_items.length (); i++) | |
2777 | { | |
2778 | sem_item *item = m_items[i]; | |
2779 | m_symtab_node_map.put (item->node, item); | |
808b6bb7 ML |
2780 | |
2781 | /* Initialize hash values if we are not in LTO mode. */ | |
2782 | if (!in_lto_p) | |
2783 | item->get_hash (); | |
b84d4347 ML |
2784 | } |
2785 | ||
2786 | for (unsigned i = 0; i < m_items.length (); i++) | |
2787 | { | |
2788 | sem_item *item = m_items[i]; | |
2789 | ||
2790 | if (item->type == FUNC) | |
2791 | { | |
2792 | cgraph_node *cnode = dyn_cast <cgraph_node *> (item->node); | |
2793 | ||
2794 | cgraph_edge *e = cnode->callees; | |
2795 | while (e) | |
2796 | { | |
b6cddc7f ML |
2797 | sem_item **slot = m_symtab_node_map.get |
2798 | (e->callee->ultimate_alias_target ()); | |
b84d4347 ML |
2799 | if (slot) |
2800 | item->add_reference (*slot); | |
2801 | ||
2802 | e = e->next_callee; | |
2803 | } | |
2804 | } | |
2805 | ||
2806 | ipa_ref *ref = NULL; | |
2807 | for (unsigned i = 0; item->node->iterate_reference (i, ref); i++) | |
2808 | { | |
b6cddc7f ML |
2809 | sem_item **slot = m_symtab_node_map.get |
2810 | (ref->referred->ultimate_alias_target ()); | |
b84d4347 ML |
2811 | if (slot) |
2812 | item->add_reference (*slot); | |
2813 | } | |
2814 | } | |
2815 | } | |
2816 | ||
2817 | /* Semantic items in classes having more than one element and initialized. | |
2818 | In case of WPA, we load function body. */ | |
2819 | ||
2820 | void | |
2821 | sem_item_optimizer::parse_nonsingleton_classes (void) | |
2822 | { | |
2823 | unsigned int init_called_count = 0; | |
2824 | ||
2825 | for (unsigned i = 0; i < m_items.length (); i++) | |
2826 | if (m_items[i]->cls->members.length () > 1) | |
2827 | { | |
2828 | m_items[i]->init (); | |
2829 | init_called_count++; | |
2830 | } | |
2831 | ||
2832 | if (dump_file) | |
df8391b4 JJ |
2833 | fprintf (dump_file, "Init called for %u items (%.2f%%).\n", |
2834 | init_called_count, | |
2835 | m_items.length () ? 100.0f * init_called_count / m_items.length () | |
2836 | : 0.0f); | |
b84d4347 ML |
2837 | } |
2838 | ||
2839 | /* Equality function for semantic items is used to subdivide existing | |
2840 | classes. If IN_WPA, fast equality function is invoked. */ | |
2841 | ||
2842 | void | |
2843 | sem_item_optimizer::subdivide_classes_by_equality (bool in_wpa) | |
2844 | { | |
3746a4b2 ML |
2845 | for (hash_table <congruence_class_hash>::iterator it = m_classes.begin (); |
2846 | it != m_classes.end (); ++it) | |
b84d4347 | 2847 | { |
3746a4b2 | 2848 | unsigned int class_count = (*it)->classes.length (); |
b84d4347 ML |
2849 | |
2850 | for (unsigned i = 0; i < class_count; i++) | |
2851 | { | |
3746a4b2 | 2852 | congruence_class *c = (*it)->classes[i]; |
b84d4347 ML |
2853 | |
2854 | if (c->members.length() > 1) | |
2855 | { | |
2856 | auto_vec <sem_item *> new_vector; | |
2857 | ||
2858 | sem_item *first = c->members[0]; | |
2859 | new_vector.safe_push (first); | |
2860 | ||
3746a4b2 | 2861 | unsigned class_split_first = (*it)->classes.length (); |
b84d4347 ML |
2862 | |
2863 | for (unsigned j = 1; j < c->members.length (); j++) | |
2864 | { | |
2865 | sem_item *item = c->members[j]; | |
2866 | ||
df8391b4 JJ |
2867 | bool equals |
2868 | = in_wpa ? first->equals_wpa (item, m_symtab_node_map) | |
2869 | : first->equals (item, m_symtab_node_map); | |
b84d4347 ML |
2870 | |
2871 | if (equals) | |
2872 | new_vector.safe_push (item); | |
2873 | else | |
2874 | { | |
2875 | bool integrated = false; | |
2876 | ||
df8391b4 | 2877 | for (unsigned k = class_split_first; |
3746a4b2 | 2878 | k < (*it)->classes.length (); k++) |
b84d4347 | 2879 | { |
3746a4b2 | 2880 | sem_item *x = (*it)->classes[k]->members[0]; |
df8391b4 JJ |
2881 | bool equals |
2882 | = in_wpa ? x->equals_wpa (item, m_symtab_node_map) | |
2883 | : x->equals (item, m_symtab_node_map); | |
b84d4347 ML |
2884 | |
2885 | if (equals) | |
2886 | { | |
2887 | integrated = true; | |
3746a4b2 | 2888 | add_item_to_class ((*it)->classes[k], item); |
b84d4347 ML |
2889 | |
2890 | break; | |
2891 | } | |
2892 | } | |
2893 | ||
2894 | if (!integrated) | |
2895 | { | |
df8391b4 JJ |
2896 | congruence_class *c |
2897 | = new congruence_class (class_id++); | |
b84d4347 ML |
2898 | m_classes_count++; |
2899 | add_item_to_class (c, item); | |
2900 | ||
3746a4b2 | 2901 | (*it)->classes.safe_push (c); |
b84d4347 ML |
2902 | } |
2903 | } | |
2904 | } | |
2905 | ||
df8391b4 JJ |
2906 | // We replace newly created new_vector for the class we've just |
2907 | // splitted. | |
b84d4347 ML |
2908 | c->members.release (); |
2909 | c->members.create (new_vector.length ()); | |
2910 | ||
2911 | for (unsigned int j = 0; j < new_vector.length (); j++) | |
2912 | add_item_to_class (c, new_vector[j]); | |
2913 | } | |
2914 | } | |
2915 | } | |
2916 | ||
b2b29377 | 2917 | checking_verify_classes (); |
b84d4347 ML |
2918 | } |
2919 | ||
5ebd0e61 ML |
2920 | /* Subdivide classes by address references that members of the class |
2921 | reference. Example can be a pair of functions that have an address | |
2922 | taken from a function. If these addresses are different the class | |
2923 | is split. */ | |
2924 | ||
2925 | unsigned | |
2926 | sem_item_optimizer::subdivide_classes_by_sensitive_refs () | |
2927 | { | |
fb5c464a | 2928 | typedef hash_map <symbol_compare_hash, vec <sem_item *> > subdivide_hash_map; |
bbd08a5d | 2929 | |
5ebd0e61 ML |
2930 | unsigned newly_created_classes = 0; |
2931 | ||
3746a4b2 ML |
2932 | for (hash_table <congruence_class_hash>::iterator it = m_classes.begin (); |
2933 | it != m_classes.end (); ++it) | |
5ebd0e61 | 2934 | { |
3746a4b2 | 2935 | unsigned int class_count = (*it)->classes.length (); |
5ebd0e61 ML |
2936 | auto_vec<congruence_class *> new_classes; |
2937 | ||
2938 | for (unsigned i = 0; i < class_count; i++) | |
2939 | { | |
3746a4b2 | 2940 | congruence_class *c = (*it)->classes[i]; |
5ebd0e61 ML |
2941 | |
2942 | if (c->members.length() > 1) | |
2943 | { | |
bbd08a5d | 2944 | subdivide_hash_map split_map; |
5ebd0e61 ML |
2945 | |
2946 | for (unsigned j = 0; j < c->members.length (); j++) | |
2947 | { | |
2948 | sem_item *source_node = c->members[j]; | |
2949 | ||
df8391b4 JJ |
2950 | symbol_compare_collection *collection |
2951 | = new symbol_compare_collection (source_node->node); | |
5ebd0e61 | 2952 | |
bbd08a5d | 2953 | bool existed; |
df8391b4 JJ |
2954 | vec <sem_item *> *slot |
2955 | = &split_map.get_or_insert (collection, &existed); | |
5ebd0e61 ML |
2956 | gcc_checking_assert (slot); |
2957 | ||
2958 | slot->safe_push (source_node); | |
bbd08a5d ML |
2959 | |
2960 | if (existed) | |
2961 | delete collection; | |
5ebd0e61 ML |
2962 | } |
2963 | ||
df8391b4 JJ |
2964 | /* If the map contains more than one key, we have to split |
2965 | the map appropriately. */ | |
5ebd0e61 ML |
2966 | if (split_map.elements () != 1) |
2967 | { | |
2968 | bool first_class = true; | |
2969 | ||
bbd08a5d ML |
2970 | for (subdivide_hash_map::iterator it2 = split_map.begin (); |
2971 | it2 != split_map.end (); ++it2) | |
5ebd0e61 ML |
2972 | { |
2973 | congruence_class *new_cls; | |
2974 | new_cls = new congruence_class (class_id++); | |
2975 | ||
2976 | for (unsigned k = 0; k < (*it2).second.length (); k++) | |
2977 | add_item_to_class (new_cls, (*it2).second[k]); | |
2978 | ||
2979 | worklist_push (new_cls); | |
2980 | newly_created_classes++; | |
2981 | ||
2982 | if (first_class) | |
2983 | { | |
3746a4b2 | 2984 | (*it)->classes[i] = new_cls; |
5ebd0e61 ML |
2985 | first_class = false; |
2986 | } | |
2987 | else | |
2988 | { | |
2989 | new_classes.safe_push (new_cls); | |
2990 | m_classes_count++; | |
2991 | } | |
2992 | } | |
2993 | } | |
bbd08a5d ML |
2994 | |
2995 | /* Release memory. */ | |
2996 | for (subdivide_hash_map::iterator it2 = split_map.begin (); | |
2997 | it2 != split_map.end (); ++it2) | |
2998 | { | |
2999 | delete (*it2).first; | |
3000 | (*it2).second.release (); | |
3001 | } | |
5ebd0e61 ML |
3002 | } |
3003 | } | |
3004 | ||
3005 | for (unsigned i = 0; i < new_classes.length (); i++) | |
3746a4b2 | 3006 | (*it)->classes.safe_push (new_classes[i]); |
5ebd0e61 ML |
3007 | } |
3008 | ||
3009 | return newly_created_classes; | |
3010 | } | |
3011 | ||
b2b29377 MM |
3012 | /* Verify congruence classes, if checking is enabled. */ |
3013 | ||
3014 | void | |
3015 | sem_item_optimizer::checking_verify_classes (void) | |
3016 | { | |
3017 | if (flag_checking) | |
3018 | verify_classes (); | |
3019 | } | |
3020 | ||
3021 | /* Verify congruence classes. */ | |
b84d4347 ML |
3022 | |
3023 | void | |
3024 | sem_item_optimizer::verify_classes (void) | |
3025 | { | |
3746a4b2 ML |
3026 | for (hash_table<congruence_class_hash>::iterator it = m_classes.begin (); |
3027 | it != m_classes.end (); ++it) | |
b84d4347 | 3028 | { |
3746a4b2 | 3029 | for (unsigned int i = 0; i < (*it)->classes.length (); i++) |
b84d4347 | 3030 | { |
3746a4b2 | 3031 | congruence_class *cls = (*it)->classes[i]; |
b84d4347 | 3032 | |
b2b29377 MM |
3033 | gcc_assert (cls); |
3034 | gcc_assert (cls->members.length () > 0); | |
b84d4347 ML |
3035 | |
3036 | for (unsigned int j = 0; j < cls->members.length (); j++) | |
3037 | { | |
3038 | sem_item *item = cls->members[j]; | |
3039 | ||
b2b29377 MM |
3040 | gcc_assert (item); |
3041 | gcc_assert (item->cls == cls); | |
b84d4347 ML |
3042 | |
3043 | for (unsigned k = 0; k < item->usages.length (); k++) | |
3044 | { | |
3045 | sem_usage_pair *usage = item->usages[k]; | |
df8391b4 JJ |
3046 | gcc_assert (usage->item->index_in_class |
3047 | < usage->item->cls->members.length ()); | |
b84d4347 ML |
3048 | } |
3049 | } | |
3050 | } | |
3051 | } | |
b84d4347 ML |
3052 | } |
3053 | ||
3054 | /* Disposes split map traverse function. CLS_PTR is pointer to congruence | |
3055 | class, BSLOT is bitmap slot we want to release. DATA is mandatory, | |
3056 | but unused argument. */ | |
3057 | ||
3058 | bool | |
3059 | sem_item_optimizer::release_split_map (congruence_class * const &, | |
3060 | bitmap const &b, traverse_split_pair *) | |
3061 | { | |
3062 | bitmap bmp = b; | |
3063 | ||
3064 | BITMAP_FREE (bmp); | |
3065 | ||
3066 | return true; | |
3067 | } | |
3068 | ||
3069 | /* Process split operation for a class given as pointer CLS_PTR, | |
3070 | where bitmap B splits congruence class members. DATA is used | |
3071 | as argument of split pair. */ | |
3072 | ||
3073 | bool | |
3074 | sem_item_optimizer::traverse_congruence_split (congruence_class * const &cls, | |
df8391b4 JJ |
3075 | bitmap const &b, |
3076 | traverse_split_pair *pair) | |
b84d4347 ML |
3077 | { |
3078 | sem_item_optimizer *optimizer = pair->optimizer; | |
3079 | const congruence_class *splitter_cls = pair->cls; | |
3080 | ||
3081 | /* If counted bits are greater than zero and less than the number of members | |
3082 | a group will be splitted. */ | |
3083 | unsigned popcount = bitmap_count_bits (b); | |
3084 | ||
3085 | if (popcount > 0 && popcount < cls->members.length ()) | |
3086 | { | |
c9ab724f ML |
3087 | auto_vec <congruence_class *, 2> newclasses; |
3088 | newclasses.quick_push (new congruence_class (class_id++)); | |
3089 | newclasses.quick_push (new congruence_class (class_id++)); | |
b84d4347 ML |
3090 | |
3091 | for (unsigned int i = 0; i < cls->members.length (); i++) | |
3092 | { | |
3093 | int target = bitmap_bit_p (b, i); | |
3094 | congruence_class *tc = newclasses[target]; | |
3095 | ||
3096 | add_item_to_class (tc, cls->members[i]); | |
3097 | } | |
3098 | ||
b2b29377 MM |
3099 | if (flag_checking) |
3100 | { | |
3101 | for (unsigned int i = 0; i < 2; i++) | |
3102 | gcc_assert (newclasses[i]->members.length ()); | |
3103 | } | |
b84d4347 ML |
3104 | |
3105 | if (splitter_cls == cls) | |
3106 | optimizer->splitter_class_removed = true; | |
3107 | ||
3108 | /* Remove old class from worklist if presented. */ | |
3109 | bool in_worklist = cls->in_worklist; | |
3110 | ||
3111 | if (in_worklist) | |
3112 | cls->in_worklist = false; | |
3113 | ||
3114 | congruence_class_group g; | |
3115 | g.hash = cls->members[0]->get_hash (); | |
3116 | g.type = cls->members[0]->type; | |
3117 | ||
df8391b4 | 3118 | congruence_class_group *slot = optimizer->m_classes.find (&g); |
b84d4347 ML |
3119 | |
3120 | for (unsigned int i = 0; i < slot->classes.length (); i++) | |
3121 | if (slot->classes[i] == cls) | |
3122 | { | |
3123 | slot->classes.ordered_remove (i); | |
3124 | break; | |
3125 | } | |
3126 | ||
3127 | /* New class will be inserted and integrated to work list. */ | |
3128 | for (unsigned int i = 0; i < 2; i++) | |
3129 | optimizer->add_class (newclasses[i]); | |
3130 | ||
3131 | /* Two classes replace one, so that increment just by one. */ | |
3132 | optimizer->m_classes_count++; | |
3133 | ||
3134 | /* If OLD class was presented in the worklist, we remove the class | |
3135 | and replace it will both newly created classes. */ | |
3136 | if (in_worklist) | |
3137 | for (unsigned int i = 0; i < 2; i++) | |
3138 | optimizer->worklist_push (newclasses[i]); | |
3139 | else /* Just smaller class is inserted. */ | |
3140 | { | |
df8391b4 JJ |
3141 | unsigned int smaller_index |
3142 | = (newclasses[0]->members.length () | |
3143 | < newclasses[1]->members.length () | |
3144 | ? 0 : 1); | |
b84d4347 ML |
3145 | optimizer->worklist_push (newclasses[smaller_index]); |
3146 | } | |
3147 | ||
3148 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
3149 | { | |
3150 | fprintf (dump_file, " congruence class splitted:\n"); | |
3151 | cls->dump (dump_file, 4); | |
3152 | ||
3153 | fprintf (dump_file, " newly created groups:\n"); | |
3154 | for (unsigned int i = 0; i < 2; i++) | |
3155 | newclasses[i]->dump (dump_file, 4); | |
3156 | } | |
3157 | ||
3158 | /* Release class if not presented in work list. */ | |
3159 | if (!in_worklist) | |
3160 | delete cls; | |
3161 | } | |
3162 | ||
3163 | ||
3164 | return true; | |
3165 | } | |
3166 | ||
3167 | /* Tests if a class CLS used as INDEXth splits any congruence classes. | |
3168 | Bitmap stack BMSTACK is used for bitmap allocation. */ | |
3169 | ||
3170 | void | |
3171 | sem_item_optimizer::do_congruence_step_for_index (congruence_class *cls, | |
df8391b4 | 3172 | unsigned int index) |
b84d4347 ML |
3173 | { |
3174 | hash_map <congruence_class *, bitmap> split_map; | |
3175 | ||
3176 | for (unsigned int i = 0; i < cls->members.length (); i++) | |
3177 | { | |
3178 | sem_item *item = cls->members[i]; | |
3179 | ||
3180 | /* Iterate all usages that have INDEX as usage of the item. */ | |
3181 | for (unsigned int j = 0; j < item->usages.length (); j++) | |
3182 | { | |
3183 | sem_usage_pair *usage = item->usages[j]; | |
3184 | ||
3185 | if (usage->index != index) | |
3186 | continue; | |
3187 | ||
3188 | bitmap *slot = split_map.get (usage->item->cls); | |
3189 | bitmap b; | |
3190 | ||
3191 | if(!slot) | |
3192 | { | |
3193 | b = BITMAP_ALLOC (&m_bmstack); | |
3194 | split_map.put (usage->item->cls, b); | |
3195 | } | |
3196 | else | |
3197 | b = *slot; | |
3198 | ||
b84d4347 | 3199 | gcc_checking_assert (usage->item->cls); |
df8391b4 JJ |
3200 | gcc_checking_assert (usage->item->index_in_class |
3201 | < usage->item->cls->members.length ()); | |
b84d4347 ML |
3202 | |
3203 | bitmap_set_bit (b, usage->item->index_in_class); | |
3204 | } | |
3205 | } | |
3206 | ||
3207 | traverse_split_pair pair; | |
3208 | pair.optimizer = this; | |
3209 | pair.cls = cls; | |
3210 | ||
3211 | splitter_class_removed = false; | |
df8391b4 JJ |
3212 | split_map.traverse <traverse_split_pair *, |
3213 | sem_item_optimizer::traverse_congruence_split> (&pair); | |
b84d4347 ML |
3214 | |
3215 | /* Bitmap clean-up. */ | |
df8391b4 JJ |
3216 | split_map.traverse <traverse_split_pair *, |
3217 | sem_item_optimizer::release_split_map> (NULL); | |
b84d4347 ML |
3218 | } |
3219 | ||
3220 | /* Every usage of a congruence class CLS is a candidate that can split the | |
3221 | collection of classes. Bitmap stack BMSTACK is used for bitmap | |
3222 | allocation. */ | |
3223 | ||
3224 | void | |
3225 | sem_item_optimizer::do_congruence_step (congruence_class *cls) | |
3226 | { | |
3227 | bitmap_iterator bi; | |
3228 | unsigned int i; | |
3229 | ||
3230 | bitmap usage = BITMAP_ALLOC (&m_bmstack); | |
3231 | ||
3232 | for (unsigned int i = 0; i < cls->members.length (); i++) | |
3233 | bitmap_ior_into (usage, cls->members[i]->usage_index_bitmap); | |
3234 | ||
3235 | EXECUTE_IF_SET_IN_BITMAP (usage, 0, i, bi) | |
3236 | { | |
3237 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
df8391b4 JJ |
3238 | fprintf (dump_file, " processing congruence step for class: %u, " |
3239 | "index: %u\n", cls->id, i); | |
b84d4347 ML |
3240 | |
3241 | do_congruence_step_for_index (cls, i); | |
3242 | ||
3243 | if (splitter_class_removed) | |
3244 | break; | |
3245 | } | |
3246 | ||
3247 | BITMAP_FREE (usage); | |
3248 | } | |
3249 | ||
3250 | /* Adds a newly created congruence class CLS to worklist. */ | |
3251 | ||
3252 | void | |
3253 | sem_item_optimizer::worklist_push (congruence_class *cls) | |
3254 | { | |
3255 | /* Return if the class CLS is already presented in work list. */ | |
3256 | if (cls->in_worklist) | |
3257 | return; | |
3258 | ||
3259 | cls->in_worklist = true; | |
3260 | worklist.push_back (cls); | |
3261 | } | |
3262 | ||
3263 | /* Pops a class from worklist. */ | |
3264 | ||
3265 | congruence_class * | |
3266 | sem_item_optimizer::worklist_pop (void) | |
3267 | { | |
3268 | congruence_class *cls; | |
3269 | ||
3270 | while (!worklist.empty ()) | |
3271 | { | |
3272 | cls = worklist.front (); | |
3273 | worklist.pop_front (); | |
3274 | if (cls->in_worklist) | |
3275 | { | |
3276 | cls->in_worklist = false; | |
3277 | ||
3278 | return cls; | |
3279 | } | |
3280 | else | |
3281 | { | |
3282 | /* Work list item was already intended to be removed. | |
3283 | The only reason for doing it is to split a class. | |
3284 | Thus, the class CLS is deleted. */ | |
3285 | delete cls; | |
3286 | } | |
3287 | } | |
3288 | ||
3289 | return NULL; | |
3290 | } | |
3291 | ||
3292 | /* Iterative congruence reduction function. */ | |
3293 | ||
3294 | void | |
3295 | sem_item_optimizer::process_cong_reduction (void) | |
3296 | { | |
3746a4b2 ML |
3297 | for (hash_table<congruence_class_hash>::iterator it = m_classes.begin (); |
3298 | it != m_classes.end (); ++it) | |
3299 | for (unsigned i = 0; i < (*it)->classes.length (); i++) | |
3300 | if ((*it)->classes[i]->is_class_used ()) | |
3301 | worklist_push ((*it)->classes[i]); | |
b84d4347 ML |
3302 | |
3303 | if (dump_file) | |
3304 | fprintf (dump_file, "Worklist has been filled with: %lu\n", | |
10568163 | 3305 | (unsigned long) worklist.size ()); |
b84d4347 ML |
3306 | |
3307 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
3308 | fprintf (dump_file, "Congruence class reduction\n"); | |
3309 | ||
3310 | congruence_class *cls; | |
5ebd0e61 ML |
3311 | |
3312 | /* Process complete congruence reduction. */ | |
b84d4347 ML |
3313 | while ((cls = worklist_pop ()) != NULL) |
3314 | do_congruence_step (cls); | |
5ebd0e61 ML |
3315 | |
3316 | /* Subdivide newly created classes according to references. */ | |
3317 | unsigned new_classes = subdivide_classes_by_sensitive_refs (); | |
3318 | ||
3319 | if (dump_file) | |
3320 | fprintf (dump_file, "Address reference subdivision created: %u " | |
3321 | "new classes.\n", new_classes); | |
b84d4347 ML |
3322 | } |
3323 | ||
3324 | /* Debug function prints all informations about congruence classes. */ | |
3325 | ||
3326 | void | |
3327 | sem_item_optimizer::dump_cong_classes (void) | |
3328 | { | |
3329 | if (!dump_file) | |
3330 | return; | |
3331 | ||
3332 | fprintf (dump_file, | |
df8391b4 JJ |
3333 | "Congruence classes: %u (unique hash values: %lu), with total: " |
3334 | "%u items\n", m_classes_count, | |
3335 | (unsigned long) m_classes.elements (), m_items.length ()); | |
b84d4347 ML |
3336 | |
3337 | /* Histogram calculation. */ | |
3338 | unsigned int max_index = 0; | |
3339 | unsigned int* histogram = XCNEWVEC (unsigned int, m_items.length () + 1); | |
3340 | ||
3746a4b2 ML |
3341 | for (hash_table<congruence_class_hash>::iterator it = m_classes.begin (); |
3342 | it != m_classes.end (); ++it) | |
3343 | for (unsigned i = 0; i < (*it)->classes.length (); i++) | |
b84d4347 | 3344 | { |
3746a4b2 | 3345 | unsigned int c = (*it)->classes[i]->members.length (); |
b84d4347 ML |
3346 | histogram[c]++; |
3347 | ||
3348 | if (c > max_index) | |
3349 | max_index = c; | |
3350 | } | |
3351 | ||
3352 | fprintf (dump_file, | |
df8391b4 JJ |
3353 | "Class size histogram [num of members]: number of classe number " |
3354 | "of classess\n"); | |
b84d4347 ML |
3355 | |
3356 | for (unsigned int i = 0; i <= max_index; i++) | |
3357 | if (histogram[i]) | |
3358 | fprintf (dump_file, "[%u]: %u classes\n", i, histogram[i]); | |
3359 | ||
3360 | fprintf (dump_file, "\n\n"); | |
3361 | ||
b84d4347 | 3362 | if (dump_flags & TDF_DETAILS) |
3746a4b2 ML |
3363 | for (hash_table<congruence_class_hash>::iterator it = m_classes.begin (); |
3364 | it != m_classes.end (); ++it) | |
b84d4347 | 3365 | { |
df8391b4 | 3366 | fprintf (dump_file, " group: with %u classes:\n", |
3746a4b2 | 3367 | (*it)->classes.length ()); |
b84d4347 | 3368 | |
3746a4b2 | 3369 | for (unsigned i = 0; i < (*it)->classes.length (); i++) |
b84d4347 | 3370 | { |
3746a4b2 | 3371 | (*it)->classes[i]->dump (dump_file, 4); |
b84d4347 | 3372 | |
3746a4b2 | 3373 | if (i < (*it)->classes.length () - 1) |
b84d4347 ML |
3374 | fprintf (dump_file, " "); |
3375 | } | |
3376 | } | |
3377 | ||
3378 | free (histogram); | |
3379 | } | |
3380 | ||
a0843aed ML |
3381 | /* Sort pair of sem_items A and B by DECL_UID. */ |
3382 | ||
3383 | static int | |
3384 | sort_sem_items_by_decl_uid (const void *a, const void *b) | |
3385 | { | |
3386 | const sem_item *i1 = *(const sem_item * const *)a; | |
3387 | const sem_item *i2 = *(const sem_item * const *)b; | |
3388 | ||
3389 | int uid1 = DECL_UID (i1->decl); | |
3390 | int uid2 = DECL_UID (i2->decl); | |
3391 | ||
3392 | if (uid1 < uid2) | |
3393 | return -1; | |
3394 | else if (uid1 > uid2) | |
3395 | return 1; | |
3396 | else | |
3397 | return 0; | |
3398 | } | |
3399 | ||
3400 | /* Sort pair of congruence_classes A and B by DECL_UID of the first member. */ | |
3401 | ||
3402 | static int | |
3403 | sort_congruence_classes_by_decl_uid (const void *a, const void *b) | |
3404 | { | |
3405 | const congruence_class *c1 = *(const congruence_class * const *)a; | |
3406 | const congruence_class *c2 = *(const congruence_class * const *)b; | |
3407 | ||
3408 | int uid1 = DECL_UID (c1->members[0]->decl); | |
3409 | int uid2 = DECL_UID (c2->members[0]->decl); | |
3410 | ||
3411 | if (uid1 < uid2) | |
3412 | return -1; | |
3413 | else if (uid1 > uid2) | |
3414 | return 1; | |
3415 | else | |
3416 | return 0; | |
3417 | } | |
3418 | ||
3419 | /* Sort pair of congruence_class_groups A and B by | |
3420 | DECL_UID of the first member of a first group. */ | |
3421 | ||
3422 | static int | |
3423 | sort_congruence_class_groups_by_decl_uid (const void *a, const void *b) | |
3424 | { | |
3425 | const congruence_class_group *g1 | |
3426 | = *(const congruence_class_group * const *)a; | |
3427 | const congruence_class_group *g2 | |
3428 | = *(const congruence_class_group * const *)b; | |
3429 | ||
3430 | int uid1 = DECL_UID (g1->classes[0]->members[0]->decl); | |
3431 | int uid2 = DECL_UID (g2->classes[0]->members[0]->decl); | |
3432 | ||
3433 | if (uid1 < uid2) | |
3434 | return -1; | |
3435 | else if (uid1 > uid2) | |
3436 | return 1; | |
3437 | else | |
3438 | return 0; | |
3439 | } | |
3440 | ||
b84d4347 ML |
3441 | /* After reduction is done, we can declare all items in a group |
3442 | to be equal. PREV_CLASS_COUNT is start number of classes | |
bd31fe14 ML |
3443 | before reduction. True is returned if there's a merge operation |
3444 | processed. */ | |
b84d4347 | 3445 | |
bd31fe14 | 3446 | bool |
b84d4347 ML |
3447 | sem_item_optimizer::merge_classes (unsigned int prev_class_count) |
3448 | { | |
3449 | unsigned int item_count = m_items.length (); | |
3450 | unsigned int class_count = m_classes_count; | |
3451 | unsigned int equal_items = item_count - class_count; | |
3452 | ||
3453 | unsigned int non_singular_classes_count = 0; | |
3454 | unsigned int non_singular_classes_sum = 0; | |
3455 | ||
bd31fe14 ML |
3456 | bool merged_p = false; |
3457 | ||
a0843aed ML |
3458 | /* PR lto/78211 |
3459 | Sort functions in congruence classes by DECL_UID and do the same | |
3460 | for the classes to not to break -fcompare-debug. */ | |
3461 | ||
3462 | for (hash_table<congruence_class_hash>::iterator it = m_classes.begin (); | |
3463 | it != m_classes.end (); ++it) | |
3464 | { | |
3465 | for (unsigned int i = 0; i < (*it)->classes.length (); i++) | |
3466 | { | |
3467 | congruence_class *c = (*it)->classes[i]; | |
3468 | c->members.qsort (sort_sem_items_by_decl_uid); | |
3469 | } | |
3470 | ||
3471 | (*it)->classes.qsort (sort_congruence_classes_by_decl_uid); | |
3472 | } | |
3473 | ||
3746a4b2 ML |
3474 | for (hash_table<congruence_class_hash>::iterator it = m_classes.begin (); |
3475 | it != m_classes.end (); ++it) | |
3476 | for (unsigned int i = 0; i < (*it)->classes.length (); i++) | |
b84d4347 | 3477 | { |
3746a4b2 | 3478 | congruence_class *c = (*it)->classes[i]; |
b84d4347 ML |
3479 | if (c->members.length () > 1) |
3480 | { | |
3481 | non_singular_classes_count++; | |
3482 | non_singular_classes_sum += c->members.length (); | |
3483 | } | |
3484 | } | |
3485 | ||
a0843aed ML |
3486 | auto_vec <congruence_class_group *> classes (m_classes.elements ()); |
3487 | for (hash_table<congruence_class_hash>::iterator it = m_classes.begin (); | |
3488 | it != m_classes.end (); ++it) | |
3489 | classes.quick_push (*it); | |
3490 | ||
3491 | classes.qsort (sort_congruence_class_groups_by_decl_uid); | |
3492 | ||
b84d4347 ML |
3493 | if (dump_file) |
3494 | { | |
3495 | fprintf (dump_file, "\nItem count: %u\n", item_count); | |
3496 | fprintf (dump_file, "Congruent classes before: %u, after: %u\n", | |
3497 | prev_class_count, class_count); | |
3498 | fprintf (dump_file, "Average class size before: %.2f, after: %.2f\n", | |
f1c859ee ML |
3499 | prev_class_count ? 1.0f * item_count / prev_class_count : 0.0f, |
3500 | class_count ? 1.0f * item_count / class_count : 0.0f); | |
b84d4347 | 3501 | fprintf (dump_file, "Average non-singular class size: %.2f, count: %u\n", |
f1c859ee ML |
3502 | non_singular_classes_count ? 1.0f * non_singular_classes_sum / |
3503 | non_singular_classes_count : 0.0f, | |
b84d4347 ML |
3504 | non_singular_classes_count); |
3505 | fprintf (dump_file, "Equal symbols: %u\n", equal_items); | |
3506 | fprintf (dump_file, "Fraction of visited symbols: %.2f%%\n\n", | |
f1c859ee | 3507 | item_count ? 100.0f * equal_items / item_count : 0.0f); |
b84d4347 ML |
3508 | } |
3509 | ||
a0843aed ML |
3510 | unsigned int l; |
3511 | congruence_class_group *it; | |
3512 | FOR_EACH_VEC_ELT (classes, l, it) | |
3513 | for (unsigned int i = 0; i < it->classes.length (); i++) | |
b84d4347 | 3514 | { |
a0843aed | 3515 | congruence_class *c = it->classes[i]; |
b84d4347 ML |
3516 | |
3517 | if (c->members.length () == 1) | |
3518 | continue; | |
3519 | ||
b84d4347 ML |
3520 | sem_item *source = c->members[0]; |
3521 | ||
78fcec3f JH |
3522 | if (DECL_NAME (source->decl) |
3523 | && MAIN_NAME_P (DECL_NAME (source->decl))) | |
aa398781 NS |
3524 | /* If merge via wrappers, picking main as the target can be |
3525 | problematic. */ | |
3526 | source = c->members[1]; | |
3527 | ||
3528 | for (unsigned int j = 0; j < c->members.length (); j++) | |
b84d4347 ML |
3529 | { |
3530 | sem_item *alias = c->members[j]; | |
b84d4347 | 3531 | |
aa398781 NS |
3532 | if (alias == source) |
3533 | continue; | |
3534 | ||
b84d4347 ML |
3535 | if (dump_file) |
3536 | { | |
3537 | fprintf (dump_file, "Semantic equality hit:%s->%s\n", | |
1aec2ecc ML |
3538 | xstrdup_for_dump (source->node->name ()), |
3539 | xstrdup_for_dump (alias->node->name ())); | |
b84d4347 | 3540 | fprintf (dump_file, "Assembler symbol names:%s->%s\n", |
1aec2ecc ML |
3541 | xstrdup_for_dump (source->node->asm_name ()), |
3542 | xstrdup_for_dump (alias->node->asm_name ())); | |
b84d4347 ML |
3543 | } |
3544 | ||
185c9e56 ML |
3545 | if (lookup_attribute ("no_icf", DECL_ATTRIBUTES (alias->decl))) |
3546 | { | |
3547 | if (dump_file) | |
3548 | fprintf (dump_file, | |
3549 | "Merge operation is skipped due to no_icf " | |
3550 | "attribute.\n\n"); | |
3551 | ||
3552 | continue; | |
3553 | } | |
3554 | ||
b84d4347 ML |
3555 | if (dump_file && (dump_flags & TDF_DETAILS)) |
3556 | { | |
3557 | source->dump_to_file (dump_file); | |
3558 | alias->dump_to_file (dump_file); | |
3559 | } | |
3560 | ||
7aeb92b4 | 3561 | if (dbg_cnt (merged_ipa_icf)) |
0dbacfcf ML |
3562 | { |
3563 | bool merged = source->merge (alias); | |
3564 | merged_p |= merged; | |
3565 | ||
3566 | if (merged && alias->type == VAR) | |
3567 | { | |
3568 | symtab_pair p = symtab_pair (source->node, alias->node); | |
3569 | m_merged_variables.safe_push (p); | |
3570 | } | |
3571 | } | |
b84d4347 ML |
3572 | } |
3573 | } | |
bd31fe14 | 3574 | |
0dbacfcf ML |
3575 | if (!m_merged_variables.is_empty ()) |
3576 | fixup_points_to_sets (); | |
3577 | ||
bd31fe14 | 3578 | return merged_p; |
b84d4347 ML |
3579 | } |
3580 | ||
0dbacfcf ML |
3581 | /* Fixup points to set PT. */ |
3582 | ||
3583 | void | |
3584 | sem_item_optimizer::fixup_pt_set (struct pt_solution *pt) | |
3585 | { | |
3586 | if (pt->vars == NULL) | |
3587 | return; | |
3588 | ||
3589 | unsigned i; | |
3590 | symtab_pair *item; | |
3591 | FOR_EACH_VEC_ELT (m_merged_variables, i, item) | |
3592 | if (bitmap_bit_p (pt->vars, DECL_UID (item->second->decl))) | |
3593 | bitmap_set_bit (pt->vars, DECL_UID (item->first->decl)); | |
3594 | } | |
3595 | ||
3596 | /* Set all points-to UIDs of aliases pointing to node N as UID. */ | |
3597 | ||
3598 | static void | |
3599 | set_alias_uids (symtab_node *n, int uid) | |
3600 | { | |
3601 | ipa_ref *ref; | |
3602 | FOR_EACH_ALIAS (n, ref) | |
3603 | { | |
3604 | if (dump_file) | |
3605 | fprintf (dump_file, " Setting points-to UID of [%s] as %d\n", | |
3606 | xstrdup_for_dump (ref->referring->asm_name ()), uid); | |
3607 | ||
3608 | SET_DECL_PT_UID (ref->referring->decl, uid); | |
3609 | set_alias_uids (ref->referring, uid); | |
3610 | } | |
3611 | } | |
3612 | ||
3613 | /* Fixup points to analysis info. */ | |
3614 | ||
3615 | void | |
3616 | sem_item_optimizer::fixup_points_to_sets (void) | |
3617 | { | |
3618 | /* TODO: remove in GCC 9 and trigger PTA re-creation after IPA passes. */ | |
0dbacfcf | 3619 | cgraph_node *cnode; |
0dbacfcf ML |
3620 | |
3621 | FOR_EACH_DEFINED_FUNCTION (cnode) | |
3622 | { | |
3623 | tree name; | |
3624 | unsigned i; | |
3625 | function *fn = DECL_STRUCT_FUNCTION (cnode->decl); | |
cc614ac0 ML |
3626 | if (!gimple_in_ssa_p (fn)) |
3627 | continue; | |
3628 | ||
0dbacfcf ML |
3629 | FOR_EACH_SSA_NAME (i, name, fn) |
3630 | if (POINTER_TYPE_P (TREE_TYPE (name)) | |
3631 | && SSA_NAME_PTR_INFO (name)) | |
3632 | fixup_pt_set (&SSA_NAME_PTR_INFO (name)->pt); | |
3633 | fixup_pt_set (&fn->gimple_df->escaped); | |
3634 | ||
3635 | /* The above get's us to 99% I guess, at least catching the | |
3636 | address compares. Below also gets us aliasing correct | |
3637 | but as said we're giving leeway to the situation with | |
3638 | readonly vars anyway, so ... */ | |
3639 | basic_block bb; | |
3640 | FOR_EACH_BB_FN (bb, fn) | |
3641 | for (gimple_stmt_iterator gsi = gsi_start_bb (bb); !gsi_end_p (gsi); | |
3642 | gsi_next (&gsi)) | |
3643 | { | |
3644 | gcall *call = dyn_cast<gcall *> (gsi_stmt (gsi)); | |
3645 | if (call) | |
3646 | { | |
3647 | fixup_pt_set (gimple_call_use_set (call)); | |
3648 | fixup_pt_set (gimple_call_clobber_set (call)); | |
3649 | } | |
3650 | } | |
3651 | } | |
3652 | ||
3653 | unsigned i; | |
3654 | symtab_pair *item; | |
3655 | FOR_EACH_VEC_ELT (m_merged_variables, i, item) | |
3656 | set_alias_uids (item->first, DECL_UID (item->first->decl)); | |
3657 | } | |
3658 | ||
b84d4347 ML |
3659 | /* Dump function prints all class members to a FILE with an INDENT. */ |
3660 | ||
3661 | void | |
3662 | congruence_class::dump (FILE *file, unsigned int indent) const | |
3663 | { | |
3664 | FPRINTF_SPACES (file, indent, "class with id: %u, hash: %u, items: %u\n", | |
3665 | id, members[0]->get_hash (), members.length ()); | |
3666 | ||
3667 | FPUTS_SPACES (file, indent + 2, ""); | |
3668 | for (unsigned i = 0; i < members.length (); i++) | |
464d0118 | 3669 | fprintf (file, "%s ", members[i]->node->dump_asm_name ()); |
b84d4347 ML |
3670 | |
3671 | fprintf (file, "\n"); | |
3672 | } | |
3673 | ||
3674 | /* Returns true if there's a member that is used from another group. */ | |
3675 | ||
3676 | bool | |
3677 | congruence_class::is_class_used (void) | |
3678 | { | |
3679 | for (unsigned int i = 0; i < members.length (); i++) | |
3680 | if (members[i]->usages.length ()) | |
3681 | return true; | |
3682 | ||
3683 | return false; | |
3684 | } | |
3685 | ||
b84d4347 ML |
3686 | /* Generate pass summary for IPA ICF pass. */ |
3687 | ||
3688 | static void | |
3689 | ipa_icf_generate_summary (void) | |
3690 | { | |
3691 | if (!optimizer) | |
3692 | optimizer = new sem_item_optimizer (); | |
3693 | ||
e3e968e9 | 3694 | optimizer->register_hooks (); |
b84d4347 ML |
3695 | optimizer->parse_funcs_and_vars (); |
3696 | } | |
3697 | ||
3698 | /* Write pass summary for IPA ICF pass. */ | |
3699 | ||
3700 | static void | |
3701 | ipa_icf_write_summary (void) | |
3702 | { | |
3703 | gcc_assert (optimizer); | |
3704 | ||
3705 | optimizer->write_summary (); | |
3706 | } | |
3707 | ||
3708 | /* Read pass summary for IPA ICF pass. */ | |
3709 | ||
3710 | static void | |
3711 | ipa_icf_read_summary (void) | |
3712 | { | |
3713 | if (!optimizer) | |
3714 | optimizer = new sem_item_optimizer (); | |
3715 | ||
3716 | optimizer->read_summary (); | |
3717 | optimizer->register_hooks (); | |
3718 | } | |
3719 | ||
3720 | /* Semantic equality exection function. */ | |
3721 | ||
3722 | static unsigned int | |
3723 | ipa_icf_driver (void) | |
3724 | { | |
3725 | gcc_assert (optimizer); | |
3726 | ||
bd31fe14 | 3727 | bool merged_p = optimizer->execute (); |
b84d4347 ML |
3728 | |
3729 | delete optimizer; | |
9612a39a | 3730 | optimizer = NULL; |
b84d4347 | 3731 | |
bd31fe14 | 3732 | return merged_p ? TODO_remove_functions : 0; |
b84d4347 ML |
3733 | } |
3734 | ||
3735 | const pass_data pass_data_ipa_icf = | |
3736 | { | |
3737 | IPA_PASS, /* type */ | |
3738 | "icf", /* name */ | |
3739 | OPTGROUP_IPA, /* optinfo_flags */ | |
3740 | TV_IPA_ICF, /* tv_id */ | |
3741 | 0, /* properties_required */ | |
3742 | 0, /* properties_provided */ | |
3743 | 0, /* properties_destroyed */ | |
3744 | 0, /* todo_flags_start */ | |
3745 | 0, /* todo_flags_finish */ | |
3746 | }; | |
3747 | ||
3748 | class pass_ipa_icf : public ipa_opt_pass_d | |
3749 | { | |
3750 | public: | |
3751 | pass_ipa_icf (gcc::context *ctxt) | |
3752 | : ipa_opt_pass_d (pass_data_ipa_icf, ctxt, | |
3753 | ipa_icf_generate_summary, /* generate_summary */ | |
3754 | ipa_icf_write_summary, /* write_summary */ | |
3755 | ipa_icf_read_summary, /* read_summary */ | |
3756 | NULL, /* | |
3757 | write_optimization_summary */ | |
3758 | NULL, /* | |
3759 | read_optimization_summary */ | |
3760 | NULL, /* stmt_fixup */ | |
3761 | 0, /* function_transform_todo_flags_start */ | |
3762 | NULL, /* function_transform */ | |
3763 | NULL) /* variable_transform */ | |
3764 | {} | |
3765 | ||
3766 | /* opt_pass methods: */ | |
3767 | virtual bool gate (function *) | |
3768 | { | |
b16650ac | 3769 | return in_lto_p || flag_ipa_icf_variables || flag_ipa_icf_functions; |
b84d4347 ML |
3770 | } |
3771 | ||
3772 | virtual unsigned int execute (function *) | |
3773 | { | |
3774 | return ipa_icf_driver(); | |
3775 | } | |
3776 | }; // class pass_ipa_icf | |
3777 | ||
3778 | } // ipa_icf namespace | |
3779 | ||
3780 | ipa_opt_pass_d * | |
3781 | make_pass_ipa_icf (gcc::context *ctxt) | |
3782 | { | |
3783 | return new ipa_icf::pass_ipa_icf (ctxt); | |
3784 | } |