86   for (auto &[Index, Hash] : Func.IndexOperandHashes)  in insert()
87     (*IndexOperandHashMap)[Index] = Hash;  in insert()
89       Func.Hash, FuncNameId, ModuleNameId, Func.InstCount,  in insert()
96   for (auto &[Hash, Funcs] : OtherMap.HashToFuncs) {  in merge()
97     auto &ThisFuncs = HashToFuncs[Hash];  in merge()
106           Func->Hash, FuncNameId, ModuleNameId, Func->InstCount,  in merge()
124     for (auto &[Hash, Funcs] : HashToFuncs)  in size()
140   for (auto &[Pair, Hash] : *(RSF->IndexOperandHashMap)) {  in removeIdenticalIndexPair()
145       if (Hash != SHash) {  in removeIdenticalIndexPair()
177     for (auto &[IndexPair, Hash] : *SF->IndexOperandHashMap)  in isProfitable()
178       UniqueHashVals.insert(Hash);  in isProfitable()
196   LLVM_DEBUG(dbgs() << "isProfitable: Hash = " << SFS[0]->Hash << ", "  in isProfitable()
221       assert(RSF->Hash == SF->Hash);  in finalize()