Lines Matching refs:Cnt

511   for (int Cnt = 0, E = VL.size(); Cnt < E; Cnt++) {  in getSameOpcode()  local
512 unsigned InstOpcode = cast<Instruction>(VL[Cnt])->getOpcode(); in getSameOpcode()
513 if (IsBinOp && isa<BinaryOperator>(VL[Cnt])) { in getSameOpcode()
519 AltIndex = Cnt; in getSameOpcode()
522 } else if (IsCastOp && isa<CastInst>(VL[Cnt])) { in getSameOpcode()
524 Type *Ty1 = cast<Instruction>(VL[Cnt])->getOperand(0)->getType(); in getSameOpcode()
533 AltIndex = Cnt; in getSameOpcode()
537 } else if (IsCmpOp && isa<CmpInst>(VL[Cnt])) { in getSameOpcode()
539 auto *Inst = cast<Instruction>(VL[Cnt]); in getSameOpcode()
548 cast<CmpInst>(VL[Cnt])->getPredicate(); in getSameOpcode()
579 AltIndex = Cnt; in getSameOpcode()
1998 unsigned Cnt = 0; in print() local
2000 OS << "Operand " << Cnt++ << "\n"; in print()
3584 unsigned Cnt = 1; in clusterSortPtrAccesses() local
3593 Base.second.emplace_back(Ptr, *Diff, Cnt++); in clusterSortPtrAccesses()
3603 Bases[Ptr].emplace_back(Ptr, 0, Cnt++); in clusterSortPtrAccesses()
3768 unsigned Cnt = 0; in reorderTopToBottom() local
3770 while (UserTE && Cnt < RecursionMaxDepth) { in reorderTopToBottom()
3779 ++Cnt; in reorderTopToBottom()
3854 unsigned Cnt = OrdersUses.front().second; in reorderTopToBottom() local
3856 if (Cnt < Pair.second || (Cnt == Pair.second && Pair.first.empty())) { in reorderTopToBottom()
3858 Cnt = Pair.second; in reorderTopToBottom()
4139 unsigned Cnt = OrdersUses.front().second; in reorderBottomToTop() local
4141 if (Cnt < Pair.second || (Cnt == Pair.second && Pair.first.empty())) { in reorderBottomToTop()
4143 Cnt = Pair.second; in reorderBottomToTop()
5997 for (unsigned Cnt = StartIdx, End = VL.size(); Cnt + VF <= End; in getEntryCost() local
5998 Cnt += VF) { in getEntryCost()
5999 ArrayRef<Value *> Slice = VL.slice(Cnt, VF); in getEntryCost()
6019 if (Cnt == StartIdx) in getEntryCost()
10171 for (int Cnt = E; Cnt > 0; --Cnt) { in vectorizeStores() local
10172 int I = Cnt - 1; in vectorizeStores()
10190 if (Cnt < ConsecutiveChain[I].first + 2) in vectorizeStores()
10191 Cnt = ConsecutiveChain[I].first + 2; in vectorizeStores()
10218 for (unsigned Cnt = StartIdx, E = Operands.size(); Cnt + Size <= E;) { in vectorizeStores() local
10219 ArrayRef<Value *> Slice = makeArrayRef(Operands).slice(Cnt, Size); in vectorizeStores()
10222 vectorizeStoreChain(Slice, R, Cnt, MinVF)) { in vectorizeStores()
10228 if (Cnt == StartIdx) in vectorizeStores()
10230 Cnt += Size; in vectorizeStores()
10233 ++Cnt; in vectorizeStores()
11058 for (unsigned Cnt = 0, Sz = OrigReducedVals.size(); Cnt < Sz; ++Cnt) { in tryToReduce() local
11059 Value *RdxVal = TrackedVals.find(OrigReducedVals[Cnt])->second; in tryToReduce()
11068 TrackedToOrig.try_emplace(RdxVal, OrigReducedVals[Cnt]); in tryToReduce()
11172 for (unsigned Cnt = 0, Sz = ReducedVals.size(); Cnt < Sz; ++Cnt) { in tryToReduce() local
11173 if (Cnt == I || (ShuffledExtracts && Cnt == I - 1)) in tryToReduce()
11175 for_each(ReducedVals[Cnt], in tryToReduce()
11183 for (unsigned Cnt = 0; Cnt < Pos; ++Cnt) { in tryToReduce() local
11184 Value *V = Candidates[Cnt]; in tryToReduce()
11189 for (unsigned Cnt = Pos + ReduxWidth; Cnt < NumReducedVals; ++Cnt) { in tryToReduce() local
11190 Value *V = Candidates[Cnt]; in tryToReduce()
11197 for (unsigned Cnt = 0; Cnt < Pos; ++Cnt) { in tryToReduce() local
11198 Value *V = Candidates[Cnt]; in tryToReduce()
11205 for (unsigned Cnt = Pos + ReduxWidth; Cnt < NumReducedVals; ++Cnt) { in tryToReduce() local
11206 Value *V = Candidates[Cnt]; in tryToReduce()