reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

lib/Transforms/Scalar/LoopStrengthReduce.cpp
 2582     LSRUse &LU = Uses[LUIdx];
 2589   size_t LUIdx = Uses.size();
 2591   Uses.push_back(LSRUse(Kind, AccessTy));
 2592   LSRUse &LU = Uses[LUIdx];
 2601   if (&LU != &Uses.back())
 2602     std::swap(LU, Uses.back());
 2603   Uses.pop_back();
 2606   RegUses.swapAndDropUse(LUIdx, Uses.size());
 2615   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
 2616     LSRUse &LU = Uses[LUIdx];
 3310     LSRUse &LU = Uses[LUIdx];
 3462         LSRUse &LU = Uses[LUIdx];
 3473         CountRegisters(LU.Formulae.back(), Uses.size() - 1);
 4186     LSRUse &LU = Uses[LUIdx];
 4276   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
 4277     LSRUse &LU = Uses[LUIdx];
 4283   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
 4284     LSRUse &LU = Uses[LUIdx];
 4294   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
 4295     LSRUse &LU = Uses[LUIdx];
 4324   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
 4325     LSRUse &LU = Uses[LUIdx];
 4413   for (const LSRUse &LU : Uses) {
 4437     for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
 4438       LSRUse &LU = Uses[LUIdx];
 4504   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
 4505     LSRUse &LU = Uses[LUIdx];
 4544         LUThatHas->RecomputeRegs(LUThatHas - &Uses.front(), RegUses);
 4601   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
 4602     LSRUse &LU = Uses[LUIdx];
 4735     for (const LSRUse &LU : Uses) {
 4751   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
 4752     LSRUse &LU = Uses[LUIdx];
 4849     for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
 4850       LSRUse &LU = Uses[LUIdx];
 4908   const LSRUse &LU = Uses[Workspace.size()];
 4947       if (Workspace.size() != Uses.size()) {
 4976   Workspace.reserve(Uses.size());
 4990              for (size_t i = 0, e = Uses.size(); i != e; ++i) {
 4992                Uses[i].print(dbgs());
 4999   assert(Solution.size() == Uses.size() && "Malformed solution!");
 5382         for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx)
 5383           for (LSRFixup &Fixup : Uses[LUIdx].Fixups)
 5478   for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx)
 5479     for (const LSRFixup &Fixup : Uses[LUIdx].Fixups) {
 5480       Rewrite(Uses[LUIdx], Fixup, *Solution[LUIdx], Rewriter, DeadInsts);
 5572   if (Uses.empty())
 5575   LLVM_DEBUG(dbgs() << "LSR found " << Uses.size() << " uses:\n";
 5598   for (const LSRUse &LU : Uses) {
 5632   for (const LSRUse &LU : Uses)
 5642   for (const LSRUse &LU : Uses) {