[mips] Remove unused option. Fix 80-column violations.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@176330 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Akira Hatanaka 2013-03-01 02:17:02 +00:00
parent 1f0aca857b
commit aa49f35240
2 changed files with 8 additions and 17 deletions

View File

@ -42,13 +42,6 @@ static cl::opt<bool> DisableDelaySlotFiller(
cl::desc("Fill all delay slots with NOPs."), cl::desc("Fill all delay slots with NOPs."),
cl::Hidden); cl::Hidden);
// This option can be used to silence complaints by machine verifier passes.
static cl::opt<bool> SkipDelaySlotFiller(
"skip-mips-delay-filler",
cl::init(false),
cl::desc("Skip MIPS' delay slot filling pass."),
cl::Hidden);
static cl::opt<bool> DisableForwardSearch( static cl::opt<bool> DisableForwardSearch(
"disable-mips-df-forward-search", "disable-mips-df-forward-search",
cl::init(true), cl::init(true),
@ -165,7 +158,8 @@ namespace {
virtual bool hasHazard_(const MachineInstr &MI); virtual bool hasHazard_(const MachineInstr &MI);
/// Update Defs and Uses. Return true if there exist dependences that /// Update Defs and Uses. Return true if there exist dependences that
/// disqualify the delay slot candidate between V and values in Uses and Defs. /// disqualify the delay slot candidate between V and values in Uses and
/// Defs.
bool updateDefsUses(const Value *V, bool MayStore); bool updateDefsUses(const Value *V, bool MayStore);
/// Get the list of underlying objects of MI's memory operand. /// Get the list of underlying objects of MI's memory operand.
@ -190,9 +184,6 @@ namespace {
} }
bool runOnMachineFunction(MachineFunction &F) { bool runOnMachineFunction(MachineFunction &F) {
if (SkipDelaySlotFiller)
return false;
bool Changed = false; bool Changed = false;
for (MachineFunction::iterator FI = F.begin(), FE = F.end(); for (MachineFunction::iterator FI = F.begin(), FE = F.end();
FI != FE; ++FI) FI != FE; ++FI)
@ -218,7 +209,8 @@ namespace {
/// moved to the delay slot. Returns true on success. /// moved to the delay slot. Returns true on success.
template<typename IterTy> template<typename IterTy>
bool searchRange(MachineBasicBlock &MBB, IterTy Begin, IterTy End, bool searchRange(MachineBasicBlock &MBB, IterTy Begin, IterTy End,
RegDefsUses &RegDU, InspectMemInstr &IM, IterTy &Filler) const; RegDefsUses &RegDU, InspectMemInstr &IM,
IterTy &Filler) const;
/// This function searches in the backward direction for an instruction that /// This function searches in the backward direction for an instruction that
/// can be moved to the delay slot. Returns true on success. /// can be moved to the delay slot. Returns true on success.
@ -229,12 +221,12 @@ namespace {
bool searchForward(MachineBasicBlock &MBB, Iter Slot) const; bool searchForward(MachineBasicBlock &MBB, Iter Slot) const;
/// This function searches MBB's successor blocks for an instruction that /// This function searches MBB's successor blocks for an instruction that
/// can be moved to the delay slot and inserts clones of the instruction into /// can be moved to the delay slot and inserts clones of the instruction
/// the successor blocks. /// into the successor blocks.
bool searchSuccBBs(MachineBasicBlock &MBB, Iter Slot) const; bool searchSuccBBs(MachineBasicBlock &MBB, Iter Slot) const;
/// Pick a successor block of MBB. Return NULL if MBB doesn't have a successor /// Pick a successor block of MBB. Return NULL if MBB doesn't have a
/// block that is not a landing pad. /// successor block that is not a landing pad.
MachineBasicBlock *selectSuccBB(MachineBasicBlock &B) const; MachineBasicBlock *selectSuccBB(MachineBasicBlock &B) const;
/// This function analyzes MBB and returns an instruction with an unoccupied /// This function analyzes MBB and returns an instruction with an unoccupied

View File

@ -176,4 +176,3 @@ if.end: ; preds = %entry, %if.then
} }
declare void @foo100() declare void @foo100()