Home
last modified time | relevance | path

Searched refs:PairMap (Results 1 – 4 of 4) sorted by relevance

/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonSplitDouble.cpp642 assert(F != PairMap.end()); in splitMemRef()
706 assert(F != PairMap.end()); in splitImmediate()
733 assert(F != PairMap.end()); in splitCombine()
762 assert(F != PairMap.end()); in splitExt()
786 assert(F != PairMap.end()); in splitShift()
911 assert(F != PairMap.end()); in splitAslOr()
1049 splitExt(MI, PairMap); in splitInstr()
1056 splitShift(MI, PairMap); in splitInstr()
1080 if (F == PairMap.end()) in replaceSubregUses()
1109 if (F == PairMap.end()) in collapseRegPairs()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Scalar/
H A DReassociate.h92 DenseMap<std::pair<Value *, Value *>, PairMapValue> PairMap[NumBinaryOps]; variable
/llvm-project-15.0.7/llvm/test/Transforms/Reassociate/
H A Dpointer-collision-non-determinism.ll5 ; The PairMap[NumBinaryOps] used by the Reassociate pass used to have Value
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp2432 auto it = PairMap[Idx].find({Op0, Op1}); in ReassociateExpression()
2433 if (it != PairMap[Idx].end()) { in ReassociateExpression()
2510 auto res = PairMap[BinaryIdx].insert({{Op0, Op1}, {Op0, Op1, 1}}); in BuildPairMap()
2591 for (auto &Entry : PairMap) in run()