Searched refs:ScalarToTreeEntry (Results 1 – 3 of 3) sorted by relevance
345 ScalarToTreeEntry.clear(); in deleteTree()473 assert(!ScalarToTreeEntry.count(VL[i]) && "Scalar already in tree!"); in newTreeEntry()474 ScalarToTreeEntry[VL[i]] = idx; in newTreeEntry()487 SmallDenseMap<Value*, int> ScalarToTreeEntry; member in llvm::slpvectorizer::BoUpSLP939 if (ScalarToTreeEntry.count(U)) { in buildTree()940 int Idx = ScalarToTreeEntry[U]; in buildTree()1025 if (ScalarToTreeEntry.count(VL[0])) { in buildTree_rec()1026 int Idx = ScalarToTreeEntry[VL[0]]; in buildTree_rec()1042 if (ScalarToTreeEntry.count(VL[i])) { in buildTree_rec()1801 if (isa<Instruction>(&*J) && ScalarToTreeEntry.count(&*J)) in getSpillCost()[all …]
595 ScalarToTreeEntry.clear(); in deleteTree()1655 ScalarToTreeEntry[VL[i]] = Last; in newTreeEntry()1692 auto I = ScalarToTreeEntry.find(V); in getTreeEntry()1693 if (I != ScalarToTreeEntry.end()) in getTreeEntry()1699 auto I = ScalarToTreeEntry.find(V); in getTreeEntry()1700 if (I != ScalarToTreeEntry.end()) in getTreeEntry()1706 SmallDenseMap<Value*, TreeEntry *> ScalarToTreeEntry; member in llvm::slpvectorizer::BoUpSLP3212 return ScalarToTreeEntry.count(U) > 0; in areAllUsersVectorized()3257 !ScalarToTreeEntry.count(V)) { in getEntryCost()
608 ScalarToTreeEntry.clear(); in deleteTree()1794 ScalarToTreeEntry[V] = Last; in newTreeEntry()1831 auto I = ScalarToTreeEntry.find(V); in getTreeEntry()1832 if (I != ScalarToTreeEntry.end()) in getTreeEntry()1838 auto I = ScalarToTreeEntry.find(V); in getTreeEntry()1839 if (I != ScalarToTreeEntry.end()) in getTreeEntry()1845 SmallDenseMap<Value*, TreeEntry *> ScalarToTreeEntry; member in llvm::slpvectorizer::BoUpSLP3383 return ScalarToTreeEntry.count(U) > 0; in areAllUsersVectorized()3458 !ScalarToTreeEntry.count(V)) { in getEntryCost()