1677   SmallVector<LSRUse, 16> Uses;  member in __anonb19727160811::LSRInstance
2301     LSRUse &LU = Uses[LUIdx];  in getUse()
2308   size_t LUIdx = Uses.size();  in getUse()
2310   Uses.push_back(LSRUse(Kind, AccessTy));  in getUse()
2311   LSRUse &LU = Uses[LUIdx];  in getUse()
2325   if (&LU != &Uses.back())  in DeleteUse()
2326     std::swap(LU, Uses.back());  in DeleteUse()
2327   Uses.pop_back();  in DeleteUse()
2330   RegUses.SwapAndDropUse(LUIdx, Uses.size());  in DeleteUse()
2339   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in FindUseWithSimilarFormula()
2340     LSRUse &LU = Uses[LUIdx];  in FindUseWithSimilarFormula()
3041     LSRUse &LU = Uses[LF.LUIdx];  in CollectFixupsAndInitialFormulae()
3183         LSRUse &LU = Uses[LF.LUIdx];  in CollectLoopInvariantFixupsAndFormulae()
3190         CountRegisters(LU.Formulae.back(), Uses.size() - 1);  in CollectLoopInvariantFixupsAndFormulae()
3790     LSRUse &LU = Uses[LUIdx];  in GenerateCrossUseConstantOffsets()
3880   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in GenerateAllReuseFormulae()
3881     LSRUse &LU = Uses[LUIdx];  in GenerateAllReuseFormulae()
3887   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in GenerateAllReuseFormulae()
3888     LSRUse &LU = Uses[LUIdx];  in GenerateAllReuseFormulae()
3898   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in GenerateAllReuseFormulae()
3899     LSRUse &LU = Uses[LUIdx];  in GenerateAllReuseFormulae()
3927   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in FilterOutUndesirableDedicatedRegisters()
3928     LSRUse &LU = Uses[LUIdx];  in FilterOutUndesirableDedicatedRegisters()
4023   for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(),  in EstimateSearchSpaceComplexity()
4024        E = Uses.end(); I != E; ++I) {  in EstimateSearchSpaceComplexity()
4049     for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in NarrowSearchSpaceByDetectingSupersets()
4050       LSRUse &LU = Uses[LUIdx];  in NarrowSearchSpaceByDetectingSupersets()
4114   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4115     LSRUse &LU = Uses[LUIdx];  in NarrowSearchSpaceByCollapsingUnrolledCode()
4139           Fixup.LUIdx = LUThatHas - &Uses.front();  in NarrowSearchSpaceByCollapsingUnrolledCode()
4171         LUThatHas->RecomputeRegs(LUThatHas - &Uses.front(), RegUses);  in NarrowSearchSpaceByCollapsingUnrolledCode()
4240     for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in NarrowSearchSpaceByPickingWinnerRegs()
4241       LSRUse &LU = Uses[LUIdx];  in NarrowSearchSpaceByPickingWinnerRegs()
4295   const LSRUse &LU = Uses[Workspace.size()];  in SolveRecurse()
4341       if (Workspace.size() != Uses.size()) {  in SolveRecurse()
4370   Workspace.reserve(Uses.size());  in Solve()
4384         for (size_t i = 0, e = Uses.size(); i != e; ++i) {  in Solve()
4386           Uses[i].print(dbgs());  in Solve()
4393   assert(Solution.size() == Uses.size() && "Malformed solution!");  in Solve()
4523   const LSRUse &LU = Uses[LF.LUIdx];  in Expand()
4807     if (Uses[LF.LUIdx].Kind == LSRUse::ICmpZero)  in Rewrite()
4928   assert(!Uses.empty() && "IVUsers reported at least one use");  in LSRInstance()
4929   DEBUG(dbgs() << "LSR found " << Uses.size() << " uses:\n";  in LSRInstance()
4952   for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(), E = Uses.end();  in LSRInstance()
5001   for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(),  in print_uses()
5002        E = Uses.end(); I != E; ++I) {  in print_uses()