GCC Middle and Back End API Reference
ipa-icf.h
Go to the documentation of this file.
1/* Interprocedural semantic function equality pass
2 Copyright (C) 2014-2025 Free Software Foundation, Inc.
3
4 Contributed by Jan Hubicka <hubicka@ucw.cz> and Martin Liska <mliska@suse.cz>
5
6This file is part of GCC.
7
8GCC is free software; you can redistribute it and/or modify it under
9the terms of the GNU General Public License as published by the Free
10Software Foundation; either version 3, or (at your option) any later
11version.
12
13GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14WARRANTY; without even the implied warranty of MERCHANTABILITY or
15FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16for more details.
17
18You should have received a copy of the GNU General Public License
19along with GCC; see the file COPYING3. If not see
20<http://www.gnu.org/licenses/>. */
21
22namespace ipa_icf {
23class sem_item;
24
25/* Congruence class encompasses a collection of either functions or
26 read-only variables. These items are considered to be equivalent
27 if not proved the opposite. */
29{
30public:
31 /* Congruence class constructor for a new class with _ID. */
32 congruence_class (unsigned int _id): in_worklist (false), id (_id),
34 {
35 }
36
37 /* Destructor. */
39 {
40 }
41
42 /* Dump function prints all class members to a FILE with an INDENT. */
43 void dump (FILE *file, unsigned int indent = 0) const;
44
45 /* Returns true if there's a member that is used from another group. */
46 bool is_class_used (void);
47
48 /* Flag is used in case we want to remove a class from worklist and
49 delete operation is quite expensive for
50 the data structure (linked list). */
52
53 /* Vector of all group members. */
54 auto_vec <sem_item *> members;
55
56 /* Global unique class identifier. */
57 unsigned int id;
58
59 /* Total number of references to items of this class. */
61};
62
63/* Semantic item type enum. */
69
70/* Class is container for address references for a symtab_node. */
71
73{
74public:
75 /* Constructor. */
77
78 /* Destructor. */
80 {
81 m_references.release ();
82 m_interposables.release ();
83 }
84
85 /* Vector of address references. */
87
88 /* Vector of interposable references. */
90};
91
92/* Hash traits for symbol_compare_collection map. */
93
94struct symbol_compare_hash : nofree_ptr_hash <symbol_compare_collection>
95{
96 static hashval_t
98 {
99 inchash::hash hstate;
100 hstate.add_int (v->m_references.length ());
101
102 for (unsigned i = 0; i < v->m_references.length (); i++)
103 hstate.add_int (v->m_references[i]->ultimate_alias_target ()->order);
104
105 hstate.add_int (v->m_interposables.length ());
106
107 for (unsigned i = 0; i < v->m_interposables.length (); i++)
108 hstate.add_int (v->m_interposables[i]->ultimate_alias_target ()->order);
109
110 return hstate.end ();
111 }
112
113 static bool
115 {
116 if (a->m_references.length () != b->m_references.length ()
117 || a->m_interposables.length () != b->m_interposables.length ())
118 return false;
119
120 for (unsigned i = 0; i < a->m_references.length (); i++)
121 if (a->m_references[i]->equal_address_to (b->m_references[i]) != 1)
122 return false;
123
124 for (unsigned i = 0; i < a->m_interposables.length (); i++)
125 if (!a->m_interposables[i]->semantically_equivalent_p
126 (b->m_interposables[i]))
127 return false;
128
129 return true;
130 }
131};
132
133/* Semantic item usage pair. */
135{
136public:
137 /* Constructor for key value pair, where _ITEM is key and _INDEX is a target. */
138 sem_usage_pair (sem_item *_item, unsigned int _index);
139
140 /* Target semantic item where an item is used. */
142
143 /* Index of usage of such an item. */
144 unsigned int index;
145};
146
147struct sem_usage_pair_hash : pointer_hash <sem_usage_pair>
148{
149 static inline hashval_t hash (sem_usage_pair *);
150 static inline bool equal (sem_usage_pair *, sem_usage_pair *);
151};
152
153inline hashval_t
155{
156 inchash::hash hstate;
157
158 hstate.add_ptr (pair->item);
159 hstate.add_int (pair->index);
160
161 return hstate.end ();
162}
163
164inline bool
166{
167 return p1->item == p2->item && p1->index == p2->index;
168}
169
172
173typedef std::pair<symtab_node *, symtab_node *> symtab_pair;
174
175/* Semantic item is a base class that encapsulates all shared functionality
176 for both semantic function and variable items. */
178{
179public:
180 /* Semantic item constructor for a node of _TYPE, where STACK is used
181 for bitmap memory allocation. */
182 sem_item (sem_item_type _type, bitmap_obstack *stack);
183
184 /* Semantic item constructor for a node of _TYPE, where STACK is used
185 for bitmap memory allocation. The item is based on symtab node _NODE. */
186 sem_item (sem_item_type _type, symtab_node *_node, bitmap_obstack *stack);
187
188 virtual ~sem_item ();
189
190 /* Dump function for debugging purpose. */
191 DEBUG_FUNCTION void dump (void);
192
193 /* Semantic item initialization function. */
194 virtual void init (ipa_icf_gimple::func_checker *) = 0;
195
196 /* Add reference to a semantic TARGET. */
197 void add_reference (ref_map *map, sem_item *target);
198
199 /* Fast equality function based on knowledge known in WPA. */
200 virtual bool equals_wpa (sem_item *item,
201 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
202
203 /* Returns true if the item equals to ITEM given as argument. */
204 virtual bool equals (sem_item *item,
205 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
206
207 /* References independent hash function. */
208 virtual hashval_t get_hash (void) = 0;
209
210 /* Set new hash value of the item. */
211 void set_hash (hashval_t hash);
212
213 /* Merges instance with an ALIAS_ITEM, where alias, thunk or redirection can
214 be applied. */
215 virtual bool merge (sem_item *alias_item) = 0;
216
217 /* Dump symbol to FILE. */
218 virtual void dump_to_file (FILE *file) = 0;
219
220 /* Update hash by address sensitive references. */
222 sem_item *> &m_symtab_node_map);
223
224 /* Update hash by computed local hash values taken from different
225 semantic items. */
227 sem_item *> &m_symtab_node_map);
228
229 /* Return base tree that can be used for compatible_types_p and
230 contains_polymorphic_type_p comparison. */
231 static bool get_base_types (tree *t1, tree *t2);
232
233 /* Return true if target supports alias symbols. */
235
236 /* Item type. */
238
239 /* Symtab node. */
241
242 /* Declaration tree node. */
244
245 /* Number of references to a semantic symbols (function calls,
246 variable references). */
248
249 /* Pointer to a congruence class the item belongs to. */
251
252 /* Index of the item in a class belonging to. */
253 unsigned int index_in_class;
254
255 /* A bitmap with indices of all classes referencing this item. */
257
258 /* List of tree references (either FUNC_DECL or VAR_DECL). */
259 vec <tree> tree_refs;
260
261 /* A set with symbol table references. */
262 hash_set <symtab_node *> refs_set;
263
264 /* Temporary hash used where hash values of references are added. */
265 hashval_t global_hash;
266
267 /* Number of references to this symbol. */
269protected:
270 /* Cached, once calculated hash for the item. */
271
272 /* Compare properties of symbol that does not affect semantics of symbol
273 itself but affects semantics of its references.
274 If ADDRESS is true, do extra checking needed for IPA_REF_ADDR. */
276 symtab_node *n1,
277 symtab_node *n2,
278 bool address);
279
280 /* Hash properties compared by compare_referenced_symbol_properties. */
282 inchash::hash &hstate,
283 bool address);
284
285 /* For a given symbol table nodes N1 and N2, we check that FUNCTION_DECLs
286 point to a same function. Comparison can be skipped if IGNORED_NODES
287 contains these nodes. ADDRESS indicate if address is taken. */
288 bool compare_symbol_references (hash_map <symtab_node *, sem_item *>
289 &ignored_nodes,
290 symtab_node *n1, symtab_node *n2,
291 bool address);
292protected:
293 /* Hash of item. */
294 hashval_t m_hash;
295
296 /* Indicated whether a hash value has been set or not. */
298
299private:
300 /* Initialize internal data structures. Bitmap STACK is used for
301 bitmap memory allocation process. */
302 void setup (bitmap_obstack *stack);
303
304 /* Because types can be arbitrarily large, avoid quadratic bottleneck. */
306}; // class sem_item
307
309{
310public:
311
312 /* Constructor based on callgraph node _NODE.
313 Bitmap STACK is used for memory allocation. */
314 sem_function (cgraph_node *_node, bitmap_obstack *stack);
315
316 ~sem_function ();
317
318 void init (ipa_icf_gimple::func_checker *) final override;
319 bool equals_wpa (sem_item *item,
320 hash_map <symtab_node *, sem_item *> &ignored_nodes)
321 final override;
322 hashval_t get_hash (void) final override;
323 bool equals (sem_item *item,
324 hash_map <symtab_node *, sem_item *> &ignored_nodes)
325 final override;
326 bool merge (sem_item *alias_item) final override;
327
328 /* Dump symbol to FILE. */
329 void dump_to_file (FILE *file) final override
330 {
331 gcc_assert (file);
333 }
334
335 /* Returns cgraph_node. */
336 inline cgraph_node *get_node (void)
337 {
339 }
340
341 /* Improve accumulated hash for HSTATE based on a gimple statement STMT. */
342 void hash_stmt (gimple *stmt, inchash::hash &inchash);
343
344 /* Return true if polymorphic comparison must be processed. */
345 bool compare_polymorphic_p (void);
346
347 /* For a given call graph NODE, the function constructs new
348 semantic function item. */
351
352 /* Perform additional checks needed to match types of used function
353 parameters. */
355
356 /* Exception handling region tree. */
358
359 /* Number of function arguments. */
360 unsigned int arg_count;
361
362 /* Total amount of edges in the function. */
363 unsigned int edge_count;
364
365 /* Vector of sizes of all basic blocks. */
366 vec <unsigned int> bb_sizes;
367
368 /* Control flow graph checksum. */
369 hashval_t cfg_checksum;
370
371 /* GIMPLE codes hash value. */
372 hashval_t gcode_hash;
373
374 /* Vector of subpart of memory access types. */
376
377 /* Total number of SSA names used in the function. */
379
380 /* Array of structures for all basic blocks. */
381 vec <ipa_icf_gimple::sem_bb *> bb_sorted;
382
383 /* Hash of canonical types used for memory references in the
384 function. */
386
387 /* Return true if parameter I may be used. */
388 bool param_used_p (unsigned int i);
389
390private:
391 /* Calculates hash value based on a BASIC_BLOCK. */
393
394 /* For given basic blocks BB1 and BB2 (from functions FUNC1 and FUNC),
395 true value is returned if phi nodes are semantically
396 equivalent in these blocks . */
398
399 /* Basic blocks dictionary BB_DICT returns true if SOURCE index BB
400 corresponds to TARGET. */
401 bool bb_dict_test (vec<int> *bb_dict, int source, int target);
402
403 /* If cgraph edges E1 and E2 are indirect calls, verify that
404 ICF flags are the same. */
406
407 /* Processes function equality comparison. */
408 bool equals_private (sem_item *item);
409
410 /* Function checker stores binding between functions. */
412
413 /* COMPARED_FUNC is a function that we compare to. */
415}; // class sem_function
416
418{
419public:
420 /* Constructor based on callgraph node _NODE.
421 Bitmap STACK is used for memory allocation. */
422
424
425 /* Semantic variable initialization function. */
426 void init (ipa_icf_gimple::func_checker *) final override;
427
428 hashval_t get_hash (void) final override;
429 bool merge (sem_item *alias_item) final override;
430 void dump_to_file (FILE *file) final override;
431 bool equals (sem_item *item,
432 hash_map <symtab_node *, sem_item *> &ignored_nodes)
433 final override;
434
435 /* Fast equality variable based on knowledge known in WPA. */
436 bool equals_wpa (sem_item *item,
437 hash_map <symtab_node *, sem_item *> &ignored_nodes)
438 final override;
439
440 /* Returns varpool_node. */
441 inline varpool_node *get_node (void)
442 {
444 }
445
446 /* Parser function that visits a varpool NODE. */
449
450private:
451 /* Compares trees T1 and T2 for semantic equality. */
452 static bool equals (tree t1, tree t2);
453}; // class sem_variable
454
455class sem_item_optimizer;
456
458{
459 hashval_t hash;
461 vec <congruence_class *> classes;
462};
463
464/* Congruence class set structure. */
465struct congruence_class_hash : nofree_ptr_hash <congruence_class_group>
466{
467 static inline hashval_t hash (const congruence_class_group *item)
468 {
469 return item->hash;
470 }
471
472 static inline int equal (const congruence_class_group *item1,
473 const congruence_class_group *item2)
474 {
475 return item1->hash == item2->hash && item1->type == item2->type;
476 }
477};
478
484
485/* Semantic item optimizer includes all top-level logic
486 related to semantic equality comparison. */
488{
489public:
492
493 /* Function responsible for visiting all potential functions and
494 read-only variables that can be merged. */
495 void parse_funcs_and_vars (void);
496
497 /* Optimizer entry point which returns true in case it processes
498 a merge operation. True is returned if there's a merge operation
499 processed. */
500 bool execute (void);
501
502 /* Dump function. */
503 void dump (void);
504
505 /* Verify congruence classes if checking is enabled. */
506 void checking_verify_classes (void);
507
508 /* Verify congruence classes. */
509 void verify_classes (void);
510
511 /* Write IPA ICF summary for symbols. */
512 void write_summary (void);
513
514 /* Read IPA ICF summary for symbols. */
515 void read_summary (void);
516
517 /* Callgraph removal hook called for a NODE with a custom DATA. */
518 static void cgraph_removal_hook (cgraph_node *node, void *data);
519
520 /* Varpool removal hook called for a NODE with a custom DATA. */
521 static void varpool_removal_hook (varpool_node *node, void *data);
522
523 /* Worklist of congruence classes that can potentially
524 refine classes of congruence. */
526
527 /* Remove semantic ITEM and release memory. */
528 void remove_item (sem_item *item);
529
530 /* Remove symtab NODE triggered by symtab removal hooks. */
531 void remove_symtab_node (symtab_node *node);
532
533 /* Register callgraph and varpool hooks. */
534 void register_hooks (void);
535
536 /* Unregister callgraph and varpool hooks. */
537 void unregister_hooks (void);
538
539 /* Adds a CLS to hashtable associated by hash value. */
540 void add_class (congruence_class *cls);
541
542 /* Gets a congruence class group based on given HASH value and TYPE. */
545private:
546
547 /* For each semantic item, append hash values of references. */
549
550 /* Update hash by canonical types of memory accesses. */
552
553 /* Congruence classes are built by hash value. */
554 void build_hash_based_classes (void);
555
556 /* Semantic items in classes having more than one element and initialized.
557 In case of WPA, we load function body. */
558 unsigned int parse_nonsingleton_classes (void);
559
560 /* Equality function for semantic items is used to subdivide existing
561 classes. If IN_WPA, fast equality function is invoked. */
562 void subdivide_classes_by_equality (bool in_wpa = false);
563
564 /* Subdivide classes by address and interposable references
565 that members of the class reference.
566 Example can be a pair of functions that have an address
567 taken from a function. If these addresses are different the class
568 is split. */
570
571 /* Debug function prints all informations about congruence classes. */
572 void dump_cong_classes (void);
573
574 /* Build references according to call graph. */
575 void build_graph (void);
576
577 /* Iterative congruence reduction function. */
578 void process_cong_reduction (void);
579
580 /* After reduction is done, we can declare all items in a group
581 to be equal. PREV_CLASS_COUNT is start number of classes
582 before reduction. True is returned if there's a merge operation
583 processed. LOADED_SYMBOLS is number of symbols that were loaded
584 in WPA. */
585 bool merge_classes (unsigned int prev_class_count,
586 unsigned int loaded_symbols);
587
588 /* Fixup points to analysis info. */
589 void fixup_points_to_sets (void);
590
591 /* Fixup points to set PT. */
592 void fixup_pt_set (struct pt_solution *pt);
593
594 /* Adds a newly created congruence class CLS to worklist. */
596
597 /* Pops a class from worklist. */
599
600 /* Every usage of a congruence class CLS is a candidate that can split the
601 collection of classes. Bitmap stack BMSTACK is used for bitmap
602 allocation. */
604
605 /* Tests if a class CLS used as INDEXth splits any congruence classes.
606 Bitmap stack BMSTACK is used for bitmap allocation. */
607 bool do_congruence_step_for_index (congruence_class *cls, unsigned int index);
608
609 /* Makes pairing between a congruence class CLS and semantic ITEM. */
610 static void add_item_to_class (congruence_class *cls, sem_item *item);
611
612 /* Disposes split map traverse function. CLS is congruence
613 class, BSLOT is bitmap slot we want to release. DATA is mandatory,
614 but unused argument. */
615 static bool release_split_map (congruence_class * const &cls, bitmap const &b,
617
618 /* Process split operation for a congruence class CLS,
619 where bitmap B splits congruence class members. DATA is used
620 as argument of split pair. */
621 static bool traverse_congruence_split (congruence_class * const &cls,
622 bitmap const &b,
624
625 /* Compare function for sorting pairs in do_congruence_step_f. */
626 static int sort_congruence_split (const void *, const void *);
627
628 /* Reads a section from LTO stream file FILE_DATA. Input block for DATA
629 contains LEN bytes. */
630 void read_section (lto_file_decl_data *file_data, const char *data,
631 size_t len);
632
633 /* Removes all callgraph and varpool nodes that are marked by symtab
634 as deleted. */
635 void filter_removed_items (void);
636
637 /* Vector of semantic items. */
638 vec <sem_item *> m_items;
639
640 /* A set containing all items removed by hooks. */
641 hash_set <symtab_node *> m_removed_items_set;
642
643 /* Hashtable of congruence classes. */
644 hash_table <congruence_class_hash> m_classes;
645
646 /* Count of congruence classes. */
647 unsigned int m_classes_count;
648
649 /* Map data structure maps symtab nodes to semantic items. */
650 hash_map <symtab_node *, sem_item *> m_symtab_node_map;
651
652 /* Set to true if a splitter class is removed. */
654
655 /* Global unique class id counter. */
656 static unsigned int class_id;
657
658 /* Callgraph node removal hook holder. */
660
661 /* Varpool node removal hook holder. */
663
664 /* Bitmap stack. */
666
667 /* Vector of merged variables. Needed for fixup of points-to-analysis
668 info. */
669 vec <symtab_pair> m_merged_variables;
670
671 /* Hash map will all references. */
673}; // class sem_item_optimizer
674
675} // ipa_icf namespace
Definition vec.h:1667
Definition cgraph.h:1702
Definition genoutput.cc:150
Definition fibonacci_heap.h:143
Definition hash-map.h:40
Definition inchash.h:38
void add_int(unsigned v)
Definition inchash.h:55
hashval_t end() const
Definition inchash.h:49
void add_ptr(const void *ptr)
Definition inchash.h:94
Definition ipa-icf.h:29
auto_vec< sem_item * > members
Definition ipa-icf.h:54
congruence_class(unsigned int _id)
Definition ipa-icf.h:32
bool is_class_used(void)
Definition ipa-icf.cc:3603
unsigned referenced_by_count
Definition ipa-icf.h:60
void dump(FILE *file, unsigned int indent=0) const
Definition ipa-icf.cc:3588
~congruence_class()
Definition ipa-icf.h:38
bool in_worklist
Definition ipa-icf.h:51
unsigned int id
Definition ipa-icf.h:57
Definition ipa-icf.h:309
static sem_function * parse(cgraph_node *node, bitmap_obstack *stack, ipa_icf_gimple::func_checker *checker)
Definition ipa-icf.cc:1527
bool equals(sem_item *item, hash_map< symtab_node *, sem_item * > &ignored_nodes) final override
Definition ipa-icf.cc:806
ipa_icf_gimple::func_checker * m_checker
Definition ipa-icf.h:411
void dump_to_file(FILE *file) final override
Definition ipa-icf.h:329
eh_region region_tree
Definition ipa-icf.h:357
sem_function * m_compared_func
Definition ipa-icf.h:414
sem_function(cgraph_node *_node, bitmap_obstack *stack)
Definition ipa-icf.cc:236
bool compare_phi_node(basic_block bb1, basic_block bb2)
Definition ipa-icf.cc:1558
bool merge(sem_item *alias_item) final override
Definition ipa-icf.cc:1014
bool equals_wpa(sem_item *item, hash_map< symtab_node *, sem_item * > &ignored_nodes) final override
Definition ipa-icf.cc:528
vec< unsigned int > bb_sizes
Definition ipa-icf.h:366
auto_vec< tree > memory_access_types
Definition ipa-icf.h:375
bool param_used_p(unsigned int i)
Definition ipa-icf.cc:488
hashval_t cfg_checksum
Definition ipa-icf.h:369
unsigned int edge_count
Definition ipa-icf.h:363
vec< ipa_icf_gimple::sem_bb * > bb_sorted
Definition ipa-icf.h:381
void init(ipa_icf_gimple::func_checker *) final override
Definition ipa-icf.cc:1347
bool compare_polymorphic_p(void)
Definition ipa-icf.cc:1506
bool compatible_parm_types_p(tree, tree)
Definition ipa-icf.cc:506
hashval_t gcode_hash
Definition ipa-icf.h:372
unsigned ssa_names_size
Definition ipa-icf.h:378
hashval_t m_alias_sets_hash
Definition ipa-icf.h:385
hashval_t get_hash(void) final override
Definition ipa-icf.cc:269
~sem_function()
Definition ipa-icf.cc:244
bool compare_edge_flags(cgraph_edge *e1, cgraph_edge *e2)
Definition ipa-icf.cc:469
cgraph_node * get_node(void)
Definition ipa-icf.h:336
void hash_stmt(gimple *stmt, inchash::hash &inchash)
Definition ipa-icf.cc:1440
bool bb_dict_test(vec< int > *bb_dict, int source, int target)
Definition ipa-icf.cc:1622
unsigned int arg_count
Definition ipa-icf.h:360
bool equals_private(sem_item *item)
Definition ipa-icf.cc:831
hashval_t get_bb_hash(const ipa_icf_gimple::sem_bb *basic_block)
Definition ipa-icf.cc:256
Definition ipa-icf.h:488
void fixup_points_to_sets(void)
Definition ipa-icf.cc:3541
static int sort_congruence_split(const void *, const void *)
Definition ipa-icf.cc:3046
hash_table< congruence_class_hash > m_classes
Definition ipa-icf.h:644
hash_map< symtab_node *, sem_item * > m_symtab_node_map
Definition ipa-icf.h:650
void dump_cong_classes(void)
Definition ipa-icf.cc:3231
void update_hash_by_addr_refs()
Definition ipa-icf.cc:2554
void update_hash_by_memory_access_type()
Definition ipa-icf.cc:2612
unsigned subdivide_classes_by_sensitive_refs()
Definition ipa-icf.cc:2808
void checking_verify_classes(void)
Definition ipa-icf.cc:2897
void build_graph(void)
Definition ipa-icf.cc:2651
bool execute(void)
Definition ipa-icf.cc:2453
static bool release_split_map(congruence_class *const &cls, bitmap const &b, traverse_split_pair *pair)
Definition ipa-icf.cc:2934
void remove_item(sem_item *item)
Definition ipa-icf.cc:2390
bool splitter_class_removed
Definition ipa-icf.h:653
void build_hash_based_classes(void)
Definition ipa-icf.cc:2629
bool merge_classes(unsigned int prev_class_count, unsigned int loaded_symbols)
Definition ipa-icf.cc:3331
void do_congruence_step(congruence_class *cls)
Definition ipa-icf.cc:3129
void read_section(lto_file_decl_data *file_data, const char *data, size_t len)
Definition ipa-icf.cc:2212
hash_set< symtab_node * > m_removed_items_set
Definition ipa-icf.h:641
varpool_node_hook_list * m_varpool_node_hooks
Definition ipa-icf.h:662
fibonacci_heap< unsigned, congruence_class > worklist
Definition ipa-icf.h:525
void subdivide_classes_by_equality(bool in_wpa=false)
Definition ipa-icf.cc:2725
static void varpool_removal_hook(varpool_node *node, void *data)
Definition ipa-icf.cc:2373
static void add_item_to_class(congruence_class *cls, sem_item *item)
Definition ipa-icf.cc:2543
void write_summary(void)
Definition ipa-icf.cc:2156
unsigned int m_classes_count
Definition ipa-icf.h:647
congruence_class * worklist_pop()
Definition ipa-icf.cc:3170
void process_cong_reduction(void)
Definition ipa-icf.cc:3198
void read_summary(void)
Definition ipa-icf.cc:2284
void verify_classes(void)
Definition ipa-icf.cc:2906
unsigned int parse_nonsingleton_classes(void)
Definition ipa-icf.cc:2698
void filter_removed_items(void)
Definition ipa-icf.cc:2401
void fixup_pt_set(struct pt_solution *pt)
Definition ipa-icf.cc:3509
bool do_congruence_step_for_index(congruence_class *cls, unsigned int index)
Definition ipa-icf.cc:3063
vec< symtab_pair > m_merged_variables
Definition ipa-icf.h:669
ref_map m_references
Definition ipa-icf.h:672
void add_class(congruence_class *cls)
Definition ipa-icf.cc:2329
congruence_class_group * get_group_by_hash(hashval_t hash, sem_item_type type)
Definition ipa-icf.cc:2342
void parse_funcs_and_vars(void)
Definition ipa-icf.cc:2507
void worklist_push(congruence_class *cls)
Definition ipa-icf.cc:3157
static unsigned int class_id
Definition ipa-icf.h:656
void remove_symtab_node(symtab_node *node)
Definition ipa-icf.cc:2382
cgraph_node_hook_list * m_cgraph_node_hooks
Definition ipa-icf.h:659
vec< sem_item * > m_items
Definition ipa-icf.h:638
~sem_item_optimizer()
Definition ipa-icf.cc:2131
static void cgraph_removal_hook(cgraph_node *node, void *data)
Definition ipa-icf.cc:2364
void register_hooks(void)
Definition ipa-icf.cc:2303
static bool traverse_congruence_split(congruence_class *const &cls, bitmap const &b, traverse_split_pair *pair)
Definition ipa-icf.cc:2949
sem_item_optimizer()
Definition ipa-icf.cc:2123
bitmap_obstack m_bmstack
Definition ipa-icf.h:665
void unregister_hooks(void)
Definition ipa-icf.cc:2317
Definition ipa-icf.h:178
virtual bool equals(sem_item *item, hash_map< symtab_node *, sem_item * > &ignored_nodes)=0
static bool get_base_types(tree *t1, tree *t2)
congruence_class * cls
Definition ipa-icf.h:250
virtual bool equals_wpa(sem_item *item, hash_map< symtab_node *, sem_item * > &ignored_nodes)=0
bool m_hash_set
Definition ipa-icf.h:297
unsigned referenced_by_count
Definition ipa-icf.h:268
virtual void init(ipa_icf_gimple::func_checker *)=0
virtual void dump_to_file(FILE *file)=0
hash_set< symtab_node * > refs_set
Definition ipa-icf.h:262
hashval_t m_hash
Definition ipa-icf.h:294
sem_item(sem_item_type _type, bitmap_obstack *stack)
Definition ipa-icf.cc:147
void hash_referenced_symbol_properties(symtab_node *ref, inchash::hash &hstate, bool address)
Definition ipa-icf.cc:407
unsigned int index_in_class
Definition ipa-icf.h:253
static bool compare_referenced_symbol_properties(symtab_node *used_by, symtab_node *n1, symtab_node *n2, bool address)
Definition ipa-icf.cc:317
void setup(bitmap_obstack *stack)
Definition ipa-icf.cc:186
bool compare_symbol_references(hash_map< symtab_node *, sem_item * > &ignored_nodes, symtab_node *n1, symtab_node *n2, bool address)
Definition ipa-icf.cc:436
symtab_node * node
Definition ipa-icf.h:240
tree decl
Definition ipa-icf.h:243
virtual hashval_t get_hash(void)=0
bitmap usage_index_bitmap
Definition ipa-icf.h:256
vec< tree > tree_refs
Definition ipa-icf.h:259
void update_hash_by_addr_refs(hash_map< symtab_node *, sem_item * > &m_symtab_node_map)
Definition ipa-icf.cc:741
virtual bool merge(sem_item *alias_item)=0
hashval_t global_hash
Definition ipa-icf.h:265
virtual ~sem_item()
Definition ipa-icf.cc:195
unsigned reference_count
Definition ipa-icf.h:247
static hash_map< const_tree, hashval_t > m_type_hash_cache
Definition ipa-icf.h:305
void update_hash_by_local_refs(hash_map< symtab_node *, sem_item * > &m_symtab_node_map)
Definition ipa-icf.cc:776
DEBUG_FUNCTION void dump(void)
Definition ipa-icf.cc:205
sem_item_type type
Definition ipa-icf.h:237
bool target_supports_symbol_aliases_p(void)
Definition ipa-icf.cc:218
void set_hash(hashval_t hash)
Definition ipa-icf.cc:228
void add_reference(ref_map *map, sem_item *target)
Definition ipa-icf.cc:165
Definition ipa-icf.h:135
sem_usage_pair(sem_item *_item, unsigned int _index)
Definition ipa-icf.cc:142
sem_item * item
Definition ipa-icf.h:141
unsigned int index
Definition ipa-icf.h:144
Definition ipa-icf.h:418
static sem_variable * parse(varpool_node *node, bitmap_obstack *stack, ipa_icf_gimple::func_checker *checker)
Definition ipa-icf.cc:1920
sem_variable(varpool_node *_node, bitmap_obstack *stack)
Definition ipa-icf.cc:1639
void init(ipa_icf_gimple::func_checker *) final override
Definition ipa-icf.cc:1936
bool equals(sem_item *item, hash_map< symtab_node *, sem_item * > &ignored_nodes) final override
Definition ipa-icf.cc:1706
bool merge(sem_item *alias_item) final override
Definition ipa-icf.cc:1966
varpool_node * get_node(void)
Definition ipa-icf.h:441
void dump_to_file(FILE *file) final override
Definition ipa-icf.cc:2113
hashval_t get_hash(void) final override
Definition ipa-icf.cc:1956
bool equals_wpa(sem_item *item, hash_map< symtab_node *, sem_item * > &ignored_nodes) final override
Definition ipa-icf.cc:1649
vec< symtab_node * > m_interposables
Definition ipa-icf.h:89
vec< symtab_node * > m_references
Definition ipa-icf.h:86
symbol_compare_collection(symtab_node *node)
Definition ipa-icf.cc:106
~symbol_compare_collection()
Definition ipa-icf.h:79
Definition ipa-icf-gimple.h:122
Definition ipa-icf-gimple.h:104
struct basic_block_def * basic_block
Definition coretypes.h:355
class bitmap_head * bitmap
Definition coretypes.h:51
union tree_node * tree
Definition coretypes.h:97
static struct string2counter_map map[debug_counter_number_of_counters]
Definition dbgcnt.cc:39
@ TDF_DETAILS
Definition dumpfile.h:92
struct eh_region_d * eh_region
Definition except.h:184
T dyn_cast(U *p)
Definition is-a.h:280
Definition fold-const.cc:4338
Definition ipa-icf.cc:97
std::pair< symtab_node *, symtab_node * > symtab_pair
Definition ipa-icf.h:173
hash_map< sem_usage_hash, auto_vec< sem_item * > > ref_map
Definition ipa-icf.h:171
sem_item_type
Definition ipa-icf.h:65
@ FUNC
Definition ipa-icf.h:66
@ VAR
Definition ipa-icf.h:67
i
Definition poly-int.h:776
Ca const poly_int< N, Cb > & b
Definition poly-int.h:771
Ca & a
Definition poly-int.h:770
Definition bitmap.h:294
Definition cgraph.cc:91
Definition cgraph.h:888
Definition gimple.h:221
Definition ipa-icf.h:458
sem_item_type type
Definition ipa-icf.h:460
hashval_t hash
Definition ipa-icf.h:459
vec< congruence_class * > classes
Definition ipa-icf.h:461
Definition ipa-icf.h:466
static int equal(const congruence_class_group *item1, const congruence_class_group *item2)
Definition ipa-icf.h:472
static hashval_t hash(const congruence_class_group *item)
Definition ipa-icf.h:467
Definition ipa-icf.h:170
Definition ipa-icf.h:148
static bool equal(sem_usage_pair *, sem_usage_pair *)
Definition ipa-icf.h:165
static hashval_t hash(sem_usage_pair *)
Definition ipa-icf.h:154
Definition ipa-icf.h:95
static hashval_t hash(value_type v)
Definition ipa-icf.h:97
static bool equal(value_type a, value_type b)
Definition ipa-icf.h:114
Definition ipa-icf.h:480
sem_item_optimizer * optimizer
Definition ipa-icf.h:481
class congruence_class * cls
Definition ipa-icf.h:482
Definition lto-streamer.h:567
Definition hash-traits.h:303
Definition gengtype.h:218
Definition hash-traits.h:168
symbol_compare_collection * value_type
Definition hash-traits.h:169
Definition tree-ssa-alias.h:29
Definition cgraph.h:106
Definition gengtype.h:252
Definition hash-traits.h:57
Definition varpool.cc:45
Definition cgraph.h:2011
Definition vec.h:450
#define gcc_assert(EXPR)
Definition system.h:814
#define false
Definition system.h:888
#define DEBUG_FUNCTION
Definition system.h:1236
void dump_function_to_file(tree fndecl, FILE *file, dump_flags_t flags)
Definition tree-cfg.cc:8296