gcc/ipa-icf.h

   1 /* Interprocedural semantic function equality pass
   2    Copyright (C) 2014-2015 Free Software Foundation, Inc.
   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 namespace ipa_icf {
  23 class 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 oposite.  */
  28 class congruence_class
  29 {
  30 public:
  31   /* Congruence class constructor for a new class with _ID.  */
  32   congruence_class (unsigned int _id): in_worklist (false), id(_id)
  33   {
  34   }
  35
  36   /* Destructor.  */
  37   ~congruence_class ()
  38   {
  39   }
  40
  41   /* Dump function prints all class members to a FILE with an INDENT.  */
  42   void dump (FILE *file, unsigned int indent = 0) const;
  43
  44   /* Returns true if there's a member that is used from another group.  */
  45   bool is_class_used (void);
  46
  47   /* Flag is used in case we want to remove a class from worklist and
  48      delete operation is quite expensive for
  49      the data structure (linked list).  */
  50   bool in_worklist;
  51
  52   /* Vector of all group members.  */
  53   auto_vec <sem_item *> members;
  54
  55   /* Global unique class identifier.  */
  56   unsigned int id;
  57 };
  58
  59 /* Semantic item type enum.  */
  60 enum sem_item_type
  61 {
  62   FUNC,
  63   VAR
  64 };
  65
  66 /* Class is container for address references for a symtab_node.  */
  67
  68 class symbol_compare_collection
  69 {
  70 public:
  71   /* Constructor.  */
  72   symbol_compare_collection (symtab_node *node);
  73
  74   /* Destructor.  */
  75   ~symbol_compare_collection ()
  76   {
  77     m_references.release ();
  78     m_interposables.release ();
  79   }
  80
  81   /* Vector of address references.  */
  82   vec<symtab_node *> m_references;
  83
  84   /* Vector of interposable references.  */
  85   vec<symtab_node *> m_interposables;
  86 };
  87
  88 /* Hash traits for symbol_compare_collection map.  */
  89
  90 struct symbol_compare_hashmap_traits: default_hashmap_traits
  91 {
  92   static hashval_t
  93   hash (const symbol_compare_collection *v)
  94   {
  95     inchash::hash hstate;
  96     hstate.add_int (v->m_references.length ());
  97
  98     for (unsigned i = 0; i < v->m_references.length (); i++)
  99       hstate.add_ptr (v->m_references[i]->ultimate_alias_target ());
 100
 101     hstate.add_int (v->m_interposables.length ());
 102
 103     for (unsigned i = 0; i < v->m_interposables.length (); i++)
 104       hstate.add_ptr (v->m_interposables[i]->ultimate_alias_target ());
 105
 106     return hstate.end ();
 107   }
 108
 109   static bool
 110   equal_keys (const symbol_compare_collection *a,
 111               const symbol_compare_collection *b)
 112   {
 113     if (a->m_references.length () != b->m_references.length ()
 114         || a->m_interposables.length () != b->m_interposables.length ())
 115       return false;
 116
 117     for (unsigned i = 0; i < a->m_references.length (); i++)
 118       if (a->m_references[i]->equal_address_to (b->m_references[i]) != 1)
 119         return false;
 120
 121     for (unsigned i = 0; i < a->m_interposables.length (); i++)
 122       if (!a->m_interposables[i]->semantically_equivalent_p
 123         (b->m_interposables[i]))
 124         return false;
 125
 126     return true;
 127   }
 128 };
 129
 130
 131 /* Semantic item usage pair.  */
 132 class sem_usage_pair
 133 {
 134 public:
 135   /* Constructor for key value pair, where _ITEM is key and _INDEX is a target.  */
 136   sem_usage_pair (sem_item *_item, unsigned int _index);
 137
 138   /* Target semantic item where an item is used.  */
 139   sem_item *item;
 140
 141   /* Index of usage of such an item.  */
 142   unsigned int index;
 143 };
 144
 145 /* Semantic item is a base class that encapsulates all shared functionality
 146    for both semantic function and variable items.  */
 147 class sem_item
 148 {
 149 public:
 150   /* Semantic item constructor for a node of _TYPE, where STACK is used
 151      for bitmap memory allocation.  */
 152   sem_item (sem_item_type _type, bitmap_obstack *stack);
 153
 154   /* Semantic item constructor for a node of _TYPE, where STACK is used
 155      for bitmap memory allocation. The item is based on symtab node _NODE
 156      with computed _HASH.  */
 157   sem_item (sem_item_type _type, symtab_node *_node, hashval_t _hash,
 158             bitmap_obstack *stack);
 159
 160   virtual ~sem_item ();
 161
 162   /* Dump function for debugging purpose.  */
 163   DEBUG_FUNCTION void dump (void);
 164
 165   /* Initialize semantic item by info reachable during LTO WPA phase.  */
 166   virtual void init_wpa (void) = 0;
 167
 168   /* Semantic item initialization function.  */
 169   virtual void init (void) = 0;
 170
 171   /* Add reference to a semantic TARGET.  */
 172   void add_reference (sem_item *target);
 173
 174   /* Gets symbol name of the item.  */
 175   const char *name (void)
 176   {
 177     return node->name ();
 178   }
 179
 180   /* Gets assembler name of the item.  */
 181   const char *asm_name (void)
 182   {
 183     return node->asm_name ();
 184   }
 185
 186   /* Fast equality function based on knowledge known in WPA.  */
 187   virtual bool equals_wpa (sem_item *item,
 188                            hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
 189
 190   /* Returns true if the item equals to ITEM given as arguemnt.  */
 191   virtual bool equals (sem_item *item,
 192                        hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
 193
 194   /* References independent hash function.  */
 195   virtual hashval_t get_hash (void) = 0;
 196
 197   /* Merges instance with an ALIAS_ITEM, where alias, thunk or redirection can
 198      be applied.  */
 199   virtual bool merge (sem_item *alias_item) = 0;
 200
 201   /* Dump symbol to FILE.  */
 202   virtual void dump_to_file (FILE *file) = 0;
 203
 204   /* Return base tree that can be used for compatible_types_p and
 205      contains_polymorphic_type_p comparison.  */
 206   static bool get_base_types (tree *t1, tree *t2);
 207
 208   /* Return true if target supports alias symbols.  */
 209   bool target_supports_symbol_aliases_p (void);
 210
 211   /* Item type.  */
 212   sem_item_type type;
 213
 214   /* Symtab node.  */
 215   symtab_node *node;
 216
 217   /* Declaration tree node.  */
 218   tree decl;
 219
 220   /* Semantic references used that generate congruence groups.  */
 221   vec <sem_item *> refs;
 222
 223   /* Pointer to a congruence class the item belongs to.  */
 224   congruence_class *cls;
 225
 226   /* Index of the item in a class belonging to.  */
 227   unsigned int index_in_class;
 228
 229   /* List of semantic items where the instance is used.  */
 230   vec <sem_usage_pair *> usages;
 231
 232   /* A bitmap with indices of all classes referencing this item.  */
 233   bitmap usage_index_bitmap;
 234
 235   /* List of tree references (either FUNC_DECL or VAR_DECL).  */
 236   vec <tree> tree_refs;
 237
 238   /* A set with symbol table references.  */
 239   hash_set <symtab_node *> refs_set;
 240
 241 protected:
 242   /* Cached, once calculated hash for the item.  */
 243   hashval_t hash;
 244
 245 private:
 246   /* Initialize internal data structures. Bitmap STACK is used for
 247      bitmap memory allocation process.  */
 248   void setup (bitmap_obstack *stack);
 249 }; // class sem_item
 250
 251 class sem_function: public sem_item
 252 {
 253 public:
 254   /* Semantic function constructor that uses STACK as bitmap memory stack.  */
 255   sem_function (bitmap_obstack *stack);
 256
 257   /*  Constructor based on callgraph node _NODE with computed hash _HASH.
 258       Bitmap STACK is used for memory allocation.  */
 259   sem_function (cgraph_node *_node, hashval_t _hash, bitmap_obstack *stack);
 260
 261   ~sem_function ();
 262
 263   inline virtual void init_wpa (void)
 264   {
 265     parse_tree_args ();
 266   }
 267
 268   virtual void init (void);
 269   virtual bool equals_wpa (sem_item *item,
 270                            hash_map <symtab_node *, sem_item *> &ignored_nodes);
 271   virtual hashval_t get_hash (void);
 272   virtual bool equals (sem_item *item,
 273                        hash_map <symtab_node *, sem_item *> &ignored_nodes);
 274   virtual bool merge (sem_item *alias_item);
 275
 276   /* Dump symbol to FILE.  */
 277   virtual void dump_to_file (FILE *file)
 278   {
 279     gcc_assert (file);
 280     dump_function_to_file (decl, file, TDF_DETAILS);
 281   }
 282
 283   /* Parses function arguments and result type.  */
 284   void parse_tree_args (void);
 285
 286   /* Returns cgraph_node.  */
 287   inline cgraph_node *get_node (void)
 288   {
 289     return dyn_cast <cgraph_node *> (node);
 290   }
 291
 292   /* Improve accumulated hash for HSTATE based on a gimple statement STMT.  */
 293   void hash_stmt (inchash::hash *inchash, gimple stmt);
 294
 295   /* Return true if polymorphic comparison must be processed.  */
 296   bool compare_polymorphic_p (void);
 297
 298   /* For a given call graph NODE, the function constructs new
 299      semantic function item.  */
 300   static sem_function *parse (cgraph_node *node, bitmap_obstack *stack);
 301
 302   /* Exception handling region tree.  */
 303   eh_region region_tree;
 304
 305   /* Result type tree node.  */
 306   tree result_type;
 307
 308   /* Array of argument tree types.  */
 309   vec <tree> arg_types;
 310
 311   /* Number of function arguments.  */
 312   unsigned int arg_count;
 313
 314   /* Total amount of edges in the function.  */
 315   unsigned int edge_count;
 316
 317   /* Vector of sizes of all basic blocks.  */
 318   vec <unsigned int> bb_sizes;
 319
 320   /* Control flow graph checksum.  */
 321   hashval_t cfg_checksum;
 322
 323   /* GIMPLE codes hash value.  */
 324   hashval_t gcode_hash;
 325
 326   /* Total number of SSA names used in the function.  */
 327   unsigned ssa_names_size;
 328
 329   /* Array of structures for all basic blocks.  */
 330   vec <ipa_icf_gimple::sem_bb *> bb_sorted;
 331
 332 private:
 333   /* Calculates hash value based on a BASIC_BLOCK.  */
 334   hashval_t get_bb_hash (const ipa_icf_gimple::sem_bb *basic_block);
 335
 336   /* For given basic blocks BB1 and BB2 (from functions FUNC1 and FUNC),
 337      true value is returned if phi nodes are semantically
 338      equivalent in these blocks .  */
 339   bool compare_phi_node (basic_block bb1, basic_block bb2);
 340
 341   /* Basic blocks dictionary BB_DICT returns true if SOURCE index BB
 342      corresponds to TARGET.  */
 343   bool bb_dict_test (vec<int> *bb_dict, int source, int target);
 344
 345   /* Iterates all tree types in T1 and T2 and returns true if all types
 346      are compatible. If COMPARE_POLYMORPHIC is set to true,
 347      more strict comparison is executed.  */
 348   bool compare_type_list (tree t1, tree t2, bool compare_polymorphic);
 349
 350   /* If cgraph edges E1 and E2 are indirect calls, verify that
 351      ICF flags are the same.  */
 352   bool compare_edge_flags (cgraph_edge *e1, cgraph_edge *e2);
 353
 354   /* For a given symbol table nodes N1 and N2, we check that FUNCTION_DECLs
 355      point to a same function. Comparison can be skipped if IGNORED_NODES
 356      contains these nodes.  */
 357   bool compare_cgraph_references (hash_map <symtab_node *, sem_item *>
 358                                   &ignored_nodes,
 359                                   symtab_node *n1, symtab_node *n2);
 360
 361   /* Processes function equality comparison.  */
 362   bool equals_private (sem_item *item,
 363                        hash_map <symtab_node *, sem_item *> &ignored_nodes);
 364
 365   /* Returns true if tree T can be compared as a handled component.  */
 366   static bool icf_handled_component_p (tree t);
 367
 368   /* Function checker stores binding between functions.   */
 369   ipa_icf_gimple::func_checker *m_checker;
 370
 371   /* COMPARED_FUNC is a function that we compare to.  */
 372   sem_function *m_compared_func;
 373 }; // class sem_function
 374
 375 class sem_variable: public sem_item
 376 {
 377 public:
 378   /* Semantic variable constructor that uses STACK as bitmap memory stack.  */
 379   sem_variable (bitmap_obstack *stack);
 380
 381   /*  Constructor based on callgraph node _NODE with computed hash _HASH.
 382       Bitmap STACK is used for memory allocation.  */
 383
 384   sem_variable (varpool_node *_node, hashval_t _hash, bitmap_obstack *stack);
 385
 386   inline virtual void init_wpa (void) {}
 387
 388   /* Semantic variable initialization function.  */
 389   inline virtual void init (void)
 390   {
 391     decl = get_node ()->decl;
 392     ctor = ctor_for_folding (decl);
 393   }
 394
 395   virtual hashval_t get_hash (void);
 396   virtual bool merge (sem_item *alias_item);
 397   virtual void dump_to_file (FILE *file);
 398   virtual bool equals (sem_item *item,
 399                        hash_map <symtab_node *, sem_item *> &ignored_nodes);
 400
 401   /* Fast equality variable based on knowledge known in WPA.  */
 402   inline virtual bool equals_wpa (sem_item *item,
 403                                   hash_map <symtab_node *, sem_item *> & ARG_UNUSED(ignored_nodes))
 404   {
 405     gcc_assert (item->type == VAR);
 406     return true;
 407   }
 408
 409   /* Returns varpool_node.  */
 410   inline varpool_node *get_node (void)
 411   {
 412     return dyn_cast <varpool_node *> (node);
 413   }
 414
 415   /* Parser function that visits a varpool NODE.  */
 416   static sem_variable *parse (varpool_node *node, bitmap_obstack *stack);
 417
 418   /* Variable constructor.  */
 419   tree ctor;
 420
 421 private:
 422   /* Iterates though a constructor and identifies tree references
 423      we are interested in semantic function equality.  */
 424   void parse_tree_refs (tree t);
 425
 426   /* Compares trees T1 and T2 for semantic equality.  */
 427   static bool equals (tree t1, tree t2);
 428
 429   /* Compare that symbol sections are either NULL or have same name.  */
 430   bool compare_sections (sem_variable *alias);
 431
 432 }; // class sem_variable
 433
 434 class sem_item_optimizer;
 435
 436 struct congruence_class_group
 437 {
 438   hashval_t hash;
 439   sem_item_type type;
 440   vec <congruence_class *> classes;
 441 };
 442
 443 /* Congruence class set structure.  */
 444 struct congruence_class_group_hash: typed_noop_remove <congruence_class_group>
 445 {
 446   typedef congruence_class_group value_type;
 447   typedef congruence_class_group compare_type;
 448
 449   static inline hashval_t hash (const value_type *item)
 450   {
 451     return item->hash;
 452   }
 453
 454   static inline int equal (const value_type *item1, const compare_type *item2)
 455   {
 456     return item1->hash == item2->hash && item1->type == item2->type;
 457   }
 458 };
 459
 460 struct traverse_split_pair
 461 {
 462   sem_item_optimizer *optimizer;
 463   class congruence_class *cls;
 464 };
 465
 466 /* Semantic item optimizer includes all top-level logic
 467    related to semantic equality comparison.  */
 468 class sem_item_optimizer
 469 {
 470 public:
 471   sem_item_optimizer ();
 472   ~sem_item_optimizer ();
 473
 474   /* Function responsible for visiting all potential functions and
 475      read-only variables that can be merged.  */
 476   void parse_funcs_and_vars (void);
 477
 478   /* Optimizer entry point.  */
 479   void execute (void);
 480
 481   /* Dump function. */
 482   void dump (void);
 483
 484   /* Verify congruence classes if checking is enabled.  */
 485   void verify_classes (void);
 486
 487   /* Write IPA ICF summary for symbols.  */
 488   void write_summary (void);
 489
 490   /* Read IPA IPA ICF summary for symbols.  */
 491   void read_summary (void);
 492
 493   /* Callgraph removal hook called for a NODE with a custom DATA.  */
 494   static void cgraph_removal_hook (cgraph_node *node, void *data);
 495
 496   /* Varpool removal hook called for a NODE with a custom DATA.  */
 497   static void varpool_removal_hook (varpool_node *node, void *data);
 498
 499   /* Worklist of congruence classes that can potentially
 500      refine classes of congruence.  */
 501   std::list<congruence_class *> worklist;
 502
 503   /* Remove semantic ITEM and release memory.  */
 504   void remove_item (sem_item *item);
 505
 506   /* Remove symtab NODE triggered by symtab removal hooks.  */
 507   void remove_symtab_node (symtab_node *node);
 508
 509   /* Register callgraph and varpool hooks.  */
 510   void register_hooks (void);
 511
 512   /* Unregister callgraph and varpool hooks.  */
 513   void unregister_hooks (void);
 514
 515   /* Adds a CLS to hashtable associated by hash value.  */
 516   void add_class (congruence_class *cls);
 517
 518   /* Gets a congruence class group based on given HASH value and TYPE.  */
 519   congruence_class_group *get_group_by_hash (hashval_t hash,
 520       sem_item_type type);
 521
 522 private:
 523
 524   /* Congruence classes are built by hash value.  */
 525   void build_hash_based_classes (void);
 526
 527   /* Semantic items in classes having more than one element and initialized.
 528      In case of WPA, we load function body.  */
 529   void parse_nonsingleton_classes (void);
 530
 531   /* Equality function for semantic items is used to subdivide existing
 532      classes. If IN_WPA, fast equality function is invoked.  */
 533   void subdivide_classes_by_equality (bool in_wpa = false);
 534
 535   /* Subdivide classes by address and interposable references
 536      that members of the class reference.
 537      Example can be a pair of functions that have an address
 538      taken from a function. If these addresses are different the class
 539      is split.  */
 540   unsigned subdivide_classes_by_sensitive_refs();
 541
 542   /* Debug function prints all informations about congruence classes.  */
 543   void dump_cong_classes (void);
 544
 545   /* Build references according to call graph.  */
 546   void build_graph (void);
 547
 548   /* Iterative congruence reduction function.  */
 549   void process_cong_reduction (void);
 550
 551   /* After reduction is done, we can declare all items in a group
 552      to be equal. PREV_CLASS_COUNT is start number of classes
 553      before reduction.  */
 554   void merge_classes (unsigned int prev_class_count);
 555
 556   /* Adds a newly created congruence class CLS to worklist.  */
 557   void worklist_push (congruence_class *cls);
 558
 559   /* Pops a class from worklist. */
 560   congruence_class *worklist_pop ();
 561
 562   /* Every usage of a congruence class CLS is a candidate that can split the
 563      collection of classes. Bitmap stack BMSTACK is used for bitmap
 564      allocation.  */
 565   void do_congruence_step (congruence_class *cls);
 566
 567   /* Tests if a class CLS used as INDEXth splits any congruence classes.
 568      Bitmap stack BMSTACK is used for bitmap allocation.  */
 569   void do_congruence_step_for_index (congruence_class *cls, unsigned int index);
 570
 571   /* Makes pairing between a congruence class CLS and semantic ITEM.  */
 572   static void add_item_to_class (congruence_class *cls, sem_item *item);
 573
 574   /* Disposes split map traverse function. CLS is congruence
 575      class, BSLOT is bitmap slot we want to release. DATA is mandatory,
 576      but unused argument.  */
 577   static bool release_split_map (congruence_class * const &cls, bitmap const &b,
 578                                  traverse_split_pair *pair);
 579
 580   /* Process split operation for a cognruence class CLS,
 581      where bitmap B splits congruence class members. DATA is used
 582      as argument of split pair.  */
 583   static bool traverse_congruence_split (congruence_class * const &cls,
 584                                          bitmap const &b,
 585                                          traverse_split_pair *pair);
 586
 587   /* Reads a section from LTO stream file FILE_DATA. Input block for DATA
 588      contains LEN bytes.  */
 589   void read_section (lto_file_decl_data *file_data, const char *data,
 590                      size_t len);
 591
 592   /* Removes all callgraph and varpool nodes that are marked by symtab
 593      as deleted.  */
 594   void filter_removed_items (void);
 595
 596   /* Vector of semantic items.  */
 597   vec <sem_item *> m_items;
 598
 599   /* A set containing all items removed by hooks.  */
 600   hash_set <symtab_node *> m_removed_items_set;
 601
 602   /* Hashtable of congruence classes */
 603   hash_table <congruence_class_group_hash> m_classes;
 604
 605   /* Count of congruence classes.  */
 606   unsigned int m_classes_count;
 607
 608   /* Map data structure maps symtab nodes to semantic items.  */
 609   hash_map <symtab_node *, sem_item *> m_symtab_node_map;
 610
 611   /* Set to true if a splitter class is removed.  */
 612   bool splitter_class_removed;
 613
 614   /* Global unique class id counter.  */
 615   static unsigned int class_id;
 616
 617   /* Callgraph node removal hook holder.  */
 618   cgraph_node_hook_list *m_cgraph_node_hooks;
 619
 620   /* Varpool node removal hook holder.  */
 621   varpool_node_hook_list *m_varpool_node_hooks;
 622
 623   /* Bitmap stack.  */
 624   bitmap_obstack m_bmstack;
 625 }; // class sem_item_optimizer
 626
 627 } // ipa_icf namespace