<commit_before>//===-- LiveIntervalAnalysis.cpp - Live Interval Analysis -----------------===//
//
//                     The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file implements the LiveInterval analysis pass which is used
// by the Linear Scan Register allocator. This pass linearizes the
// basic blocks of the function in DFS order and uses the
// LiveVariables pass to conservatively compute live intervals for
// each virtual and physical register.
//
//===----------------------------------------------------------------------===//

#define DEBUG_TYPE "liveintervals"
#include "llvm/CodeGen/LiveIntervalAnalysis.h"
#include "VirtRegMap.h"
#include "llvm/Value.h"
#include "llvm/Analysis/LoopInfo.h"
#include "llvm/CodeGen/LiveVariables.h"
#include "llvm/CodeGen/MachineFrameInfo.h"
#include "llvm/CodeGen/MachineInstr.h"
#include "llvm/CodeGen/Passes.h"
#include "llvm/CodeGen/SSARegMap.h"
#include "llvm/Target/MRegisterInfo.h"
#include "llvm/Target/TargetInstrInfo.h"
#include "llvm/Target/TargetMachine.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Debug.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/ADT/STLExtras.h"
#include <algorithm>
#include <cmath>
using namespace llvm;

namespace {
  // Hidden options for help debugging.
  cl::opt<bool> DisableReMat("disable-rematerialization", 
                              cl::init(false), cl::Hidden);
}

STATISTIC(numIntervals, "Number of original intervals");
STATISTIC(numIntervalsAfter, "Number of intervals after coalescing");
STATISTIC(numFolded   , "Number of loads/stores folded into instructions");

char LiveIntervals::ID = 0;
namespace {
  RegisterPass<LiveIntervals> X("liveintervals", "Live Interval Analysis");
}

void LiveIntervals::getAnalysisUsage(AnalysisUsage &AU) const {
  AU.addPreserved<LiveVariables>();
  AU.addRequired<LiveVariables>();
  AU.addPreservedID(PHIEliminationID);
  AU.addRequiredID(PHIEliminationID);
  AU.addRequiredID(TwoAddressInstructionPassID);
  AU.addRequired<LoopInfo>();
  MachineFunctionPass::getAnalysisUsage(AU);
}

void LiveIntervals::releaseMemory() {
  mi2iMap_.clear();
  i2miMap_.clear();
  r2iMap_.clear();
  // Release VNInfo memroy regions after all VNInfo objects are dtor'd.
  VNInfoAllocator.Reset();
  for (unsigned i = 0, e = ClonedMIs.size(); i != e; ++i)
    delete ClonedMIs[i];
}

/// runOnMachineFunction - Register allocate the whole function
///
bool LiveIntervals::runOnMachineFunction(MachineFunction &fn) {
  mf_ = &fn;
  tm_ = &fn.getTarget();
  mri_ = tm_->getRegisterInfo();
  tii_ = tm_->getInstrInfo();
  lv_ = &getAnalysis<LiveVariables>();
  allocatableRegs_ = mri_->getAllocatableSet(fn);

  // Number MachineInstrs and MachineBasicBlocks.
  // Initialize MBB indexes to a sentinal.
  MBB2IdxMap.resize(mf_->getNumBlockIDs(), std::make_pair(~0U,~0U));
  
  unsigned MIIndex = 0;
  for (MachineFunction::iterator MBB = mf_->begin(), E = mf_->end();
       MBB != E; ++MBB) {
    unsigned StartIdx = MIIndex;

    for (MachineBasicBlock::iterator I = MBB->begin(), E = MBB->end();
         I != E; ++I) {
      bool inserted = mi2iMap_.insert(std::make_pair(I, MIIndex)).second;
      assert(inserted && "multiple MachineInstr -> index mappings");
      i2miMap_.push_back(I);
      MIIndex += InstrSlots::NUM;
    }

    // Set the MBB2IdxMap entry for this MBB.
    MBB2IdxMap[MBB->getNumber()] = std::make_pair(StartIdx, MIIndex - 1);
  }

  computeIntervals();

  numIntervals += getNumIntervals();

  DOUT << "********** INTERVALS **********\n";
  for (iterator I = begin(), E = end(); I != E; ++I) {
    I->second.print(DOUT, mri_);
    DOUT << "\n";
  }

  numIntervalsAfter += getNumIntervals();
  DEBUG(dump());
  return true;
}

/// print - Implement the dump method.
void LiveIntervals::print(std::ostream &O, const Module* ) const {
  O << "********** INTERVALS **********\n";
  for (const_iterator I = begin(), E = end(); I != E; ++I) {
    I->second.print(DOUT, mri_);
    DOUT << "\n";
  }

  O << "********** MACHINEINSTRS **********\n";
  for (MachineFunction::iterator mbbi = mf_->begin(), mbbe = mf_->end();
       mbbi != mbbe; ++mbbi) {
    O << ((Value*)mbbi->getBasicBlock())->getName() << ":\n";
    for (MachineBasicBlock::iterator mii = mbbi->begin(),
           mie = mbbi->end(); mii != mie; ++mii) {
      O << getInstructionIndex(mii) << '\t' << *mii;
    }
  }
}

/// isReMaterializable - Returns true if the definition MI of the specified
/// val# of the specified interval is re-materializable.
bool LiveIntervals::isReMaterializable(const LiveInterval &li,
                                       const VNInfo *ValNo, MachineInstr *MI) {
  if (DisableReMat)
    return false;

  if (tii_->isTriviallyReMaterializable(MI))
    return true;

  int FrameIdx = 0;
  if (!tii_->isLoadFromStackSlot(MI, FrameIdx) ||
      !mf_->getFrameInfo()->isFixedObjectIndex(FrameIdx))
    return false;

  // This is a load from fixed stack slot. It can be rematerialized unless it's
  // re-defined by a two-address instruction.
  for (LiveInterval::const_vni_iterator i = li.vni_begin(), e = li.vni_end();
       i != e; ++i) {
    const VNInfo *VNI = *i;
    if (VNI == ValNo)
      continue;
    unsigned DefIdx = VNI->def;
    if (DefIdx == ~1U)
      continue; // Dead val#.
    MachineInstr *DefMI = (DefIdx == ~0u)
      ? NULL : getInstructionFromIndex(DefIdx);
    if (DefMI && DefMI->isRegReDefinedByTwoAddr(li.reg))
      return false;
  }
  return true;
}

/// tryFoldMemoryOperand - Attempts to fold either a spill / restore from
/// slot / to reg or any rematerialized load into ith operand of specified
/// MI. If it is successul, MI is updated with the newly created MI and
/// returns true.
bool LiveIntervals::tryFoldMemoryOperand(MachineInstr* &MI, VirtRegMap &vrm,
                                         MachineInstr *DefMI,
                                         unsigned index, unsigned i,
                                         bool isSS, int slot, unsigned reg) {
  MachineInstr *fmi = isSS
    ? mri_->foldMemoryOperand(MI, i, slot)
    : mri_->foldMemoryOperand(MI, i, DefMI);
  if (fmi) {
    // Attempt to fold the memory reference into the instruction. If
    // we can do this, we don't need to insert spill code.
    if (lv_)
      lv_->instructionChanged(MI, fmi);
    MachineBasicBlock &MBB = *MI->getParent();
    vrm.virtFolded(reg, MI, i, fmi);
    mi2iMap_.erase(MI);
    i2miMap_[index/InstrSlots::NUM] = fmi;
    mi2iMap_[fmi] = index;
    MI = MBB.insert(MBB.erase(MI), fmi);
    ++numFolded;
    return true;
  }
  return false;
}

std::vector<LiveInterval*> LiveIntervals::
addIntervalsForSpills(const LiveInterval &li, VirtRegMap &vrm, unsigned reg) {
  // since this is called after the analysis is done we don't know if
  // LiveVariables is available
  lv_ = getAnalysisToUpdate<LiveVariables>();

  std::vector<LiveInterval*> added;

  assert(li.weight != HUGE_VALF &&
         "attempt to spill already spilled interval!");

  DOUT << "\t\t\t\tadding intervals for spills for interval: ";
  li.print(DOUT, mri_);
  DOUT << '\n';

  SSARegMap *RegMap = mf_->getSSARegMap();
  const TargetRegisterClass* rc = RegMap->getRegClass(li.reg);

  unsigned NumValNums = li.getNumValNums();
  SmallVector<MachineInstr*, 4> ReMatDefs;
  ReMatDefs.resize(NumValNums, NULL);
  SmallVector<MachineInstr*, 4> ReMatOrigDefs;
  ReMatOrigDefs.resize(NumValNums, NULL);
  SmallVector<int, 4> ReMatIds;
  ReMatIds.resize(NumValNums, VirtRegMap::MAX_STACK_SLOT);
  BitVector ReMatDelete(NumValNums);
  unsigned slot = VirtRegMap::MAX_STACK_SLOT;

  bool NeedStackSlot = false;
  for (LiveInterval::const_vni_iterator i = li.vni_begin(), e = li.vni_end();
       i != e; ++i) {
    const VNInfo *VNI = *i;
    unsigned VN = VNI->id;
    unsigned DefIdx = VNI->def;
    if (DefIdx == ~1U)
      continue; // Dead val#.
    // Is the def for the val# rematerializable?
    MachineInstr *DefMI = (DefIdx == ~0u)
      ? NULL : getInstructionFromIndex(DefIdx);
    if (DefMI && isReMaterializable(li, VNI, DefMI)) {
      // Remember how to remat the def of this val#.
      ReMatOrigDefs[VN] = DefMI;
      // Original def may be modified so we have to make a copy here. vrm must
      // delete these!
      ReMatDefs[VN] = DefMI = DefMI->clone();
      vrm.setVirtIsReMaterialized(reg, DefMI);

      bool CanDelete = true;
      for (unsigned j = 0, ee = VNI->kills.size(); j != ee; ++j) {
        unsigned KillIdx = VNI->kills[j];
        MachineInstr *KillMI = (KillIdx & 1)
          ? NULL : getInstructionFromIndex(KillIdx);
        // Kill is a phi node, not all of its uses can be rematerialized.
        // It must not be deleted.
        if (!KillMI) {
          CanDelete = false;
          // Need a stack slot if there is any live range where uses cannot be
          // rematerialized.
          NeedStackSlot = true;
          break;
        }
      }

      if (CanDelete)
        ReMatDelete.set(VN);
    } else {
      // Need a stack slot if there is any live range where uses cannot be
      // rematerialized.
      NeedStackSlot = true;
    }
  }

  // One stack slot per live interval.
  if (NeedStackSlot)
    slot = vrm.assignVirt2StackSlot(reg);

  for (LiveInterval::Ranges::const_iterator
         I = li.ranges.begin(), E = li.ranges.end(); I != E; ++I) {
    MachineInstr *DefMI = ReMatDefs[I->valno->id];
    MachineInstr *OrigDefMI = ReMatOrigDefs[I->valno->id];
    bool DefIsReMat = DefMI != NULL;
    bool CanDelete = ReMatDelete[I->valno->id];
    int LdSlot = 0;
    bool isLoadSS = DefIsReMat && tii_->isLoadFromStackSlot(DefMI, LdSlot);
    bool isLoad = isLoadSS ||
      (DefIsReMat && (DefMI->getInstrDescriptor()->Flags & M_LOAD_FLAG));
    unsigned index = getBaseIndex(I->start);
    unsigned end = getBaseIndex(I->end-1) + InstrSlots::NUM;
    for (; index != end; index += InstrSlots::NUM) {
      // skip deleted instructions
      while (index != end && !getInstructionFromIndex(index))
        index += InstrSlots::NUM;
      if (index == end) break;

      MachineInstr *MI = getInstructionFromIndex(index);

    RestartInstruction:
      for (unsigned i = 0; i != MI->getNumOperands(); ++i) {
        MachineOperand& mop = MI->getOperand(i);
        if (!mop.isRegister())
          continue;
        unsigned Reg = mop.getReg();
        if (Reg == 0 || MRegisterInfo::isPhysicalRegister(Reg))
          continue;
        bool isSubReg = RegMap->isSubRegister(Reg);
        unsigned SubIdx = 0;
        if (isSubReg) {
          SubIdx = RegMap->getSubRegisterIndex(Reg);
          Reg = RegMap->getSuperRegister(Reg);
        }
        if (Reg != li.reg)
          continue;

        bool TryFold = !DefIsReMat;
        bool FoldSS = true;
        int FoldSlot = slot;
        if (DefIsReMat) {
          // If this is the rematerializable definition MI itself and
          // all of its uses are rematerialized, simply delete it.
          if (MI == OrigDefMI && CanDelete) {
            RemoveMachineInstrFromMaps(MI);
            MI->eraseFromParent();
            break;
          }

          // If def for this use can't be rematerialized, then try folding.
          TryFold = !OrigDefMI || (OrigDefMI && (MI == OrigDefMI || isLoad));
          if (isLoad) {
            // Try fold loads (from stack slot, constant pool, etc.) into uses.
            FoldSS = isLoadSS;
            FoldSlot = LdSlot;
          }
        }

        // FIXME: fold subreg use
        if (!isSubReg && TryFold &&
            tryFoldMemoryOperand(MI, vrm, DefMI, index, i, FoldSS, FoldSlot, Reg))
          // Folding the load/store can completely change the instruction in
          // unpredictable ways, rescan it from the beginning.
          goto RestartInstruction;

        // Create a new virtual register for the spill interval.
        unsigned NewVReg = RegMap->createVirtualRegister(rc);
        if (isSubReg)
          RegMap->setIsSubRegister(NewVReg, NewVReg, SubIdx);
            
        // Scan all of the operands of this instruction rewriting operands
        // to use NewVReg instead of li.reg as appropriate.  We do this for
        // two reasons:
        //
        //   1. If the instr reads the same spilled vreg multiple times, we
        //      want to reuse the NewVReg.
        //   2. If the instr is a two-addr instruction, we are required to
        //      keep the src/dst regs pinned.
        //
        // Keep track of whether we replace a use and/or def so that we can
        // create the spill interval with the appropriate range. 
        mop.setReg(NewVReg);
            
        bool HasUse = mop.isUse();
        bool HasDef = mop.isDef();
        for (unsigned j = i+1, e = MI->getNumOperands(); j != e; ++j) {
          if (MI->getOperand(j).isRegister() &&
              MI->getOperand(j).getReg() == li.reg) {
            MI->getOperand(j).setReg(NewVReg);
            HasUse |= MI->getOperand(j).isUse();
            HasDef |= MI->getOperand(j).isDef();
          }
        }

        vrm.grow();
        if (DefIsReMat) {
          vrm.setVirtIsReMaterialized(NewVReg, DefMI/*, CanDelete*/);
          if (ReMatIds[I->valno->id] == VirtRegMap::MAX_STACK_SLOT) {
            // Each valnum may have its own remat id.
            ReMatIds[I->valno->id] = vrm.assignVirtReMatId(NewVReg);
          } else {
            vrm.assignVirtReMatId(NewVReg, ReMatIds[I->valno->id]);
          }
          if (!CanDelete || (HasUse && HasDef)) {
            // If this is a two-addr instruction then its use operands are
            // rematerializable but its def is not. It should be assigned a
            // stack slot.
            vrm.assignVirt2StackSlot(NewVReg, slot);
          }
        } else {
          vrm.assignVirt2StackSlot(NewVReg, slot);
        }

        // create a new register interval for this spill / remat.
        LiveInterval &nI = getOrCreateInterval(NewVReg);
        assert(nI.empty());

        // the spill weight is now infinity as it
        // cannot be spilled again
        nI.weight = HUGE_VALF;

        if (HasUse) {
          LiveRange LR(getLoadIndex(index), getUseIndex(index)+1,
                       nI.getNextValue(~0U, 0, VNInfoAllocator));
          DOUT << " +" << LR;
          nI.addRange(LR);
        }
        if (HasDef) {
          LiveRange LR(getDefIndex(index), getStoreIndex(index),
                       nI.getNextValue(~0U, 0, VNInfoAllocator));
          DOUT << " +" << LR;
          nI.addRange(LR);
        }
            
        added.push_back(&nI);

        // update live variables if it is available
        if (lv_)
          lv_->addVirtualRegisterKilled(NewVReg, MI);
            
        DOUT << "\t\t\t\tadded new interval: ";
        nI.print(DOUT, mri_);
        DOUT << '\n';
      }
    }
  }

  return added;
}

void LiveIntervals::printRegName(unsigned reg) const {
  if (MRegisterInfo::isPhysicalRegister(reg))
    cerr << mri_->getName(reg);
  else
    cerr << "%reg" << reg;
}

void LiveIntervals::handleVirtualRegisterDef(MachineBasicBlock *mbb,
                                             MachineBasicBlock::iterator mi,
                                             unsigned MIIdx,
                                             LiveInterval &interval) {
  DOUT << "\t\tregister: "; DEBUG(printRegName(interval.reg));
  LiveVariables::VarInfo& vi = lv_->getVarInfo(interval.reg);

  // Virtual registers may be defined multiple times (due to phi
  // elimination and 2-addr elimination).  Much of what we do only has to be
  // done once for the vreg.  We use an empty interval to detect the first
  // time we see a vreg.
  if (interval.empty()) {
    // Get the Idx of the defining instructions.
    unsigned defIndex = getDefIndex(MIIdx);
    VNInfo *ValNo;
    unsigned SrcReg, DstReg;
    if (tii_->isMoveInstr(*mi, SrcReg, DstReg))
      ValNo = interval.getNextValue(defIndex, SrcReg, VNInfoAllocator);
    else if (mi->getOpcode() == TargetInstrInfo::EXTRACT_SUBREG ||
             mi->getOpcode() == TargetInstrInfo::INSERT_SUBREG)
      ValNo = interval.getNextValue(defIndex, mi->getOperand(1).getReg(),
                                    VNInfoAllocator);
    else
      ValNo = interval.getNextValue(defIndex, 0, VNInfoAllocator);

    assert(ValNo->id == 0 && "First value in interval is not 0?");

    // Loop over all of the blocks that the vreg is defined in.  There are
    // two cases we have to handle here.  The most common case is a vreg
    // whose lifetime is contained within a basic block.  In this case there
    // will be a single kill, in MBB, which comes after the definition.
    if (vi.Kills.size() == 1 && vi.Kills[0]->getParent() == mbb) {
      // FIXME: what about dead vars?
      unsigned killIdx;
      if (vi.Kills[0] != mi)
        killIdx = getUseIndex(getInstructionIndex(vi.Kills[0]))+1;<commit_msg>Did mean to leave this in. INSERT_SUBREG isn't being coalesced yet.<commit_after>//===-- LiveIntervalAnalysis.cpp - Live Interval Analysis -----------------===//
//
//                     The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file implements the LiveInterval analysis pass which is used
// by the Linear Scan Register allocator. This pass linearizes the
// basic blocks of the function in DFS order and uses the
// LiveVariables pass to conservatively compute live intervals for
// each virtual and physical register.
//
//===----------------------------------------------------------------------===//

#define DEBUG_TYPE "liveintervals"
#include "llvm/CodeGen/LiveIntervalAnalysis.h"
#include "VirtRegMap.h"
#include "llvm/Value.h"
#include "llvm/Analysis/LoopInfo.h"
#include "llvm/CodeGen/LiveVariables.h"
#include "llvm/CodeGen/MachineFrameInfo.h"
#include "llvm/CodeGen/MachineInstr.h"
#include "llvm/CodeGen/Passes.h"
#include "llvm/CodeGen/SSARegMap.h"
#include "llvm/Target/MRegisterInfo.h"
#include "llvm/Target/TargetInstrInfo.h"
#include "llvm/Target/TargetMachine.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Debug.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/ADT/STLExtras.h"
#include <algorithm>
#include <cmath>
using namespace llvm;

namespace {
  // Hidden options for help debugging.
  cl::opt<bool> DisableReMat("disable-rematerialization", 
                              cl::init(false), cl::Hidden);
}

STATISTIC(numIntervals, "Number of original intervals");
STATISTIC(numIntervalsAfter, "Number of intervals after coalescing");
STATISTIC(numFolded   , "Number of loads/stores folded into instructions");

char LiveIntervals::ID = 0;
namespace {
  RegisterPass<LiveIntervals> X("liveintervals", "Live Interval Analysis");
}

void LiveIntervals::getAnalysisUsage(AnalysisUsage &AU) const {
  AU.addPreserved<LiveVariables>();
  AU.addRequired<LiveVariables>();
  AU.addPreservedID(PHIEliminationID);
  AU.addRequiredID(PHIEliminationID);
  AU.addRequiredID(TwoAddressInstructionPassID);
  AU.addRequired<LoopInfo>();
  MachineFunctionPass::getAnalysisUsage(AU);
}

void LiveIntervals::releaseMemory() {
  mi2iMap_.clear();
  i2miMap_.clear();
  r2iMap_.clear();
  // Release VNInfo memroy regions after all VNInfo objects are dtor'd.
  VNInfoAllocator.Reset();
  for (unsigned i = 0, e = ClonedMIs.size(); i != e; ++i)
    delete ClonedMIs[i];
}

/// runOnMachineFunction - Register allocate the whole function
///
bool LiveIntervals::runOnMachineFunction(MachineFunction &fn) {
  mf_ = &fn;
  tm_ = &fn.getTarget();
  mri_ = tm_->getRegisterInfo();
  tii_ = tm_->getInstrInfo();
  lv_ = &getAnalysis<LiveVariables>();
  allocatableRegs_ = mri_->getAllocatableSet(fn);

  // Number MachineInstrs and MachineBasicBlocks.
  // Initialize MBB indexes to a sentinal.
  MBB2IdxMap.resize(mf_->getNumBlockIDs(), std::make_pair(~0U,~0U));
  
  unsigned MIIndex = 0;
  for (MachineFunction::iterator MBB = mf_->begin(), E = mf_->end();
       MBB != E; ++MBB) {
    unsigned StartIdx = MIIndex;

    for (MachineBasicBlock::iterator I = MBB->begin(), E = MBB->end();
         I != E; ++I) {
      bool inserted = mi2iMap_.insert(std::make_pair(I, MIIndex)).second;
      assert(inserted && "multiple MachineInstr -> index mappings");
      i2miMap_.push_back(I);
      MIIndex += InstrSlots::NUM;
    }

    // Set the MBB2IdxMap entry for this MBB.
    MBB2IdxMap[MBB->getNumber()] = std::make_pair(StartIdx, MIIndex - 1);
  }

  computeIntervals();

  numIntervals += getNumIntervals();

  DOUT << "********** INTERVALS **********\n";
  for (iterator I = begin(), E = end(); I != E; ++I) {
    I->second.print(DOUT, mri_);
    DOUT << "\n";
  }

  numIntervalsAfter += getNumIntervals();
  DEBUG(dump());
  return true;
}

/// print - Implement the dump method.
void LiveIntervals::print(std::ostream &O, const Module* ) const {
  O << "********** INTERVALS **********\n";
  for (const_iterator I = begin(), E = end(); I != E; ++I) {
    I->second.print(DOUT, mri_);
    DOUT << "\n";
  }

  O << "********** MACHINEINSTRS **********\n";
  for (MachineFunction::iterator mbbi = mf_->begin(), mbbe = mf_->end();
       mbbi != mbbe; ++mbbi) {
    O << ((Value*)mbbi->getBasicBlock())->getName() << ":\n";
    for (MachineBasicBlock::iterator mii = mbbi->begin(),
           mie = mbbi->end(); mii != mie; ++mii) {
      O << getInstructionIndex(mii) << '\t' << *mii;
    }
  }
}

/// isReMaterializable - Returns true if the definition MI of the specified
/// val# of the specified interval is re-materializable.
bool LiveIntervals::isReMaterializable(const LiveInterval &li,
                                       const VNInfo *ValNo, MachineInstr *MI) {
  if (DisableReMat)
    return false;

  if (tii_->isTriviallyReMaterializable(MI))
    return true;

  int FrameIdx = 0;
  if (!tii_->isLoadFromStackSlot(MI, FrameIdx) ||
      !mf_->getFrameInfo()->isFixedObjectIndex(FrameIdx))
    return false;

  // This is a load from fixed stack slot. It can be rematerialized unless it's
  // re-defined by a two-address instruction.
  for (LiveInterval::const_vni_iterator i = li.vni_begin(), e = li.vni_end();
       i != e; ++i) {
    const VNInfo *VNI = *i;
    if (VNI == ValNo)
      continue;
    unsigned DefIdx = VNI->def;
    if (DefIdx == ~1U)
      continue; // Dead val#.
    MachineInstr *DefMI = (DefIdx == ~0u)
      ? NULL : getInstructionFromIndex(DefIdx);
    if (DefMI && DefMI->isRegReDefinedByTwoAddr(li.reg))
      return false;
  }
  return true;
}

/// tryFoldMemoryOperand - Attempts to fold either a spill / restore from
/// slot / to reg or any rematerialized load into ith operand of specified
/// MI. If it is successul, MI is updated with the newly created MI and
/// returns true.
bool LiveIntervals::tryFoldMemoryOperand(MachineInstr* &MI, VirtRegMap &vrm,
                                         MachineInstr *DefMI,
                                         unsigned index, unsigned i,
                                         bool isSS, int slot, unsigned reg) {
  MachineInstr *fmi = isSS
    ? mri_->foldMemoryOperand(MI, i, slot)
    : mri_->foldMemoryOperand(MI, i, DefMI);
  if (fmi) {
    // Attempt to fold the memory reference into the instruction. If
    // we can do this, we don't need to insert spill code.
    if (lv_)
      lv_->instructionChanged(MI, fmi);
    MachineBasicBlock &MBB = *MI->getParent();
    vrm.virtFolded(reg, MI, i, fmi);
    mi2iMap_.erase(MI);
    i2miMap_[index/InstrSlots::NUM] = fmi;
    mi2iMap_[fmi] = index;
    MI = MBB.insert(MBB.erase(MI), fmi);
    ++numFolded;
    return true;
  }
  return false;
}

std::vector<LiveInterval*> LiveIntervals::
addIntervalsForSpills(const LiveInterval &li, VirtRegMap &vrm, unsigned reg) {
  // since this is called after the analysis is done we don't know if
  // LiveVariables is available
  lv_ = getAnalysisToUpdate<LiveVariables>();

  std::vector<LiveInterval*> added;

  assert(li.weight != HUGE_VALF &&
         "attempt to spill already spilled interval!");

  DOUT << "\t\t\t\tadding intervals for spills for interval: ";
  li.print(DOUT, mri_);
  DOUT << '\n';

  SSARegMap *RegMap = mf_->getSSARegMap();
  const TargetRegisterClass* rc = RegMap->getRegClass(li.reg);

  unsigned NumValNums = li.getNumValNums();
  SmallVector<MachineInstr*, 4> ReMatDefs;
  ReMatDefs.resize(NumValNums, NULL);
  SmallVector<MachineInstr*, 4> ReMatOrigDefs;
  ReMatOrigDefs.resize(NumValNums, NULL);
  SmallVector<int, 4> ReMatIds;
  ReMatIds.resize(NumValNums, VirtRegMap::MAX_STACK_SLOT);
  BitVector ReMatDelete(NumValNums);
  unsigned slot = VirtRegMap::MAX_STACK_SLOT;

  bool NeedStackSlot = false;
  for (LiveInterval::const_vni_iterator i = li.vni_begin(), e = li.vni_end();
       i != e; ++i) {
    const VNInfo *VNI = *i;
    unsigned VN = VNI->id;
    unsigned DefIdx = VNI->def;
    if (DefIdx == ~1U)
      continue; // Dead val#.
    // Is the def for the val# rematerializable?
    MachineInstr *DefMI = (DefIdx == ~0u)
      ? NULL : getInstructionFromIndex(DefIdx);
    if (DefMI && isReMaterializable(li, VNI, DefMI)) {
      // Remember how to remat the def of this val#.
      ReMatOrigDefs[VN] = DefMI;
      // Original def may be modified so we have to make a copy here. vrm must
      // delete these!
      ReMatDefs[VN] = DefMI = DefMI->clone();
      vrm.setVirtIsReMaterialized(reg, DefMI);

      bool CanDelete = true;
      for (unsigned j = 0, ee = VNI->kills.size(); j != ee; ++j) {
        unsigned KillIdx = VNI->kills[j];
        MachineInstr *KillMI = (KillIdx & 1)
          ? NULL : getInstructionFromIndex(KillIdx);
        // Kill is a phi node, not all of its uses can be rematerialized.
        // It must not be deleted.
        if (!KillMI) {
          CanDelete = false;
          // Need a stack slot if there is any live range where uses cannot be
          // rematerialized.
          NeedStackSlot = true;
          break;
        }
      }

      if (CanDelete)
        ReMatDelete.set(VN);
    } else {
      // Need a stack slot if there is any live range where uses cannot be
      // rematerialized.
      NeedStackSlot = true;
    }
  }

  // One stack slot per live interval.
  if (NeedStackSlot)
    slot = vrm.assignVirt2StackSlot(reg);

  for (LiveInterval::Ranges::const_iterator
         I = li.ranges.begin(), E = li.ranges.end(); I != E; ++I) {
    MachineInstr *DefMI = ReMatDefs[I->valno->id];
    MachineInstr *OrigDefMI = ReMatOrigDefs[I->valno->id];
    bool DefIsReMat = DefMI != NULL;
    bool CanDelete = ReMatDelete[I->valno->id];
    int LdSlot = 0;
    bool isLoadSS = DefIsReMat && tii_->isLoadFromStackSlot(DefMI, LdSlot);
    bool isLoad = isLoadSS ||
      (DefIsReMat && (DefMI->getInstrDescriptor()->Flags & M_LOAD_FLAG));
    unsigned index = getBaseIndex(I->start);
    unsigned end = getBaseIndex(I->end-1) + InstrSlots::NUM;
    for (; index != end; index += InstrSlots::NUM) {
      // skip deleted instructions
      while (index != end && !getInstructionFromIndex(index))
        index += InstrSlots::NUM;
      if (index == end) break;

      MachineInstr *MI = getInstructionFromIndex(index);

    RestartInstruction:
      for (unsigned i = 0; i != MI->getNumOperands(); ++i) {
        MachineOperand& mop = MI->getOperand(i);
        if (!mop.isRegister())
          continue;
        unsigned Reg = mop.getReg();
        if (Reg == 0 || MRegisterInfo::isPhysicalRegister(Reg))
          continue;
        bool isSubReg = RegMap->isSubRegister(Reg);
        unsigned SubIdx = 0;
        if (isSubReg) {
          SubIdx = RegMap->getSubRegisterIndex(Reg);
          Reg = RegMap->getSuperRegister(Reg);
        }
        if (Reg != li.reg)
          continue;

        bool TryFold = !DefIsReMat;
        bool FoldSS = true;
        int FoldSlot = slot;
        if (DefIsReMat) {
          // If this is the rematerializable definition MI itself and
          // all of its uses are rematerialized, simply delete it.
          if (MI == OrigDefMI && CanDelete) {
            RemoveMachineInstrFromMaps(MI);
            MI->eraseFromParent();
            break;
          }

          // If def for this use can't be rematerialized, then try folding.
          TryFold = !OrigDefMI || (OrigDefMI && (MI == OrigDefMI || isLoad));
          if (isLoad) {
            // Try fold loads (from stack slot, constant pool, etc.) into uses.
            FoldSS = isLoadSS;
            FoldSlot = LdSlot;
          }
        }

        // FIXME: fold subreg use
        if (!isSubReg && TryFold &&
            tryFoldMemoryOperand(MI, vrm, DefMI, index, i, FoldSS, FoldSlot, Reg))
          // Folding the load/store can completely change the instruction in
          // unpredictable ways, rescan it from the beginning.
          goto RestartInstruction;

        // Create a new virtual register for the spill interval.
        unsigned NewVReg = RegMap->createVirtualRegister(rc);
        if (isSubReg)
          RegMap->setIsSubRegister(NewVReg, NewVReg, SubIdx);
            
        // Scan all of the operands of this instruction rewriting operands
        // to use NewVReg instead of li.reg as appropriate.  We do this for
        // two reasons:
        //
        //   1. If the instr reads the same spilled vreg multiple times, we
        //      want to reuse the NewVReg.
        //   2. If the instr is a two-addr instruction, we are required to
        //      keep the src/dst regs pinned.
        //
        // Keep track of whether we replace a use and/or def so that we can
        // create the spill interval with the appropriate range. 
        mop.setReg(NewVReg);
            
        bool HasUse = mop.isUse();
        bool HasDef = mop.isDef();
        for (unsigned j = i+1, e = MI->getNumOperands(); j != e; ++j) {
          if (MI->getOperand(j).isRegister() &&
              MI->getOperand(j).getReg() == li.reg) {
            MI->getOperand(j).setReg(NewVReg);
            HasUse |= MI->getOperand(j).isUse();
            HasDef |= MI->getOperand(j).isDef();
          }
        }

        vrm.grow();
        if (DefIsReMat) {
          vrm.setVirtIsReMaterialized(NewVReg, DefMI/*, CanDelete*/);
          if (ReMatIds[I->valno->id] == VirtRegMap::MAX_STACK_SLOT) {
            // Each valnum may have its own remat id.
            ReMatIds[I->valno->id] = vrm.assignVirtReMatId(NewVReg);
          } else {
            vrm.assignVirtReMatId(NewVReg, ReMatIds[I->valno->id]);
          }
          if (!CanDelete || (HasUse && HasDef)) {
            // If this is a two-addr instruction then its use operands are
            // rematerializable but its def is not. It should be assigned a
            // stack slot.
            vrm.assignVirt2StackSlot(NewVReg, slot);
          }
        } else {
          vrm.assignVirt2StackSlot(NewVReg, slot);
        }

        // create a new register interval for this spill / remat.
        LiveInterval &nI = getOrCreateInterval(NewVReg);
        assert(nI.empty());

        // the spill weight is now infinity as it
        // cannot be spilled again
        nI.weight = HUGE_VALF;

        if (HasUse) {
          LiveRange LR(getLoadIndex(index), getUseIndex(index)+1,
                       nI.getNextValue(~0U, 0, VNInfoAllocator));
          DOUT << " +" << LR;
          nI.addRange(LR);
        }
        if (HasDef) {
          LiveRange LR(getDefIndex(index), getStoreIndex(index),
                       nI.getNextValue(~0U, 0, VNInfoAllocator));
          DOUT << " +" << LR;
          nI.addRange(LR);
        }
            
        added.push_back(&nI);

        // update live variables if it is available
        if (lv_)
          lv_->addVirtualRegisterKilled(NewVReg, MI);
            
        DOUT << "\t\t\t\tadded new interval: ";
        nI.print(DOUT, mri_);
        DOUT << '\n';
      }
    }
  }

  return added;
}

void LiveIntervals::printRegName(unsigned reg) const {
  if (MRegisterInfo::isPhysicalRegister(reg))
    cerr << mri_->getName(reg);
  else
    cerr << "%reg" << reg;
}

void LiveIntervals::handleVirtualRegisterDef(MachineBasicBlock *mbb,
                                             MachineBasicBlock::iterator mi,
                                             unsigned MIIdx,
                                             LiveInterval &interval) {
  DOUT << "\t\tregister: "; DEBUG(printRegName(interval.reg));
  LiveVariables::VarInfo& vi = lv_->getVarInfo(interval.reg);

  // Virtual registers may be defined multiple times (due to phi
  // elimination and 2-addr elimination).  Much of what we do only has to be
  // done once for the vreg.  We use an empty interval to detect the first
  // time we see a vreg.
  if (interval.empty()) {
    // Get the Idx of the defining instructions.
    unsigned defIndex = getDefIndex(MIIdx);
    VNInfo *ValNo;
    unsigned SrcReg, DstReg;
    if (tii_->isMoveInstr(*mi, SrcReg, DstReg))
      ValNo = interval.getNextValue(defIndex, SrcReg, VNInfoAllocator);
    else if (mi->getOpcode() == TargetInstrInfo::EXTRACT_SUBREG)
      ValNo = interval.getNextValue(defIndex, mi->getOperand(1).getReg(),
                                    VNInfoAllocator);
    else
      ValNo = interval.getNextValue(defIndex, 0, VNInfoAllocator);

    assert(ValNo->id == 0 && "First value in interval is not 0?");

    // Loop over all of the blocks that the vreg is defined in.  There are
    // two cases we have to handle here.  The most common case is a vreg
    // whose lifetime is contained within a basic block.  In this case there
    // will be a single kill, in MBB, which comes after the definition.
    if (vi.Kills.size() == 1 && vi.Kills[0]->getParent() == mbb) {
      // FIXME: what about dead vars?
      unsigned killIdx;
      if (vi.Kills[0] != mi)
        killIdx = getUseIndex(getInstructionIndex(vi.Kills[0]))+1;
{'fraction_non_alphanumeric': 0.13558875219683655, 'fraction_numerical': 0.003104862331575864, 'mean_word_length': 2.455217083291165, 'pattern_counts': {'":': 2, '<': 119, '<?xml version=': 0, '>': 180, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 28, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '4024141', 'n_tokens_mistral': 10835, 'n_tokens_neox': 10565, 'n_words': 2919}