[llvm] b1943f4 - [BranchFolding] Remove getBranchDebugLoc() (#114613)
via llvm-commits
llvm-commits at lists.llvm.org
Wed Jan 22 09:50:52 PST 2025
Author: Ellis Hoag
Date: 2025-01-22T09:50:49-08:00
New Revision: b1943f40e74dcfe4ebd6213e1a8a01403bd5ffa9
URL: https://github.com/llvm/llvm-project/commit/b1943f40e74dcfe4ebd6213e1a8a01403bd5ffa9
DIFF: https://github.com/llvm/llvm-project/commit/b1943f40e74dcfe4ebd6213e1a8a01403bd5ffa9.diff
LOG: [BranchFolding] Remove getBranchDebugLoc() (#114613)
Added:
Modified:
llvm/lib/CodeGen/BranchFolding.cpp
Removed:
################################################################################
diff --git a/llvm/lib/CodeGen/BranchFolding.cpp b/llvm/lib/CodeGen/BranchFolding.cpp
index 65476fa05a2030..29a3076b57e207 100644
--- a/llvm/lib/CodeGen/BranchFolding.cpp
+++ b/llvm/lib/CodeGen/BranchFolding.cpp
@@ -1268,15 +1268,6 @@ static bool IsBetterFallthrough(MachineBasicBlock *MBB1,
return MBB2I->isCall() && !MBB1I->isCall();
}
-/// getBranchDebugLoc - Find and return, if any, the DebugLoc of the branch
-/// instructions on the block.
-static DebugLoc getBranchDebugLoc(MachineBasicBlock &MBB) {
- MachineBasicBlock::iterator I = MBB.getLastNonDebugInstr();
- if (I != MBB.end() && I->isBranch())
- return I->getDebugLoc();
- return DebugLoc();
-}
-
static void copyDebugInfoToPredecessor(const TargetInstrInfo *TII,
MachineBasicBlock &MBB,
MachineBasicBlock &PredMBB) {
@@ -1403,11 +1394,11 @@ bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) {
// destination, remove the branch, replacing it with an unconditional one or
// a fall-through.
if (PriorTBB && PriorTBB == PriorFBB) {
- DebugLoc dl = getBranchDebugLoc(PrevBB);
+ DebugLoc Dl = PrevBB.findBranchDebugLoc();
TII->removeBranch(PrevBB);
PriorCond.clear();
if (PriorTBB != MBB)
- TII->insertBranch(PrevBB, PriorTBB, nullptr, PriorCond, dl);
+ TII->insertBranch(PrevBB, PriorTBB, nullptr, PriorCond, Dl);
MadeChange = true;
++NumBranchOpts;
goto ReoptimizeBlock;
@@ -1461,9 +1452,9 @@ bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) {
// If the prior block branches somewhere else on the condition and here if
// the condition is false, remove the uncond second branch.
if (PriorFBB == MBB) {
- DebugLoc dl = getBranchDebugLoc(PrevBB);
+ DebugLoc Dl = PrevBB.findBranchDebugLoc();
TII->removeBranch(PrevBB);
- TII->insertBranch(PrevBB, PriorTBB, nullptr, PriorCond, dl);
+ TII->insertBranch(PrevBB, PriorTBB, nullptr, PriorCond, Dl);
MadeChange = true;
++NumBranchOpts;
goto ReoptimizeBlock;
@@ -1475,9 +1466,9 @@ bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) {
if (PriorTBB == MBB) {
SmallVector<MachineOperand, 4> NewPriorCond(PriorCond);
if (!TII->reverseBranchCondition(NewPriorCond)) {
- DebugLoc dl = getBranchDebugLoc(PrevBB);
+ DebugLoc Dl = PrevBB.findBranchDebugLoc();
TII->removeBranch(PrevBB);
- TII->insertBranch(PrevBB, PriorFBB, nullptr, NewPriorCond, dl);
+ TII->insertBranch(PrevBB, PriorFBB, nullptr, NewPriorCond, Dl);
MadeChange = true;
++NumBranchOpts;
goto ReoptimizeBlock;
@@ -1513,9 +1504,9 @@ bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) {
LLVM_DEBUG(dbgs() << "\nMoving MBB: " << *MBB
<< "To make fallthrough to: " << *PriorTBB << "\n");
- DebugLoc dl = getBranchDebugLoc(PrevBB);
+ DebugLoc Dl = PrevBB.findBranchDebugLoc();
TII->removeBranch(PrevBB);
- TII->insertBranch(PrevBB, MBB, nullptr, NewPriorCond, dl);
+ TII->insertBranch(PrevBB, MBB, nullptr, NewPriorCond, Dl);
// Move this block to the end of the function.
MBB->moveAfter(&MF.back());
@@ -1576,9 +1567,9 @@ bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) {
if (CurTBB && CurFBB && CurFBB == MBB && CurTBB != MBB) {
SmallVector<MachineOperand, 4> NewCond(CurCond);
if (!TII->reverseBranchCondition(NewCond)) {
- DebugLoc dl = getBranchDebugLoc(*MBB);
+ DebugLoc Dl = MBB->findBranchDebugLoc();
TII->removeBranch(*MBB);
- TII->insertBranch(*MBB, CurFBB, CurTBB, NewCond, dl);
+ TII->insertBranch(*MBB, CurFBB, CurTBB, NewCond, Dl);
MadeChange = true;
++NumBranchOpts;
goto ReoptimizeBlock;
@@ -1590,7 +1581,7 @@ bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) {
if (CurTBB && CurCond.empty() && !CurFBB &&
IsBranchOnlyBlock(MBB) && CurTBB != MBB &&
!MBB->hasAddressTaken() && !MBB->isEHPad()) {
- DebugLoc dl = getBranchDebugLoc(*MBB);
+ DebugLoc Dl = MBB->findBranchDebugLoc();
// This block may contain just an unconditional branch. Because there can
// be 'non-branch terminators' in the block, try removing the branch and
// then seeing if the block is empty.
@@ -1624,9 +1615,9 @@ bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) {
assert(!PriorFBB && "Machine CFG out of date!");
PriorFBB = MBB;
}
- DebugLoc pdl = getBranchDebugLoc(PrevBB);
+ DebugLoc PrevDl = PrevBB.findBranchDebugLoc();
TII->removeBranch(PrevBB);
- TII->insertBranch(PrevBB, PriorTBB, PriorFBB, PriorCond, pdl);
+ TII->insertBranch(PrevBB, PriorTBB, PriorFBB, PriorCond, PrevDl);
}
// Iterate through all the predecessors, revectoring each in-turn.
@@ -1659,10 +1650,11 @@ bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) {
bool NewCurUnAnalyzable = TII->analyzeBranch(
*PMBB, NewCurTBB, NewCurFBB, NewCurCond, true);
if (!NewCurUnAnalyzable && NewCurTBB && NewCurTBB == NewCurFBB) {
- DebugLoc pdl = getBranchDebugLoc(*PMBB);
+ DebugLoc PrevDl = PMBB->findBranchDebugLoc();
TII->removeBranch(*PMBB);
NewCurCond.clear();
- TII->insertBranch(*PMBB, NewCurTBB, nullptr, NewCurCond, pdl);
+ TII->insertBranch(*PMBB, NewCurTBB, nullptr, NewCurCond,
+ PrevDl);
MadeChange = true;
++NumBranchOpts;
}
@@ -1681,7 +1673,7 @@ bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) {
}
// Add the branch back if the block is more than just an uncond branch.
- TII->insertBranch(*MBB, CurTBB, nullptr, CurCond, dl);
+ TII->insertBranch(*MBB, CurTBB, nullptr, CurCond, Dl);
}
}
More information about the llvm-commits
mailing list