Lines Matching defs:PointerOps
1631 /// \param PointerOps returned list of pointer operands.
1638 SmallVectorImpl<Value *> &PointerOps,
3762 SmallVectorImpl<Value *> &PointerOps);
4842 calculateRtStride(ArrayRef<Value *> PointerOps, Type *ElemTy,
4849 // Find lower/upper pointers from the PointerOps (i.e. with lowest and highest
4851 for (Value *Ptr : PointerOps) {
4941 SortedIndices.resize(PointerOps.size());
5035 SmallVectorImpl<Value *> &PointerOps,
5054 PointerOps.clear();
5056 PointerOps.resize(Sz);
5057 auto *POIter = PointerOps.begin();
5068 bool IsSorted = sortPtrAccesses(PointerOps, ScalarTy, *DL, *SE, Order);
5075 calculateRtStride(PointerOps, ScalarTy, *DL, *SE, Order))
5083 if (!all_of(PointerOps, [&](Value *P) {
5084 return arePointersCompatible(P, PointerOps.front(), *TLI);
5092 Ptr0 = PointerOps.front();
5093 PtrN = PointerOps.back();
5095 Ptr0 = PointerOps[Order.front()];
5096 PtrN = PointerOps[Order.back()];
5122 IsPossibleStrided && any_of(PointerOps, [&](Value *V) {
5144 for (Value *Ptr : PointerOps) {
5173 getGEPCosts(TTI, PointerOps, PointerOps.front(),
5179 getWidenedType(PointerOps.front()->getType()->getScalarType(),
5182 PointerOps, IsaPred<GetElementPtrInst>)) < PointerOps.size() - 1 ||
5183 any_of(PointerOps, [&](Value *V) {
5185 getUnderlyingObject(PointerOps.front());
5238 SmallVector<Value *> PointerOps;
5240 canVectorizeLoads(Slice, Slice.front(), Order, PointerOps, BestVF,
5280 : getGEPCosts(TTI, ArrayRef(PointerOps).slice(I * VF, VF),
5287 count_if(PointerOps, IsaPred<GetElementPtrInst>)) <
5288 PointerOps.size() - 1 ||
5289 any_of(PointerOps, [&](Value *V) {
5291 getUnderlyingObject(PointerOps.front());
5355 L && Sz > 2 && static_cast<unsigned>(count_if(PointerOps, [L](Value *V) {
5358 if (ProfitableGatherPointers || all_of(PointerOps, [](Value *P) {
5866 SmallVector<Value *> PointerOps;
5869 CurrentOrder, PointerOps);
7075 SmallVector<Value *> PointerOps;
7081 PointerOps, &BestVF);
7276 SmallVector<Value *> PointerOps;
7286 PointerOps) == LoadsState::Vectorize) {
7319 SmallVector<Value *> PointerOps;
7323 PointerOps) ==
7640 SmallVectorImpl<Value *> &PointerOps) {
7719 switch (canVectorizeLoads(VL, VL0, CurrentOrder, PointerOps)) {
7891 PointerOps.push_back(SI->getPointerOperand());
7895 if (llvm::sortPtrAccesses(PointerOps, ScalarTy, *DL, *SE, CurrentOrder)) {
7899 Ptr0 = PointerOps.front();
7900 PtrN = PointerOps.back();
7902 Ptr0 = PointerOps[CurrentOrder.front()];
7903 PtrN = PointerOps[CurrentOrder.back()];
8415 SmallVector<Value *> PointerOps;
8417 S, VL, IsScatterVectorizeUserTE, CurrentOrder, PointerOps);
8590 buildTree_rec(PointerOps, Depth + 1, {TE, 0});
9872 SmallVector<Value *> PointerOps;
9874 canVectorizeLoads(Slice, Slice.front(), Order, PointerOps);
11693 SmallVector<Value *> PointerOps(VL.size());
11695 PointerOps[I] = cast<LoadInst>(V)->getPointerOperand();
11696 return Cost + GetGEPCostDiff(PointerOps, LI0->getPointerOperand());
11737 SmallVector<Value *> PointerOps(VL.size());
11740 PointerOps[Idx] = cast<StoreInst>(V)->getPointerOperand();
11744 GetGEPCostDiff(PointerOps, BaseSI->getPointerOperand());
15873 SmallVector<Value *> PointerOps(E->Scalars.size(), nullptr);
15874 transform(E->Scalars, PointerOps.begin(), [](Value *V) {
15879 calculateRtStride(PointerOps, ScalarTy, *DL, *SE, Order,