2007-05-16 02:00:57 +00:00
|
|
|
//===-- IfConversion.cpp - Machine code if conversion pass. ---------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by the Evan Cheng and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the machine instruction level if-conversion pass.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2007-06-01 00:12:12 +00:00
|
|
|
#define DEBUG_TYPE "ifcvt"
|
|
|
|
#include "llvm/Function.h"
|
2007-05-16 02:00:57 +00:00
|
|
|
#include "llvm/CodeGen/Passes.h"
|
|
|
|
#include "llvm/CodeGen/MachineModuleInfo.h"
|
|
|
|
#include "llvm/CodeGen/MachineFunctionPass.h"
|
|
|
|
#include "llvm/Target/TargetInstrInfo.h"
|
2007-05-18 00:20:58 +00:00
|
|
|
#include "llvm/Target/TargetLowering.h"
|
2007-05-16 02:00:57 +00:00
|
|
|
#include "llvm/Target/TargetMachine.h"
|
2007-06-08 19:10:51 +00:00
|
|
|
#include "llvm/Support/CommandLine.h"
|
2007-05-16 02:00:57 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2007-05-18 19:26:33 +00:00
|
|
|
#include "llvm/ADT/DepthFirstIterator.h"
|
2007-05-16 02:00:57 +00:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
|
|
|
using namespace llvm;
|
|
|
|
|
2007-06-08 19:10:51 +00:00
|
|
|
namespace {
|
|
|
|
// Hidden options for help debugging.
|
|
|
|
cl::opt<int> IfCvtFnStart("ifcvt-fn-start", cl::init(-1), cl::Hidden);
|
|
|
|
cl::opt<int> IfCvtFnStop("ifcvt-fn-stop", cl::init(-1), cl::Hidden);
|
|
|
|
cl::opt<int> IfCvtLimit("ifcvt-limit", cl::init(-1), cl::Hidden);
|
|
|
|
cl::opt<bool> DisableSimple("disable-ifcvt-simple",
|
|
|
|
cl::init(false), cl::Hidden);
|
2007-06-09 01:03:43 +00:00
|
|
|
cl::opt<bool> DisableSimpleF("disable-ifcvt-simple-false",
|
|
|
|
cl::init(false), cl::Hidden);
|
2007-06-08 19:10:51 +00:00
|
|
|
cl::opt<bool> DisableTriangle("disable-ifcvt-triangle",
|
|
|
|
cl::init(false), cl::Hidden);
|
2007-06-12 23:54:05 +00:00
|
|
|
cl::opt<bool> DisableTriangleR("disable-ifcvt-triangle-rev",
|
|
|
|
cl::init(false), cl::Hidden);
|
2007-06-09 01:03:43 +00:00
|
|
|
cl::opt<bool> DisableTriangleF("disable-ifcvt-triangle-false",
|
|
|
|
cl::init(false), cl::Hidden);
|
|
|
|
cl::opt<bool> DisableTriangleFR("disable-ifcvt-triangle-false-rev",
|
|
|
|
cl::init(false), cl::Hidden);
|
2007-06-08 19:10:51 +00:00
|
|
|
cl::opt<bool> DisableDiamond("disable-ifcvt-diamond",
|
|
|
|
cl::init(false), cl::Hidden);
|
|
|
|
}
|
|
|
|
|
2007-06-09 01:03:43 +00:00
|
|
|
STATISTIC(NumSimple, "Number of simple if-conversions performed");
|
|
|
|
STATISTIC(NumSimpleFalse, "Number of simple (F) if-conversions performed");
|
|
|
|
STATISTIC(NumTriangle, "Number of triangle if-conversions performed");
|
2007-06-12 23:54:05 +00:00
|
|
|
STATISTIC(NumTriangleRev, "Number of triangle (R) if-conversions performed");
|
2007-06-09 01:03:43 +00:00
|
|
|
STATISTIC(NumTriangleFalse,"Number of triangle (F) if-conversions performed");
|
|
|
|
STATISTIC(NumTriangleFRev, "Number of triangle (F/R) if-conversions performed");
|
|
|
|
STATISTIC(NumDiamonds, "Number of diamond if-conversions performed");
|
|
|
|
STATISTIC(NumIfConvBBs, "Number of if-converted blocks");
|
2007-05-16 02:00:57 +00:00
|
|
|
|
|
|
|
namespace {
|
|
|
|
class IfConverter : public MachineFunctionPass {
|
|
|
|
enum BBICKind {
|
|
|
|
ICNotClassfied, // BB data valid, but not classified.
|
2007-06-04 06:47:22 +00:00
|
|
|
ICSimple, // BB is entry of an one split, no rejoin sub-CFG.
|
|
|
|
ICSimpleFalse, // Same as ICSimple, but on the false path.
|
2007-05-21 22:22:58 +00:00
|
|
|
ICTriangle, // BB is entry of a triangle sub-CFG.
|
2007-06-12 23:54:05 +00:00
|
|
|
ICTriangleRev, // Same as ICTriangle, but true path rev condition.
|
2007-06-09 01:03:43 +00:00
|
|
|
ICTriangleFalse, // Same as ICTriangle, but on the false path.
|
|
|
|
ICTriangleFRev, // Same as ICTriangleFalse, but false path rev condition.
|
2007-06-11 22:26:22 +00:00
|
|
|
ICDiamond // BB is entry of a diamond sub-CFG.
|
2007-05-16 02:00:57 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/// BBInfo - One per MachineBasicBlock, this is used to cache the result
|
|
|
|
/// if-conversion feasibility analysis. This includes results from
|
|
|
|
/// TargetInstrInfo::AnalyzeBranch() (i.e. TBB, FBB, and Cond), and its
|
2007-05-18 00:20:58 +00:00
|
|
|
/// classification, and common tail block of its successors (if it's a
|
2007-05-18 18:14:37 +00:00
|
|
|
/// diamond shape), its size, whether it's predicable, and whether any
|
|
|
|
/// instruction can clobber the 'would-be' predicate.
|
2007-05-23 07:23:16 +00:00
|
|
|
///
|
|
|
|
/// Kind - Type of block. See BBICKind.
|
2007-06-11 22:26:22 +00:00
|
|
|
/// IsDone - True if BB is not to be considered for ifcvt.
|
|
|
|
/// IsBeingAnalyzed - True if BB is currently being analyzed.
|
|
|
|
/// IsAnalyzed - True if BB has been analyzed (info is still valid).
|
|
|
|
/// IsEnqueued - True if BB has been enqueued to be ifcvt'ed.
|
|
|
|
/// IsBrAnalyzable - True if AnalyzeBranch() returns false.
|
|
|
|
/// HasFallThrough - True if BB may fallthrough to the following BB.
|
|
|
|
/// IsUnpredicable - True if BB is known to be unpredicable.
|
|
|
|
/// ClobbersPredicate- True if BB would modify the predicate (e.g. has
|
2007-06-06 10:16:17 +00:00
|
|
|
/// cmp, call, etc.)
|
2007-06-11 22:26:22 +00:00
|
|
|
/// NonPredSize - Number of non-predicated instructions.
|
2007-05-23 07:23:16 +00:00
|
|
|
/// BB - Corresponding MachineBasicBlock.
|
|
|
|
/// TrueBB / FalseBB- See AnalyzeBranch().
|
|
|
|
/// BrCond - Conditions for end of block conditional branches.
|
|
|
|
/// Predicate - Predicate used in the BB.
|
2007-05-16 02:00:57 +00:00
|
|
|
struct BBInfo {
|
|
|
|
BBICKind Kind;
|
2007-06-11 22:26:22 +00:00
|
|
|
bool IsDone : 1;
|
|
|
|
bool IsBeingAnalyzed : 1;
|
|
|
|
bool IsAnalyzed : 1;
|
|
|
|
bool IsEnqueued : 1;
|
|
|
|
bool IsBrAnalyzable : 1;
|
|
|
|
bool HasFallThrough : 1;
|
|
|
|
bool IsUnpredicable : 1;
|
|
|
|
bool ClobbersPred : 1;
|
2007-05-23 07:23:16 +00:00
|
|
|
unsigned NonPredSize;
|
2007-05-18 00:20:58 +00:00
|
|
|
MachineBasicBlock *BB;
|
|
|
|
MachineBasicBlock *TrueBB;
|
|
|
|
MachineBasicBlock *FalseBB;
|
|
|
|
MachineBasicBlock *TailBB;
|
2007-05-23 07:23:16 +00:00
|
|
|
std::vector<MachineOperand> BrCond;
|
|
|
|
std::vector<MachineOperand> Predicate;
|
2007-06-11 22:26:22 +00:00
|
|
|
BBInfo() : Kind(ICNotClassfied), IsDone(false), IsBeingAnalyzed(false),
|
|
|
|
IsAnalyzed(false), IsEnqueued(false), IsBrAnalyzable(false),
|
|
|
|
HasFallThrough(false), IsUnpredicable(false),
|
|
|
|
ClobbersPred(false), NonPredSize(0),
|
2007-05-21 22:22:58 +00:00
|
|
|
BB(0), TrueBB(0), FalseBB(0), TailBB(0) {}
|
2007-05-16 02:00:57 +00:00
|
|
|
};
|
|
|
|
|
2007-05-30 19:49:19 +00:00
|
|
|
/// Roots - Basic blocks that do not have successors. These are the starting
|
|
|
|
/// points of Graph traversal.
|
|
|
|
std::vector<MachineBasicBlock*> Roots;
|
|
|
|
|
2007-05-16 02:00:57 +00:00
|
|
|
/// BBAnalysis - Results of if-conversion feasibility analysis indexed by
|
|
|
|
/// basic block number.
|
|
|
|
std::vector<BBInfo> BBAnalysis;
|
|
|
|
|
2007-05-18 00:20:58 +00:00
|
|
|
const TargetLowering *TLI;
|
2007-05-16 02:00:57 +00:00
|
|
|
const TargetInstrInfo *TII;
|
|
|
|
bool MadeChange;
|
|
|
|
public:
|
|
|
|
static char ID;
|
|
|
|
IfConverter() : MachineFunctionPass((intptr_t)&ID) {}
|
|
|
|
|
|
|
|
virtual bool runOnMachineFunction(MachineFunction &MF);
|
|
|
|
virtual const char *getPassName() const { return "If converter"; }
|
|
|
|
|
|
|
|
private:
|
2007-06-04 06:47:22 +00:00
|
|
|
bool ReverseBranchCondition(BBInfo &BBI);
|
2007-06-08 09:36:04 +00:00
|
|
|
bool ValidSimple(BBInfo &TrueBBI) const;
|
|
|
|
bool ValidTriangle(BBInfo &TrueBBI, BBInfo &FalseBBI,
|
|
|
|
bool FalseBranch = false) const;
|
2007-06-07 02:12:15 +00:00
|
|
|
bool ValidDiamond(BBInfo &TrueBBI, BBInfo &FalseBBI) const;
|
2007-06-08 09:36:04 +00:00
|
|
|
void ScanInstructions(BBInfo &BBI);
|
2007-06-11 22:26:22 +00:00
|
|
|
BBInfo &AnalyzeBlock(MachineBasicBlock *BB);
|
2007-06-08 09:36:04 +00:00
|
|
|
bool FeasibilityAnalysis(BBInfo &BBI, std::vector<MachineOperand> &Cond,
|
|
|
|
bool isTriangle = false, bool RevBranch = false);
|
2007-05-30 19:49:19 +00:00
|
|
|
bool AttemptRestructuring(BBInfo &BBI);
|
|
|
|
bool AnalyzeBlocks(MachineFunction &MF,
|
2007-05-23 07:23:16 +00:00
|
|
|
std::vector<BBInfo*> &Candidates);
|
2007-05-30 19:49:19 +00:00
|
|
|
void ReTryPreds(MachineBasicBlock *BB);
|
2007-06-08 22:01:07 +00:00
|
|
|
void RemoveExtraEdges(BBInfo &BBI);
|
2007-06-04 06:47:22 +00:00
|
|
|
bool IfConvertSimple(BBInfo &BBI);
|
2007-05-16 02:00:57 +00:00
|
|
|
bool IfConvertTriangle(BBInfo &BBI);
|
2007-05-18 18:14:37 +00:00
|
|
|
bool IfConvertDiamond(BBInfo &BBI);
|
2007-05-23 07:23:16 +00:00
|
|
|
void PredicateBlock(BBInfo &BBI,
|
2007-05-16 02:00:57 +00:00
|
|
|
std::vector<MachineOperand> &Cond,
|
|
|
|
bool IgnoreTerm = false);
|
2007-05-18 00:20:58 +00:00
|
|
|
void MergeBlocks(BBInfo &TrueBBI, BBInfo &FalseBBI);
|
2007-06-01 00:12:12 +00:00
|
|
|
|
2007-06-07 02:12:15 +00:00
|
|
|
// blockAlwaysFallThrough - Block ends without a terminator.
|
|
|
|
bool blockAlwaysFallThrough(BBInfo &BBI) const {
|
2007-06-11 22:26:22 +00:00
|
|
|
return BBI.IsBrAnalyzable && BBI.TrueBB == NULL;
|
2007-06-06 10:16:17 +00:00
|
|
|
}
|
|
|
|
|
2007-06-01 00:12:12 +00:00
|
|
|
// IfcvtCandidateCmp - Used to sort if-conversion candidates.
|
|
|
|
static bool IfcvtCandidateCmp(BBInfo* C1, BBInfo* C2){
|
|
|
|
// Favor diamond over triangle, etc.
|
|
|
|
return (unsigned)C1->Kind < (unsigned)C2->Kind;
|
|
|
|
}
|
2007-05-16 02:00:57 +00:00
|
|
|
};
|
|
|
|
char IfConverter::ID = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
FunctionPass *llvm::createIfConverterPass() { return new IfConverter(); }
|
|
|
|
|
|
|
|
bool IfConverter::runOnMachineFunction(MachineFunction &MF) {
|
2007-05-18 00:20:58 +00:00
|
|
|
TLI = MF.getTarget().getTargetLowering();
|
2007-05-16 02:00:57 +00:00
|
|
|
TII = MF.getTarget().getInstrInfo();
|
|
|
|
if (!TII) return false;
|
|
|
|
|
2007-06-08 19:10:51 +00:00
|
|
|
static int FnNum = -1;
|
|
|
|
DOUT << "\nIfcvt: function (" << ++FnNum << ") \'"
|
|
|
|
<< MF.getFunction()->getName() << "\'";
|
|
|
|
|
|
|
|
if (FnNum < IfCvtFnStart || (IfCvtFnStop != -1 && FnNum > IfCvtFnStop)) {
|
|
|
|
DOUT << " skipped\n";
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
DOUT << "\n";
|
2007-06-01 00:12:12 +00:00
|
|
|
|
2007-05-16 02:00:57 +00:00
|
|
|
MF.RenumberBlocks();
|
2007-06-01 00:12:12 +00:00
|
|
|
BBAnalysis.resize(MF.getNumBlockIDs());
|
2007-05-16 02:00:57 +00:00
|
|
|
|
2007-05-30 19:49:19 +00:00
|
|
|
// Look for root nodes, i.e. blocks without successors.
|
|
|
|
for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I)
|
|
|
|
if (I->succ_size() == 0)
|
|
|
|
Roots.push_back(I);
|
|
|
|
|
2007-05-18 19:32:08 +00:00
|
|
|
std::vector<BBInfo*> Candidates;
|
2007-05-18 01:55:58 +00:00
|
|
|
MadeChange = false;
|
2007-06-08 19:10:51 +00:00
|
|
|
while (IfCvtLimit == -1 || (int)NumIfConvBBs < IfCvtLimit) {
|
2007-05-23 07:23:16 +00:00
|
|
|
// Do an intial analysis for each basic block and finding all the potential
|
|
|
|
// candidates to perform if-convesion.
|
2007-06-04 06:47:22 +00:00
|
|
|
bool Change = AnalyzeBlocks(MF, Candidates);
|
2007-05-23 07:23:16 +00:00
|
|
|
while (!Candidates.empty()) {
|
|
|
|
BBInfo &BBI = *Candidates.back();
|
|
|
|
Candidates.pop_back();
|
2007-06-04 06:47:22 +00:00
|
|
|
|
2007-06-11 22:26:22 +00:00
|
|
|
// If the block has been evicted out of the queue or it has already been
|
|
|
|
// marked dead (due to it being predicated), then skip it.
|
|
|
|
if (!BBI.IsEnqueued || BBI.IsDone)
|
|
|
|
continue;
|
2007-06-14 20:28:52 +00:00
|
|
|
BBI.IsEnqueued = false;
|
2007-06-11 22:26:22 +00:00
|
|
|
|
2007-06-04 06:47:22 +00:00
|
|
|
bool RetVal = false;
|
2007-05-23 07:23:16 +00:00
|
|
|
switch (BBI.Kind) {
|
|
|
|
default: assert(false && "Unexpected!");
|
|
|
|
break;
|
2007-06-04 06:47:22 +00:00
|
|
|
case ICSimple:
|
2007-06-06 01:12:44 +00:00
|
|
|
case ICSimpleFalse: {
|
2007-06-09 01:03:43 +00:00
|
|
|
bool isFalse = BBI.Kind == ICSimpleFalse;
|
|
|
|
if ((isFalse && DisableSimpleF) || (!isFalse && DisableSimple)) break;
|
2007-06-04 06:47:22 +00:00
|
|
|
DOUT << "Ifcvt (Simple" << (BBI.Kind == ICSimpleFalse ? " false" : "")
|
2007-06-06 10:16:17 +00:00
|
|
|
<< "): BB#" << BBI.BB->getNumber() << " ("
|
|
|
|
<< ((BBI.Kind == ICSimpleFalse)
|
|
|
|
? BBI.FalseBB->getNumber() : BBI.TrueBB->getNumber()) << ") ";
|
2007-06-04 06:47:22 +00:00
|
|
|
RetVal = IfConvertSimple(BBI);
|
|
|
|
DOUT << (RetVal ? "succeeded!" : "failed!") << "\n";
|
|
|
|
if (RetVal)
|
2007-06-09 01:03:43 +00:00
|
|
|
if (isFalse) NumSimpleFalse++;
|
|
|
|
else NumSimple++;
|
2007-06-04 06:47:22 +00:00
|
|
|
break;
|
2007-06-06 01:12:44 +00:00
|
|
|
}
|
2007-05-23 07:23:16 +00:00
|
|
|
case ICTriangle:
|
2007-06-12 23:54:05 +00:00
|
|
|
case ICTriangleRev:
|
2007-06-09 01:03:43 +00:00
|
|
|
case ICTriangleFalse:
|
2007-06-10 00:19:17 +00:00
|
|
|
case ICTriangleFRev: {
|
2007-06-12 23:54:05 +00:00
|
|
|
bool isFalse = BBI.Kind == ICTriangleFalse;
|
|
|
|
bool isRev = (BBI.Kind == ICTriangleRev || BBI.Kind == ICTriangleFRev);
|
|
|
|
if (DisableTriangle && !isFalse && !isRev) break;
|
|
|
|
if (DisableTriangleR && !isFalse && isRev) break;
|
|
|
|
if (DisableTriangleF && isFalse && !isRev) break;
|
|
|
|
if (DisableTriangleFR && isFalse && isRev) break;
|
2007-06-09 01:03:43 +00:00
|
|
|
DOUT << "Ifcvt (Triangle";
|
|
|
|
if (isFalse)
|
|
|
|
DOUT << " false";
|
2007-06-12 23:54:05 +00:00
|
|
|
if (isRev)
|
|
|
|
DOUT << " rev";
|
2007-06-09 01:03:43 +00:00
|
|
|
DOUT << "): BB#" << BBI.BB->getNumber() << " (T:"
|
2007-06-06 10:16:17 +00:00
|
|
|
<< BBI.TrueBB->getNumber() << ",F:" << BBI.FalseBB->getNumber()
|
|
|
|
<< ") ";
|
2007-06-04 06:47:22 +00:00
|
|
|
RetVal = IfConvertTriangle(BBI);
|
|
|
|
DOUT << (RetVal ? "succeeded!" : "failed!") << "\n";
|
2007-06-09 01:03:43 +00:00
|
|
|
if (RetVal) {
|
2007-06-12 23:54:05 +00:00
|
|
|
if (isFalse) {
|
|
|
|
if (isRev) NumTriangleFRev++;
|
|
|
|
else NumTriangleFalse++;
|
|
|
|
} else {
|
|
|
|
if (isRev) NumTriangleRev++;
|
|
|
|
else NumTriangle++;
|
|
|
|
}
|
2007-06-09 01:03:43 +00:00
|
|
|
}
|
2007-05-23 07:23:16 +00:00
|
|
|
break;
|
2007-06-10 00:19:17 +00:00
|
|
|
}
|
2007-05-23 07:23:16 +00:00
|
|
|
case ICDiamond:
|
2007-06-08 19:10:51 +00:00
|
|
|
if (DisableDiamond) break;
|
2007-06-06 10:16:17 +00:00
|
|
|
DOUT << "Ifcvt (Diamond): BB#" << BBI.BB->getNumber() << " (T:"
|
|
|
|
<< BBI.TrueBB->getNumber() << ",F:" << BBI.FalseBB->getNumber();
|
|
|
|
if (BBI.TailBB)
|
|
|
|
DOUT << "," << BBI.TailBB->getNumber() ;
|
|
|
|
DOUT << ") ";
|
2007-06-04 06:47:22 +00:00
|
|
|
RetVal = IfConvertDiamond(BBI);
|
|
|
|
DOUT << (RetVal ? "succeeded!" : "failed!") << "\n";
|
|
|
|
if (RetVal) NumDiamonds++;
|
2007-05-23 07:23:16 +00:00
|
|
|
break;
|
|
|
|
}
|
2007-06-04 06:47:22 +00:00
|
|
|
Change |= RetVal;
|
2007-06-08 19:10:51 +00:00
|
|
|
|
2007-06-09 01:03:43 +00:00
|
|
|
if (IfCvtLimit != -1 && (int)NumIfConvBBs >= IfCvtLimit)
|
2007-06-08 19:10:51 +00:00
|
|
|
break;
|
2007-05-16 02:00:57 +00:00
|
|
|
}
|
2007-05-23 07:23:16 +00:00
|
|
|
|
|
|
|
if (!Change)
|
|
|
|
break;
|
2007-06-04 06:47:22 +00:00
|
|
|
MadeChange |= Change;
|
2007-05-16 02:00:57 +00:00
|
|
|
}
|
2007-05-18 01:55:58 +00:00
|
|
|
|
2007-05-30 19:49:19 +00:00
|
|
|
Roots.clear();
|
2007-05-18 01:55:58 +00:00
|
|
|
BBAnalysis.clear();
|
|
|
|
|
2007-05-16 02:00:57 +00:00
|
|
|
return MadeChange;
|
|
|
|
}
|
|
|
|
|
|
|
|
static MachineBasicBlock *findFalseBlock(MachineBasicBlock *BB,
|
2007-05-18 00:20:58 +00:00
|
|
|
MachineBasicBlock *TrueBB) {
|
2007-05-16 02:00:57 +00:00
|
|
|
for (MachineBasicBlock::succ_iterator SI = BB->succ_begin(),
|
|
|
|
E = BB->succ_end(); SI != E; ++SI) {
|
|
|
|
MachineBasicBlock *SuccBB = *SI;
|
2007-05-18 00:20:58 +00:00
|
|
|
if (SuccBB != TrueBB)
|
2007-05-16 02:00:57 +00:00
|
|
|
return SuccBB;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2007-06-04 06:47:22 +00:00
|
|
|
bool IfConverter::ReverseBranchCondition(BBInfo &BBI) {
|
|
|
|
if (!TII->ReverseBranchCondition(BBI.BrCond)) {
|
|
|
|
TII->RemoveBranch(*BBI.BB);
|
|
|
|
TII->InsertBranch(*BBI.BB, BBI.FalseBB, BBI.TrueBB, BBI.BrCond);
|
|
|
|
std::swap(BBI.TrueBB, BBI.FalseBB);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2007-06-09 01:03:43 +00:00
|
|
|
/// getNextBlock - Returns the next block in the function blocks ordering. If
|
|
|
|
/// it is the end, returns NULL.
|
|
|
|
static inline MachineBasicBlock *getNextBlock(MachineBasicBlock *BB) {
|
|
|
|
MachineFunction::iterator I = BB;
|
|
|
|
MachineFunction::iterator E = BB->getParent()->end();
|
|
|
|
if (++I == E)
|
|
|
|
return NULL;
|
|
|
|
return I;
|
|
|
|
}
|
|
|
|
|
2007-06-08 09:36:04 +00:00
|
|
|
/// ValidSimple - Returns true if the 'true' block (along with its
|
|
|
|
/// predecessor) forms a valid simple shape for ifcvt.
|
|
|
|
bool IfConverter::ValidSimple(BBInfo &TrueBBI) const {
|
2007-06-11 22:26:22 +00:00
|
|
|
if (TrueBBI.IsBeingAnalyzed)
|
|
|
|
return false;
|
|
|
|
|
2007-06-08 09:36:04 +00:00
|
|
|
return !blockAlwaysFallThrough(TrueBBI) &&
|
|
|
|
TrueBBI.BrCond.size() == 0 && TrueBBI.BB->pred_size() == 1;
|
2007-06-06 10:16:17 +00:00
|
|
|
}
|
|
|
|
|
2007-06-08 09:36:04 +00:00
|
|
|
/// ValidTriangle - Returns true if the 'true' and 'false' blocks (along
|
2007-06-07 02:12:15 +00:00
|
|
|
/// with their common predecessor) forms a valid triangle shape for ifcvt.
|
2007-06-08 09:36:04 +00:00
|
|
|
bool IfConverter::ValidTriangle(BBInfo &TrueBBI, BBInfo &FalseBBI,
|
|
|
|
bool FalseBranch) const {
|
2007-06-11 22:26:22 +00:00
|
|
|
if (TrueBBI.IsBeingAnalyzed)
|
|
|
|
return false;
|
|
|
|
|
2007-06-07 02:12:15 +00:00
|
|
|
if (TrueBBI.BB->pred_size() != 1)
|
|
|
|
return false;
|
|
|
|
|
2007-06-08 09:36:04 +00:00
|
|
|
MachineBasicBlock *TExit = FalseBranch ? TrueBBI.FalseBB : TrueBBI.TrueBB;
|
|
|
|
if (!TExit && blockAlwaysFallThrough(TrueBBI)) {
|
2007-06-07 02:12:15 +00:00
|
|
|
MachineFunction::iterator I = TrueBBI.BB;
|
|
|
|
if (++I == TrueBBI.BB->getParent()->end())
|
|
|
|
return false;
|
2007-06-08 09:36:04 +00:00
|
|
|
TExit = I;
|
2007-06-07 02:12:15 +00:00
|
|
|
}
|
2007-06-08 09:36:04 +00:00
|
|
|
return TExit && TExit == FalseBBI.BB;
|
2007-06-07 02:12:15 +00:00
|
|
|
}
|
|
|
|
|
2007-06-08 09:36:04 +00:00
|
|
|
/// ValidDiamond - Returns true if the 'true' and 'false' blocks (along
|
2007-06-07 02:12:15 +00:00
|
|
|
/// with their common predecessor) forms a valid diamond shape for ifcvt.
|
|
|
|
bool IfConverter::ValidDiamond(BBInfo &TrueBBI, BBInfo &FalseBBI) const {
|
2007-06-11 22:26:22 +00:00
|
|
|
if (TrueBBI.IsBeingAnalyzed || FalseBBI.IsBeingAnalyzed)
|
|
|
|
return false;
|
|
|
|
|
2007-06-09 01:03:43 +00:00
|
|
|
MachineBasicBlock *TT = TrueBBI.TrueBB;
|
|
|
|
MachineBasicBlock *FT = FalseBBI.TrueBB;
|
|
|
|
|
|
|
|
if (!TT && blockAlwaysFallThrough(TrueBBI))
|
|
|
|
TT = getNextBlock(TrueBBI.BB);
|
|
|
|
if (!FT && blockAlwaysFallThrough(FalseBBI))
|
|
|
|
FT = getNextBlock(FalseBBI.BB);
|
|
|
|
if (TT != FT)
|
|
|
|
return false;
|
2007-06-11 22:26:22 +00:00
|
|
|
if (TT == NULL && (TrueBBI.IsBrAnalyzable || FalseBBI.IsBrAnalyzable))
|
2007-06-09 01:03:43 +00:00
|
|
|
return false;
|
|
|
|
// FIXME: Allow false block to have an early exit?
|
|
|
|
return (TrueBBI.BB->pred_size() == 1 &&
|
2007-06-07 02:12:15 +00:00
|
|
|
FalseBBI.BB->pred_size() == 1 &&
|
|
|
|
!TrueBBI.FalseBB && !FalseBBI.FalseBB);
|
|
|
|
}
|
|
|
|
|
2007-06-11 22:26:22 +00:00
|
|
|
/// ScanInstructions - Scan all the instructions in the block to determine if
|
|
|
|
/// the block is predicable. In most cases, that means all the instructions
|
|
|
|
/// in the block has M_PREDICABLE flag. Also checks if the block contains any
|
|
|
|
/// instruction which can clobber a predicate (e.g. condition code register).
|
|
|
|
/// If so, the block is not predicable unless it's the last instruction.
|
|
|
|
void IfConverter::ScanInstructions(BBInfo &BBI) {
|
|
|
|
if (BBI.IsDone)
|
|
|
|
return;
|
|
|
|
|
|
|
|
// First analyze the end of BB branches.
|
2007-06-14 21:26:08 +00:00
|
|
|
BBI.TrueBB = BBI.FalseBB = NULL;
|
2007-06-11 22:26:22 +00:00
|
|
|
BBI.BrCond.clear();
|
|
|
|
BBI.IsBrAnalyzable =
|
|
|
|
!TII->AnalyzeBranch(*BBI.BB, BBI.TrueBB, BBI.FalseBB, BBI.BrCond);
|
|
|
|
BBI.HasFallThrough = BBI.IsBrAnalyzable && BBI.FalseBB == NULL;
|
|
|
|
|
|
|
|
if (BBI.BrCond.size()) {
|
|
|
|
// No false branch. This BB must end with a conditional branch and a
|
|
|
|
// fallthrough.
|
|
|
|
if (!BBI.FalseBB)
|
|
|
|
BBI.FalseBB = findFalseBlock(BBI.BB, BBI.TrueBB);
|
|
|
|
assert(BBI.FalseBB && "Expected to find the fallthrough block!");
|
|
|
|
}
|
|
|
|
|
|
|
|
// Then scan all the instructions.
|
|
|
|
BBI.NonPredSize = 0;
|
|
|
|
BBI.ClobbersPred = false;
|
|
|
|
bool SeenCondBr = false;
|
|
|
|
for (MachineBasicBlock::iterator I = BBI.BB->begin(), E = BBI.BB->end();
|
|
|
|
I != E; ++I) {
|
|
|
|
const TargetInstrDescriptor *TID = I->getInstrDescriptor();
|
|
|
|
bool isPredicated = TII->isPredicated(I);
|
|
|
|
bool isCondBr = BBI.IsBrAnalyzable &&
|
|
|
|
(TID->Flags & M_BRANCH_FLAG) != 0 && (TID->Flags & M_BARRIER_FLAG) == 0;
|
|
|
|
|
|
|
|
if (!isPredicated && !isCondBr)
|
|
|
|
BBI.NonPredSize++;
|
|
|
|
|
|
|
|
if (BBI.ClobbersPred && !isPredicated) {
|
|
|
|
// Predicate modification instruction should end the block (except for
|
|
|
|
// already predicated instructions and end of block branches).
|
|
|
|
if (isCondBr) {
|
|
|
|
SeenCondBr = true;
|
|
|
|
|
|
|
|
// Conditional branches is not predicable. But it may be eliminated.
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Predicate may have been modified, the subsequent (currently)
|
|
|
|
// unpredocated instructions cannot be correctly predicated.
|
|
|
|
BBI.IsUnpredicable = true;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (TID->Flags & M_CLOBBERS_PRED)
|
|
|
|
BBI.ClobbersPred = true;
|
|
|
|
|
|
|
|
if (!I->isPredicable()) {
|
|
|
|
BBI.IsUnpredicable = true;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// FeasibilityAnalysis - Determine if the block is a suitable candidate to be
|
|
|
|
/// predicated by the specified predicate.
|
|
|
|
bool IfConverter::FeasibilityAnalysis(BBInfo &BBI,
|
|
|
|
std::vector<MachineOperand> &Pred,
|
|
|
|
bool isTriangle, bool RevBranch) {
|
|
|
|
// Forget about it if it's unpredicable.
|
|
|
|
if (BBI.IsUnpredicable)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// If the block is dead, or it is going to be the entry block of a sub-CFG
|
|
|
|
// that will be if-converted, then it cannot be predicated.
|
|
|
|
if (BBI.IsDone || BBI.IsEnqueued)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Check predication threshold.
|
|
|
|
if (BBI.NonPredSize == 0 || BBI.NonPredSize > TLI->getIfCvtBlockSizeLimit())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// If it is already predicated, check if its predicate subsumes the new
|
|
|
|
// predicate.
|
|
|
|
if (BBI.Predicate.size() && !TII->SubsumesPredicate(BBI.Predicate, Pred))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (BBI.BrCond.size()) {
|
|
|
|
if (!isTriangle)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Test predicate subsumsion.
|
|
|
|
std::vector<MachineOperand> RevPred(Pred);
|
|
|
|
std::vector<MachineOperand> Cond(BBI.BrCond);
|
|
|
|
if (RevBranch) {
|
|
|
|
if (TII->ReverseBranchCondition(Cond))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if (TII->ReverseBranchCondition(RevPred) ||
|
|
|
|
!TII->SubsumesPredicate(Cond, RevPred))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2007-06-08 09:36:04 +00:00
|
|
|
/// AnalyzeBlock - Analyze the structure of the sub-CFG starting from
|
2007-05-18 18:14:37 +00:00
|
|
|
/// the specified block. Record its successors and whether it looks like an
|
|
|
|
/// if-conversion candidate.
|
2007-06-11 22:26:22 +00:00
|
|
|
IfConverter::BBInfo &IfConverter::AnalyzeBlock(MachineBasicBlock *BB) {
|
2007-05-16 02:00:57 +00:00
|
|
|
BBInfo &BBI = BBAnalysis[BB->getNumber()];
|
|
|
|
|
2007-06-11 22:26:22 +00:00
|
|
|
if (BBI.IsAnalyzed || BBI.IsBeingAnalyzed)
|
|
|
|
return BBI;
|
2007-05-18 00:20:58 +00:00
|
|
|
|
2007-06-11 22:26:22 +00:00
|
|
|
BBI.BB = BB;
|
|
|
|
BBI.IsBeingAnalyzed = true;
|
2007-05-25 00:59:01 +00:00
|
|
|
BBI.Kind = ICNotClassfied;
|
|
|
|
|
2007-06-11 22:26:22 +00:00
|
|
|
ScanInstructions(BBI);
|
|
|
|
|
|
|
|
// Unanalyable or ends with fallthrough or unconditional branch.
|
|
|
|
if (!BBI.IsBrAnalyzable || BBI.BrCond.size() == 0) {
|
|
|
|
BBI.IsBeingAnalyzed = false;
|
|
|
|
BBI.IsAnalyzed = true;
|
|
|
|
return BBI;
|
|
|
|
}
|
2007-05-16 21:54:37 +00:00
|
|
|
|
2007-06-11 22:26:22 +00:00
|
|
|
// Do not ifcvt if either path is a back edge to the entry block.
|
|
|
|
if (BBI.TrueBB == BB || BBI.FalseBB == BB) {
|
|
|
|
BBI.IsBeingAnalyzed = false;
|
|
|
|
BBI.IsAnalyzed = true;
|
|
|
|
return BBI;
|
|
|
|
}
|
2007-05-18 00:20:58 +00:00
|
|
|
|
2007-06-11 22:26:22 +00:00
|
|
|
BBInfo &TrueBBI = AnalyzeBlock(BBI.TrueBB);
|
|
|
|
BBInfo &FalseBBI = AnalyzeBlock(BBI.FalseBB);
|
2007-06-06 10:16:17 +00:00
|
|
|
|
2007-06-11 22:26:22 +00:00
|
|
|
if (TrueBBI.IsDone && FalseBBI.IsDone) {
|
|
|
|
BBI.IsBeingAnalyzed = false;
|
|
|
|
BBI.IsAnalyzed = true;
|
|
|
|
return BBI;
|
2007-06-06 10:16:17 +00:00
|
|
|
}
|
|
|
|
|
2007-06-04 06:47:22 +00:00
|
|
|
std::vector<MachineOperand> RevCond(BBI.BrCond);
|
|
|
|
bool CanRevCond = !TII->ReverseBranchCondition(RevCond);
|
2007-06-08 09:36:04 +00:00
|
|
|
|
|
|
|
if (CanRevCond && ValidDiamond(TrueBBI, FalseBBI) &&
|
2007-06-11 22:26:22 +00:00
|
|
|
!(TrueBBI.ClobbersPred && FalseBBI.ClobbersPred) &&
|
2007-06-08 09:36:04 +00:00
|
|
|
FeasibilityAnalysis(TrueBBI, BBI.BrCond) &&
|
|
|
|
FeasibilityAnalysis(FalseBBI, RevCond)) {
|
2007-05-16 02:00:57 +00:00
|
|
|
// Diamond:
|
|
|
|
// EBB
|
|
|
|
// / \_
|
|
|
|
// | |
|
|
|
|
// TBB FBB
|
|
|
|
// \ /
|
2007-05-18 00:20:58 +00:00
|
|
|
// TailBB
|
2007-06-05 23:46:14 +00:00
|
|
|
// Note TailBB can be empty.
|
2007-05-21 22:22:58 +00:00
|
|
|
BBI.Kind = ICDiamond;
|
2007-05-18 00:20:58 +00:00
|
|
|
BBI.TailBB = TrueBBI.TrueBB;
|
2007-06-04 06:47:22 +00:00
|
|
|
} else {
|
|
|
|
// FIXME: Consider duplicating if BB is small.
|
2007-06-08 09:36:04 +00:00
|
|
|
if (ValidTriangle(TrueBBI, FalseBBI) &&
|
|
|
|
FeasibilityAnalysis(TrueBBI, BBI.BrCond, true)) {
|
|
|
|
// Triangle:
|
|
|
|
// EBB
|
|
|
|
// | \_
|
|
|
|
// | |
|
|
|
|
// | TBB
|
|
|
|
// | /
|
|
|
|
// FBB
|
|
|
|
BBI.Kind = ICTriangle;
|
2007-06-12 23:54:05 +00:00
|
|
|
} else if (ValidTriangle(TrueBBI, FalseBBI, true) &&
|
|
|
|
FeasibilityAnalysis(TrueBBI, BBI.BrCond, true, true)) {
|
|
|
|
BBI.Kind = ICTriangleRev;
|
2007-06-08 09:36:04 +00:00
|
|
|
} else if (ValidSimple(TrueBBI) &&
|
|
|
|
FeasibilityAnalysis(TrueBBI, BBI.BrCond)) {
|
|
|
|
// Simple (split, no rejoin):
|
|
|
|
// EBB
|
|
|
|
// | \_
|
|
|
|
// | |
|
|
|
|
// | TBB---> exit
|
|
|
|
// |
|
|
|
|
// FBB
|
|
|
|
BBI.Kind = ICSimple;
|
|
|
|
} else if (CanRevCond) {
|
2007-06-06 00:57:55 +00:00
|
|
|
// Try the other path...
|
2007-06-08 09:36:04 +00:00
|
|
|
if (ValidTriangle(FalseBBI, TrueBBI) &&
|
|
|
|
FeasibilityAnalysis(FalseBBI, RevCond, true)) {
|
2007-06-09 01:03:43 +00:00
|
|
|
BBI.Kind = ICTriangleFalse;
|
2007-06-08 09:36:04 +00:00
|
|
|
} else if (ValidTriangle(FalseBBI, TrueBBI, true) &&
|
|
|
|
FeasibilityAnalysis(FalseBBI, RevCond, true, true)) {
|
2007-06-09 01:03:43 +00:00
|
|
|
BBI.Kind = ICTriangleFRev;
|
2007-06-08 09:36:04 +00:00
|
|
|
} else if (ValidSimple(FalseBBI) &&
|
|
|
|
FeasibilityAnalysis(FalseBBI, RevCond)) {
|
|
|
|
BBI.Kind = ICSimpleFalse;
|
2007-06-04 06:47:22 +00:00
|
|
|
}
|
|
|
|
}
|
2007-05-16 02:00:57 +00:00
|
|
|
}
|
2007-06-04 06:47:22 +00:00
|
|
|
|
2007-06-11 22:26:22 +00:00
|
|
|
BBI.IsBeingAnalyzed = false;
|
|
|
|
BBI.IsAnalyzed = true;
|
|
|
|
return BBI;
|
2007-05-18 18:14:37 +00:00
|
|
|
}
|
|
|
|
|
2007-05-30 19:49:19 +00:00
|
|
|
/// AttemptRestructuring - Restructure the sub-CFG rooted in the given block to
|
|
|
|
/// expose more if-conversion opportunities. e.g.
|
|
|
|
///
|
|
|
|
/// cmp
|
|
|
|
/// b le BB1
|
|
|
|
/// / \____
|
|
|
|
/// / |
|
|
|
|
/// cmp |
|
|
|
|
/// b eq BB1 |
|
|
|
|
/// / \____ |
|
|
|
|
/// / \ |
|
|
|
|
/// BB1
|
|
|
|
/// ==>
|
|
|
|
///
|
|
|
|
/// cmp
|
|
|
|
/// b eq BB1
|
|
|
|
/// / \____
|
|
|
|
/// / |
|
|
|
|
/// cmp |
|
|
|
|
/// b le BB1 |
|
|
|
|
/// / \____ |
|
|
|
|
/// / \ |
|
|
|
|
/// BB1
|
|
|
|
bool IfConverter::AttemptRestructuring(BBInfo &BBI) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// AnalyzeBlocks - Analyze all blocks and find entries for all if-conversion
|
|
|
|
/// candidates. It returns true if any CFG restructuring is done to expose more
|
|
|
|
/// if-conversion opportunities.
|
|
|
|
bool IfConverter::AnalyzeBlocks(MachineFunction &MF,
|
2007-05-23 07:23:16 +00:00
|
|
|
std::vector<BBInfo*> &Candidates) {
|
2007-05-30 19:49:19 +00:00
|
|
|
bool Change = false;
|
2007-05-18 19:26:33 +00:00
|
|
|
std::set<MachineBasicBlock*> Visited;
|
2007-05-30 19:49:19 +00:00
|
|
|
for (unsigned i = 0, e = Roots.size(); i != e; ++i) {
|
|
|
|
for (idf_ext_iterator<MachineBasicBlock*> I=idf_ext_begin(Roots[i],Visited),
|
|
|
|
E = idf_ext_end(Roots[i], Visited); I != E; ++I) {
|
|
|
|
MachineBasicBlock *BB = *I;
|
2007-06-11 22:26:22 +00:00
|
|
|
BBInfo &BBI = AnalyzeBlock(BB);
|
2007-05-30 19:49:19 +00:00
|
|
|
switch (BBI.Kind) {
|
2007-06-04 06:47:22 +00:00
|
|
|
case ICSimple:
|
|
|
|
case ICSimpleFalse:
|
2007-05-30 19:49:19 +00:00
|
|
|
case ICTriangle:
|
2007-06-12 23:54:05 +00:00
|
|
|
case ICTriangleRev:
|
|
|
|
case ICTriangleFalse:
|
|
|
|
case ICTriangleFRev:
|
2007-05-30 19:49:19 +00:00
|
|
|
case ICDiamond:
|
2007-06-14 20:28:52 +00:00
|
|
|
BBI.IsEnqueued = true;
|
2007-05-30 19:49:19 +00:00
|
|
|
Candidates.push_back(&BBI);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
Change |= AttemptRestructuring(BBI);
|
|
|
|
break;
|
|
|
|
}
|
2007-05-21 22:22:58 +00:00
|
|
|
}
|
2007-05-16 02:00:57 +00:00
|
|
|
}
|
2007-05-30 19:49:19 +00:00
|
|
|
|
2007-06-01 00:12:12 +00:00
|
|
|
// Sort to favor more complex ifcvt scheme.
|
|
|
|
std::stable_sort(Candidates.begin(), Candidates.end(), IfcvtCandidateCmp);
|
|
|
|
|
2007-05-30 19:49:19 +00:00
|
|
|
return Change;
|
2007-05-16 02:00:57 +00:00
|
|
|
}
|
|
|
|
|
2007-06-08 22:01:07 +00:00
|
|
|
/// canFallThroughTo - Returns true either if ToBB is the next block after BB or
|
|
|
|
/// that all the intervening blocks are empty (given BB can fall through to its
|
|
|
|
/// next block).
|
|
|
|
static bool canFallThroughTo(MachineBasicBlock *BB, MachineBasicBlock *ToBB) {
|
2007-06-04 06:47:22 +00:00
|
|
|
MachineFunction::iterator I = BB;
|
2007-06-05 07:05:25 +00:00
|
|
|
MachineFunction::iterator TI = ToBB;
|
|
|
|
MachineFunction::iterator E = BB->getParent()->end();
|
|
|
|
while (++I != TI)
|
|
|
|
if (I == E || !I->empty())
|
2007-06-04 06:47:22 +00:00
|
|
|
return false;
|
|
|
|
return true;
|
2007-05-21 22:22:58 +00:00
|
|
|
}
|
|
|
|
|
2007-05-30 19:49:19 +00:00
|
|
|
/// ReTryPreds - Invalidate predecessor BB info so it would be re-analyzed
|
2007-05-23 07:23:16 +00:00
|
|
|
/// to determine if it can be if-converted.
|
2007-05-30 19:49:19 +00:00
|
|
|
void IfConverter::ReTryPreds(MachineBasicBlock *BB) {
|
2007-05-23 07:23:16 +00:00
|
|
|
for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(),
|
|
|
|
E = BB->pred_end(); PI != E; ++PI) {
|
|
|
|
BBInfo &PBBI = BBAnalysis[(*PI)->getNumber()];
|
2007-06-11 22:26:22 +00:00
|
|
|
if (!PBBI.IsDone && PBBI.Kind == ICNotClassfied) {
|
2007-06-14 20:28:52 +00:00
|
|
|
assert(!PBBI.IsEnqueued && "Unexpected");
|
2007-06-11 22:26:22 +00:00
|
|
|
PBBI.IsAnalyzed = false;
|
|
|
|
}
|
2007-05-23 07:23:16 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-05-29 22:31:16 +00:00
|
|
|
/// InsertUncondBranch - Inserts an unconditional branch from BB to ToBB.
|
|
|
|
///
|
|
|
|
static void InsertUncondBranch(MachineBasicBlock *BB, MachineBasicBlock *ToBB,
|
|
|
|
const TargetInstrInfo *TII) {
|
|
|
|
std::vector<MachineOperand> NoCond;
|
|
|
|
TII->InsertBranch(*BB, ToBB, NULL, NoCond);
|
|
|
|
}
|
|
|
|
|
2007-06-08 22:01:07 +00:00
|
|
|
/// RemoveExtraEdges - Remove true / false edges if either / both are no longer
|
|
|
|
/// successors.
|
|
|
|
void IfConverter::RemoveExtraEdges(BBInfo &BBI) {
|
|
|
|
MachineBasicBlock *TBB = NULL, *FBB = NULL;
|
|
|
|
std::vector<MachineOperand> Cond;
|
|
|
|
bool isAnalyzable = !TII->AnalyzeBranch(*BBI.BB, TBB, FBB, Cond);
|
|
|
|
bool CanFallthrough = isAnalyzable && (TBB == NULL || FBB == NULL);
|
|
|
|
if (BBI.TrueBB && BBI.BB->isSuccessor(BBI.TrueBB))
|
|
|
|
if (!(BBI.TrueBB == TBB || BBI.TrueBB == FBB ||
|
|
|
|
(CanFallthrough && getNextBlock(BBI.BB) == BBI.TrueBB)))
|
|
|
|
BBI.BB->removeSuccessor(BBI.TrueBB);
|
|
|
|
if (BBI.FalseBB && BBI.BB->isSuccessor(BBI.FalseBB))
|
|
|
|
if (!(BBI.FalseBB == TBB || BBI.FalseBB == FBB ||
|
|
|
|
(CanFallthrough && getNextBlock(BBI.BB) == BBI.FalseBB)))
|
|
|
|
BBI.BB->removeSuccessor(BBI.FalseBB);
|
|
|
|
}
|
|
|
|
|
2007-06-04 06:47:22 +00:00
|
|
|
/// IfConvertSimple - If convert a simple (split, no rejoin) sub-CFG.
|
2007-05-21 22:22:58 +00:00
|
|
|
///
|
2007-06-04 06:47:22 +00:00
|
|
|
bool IfConverter::IfConvertSimple(BBInfo &BBI) {
|
2007-05-21 22:22:58 +00:00
|
|
|
BBInfo &TrueBBI = BBAnalysis[BBI.TrueBB->getNumber()];
|
|
|
|
BBInfo &FalseBBI = BBAnalysis[BBI.FalseBB->getNumber()];
|
|
|
|
BBInfo *CvtBBI = &TrueBBI;
|
|
|
|
BBInfo *NextBBI = &FalseBBI;
|
2007-05-23 07:23:16 +00:00
|
|
|
|
2007-06-04 06:47:22 +00:00
|
|
|
std::vector<MachineOperand> Cond(BBI.BrCond);
|
2007-06-06 10:16:17 +00:00
|
|
|
if (BBI.Kind == ICSimpleFalse) {
|
2007-06-01 20:29:21 +00:00
|
|
|
std::swap(CvtBBI, NextBBI);
|
2007-06-04 06:47:22 +00:00
|
|
|
TII->ReverseBranchCondition(Cond);
|
2007-06-01 20:29:21 +00:00
|
|
|
}
|
2007-05-23 07:23:16 +00:00
|
|
|
|
2007-06-04 06:47:22 +00:00
|
|
|
PredicateBlock(*CvtBBI, Cond);
|
2007-05-21 22:22:58 +00:00
|
|
|
|
2007-06-08 22:01:07 +00:00
|
|
|
// Merge converted block into entry block.
|
2007-05-23 07:23:16 +00:00
|
|
|
BBI.NonPredSize -= TII->RemoveBranch(*BBI.BB);
|
2007-05-21 22:22:58 +00:00
|
|
|
MergeBlocks(BBI, *CvtBBI);
|
2007-06-07 02:12:15 +00:00
|
|
|
|
2007-06-06 02:08:52 +00:00
|
|
|
bool IterIfcvt = true;
|
2007-06-08 22:01:07 +00:00
|
|
|
if (!canFallThroughTo(BBI.BB, NextBBI->BB)) {
|
2007-05-29 22:31:16 +00:00
|
|
|
InsertUncondBranch(BBI.BB, NextBBI->BB, TII);
|
2007-06-09 01:03:43 +00:00
|
|
|
BBI.HasFallThrough = false;
|
2007-06-08 09:36:04 +00:00
|
|
|
// Now ifcvt'd block will look like this:
|
|
|
|
// BB:
|
|
|
|
// ...
|
|
|
|
// t, f = cmp
|
|
|
|
// if t op
|
|
|
|
// b BBf
|
|
|
|
//
|
|
|
|
// We cannot further ifcvt this block because the unconditional branch
|
|
|
|
// will have to be predicated on the new condition, that will not be
|
|
|
|
// available if cmp executes.
|
|
|
|
IterIfcvt = false;
|
2007-06-06 02:08:52 +00:00
|
|
|
}
|
2007-05-23 07:23:16 +00:00
|
|
|
|
2007-06-08 22:01:07 +00:00
|
|
|
RemoveExtraEdges(BBI);
|
|
|
|
|
2007-05-23 07:23:16 +00:00
|
|
|
// Update block info. BB can be iteratively if-converted.
|
2007-06-11 22:26:22 +00:00
|
|
|
if (!IterIfcvt)
|
|
|
|
BBI.IsDone = true;
|
2007-05-30 19:49:19 +00:00
|
|
|
ReTryPreds(BBI.BB);
|
2007-06-11 22:26:22 +00:00
|
|
|
CvtBBI->IsDone = true;
|
2007-05-21 22:22:58 +00:00
|
|
|
|
|
|
|
// FIXME: Must maintain LiveIns.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2007-05-16 21:54:37 +00:00
|
|
|
/// IfConvertTriangle - If convert a triangle sub-CFG.
|
|
|
|
///
|
2007-05-16 02:00:57 +00:00
|
|
|
bool IfConverter::IfConvertTriangle(BBInfo &BBI) {
|
2007-05-23 07:23:16 +00:00
|
|
|
BBInfo &TrueBBI = BBAnalysis[BBI.TrueBB->getNumber()];
|
2007-06-09 01:03:43 +00:00
|
|
|
BBInfo &FalseBBI = BBAnalysis[BBI.FalseBB->getNumber()];
|
|
|
|
BBInfo *CvtBBI = &TrueBBI;
|
|
|
|
BBInfo *NextBBI = &FalseBBI;
|
|
|
|
|
|
|
|
std::vector<MachineOperand> Cond(BBI.BrCond);
|
|
|
|
if (BBI.Kind == ICTriangleFalse || BBI.Kind == ICTriangleFRev) {
|
|
|
|
std::swap(CvtBBI, NextBBI);
|
|
|
|
TII->ReverseBranchCondition(Cond);
|
|
|
|
}
|
2007-06-12 23:54:05 +00:00
|
|
|
if (BBI.Kind == ICTriangleRev || BBI.Kind == ICTriangleFRev) {
|
|
|
|
ReverseBranchCondition(*CvtBBI);
|
|
|
|
// BB has been changed, modify its predecessors (except for this
|
|
|
|
// one) so they don't get ifcvt'ed based on bad intel.
|
|
|
|
for (MachineBasicBlock::pred_iterator PI = CvtBBI->BB->pred_begin(),
|
|
|
|
E = CvtBBI->BB->pred_end(); PI != E; ++PI) {
|
|
|
|
MachineBasicBlock *PBB = *PI;
|
|
|
|
if (PBB == BBI.BB)
|
|
|
|
continue;
|
|
|
|
BBInfo &PBBI = BBAnalysis[PBB->getNumber()];
|
|
|
|
if (PBBI.IsEnqueued)
|
|
|
|
PBBI.IsEnqueued = false;
|
|
|
|
}
|
|
|
|
}
|
2007-06-01 07:41:07 +00:00
|
|
|
|
2007-05-21 22:22:58 +00:00
|
|
|
// Predicate the 'true' block after removing its branch.
|
2007-06-13 00:04:00 +00:00
|
|
|
CvtBBI->NonPredSize -= TII->RemoveBranch(*CvtBBI->BB);
|
2007-06-09 01:03:43 +00:00
|
|
|
PredicateBlock(*CvtBBI, Cond);
|
2007-05-16 02:00:57 +00:00
|
|
|
|
2007-06-04 06:47:22 +00:00
|
|
|
// If 'true' block has a 'false' successor, add an exit branch to it.
|
2007-06-09 01:03:43 +00:00
|
|
|
bool HasEarlyExit = CvtBBI->FalseBB != NULL;
|
2007-06-05 01:31:40 +00:00
|
|
|
if (HasEarlyExit) {
|
2007-06-09 01:03:43 +00:00
|
|
|
std::vector<MachineOperand> RevCond(CvtBBI->BrCond);
|
2007-06-01 07:41:07 +00:00
|
|
|
if (TII->ReverseBranchCondition(RevCond))
|
|
|
|
assert(false && "Unable to reverse branch condition!");
|
2007-06-09 01:03:43 +00:00
|
|
|
TII->InsertBranch(*CvtBBI->BB, CvtBBI->FalseBB, NULL, RevCond);
|
2007-06-01 07:41:07 +00:00
|
|
|
}
|
|
|
|
|
2007-06-08 09:36:04 +00:00
|
|
|
// Now merge the entry of the triangle with the true block.
|
|
|
|
BBI.NonPredSize -= TII->RemoveBranch(*BBI.BB);
|
2007-06-09 01:03:43 +00:00
|
|
|
MergeBlocks(BBI, *CvtBBI);
|
2007-06-08 09:36:04 +00:00
|
|
|
|
|
|
|
// Merge in the 'false' block if the 'false' block has no other
|
|
|
|
// predecessors. Otherwise, add a unconditional branch from to 'false'.
|
2007-06-05 00:07:37 +00:00
|
|
|
bool FalseBBDead = false;
|
2007-06-06 02:08:52 +00:00
|
|
|
bool IterIfcvt = true;
|
2007-06-09 01:03:43 +00:00
|
|
|
bool isFallThrough = canFallThroughTo(BBI.BB, NextBBI->BB);
|
2007-06-07 08:13:00 +00:00
|
|
|
if (!isFallThrough) {
|
|
|
|
// Only merge them if the true block does not fallthrough to the false
|
|
|
|
// block. By not merging them, we make it possible to iteratively
|
|
|
|
// ifcvt the blocks.
|
2007-06-09 01:03:43 +00:00
|
|
|
if (!HasEarlyExit && NextBBI->BB->pred_size() == 1) {
|
|
|
|
MergeBlocks(BBI, *NextBBI);
|
2007-06-07 08:13:00 +00:00
|
|
|
FalseBBDead = true;
|
|
|
|
} else {
|
2007-06-09 01:03:43 +00:00
|
|
|
InsertUncondBranch(BBI.BB, NextBBI->BB, TII);
|
|
|
|
BBI.HasFallThrough = false;
|
2007-06-07 08:13:00 +00:00
|
|
|
}
|
2007-06-08 09:36:04 +00:00
|
|
|
// Mixed predicated and unpredicated code. This cannot be iteratively
|
|
|
|
// predicated.
|
|
|
|
IterIfcvt = false;
|
2007-06-06 02:08:52 +00:00
|
|
|
}
|
2007-05-16 02:00:57 +00:00
|
|
|
|
2007-06-08 22:01:07 +00:00
|
|
|
RemoveExtraEdges(BBI);
|
2007-05-18 00:20:58 +00:00
|
|
|
|
2007-05-23 07:23:16 +00:00
|
|
|
// Update block info. BB can be iteratively if-converted.
|
2007-06-11 22:26:22 +00:00
|
|
|
if (!IterIfcvt)
|
|
|
|
BBI.IsDone = true;
|
2007-05-30 19:49:19 +00:00
|
|
|
ReTryPreds(BBI.BB);
|
2007-06-11 22:26:22 +00:00
|
|
|
CvtBBI->IsDone = true;
|
2007-06-05 00:07:37 +00:00
|
|
|
if (FalseBBDead)
|
2007-06-11 22:26:22 +00:00
|
|
|
NextBBI->IsDone = true;
|
2007-05-16 02:00:57 +00:00
|
|
|
|
2007-05-21 22:22:58 +00:00
|
|
|
// FIXME: Must maintain LiveIns.
|
|
|
|
return true;
|
2007-05-16 02:00:57 +00:00
|
|
|
}
|
|
|
|
|
2007-05-16 21:54:37 +00:00
|
|
|
/// IfConvertDiamond - If convert a diamond sub-CFG.
|
|
|
|
///
|
2007-05-16 02:00:57 +00:00
|
|
|
bool IfConverter::IfConvertDiamond(BBInfo &BBI) {
|
2007-06-04 06:47:22 +00:00
|
|
|
BBInfo &TrueBBI = BBAnalysis[BBI.TrueBB->getNumber()];
|
2007-05-18 18:14:37 +00:00
|
|
|
BBInfo &FalseBBI = BBAnalysis[BBI.FalseBB->getNumber()];
|
|
|
|
|
2007-05-21 22:22:58 +00:00
|
|
|
SmallVector<MachineInstr*, 2> Dups;
|
2007-06-04 06:47:22 +00:00
|
|
|
if (!BBI.TailBB) {
|
|
|
|
// No common merge block. Check if the terminators (e.g. return) are
|
|
|
|
// the same or predicable.
|
|
|
|
MachineBasicBlock::iterator TT = BBI.TrueBB->getFirstTerminator();
|
|
|
|
MachineBasicBlock::iterator FT = BBI.FalseBB->getFirstTerminator();
|
|
|
|
while (TT != BBI.TrueBB->end() && FT != BBI.FalseBB->end()) {
|
|
|
|
if (TT->isIdenticalTo(FT))
|
|
|
|
Dups.push_back(TT); // Will erase these later.
|
|
|
|
else if (!TT->isPredicable() && !FT->isPredicable())
|
|
|
|
return false; // Can't if-convert. Abort!
|
|
|
|
++TT;
|
|
|
|
++FT;
|
2007-05-18 18:14:37 +00:00
|
|
|
}
|
2007-05-16 02:00:57 +00:00
|
|
|
|
2007-06-04 06:47:22 +00:00
|
|
|
// One of the two pathes have more terminators, make sure they are
|
|
|
|
// all predicable.
|
|
|
|
while (TT != BBI.TrueBB->end()) {
|
|
|
|
if (!TT->isPredicable()) {
|
|
|
|
return false; // Can't if-convert. Abort!
|
2007-05-21 22:22:58 +00:00
|
|
|
}
|
2007-06-04 06:47:22 +00:00
|
|
|
++TT;
|
|
|
|
}
|
|
|
|
while (FT != BBI.FalseBB->end()) {
|
|
|
|
if (!FT->isPredicable()) {
|
|
|
|
return false; // Can't if-convert. Abort!
|
|
|
|
}
|
|
|
|
++FT;
|
2007-05-18 00:20:58 +00:00
|
|
|
}
|
2007-05-21 22:22:58 +00:00
|
|
|
}
|
2007-05-16 02:00:57 +00:00
|
|
|
|
2007-05-21 22:22:58 +00:00
|
|
|
// Remove the duplicated instructions from the 'true' block.
|
|
|
|
for (unsigned i = 0, e = Dups.size(); i != e; ++i) {
|
|
|
|
Dups[i]->eraseFromParent();
|
2007-05-23 07:23:16 +00:00
|
|
|
--TrueBBI.NonPredSize;
|
2007-05-21 22:22:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Merge the 'true' and 'false' blocks by copying the instructions
|
|
|
|
// from the 'false' block to the 'true' block. That is, unless the true
|
|
|
|
// block would clobber the predicate, in that case, do the opposite.
|
2007-06-05 23:46:14 +00:00
|
|
|
BBInfo *BBI1 = &TrueBBI;
|
|
|
|
BBInfo *BBI2 = &FalseBBI;
|
2007-06-04 06:47:22 +00:00
|
|
|
std::vector<MachineOperand> RevCond(BBI.BrCond);
|
|
|
|
TII->ReverseBranchCondition(RevCond);
|
2007-06-05 23:46:14 +00:00
|
|
|
std::vector<MachineOperand> *Cond1 = &BBI.BrCond;
|
|
|
|
std::vector<MachineOperand> *Cond2 = &RevCond;
|
|
|
|
// Check the 'true' and 'false' blocks if either isn't ended with a branch.
|
|
|
|
// Either the block fallthrough to another block or it ends with a
|
|
|
|
// return. If it's the former, add a branch to its successor.
|
|
|
|
bool NeedBr1 = !BBI1->TrueBB && BBI1->BB->succ_size();
|
2007-06-06 00:57:55 +00:00
|
|
|
bool NeedBr2 = !BBI2->TrueBB && BBI2->BB->succ_size();
|
|
|
|
|
2007-06-11 22:26:22 +00:00
|
|
|
if ((TrueBBI.ClobbersPred && !FalseBBI.ClobbersPred) ||
|
|
|
|
(!TrueBBI.ClobbersPred && !FalseBBI.ClobbersPred &&
|
2007-06-06 00:57:55 +00:00
|
|
|
NeedBr1 && !NeedBr2)) {
|
|
|
|
std::swap(BBI1, BBI2);
|
|
|
|
std::swap(Cond1, Cond2);
|
|
|
|
std::swap(NeedBr1, NeedBr2);
|
|
|
|
}
|
2007-06-05 23:46:14 +00:00
|
|
|
|
|
|
|
// Predicate the 'true' block after removing its branch.
|
|
|
|
BBI1->NonPredSize -= TII->RemoveBranch(*BBI1->BB);
|
|
|
|
PredicateBlock(*BBI1, *Cond1);
|
|
|
|
|
|
|
|
// Add an early exit branch if needed.
|
|
|
|
if (NeedBr1)
|
|
|
|
TII->InsertBranch(*BBI1->BB, *BBI1->BB->succ_begin(), NULL, *Cond1);
|
|
|
|
|
|
|
|
// Predicate the 'false' block.
|
|
|
|
PredicateBlock(*BBI2, *Cond2, true);
|
|
|
|
|
|
|
|
// Add an unconditional branch from 'false' to to 'false' successor if it
|
|
|
|
// will not be the fallthrough block.
|
2007-06-07 02:12:15 +00:00
|
|
|
if (NeedBr2 && !NeedBr1) {
|
|
|
|
// If BBI2 isn't going to be merged in, then the existing fallthrough
|
|
|
|
// or branch is fine.
|
2007-06-08 22:01:07 +00:00
|
|
|
if (!canFallThroughTo(BBI.BB, *BBI2->BB->succ_begin())) {
|
2007-06-07 02:12:15 +00:00
|
|
|
InsertUncondBranch(BBI2->BB, *BBI2->BB->succ_begin(), TII);
|
2007-06-09 01:03:43 +00:00
|
|
|
BBI2->HasFallThrough = false;
|
2007-06-07 02:12:15 +00:00
|
|
|
}
|
|
|
|
}
|
2007-06-05 23:46:14 +00:00
|
|
|
|
|
|
|
// Keep them as two separate blocks if there is an early exit.
|
|
|
|
if (!NeedBr1)
|
|
|
|
MergeBlocks(*BBI1, *BBI2);
|
|
|
|
|
2007-05-21 22:22:58 +00:00
|
|
|
// Remove the conditional branch from entry to the blocks.
|
2007-05-23 07:23:16 +00:00
|
|
|
BBI.NonPredSize -= TII->RemoveBranch(*BBI.BB);
|
2007-05-21 22:22:58 +00:00
|
|
|
|
2007-06-05 23:46:14 +00:00
|
|
|
// Merge the combined block into the entry of the diamond.
|
|
|
|
MergeBlocks(BBI, *BBI1);
|
2007-05-18 00:20:58 +00:00
|
|
|
|
2007-06-06 00:57:55 +00:00
|
|
|
// 'True' and 'false' aren't combined, see if we need to add a unconditional
|
|
|
|
// branch to the 'false' block.
|
2007-06-08 22:01:07 +00:00
|
|
|
if (NeedBr1 && !canFallThroughTo(BBI.BB, BBI2->BB)) {
|
2007-06-07 02:12:15 +00:00
|
|
|
InsertUncondBranch(BBI.BB, BBI2->BB, TII);
|
2007-06-09 01:03:43 +00:00
|
|
|
BBI1->HasFallThrough = false;
|
2007-06-07 02:12:15 +00:00
|
|
|
}
|
2007-06-06 00:57:55 +00:00
|
|
|
|
2007-05-29 23:37:20 +00:00
|
|
|
// If the if-converted block fallthrough or unconditionally branch into the
|
|
|
|
// tail block, and the tail block does not have other predecessors, then
|
2007-05-21 22:22:58 +00:00
|
|
|
// fold the tail block in as well.
|
2007-06-05 23:46:14 +00:00
|
|
|
BBInfo *CvtBBI = NeedBr1 ? BBI2 : &BBI;
|
2007-05-29 23:37:20 +00:00
|
|
|
if (BBI.TailBB &&
|
2007-05-31 20:53:33 +00:00
|
|
|
BBI.TailBB->pred_size() == 1 && CvtBBI->BB->succ_size() == 1) {
|
2007-05-23 07:23:16 +00:00
|
|
|
CvtBBI->NonPredSize -= TII->RemoveBranch(*CvtBBI->BB);
|
2007-05-21 22:22:58 +00:00
|
|
|
BBInfo TailBBI = BBAnalysis[BBI.TailBB->getNumber()];
|
|
|
|
MergeBlocks(*CvtBBI, TailBBI);
|
2007-06-11 22:26:22 +00:00
|
|
|
TailBBI.IsDone = true;
|
2007-05-21 22:22:58 +00:00
|
|
|
}
|
2007-05-18 00:20:58 +00:00
|
|
|
|
2007-06-08 22:01:07 +00:00
|
|
|
RemoveExtraEdges(BBI);
|
|
|
|
|
2007-06-05 23:46:14 +00:00
|
|
|
// Update block info.
|
2007-06-11 22:26:22 +00:00
|
|
|
BBI.IsDone = TrueBBI.IsDone = FalseBBI.IsDone = true;
|
2007-05-16 02:00:57 +00:00
|
|
|
|
2007-05-21 22:22:58 +00:00
|
|
|
// FIXME: Must maintain LiveIns.
|
|
|
|
return true;
|
2007-05-16 02:00:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// PredicateBlock - Predicate every instruction in the block with the specified
|
|
|
|
/// condition. If IgnoreTerm is true, skip over all terminator instructions.
|
2007-05-23 07:23:16 +00:00
|
|
|
void IfConverter::PredicateBlock(BBInfo &BBI,
|
2007-05-16 02:00:57 +00:00
|
|
|
std::vector<MachineOperand> &Cond,
|
|
|
|
bool IgnoreTerm) {
|
2007-05-23 07:23:16 +00:00
|
|
|
for (MachineBasicBlock::iterator I = BBI.BB->begin(), E = BBI.BB->end();
|
2007-05-16 02:00:57 +00:00
|
|
|
I != E; ++I) {
|
2007-06-04 06:47:22 +00:00
|
|
|
if (IgnoreTerm && TII->isTerminatorInstr(I->getOpcode()))
|
2007-05-23 07:23:16 +00:00
|
|
|
continue;
|
2007-06-04 06:47:22 +00:00
|
|
|
if (TII->isPredicated(I))
|
2007-05-16 02:00:57 +00:00
|
|
|
continue;
|
2007-06-04 06:47:22 +00:00
|
|
|
if (!TII->PredicateInstruction(I, Cond)) {
|
2007-06-01 00:55:26 +00:00
|
|
|
cerr << "Unable to predicate " << *I << "!\n";
|
2007-05-16 21:54:37 +00:00
|
|
|
abort();
|
|
|
|
}
|
2007-05-16 02:00:57 +00:00
|
|
|
}
|
2007-05-23 07:23:16 +00:00
|
|
|
|
2007-06-14 20:28:52 +00:00
|
|
|
BBI.IsAnalyzed = false;
|
2007-05-23 07:23:16 +00:00
|
|
|
BBI.NonPredSize = 0;
|
2007-06-08 19:17:12 +00:00
|
|
|
std::copy(Cond.begin(), Cond.end(), std::back_inserter(BBI.Predicate));
|
|
|
|
|
2007-06-04 06:47:22 +00:00
|
|
|
NumIfConvBBs++;
|
|
|
|
}
|
|
|
|
|
2007-05-18 00:20:58 +00:00
|
|
|
/// MergeBlocks - Move all instructions from FromBB to the end of ToBB.
|
2007-05-16 02:00:57 +00:00
|
|
|
///
|
2007-05-18 00:20:58 +00:00
|
|
|
void IfConverter::MergeBlocks(BBInfo &ToBBI, BBInfo &FromBBI) {
|
|
|
|
ToBBI.BB->splice(ToBBI.BB->end(),
|
|
|
|
FromBBI.BB, FromBBI.BB->begin(), FromBBI.BB->end());
|
2007-05-23 07:23:16 +00:00
|
|
|
|
2007-06-04 06:47:22 +00:00
|
|
|
// Redirect all branches to FromBB to ToBB.
|
2007-06-05 22:03:53 +00:00
|
|
|
std::vector<MachineBasicBlock *> Preds(FromBBI.BB->pred_begin(),
|
|
|
|
FromBBI.BB->pred_end());
|
2007-06-07 02:12:15 +00:00
|
|
|
for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
|
|
|
|
MachineBasicBlock *Pred = Preds[i];
|
|
|
|
if (Pred == ToBBI.BB)
|
|
|
|
continue;
|
|
|
|
Pred->ReplaceUsesOfBlockWith(FromBBI.BB, ToBBI.BB);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(),
|
|
|
|
FromBBI.BB->succ_end());
|
2007-06-08 22:01:07 +00:00
|
|
|
MachineBasicBlock *NBB = getNextBlock(FromBBI.BB);
|
2007-06-09 01:03:43 +00:00
|
|
|
MachineBasicBlock *FallThrough = FromBBI.HasFallThrough ? NBB : NULL;
|
2007-06-07 02:12:15 +00:00
|
|
|
|
|
|
|
for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
|
|
|
|
MachineBasicBlock *Succ = Succs[i];
|
2007-06-08 22:01:07 +00:00
|
|
|
// Fallthrough edge can't be transferred.
|
2007-06-07 02:12:15 +00:00
|
|
|
if (Succ == FallThrough)
|
|
|
|
continue;
|
|
|
|
FromBBI.BB->removeSuccessor(Succ);
|
|
|
|
if (!ToBBI.BB->isSuccessor(Succ))
|
|
|
|
ToBBI.BB->addSuccessor(Succ);
|
|
|
|
}
|
2007-06-04 06:47:22 +00:00
|
|
|
|
2007-06-08 22:01:07 +00:00
|
|
|
// Now FromBBI always fall through to the next block!
|
|
|
|
if (NBB)
|
|
|
|
FromBBI.BB->addSuccessor(NBB);
|
|
|
|
|
2007-05-23 07:23:16 +00:00
|
|
|
ToBBI.NonPredSize += FromBBI.NonPredSize;
|
|
|
|
FromBBI.NonPredSize = 0;
|
2007-06-06 10:16:17 +00:00
|
|
|
|
2007-06-11 22:26:22 +00:00
|
|
|
ToBBI.ClobbersPred |= FromBBI.ClobbersPred;
|
2007-06-09 01:03:43 +00:00
|
|
|
ToBBI.HasFallThrough = FromBBI.HasFallThrough;
|
2007-06-08 19:17:12 +00:00
|
|
|
|
|
|
|
std::copy(FromBBI.Predicate.begin(), FromBBI.Predicate.end(),
|
|
|
|
std::back_inserter(ToBBI.Predicate));
|
|
|
|
FromBBI.Predicate.clear();
|
2007-06-14 20:28:52 +00:00
|
|
|
|
|
|
|
ToBBI.IsAnalyzed = false;
|
|
|
|
FromBBI.IsAnalyzed = false;
|
2007-05-16 02:00:57 +00:00
|
|
|
}
|