Lines Matching refs:CandidateTys

2174                              SmallVectorImpl<VectorType *> &CandidateTys,  in checkVectorTypesForPromotion()  argument
2179 if (CandidateTys.empty()) in checkVectorTypesForPromotion()
2192 CandidateTys.clear(); in checkVectorTypesForPromotion()
2193 CandidateTys.push_back(CommonVecPtrTy); in checkVectorTypesForPromotion()
2196 for (VectorType *&VTy : CandidateTys) { in checkVectorTypesForPromotion()
2228 llvm::sort(CandidateTys, RankVectorTypesComp); in checkVectorTypesForPromotion()
2229 CandidateTys.erase(std::unique(CandidateTys.begin(), CandidateTys.end(), in checkVectorTypesForPromotion()
2231 CandidateTys.end()); in checkVectorTypesForPromotion()
2236 for (VectorType *VTy : CandidateTys) { in checkVectorTypesForPromotion()
2239 assert(VTy == CandidateTys[0] && in checkVectorTypesForPromotion()
2243 CandidateTys.resize(1); in checkVectorTypesForPromotion()
2248 llvm::erase_if(CandidateTys, [](VectorType *VTy) { in checkVectorTypesForPromotion()
2253 for (VectorType *VTy : CandidateTys) in checkVectorTypesForPromotion()
2263 const DataLayout &DL, SmallVectorImpl<VectorType *> &CandidateTys, in createAndCheckVectorTypesForPromotion() argument
2290 return checkVectorTypesForPromotion(P, DL, CandidateTys, HaveCommonEltTy, in createAndCheckVectorTypesForPromotion()
2307 SmallVector<VectorType *, 4> CandidateTys; in isVectorPromotionViable() local
2318 if (!CandidateTys.empty()) { in isVectorPromotionViable()
2319 VectorType *V = CandidateTys[0]; in isVectorPromotionViable()
2322 CandidateTys.clear(); in isVectorPromotionViable()
2326 CandidateTys.push_back(VTy); in isVectorPromotionViable()
2367 SmallVector<VectorType *, 4> CandidateTysCopy = CandidateTys; in isVectorPromotionViable()
2370 CandidateTys, HaveCommonEltTy, CommonEltTy, HaveVecPtrTy, in isVectorPromotionViable()
2374 CandidateTys.clear(); in isVectorPromotionViable()
2376 DeferredTys, CandidateTysCopy, CheckCandidateType, P, DL, CandidateTys, in isVectorPromotionViable()