| /external/llvm/lib/Analysis/ |
| D | VectorUtils.cpp | 322 MapVector<Instruction *, uint64_t> MinBWs; in computeMinimumValueSizes() local
349 return MinBWs; in computeMinimumValueSizes()
444 MinBWs[cast<Instruction>(*MI)] = MinBW; in computeMinimumValueSizes()
448 return MinBWs; in computeMinimumValueSizes()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | VectorUtils.cpp | 381 MapVector<Instruction *, uint64_t> MinBWs; in computeMinimumValueSizes() local
408 return MinBWs; in computeMinimumValueSizes()
503 MinBWs[cast<Instruction>(*MI)] = MinBW; in computeMinimumValueSizes()
507 return MinBWs; in computeMinimumValueSizes()
|
| /external/llvm-project/llvm/lib/Analysis/ |
| D | VectorUtils.cpp | 495 MapVector<Instruction *, uint64_t> MinBWs; in computeMinimumValueSizes() local
522 return MinBWs; in computeMinimumValueSizes()
617 MinBWs[cast<Instruction>(*MI)] = MinBW; in computeMinimumValueSizes()
621 return MinBWs; in computeMinimumValueSizes()
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | SLPVectorizer.cpp | 354 MinBWs.clear(); in deleteTree()
905 MapVector<Value *, uint64_t> MinBWs; member in llvm::slpvectorizer::BoUpSLP
1538 if (MinBWs.count(VL[0])) in getEntryCost()
1539 VecTy = VectorType::get(IntegerType::get(F->getContext(), MinBWs[VL[0]]), in getEntryCost()
1879 if (MinBWs.count(ScalarRoot)) { in getTreeCost()
1880 auto *MinTy = IntegerType::get(F->getContext(), MinBWs[ScalarRoot]); in getTreeCost()
2605 if (MinBWs.count(ScalarRoot)) { in vectorizeTree()
2609 auto *MinTy = IntegerType::get(F->getContext(), MinBWs[ScalarRoot]); in vectorizeTree()
2652 if (MinBWs.count(ScalarRoot)) in vectorizeTree()
2661 if (MinBWs.count(ScalarRoot)) in vectorizeTree()
[all …]
|
| D | LoopVectorize.cpp | 309 MinBWs = &MinimumBitWidths; in vectorize()
598 const MapVector<Instruction *, uint64_t> *MinBWs; member in __anonaac874760111::InnerLoopVectorizer
1699 MapVector<Instruction *, uint64_t> MinBWs; member in __anonaac874760111::LoopVectorizationCostModel
3359 for (const auto &KV : *MinBWs) { in truncateToMinimalBitwidths()
3451 for (const auto &KV : *MinBWs) { in truncateToMinimalBitwidths()
5189 MinBWs = computeMinimumValueSizes(TheLoop->getBlocks(), *DB, &TTI); in selectVectorizationFactor()
5817 if (VF > 1 && MinBWs.count(I)) in getInstructionCost()
5818 RetTy = IntegerType::get(RetTy->getContext(), MinBWs[I]); in getInstructionCost()
5911 auto It = MinBWs.find(Op0AsInstruction); in getInstructionCost()
5912 if (VF > 1 && It != MinBWs.end()) in getInstructionCost()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/ |
| D | SLPVectorizer.cpp | 604 MinBWs.clear(); in deleteTree()
2227 MapVector<Value *, std::pair<uint64_t, bool>> MinBWs; member in llvm::slpvectorizer::BoUpSLP
3228 if (MinBWs.count(VL[0])) in getEntryCost()
3230 IntegerType::get(F->getContext(), MinBWs[VL[0]].first), VL.size()); in getEntryCost()
3369 if (!MinBWs.count(VL0) || VecTy != SrcVecTy) { in getEntryCost()
3796 if (MinBWs.count(ScalarRoot)) { in getTreeCost()
3797 auto *MinTy = IntegerType::get(F->getContext(), MinBWs[ScalarRoot].first); in getTreeCost()
3799 MinBWs[ScalarRoot].second ? Instruction::SExt : Instruction::ZExt; in getTreeCost()
4599 if (MinBWs.count(ScalarRoot)) { in vectorizeTree()
4603 auto *MinTy = IntegerType::get(F->getContext(), MinBWs[ScalarRoot].first); in vectorizeTree()
[all …]
|
| D | LoopVectorize.cpp | 1037 return MinBWs; in getMinimalBitwidths()
1091 return VF > 1 && MinBWs.find(I) != MinBWs.end() && in canTruncateToMinimalBitwidth()
1379 MapVector<Instruction *, uint64_t> MinBWs; member in llvm::LoopVectorizationCostModel
5005 MinBWs = computeMinimumValueSizes(TheLoop->getBlocks(), *DB, &TTI); in computeFeasibleMaxVF()
6157 RetTy = IntegerType::get(RetTy->getContext(), MinBWs[I]); in getInstructionCost()
6303 ValTy = IntegerType::get(ValTy->getContext(), MinBWs[Op0AsInstruction]); in getInstructionCost()
|
| /external/llvm-project/llvm/lib/Transforms/Vectorize/ |
| D | SLPVectorizer.cpp | 617 MinBWs.clear(); in deleteTree()
2382 MapVector<Value *, std::pair<uint64_t, bool>> MinBWs; member in llvm::slpvectorizer::BoUpSLP
3429 if (MinBWs.count(VL[0])) in getEntryCost()
3431 IntegerType::get(F->getContext(), MinBWs[VL[0]].first), VL.size()); in getEntryCost()
3571 if (!MinBWs.count(VL0) || VecTy != SrcVecTy) { in getEntryCost()
4075 if (MinBWs.count(ScalarRoot)) { in getTreeCost()
4076 auto *MinTy = IntegerType::get(F->getContext(), MinBWs[ScalarRoot].first); in getTreeCost()
4078 MinBWs[ScalarRoot].second ? Instruction::SExt : Instruction::ZExt; in getTreeCost()
4863 if (MinBWs.count(ScalarRoot)) { in vectorizeTree()
4867 auto *MinTy = IntegerType::get(F->getContext(), MinBWs[ScalarRoot].first); in vectorizeTree()
[all …]
|
| D | LoopVectorize.cpp | 1299 return MinBWs; in getMinimalBitwidths()
1354 return VF.isVector() && MinBWs.find(I) != MinBWs.end() && in canTruncateToMinimalBitwidth()
1672 MapVector<Instruction *, uint64_t> MinBWs; member in llvm::LoopVectorizationCostModel
5555 MinBWs = computeMinimumValueSizes(TheLoop->getBlocks(), *DB, &TTI); in computeFeasibleMaxVF()
6923 RetTy = IntegerType::get(RetTy->getContext(), MinBWs[I]); in getInstructionCost()
7081 ValTy = IntegerType::get(ValTy->getContext(), MinBWs[Op0AsInstruction]); in getInstructionCost()
|