2005-01-07 07:47:53 +00:00
|
|
|
//===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===//
|
2005-04-21 22:36:52 +00:00
|
|
|
//
|
2005-01-07 07:47:53 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 22:36:52 +00:00
|
|
|
//
|
2005-01-07 07:47:53 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This implements the SelectionDAGISel class.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#define DEBUG_TYPE "isel"
|
2009-02-06 17:22:58 +00:00
|
|
|
#include "ScheduleDAGSDNodes.h"
|
2009-11-23 18:04:58 +00:00
|
|
|
#include "SelectionDAGBuilder.h"
|
2010-07-07 16:01:37 +00:00
|
|
|
#include "llvm/CodeGen/FunctionLoweringInfo.h"
|
2009-02-06 17:22:58 +00:00
|
|
|
#include "llvm/CodeGen/SelectionDAGISel.h"
|
2006-10-16 20:52:31 +00:00
|
|
|
#include "llvm/Analysis/AliasAnalysis.h"
|
2011-06-16 20:22:37 +00:00
|
|
|
#include "llvm/Analysis/BranchProbabilityInfo.h"
|
2009-09-16 21:09:07 +00:00
|
|
|
#include "llvm/Analysis/DebugInfo.h"
|
2007-04-04 21:14:49 +00:00
|
|
|
#include "llvm/Constants.h"
|
2005-01-07 07:47:53 +00:00
|
|
|
#include "llvm/Function.h"
|
2006-01-26 22:24:51 +00:00
|
|
|
#include "llvm/InlineAsm.h"
|
2005-01-07 07:47:53 +00:00
|
|
|
#include "llvm/Instructions.h"
|
|
|
|
#include "llvm/Intrinsics.h"
|
2006-03-23 18:06:46 +00:00
|
|
|
#include "llvm/IntrinsicInst.h"
|
2009-10-27 17:02:08 +00:00
|
|
|
#include "llvm/LLVMContext.h"
|
2010-05-26 19:46:12 +00:00
|
|
|
#include "llvm/Module.h"
|
2008-08-19 22:33:34 +00:00
|
|
|
#include "llvm/CodeGen/FastISel.h"
|
2008-08-17 12:56:54 +00:00
|
|
|
#include "llvm/CodeGen/GCStrategy.h"
|
2008-08-17 18:44:35 +00:00
|
|
|
#include "llvm/CodeGen/GCMetadata.h"
|
2010-05-14 21:14:32 +00:00
|
|
|
#include "llvm/CodeGen/MachineFrameInfo.h"
|
2005-01-07 07:47:53 +00:00
|
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
|
|
|
#include "llvm/CodeGen/MachineInstrBuilder.h"
|
2007-12-31 04:13:23 +00:00
|
|
|
#include "llvm/CodeGen/MachineModuleInfo.h"
|
|
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
2009-01-15 22:18:12 +00:00
|
|
|
#include "llvm/CodeGen/ScheduleHazardRecognizer.h"
|
2006-08-02 12:30:23 +00:00
|
|
|
#include "llvm/CodeGen/SchedulerRegistry.h"
|
2005-01-07 07:47:53 +00:00
|
|
|
#include "llvm/CodeGen/SelectionDAG.h"
|
2008-02-10 18:45:23 +00:00
|
|
|
#include "llvm/Target/TargetRegisterInfo.h"
|
2009-10-29 22:30:23 +00:00
|
|
|
#include "llvm/Target/TargetIntrinsicInfo.h"
|
2005-01-07 07:47:53 +00:00
|
|
|
#include "llvm/Target/TargetInstrInfo.h"
|
|
|
|
#include "llvm/Target/TargetLowering.h"
|
|
|
|
#include "llvm/Target/TargetMachine.h"
|
2006-05-23 13:43:15 +00:00
|
|
|
#include "llvm/Target/TargetOptions.h"
|
2010-12-19 04:58:57 +00:00
|
|
|
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
|
2006-08-27 12:54:02 +00:00
|
|
|
#include "llvm/Support/Compiler.h"
|
2008-06-30 20:45:06 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2009-07-11 13:10:19 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2008-06-30 20:45:06 +00:00
|
|
|
#include "llvm/Support/Timer.h"
|
2009-07-25 00:23:56 +00:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2011-02-24 10:00:04 +00:00
|
|
|
#include "llvm/ADT/PostOrderIterator.h"
|
2010-03-04 19:46:56 +00:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2006-02-24 02:52:40 +00:00
|
|
|
#include <algorithm>
|
2005-01-07 07:47:53 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2010-03-04 19:46:56 +00:00
|
|
|
STATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on");
|
2011-05-16 21:51:07 +00:00
|
|
|
STATISTIC(NumFastIselSuccess, "Number of instructions fast isel selected");
|
2010-10-25 20:55:43 +00:00
|
|
|
STATISTIC(NumFastIselBlocks, "Number of blocks selected entirely by fast isel");
|
|
|
|
STATISTIC(NumDAGBlocks, "Number of blocks selected using DAG");
|
2010-03-28 19:46:56 +00:00
|
|
|
STATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path");
|
2010-10-26 00:51:57 +00:00
|
|
|
|
2008-08-19 22:33:34 +00:00
|
|
|
static cl::opt<bool>
|
2008-09-09 22:06:46 +00:00
|
|
|
EnableFastISelVerbose("fast-isel-verbose", cl::Hidden,
|
2008-10-20 21:30:12 +00:00
|
|
|
cl::desc("Enable verbose messages in the \"fast\" "
|
2008-09-09 22:06:46 +00:00
|
|
|
"instruction selector"));
|
|
|
|
static cl::opt<bool>
|
2008-09-09 23:05:00 +00:00
|
|
|
EnableFastISelAbort("fast-isel-abort", cl::Hidden,
|
|
|
|
cl::desc("Enable abort calls when \"fast\" instruction fails"));
|
2008-06-17 06:09:18 +00:00
|
|
|
|
2011-06-16 20:22:37 +00:00
|
|
|
static cl::opt<bool>
|
|
|
|
UseMBPI("use-mbpi",
|
|
|
|
cl::desc("use Machine Branch Probability Info"),
|
|
|
|
cl::init(true), cl::Hidden);
|
|
|
|
|
2005-09-01 18:44:10 +00:00
|
|
|
#ifndef NDEBUG
|
2005-01-12 03:41:21 +00:00
|
|
|
static cl::opt<bool>
|
2008-07-21 20:00:07 +00:00
|
|
|
ViewDAGCombine1("view-dag-combine1-dags", cl::Hidden,
|
|
|
|
cl::desc("Pop up a window to show dags before the first "
|
|
|
|
"dag combine pass"));
|
|
|
|
static cl::opt<bool>
|
|
|
|
ViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden,
|
|
|
|
cl::desc("Pop up a window to show dags before legalize types"));
|
|
|
|
static cl::opt<bool>
|
|
|
|
ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
|
|
|
|
cl::desc("Pop up a window to show dags before legalize"));
|
|
|
|
static cl::opt<bool>
|
|
|
|
ViewDAGCombine2("view-dag-combine2-dags", cl::Hidden,
|
|
|
|
cl::desc("Pop up a window to show dags before the second "
|
|
|
|
"dag combine pass"));
|
|
|
|
static cl::opt<bool>
|
2008-11-24 14:53:14 +00:00
|
|
|
ViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden,
|
|
|
|
cl::desc("Pop up a window to show dags before the post legalize types"
|
|
|
|
" dag combine pass"));
|
|
|
|
static cl::opt<bool>
|
2006-01-21 02:32:06 +00:00
|
|
|
ViewISelDAGs("view-isel-dags", cl::Hidden,
|
|
|
|
cl::desc("Pop up a window to show isel dags as they are selected"));
|
|
|
|
static cl::opt<bool>
|
|
|
|
ViewSchedDAGs("view-sched-dags", cl::Hidden,
|
|
|
|
cl::desc("Pop up a window to show sched dags as they are processed"));
|
2007-08-28 20:32:58 +00:00
|
|
|
static cl::opt<bool>
|
|
|
|
ViewSUnitDAGs("view-sunit-dags", cl::Hidden,
|
2008-01-25 17:24:52 +00:00
|
|
|
cl::desc("Pop up a window to show SUnit dags after they are processed"));
|
2005-01-12 03:41:21 +00:00
|
|
|
#else
|
2008-07-21 20:00:07 +00:00
|
|
|
static const bool ViewDAGCombine1 = false,
|
|
|
|
ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false,
|
|
|
|
ViewDAGCombine2 = false,
|
2008-11-24 14:53:14 +00:00
|
|
|
ViewDAGCombineLT = false,
|
2008-07-21 20:00:07 +00:00
|
|
|
ViewISelDAGs = false, ViewSchedDAGs = false,
|
|
|
|
ViewSUnitDAGs = false;
|
2005-01-12 03:41:21 +00:00
|
|
|
#endif
|
|
|
|
|
2006-08-02 12:30:23 +00:00
|
|
|
//===---------------------------------------------------------------------===//
|
|
|
|
///
|
|
|
|
/// RegisterScheduler class - Track the registration of instruction schedulers.
|
|
|
|
///
|
|
|
|
//===---------------------------------------------------------------------===//
|
|
|
|
MachinePassRegistry RegisterScheduler::Registry;
|
|
|
|
|
|
|
|
//===---------------------------------------------------------------------===//
|
|
|
|
///
|
|
|
|
/// ISHeuristic command line option for instruction schedulers.
|
|
|
|
///
|
|
|
|
//===---------------------------------------------------------------------===//
|
2008-05-13 00:00:25 +00:00
|
|
|
static cl::opt<RegisterScheduler::FunctionPassCtor, false,
|
|
|
|
RegisterPassParser<RegisterScheduler> >
|
|
|
|
ISHeuristic("pre-RA-sched",
|
|
|
|
cl::init(&createDefaultScheduler),
|
|
|
|
cl::desc("Instruction schedulers available (before register"
|
|
|
|
" allocation):"));
|
2006-08-01 14:21:23 +00:00
|
|
|
|
2008-05-13 00:00:25 +00:00
|
|
|
static RegisterScheduler
|
2008-10-14 20:25:08 +00:00
|
|
|
defaultListDAGScheduler("default", "Best scheduler for the target",
|
2008-05-13 00:00:25 +00:00
|
|
|
createDefaultScheduler);
|
2006-01-23 07:01:07 +00:00
|
|
|
|
2008-09-03 16:12:24 +00:00
|
|
|
namespace llvm {
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
/// createDefaultScheduler - This creates an instruction scheduler appropriate
|
|
|
|
/// for the target.
|
2009-02-11 04:27:20 +00:00
|
|
|
ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS,
|
2009-04-29 23:29:43 +00:00
|
|
|
CodeGenOpt::Level OptLevel) {
|
2009-01-15 16:58:17 +00:00
|
|
|
const TargetLowering &TLI = IS->getTargetLowering();
|
|
|
|
|
2009-04-29 23:29:43 +00:00
|
|
|
if (OptLevel == CodeGenOpt::None)
|
2010-07-16 02:01:19 +00:00
|
|
|
return createSourceListDAGScheduler(IS, OptLevel);
|
2010-05-19 20:19:50 +00:00
|
|
|
if (TLI.getSchedulingPreference() == Sched::Latency)
|
2009-04-29 00:15:41 +00:00
|
|
|
return createTDListDAGScheduler(IS, OptLevel);
|
2010-05-20 06:13:19 +00:00
|
|
|
if (TLI.getSchedulingPreference() == Sched::RegPressure)
|
|
|
|
return createBURRListDAGScheduler(IS, OptLevel);
|
2010-07-24 00:39:05 +00:00
|
|
|
if (TLI.getSchedulingPreference() == Sched::Hybrid)
|
|
|
|
return createHybridListDAGScheduler(IS, OptLevel);
|
|
|
|
assert(TLI.getSchedulingPreference() == Sched::ILP &&
|
2010-05-19 20:19:50 +00:00
|
|
|
"Unknown sched type!");
|
2010-07-24 00:39:05 +00:00
|
|
|
return createILPListDAGScheduler(IS, OptLevel);
|
2007-04-12 06:00:20 +00:00
|
|
|
}
|
2005-01-07 07:47:53 +00:00
|
|
|
}
|
|
|
|
|
2008-01-30 18:18:23 +00:00
|
|
|
// EmitInstrWithCustomInserter - This method should be implemented by targets
|
2009-10-29 18:10:34 +00:00
|
|
|
// that mark instructions with the 'usesCustomInserter' flag. These
|
2005-08-26 20:54:47 +00:00
|
|
|
// instructions are special in various ways, which require special support to
|
|
|
|
// insert. The specified MachineInstr is created but not inserted into any
|
2009-10-29 18:10:34 +00:00
|
|
|
// basic blocks, and this method is called to expand it into a sequence of
|
|
|
|
// instructions, potentially also creating new basic blocks and control flow.
|
|
|
|
// When new basic blocks are inserted and the edges from MBB to its successors
|
|
|
|
// are modified, the method should insert pairs of <OldSucc, NewSucc> into the
|
|
|
|
// DenseMap.
|
2010-05-01 00:01:06 +00:00
|
|
|
MachineBasicBlock *
|
|
|
|
TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
|
|
|
|
MachineBasicBlock *MBB) const {
|
2009-07-12 20:07:01 +00:00
|
|
|
#ifndef NDEBUG
|
2010-01-05 01:26:11 +00:00
|
|
|
dbgs() << "If a target marks an instruction with "
|
2009-10-29 18:10:34 +00:00
|
|
|
"'usesCustomInserter', it must implement "
|
2009-07-12 20:07:01 +00:00
|
|
|
"TargetLowering::EmitInstrWithCustomInserter!";
|
|
|
|
#endif
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable(0);
|
2009-09-20 02:20:51 +00:00
|
|
|
return 0;
|
2005-08-26 20:54:47 +00:00
|
|
|
}
|
|
|
|
|
2011-08-30 19:09:48 +00:00
|
|
|
void TargetLowering::AdjustInstrPostInstrSelection(MachineInstr *MI,
|
|
|
|
SDNode *Node) const {
|
|
|
|
#ifndef NDEBUG
|
|
|
|
dbgs() << "If a target marks an instruction with "
|
|
|
|
"'hasPostISelHook', it must implement "
|
|
|
|
"TargetLowering::AdjustInstrPostInstrSelection!";
|
|
|
|
#endif
|
|
|
|
llvm_unreachable(0);
|
|
|
|
}
|
|
|
|
|
2005-01-11 05:56:49 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// SelectionDAGISel code
|
|
|
|
//===----------------------------------------------------------------------===//
|
2005-01-07 07:47:53 +00:00
|
|
|
|
2011-01-05 21:45:56 +00:00
|
|
|
SelectionDAGISel::SelectionDAGISel(const TargetMachine &tm,
|
|
|
|
CodeGenOpt::Level OL) :
|
2010-08-06 18:33:48 +00:00
|
|
|
MachineFunctionPass(ID), TM(tm), TLI(*tm.getTargetLowering()),
|
2008-08-27 23:52:12 +00:00
|
|
|
FuncInfo(new FunctionLoweringInfo(TLI)),
|
2010-05-29 17:03:36 +00:00
|
|
|
CurDAG(new SelectionDAG(tm)),
|
2010-04-19 19:05:59 +00:00
|
|
|
SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)),
|
2008-08-27 23:52:12 +00:00
|
|
|
GFI(),
|
2009-04-29 00:15:41 +00:00
|
|
|
OptLevel(OL),
|
2010-10-19 17:21:58 +00:00
|
|
|
DAGSize(0) {
|
|
|
|
initializeGCModuleInfoPass(*PassRegistry::getPassRegistry());
|
|
|
|
initializeAliasAnalysisAnalysisGroup(*PassRegistry::getPassRegistry());
|
2011-06-16 20:22:37 +00:00
|
|
|
initializeBranchProbabilityInfoPass(*PassRegistry::getPassRegistry());
|
2010-10-19 17:21:58 +00:00
|
|
|
}
|
2008-08-27 23:52:12 +00:00
|
|
|
|
|
|
|
SelectionDAGISel::~SelectionDAGISel() {
|
2009-11-23 18:04:58 +00:00
|
|
|
delete SDB;
|
2008-08-27 23:52:12 +00:00
|
|
|
delete CurDAG;
|
|
|
|
delete FuncInfo;
|
|
|
|
}
|
|
|
|
|
2005-08-17 06:37:43 +00:00
|
|
|
void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
|
2006-10-16 20:52:31 +00:00
|
|
|
AU.addRequired<AliasAnalysis>();
|
2009-07-31 23:36:22 +00:00
|
|
|
AU.addPreserved<AliasAnalysis>();
|
2008-08-17 18:44:35 +00:00
|
|
|
AU.addRequired<GCModuleInfo>();
|
2009-07-31 23:36:22 +00:00
|
|
|
AU.addPreserved<GCModuleInfo>();
|
2011-06-16 20:22:37 +00:00
|
|
|
if (UseMBPI && OptLevel != CodeGenOpt::None)
|
|
|
|
AU.addRequired<BranchProbabilityInfo>();
|
2009-07-31 18:16:33 +00:00
|
|
|
MachineFunctionPass::getAnalysisUsage(AU);
|
2005-08-17 06:37:43 +00:00
|
|
|
}
|
2005-01-07 07:47:53 +00:00
|
|
|
|
2010-12-19 04:58:57 +00:00
|
|
|
/// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that
|
|
|
|
/// may trap on it. In this case we have to split the edge so that the path
|
|
|
|
/// through the predecessor block that doesn't go to the phi block doesn't
|
|
|
|
/// execute the possibly trapping instruction.
|
|
|
|
///
|
|
|
|
/// This is required for correctness, so it must be done at -O0.
|
|
|
|
///
|
|
|
|
static void SplitCriticalSideEffectEdges(Function &Fn, Pass *SDISel) {
|
|
|
|
// Loop for blocks with phi nodes.
|
|
|
|
for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
|
|
|
|
PHINode *PN = dyn_cast<PHINode>(BB->begin());
|
|
|
|
if (PN == 0) continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-19 04:58:57 +00:00
|
|
|
ReprocessBlock:
|
|
|
|
// For each block with a PHI node, check to see if any of the input values
|
|
|
|
// are potentially trapping constant expressions. Constant expressions are
|
|
|
|
// the only potentially trapping value that can occur as the argument to a
|
|
|
|
// PHI.
|
|
|
|
for (BasicBlock::iterator I = BB->begin(); (PN = dyn_cast<PHINode>(I)); ++I)
|
|
|
|
for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
|
|
|
|
ConstantExpr *CE = dyn_cast<ConstantExpr>(PN->getIncomingValue(i));
|
|
|
|
if (CE == 0 || !CE->canTrap()) continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-19 04:58:57 +00:00
|
|
|
// The only case we have to worry about is when the edge is critical.
|
|
|
|
// Since this block has a PHI Node, we assume it has multiple input
|
|
|
|
// edges: check to see if the pred has multiple successors.
|
|
|
|
BasicBlock *Pred = PN->getIncomingBlock(i);
|
|
|
|
if (Pred->getTerminator()->getNumSuccessors() == 1)
|
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-19 04:58:57 +00:00
|
|
|
// Okay, we have to split this edge.
|
|
|
|
SplitCriticalEdge(Pred->getTerminator(),
|
|
|
|
GetSuccessorNumber(Pred, BB), SDISel, true);
|
|
|
|
goto ReprocessBlock;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-31 18:16:33 +00:00
|
|
|
bool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) {
|
2008-09-09 23:05:00 +00:00
|
|
|
// Do some sanity-checking on the command-line options.
|
|
|
|
assert((!EnableFastISelVerbose || EnableFastISel) &&
|
|
|
|
"-fast-isel-verbose requires -fast-isel");
|
|
|
|
assert((!EnableFastISelAbort || EnableFastISel) &&
|
|
|
|
"-fast-isel-abort requires -fast-isel");
|
|
|
|
|
2010-04-15 04:33:49 +00:00
|
|
|
const Function &Fn = *mf.getFunction();
|
2008-09-05 22:59:21 +00:00
|
|
|
const TargetInstrInfo &TII = *TM.getInstrInfo();
|
|
|
|
const TargetRegisterInfo &TRI = *TM.getRegisterInfo();
|
|
|
|
|
2010-04-14 17:02:07 +00:00
|
|
|
MF = &mf;
|
2009-01-15 19:20:50 +00:00
|
|
|
RegInfo = &MF->getRegInfo();
|
2010-04-14 17:02:07 +00:00
|
|
|
AA = &getAnalysis<AliasAnalysis>();
|
|
|
|
GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0;
|
|
|
|
|
2010-01-05 01:26:11 +00:00
|
|
|
DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n");
|
2005-01-07 07:47:53 +00:00
|
|
|
|
2010-12-19 04:58:57 +00:00
|
|
|
SplitCriticalSideEffectEdges(const_cast<Function&>(Fn), this);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-04-05 06:10:13 +00:00
|
|
|
CurDAG->init(*MF);
|
2010-05-29 17:03:36 +00:00
|
|
|
FuncInfo->set(Fn, *MF);
|
2011-06-16 20:22:37 +00:00
|
|
|
|
|
|
|
if (UseMBPI && OptLevel != CodeGenOpt::None)
|
|
|
|
FuncInfo->BPI = &getAnalysis<BranchProbabilityInfo>();
|
|
|
|
else
|
|
|
|
FuncInfo->BPI = 0;
|
|
|
|
|
2009-11-23 18:04:58 +00:00
|
|
|
SDB->init(GFI, *AA);
|
2005-01-07 07:47:53 +00:00
|
|
|
|
2010-04-14 20:05:00 +00:00
|
|
|
SelectAllBasicBlocks(Fn);
|
2005-04-21 22:36:52 +00:00
|
|
|
|
2010-05-01 00:33:28 +00:00
|
|
|
// If the first basic block in the function has live ins that need to be
|
2008-09-05 22:59:21 +00:00
|
|
|
// copied into vregs, emit the copies into the top of the block before
|
|
|
|
// emitting the code for the block.
|
2010-04-28 23:08:54 +00:00
|
|
|
MachineBasicBlock *EntryMBB = MF->begin();
|
|
|
|
RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII);
|
|
|
|
|
2010-05-26 20:18:50 +00:00
|
|
|
DenseMap<unsigned, unsigned> LiveInMap;
|
|
|
|
if (!FuncInfo->ArgDbgValues.empty())
|
|
|
|
for (MachineRegisterInfo::livein_iterator LI = RegInfo->livein_begin(),
|
|
|
|
E = RegInfo->livein_end(); LI != E; ++LI)
|
2010-12-24 04:28:06 +00:00
|
|
|
if (LI->second)
|
2010-05-26 20:18:50 +00:00
|
|
|
LiveInMap.insert(std::make_pair(LI->first, LI->second));
|
|
|
|
|
2010-04-28 23:08:54 +00:00
|
|
|
// Insert DBG_VALUE instructions for function arguments to the entry block.
|
|
|
|
for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) {
|
|
|
|
MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1];
|
|
|
|
unsigned Reg = MI->getOperand(0).getReg();
|
|
|
|
if (TargetRegisterInfo::isPhysicalRegister(Reg))
|
|
|
|
EntryMBB->insert(EntryMBB->begin(), MI);
|
|
|
|
else {
|
|
|
|
MachineInstr *Def = RegInfo->getVRegDef(Reg);
|
|
|
|
MachineBasicBlock::iterator InsertPos = Def;
|
2010-05-04 00:58:39 +00:00
|
|
|
// FIXME: VR def may not be in entry block.
|
|
|
|
Def->getParent()->insert(llvm::next(InsertPos), MI);
|
2010-04-28 23:08:54 +00:00
|
|
|
}
|
2010-05-26 20:18:50 +00:00
|
|
|
|
|
|
|
// If Reg is live-in then update debug info to track its copy in a vreg.
|
|
|
|
DenseMap<unsigned, unsigned>::iterator LDI = LiveInMap.find(Reg);
|
|
|
|
if (LDI != LiveInMap.end()) {
|
|
|
|
MachineInstr *Def = RegInfo->getVRegDef(LDI->second);
|
|
|
|
MachineBasicBlock::iterator InsertPos = Def;
|
2010-12-24 04:28:06 +00:00
|
|
|
const MDNode *Variable =
|
2010-05-26 20:18:50 +00:00
|
|
|
MI->getOperand(MI->getNumOperands()-1).getMetadata();
|
|
|
|
unsigned Offset = MI->getOperand(1).getImm();
|
|
|
|
// Def is never a terminator here, so it is ok to increment InsertPos.
|
2010-12-24 04:28:06 +00:00
|
|
|
BuildMI(*EntryMBB, ++InsertPos, MI->getDebugLoc(),
|
2010-05-26 20:18:50 +00:00
|
|
|
TII.get(TargetOpcode::DBG_VALUE))
|
|
|
|
.addReg(LDI->second, RegState::Debug)
|
|
|
|
.addImm(Offset).addMetadata(Variable);
|
2010-09-21 20:56:33 +00:00
|
|
|
|
|
|
|
// If this vreg is directly copied into an exported register then
|
|
|
|
// that COPY instructions also need DBG_VALUE, if it is the only
|
|
|
|
// user of LDI->second.
|
|
|
|
MachineInstr *CopyUseMI = NULL;
|
2010-12-24 04:28:06 +00:00
|
|
|
for (MachineRegisterInfo::use_iterator
|
|
|
|
UI = RegInfo->use_begin(LDI->second);
|
2010-09-21 20:56:33 +00:00
|
|
|
MachineInstr *UseMI = UI.skipInstruction();) {
|
|
|
|
if (UseMI->isDebugValue()) continue;
|
|
|
|
if (UseMI->isCopy() && !CopyUseMI && UseMI->getParent() == EntryMBB) {
|
|
|
|
CopyUseMI = UseMI; continue;
|
|
|
|
}
|
|
|
|
// Otherwise this is another use or second copy use.
|
|
|
|
CopyUseMI = NULL; break;
|
|
|
|
}
|
|
|
|
if (CopyUseMI) {
|
|
|
|
MachineInstr *NewMI =
|
2010-12-24 04:28:06 +00:00
|
|
|
BuildMI(*MF, CopyUseMI->getDebugLoc(),
|
2010-09-21 20:56:33 +00:00
|
|
|
TII.get(TargetOpcode::DBG_VALUE))
|
|
|
|
.addReg(CopyUseMI->getOperand(0).getReg(), RegState::Debug)
|
|
|
|
.addImm(Offset).addMetadata(Variable);
|
|
|
|
EntryMBB->insertAfter(CopyUseMI, NewMI);
|
|
|
|
}
|
2010-05-26 20:18:50 +00:00
|
|
|
}
|
2010-04-28 23:08:54 +00:00
|
|
|
}
|
|
|
|
|
2010-05-17 23:09:50 +00:00
|
|
|
// Determine if there are any calls in this machine function.
|
|
|
|
MachineFrameInfo *MFI = MF->getFrameInfo();
|
|
|
|
if (!MFI->hasCalls()) {
|
|
|
|
for (MachineFunction::const_iterator
|
|
|
|
I = MF->begin(), E = MF->end(); I != E; ++I) {
|
|
|
|
const MachineBasicBlock *MBB = I;
|
|
|
|
for (MachineBasicBlock::const_iterator
|
|
|
|
II = MBB->begin(), IE = MBB->end(); II != IE; ++II) {
|
2011-06-28 19:10:37 +00:00
|
|
|
const MCInstrDesc &MCID = TM.getInstrInfo()->get(II->getOpcode());
|
2010-07-09 19:44:12 +00:00
|
|
|
|
2011-06-28 19:10:37 +00:00
|
|
|
if ((MCID.isCall() && !MCID.isReturn()) ||
|
2011-01-07 23:50:32 +00:00
|
|
|
II->isStackAligningInlineAsm()) {
|
2010-05-17 23:09:50 +00:00
|
|
|
MFI->setHasCalls(true);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
done:;
|
|
|
|
}
|
|
|
|
|
2010-05-26 19:46:12 +00:00
|
|
|
// Determine if there is a call to setjmp in the machine function.
|
2011-05-16 03:05:33 +00:00
|
|
|
MF->setCallsSetJmp(Fn.callsFunctionThatReturnsTwice());
|
2010-05-26 19:46:12 +00:00
|
|
|
|
2010-07-10 09:00:22 +00:00
|
|
|
// Replace forward-declared registers with the registers containing
|
|
|
|
// the desired value.
|
|
|
|
MachineRegisterInfo &MRI = MF->getRegInfo();
|
|
|
|
for (DenseMap<unsigned, unsigned>::iterator
|
|
|
|
I = FuncInfo->RegFixups.begin(), E = FuncInfo->RegFixups.end();
|
|
|
|
I != E; ++I) {
|
|
|
|
unsigned From = I->first;
|
|
|
|
unsigned To = I->second;
|
|
|
|
// If To is also scheduled to be replaced, find what its ultimate
|
|
|
|
// replacement is.
|
|
|
|
for (;;) {
|
|
|
|
DenseMap<unsigned, unsigned>::iterator J =
|
|
|
|
FuncInfo->RegFixups.find(To);
|
|
|
|
if (J == E) break;
|
|
|
|
To = J->second;
|
|
|
|
}
|
|
|
|
// Replace it.
|
|
|
|
MRI.replaceRegWith(From, To);
|
|
|
|
}
|
|
|
|
|
2010-04-28 23:08:54 +00:00
|
|
|
// Release function-specific state. SDB and CurDAG are already cleared
|
|
|
|
// at this point.
|
|
|
|
FuncInfo->clear();
|
2008-09-05 22:59:21 +00:00
|
|
|
|
2005-01-07 07:47:53 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-04-17 17:12:08 +00:00
|
|
|
void SelectionDAGISel::SelectBasicBlock(BasicBlock::const_iterator Begin,
|
|
|
|
BasicBlock::const_iterator End,
|
|
|
|
bool &HadTailCall) {
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
// Lower all of the non-terminator instructions. If a call is emitted
|
2010-04-16 05:06:56 +00:00
|
|
|
// as a tail call, cease emitting nodes for this block. Terminators
|
|
|
|
// are handled below.
|
2010-04-22 20:55:53 +00:00
|
|
|
for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I)
|
2010-04-16 05:06:56 +00:00
|
|
|
SDB->visit(*I);
|
2008-08-23 02:25:05 +00:00
|
|
|
|
2005-01-17 19:43:36 +00:00
|
|
|
// Make sure the root of the DAG is up-to-date.
|
2009-11-23 18:04:58 +00:00
|
|
|
CurDAG->setRoot(SDB->getControlRoot());
|
|
|
|
HadTailCall = SDB->HasTailCall;
|
|
|
|
SDB->clear();
|
2010-05-01 00:25:44 +00:00
|
|
|
|
|
|
|
// Final step, emit the lowered DAG as machine code.
|
2010-07-10 09:00:22 +00:00
|
|
|
CodeGenAndEmitDAG();
|
2005-01-07 07:47:53 +00:00
|
|
|
}
|
|
|
|
|
2008-08-23 02:25:05 +00:00
|
|
|
void SelectionDAGISel::ComputeLiveOutVRegInfo() {
|
2008-06-17 06:09:18 +00:00
|
|
|
SmallPtrSet<SDNode*, 128> VisitedNodes;
|
|
|
|
SmallVector<SDNode*, 128> Worklist;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2008-08-28 21:40:38 +00:00
|
|
|
Worklist.push_back(CurDAG->getRoot().getNode());
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2008-06-17 06:09:18 +00:00
|
|
|
APInt Mask;
|
|
|
|
APInt KnownZero;
|
|
|
|
APInt KnownOne;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2010-01-07 17:27:56 +00:00
|
|
|
do {
|
|
|
|
SDNode *N = Worklist.pop_back_val();
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2008-06-17 06:09:18 +00:00
|
|
|
// If we've already seen this node, ignore it.
|
|
|
|
if (!VisitedNodes.insert(N))
|
|
|
|
continue;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2008-06-17 06:09:18 +00:00
|
|
|
// Otherwise, add all chain operands to the worklist.
|
|
|
|
for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
|
2009-08-11 20:47:22 +00:00
|
|
|
if (N->getOperand(i).getValueType() == MVT::Other)
|
2008-08-28 21:40:38 +00:00
|
|
|
Worklist.push_back(N->getOperand(i).getNode());
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2008-06-17 06:09:18 +00:00
|
|
|
// If this is a CopyToReg with a vreg dest, process it.
|
|
|
|
if (N->getOpcode() != ISD::CopyToReg)
|
|
|
|
continue;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2008-06-17 06:09:18 +00:00
|
|
|
unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg();
|
|
|
|
if (!TargetRegisterInfo::isVirtualRegister(DestReg))
|
|
|
|
continue;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2008-06-17 06:09:18 +00:00
|
|
|
// Ignore non-scalar or non-integer values.
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Src = N->getOperand(2);
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT SrcVT = Src.getValueType();
|
2008-06-17 06:09:18 +00:00
|
|
|
if (!SrcVT.isInteger() || SrcVT.isVector())
|
|
|
|
continue;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2008-08-23 02:25:05 +00:00
|
|
|
unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src);
|
2008-06-17 06:09:18 +00:00
|
|
|
Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits());
|
2008-08-23 02:25:05 +00:00
|
|
|
CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne);
|
2011-02-24 10:00:08 +00:00
|
|
|
FuncInfo->AddLiveOutRegInfo(DestReg, NumSignBits, KnownZero, KnownOne);
|
2010-01-07 17:27:56 +00:00
|
|
|
} while (!Worklist.empty());
|
2008-06-17 06:09:18 +00:00
|
|
|
}
|
|
|
|
|
2010-07-10 09:00:22 +00:00
|
|
|
void SelectionDAGISel::CodeGenAndEmitDAG() {
|
2008-07-21 20:00:07 +00:00
|
|
|
std::string GroupName;
|
|
|
|
if (TimePassesIsEnabled)
|
|
|
|
GroupName = "Instruction Selection and Scheduling";
|
|
|
|
std::string BlockName;
|
2011-03-23 01:38:28 +00:00
|
|
|
int BlockNumber = -1;
|
2011-08-12 14:54:45 +00:00
|
|
|
(void)BlockNumber;
|
2011-03-23 01:38:28 +00:00
|
|
|
#ifdef NDEBUG
|
2008-07-21 20:00:07 +00:00
|
|
|
if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs ||
|
2008-11-24 14:53:14 +00:00
|
|
|
ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs ||
|
|
|
|
ViewSUnitDAGs)
|
2011-03-23 01:38:28 +00:00
|
|
|
#endif
|
|
|
|
{
|
|
|
|
BlockNumber = FuncInfo->MBB->getNumber();
|
2009-08-01 03:51:09 +00:00
|
|
|
BlockName = MF->getFunction()->getNameStr() + ":" +
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->MBB->getBasicBlock()->getNameStr();
|
2011-03-23 01:38:28 +00:00
|
|
|
}
|
|
|
|
DEBUG(dbgs() << "Initial selection DAG: BB#" << BlockNumber
|
|
|
|
<< " '" << BlockName << "'\n"; CurDAG->dump());
|
2008-07-21 20:00:07 +00:00
|
|
|
|
2008-08-23 02:25:05 +00:00
|
|
|
if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName);
|
2007-10-08 15:12:17 +00:00
|
|
|
|
2005-10-10 16:47:10 +00:00
|
|
|
// Run the DAG combiner in pre-legalize mode.
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("DAG Combining 1", GroupName, TimePassesIsEnabled);
|
2009-04-29 00:15:41 +00:00
|
|
|
CurDAG->Combine(Unrestricted, *AA, OptLevel);
|
2008-07-01 17:59:20 +00:00
|
|
|
}
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2011-03-23 01:38:28 +00:00
|
|
|
DEBUG(dbgs() << "Optimized lowered selection DAG: BB#" << BlockNumber
|
|
|
|
<< " '" << BlockName << "'\n"; CurDAG->dump());
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2005-01-07 07:47:53 +00:00
|
|
|
// Second step, hack on the DAG until it only uses operations and types that
|
|
|
|
// the target supports.
|
2009-12-05 17:51:33 +00:00
|
|
|
if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " +
|
|
|
|
BlockName);
|
|
|
|
|
|
|
|
bool Changed;
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("Type Legalization", GroupName, TimePassesIsEnabled);
|
2009-12-05 17:51:33 +00:00
|
|
|
Changed = CurDAG->LegalizeTypes();
|
|
|
|
}
|
|
|
|
|
2011-03-23 01:38:28 +00:00
|
|
|
DEBUG(dbgs() << "Type-legalized selection DAG: BB#" << BlockNumber
|
|
|
|
<< " '" << BlockName << "'\n"; CurDAG->dump());
|
2008-07-21 20:00:07 +00:00
|
|
|
|
2009-12-05 17:51:33 +00:00
|
|
|
if (Changed) {
|
|
|
|
if (ViewDAGCombineLT)
|
|
|
|
CurDAG->viewGraph("dag-combine-lt input for " + BlockName);
|
|
|
|
|
|
|
|
// Run the DAG combiner in post-type-legalize mode.
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("DAG Combining after legalize types", GroupName,
|
|
|
|
TimePassesIsEnabled);
|
2009-12-05 17:51:33 +00:00
|
|
|
CurDAG->Combine(NoIllegalTypes, *AA, OptLevel);
|
2008-07-21 20:00:07 +00:00
|
|
|
}
|
|
|
|
|
2011-03-23 01:38:28 +00:00
|
|
|
DEBUG(dbgs() << "Optimized type-legalized selection DAG: BB#" << BlockNumber
|
|
|
|
<< " '" << BlockName << "'\n"; CurDAG->dump());
|
2009-12-05 17:51:33 +00:00
|
|
|
}
|
2008-07-21 20:00:07 +00:00
|
|
|
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("Vector Legalization", GroupName, TimePassesIsEnabled);
|
2009-12-05 17:51:33 +00:00
|
|
|
Changed = CurDAG->LegalizeVectors();
|
|
|
|
}
|
2009-05-23 12:35:30 +00:00
|
|
|
|
2009-12-05 17:51:33 +00:00
|
|
|
if (Changed) {
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("Type Legalization 2", GroupName, TimePassesIsEnabled);
|
2009-12-28 01:51:30 +00:00
|
|
|
CurDAG->LegalizeTypes();
|
2009-05-23 12:35:30 +00:00
|
|
|
}
|
|
|
|
|
2009-12-05 17:51:33 +00:00
|
|
|
if (ViewDAGCombineLT)
|
|
|
|
CurDAG->viewGraph("dag-combine-lv input for " + BlockName);
|
2009-05-23 12:35:30 +00:00
|
|
|
|
2009-12-05 17:51:33 +00:00
|
|
|
// Run the DAG combiner in post-type-legalize mode.
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("DAG Combining after legalize vectors", GroupName,
|
|
|
|
TimePassesIsEnabled);
|
2009-12-05 17:51:33 +00:00
|
|
|
CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
|
2009-05-23 12:35:30 +00:00
|
|
|
}
|
2009-12-05 17:51:33 +00:00
|
|
|
|
2011-03-23 01:38:28 +00:00
|
|
|
DEBUG(dbgs() << "Optimized vector-legalized selection DAG: BB#"
|
|
|
|
<< BlockNumber << " '" << BlockName << "'\n"; CurDAG->dump());
|
2008-07-10 23:37:50 +00:00
|
|
|
}
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2008-08-23 02:25:05 +00:00
|
|
|
if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName);
|
2008-07-21 20:00:07 +00:00
|
|
|
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("DAG Legalization", GroupName, TimePassesIsEnabled);
|
2011-05-16 22:19:54 +00:00
|
|
|
CurDAG->Legalize();
|
2008-07-01 17:59:20 +00:00
|
|
|
}
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2011-03-23 01:38:28 +00:00
|
|
|
DEBUG(dbgs() << "Legalized selection DAG: BB#" << BlockNumber
|
|
|
|
<< " '" << BlockName << "'\n"; CurDAG->dump());
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2008-08-23 02:25:05 +00:00
|
|
|
if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName);
|
2008-07-21 20:00:07 +00:00
|
|
|
|
2005-10-10 16:47:10 +00:00
|
|
|
// Run the DAG combiner in post-legalize mode.
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("DAG Combining 2", GroupName, TimePassesIsEnabled);
|
2009-04-29 00:15:41 +00:00
|
|
|
CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
|
2008-07-01 17:59:20 +00:00
|
|
|
}
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2011-03-23 01:38:28 +00:00
|
|
|
DEBUG(dbgs() << "Optimized legalized selection DAG: BB#" << BlockNumber
|
|
|
|
<< " '" << BlockName << "'\n"; CurDAG->dump());
|
2007-10-08 15:12:17 +00:00
|
|
|
|
2010-06-24 14:30:44 +00:00
|
|
|
if (OptLevel != CodeGenOpt::None)
|
2008-08-23 02:25:05 +00:00
|
|
|
ComputeLiveOutVRegInfo();
|
2006-04-28 02:09:19 +00:00
|
|
|
|
2010-03-14 19:27:55 +00:00
|
|
|
if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName);
|
|
|
|
|
2005-03-30 01:10:47 +00:00
|
|
|
// Third, instruction select all of the operations to machine code, adding the
|
|
|
|
// code to the MachineBasicBlock.
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("Instruction Selection", GroupName, TimePassesIsEnabled);
|
2010-03-02 06:34:30 +00:00
|
|
|
DoInstructionSelection();
|
2008-07-01 17:59:20 +00:00
|
|
|
}
|
2008-06-30 20:45:06 +00:00
|
|
|
|
2011-03-23 01:38:28 +00:00
|
|
|
DEBUG(dbgs() << "Selected selection DAG: BB#" << BlockNumber
|
|
|
|
<< " '" << BlockName << "'\n"; CurDAG->dump());
|
2008-07-21 20:00:07 +00:00
|
|
|
|
2008-08-23 02:25:05 +00:00
|
|
|
if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName);
|
2008-07-21 20:00:07 +00:00
|
|
|
|
2008-07-14 18:19:29 +00:00
|
|
|
// Schedule machine code.
|
2009-02-11 04:27:20 +00:00
|
|
|
ScheduleDAGSDNodes *Scheduler = CreateScheduler();
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("Instruction Scheduling", GroupName,
|
|
|
|
TimePassesIsEnabled);
|
2010-07-10 09:00:22 +00:00
|
|
|
Scheduler->Run(CurDAG, FuncInfo->MBB, FuncInfo->InsertPt);
|
2008-07-14 18:19:29 +00:00
|
|
|
}
|
|
|
|
|
2008-07-21 20:00:07 +00:00
|
|
|
if (ViewSUnitDAGs) Scheduler->viewGraph();
|
|
|
|
|
2009-09-20 02:20:51 +00:00
|
|
|
// Emit machine code to BB. This can change 'BB' to the last block being
|
2008-06-30 20:45:06 +00:00
|
|
|
// inserted into.
|
2010-09-30 19:44:31 +00:00
|
|
|
MachineBasicBlock *FirstMBB = FuncInfo->MBB, *LastMBB;
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("Instruction Creation", GroupName, TimePassesIsEnabled);
|
2010-07-10 09:00:22 +00:00
|
|
|
|
2010-09-30 19:44:31 +00:00
|
|
|
LastMBB = FuncInfo->MBB = Scheduler->EmitSchedule();
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->InsertPt = Scheduler->InsertPos;
|
2008-07-14 18:19:29 +00:00
|
|
|
}
|
|
|
|
|
2010-09-30 19:44:31 +00:00
|
|
|
// If the block was split, make sure we update any references that are used to
|
|
|
|
// update PHI nodes later on.
|
|
|
|
if (FirstMBB != LastMBB)
|
|
|
|
SDB->UpdateSplitBlock(FirstMBB, LastMBB);
|
|
|
|
|
2008-07-14 18:19:29 +00:00
|
|
|
// Free the scheduler state.
|
2010-06-18 15:56:31 +00:00
|
|
|
{
|
|
|
|
NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName,
|
|
|
|
TimePassesIsEnabled);
|
2008-07-14 18:19:29 +00:00
|
|
|
delete Scheduler;
|
2008-07-01 17:59:20 +00:00
|
|
|
}
|
2008-06-30 20:45:06 +00:00
|
|
|
|
2010-05-01 00:25:44 +00:00
|
|
|
// Free the SelectionDAG state, now that we're finished with it.
|
|
|
|
CurDAG->clear();
|
2009-09-20 02:20:51 +00:00
|
|
|
}
|
2006-03-27 01:32:24 +00:00
|
|
|
|
2010-03-02 06:34:30 +00:00
|
|
|
void SelectionDAGISel::DoInstructionSelection() {
|
2011-03-23 01:38:28 +00:00
|
|
|
DEBUG(errs() << "===== Instruction selection begins: BB#"
|
|
|
|
<< FuncInfo->MBB->getNumber()
|
|
|
|
<< " '" << FuncInfo->MBB->getName() << "'\n");
|
2010-03-02 06:34:30 +00:00
|
|
|
|
|
|
|
PreprocessISelDAG();
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 06:34:30 +00:00
|
|
|
// Select target instructions for the DAG.
|
|
|
|
{
|
|
|
|
// Number all nodes with a topological order and set DAGSize.
|
|
|
|
DAGSize = CurDAG->AssignTopologicalOrder();
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 06:34:30 +00:00
|
|
|
// Create a dummy node (which is not added to allnodes), that adds
|
|
|
|
// a reference to the root node, preventing it from being deleted,
|
|
|
|
// and tracking any changes of the root.
|
|
|
|
HandleSDNode Dummy(CurDAG->getRoot());
|
|
|
|
ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode());
|
|
|
|
++ISelPosition;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 06:34:30 +00:00
|
|
|
// The AllNodes list is now topological-sorted. Visit the
|
|
|
|
// nodes by starting at the end of the list (the root of the
|
|
|
|
// graph) and preceding back toward the beginning (the entry
|
|
|
|
// node).
|
|
|
|
while (ISelPosition != CurDAG->allnodes_begin()) {
|
|
|
|
SDNode *Node = --ISelPosition;
|
|
|
|
// Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes,
|
|
|
|
// but there are currently some corner cases that it misses. Also, this
|
|
|
|
// makes it theoretically possible to disable the DAGCombiner.
|
|
|
|
if (Node->use_empty())
|
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 06:34:30 +00:00
|
|
|
SDNode *ResNode = Select(Node);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 07:50:03 +00:00
|
|
|
// FIXME: This is pretty gross. 'Select' should be changed to not return
|
|
|
|
// anything at all and this code should be nuked with a tactical strike.
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 06:34:30 +00:00
|
|
|
// If node should not be replaced, continue with the next one.
|
2010-03-02 07:50:03 +00:00
|
|
|
if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE)
|
2010-03-02 06:34:30 +00:00
|
|
|
continue;
|
|
|
|
// Replace node.
|
|
|
|
if (ResNode)
|
|
|
|
ReplaceUses(Node, ResNode);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 06:34:30 +00:00
|
|
|
// If after the replacement this node is not used any more,
|
|
|
|
// remove this dead node.
|
|
|
|
if (Node->use_empty()) { // Don't delete EntryToken, etc.
|
|
|
|
ISelUpdater ISU(ISelPosition);
|
|
|
|
CurDAG->RemoveDeadNode(Node, &ISU);
|
|
|
|
}
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 06:34:30 +00:00
|
|
|
CurDAG->setRoot(Dummy.getValue());
|
2010-12-24 04:28:06 +00:00
|
|
|
}
|
2010-05-17 23:09:50 +00:00
|
|
|
|
2010-03-02 06:34:30 +00:00
|
|
|
DEBUG(errs() << "===== Instruction selection ends:\n");
|
|
|
|
|
|
|
|
PostprocessISelDAG();
|
|
|
|
}
|
|
|
|
|
2010-04-14 19:53:31 +00:00
|
|
|
/// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and
|
|
|
|
/// do other setup for EH landing-pad blocks.
|
2010-07-10 09:00:22 +00:00
|
|
|
void SelectionDAGISel::PrepareEHLandingPad() {
|
2010-04-14 19:53:31 +00:00
|
|
|
// Add a label to mark the beginning of the landing pad. Deletion of the
|
|
|
|
// landing pad can thus be detected via the MachineModuleInfo.
|
2010-07-10 09:00:22 +00:00
|
|
|
MCSymbol *Label = MF->getMMI().addLandingPad(FuncInfo->MBB);
|
2010-04-14 19:53:31 +00:00
|
|
|
|
2011-06-28 19:10:37 +00:00
|
|
|
const MCInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL);
|
2010-07-10 09:00:22 +00:00
|
|
|
BuildMI(*FuncInfo->MBB, FuncInfo->InsertPt, SDB->getCurDebugLoc(), II)
|
|
|
|
.addSym(Label);
|
2010-04-14 19:53:31 +00:00
|
|
|
|
|
|
|
// Mark exception register as live in.
|
|
|
|
unsigned Reg = TLI.getExceptionAddressRegister();
|
2010-07-10 09:00:22 +00:00
|
|
|
if (Reg) FuncInfo->MBB->addLiveIn(Reg);
|
2010-04-14 19:53:31 +00:00
|
|
|
|
|
|
|
// Mark exception selector register as live in.
|
|
|
|
Reg = TLI.getExceptionSelectorRegister();
|
2010-07-10 09:00:22 +00:00
|
|
|
if (Reg) FuncInfo->MBB->addLiveIn(Reg);
|
2010-04-14 19:53:31 +00:00
|
|
|
|
|
|
|
// FIXME: Hack around an exception handling flaw (PR1508): the personality
|
|
|
|
// function and list of typeids logically belong to the invoke (or, if you
|
|
|
|
// like, the basic block containing the invoke), and need to be associated
|
|
|
|
// with it in the dwarf exception handling tables. Currently however the
|
|
|
|
// information is provided by an intrinsic (eh.selector) that can be moved
|
|
|
|
// to unexpected places by the optimizers: if the unwind edge is critical,
|
|
|
|
// then breaking it can result in the intrinsics being in the successor of
|
|
|
|
// the landing pad, not the landing pad itself. This results
|
|
|
|
// in exceptions not being caught because no typeids are associated with
|
|
|
|
// the invoke. This may not be the only way things can go wrong, but it
|
|
|
|
// is the only way we try to work around for the moment.
|
2010-07-10 09:00:22 +00:00
|
|
|
const BasicBlock *LLVMBB = FuncInfo->MBB->getBasicBlock();
|
2010-04-14 19:53:31 +00:00
|
|
|
const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator());
|
|
|
|
|
|
|
|
if (Br && Br->isUnconditional()) { // Critical edge?
|
|
|
|
BasicBlock::const_iterator I, E;
|
|
|
|
for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I)
|
|
|
|
if (isa<EHSelectorInst>(I))
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (I == E)
|
|
|
|
// No catch info found - try to extract some from the successor.
|
|
|
|
CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo);
|
|
|
|
}
|
|
|
|
}
|
2010-03-02 06:34:30 +00:00
|
|
|
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
|
|
|
|
|
2011-04-22 21:59:37 +00:00
|
|
|
/// TryToFoldFastISelLoad - We're checking to see if we can fold the specified
|
|
|
|
/// load into the specified FoldInst. Note that we could have a sequence where
|
|
|
|
/// multiple LLVM IR instructions are folded into the same machineinstr. For
|
|
|
|
/// example we could have:
|
|
|
|
/// A: x = load i32 *P
|
|
|
|
/// B: y = icmp A, 42
|
|
|
|
/// C: br y, ...
|
|
|
|
///
|
|
|
|
/// In this scenario, LI is "A", and FoldInst is "C". We know about "B" (and
|
|
|
|
/// any other folded instructions) because it is between A and C.
|
|
|
|
///
|
|
|
|
/// If we succeed in folding the load into the operation, return true.
|
|
|
|
///
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
bool SelectionDAGISel::TryToFoldFastISelLoad(const LoadInst *LI,
|
2011-04-22 21:59:37 +00:00
|
|
|
const Instruction *FoldInst,
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
FastISel *FastIS) {
|
2011-04-22 21:59:37 +00:00
|
|
|
// We know that the load has a single use, but don't know what it is. If it
|
|
|
|
// isn't one of the folded instructions, then we can't succeed here. Handle
|
|
|
|
// this by scanning the single-use users of the load until we get to FoldInst.
|
|
|
|
unsigned MaxUsers = 6; // Don't scan down huge single-use chains of instrs.
|
|
|
|
|
|
|
|
const Instruction *TheUser = LI->use_back();
|
|
|
|
while (TheUser != FoldInst && // Scan up until we find FoldInst.
|
|
|
|
// Stay in the right block.
|
|
|
|
TheUser->getParent() == FoldInst->getParent() &&
|
|
|
|
--MaxUsers) { // Don't scan too far.
|
|
|
|
// If there are multiple or no uses of this instruction, then bail out.
|
|
|
|
if (!TheUser->hasOneUse())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
TheUser = TheUser->use_back();
|
|
|
|
}
|
|
|
|
|
fix PR10605 / rdar://9930964 by adding a pretty scary missed check.
It's somewhat surprising anything works without this. Before we would
compile the testcase into:
test: # @test
movl $4, 8(%rdi)
movl 8(%rdi), %eax
orl %esi, %eax
cmpl $32, %edx
movl %eax, -4(%rsp) # 4-byte Spill
je .LBB0_2
now we produce:
test: # @test
movl 8(%rdi), %eax
movl $4, 8(%rdi)
orl %esi, %eax
cmpl $32, %edx
movl %eax, -4(%rsp) # 4-byte Spill
je .LBB0_2
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@137303 91177308-0d34-0410-b5e6-96231b3b80d8
2011-08-11 06:26:54 +00:00
|
|
|
// If we didn't find the fold instruction, then we failed to collapse the
|
|
|
|
// sequence.
|
|
|
|
if (TheUser != FoldInst)
|
|
|
|
return false;
|
|
|
|
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
// Don't try to fold volatile loads. Target has to deal with alignment
|
|
|
|
// constraints.
|
|
|
|
if (LI->isVolatile()) return false;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2011-04-22 21:59:37 +00:00
|
|
|
// Figure out which vreg this is going into. If there is no assigned vreg yet
|
|
|
|
// then there actually was no reference to it. Perhaps the load is referenced
|
|
|
|
// by a dead instruction.
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
unsigned LoadReg = FastIS->getRegForValue(LI);
|
2011-04-22 21:59:37 +00:00
|
|
|
if (LoadReg == 0)
|
|
|
|
return false;
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
|
|
|
|
// Check to see what the uses of this vreg are. If it has no uses, or more
|
|
|
|
// than one use (at the machine instr level) then we can't fold it.
|
|
|
|
MachineRegisterInfo::reg_iterator RI = RegInfo->reg_begin(LoadReg);
|
|
|
|
if (RI == RegInfo->reg_end())
|
|
|
|
return false;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
// See if there is exactly one use of the vreg. If there are multiple uses,
|
|
|
|
// then the instruction got lowered to multiple machine instructions or the
|
|
|
|
// use of the loaded value ended up being multiple operands of the result, in
|
|
|
|
// either case, we can't fold this.
|
|
|
|
MachineRegisterInfo::reg_iterator PostRI = RI; ++PostRI;
|
|
|
|
if (PostRI != RegInfo->reg_end())
|
|
|
|
return false;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
assert(RI.getOperand().isUse() &&
|
|
|
|
"The only use of the vreg must be a use, we haven't emitted the def!");
|
|
|
|
|
2011-01-16 02:27:38 +00:00
|
|
|
MachineInstr *User = &*RI;
|
2011-03-01 01:39:05 +00:00
|
|
|
|
2011-01-16 02:27:38 +00:00
|
|
|
// Set the insertion point properly. Folding the load can cause generation of
|
|
|
|
// other random instructions (like sign extends) for addressing modes, make
|
|
|
|
// sure they get inserted in a logical place before the new instruction.
|
|
|
|
FuncInfo->InsertPt = User;
|
|
|
|
FuncInfo->MBB = User->getParent();
|
|
|
|
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
// Ask the target to try folding the load.
|
2011-01-16 02:27:38 +00:00
|
|
|
return FastIS->TryToFoldLoad(User, RI.getOperandNo(), LI);
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
}
|
|
|
|
|
2011-04-17 06:03:19 +00:00
|
|
|
/// isFoldedOrDeadInstruction - Return true if the specified instruction is
|
|
|
|
/// side-effect free and is either dead or folded into a generated instruction.
|
|
|
|
/// Return false if it needs to be emitted.
|
|
|
|
static bool isFoldedOrDeadInstruction(const Instruction *I,
|
|
|
|
FunctionLoweringInfo *FuncInfo) {
|
2011-04-22 21:59:37 +00:00
|
|
|
return !I->mayWriteToMemory() && // Side-effecting instructions aren't folded.
|
|
|
|
!isa<TerminatorInst>(I) && // Terminators aren't folded.
|
|
|
|
!isa<DbgInfoIntrinsic>(I) && // Debug instructions aren't folded.
|
2011-08-23 21:33:05 +00:00
|
|
|
!isa<LandingPadInst>(I) && // Landingpad instructions aren't folded.
|
2011-04-22 21:59:37 +00:00
|
|
|
!FuncInfo->isExportedInst(I); // Exported instrs must be computed.
|
2011-04-17 06:03:19 +00:00
|
|
|
}
|
|
|
|
|
2010-04-15 01:51:59 +00:00
|
|
|
void SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) {
|
2008-09-29 21:55:50 +00:00
|
|
|
// Initialize the Fast-ISel state, if needed.
|
|
|
|
FastISel *FastIS = 0;
|
|
|
|
if (EnableFastISel)
|
2010-07-07 16:29:44 +00:00
|
|
|
FastIS = TLI.createFastISel(*FuncInfo);
|
2008-09-29 21:55:50 +00:00
|
|
|
|
|
|
|
// Iterate over all basic blocks in the function.
|
2011-02-24 10:00:04 +00:00
|
|
|
ReversePostOrderTraversal<const Function*> RPOT(&Fn);
|
|
|
|
for (ReversePostOrderTraversal<const Function*>::rpo_iterator
|
|
|
|
I = RPOT.begin(), E = RPOT.end(); I != E; ++I) {
|
|
|
|
const BasicBlock *LLVMBB = *I;
|
2011-02-24 10:00:13 +00:00
|
|
|
|
2011-02-24 10:00:16 +00:00
|
|
|
if (OptLevel != CodeGenOpt::None) {
|
|
|
|
bool AllPredsVisited = true;
|
|
|
|
for (const_pred_iterator PI = pred_begin(LLVMBB), PE = pred_end(LLVMBB);
|
|
|
|
PI != PE; ++PI) {
|
|
|
|
if (!FuncInfo->VisitedBBs.count(*PI)) {
|
|
|
|
AllPredsVisited = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-02-24 10:00:25 +00:00
|
|
|
if (AllPredsVisited) {
|
2011-04-17 06:03:19 +00:00
|
|
|
for (BasicBlock::const_iterator I = LLVMBB->begin();
|
|
|
|
isa<PHINode>(I); ++I)
|
2011-02-24 10:00:25 +00:00
|
|
|
FuncInfo->ComputePHILiveOutRegInfo(cast<PHINode>(I));
|
|
|
|
} else {
|
2011-04-17 06:03:19 +00:00
|
|
|
for (BasicBlock::const_iterator I = LLVMBB->begin();
|
|
|
|
isa<PHINode>(I); ++I)
|
2011-02-24 10:00:16 +00:00
|
|
|
FuncInfo->InvalidatePHILiveOutRegInfo(cast<PHINode>(I));
|
|
|
|
}
|
|
|
|
|
2011-02-24 10:00:13 +00:00
|
|
|
FuncInfo->VisitedBBs.insert(LLVMBB);
|
2011-02-24 10:00:16 +00:00
|
|
|
}
|
2011-02-24 10:00:13 +00:00
|
|
|
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->MBB = FuncInfo->MBBMap[LLVMBB];
|
|
|
|
FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
|
2008-08-23 02:25:05 +00:00
|
|
|
|
2010-04-20 15:00:41 +00:00
|
|
|
BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI();
|
2010-04-15 01:51:59 +00:00
|
|
|
BasicBlock::const_iterator const End = LLVMBB->end();
|
2010-07-10 09:00:22 +00:00
|
|
|
BasicBlock::const_iterator BI = End;
|
2008-08-28 20:28:56 +00:00
|
|
|
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
|
|
|
|
|
|
|
|
// Setup an EH landing-pad block.
|
|
|
|
if (FuncInfo->MBB->isLandingPad())
|
|
|
|
PrepareEHLandingPad();
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-07-08 01:00:56 +00:00
|
|
|
// Lower any arguments needed in this block if this is the entry block.
|
2011-02-21 23:21:26 +00:00
|
|
|
if (LLVMBB == &Fn.getEntryBlock())
|
2010-07-08 01:00:56 +00:00
|
|
|
LowerArguments(LLVMBB);
|
|
|
|
|
2008-08-23 02:25:05 +00:00
|
|
|
// Before doing SelectionDAG ISel, see if FastISel has been requested.
|
2010-05-01 02:44:23 +00:00
|
|
|
if (FastIS) {
|
2010-07-10 09:00:22 +00:00
|
|
|
FastIS->startNewBlock();
|
|
|
|
|
2010-07-08 01:00:56 +00:00
|
|
|
// Emit code for any incoming arguments. This must happen before
|
|
|
|
// beginning FastISel on the entry block.
|
|
|
|
if (LLVMBB == &Fn.getEntryBlock()) {
|
|
|
|
CurDAG->setRoot(SDB->getControlRoot());
|
|
|
|
SDB->clear();
|
2010-07-10 09:00:22 +00:00
|
|
|
CodeGenAndEmitDAG();
|
|
|
|
|
|
|
|
// If we inserted any instructions at the beginning, make a note of
|
|
|
|
// where they are, so we can be sure to emit subsequent instructions
|
|
|
|
// after them.
|
|
|
|
if (FuncInfo->InsertPt != FuncInfo->MBB->begin())
|
|
|
|
FastIS->setLastLocalValue(llvm::prior(FuncInfo->InsertPt));
|
|
|
|
else
|
|
|
|
FastIS->setLastLocalValue(0);
|
2010-07-08 01:00:56 +00:00
|
|
|
}
|
2010-07-10 09:00:22 +00:00
|
|
|
|
2008-09-29 21:55:50 +00:00
|
|
|
// Do FastISel on as many instructions as possible.
|
2010-07-10 09:00:22 +00:00
|
|
|
for (; BI != Begin; --BI) {
|
|
|
|
const Instruction *Inst = llvm::prior(BI);
|
|
|
|
|
|
|
|
// If we no longer require this instruction, skip it.
|
2011-04-17 06:03:19 +00:00
|
|
|
if (isFoldedOrDeadInstruction(Inst, FuncInfo))
|
2010-07-01 02:58:57 +00:00
|
|
|
continue;
|
2010-07-10 09:00:22 +00:00
|
|
|
|
|
|
|
// Bottom-up: reset the insert pos at the top, after any local-value
|
|
|
|
// instructions.
|
|
|
|
FastIS->recomputeInsertPt();
|
2010-07-01 02:58:57 +00:00
|
|
|
|
2010-01-12 04:32:35 +00:00
|
|
|
// Try to select the instruction with FastISel.
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
if (FastIS->SelectInstruction(Inst)) {
|
2011-05-16 21:51:07 +00:00
|
|
|
++NumFastIselSuccess;
|
2011-04-22 21:59:37 +00:00
|
|
|
// If fast isel succeeded, skip over all the folded instructions, and
|
|
|
|
// then see if there is a load right before the selected instructions.
|
|
|
|
// Try to fold the load if so.
|
|
|
|
const Instruction *BeforeInst = Inst;
|
|
|
|
while (BeforeInst != Begin) {
|
|
|
|
BeforeInst = llvm::prior(BasicBlock::const_iterator(BeforeInst));
|
|
|
|
if (!isFoldedOrDeadInstruction(BeforeInst, FuncInfo))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (BeforeInst != Inst && isa<LoadInst>(BeforeInst) &&
|
|
|
|
BeforeInst->hasOneUse() &&
|
|
|
|
TryToFoldFastISelLoad(cast<LoadInst>(BeforeInst), Inst, FastIS))
|
|
|
|
// If we succeeded, don't re-select the load.
|
|
|
|
BI = llvm::next(BasicBlock::const_iterator(BeforeInst));
|
2008-09-29 21:55:50 +00:00
|
|
|
continue;
|
implement rdar://6653118 - fastisel should fold loads where possible.
Since mem2reg isn't run at -O0, we get a ton of reloads from the stack,
for example, before, this code:
int foo(int x, int y, int z) {
return x+y+z;
}
used to compile into:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
movl 4(%rsp), %esi
addl %edx, %esi
movl (%rsp), %edx
addl %esi, %edx
movl %edx, %eax
addq $12, %rsp
ret
Now we produce:
_foo: ## @foo
subq $12, %rsp
movl %edi, 8(%rsp)
movl %esi, 4(%rsp)
movl %edx, (%rsp)
movl 8(%rsp), %edx
addl 4(%rsp), %edx ## Folded load
addl (%rsp), %edx ## Folded load
movl %edx, %eax
addq $12, %rsp
ret
Fewer instructions and less register use = faster compiles.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113102 91177308-0d34-0410-b5e6-96231b3b80d8
2010-09-05 02:18:34 +00:00
|
|
|
}
|
2008-08-23 02:25:05 +00:00
|
|
|
|
2008-09-29 21:55:50 +00:00
|
|
|
// Then handle certain instructions as single-LLVM-Instruction blocks.
|
2010-07-10 09:00:22 +00:00
|
|
|
if (isa<CallInst>(Inst)) {
|
2010-03-04 19:46:56 +00:00
|
|
|
++NumFastIselFailures;
|
2008-09-29 21:55:50 +00:00
|
|
|
if (EnableFastISelVerbose || EnableFastISelAbort) {
|
2010-01-05 01:26:11 +00:00
|
|
|
dbgs() << "FastISel missed call: ";
|
2010-07-10 09:00:22 +00:00
|
|
|
Inst->dump();
|
2008-08-23 02:25:05 +00:00
|
|
|
}
|
|
|
|
|
2010-07-10 09:00:22 +00:00
|
|
|
if (!Inst->getType()->isVoidTy() && !Inst->use_empty()) {
|
|
|
|
unsigned &R = FuncInfo->ValueMap[Inst];
|
2008-09-29 21:55:50 +00:00
|
|
|
if (!R)
|
2010-07-10 09:00:22 +00:00
|
|
|
R = FuncInfo->CreateRegs(Inst->getType());
|
2008-08-23 02:25:05 +00:00
|
|
|
}
|
2008-09-29 21:55:50 +00:00
|
|
|
|
2009-11-20 02:51:26 +00:00
|
|
|
bool HadTailCall = false;
|
2010-10-25 21:31:46 +00:00
|
|
|
SelectBasicBlock(Inst, BI, HadTailCall);
|
2009-11-20 02:51:26 +00:00
|
|
|
|
|
|
|
// If the call was emitted as a tail call, we're done with the block.
|
|
|
|
if (HadTailCall) {
|
2010-07-10 09:00:22 +00:00
|
|
|
--BI;
|
2009-11-20 02:51:26 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2008-09-29 21:55:50 +00:00
|
|
|
continue;
|
2008-08-23 02:25:05 +00:00
|
|
|
}
|
2008-09-29 21:55:50 +00:00
|
|
|
|
2011-05-17 23:02:10 +00:00
|
|
|
if (isa<TerminatorInst>(Inst) && !isa<BranchInst>(Inst)) {
|
|
|
|
// Don't abort, and use a different message for terminator misses.
|
|
|
|
++NumFastIselFailures;
|
|
|
|
if (EnableFastISelVerbose || EnableFastISelAbort) {
|
|
|
|
dbgs() << "FastISel missed terminator: ";
|
|
|
|
Inst->dump();
|
|
|
|
}
|
|
|
|
} else {
|
2010-03-04 19:46:56 +00:00
|
|
|
++NumFastIselFailures;
|
2008-09-29 21:55:50 +00:00
|
|
|
if (EnableFastISelVerbose || EnableFastISelAbort) {
|
2010-01-05 01:26:11 +00:00
|
|
|
dbgs() << "FastISel miss: ";
|
2010-07-10 09:00:22 +00:00
|
|
|
Inst->dump();
|
2008-09-29 21:55:50 +00:00
|
|
|
}
|
|
|
|
if (EnableFastISelAbort)
|
|
|
|
// The "fast" selector couldn't handle something and bailed.
|
|
|
|
// For the purpose of debugging, just abort.
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("FastISel didn't select the entire block");
|
2008-09-29 21:55:50 +00:00
|
|
|
}
|
|
|
|
break;
|
2008-08-23 02:25:05 +00:00
|
|
|
}
|
2010-07-10 09:00:22 +00:00
|
|
|
|
|
|
|
FastIS->recomputeInsertPt();
|
2008-08-23 02:25:05 +00:00
|
|
|
}
|
|
|
|
|
2010-10-25 21:31:46 +00:00
|
|
|
if (Begin != BI)
|
|
|
|
++NumDAGBlocks;
|
|
|
|
else
|
|
|
|
++NumFastIselBlocks;
|
|
|
|
|
2011-04-19 17:01:08 +00:00
|
|
|
if (Begin != BI) {
|
|
|
|
// Run SelectionDAG instruction selection on the remainder of the block
|
|
|
|
// not handled by FastISel. If FastISel is not run, this is the entire
|
|
|
|
// block.
|
|
|
|
bool HadTailCall;
|
|
|
|
SelectBasicBlock(Begin, BI, HadTailCall);
|
|
|
|
}
|
2008-08-08 07:27:28 +00:00
|
|
|
|
2010-07-10 09:00:22 +00:00
|
|
|
FinishBasicBlock();
|
2010-04-22 19:55:20 +00:00
|
|
|
FuncInfo->PHINodesToUpdate.clear();
|
2008-08-07 00:43:25 +00:00
|
|
|
}
|
2008-09-29 21:55:50 +00:00
|
|
|
|
|
|
|
delete FastIS;
|
2011-05-23 17:44:13 +00:00
|
|
|
SDB->clearDanglingDebugInfo();
|
2008-07-07 23:02:41 +00:00
|
|
|
}
|
|
|
|
|
2008-07-28 21:51:04 +00:00
|
|
|
void
|
2010-07-10 09:00:22 +00:00
|
|
|
SelectionDAGISel::FinishBasicBlock() {
|
2005-01-07 07:47:53 +00:00
|
|
|
|
2010-01-05 01:26:11 +00:00
|
|
|
DEBUG(dbgs() << "Total amount of phi nodes to update: "
|
2010-06-18 16:00:29 +00:00
|
|
|
<< FuncInfo->PHINodesToUpdate.size() << "\n";
|
|
|
|
for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i)
|
2010-01-05 01:26:11 +00:00
|
|
|
dbgs() << "Node " << i << " : ("
|
2010-04-22 19:55:20 +00:00
|
|
|
<< FuncInfo->PHINodesToUpdate[i].first
|
|
|
|
<< ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n");
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2005-03-30 01:10:47 +00:00
|
|
|
// Next, now that we know what the last MBB the LLVM BB expanded is, update
|
2005-01-07 07:47:53 +00:00
|
|
|
// PHI nodes in successors.
|
2009-11-23 18:04:58 +00:00
|
|
|
if (SDB->SwitchCases.empty() &&
|
|
|
|
SDB->JTCases.empty() &&
|
|
|
|
SDB->BitTestCases.empty()) {
|
2010-04-22 19:55:20 +00:00
|
|
|
for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
|
|
|
|
MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
|
2010-02-09 19:54:29 +00:00
|
|
|
assert(PHI->isPHI() &&
|
2006-03-27 01:32:24 +00:00
|
|
|
"This is not a machine PHI node that we are updating!");
|
2010-07-10 09:00:22 +00:00
|
|
|
if (!FuncInfo->MBB->isSuccessor(PHI->getParent()))
|
2010-03-05 21:49:10 +00:00
|
|
|
continue;
|
2010-04-22 19:55:20 +00:00
|
|
|
PHI->addOperand(
|
|
|
|
MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
|
2010-07-10 09:00:22 +00:00
|
|
|
PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
|
2006-03-27 01:32:24 +00:00
|
|
|
}
|
|
|
|
return;
|
2005-01-07 07:47:53 +00:00
|
|
|
}
|
2007-04-09 12:31:58 +00:00
|
|
|
|
2009-11-23 18:04:58 +00:00
|
|
|
for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) {
|
2007-04-09 12:31:58 +00:00
|
|
|
// Lower header first, if it wasn't already lowered
|
2009-11-23 18:04:58 +00:00
|
|
|
if (!SDB->BitTestCases[i].Emitted) {
|
2007-04-09 12:31:58 +00:00
|
|
|
// Set the current basic block to the mbb we wish to insert the code into
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->MBB = SDB->BitTestCases[i].Parent;
|
|
|
|
FuncInfo->InsertPt = FuncInfo->MBB->end();
|
2007-04-09 12:31:58 +00:00
|
|
|
// Emit the code
|
2010-07-10 09:00:22 +00:00
|
|
|
SDB->visitBitTestHeader(SDB->BitTestCases[i], FuncInfo->MBB);
|
2009-11-23 18:04:58 +00:00
|
|
|
CurDAG->setRoot(SDB->getRoot());
|
|
|
|
SDB->clear();
|
2010-07-10 09:00:22 +00:00
|
|
|
CodeGenAndEmitDAG();
|
2009-09-20 02:20:51 +00:00
|
|
|
}
|
2007-04-09 12:31:58 +00:00
|
|
|
|
2009-11-23 18:04:58 +00:00
|
|
|
for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) {
|
2007-04-09 12:31:58 +00:00
|
|
|
// Set the current basic block to the mbb we wish to insert the code into
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->MBB = SDB->BitTestCases[i].Cases[j].ThisBB;
|
|
|
|
FuncInfo->InsertPt = FuncInfo->MBB->end();
|
2007-04-09 12:31:58 +00:00
|
|
|
// Emit the code
|
|
|
|
if (j+1 != ej)
|
2011-01-06 01:02:44 +00:00
|
|
|
SDB->visitBitTestCase(SDB->BitTestCases[i],
|
|
|
|
SDB->BitTestCases[i].Cases[j+1].ThisBB,
|
2009-11-23 18:04:58 +00:00
|
|
|
SDB->BitTestCases[i].Reg,
|
2010-04-19 22:41:47 +00:00
|
|
|
SDB->BitTestCases[i].Cases[j],
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->MBB);
|
2007-04-09 12:31:58 +00:00
|
|
|
else
|
2011-01-06 01:02:44 +00:00
|
|
|
SDB->visitBitTestCase(SDB->BitTestCases[i],
|
|
|
|
SDB->BitTestCases[i].Default,
|
2009-11-23 18:04:58 +00:00
|
|
|
SDB->BitTestCases[i].Reg,
|
2010-04-19 22:41:47 +00:00
|
|
|
SDB->BitTestCases[i].Cases[j],
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->MBB);
|
2009-09-20 02:20:51 +00:00
|
|
|
|
|
|
|
|
2009-11-23 18:04:58 +00:00
|
|
|
CurDAG->setRoot(SDB->getRoot());
|
|
|
|
SDB->clear();
|
2010-07-10 09:00:22 +00:00
|
|
|
CodeGenAndEmitDAG();
|
2007-04-09 12:31:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Update PHI Nodes
|
2010-04-22 19:55:20 +00:00
|
|
|
for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
|
|
|
|
pi != pe; ++pi) {
|
|
|
|
MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
|
2007-04-09 12:31:58 +00:00
|
|
|
MachineBasicBlock *PHIBB = PHI->getParent();
|
2010-02-09 19:54:29 +00:00
|
|
|
assert(PHI->isPHI() &&
|
2007-04-09 12:31:58 +00:00
|
|
|
"This is not a machine PHI node that we are updating!");
|
|
|
|
// This is "default" BB. We have two jumps to it. From "header" BB and
|
|
|
|
// from last "case" BB.
|
2009-11-23 18:04:58 +00:00
|
|
|
if (PHIBB == SDB->BitTestCases[i].Default) {
|
2010-01-15 00:36:15 +00:00
|
|
|
PHI->addOperand(MachineOperand::
|
2010-04-22 19:55:20 +00:00
|
|
|
CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
|
|
|
|
false));
|
2009-11-23 18:04:58 +00:00
|
|
|
PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent));
|
2010-01-15 00:36:15 +00:00
|
|
|
PHI->addOperand(MachineOperand::
|
2010-04-22 19:55:20 +00:00
|
|
|
CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
|
|
|
|
false));
|
2009-11-23 18:04:58 +00:00
|
|
|
PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases.
|
2007-12-30 00:57:42 +00:00
|
|
|
back().ThisBB));
|
2007-04-09 12:31:58 +00:00
|
|
|
}
|
|
|
|
// One of "cases" BB.
|
2009-11-23 18:04:58 +00:00
|
|
|
for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size();
|
2008-08-27 23:52:12 +00:00
|
|
|
j != ej; ++j) {
|
2009-11-23 18:04:58 +00:00
|
|
|
MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB;
|
2010-01-11 21:02:33 +00:00
|
|
|
if (cBB->isSuccessor(PHIBB)) {
|
2010-01-15 00:36:15 +00:00
|
|
|
PHI->addOperand(MachineOperand::
|
2010-04-22 19:55:20 +00:00
|
|
|
CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
|
|
|
|
false));
|
2007-12-30 00:57:42 +00:00
|
|
|
PHI->addOperand(MachineOperand::CreateMBB(cBB));
|
2007-04-09 12:31:58 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-11-23 18:04:58 +00:00
|
|
|
SDB->BitTestCases.clear();
|
2007-04-09 12:31:58 +00:00
|
|
|
|
2006-04-23 06:26:20 +00:00
|
|
|
// If the JumpTable record is filled in, then we need to emit a jump table.
|
|
|
|
// Updating the PHI nodes is tricky in this case, since we need to determine
|
|
|
|
// whether the PHI is a successor of the range check MBB or the jump table MBB
|
2009-11-23 18:04:58 +00:00
|
|
|
for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) {
|
2007-03-25 15:07:15 +00:00
|
|
|
// Lower header first, if it wasn't already lowered
|
2009-11-23 18:04:58 +00:00
|
|
|
if (!SDB->JTCases[i].first.Emitted) {
|
2007-03-25 15:07:15 +00:00
|
|
|
// Set the current basic block to the mbb we wish to insert the code into
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->MBB = SDB->JTCases[i].first.HeaderBB;
|
|
|
|
FuncInfo->InsertPt = FuncInfo->MBB->end();
|
2007-03-25 15:07:15 +00:00
|
|
|
// Emit the code
|
2010-04-19 22:41:47 +00:00
|
|
|
SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first,
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->MBB);
|
2009-11-23 18:04:58 +00:00
|
|
|
CurDAG->setRoot(SDB->getRoot());
|
|
|
|
SDB->clear();
|
2010-07-10 09:00:22 +00:00
|
|
|
CodeGenAndEmitDAG();
|
2007-04-09 12:31:58 +00:00
|
|
|
}
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-04-22 18:53:45 +00:00
|
|
|
// Set the current basic block to the mbb we wish to insert the code into
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->MBB = SDB->JTCases[i].second.MBB;
|
|
|
|
FuncInfo->InsertPt = FuncInfo->MBB->end();
|
2006-04-22 18:53:45 +00:00
|
|
|
// Emit the code
|
2009-11-23 18:04:58 +00:00
|
|
|
SDB->visitJumpTable(SDB->JTCases[i].second);
|
|
|
|
CurDAG->setRoot(SDB->getRoot());
|
|
|
|
SDB->clear();
|
2010-07-10 09:00:22 +00:00
|
|
|
CodeGenAndEmitDAG();
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-04-22 18:53:45 +00:00
|
|
|
// Update PHI Nodes
|
2010-04-22 19:55:20 +00:00
|
|
|
for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
|
|
|
|
pi != pe; ++pi) {
|
|
|
|
MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
|
2006-04-22 18:53:45 +00:00
|
|
|
MachineBasicBlock *PHIBB = PHI->getParent();
|
2010-02-09 19:54:29 +00:00
|
|
|
assert(PHI->isPHI() &&
|
2006-04-22 18:53:45 +00:00
|
|
|
"This is not a machine PHI node that we are updating!");
|
2007-04-09 12:31:58 +00:00
|
|
|
// "default" BB. We can go there only from header BB.
|
2009-11-23 18:04:58 +00:00
|
|
|
if (PHIBB == SDB->JTCases[i].second.Default) {
|
2009-09-19 09:51:03 +00:00
|
|
|
PHI->addOperand
|
2010-04-22 19:55:20 +00:00
|
|
|
(MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
|
|
|
|
false));
|
2009-09-19 09:51:03 +00:00
|
|
|
PHI->addOperand
|
2009-11-23 18:04:58 +00:00
|
|
|
(MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB));
|
2006-05-03 03:48:02 +00:00
|
|
|
}
|
2007-04-09 12:31:58 +00:00
|
|
|
// JT BB. Just iterate over successors here
|
2010-07-10 09:00:22 +00:00
|
|
|
if (FuncInfo->MBB->isSuccessor(PHIBB)) {
|
2009-09-19 09:51:03 +00:00
|
|
|
PHI->addOperand
|
2010-04-22 19:55:20 +00:00
|
|
|
(MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
|
|
|
|
false));
|
2010-07-10 09:00:22 +00:00
|
|
|
PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
|
2006-04-22 18:53:45 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-11-23 18:04:58 +00:00
|
|
|
SDB->JTCases.clear();
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-10-22 23:00:53 +00:00
|
|
|
// If the switch block involved a branch to one of the actual successors, we
|
|
|
|
// need to update PHI nodes in that block.
|
2010-04-22 19:55:20 +00:00
|
|
|
for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
|
|
|
|
MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
|
2010-02-09 19:54:29 +00:00
|
|
|
assert(PHI->isPHI() &&
|
2006-10-22 23:00:53 +00:00
|
|
|
"This is not a machine PHI node that we are updating!");
|
2010-07-10 09:00:22 +00:00
|
|
|
if (FuncInfo->MBB->isSuccessor(PHI->getParent())) {
|
2010-04-22 19:55:20 +00:00
|
|
|
PHI->addOperand(
|
|
|
|
MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
|
2010-07-10 09:00:22 +00:00
|
|
|
PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
|
2006-10-22 23:00:53 +00:00
|
|
|
}
|
|
|
|
}
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-03-27 01:32:24 +00:00
|
|
|
// If we generated any switch lowering information, build and codegen any
|
|
|
|
// additional DAGs necessary.
|
2009-11-23 18:04:58 +00:00
|
|
|
for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) {
|
2006-03-27 01:32:24 +00:00
|
|
|
// Set the current basic block to the mbb we wish to insert the code into
|
2011-01-14 22:26:16 +00:00
|
|
|
FuncInfo->MBB = SDB->SwitchCases[i].ThisBB;
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->InsertPt = FuncInfo->MBB->end();
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2010-05-01 00:25:44 +00:00
|
|
|
// Determine the unique successors.
|
|
|
|
SmallVector<MachineBasicBlock *, 2> Succs;
|
|
|
|
Succs.push_back(SDB->SwitchCases[i].TrueBB);
|
|
|
|
if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB)
|
|
|
|
Succs.push_back(SDB->SwitchCases[i].FalseBB);
|
|
|
|
|
2011-01-14 22:26:16 +00:00
|
|
|
// Emit the code. Note that this could result in FuncInfo->MBB being split.
|
2010-07-10 09:00:22 +00:00
|
|
|
SDB->visitSwitchCase(SDB->SwitchCases[i], FuncInfo->MBB);
|
2009-11-23 18:04:58 +00:00
|
|
|
CurDAG->setRoot(SDB->getRoot());
|
2010-05-01 00:25:44 +00:00
|
|
|
SDB->clear();
|
2010-07-10 09:00:22 +00:00
|
|
|
CodeGenAndEmitDAG();
|
2011-01-14 22:26:16 +00:00
|
|
|
|
|
|
|
// Remember the last block, now that any splitting is done, for use in
|
|
|
|
// populating PHI nodes in successors.
|
|
|
|
MachineBasicBlock *ThisBB = FuncInfo->MBB;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-09-07 01:59:34 +00:00
|
|
|
// Handle any PHI nodes in successors of this chunk, as if we were coming
|
|
|
|
// from the original BB before switch expansion. Note that PHI nodes can
|
|
|
|
// occur multiple times in PHINodesToUpdate. We have to be very careful to
|
|
|
|
// handle them the right number of times.
|
2010-05-01 00:25:44 +00:00
|
|
|
for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
|
2010-07-10 09:00:22 +00:00
|
|
|
FuncInfo->MBB = Succs[i];
|
|
|
|
FuncInfo->InsertPt = FuncInfo->MBB->end();
|
|
|
|
// FuncInfo->MBB may have been removed from the CFG if a branch was
|
|
|
|
// constant folded.
|
|
|
|
if (ThisBB->isSuccessor(FuncInfo->MBB)) {
|
|
|
|
for (MachineBasicBlock::iterator Phi = FuncInfo->MBB->begin();
|
|
|
|
Phi != FuncInfo->MBB->end() && Phi->isPHI();
|
2010-01-11 21:02:33 +00:00
|
|
|
++Phi) {
|
|
|
|
// This value for this PHI node is recorded in PHINodesToUpdate.
|
|
|
|
for (unsigned pn = 0; ; ++pn) {
|
2010-04-22 19:55:20 +00:00
|
|
|
assert(pn != FuncInfo->PHINodesToUpdate.size() &&
|
2010-01-11 21:02:33 +00:00
|
|
|
"Didn't find PHI entry!");
|
2010-04-22 19:55:20 +00:00
|
|
|
if (FuncInfo->PHINodesToUpdate[pn].first == Phi) {
|
2010-01-11 21:02:33 +00:00
|
|
|
Phi->addOperand(MachineOperand::
|
2010-04-22 19:55:20 +00:00
|
|
|
CreateReg(FuncInfo->PHINodesToUpdate[pn].second,
|
2010-01-11 21:02:33 +00:00
|
|
|
false));
|
|
|
|
Phi->addOperand(MachineOperand::CreateMBB(ThisBB));
|
|
|
|
break;
|
|
|
|
}
|
2009-09-18 08:26:06 +00:00
|
|
|
}
|
2006-09-07 01:59:34 +00:00
|
|
|
}
|
2006-03-27 01:32:24 +00:00
|
|
|
}
|
|
|
|
}
|
2005-03-30 01:10:47 +00:00
|
|
|
}
|
2009-11-23 18:04:58 +00:00
|
|
|
SDB->SwitchCases.clear();
|
2005-01-07 07:47:53 +00:00
|
|
|
}
|
2006-01-21 02:32:06 +00:00
|
|
|
|
2006-08-01 14:21:23 +00:00
|
|
|
|
2009-02-06 18:26:51 +00:00
|
|
|
/// Create the scheduler. If a specific scheduler was specified
|
|
|
|
/// via the SchedulerRegistry, use it, otherwise select the
|
|
|
|
/// one preferred by the target.
|
2008-07-14 18:19:29 +00:00
|
|
|
///
|
2009-02-11 04:27:20 +00:00
|
|
|
ScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() {
|
2006-08-02 12:30:23 +00:00
|
|
|
RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-08-01 14:21:23 +00:00
|
|
|
if (!Ctor) {
|
2006-08-02 12:30:23 +00:00
|
|
|
Ctor = ISHeuristic;
|
2006-08-01 19:14:14 +00:00
|
|
|
RegisterScheduler::setDefault(Ctor);
|
2006-01-23 07:01:07 +00:00
|
|
|
}
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2009-04-29 00:15:41 +00:00
|
|
|
return Ctor(this, OptLevel);
|
2006-01-21 02:32:06 +00:00
|
|
|
}
|
2006-02-24 02:13:54 +00:00
|
|
|
|
2006-10-11 03:58:02 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Helper functions used by the generated instruction selector.
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Calls to these methods are generated by tblgen.
|
|
|
|
|
|
|
|
/// CheckAndMask - The isel is trying to match something like (and X, 255). If
|
|
|
|
/// the dag combiner simplified the 255, we still want to match. RHS is the
|
|
|
|
/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
|
|
|
|
/// specified in the .td file (e.g. 255).
|
2009-09-20 02:20:51 +00:00
|
|
|
bool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS,
|
2007-07-24 23:00:27 +00:00
|
|
|
int64_t DesiredMaskS) const {
|
2008-02-25 21:11:39 +00:00
|
|
|
const APInt &ActualMask = RHS->getAPIntValue();
|
|
|
|
const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-10-11 03:58:02 +00:00
|
|
|
// If the actual mask exactly matches, success!
|
|
|
|
if (ActualMask == DesiredMask)
|
|
|
|
return true;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-10-11 03:58:02 +00:00
|
|
|
// If the actual AND mask is allowing unallowed bits, this doesn't match.
|
2008-02-25 21:11:39 +00:00
|
|
|
if (ActualMask.intersects(~DesiredMask))
|
2006-10-11 03:58:02 +00:00
|
|
|
return false;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-10-11 03:58:02 +00:00
|
|
|
// Otherwise, the DAG Combiner may have proven that the value coming in is
|
|
|
|
// either already zero or is not demanded. Check for known zero input bits.
|
2008-02-25 21:11:39 +00:00
|
|
|
APInt NeededMask = DesiredMask & ~ActualMask;
|
2007-06-22 14:59:07 +00:00
|
|
|
if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
|
2006-10-11 03:58:02 +00:00
|
|
|
return true;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-10-11 03:58:02 +00:00
|
|
|
// TODO: check to see if missing bits are just not demanded.
|
|
|
|
|
|
|
|
// Otherwise, this pattern doesn't match.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// CheckOrMask - The isel is trying to match something like (or X, 255). If
|
|
|
|
/// the dag combiner simplified the 255, we still want to match. RHS is the
|
|
|
|
/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
|
|
|
|
/// specified in the .td file (e.g. 255).
|
2009-09-20 02:20:51 +00:00
|
|
|
bool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS,
|
2008-02-25 21:11:39 +00:00
|
|
|
int64_t DesiredMaskS) const {
|
|
|
|
const APInt &ActualMask = RHS->getAPIntValue();
|
|
|
|
const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-10-11 03:58:02 +00:00
|
|
|
// If the actual mask exactly matches, success!
|
|
|
|
if (ActualMask == DesiredMask)
|
|
|
|
return true;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-10-11 03:58:02 +00:00
|
|
|
// If the actual AND mask is allowing unallowed bits, this doesn't match.
|
2008-02-25 21:11:39 +00:00
|
|
|
if (ActualMask.intersects(~DesiredMask))
|
2006-10-11 03:58:02 +00:00
|
|
|
return false;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-10-11 03:58:02 +00:00
|
|
|
// Otherwise, the DAG Combiner may have proven that the value coming in is
|
|
|
|
// either already zero or is not demanded. Check for known zero input bits.
|
2008-02-25 21:11:39 +00:00
|
|
|
APInt NeededMask = DesiredMask & ~ActualMask;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2008-02-25 21:11:39 +00:00
|
|
|
APInt KnownZero, KnownOne;
|
2007-06-22 14:59:07 +00:00
|
|
|
CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne);
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-10-11 03:58:02 +00:00
|
|
|
// If all the missing bits in the or are already known to be set, match!
|
|
|
|
if ((NeededMask & KnownOne) == NeededMask)
|
|
|
|
return true;
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-10-11 03:58:02 +00:00
|
|
|
// TODO: check to see if missing bits are just not demanded.
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-10-11 03:58:02 +00:00
|
|
|
// Otherwise, this pattern doesn't match.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2006-08-01 18:29:48 +00:00
|
|
|
|
2006-02-24 02:13:54 +00:00
|
|
|
/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
|
|
|
|
/// by tblgen. Others should not call it.
|
|
|
|
void SelectionDAGISel::
|
2008-08-23 02:25:05 +00:00
|
|
|
SelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) {
|
2008-07-27 21:46:04 +00:00
|
|
|
std::vector<SDValue> InOps;
|
2006-02-24 02:13:54 +00:00
|
|
|
std::swap(InOps, Ops);
|
|
|
|
|
2010-04-07 05:20:54 +00:00
|
|
|
Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0
|
|
|
|
Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1
|
|
|
|
Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc
|
2011-01-07 23:50:32 +00:00
|
|
|
Ops.push_back(InOps[InlineAsm::Op_ExtraInfo]); // 3 (SideEffect, AlignStack)
|
2006-02-24 02:13:54 +00:00
|
|
|
|
2010-04-07 05:20:54 +00:00
|
|
|
unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size();
|
2010-12-21 02:38:05 +00:00
|
|
|
if (InOps[e-1].getValueType() == MVT::Glue)
|
2010-12-23 17:13:18 +00:00
|
|
|
--e; // Don't process a glue operand if it is here.
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-02-24 02:13:54 +00:00
|
|
|
while (i != e) {
|
2008-09-12 16:56:44 +00:00
|
|
|
unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue();
|
2010-04-07 05:20:54 +00:00
|
|
|
if (!InlineAsm::isMemKind(Flags)) {
|
2006-02-24 02:13:54 +00:00
|
|
|
// Just skip over this operand, copying the operands verbatim.
|
2009-03-20 18:03:34 +00:00
|
|
|
Ops.insert(Ops.end(), InOps.begin()+i,
|
|
|
|
InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1);
|
|
|
|
i += InlineAsm::getNumOperandRegisters(Flags) + 1;
|
2006-02-24 02:13:54 +00:00
|
|
|
} else {
|
2009-03-20 18:03:34 +00:00
|
|
|
assert(InlineAsm::getNumOperandRegisters(Flags) == 1 &&
|
|
|
|
"Memory operand with multiple values?");
|
2006-02-24 02:13:54 +00:00
|
|
|
// Otherwise, this is a memory operand. Ask the target to select it.
|
2008-07-27 21:46:04 +00:00
|
|
|
std::vector<SDValue> SelOps;
|
2010-04-07 05:20:54 +00:00
|
|
|
if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps))
|
2010-04-07 22:58:41 +00:00
|
|
|
report_fatal_error("Could not match memory address. Inline asm"
|
2010-04-07 23:50:38 +00:00
|
|
|
" failure!");
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2006-02-24 02:13:54 +00:00
|
|
|
// Add this to the output node.
|
2010-04-07 05:20:54 +00:00
|
|
|
unsigned NewFlags =
|
|
|
|
InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size());
|
|
|
|
Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32));
|
2006-02-24 02:13:54 +00:00
|
|
|
Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
|
|
|
|
i += 2;
|
|
|
|
}
|
|
|
|
}
|
2009-09-20 02:20:51 +00:00
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
// Add the glue input back if present.
|
2006-02-24 02:13:54 +00:00
|
|
|
if (e != InOps.size())
|
|
|
|
Ops.push_back(InOps.back());
|
|
|
|
}
|
2007-05-01 21:15:47 +00:00
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
/// findGlueUse - Return use of MVT::Glue value produced by the specified
|
2009-05-08 18:51:58 +00:00
|
|
|
/// SDNode.
|
|
|
|
///
|
2010-12-23 17:13:18 +00:00
|
|
|
static SDNode *findGlueUse(SDNode *N) {
|
2009-05-08 18:51:58 +00:00
|
|
|
unsigned FlagResNo = N->getNumValues()-1;
|
|
|
|
for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
|
|
|
|
SDUse &Use = I.getUse();
|
|
|
|
if (Use.getResNo() == FlagResNo)
|
|
|
|
return Use.getUser();
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def".
|
|
|
|
/// This function recursively traverses up the operand chain, ignoring
|
|
|
|
/// certain nodes.
|
|
|
|
static bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse,
|
2010-03-02 22:20:06 +00:00
|
|
|
SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited,
|
|
|
|
bool IgnoreChains) {
|
2010-02-23 19:32:27 +00:00
|
|
|
// The NodeID's are given uniques ID's where a node ID is guaranteed to be
|
|
|
|
// greater than all of its (recursive) operands. If we scan to a point where
|
|
|
|
// 'use' is smaller than the node we're scanning for, then we know we will
|
|
|
|
// never find it.
|
|
|
|
//
|
|
|
|
// The Use may be -1 (unassigned) if it is a newly allocated node. This can
|
2010-12-23 17:13:18 +00:00
|
|
|
// happen because we scan down to newly selected nodes in the case of glue
|
2010-02-23 19:32:27 +00:00
|
|
|
// uses.
|
|
|
|
if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1))
|
|
|
|
return false;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-23 19:32:27 +00:00
|
|
|
// Don't revisit nodes if we already scanned it and didn't fail, we know we
|
|
|
|
// won't fail if we scan it again.
|
|
|
|
if (!Visited.insert(Use))
|
2009-05-08 18:51:58 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {
|
2010-03-02 22:20:06 +00:00
|
|
|
// Ignore chain uses, they are validated by HandleMergeInputChains.
|
|
|
|
if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains)
|
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2009-05-08 18:51:58 +00:00
|
|
|
SDNode *N = Use->getOperand(i).getNode();
|
|
|
|
if (N == Def) {
|
|
|
|
if (Use == ImmedUse || Use == Root)
|
|
|
|
continue; // We are not looking for immediate use.
|
|
|
|
assert(N != Root);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Traverse up the operand chain.
|
2010-03-02 22:20:06 +00:00
|
|
|
if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
|
2009-05-08 18:51:58 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-02-15 19:41:07 +00:00
|
|
|
/// IsProfitableToFold - Returns true if it's profitable to fold the specific
|
|
|
|
/// operand node N of U during instruction selection that starts at Root.
|
|
|
|
bool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U,
|
|
|
|
SDNode *Root) const {
|
|
|
|
if (OptLevel == CodeGenOpt::None) return false;
|
|
|
|
return N.hasOneUse();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// IsLegalToFold - Returns true if the specific operand node N of
|
|
|
|
/// U can be folded during instruction selection that starts at Root.
|
2010-03-02 22:20:06 +00:00
|
|
|
bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
|
2010-04-17 15:26:15 +00:00
|
|
|
CodeGenOpt::Level OptLevel,
|
|
|
|
bool IgnoreChains) {
|
2009-05-08 18:51:58 +00:00
|
|
|
if (OptLevel == CodeGenOpt::None) return false;
|
|
|
|
|
|
|
|
// If Root use can somehow reach N through a path that that doesn't contain
|
|
|
|
// U then folding N would create a cycle. e.g. In the following
|
|
|
|
// diagram, Root can reach N through X. If N is folded into into Root, then
|
|
|
|
// X is both a predecessor and a successor of U.
|
|
|
|
//
|
|
|
|
// [N*] //
|
|
|
|
// ^ ^ //
|
|
|
|
// / \ //
|
|
|
|
// [U*] [X]? //
|
|
|
|
// ^ ^ //
|
|
|
|
// \ / //
|
|
|
|
// \ / //
|
|
|
|
// [Root*] //
|
|
|
|
//
|
|
|
|
// * indicates nodes to be folded together.
|
|
|
|
//
|
2010-12-23 17:13:18 +00:00
|
|
|
// If Root produces glue, then it gets (even more) interesting. Since it
|
|
|
|
// will be "glued" together with its glue use in the scheduler, we need to
|
2009-05-08 18:51:58 +00:00
|
|
|
// check if it might reach N.
|
|
|
|
//
|
|
|
|
// [N*] //
|
|
|
|
// ^ ^ //
|
|
|
|
// / \ //
|
|
|
|
// [U*] [X]? //
|
|
|
|
// ^ ^ //
|
|
|
|
// \ \ //
|
|
|
|
// \ | //
|
|
|
|
// [Root*] | //
|
|
|
|
// ^ | //
|
|
|
|
// f | //
|
|
|
|
// | / //
|
|
|
|
// [Y] / //
|
|
|
|
// ^ / //
|
|
|
|
// f / //
|
|
|
|
// | / //
|
2010-12-23 17:13:18 +00:00
|
|
|
// [GU] //
|
2009-05-08 18:51:58 +00:00
|
|
|
//
|
2010-12-23 17:13:18 +00:00
|
|
|
// If GU (glue use) indirectly reaches N (the load), and Root folds N
|
|
|
|
// (call it Fold), then X is a predecessor of GU and a successor of
|
|
|
|
// Fold. But since Fold and GU are glued together, this will create
|
2009-05-08 18:51:58 +00:00
|
|
|
// a cycle in the scheduling graph.
|
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
// If the node has glue, walk down the graph to the "lowest" node in the
|
|
|
|
// glueged set.
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = Root->getValueType(Root->getNumValues()-1);
|
2010-12-21 02:38:05 +00:00
|
|
|
while (VT == MVT::Glue) {
|
2010-12-23 17:13:18 +00:00
|
|
|
SDNode *GU = findGlueUse(Root);
|
|
|
|
if (GU == NULL)
|
2009-05-08 18:51:58 +00:00
|
|
|
break;
|
2010-12-23 17:13:18 +00:00
|
|
|
Root = GU;
|
2009-05-08 18:51:58 +00:00
|
|
|
VT = Root->getValueType(Root->getNumValues()-1);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
// If our query node has a glue result with a use, we've walked up it. If
|
2010-03-05 06:19:13 +00:00
|
|
|
// the user (which has already been selected) has a chain or indirectly uses
|
|
|
|
// the chain, our WalkChainUsers predicate will not consider it. Because of
|
|
|
|
// this, we cannot ignore chains in this predicate.
|
|
|
|
IgnoreChains = false;
|
2009-05-08 18:51:58 +00:00
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2009-05-08 18:51:58 +00:00
|
|
|
|
2010-03-05 05:49:45 +00:00
|
|
|
SmallPtrSet<SDNode*, 16> Visited;
|
|
|
|
return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains);
|
2009-05-08 18:51:58 +00:00
|
|
|
}
|
|
|
|
|
2010-01-05 01:24:18 +00:00
|
|
|
SDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) {
|
|
|
|
std::vector<SDValue> Ops(N->op_begin(), N->op_end());
|
2009-10-29 22:30:23 +00:00
|
|
|
SelectInlineAsmMemoryOperands(Ops);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2009-10-29 22:30:23 +00:00
|
|
|
std::vector<EVT> VTs;
|
|
|
|
VTs.push_back(MVT::Other);
|
2010-12-21 02:38:05 +00:00
|
|
|
VTs.push_back(MVT::Glue);
|
2010-01-05 01:24:18 +00:00
|
|
|
SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(),
|
2009-10-29 22:30:23 +00:00
|
|
|
VTs, &Ops[0], Ops.size());
|
2010-03-02 22:20:06 +00:00
|
|
|
New->setNodeId(-1);
|
2009-10-29 22:30:23 +00:00
|
|
|
return New.getNode();
|
|
|
|
}
|
|
|
|
|
2010-01-05 01:24:18 +00:00
|
|
|
SDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) {
|
2010-02-09 19:54:29 +00:00
|
|
|
return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0));
|
2009-10-29 22:30:23 +00:00
|
|
|
}
|
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
/// GetVBR - decode a vbr encoding whose top bit is set.
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static uint64_t
|
2010-02-28 22:37:22 +00:00
|
|
|
GetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) {
|
|
|
|
assert(Val >= 128 && "Not a VBR");
|
|
|
|
Val &= 127; // Remove first vbr bit.
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
unsigned Shift = 7;
|
|
|
|
uint64_t NextBits;
|
|
|
|
do {
|
2010-02-28 22:38:43 +00:00
|
|
|
NextBits = MatcherTable[Idx++];
|
2010-02-28 22:37:22 +00:00
|
|
|
Val |= (NextBits&127) << Shift;
|
|
|
|
Shift += 7;
|
|
|
|
} while (NextBits & 128);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
return Val;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
/// UpdateChainsAndGlue - When a match is complete, this method updates uses of
|
|
|
|
/// interior glue and chain results to use the new glue and chain results.
|
2010-03-02 07:50:03 +00:00
|
|
|
void SelectionDAGISel::
|
2010-12-23 17:13:18 +00:00
|
|
|
UpdateChainsAndGlue(SDNode *NodeToMatch, SDValue InputChain,
|
|
|
|
const SmallVectorImpl<SDNode*> &ChainNodesMatched,
|
|
|
|
SDValue InputGlue,
|
|
|
|
const SmallVectorImpl<SDNode*> &GlueResultNodesMatched,
|
|
|
|
bool isMorphNodeTo) {
|
2010-03-02 07:50:03 +00:00
|
|
|
SmallVector<SDNode*, 4> NowDeadNodes;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 07:50:03 +00:00
|
|
|
ISelUpdater ISU(ISelPosition);
|
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// Now that all the normal results are replaced, we replace the chain and
|
2010-12-23 17:13:18 +00:00
|
|
|
// glue results if present.
|
2010-02-28 22:37:22 +00:00
|
|
|
if (!ChainNodesMatched.empty()) {
|
|
|
|
assert(InputChain.getNode() != 0 &&
|
|
|
|
"Matched input chains but didn't produce a chain");
|
|
|
|
// Loop over all of the nodes we matched that produced a chain result.
|
|
|
|
// Replace all the chain results with the final chain we ended up with.
|
|
|
|
for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
|
|
|
|
SDNode *ChainNode = ChainNodesMatched[i];
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 07:50:03 +00:00
|
|
|
// If this node was already deleted, don't look at it.
|
|
|
|
if (ChainNode->getOpcode() == ISD::DELETED_NODE)
|
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// Don't replace the results of the root node if we're doing a
|
|
|
|
// MorphNodeTo.
|
|
|
|
if (ChainNode == NodeToMatch && isMorphNodeTo)
|
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
|
2010-12-21 02:38:05 +00:00
|
|
|
if (ChainVal.getValueType() == MVT::Glue)
|
2010-02-28 22:37:22 +00:00
|
|
|
ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
|
|
|
|
assert(ChainVal.getValueType() == MVT::Other && "Not a chain?");
|
2010-03-02 07:50:03 +00:00
|
|
|
CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-28 05:28:31 +00:00
|
|
|
// If the node became dead and we haven't already seen it, delete it.
|
|
|
|
if (ChainNode->use_empty() &&
|
|
|
|
!std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode))
|
2010-03-02 07:50:03 +00:00
|
|
|
NowDeadNodes.push_back(ChainNode);
|
2010-02-28 22:37:22 +00:00
|
|
|
}
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
// If the result produces glue, update any glue results in the matched
|
|
|
|
// pattern with the glue result.
|
|
|
|
if (InputGlue.getNode() != 0) {
|
2010-02-28 22:37:22 +00:00
|
|
|
// Handle any interior nodes explicitly marked.
|
2010-12-23 17:13:18 +00:00
|
|
|
for (unsigned i = 0, e = GlueResultNodesMatched.size(); i != e; ++i) {
|
|
|
|
SDNode *FRN = GlueResultNodesMatched[i];
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 07:50:03 +00:00
|
|
|
// If this node was already deleted, don't look at it.
|
|
|
|
if (FRN->getOpcode() == ISD::DELETED_NODE)
|
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-21 02:38:05 +00:00
|
|
|
assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue &&
|
2010-12-23 17:13:18 +00:00
|
|
|
"Doesn't have a glue result");
|
2010-02-28 22:37:22 +00:00
|
|
|
CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1),
|
2010-12-23 17:13:18 +00:00
|
|
|
InputGlue, &ISU);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-28 04:54:33 +00:00
|
|
|
// If the node became dead and we haven't already seen it, delete it.
|
|
|
|
if (FRN->use_empty() &&
|
|
|
|
!std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN))
|
2010-03-02 07:50:03 +00:00
|
|
|
NowDeadNodes.push_back(FRN);
|
2010-02-28 22:37:22 +00:00
|
|
|
}
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 07:50:03 +00:00
|
|
|
if (!NowDeadNodes.empty())
|
|
|
|
CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
DEBUG(errs() << "ISEL: Match complete!\n");
|
|
|
|
}
|
|
|
|
|
2010-03-02 02:22:10 +00:00
|
|
|
enum ChainResult {
|
|
|
|
CR_Simple,
|
|
|
|
CR_InducesCycle,
|
|
|
|
CR_LeadsToInteriorNode
|
|
|
|
};
|
|
|
|
|
|
|
|
/// WalkChainUsers - Walk down the users of the specified chained node that is
|
|
|
|
/// part of the pattern we're matching, looking at all of the users we find.
|
|
|
|
/// This determines whether something is an interior node, whether we have a
|
|
|
|
/// non-pattern node in between two pattern nodes (which prevent folding because
|
|
|
|
/// it would induce a cycle) and whether we have a TokenFactor node sandwiched
|
|
|
|
/// between pattern nodes (in which case the TF becomes part of the pattern).
|
|
|
|
///
|
|
|
|
/// The walk we do here is guaranteed to be small because we quickly get down to
|
|
|
|
/// already selected nodes "below" us.
|
2010-12-24 04:28:06 +00:00
|
|
|
static ChainResult
|
2010-03-02 02:22:10 +00:00
|
|
|
WalkChainUsers(SDNode *ChainedNode,
|
|
|
|
SmallVectorImpl<SDNode*> &ChainedNodesInPattern,
|
|
|
|
SmallVectorImpl<SDNode*> &InteriorChainedNodes) {
|
|
|
|
ChainResult Result = CR_Simple;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 02:22:10 +00:00
|
|
|
for (SDNode::use_iterator UI = ChainedNode->use_begin(),
|
|
|
|
E = ChainedNode->use_end(); UI != E; ++UI) {
|
|
|
|
// Make sure the use is of the chain, not some other value we produce.
|
|
|
|
if (UI.getUse().getValueType() != MVT::Other) continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 02:22:10 +00:00
|
|
|
SDNode *User = *UI;
|
|
|
|
|
|
|
|
// If we see an already-selected machine node, then we've gone beyond the
|
|
|
|
// pattern that we're selecting down into the already selected chunk of the
|
|
|
|
// DAG.
|
|
|
|
if (User->isMachineOpcode() ||
|
|
|
|
User->getOpcode() == ISD::HANDLENODE) // Root of the graph.
|
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 22:20:06 +00:00
|
|
|
if (User->getOpcode() == ISD::CopyToReg ||
|
|
|
|
User->getOpcode() == ISD::CopyFromReg ||
|
2010-03-14 02:33:54 +00:00
|
|
|
User->getOpcode() == ISD::INLINEASM ||
|
|
|
|
User->getOpcode() == ISD::EH_LABEL) {
|
2010-03-02 22:20:06 +00:00
|
|
|
// If their node ID got reset to -1 then they've already been selected.
|
|
|
|
// Treat them like a MachineOpcode.
|
|
|
|
if (User->getNodeId() == -1)
|
|
|
|
continue;
|
|
|
|
}
|
2010-03-02 02:22:10 +00:00
|
|
|
|
|
|
|
// If we have a TokenFactor, we handle it specially.
|
|
|
|
if (User->getOpcode() != ISD::TokenFactor) {
|
|
|
|
// If the node isn't a token factor and isn't part of our pattern, then it
|
|
|
|
// must be a random chained node in between two nodes we're selecting.
|
|
|
|
// This happens when we have something like:
|
|
|
|
// x = load ptr
|
|
|
|
// call
|
|
|
|
// y = x+4
|
|
|
|
// store y -> ptr
|
|
|
|
// Because we structurally match the load/store as a read/modify/write,
|
|
|
|
// but the call is chained between them. We cannot fold in this case
|
|
|
|
// because it would induce a cycle in the graph.
|
|
|
|
if (!std::count(ChainedNodesInPattern.begin(),
|
|
|
|
ChainedNodesInPattern.end(), User))
|
|
|
|
return CR_InducesCycle;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 02:22:10 +00:00
|
|
|
// Otherwise we found a node that is part of our pattern. For example in:
|
|
|
|
// x = load ptr
|
|
|
|
// y = x+4
|
|
|
|
// store y -> ptr
|
|
|
|
// This would happen when we're scanning down from the load and see the
|
|
|
|
// store as a user. Record that there is a use of ChainedNode that is
|
|
|
|
// part of the pattern and keep scanning uses.
|
|
|
|
Result = CR_LeadsToInteriorNode;
|
|
|
|
InteriorChainedNodes.push_back(User);
|
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 02:22:10 +00:00
|
|
|
// If we found a TokenFactor, there are two cases to consider: first if the
|
|
|
|
// TokenFactor is just hanging "below" the pattern we're matching (i.e. no
|
|
|
|
// uses of the TF are in our pattern) we just want to ignore it. Second,
|
|
|
|
// the TokenFactor can be sandwiched in between two chained nodes, like so:
|
|
|
|
// [Load chain]
|
|
|
|
// ^
|
|
|
|
// |
|
|
|
|
// [Load]
|
|
|
|
// ^ ^
|
|
|
|
// | \ DAG's like cheese
|
|
|
|
// / \ do you?
|
|
|
|
// / |
|
|
|
|
// [TokenFactor] [Op]
|
|
|
|
// ^ ^
|
|
|
|
// | |
|
|
|
|
// \ /
|
|
|
|
// \ /
|
|
|
|
// [Store]
|
|
|
|
//
|
|
|
|
// In this case, the TokenFactor becomes part of our match and we rewrite it
|
|
|
|
// as a new TokenFactor.
|
|
|
|
//
|
|
|
|
// To distinguish these two cases, do a recursive walk down the uses.
|
|
|
|
switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) {
|
|
|
|
case CR_Simple:
|
|
|
|
// If the uses of the TokenFactor are just already-selected nodes, ignore
|
|
|
|
// it, it is "below" our pattern.
|
|
|
|
continue;
|
|
|
|
case CR_InducesCycle:
|
|
|
|
// If the uses of the TokenFactor lead to nodes that are not part of our
|
|
|
|
// pattern that are not selected, folding would turn this into a cycle,
|
|
|
|
// bail out now.
|
|
|
|
return CR_InducesCycle;
|
|
|
|
case CR_LeadsToInteriorNode:
|
|
|
|
break; // Otherwise, keep processing.
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 02:22:10 +00:00
|
|
|
// Okay, we know we're in the interesting interior case. The TokenFactor
|
|
|
|
// is now going to be considered part of the pattern so that we rewrite its
|
|
|
|
// uses (it may have uses that are not part of the pattern) with the
|
|
|
|
// ultimate chain result of the generated code. We will also add its chain
|
|
|
|
// inputs as inputs to the ultimate TokenFactor we create.
|
|
|
|
Result = CR_LeadsToInteriorNode;
|
|
|
|
ChainedNodesInPattern.push_back(User);
|
|
|
|
InteriorChainedNodes.push_back(User);
|
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 02:22:10 +00:00
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2010-03-02 00:00:03 +00:00
|
|
|
/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains
|
2010-03-02 19:34:59 +00:00
|
|
|
/// operation for when the pattern matched at least one node with a chains. The
|
2010-03-02 02:22:10 +00:00
|
|
|
/// input vector contains a list of all of the chained nodes that we match. We
|
|
|
|
/// must determine if this is a valid thing to cover (i.e. matching it won't
|
|
|
|
/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will
|
|
|
|
/// be used as the input node chain for the generated nodes.
|
2010-03-02 00:00:03 +00:00
|
|
|
static SDValue
|
2010-03-02 02:22:10 +00:00
|
|
|
HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
|
2010-03-02 00:00:03 +00:00
|
|
|
SelectionDAG *CurDAG) {
|
2010-03-02 02:22:10 +00:00
|
|
|
// Walk all of the chained nodes we've matched, recursively scanning down the
|
|
|
|
// users of the chain result. This adds any TokenFactor nodes that are caught
|
|
|
|
// in between chained nodes to the chained and interior nodes list.
|
|
|
|
SmallVector<SDNode*, 3> InteriorChainedNodes;
|
|
|
|
for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
|
|
|
|
if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
|
|
|
|
InteriorChainedNodes) == CR_InducesCycle)
|
|
|
|
return SDValue(); // Would induce a cycle.
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 02:22:10 +00:00
|
|
|
// Okay, we have walked all the matched nodes and collected TokenFactor nodes
|
|
|
|
// that we are interested in. Form our input TokenFactor node.
|
2010-03-02 00:00:03 +00:00
|
|
|
SmallVector<SDValue, 3> InputChains;
|
|
|
|
for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
|
2010-03-02 02:22:10 +00:00
|
|
|
// Add the input chain of this node to the InputChains list (which will be
|
|
|
|
// the operands of the generated TokenFactor) if it's not an interior node.
|
|
|
|
SDNode *N = ChainNodesMatched[i];
|
|
|
|
if (N->getOpcode() != ISD::TokenFactor) {
|
|
|
|
if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N))
|
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 02:22:10 +00:00
|
|
|
// Otherwise, add the input chain.
|
|
|
|
SDValue InChain = ChainNodesMatched[i]->getOperand(0);
|
|
|
|
assert(InChain.getValueType() == MVT::Other && "Not a chain");
|
2010-03-02 00:00:03 +00:00
|
|
|
InputChains.push_back(InChain);
|
2010-03-02 02:22:10 +00:00
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 02:22:10 +00:00
|
|
|
// If we have a token factor, we want to add all inputs of the token factor
|
|
|
|
// that are not part of the pattern we're matching.
|
|
|
|
for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) {
|
|
|
|
if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
|
2010-03-02 02:37:23 +00:00
|
|
|
N->getOperand(op).getNode()))
|
|
|
|
InputChains.push_back(N->getOperand(op));
|
2010-03-02 02:22:10 +00:00
|
|
|
}
|
2010-03-02 00:00:03 +00:00
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 00:00:03 +00:00
|
|
|
SDValue Res;
|
|
|
|
if (InputChains.size() == 1)
|
|
|
|
return InputChains[0];
|
|
|
|
return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(),
|
|
|
|
MVT::Other, &InputChains[0], InputChains.size());
|
2010-12-24 04:28:06 +00:00
|
|
|
}
|
2010-02-28 22:37:22 +00:00
|
|
|
|
2010-03-02 06:55:04 +00:00
|
|
|
/// MorphNode - Handle morphing a node in place for the selector.
|
|
|
|
SDNode *SelectionDAGISel::
|
|
|
|
MorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList,
|
|
|
|
const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) {
|
|
|
|
// It is possible we're using MorphNodeTo to replace a node with no
|
|
|
|
// normal results with one that has a normal result (or we could be
|
2010-12-23 17:13:18 +00:00
|
|
|
// adding a chain) and the input could have glue and chains as well.
|
2010-03-28 08:43:23 +00:00
|
|
|
// In this case we need to shift the operands down.
|
2010-03-02 06:55:04 +00:00
|
|
|
// FIXME: This is a horrible hack and broken in obscure cases, no worse
|
2010-03-27 18:54:50 +00:00
|
|
|
// than the old isel though.
|
2010-12-23 17:13:18 +00:00
|
|
|
int OldGlueResultNo = -1, OldChainResultNo = -1;
|
2010-03-02 06:55:04 +00:00
|
|
|
|
|
|
|
unsigned NTMNumResults = Node->getNumValues();
|
2010-12-21 02:38:05 +00:00
|
|
|
if (Node->getValueType(NTMNumResults-1) == MVT::Glue) {
|
2010-12-23 17:13:18 +00:00
|
|
|
OldGlueResultNo = NTMNumResults-1;
|
2010-03-02 06:55:04 +00:00
|
|
|
if (NTMNumResults != 1 &&
|
|
|
|
Node->getValueType(NTMNumResults-2) == MVT::Other)
|
|
|
|
OldChainResultNo = NTMNumResults-2;
|
|
|
|
} else if (Node->getValueType(NTMNumResults-1) == MVT::Other)
|
|
|
|
OldChainResultNo = NTMNumResults-1;
|
|
|
|
|
2010-03-02 07:14:49 +00:00
|
|
|
// Call the underlying SelectionDAG routine to do the transmogrification. Note
|
|
|
|
// that this deletes operands of the old node that become dead.
|
2010-03-02 06:55:04 +00:00
|
|
|
SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps);
|
|
|
|
|
|
|
|
// MorphNodeTo can operate in two ways: if an existing node with the
|
|
|
|
// specified operands exists, it can just return it. Otherwise, it
|
|
|
|
// updates the node in place to have the requested operands.
|
|
|
|
if (Res == Node) {
|
|
|
|
// If we updated the node in place, reset the node ID. To the isel,
|
|
|
|
// this should be just like a newly allocated machine node.
|
|
|
|
Res->setNodeId(-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned ResNumResults = Res->getNumValues();
|
2010-12-23 17:13:18 +00:00
|
|
|
// Move the glue if needed.
|
|
|
|
if ((EmitNodeInfo & OPFL_GlueOutput) && OldGlueResultNo != -1 &&
|
|
|
|
(unsigned)OldGlueResultNo != ResNumResults-1)
|
2010-12-24 04:28:06 +00:00
|
|
|
CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldGlueResultNo),
|
2010-03-02 06:55:04 +00:00
|
|
|
SDValue(Res, ResNumResults-1));
|
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
if ((EmitNodeInfo & OPFL_GlueOutput) != 0)
|
2010-07-04 08:58:43 +00:00
|
|
|
--ResNumResults;
|
2010-03-02 06:55:04 +00:00
|
|
|
|
|
|
|
// Move the chain reference if needed.
|
|
|
|
if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 &&
|
|
|
|
(unsigned)OldChainResultNo != ResNumResults-1)
|
2010-12-24 04:28:06 +00:00
|
|
|
CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo),
|
2010-03-02 06:55:04 +00:00
|
|
|
SDValue(Res, ResNumResults-1));
|
|
|
|
|
|
|
|
// Otherwise, no replacement happened because the node already exists. Replace
|
|
|
|
// Uses of the old node with the new one.
|
|
|
|
if (Res != Node)
|
|
|
|
CurDAG->ReplaceAllUsesWith(Node, Res);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 06:55:04 +00:00
|
|
|
return Res;
|
|
|
|
}
|
|
|
|
|
2010-03-03 07:46:25 +00:00
|
|
|
/// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
|
2010-03-03 07:46:25 +00:00
|
|
|
CheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex,
|
2010-09-21 22:00:25 +00:00
|
|
|
SDValue N,
|
|
|
|
const SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
|
2010-03-03 07:46:25 +00:00
|
|
|
// Accept if it is exactly the same as a previously recorded node.
|
|
|
|
unsigned RecNo = MatcherTable[MatcherIndex++];
|
|
|
|
assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
|
2010-09-21 22:00:25 +00:00
|
|
|
return N == RecordedNodes[RecNo].first;
|
2010-03-03 07:46:25 +00:00
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:31:15 +00:00
|
|
|
/// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
|
2010-03-03 07:31:15 +00:00
|
|
|
CheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
|
|
|
|
SelectionDAGISel &SDISel) {
|
|
|
|
return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// CheckNodePredicate - Implements OP_CheckNodePredicate.
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
|
2010-03-03 07:31:15 +00:00
|
|
|
CheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
|
|
|
|
SelectionDAGISel &SDISel, SDNode *N) {
|
|
|
|
return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]);
|
|
|
|
}
|
|
|
|
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
|
2010-03-03 07:31:15 +00:00
|
|
|
CheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
|
|
|
|
SDNode *N) {
|
2010-03-25 06:33:05 +00:00
|
|
|
uint16_t Opc = MatcherTable[MatcherIndex++];
|
|
|
|
Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
|
|
|
|
return N->getOpcode() == Opc;
|
2010-03-03 07:31:15 +00:00
|
|
|
}
|
|
|
|
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
|
2010-03-03 07:31:15 +00:00
|
|
|
CheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
|
|
|
|
SDValue N, const TargetLowering &TLI) {
|
|
|
|
MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
|
|
|
|
if (N.getValueType() == VT) return true;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:31:15 +00:00
|
|
|
// Handle the case when VT is iPTR.
|
|
|
|
return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy();
|
|
|
|
}
|
|
|
|
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
|
2010-03-03 07:46:25 +00:00
|
|
|
CheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
|
|
|
|
SDValue N, const TargetLowering &TLI,
|
|
|
|
unsigned ChildNo) {
|
|
|
|
if (ChildNo >= N.getNumOperands())
|
|
|
|
return false; // Match fails if out of range child #.
|
|
|
|
return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
|
2010-03-03 07:46:25 +00:00
|
|
|
CheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
|
|
|
|
SDValue N) {
|
|
|
|
return cast<CondCodeSDNode>(N)->get() ==
|
|
|
|
(ISD::CondCode)MatcherTable[MatcherIndex++];
|
|
|
|
}
|
|
|
|
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
|
2010-03-03 07:46:25 +00:00
|
|
|
CheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
|
|
|
|
SDValue N, const TargetLowering &TLI) {
|
|
|
|
MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
|
|
|
|
if (cast<VTSDNode>(N)->getVT() == VT)
|
|
|
|
return true;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:46:25 +00:00
|
|
|
// Handle the case when VT is iPTR.
|
|
|
|
return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy();
|
|
|
|
}
|
|
|
|
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
|
2010-03-03 07:31:15 +00:00
|
|
|
CheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex,
|
|
|
|
SDValue N) {
|
|
|
|
int64_t Val = MatcherTable[MatcherIndex++];
|
|
|
|
if (Val & 128)
|
|
|
|
Val = GetVBR(Val, MatcherTable, MatcherIndex);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:31:15 +00:00
|
|
|
ConstantSDNode *C = dyn_cast<ConstantSDNode>(N);
|
|
|
|
return C != 0 && C->getSExtValue() == Val;
|
|
|
|
}
|
|
|
|
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
|
2010-03-03 07:46:25 +00:00
|
|
|
CheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
|
|
|
|
SDValue N, SelectionDAGISel &SDISel) {
|
|
|
|
int64_t Val = MatcherTable[MatcherIndex++];
|
|
|
|
if (Val & 128)
|
|
|
|
Val = GetVBR(Val, MatcherTable, MatcherIndex);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:46:25 +00:00
|
|
|
if (N->getOpcode() != ISD::AND) return false;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:46:25 +00:00
|
|
|
ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
|
|
|
|
return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val);
|
|
|
|
}
|
|
|
|
|
2010-10-23 08:40:19 +00:00
|
|
|
LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
|
2010-03-03 07:46:25 +00:00
|
|
|
CheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
|
|
|
|
SDValue N, SelectionDAGISel &SDISel) {
|
|
|
|
int64_t Val = MatcherTable[MatcherIndex++];
|
|
|
|
if (Val & 128)
|
|
|
|
Val = GetVBR(Val, MatcherTable, MatcherIndex);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:46:25 +00:00
|
|
|
if (N->getOpcode() != ISD::OR) return false;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:46:25 +00:00
|
|
|
ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
|
|
|
|
return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val);
|
|
|
|
}
|
|
|
|
|
2010-03-03 07:31:15 +00:00
|
|
|
/// IsPredicateKnownToFail - If we know how and can do so without pushing a
|
|
|
|
/// scope, evaluate the current node. If the current predicate is known to
|
|
|
|
/// fail, set Result=true and return anything. If the current predicate is
|
|
|
|
/// known to pass, set Result=false and return the MatcherIndex to continue
|
|
|
|
/// with. If the current predicate is unknown, set Result=false and return the
|
2010-12-24 04:28:06 +00:00
|
|
|
/// MatcherIndex to continue with.
|
2010-03-03 07:31:15 +00:00
|
|
|
static unsigned IsPredicateKnownToFail(const unsigned char *Table,
|
|
|
|
unsigned Index, SDValue N,
|
2010-03-03 07:46:25 +00:00
|
|
|
bool &Result, SelectionDAGISel &SDISel,
|
2010-09-21 22:00:25 +00:00
|
|
|
SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
|
2010-03-03 07:31:15 +00:00
|
|
|
switch (Table[Index++]) {
|
|
|
|
default:
|
|
|
|
Result = false;
|
|
|
|
return Index-1; // Could not evaluate this predicate.
|
2010-03-03 07:46:25 +00:00
|
|
|
case SelectionDAGISel::OPC_CheckSame:
|
|
|
|
Result = !::CheckSame(Table, Index, N, RecordedNodes);
|
|
|
|
return Index;
|
2010-03-03 07:31:15 +00:00
|
|
|
case SelectionDAGISel::OPC_CheckPatternPredicate:
|
2010-03-03 07:46:25 +00:00
|
|
|
Result = !::CheckPatternPredicate(Table, Index, SDISel);
|
2010-03-03 07:31:15 +00:00
|
|
|
return Index;
|
|
|
|
case SelectionDAGISel::OPC_CheckPredicate:
|
2010-03-03 07:46:25 +00:00
|
|
|
Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode());
|
2010-03-03 07:31:15 +00:00
|
|
|
return Index;
|
|
|
|
case SelectionDAGISel::OPC_CheckOpcode:
|
|
|
|
Result = !::CheckOpcode(Table, Index, N.getNode());
|
|
|
|
return Index;
|
|
|
|
case SelectionDAGISel::OPC_CheckType:
|
|
|
|
Result = !::CheckType(Table, Index, N, SDISel.TLI);
|
|
|
|
return Index;
|
|
|
|
case SelectionDAGISel::OPC_CheckChild0Type:
|
|
|
|
case SelectionDAGISel::OPC_CheckChild1Type:
|
|
|
|
case SelectionDAGISel::OPC_CheckChild2Type:
|
|
|
|
case SelectionDAGISel::OPC_CheckChild3Type:
|
|
|
|
case SelectionDAGISel::OPC_CheckChild4Type:
|
|
|
|
case SelectionDAGISel::OPC_CheckChild5Type:
|
|
|
|
case SelectionDAGISel::OPC_CheckChild6Type:
|
2010-03-03 07:46:25 +00:00
|
|
|
case SelectionDAGISel::OPC_CheckChild7Type:
|
|
|
|
Result = !::CheckChildType(Table, Index, N, SDISel.TLI,
|
|
|
|
Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type);
|
|
|
|
return Index;
|
|
|
|
case SelectionDAGISel::OPC_CheckCondCode:
|
|
|
|
Result = !::CheckCondCode(Table, Index, N);
|
|
|
|
return Index;
|
|
|
|
case SelectionDAGISel::OPC_CheckValueType:
|
|
|
|
Result = !::CheckValueType(Table, Index, N, SDISel.TLI);
|
2010-03-03 07:31:15 +00:00
|
|
|
return Index;
|
|
|
|
case SelectionDAGISel::OPC_CheckInteger:
|
|
|
|
Result = !::CheckInteger(Table, Index, N);
|
|
|
|
return Index;
|
2010-03-03 07:46:25 +00:00
|
|
|
case SelectionDAGISel::OPC_CheckAndImm:
|
|
|
|
Result = !::CheckAndImm(Table, Index, N, SDISel);
|
|
|
|
return Index;
|
|
|
|
case SelectionDAGISel::OPC_CheckOrImm:
|
|
|
|
Result = !::CheckOrImm(Table, Index, N, SDISel);
|
|
|
|
return Index;
|
2010-03-03 07:31:15 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-04-15 17:08:50 +00:00
|
|
|
namespace {
|
2010-03-02 06:55:04 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
struct MatchScope {
|
|
|
|
/// FailIndex - If this match fails, this is the index to continue with.
|
|
|
|
unsigned FailIndex;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
/// NodeStack - The node stack when the scope was formed.
|
|
|
|
SmallVector<SDValue, 4> NodeStack;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
/// NumRecordedNodes - The number of recorded nodes when the scope was formed.
|
|
|
|
unsigned NumRecordedNodes;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
/// NumMatchedMemRefs - The number of matched memref entries.
|
|
|
|
unsigned NumMatchedMemRefs;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
|
|
|
/// InputChain/InputGlue - The current chain/glue
|
2010-12-23 17:13:18 +00:00
|
|
|
SDValue InputChain, InputGlue;
|
2010-02-28 22:37:22 +00:00
|
|
|
|
|
|
|
/// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
|
2010-12-23 17:13:18 +00:00
|
|
|
bool HasChainNodesMatched, HasGlueResultNodesMatched;
|
2010-02-28 22:37:22 +00:00
|
|
|
};
|
|
|
|
|
2010-04-15 17:08:50 +00:00
|
|
|
}
|
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
SDNode *SelectionDAGISel::
|
|
|
|
SelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable,
|
|
|
|
unsigned TableSize) {
|
|
|
|
// FIXME: Should these even be selected? Handle these cases in the caller?
|
|
|
|
switch (NodeToMatch->getOpcode()) {
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
case ISD::EntryToken: // These nodes remain the same.
|
|
|
|
case ISD::BasicBlock:
|
|
|
|
case ISD::Register:
|
2010-03-14 17:53:23 +00:00
|
|
|
//case ISD::VALUETYPE:
|
|
|
|
//case ISD::CONDCODE:
|
2010-02-28 22:37:22 +00:00
|
|
|
case ISD::HANDLENODE:
|
2010-04-07 05:20:54 +00:00
|
|
|
case ISD::MDNODE_SDNODE:
|
2010-02-28 22:37:22 +00:00
|
|
|
case ISD::TargetConstant:
|
|
|
|
case ISD::TargetConstantFP:
|
|
|
|
case ISD::TargetConstantPool:
|
|
|
|
case ISD::TargetFrameIndex:
|
|
|
|
case ISD::TargetExternalSymbol:
|
|
|
|
case ISD::TargetBlockAddress:
|
|
|
|
case ISD::TargetJumpTable:
|
|
|
|
case ISD::TargetGlobalTLSAddress:
|
|
|
|
case ISD::TargetGlobalAddress:
|
|
|
|
case ISD::TokenFactor:
|
|
|
|
case ISD::CopyFromReg:
|
|
|
|
case ISD::CopyToReg:
|
2010-03-14 02:33:54 +00:00
|
|
|
case ISD::EH_LABEL:
|
2010-03-02 22:20:06 +00:00
|
|
|
NodeToMatch->setNodeId(-1); // Mark selected.
|
2010-02-28 22:37:22 +00:00
|
|
|
return 0;
|
|
|
|
case ISD::AssertSext:
|
|
|
|
case ISD::AssertZext:
|
|
|
|
CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0),
|
|
|
|
NodeToMatch->getOperand(0));
|
|
|
|
return 0;
|
|
|
|
case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch);
|
|
|
|
case ISD::UNDEF: return Select_UNDEF(NodeToMatch);
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
assert(!NodeToMatch->isMachineOpcode() && "Node already selected!");
|
|
|
|
|
|
|
|
// Set up the node stack with NodeToMatch as the only node on the stack.
|
|
|
|
SmallVector<SDValue, 8> NodeStack;
|
|
|
|
SDValue N = SDValue(NodeToMatch, 0);
|
|
|
|
NodeStack.push_back(N);
|
|
|
|
|
|
|
|
// MatchScopes - Scopes used when matching, if a match failure happens, this
|
|
|
|
// indicates where to continue checking.
|
|
|
|
SmallVector<MatchScope, 8> MatchScopes;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// RecordedNodes - This is the set of nodes that have been recorded by the
|
2010-09-21 22:00:25 +00:00
|
|
|
// state machine. The second value is the parent of the node, or null if the
|
|
|
|
// root is recorded.
|
|
|
|
SmallVector<std::pair<SDValue, SDNode*>, 8> RecordedNodes;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// MatchedMemRefs - This is the set of MemRef's we've seen in the input
|
|
|
|
// pattern.
|
|
|
|
SmallVector<MachineMemOperand*, 2> MatchedMemRefs;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
// These are the current input chain and glue for use when generating nodes.
|
2010-02-28 22:37:22 +00:00
|
|
|
// Various Emit operations change these. For example, emitting a copytoreg
|
|
|
|
// uses and updates these.
|
2010-12-23 17:13:18 +00:00
|
|
|
SDValue InputChain, InputGlue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// ChainNodesMatched - If a pattern matches nodes that have input/output
|
|
|
|
// chains, the OPC_EmitMergeInputChains operation is emitted which indicates
|
|
|
|
// which ones they are. The result is captured into this list so that we can
|
|
|
|
// update the chain results when the pattern is complete.
|
|
|
|
SmallVector<SDNode*, 3> ChainNodesMatched;
|
2010-12-23 17:13:18 +00:00
|
|
|
SmallVector<SDNode*, 3> GlueResultNodesMatched;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
DEBUG(errs() << "ISEL: Starting pattern match on root node: ";
|
|
|
|
NodeToMatch->dump(CurDAG);
|
|
|
|
errs() << '\n');
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-01 18:47:11 +00:00
|
|
|
// Determine where to start the interpreter. Normally we start at opcode #0,
|
|
|
|
// but if the state machine starts with an OPC_SwitchOpcode, then we
|
|
|
|
// accelerate the first lookup (which is guaranteed to be hot) with the
|
|
|
|
// OpcodeOffset table.
|
2010-02-28 22:37:22 +00:00
|
|
|
unsigned MatcherIndex = 0;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-01 18:47:11 +00:00
|
|
|
if (!OpcodeOffset.empty()) {
|
|
|
|
// Already computed the OpcodeOffset table, just index into it.
|
|
|
|
if (N.getOpcode() < OpcodeOffset.size())
|
|
|
|
MatcherIndex = OpcodeOffset[N.getOpcode()];
|
|
|
|
DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n");
|
|
|
|
|
|
|
|
} else if (MatcherTable[0] == OPC_SwitchOpcode) {
|
|
|
|
// Otherwise, the table isn't computed, but the state machine does start
|
|
|
|
// with an OPC_SwitchOpcode instruction. Populate the table now, since this
|
|
|
|
// is the first time we're selecting an instruction.
|
|
|
|
unsigned Idx = 1;
|
|
|
|
while (1) {
|
|
|
|
// Get the size of this case.
|
|
|
|
unsigned CaseSize = MatcherTable[Idx++];
|
|
|
|
if (CaseSize & 128)
|
|
|
|
CaseSize = GetVBR(CaseSize, MatcherTable, Idx);
|
|
|
|
if (CaseSize == 0) break;
|
|
|
|
|
|
|
|
// Get the opcode, add the index to the table.
|
2010-03-25 06:33:05 +00:00
|
|
|
uint16_t Opc = MatcherTable[Idx++];
|
|
|
|
Opc |= (unsigned short)MatcherTable[Idx++] << 8;
|
2010-03-01 18:47:11 +00:00
|
|
|
if (Opc >= OpcodeOffset.size())
|
|
|
|
OpcodeOffset.resize((Opc+1)*2);
|
|
|
|
OpcodeOffset[Opc] = Idx;
|
|
|
|
Idx += CaseSize;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Okay, do the lookup for the first opcode.
|
|
|
|
if (N.getOpcode() < OpcodeOffset.size())
|
|
|
|
MatcherIndex = OpcodeOffset[N.getOpcode()];
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
while (1) {
|
|
|
|
assert(MatcherIndex < TableSize && "Invalid index");
|
2010-03-09 02:15:05 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
unsigned CurrentOpcodeIndex = MatcherIndex;
|
|
|
|
#endif
|
2010-02-28 22:37:22 +00:00
|
|
|
BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++];
|
|
|
|
switch (Opcode) {
|
|
|
|
case OPC_Scope: {
|
2010-03-03 07:31:15 +00:00
|
|
|
// Okay, the semantics of this operation are that we should push a scope
|
|
|
|
// then evaluate the first child. However, pushing a scope only to have
|
|
|
|
// the first check fail (which then pops it) is inefficient. If we can
|
|
|
|
// determine immediately that the first check (or first several) will
|
|
|
|
// immediately fail, don't even bother pushing a scope for them.
|
|
|
|
unsigned FailIndex;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:31:15 +00:00
|
|
|
while (1) {
|
|
|
|
unsigned NumToSkip = MatcherTable[MatcherIndex++];
|
|
|
|
if (NumToSkip & 128)
|
|
|
|
NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
|
|
|
|
// Found the end of the scope with no match.
|
|
|
|
if (NumToSkip == 0) {
|
|
|
|
FailIndex = 0;
|
|
|
|
break;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:31:15 +00:00
|
|
|
FailIndex = MatcherIndex+NumToSkip;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-27 18:54:50 +00:00
|
|
|
unsigned MatcherIndexOfPredicate = MatcherIndex;
|
|
|
|
(void)MatcherIndexOfPredicate; // silence warning.
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:31:15 +00:00
|
|
|
// If we can't evaluate this predicate without pushing a scope (e.g. if
|
|
|
|
// it is a 'MoveParent') or if the predicate succeeds on this node, we
|
|
|
|
// push the scope and evaluate the full predicate chain.
|
|
|
|
bool Result;
|
|
|
|
MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N,
|
2010-03-03 07:46:25 +00:00
|
|
|
Result, *this, RecordedNodes);
|
2010-03-03 07:31:15 +00:00
|
|
|
if (!Result)
|
|
|
|
break;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-27 18:54:50 +00:00
|
|
|
DEBUG(errs() << " Skipped scope entry (due to false predicate) at "
|
|
|
|
<< "index " << MatcherIndexOfPredicate
|
|
|
|
<< ", continuing at " << FailIndex << "\n");
|
2010-03-28 19:46:56 +00:00
|
|
|
++NumDAGIselRetries;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:31:15 +00:00
|
|
|
// Otherwise, we know that this case of the Scope is guaranteed to fail,
|
|
|
|
// move to the next case.
|
|
|
|
MatcherIndex = FailIndex;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:31:15 +00:00
|
|
|
// If the whole scope failed to match, bail.
|
|
|
|
if (FailIndex == 0) break;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// Push a MatchScope which indicates where to go if the first child fails
|
|
|
|
// to match.
|
|
|
|
MatchScope NewEntry;
|
2010-03-03 07:31:15 +00:00
|
|
|
NewEntry.FailIndex = FailIndex;
|
2010-02-28 22:37:22 +00:00
|
|
|
NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());
|
|
|
|
NewEntry.NumRecordedNodes = RecordedNodes.size();
|
|
|
|
NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
|
|
|
|
NewEntry.InputChain = InputChain;
|
2010-12-23 17:13:18 +00:00
|
|
|
NewEntry.InputGlue = InputGlue;
|
2010-02-28 22:37:22 +00:00
|
|
|
NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
|
2010-12-23 17:13:18 +00:00
|
|
|
NewEntry.HasGlueResultNodesMatched = !GlueResultNodesMatched.empty();
|
2010-02-28 22:37:22 +00:00
|
|
|
MatchScopes.push_back(NewEntry);
|
|
|
|
continue;
|
|
|
|
}
|
2010-09-21 22:00:25 +00:00
|
|
|
case OPC_RecordNode: {
|
2010-02-28 22:37:22 +00:00
|
|
|
// Remember this node, it may end up being an operand in the pattern.
|
2010-09-21 22:00:25 +00:00
|
|
|
SDNode *Parent = 0;
|
|
|
|
if (NodeStack.size() > 1)
|
|
|
|
Parent = NodeStack[NodeStack.size()-2].getNode();
|
|
|
|
RecordedNodes.push_back(std::make_pair(N, Parent));
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
2010-09-21 22:00:25 +00:00
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_RecordChild0: case OPC_RecordChild1:
|
|
|
|
case OPC_RecordChild2: case OPC_RecordChild3:
|
|
|
|
case OPC_RecordChild4: case OPC_RecordChild5:
|
|
|
|
case OPC_RecordChild6: case OPC_RecordChild7: {
|
|
|
|
unsigned ChildNo = Opcode-OPC_RecordChild0;
|
|
|
|
if (ChildNo >= N.getNumOperands())
|
|
|
|
break; // Match fails if out of range child #.
|
|
|
|
|
2010-09-21 22:00:25 +00:00
|
|
|
RecordedNodes.push_back(std::make_pair(N->getOperand(ChildNo),
|
|
|
|
N.getNode()));
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
case OPC_RecordMemRef:
|
|
|
|
MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand());
|
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-23 17:24:32 +00:00
|
|
|
case OPC_CaptureGlueInput:
|
2010-12-23 17:13:18 +00:00
|
|
|
// If the current node has an input glue, capture it in InputGlue.
|
2010-02-28 22:37:22 +00:00
|
|
|
if (N->getNumOperands() != 0 &&
|
2010-12-21 02:38:05 +00:00
|
|
|
N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Glue)
|
2010-12-23 17:13:18 +00:00
|
|
|
InputGlue = N->getOperand(N->getNumOperands()-1);
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_MoveChild: {
|
|
|
|
unsigned ChildNo = MatcherTable[MatcherIndex++];
|
|
|
|
if (ChildNo >= N.getNumOperands())
|
|
|
|
break; // Match fails if out of range child #.
|
|
|
|
N = N.getOperand(ChildNo);
|
|
|
|
NodeStack.push_back(N);
|
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_MoveParent:
|
|
|
|
// Pop the current node off the NodeStack.
|
|
|
|
NodeStack.pop_back();
|
|
|
|
assert(!NodeStack.empty() && "Node stack imbalance!");
|
2010-12-24 04:28:06 +00:00
|
|
|
N = NodeStack.back();
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:46:25 +00:00
|
|
|
case OPC_CheckSame:
|
|
|
|
if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break;
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
|
|
|
case OPC_CheckPatternPredicate:
|
2010-03-03 07:31:15 +00:00
|
|
|
if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break;
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
|
|
|
case OPC_CheckPredicate:
|
2010-03-03 07:31:15 +00:00
|
|
|
if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this,
|
|
|
|
N.getNode()))
|
|
|
|
break;
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
2010-03-04 01:23:08 +00:00
|
|
|
case OPC_CheckComplexPat: {
|
|
|
|
unsigned CPNum = MatcherTable[MatcherIndex++];
|
|
|
|
unsigned RecNo = MatcherTable[MatcherIndex++];
|
|
|
|
assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat");
|
2010-09-21 22:00:25 +00:00
|
|
|
if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo].second,
|
|
|
|
RecordedNodes[RecNo].first, CPNum,
|
2010-03-04 01:23:08 +00:00
|
|
|
RecordedNodes))
|
2010-02-28 22:37:22 +00:00
|
|
|
break;
|
|
|
|
continue;
|
2010-03-04 01:23:08 +00:00
|
|
|
}
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_CheckOpcode:
|
2010-03-03 07:31:15 +00:00
|
|
|
if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break;
|
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 07:31:15 +00:00
|
|
|
case OPC_CheckType:
|
|
|
|
if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break;
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-01 06:59:22 +00:00
|
|
|
case OPC_SwitchOpcode: {
|
|
|
|
unsigned CurNodeOpcode = N.getOpcode();
|
2010-03-01 07:43:08 +00:00
|
|
|
unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
|
2010-03-01 06:59:22 +00:00
|
|
|
unsigned CaseSize;
|
|
|
|
while (1) {
|
|
|
|
// Get the size of this case.
|
|
|
|
CaseSize = MatcherTable[MatcherIndex++];
|
|
|
|
if (CaseSize & 128)
|
|
|
|
CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
|
|
|
|
if (CaseSize == 0) break;
|
|
|
|
|
2010-03-25 06:33:05 +00:00
|
|
|
uint16_t Opc = MatcherTable[MatcherIndex++];
|
|
|
|
Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
|
|
|
|
|
2010-03-01 06:59:22 +00:00
|
|
|
// If the opcode matches, then we will execute this case.
|
2010-03-25 06:33:05 +00:00
|
|
|
if (CurNodeOpcode == Opc)
|
2010-03-01 06:59:22 +00:00
|
|
|
break;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-01 06:59:22 +00:00
|
|
|
// Otherwise, skip over this case.
|
|
|
|
MatcherIndex += CaseSize;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 06:28:15 +00:00
|
|
|
// If no cases matched, bail out.
|
2010-03-01 06:59:22 +00:00
|
|
|
if (CaseSize == 0) break;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-01 06:59:22 +00:00
|
|
|
// Otherwise, execute the case we found.
|
|
|
|
DEBUG(errs() << " OpcodeSwitch from " << SwitchStart
|
|
|
|
<< " to " << MatcherIndex << "\n");
|
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 06:28:15 +00:00
|
|
|
case OPC_SwitchType: {
|
2010-11-03 12:17:33 +00:00
|
|
|
MVT CurNodeVT = N.getValueType().getSimpleVT();
|
2010-03-03 06:28:15 +00:00
|
|
|
unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
|
|
|
|
unsigned CaseSize;
|
|
|
|
while (1) {
|
|
|
|
// Get the size of this case.
|
|
|
|
CaseSize = MatcherTable[MatcherIndex++];
|
|
|
|
if (CaseSize & 128)
|
|
|
|
CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
|
|
|
|
if (CaseSize == 0) break;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-11-03 12:17:33 +00:00
|
|
|
MVT CaseVT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
|
2010-03-03 06:28:15 +00:00
|
|
|
if (CaseVT == MVT::iPTR)
|
2010-11-03 12:17:33 +00:00
|
|
|
CaseVT = TLI.getPointerTy();
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 06:28:15 +00:00
|
|
|
// If the VT matches, then we will execute this case.
|
|
|
|
if (CurNodeVT == CaseVT)
|
|
|
|
break;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 06:28:15 +00:00
|
|
|
// Otherwise, skip over this case.
|
|
|
|
MatcherIndex += CaseSize;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 06:28:15 +00:00
|
|
|
// If no cases matched, bail out.
|
|
|
|
if (CaseSize == 0) break;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-03 06:28:15 +00:00
|
|
|
// Otherwise, execute the case we found.
|
|
|
|
DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString()
|
|
|
|
<< "] from " << SwitchStart << " to " << MatcherIndex<<'\n');
|
|
|
|
continue;
|
|
|
|
}
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_CheckChild0Type: case OPC_CheckChild1Type:
|
|
|
|
case OPC_CheckChild2Type: case OPC_CheckChild3Type:
|
|
|
|
case OPC_CheckChild4Type: case OPC_CheckChild5Type:
|
2010-03-03 07:46:25 +00:00
|
|
|
case OPC_CheckChild6Type: case OPC_CheckChild7Type:
|
|
|
|
if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI,
|
|
|
|
Opcode-OPC_CheckChild0Type))
|
2010-03-03 07:31:15 +00:00
|
|
|
break;
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
|
|
|
case OPC_CheckCondCode:
|
2010-03-03 07:46:25 +00:00
|
|
|
if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break;
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
2010-03-03 07:46:25 +00:00
|
|
|
case OPC_CheckValueType:
|
|
|
|
if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break;
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
2010-03-03 07:31:15 +00:00
|
|
|
case OPC_CheckInteger:
|
|
|
|
if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break;
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
2010-03-03 07:46:25 +00:00
|
|
|
case OPC_CheckAndImm:
|
|
|
|
if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break;
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
2010-03-03 07:46:25 +00:00
|
|
|
case OPC_CheckOrImm:
|
|
|
|
if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break;
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_CheckFoldableChainNode: {
|
|
|
|
assert(NodeStack.size() != 1 && "No parent node");
|
|
|
|
// Verify that all intermediate nodes between the root and this one have
|
|
|
|
// a single use.
|
|
|
|
bool HasMultipleUses = false;
|
|
|
|
for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)
|
|
|
|
if (!NodeStack[i].hasOneUse()) {
|
|
|
|
HasMultipleUses = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (HasMultipleUses) break;
|
|
|
|
|
|
|
|
// Check to see that the target thinks this is profitable to fold and that
|
|
|
|
// we can fold it without inducing cycles in the graph.
|
|
|
|
if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
|
|
|
|
NodeToMatch) ||
|
|
|
|
!IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
|
2010-04-17 15:26:15 +00:00
|
|
|
NodeToMatch, OptLevel,
|
|
|
|
true/*We validate our own chains*/))
|
2010-02-28 22:37:22 +00:00
|
|
|
break;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
case OPC_EmitInteger: {
|
|
|
|
MVT::SimpleValueType VT =
|
|
|
|
(MVT::SimpleValueType)MatcherTable[MatcherIndex++];
|
|
|
|
int64_t Val = MatcherTable[MatcherIndex++];
|
|
|
|
if (Val & 128)
|
|
|
|
Val = GetVBR(Val, MatcherTable, MatcherIndex);
|
2010-09-21 22:00:25 +00:00
|
|
|
RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
|
2010-09-23 16:59:36 +00:00
|
|
|
CurDAG->getTargetConstant(Val, VT), (SDNode*)0));
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
case OPC_EmitRegister: {
|
|
|
|
MVT::SimpleValueType VT =
|
|
|
|
(MVT::SimpleValueType)MatcherTable[MatcherIndex++];
|
|
|
|
unsigned RegNo = MatcherTable[MatcherIndex++];
|
2010-09-21 22:00:25 +00:00
|
|
|
RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
|
2010-09-23 16:59:36 +00:00
|
|
|
CurDAG->getRegister(RegNo, VT), (SDNode*)0));
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
|
|
|
}
|
2011-03-01 01:37:19 +00:00
|
|
|
case OPC_EmitRegister2: {
|
|
|
|
// For targets w/ more than 256 register names, the register enum
|
|
|
|
// values are stored in two bytes in the matcher table (just like
|
|
|
|
// opcodes).
|
|
|
|
MVT::SimpleValueType VT =
|
|
|
|
(MVT::SimpleValueType)MatcherTable[MatcherIndex++];
|
|
|
|
unsigned RegNo = MatcherTable[MatcherIndex++];
|
|
|
|
RegNo |= MatcherTable[MatcherIndex++] << 8;
|
|
|
|
RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
|
|
|
|
CurDAG->getRegister(RegNo, VT), (SDNode*)0));
|
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_EmitConvertToTarget: {
|
|
|
|
// Convert from IMM/FPIMM to target version.
|
|
|
|
unsigned RecNo = MatcherTable[MatcherIndex++];
|
|
|
|
assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
|
2010-09-21 22:00:25 +00:00
|
|
|
SDValue Imm = RecordedNodes[RecNo].first;
|
2010-02-28 22:37:22 +00:00
|
|
|
|
|
|
|
if (Imm->getOpcode() == ISD::Constant) {
|
|
|
|
int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue();
|
|
|
|
Imm = CurDAG->getTargetConstant(Val, Imm.getValueType());
|
|
|
|
} else if (Imm->getOpcode() == ISD::ConstantFP) {
|
|
|
|
const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue();
|
|
|
|
Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType());
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-09-21 22:00:25 +00:00
|
|
|
RecordedNodes.push_back(std::make_pair(Imm, RecordedNodes[RecNo].second));
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-28 05:50:16 +00:00
|
|
|
case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0
|
|
|
|
case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1
|
|
|
|
// These are space-optimized forms of OPC_EmitMergeInputChains.
|
|
|
|
assert(InputChain.getNode() == 0 &&
|
|
|
|
"EmitMergeInputChains should be the first chain producing node");
|
|
|
|
assert(ChainNodesMatched.empty() &&
|
|
|
|
"Should only have one EmitMergeInputChains per match");
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-28 05:50:16 +00:00
|
|
|
// Read all of the chained nodes.
|
|
|
|
unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1;
|
|
|
|
assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
|
2010-09-21 22:00:25 +00:00
|
|
|
ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-28 05:50:16 +00:00
|
|
|
// FIXME: What if other value results of the node have uses not matched
|
|
|
|
// by this pattern?
|
|
|
|
if (ChainNodesMatched.back() != NodeToMatch &&
|
2010-09-21 22:00:25 +00:00
|
|
|
!RecordedNodes[RecNo].first.hasOneUse()) {
|
2010-03-28 05:50:16 +00:00
|
|
|
ChainNodesMatched.clear();
|
|
|
|
break;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-28 05:50:16 +00:00
|
|
|
// Merge the input chains if they are not intra-pattern references.
|
|
|
|
InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-28 05:50:16 +00:00
|
|
|
if (InputChain.getNode() == 0)
|
|
|
|
break; // Failed to merge.
|
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_EmitMergeInputChains: {
|
|
|
|
assert(InputChain.getNode() == 0 &&
|
|
|
|
"EmitMergeInputChains should be the first chain producing node");
|
|
|
|
// This node gets a list of nodes we matched in the input that have
|
|
|
|
// chains. We want to token factor all of the input chains to these nodes
|
|
|
|
// together. However, if any of the input chains is actually one of the
|
|
|
|
// nodes matched in this pattern, then we have an intra-match reference.
|
|
|
|
// Ignore these because the newly token factored chain should not refer to
|
|
|
|
// the old nodes.
|
|
|
|
unsigned NumChains = MatcherTable[MatcherIndex++];
|
|
|
|
assert(NumChains != 0 && "Can't TF zero chains");
|
|
|
|
|
|
|
|
assert(ChainNodesMatched.empty() &&
|
|
|
|
"Should only have one EmitMergeInputChains per match");
|
|
|
|
|
|
|
|
// Read all of the chained nodes.
|
2010-03-02 19:34:59 +00:00
|
|
|
for (unsigned i = 0; i != NumChains; ++i) {
|
|
|
|
unsigned RecNo = MatcherTable[MatcherIndex++];
|
2010-02-28 22:37:22 +00:00
|
|
|
assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
|
2010-09-21 22:00:25 +00:00
|
|
|
ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// FIXME: What if other value results of the node have uses not matched
|
|
|
|
// by this pattern?
|
|
|
|
if (ChainNodesMatched.back() != NodeToMatch &&
|
2010-09-21 22:00:25 +00:00
|
|
|
!RecordedNodes[RecNo].first.hasOneUse()) {
|
2010-02-28 22:37:22 +00:00
|
|
|
ChainNodesMatched.clear();
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 00:00:03 +00:00
|
|
|
// If the inner loop broke out, the match fails.
|
|
|
|
if (ChainNodesMatched.empty())
|
|
|
|
break;
|
2010-02-28 22:37:22 +00:00
|
|
|
|
2010-03-02 00:00:03 +00:00
|
|
|
// Merge the input chains if they are not intra-pattern references.
|
|
|
|
InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-02 00:00:03 +00:00
|
|
|
if (InputChain.getNode() == 0)
|
|
|
|
break; // Failed to merge.
|
2010-02-28 22:37:22 +00:00
|
|
|
|
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_EmitCopyToReg: {
|
|
|
|
unsigned RecNo = MatcherTable[MatcherIndex++];
|
|
|
|
assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
|
|
|
|
unsigned DestPhysReg = MatcherTable[MatcherIndex++];
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
if (InputChain.getNode() == 0)
|
|
|
|
InputChain = CurDAG->getEntryNode();
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(),
|
2010-09-21 22:00:25 +00:00
|
|
|
DestPhysReg, RecordedNodes[RecNo].first,
|
2010-12-23 17:13:18 +00:00
|
|
|
InputGlue);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
InputGlue = InputChain.getValue(1);
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_EmitNodeXForm: {
|
|
|
|
unsigned XFormNo = MatcherTable[MatcherIndex++];
|
|
|
|
unsigned RecNo = MatcherTable[MatcherIndex++];
|
|
|
|
assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
|
2010-09-21 22:00:25 +00:00
|
|
|
SDValue Res = RunSDNodeXForm(RecordedNodes[RecNo].first, XFormNo);
|
2010-09-23 16:59:36 +00:00
|
|
|
RecordedNodes.push_back(std::pair<SDValue,SDNode*>(Res, (SDNode*) 0));
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_EmitNode:
|
|
|
|
case OPC_MorphNodeTo: {
|
2010-02-28 22:38:43 +00:00
|
|
|
uint16_t TargetOpc = MatcherTable[MatcherIndex++];
|
|
|
|
TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
|
2010-02-28 22:37:22 +00:00
|
|
|
unsigned EmitNodeInfo = MatcherTable[MatcherIndex++];
|
|
|
|
// Get the result VT list.
|
|
|
|
unsigned NumVTs = MatcherTable[MatcherIndex++];
|
|
|
|
SmallVector<EVT, 4> VTs;
|
|
|
|
for (unsigned i = 0; i != NumVTs; ++i) {
|
|
|
|
MVT::SimpleValueType VT =
|
|
|
|
(MVT::SimpleValueType)MatcherTable[MatcherIndex++];
|
|
|
|
if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy;
|
|
|
|
VTs.push_back(VT);
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
if (EmitNodeInfo & OPFL_Chain)
|
|
|
|
VTs.push_back(MVT::Other);
|
2010-12-23 17:13:18 +00:00
|
|
|
if (EmitNodeInfo & OPFL_GlueOutput)
|
2010-12-21 02:38:05 +00:00
|
|
|
VTs.push_back(MVT::Glue);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-01 07:43:08 +00:00
|
|
|
// This is hot code, so optimize the two most common cases of 1 and 2
|
|
|
|
// results.
|
|
|
|
SDVTList VTList;
|
|
|
|
if (VTs.size() == 1)
|
|
|
|
VTList = CurDAG->getVTList(VTs[0]);
|
|
|
|
else if (VTs.size() == 2)
|
|
|
|
VTList = CurDAG->getVTList(VTs[0], VTs[1]);
|
|
|
|
else
|
|
|
|
VTList = CurDAG->getVTList(VTs.data(), VTs.size());
|
2010-02-28 22:37:22 +00:00
|
|
|
|
|
|
|
// Get the operand list.
|
|
|
|
unsigned NumOps = MatcherTable[MatcherIndex++];
|
|
|
|
SmallVector<SDValue, 8> Ops;
|
|
|
|
for (unsigned i = 0; i != NumOps; ++i) {
|
|
|
|
unsigned RecNo = MatcherTable[MatcherIndex++];
|
|
|
|
if (RecNo & 128)
|
|
|
|
RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
assert(RecNo < RecordedNodes.size() && "Invalid EmitNode");
|
2010-09-21 22:00:25 +00:00
|
|
|
Ops.push_back(RecordedNodes[RecNo].first);
|
2010-02-28 22:37:22 +00:00
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// If there are variadic operands to add, handle them now.
|
|
|
|
if (EmitNodeInfo & OPFL_VariadicInfo) {
|
|
|
|
// Determine the start index to copy from.
|
|
|
|
unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo);
|
|
|
|
FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0;
|
|
|
|
assert(NodeToMatch->getNumOperands() >= FirstOpToCopy &&
|
|
|
|
"Invalid variadic node");
|
2010-12-23 17:13:18 +00:00
|
|
|
// Copy all of the variadic operands, not including a potential glue
|
2010-02-28 22:37:22 +00:00
|
|
|
// input.
|
|
|
|
for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands();
|
|
|
|
i != e; ++i) {
|
|
|
|
SDValue V = NodeToMatch->getOperand(i);
|
2010-12-21 02:38:05 +00:00
|
|
|
if (V.getValueType() == MVT::Glue) break;
|
2010-02-28 22:37:22 +00:00
|
|
|
Ops.push_back(V);
|
|
|
|
}
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
// If this has chain/glue inputs, add them.
|
2010-02-28 22:37:22 +00:00
|
|
|
if (EmitNodeInfo & OPFL_Chain)
|
|
|
|
Ops.push_back(InputChain);
|
2010-12-23 17:13:18 +00:00
|
|
|
if ((EmitNodeInfo & OPFL_GlueInput) && InputGlue.getNode() != 0)
|
|
|
|
Ops.push_back(InputGlue);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// Create the node.
|
|
|
|
SDNode *Res = 0;
|
|
|
|
if (Opcode != OPC_MorphNodeTo) {
|
|
|
|
// If this is a normal EmitNode command, just create the new node and
|
|
|
|
// add the results to the RecordedNodes list.
|
|
|
|
Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(),
|
|
|
|
VTList, Ops.data(), Ops.size());
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
// Add all the non-glue/non-chain results to the RecordedNodes list.
|
2010-02-28 22:37:22 +00:00
|
|
|
for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
|
2010-12-21 02:38:05 +00:00
|
|
|
if (VTs[i] == MVT::Other || VTs[i] == MVT::Glue) break;
|
2010-09-21 22:00:25 +00:00
|
|
|
RecordedNodes.push_back(std::pair<SDValue,SDNode*>(SDValue(Res, i),
|
2010-09-23 16:59:36 +00:00
|
|
|
(SDNode*) 0));
|
2010-02-28 22:37:22 +00:00
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
} else {
|
2010-03-02 06:55:04 +00:00
|
|
|
Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(),
|
|
|
|
EmitNodeInfo);
|
2010-02-28 22:37:22 +00:00
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
// If the node had chain/glue results, update our notion of the current
|
|
|
|
// chain and glue.
|
|
|
|
if (EmitNodeInfo & OPFL_GlueOutput) {
|
|
|
|
InputGlue = SDValue(Res, VTs.size()-1);
|
2010-02-28 22:37:22 +00:00
|
|
|
if (EmitNodeInfo & OPFL_Chain)
|
|
|
|
InputChain = SDValue(Res, VTs.size()-2);
|
|
|
|
} else if (EmitNodeInfo & OPFL_Chain)
|
|
|
|
InputChain = SDValue(Res, VTs.size()-1);
|
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
// If the OPFL_MemRefs glue is set on this node, slap all of the
|
2010-02-28 22:37:22 +00:00
|
|
|
// accumulated memrefs onto it.
|
|
|
|
//
|
|
|
|
// FIXME: This is vastly incorrect for patterns with multiple outputs
|
|
|
|
// instructions that access memory and for ComplexPatterns that match
|
|
|
|
// loads.
|
|
|
|
if (EmitNodeInfo & OPFL_MemRefs) {
|
2011-05-19 23:44:34 +00:00
|
|
|
// Only attach load or store memory operands if the generated
|
|
|
|
// instruction may load or store.
|
2011-06-28 19:10:37 +00:00
|
|
|
const MCInstrDesc &MCID = TM.getInstrInfo()->get(TargetOpc);
|
|
|
|
bool mayLoad = MCID.mayLoad();
|
|
|
|
bool mayStore = MCID.mayStore();
|
2011-05-19 23:44:34 +00:00
|
|
|
|
|
|
|
unsigned NumMemRefs = 0;
|
|
|
|
for (SmallVector<MachineMemOperand*, 2>::const_iterator I =
|
|
|
|
MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
|
|
|
|
if ((*I)->isLoad()) {
|
|
|
|
if (mayLoad)
|
|
|
|
++NumMemRefs;
|
|
|
|
} else if ((*I)->isStore()) {
|
|
|
|
if (mayStore)
|
|
|
|
++NumMemRefs;
|
|
|
|
} else {
|
|
|
|
++NumMemRefs;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
MachineSDNode::mmo_iterator MemRefs =
|
2011-05-19 23:44:34 +00:00
|
|
|
MF->allocateMemRefsArray(NumMemRefs);
|
|
|
|
|
|
|
|
MachineSDNode::mmo_iterator MemRefsPos = MemRefs;
|
|
|
|
for (SmallVector<MachineMemOperand*, 2>::const_iterator I =
|
|
|
|
MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
|
|
|
|
if ((*I)->isLoad()) {
|
|
|
|
if (mayLoad)
|
|
|
|
*MemRefsPos++ = *I;
|
|
|
|
} else if ((*I)->isStore()) {
|
|
|
|
if (mayStore)
|
|
|
|
*MemRefsPos++ = *I;
|
|
|
|
} else {
|
|
|
|
*MemRefsPos++ = *I;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
cast<MachineSDNode>(Res)
|
2011-05-19 23:44:34 +00:00
|
|
|
->setMemRefs(MemRefs, MemRefs + NumMemRefs);
|
2010-02-28 22:37:22 +00:00
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
DEBUG(errs() << " "
|
|
|
|
<< (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created")
|
|
|
|
<< " node: "; Res->dump(CurDAG); errs() << "\n");
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// If this was a MorphNodeTo then we're completely done!
|
|
|
|
if (Opcode == OPC_MorphNodeTo) {
|
2010-12-23 17:13:18 +00:00
|
|
|
// Update chain and glue uses.
|
|
|
|
UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
|
|
|
|
InputGlue, GlueResultNodesMatched, true);
|
2010-03-02 07:50:03 +00:00
|
|
|
return Res;
|
2010-02-28 22:37:22 +00:00
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-23 17:24:32 +00:00
|
|
|
case OPC_MarkGlueResults: {
|
2010-02-28 22:37:22 +00:00
|
|
|
unsigned NumNodes = MatcherTable[MatcherIndex++];
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
// Read and remember all the glue-result nodes.
|
2010-02-28 22:37:22 +00:00
|
|
|
for (unsigned i = 0; i != NumNodes; ++i) {
|
|
|
|
unsigned RecNo = MatcherTable[MatcherIndex++];
|
|
|
|
if (RecNo & 128)
|
|
|
|
RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
|
|
|
|
|
|
|
|
assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
|
2010-12-23 17:13:18 +00:00
|
|
|
GlueResultNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
|
2010-02-28 22:37:22 +00:00
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
case OPC_CompleteMatch: {
|
|
|
|
// The match has been completed, and any new nodes (if any) have been
|
|
|
|
// created. Patch up references to the matched dag to use the newly
|
|
|
|
// created nodes.
|
|
|
|
unsigned NumResults = MatcherTable[MatcherIndex++];
|
|
|
|
|
|
|
|
for (unsigned i = 0; i != NumResults; ++i) {
|
|
|
|
unsigned ResSlot = MatcherTable[MatcherIndex++];
|
|
|
|
if (ResSlot & 128)
|
|
|
|
ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame");
|
2010-09-21 22:00:25 +00:00
|
|
|
SDValue Res = RecordedNodes[ResSlot].first;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-28 05:54:03 +00:00
|
|
|
assert(i < NodeToMatch->getNumValues() &&
|
|
|
|
NodeToMatch->getValueType(i) != MVT::Other &&
|
2010-12-21 02:38:05 +00:00
|
|
|
NodeToMatch->getValueType(i) != MVT::Glue &&
|
2010-03-28 05:54:03 +00:00
|
|
|
"Invalid number of results to complete!");
|
2010-02-28 22:37:22 +00:00
|
|
|
assert((NodeToMatch->getValueType(i) == Res.getValueType() ||
|
|
|
|
NodeToMatch->getValueType(i) == MVT::iPTR ||
|
|
|
|
Res.getValueType() == MVT::iPTR ||
|
|
|
|
NodeToMatch->getValueType(i).getSizeInBits() ==
|
|
|
|
Res.getValueType().getSizeInBits()) &&
|
|
|
|
"invalid replacement");
|
|
|
|
CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res);
|
|
|
|
}
|
|
|
|
|
2010-12-23 17:24:32 +00:00
|
|
|
// If the root node defines glue, add it to the glue nodes to update list.
|
2010-12-21 02:38:05 +00:00
|
|
|
if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Glue)
|
2010-12-23 17:13:18 +00:00
|
|
|
GlueResultNodesMatched.push_back(NodeToMatch);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-12-23 17:13:18 +00:00
|
|
|
// Update chain and glue uses.
|
|
|
|
UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
|
|
|
|
InputGlue, GlueResultNodesMatched, false);
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
assert(NodeToMatch->use_empty() &&
|
|
|
|
"Didn't replace all uses of the node?");
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// FIXME: We just return here, which interacts correctly with SelectRoot
|
|
|
|
// above. We should fix this to not return an SDNode* anymore.
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// If the code reached this point, then the match failed. See if there is
|
|
|
|
// another child to try in the current 'Scope', otherwise pop it until we
|
|
|
|
// find a case to check.
|
2010-03-09 02:15:05 +00:00
|
|
|
DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n");
|
2010-03-28 19:46:56 +00:00
|
|
|
++NumDAGIselRetries;
|
2010-02-28 22:37:22 +00:00
|
|
|
while (1) {
|
|
|
|
if (MatchScopes.empty()) {
|
|
|
|
CannotYetSelect(NodeToMatch);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Restore the interpreter state back to the point where the scope was
|
|
|
|
// formed.
|
|
|
|
MatchScope &LastScope = MatchScopes.back();
|
|
|
|
RecordedNodes.resize(LastScope.NumRecordedNodes);
|
|
|
|
NodeStack.clear();
|
|
|
|
NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());
|
|
|
|
N = NodeStack.back();
|
|
|
|
|
|
|
|
if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size())
|
|
|
|
MatchedMemRefs.resize(LastScope.NumMatchedMemRefs);
|
|
|
|
MatcherIndex = LastScope.FailIndex;
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-09 02:15:05 +00:00
|
|
|
DEBUG(errs() << " Continuing at " << MatcherIndex << "\n");
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
InputChain = LastScope.InputChain;
|
2010-12-23 17:13:18 +00:00
|
|
|
InputGlue = LastScope.InputGlue;
|
2010-02-28 22:37:22 +00:00
|
|
|
if (!LastScope.HasChainNodesMatched)
|
|
|
|
ChainNodesMatched.clear();
|
2010-12-23 17:13:18 +00:00
|
|
|
if (!LastScope.HasGlueResultNodesMatched)
|
|
|
|
GlueResultNodesMatched.clear();
|
2010-02-28 22:37:22 +00:00
|
|
|
|
|
|
|
// Check to see what the offset is at the new MatcherIndex. If it is zero
|
|
|
|
// we have reached the end of this scope, otherwise we have another child
|
|
|
|
// in the current scope to try.
|
|
|
|
unsigned NumToSkip = MatcherTable[MatcherIndex++];
|
|
|
|
if (NumToSkip & 128)
|
|
|
|
NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
|
|
|
|
|
|
|
|
// If we have another child in this scope to match, update FailIndex and
|
|
|
|
// try it.
|
|
|
|
if (NumToSkip != 0) {
|
|
|
|
LastScope.FailIndex = MatcherIndex+NumToSkip;
|
|
|
|
break;
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
// End of this scope, pop it and try the next child in the containing
|
|
|
|
// scope.
|
|
|
|
MatchScopes.pop_back();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-02-28 22:37:22 +00:00
|
|
|
|
|
|
|
|
2010-01-05 01:24:18 +00:00
|
|
|
void SelectionDAGISel::CannotYetSelect(SDNode *N) {
|
2009-10-29 22:30:23 +00:00
|
|
|
std::string msg;
|
|
|
|
raw_string_ostream Msg(msg);
|
2010-12-21 02:07:03 +00:00
|
|
|
Msg << "Cannot select: ";
|
2010-12-24 04:28:06 +00:00
|
|
|
|
2010-03-04 00:21:16 +00:00
|
|
|
if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN &&
|
|
|
|
N->getOpcode() != ISD::INTRINSIC_WO_CHAIN &&
|
|
|
|
N->getOpcode() != ISD::INTRINSIC_VOID) {
|
|
|
|
N->printrFull(Msg, CurDAG);
|
|
|
|
} else {
|
|
|
|
bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other;
|
|
|
|
unsigned iid =
|
|
|
|
cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue();
|
|
|
|
if (iid < Intrinsic::num_intrinsics)
|
|
|
|
Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid);
|
|
|
|
else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo())
|
|
|
|
Msg << "target intrinsic %" << TII->getName(iid);
|
|
|
|
else
|
|
|
|
Msg << "unknown intrinsic #" << iid;
|
|
|
|
}
|
2010-04-07 22:58:41 +00:00
|
|
|
report_fatal_error(Msg.str());
|
2009-10-29 22:30:23 +00:00
|
|
|
}
|
|
|
|
|
2007-05-03 01:11:54 +00:00
|
|
|
char SelectionDAGISel::ID = 0;
|