1666   SmallVector<LSRUse, 16> Uses;  member in __anonb19727160811::LSRInstance
2286     LSRUse &LU = Uses[LUIdx];  in getUse()
2293   size_t LUIdx = Uses.size();  in getUse()
2295   Uses.push_back(LSRUse(Kind, AccessTy));  in getUse()
2296   LSRUse &LU = Uses[LUIdx];  in getUse()
2310   if (&LU != &Uses.back())  in DeleteUse()
2311     std::swap(LU, Uses.back());  in DeleteUse()
2312   Uses.pop_back();  in DeleteUse()
2315   RegUses.swapAndDropUse(LUIdx, Uses.size());  in DeleteUse()
2324   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in FindUseWithSimilarFormula()
2325     LSRUse &LU = Uses[LUIdx];  in FindUseWithSimilarFormula()
3016     LSRUse &LU = Uses[LF.LUIdx];  in CollectFixupsAndInitialFormulae()
3159         LSRUse &LU = Uses[LF.LUIdx];  in CollectLoopInvariantFixupsAndFormulae()
3166         CountRegisters(LU.Formulae.back(), Uses.size() - 1);  in CollectLoopInvariantFixupsAndFormulae()
3742     LSRUse &LU = Uses[LUIdx];  in GenerateCrossUseConstantOffsets()
3829   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in GenerateAllReuseFormulae()
3830     LSRUse &LU = Uses[LUIdx];  in GenerateAllReuseFormulae()
3836   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in GenerateAllReuseFormulae()
3837     LSRUse &LU = Uses[LUIdx];  in GenerateAllReuseFormulae()
3847   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in GenerateAllReuseFormulae()
3848     LSRUse &LU = Uses[LUIdx];  in GenerateAllReuseFormulae()
3876   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in FilterOutUndesirableDedicatedRegisters()
3877     LSRUse &LU = Uses[LUIdx];  in FilterOutUndesirableDedicatedRegisters()
3969   for (const LSRUse &LU : Uses) {  in EstimateSearchSpaceComplexity()
3993     for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in NarrowSearchSpaceByDetectingSupersets()
3994       LSRUse &LU = Uses[LUIdx];  in NarrowSearchSpaceByDetectingSupersets()
4057   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in NarrowSearchSpaceByCollapsingUnrolledCode()
4058     LSRUse &LU = Uses[LUIdx];  in NarrowSearchSpaceByCollapsingUnrolledCode()
4078           Fixup.LUIdx = LUThatHas - &Uses.front();  in NarrowSearchSpaceByCollapsingUnrolledCode()
4110         LUThatHas->RecomputeRegs(LUThatHas - &Uses.front(), RegUses);  in NarrowSearchSpaceByCollapsingUnrolledCode()
4176     for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {  in NarrowSearchSpaceByPickingWinnerRegs()
4177       LSRUse &LU = Uses[LUIdx];  in NarrowSearchSpaceByPickingWinnerRegs()
4231   const LSRUse &LU = Uses[Workspace.size()];  in SolveRecurse()
4272       if (Workspace.size() != Uses.size()) {  in SolveRecurse()
4301   Workspace.reserve(Uses.size());  in Solve()
4315         for (size_t i = 0, e = Uses.size(); i != e; ++i) {  in Solve()
4317           Uses[i].print(dbgs());  in Solve()
4324   assert(Solution.size() == Uses.size() && "Malformed solution!");  in Solve()
4450   const LSRUse &LU = Uses[LF.LUIdx];  in Expand()
4731     if (Uses[LF.LUIdx].Kind == LSRUse::ICmpZero)  in Rewrite()
4844   assert(!Uses.empty() && "IVUsers reported at least one use");  in LSRInstance()
4845   DEBUG(dbgs() << "LSR found " << Uses.size() << " uses:\n";  in LSRInstance()
4868   for (const LSRUse &LU : Uses) {  in LSRInstance()
4910   for (const LSRUse &LU : Uses) {  in print_uses()