Lines Matching refs:PointerOps
3488 SmallVectorImpl<Value *> &PointerOps) { in canVectorizeLoads() argument
3502 PointerOps.clear(); in canVectorizeLoads()
3503 PointerOps.resize(VL.size()); in canVectorizeLoads()
3504 auto *POIter = PointerOps.begin(); in canVectorizeLoads()
3515 bool IsSorted = sortPtrAccesses(PointerOps, ScalarTy, DL, SE, Order); in canVectorizeLoads()
3516 if (IsSorted || all_of(PointerOps, [&PointerOps](Value *P) { in canVectorizeLoads()
3517 if (getUnderlyingObject(P) != getUnderlyingObject(PointerOps.front())) in canVectorizeLoads()
3522 auto *GEP0 = cast<GetElementPtrInst>(PointerOps.front()); in canVectorizeLoads()
3533 Ptr0 = PointerOps.front(); in canVectorizeLoads()
3534 PtrN = PointerOps.back(); in canVectorizeLoads()
3536 Ptr0 = PointerOps[Order.front()]; in canVectorizeLoads()
3537 PtrN = PointerOps[Order.back()]; in canVectorizeLoads()
3550 static_cast<unsigned>(count_if(PointerOps, [L](Value *V) { in canVectorizeLoads()
3553 if (ProfitableGatherPointers || all_of(PointerOps, [IsSorted](Value *P) { in canVectorizeLoads()
5003 SmallVector<Value *> PointerOps; in buildTree_rec() local
5007 PointerOps)) { in buildTree_rec()
5028 buildTree_rec(PointerOps, Depth + 1, {TE, 0}); in buildTree_rec()
5308 SmallVector<Value *, 4> PointerOps(VL.size()); in buildTree_rec() local
5310 auto POIter = PointerOps.begin(); in buildTree_rec()
5329 if (llvm::sortPtrAccesses(PointerOps, ScalarTy, *DL, *SE, CurrentOrder)) { in buildTree_rec()
5333 Ptr0 = PointerOps.front(); in buildTree_rec()
5334 PtrN = PointerOps.back(); in buildTree_rec()
5336 Ptr0 = PointerOps[CurrentOrder.front()]; in buildTree_rec()
5337 PtrN = PointerOps[CurrentOrder.back()]; in buildTree_rec()
6002 SmallVector<Value *> PointerOps; in getEntryCost() local
6006 CurrentOrder, PointerOps); in getEntryCost()