1900   SmallVector<IVInc, 1> Incs;  member
1905       : Incs(1, Head), ExprBase(Base) {}  in IVChain()
1911     assert(!Incs.empty());  in begin()
1912     return std::next(Incs.begin());  in begin()
1915     return Incs.end();  in end()
1919   bool hasIncs() const { return Incs.size() >= 2; }  in hasIncs()
1922   void add(const IVInc &X) { Incs.push_back(X); }  in add()
1925   Instruction *tailUserInst() const { return Incs.back().UserInst; }  in tailUserInst()
2852     const SCEV *HeadExpr = SE.getSCEV(getWideOperand(Incs[0].IVOperand));  in isProfitableIncrement()
2882     LLVM_DEBUG(dbgs() << "Chain: " << *Chain.Incs[0].UserInst << " users:\n";  in isProfitableChain()
2887   assert(!Chain.Incs.empty() && "empty IV chains are not allowed");  in isProfitableChain()
2896       && SE.getSCEV(Chain.tailUserInst()) == Chain.Incs[0].IncExpr) {  in isProfitableChain()
2904   if (TTI.isProfitableLSRChainElement(Chain.Incs[0].UserInst))  in isProfitableChain()
2943   LLVM_DEBUG(dbgs() << "Chain: " << *Chain.Incs[0].UserInst << " Cost: " << cost  in isProfitableChain()
2972     Value *PrevIV = getWideOperand(Chain.Incs.back().IVOperand);  in ChainInstruction()
3039     IVChain::const_iterator IncIter = Chain.Incs.begin();  in ChainInstruction()
3040     IVChain::const_iterator IncEnd = Chain.Incs.end();  in ChainInstruction()
3152   assert(!Chain.Incs.empty() && "empty IV chains are not allowed");  in FinalizeChain()
3153   LLVM_DEBUG(dbgs() << "Final Chain: " << *Chain.Incs[0].UserInst << "\n");  in FinalizeChain()
3188   const IVInc &Head = Chain.Incs[0];  in GenerateIVChain()