1035 tree_scc_hasher::hash (const tree_scc *scc)  in hash()  argument
1037   return scc->hash;  in hash()
1594 compare_tree_sccs (tree_scc *pscc, tree_scc *scc,  in compare_tree_sccs()  argument
1605       if (compare_tree_sccs_1 (pscc->entries[0], scc->entries[i], &mapp))  in compare_tree_sccs()
1613       for (unsigned j = 0; j < scc->len; ++j)  in compare_tree_sccs()
1614 	TREE_ASM_WRITTEN (scc->entries[j]) = 0;  in compare_tree_sccs()
1665   tree_scc *scc  in unify_scc()  local
1667   scc->next = NULL;  in unify_scc()
1668   scc->hash = scc_hash;  in unify_scc()
1669   scc->len = len;  in unify_scc()
1670   scc->entry_len = scc_entry_len;  in unify_scc()
1674       scc->entries[i] = t;  in unify_scc()
1689   slot = tree_scc_hash->find_slot_with_hash (scc, scc_hash, INSERT);  in unify_scc()
1701       for (unsigned i = 0; i < scc->len; ++i)  in unify_scc()
1703 	  TREE_VISITED (scc->entries[i]) = 1;  in unify_scc()
1704 	  gcc_checking_assert (!TREE_ASM_WRITTEN (scc->entries[i]));  in unify_scc()
1710 	  if (!compare_tree_sccs (pscc, scc, map))  in unify_scc()
1745 		  map2[i*2+1] = scc->entries[i];  in unify_scc()
1762 	      if (TYPE_P (scc->entries[i]))  in unify_scc()
1764 	      free_node (scc->entries[i]);  in unify_scc()
1777 	for (unsigned i = 0; i < scc->len; ++i)  in unify_scc()
1778 	  TREE_VISITED (scc->entries[i]) = 0;  in unify_scc()
1787       memcpy (pscc, scc, sizeof (tree_scc));  in unify_scc()
3007       tree_scc *scc, *max_scc = NULL;  in print_lto_report_1()  local
3009       FOR_EACH_HASH_TABLE_ELEMENT (*tree_scc_hash, scc, x, hiter)  in print_lto_report_1()
3012 	  tree_scc *s = scc;  in print_lto_report_1()
3018 	      max_scc = scc;  in print_lto_report_1()