blob: ec8f014f651c9bd00e774fe7df1073dcb9a5c49b [file] [log] [blame]
Chris Lattner1c08c712005-01-07 07:47:53 +00001//===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===//
Misha Brukmanedf128a2005-04-21 22:36:52 +00002//
Chris Lattner1c08c712005-01-07 07:47:53 +00003// The LLVM Compiler Infrastructure
4//
Chris Lattner4ee451d2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Misha Brukmanedf128a2005-04-21 22:36:52 +00007//
Chris Lattner1c08c712005-01-07 07:47:53 +00008//===----------------------------------------------------------------------===//
9//
10// This implements the SelectionDAGISel class.
11//
12//===----------------------------------------------------------------------===//
13
14#define DEBUG_TYPE "isel"
Dan Gohman84fbac52009-02-06 17:22:58 +000015#include "ScheduleDAGSDNodes.h"
Dan Gohman2048b852009-11-23 18:04:58 +000016#include "SelectionDAGBuilder.h"
Dan Gohman4c3fd9f2010-07-07 16:01:37 +000017#include "llvm/CodeGen/FunctionLoweringInfo.h"
Dan Gohman84fbac52009-02-06 17:22:58 +000018#include "llvm/CodeGen/SelectionDAGISel.h"
Jim Laskeyc7c3f112006-10-16 20:52:31 +000019#include "llvm/Analysis/AliasAnalysis.h"
Jakub Staszak7cc2b072011-06-16 20:22:37 +000020#include "llvm/Analysis/BranchProbabilityInfo.h"
Devang Patel713f0432009-09-16 21:09:07 +000021#include "llvm/Analysis/DebugInfo.h"
Anton Korobeynikov5502bf62007-04-04 21:14:49 +000022#include "llvm/Constants.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000023#include "llvm/Function.h"
Chris Lattnerce7518c2006-01-26 22:24:51 +000024#include "llvm/InlineAsm.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000025#include "llvm/Instructions.h"
26#include "llvm/Intrinsics.h"
Jim Laskey43970fe2006-03-23 18:06:46 +000027#include "llvm/IntrinsicInst.h"
Chris Lattner75c478a2009-10-27 17:02:08 +000028#include "llvm/LLVMContext.h"
Bill Wendling9af7e9a2010-05-26 19:46:12 +000029#include "llvm/Module.h"
Dan Gohman78eca172008-08-19 22:33:34 +000030#include "llvm/CodeGen/FastISel.h"
Gordon Henriksen5a29c9e2008-08-17 12:56:54 +000031#include "llvm/CodeGen/GCStrategy.h"
Gordon Henriksen5eca0752008-08-17 18:44:35 +000032#include "llvm/CodeGen/GCMetadata.h"
Bill Wendlingb92187a2010-05-14 21:14:32 +000033#include "llvm/CodeGen/MachineFrameInfo.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000034#include "llvm/CodeGen/MachineFunction.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000035#include "llvm/CodeGen/MachineInstrBuilder.h"
Chris Lattner84bc5422007-12-31 04:13:23 +000036#include "llvm/CodeGen/MachineModuleInfo.h"
37#include "llvm/CodeGen/MachineRegisterInfo.h"
Dan Gohmanfc54c552009-01-15 22:18:12 +000038#include "llvm/CodeGen/ScheduleHazardRecognizer.h"
Jim Laskeyeb577ba2006-08-02 12:30:23 +000039#include "llvm/CodeGen/SchedulerRegistry.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000040#include "llvm/CodeGen/SelectionDAG.h"
Dan Gohman6f0d0242008-02-10 18:45:23 +000041#include "llvm/Target/TargetRegisterInfo.h"
Dan Gohmane1f188f2009-10-29 22:30:23 +000042#include "llvm/Target/TargetIntrinsicInfo.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000043#include "llvm/Target/TargetInstrInfo.h"
44#include "llvm/Target/TargetLowering.h"
45#include "llvm/Target/TargetMachine.h"
Vladimir Prus12472912006-05-23 13:43:15 +000046#include "llvm/Target/TargetOptions.h"
Chris Lattner96ba57f2010-12-19 04:58:57 +000047#include "llvm/Transforms/Utils/BasicBlockUtils.h"
Chris Lattnera4f0b3a2006-08-27 12:54:02 +000048#include "llvm/Support/Compiler.h"
Evan Chengdb8d56b2008-06-30 20:45:06 +000049#include "llvm/Support/Debug.h"
Torok Edwin7d696d82009-07-11 13:10:19 +000050#include "llvm/Support/ErrorHandling.h"
Evan Chengdb8d56b2008-06-30 20:45:06 +000051#include "llvm/Support/Timer.h"
Daniel Dunbarce63ffb2009-07-25 00:23:56 +000052#include "llvm/Support/raw_ostream.h"
Cameron Zwarich2dbe2852011-02-24 10:00:04 +000053#include "llvm/ADT/PostOrderIterator.h"
Chris Lattnerc19ae9d2010-03-04 19:46:56 +000054#include "llvm/ADT/Statistic.h"
Jeff Cohen7e881032006-02-24 02:52:40 +000055#include <algorithm>
Chris Lattner1c08c712005-01-07 07:47:53 +000056using namespace llvm;
57
Chris Lattnerc19ae9d2010-03-04 19:46:56 +000058STATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on");
Jim Grosbach62427ae2011-05-16 21:51:07 +000059STATISTIC(NumFastIselSuccess, "Number of instructions fast isel selected");
Devang Patel948f7d02010-10-25 20:55:43 +000060STATISTIC(NumFastIselBlocks, "Number of blocks selected entirely by fast isel");
61STATISTIC(NumDAGBlocks, "Number of blocks selected using DAG");
Chris Lattnerbed993d2010-03-28 19:46:56 +000062STATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path");
Nick Lewyckya568d662010-10-26 00:51:57 +000063
Chris Lattneread0d882008-06-17 06:09:18 +000064static cl::opt<bool>
Dan Gohman293d5f82008-09-09 22:06:46 +000065EnableFastISelVerbose("fast-isel-verbose", cl::Hidden,
Dan Gohmand659d502008-10-20 21:30:12 +000066 cl::desc("Enable verbose messages in the \"fast\" "
Dan Gohman293d5f82008-09-09 22:06:46 +000067 "instruction selector"));
68static cl::opt<bool>
Dan Gohman4344a5d2008-09-09 23:05:00 +000069EnableFastISelAbort("fast-isel-abort", cl::Hidden,
70 cl::desc("Enable abort calls when \"fast\" instruction fails"));
Chris Lattneread0d882008-06-17 06:09:18 +000071
Jakub Staszak7cc2b072011-06-16 20:22:37 +000072static cl::opt<bool>
73UseMBPI("use-mbpi",
74 cl::desc("use Machine Branch Probability Info"),
75 cl::init(true), cl::Hidden);
76
Chris Lattnerda8abb02005-09-01 18:44:10 +000077#ifndef NDEBUG
Chris Lattner7944d9d2005-01-12 03:41:21 +000078static cl::opt<bool>
Dan Gohman462dc7f2008-07-21 20:00:07 +000079ViewDAGCombine1("view-dag-combine1-dags", cl::Hidden,
80 cl::desc("Pop up a window to show dags before the first "
81 "dag combine pass"));
82static cl::opt<bool>
83ViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden,
84 cl::desc("Pop up a window to show dags before legalize types"));
85static cl::opt<bool>
86ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
87 cl::desc("Pop up a window to show dags before legalize"));
88static cl::opt<bool>
89ViewDAGCombine2("view-dag-combine2-dags", cl::Hidden,
90 cl::desc("Pop up a window to show dags before the second "
91 "dag combine pass"));
92static cl::opt<bool>
Duncan Sands25cf2272008-11-24 14:53:14 +000093ViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden,
94 cl::desc("Pop up a window to show dags before the post legalize types"
95 " dag combine pass"));
96static cl::opt<bool>
Evan Chenga9c20912006-01-21 02:32:06 +000097ViewISelDAGs("view-isel-dags", cl::Hidden,
98 cl::desc("Pop up a window to show isel dags as they are selected"));
99static cl::opt<bool>
100ViewSchedDAGs("view-sched-dags", cl::Hidden,
101 cl::desc("Pop up a window to show sched dags as they are processed"));
Dan Gohman3e1a7ae2007-08-28 20:32:58 +0000102static cl::opt<bool>
103ViewSUnitDAGs("view-sunit-dags", cl::Hidden,
Chris Lattner5bab7852008-01-25 17:24:52 +0000104 cl::desc("Pop up a window to show SUnit dags after they are processed"));
Chris Lattner7944d9d2005-01-12 03:41:21 +0000105#else
Dan Gohman462dc7f2008-07-21 20:00:07 +0000106static const bool ViewDAGCombine1 = false,
107 ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false,
108 ViewDAGCombine2 = false,
Duncan Sands25cf2272008-11-24 14:53:14 +0000109 ViewDAGCombineLT = false,
Dan Gohman462dc7f2008-07-21 20:00:07 +0000110 ViewISelDAGs = false, ViewSchedDAGs = false,
111 ViewSUnitDAGs = false;
Chris Lattner7944d9d2005-01-12 03:41:21 +0000112#endif
113
Jim Laskeyeb577ba2006-08-02 12:30:23 +0000114//===---------------------------------------------------------------------===//
115///
116/// RegisterScheduler class - Track the registration of instruction schedulers.
117///
118//===---------------------------------------------------------------------===//
119MachinePassRegistry RegisterScheduler::Registry;
120
121//===---------------------------------------------------------------------===//
122///
123/// ISHeuristic command line option for instruction schedulers.
124///
125//===---------------------------------------------------------------------===//
Dan Gohman844731a2008-05-13 00:00:25 +0000126static cl::opt<RegisterScheduler::FunctionPassCtor, false,
127 RegisterPassParser<RegisterScheduler> >
128ISHeuristic("pre-RA-sched",
129 cl::init(&createDefaultScheduler),
130 cl::desc("Instruction schedulers available (before register"
131 " allocation):"));
Jim Laskey13ec7022006-08-01 14:21:23 +0000132
Dan Gohman844731a2008-05-13 00:00:25 +0000133static RegisterScheduler
Dan Gohmanb8cab922008-10-14 20:25:08 +0000134defaultListDAGScheduler("default", "Best scheduler for the target",
Dan Gohman844731a2008-05-13 00:00:25 +0000135 createDefaultScheduler);
Evan Cheng4ef10862006-01-23 07:01:07 +0000136
Chris Lattner1c08c712005-01-07 07:47:53 +0000137namespace llvm {
138 //===--------------------------------------------------------------------===//
Jim Laskey9373beb2006-08-01 19:14:14 +0000139 /// createDefaultScheduler - This creates an instruction scheduler appropriate
140 /// for the target.
Dan Gohman47ac0f02009-02-11 04:27:20 +0000141 ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS,
Bill Wendling98a366d2009-04-29 23:29:43 +0000142 CodeGenOpt::Level OptLevel) {
Dan Gohmane9530ec2009-01-15 16:58:17 +0000143 const TargetLowering &TLI = IS->getTargetLowering();
144
Bill Wendling98a366d2009-04-29 23:29:43 +0000145 if (OptLevel == CodeGenOpt::None)
Dan Gohmane667e012010-07-16 02:01:19 +0000146 return createSourceListDAGScheduler(IS, OptLevel);
Evan Cheng211ffa12010-05-19 20:19:50 +0000147 if (TLI.getSchedulingPreference() == Sched::Latency)
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +0000148 return createTDListDAGScheduler(IS, OptLevel);
Evan Cheng15a16de2010-05-20 06:13:19 +0000149 if (TLI.getSchedulingPreference() == Sched::RegPressure)
150 return createBURRListDAGScheduler(IS, OptLevel);
Evan Cheng70017e42010-07-24 00:39:05 +0000151 if (TLI.getSchedulingPreference() == Sched::Hybrid)
152 return createHybridListDAGScheduler(IS, OptLevel);
153 assert(TLI.getSchedulingPreference() == Sched::ILP &&
Evan Cheng211ffa12010-05-19 20:19:50 +0000154 "Unknown sched type!");
Evan Cheng70017e42010-07-24 00:39:05 +0000155 return createILPListDAGScheduler(IS, OptLevel);
Jim Laskey9373beb2006-08-01 19:14:14 +0000156 }
Chris Lattner1c08c712005-01-07 07:47:53 +0000157}
158
Evan Chengff9b3732008-01-30 18:18:23 +0000159// EmitInstrWithCustomInserter - This method should be implemented by targets
Dan Gohman533297b2009-10-29 18:10:34 +0000160// that mark instructions with the 'usesCustomInserter' flag. These
Chris Lattner025c39b2005-08-26 20:54:47 +0000161// instructions are special in various ways, which require special support to
162// insert. The specified MachineInstr is created but not inserted into any
Dan Gohman533297b2009-10-29 18:10:34 +0000163// basic blocks, and this method is called to expand it into a sequence of
164// instructions, potentially also creating new basic blocks and control flow.
165// When new basic blocks are inserted and the edges from MBB to its successors
166// are modified, the method should insert pairs of <OldSucc, NewSucc> into the
167// DenseMap.
Dan Gohmanaf1d8ca2010-05-01 00:01:06 +0000168MachineBasicBlock *
169TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
170 MachineBasicBlock *MBB) const {
Torok Edwinf3689232009-07-12 20:07:01 +0000171#ifndef NDEBUG
David Greene1a053232010-01-05 01:26:11 +0000172 dbgs() << "If a target marks an instruction with "
Dan Gohman533297b2009-10-29 18:10:34 +0000173 "'usesCustomInserter', it must implement "
Torok Edwinf3689232009-07-12 20:07:01 +0000174 "TargetLowering::EmitInstrWithCustomInserter!";
175#endif
Torok Edwinc23197a2009-07-14 16:55:14 +0000176 llvm_unreachable(0);
Daniel Dunbara279bc32009-09-20 02:20:51 +0000177 return 0;
Chris Lattner025c39b2005-08-26 20:54:47 +0000178}
179
Chris Lattner7041ee32005-01-11 05:56:49 +0000180//===----------------------------------------------------------------------===//
181// SelectionDAGISel code
182//===----------------------------------------------------------------------===//
Chris Lattner1c08c712005-01-07 07:47:53 +0000183
Eric Christopher762a17a2011-01-05 21:45:56 +0000184SelectionDAGISel::SelectionDAGISel(const TargetMachine &tm,
185 CodeGenOpt::Level OL) :
Owen Anderson90c579d2010-08-06 18:33:48 +0000186 MachineFunctionPass(ID), TM(tm), TLI(*tm.getTargetLowering()),
Dan Gohman7c3234c2008-08-27 23:52:12 +0000187 FuncInfo(new FunctionLoweringInfo(TLI)),
Dan Gohman7451d3e2010-05-29 17:03:36 +0000188 CurDAG(new SelectionDAG(tm)),
Dan Gohman55e59c12010-04-19 19:05:59 +0000189 SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)),
Dan Gohman7c3234c2008-08-27 23:52:12 +0000190 GFI(),
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +0000191 OptLevel(OL),
Owen Anderson081c34b2010-10-19 17:21:58 +0000192 DAGSize(0) {
193 initializeGCModuleInfoPass(*PassRegistry::getPassRegistry());
194 initializeAliasAnalysisAnalysisGroup(*PassRegistry::getPassRegistry());
Jakub Staszak7cc2b072011-06-16 20:22:37 +0000195 initializeBranchProbabilityInfoPass(*PassRegistry::getPassRegistry());
Owen Anderson081c34b2010-10-19 17:21:58 +0000196 }
Dan Gohman7c3234c2008-08-27 23:52:12 +0000197
198SelectionDAGISel::~SelectionDAGISel() {
Dan Gohman2048b852009-11-23 18:04:58 +0000199 delete SDB;
Dan Gohman7c3234c2008-08-27 23:52:12 +0000200 delete CurDAG;
201 delete FuncInfo;
202}
203
Chris Lattner495a0b52005-08-17 06:37:43 +0000204void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
Jim Laskeyc7c3f112006-10-16 20:52:31 +0000205 AU.addRequired<AliasAnalysis>();
Dan Gohmana3477fe2009-07-31 23:36:22 +0000206 AU.addPreserved<AliasAnalysis>();
Gordon Henriksen5eca0752008-08-17 18:44:35 +0000207 AU.addRequired<GCModuleInfo>();
Dan Gohmana3477fe2009-07-31 23:36:22 +0000208 AU.addPreserved<GCModuleInfo>();
Jakub Staszak7cc2b072011-06-16 20:22:37 +0000209 if (UseMBPI && OptLevel != CodeGenOpt::None)
210 AU.addRequired<BranchProbabilityInfo>();
Dan Gohmanad2afc22009-07-31 18:16:33 +0000211 MachineFunctionPass::getAnalysisUsage(AU);
Chris Lattner495a0b52005-08-17 06:37:43 +0000212}
Chris Lattner1c08c712005-01-07 07:47:53 +0000213
Chris Lattner96ba57f2010-12-19 04:58:57 +0000214/// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that
215/// may trap on it. In this case we have to split the edge so that the path
216/// through the predecessor block that doesn't go to the phi block doesn't
217/// execute the possibly trapping instruction.
218///
219/// This is required for correctness, so it must be done at -O0.
220///
221static void SplitCriticalSideEffectEdges(Function &Fn, Pass *SDISel) {
222 // Loop for blocks with phi nodes.
223 for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
224 PHINode *PN = dyn_cast<PHINode>(BB->begin());
225 if (PN == 0) continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000226
Chris Lattner96ba57f2010-12-19 04:58:57 +0000227 ReprocessBlock:
228 // For each block with a PHI node, check to see if any of the input values
229 // are potentially trapping constant expressions. Constant expressions are
230 // the only potentially trapping value that can occur as the argument to a
231 // PHI.
232 for (BasicBlock::iterator I = BB->begin(); (PN = dyn_cast<PHINode>(I)); ++I)
233 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
234 ConstantExpr *CE = dyn_cast<ConstantExpr>(PN->getIncomingValue(i));
235 if (CE == 0 || !CE->canTrap()) continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000236
Chris Lattner96ba57f2010-12-19 04:58:57 +0000237 // The only case we have to worry about is when the edge is critical.
238 // Since this block has a PHI Node, we assume it has multiple input
239 // edges: check to see if the pred has multiple successors.
240 BasicBlock *Pred = PN->getIncomingBlock(i);
241 if (Pred->getTerminator()->getNumSuccessors() == 1)
242 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000243
Chris Lattner96ba57f2010-12-19 04:58:57 +0000244 // Okay, we have to split this edge.
245 SplitCriticalEdge(Pred->getTerminator(),
246 GetSuccessorNumber(Pred, BB), SDISel, true);
247 goto ReprocessBlock;
248 }
249 }
250}
251
Dan Gohmanad2afc22009-07-31 18:16:33 +0000252bool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) {
Dan Gohman4344a5d2008-09-09 23:05:00 +0000253 // Do some sanity-checking on the command-line options.
254 assert((!EnableFastISelVerbose || EnableFastISel) &&
255 "-fast-isel-verbose requires -fast-isel");
256 assert((!EnableFastISelAbort || EnableFastISel) &&
257 "-fast-isel-abort requires -fast-isel");
258
Dan Gohmanae541aa2010-04-15 04:33:49 +0000259 const Function &Fn = *mf.getFunction();
Dan Gohman8a110532008-09-05 22:59:21 +0000260 const TargetInstrInfo &TII = *TM.getInstrInfo();
261 const TargetRegisterInfo &TRI = *TM.getRegisterInfo();
262
Dan Gohmanc0fb65d2010-04-14 17:02:07 +0000263 MF = &mf;
Dan Gohman79ce2762009-01-15 19:20:50 +0000264 RegInfo = &MF->getRegInfo();
Dan Gohmanc0fb65d2010-04-14 17:02:07 +0000265 AA = &getAnalysis<AliasAnalysis>();
266 GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0;
267
David Greene1a053232010-01-05 01:26:11 +0000268 DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n");
Chris Lattner1c08c712005-01-07 07:47:53 +0000269
Chris Lattner96ba57f2010-12-19 04:58:57 +0000270 SplitCriticalSideEffectEdges(const_cast<Function&>(Fn), this);
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000271
Chris Lattnerde6e7832010-04-05 06:10:13 +0000272 CurDAG->init(*MF);
Dan Gohman7451d3e2010-05-29 17:03:36 +0000273 FuncInfo->set(Fn, *MF);
Jakub Staszak7cc2b072011-06-16 20:22:37 +0000274
275 if (UseMBPI && OptLevel != CodeGenOpt::None)
276 FuncInfo->BPI = &getAnalysis<BranchProbabilityInfo>();
277 else
278 FuncInfo->BPI = 0;
279
Dan Gohman2048b852009-11-23 18:04:58 +0000280 SDB->init(GFI, *AA);
Chris Lattner1c08c712005-01-07 07:47:53 +0000281
Dan Gohman6a732b52010-04-14 20:05:00 +0000282 SelectAllBasicBlocks(Fn);
Misha Brukmanedf128a2005-04-21 22:36:52 +0000283
Dan Gohman1b79a2f2010-05-01 00:33:28 +0000284 // If the first basic block in the function has live ins that need to be
Dan Gohman8a110532008-09-05 22:59:21 +0000285 // copied into vregs, emit the copies into the top of the block before
286 // emitting the code for the block.
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000287 MachineBasicBlock *EntryMBB = MF->begin();
288 RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII);
289
Devang Patel394427b2010-05-26 20:18:50 +0000290 DenseMap<unsigned, unsigned> LiveInMap;
291 if (!FuncInfo->ArgDbgValues.empty())
292 for (MachineRegisterInfo::livein_iterator LI = RegInfo->livein_begin(),
293 E = RegInfo->livein_end(); LI != E; ++LI)
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000294 if (LI->second)
Devang Patel394427b2010-05-26 20:18:50 +0000295 LiveInMap.insert(std::make_pair(LI->first, LI->second));
296
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000297 // Insert DBG_VALUE instructions for function arguments to the entry block.
298 for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) {
299 MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1];
300 unsigned Reg = MI->getOperand(0).getReg();
301 if (TargetRegisterInfo::isPhysicalRegister(Reg))
302 EntryMBB->insert(EntryMBB->begin(), MI);
303 else {
304 MachineInstr *Def = RegInfo->getVRegDef(Reg);
305 MachineBasicBlock::iterator InsertPos = Def;
Evan Chengf1ced252010-05-04 00:58:39 +0000306 // FIXME: VR def may not be in entry block.
307 Def->getParent()->insert(llvm::next(InsertPos), MI);
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000308 }
Devang Patel394427b2010-05-26 20:18:50 +0000309
310 // If Reg is live-in then update debug info to track its copy in a vreg.
311 DenseMap<unsigned, unsigned>::iterator LDI = LiveInMap.find(Reg);
312 if (LDI != LiveInMap.end()) {
313 MachineInstr *Def = RegInfo->getVRegDef(LDI->second);
314 MachineBasicBlock::iterator InsertPos = Def;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000315 const MDNode *Variable =
Devang Patel394427b2010-05-26 20:18:50 +0000316 MI->getOperand(MI->getNumOperands()-1).getMetadata();
317 unsigned Offset = MI->getOperand(1).getImm();
318 // Def is never a terminator here, so it is ok to increment InsertPos.
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000319 BuildMI(*EntryMBB, ++InsertPos, MI->getDebugLoc(),
Devang Patel394427b2010-05-26 20:18:50 +0000320 TII.get(TargetOpcode::DBG_VALUE))
321 .addReg(LDI->second, RegState::Debug)
322 .addImm(Offset).addMetadata(Variable);
Devang Patel44cfe142010-09-21 20:56:33 +0000323
324 // If this vreg is directly copied into an exported register then
325 // that COPY instructions also need DBG_VALUE, if it is the only
326 // user of LDI->second.
327 MachineInstr *CopyUseMI = NULL;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000328 for (MachineRegisterInfo::use_iterator
329 UI = RegInfo->use_begin(LDI->second);
Devang Patel44cfe142010-09-21 20:56:33 +0000330 MachineInstr *UseMI = UI.skipInstruction();) {
331 if (UseMI->isDebugValue()) continue;
332 if (UseMI->isCopy() && !CopyUseMI && UseMI->getParent() == EntryMBB) {
333 CopyUseMI = UseMI; continue;
334 }
335 // Otherwise this is another use or second copy use.
336 CopyUseMI = NULL; break;
337 }
338 if (CopyUseMI) {
339 MachineInstr *NewMI =
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000340 BuildMI(*MF, CopyUseMI->getDebugLoc(),
Devang Patel44cfe142010-09-21 20:56:33 +0000341 TII.get(TargetOpcode::DBG_VALUE))
342 .addReg(CopyUseMI->getOperand(0).getReg(), RegState::Debug)
343 .addImm(Offset).addMetadata(Variable);
344 EntryMBB->insertAfter(CopyUseMI, NewMI);
345 }
Devang Patel394427b2010-05-26 20:18:50 +0000346 }
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000347 }
348
Bill Wendling53f76022010-05-17 23:09:50 +0000349 // Determine if there are any calls in this machine function.
350 MachineFrameInfo *MFI = MF->getFrameInfo();
351 if (!MFI->hasCalls()) {
352 for (MachineFunction::const_iterator
353 I = MF->begin(), E = MF->end(); I != E; ++I) {
354 const MachineBasicBlock *MBB = I;
355 for (MachineBasicBlock::const_iterator
356 II = MBB->begin(), IE = MBB->end(); II != IE; ++II) {
Evan Chenge837dea2011-06-28 19:10:37 +0000357 const MCInstrDesc &MCID = TM.getInstrInfo()->get(II->getOpcode());
Bill Wendling8886c492010-07-09 19:44:12 +0000358
Evan Chenge837dea2011-06-28 19:10:37 +0000359 if ((MCID.isCall() && !MCID.isReturn()) ||
Evan Chengc36b7062011-01-07 23:50:32 +0000360 II->isStackAligningInlineAsm()) {
Bill Wendling53f76022010-05-17 23:09:50 +0000361 MFI->setHasCalls(true);
362 goto done;
363 }
364 }
365 }
366 done:;
367 }
368
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000369 // Determine if there is a call to setjmp in the machine function.
Rafael Espindola0e00c6c2011-05-16 03:05:33 +0000370 MF->setCallsSetJmp(Fn.callsFunctionThatReturnsTwice());
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000371
Dan Gohman84023e02010-07-10 09:00:22 +0000372 // Replace forward-declared registers with the registers containing
373 // the desired value.
374 MachineRegisterInfo &MRI = MF->getRegInfo();
375 for (DenseMap<unsigned, unsigned>::iterator
376 I = FuncInfo->RegFixups.begin(), E = FuncInfo->RegFixups.end();
377 I != E; ++I) {
378 unsigned From = I->first;
379 unsigned To = I->second;
380 // If To is also scheduled to be replaced, find what its ultimate
381 // replacement is.
382 for (;;) {
383 DenseMap<unsigned, unsigned>::iterator J =
384 FuncInfo->RegFixups.find(To);
385 if (J == E) break;
386 To = J->second;
387 }
388 // Replace it.
389 MRI.replaceRegWith(From, To);
390 }
391
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000392 // Release function-specific state. SDB and CurDAG are already cleared
393 // at this point.
394 FuncInfo->clear();
Dan Gohman8a110532008-09-05 22:59:21 +0000395
Chris Lattner1c08c712005-01-07 07:47:53 +0000396 return true;
397}
398
Chris Lattner685090f2011-04-17 17:12:08 +0000399void SelectionDAGISel::SelectBasicBlock(BasicBlock::const_iterator Begin,
400 BasicBlock::const_iterator End,
401 bool &HadTailCall) {
Dan Gohman98ca4f22009-08-05 01:29:28 +0000402 // Lower all of the non-terminator instructions. If a call is emitted
Dan Gohmanf89d1dc2010-04-16 05:06:56 +0000403 // as a tail call, cease emitting nodes for this block. Terminators
404 // are handled below.
Dan Gohmanc105a2b2010-04-22 20:55:53 +0000405 for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I)
Dan Gohmanf89d1dc2010-04-16 05:06:56 +0000406 SDB->visit(*I);
Dan Gohmanf350b272008-08-23 02:25:05 +0000407
Chris Lattnera651cf62005-01-17 19:43:36 +0000408 // Make sure the root of the DAG is up-to-date.
Dan Gohman2048b852009-11-23 18:04:58 +0000409 CurDAG->setRoot(SDB->getControlRoot());
Dan Gohman2048b852009-11-23 18:04:58 +0000410 HadTailCall = SDB->HasTailCall;
411 SDB->clear();
Dan Gohman95140a42010-05-01 00:25:44 +0000412
413 // Final step, emit the lowered DAG as machine code.
Dan Gohman84023e02010-07-10 09:00:22 +0000414 CodeGenAndEmitDAG();
Chris Lattner1c08c712005-01-07 07:47:53 +0000415}
416
Dan Gohmanf350b272008-08-23 02:25:05 +0000417void SelectionDAGISel::ComputeLiveOutVRegInfo() {
Chris Lattneread0d882008-06-17 06:09:18 +0000418 SmallPtrSet<SDNode*, 128> VisitedNodes;
419 SmallVector<SDNode*, 128> Worklist;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000420
Gabor Greifba36cb52008-08-28 21:40:38 +0000421 Worklist.push_back(CurDAG->getRoot().getNode());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000422
Chris Lattneread0d882008-06-17 06:09:18 +0000423 APInt Mask;
424 APInt KnownZero;
425 APInt KnownOne;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000426
Benjamin Kramer7b1e2a52010-01-07 17:27:56 +0000427 do {
428 SDNode *N = Worklist.pop_back_val();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000429
Chris Lattneread0d882008-06-17 06:09:18 +0000430 // If we've already seen this node, ignore it.
431 if (!VisitedNodes.insert(N))
432 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000433
Chris Lattneread0d882008-06-17 06:09:18 +0000434 // Otherwise, add all chain operands to the worklist.
435 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
Owen Anderson825b72b2009-08-11 20:47:22 +0000436 if (N->getOperand(i).getValueType() == MVT::Other)
Gabor Greifba36cb52008-08-28 21:40:38 +0000437 Worklist.push_back(N->getOperand(i).getNode());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000438
Chris Lattneread0d882008-06-17 06:09:18 +0000439 // If this is a CopyToReg with a vreg dest, process it.
440 if (N->getOpcode() != ISD::CopyToReg)
441 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000442
Chris Lattneread0d882008-06-17 06:09:18 +0000443 unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg();
444 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
445 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000446
Chris Lattneread0d882008-06-17 06:09:18 +0000447 // Ignore non-scalar or non-integer values.
Dan Gohman475871a2008-07-27 21:46:04 +0000448 SDValue Src = N->getOperand(2);
Owen Andersone50ed302009-08-10 22:56:29 +0000449 EVT SrcVT = Src.getValueType();
Chris Lattneread0d882008-06-17 06:09:18 +0000450 if (!SrcVT.isInteger() || SrcVT.isVector())
451 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000452
Dan Gohmanf350b272008-08-23 02:25:05 +0000453 unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src);
Chris Lattneread0d882008-06-17 06:09:18 +0000454 Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits());
Dan Gohmanf350b272008-08-23 02:25:05 +0000455 CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne);
Cameron Zwariche1497b92011-02-24 10:00:08 +0000456 FuncInfo->AddLiveOutRegInfo(DestReg, NumSignBits, KnownZero, KnownOne);
Benjamin Kramer7b1e2a52010-01-07 17:27:56 +0000457 } while (!Worklist.empty());
Chris Lattneread0d882008-06-17 06:09:18 +0000458}
459
Dan Gohman84023e02010-07-10 09:00:22 +0000460void SelectionDAGISel::CodeGenAndEmitDAG() {
Dan Gohman462dc7f2008-07-21 20:00:07 +0000461 std::string GroupName;
462 if (TimePassesIsEnabled)
463 GroupName = "Instruction Selection and Scheduling";
464 std::string BlockName;
Andrew Tricka2f45292011-03-23 01:38:28 +0000465 int BlockNumber = -1;
466#ifdef NDEBUG
Dan Gohman462dc7f2008-07-21 20:00:07 +0000467 if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs ||
Duncan Sands25cf2272008-11-24 14:53:14 +0000468 ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs ||
469 ViewSUnitDAGs)
Andrew Tricka2f45292011-03-23 01:38:28 +0000470#endif
471 {
472 BlockNumber = FuncInfo->MBB->getNumber();
Dan Gohmanf7d6cd42009-08-01 03:51:09 +0000473 BlockName = MF->getFunction()->getNameStr() + ":" +
Dan Gohman84023e02010-07-10 09:00:22 +0000474 FuncInfo->MBB->getBasicBlock()->getNameStr();
Andrew Tricka2f45292011-03-23 01:38:28 +0000475 }
476 DEBUG(dbgs() << "Initial selection DAG: BB#" << BlockNumber
477 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman462dc7f2008-07-21 20:00:07 +0000478
Dan Gohmanf350b272008-08-23 02:25:05 +0000479 if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName);
Dan Gohman417e11b2007-10-08 15:12:17 +0000480
Chris Lattneraf21d552005-10-10 16:47:10 +0000481 // Run the DAG combiner in pre-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000482 {
483 NamedRegionTimer T("DAG Combining 1", GroupName, TimePassesIsEnabled);
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +0000484 CurDAG->Combine(Unrestricted, *AA, OptLevel);
Evan Chengebffb662008-07-01 17:59:20 +0000485 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000486
Andrew Tricka2f45292011-03-23 01:38:28 +0000487 DEBUG(dbgs() << "Optimized lowered selection DAG: BB#" << BlockNumber
488 << " '" << BlockName << "'\n"; CurDAG->dump());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000489
Chris Lattner1c08c712005-01-07 07:47:53 +0000490 // Second step, hack on the DAG until it only uses operations and types that
491 // the target supports.
Dan Gohman714efc62009-12-05 17:51:33 +0000492 if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " +
493 BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000494
Dan Gohman714efc62009-12-05 17:51:33 +0000495 bool Changed;
Dan Gohman03c3dc72010-06-18 15:56:31 +0000496 {
497 NamedRegionTimer T("Type Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000498 Changed = CurDAG->LegalizeTypes();
499 }
500
Andrew Tricka2f45292011-03-23 01:38:28 +0000501 DEBUG(dbgs() << "Type-legalized selection DAG: BB#" << BlockNumber
502 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman714efc62009-12-05 17:51:33 +0000503
504 if (Changed) {
505 if (ViewDAGCombineLT)
506 CurDAG->viewGraph("dag-combine-lt input for " + BlockName);
507
508 // Run the DAG combiner in post-type-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000509 {
510 NamedRegionTimer T("DAG Combining after legalize types", GroupName,
511 TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000512 CurDAG->Combine(NoIllegalTypes, *AA, OptLevel);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000513 }
514
Andrew Tricka2f45292011-03-23 01:38:28 +0000515 DEBUG(dbgs() << "Optimized type-legalized selection DAG: BB#" << BlockNumber
516 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman714efc62009-12-05 17:51:33 +0000517 }
Dan Gohman462dc7f2008-07-21 20:00:07 +0000518
Dan Gohman03c3dc72010-06-18 15:56:31 +0000519 {
520 NamedRegionTimer T("Vector Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000521 Changed = CurDAG->LegalizeVectors();
522 }
Duncan Sands25cf2272008-11-24 14:53:14 +0000523
Dan Gohman714efc62009-12-05 17:51:33 +0000524 if (Changed) {
Dan Gohman03c3dc72010-06-18 15:56:31 +0000525 {
526 NamedRegionTimer T("Type Legalization 2", GroupName, TimePassesIsEnabled);
Bill Wendling98820072009-12-28 01:51:30 +0000527 CurDAG->LegalizeTypes();
Eli Friedman5c22c802009-05-23 12:35:30 +0000528 }
529
Dan Gohman714efc62009-12-05 17:51:33 +0000530 if (ViewDAGCombineLT)
531 CurDAG->viewGraph("dag-combine-lv input for " + BlockName);
Eli Friedman5c22c802009-05-23 12:35:30 +0000532
Dan Gohman714efc62009-12-05 17:51:33 +0000533 // Run the DAG combiner in post-type-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000534 {
535 NamedRegionTimer T("DAG Combining after legalize vectors", GroupName,
536 TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000537 CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
Eli Friedman5c22c802009-05-23 12:35:30 +0000538 }
Dan Gohman714efc62009-12-05 17:51:33 +0000539
Andrew Tricka2f45292011-03-23 01:38:28 +0000540 DEBUG(dbgs() << "Optimized vector-legalized selection DAG: BB#"
541 << BlockNumber << " '" << BlockName << "'\n"; CurDAG->dump());
Chris Lattner70587ea2008-07-10 23:37:50 +0000542 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000543
Dan Gohmanf350b272008-08-23 02:25:05 +0000544 if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000545
Dan Gohman03c3dc72010-06-18 15:56:31 +0000546 {
547 NamedRegionTimer T("DAG Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman975716a2011-05-16 22:19:54 +0000548 CurDAG->Legalize();
Evan Chengebffb662008-07-01 17:59:20 +0000549 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000550
Andrew Tricka2f45292011-03-23 01:38:28 +0000551 DEBUG(dbgs() << "Legalized selection DAG: BB#" << BlockNumber
552 << " '" << BlockName << "'\n"; CurDAG->dump());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000553
Dan Gohmanf350b272008-08-23 02:25:05 +0000554 if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000555
Chris Lattneraf21d552005-10-10 16:47:10 +0000556 // Run the DAG combiner in post-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000557 {
558 NamedRegionTimer T("DAG Combining 2", GroupName, TimePassesIsEnabled);
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +0000559 CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
Evan Chengebffb662008-07-01 17:59:20 +0000560 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000561
Andrew Tricka2f45292011-03-23 01:38:28 +0000562 DEBUG(dbgs() << "Optimized legalized selection DAG: BB#" << BlockNumber
563 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman417e11b2007-10-08 15:12:17 +0000564
Dan Gohman4e39e9d2010-06-24 14:30:44 +0000565 if (OptLevel != CodeGenOpt::None)
Dan Gohmanf350b272008-08-23 02:25:05 +0000566 ComputeLiveOutVRegInfo();
Evan Cheng552c4a82006-04-28 02:09:19 +0000567
Chris Lattner552186d2010-03-14 19:27:55 +0000568 if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName);
569
Chris Lattnera33ef482005-03-30 01:10:47 +0000570 // Third, instruction select all of the operations to machine code, adding the
571 // code to the MachineBasicBlock.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000572 {
573 NamedRegionTimer T("Instruction Selection", GroupName, TimePassesIsEnabled);
Chris Lattner7c306da2010-03-02 06:34:30 +0000574 DoInstructionSelection();
Evan Chengebffb662008-07-01 17:59:20 +0000575 }
Evan Chengdb8d56b2008-06-30 20:45:06 +0000576
Andrew Tricka2f45292011-03-23 01:38:28 +0000577 DEBUG(dbgs() << "Selected selection DAG: BB#" << BlockNumber
578 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman462dc7f2008-07-21 20:00:07 +0000579
Dan Gohmanf350b272008-08-23 02:25:05 +0000580 if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000581
Dan Gohman5e843682008-07-14 18:19:29 +0000582 // Schedule machine code.
Dan Gohman47ac0f02009-02-11 04:27:20 +0000583 ScheduleDAGSDNodes *Scheduler = CreateScheduler();
Dan Gohman03c3dc72010-06-18 15:56:31 +0000584 {
585 NamedRegionTimer T("Instruction Scheduling", GroupName,
586 TimePassesIsEnabled);
Dan Gohman84023e02010-07-10 09:00:22 +0000587 Scheduler->Run(CurDAG, FuncInfo->MBB, FuncInfo->InsertPt);
Dan Gohman5e843682008-07-14 18:19:29 +0000588 }
589
Dan Gohman462dc7f2008-07-21 20:00:07 +0000590 if (ViewSUnitDAGs) Scheduler->viewGraph();
591
Daniel Dunbara279bc32009-09-20 02:20:51 +0000592 // Emit machine code to BB. This can change 'BB' to the last block being
Evan Chengdb8d56b2008-06-30 20:45:06 +0000593 // inserted into.
Jakob Stoklund Olesen2622f462010-09-30 19:44:31 +0000594 MachineBasicBlock *FirstMBB = FuncInfo->MBB, *LastMBB;
Dan Gohman03c3dc72010-06-18 15:56:31 +0000595 {
596 NamedRegionTimer T("Instruction Creation", GroupName, TimePassesIsEnabled);
Dan Gohman84023e02010-07-10 09:00:22 +0000597
Jakob Stoklund Olesen2622f462010-09-30 19:44:31 +0000598 LastMBB = FuncInfo->MBB = Scheduler->EmitSchedule();
Dan Gohman84023e02010-07-10 09:00:22 +0000599 FuncInfo->InsertPt = Scheduler->InsertPos;
Dan Gohman5e843682008-07-14 18:19:29 +0000600 }
601
Jakob Stoklund Olesen2622f462010-09-30 19:44:31 +0000602 // If the block was split, make sure we update any references that are used to
603 // update PHI nodes later on.
604 if (FirstMBB != LastMBB)
605 SDB->UpdateSplitBlock(FirstMBB, LastMBB);
606
Dan Gohman5e843682008-07-14 18:19:29 +0000607 // Free the scheduler state.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000608 {
609 NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName,
610 TimePassesIsEnabled);
Dan Gohman5e843682008-07-14 18:19:29 +0000611 delete Scheduler;
Evan Chengebffb662008-07-01 17:59:20 +0000612 }
Evan Chengdb8d56b2008-06-30 20:45:06 +0000613
Dan Gohman95140a42010-05-01 00:25:44 +0000614 // Free the SelectionDAG state, now that we're finished with it.
615 CurDAG->clear();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000616}
Chris Lattner1c08c712005-01-07 07:47:53 +0000617
Chris Lattner7c306da2010-03-02 06:34:30 +0000618void SelectionDAGISel::DoInstructionSelection() {
Andrew Tricka2f45292011-03-23 01:38:28 +0000619 DEBUG(errs() << "===== Instruction selection begins: BB#"
620 << FuncInfo->MBB->getNumber()
621 << " '" << FuncInfo->MBB->getName() << "'\n");
Chris Lattner7c306da2010-03-02 06:34:30 +0000622
623 PreprocessISelDAG();
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000624
Chris Lattner7c306da2010-03-02 06:34:30 +0000625 // Select target instructions for the DAG.
626 {
627 // Number all nodes with a topological order and set DAGSize.
628 DAGSize = CurDAG->AssignTopologicalOrder();
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000629
Chris Lattner7c306da2010-03-02 06:34:30 +0000630 // Create a dummy node (which is not added to allnodes), that adds
631 // a reference to the root node, preventing it from being deleted,
632 // and tracking any changes of the root.
633 HandleSDNode Dummy(CurDAG->getRoot());
634 ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode());
635 ++ISelPosition;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000636
Chris Lattner7c306da2010-03-02 06:34:30 +0000637 // The AllNodes list is now topological-sorted. Visit the
638 // nodes by starting at the end of the list (the root of the
639 // graph) and preceding back toward the beginning (the entry
640 // node).
641 while (ISelPosition != CurDAG->allnodes_begin()) {
642 SDNode *Node = --ISelPosition;
643 // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes,
644 // but there are currently some corner cases that it misses. Also, this
645 // makes it theoretically possible to disable the DAGCombiner.
646 if (Node->use_empty())
647 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000648
Chris Lattner7c306da2010-03-02 06:34:30 +0000649 SDNode *ResNode = Select(Node);
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000650
Chris Lattner82dd3d32010-03-02 07:50:03 +0000651 // FIXME: This is pretty gross. 'Select' should be changed to not return
652 // anything at all and this code should be nuked with a tactical strike.
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000653
Chris Lattner7c306da2010-03-02 06:34:30 +0000654 // If node should not be replaced, continue with the next one.
Chris Lattner82dd3d32010-03-02 07:50:03 +0000655 if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE)
Chris Lattner7c306da2010-03-02 06:34:30 +0000656 continue;
657 // Replace node.
658 if (ResNode)
659 ReplaceUses(Node, ResNode);
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000660
Chris Lattner7c306da2010-03-02 06:34:30 +0000661 // If after the replacement this node is not used any more,
662 // remove this dead node.
663 if (Node->use_empty()) { // Don't delete EntryToken, etc.
664 ISelUpdater ISU(ISelPosition);
665 CurDAG->RemoveDeadNode(Node, &ISU);
666 }
667 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000668
Chris Lattner7c306da2010-03-02 06:34:30 +0000669 CurDAG->setRoot(Dummy.getValue());
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000670 }
Bill Wendling53f76022010-05-17 23:09:50 +0000671
Chris Lattner7c306da2010-03-02 06:34:30 +0000672 DEBUG(errs() << "===== Instruction selection ends:\n");
673
674 PostprocessISelDAG();
Chris Lattner7c306da2010-03-02 06:34:30 +0000675}
676
Dan Gohman25208642010-04-14 19:53:31 +0000677/// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and
678/// do other setup for EH landing-pad blocks.
Dan Gohman84023e02010-07-10 09:00:22 +0000679void SelectionDAGISel::PrepareEHLandingPad() {
Dan Gohman25208642010-04-14 19:53:31 +0000680 // Add a label to mark the beginning of the landing pad. Deletion of the
681 // landing pad can thus be detected via the MachineModuleInfo.
Dan Gohman84023e02010-07-10 09:00:22 +0000682 MCSymbol *Label = MF->getMMI().addLandingPad(FuncInfo->MBB);
Dan Gohman25208642010-04-14 19:53:31 +0000683
Evan Chenge837dea2011-06-28 19:10:37 +0000684 const MCInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL);
Dan Gohman84023e02010-07-10 09:00:22 +0000685 BuildMI(*FuncInfo->MBB, FuncInfo->InsertPt, SDB->getCurDebugLoc(), II)
686 .addSym(Label);
Dan Gohman25208642010-04-14 19:53:31 +0000687
688 // Mark exception register as live in.
689 unsigned Reg = TLI.getExceptionAddressRegister();
Dan Gohman84023e02010-07-10 09:00:22 +0000690 if (Reg) FuncInfo->MBB->addLiveIn(Reg);
Dan Gohman25208642010-04-14 19:53:31 +0000691
692 // Mark exception selector register as live in.
693 Reg = TLI.getExceptionSelectorRegister();
Dan Gohman84023e02010-07-10 09:00:22 +0000694 if (Reg) FuncInfo->MBB->addLiveIn(Reg);
Dan Gohman25208642010-04-14 19:53:31 +0000695
696 // FIXME: Hack around an exception handling flaw (PR1508): the personality
697 // function and list of typeids logically belong to the invoke (or, if you
698 // like, the basic block containing the invoke), and need to be associated
699 // with it in the dwarf exception handling tables. Currently however the
700 // information is provided by an intrinsic (eh.selector) that can be moved
701 // to unexpected places by the optimizers: if the unwind edge is critical,
702 // then breaking it can result in the intrinsics being in the successor of
703 // the landing pad, not the landing pad itself. This results
704 // in exceptions not being caught because no typeids are associated with
705 // the invoke. This may not be the only way things can go wrong, but it
706 // is the only way we try to work around for the moment.
Dan Gohman84023e02010-07-10 09:00:22 +0000707 const BasicBlock *LLVMBB = FuncInfo->MBB->getBasicBlock();
Dan Gohman25208642010-04-14 19:53:31 +0000708 const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator());
709
710 if (Br && Br->isUnconditional()) { // Critical edge?
711 BasicBlock::const_iterator I, E;
712 for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I)
713 if (isa<EHSelectorInst>(I))
714 break;
715
716 if (I == E)
717 // No catch info found - try to extract some from the successor.
718 CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo);
719 }
720}
Chris Lattner7c306da2010-03-02 06:34:30 +0000721
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000722
723
Chris Lattnerb686af02011-04-22 21:59:37 +0000724/// TryToFoldFastISelLoad - We're checking to see if we can fold the specified
725/// load into the specified FoldInst. Note that we could have a sequence where
726/// multiple LLVM IR instructions are folded into the same machineinstr. For
727/// example we could have:
728/// A: x = load i32 *P
729/// B: y = icmp A, 42
730/// C: br y, ...
731///
732/// In this scenario, LI is "A", and FoldInst is "C". We know about "B" (and
733/// any other folded instructions) because it is between A and C.
734///
735/// If we succeed in folding the load into the operation, return true.
736///
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000737bool SelectionDAGISel::TryToFoldFastISelLoad(const LoadInst *LI,
Chris Lattnerb686af02011-04-22 21:59:37 +0000738 const Instruction *FoldInst,
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000739 FastISel *FastIS) {
Chris Lattnerb686af02011-04-22 21:59:37 +0000740 // We know that the load has a single use, but don't know what it is. If it
741 // isn't one of the folded instructions, then we can't succeed here. Handle
742 // this by scanning the single-use users of the load until we get to FoldInst.
743 unsigned MaxUsers = 6; // Don't scan down huge single-use chains of instrs.
744
745 const Instruction *TheUser = LI->use_back();
746 while (TheUser != FoldInst && // Scan up until we find FoldInst.
747 // Stay in the right block.
748 TheUser->getParent() == FoldInst->getParent() &&
749 --MaxUsers) { // Don't scan too far.
750 // If there are multiple or no uses of this instruction, then bail out.
751 if (!TheUser->hasOneUse())
752 return false;
753
754 TheUser = TheUser->use_back();
755 }
756
Chris Lattnerf4ea68f2011-08-11 06:26:54 +0000757 // If we didn't find the fold instruction, then we failed to collapse the
758 // sequence.
759 if (TheUser != FoldInst)
760 return false;
761
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000762 // Don't try to fold volatile loads. Target has to deal with alignment
763 // constraints.
764 if (LI->isVolatile()) return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000765
Chris Lattnerb686af02011-04-22 21:59:37 +0000766 // Figure out which vreg this is going into. If there is no assigned vreg yet
767 // then there actually was no reference to it. Perhaps the load is referenced
768 // by a dead instruction.
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000769 unsigned LoadReg = FastIS->getRegForValue(LI);
Chris Lattnerb686af02011-04-22 21:59:37 +0000770 if (LoadReg == 0)
771 return false;
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000772
773 // Check to see what the uses of this vreg are. If it has no uses, or more
774 // than one use (at the machine instr level) then we can't fold it.
775 MachineRegisterInfo::reg_iterator RI = RegInfo->reg_begin(LoadReg);
776 if (RI == RegInfo->reg_end())
777 return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000778
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000779 // See if there is exactly one use of the vreg. If there are multiple uses,
780 // then the instruction got lowered to multiple machine instructions or the
781 // use of the loaded value ended up being multiple operands of the result, in
782 // either case, we can't fold this.
783 MachineRegisterInfo::reg_iterator PostRI = RI; ++PostRI;
784 if (PostRI != RegInfo->reg_end())
785 return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000786
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000787 assert(RI.getOperand().isUse() &&
788 "The only use of the vreg must be a use, we haven't emitted the def!");
789
Chris Lattnerb99fdee2011-01-16 02:27:38 +0000790 MachineInstr *User = &*RI;
Jim Grosbach9d401932011-03-01 01:39:05 +0000791
Chris Lattnerb99fdee2011-01-16 02:27:38 +0000792 // Set the insertion point properly. Folding the load can cause generation of
793 // other random instructions (like sign extends) for addressing modes, make
794 // sure they get inserted in a logical place before the new instruction.
795 FuncInfo->InsertPt = User;
796 FuncInfo->MBB = User->getParent();
797
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000798 // Ask the target to try folding the load.
Chris Lattnerb99fdee2011-01-16 02:27:38 +0000799 return FastIS->TryToFoldLoad(User, RI.getOperandNo(), LI);
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000800}
801
Chris Lattner8bdc2512011-04-17 06:03:19 +0000802/// isFoldedOrDeadInstruction - Return true if the specified instruction is
803/// side-effect free and is either dead or folded into a generated instruction.
804/// Return false if it needs to be emitted.
805static bool isFoldedOrDeadInstruction(const Instruction *I,
806 FunctionLoweringInfo *FuncInfo) {
Chris Lattnerb686af02011-04-22 21:59:37 +0000807 return !I->mayWriteToMemory() && // Side-effecting instructions aren't folded.
808 !isa<TerminatorInst>(I) && // Terminators aren't folded.
809 !isa<DbgInfoIntrinsic>(I) && // Debug instructions aren't folded.
810 !FuncInfo->isExportedInst(I); // Exported instrs must be computed.
Chris Lattner8bdc2512011-04-17 06:03:19 +0000811}
812
Dan Gohman46510a72010-04-15 01:51:59 +0000813void SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) {
Dan Gohmana43abd12008-09-29 21:55:50 +0000814 // Initialize the Fast-ISel state, if needed.
815 FastISel *FastIS = 0;
816 if (EnableFastISel)
Dan Gohmana4160c32010-07-07 16:29:44 +0000817 FastIS = TLI.createFastISel(*FuncInfo);
Dan Gohmana43abd12008-09-29 21:55:50 +0000818
819 // Iterate over all basic blocks in the function.
Cameron Zwarich2dbe2852011-02-24 10:00:04 +0000820 ReversePostOrderTraversal<const Function*> RPOT(&Fn);
821 for (ReversePostOrderTraversal<const Function*>::rpo_iterator
822 I = RPOT.begin(), E = RPOT.end(); I != E; ++I) {
823 const BasicBlock *LLVMBB = *I;
Cameron Zwaricha46cd972011-02-24 10:00:13 +0000824
Cameron Zwarich324a24f2011-02-24 10:00:16 +0000825 if (OptLevel != CodeGenOpt::None) {
826 bool AllPredsVisited = true;
827 for (const_pred_iterator PI = pred_begin(LLVMBB), PE = pred_end(LLVMBB);
828 PI != PE; ++PI) {
829 if (!FuncInfo->VisitedBBs.count(*PI)) {
830 AllPredsVisited = false;
831 break;
832 }
833 }
834
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000835 if (AllPredsVisited) {
Chris Lattner8bdc2512011-04-17 06:03:19 +0000836 for (BasicBlock::const_iterator I = LLVMBB->begin();
837 isa<PHINode>(I); ++I)
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000838 FuncInfo->ComputePHILiveOutRegInfo(cast<PHINode>(I));
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000839 } else {
Chris Lattner8bdc2512011-04-17 06:03:19 +0000840 for (BasicBlock::const_iterator I = LLVMBB->begin();
841 isa<PHINode>(I); ++I)
Cameron Zwarich324a24f2011-02-24 10:00:16 +0000842 FuncInfo->InvalidatePHILiveOutRegInfo(cast<PHINode>(I));
Cameron Zwarich324a24f2011-02-24 10:00:16 +0000843 }
844
Cameron Zwaricha46cd972011-02-24 10:00:13 +0000845 FuncInfo->VisitedBBs.insert(LLVMBB);
Cameron Zwarich324a24f2011-02-24 10:00:16 +0000846 }
Cameron Zwaricha46cd972011-02-24 10:00:13 +0000847
Dan Gohman84023e02010-07-10 09:00:22 +0000848 FuncInfo->MBB = FuncInfo->MBBMap[LLVMBB];
849 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
Dan Gohmanf350b272008-08-23 02:25:05 +0000850
Dan Gohmanba5be5c2010-04-20 15:00:41 +0000851 BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI();
Dan Gohman46510a72010-04-15 01:51:59 +0000852 BasicBlock::const_iterator const End = LLVMBB->end();
Dan Gohman84023e02010-07-10 09:00:22 +0000853 BasicBlock::const_iterator BI = End;
Dan Gohman5edd3612008-08-28 20:28:56 +0000854
Dan Gohman84023e02010-07-10 09:00:22 +0000855 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
856
857 // Setup an EH landing-pad block.
858 if (FuncInfo->MBB->isLandingPad())
859 PrepareEHLandingPad();
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000860
Dan Gohmanf5951412010-07-08 01:00:56 +0000861 // Lower any arguments needed in this block if this is the entry block.
Devang Patel68e6bee2011-02-21 23:21:26 +0000862 if (LLVMBB == &Fn.getEntryBlock())
Dan Gohmanf5951412010-07-08 01:00:56 +0000863 LowerArguments(LLVMBB);
864
Dan Gohmanf350b272008-08-23 02:25:05 +0000865 // Before doing SelectionDAG ISel, see if FastISel has been requested.
Dan Gohmand725f042010-05-01 02:44:23 +0000866 if (FastIS) {
Dan Gohman84023e02010-07-10 09:00:22 +0000867 FastIS->startNewBlock();
868
Dan Gohmanf5951412010-07-08 01:00:56 +0000869 // Emit code for any incoming arguments. This must happen before
870 // beginning FastISel on the entry block.
871 if (LLVMBB == &Fn.getEntryBlock()) {
872 CurDAG->setRoot(SDB->getControlRoot());
873 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +0000874 CodeGenAndEmitDAG();
875
876 // If we inserted any instructions at the beginning, make a note of
877 // where they are, so we can be sure to emit subsequent instructions
878 // after them.
879 if (FuncInfo->InsertPt != FuncInfo->MBB->begin())
880 FastIS->setLastLocalValue(llvm::prior(FuncInfo->InsertPt));
881 else
882 FastIS->setLastLocalValue(0);
Dan Gohmanf5951412010-07-08 01:00:56 +0000883 }
Dan Gohman84023e02010-07-10 09:00:22 +0000884
Dan Gohmana43abd12008-09-29 21:55:50 +0000885 // Do FastISel on as many instructions as possible.
Dan Gohman84023e02010-07-10 09:00:22 +0000886 for (; BI != Begin; --BI) {
887 const Instruction *Inst = llvm::prior(BI);
888
889 // If we no longer require this instruction, skip it.
Chris Lattner8bdc2512011-04-17 06:03:19 +0000890 if (isFoldedOrDeadInstruction(Inst, FuncInfo))
Dan Gohman20d4be12010-07-01 02:58:57 +0000891 continue;
Dan Gohman84023e02010-07-10 09:00:22 +0000892
893 // Bottom-up: reset the insert pos at the top, after any local-value
894 // instructions.
895 FastIS->recomputeInsertPt();
Dan Gohman20d4be12010-07-01 02:58:57 +0000896
Dan Gohman21c14e32010-01-12 04:32:35 +0000897 // Try to select the instruction with FastISel.
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000898 if (FastIS->SelectInstruction(Inst)) {
Jim Grosbach62427ae2011-05-16 21:51:07 +0000899 ++NumFastIselSuccess;
Chris Lattnerb686af02011-04-22 21:59:37 +0000900 // If fast isel succeeded, skip over all the folded instructions, and
901 // then see if there is a load right before the selected instructions.
902 // Try to fold the load if so.
903 const Instruction *BeforeInst = Inst;
904 while (BeforeInst != Begin) {
905 BeforeInst = llvm::prior(BasicBlock::const_iterator(BeforeInst));
906 if (!isFoldedOrDeadInstruction(BeforeInst, FuncInfo))
907 break;
908 }
909 if (BeforeInst != Inst && isa<LoadInst>(BeforeInst) &&
910 BeforeInst->hasOneUse() &&
911 TryToFoldFastISelLoad(cast<LoadInst>(BeforeInst), Inst, FastIS))
912 // If we succeeded, don't re-select the load.
913 BI = llvm::next(BasicBlock::const_iterator(BeforeInst));
Dan Gohmana43abd12008-09-29 21:55:50 +0000914 continue;
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000915 }
Dan Gohmana43abd12008-09-29 21:55:50 +0000916
917 // Then handle certain instructions as single-LLVM-Instruction blocks.
Dan Gohman84023e02010-07-10 09:00:22 +0000918 if (isa<CallInst>(Inst)) {
Chris Lattnerc19ae9d2010-03-04 19:46:56 +0000919 ++NumFastIselFailures;
Dan Gohmana43abd12008-09-29 21:55:50 +0000920 if (EnableFastISelVerbose || EnableFastISelAbort) {
David Greene1a053232010-01-05 01:26:11 +0000921 dbgs() << "FastISel missed call: ";
Dan Gohman84023e02010-07-10 09:00:22 +0000922 Inst->dump();
Dan Gohmana43abd12008-09-29 21:55:50 +0000923 }
924
Dan Gohman84023e02010-07-10 09:00:22 +0000925 if (!Inst->getType()->isVoidTy() && !Inst->use_empty()) {
926 unsigned &R = FuncInfo->ValueMap[Inst];
Dan Gohmana43abd12008-09-29 21:55:50 +0000927 if (!R)
Dan Gohman84023e02010-07-10 09:00:22 +0000928 R = FuncInfo->CreateRegs(Inst->getType());
Dan Gohmana43abd12008-09-29 21:55:50 +0000929 }
930
Dan Gohmanb4afb132009-11-20 02:51:26 +0000931 bool HadTailCall = false;
Devang Pateldf8370b2010-10-25 21:31:46 +0000932 SelectBasicBlock(Inst, BI, HadTailCall);
Dan Gohmanb4afb132009-11-20 02:51:26 +0000933
934 // If the call was emitted as a tail call, we're done with the block.
935 if (HadTailCall) {
Dan Gohman84023e02010-07-10 09:00:22 +0000936 --BI;
Dan Gohmanb4afb132009-11-20 02:51:26 +0000937 break;
938 }
939
Dan Gohmana43abd12008-09-29 21:55:50 +0000940 continue;
Dan Gohmanf350b272008-08-23 02:25:05 +0000941 }
Dan Gohmana43abd12008-09-29 21:55:50 +0000942
Eli Friedman9c4dae62011-05-17 23:02:10 +0000943 if (isa<TerminatorInst>(Inst) && !isa<BranchInst>(Inst)) {
944 // Don't abort, and use a different message for terminator misses.
945 ++NumFastIselFailures;
946 if (EnableFastISelVerbose || EnableFastISelAbort) {
947 dbgs() << "FastISel missed terminator: ";
948 Inst->dump();
949 }
950 } else {
Chris Lattnerc19ae9d2010-03-04 19:46:56 +0000951 ++NumFastIselFailures;
Dan Gohmana43abd12008-09-29 21:55:50 +0000952 if (EnableFastISelVerbose || EnableFastISelAbort) {
David Greene1a053232010-01-05 01:26:11 +0000953 dbgs() << "FastISel miss: ";
Dan Gohman84023e02010-07-10 09:00:22 +0000954 Inst->dump();
Dan Gohmana43abd12008-09-29 21:55:50 +0000955 }
956 if (EnableFastISelAbort)
957 // The "fast" selector couldn't handle something and bailed.
958 // For the purpose of debugging, just abort.
Torok Edwinc23197a2009-07-14 16:55:14 +0000959 llvm_unreachable("FastISel didn't select the entire block");
Dan Gohmana43abd12008-09-29 21:55:50 +0000960 }
961 break;
Dan Gohmanf350b272008-08-23 02:25:05 +0000962 }
Dan Gohman84023e02010-07-10 09:00:22 +0000963
964 FastIS->recomputeInsertPt();
Dan Gohmanf350b272008-08-23 02:25:05 +0000965 }
966
Devang Pateldf8370b2010-10-25 21:31:46 +0000967 if (Begin != BI)
968 ++NumDAGBlocks;
969 else
970 ++NumFastIselBlocks;
971
Eli Friedman37d38bf2011-04-19 17:01:08 +0000972 if (Begin != BI) {
973 // Run SelectionDAG instruction selection on the remainder of the block
974 // not handled by FastISel. If FastISel is not run, this is the entire
975 // block.
976 bool HadTailCall;
977 SelectBasicBlock(Begin, BI, HadTailCall);
978 }
Dan Gohmanf350b272008-08-23 02:25:05 +0000979
Dan Gohman84023e02010-07-10 09:00:22 +0000980 FinishBasicBlock();
Dan Gohman620427d2010-04-22 19:55:20 +0000981 FuncInfo->PHINodesToUpdate.clear();
Evan Cheng39fd6e82008-08-07 00:43:25 +0000982 }
Dan Gohmana43abd12008-09-29 21:55:50 +0000983
984 delete FastIS;
Devang Patel23385752011-05-23 17:44:13 +0000985 SDB->clearDanglingDebugInfo();
Dan Gohman0e5f1302008-07-07 23:02:41 +0000986}
987
Dan Gohmanfed90b62008-07-28 21:51:04 +0000988void
Dan Gohman84023e02010-07-10 09:00:22 +0000989SelectionDAGISel::FinishBasicBlock() {
Dan Gohmanf350b272008-08-23 02:25:05 +0000990
David Greene1a053232010-01-05 01:26:11 +0000991 DEBUG(dbgs() << "Total amount of phi nodes to update: "
Dan Gohman927f8662010-06-18 16:00:29 +0000992 << FuncInfo->PHINodesToUpdate.size() << "\n";
993 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i)
David Greene1a053232010-01-05 01:26:11 +0000994 dbgs() << "Node " << i << " : ("
Dan Gohman620427d2010-04-22 19:55:20 +0000995 << FuncInfo->PHINodesToUpdate[i].first
996 << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n");
Daniel Dunbara279bc32009-09-20 02:20:51 +0000997
Chris Lattnera33ef482005-03-30 01:10:47 +0000998 // Next, now that we know what the last MBB the LLVM BB expanded is, update
Chris Lattner1c08c712005-01-07 07:47:53 +0000999 // PHI nodes in successors.
Dan Gohman2048b852009-11-23 18:04:58 +00001000 if (SDB->SwitchCases.empty() &&
1001 SDB->JTCases.empty() &&
1002 SDB->BitTestCases.empty()) {
Dan Gohman620427d2010-04-22 19:55:20 +00001003 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
1004 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
Chris Lattner518bb532010-02-09 19:54:29 +00001005 assert(PHI->isPHI() &&
Nate Begemanf15485a2006-03-27 01:32:24 +00001006 "This is not a machine PHI node that we are updating!");
Dan Gohman84023e02010-07-10 09:00:22 +00001007 if (!FuncInfo->MBB->isSuccessor(PHI->getParent()))
Jakob Stoklund Olesen580bba22010-03-05 21:49:10 +00001008 continue;
Dan Gohman620427d2010-04-22 19:55:20 +00001009 PHI->addOperand(
1010 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
Dan Gohman84023e02010-07-10 09:00:22 +00001011 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Nate Begemanf15485a2006-03-27 01:32:24 +00001012 }
1013 return;
Chris Lattner1c08c712005-01-07 07:47:53 +00001014 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001015
Dan Gohman2048b852009-11-23 18:04:58 +00001016 for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001017 // Lower header first, if it wasn't already lowered
Dan Gohman2048b852009-11-23 18:04:58 +00001018 if (!SDB->BitTestCases[i].Emitted) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001019 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001020 FuncInfo->MBB = SDB->BitTestCases[i].Parent;
1021 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001022 // Emit the code
Dan Gohman84023e02010-07-10 09:00:22 +00001023 SDB->visitBitTestHeader(SDB->BitTestCases[i], FuncInfo->MBB);
Dan Gohman2048b852009-11-23 18:04:58 +00001024 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +00001025 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001026 CodeGenAndEmitDAG();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001027 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001028
Dan Gohman2048b852009-11-23 18:04:58 +00001029 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001030 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001031 FuncInfo->MBB = SDB->BitTestCases[i].Cases[j].ThisBB;
1032 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001033 // Emit the code
1034 if (j+1 != ej)
Evan Chengd08e5b42011-01-06 01:02:44 +00001035 SDB->visitBitTestCase(SDB->BitTestCases[i],
1036 SDB->BitTestCases[i].Cases[j+1].ThisBB,
Dan Gohman2048b852009-11-23 18:04:58 +00001037 SDB->BitTestCases[i].Reg,
Dan Gohman99be8ae2010-04-19 22:41:47 +00001038 SDB->BitTestCases[i].Cases[j],
Dan Gohman84023e02010-07-10 09:00:22 +00001039 FuncInfo->MBB);
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001040 else
Evan Chengd08e5b42011-01-06 01:02:44 +00001041 SDB->visitBitTestCase(SDB->BitTestCases[i],
1042 SDB->BitTestCases[i].Default,
Dan Gohman2048b852009-11-23 18:04:58 +00001043 SDB->BitTestCases[i].Reg,
Dan Gohman99be8ae2010-04-19 22:41:47 +00001044 SDB->BitTestCases[i].Cases[j],
Dan Gohman84023e02010-07-10 09:00:22 +00001045 FuncInfo->MBB);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001046
1047
Dan Gohman2048b852009-11-23 18:04:58 +00001048 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +00001049 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001050 CodeGenAndEmitDAG();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001051 }
1052
1053 // Update PHI Nodes
Dan Gohman620427d2010-04-22 19:55:20 +00001054 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
1055 pi != pe; ++pi) {
1056 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001057 MachineBasicBlock *PHIBB = PHI->getParent();
Chris Lattner518bb532010-02-09 19:54:29 +00001058 assert(PHI->isPHI() &&
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001059 "This is not a machine PHI node that we are updating!");
1060 // This is "default" BB. We have two jumps to it. From "header" BB and
1061 // from last "case" BB.
Dan Gohman2048b852009-11-23 18:04:58 +00001062 if (PHIBB == SDB->BitTestCases[i].Default) {
Jim Grosbachf4549b02010-01-15 00:36:15 +00001063 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001064 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1065 false));
Dan Gohman2048b852009-11-23 18:04:58 +00001066 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent));
Jim Grosbachf4549b02010-01-15 00:36:15 +00001067 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001068 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1069 false));
Dan Gohman2048b852009-11-23 18:04:58 +00001070 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases.
Chris Lattner9ce2e9d2007-12-30 00:57:42 +00001071 back().ThisBB));
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001072 }
1073 // One of "cases" BB.
Dan Gohman2048b852009-11-23 18:04:58 +00001074 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size();
Dan Gohman7c3234c2008-08-27 23:52:12 +00001075 j != ej; ++j) {
Dan Gohman2048b852009-11-23 18:04:58 +00001076 MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB;
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001077 if (cBB->isSuccessor(PHIBB)) {
Jim Grosbachf4549b02010-01-15 00:36:15 +00001078 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001079 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1080 false));
Chris Lattner9ce2e9d2007-12-30 00:57:42 +00001081 PHI->addOperand(MachineOperand::CreateMBB(cBB));
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001082 }
1083 }
1084 }
1085 }
Dan Gohman2048b852009-11-23 18:04:58 +00001086 SDB->BitTestCases.clear();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001087
Nate Begeman9453eea2006-04-23 06:26:20 +00001088 // If the JumpTable record is filled in, then we need to emit a jump table.
1089 // Updating the PHI nodes is tricky in this case, since we need to determine
1090 // whether the PHI is a successor of the range check MBB or the jump table MBB
Dan Gohman2048b852009-11-23 18:04:58 +00001091 for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) {
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +00001092 // Lower header first, if it wasn't already lowered
Dan Gohman2048b852009-11-23 18:04:58 +00001093 if (!SDB->JTCases[i].first.Emitted) {
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +00001094 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001095 FuncInfo->MBB = SDB->JTCases[i].first.HeaderBB;
1096 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +00001097 // Emit the code
Dan Gohman99be8ae2010-04-19 22:41:47 +00001098 SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first,
Dan Gohman84023e02010-07-10 09:00:22 +00001099 FuncInfo->MBB);
Dan Gohman2048b852009-11-23 18:04:58 +00001100 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +00001101 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001102 CodeGenAndEmitDAG();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001103 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001104
Nate Begeman37efe672006-04-22 18:53:45 +00001105 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001106 FuncInfo->MBB = SDB->JTCases[i].second.MBB;
1107 FuncInfo->InsertPt = FuncInfo->MBB->end();
Nate Begeman37efe672006-04-22 18:53:45 +00001108 // Emit the code
Dan Gohman2048b852009-11-23 18:04:58 +00001109 SDB->visitJumpTable(SDB->JTCases[i].second);
1110 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +00001111 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001112 CodeGenAndEmitDAG();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001113
Nate Begeman37efe672006-04-22 18:53:45 +00001114 // Update PHI Nodes
Dan Gohman620427d2010-04-22 19:55:20 +00001115 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
1116 pi != pe; ++pi) {
1117 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
Nate Begeman37efe672006-04-22 18:53:45 +00001118 MachineBasicBlock *PHIBB = PHI->getParent();
Chris Lattner518bb532010-02-09 19:54:29 +00001119 assert(PHI->isPHI() &&
Nate Begeman37efe672006-04-22 18:53:45 +00001120 "This is not a machine PHI node that we are updating!");
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001121 // "default" BB. We can go there only from header BB.
Dan Gohman2048b852009-11-23 18:04:58 +00001122 if (PHIBB == SDB->JTCases[i].second.Default) {
Evan Chengce319102009-09-19 09:51:03 +00001123 PHI->addOperand
Dan Gohman620427d2010-04-22 19:55:20 +00001124 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1125 false));
Evan Chengce319102009-09-19 09:51:03 +00001126 PHI->addOperand
Dan Gohman2048b852009-11-23 18:04:58 +00001127 (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB));
Nate Begemanf4360a42006-05-03 03:48:02 +00001128 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001129 // JT BB. Just iterate over successors here
Dan Gohman84023e02010-07-10 09:00:22 +00001130 if (FuncInfo->MBB->isSuccessor(PHIBB)) {
Evan Chengce319102009-09-19 09:51:03 +00001131 PHI->addOperand
Dan Gohman620427d2010-04-22 19:55:20 +00001132 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1133 false));
Dan Gohman84023e02010-07-10 09:00:22 +00001134 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Nate Begeman37efe672006-04-22 18:53:45 +00001135 }
1136 }
Nate Begeman37efe672006-04-22 18:53:45 +00001137 }
Dan Gohman2048b852009-11-23 18:04:58 +00001138 SDB->JTCases.clear();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001139
Chris Lattnerb2e806e2006-10-22 23:00:53 +00001140 // If the switch block involved a branch to one of the actual successors, we
1141 // need to update PHI nodes in that block.
Dan Gohman620427d2010-04-22 19:55:20 +00001142 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
1143 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
Chris Lattner518bb532010-02-09 19:54:29 +00001144 assert(PHI->isPHI() &&
Chris Lattnerb2e806e2006-10-22 23:00:53 +00001145 "This is not a machine PHI node that we are updating!");
Dan Gohman84023e02010-07-10 09:00:22 +00001146 if (FuncInfo->MBB->isSuccessor(PHI->getParent())) {
Dan Gohman620427d2010-04-22 19:55:20 +00001147 PHI->addOperand(
1148 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
Dan Gohman84023e02010-07-10 09:00:22 +00001149 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Chris Lattnerb2e806e2006-10-22 23:00:53 +00001150 }
1151 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001152
Nate Begemanf15485a2006-03-27 01:32:24 +00001153 // If we generated any switch lowering information, build and codegen any
1154 // additional DAGs necessary.
Dan Gohman2048b852009-11-23 18:04:58 +00001155 for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) {
Nate Begemanf15485a2006-03-27 01:32:24 +00001156 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohmanca5f6162011-01-14 22:26:16 +00001157 FuncInfo->MBB = SDB->SwitchCases[i].ThisBB;
Dan Gohman84023e02010-07-10 09:00:22 +00001158 FuncInfo->InsertPt = FuncInfo->MBB->end();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001159
Dan Gohman95140a42010-05-01 00:25:44 +00001160 // Determine the unique successors.
1161 SmallVector<MachineBasicBlock *, 2> Succs;
1162 Succs.push_back(SDB->SwitchCases[i].TrueBB);
1163 if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB)
1164 Succs.push_back(SDB->SwitchCases[i].FalseBB);
1165
Dan Gohmanca5f6162011-01-14 22:26:16 +00001166 // Emit the code. Note that this could result in FuncInfo->MBB being split.
Dan Gohman84023e02010-07-10 09:00:22 +00001167 SDB->visitSwitchCase(SDB->SwitchCases[i], FuncInfo->MBB);
Dan Gohman2048b852009-11-23 18:04:58 +00001168 CurDAG->setRoot(SDB->getRoot());
Dan Gohman95140a42010-05-01 00:25:44 +00001169 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001170 CodeGenAndEmitDAG();
Dan Gohmanca5f6162011-01-14 22:26:16 +00001171
1172 // Remember the last block, now that any splitting is done, for use in
1173 // populating PHI nodes in successors.
1174 MachineBasicBlock *ThisBB = FuncInfo->MBB;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001175
Chris Lattnerd5e93c02006-09-07 01:59:34 +00001176 // Handle any PHI nodes in successors of this chunk, as if we were coming
1177 // from the original BB before switch expansion. Note that PHI nodes can
1178 // occur multiple times in PHINodesToUpdate. We have to be very careful to
1179 // handle them the right number of times.
Dan Gohman95140a42010-05-01 00:25:44 +00001180 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
Dan Gohman84023e02010-07-10 09:00:22 +00001181 FuncInfo->MBB = Succs[i];
1182 FuncInfo->InsertPt = FuncInfo->MBB->end();
1183 // FuncInfo->MBB may have been removed from the CFG if a branch was
1184 // constant folded.
1185 if (ThisBB->isSuccessor(FuncInfo->MBB)) {
1186 for (MachineBasicBlock::iterator Phi = FuncInfo->MBB->begin();
1187 Phi != FuncInfo->MBB->end() && Phi->isPHI();
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001188 ++Phi) {
1189 // This value for this PHI node is recorded in PHINodesToUpdate.
1190 for (unsigned pn = 0; ; ++pn) {
Dan Gohman620427d2010-04-22 19:55:20 +00001191 assert(pn != FuncInfo->PHINodesToUpdate.size() &&
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001192 "Didn't find PHI entry!");
Dan Gohman620427d2010-04-22 19:55:20 +00001193 if (FuncInfo->PHINodesToUpdate[pn].first == Phi) {
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001194 Phi->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001195 CreateReg(FuncInfo->PHINodesToUpdate[pn].second,
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001196 false));
1197 Phi->addOperand(MachineOperand::CreateMBB(ThisBB));
1198 break;
1199 }
Evan Cheng8be58a12009-09-18 08:26:06 +00001200 }
Chris Lattnerd5e93c02006-09-07 01:59:34 +00001201 }
Nate Begemanf15485a2006-03-27 01:32:24 +00001202 }
1203 }
Chris Lattnera33ef482005-03-30 01:10:47 +00001204 }
Dan Gohman2048b852009-11-23 18:04:58 +00001205 SDB->SwitchCases.clear();
Chris Lattner1c08c712005-01-07 07:47:53 +00001206}
Evan Chenga9c20912006-01-21 02:32:06 +00001207
Jim Laskey13ec7022006-08-01 14:21:23 +00001208
Dan Gohman0a3776d2009-02-06 18:26:51 +00001209/// Create the scheduler. If a specific scheduler was specified
1210/// via the SchedulerRegistry, use it, otherwise select the
1211/// one preferred by the target.
Dan Gohman5e843682008-07-14 18:19:29 +00001212///
Dan Gohman47ac0f02009-02-11 04:27:20 +00001213ScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() {
Jim Laskeyeb577ba2006-08-02 12:30:23 +00001214 RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001215
Jim Laskey13ec7022006-08-01 14:21:23 +00001216 if (!Ctor) {
Jim Laskeyeb577ba2006-08-02 12:30:23 +00001217 Ctor = ISHeuristic;
Jim Laskey9373beb2006-08-01 19:14:14 +00001218 RegisterScheduler::setDefault(Ctor);
Evan Cheng4ef10862006-01-23 07:01:07 +00001219 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001220
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +00001221 return Ctor(this, OptLevel);
Evan Chenga9c20912006-01-21 02:32:06 +00001222}
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001223
Chris Lattner75548062006-10-11 03:58:02 +00001224//===----------------------------------------------------------------------===//
1225// Helper functions used by the generated instruction selector.
1226//===----------------------------------------------------------------------===//
1227// Calls to these methods are generated by tblgen.
1228
1229/// CheckAndMask - The isel is trying to match something like (and X, 255). If
1230/// the dag combiner simplified the 255, we still want to match. RHS is the
1231/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
1232/// specified in the .td file (e.g. 255).
Daniel Dunbara279bc32009-09-20 02:20:51 +00001233bool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS,
Dan Gohmandc9b3d02007-07-24 23:00:27 +00001234 int64_t DesiredMaskS) const {
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001235 const APInt &ActualMask = RHS->getAPIntValue();
1236 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001237
Chris Lattner75548062006-10-11 03:58:02 +00001238 // If the actual mask exactly matches, success!
1239 if (ActualMask == DesiredMask)
1240 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001241
Chris Lattner75548062006-10-11 03:58:02 +00001242 // If the actual AND mask is allowing unallowed bits, this doesn't match.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001243 if (ActualMask.intersects(~DesiredMask))
Chris Lattner75548062006-10-11 03:58:02 +00001244 return false;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001245
Chris Lattner75548062006-10-11 03:58:02 +00001246 // Otherwise, the DAG Combiner may have proven that the value coming in is
1247 // either already zero or is not demanded. Check for known zero input bits.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001248 APInt NeededMask = DesiredMask & ~ActualMask;
Dan Gohmanea859be2007-06-22 14:59:07 +00001249 if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
Chris Lattner75548062006-10-11 03:58:02 +00001250 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001251
Chris Lattner75548062006-10-11 03:58:02 +00001252 // TODO: check to see if missing bits are just not demanded.
1253
1254 // Otherwise, this pattern doesn't match.
1255 return false;
1256}
1257
1258/// CheckOrMask - The isel is trying to match something like (or X, 255). If
1259/// the dag combiner simplified the 255, we still want to match. RHS is the
1260/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
1261/// specified in the .td file (e.g. 255).
Daniel Dunbara279bc32009-09-20 02:20:51 +00001262bool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS,
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001263 int64_t DesiredMaskS) const {
1264 const APInt &ActualMask = RHS->getAPIntValue();
1265 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001266
Chris Lattner75548062006-10-11 03:58:02 +00001267 // If the actual mask exactly matches, success!
1268 if (ActualMask == DesiredMask)
1269 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001270
Chris Lattner75548062006-10-11 03:58:02 +00001271 // If the actual AND mask is allowing unallowed bits, this doesn't match.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001272 if (ActualMask.intersects(~DesiredMask))
Chris Lattner75548062006-10-11 03:58:02 +00001273 return false;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001274
Chris Lattner75548062006-10-11 03:58:02 +00001275 // Otherwise, the DAG Combiner may have proven that the value coming in is
1276 // either already zero or is not demanded. Check for known zero input bits.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001277 APInt NeededMask = DesiredMask & ~ActualMask;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001278
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001279 APInt KnownZero, KnownOne;
Dan Gohmanea859be2007-06-22 14:59:07 +00001280 CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001281
Chris Lattner75548062006-10-11 03:58:02 +00001282 // If all the missing bits in the or are already known to be set, match!
1283 if ((NeededMask & KnownOne) == NeededMask)
1284 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001285
Chris Lattner75548062006-10-11 03:58:02 +00001286 // TODO: check to see if missing bits are just not demanded.
Daniel Dunbara279bc32009-09-20 02:20:51 +00001287
Chris Lattner75548062006-10-11 03:58:02 +00001288 // Otherwise, this pattern doesn't match.
1289 return false;
1290}
1291
Jim Laskey9ff542f2006-08-01 18:29:48 +00001292
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001293/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
1294/// by tblgen. Others should not call it.
1295void SelectionDAGISel::
Dan Gohmanf350b272008-08-23 02:25:05 +00001296SelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) {
Dan Gohman475871a2008-07-27 21:46:04 +00001297 std::vector<SDValue> InOps;
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001298 std::swap(InOps, Ops);
1299
Chris Lattnerdecc2672010-04-07 05:20:54 +00001300 Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0
1301 Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1
1302 Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc
Evan Chengc36b7062011-01-07 23:50:32 +00001303 Ops.push_back(InOps[InlineAsm::Op_ExtraInfo]); // 3 (SideEffect, AlignStack)
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001304
Chris Lattnerdecc2672010-04-07 05:20:54 +00001305 unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size();
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001306 if (InOps[e-1].getValueType() == MVT::Glue)
Chris Lattnera4359be2010-12-23 17:13:18 +00001307 --e; // Don't process a glue operand if it is here.
Daniel Dunbara279bc32009-09-20 02:20:51 +00001308
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001309 while (i != e) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00001310 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue();
Chris Lattnerdecc2672010-04-07 05:20:54 +00001311 if (!InlineAsm::isMemKind(Flags)) {
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001312 // Just skip over this operand, copying the operands verbatim.
Evan Cheng697cbbf2009-03-20 18:03:34 +00001313 Ops.insert(Ops.end(), InOps.begin()+i,
1314 InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1);
1315 i += InlineAsm::getNumOperandRegisters(Flags) + 1;
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001316 } else {
Evan Cheng697cbbf2009-03-20 18:03:34 +00001317 assert(InlineAsm::getNumOperandRegisters(Flags) == 1 &&
1318 "Memory operand with multiple values?");
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001319 // Otherwise, this is a memory operand. Ask the target to select it.
Dan Gohman475871a2008-07-27 21:46:04 +00001320 std::vector<SDValue> SelOps;
Chris Lattnerdecc2672010-04-07 05:20:54 +00001321 if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps))
Chris Lattner75361b62010-04-07 22:58:41 +00001322 report_fatal_error("Could not match memory address. Inline asm"
Chris Lattner87d677c2010-04-07 23:50:38 +00001323 " failure!");
Daniel Dunbara279bc32009-09-20 02:20:51 +00001324
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001325 // Add this to the output node.
Chris Lattnerdecc2672010-04-07 05:20:54 +00001326 unsigned NewFlags =
1327 InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size());
1328 Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32));
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001329 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
1330 i += 2;
1331 }
1332 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001333
Chris Lattnera4359be2010-12-23 17:13:18 +00001334 // Add the glue input back if present.
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001335 if (e != InOps.size())
1336 Ops.push_back(InOps.back());
1337}
Devang Patel794fd752007-05-01 21:15:47 +00001338
Chris Lattnera4359be2010-12-23 17:13:18 +00001339/// findGlueUse - Return use of MVT::Glue value produced by the specified
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001340/// SDNode.
1341///
Chris Lattnera4359be2010-12-23 17:13:18 +00001342static SDNode *findGlueUse(SDNode *N) {
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001343 unsigned FlagResNo = N->getNumValues()-1;
1344 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
1345 SDUse &Use = I.getUse();
1346 if (Use.getResNo() == FlagResNo)
1347 return Use.getUser();
1348 }
1349 return NULL;
1350}
1351
1352/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def".
1353/// This function recursively traverses up the operand chain, ignoring
1354/// certain nodes.
1355static bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse,
Chris Lattnerd1b73822010-03-02 22:20:06 +00001356 SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited,
1357 bool IgnoreChains) {
Chris Lattnerda244a02010-02-23 19:32:27 +00001358 // The NodeID's are given uniques ID's where a node ID is guaranteed to be
1359 // greater than all of its (recursive) operands. If we scan to a point where
1360 // 'use' is smaller than the node we're scanning for, then we know we will
1361 // never find it.
1362 //
1363 // The Use may be -1 (unassigned) if it is a newly allocated node. This can
Chris Lattnera4359be2010-12-23 17:13:18 +00001364 // happen because we scan down to newly selected nodes in the case of glue
Chris Lattnerda244a02010-02-23 19:32:27 +00001365 // uses.
1366 if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1))
1367 return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001368
Chris Lattnerda244a02010-02-23 19:32:27 +00001369 // Don't revisit nodes if we already scanned it and didn't fail, we know we
1370 // won't fail if we scan it again.
1371 if (!Visited.insert(Use))
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001372 return false;
1373
1374 for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {
Chris Lattnerd1b73822010-03-02 22:20:06 +00001375 // Ignore chain uses, they are validated by HandleMergeInputChains.
1376 if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains)
1377 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001378
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001379 SDNode *N = Use->getOperand(i).getNode();
1380 if (N == Def) {
1381 if (Use == ImmedUse || Use == Root)
1382 continue; // We are not looking for immediate use.
1383 assert(N != Root);
1384 return true;
1385 }
1386
1387 // Traverse up the operand chain.
Chris Lattnerd1b73822010-03-02 22:20:06 +00001388 if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001389 return true;
1390 }
1391 return false;
1392}
1393
Evan Cheng014bf212010-02-15 19:41:07 +00001394/// IsProfitableToFold - Returns true if it's profitable to fold the specific
1395/// operand node N of U during instruction selection that starts at Root.
1396bool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U,
1397 SDNode *Root) const {
1398 if (OptLevel == CodeGenOpt::None) return false;
1399 return N.hasOneUse();
1400}
1401
1402/// IsLegalToFold - Returns true if the specific operand node N of
1403/// U can be folded during instruction selection that starts at Root.
Chris Lattnerd1b73822010-03-02 22:20:06 +00001404bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
Dan Gohmand858e902010-04-17 15:26:15 +00001405 CodeGenOpt::Level OptLevel,
1406 bool IgnoreChains) {
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001407 if (OptLevel == CodeGenOpt::None) return false;
1408
1409 // If Root use can somehow reach N through a path that that doesn't contain
1410 // U then folding N would create a cycle. e.g. In the following
1411 // diagram, Root can reach N through X. If N is folded into into Root, then
1412 // X is both a predecessor and a successor of U.
1413 //
1414 // [N*] //
1415 // ^ ^ //
1416 // / \ //
1417 // [U*] [X]? //
1418 // ^ ^ //
1419 // \ / //
1420 // \ / //
1421 // [Root*] //
1422 //
1423 // * indicates nodes to be folded together.
1424 //
Chris Lattnera4359be2010-12-23 17:13:18 +00001425 // If Root produces glue, then it gets (even more) interesting. Since it
1426 // will be "glued" together with its glue use in the scheduler, we need to
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001427 // check if it might reach N.
1428 //
1429 // [N*] //
1430 // ^ ^ //
1431 // / \ //
1432 // [U*] [X]? //
1433 // ^ ^ //
1434 // \ \ //
1435 // \ | //
1436 // [Root*] | //
1437 // ^ | //
1438 // f | //
1439 // | / //
1440 // [Y] / //
1441 // ^ / //
1442 // f / //
1443 // | / //
Chris Lattnera4359be2010-12-23 17:13:18 +00001444 // [GU] //
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001445 //
Chris Lattnera4359be2010-12-23 17:13:18 +00001446 // If GU (glue use) indirectly reaches N (the load), and Root folds N
1447 // (call it Fold), then X is a predecessor of GU and a successor of
1448 // Fold. But since Fold and GU are glued together, this will create
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001449 // a cycle in the scheduling graph.
1450
Chris Lattnera4359be2010-12-23 17:13:18 +00001451 // If the node has glue, walk down the graph to the "lowest" node in the
1452 // glueged set.
Owen Andersone50ed302009-08-10 22:56:29 +00001453 EVT VT = Root->getValueType(Root->getNumValues()-1);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001454 while (VT == MVT::Glue) {
Chris Lattnera4359be2010-12-23 17:13:18 +00001455 SDNode *GU = findGlueUse(Root);
1456 if (GU == NULL)
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001457 break;
Chris Lattnera4359be2010-12-23 17:13:18 +00001458 Root = GU;
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001459 VT = Root->getValueType(Root->getNumValues()-1);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001460
Chris Lattnera4359be2010-12-23 17:13:18 +00001461 // If our query node has a glue result with a use, we've walked up it. If
Chris Lattner18fdaba2010-03-05 06:19:13 +00001462 // the user (which has already been selected) has a chain or indirectly uses
1463 // the chain, our WalkChainUsers predicate will not consider it. Because of
1464 // this, we cannot ignore chains in this predicate.
1465 IgnoreChains = false;
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001466 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001467
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001468
Chris Lattner9bbcd5e2010-03-05 05:49:45 +00001469 SmallPtrSet<SDNode*, 16> Visited;
1470 return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains);
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001471}
1472
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001473SDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) {
1474 std::vector<SDValue> Ops(N->op_begin(), N->op_end());
Dan Gohmane1f188f2009-10-29 22:30:23 +00001475 SelectInlineAsmMemoryOperands(Ops);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001476
Dan Gohmane1f188f2009-10-29 22:30:23 +00001477 std::vector<EVT> VTs;
1478 VTs.push_back(MVT::Other);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001479 VTs.push_back(MVT::Glue);
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001480 SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(),
Dan Gohmane1f188f2009-10-29 22:30:23 +00001481 VTs, &Ops[0], Ops.size());
Chris Lattnerd1b73822010-03-02 22:20:06 +00001482 New->setNodeId(-1);
Dan Gohmane1f188f2009-10-29 22:30:23 +00001483 return New.getNode();
1484}
1485
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001486SDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) {
Chris Lattner518bb532010-02-09 19:54:29 +00001487 return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0));
Dan Gohmane1f188f2009-10-29 22:30:23 +00001488}
1489
Chris Lattner2a49d572010-02-28 22:37:22 +00001490/// GetVBR - decode a vbr encoding whose top bit is set.
Chandler Carruth19e57022010-10-23 08:40:19 +00001491LLVM_ATTRIBUTE_ALWAYS_INLINE static uint64_t
Chris Lattner2a49d572010-02-28 22:37:22 +00001492GetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) {
1493 assert(Val >= 128 && "Not a VBR");
1494 Val &= 127; // Remove first vbr bit.
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001495
Chris Lattner2a49d572010-02-28 22:37:22 +00001496 unsigned Shift = 7;
1497 uint64_t NextBits;
1498 do {
Chris Lattner14df8dc2010-02-28 22:38:43 +00001499 NextBits = MatcherTable[Idx++];
Chris Lattner2a49d572010-02-28 22:37:22 +00001500 Val |= (NextBits&127) << Shift;
1501 Shift += 7;
1502 } while (NextBits & 128);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001503
Chris Lattner2a49d572010-02-28 22:37:22 +00001504 return Val;
1505}
1506
Chris Lattner2a49d572010-02-28 22:37:22 +00001507
Chris Lattnera4359be2010-12-23 17:13:18 +00001508/// UpdateChainsAndGlue - When a match is complete, this method updates uses of
1509/// interior glue and chain results to use the new glue and chain results.
Chris Lattner82dd3d32010-03-02 07:50:03 +00001510void SelectionDAGISel::
Chris Lattnera4359be2010-12-23 17:13:18 +00001511UpdateChainsAndGlue(SDNode *NodeToMatch, SDValue InputChain,
1512 const SmallVectorImpl<SDNode*> &ChainNodesMatched,
1513 SDValue InputGlue,
1514 const SmallVectorImpl<SDNode*> &GlueResultNodesMatched,
1515 bool isMorphNodeTo) {
Chris Lattner82dd3d32010-03-02 07:50:03 +00001516 SmallVector<SDNode*, 4> NowDeadNodes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001517
Chris Lattner82dd3d32010-03-02 07:50:03 +00001518 ISelUpdater ISU(ISelPosition);
1519
Chris Lattner2a49d572010-02-28 22:37:22 +00001520 // Now that all the normal results are replaced, we replace the chain and
Chris Lattnera4359be2010-12-23 17:13:18 +00001521 // glue results if present.
Chris Lattner2a49d572010-02-28 22:37:22 +00001522 if (!ChainNodesMatched.empty()) {
1523 assert(InputChain.getNode() != 0 &&
1524 "Matched input chains but didn't produce a chain");
1525 // Loop over all of the nodes we matched that produced a chain result.
1526 // Replace all the chain results with the final chain we ended up with.
1527 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1528 SDNode *ChainNode = ChainNodesMatched[i];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001529
Chris Lattner82dd3d32010-03-02 07:50:03 +00001530 // If this node was already deleted, don't look at it.
1531 if (ChainNode->getOpcode() == ISD::DELETED_NODE)
1532 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001533
Chris Lattner2a49d572010-02-28 22:37:22 +00001534 // Don't replace the results of the root node if we're doing a
1535 // MorphNodeTo.
1536 if (ChainNode == NodeToMatch && isMorphNodeTo)
1537 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001538
Chris Lattner2a49d572010-02-28 22:37:22 +00001539 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001540 if (ChainVal.getValueType() == MVT::Glue)
Chris Lattner2a49d572010-02-28 22:37:22 +00001541 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
1542 assert(ChainVal.getValueType() == MVT::Other && "Not a chain?");
Chris Lattner82dd3d32010-03-02 07:50:03 +00001543 CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001544
Chris Lattner856fb392010-03-28 05:28:31 +00001545 // If the node became dead and we haven't already seen it, delete it.
1546 if (ChainNode->use_empty() &&
1547 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode))
Chris Lattner82dd3d32010-03-02 07:50:03 +00001548 NowDeadNodes.push_back(ChainNode);
Chris Lattner2a49d572010-02-28 22:37:22 +00001549 }
1550 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001551
Chris Lattnera4359be2010-12-23 17:13:18 +00001552 // If the result produces glue, update any glue results in the matched
1553 // pattern with the glue result.
1554 if (InputGlue.getNode() != 0) {
Chris Lattner2a49d572010-02-28 22:37:22 +00001555 // Handle any interior nodes explicitly marked.
Chris Lattnera4359be2010-12-23 17:13:18 +00001556 for (unsigned i = 0, e = GlueResultNodesMatched.size(); i != e; ++i) {
1557 SDNode *FRN = GlueResultNodesMatched[i];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001558
Chris Lattner82dd3d32010-03-02 07:50:03 +00001559 // If this node was already deleted, don't look at it.
1560 if (FRN->getOpcode() == ISD::DELETED_NODE)
1561 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001562
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001563 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue &&
Chris Lattnera4359be2010-12-23 17:13:18 +00001564 "Doesn't have a glue result");
Chris Lattner2a49d572010-02-28 22:37:22 +00001565 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1),
Chris Lattnera4359be2010-12-23 17:13:18 +00001566 InputGlue, &ISU);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001567
Chris Lattner19e37cb2010-03-28 04:54:33 +00001568 // If the node became dead and we haven't already seen it, delete it.
1569 if (FRN->use_empty() &&
1570 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN))
Chris Lattner82dd3d32010-03-02 07:50:03 +00001571 NowDeadNodes.push_back(FRN);
Chris Lattner2a49d572010-02-28 22:37:22 +00001572 }
1573 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001574
Chris Lattner82dd3d32010-03-02 07:50:03 +00001575 if (!NowDeadNodes.empty())
1576 CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001577
Chris Lattner2a49d572010-02-28 22:37:22 +00001578 DEBUG(errs() << "ISEL: Match complete!\n");
1579}
1580
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001581enum ChainResult {
1582 CR_Simple,
1583 CR_InducesCycle,
1584 CR_LeadsToInteriorNode
1585};
1586
1587/// WalkChainUsers - Walk down the users of the specified chained node that is
1588/// part of the pattern we're matching, looking at all of the users we find.
1589/// This determines whether something is an interior node, whether we have a
1590/// non-pattern node in between two pattern nodes (which prevent folding because
1591/// it would induce a cycle) and whether we have a TokenFactor node sandwiched
1592/// between pattern nodes (in which case the TF becomes part of the pattern).
1593///
1594/// The walk we do here is guaranteed to be small because we quickly get down to
1595/// already selected nodes "below" us.
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001596static ChainResult
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001597WalkChainUsers(SDNode *ChainedNode,
1598 SmallVectorImpl<SDNode*> &ChainedNodesInPattern,
1599 SmallVectorImpl<SDNode*> &InteriorChainedNodes) {
1600 ChainResult Result = CR_Simple;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001601
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001602 for (SDNode::use_iterator UI = ChainedNode->use_begin(),
1603 E = ChainedNode->use_end(); UI != E; ++UI) {
1604 // Make sure the use is of the chain, not some other value we produce.
1605 if (UI.getUse().getValueType() != MVT::Other) continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001606
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001607 SDNode *User = *UI;
1608
1609 // If we see an already-selected machine node, then we've gone beyond the
1610 // pattern that we're selecting down into the already selected chunk of the
1611 // DAG.
1612 if (User->isMachineOpcode() ||
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001613 User->getOpcode() == ISD::HANDLENODE) // Root of the graph.
1614 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001615
Chris Lattnerd1b73822010-03-02 22:20:06 +00001616 if (User->getOpcode() == ISD::CopyToReg ||
1617 User->getOpcode() == ISD::CopyFromReg ||
Chris Lattner7561d482010-03-14 02:33:54 +00001618 User->getOpcode() == ISD::INLINEASM ||
1619 User->getOpcode() == ISD::EH_LABEL) {
Chris Lattnerd1b73822010-03-02 22:20:06 +00001620 // If their node ID got reset to -1 then they've already been selected.
1621 // Treat them like a MachineOpcode.
1622 if (User->getNodeId() == -1)
1623 continue;
1624 }
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001625
1626 // If we have a TokenFactor, we handle it specially.
1627 if (User->getOpcode() != ISD::TokenFactor) {
1628 // If the node isn't a token factor and isn't part of our pattern, then it
1629 // must be a random chained node in between two nodes we're selecting.
1630 // This happens when we have something like:
1631 // x = load ptr
1632 // call
1633 // y = x+4
1634 // store y -> ptr
1635 // Because we structurally match the load/store as a read/modify/write,
1636 // but the call is chained between them. We cannot fold in this case
1637 // because it would induce a cycle in the graph.
1638 if (!std::count(ChainedNodesInPattern.begin(),
1639 ChainedNodesInPattern.end(), User))
1640 return CR_InducesCycle;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001641
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001642 // Otherwise we found a node that is part of our pattern. For example in:
1643 // x = load ptr
1644 // y = x+4
1645 // store y -> ptr
1646 // This would happen when we're scanning down from the load and see the
1647 // store as a user. Record that there is a use of ChainedNode that is
1648 // part of the pattern and keep scanning uses.
1649 Result = CR_LeadsToInteriorNode;
1650 InteriorChainedNodes.push_back(User);
1651 continue;
1652 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001653
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001654 // If we found a TokenFactor, there are two cases to consider: first if the
1655 // TokenFactor is just hanging "below" the pattern we're matching (i.e. no
1656 // uses of the TF are in our pattern) we just want to ignore it. Second,
1657 // the TokenFactor can be sandwiched in between two chained nodes, like so:
1658 // [Load chain]
1659 // ^
1660 // |
1661 // [Load]
1662 // ^ ^
1663 // | \ DAG's like cheese
1664 // / \ do you?
1665 // / |
1666 // [TokenFactor] [Op]
1667 // ^ ^
1668 // | |
1669 // \ /
1670 // \ /
1671 // [Store]
1672 //
1673 // In this case, the TokenFactor becomes part of our match and we rewrite it
1674 // as a new TokenFactor.
1675 //
1676 // To distinguish these two cases, do a recursive walk down the uses.
1677 switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) {
1678 case CR_Simple:
1679 // If the uses of the TokenFactor are just already-selected nodes, ignore
1680 // it, it is "below" our pattern.
1681 continue;
1682 case CR_InducesCycle:
1683 // If the uses of the TokenFactor lead to nodes that are not part of our
1684 // pattern that are not selected, folding would turn this into a cycle,
1685 // bail out now.
1686 return CR_InducesCycle;
1687 case CR_LeadsToInteriorNode:
1688 break; // Otherwise, keep processing.
1689 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001690
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001691 // Okay, we know we're in the interesting interior case. The TokenFactor
1692 // is now going to be considered part of the pattern so that we rewrite its
1693 // uses (it may have uses that are not part of the pattern) with the
1694 // ultimate chain result of the generated code. We will also add its chain
1695 // inputs as inputs to the ultimate TokenFactor we create.
1696 Result = CR_LeadsToInteriorNode;
1697 ChainedNodesInPattern.push_back(User);
1698 InteriorChainedNodes.push_back(User);
1699 continue;
1700 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001701
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001702 return Result;
1703}
1704
Chris Lattner6b307922010-03-02 00:00:03 +00001705/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains
Chris Lattner00592ec2010-03-02 19:34:59 +00001706/// operation for when the pattern matched at least one node with a chains. The
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001707/// input vector contains a list of all of the chained nodes that we match. We
1708/// must determine if this is a valid thing to cover (i.e. matching it won't
1709/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will
1710/// be used as the input node chain for the generated nodes.
Chris Lattner6b307922010-03-02 00:00:03 +00001711static SDValue
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001712HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
Chris Lattner6b307922010-03-02 00:00:03 +00001713 SelectionDAG *CurDAG) {
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001714 // Walk all of the chained nodes we've matched, recursively scanning down the
1715 // users of the chain result. This adds any TokenFactor nodes that are caught
1716 // in between chained nodes to the chained and interior nodes list.
1717 SmallVector<SDNode*, 3> InteriorChainedNodes;
1718 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1719 if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
1720 InteriorChainedNodes) == CR_InducesCycle)
1721 return SDValue(); // Would induce a cycle.
1722 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001723
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001724 // Okay, we have walked all the matched nodes and collected TokenFactor nodes
1725 // that we are interested in. Form our input TokenFactor node.
Chris Lattner6b307922010-03-02 00:00:03 +00001726 SmallVector<SDValue, 3> InputChains;
1727 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001728 // Add the input chain of this node to the InputChains list (which will be
1729 // the operands of the generated TokenFactor) if it's not an interior node.
1730 SDNode *N = ChainNodesMatched[i];
1731 if (N->getOpcode() != ISD::TokenFactor) {
1732 if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N))
1733 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001734
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001735 // Otherwise, add the input chain.
1736 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
1737 assert(InChain.getValueType() == MVT::Other && "Not a chain");
Chris Lattner6b307922010-03-02 00:00:03 +00001738 InputChains.push_back(InChain);
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001739 continue;
1740 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001741
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001742 // If we have a token factor, we want to add all inputs of the token factor
1743 // that are not part of the pattern we're matching.
1744 for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) {
1745 if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
Chris Lattner6183fbd2010-03-02 02:37:23 +00001746 N->getOperand(op).getNode()))
1747 InputChains.push_back(N->getOperand(op));
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001748 }
Chris Lattner6b307922010-03-02 00:00:03 +00001749 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001750
Chris Lattner6b307922010-03-02 00:00:03 +00001751 SDValue Res;
1752 if (InputChains.size() == 1)
1753 return InputChains[0];
1754 return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(),
1755 MVT::Other, &InputChains[0], InputChains.size());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001756}
Chris Lattner2a49d572010-02-28 22:37:22 +00001757
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001758/// MorphNode - Handle morphing a node in place for the selector.
1759SDNode *SelectionDAGISel::
1760MorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList,
1761 const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) {
1762 // It is possible we're using MorphNodeTo to replace a node with no
1763 // normal results with one that has a normal result (or we could be
Chris Lattnera4359be2010-12-23 17:13:18 +00001764 // adding a chain) and the input could have glue and chains as well.
Chris Lattnercaa88702010-03-28 08:43:23 +00001765 // In this case we need to shift the operands down.
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001766 // FIXME: This is a horrible hack and broken in obscure cases, no worse
Chris Lattnera6f86932010-03-27 18:54:50 +00001767 // than the old isel though.
Chris Lattnera4359be2010-12-23 17:13:18 +00001768 int OldGlueResultNo = -1, OldChainResultNo = -1;
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001769
1770 unsigned NTMNumResults = Node->getNumValues();
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001771 if (Node->getValueType(NTMNumResults-1) == MVT::Glue) {
Chris Lattnera4359be2010-12-23 17:13:18 +00001772 OldGlueResultNo = NTMNumResults-1;
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001773 if (NTMNumResults != 1 &&
1774 Node->getValueType(NTMNumResults-2) == MVT::Other)
1775 OldChainResultNo = NTMNumResults-2;
1776 } else if (Node->getValueType(NTMNumResults-1) == MVT::Other)
1777 OldChainResultNo = NTMNumResults-1;
1778
Chris Lattner61c97f62010-03-02 07:14:49 +00001779 // Call the underlying SelectionDAG routine to do the transmogrification. Note
1780 // that this deletes operands of the old node that become dead.
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001781 SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps);
1782
1783 // MorphNodeTo can operate in two ways: if an existing node with the
1784 // specified operands exists, it can just return it. Otherwise, it
1785 // updates the node in place to have the requested operands.
1786 if (Res == Node) {
1787 // If we updated the node in place, reset the node ID. To the isel,
1788 // this should be just like a newly allocated machine node.
1789 Res->setNodeId(-1);
1790 }
1791
1792 unsigned ResNumResults = Res->getNumValues();
Chris Lattnera4359be2010-12-23 17:13:18 +00001793 // Move the glue if needed.
1794 if ((EmitNodeInfo & OPFL_GlueOutput) && OldGlueResultNo != -1 &&
1795 (unsigned)OldGlueResultNo != ResNumResults-1)
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001796 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldGlueResultNo),
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001797 SDValue(Res, ResNumResults-1));
1798
Chris Lattnera4359be2010-12-23 17:13:18 +00001799 if ((EmitNodeInfo & OPFL_GlueOutput) != 0)
Bill Wendlingd9cb7ca2010-07-04 08:58:43 +00001800 --ResNumResults;
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001801
1802 // Move the chain reference if needed.
1803 if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 &&
1804 (unsigned)OldChainResultNo != ResNumResults-1)
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001805 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo),
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001806 SDValue(Res, ResNumResults-1));
1807
1808 // Otherwise, no replacement happened because the node already exists. Replace
1809 // Uses of the old node with the new one.
1810 if (Res != Node)
1811 CurDAG->ReplaceAllUsesWith(Node, Res);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001812
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001813 return Res;
1814}
1815
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001816/// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
Chandler Carruth19e57022010-10-23 08:40:19 +00001817LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001818CheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex,
Chris Lattnerd847bc22010-09-21 22:00:25 +00001819 SDValue N,
1820 const SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
Chris Lattnerda828e32010-03-03 07:46:25 +00001821 // Accept if it is exactly the same as a previously recorded node.
1822 unsigned RecNo = MatcherTable[MatcherIndex++];
1823 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00001824 return N == RecordedNodes[RecNo].first;
Chris Lattnerda828e32010-03-03 07:46:25 +00001825}
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001826
Chris Lattnerda828e32010-03-03 07:46:25 +00001827/// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
Chandler Carruth19e57022010-10-23 08:40:19 +00001828LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001829CheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1830 SelectionDAGISel &SDISel) {
1831 return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]);
1832}
1833
1834/// CheckNodePredicate - Implements OP_CheckNodePredicate.
Chandler Carruth19e57022010-10-23 08:40:19 +00001835LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001836CheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1837 SelectionDAGISel &SDISel, SDNode *N) {
1838 return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]);
1839}
1840
Chandler Carruth19e57022010-10-23 08:40:19 +00001841LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001842CheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1843 SDNode *N) {
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00001844 uint16_t Opc = MatcherTable[MatcherIndex++];
1845 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
1846 return N->getOpcode() == Opc;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001847}
1848
Chandler Carruth19e57022010-10-23 08:40:19 +00001849LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001850CheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1851 SDValue N, const TargetLowering &TLI) {
1852 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
1853 if (N.getValueType() == VT) return true;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001854
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001855 // Handle the case when VT is iPTR.
1856 return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy();
1857}
1858
Chandler Carruth19e57022010-10-23 08:40:19 +00001859LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001860CheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1861 SDValue N, const TargetLowering &TLI,
1862 unsigned ChildNo) {
1863 if (ChildNo >= N.getNumOperands())
1864 return false; // Match fails if out of range child #.
1865 return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI);
1866}
1867
1868
Chandler Carruth19e57022010-10-23 08:40:19 +00001869LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001870CheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1871 SDValue N) {
1872 return cast<CondCodeSDNode>(N)->get() ==
1873 (ISD::CondCode)MatcherTable[MatcherIndex++];
1874}
1875
Chandler Carruth19e57022010-10-23 08:40:19 +00001876LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001877CheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1878 SDValue N, const TargetLowering &TLI) {
1879 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
1880 if (cast<VTSDNode>(N)->getVT() == VT)
1881 return true;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001882
Chris Lattnerda828e32010-03-03 07:46:25 +00001883 // Handle the case when VT is iPTR.
1884 return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy();
1885}
1886
Chandler Carruth19e57022010-10-23 08:40:19 +00001887LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001888CheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1889 SDValue N) {
1890 int64_t Val = MatcherTable[MatcherIndex++];
1891 if (Val & 128)
1892 Val = GetVBR(Val, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001893
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001894 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N);
1895 return C != 0 && C->getSExtValue() == Val;
1896}
1897
Chandler Carruth19e57022010-10-23 08:40:19 +00001898LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001899CheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1900 SDValue N, SelectionDAGISel &SDISel) {
1901 int64_t Val = MatcherTable[MatcherIndex++];
1902 if (Val & 128)
1903 Val = GetVBR(Val, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001904
Chris Lattnerda828e32010-03-03 07:46:25 +00001905 if (N->getOpcode() != ISD::AND) return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001906
Chris Lattnerda828e32010-03-03 07:46:25 +00001907 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
1908 return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val);
1909}
1910
Chandler Carruth19e57022010-10-23 08:40:19 +00001911LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001912CheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1913 SDValue N, SelectionDAGISel &SDISel) {
1914 int64_t Val = MatcherTable[MatcherIndex++];
1915 if (Val & 128)
1916 Val = GetVBR(Val, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001917
Chris Lattnerda828e32010-03-03 07:46:25 +00001918 if (N->getOpcode() != ISD::OR) return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001919
Chris Lattnerda828e32010-03-03 07:46:25 +00001920 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
1921 return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val);
1922}
1923
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001924/// IsPredicateKnownToFail - If we know how and can do so without pushing a
1925/// scope, evaluate the current node. If the current predicate is known to
1926/// fail, set Result=true and return anything. If the current predicate is
1927/// known to pass, set Result=false and return the MatcherIndex to continue
1928/// with. If the current predicate is unknown, set Result=false and return the
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001929/// MatcherIndex to continue with.
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001930static unsigned IsPredicateKnownToFail(const unsigned char *Table,
1931 unsigned Index, SDValue N,
Chris Lattnerda828e32010-03-03 07:46:25 +00001932 bool &Result, SelectionDAGISel &SDISel,
Chris Lattnerd847bc22010-09-21 22:00:25 +00001933 SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001934 switch (Table[Index++]) {
1935 default:
1936 Result = false;
1937 return Index-1; // Could not evaluate this predicate.
Chris Lattnerda828e32010-03-03 07:46:25 +00001938 case SelectionDAGISel::OPC_CheckSame:
1939 Result = !::CheckSame(Table, Index, N, RecordedNodes);
1940 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001941 case SelectionDAGISel::OPC_CheckPatternPredicate:
Chris Lattnerda828e32010-03-03 07:46:25 +00001942 Result = !::CheckPatternPredicate(Table, Index, SDISel);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001943 return Index;
1944 case SelectionDAGISel::OPC_CheckPredicate:
Chris Lattnerda828e32010-03-03 07:46:25 +00001945 Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode());
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001946 return Index;
1947 case SelectionDAGISel::OPC_CheckOpcode:
1948 Result = !::CheckOpcode(Table, Index, N.getNode());
1949 return Index;
1950 case SelectionDAGISel::OPC_CheckType:
1951 Result = !::CheckType(Table, Index, N, SDISel.TLI);
1952 return Index;
1953 case SelectionDAGISel::OPC_CheckChild0Type:
1954 case SelectionDAGISel::OPC_CheckChild1Type:
1955 case SelectionDAGISel::OPC_CheckChild2Type:
1956 case SelectionDAGISel::OPC_CheckChild3Type:
1957 case SelectionDAGISel::OPC_CheckChild4Type:
1958 case SelectionDAGISel::OPC_CheckChild5Type:
1959 case SelectionDAGISel::OPC_CheckChild6Type:
Chris Lattnerda828e32010-03-03 07:46:25 +00001960 case SelectionDAGISel::OPC_CheckChild7Type:
1961 Result = !::CheckChildType(Table, Index, N, SDISel.TLI,
1962 Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001963 return Index;
Chris Lattnerda828e32010-03-03 07:46:25 +00001964 case SelectionDAGISel::OPC_CheckCondCode:
1965 Result = !::CheckCondCode(Table, Index, N);
1966 return Index;
1967 case SelectionDAGISel::OPC_CheckValueType:
1968 Result = !::CheckValueType(Table, Index, N, SDISel.TLI);
1969 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001970 case SelectionDAGISel::OPC_CheckInteger:
1971 Result = !::CheckInteger(Table, Index, N);
1972 return Index;
Chris Lattnerda828e32010-03-03 07:46:25 +00001973 case SelectionDAGISel::OPC_CheckAndImm:
1974 Result = !::CheckAndImm(Table, Index, N, SDISel);
1975 return Index;
1976 case SelectionDAGISel::OPC_CheckOrImm:
1977 Result = !::CheckOrImm(Table, Index, N, SDISel);
1978 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001979 }
1980}
1981
Dan Gohmanb3579832010-04-15 17:08:50 +00001982namespace {
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001983
Chris Lattner2a49d572010-02-28 22:37:22 +00001984struct MatchScope {
1985 /// FailIndex - If this match fails, this is the index to continue with.
1986 unsigned FailIndex;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001987
Chris Lattner2a49d572010-02-28 22:37:22 +00001988 /// NodeStack - The node stack when the scope was formed.
1989 SmallVector<SDValue, 4> NodeStack;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001990
Chris Lattner2a49d572010-02-28 22:37:22 +00001991 /// NumRecordedNodes - The number of recorded nodes when the scope was formed.
1992 unsigned NumRecordedNodes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001993
Chris Lattner2a49d572010-02-28 22:37:22 +00001994 /// NumMatchedMemRefs - The number of matched memref entries.
1995 unsigned NumMatchedMemRefs;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001996
1997 /// InputChain/InputGlue - The current chain/glue
Chris Lattnera4359be2010-12-23 17:13:18 +00001998 SDValue InputChain, InputGlue;
Chris Lattner2a49d572010-02-28 22:37:22 +00001999
2000 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
Chris Lattnera4359be2010-12-23 17:13:18 +00002001 bool HasChainNodesMatched, HasGlueResultNodesMatched;
Chris Lattner2a49d572010-02-28 22:37:22 +00002002};
2003
Dan Gohmanb3579832010-04-15 17:08:50 +00002004}
2005
Chris Lattner2a49d572010-02-28 22:37:22 +00002006SDNode *SelectionDAGISel::
2007SelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable,
2008 unsigned TableSize) {
2009 // FIXME: Should these even be selected? Handle these cases in the caller?
2010 switch (NodeToMatch->getOpcode()) {
2011 default:
2012 break;
2013 case ISD::EntryToken: // These nodes remain the same.
2014 case ISD::BasicBlock:
2015 case ISD::Register:
Chris Lattner3b9d6212010-03-14 17:53:23 +00002016 //case ISD::VALUETYPE:
2017 //case ISD::CONDCODE:
Chris Lattner2a49d572010-02-28 22:37:22 +00002018 case ISD::HANDLENODE:
Chris Lattnerdecc2672010-04-07 05:20:54 +00002019 case ISD::MDNODE_SDNODE:
Chris Lattner2a49d572010-02-28 22:37:22 +00002020 case ISD::TargetConstant:
2021 case ISD::TargetConstantFP:
2022 case ISD::TargetConstantPool:
2023 case ISD::TargetFrameIndex:
2024 case ISD::TargetExternalSymbol:
2025 case ISD::TargetBlockAddress:
2026 case ISD::TargetJumpTable:
2027 case ISD::TargetGlobalTLSAddress:
2028 case ISD::TargetGlobalAddress:
2029 case ISD::TokenFactor:
2030 case ISD::CopyFromReg:
2031 case ISD::CopyToReg:
Chris Lattner7561d482010-03-14 02:33:54 +00002032 case ISD::EH_LABEL:
Chris Lattnerd1b73822010-03-02 22:20:06 +00002033 NodeToMatch->setNodeId(-1); // Mark selected.
Chris Lattner2a49d572010-02-28 22:37:22 +00002034 return 0;
2035 case ISD::AssertSext:
2036 case ISD::AssertZext:
2037 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0),
2038 NodeToMatch->getOperand(0));
2039 return 0;
2040 case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch);
Chris Lattner2a49d572010-02-28 22:37:22 +00002041 case ISD::UNDEF: return Select_UNDEF(NodeToMatch);
2042 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002043
Chris Lattner2a49d572010-02-28 22:37:22 +00002044 assert(!NodeToMatch->isMachineOpcode() && "Node already selected!");
2045
2046 // Set up the node stack with NodeToMatch as the only node on the stack.
2047 SmallVector<SDValue, 8> NodeStack;
2048 SDValue N = SDValue(NodeToMatch, 0);
2049 NodeStack.push_back(N);
2050
2051 // MatchScopes - Scopes used when matching, if a match failure happens, this
2052 // indicates where to continue checking.
2053 SmallVector<MatchScope, 8> MatchScopes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002054
Chris Lattner2a49d572010-02-28 22:37:22 +00002055 // RecordedNodes - This is the set of nodes that have been recorded by the
Chris Lattnerd847bc22010-09-21 22:00:25 +00002056 // state machine. The second value is the parent of the node, or null if the
2057 // root is recorded.
2058 SmallVector<std::pair<SDValue, SDNode*>, 8> RecordedNodes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002059
Chris Lattner2a49d572010-02-28 22:37:22 +00002060 // MatchedMemRefs - This is the set of MemRef's we've seen in the input
2061 // pattern.
2062 SmallVector<MachineMemOperand*, 2> MatchedMemRefs;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002063
Chris Lattnera4359be2010-12-23 17:13:18 +00002064 // These are the current input chain and glue for use when generating nodes.
Chris Lattner2a49d572010-02-28 22:37:22 +00002065 // Various Emit operations change these. For example, emitting a copytoreg
2066 // uses and updates these.
Chris Lattnera4359be2010-12-23 17:13:18 +00002067 SDValue InputChain, InputGlue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002068
Chris Lattner2a49d572010-02-28 22:37:22 +00002069 // ChainNodesMatched - If a pattern matches nodes that have input/output
2070 // chains, the OPC_EmitMergeInputChains operation is emitted which indicates
2071 // which ones they are. The result is captured into this list so that we can
2072 // update the chain results when the pattern is complete.
2073 SmallVector<SDNode*, 3> ChainNodesMatched;
Chris Lattnera4359be2010-12-23 17:13:18 +00002074 SmallVector<SDNode*, 3> GlueResultNodesMatched;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002075
Chris Lattner2a49d572010-02-28 22:37:22 +00002076 DEBUG(errs() << "ISEL: Starting pattern match on root node: ";
2077 NodeToMatch->dump(CurDAG);
2078 errs() << '\n');
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002079
Chris Lattner7390eeb2010-03-01 18:47:11 +00002080 // Determine where to start the interpreter. Normally we start at opcode #0,
2081 // but if the state machine starts with an OPC_SwitchOpcode, then we
2082 // accelerate the first lookup (which is guaranteed to be hot) with the
2083 // OpcodeOffset table.
Chris Lattner2a49d572010-02-28 22:37:22 +00002084 unsigned MatcherIndex = 0;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002085
Chris Lattner7390eeb2010-03-01 18:47:11 +00002086 if (!OpcodeOffset.empty()) {
2087 // Already computed the OpcodeOffset table, just index into it.
2088 if (N.getOpcode() < OpcodeOffset.size())
2089 MatcherIndex = OpcodeOffset[N.getOpcode()];
2090 DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n");
2091
2092 } else if (MatcherTable[0] == OPC_SwitchOpcode) {
2093 // Otherwise, the table isn't computed, but the state machine does start
2094 // with an OPC_SwitchOpcode instruction. Populate the table now, since this
2095 // is the first time we're selecting an instruction.
2096 unsigned Idx = 1;
2097 while (1) {
2098 // Get the size of this case.
2099 unsigned CaseSize = MatcherTable[Idx++];
2100 if (CaseSize & 128)
2101 CaseSize = GetVBR(CaseSize, MatcherTable, Idx);
2102 if (CaseSize == 0) break;
2103
2104 // Get the opcode, add the index to the table.
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002105 uint16_t Opc = MatcherTable[Idx++];
2106 Opc |= (unsigned short)MatcherTable[Idx++] << 8;
Chris Lattner7390eeb2010-03-01 18:47:11 +00002107 if (Opc >= OpcodeOffset.size())
2108 OpcodeOffset.resize((Opc+1)*2);
2109 OpcodeOffset[Opc] = Idx;
2110 Idx += CaseSize;
2111 }
2112
2113 // Okay, do the lookup for the first opcode.
2114 if (N.getOpcode() < OpcodeOffset.size())
2115 MatcherIndex = OpcodeOffset[N.getOpcode()];
2116 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002117
Chris Lattner2a49d572010-02-28 22:37:22 +00002118 while (1) {
2119 assert(MatcherIndex < TableSize && "Invalid index");
Dan Gohman19b38262010-03-09 02:15:05 +00002120#ifndef NDEBUG
2121 unsigned CurrentOpcodeIndex = MatcherIndex;
2122#endif
Chris Lattner2a49d572010-02-28 22:37:22 +00002123 BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++];
2124 switch (Opcode) {
2125 case OPC_Scope: {
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002126 // Okay, the semantics of this operation are that we should push a scope
2127 // then evaluate the first child. However, pushing a scope only to have
2128 // the first check fail (which then pops it) is inefficient. If we can
2129 // determine immediately that the first check (or first several) will
2130 // immediately fail, don't even bother pushing a scope for them.
2131 unsigned FailIndex;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002132
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002133 while (1) {
2134 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2135 if (NumToSkip & 128)
2136 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2137 // Found the end of the scope with no match.
2138 if (NumToSkip == 0) {
2139 FailIndex = 0;
2140 break;
2141 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002142
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002143 FailIndex = MatcherIndex+NumToSkip;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002144
Chris Lattnera6f86932010-03-27 18:54:50 +00002145 unsigned MatcherIndexOfPredicate = MatcherIndex;
2146 (void)MatcherIndexOfPredicate; // silence warning.
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002147
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002148 // If we can't evaluate this predicate without pushing a scope (e.g. if
2149 // it is a 'MoveParent') or if the predicate succeeds on this node, we
2150 // push the scope and evaluate the full predicate chain.
2151 bool Result;
2152 MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N,
Chris Lattnerda828e32010-03-03 07:46:25 +00002153 Result, *this, RecordedNodes);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002154 if (!Result)
2155 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002156
Chris Lattnera6f86932010-03-27 18:54:50 +00002157 DEBUG(errs() << " Skipped scope entry (due to false predicate) at "
2158 << "index " << MatcherIndexOfPredicate
2159 << ", continuing at " << FailIndex << "\n");
Chris Lattnerbed993d2010-03-28 19:46:56 +00002160 ++NumDAGIselRetries;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002161
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002162 // Otherwise, we know that this case of the Scope is guaranteed to fail,
2163 // move to the next case.
2164 MatcherIndex = FailIndex;
2165 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002166
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002167 // If the whole scope failed to match, bail.
2168 if (FailIndex == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002169
Chris Lattner2a49d572010-02-28 22:37:22 +00002170 // Push a MatchScope which indicates where to go if the first child fails
2171 // to match.
2172 MatchScope NewEntry;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002173 NewEntry.FailIndex = FailIndex;
Chris Lattner2a49d572010-02-28 22:37:22 +00002174 NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());
2175 NewEntry.NumRecordedNodes = RecordedNodes.size();
2176 NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
2177 NewEntry.InputChain = InputChain;
Chris Lattnera4359be2010-12-23 17:13:18 +00002178 NewEntry.InputGlue = InputGlue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002179 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
Chris Lattnera4359be2010-12-23 17:13:18 +00002180 NewEntry.HasGlueResultNodesMatched = !GlueResultNodesMatched.empty();
Chris Lattner2a49d572010-02-28 22:37:22 +00002181 MatchScopes.push_back(NewEntry);
2182 continue;
2183 }
Chris Lattnerd847bc22010-09-21 22:00:25 +00002184 case OPC_RecordNode: {
Chris Lattner2a49d572010-02-28 22:37:22 +00002185 // Remember this node, it may end up being an operand in the pattern.
Chris Lattnerd847bc22010-09-21 22:00:25 +00002186 SDNode *Parent = 0;
2187 if (NodeStack.size() > 1)
2188 Parent = NodeStack[NodeStack.size()-2].getNode();
2189 RecordedNodes.push_back(std::make_pair(N, Parent));
Chris Lattner2a49d572010-02-28 22:37:22 +00002190 continue;
Chris Lattnerd847bc22010-09-21 22:00:25 +00002191 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002192
Chris Lattner2a49d572010-02-28 22:37:22 +00002193 case OPC_RecordChild0: case OPC_RecordChild1:
2194 case OPC_RecordChild2: case OPC_RecordChild3:
2195 case OPC_RecordChild4: case OPC_RecordChild5:
2196 case OPC_RecordChild6: case OPC_RecordChild7: {
2197 unsigned ChildNo = Opcode-OPC_RecordChild0;
2198 if (ChildNo >= N.getNumOperands())
2199 break; // Match fails if out of range child #.
2200
Chris Lattnerd847bc22010-09-21 22:00:25 +00002201 RecordedNodes.push_back(std::make_pair(N->getOperand(ChildNo),
2202 N.getNode()));
Chris Lattner2a49d572010-02-28 22:37:22 +00002203 continue;
2204 }
2205 case OPC_RecordMemRef:
2206 MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand());
2207 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002208
Chris Lattner29d8f0c2010-12-23 17:24:32 +00002209 case OPC_CaptureGlueInput:
Chris Lattnera4359be2010-12-23 17:13:18 +00002210 // If the current node has an input glue, capture it in InputGlue.
Chris Lattner2a49d572010-02-28 22:37:22 +00002211 if (N->getNumOperands() != 0 &&
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002212 N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Glue)
Chris Lattnera4359be2010-12-23 17:13:18 +00002213 InputGlue = N->getOperand(N->getNumOperands()-1);
Chris Lattner2a49d572010-02-28 22:37:22 +00002214 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002215
Chris Lattner2a49d572010-02-28 22:37:22 +00002216 case OPC_MoveChild: {
2217 unsigned ChildNo = MatcherTable[MatcherIndex++];
2218 if (ChildNo >= N.getNumOperands())
2219 break; // Match fails if out of range child #.
2220 N = N.getOperand(ChildNo);
2221 NodeStack.push_back(N);
2222 continue;
2223 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002224
Chris Lattner2a49d572010-02-28 22:37:22 +00002225 case OPC_MoveParent:
2226 // Pop the current node off the NodeStack.
2227 NodeStack.pop_back();
2228 assert(!NodeStack.empty() && "Node stack imbalance!");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002229 N = NodeStack.back();
Chris Lattner2a49d572010-02-28 22:37:22 +00002230 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002231
Chris Lattnerda828e32010-03-03 07:46:25 +00002232 case OPC_CheckSame:
2233 if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002234 continue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002235 case OPC_CheckPatternPredicate:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002236 if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002237 continue;
2238 case OPC_CheckPredicate:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002239 if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this,
2240 N.getNode()))
2241 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002242 continue;
Chris Lattner57bf8a42010-03-04 01:23:08 +00002243 case OPC_CheckComplexPat: {
2244 unsigned CPNum = MatcherTable[MatcherIndex++];
2245 unsigned RecNo = MatcherTable[MatcherIndex++];
2246 assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002247 if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo].second,
2248 RecordedNodes[RecNo].first, CPNum,
Chris Lattner57bf8a42010-03-04 01:23:08 +00002249 RecordedNodes))
Chris Lattner2a49d572010-02-28 22:37:22 +00002250 break;
2251 continue;
Chris Lattner57bf8a42010-03-04 01:23:08 +00002252 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002253 case OPC_CheckOpcode:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002254 if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break;
2255 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002256
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002257 case OPC_CheckType:
2258 if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002259 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002260
Chris Lattnereb669212010-03-01 06:59:22 +00002261 case OPC_SwitchOpcode: {
2262 unsigned CurNodeOpcode = N.getOpcode();
Chris Lattner7d892d62010-03-01 07:43:08 +00002263 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
Chris Lattnereb669212010-03-01 06:59:22 +00002264 unsigned CaseSize;
2265 while (1) {
2266 // Get the size of this case.
2267 CaseSize = MatcherTable[MatcherIndex++];
2268 if (CaseSize & 128)
2269 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2270 if (CaseSize == 0) break;
2271
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002272 uint16_t Opc = MatcherTable[MatcherIndex++];
2273 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2274
Chris Lattnereb669212010-03-01 06:59:22 +00002275 // If the opcode matches, then we will execute this case.
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002276 if (CurNodeOpcode == Opc)
Chris Lattnereb669212010-03-01 06:59:22 +00002277 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002278
Chris Lattnereb669212010-03-01 06:59:22 +00002279 // Otherwise, skip over this case.
2280 MatcherIndex += CaseSize;
2281 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002282
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002283 // If no cases matched, bail out.
Chris Lattnereb669212010-03-01 06:59:22 +00002284 if (CaseSize == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002285
Chris Lattnereb669212010-03-01 06:59:22 +00002286 // Otherwise, execute the case we found.
2287 DEBUG(errs() << " OpcodeSwitch from " << SwitchStart
2288 << " to " << MatcherIndex << "\n");
2289 continue;
2290 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002291
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002292 case OPC_SwitchType: {
Duncan Sandscdfad362010-11-03 12:17:33 +00002293 MVT CurNodeVT = N.getValueType().getSimpleVT();
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002294 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2295 unsigned CaseSize;
2296 while (1) {
2297 // Get the size of this case.
2298 CaseSize = MatcherTable[MatcherIndex++];
2299 if (CaseSize & 128)
2300 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2301 if (CaseSize == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002302
Duncan Sandscdfad362010-11-03 12:17:33 +00002303 MVT CaseVT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002304 if (CaseVT == MVT::iPTR)
Duncan Sandscdfad362010-11-03 12:17:33 +00002305 CaseVT = TLI.getPointerTy();
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002306
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002307 // If the VT matches, then we will execute this case.
2308 if (CurNodeVT == CaseVT)
2309 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002310
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002311 // Otherwise, skip over this case.
2312 MatcherIndex += CaseSize;
2313 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002314
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002315 // If no cases matched, bail out.
2316 if (CaseSize == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002317
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002318 // Otherwise, execute the case we found.
2319 DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString()
2320 << "] from " << SwitchStart << " to " << MatcherIndex<<'\n');
2321 continue;
2322 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002323 case OPC_CheckChild0Type: case OPC_CheckChild1Type:
2324 case OPC_CheckChild2Type: case OPC_CheckChild3Type:
2325 case OPC_CheckChild4Type: case OPC_CheckChild5Type:
Chris Lattnerda828e32010-03-03 07:46:25 +00002326 case OPC_CheckChild6Type: case OPC_CheckChild7Type:
2327 if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI,
2328 Opcode-OPC_CheckChild0Type))
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002329 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002330 continue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002331 case OPC_CheckCondCode:
Chris Lattnerda828e32010-03-03 07:46:25 +00002332 if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002333 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002334 case OPC_CheckValueType:
2335 if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002336 continue;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002337 case OPC_CheckInteger:
2338 if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002339 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002340 case OPC_CheckAndImm:
2341 if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002342 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002343 case OPC_CheckOrImm:
2344 if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002345 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002346
Chris Lattner2a49d572010-02-28 22:37:22 +00002347 case OPC_CheckFoldableChainNode: {
2348 assert(NodeStack.size() != 1 && "No parent node");
2349 // Verify that all intermediate nodes between the root and this one have
2350 // a single use.
2351 bool HasMultipleUses = false;
2352 for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)
2353 if (!NodeStack[i].hasOneUse()) {
2354 HasMultipleUses = true;
2355 break;
2356 }
2357 if (HasMultipleUses) break;
2358
2359 // Check to see that the target thinks this is profitable to fold and that
2360 // we can fold it without inducing cycles in the graph.
2361 if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2362 NodeToMatch) ||
2363 !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
Dan Gohmand858e902010-04-17 15:26:15 +00002364 NodeToMatch, OptLevel,
2365 true/*We validate our own chains*/))
Chris Lattner2a49d572010-02-28 22:37:22 +00002366 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002367
Chris Lattner2a49d572010-02-28 22:37:22 +00002368 continue;
2369 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002370 case OPC_EmitInteger: {
2371 MVT::SimpleValueType VT =
2372 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2373 int64_t Val = MatcherTable[MatcherIndex++];
2374 if (Val & 128)
2375 Val = GetVBR(Val, MatcherTable, MatcherIndex);
Chris Lattnerd847bc22010-09-21 22:00:25 +00002376 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002377 CurDAG->getTargetConstant(Val, VT), (SDNode*)0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002378 continue;
2379 }
2380 case OPC_EmitRegister: {
2381 MVT::SimpleValueType VT =
2382 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2383 unsigned RegNo = MatcherTable[MatcherIndex++];
Chris Lattnerd847bc22010-09-21 22:00:25 +00002384 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002385 CurDAG->getRegister(RegNo, VT), (SDNode*)0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002386 continue;
2387 }
Jim Grosbach2d76c842011-03-01 01:37:19 +00002388 case OPC_EmitRegister2: {
2389 // For targets w/ more than 256 register names, the register enum
2390 // values are stored in two bytes in the matcher table (just like
2391 // opcodes).
2392 MVT::SimpleValueType VT =
2393 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2394 unsigned RegNo = MatcherTable[MatcherIndex++];
2395 RegNo |= MatcherTable[MatcherIndex++] << 8;
2396 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
2397 CurDAG->getRegister(RegNo, VT), (SDNode*)0));
2398 continue;
2399 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002400
Chris Lattner2a49d572010-02-28 22:37:22 +00002401 case OPC_EmitConvertToTarget: {
2402 // Convert from IMM/FPIMM to target version.
2403 unsigned RecNo = MatcherTable[MatcherIndex++];
2404 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002405 SDValue Imm = RecordedNodes[RecNo].first;
Chris Lattner2a49d572010-02-28 22:37:22 +00002406
2407 if (Imm->getOpcode() == ISD::Constant) {
2408 int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue();
2409 Imm = CurDAG->getTargetConstant(Val, Imm.getValueType());
2410 } else if (Imm->getOpcode() == ISD::ConstantFP) {
2411 const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue();
2412 Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType());
2413 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002414
Chris Lattnerd847bc22010-09-21 22:00:25 +00002415 RecordedNodes.push_back(std::make_pair(Imm, RecordedNodes[RecNo].second));
Chris Lattner2a49d572010-02-28 22:37:22 +00002416 continue;
2417 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002418
Chris Lattneraa4e3392010-03-28 05:50:16 +00002419 case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0
2420 case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1
2421 // These are space-optimized forms of OPC_EmitMergeInputChains.
2422 assert(InputChain.getNode() == 0 &&
2423 "EmitMergeInputChains should be the first chain producing node");
2424 assert(ChainNodesMatched.empty() &&
2425 "Should only have one EmitMergeInputChains per match");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002426
Chris Lattneraa4e3392010-03-28 05:50:16 +00002427 // Read all of the chained nodes.
2428 unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1;
2429 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002430 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002431
Chris Lattneraa4e3392010-03-28 05:50:16 +00002432 // FIXME: What if other value results of the node have uses not matched
2433 // by this pattern?
2434 if (ChainNodesMatched.back() != NodeToMatch &&
Chris Lattnerd847bc22010-09-21 22:00:25 +00002435 !RecordedNodes[RecNo].first.hasOneUse()) {
Chris Lattneraa4e3392010-03-28 05:50:16 +00002436 ChainNodesMatched.clear();
2437 break;
2438 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002439
Chris Lattneraa4e3392010-03-28 05:50:16 +00002440 // Merge the input chains if they are not intra-pattern references.
2441 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002442
Chris Lattneraa4e3392010-03-28 05:50:16 +00002443 if (InputChain.getNode() == 0)
2444 break; // Failed to merge.
2445 continue;
2446 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002447
Chris Lattner2a49d572010-02-28 22:37:22 +00002448 case OPC_EmitMergeInputChains: {
2449 assert(InputChain.getNode() == 0 &&
2450 "EmitMergeInputChains should be the first chain producing node");
2451 // This node gets a list of nodes we matched in the input that have
2452 // chains. We want to token factor all of the input chains to these nodes
2453 // together. However, if any of the input chains is actually one of the
2454 // nodes matched in this pattern, then we have an intra-match reference.
2455 // Ignore these because the newly token factored chain should not refer to
2456 // the old nodes.
2457 unsigned NumChains = MatcherTable[MatcherIndex++];
2458 assert(NumChains != 0 && "Can't TF zero chains");
2459
2460 assert(ChainNodesMatched.empty() &&
2461 "Should only have one EmitMergeInputChains per match");
2462
Chris Lattner2a49d572010-02-28 22:37:22 +00002463 // Read all of the chained nodes.
Chris Lattner00592ec2010-03-02 19:34:59 +00002464 for (unsigned i = 0; i != NumChains; ++i) {
2465 unsigned RecNo = MatcherTable[MatcherIndex++];
Chris Lattner2a49d572010-02-28 22:37:22 +00002466 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002467 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002468
Chris Lattner2a49d572010-02-28 22:37:22 +00002469 // FIXME: What if other value results of the node have uses not matched
2470 // by this pattern?
2471 if (ChainNodesMatched.back() != NodeToMatch &&
Chris Lattnerd847bc22010-09-21 22:00:25 +00002472 !RecordedNodes[RecNo].first.hasOneUse()) {
Chris Lattner2a49d572010-02-28 22:37:22 +00002473 ChainNodesMatched.clear();
2474 break;
2475 }
2476 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002477
Chris Lattner6b307922010-03-02 00:00:03 +00002478 // If the inner loop broke out, the match fails.
2479 if (ChainNodesMatched.empty())
2480 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002481
Chris Lattner6b307922010-03-02 00:00:03 +00002482 // Merge the input chains if they are not intra-pattern references.
2483 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002484
Chris Lattner6b307922010-03-02 00:00:03 +00002485 if (InputChain.getNode() == 0)
2486 break; // Failed to merge.
Chris Lattner2a49d572010-02-28 22:37:22 +00002487
Chris Lattner2a49d572010-02-28 22:37:22 +00002488 continue;
2489 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002490
Chris Lattner2a49d572010-02-28 22:37:22 +00002491 case OPC_EmitCopyToReg: {
2492 unsigned RecNo = MatcherTable[MatcherIndex++];
2493 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2494 unsigned DestPhysReg = MatcherTable[MatcherIndex++];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002495
Chris Lattner2a49d572010-02-28 22:37:22 +00002496 if (InputChain.getNode() == 0)
2497 InputChain = CurDAG->getEntryNode();
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002498
Chris Lattner2a49d572010-02-28 22:37:22 +00002499 InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(),
Chris Lattnerd847bc22010-09-21 22:00:25 +00002500 DestPhysReg, RecordedNodes[RecNo].first,
Chris Lattnera4359be2010-12-23 17:13:18 +00002501 InputGlue);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002502
Chris Lattnera4359be2010-12-23 17:13:18 +00002503 InputGlue = InputChain.getValue(1);
Chris Lattner2a49d572010-02-28 22:37:22 +00002504 continue;
2505 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002506
Chris Lattner2a49d572010-02-28 22:37:22 +00002507 case OPC_EmitNodeXForm: {
2508 unsigned XFormNo = MatcherTable[MatcherIndex++];
2509 unsigned RecNo = MatcherTable[MatcherIndex++];
2510 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002511 SDValue Res = RunSDNodeXForm(RecordedNodes[RecNo].first, XFormNo);
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002512 RecordedNodes.push_back(std::pair<SDValue,SDNode*>(Res, (SDNode*) 0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002513 continue;
2514 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002515
Chris Lattner2a49d572010-02-28 22:37:22 +00002516 case OPC_EmitNode:
2517 case OPC_MorphNodeTo: {
Chris Lattner14df8dc2010-02-28 22:38:43 +00002518 uint16_t TargetOpc = MatcherTable[MatcherIndex++];
2519 TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
Chris Lattner2a49d572010-02-28 22:37:22 +00002520 unsigned EmitNodeInfo = MatcherTable[MatcherIndex++];
2521 // Get the result VT list.
2522 unsigned NumVTs = MatcherTable[MatcherIndex++];
2523 SmallVector<EVT, 4> VTs;
2524 for (unsigned i = 0; i != NumVTs; ++i) {
2525 MVT::SimpleValueType VT =
2526 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2527 if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy;
2528 VTs.push_back(VT);
2529 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002530
Chris Lattner2a49d572010-02-28 22:37:22 +00002531 if (EmitNodeInfo & OPFL_Chain)
2532 VTs.push_back(MVT::Other);
Chris Lattnera4359be2010-12-23 17:13:18 +00002533 if (EmitNodeInfo & OPFL_GlueOutput)
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002534 VTs.push_back(MVT::Glue);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002535
Chris Lattner7d892d62010-03-01 07:43:08 +00002536 // This is hot code, so optimize the two most common cases of 1 and 2
2537 // results.
2538 SDVTList VTList;
2539 if (VTs.size() == 1)
2540 VTList = CurDAG->getVTList(VTs[0]);
2541 else if (VTs.size() == 2)
2542 VTList = CurDAG->getVTList(VTs[0], VTs[1]);
2543 else
2544 VTList = CurDAG->getVTList(VTs.data(), VTs.size());
Chris Lattner2a49d572010-02-28 22:37:22 +00002545
2546 // Get the operand list.
2547 unsigned NumOps = MatcherTable[MatcherIndex++];
2548 SmallVector<SDValue, 8> Ops;
2549 for (unsigned i = 0; i != NumOps; ++i) {
2550 unsigned RecNo = MatcherTable[MatcherIndex++];
2551 if (RecNo & 128)
2552 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002553
Chris Lattner2a49d572010-02-28 22:37:22 +00002554 assert(RecNo < RecordedNodes.size() && "Invalid EmitNode");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002555 Ops.push_back(RecordedNodes[RecNo].first);
Chris Lattner2a49d572010-02-28 22:37:22 +00002556 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002557
Chris Lattner2a49d572010-02-28 22:37:22 +00002558 // If there are variadic operands to add, handle them now.
2559 if (EmitNodeInfo & OPFL_VariadicInfo) {
2560 // Determine the start index to copy from.
2561 unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo);
2562 FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0;
2563 assert(NodeToMatch->getNumOperands() >= FirstOpToCopy &&
2564 "Invalid variadic node");
Chris Lattnera4359be2010-12-23 17:13:18 +00002565 // Copy all of the variadic operands, not including a potential glue
Chris Lattner2a49d572010-02-28 22:37:22 +00002566 // input.
2567 for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands();
2568 i != e; ++i) {
2569 SDValue V = NodeToMatch->getOperand(i);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002570 if (V.getValueType() == MVT::Glue) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002571 Ops.push_back(V);
2572 }
2573 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002574
Chris Lattnera4359be2010-12-23 17:13:18 +00002575 // If this has chain/glue inputs, add them.
Chris Lattner2a49d572010-02-28 22:37:22 +00002576 if (EmitNodeInfo & OPFL_Chain)
2577 Ops.push_back(InputChain);
Chris Lattnera4359be2010-12-23 17:13:18 +00002578 if ((EmitNodeInfo & OPFL_GlueInput) && InputGlue.getNode() != 0)
2579 Ops.push_back(InputGlue);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002580
Chris Lattner2a49d572010-02-28 22:37:22 +00002581 // Create the node.
2582 SDNode *Res = 0;
2583 if (Opcode != OPC_MorphNodeTo) {
2584 // If this is a normal EmitNode command, just create the new node and
2585 // add the results to the RecordedNodes list.
2586 Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(),
2587 VTList, Ops.data(), Ops.size());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002588
Chris Lattnera4359be2010-12-23 17:13:18 +00002589 // Add all the non-glue/non-chain results to the RecordedNodes list.
Chris Lattner2a49d572010-02-28 22:37:22 +00002590 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002591 if (VTs[i] == MVT::Other || VTs[i] == MVT::Glue) break;
Chris Lattnerd847bc22010-09-21 22:00:25 +00002592 RecordedNodes.push_back(std::pair<SDValue,SDNode*>(SDValue(Res, i),
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002593 (SDNode*) 0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002594 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002595
Chris Lattner2a49d572010-02-28 22:37:22 +00002596 } else {
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00002597 Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(),
2598 EmitNodeInfo);
Chris Lattner2a49d572010-02-28 22:37:22 +00002599 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002600
Chris Lattnera4359be2010-12-23 17:13:18 +00002601 // If the node had chain/glue results, update our notion of the current
2602 // chain and glue.
2603 if (EmitNodeInfo & OPFL_GlueOutput) {
2604 InputGlue = SDValue(Res, VTs.size()-1);
Chris Lattner2a49d572010-02-28 22:37:22 +00002605 if (EmitNodeInfo & OPFL_Chain)
2606 InputChain = SDValue(Res, VTs.size()-2);
2607 } else if (EmitNodeInfo & OPFL_Chain)
2608 InputChain = SDValue(Res, VTs.size()-1);
2609
Chris Lattnera4359be2010-12-23 17:13:18 +00002610 // If the OPFL_MemRefs glue is set on this node, slap all of the
Chris Lattner2a49d572010-02-28 22:37:22 +00002611 // accumulated memrefs onto it.
2612 //
2613 // FIXME: This is vastly incorrect for patterns with multiple outputs
2614 // instructions that access memory and for ComplexPatterns that match
2615 // loads.
2616 if (EmitNodeInfo & OPFL_MemRefs) {
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002617 // Only attach load or store memory operands if the generated
2618 // instruction may load or store.
Evan Chenge837dea2011-06-28 19:10:37 +00002619 const MCInstrDesc &MCID = TM.getInstrInfo()->get(TargetOpc);
2620 bool mayLoad = MCID.mayLoad();
2621 bool mayStore = MCID.mayStore();
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002622
2623 unsigned NumMemRefs = 0;
2624 for (SmallVector<MachineMemOperand*, 2>::const_iterator I =
2625 MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
2626 if ((*I)->isLoad()) {
2627 if (mayLoad)
2628 ++NumMemRefs;
2629 } else if ((*I)->isStore()) {
2630 if (mayStore)
2631 ++NumMemRefs;
2632 } else {
2633 ++NumMemRefs;
2634 }
2635 }
2636
Chris Lattner2a49d572010-02-28 22:37:22 +00002637 MachineSDNode::mmo_iterator MemRefs =
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002638 MF->allocateMemRefsArray(NumMemRefs);
2639
2640 MachineSDNode::mmo_iterator MemRefsPos = MemRefs;
2641 for (SmallVector<MachineMemOperand*, 2>::const_iterator I =
2642 MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
2643 if ((*I)->isLoad()) {
2644 if (mayLoad)
2645 *MemRefsPos++ = *I;
2646 } else if ((*I)->isStore()) {
2647 if (mayStore)
2648 *MemRefsPos++ = *I;
2649 } else {
2650 *MemRefsPos++ = *I;
2651 }
2652 }
2653
Chris Lattner2a49d572010-02-28 22:37:22 +00002654 cast<MachineSDNode>(Res)
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002655 ->setMemRefs(MemRefs, MemRefs + NumMemRefs);
Chris Lattner2a49d572010-02-28 22:37:22 +00002656 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002657
Chris Lattner2a49d572010-02-28 22:37:22 +00002658 DEBUG(errs() << " "
2659 << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created")
2660 << " node: "; Res->dump(CurDAG); errs() << "\n");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002661
Chris Lattner2a49d572010-02-28 22:37:22 +00002662 // If this was a MorphNodeTo then we're completely done!
2663 if (Opcode == OPC_MorphNodeTo) {
Chris Lattnera4359be2010-12-23 17:13:18 +00002664 // Update chain and glue uses.
2665 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2666 InputGlue, GlueResultNodesMatched, true);
Chris Lattner82dd3d32010-03-02 07:50:03 +00002667 return Res;
Chris Lattner2a49d572010-02-28 22:37:22 +00002668 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002669
Chris Lattner2a49d572010-02-28 22:37:22 +00002670 continue;
2671 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002672
Chris Lattner29d8f0c2010-12-23 17:24:32 +00002673 case OPC_MarkGlueResults: {
Chris Lattner2a49d572010-02-28 22:37:22 +00002674 unsigned NumNodes = MatcherTable[MatcherIndex++];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002675
Chris Lattnera4359be2010-12-23 17:13:18 +00002676 // Read and remember all the glue-result nodes.
Chris Lattner2a49d572010-02-28 22:37:22 +00002677 for (unsigned i = 0; i != NumNodes; ++i) {
2678 unsigned RecNo = MatcherTable[MatcherIndex++];
2679 if (RecNo & 128)
2680 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
2681
2682 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnera4359be2010-12-23 17:13:18 +00002683 GlueResultNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
Chris Lattner2a49d572010-02-28 22:37:22 +00002684 }
2685 continue;
2686 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002687
Chris Lattner2a49d572010-02-28 22:37:22 +00002688 case OPC_CompleteMatch: {
2689 // The match has been completed, and any new nodes (if any) have been
2690 // created. Patch up references to the matched dag to use the newly
2691 // created nodes.
2692 unsigned NumResults = MatcherTable[MatcherIndex++];
2693
2694 for (unsigned i = 0; i != NumResults; ++i) {
2695 unsigned ResSlot = MatcherTable[MatcherIndex++];
2696 if (ResSlot & 128)
2697 ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002698
Chris Lattner2a49d572010-02-28 22:37:22 +00002699 assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002700 SDValue Res = RecordedNodes[ResSlot].first;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002701
Chris Lattnerb0e483e2010-03-28 05:54:03 +00002702 assert(i < NodeToMatch->getNumValues() &&
2703 NodeToMatch->getValueType(i) != MVT::Other &&
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002704 NodeToMatch->getValueType(i) != MVT::Glue &&
Chris Lattnerb0e483e2010-03-28 05:54:03 +00002705 "Invalid number of results to complete!");
Chris Lattner2a49d572010-02-28 22:37:22 +00002706 assert((NodeToMatch->getValueType(i) == Res.getValueType() ||
2707 NodeToMatch->getValueType(i) == MVT::iPTR ||
2708 Res.getValueType() == MVT::iPTR ||
2709 NodeToMatch->getValueType(i).getSizeInBits() ==
2710 Res.getValueType().getSizeInBits()) &&
2711 "invalid replacement");
2712 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res);
2713 }
2714
Chris Lattner29d8f0c2010-12-23 17:24:32 +00002715 // If the root node defines glue, add it to the glue nodes to update list.
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002716 if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Glue)
Chris Lattnera4359be2010-12-23 17:13:18 +00002717 GlueResultNodesMatched.push_back(NodeToMatch);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002718
Chris Lattnera4359be2010-12-23 17:13:18 +00002719 // Update chain and glue uses.
2720 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2721 InputGlue, GlueResultNodesMatched, false);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002722
Chris Lattner2a49d572010-02-28 22:37:22 +00002723 assert(NodeToMatch->use_empty() &&
2724 "Didn't replace all uses of the node?");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002725
Chris Lattner2a49d572010-02-28 22:37:22 +00002726 // FIXME: We just return here, which interacts correctly with SelectRoot
2727 // above. We should fix this to not return an SDNode* anymore.
2728 return 0;
2729 }
2730 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002731
Chris Lattner2a49d572010-02-28 22:37:22 +00002732 // If the code reached this point, then the match failed. See if there is
2733 // another child to try in the current 'Scope', otherwise pop it until we
2734 // find a case to check.
Dan Gohman19b38262010-03-09 02:15:05 +00002735 DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n");
Chris Lattnerbed993d2010-03-28 19:46:56 +00002736 ++NumDAGIselRetries;
Chris Lattner2a49d572010-02-28 22:37:22 +00002737 while (1) {
2738 if (MatchScopes.empty()) {
2739 CannotYetSelect(NodeToMatch);
2740 return 0;
2741 }
2742
2743 // Restore the interpreter state back to the point where the scope was
2744 // formed.
2745 MatchScope &LastScope = MatchScopes.back();
2746 RecordedNodes.resize(LastScope.NumRecordedNodes);
2747 NodeStack.clear();
2748 NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());
2749 N = NodeStack.back();
2750
Chris Lattner2a49d572010-02-28 22:37:22 +00002751 if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size())
2752 MatchedMemRefs.resize(LastScope.NumMatchedMemRefs);
2753 MatcherIndex = LastScope.FailIndex;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002754
Dan Gohman19b38262010-03-09 02:15:05 +00002755 DEBUG(errs() << " Continuing at " << MatcherIndex << "\n");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002756
Chris Lattner2a49d572010-02-28 22:37:22 +00002757 InputChain = LastScope.InputChain;
Chris Lattnera4359be2010-12-23 17:13:18 +00002758 InputGlue = LastScope.InputGlue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002759 if (!LastScope.HasChainNodesMatched)
2760 ChainNodesMatched.clear();
Chris Lattnera4359be2010-12-23 17:13:18 +00002761 if (!LastScope.HasGlueResultNodesMatched)
2762 GlueResultNodesMatched.clear();
Chris Lattner2a49d572010-02-28 22:37:22 +00002763
2764 // Check to see what the offset is at the new MatcherIndex. If it is zero
2765 // we have reached the end of this scope, otherwise we have another child
2766 // in the current scope to try.
2767 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2768 if (NumToSkip & 128)
2769 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2770
2771 // If we have another child in this scope to match, update FailIndex and
2772 // try it.
2773 if (NumToSkip != 0) {
2774 LastScope.FailIndex = MatcherIndex+NumToSkip;
2775 break;
2776 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002777
Chris Lattner2a49d572010-02-28 22:37:22 +00002778 // End of this scope, pop it and try the next child in the containing
2779 // scope.
2780 MatchScopes.pop_back();
2781 }
2782 }
2783}
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002784
Chris Lattner2a49d572010-02-28 22:37:22 +00002785
2786
Dan Gohmaneeb3a002010-01-05 01:24:18 +00002787void SelectionDAGISel::CannotYetSelect(SDNode *N) {
Dan Gohmane1f188f2009-10-29 22:30:23 +00002788 std::string msg;
2789 raw_string_ostream Msg(msg);
Chris Lattner5df15782010-12-21 02:07:03 +00002790 Msg << "Cannot select: ";
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002791
Chris Lattner2c4afd12010-03-04 00:21:16 +00002792 if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN &&
2793 N->getOpcode() != ISD::INTRINSIC_WO_CHAIN &&
2794 N->getOpcode() != ISD::INTRINSIC_VOID) {
2795 N->printrFull(Msg, CurDAG);
2796 } else {
2797 bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other;
2798 unsigned iid =
2799 cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue();
2800 if (iid < Intrinsic::num_intrinsics)
2801 Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid);
2802 else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo())
2803 Msg << "target intrinsic %" << TII->getName(iid);
2804 else
2805 Msg << "unknown intrinsic #" << iid;
2806 }
Chris Lattner75361b62010-04-07 22:58:41 +00002807 report_fatal_error(Msg.str());
Dan Gohmane1f188f2009-10-29 22:30:23 +00002808}
2809
Devang Patel19974732007-05-03 01:11:54 +00002810char SelectionDAGISel::ID = 0;