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_int (v->m_references[i]->ultimate_alias_target ()->order);
 100
 101     hstate.add_int (v->m_interposables.length ());
 102
 103     for (unsigned i = 0; i < v->m_interposables.length (); i++)
 104       hstate.add_int (v->m_interposables[i]->ultimate_alias_target ()->order);
 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   /* Fast equality function based on knowledge known in WPA.  */
 175   virtual bool equals_wpa (sem_item *item,
 176                            hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
 177
 178   /* Returns true if the item equals to ITEM given as arguemnt.  */
 179   virtual bool equals (sem_item *item,
 180                        hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
 181
 182   /* References independent hash function.  */
 183   virtual hashval_t get_hash (void) = 0;
 184
 185   /* Merges instance with an ALIAS_ITEM, where alias, thunk or redirection can
 186      be applied.  */
 187   virtual bool merge (sem_item *alias_item) = 0;
 188
 189   /* Dump symbol to FILE.  */
 190   virtual void dump_to_file (FILE *file) = 0;
 191
 192   /* Update hash by address sensitive references.  */
 193   void update_hash_by_addr_refs (hash_map <symtab_node *,
 194                                  sem_item *> &m_symtab_node_map);
 195
 196   /* Update hash by computed local hash values taken from different
 197      semantic items.  */
 198   void update_hash_by_local_refs (hash_map <symtab_node *,
 199                                   sem_item *> &m_symtab_node_map);
 200
 201   /* Return base tree that can be used for compatible_types_p and
 202      contains_polymorphic_type_p comparison.  */
 203   static bool get_base_types (tree *t1, tree *t2);
 204
 205   /* Return true if target supports alias symbols.  */
 206   bool target_supports_symbol_aliases_p (void);
 207
 208   /* Item type.  */
 209   sem_item_type type;
 210
 211   /* Symtab node.  */
 212   symtab_node *node;
 213
 214   /* Declaration tree node.  */
 215   tree decl;
 216
 217   /* Semantic references used that generate congruence groups.  */
 218   vec <sem_item *> refs;
 219
 220   /* Pointer to a congruence class the item belongs to.  */
 221   congruence_class *cls;
 222
 223   /* Index of the item in a class belonging to.  */
 224   unsigned int index_in_class;
 225
 226   /* List of semantic items where the instance is used.  */
 227   vec <sem_usage_pair *> usages;
 228
 229   /* A bitmap with indices of all classes referencing this item.  */
 230   bitmap usage_index_bitmap;
 231
 232   /* List of tree references (either FUNC_DECL or VAR_DECL).  */
 233   vec <tree> tree_refs;
 234
 235   /* A set with symbol table references.  */
 236   hash_set <symtab_node *> refs_set;
 237
 238   /* Hash of item.  */
 239   hashval_t hash;
 240
 241   /* Temporary hash used where hash values of references are added.  */
 242   hashval_t global_hash;
 243 protected:
 244   /* Cached, once calculated hash for the item.  */
 245
 246   /* Accumulate to HSTATE a hash of expression EXP.  */
 247   static void add_expr (const_tree exp, inchash::hash &hstate);
 248   /* Accumulate to HSTATE a hash of type T.  */
 249   static void add_type (const_tree t, inchash::hash &hstate);
 250
 251   /* Compare properties of symbol that does not affect semantics of symbol
 252      itself but affects semantics of its references.
 253      If ADDRESS is true, do extra checking needed for IPA_REF_ADDR.  */
 254   static bool compare_referenced_symbol_properties (symtab_node *used_by,
 255                                                     symtab_node *n1,
 256                                                     symtab_node *n2,
 257                                                     bool address);
 258
 259   /* Compare two attribute lists.  */
 260   static bool compare_attributes (const_tree list1, const_tree list2);
 261
 262   /* Hash properties compared by compare_referenced_symbol_properties.  */
 263   void hash_referenced_symbol_properties (symtab_node *ref,
 264                                           inchash::hash &hstate,
 265                                           bool address);
 266
 267   /* For a given symbol table nodes N1 and N2, we check that FUNCTION_DECLs
 268      point to a same function. Comparison can be skipped if IGNORED_NODES
 269      contains these nodes.  ADDRESS indicate if address is taken.  */
 270   bool compare_symbol_references (hash_map <symtab_node *, sem_item *>
 271                                   &ignored_nodes,
 272                                   symtab_node *n1, symtab_node *n2,
 273                                   bool address);
 274
 275 private:
 276   /* Initialize internal data structures. Bitmap STACK is used for
 277      bitmap memory allocation process.  */
 278   void setup (bitmap_obstack *stack);
 279 }; // class sem_item
 280
 281 class sem_function: public sem_item
 282 {
 283 public:
 284   /* Semantic function constructor that uses STACK as bitmap memory stack.  */
 285   sem_function (bitmap_obstack *stack);
 286
 287   /*  Constructor based on callgraph node _NODE with computed hash _HASH.
 288       Bitmap STACK is used for memory allocation.  */
 289   sem_function (cgraph_node *_node, hashval_t _hash, bitmap_obstack *stack);
 290
 291   ~sem_function ();
 292
 293   inline virtual void init_wpa (void)
 294   {
 295     parse_tree_args ();
 296   }
 297
 298   virtual void init (void);
 299   virtual bool equals_wpa (sem_item *item,
 300                            hash_map <symtab_node *, sem_item *> &ignored_nodes);
 301   virtual hashval_t get_hash (void);
 302   virtual bool equals (sem_item *item,
 303                        hash_map <symtab_node *, sem_item *> &ignored_nodes);
 304   virtual bool merge (sem_item *alias_item);
 305
 306   /* Dump symbol to FILE.  */
 307   virtual void dump_to_file (FILE *file)
 308   {
 309     gcc_assert (file);
 310     dump_function_to_file (decl, file, TDF_DETAILS);
 311   }
 312
 313   /* Parses function arguments and result type.  */
 314   void parse_tree_args (void);
 315
 316   /* Returns cgraph_node.  */
 317   inline cgraph_node *get_node (void)
 318   {
 319     return dyn_cast <cgraph_node *> (node);
 320   }
 321
 322   /* Improve accumulated hash for HSTATE based on a gimple statement STMT.  */
 323   void hash_stmt (gimple stmt, inchash::hash &inchash);
 324
 325   /* Return true if polymorphic comparison must be processed.  */
 326   bool compare_polymorphic_p (void);
 327
 328   /* For a given call graph NODE, the function constructs new
 329      semantic function item.  */
 330   static sem_function *parse (cgraph_node *node, bitmap_obstack *stack);
 331
 332   /* Exception handling region tree.  */
 333   eh_region region_tree;
 334
 335   /* Result type tree node.  */
 336   tree result_type;
 337
 338   /* Array of argument tree types.  */
 339   vec <tree> arg_types;
 340
 341   /* Number of function arguments.  */
 342   unsigned int arg_count;
 343
 344   /* Total amount of edges in the function.  */
 345   unsigned int edge_count;
 346
 347   /* Vector of sizes of all basic blocks.  */
 348   vec <unsigned int> bb_sizes;
 349
 350   /* Control flow graph checksum.  */
 351   hashval_t cfg_checksum;
 352
 353   /* GIMPLE codes hash value.  */
 354   hashval_t gcode_hash;
 355
 356   /* Total number of SSA names used in the function.  */
 357   unsigned ssa_names_size;
 358
 359   /* Array of structures for all basic blocks.  */
 360   vec <ipa_icf_gimple::sem_bb *> bb_sorted;
 361
 362   /* Return true if parameter I may be used.  */
 363   bool param_used_p (unsigned int i);
 364
 365 private:
 366   /* Calculates hash value based on a BASIC_BLOCK.  */
 367   hashval_t get_bb_hash (const ipa_icf_gimple::sem_bb *basic_block);
 368
 369   /* For given basic blocks BB1 and BB2 (from functions FUNC1 and FUNC),
 370      true value is returned if phi nodes are semantically
 371      equivalent in these blocks .  */
 372   bool compare_phi_node (basic_block bb1, basic_block bb2);
 373
 374   /* Basic blocks dictionary BB_DICT returns true if SOURCE index BB
 375      corresponds to TARGET.  */
 376   bool bb_dict_test (vec<int> *bb_dict, int source, int target);
 377
 378   /* If cgraph edges E1 and E2 are indirect calls, verify that
 379      ICF flags are the same.  */
 380   bool compare_edge_flags (cgraph_edge *e1, cgraph_edge *e2);
 381
 382   /* Processes function equality comparison.  */
 383   bool equals_private (sem_item *item);
 384
 385   /* Returns true if tree T can be compared as a handled component.  */
 386   static bool icf_handled_component_p (tree t);
 387
 388   /* Function checker stores binding between functions.   */
 389   ipa_icf_gimple::func_checker *m_checker;
 390
 391   /* COMPARED_FUNC is a function that we compare to.  */
 392   sem_function *m_compared_func;
 393 }; // class sem_function
 394
 395 class sem_variable: public sem_item
 396 {
 397 public:
 398   /* Semantic variable constructor that uses STACK as bitmap memory stack.  */
 399   sem_variable (bitmap_obstack *stack);
 400
 401   /*  Constructor based on callgraph node _NODE with computed hash _HASH.
 402       Bitmap STACK is used for memory allocation.  */
 403
 404   sem_variable (varpool_node *_node, hashval_t _hash, bitmap_obstack *stack);
 405
 406   inline virtual void init_wpa (void) {}
 407
 408   /* Semantic variable initialization function.  */
 409   inline virtual void init (void)
 410   {
 411     decl = get_node ()->decl;
 412   }
 413
 414   virtual hashval_t get_hash (void);
 415   virtual bool merge (sem_item *alias_item);
 416   virtual void dump_to_file (FILE *file);
 417   virtual bool equals (sem_item *item,
 418                        hash_map <symtab_node *, sem_item *> &ignored_nodes);
 419
 420   /* Fast equality variable based on knowledge known in WPA.  */
 421   virtual bool equals_wpa (sem_item *item,
 422                            hash_map <symtab_node *, sem_item *> &ignored_nodes);
 423
 424   /* Returns varpool_node.  */
 425   inline varpool_node *get_node (void)
 426   {
 427     return dyn_cast <varpool_node *> (node);
 428   }
 429
 430   /* Parser function that visits a varpool NODE.  */
 431   static sem_variable *parse (varpool_node *node, bitmap_obstack *stack);
 432
 433 private:
 434   /* Compares trees T1 and T2 for semantic equality.  */
 435   static bool equals (tree t1, tree t2);
 436 }; // class sem_variable
 437
 438 class sem_item_optimizer;
 439
 440 struct congruence_class_group
 441 {
 442   hashval_t hash;
 443   sem_item_type type;
 444   vec <congruence_class *> classes;
 445 };
 446
 447 /* Congruence class set structure.  */
 448 struct congruence_class_group_hash: typed_noop_remove <congruence_class_group>
 449 {
 450   typedef congruence_class_group *value_type;
 451   typedef congruence_class_group *compare_type;
 452
 453   static inline hashval_t hash (const congruence_class_group *item)
 454   {
 455     return item->hash;
 456   }
 457
 458   static inline int equal (const congruence_class_group *item1,
 459                            const congruence_class_group *item2)
 460   {
 461     return item1->hash == item2->hash && item1->type == item2->type;
 462   }
 463 };
 464
 465 struct traverse_split_pair
 466 {
 467   sem_item_optimizer *optimizer;
 468   class congruence_class *cls;
 469 };
 470
 471 /* Semantic item optimizer includes all top-level logic
 472    related to semantic equality comparison.  */
 473 class sem_item_optimizer
 474 {
 475 public:
 476   sem_item_optimizer ();
 477   ~sem_item_optimizer ();
 478
 479   /* Function responsible for visiting all potential functions and
 480      read-only variables that can be merged.  */
 481   void parse_funcs_and_vars (void);
 482
 483   /* Optimizer entry point which returns true in case it processes
 484      a merge operation. True is returned if there's a merge operation
 485      processed.  */
 486   bool execute (void);
 487
 488   /* Dump function. */
 489   void dump (void);
 490
 491   /* Verify congruence classes if checking is enabled.  */
 492   void verify_classes (void);
 493
 494   /* Write IPA ICF summary for symbols.  */
 495   void write_summary (void);
 496
 497   /* Read IPA IPA ICF summary for symbols.  */
 498   void read_summary (void);
 499
 500   /* Callgraph removal hook called for a NODE with a custom DATA.  */
 501   static void cgraph_removal_hook (cgraph_node *node, void *data);
 502
 503   /* Varpool removal hook called for a NODE with a custom DATA.  */
 504   static void varpool_removal_hook (varpool_node *node, void *data);
 505
 506   /* Worklist of congruence classes that can potentially
 507      refine classes of congruence.  */
 508   std::list<congruence_class *> worklist;
 509
 510   /* Remove semantic ITEM and release memory.  */
 511   void remove_item (sem_item *item);
 512
 513   /* Remove symtab NODE triggered by symtab removal hooks.  */
 514   void remove_symtab_node (symtab_node *node);
 515
 516   /* Register callgraph and varpool hooks.  */
 517   void register_hooks (void);
 518
 519   /* Unregister callgraph and varpool hooks.  */
 520   void unregister_hooks (void);
 521
 522   /* Adds a CLS to hashtable associated by hash value.  */
 523   void add_class (congruence_class *cls);
 524
 525   /* Gets a congruence class group based on given HASH value and TYPE.  */
 526   congruence_class_group *get_group_by_hash (hashval_t hash,
 527       sem_item_type type);
 528
 529   /* Because types can be arbitrarily large, avoid quadratic bottleneck.  */
 530   hash_map<const_tree, hashval_t> m_type_hash_cache;
 531 private:
 532
 533   /* For each semantic item, append hash values of references.  */
 534   void update_hash_by_addr_refs ();
 535
 536   /* Congruence classes are built by hash value.  */
 537   void build_hash_based_classes (void);
 538
 539   /* Semantic items in classes having more than one element and initialized.
 540      In case of WPA, we load function body.  */
 541   void parse_nonsingleton_classes (void);
 542
 543   /* Equality function for semantic items is used to subdivide existing
 544      classes. If IN_WPA, fast equality function is invoked.  */
 545   void subdivide_classes_by_equality (bool in_wpa = false);
 546
 547   /* Subdivide classes by address and interposable references
 548      that members of the class reference.
 549      Example can be a pair of functions that have an address
 550      taken from a function. If these addresses are different the class
 551      is split.  */
 552   unsigned subdivide_classes_by_sensitive_refs();
 553
 554   /* Debug function prints all informations about congruence classes.  */
 555   void dump_cong_classes (void);
 556
 557   /* Build references according to call graph.  */
 558   void build_graph (void);
 559
 560   /* Iterative congruence reduction function.  */
 561   void process_cong_reduction (void);
 562
 563   /* After reduction is done, we can declare all items in a group
 564      to be equal. PREV_CLASS_COUNT is start number of classes
 565      before reduction. True is returned if there's a merge operation
 566      processed.  */
 567   bool merge_classes (unsigned int prev_class_count);
 568
 569   /* Adds a newly created congruence class CLS to worklist.  */
 570   void worklist_push (congruence_class *cls);
 571
 572   /* Pops a class from worklist. */
 573   congruence_class *worklist_pop ();
 574
 575   /* Every usage of a congruence class CLS is a candidate that can split the
 576      collection of classes. Bitmap stack BMSTACK is used for bitmap
 577      allocation.  */
 578   void do_congruence_step (congruence_class *cls);
 579
 580   /* Tests if a class CLS used as INDEXth splits any congruence classes.
 581      Bitmap stack BMSTACK is used for bitmap allocation.  */
 582   void do_congruence_step_for_index (congruence_class *cls, unsigned int index);
 583
 584   /* Makes pairing between a congruence class CLS and semantic ITEM.  */
 585   static void add_item_to_class (congruence_class *cls, sem_item *item);
 586
 587   /* Disposes split map traverse function. CLS is congruence
 588      class, BSLOT is bitmap slot we want to release. DATA is mandatory,
 589      but unused argument.  */
 590   static bool release_split_map (congruence_class * const &cls, bitmap const &b,
 591                                  traverse_split_pair *pair);
 592
 593   /* Process split operation for a cognruence class CLS,
 594      where bitmap B splits congruence class members. DATA is used
 595      as argument of split pair.  */
 596   static bool traverse_congruence_split (congruence_class * const &cls,
 597                                          bitmap const &b,
 598                                          traverse_split_pair *pair);
 599
 600   /* Reads a section from LTO stream file FILE_DATA. Input block for DATA
 601      contains LEN bytes.  */
 602   void read_section (lto_file_decl_data *file_data, const char *data,
 603                      size_t len);
 604
 605   /* Removes all callgraph and varpool nodes that are marked by symtab
 606      as deleted.  */
 607   void filter_removed_items (void);
 608
 609   /* Vector of semantic items.  */
 610   vec <sem_item *> m_items;
 611
 612   /* A set containing all items removed by hooks.  */
 613   hash_set <symtab_node *> m_removed_items_set;
 614
 615   /* Hashtable of congruence classes */
 616   hash_table <congruence_class_group_hash> m_classes;
 617
 618   /* Count of congruence classes.  */
 619   unsigned int m_classes_count;
 620
 621   /* Map data structure maps symtab nodes to semantic items.  */
 622   hash_map <symtab_node *, sem_item *> m_symtab_node_map;
 623
 624   /* Set to true if a splitter class is removed.  */
 625   bool splitter_class_removed;
 626
 627   /* Global unique class id counter.  */
 628   static unsigned int class_id;
 629
 630   /* Callgraph node removal hook holder.  */
 631   cgraph_node_hook_list *m_cgraph_node_hooks;
 632
 633   /* Varpool node removal hook holder.  */
 634   varpool_node_hook_list *m_varpool_node_hooks;
 635
 636   /* Bitmap stack.  */
 637   bitmap_obstack m_bmstack;
 638 }; // class sem_item_optimizer
 639
 640 } // ipa_icf namespace