Cross Reference: /external/llvm/lib/Transforms/Scalar/LoopStrengthReduce.cpp

Lines Matching defs:Uses
1523   /// Uses - The list of interesting uses.
1524   SmallVector<LSRUse, 16> Uses;
2143     LSRUse &LU = Uses[LUIdx];
2150   size_t LUIdx = Uses.size();
2152   Uses.push_back(LSRUse(Kind, AccessTy));
2153   LSRUse &LU = Uses[LUIdx];
2165 /// DeleteUse - Delete the given use from the Uses list.
2167   if (&LU != &Uses.back())
2168     std::swap(LU, Uses.back());
2169   Uses.pop_back();
2172   RegUses.SwapAndDropUse(LUIdx, Uses.size());
2181   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2182     LSRUse &LU = Uses[LUIdx];
2871     LSRUse &LU = Uses[LF.LUIdx];
3004         LSRUse &LU = Uses[LF.LUIdx];
3011         CountRegisters(LU.Formulae.back(), Uses.size() - 1);
3541     LSRUse &LU = Uses[LUIdx];
3626   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
3627     LSRUse &LU = Uses[LUIdx];
3633   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
3634     LSRUse &LU = Uses[LUIdx];
3644   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
3645     LSRUse &LU = Uses[LUIdx];
3673   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
3674     LSRUse &LU = Uses[LUIdx];
3768   for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(),
3769        E = Uses.end(); I != E; ++I) {
3794     for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
3795       LSRUse &LU = Uses[LUIdx];
3859     for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
3860       LSRUse &LU = Uses[LUIdx];
3879                   Fixup.LUIdx = LUThatHas - &Uses.front();
3912                 LUThatHas->RecomputeRegs(LUThatHas - &Uses.front(), RegUses);
3986     for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
3987       LSRUse &LU = Uses[LUIdx];
4041   const LSRUse &LU = Uses[Workspace.size()];
4084       if (Workspace.size() != Uses.size()) {
4114   Workspace.reserve(Uses.size());
4128         for (size_t i = 0, e = Uses.size(); i != e; ++i) {
4130           Uses[i].print(dbgs());
4137   assert(Solution.size() == Uses.size() && "Malformed solution!");
4267   const LSRUse &LU = Uses[LF.LUIdx];
4532     if (Uses[LF.LUIdx].Kind == LSRUse::ICmpZero)
4652   assert(!Uses.empty() && "IVUsers reported at least one use");
4653   DEBUG(dbgs() << "LSR found " << Uses.size() << " uses:\n";
4676   for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(),
4677        E = Uses.end(); I != E; ++I) {
4725   for (SmallVectorImpl<LSRUse>::const_iterator I = Uses.begin(),
4726        E = Uses.end(); I != E; ++I) {