blob: ddbeaeb7cb7c6bc22d2c171672789a3ee71509aa [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 Cheng15a16de2010-05-20 06:13:19 +0000147 if (TLI.getSchedulingPreference() == Sched::RegPressure)
148 return createBURRListDAGScheduler(IS, OptLevel);
Evan Cheng70017e42010-07-24 00:39:05 +0000149 if (TLI.getSchedulingPreference() == Sched::Hybrid)
150 return createHybridListDAGScheduler(IS, OptLevel);
151 assert(TLI.getSchedulingPreference() == Sched::ILP &&
Evan Cheng211ffa12010-05-19 20:19:50 +0000152 "Unknown sched type!");
Evan Cheng70017e42010-07-24 00:39:05 +0000153 return createILPListDAGScheduler(IS, OptLevel);
Jim Laskey9373beb2006-08-01 19:14:14 +0000154 }
Chris Lattner1c08c712005-01-07 07:47:53 +0000155}
156
Evan Chengff9b3732008-01-30 18:18:23 +0000157// EmitInstrWithCustomInserter - This method should be implemented by targets
Dan Gohman533297b2009-10-29 18:10:34 +0000158// that mark instructions with the 'usesCustomInserter' flag. These
Chris Lattner025c39b2005-08-26 20:54:47 +0000159// instructions are special in various ways, which require special support to
160// insert. The specified MachineInstr is created but not inserted into any
Dan Gohman533297b2009-10-29 18:10:34 +0000161// basic blocks, and this method is called to expand it into a sequence of
162// instructions, potentially also creating new basic blocks and control flow.
163// When new basic blocks are inserted and the edges from MBB to its successors
164// are modified, the method should insert pairs of <OldSucc, NewSucc> into the
165// DenseMap.
Dan Gohmanaf1d8ca2010-05-01 00:01:06 +0000166MachineBasicBlock *
167TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
168 MachineBasicBlock *MBB) const {
Torok Edwinf3689232009-07-12 20:07:01 +0000169#ifndef NDEBUG
David Greene1a053232010-01-05 01:26:11 +0000170 dbgs() << "If a target marks an instruction with "
Dan Gohman533297b2009-10-29 18:10:34 +0000171 "'usesCustomInserter', it must implement "
Torok Edwinf3689232009-07-12 20:07:01 +0000172 "TargetLowering::EmitInstrWithCustomInserter!";
173#endif
Torok Edwinc23197a2009-07-14 16:55:14 +0000174 llvm_unreachable(0);
Daniel Dunbara279bc32009-09-20 02:20:51 +0000175 return 0;
Chris Lattner025c39b2005-08-26 20:54:47 +0000176}
177
Evan Cheng37fefc22011-08-30 19:09:48 +0000178void TargetLowering::AdjustInstrPostInstrSelection(MachineInstr *MI,
179 SDNode *Node) const {
Andrew Trick3be654f2011-09-21 02:20:46 +0000180 assert(!MI->getDesc().hasPostISelHook() &&
181 "If a target marks an instruction with 'hasPostISelHook', "
182 "it must implement TargetLowering::AdjustInstrPostInstrSelection!");
Evan Cheng37fefc22011-08-30 19:09:48 +0000183}
184
Chris Lattner7041ee32005-01-11 05:56:49 +0000185//===----------------------------------------------------------------------===//
186// SelectionDAGISel code
187//===----------------------------------------------------------------------===//
Chris Lattner1c08c712005-01-07 07:47:53 +0000188
Eric Christopher762a17a2011-01-05 21:45:56 +0000189SelectionDAGISel::SelectionDAGISel(const TargetMachine &tm,
190 CodeGenOpt::Level OL) :
Owen Anderson90c579d2010-08-06 18:33:48 +0000191 MachineFunctionPass(ID), TM(tm), TLI(*tm.getTargetLowering()),
Dan Gohman7c3234c2008-08-27 23:52:12 +0000192 FuncInfo(new FunctionLoweringInfo(TLI)),
Dan Gohman7451d3e2010-05-29 17:03:36 +0000193 CurDAG(new SelectionDAG(tm)),
Dan Gohman55e59c12010-04-19 19:05:59 +0000194 SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)),
Dan Gohman7c3234c2008-08-27 23:52:12 +0000195 GFI(),
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +0000196 OptLevel(OL),
Owen Anderson081c34b2010-10-19 17:21:58 +0000197 DAGSize(0) {
198 initializeGCModuleInfoPass(*PassRegistry::getPassRegistry());
199 initializeAliasAnalysisAnalysisGroup(*PassRegistry::getPassRegistry());
Jakub Staszak7cc2b072011-06-16 20:22:37 +0000200 initializeBranchProbabilityInfoPass(*PassRegistry::getPassRegistry());
Owen Anderson081c34b2010-10-19 17:21:58 +0000201 }
Dan Gohman7c3234c2008-08-27 23:52:12 +0000202
203SelectionDAGISel::~SelectionDAGISel() {
Dan Gohman2048b852009-11-23 18:04:58 +0000204 delete SDB;
Dan Gohman7c3234c2008-08-27 23:52:12 +0000205 delete CurDAG;
206 delete FuncInfo;
207}
208
Chris Lattner495a0b52005-08-17 06:37:43 +0000209void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
Jim Laskeyc7c3f112006-10-16 20:52:31 +0000210 AU.addRequired<AliasAnalysis>();
Dan Gohmana3477fe2009-07-31 23:36:22 +0000211 AU.addPreserved<AliasAnalysis>();
Gordon Henriksen5eca0752008-08-17 18:44:35 +0000212 AU.addRequired<GCModuleInfo>();
Dan Gohmana3477fe2009-07-31 23:36:22 +0000213 AU.addPreserved<GCModuleInfo>();
Jakub Staszak7cc2b072011-06-16 20:22:37 +0000214 if (UseMBPI && OptLevel != CodeGenOpt::None)
215 AU.addRequired<BranchProbabilityInfo>();
Dan Gohmanad2afc22009-07-31 18:16:33 +0000216 MachineFunctionPass::getAnalysisUsage(AU);
Chris Lattner495a0b52005-08-17 06:37:43 +0000217}
Chris Lattner1c08c712005-01-07 07:47:53 +0000218
Chris Lattner96ba57f2010-12-19 04:58:57 +0000219/// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that
220/// may trap on it. In this case we have to split the edge so that the path
221/// through the predecessor block that doesn't go to the phi block doesn't
222/// execute the possibly trapping instruction.
223///
224/// This is required for correctness, so it must be done at -O0.
225///
226static void SplitCriticalSideEffectEdges(Function &Fn, Pass *SDISel) {
227 // Loop for blocks with phi nodes.
228 for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
229 PHINode *PN = dyn_cast<PHINode>(BB->begin());
230 if (PN == 0) continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000231
Chris Lattner96ba57f2010-12-19 04:58:57 +0000232 ReprocessBlock:
233 // For each block with a PHI node, check to see if any of the input values
234 // are potentially trapping constant expressions. Constant expressions are
235 // the only potentially trapping value that can occur as the argument to a
236 // PHI.
237 for (BasicBlock::iterator I = BB->begin(); (PN = dyn_cast<PHINode>(I)); ++I)
238 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
239 ConstantExpr *CE = dyn_cast<ConstantExpr>(PN->getIncomingValue(i));
240 if (CE == 0 || !CE->canTrap()) continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000241
Chris Lattner96ba57f2010-12-19 04:58:57 +0000242 // The only case we have to worry about is when the edge is critical.
243 // Since this block has a PHI Node, we assume it has multiple input
244 // edges: check to see if the pred has multiple successors.
245 BasicBlock *Pred = PN->getIncomingBlock(i);
246 if (Pred->getTerminator()->getNumSuccessors() == 1)
247 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000248
Chris Lattner96ba57f2010-12-19 04:58:57 +0000249 // Okay, we have to split this edge.
250 SplitCriticalEdge(Pred->getTerminator(),
251 GetSuccessorNumber(Pred, BB), SDISel, true);
252 goto ReprocessBlock;
253 }
254 }
255}
256
Dan Gohmanad2afc22009-07-31 18:16:33 +0000257bool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) {
Dan Gohman4344a5d2008-09-09 23:05:00 +0000258 // Do some sanity-checking on the command-line options.
Nick Lewycky8a8d4792011-12-02 22:16:29 +0000259 assert((!EnableFastISelVerbose || TM.Options.EnableFastISel) &&
Dan Gohman4344a5d2008-09-09 23:05:00 +0000260 "-fast-isel-verbose requires -fast-isel");
Nick Lewycky8a8d4792011-12-02 22:16:29 +0000261 assert((!EnableFastISelAbort || TM.Options.EnableFastISel) &&
Dan Gohman4344a5d2008-09-09 23:05:00 +0000262 "-fast-isel-abort requires -fast-isel");
263
Dan Gohmanae541aa2010-04-15 04:33:49 +0000264 const Function &Fn = *mf.getFunction();
Dan Gohman8a110532008-09-05 22:59:21 +0000265 const TargetInstrInfo &TII = *TM.getInstrInfo();
266 const TargetRegisterInfo &TRI = *TM.getRegisterInfo();
267
Dan Gohmanc0fb65d2010-04-14 17:02:07 +0000268 MF = &mf;
Dan Gohman79ce2762009-01-15 19:20:50 +0000269 RegInfo = &MF->getRegInfo();
Dan Gohmanc0fb65d2010-04-14 17:02:07 +0000270 AA = &getAnalysis<AliasAnalysis>();
271 GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0;
272
David Greene1a053232010-01-05 01:26:11 +0000273 DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n");
Chris Lattner1c08c712005-01-07 07:47:53 +0000274
Chris Lattner96ba57f2010-12-19 04:58:57 +0000275 SplitCriticalSideEffectEdges(const_cast<Function&>(Fn), this);
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000276
Chris Lattnerde6e7832010-04-05 06:10:13 +0000277 CurDAG->init(*MF);
Dan Gohman7451d3e2010-05-29 17:03:36 +0000278 FuncInfo->set(Fn, *MF);
Jakub Staszak7cc2b072011-06-16 20:22:37 +0000279
280 if (UseMBPI && OptLevel != CodeGenOpt::None)
281 FuncInfo->BPI = &getAnalysis<BranchProbabilityInfo>();
282 else
283 FuncInfo->BPI = 0;
284
Dan Gohman2048b852009-11-23 18:04:58 +0000285 SDB->init(GFI, *AA);
Chris Lattner1c08c712005-01-07 07:47:53 +0000286
Dan Gohman6a732b52010-04-14 20:05:00 +0000287 SelectAllBasicBlocks(Fn);
Misha Brukmanedf128a2005-04-21 22:36:52 +0000288
Dan Gohman1b79a2f2010-05-01 00:33:28 +0000289 // If the first basic block in the function has live ins that need to be
Dan Gohman8a110532008-09-05 22:59:21 +0000290 // copied into vregs, emit the copies into the top of the block before
291 // emitting the code for the block.
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000292 MachineBasicBlock *EntryMBB = MF->begin();
293 RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII);
294
Devang Patel394427b2010-05-26 20:18:50 +0000295 DenseMap<unsigned, unsigned> LiveInMap;
296 if (!FuncInfo->ArgDbgValues.empty())
297 for (MachineRegisterInfo::livein_iterator LI = RegInfo->livein_begin(),
298 E = RegInfo->livein_end(); LI != E; ++LI)
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000299 if (LI->second)
Devang Patel394427b2010-05-26 20:18:50 +0000300 LiveInMap.insert(std::make_pair(LI->first, LI->second));
301
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000302 // Insert DBG_VALUE instructions for function arguments to the entry block.
303 for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) {
304 MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1];
305 unsigned Reg = MI->getOperand(0).getReg();
306 if (TargetRegisterInfo::isPhysicalRegister(Reg))
307 EntryMBB->insert(EntryMBB->begin(), MI);
308 else {
309 MachineInstr *Def = RegInfo->getVRegDef(Reg);
310 MachineBasicBlock::iterator InsertPos = Def;
Evan Chengf1ced252010-05-04 00:58:39 +0000311 // FIXME: VR def may not be in entry block.
312 Def->getParent()->insert(llvm::next(InsertPos), MI);
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000313 }
Devang Patel394427b2010-05-26 20:18:50 +0000314
315 // If Reg is live-in then update debug info to track its copy in a vreg.
316 DenseMap<unsigned, unsigned>::iterator LDI = LiveInMap.find(Reg);
317 if (LDI != LiveInMap.end()) {
318 MachineInstr *Def = RegInfo->getVRegDef(LDI->second);
319 MachineBasicBlock::iterator InsertPos = Def;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000320 const MDNode *Variable =
Devang Patel394427b2010-05-26 20:18:50 +0000321 MI->getOperand(MI->getNumOperands()-1).getMetadata();
322 unsigned Offset = MI->getOperand(1).getImm();
323 // Def is never a terminator here, so it is ok to increment InsertPos.
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000324 BuildMI(*EntryMBB, ++InsertPos, MI->getDebugLoc(),
Devang Patel394427b2010-05-26 20:18:50 +0000325 TII.get(TargetOpcode::DBG_VALUE))
326 .addReg(LDI->second, RegState::Debug)
327 .addImm(Offset).addMetadata(Variable);
Devang Patel44cfe142010-09-21 20:56:33 +0000328
329 // If this vreg is directly copied into an exported register then
330 // that COPY instructions also need DBG_VALUE, if it is the only
331 // user of LDI->second.
332 MachineInstr *CopyUseMI = NULL;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000333 for (MachineRegisterInfo::use_iterator
334 UI = RegInfo->use_begin(LDI->second);
Devang Patel44cfe142010-09-21 20:56:33 +0000335 MachineInstr *UseMI = UI.skipInstruction();) {
336 if (UseMI->isDebugValue()) continue;
337 if (UseMI->isCopy() && !CopyUseMI && UseMI->getParent() == EntryMBB) {
338 CopyUseMI = UseMI; continue;
339 }
340 // Otherwise this is another use or second copy use.
341 CopyUseMI = NULL; break;
342 }
343 if (CopyUseMI) {
344 MachineInstr *NewMI =
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000345 BuildMI(*MF, CopyUseMI->getDebugLoc(),
Devang Patel44cfe142010-09-21 20:56:33 +0000346 TII.get(TargetOpcode::DBG_VALUE))
347 .addReg(CopyUseMI->getOperand(0).getReg(), RegState::Debug)
348 .addImm(Offset).addMetadata(Variable);
Evan Cheng7c2a4a32011-12-06 22:12:01 +0000349 MachineBasicBlock::iterator Pos = CopyUseMI;
350 EntryMBB->insertAfter(Pos, NewMI);
Devang Patel44cfe142010-09-21 20:56:33 +0000351 }
Devang Patel394427b2010-05-26 20:18:50 +0000352 }
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000353 }
354
Bill Wendling53f76022010-05-17 23:09:50 +0000355 // Determine if there are any calls in this machine function.
356 MachineFrameInfo *MFI = MF->getFrameInfo();
357 if (!MFI->hasCalls()) {
358 for (MachineFunction::const_iterator
359 I = MF->begin(), E = MF->end(); I != E; ++I) {
360 const MachineBasicBlock *MBB = I;
361 for (MachineBasicBlock::const_iterator
362 II = MBB->begin(), IE = MBB->end(); II != IE; ++II) {
Evan Chenge837dea2011-06-28 19:10:37 +0000363 const MCInstrDesc &MCID = TM.getInstrInfo()->get(II->getOpcode());
Bill Wendling8886c492010-07-09 19:44:12 +0000364
Evan Chenge837dea2011-06-28 19:10:37 +0000365 if ((MCID.isCall() && !MCID.isReturn()) ||
Evan Chengc36b7062011-01-07 23:50:32 +0000366 II->isStackAligningInlineAsm()) {
Bill Wendling53f76022010-05-17 23:09:50 +0000367 MFI->setHasCalls(true);
368 goto done;
369 }
370 }
371 }
372 done:;
373 }
374
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000375 // Determine if there is a call to setjmp in the machine function.
Bill Wendling3c5e6092011-10-17 18:43:40 +0000376 MF->setCallsSetJmp(Fn.callsFunctionThatReturnsTwice());
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000377
Dan Gohman84023e02010-07-10 09:00:22 +0000378 // Replace forward-declared registers with the registers containing
379 // the desired value.
380 MachineRegisterInfo &MRI = MF->getRegInfo();
381 for (DenseMap<unsigned, unsigned>::iterator
382 I = FuncInfo->RegFixups.begin(), E = FuncInfo->RegFixups.end();
383 I != E; ++I) {
384 unsigned From = I->first;
385 unsigned To = I->second;
386 // If To is also scheduled to be replaced, find what its ultimate
387 // replacement is.
388 for (;;) {
389 DenseMap<unsigned, unsigned>::iterator J =
390 FuncInfo->RegFixups.find(To);
391 if (J == E) break;
392 To = J->second;
393 }
394 // Replace it.
395 MRI.replaceRegWith(From, To);
396 }
397
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000398 // Release function-specific state. SDB and CurDAG are already cleared
399 // at this point.
400 FuncInfo->clear();
Dan Gohman8a110532008-09-05 22:59:21 +0000401
Chris Lattner1c08c712005-01-07 07:47:53 +0000402 return true;
403}
404
Chris Lattner685090f2011-04-17 17:12:08 +0000405void SelectionDAGISel::SelectBasicBlock(BasicBlock::const_iterator Begin,
406 BasicBlock::const_iterator End,
407 bool &HadTailCall) {
Dan Gohman98ca4f22009-08-05 01:29:28 +0000408 // Lower all of the non-terminator instructions. If a call is emitted
Dan Gohmanf89d1dc2010-04-16 05:06:56 +0000409 // as a tail call, cease emitting nodes for this block. Terminators
410 // are handled below.
Dan Gohmanc105a2b2010-04-22 20:55:53 +0000411 for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I)
Dan Gohmanf89d1dc2010-04-16 05:06:56 +0000412 SDB->visit(*I);
Dan Gohmanf350b272008-08-23 02:25:05 +0000413
Chris Lattnera651cf62005-01-17 19:43:36 +0000414 // Make sure the root of the DAG is up-to-date.
Dan Gohman2048b852009-11-23 18:04:58 +0000415 CurDAG->setRoot(SDB->getControlRoot());
Dan Gohman2048b852009-11-23 18:04:58 +0000416 HadTailCall = SDB->HasTailCall;
417 SDB->clear();
Dan Gohman95140a42010-05-01 00:25:44 +0000418
419 // Final step, emit the lowered DAG as machine code.
Dan Gohman84023e02010-07-10 09:00:22 +0000420 CodeGenAndEmitDAG();
Chris Lattner1c08c712005-01-07 07:47:53 +0000421}
422
Dan Gohmanf350b272008-08-23 02:25:05 +0000423void SelectionDAGISel::ComputeLiveOutVRegInfo() {
Chris Lattneread0d882008-06-17 06:09:18 +0000424 SmallPtrSet<SDNode*, 128> VisitedNodes;
425 SmallVector<SDNode*, 128> Worklist;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000426
Gabor Greifba36cb52008-08-28 21:40:38 +0000427 Worklist.push_back(CurDAG->getRoot().getNode());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000428
Chris Lattneread0d882008-06-17 06:09:18 +0000429 APInt Mask;
430 APInt KnownZero;
431 APInt KnownOne;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000432
Benjamin Kramer7b1e2a52010-01-07 17:27:56 +0000433 do {
434 SDNode *N = Worklist.pop_back_val();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000435
Chris Lattneread0d882008-06-17 06:09:18 +0000436 // If we've already seen this node, ignore it.
437 if (!VisitedNodes.insert(N))
438 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000439
Chris Lattneread0d882008-06-17 06:09:18 +0000440 // Otherwise, add all chain operands to the worklist.
441 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
Owen Anderson825b72b2009-08-11 20:47:22 +0000442 if (N->getOperand(i).getValueType() == MVT::Other)
Gabor Greifba36cb52008-08-28 21:40:38 +0000443 Worklist.push_back(N->getOperand(i).getNode());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000444
Chris Lattneread0d882008-06-17 06:09:18 +0000445 // If this is a CopyToReg with a vreg dest, process it.
446 if (N->getOpcode() != ISD::CopyToReg)
447 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000448
Chris Lattneread0d882008-06-17 06:09:18 +0000449 unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg();
450 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
451 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000452
Chris Lattneread0d882008-06-17 06:09:18 +0000453 // Ignore non-scalar or non-integer values.
Dan Gohman475871a2008-07-27 21:46:04 +0000454 SDValue Src = N->getOperand(2);
Owen Andersone50ed302009-08-10 22:56:29 +0000455 EVT SrcVT = Src.getValueType();
Chris Lattneread0d882008-06-17 06:09:18 +0000456 if (!SrcVT.isInteger() || SrcVT.isVector())
457 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000458
Dan Gohmanf350b272008-08-23 02:25:05 +0000459 unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src);
Chris Lattneread0d882008-06-17 06:09:18 +0000460 Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits());
Dan Gohmanf350b272008-08-23 02:25:05 +0000461 CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne);
Cameron Zwariche1497b92011-02-24 10:00:08 +0000462 FuncInfo->AddLiveOutRegInfo(DestReg, NumSignBits, KnownZero, KnownOne);
Benjamin Kramer7b1e2a52010-01-07 17:27:56 +0000463 } while (!Worklist.empty());
Chris Lattneread0d882008-06-17 06:09:18 +0000464}
465
Dan Gohman84023e02010-07-10 09:00:22 +0000466void SelectionDAGISel::CodeGenAndEmitDAG() {
Dan Gohman462dc7f2008-07-21 20:00:07 +0000467 std::string GroupName;
468 if (TimePassesIsEnabled)
469 GroupName = "Instruction Selection and Scheduling";
470 std::string BlockName;
Andrew Tricka2f45292011-03-23 01:38:28 +0000471 int BlockNumber = -1;
Duncan Sands1f6a3292011-08-12 14:54:45 +0000472 (void)BlockNumber;
Andrew Tricka2f45292011-03-23 01:38:28 +0000473#ifdef NDEBUG
Dan Gohman462dc7f2008-07-21 20:00:07 +0000474 if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs ||
Duncan Sands25cf2272008-11-24 14:53:14 +0000475 ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs ||
476 ViewSUnitDAGs)
Andrew Tricka2f45292011-03-23 01:38:28 +0000477#endif
478 {
479 BlockNumber = FuncInfo->MBB->getNumber();
Benjamin Kramera7b0cb72011-11-15 16:27:03 +0000480 BlockName = MF->getFunction()->getName().str() + ":" +
481 FuncInfo->MBB->getBasicBlock()->getName().str();
Andrew Tricka2f45292011-03-23 01:38:28 +0000482 }
483 DEBUG(dbgs() << "Initial selection DAG: BB#" << BlockNumber
484 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman462dc7f2008-07-21 20:00:07 +0000485
Dan Gohmanf350b272008-08-23 02:25:05 +0000486 if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName);
Dan Gohman417e11b2007-10-08 15:12:17 +0000487
Chris Lattneraf21d552005-10-10 16:47:10 +0000488 // Run the DAG combiner in pre-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000489 {
490 NamedRegionTimer T("DAG Combining 1", GroupName, TimePassesIsEnabled);
Eli Friedman50185242011-11-12 00:35:34 +0000491 CurDAG->Combine(BeforeLegalizeTypes, *AA, OptLevel);
Evan Chengebffb662008-07-01 17:59:20 +0000492 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000493
Andrew Tricka2f45292011-03-23 01:38:28 +0000494 DEBUG(dbgs() << "Optimized lowered selection DAG: BB#" << BlockNumber
495 << " '" << BlockName << "'\n"; CurDAG->dump());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000496
Chris Lattner1c08c712005-01-07 07:47:53 +0000497 // Second step, hack on the DAG until it only uses operations and types that
498 // the target supports.
Dan Gohman714efc62009-12-05 17:51:33 +0000499 if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " +
500 BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000501
Dan Gohman714efc62009-12-05 17:51:33 +0000502 bool Changed;
Dan Gohman03c3dc72010-06-18 15:56:31 +0000503 {
504 NamedRegionTimer T("Type Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000505 Changed = CurDAG->LegalizeTypes();
506 }
507
Andrew Tricka2f45292011-03-23 01:38:28 +0000508 DEBUG(dbgs() << "Type-legalized selection DAG: BB#" << BlockNumber
509 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman714efc62009-12-05 17:51:33 +0000510
511 if (Changed) {
512 if (ViewDAGCombineLT)
513 CurDAG->viewGraph("dag-combine-lt input for " + BlockName);
514
515 // Run the DAG combiner in post-type-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000516 {
517 NamedRegionTimer T("DAG Combining after legalize types", GroupName,
518 TimePassesIsEnabled);
Eli Friedman50185242011-11-12 00:35:34 +0000519 CurDAG->Combine(AfterLegalizeTypes, *AA, OptLevel);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000520 }
521
Andrew Tricka2f45292011-03-23 01:38:28 +0000522 DEBUG(dbgs() << "Optimized type-legalized selection DAG: BB#" << BlockNumber
523 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman714efc62009-12-05 17:51:33 +0000524 }
Dan Gohman462dc7f2008-07-21 20:00:07 +0000525
Dan Gohman03c3dc72010-06-18 15:56:31 +0000526 {
527 NamedRegionTimer T("Vector Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000528 Changed = CurDAG->LegalizeVectors();
529 }
Duncan Sands25cf2272008-11-24 14:53:14 +0000530
Dan Gohman714efc62009-12-05 17:51:33 +0000531 if (Changed) {
Dan Gohman03c3dc72010-06-18 15:56:31 +0000532 {
533 NamedRegionTimer T("Type Legalization 2", GroupName, TimePassesIsEnabled);
Bill Wendling98820072009-12-28 01:51:30 +0000534 CurDAG->LegalizeTypes();
Eli Friedman5c22c802009-05-23 12:35:30 +0000535 }
536
Dan Gohman714efc62009-12-05 17:51:33 +0000537 if (ViewDAGCombineLT)
538 CurDAG->viewGraph("dag-combine-lv input for " + BlockName);
Eli Friedman5c22c802009-05-23 12:35:30 +0000539
Dan Gohman714efc62009-12-05 17:51:33 +0000540 // Run the DAG combiner in post-type-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000541 {
542 NamedRegionTimer T("DAG Combining after legalize vectors", GroupName,
543 TimePassesIsEnabled);
Eli Friedman50185242011-11-12 00:35:34 +0000544 CurDAG->Combine(AfterLegalizeVectorOps, *AA, OptLevel);
Eli Friedman5c22c802009-05-23 12:35:30 +0000545 }
Dan Gohman714efc62009-12-05 17:51:33 +0000546
Andrew Tricka2f45292011-03-23 01:38:28 +0000547 DEBUG(dbgs() << "Optimized vector-legalized selection DAG: BB#"
548 << BlockNumber << " '" << BlockName << "'\n"; CurDAG->dump());
Chris Lattner70587ea2008-07-10 23:37:50 +0000549 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000550
Dan Gohmanf350b272008-08-23 02:25:05 +0000551 if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000552
Dan Gohman03c3dc72010-06-18 15:56:31 +0000553 {
554 NamedRegionTimer T("DAG Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman975716a2011-05-16 22:19:54 +0000555 CurDAG->Legalize();
Evan Chengebffb662008-07-01 17:59:20 +0000556 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000557
Andrew Tricka2f45292011-03-23 01:38:28 +0000558 DEBUG(dbgs() << "Legalized selection DAG: BB#" << BlockNumber
559 << " '" << BlockName << "'\n"; CurDAG->dump());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000560
Dan Gohmanf350b272008-08-23 02:25:05 +0000561 if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000562
Chris Lattneraf21d552005-10-10 16:47:10 +0000563 // Run the DAG combiner in post-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000564 {
565 NamedRegionTimer T("DAG Combining 2", GroupName, TimePassesIsEnabled);
Eli Friedman50185242011-11-12 00:35:34 +0000566 CurDAG->Combine(AfterLegalizeDAG, *AA, OptLevel);
Evan Chengebffb662008-07-01 17:59:20 +0000567 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000568
Andrew Tricka2f45292011-03-23 01:38:28 +0000569 DEBUG(dbgs() << "Optimized legalized selection DAG: BB#" << BlockNumber
570 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman417e11b2007-10-08 15:12:17 +0000571
Dan Gohman4e39e9d2010-06-24 14:30:44 +0000572 if (OptLevel != CodeGenOpt::None)
Dan Gohmanf350b272008-08-23 02:25:05 +0000573 ComputeLiveOutVRegInfo();
Evan Cheng552c4a82006-04-28 02:09:19 +0000574
Chris Lattner552186d2010-03-14 19:27:55 +0000575 if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName);
576
Chris Lattnera33ef482005-03-30 01:10:47 +0000577 // Third, instruction select all of the operations to machine code, adding the
578 // code to the MachineBasicBlock.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000579 {
580 NamedRegionTimer T("Instruction Selection", GroupName, TimePassesIsEnabled);
Chris Lattner7c306da2010-03-02 06:34:30 +0000581 DoInstructionSelection();
Evan Chengebffb662008-07-01 17:59:20 +0000582 }
Evan Chengdb8d56b2008-06-30 20:45:06 +0000583
Andrew Tricka2f45292011-03-23 01:38:28 +0000584 DEBUG(dbgs() << "Selected selection DAG: BB#" << BlockNumber
585 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman462dc7f2008-07-21 20:00:07 +0000586
Dan Gohmanf350b272008-08-23 02:25:05 +0000587 if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000588
Dan Gohman5e843682008-07-14 18:19:29 +0000589 // Schedule machine code.
Dan Gohman47ac0f02009-02-11 04:27:20 +0000590 ScheduleDAGSDNodes *Scheduler = CreateScheduler();
Dan Gohman03c3dc72010-06-18 15:56:31 +0000591 {
592 NamedRegionTimer T("Instruction Scheduling", GroupName,
593 TimePassesIsEnabled);
Dan Gohman84023e02010-07-10 09:00:22 +0000594 Scheduler->Run(CurDAG, FuncInfo->MBB, FuncInfo->InsertPt);
Dan Gohman5e843682008-07-14 18:19:29 +0000595 }
596
Dan Gohman462dc7f2008-07-21 20:00:07 +0000597 if (ViewSUnitDAGs) Scheduler->viewGraph();
598
Daniel Dunbara279bc32009-09-20 02:20:51 +0000599 // Emit machine code to BB. This can change 'BB' to the last block being
Evan Chengdb8d56b2008-06-30 20:45:06 +0000600 // inserted into.
Jakob Stoklund Olesen2622f462010-09-30 19:44:31 +0000601 MachineBasicBlock *FirstMBB = FuncInfo->MBB, *LastMBB;
Dan Gohman03c3dc72010-06-18 15:56:31 +0000602 {
603 NamedRegionTimer T("Instruction Creation", GroupName, TimePassesIsEnabled);
Dan Gohman84023e02010-07-10 09:00:22 +0000604
Jakob Stoklund Olesen2622f462010-09-30 19:44:31 +0000605 LastMBB = FuncInfo->MBB = Scheduler->EmitSchedule();
Dan Gohman84023e02010-07-10 09:00:22 +0000606 FuncInfo->InsertPt = Scheduler->InsertPos;
Dan Gohman5e843682008-07-14 18:19:29 +0000607 }
608
Jakob Stoklund Olesen2622f462010-09-30 19:44:31 +0000609 // If the block was split, make sure we update any references that are used to
610 // update PHI nodes later on.
611 if (FirstMBB != LastMBB)
612 SDB->UpdateSplitBlock(FirstMBB, LastMBB);
613
Dan Gohman5e843682008-07-14 18:19:29 +0000614 // Free the scheduler state.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000615 {
616 NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName,
617 TimePassesIsEnabled);
Dan Gohman5e843682008-07-14 18:19:29 +0000618 delete Scheduler;
Evan Chengebffb662008-07-01 17:59:20 +0000619 }
Evan Chengdb8d56b2008-06-30 20:45:06 +0000620
Dan Gohman95140a42010-05-01 00:25:44 +0000621 // Free the SelectionDAG state, now that we're finished with it.
622 CurDAG->clear();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000623}
Chris Lattner1c08c712005-01-07 07:47:53 +0000624
Chris Lattner7c306da2010-03-02 06:34:30 +0000625void SelectionDAGISel::DoInstructionSelection() {
Andrew Tricka2f45292011-03-23 01:38:28 +0000626 DEBUG(errs() << "===== Instruction selection begins: BB#"
627 << FuncInfo->MBB->getNumber()
628 << " '" << FuncInfo->MBB->getName() << "'\n");
Chris Lattner7c306da2010-03-02 06:34:30 +0000629
630 PreprocessISelDAG();
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000631
Chris Lattner7c306da2010-03-02 06:34:30 +0000632 // Select target instructions for the DAG.
633 {
634 // Number all nodes with a topological order and set DAGSize.
635 DAGSize = CurDAG->AssignTopologicalOrder();
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000636
Chris Lattner7c306da2010-03-02 06:34:30 +0000637 // Create a dummy node (which is not added to allnodes), that adds
638 // a reference to the root node, preventing it from being deleted,
639 // and tracking any changes of the root.
640 HandleSDNode Dummy(CurDAG->getRoot());
641 ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode());
642 ++ISelPosition;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000643
Chris Lattner7c306da2010-03-02 06:34:30 +0000644 // The AllNodes list is now topological-sorted. Visit the
645 // nodes by starting at the end of the list (the root of the
646 // graph) and preceding back toward the beginning (the entry
647 // node).
648 while (ISelPosition != CurDAG->allnodes_begin()) {
649 SDNode *Node = --ISelPosition;
650 // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes,
651 // but there are currently some corner cases that it misses. Also, this
652 // makes it theoretically possible to disable the DAGCombiner.
653 if (Node->use_empty())
654 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000655
Chris Lattner7c306da2010-03-02 06:34:30 +0000656 SDNode *ResNode = Select(Node);
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000657
Chris Lattner82dd3d32010-03-02 07:50:03 +0000658 // FIXME: This is pretty gross. 'Select' should be changed to not return
659 // anything at all and this code should be nuked with a tactical strike.
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000660
Chris Lattner7c306da2010-03-02 06:34:30 +0000661 // If node should not be replaced, continue with the next one.
Chris Lattner82dd3d32010-03-02 07:50:03 +0000662 if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE)
Chris Lattner7c306da2010-03-02 06:34:30 +0000663 continue;
664 // Replace node.
665 if (ResNode)
666 ReplaceUses(Node, ResNode);
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000667
Chris Lattner7c306da2010-03-02 06:34:30 +0000668 // If after the replacement this node is not used any more,
669 // remove this dead node.
670 if (Node->use_empty()) { // Don't delete EntryToken, etc.
671 ISelUpdater ISU(ISelPosition);
672 CurDAG->RemoveDeadNode(Node, &ISU);
673 }
674 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000675
Chris Lattner7c306da2010-03-02 06:34:30 +0000676 CurDAG->setRoot(Dummy.getValue());
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000677 }
Bill Wendling53f76022010-05-17 23:09:50 +0000678
Chris Lattner7c306da2010-03-02 06:34:30 +0000679 DEBUG(errs() << "===== Instruction selection ends:\n");
680
681 PostprocessISelDAG();
Chris Lattner7c306da2010-03-02 06:34:30 +0000682}
683
Dan Gohman25208642010-04-14 19:53:31 +0000684/// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and
685/// do other setup for EH landing-pad blocks.
Dan Gohman84023e02010-07-10 09:00:22 +0000686void SelectionDAGISel::PrepareEHLandingPad() {
Bill Wendling6f500542011-10-05 22:16:11 +0000687 MachineBasicBlock *MBB = FuncInfo->MBB;
688
Dan Gohman25208642010-04-14 19:53:31 +0000689 // Add a label to mark the beginning of the landing pad. Deletion of the
690 // landing pad can thus be detected via the MachineModuleInfo.
Bill Wendling6f500542011-10-05 22:16:11 +0000691 MCSymbol *Label = MF->getMMI().addLandingPad(MBB);
Dan Gohman25208642010-04-14 19:53:31 +0000692
Bill Wendling30e67402011-10-05 22:24:35 +0000693 // Assign the call site to the landing pad's begin label.
694 MF->getMMI().setCallSiteLandingPad(Label, SDB->LPadToCallSiteMap[MBB]);
695
Evan Chenge837dea2011-06-28 19:10:37 +0000696 const MCInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL);
Bill Wendling6f500542011-10-05 22:16:11 +0000697 BuildMI(*MBB, FuncInfo->InsertPt, SDB->getCurDebugLoc(), II)
Dan Gohman84023e02010-07-10 09:00:22 +0000698 .addSym(Label);
Dan Gohman25208642010-04-14 19:53:31 +0000699
700 // Mark exception register as live in.
701 unsigned Reg = TLI.getExceptionAddressRegister();
Bill Wendling6f500542011-10-05 22:16:11 +0000702 if (Reg) MBB->addLiveIn(Reg);
Dan Gohman25208642010-04-14 19:53:31 +0000703
704 // Mark exception selector register as live in.
705 Reg = TLI.getExceptionSelectorRegister();
Bill Wendling6f500542011-10-05 22:16:11 +0000706 if (Reg) MBB->addLiveIn(Reg);
Dan Gohman25208642010-04-14 19:53:31 +0000707
708 // FIXME: Hack around an exception handling flaw (PR1508): the personality
709 // function and list of typeids logically belong to the invoke (or, if you
710 // like, the basic block containing the invoke), and need to be associated
711 // with it in the dwarf exception handling tables. Currently however the
712 // information is provided by an intrinsic (eh.selector) that can be moved
713 // to unexpected places by the optimizers: if the unwind edge is critical,
714 // then breaking it can result in the intrinsics being in the successor of
715 // the landing pad, not the landing pad itself. This results
716 // in exceptions not being caught because no typeids are associated with
717 // the invoke. This may not be the only way things can go wrong, but it
718 // is the only way we try to work around for the moment.
Bill Wendling6f500542011-10-05 22:16:11 +0000719 const BasicBlock *LLVMBB = MBB->getBasicBlock();
Dan Gohman25208642010-04-14 19:53:31 +0000720 const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator());
721
722 if (Br && Br->isUnconditional()) { // Critical edge?
723 BasicBlock::const_iterator I, E;
724 for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I)
725 if (isa<EHSelectorInst>(I))
726 break;
727
728 if (I == E)
729 // No catch info found - try to extract some from the successor.
730 CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo);
731 }
732}
Chris Lattner7c306da2010-03-02 06:34:30 +0000733
Chris Lattnerb686af02011-04-22 21:59:37 +0000734/// TryToFoldFastISelLoad - We're checking to see if we can fold the specified
735/// load into the specified FoldInst. Note that we could have a sequence where
736/// multiple LLVM IR instructions are folded into the same machineinstr. For
737/// example we could have:
738/// A: x = load i32 *P
739/// B: y = icmp A, 42
740/// C: br y, ...
741///
742/// In this scenario, LI is "A", and FoldInst is "C". We know about "B" (and
743/// any other folded instructions) because it is between A and C.
744///
745/// If we succeed in folding the load into the operation, return true.
746///
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000747bool SelectionDAGISel::TryToFoldFastISelLoad(const LoadInst *LI,
Chris Lattnerb686af02011-04-22 21:59:37 +0000748 const Instruction *FoldInst,
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000749 FastISel *FastIS) {
Chris Lattnerb686af02011-04-22 21:59:37 +0000750 // We know that the load has a single use, but don't know what it is. If it
751 // isn't one of the folded instructions, then we can't succeed here. Handle
752 // this by scanning the single-use users of the load until we get to FoldInst.
753 unsigned MaxUsers = 6; // Don't scan down huge single-use chains of instrs.
Andrew Trick3af7a672011-09-20 03:06:13 +0000754
Chris Lattnerb686af02011-04-22 21:59:37 +0000755 const Instruction *TheUser = LI->use_back();
756 while (TheUser != FoldInst && // Scan up until we find FoldInst.
757 // Stay in the right block.
758 TheUser->getParent() == FoldInst->getParent() &&
759 --MaxUsers) { // Don't scan too far.
760 // If there are multiple or no uses of this instruction, then bail out.
761 if (!TheUser->hasOneUse())
762 return false;
Andrew Trick3af7a672011-09-20 03:06:13 +0000763
Chris Lattnerb686af02011-04-22 21:59:37 +0000764 TheUser = TheUser->use_back();
765 }
Andrew Trick3af7a672011-09-20 03:06:13 +0000766
Chris Lattnerf4ea68f2011-08-11 06:26:54 +0000767 // If we didn't find the fold instruction, then we failed to collapse the
768 // sequence.
769 if (TheUser != FoldInst)
770 return false;
Andrew Trick3af7a672011-09-20 03:06:13 +0000771
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000772 // Don't try to fold volatile loads. Target has to deal with alignment
773 // constraints.
774 if (LI->isVolatile()) return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000775
Chris Lattnerb686af02011-04-22 21:59:37 +0000776 // Figure out which vreg this is going into. If there is no assigned vreg yet
777 // then there actually was no reference to it. Perhaps the load is referenced
778 // by a dead instruction.
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000779 unsigned LoadReg = FastIS->getRegForValue(LI);
Chris Lattnerb686af02011-04-22 21:59:37 +0000780 if (LoadReg == 0)
781 return false;
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000782
783 // Check to see what the uses of this vreg are. If it has no uses, or more
784 // than one use (at the machine instr level) then we can't fold it.
785 MachineRegisterInfo::reg_iterator RI = RegInfo->reg_begin(LoadReg);
786 if (RI == RegInfo->reg_end())
787 return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000788
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000789 // See if there is exactly one use of the vreg. If there are multiple uses,
790 // then the instruction got lowered to multiple machine instructions or the
791 // use of the loaded value ended up being multiple operands of the result, in
792 // either case, we can't fold this.
793 MachineRegisterInfo::reg_iterator PostRI = RI; ++PostRI;
794 if (PostRI != RegInfo->reg_end())
795 return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000796
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000797 assert(RI.getOperand().isUse() &&
798 "The only use of the vreg must be a use, we haven't emitted the def!");
799
Chris Lattnerb99fdee2011-01-16 02:27:38 +0000800 MachineInstr *User = &*RI;
Jim Grosbach9d401932011-03-01 01:39:05 +0000801
Chris Lattnerb99fdee2011-01-16 02:27:38 +0000802 // Set the insertion point properly. Folding the load can cause generation of
803 // other random instructions (like sign extends) for addressing modes, make
804 // sure they get inserted in a logical place before the new instruction.
805 FuncInfo->InsertPt = User;
806 FuncInfo->MBB = User->getParent();
807
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000808 // Ask the target to try folding the load.
Chris Lattnerb99fdee2011-01-16 02:27:38 +0000809 return FastIS->TryToFoldLoad(User, RI.getOperandNo(), LI);
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000810}
811
Chris Lattner8bdc2512011-04-17 06:03:19 +0000812/// isFoldedOrDeadInstruction - Return true if the specified instruction is
813/// side-effect free and is either dead or folded into a generated instruction.
814/// Return false if it needs to be emitted.
815static bool isFoldedOrDeadInstruction(const Instruction *I,
816 FunctionLoweringInfo *FuncInfo) {
Chris Lattnerb686af02011-04-22 21:59:37 +0000817 return !I->mayWriteToMemory() && // Side-effecting instructions aren't folded.
818 !isa<TerminatorInst>(I) && // Terminators aren't folded.
819 !isa<DbgInfoIntrinsic>(I) && // Debug instructions aren't folded.
Bill Wendling4477d692011-08-23 21:33:05 +0000820 !isa<LandingPadInst>(I) && // Landingpad instructions aren't folded.
Chris Lattnerb686af02011-04-22 21:59:37 +0000821 !FuncInfo->isExportedInst(I); // Exported instrs must be computed.
Chris Lattner8bdc2512011-04-17 06:03:19 +0000822}
823
Dan Gohman46510a72010-04-15 01:51:59 +0000824void SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) {
Dan Gohmana43abd12008-09-29 21:55:50 +0000825 // Initialize the Fast-ISel state, if needed.
826 FastISel *FastIS = 0;
Nick Lewycky8a8d4792011-12-02 22:16:29 +0000827 if (TM.Options.EnableFastISel)
Dan Gohmana4160c32010-07-07 16:29:44 +0000828 FastIS = TLI.createFastISel(*FuncInfo);
Dan Gohmana43abd12008-09-29 21:55:50 +0000829
830 // Iterate over all basic blocks in the function.
Cameron Zwarich2dbe2852011-02-24 10:00:04 +0000831 ReversePostOrderTraversal<const Function*> RPOT(&Fn);
832 for (ReversePostOrderTraversal<const Function*>::rpo_iterator
833 I = RPOT.begin(), E = RPOT.end(); I != E; ++I) {
834 const BasicBlock *LLVMBB = *I;
Cameron Zwaricha46cd972011-02-24 10:00:13 +0000835
Cameron Zwarich324a24f2011-02-24 10:00:16 +0000836 if (OptLevel != CodeGenOpt::None) {
837 bool AllPredsVisited = true;
838 for (const_pred_iterator PI = pred_begin(LLVMBB), PE = pred_end(LLVMBB);
839 PI != PE; ++PI) {
840 if (!FuncInfo->VisitedBBs.count(*PI)) {
841 AllPredsVisited = false;
842 break;
843 }
844 }
845
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000846 if (AllPredsVisited) {
Chris Lattner8bdc2512011-04-17 06:03:19 +0000847 for (BasicBlock::const_iterator I = LLVMBB->begin();
848 isa<PHINode>(I); ++I)
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000849 FuncInfo->ComputePHILiveOutRegInfo(cast<PHINode>(I));
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000850 } else {
Chris Lattner8bdc2512011-04-17 06:03:19 +0000851 for (BasicBlock::const_iterator I = LLVMBB->begin();
852 isa<PHINode>(I); ++I)
Cameron Zwarich324a24f2011-02-24 10:00:16 +0000853 FuncInfo->InvalidatePHILiveOutRegInfo(cast<PHINode>(I));
Cameron Zwarich324a24f2011-02-24 10:00:16 +0000854 }
855
Cameron Zwaricha46cd972011-02-24 10:00:13 +0000856 FuncInfo->VisitedBBs.insert(LLVMBB);
Cameron Zwarich324a24f2011-02-24 10:00:16 +0000857 }
Cameron Zwaricha46cd972011-02-24 10:00:13 +0000858
Dan Gohman84023e02010-07-10 09:00:22 +0000859 FuncInfo->MBB = FuncInfo->MBBMap[LLVMBB];
860 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
Dan Gohmanf350b272008-08-23 02:25:05 +0000861
Dan Gohmanba5be5c2010-04-20 15:00:41 +0000862 BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI();
Dan Gohman46510a72010-04-15 01:51:59 +0000863 BasicBlock::const_iterator const End = LLVMBB->end();
Dan Gohman84023e02010-07-10 09:00:22 +0000864 BasicBlock::const_iterator BI = End;
Dan Gohman5edd3612008-08-28 20:28:56 +0000865
Dan Gohman84023e02010-07-10 09:00:22 +0000866 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
867
868 // Setup an EH landing-pad block.
869 if (FuncInfo->MBB->isLandingPad())
870 PrepareEHLandingPad();
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000871
Dan Gohmanf5951412010-07-08 01:00:56 +0000872 // Lower any arguments needed in this block if this is the entry block.
Devang Patel68e6bee2011-02-21 23:21:26 +0000873 if (LLVMBB == &Fn.getEntryBlock())
Dan Gohmanf5951412010-07-08 01:00:56 +0000874 LowerArguments(LLVMBB);
875
Dan Gohmanf350b272008-08-23 02:25:05 +0000876 // Before doing SelectionDAG ISel, see if FastISel has been requested.
Dan Gohmand725f042010-05-01 02:44:23 +0000877 if (FastIS) {
Dan Gohman84023e02010-07-10 09:00:22 +0000878 FastIS->startNewBlock();
879
Dan Gohmanf5951412010-07-08 01:00:56 +0000880 // Emit code for any incoming arguments. This must happen before
881 // beginning FastISel on the entry block.
882 if (LLVMBB == &Fn.getEntryBlock()) {
883 CurDAG->setRoot(SDB->getControlRoot());
884 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +0000885 CodeGenAndEmitDAG();
886
887 // If we inserted any instructions at the beginning, make a note of
888 // where they are, so we can be sure to emit subsequent instructions
889 // after them.
890 if (FuncInfo->InsertPt != FuncInfo->MBB->begin())
891 FastIS->setLastLocalValue(llvm::prior(FuncInfo->InsertPt));
892 else
893 FastIS->setLastLocalValue(0);
Dan Gohmanf5951412010-07-08 01:00:56 +0000894 }
Dan Gohman84023e02010-07-10 09:00:22 +0000895
Chad Rosierf91488c2011-11-16 21:02:08 +0000896 unsigned NumFastIselRemaining = std::distance(Begin, End);
Dan Gohmana43abd12008-09-29 21:55:50 +0000897 // Do FastISel on as many instructions as possible.
Dan Gohman84023e02010-07-10 09:00:22 +0000898 for (; BI != Begin; --BI) {
899 const Instruction *Inst = llvm::prior(BI);
900
901 // If we no longer require this instruction, skip it.
Chad Rosierf91488c2011-11-16 21:02:08 +0000902 if (isFoldedOrDeadInstruction(Inst, FuncInfo)) {
903 --NumFastIselRemaining;
Dan Gohman20d4be12010-07-01 02:58:57 +0000904 continue;
Chad Rosierf91488c2011-11-16 21:02:08 +0000905 }
Dan Gohman84023e02010-07-10 09:00:22 +0000906
907 // Bottom-up: reset the insert pos at the top, after any local-value
908 // instructions.
909 FastIS->recomputeInsertPt();
Dan Gohman20d4be12010-07-01 02:58:57 +0000910
Dan Gohman21c14e32010-01-12 04:32:35 +0000911 // Try to select the instruction with FastISel.
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000912 if (FastIS->SelectInstruction(Inst)) {
Chad Rosierf91488c2011-11-16 21:02:08 +0000913 --NumFastIselRemaining;
Jim Grosbach62427ae2011-05-16 21:51:07 +0000914 ++NumFastIselSuccess;
Chris Lattnerb686af02011-04-22 21:59:37 +0000915 // If fast isel succeeded, skip over all the folded instructions, and
916 // then see if there is a load right before the selected instructions.
917 // Try to fold the load if so.
918 const Instruction *BeforeInst = Inst;
919 while (BeforeInst != Begin) {
920 BeforeInst = llvm::prior(BasicBlock::const_iterator(BeforeInst));
921 if (!isFoldedOrDeadInstruction(BeforeInst, FuncInfo))
922 break;
923 }
924 if (BeforeInst != Inst && isa<LoadInst>(BeforeInst) &&
925 BeforeInst->hasOneUse() &&
Chad Rosierf91488c2011-11-16 21:02:08 +0000926 TryToFoldFastISelLoad(cast<LoadInst>(BeforeInst), Inst, FastIS)) {
Chris Lattnerb686af02011-04-22 21:59:37 +0000927 // If we succeeded, don't re-select the load.
928 BI = llvm::next(BasicBlock::const_iterator(BeforeInst));
Chad Rosierf91488c2011-11-16 21:02:08 +0000929 --NumFastIselRemaining;
930 ++NumFastIselSuccess;
931 }
Dan Gohmana43abd12008-09-29 21:55:50 +0000932 continue;
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000933 }
Dan Gohmana43abd12008-09-29 21:55:50 +0000934
935 // Then handle certain instructions as single-LLVM-Instruction blocks.
Dan Gohman84023e02010-07-10 09:00:22 +0000936 if (isa<CallInst>(Inst)) {
Chad Rosierf91488c2011-11-16 21:02:08 +0000937
Dan Gohmana43abd12008-09-29 21:55:50 +0000938 if (EnableFastISelVerbose || EnableFastISelAbort) {
David Greene1a053232010-01-05 01:26:11 +0000939 dbgs() << "FastISel missed call: ";
Dan Gohman84023e02010-07-10 09:00:22 +0000940 Inst->dump();
Dan Gohmana43abd12008-09-29 21:55:50 +0000941 }
942
Dan Gohman84023e02010-07-10 09:00:22 +0000943 if (!Inst->getType()->isVoidTy() && !Inst->use_empty()) {
944 unsigned &R = FuncInfo->ValueMap[Inst];
Dan Gohmana43abd12008-09-29 21:55:50 +0000945 if (!R)
Dan Gohman84023e02010-07-10 09:00:22 +0000946 R = FuncInfo->CreateRegs(Inst->getType());
Dan Gohmana43abd12008-09-29 21:55:50 +0000947 }
948
Dan Gohmanb4afb132009-11-20 02:51:26 +0000949 bool HadTailCall = false;
Devang Pateldf8370b2010-10-25 21:31:46 +0000950 SelectBasicBlock(Inst, BI, HadTailCall);
Dan Gohmanb4afb132009-11-20 02:51:26 +0000951
Chad Rosierf91488c2011-11-16 21:02:08 +0000952 // Recompute NumFastIselRemaining as Selection DAG instruction
953 // selection may have handled the call, input args, etc.
954 unsigned RemainingNow = std::distance(Begin, BI);
955 NumFastIselFailures += NumFastIselRemaining - RemainingNow;
956
Dan Gohmanb4afb132009-11-20 02:51:26 +0000957 // If the call was emitted as a tail call, we're done with the block.
958 if (HadTailCall) {
Dan Gohman84023e02010-07-10 09:00:22 +0000959 --BI;
Dan Gohmanb4afb132009-11-20 02:51:26 +0000960 break;
961 }
962
Chad Rosierf91488c2011-11-16 21:02:08 +0000963 NumFastIselRemaining = RemainingNow;
Dan Gohmana43abd12008-09-29 21:55:50 +0000964 continue;
Dan Gohmanf350b272008-08-23 02:25:05 +0000965 }
Dan Gohmana43abd12008-09-29 21:55:50 +0000966
Eli Friedman9c4dae62011-05-17 23:02:10 +0000967 if (isa<TerminatorInst>(Inst) && !isa<BranchInst>(Inst)) {
968 // Don't abort, and use a different message for terminator misses.
Chad Rosierf91488c2011-11-16 21:02:08 +0000969 NumFastIselFailures += NumFastIselRemaining;
Eli Friedman9c4dae62011-05-17 23:02:10 +0000970 if (EnableFastISelVerbose || EnableFastISelAbort) {
971 dbgs() << "FastISel missed terminator: ";
972 Inst->dump();
973 }
974 } else {
Chad Rosierf91488c2011-11-16 21:02:08 +0000975 NumFastIselFailures += NumFastIselRemaining;
Dan Gohmana43abd12008-09-29 21:55:50 +0000976 if (EnableFastISelVerbose || EnableFastISelAbort) {
David Greene1a053232010-01-05 01:26:11 +0000977 dbgs() << "FastISel miss: ";
Dan Gohman84023e02010-07-10 09:00:22 +0000978 Inst->dump();
Dan Gohmana43abd12008-09-29 21:55:50 +0000979 }
980 if (EnableFastISelAbort)
981 // The "fast" selector couldn't handle something and bailed.
982 // For the purpose of debugging, just abort.
Torok Edwinc23197a2009-07-14 16:55:14 +0000983 llvm_unreachable("FastISel didn't select the entire block");
Dan Gohmana43abd12008-09-29 21:55:50 +0000984 }
985 break;
Dan Gohmanf350b272008-08-23 02:25:05 +0000986 }
Dan Gohman84023e02010-07-10 09:00:22 +0000987
988 FastIS->recomputeInsertPt();
Dan Gohmanf350b272008-08-23 02:25:05 +0000989 }
990
Devang Pateldf8370b2010-10-25 21:31:46 +0000991 if (Begin != BI)
992 ++NumDAGBlocks;
993 else
994 ++NumFastIselBlocks;
995
Eli Friedman37d38bf2011-04-19 17:01:08 +0000996 if (Begin != BI) {
997 // Run SelectionDAG instruction selection on the remainder of the block
998 // not handled by FastISel. If FastISel is not run, this is the entire
999 // block.
1000 bool HadTailCall;
1001 SelectBasicBlock(Begin, BI, HadTailCall);
1002 }
Dan Gohmanf350b272008-08-23 02:25:05 +00001003
Dan Gohman84023e02010-07-10 09:00:22 +00001004 FinishBasicBlock();
Dan Gohman620427d2010-04-22 19:55:20 +00001005 FuncInfo->PHINodesToUpdate.clear();
Evan Cheng39fd6e82008-08-07 00:43:25 +00001006 }
Dan Gohmana43abd12008-09-29 21:55:50 +00001007
1008 delete FastIS;
Devang Patel23385752011-05-23 17:44:13 +00001009 SDB->clearDanglingDebugInfo();
Dan Gohman0e5f1302008-07-07 23:02:41 +00001010}
1011
Dan Gohmanfed90b62008-07-28 21:51:04 +00001012void
Dan Gohman84023e02010-07-10 09:00:22 +00001013SelectionDAGISel::FinishBasicBlock() {
Dan Gohmanf350b272008-08-23 02:25:05 +00001014
David Greene1a053232010-01-05 01:26:11 +00001015 DEBUG(dbgs() << "Total amount of phi nodes to update: "
Dan Gohman927f8662010-06-18 16:00:29 +00001016 << FuncInfo->PHINodesToUpdate.size() << "\n";
1017 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i)
David Greene1a053232010-01-05 01:26:11 +00001018 dbgs() << "Node " << i << " : ("
Dan Gohman620427d2010-04-22 19:55:20 +00001019 << FuncInfo->PHINodesToUpdate[i].first
1020 << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n");
Daniel Dunbara279bc32009-09-20 02:20:51 +00001021
Chris Lattnera33ef482005-03-30 01:10:47 +00001022 // Next, now that we know what the last MBB the LLVM BB expanded is, update
Chris Lattner1c08c712005-01-07 07:47:53 +00001023 // PHI nodes in successors.
Dan Gohman2048b852009-11-23 18:04:58 +00001024 if (SDB->SwitchCases.empty() &&
1025 SDB->JTCases.empty() &&
1026 SDB->BitTestCases.empty()) {
Dan Gohman620427d2010-04-22 19:55:20 +00001027 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
1028 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
Chris Lattner518bb532010-02-09 19:54:29 +00001029 assert(PHI->isPHI() &&
Nate Begemanf15485a2006-03-27 01:32:24 +00001030 "This is not a machine PHI node that we are updating!");
Dan Gohman84023e02010-07-10 09:00:22 +00001031 if (!FuncInfo->MBB->isSuccessor(PHI->getParent()))
Jakob Stoklund Olesen580bba22010-03-05 21:49:10 +00001032 continue;
Dan Gohman620427d2010-04-22 19:55:20 +00001033 PHI->addOperand(
1034 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
Dan Gohman84023e02010-07-10 09:00:22 +00001035 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Nate Begemanf15485a2006-03-27 01:32:24 +00001036 }
1037 return;
Chris Lattner1c08c712005-01-07 07:47:53 +00001038 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001039
Dan Gohman2048b852009-11-23 18:04:58 +00001040 for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001041 // Lower header first, if it wasn't already lowered
Dan Gohman2048b852009-11-23 18:04:58 +00001042 if (!SDB->BitTestCases[i].Emitted) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001043 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001044 FuncInfo->MBB = SDB->BitTestCases[i].Parent;
1045 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001046 // Emit the code
Dan Gohman84023e02010-07-10 09:00:22 +00001047 SDB->visitBitTestHeader(SDB->BitTestCases[i], FuncInfo->MBB);
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();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001051 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001052
Dan Gohman2048b852009-11-23 18:04:58 +00001053 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001054 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001055 FuncInfo->MBB = SDB->BitTestCases[i].Cases[j].ThisBB;
1056 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001057 // Emit the code
1058 if (j+1 != ej)
Evan Chengd08e5b42011-01-06 01:02:44 +00001059 SDB->visitBitTestCase(SDB->BitTestCases[i],
1060 SDB->BitTestCases[i].Cases[j+1].ThisBB,
Dan Gohman2048b852009-11-23 18:04:58 +00001061 SDB->BitTestCases[i].Reg,
Dan Gohman99be8ae2010-04-19 22:41:47 +00001062 SDB->BitTestCases[i].Cases[j],
Dan Gohman84023e02010-07-10 09:00:22 +00001063 FuncInfo->MBB);
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001064 else
Evan Chengd08e5b42011-01-06 01:02:44 +00001065 SDB->visitBitTestCase(SDB->BitTestCases[i],
1066 SDB->BitTestCases[i].Default,
Dan Gohman2048b852009-11-23 18:04:58 +00001067 SDB->BitTestCases[i].Reg,
Dan Gohman99be8ae2010-04-19 22:41:47 +00001068 SDB->BitTestCases[i].Cases[j],
Dan Gohman84023e02010-07-10 09:00:22 +00001069 FuncInfo->MBB);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001070
1071
Dan Gohman2048b852009-11-23 18:04:58 +00001072 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +00001073 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001074 CodeGenAndEmitDAG();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001075 }
1076
1077 // Update PHI Nodes
Dan Gohman620427d2010-04-22 19:55:20 +00001078 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
1079 pi != pe; ++pi) {
1080 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001081 MachineBasicBlock *PHIBB = PHI->getParent();
Chris Lattner518bb532010-02-09 19:54:29 +00001082 assert(PHI->isPHI() &&
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001083 "This is not a machine PHI node that we are updating!");
1084 // This is "default" BB. We have two jumps to it. From "header" BB and
1085 // from last "case" BB.
Dan Gohman2048b852009-11-23 18:04:58 +00001086 if (PHIBB == SDB->BitTestCases[i].Default) {
Jim Grosbachf4549b02010-01-15 00:36:15 +00001087 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001088 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1089 false));
Dan Gohman2048b852009-11-23 18:04:58 +00001090 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent));
Jim Grosbachf4549b02010-01-15 00:36:15 +00001091 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001092 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1093 false));
Dan Gohman2048b852009-11-23 18:04:58 +00001094 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases.
Chris Lattner9ce2e9d2007-12-30 00:57:42 +00001095 back().ThisBB));
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001096 }
1097 // One of "cases" BB.
Dan Gohman2048b852009-11-23 18:04:58 +00001098 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size();
Dan Gohman7c3234c2008-08-27 23:52:12 +00001099 j != ej; ++j) {
Dan Gohman2048b852009-11-23 18:04:58 +00001100 MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB;
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001101 if (cBB->isSuccessor(PHIBB)) {
Jim Grosbachf4549b02010-01-15 00:36:15 +00001102 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001103 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1104 false));
Chris Lattner9ce2e9d2007-12-30 00:57:42 +00001105 PHI->addOperand(MachineOperand::CreateMBB(cBB));
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001106 }
1107 }
1108 }
1109 }
Dan Gohman2048b852009-11-23 18:04:58 +00001110 SDB->BitTestCases.clear();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001111
Nate Begeman9453eea2006-04-23 06:26:20 +00001112 // If the JumpTable record is filled in, then we need to emit a jump table.
1113 // Updating the PHI nodes is tricky in this case, since we need to determine
1114 // whether the PHI is a successor of the range check MBB or the jump table MBB
Dan Gohman2048b852009-11-23 18:04:58 +00001115 for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) {
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +00001116 // Lower header first, if it wasn't already lowered
Dan Gohman2048b852009-11-23 18:04:58 +00001117 if (!SDB->JTCases[i].first.Emitted) {
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +00001118 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001119 FuncInfo->MBB = SDB->JTCases[i].first.HeaderBB;
1120 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +00001121 // Emit the code
Dan Gohman99be8ae2010-04-19 22:41:47 +00001122 SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first,
Dan Gohman84023e02010-07-10 09:00:22 +00001123 FuncInfo->MBB);
Dan Gohman2048b852009-11-23 18:04:58 +00001124 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +00001125 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001126 CodeGenAndEmitDAG();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001127 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001128
Nate Begeman37efe672006-04-22 18:53:45 +00001129 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001130 FuncInfo->MBB = SDB->JTCases[i].second.MBB;
1131 FuncInfo->InsertPt = FuncInfo->MBB->end();
Nate Begeman37efe672006-04-22 18:53:45 +00001132 // Emit the code
Dan Gohman2048b852009-11-23 18:04:58 +00001133 SDB->visitJumpTable(SDB->JTCases[i].second);
1134 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +00001135 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001136 CodeGenAndEmitDAG();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001137
Nate Begeman37efe672006-04-22 18:53:45 +00001138 // Update PHI Nodes
Dan Gohman620427d2010-04-22 19:55:20 +00001139 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
1140 pi != pe; ++pi) {
1141 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
Nate Begeman37efe672006-04-22 18:53:45 +00001142 MachineBasicBlock *PHIBB = PHI->getParent();
Chris Lattner518bb532010-02-09 19:54:29 +00001143 assert(PHI->isPHI() &&
Nate Begeman37efe672006-04-22 18:53:45 +00001144 "This is not a machine PHI node that we are updating!");
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001145 // "default" BB. We can go there only from header BB.
Dan Gohman2048b852009-11-23 18:04:58 +00001146 if (PHIBB == SDB->JTCases[i].second.Default) {
Evan Chengce319102009-09-19 09:51:03 +00001147 PHI->addOperand
Dan Gohman620427d2010-04-22 19:55:20 +00001148 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1149 false));
Evan Chengce319102009-09-19 09:51:03 +00001150 PHI->addOperand
Dan Gohman2048b852009-11-23 18:04:58 +00001151 (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB));
Nate Begemanf4360a42006-05-03 03:48:02 +00001152 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001153 // JT BB. Just iterate over successors here
Dan Gohman84023e02010-07-10 09:00:22 +00001154 if (FuncInfo->MBB->isSuccessor(PHIBB)) {
Evan Chengce319102009-09-19 09:51:03 +00001155 PHI->addOperand
Dan Gohman620427d2010-04-22 19:55:20 +00001156 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1157 false));
Dan Gohman84023e02010-07-10 09:00:22 +00001158 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Nate Begeman37efe672006-04-22 18:53:45 +00001159 }
1160 }
Nate Begeman37efe672006-04-22 18:53:45 +00001161 }
Dan Gohman2048b852009-11-23 18:04:58 +00001162 SDB->JTCases.clear();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001163
Chris Lattnerb2e806e2006-10-22 23:00:53 +00001164 // If the switch block involved a branch to one of the actual successors, we
1165 // need to update PHI nodes in that block.
Dan Gohman620427d2010-04-22 19:55:20 +00001166 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
1167 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
Chris Lattner518bb532010-02-09 19:54:29 +00001168 assert(PHI->isPHI() &&
Chris Lattnerb2e806e2006-10-22 23:00:53 +00001169 "This is not a machine PHI node that we are updating!");
Dan Gohman84023e02010-07-10 09:00:22 +00001170 if (FuncInfo->MBB->isSuccessor(PHI->getParent())) {
Dan Gohman620427d2010-04-22 19:55:20 +00001171 PHI->addOperand(
1172 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
Dan Gohman84023e02010-07-10 09:00:22 +00001173 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Chris Lattnerb2e806e2006-10-22 23:00:53 +00001174 }
1175 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001176
Nate Begemanf15485a2006-03-27 01:32:24 +00001177 // If we generated any switch lowering information, build and codegen any
1178 // additional DAGs necessary.
Dan Gohman2048b852009-11-23 18:04:58 +00001179 for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) {
Nate Begemanf15485a2006-03-27 01:32:24 +00001180 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohmanca5f6162011-01-14 22:26:16 +00001181 FuncInfo->MBB = SDB->SwitchCases[i].ThisBB;
Dan Gohman84023e02010-07-10 09:00:22 +00001182 FuncInfo->InsertPt = FuncInfo->MBB->end();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001183
Dan Gohman95140a42010-05-01 00:25:44 +00001184 // Determine the unique successors.
1185 SmallVector<MachineBasicBlock *, 2> Succs;
1186 Succs.push_back(SDB->SwitchCases[i].TrueBB);
1187 if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB)
1188 Succs.push_back(SDB->SwitchCases[i].FalseBB);
1189
Dan Gohmanca5f6162011-01-14 22:26:16 +00001190 // Emit the code. Note that this could result in FuncInfo->MBB being split.
Dan Gohman84023e02010-07-10 09:00:22 +00001191 SDB->visitSwitchCase(SDB->SwitchCases[i], FuncInfo->MBB);
Dan Gohman2048b852009-11-23 18:04:58 +00001192 CurDAG->setRoot(SDB->getRoot());
Dan Gohman95140a42010-05-01 00:25:44 +00001193 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001194 CodeGenAndEmitDAG();
Dan Gohmanca5f6162011-01-14 22:26:16 +00001195
1196 // Remember the last block, now that any splitting is done, for use in
1197 // populating PHI nodes in successors.
1198 MachineBasicBlock *ThisBB = FuncInfo->MBB;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001199
Chris Lattnerd5e93c02006-09-07 01:59:34 +00001200 // Handle any PHI nodes in successors of this chunk, as if we were coming
1201 // from the original BB before switch expansion. Note that PHI nodes can
1202 // occur multiple times in PHINodesToUpdate. We have to be very careful to
1203 // handle them the right number of times.
Dan Gohman95140a42010-05-01 00:25:44 +00001204 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
Dan Gohman84023e02010-07-10 09:00:22 +00001205 FuncInfo->MBB = Succs[i];
1206 FuncInfo->InsertPt = FuncInfo->MBB->end();
1207 // FuncInfo->MBB may have been removed from the CFG if a branch was
1208 // constant folded.
1209 if (ThisBB->isSuccessor(FuncInfo->MBB)) {
1210 for (MachineBasicBlock::iterator Phi = FuncInfo->MBB->begin();
1211 Phi != FuncInfo->MBB->end() && Phi->isPHI();
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001212 ++Phi) {
1213 // This value for this PHI node is recorded in PHINodesToUpdate.
1214 for (unsigned pn = 0; ; ++pn) {
Dan Gohman620427d2010-04-22 19:55:20 +00001215 assert(pn != FuncInfo->PHINodesToUpdate.size() &&
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001216 "Didn't find PHI entry!");
Dan Gohman620427d2010-04-22 19:55:20 +00001217 if (FuncInfo->PHINodesToUpdate[pn].first == Phi) {
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001218 Phi->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001219 CreateReg(FuncInfo->PHINodesToUpdate[pn].second,
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001220 false));
1221 Phi->addOperand(MachineOperand::CreateMBB(ThisBB));
1222 break;
1223 }
Evan Cheng8be58a12009-09-18 08:26:06 +00001224 }
Chris Lattnerd5e93c02006-09-07 01:59:34 +00001225 }
Nate Begemanf15485a2006-03-27 01:32:24 +00001226 }
1227 }
Chris Lattnera33ef482005-03-30 01:10:47 +00001228 }
Dan Gohman2048b852009-11-23 18:04:58 +00001229 SDB->SwitchCases.clear();
Chris Lattner1c08c712005-01-07 07:47:53 +00001230}
Evan Chenga9c20912006-01-21 02:32:06 +00001231
Jim Laskey13ec7022006-08-01 14:21:23 +00001232
Dan Gohman0a3776d2009-02-06 18:26:51 +00001233/// Create the scheduler. If a specific scheduler was specified
1234/// via the SchedulerRegistry, use it, otherwise select the
1235/// one preferred by the target.
Dan Gohman5e843682008-07-14 18:19:29 +00001236///
Dan Gohman47ac0f02009-02-11 04:27:20 +00001237ScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() {
Jim Laskeyeb577ba2006-08-02 12:30:23 +00001238 RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001239
Jim Laskey13ec7022006-08-01 14:21:23 +00001240 if (!Ctor) {
Jim Laskeyeb577ba2006-08-02 12:30:23 +00001241 Ctor = ISHeuristic;
Jim Laskey9373beb2006-08-01 19:14:14 +00001242 RegisterScheduler::setDefault(Ctor);
Evan Cheng4ef10862006-01-23 07:01:07 +00001243 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001244
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +00001245 return Ctor(this, OptLevel);
Evan Chenga9c20912006-01-21 02:32:06 +00001246}
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001247
Chris Lattner75548062006-10-11 03:58:02 +00001248//===----------------------------------------------------------------------===//
1249// Helper functions used by the generated instruction selector.
1250//===----------------------------------------------------------------------===//
1251// Calls to these methods are generated by tblgen.
1252
1253/// CheckAndMask - The isel is trying to match something like (and X, 255). If
1254/// the dag combiner simplified the 255, we still want to match. RHS is the
1255/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
1256/// specified in the .td file (e.g. 255).
Daniel Dunbara279bc32009-09-20 02:20:51 +00001257bool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS,
Dan Gohmandc9b3d02007-07-24 23:00:27 +00001258 int64_t DesiredMaskS) const {
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001259 const APInt &ActualMask = RHS->getAPIntValue();
1260 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001261
Chris Lattner75548062006-10-11 03:58:02 +00001262 // If the actual mask exactly matches, success!
1263 if (ActualMask == DesiredMask)
1264 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001265
Chris Lattner75548062006-10-11 03:58:02 +00001266 // If the actual AND mask is allowing unallowed bits, this doesn't match.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001267 if (ActualMask.intersects(~DesiredMask))
Chris Lattner75548062006-10-11 03:58:02 +00001268 return false;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001269
Chris Lattner75548062006-10-11 03:58:02 +00001270 // Otherwise, the DAG Combiner may have proven that the value coming in is
1271 // either already zero or is not demanded. Check for known zero input bits.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001272 APInt NeededMask = DesiredMask & ~ActualMask;
Dan Gohmanea859be2007-06-22 14:59:07 +00001273 if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
Chris Lattner75548062006-10-11 03:58:02 +00001274 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001275
Chris Lattner75548062006-10-11 03:58:02 +00001276 // TODO: check to see if missing bits are just not demanded.
1277
1278 // Otherwise, this pattern doesn't match.
1279 return false;
1280}
1281
1282/// CheckOrMask - The isel is trying to match something like (or X, 255). If
1283/// the dag combiner simplified the 255, we still want to match. RHS is the
1284/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
1285/// specified in the .td file (e.g. 255).
Daniel Dunbara279bc32009-09-20 02:20:51 +00001286bool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS,
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001287 int64_t DesiredMaskS) const {
1288 const APInt &ActualMask = RHS->getAPIntValue();
1289 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001290
Chris Lattner75548062006-10-11 03:58:02 +00001291 // If the actual mask exactly matches, success!
1292 if (ActualMask == DesiredMask)
1293 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001294
Chris Lattner75548062006-10-11 03:58:02 +00001295 // If the actual AND mask is allowing unallowed bits, this doesn't match.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001296 if (ActualMask.intersects(~DesiredMask))
Chris Lattner75548062006-10-11 03:58:02 +00001297 return false;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001298
Chris Lattner75548062006-10-11 03:58:02 +00001299 // Otherwise, the DAG Combiner may have proven that the value coming in is
1300 // either already zero or is not demanded. Check for known zero input bits.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001301 APInt NeededMask = DesiredMask & ~ActualMask;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001302
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001303 APInt KnownZero, KnownOne;
Dan Gohmanea859be2007-06-22 14:59:07 +00001304 CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001305
Chris Lattner75548062006-10-11 03:58:02 +00001306 // If all the missing bits in the or are already known to be set, match!
1307 if ((NeededMask & KnownOne) == NeededMask)
1308 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001309
Chris Lattner75548062006-10-11 03:58:02 +00001310 // TODO: check to see if missing bits are just not demanded.
Daniel Dunbara279bc32009-09-20 02:20:51 +00001311
Chris Lattner75548062006-10-11 03:58:02 +00001312 // Otherwise, this pattern doesn't match.
1313 return false;
1314}
1315
Jim Laskey9ff542f2006-08-01 18:29:48 +00001316
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001317/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
1318/// by tblgen. Others should not call it.
1319void SelectionDAGISel::
Dan Gohmanf350b272008-08-23 02:25:05 +00001320SelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) {
Dan Gohman475871a2008-07-27 21:46:04 +00001321 std::vector<SDValue> InOps;
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001322 std::swap(InOps, Ops);
1323
Chris Lattnerdecc2672010-04-07 05:20:54 +00001324 Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0
1325 Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1
1326 Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc
Evan Chengc36b7062011-01-07 23:50:32 +00001327 Ops.push_back(InOps[InlineAsm::Op_ExtraInfo]); // 3 (SideEffect, AlignStack)
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001328
Chris Lattnerdecc2672010-04-07 05:20:54 +00001329 unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size();
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001330 if (InOps[e-1].getValueType() == MVT::Glue)
Chris Lattnera4359be2010-12-23 17:13:18 +00001331 --e; // Don't process a glue operand if it is here.
Daniel Dunbara279bc32009-09-20 02:20:51 +00001332
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001333 while (i != e) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00001334 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue();
Chris Lattnerdecc2672010-04-07 05:20:54 +00001335 if (!InlineAsm::isMemKind(Flags)) {
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001336 // Just skip over this operand, copying the operands verbatim.
Evan Cheng697cbbf2009-03-20 18:03:34 +00001337 Ops.insert(Ops.end(), InOps.begin()+i,
1338 InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1);
1339 i += InlineAsm::getNumOperandRegisters(Flags) + 1;
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001340 } else {
Evan Cheng697cbbf2009-03-20 18:03:34 +00001341 assert(InlineAsm::getNumOperandRegisters(Flags) == 1 &&
1342 "Memory operand with multiple values?");
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001343 // Otherwise, this is a memory operand. Ask the target to select it.
Dan Gohman475871a2008-07-27 21:46:04 +00001344 std::vector<SDValue> SelOps;
Chris Lattnerdecc2672010-04-07 05:20:54 +00001345 if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps))
Chris Lattner75361b62010-04-07 22:58:41 +00001346 report_fatal_error("Could not match memory address. Inline asm"
Chris Lattner87d677c2010-04-07 23:50:38 +00001347 " failure!");
Daniel Dunbara279bc32009-09-20 02:20:51 +00001348
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001349 // Add this to the output node.
Chris Lattnerdecc2672010-04-07 05:20:54 +00001350 unsigned NewFlags =
1351 InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size());
1352 Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32));
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001353 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
1354 i += 2;
1355 }
1356 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001357
Chris Lattnera4359be2010-12-23 17:13:18 +00001358 // Add the glue input back if present.
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001359 if (e != InOps.size())
1360 Ops.push_back(InOps.back());
1361}
Devang Patel794fd752007-05-01 21:15:47 +00001362
Chris Lattnera4359be2010-12-23 17:13:18 +00001363/// findGlueUse - Return use of MVT::Glue value produced by the specified
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001364/// SDNode.
1365///
Chris Lattnera4359be2010-12-23 17:13:18 +00001366static SDNode *findGlueUse(SDNode *N) {
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001367 unsigned FlagResNo = N->getNumValues()-1;
1368 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
1369 SDUse &Use = I.getUse();
1370 if (Use.getResNo() == FlagResNo)
1371 return Use.getUser();
1372 }
1373 return NULL;
1374}
1375
1376/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def".
1377/// This function recursively traverses up the operand chain, ignoring
1378/// certain nodes.
1379static bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse,
Chris Lattnerd1b73822010-03-02 22:20:06 +00001380 SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited,
1381 bool IgnoreChains) {
Chris Lattnerda244a02010-02-23 19:32:27 +00001382 // The NodeID's are given uniques ID's where a node ID is guaranteed to be
1383 // greater than all of its (recursive) operands. If we scan to a point where
1384 // 'use' is smaller than the node we're scanning for, then we know we will
1385 // never find it.
1386 //
1387 // The Use may be -1 (unassigned) if it is a newly allocated node. This can
Chris Lattnera4359be2010-12-23 17:13:18 +00001388 // happen because we scan down to newly selected nodes in the case of glue
Chris Lattnerda244a02010-02-23 19:32:27 +00001389 // uses.
1390 if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1))
1391 return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001392
Chris Lattnerda244a02010-02-23 19:32:27 +00001393 // Don't revisit nodes if we already scanned it and didn't fail, we know we
1394 // won't fail if we scan it again.
1395 if (!Visited.insert(Use))
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001396 return false;
1397
1398 for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {
Chris Lattnerd1b73822010-03-02 22:20:06 +00001399 // Ignore chain uses, they are validated by HandleMergeInputChains.
1400 if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains)
1401 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001402
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001403 SDNode *N = Use->getOperand(i).getNode();
1404 if (N == Def) {
1405 if (Use == ImmedUse || Use == Root)
1406 continue; // We are not looking for immediate use.
1407 assert(N != Root);
1408 return true;
1409 }
1410
1411 // Traverse up the operand chain.
Chris Lattnerd1b73822010-03-02 22:20:06 +00001412 if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001413 return true;
1414 }
1415 return false;
1416}
1417
Evan Cheng014bf212010-02-15 19:41:07 +00001418/// IsProfitableToFold - Returns true if it's profitable to fold the specific
1419/// operand node N of U during instruction selection that starts at Root.
1420bool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U,
1421 SDNode *Root) const {
1422 if (OptLevel == CodeGenOpt::None) return false;
1423 return N.hasOneUse();
1424}
1425
1426/// IsLegalToFold - Returns true if the specific operand node N of
1427/// U can be folded during instruction selection that starts at Root.
Chris Lattnerd1b73822010-03-02 22:20:06 +00001428bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
Dan Gohmand858e902010-04-17 15:26:15 +00001429 CodeGenOpt::Level OptLevel,
1430 bool IgnoreChains) {
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001431 if (OptLevel == CodeGenOpt::None) return false;
1432
1433 // If Root use can somehow reach N through a path that that doesn't contain
1434 // U then folding N would create a cycle. e.g. In the following
1435 // diagram, Root can reach N through X. If N is folded into into Root, then
1436 // X is both a predecessor and a successor of U.
1437 //
1438 // [N*] //
1439 // ^ ^ //
1440 // / \ //
1441 // [U*] [X]? //
1442 // ^ ^ //
1443 // \ / //
1444 // \ / //
1445 // [Root*] //
1446 //
1447 // * indicates nodes to be folded together.
1448 //
Chris Lattnera4359be2010-12-23 17:13:18 +00001449 // If Root produces glue, then it gets (even more) interesting. Since it
1450 // will be "glued" together with its glue use in the scheduler, we need to
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001451 // check if it might reach N.
1452 //
1453 // [N*] //
1454 // ^ ^ //
1455 // / \ //
1456 // [U*] [X]? //
1457 // ^ ^ //
1458 // \ \ //
1459 // \ | //
1460 // [Root*] | //
1461 // ^ | //
1462 // f | //
1463 // | / //
1464 // [Y] / //
1465 // ^ / //
1466 // f / //
1467 // | / //
Chris Lattnera4359be2010-12-23 17:13:18 +00001468 // [GU] //
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001469 //
Chris Lattnera4359be2010-12-23 17:13:18 +00001470 // If GU (glue use) indirectly reaches N (the load), and Root folds N
1471 // (call it Fold), then X is a predecessor of GU and a successor of
1472 // Fold. But since Fold and GU are glued together, this will create
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001473 // a cycle in the scheduling graph.
1474
Chris Lattnera4359be2010-12-23 17:13:18 +00001475 // If the node has glue, walk down the graph to the "lowest" node in the
1476 // glueged set.
Owen Andersone50ed302009-08-10 22:56:29 +00001477 EVT VT = Root->getValueType(Root->getNumValues()-1);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001478 while (VT == MVT::Glue) {
Chris Lattnera4359be2010-12-23 17:13:18 +00001479 SDNode *GU = findGlueUse(Root);
1480 if (GU == NULL)
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001481 break;
Chris Lattnera4359be2010-12-23 17:13:18 +00001482 Root = GU;
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001483 VT = Root->getValueType(Root->getNumValues()-1);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001484
Chris Lattnera4359be2010-12-23 17:13:18 +00001485 // If our query node has a glue result with a use, we've walked up it. If
Chris Lattner18fdaba2010-03-05 06:19:13 +00001486 // the user (which has already been selected) has a chain or indirectly uses
1487 // the chain, our WalkChainUsers predicate will not consider it. Because of
1488 // this, we cannot ignore chains in this predicate.
1489 IgnoreChains = false;
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001490 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001491
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001492
Chris Lattner9bbcd5e2010-03-05 05:49:45 +00001493 SmallPtrSet<SDNode*, 16> Visited;
1494 return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains);
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001495}
1496
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001497SDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) {
1498 std::vector<SDValue> Ops(N->op_begin(), N->op_end());
Dan Gohmane1f188f2009-10-29 22:30:23 +00001499 SelectInlineAsmMemoryOperands(Ops);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001500
Dan Gohmane1f188f2009-10-29 22:30:23 +00001501 std::vector<EVT> VTs;
1502 VTs.push_back(MVT::Other);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001503 VTs.push_back(MVT::Glue);
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001504 SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(),
Dan Gohmane1f188f2009-10-29 22:30:23 +00001505 VTs, &Ops[0], Ops.size());
Chris Lattnerd1b73822010-03-02 22:20:06 +00001506 New->setNodeId(-1);
Dan Gohmane1f188f2009-10-29 22:30:23 +00001507 return New.getNode();
1508}
1509
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001510SDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) {
Chris Lattner518bb532010-02-09 19:54:29 +00001511 return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0));
Dan Gohmane1f188f2009-10-29 22:30:23 +00001512}
1513
Chris Lattner2a49d572010-02-28 22:37:22 +00001514/// GetVBR - decode a vbr encoding whose top bit is set.
Chandler Carruth19e57022010-10-23 08:40:19 +00001515LLVM_ATTRIBUTE_ALWAYS_INLINE static uint64_t
Chris Lattner2a49d572010-02-28 22:37:22 +00001516GetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) {
1517 assert(Val >= 128 && "Not a VBR");
1518 Val &= 127; // Remove first vbr bit.
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001519
Chris Lattner2a49d572010-02-28 22:37:22 +00001520 unsigned Shift = 7;
1521 uint64_t NextBits;
1522 do {
Chris Lattner14df8dc2010-02-28 22:38:43 +00001523 NextBits = MatcherTable[Idx++];
Chris Lattner2a49d572010-02-28 22:37:22 +00001524 Val |= (NextBits&127) << Shift;
1525 Shift += 7;
1526 } while (NextBits & 128);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001527
Chris Lattner2a49d572010-02-28 22:37:22 +00001528 return Val;
1529}
1530
Chris Lattner2a49d572010-02-28 22:37:22 +00001531
Chris Lattnera4359be2010-12-23 17:13:18 +00001532/// UpdateChainsAndGlue - When a match is complete, this method updates uses of
1533/// interior glue and chain results to use the new glue and chain results.
Chris Lattner82dd3d32010-03-02 07:50:03 +00001534void SelectionDAGISel::
Chris Lattnera4359be2010-12-23 17:13:18 +00001535UpdateChainsAndGlue(SDNode *NodeToMatch, SDValue InputChain,
1536 const SmallVectorImpl<SDNode*> &ChainNodesMatched,
1537 SDValue InputGlue,
1538 const SmallVectorImpl<SDNode*> &GlueResultNodesMatched,
1539 bool isMorphNodeTo) {
Chris Lattner82dd3d32010-03-02 07:50:03 +00001540 SmallVector<SDNode*, 4> NowDeadNodes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001541
Chris Lattner82dd3d32010-03-02 07:50:03 +00001542 ISelUpdater ISU(ISelPosition);
1543
Chris Lattner2a49d572010-02-28 22:37:22 +00001544 // Now that all the normal results are replaced, we replace the chain and
Chris Lattnera4359be2010-12-23 17:13:18 +00001545 // glue results if present.
Chris Lattner2a49d572010-02-28 22:37:22 +00001546 if (!ChainNodesMatched.empty()) {
1547 assert(InputChain.getNode() != 0 &&
1548 "Matched input chains but didn't produce a chain");
1549 // Loop over all of the nodes we matched that produced a chain result.
1550 // Replace all the chain results with the final chain we ended up with.
1551 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1552 SDNode *ChainNode = ChainNodesMatched[i];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001553
Chris Lattner82dd3d32010-03-02 07:50:03 +00001554 // If this node was already deleted, don't look at it.
1555 if (ChainNode->getOpcode() == ISD::DELETED_NODE)
1556 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001557
Chris Lattner2a49d572010-02-28 22:37:22 +00001558 // Don't replace the results of the root node if we're doing a
1559 // MorphNodeTo.
1560 if (ChainNode == NodeToMatch && isMorphNodeTo)
1561 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001562
Chris Lattner2a49d572010-02-28 22:37:22 +00001563 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001564 if (ChainVal.getValueType() == MVT::Glue)
Chris Lattner2a49d572010-02-28 22:37:22 +00001565 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
1566 assert(ChainVal.getValueType() == MVT::Other && "Not a chain?");
Chris Lattner82dd3d32010-03-02 07:50:03 +00001567 CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001568
Chris Lattner856fb392010-03-28 05:28:31 +00001569 // If the node became dead and we haven't already seen it, delete it.
1570 if (ChainNode->use_empty() &&
1571 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode))
Chris Lattner82dd3d32010-03-02 07:50:03 +00001572 NowDeadNodes.push_back(ChainNode);
Chris Lattner2a49d572010-02-28 22:37:22 +00001573 }
1574 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001575
Chris Lattnera4359be2010-12-23 17:13:18 +00001576 // If the result produces glue, update any glue results in the matched
1577 // pattern with the glue result.
1578 if (InputGlue.getNode() != 0) {
Chris Lattner2a49d572010-02-28 22:37:22 +00001579 // Handle any interior nodes explicitly marked.
Chris Lattnera4359be2010-12-23 17:13:18 +00001580 for (unsigned i = 0, e = GlueResultNodesMatched.size(); i != e; ++i) {
1581 SDNode *FRN = GlueResultNodesMatched[i];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001582
Chris Lattner82dd3d32010-03-02 07:50:03 +00001583 // If this node was already deleted, don't look at it.
1584 if (FRN->getOpcode() == ISD::DELETED_NODE)
1585 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001586
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001587 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue &&
Chris Lattnera4359be2010-12-23 17:13:18 +00001588 "Doesn't have a glue result");
Chris Lattner2a49d572010-02-28 22:37:22 +00001589 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1),
Chris Lattnera4359be2010-12-23 17:13:18 +00001590 InputGlue, &ISU);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001591
Chris Lattner19e37cb2010-03-28 04:54:33 +00001592 // If the node became dead and we haven't already seen it, delete it.
1593 if (FRN->use_empty() &&
1594 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN))
Chris Lattner82dd3d32010-03-02 07:50:03 +00001595 NowDeadNodes.push_back(FRN);
Chris Lattner2a49d572010-02-28 22:37:22 +00001596 }
1597 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001598
Chris Lattner82dd3d32010-03-02 07:50:03 +00001599 if (!NowDeadNodes.empty())
1600 CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001601
Chris Lattner2a49d572010-02-28 22:37:22 +00001602 DEBUG(errs() << "ISEL: Match complete!\n");
1603}
1604
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001605enum ChainResult {
1606 CR_Simple,
1607 CR_InducesCycle,
1608 CR_LeadsToInteriorNode
1609};
1610
1611/// WalkChainUsers - Walk down the users of the specified chained node that is
1612/// part of the pattern we're matching, looking at all of the users we find.
1613/// This determines whether something is an interior node, whether we have a
1614/// non-pattern node in between two pattern nodes (which prevent folding because
1615/// it would induce a cycle) and whether we have a TokenFactor node sandwiched
1616/// between pattern nodes (in which case the TF becomes part of the pattern).
1617///
1618/// The walk we do here is guaranteed to be small because we quickly get down to
1619/// already selected nodes "below" us.
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001620static ChainResult
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001621WalkChainUsers(SDNode *ChainedNode,
1622 SmallVectorImpl<SDNode*> &ChainedNodesInPattern,
1623 SmallVectorImpl<SDNode*> &InteriorChainedNodes) {
1624 ChainResult Result = CR_Simple;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001625
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001626 for (SDNode::use_iterator UI = ChainedNode->use_begin(),
1627 E = ChainedNode->use_end(); UI != E; ++UI) {
1628 // Make sure the use is of the chain, not some other value we produce.
1629 if (UI.getUse().getValueType() != MVT::Other) continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001630
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001631 SDNode *User = *UI;
1632
1633 // If we see an already-selected machine node, then we've gone beyond the
1634 // pattern that we're selecting down into the already selected chunk of the
1635 // DAG.
1636 if (User->isMachineOpcode() ||
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001637 User->getOpcode() == ISD::HANDLENODE) // Root of the graph.
1638 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001639
Chris Lattnerd1b73822010-03-02 22:20:06 +00001640 if (User->getOpcode() == ISD::CopyToReg ||
1641 User->getOpcode() == ISD::CopyFromReg ||
Chris Lattner7561d482010-03-14 02:33:54 +00001642 User->getOpcode() == ISD::INLINEASM ||
1643 User->getOpcode() == ISD::EH_LABEL) {
Chris Lattnerd1b73822010-03-02 22:20:06 +00001644 // If their node ID got reset to -1 then they've already been selected.
1645 // Treat them like a MachineOpcode.
1646 if (User->getNodeId() == -1)
1647 continue;
1648 }
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001649
1650 // If we have a TokenFactor, we handle it specially.
1651 if (User->getOpcode() != ISD::TokenFactor) {
1652 // If the node isn't a token factor and isn't part of our pattern, then it
1653 // must be a random chained node in between two nodes we're selecting.
1654 // This happens when we have something like:
1655 // x = load ptr
1656 // call
1657 // y = x+4
1658 // store y -> ptr
1659 // Because we structurally match the load/store as a read/modify/write,
1660 // but the call is chained between them. We cannot fold in this case
1661 // because it would induce a cycle in the graph.
1662 if (!std::count(ChainedNodesInPattern.begin(),
1663 ChainedNodesInPattern.end(), User))
1664 return CR_InducesCycle;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001665
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001666 // Otherwise we found a node that is part of our pattern. For example in:
1667 // x = load ptr
1668 // y = x+4
1669 // store y -> ptr
1670 // This would happen when we're scanning down from the load and see the
1671 // store as a user. Record that there is a use of ChainedNode that is
1672 // part of the pattern and keep scanning uses.
1673 Result = CR_LeadsToInteriorNode;
1674 InteriorChainedNodes.push_back(User);
1675 continue;
1676 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001677
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001678 // If we found a TokenFactor, there are two cases to consider: first if the
1679 // TokenFactor is just hanging "below" the pattern we're matching (i.e. no
1680 // uses of the TF are in our pattern) we just want to ignore it. Second,
1681 // the TokenFactor can be sandwiched in between two chained nodes, like so:
1682 // [Load chain]
1683 // ^
1684 // |
1685 // [Load]
1686 // ^ ^
1687 // | \ DAG's like cheese
1688 // / \ do you?
1689 // / |
1690 // [TokenFactor] [Op]
1691 // ^ ^
1692 // | |
1693 // \ /
1694 // \ /
1695 // [Store]
1696 //
1697 // In this case, the TokenFactor becomes part of our match and we rewrite it
1698 // as a new TokenFactor.
1699 //
1700 // To distinguish these two cases, do a recursive walk down the uses.
1701 switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) {
1702 case CR_Simple:
1703 // If the uses of the TokenFactor are just already-selected nodes, ignore
1704 // it, it is "below" our pattern.
1705 continue;
1706 case CR_InducesCycle:
1707 // If the uses of the TokenFactor lead to nodes that are not part of our
1708 // pattern that are not selected, folding would turn this into a cycle,
1709 // bail out now.
1710 return CR_InducesCycle;
1711 case CR_LeadsToInteriorNode:
1712 break; // Otherwise, keep processing.
1713 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001714
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001715 // Okay, we know we're in the interesting interior case. The TokenFactor
1716 // is now going to be considered part of the pattern so that we rewrite its
1717 // uses (it may have uses that are not part of the pattern) with the
1718 // ultimate chain result of the generated code. We will also add its chain
1719 // inputs as inputs to the ultimate TokenFactor we create.
1720 Result = CR_LeadsToInteriorNode;
1721 ChainedNodesInPattern.push_back(User);
1722 InteriorChainedNodes.push_back(User);
1723 continue;
1724 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001725
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001726 return Result;
1727}
1728
Chris Lattner6b307922010-03-02 00:00:03 +00001729/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains
Chris Lattner00592ec2010-03-02 19:34:59 +00001730/// operation for when the pattern matched at least one node with a chains. The
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001731/// input vector contains a list of all of the chained nodes that we match. We
1732/// must determine if this is a valid thing to cover (i.e. matching it won't
1733/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will
1734/// be used as the input node chain for the generated nodes.
Chris Lattner6b307922010-03-02 00:00:03 +00001735static SDValue
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001736HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
Chris Lattner6b307922010-03-02 00:00:03 +00001737 SelectionDAG *CurDAG) {
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001738 // Walk all of the chained nodes we've matched, recursively scanning down the
1739 // users of the chain result. This adds any TokenFactor nodes that are caught
1740 // in between chained nodes to the chained and interior nodes list.
1741 SmallVector<SDNode*, 3> InteriorChainedNodes;
1742 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1743 if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
1744 InteriorChainedNodes) == CR_InducesCycle)
1745 return SDValue(); // Would induce a cycle.
1746 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001747
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001748 // Okay, we have walked all the matched nodes and collected TokenFactor nodes
1749 // that we are interested in. Form our input TokenFactor node.
Chris Lattner6b307922010-03-02 00:00:03 +00001750 SmallVector<SDValue, 3> InputChains;
1751 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001752 // Add the input chain of this node to the InputChains list (which will be
1753 // the operands of the generated TokenFactor) if it's not an interior node.
1754 SDNode *N = ChainNodesMatched[i];
1755 if (N->getOpcode() != ISD::TokenFactor) {
1756 if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N))
1757 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001758
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001759 // Otherwise, add the input chain.
1760 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
1761 assert(InChain.getValueType() == MVT::Other && "Not a chain");
Chris Lattner6b307922010-03-02 00:00:03 +00001762 InputChains.push_back(InChain);
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001763 continue;
1764 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001765
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001766 // If we have a token factor, we want to add all inputs of the token factor
1767 // that are not part of the pattern we're matching.
1768 for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) {
1769 if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
Chris Lattner6183fbd2010-03-02 02:37:23 +00001770 N->getOperand(op).getNode()))
1771 InputChains.push_back(N->getOperand(op));
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001772 }
Chris Lattner6b307922010-03-02 00:00:03 +00001773 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001774
Chris Lattner6b307922010-03-02 00:00:03 +00001775 SDValue Res;
1776 if (InputChains.size() == 1)
1777 return InputChains[0];
1778 return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(),
1779 MVT::Other, &InputChains[0], InputChains.size());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001780}
Chris Lattner2a49d572010-02-28 22:37:22 +00001781
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001782/// MorphNode - Handle morphing a node in place for the selector.
1783SDNode *SelectionDAGISel::
1784MorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList,
1785 const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) {
1786 // It is possible we're using MorphNodeTo to replace a node with no
1787 // normal results with one that has a normal result (or we could be
Chris Lattnera4359be2010-12-23 17:13:18 +00001788 // adding a chain) and the input could have glue and chains as well.
Chris Lattnercaa88702010-03-28 08:43:23 +00001789 // In this case we need to shift the operands down.
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001790 // FIXME: This is a horrible hack and broken in obscure cases, no worse
Chris Lattnera6f86932010-03-27 18:54:50 +00001791 // than the old isel though.
Chris Lattnera4359be2010-12-23 17:13:18 +00001792 int OldGlueResultNo = -1, OldChainResultNo = -1;
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001793
1794 unsigned NTMNumResults = Node->getNumValues();
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001795 if (Node->getValueType(NTMNumResults-1) == MVT::Glue) {
Chris Lattnera4359be2010-12-23 17:13:18 +00001796 OldGlueResultNo = NTMNumResults-1;
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001797 if (NTMNumResults != 1 &&
1798 Node->getValueType(NTMNumResults-2) == MVT::Other)
1799 OldChainResultNo = NTMNumResults-2;
1800 } else if (Node->getValueType(NTMNumResults-1) == MVT::Other)
1801 OldChainResultNo = NTMNumResults-1;
1802
Chris Lattner61c97f62010-03-02 07:14:49 +00001803 // Call the underlying SelectionDAG routine to do the transmogrification. Note
1804 // that this deletes operands of the old node that become dead.
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001805 SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps);
1806
1807 // MorphNodeTo can operate in two ways: if an existing node with the
1808 // specified operands exists, it can just return it. Otherwise, it
1809 // updates the node in place to have the requested operands.
1810 if (Res == Node) {
1811 // If we updated the node in place, reset the node ID. To the isel,
1812 // this should be just like a newly allocated machine node.
1813 Res->setNodeId(-1);
1814 }
1815
1816 unsigned ResNumResults = Res->getNumValues();
Chris Lattnera4359be2010-12-23 17:13:18 +00001817 // Move the glue if needed.
1818 if ((EmitNodeInfo & OPFL_GlueOutput) && OldGlueResultNo != -1 &&
1819 (unsigned)OldGlueResultNo != ResNumResults-1)
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001820 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldGlueResultNo),
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001821 SDValue(Res, ResNumResults-1));
1822
Chris Lattnera4359be2010-12-23 17:13:18 +00001823 if ((EmitNodeInfo & OPFL_GlueOutput) != 0)
Bill Wendlingd9cb7ca2010-07-04 08:58:43 +00001824 --ResNumResults;
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001825
1826 // Move the chain reference if needed.
1827 if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 &&
1828 (unsigned)OldChainResultNo != ResNumResults-1)
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001829 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo),
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001830 SDValue(Res, ResNumResults-1));
1831
1832 // Otherwise, no replacement happened because the node already exists. Replace
1833 // Uses of the old node with the new one.
1834 if (Res != Node)
1835 CurDAG->ReplaceAllUsesWith(Node, Res);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001836
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001837 return Res;
1838}
1839
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001840/// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
Chandler Carruth19e57022010-10-23 08:40:19 +00001841LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001842CheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex,
Chris Lattnerd847bc22010-09-21 22:00:25 +00001843 SDValue N,
1844 const SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
Chris Lattnerda828e32010-03-03 07:46:25 +00001845 // Accept if it is exactly the same as a previously recorded node.
1846 unsigned RecNo = MatcherTable[MatcherIndex++];
1847 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00001848 return N == RecordedNodes[RecNo].first;
Chris Lattnerda828e32010-03-03 07:46:25 +00001849}
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001850
Chris Lattnerda828e32010-03-03 07:46:25 +00001851/// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
Chandler Carruth19e57022010-10-23 08:40:19 +00001852LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001853CheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1854 SelectionDAGISel &SDISel) {
1855 return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]);
1856}
1857
1858/// CheckNodePredicate - Implements OP_CheckNodePredicate.
Chandler Carruth19e57022010-10-23 08:40:19 +00001859LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001860CheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1861 SelectionDAGISel &SDISel, SDNode *N) {
1862 return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]);
1863}
1864
Chandler Carruth19e57022010-10-23 08:40:19 +00001865LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001866CheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1867 SDNode *N) {
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00001868 uint16_t Opc = MatcherTable[MatcherIndex++];
1869 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
1870 return N->getOpcode() == Opc;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001871}
1872
Chandler Carruth19e57022010-10-23 08:40:19 +00001873LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001874CheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1875 SDValue N, const TargetLowering &TLI) {
1876 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
1877 if (N.getValueType() == VT) return true;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001878
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001879 // Handle the case when VT is iPTR.
1880 return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy();
1881}
1882
Chandler Carruth19e57022010-10-23 08:40:19 +00001883LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001884CheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1885 SDValue N, const TargetLowering &TLI,
1886 unsigned ChildNo) {
1887 if (ChildNo >= N.getNumOperands())
1888 return false; // Match fails if out of range child #.
1889 return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI);
1890}
1891
1892
Chandler Carruth19e57022010-10-23 08:40:19 +00001893LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001894CheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1895 SDValue N) {
1896 return cast<CondCodeSDNode>(N)->get() ==
1897 (ISD::CondCode)MatcherTable[MatcherIndex++];
1898}
1899
Chandler Carruth19e57022010-10-23 08:40:19 +00001900LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001901CheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1902 SDValue N, const TargetLowering &TLI) {
1903 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
1904 if (cast<VTSDNode>(N)->getVT() == VT)
1905 return true;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001906
Chris Lattnerda828e32010-03-03 07:46:25 +00001907 // Handle the case when VT is iPTR.
1908 return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy();
1909}
1910
Chandler Carruth19e57022010-10-23 08:40:19 +00001911LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001912CheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1913 SDValue N) {
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 Lattnerf1b7c7d2010-03-03 07:31:15 +00001918 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N);
1919 return C != 0 && C->getSExtValue() == Val;
1920}
1921
Chandler Carruth19e57022010-10-23 08:40:19 +00001922LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001923CheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1924 SDValue N, SelectionDAGISel &SDISel) {
1925 int64_t Val = MatcherTable[MatcherIndex++];
1926 if (Val & 128)
1927 Val = GetVBR(Val, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001928
Chris Lattnerda828e32010-03-03 07:46:25 +00001929 if (N->getOpcode() != ISD::AND) return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001930
Chris Lattnerda828e32010-03-03 07:46:25 +00001931 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
1932 return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val);
1933}
1934
Chandler Carruth19e57022010-10-23 08:40:19 +00001935LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001936CheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1937 SDValue N, SelectionDAGISel &SDISel) {
1938 int64_t Val = MatcherTable[MatcherIndex++];
1939 if (Val & 128)
1940 Val = GetVBR(Val, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001941
Chris Lattnerda828e32010-03-03 07:46:25 +00001942 if (N->getOpcode() != ISD::OR) return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001943
Chris Lattnerda828e32010-03-03 07:46:25 +00001944 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
1945 return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val);
1946}
1947
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001948/// IsPredicateKnownToFail - If we know how and can do so without pushing a
1949/// scope, evaluate the current node. If the current predicate is known to
1950/// fail, set Result=true and return anything. If the current predicate is
1951/// known to pass, set Result=false and return the MatcherIndex to continue
1952/// with. If the current predicate is unknown, set Result=false and return the
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001953/// MatcherIndex to continue with.
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001954static unsigned IsPredicateKnownToFail(const unsigned char *Table,
1955 unsigned Index, SDValue N,
Chris Lattnerda828e32010-03-03 07:46:25 +00001956 bool &Result, SelectionDAGISel &SDISel,
Chris Lattnerd847bc22010-09-21 22:00:25 +00001957 SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001958 switch (Table[Index++]) {
1959 default:
1960 Result = false;
1961 return Index-1; // Could not evaluate this predicate.
Chris Lattnerda828e32010-03-03 07:46:25 +00001962 case SelectionDAGISel::OPC_CheckSame:
1963 Result = !::CheckSame(Table, Index, N, RecordedNodes);
1964 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001965 case SelectionDAGISel::OPC_CheckPatternPredicate:
Chris Lattnerda828e32010-03-03 07:46:25 +00001966 Result = !::CheckPatternPredicate(Table, Index, SDISel);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001967 return Index;
1968 case SelectionDAGISel::OPC_CheckPredicate:
Chris Lattnerda828e32010-03-03 07:46:25 +00001969 Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode());
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001970 return Index;
1971 case SelectionDAGISel::OPC_CheckOpcode:
1972 Result = !::CheckOpcode(Table, Index, N.getNode());
1973 return Index;
1974 case SelectionDAGISel::OPC_CheckType:
1975 Result = !::CheckType(Table, Index, N, SDISel.TLI);
1976 return Index;
1977 case SelectionDAGISel::OPC_CheckChild0Type:
1978 case SelectionDAGISel::OPC_CheckChild1Type:
1979 case SelectionDAGISel::OPC_CheckChild2Type:
1980 case SelectionDAGISel::OPC_CheckChild3Type:
1981 case SelectionDAGISel::OPC_CheckChild4Type:
1982 case SelectionDAGISel::OPC_CheckChild5Type:
1983 case SelectionDAGISel::OPC_CheckChild6Type:
Chris Lattnerda828e32010-03-03 07:46:25 +00001984 case SelectionDAGISel::OPC_CheckChild7Type:
1985 Result = !::CheckChildType(Table, Index, N, SDISel.TLI,
1986 Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001987 return Index;
Chris Lattnerda828e32010-03-03 07:46:25 +00001988 case SelectionDAGISel::OPC_CheckCondCode:
1989 Result = !::CheckCondCode(Table, Index, N);
1990 return Index;
1991 case SelectionDAGISel::OPC_CheckValueType:
1992 Result = !::CheckValueType(Table, Index, N, SDISel.TLI);
1993 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001994 case SelectionDAGISel::OPC_CheckInteger:
1995 Result = !::CheckInteger(Table, Index, N);
1996 return Index;
Chris Lattnerda828e32010-03-03 07:46:25 +00001997 case SelectionDAGISel::OPC_CheckAndImm:
1998 Result = !::CheckAndImm(Table, Index, N, SDISel);
1999 return Index;
2000 case SelectionDAGISel::OPC_CheckOrImm:
2001 Result = !::CheckOrImm(Table, Index, N, SDISel);
2002 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002003 }
2004}
2005
Dan Gohmanb3579832010-04-15 17:08:50 +00002006namespace {
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00002007
Chris Lattner2a49d572010-02-28 22:37:22 +00002008struct MatchScope {
2009 /// FailIndex - If this match fails, this is the index to continue with.
2010 unsigned FailIndex;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002011
Chris Lattner2a49d572010-02-28 22:37:22 +00002012 /// NodeStack - The node stack when the scope was formed.
2013 SmallVector<SDValue, 4> NodeStack;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002014
Chris Lattner2a49d572010-02-28 22:37:22 +00002015 /// NumRecordedNodes - The number of recorded nodes when the scope was formed.
2016 unsigned NumRecordedNodes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002017
Chris Lattner2a49d572010-02-28 22:37:22 +00002018 /// NumMatchedMemRefs - The number of matched memref entries.
2019 unsigned NumMatchedMemRefs;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002020
2021 /// InputChain/InputGlue - The current chain/glue
Chris Lattnera4359be2010-12-23 17:13:18 +00002022 SDValue InputChain, InputGlue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002023
2024 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
Chris Lattnera4359be2010-12-23 17:13:18 +00002025 bool HasChainNodesMatched, HasGlueResultNodesMatched;
Chris Lattner2a49d572010-02-28 22:37:22 +00002026};
2027
Dan Gohmanb3579832010-04-15 17:08:50 +00002028}
2029
Chris Lattner2a49d572010-02-28 22:37:22 +00002030SDNode *SelectionDAGISel::
2031SelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable,
2032 unsigned TableSize) {
2033 // FIXME: Should these even be selected? Handle these cases in the caller?
2034 switch (NodeToMatch->getOpcode()) {
2035 default:
2036 break;
2037 case ISD::EntryToken: // These nodes remain the same.
2038 case ISD::BasicBlock:
2039 case ISD::Register:
Chris Lattner3b9d6212010-03-14 17:53:23 +00002040 //case ISD::VALUETYPE:
2041 //case ISD::CONDCODE:
Chris Lattner2a49d572010-02-28 22:37:22 +00002042 case ISD::HANDLENODE:
Chris Lattnerdecc2672010-04-07 05:20:54 +00002043 case ISD::MDNODE_SDNODE:
Chris Lattner2a49d572010-02-28 22:37:22 +00002044 case ISD::TargetConstant:
2045 case ISD::TargetConstantFP:
2046 case ISD::TargetConstantPool:
2047 case ISD::TargetFrameIndex:
2048 case ISD::TargetExternalSymbol:
2049 case ISD::TargetBlockAddress:
2050 case ISD::TargetJumpTable:
2051 case ISD::TargetGlobalTLSAddress:
2052 case ISD::TargetGlobalAddress:
2053 case ISD::TokenFactor:
2054 case ISD::CopyFromReg:
2055 case ISD::CopyToReg:
Chris Lattner7561d482010-03-14 02:33:54 +00002056 case ISD::EH_LABEL:
Chris Lattnerd1b73822010-03-02 22:20:06 +00002057 NodeToMatch->setNodeId(-1); // Mark selected.
Chris Lattner2a49d572010-02-28 22:37:22 +00002058 return 0;
2059 case ISD::AssertSext:
2060 case ISD::AssertZext:
2061 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0),
2062 NodeToMatch->getOperand(0));
2063 return 0;
2064 case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch);
Chris Lattner2a49d572010-02-28 22:37:22 +00002065 case ISD::UNDEF: return Select_UNDEF(NodeToMatch);
2066 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002067
Chris Lattner2a49d572010-02-28 22:37:22 +00002068 assert(!NodeToMatch->isMachineOpcode() && "Node already selected!");
2069
2070 // Set up the node stack with NodeToMatch as the only node on the stack.
2071 SmallVector<SDValue, 8> NodeStack;
2072 SDValue N = SDValue(NodeToMatch, 0);
2073 NodeStack.push_back(N);
2074
2075 // MatchScopes - Scopes used when matching, if a match failure happens, this
2076 // indicates where to continue checking.
2077 SmallVector<MatchScope, 8> MatchScopes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002078
Chris Lattner2a49d572010-02-28 22:37:22 +00002079 // RecordedNodes - This is the set of nodes that have been recorded by the
Chris Lattnerd847bc22010-09-21 22:00:25 +00002080 // state machine. The second value is the parent of the node, or null if the
2081 // root is recorded.
2082 SmallVector<std::pair<SDValue, SDNode*>, 8> RecordedNodes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002083
Chris Lattner2a49d572010-02-28 22:37:22 +00002084 // MatchedMemRefs - This is the set of MemRef's we've seen in the input
2085 // pattern.
2086 SmallVector<MachineMemOperand*, 2> MatchedMemRefs;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002087
Chris Lattnera4359be2010-12-23 17:13:18 +00002088 // These are the current input chain and glue for use when generating nodes.
Chris Lattner2a49d572010-02-28 22:37:22 +00002089 // Various Emit operations change these. For example, emitting a copytoreg
2090 // uses and updates these.
Chris Lattnera4359be2010-12-23 17:13:18 +00002091 SDValue InputChain, InputGlue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002092
Chris Lattner2a49d572010-02-28 22:37:22 +00002093 // ChainNodesMatched - If a pattern matches nodes that have input/output
2094 // chains, the OPC_EmitMergeInputChains operation is emitted which indicates
2095 // which ones they are. The result is captured into this list so that we can
2096 // update the chain results when the pattern is complete.
2097 SmallVector<SDNode*, 3> ChainNodesMatched;
Chris Lattnera4359be2010-12-23 17:13:18 +00002098 SmallVector<SDNode*, 3> GlueResultNodesMatched;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002099
Chris Lattner2a49d572010-02-28 22:37:22 +00002100 DEBUG(errs() << "ISEL: Starting pattern match on root node: ";
2101 NodeToMatch->dump(CurDAG);
2102 errs() << '\n');
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002103
Chris Lattner7390eeb2010-03-01 18:47:11 +00002104 // Determine where to start the interpreter. Normally we start at opcode #0,
2105 // but if the state machine starts with an OPC_SwitchOpcode, then we
2106 // accelerate the first lookup (which is guaranteed to be hot) with the
2107 // OpcodeOffset table.
Chris Lattner2a49d572010-02-28 22:37:22 +00002108 unsigned MatcherIndex = 0;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002109
Chris Lattner7390eeb2010-03-01 18:47:11 +00002110 if (!OpcodeOffset.empty()) {
2111 // Already computed the OpcodeOffset table, just index into it.
2112 if (N.getOpcode() < OpcodeOffset.size())
2113 MatcherIndex = OpcodeOffset[N.getOpcode()];
2114 DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n");
2115
2116 } else if (MatcherTable[0] == OPC_SwitchOpcode) {
2117 // Otherwise, the table isn't computed, but the state machine does start
2118 // with an OPC_SwitchOpcode instruction. Populate the table now, since this
2119 // is the first time we're selecting an instruction.
2120 unsigned Idx = 1;
2121 while (1) {
2122 // Get the size of this case.
2123 unsigned CaseSize = MatcherTable[Idx++];
2124 if (CaseSize & 128)
2125 CaseSize = GetVBR(CaseSize, MatcherTable, Idx);
2126 if (CaseSize == 0) break;
2127
2128 // Get the opcode, add the index to the table.
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002129 uint16_t Opc = MatcherTable[Idx++];
2130 Opc |= (unsigned short)MatcherTable[Idx++] << 8;
Chris Lattner7390eeb2010-03-01 18:47:11 +00002131 if (Opc >= OpcodeOffset.size())
2132 OpcodeOffset.resize((Opc+1)*2);
2133 OpcodeOffset[Opc] = Idx;
2134 Idx += CaseSize;
2135 }
2136
2137 // Okay, do the lookup for the first opcode.
2138 if (N.getOpcode() < OpcodeOffset.size())
2139 MatcherIndex = OpcodeOffset[N.getOpcode()];
2140 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002141
Chris Lattner2a49d572010-02-28 22:37:22 +00002142 while (1) {
2143 assert(MatcherIndex < TableSize && "Invalid index");
Dan Gohman19b38262010-03-09 02:15:05 +00002144#ifndef NDEBUG
2145 unsigned CurrentOpcodeIndex = MatcherIndex;
2146#endif
Chris Lattner2a49d572010-02-28 22:37:22 +00002147 BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++];
2148 switch (Opcode) {
2149 case OPC_Scope: {
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002150 // Okay, the semantics of this operation are that we should push a scope
2151 // then evaluate the first child. However, pushing a scope only to have
2152 // the first check fail (which then pops it) is inefficient. If we can
2153 // determine immediately that the first check (or first several) will
2154 // immediately fail, don't even bother pushing a scope for them.
2155 unsigned FailIndex;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002156
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002157 while (1) {
2158 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2159 if (NumToSkip & 128)
2160 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2161 // Found the end of the scope with no match.
2162 if (NumToSkip == 0) {
2163 FailIndex = 0;
2164 break;
2165 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002166
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002167 FailIndex = MatcherIndex+NumToSkip;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002168
Chris Lattnera6f86932010-03-27 18:54:50 +00002169 unsigned MatcherIndexOfPredicate = MatcherIndex;
2170 (void)MatcherIndexOfPredicate; // silence warning.
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002171
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002172 // If we can't evaluate this predicate without pushing a scope (e.g. if
2173 // it is a 'MoveParent') or if the predicate succeeds on this node, we
2174 // push the scope and evaluate the full predicate chain.
2175 bool Result;
2176 MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N,
Chris Lattnerda828e32010-03-03 07:46:25 +00002177 Result, *this, RecordedNodes);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002178 if (!Result)
2179 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002180
Chris Lattnera6f86932010-03-27 18:54:50 +00002181 DEBUG(errs() << " Skipped scope entry (due to false predicate) at "
2182 << "index " << MatcherIndexOfPredicate
2183 << ", continuing at " << FailIndex << "\n");
Chris Lattnerbed993d2010-03-28 19:46:56 +00002184 ++NumDAGIselRetries;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002185
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002186 // Otherwise, we know that this case of the Scope is guaranteed to fail,
2187 // move to the next case.
2188 MatcherIndex = FailIndex;
2189 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002190
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002191 // If the whole scope failed to match, bail.
2192 if (FailIndex == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002193
Chris Lattner2a49d572010-02-28 22:37:22 +00002194 // Push a MatchScope which indicates where to go if the first child fails
2195 // to match.
2196 MatchScope NewEntry;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002197 NewEntry.FailIndex = FailIndex;
Chris Lattner2a49d572010-02-28 22:37:22 +00002198 NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());
2199 NewEntry.NumRecordedNodes = RecordedNodes.size();
2200 NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
2201 NewEntry.InputChain = InputChain;
Chris Lattnera4359be2010-12-23 17:13:18 +00002202 NewEntry.InputGlue = InputGlue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002203 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
Chris Lattnera4359be2010-12-23 17:13:18 +00002204 NewEntry.HasGlueResultNodesMatched = !GlueResultNodesMatched.empty();
Chris Lattner2a49d572010-02-28 22:37:22 +00002205 MatchScopes.push_back(NewEntry);
2206 continue;
2207 }
Chris Lattnerd847bc22010-09-21 22:00:25 +00002208 case OPC_RecordNode: {
Chris Lattner2a49d572010-02-28 22:37:22 +00002209 // Remember this node, it may end up being an operand in the pattern.
Chris Lattnerd847bc22010-09-21 22:00:25 +00002210 SDNode *Parent = 0;
2211 if (NodeStack.size() > 1)
2212 Parent = NodeStack[NodeStack.size()-2].getNode();
2213 RecordedNodes.push_back(std::make_pair(N, Parent));
Chris Lattner2a49d572010-02-28 22:37:22 +00002214 continue;
Chris Lattnerd847bc22010-09-21 22:00:25 +00002215 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002216
Chris Lattner2a49d572010-02-28 22:37:22 +00002217 case OPC_RecordChild0: case OPC_RecordChild1:
2218 case OPC_RecordChild2: case OPC_RecordChild3:
2219 case OPC_RecordChild4: case OPC_RecordChild5:
2220 case OPC_RecordChild6: case OPC_RecordChild7: {
2221 unsigned ChildNo = Opcode-OPC_RecordChild0;
2222 if (ChildNo >= N.getNumOperands())
2223 break; // Match fails if out of range child #.
2224
Chris Lattnerd847bc22010-09-21 22:00:25 +00002225 RecordedNodes.push_back(std::make_pair(N->getOperand(ChildNo),
2226 N.getNode()));
Chris Lattner2a49d572010-02-28 22:37:22 +00002227 continue;
2228 }
2229 case OPC_RecordMemRef:
2230 MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand());
2231 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002232
Chris Lattner29d8f0c2010-12-23 17:24:32 +00002233 case OPC_CaptureGlueInput:
Chris Lattnera4359be2010-12-23 17:13:18 +00002234 // If the current node has an input glue, capture it in InputGlue.
Chris Lattner2a49d572010-02-28 22:37:22 +00002235 if (N->getNumOperands() != 0 &&
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002236 N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Glue)
Chris Lattnera4359be2010-12-23 17:13:18 +00002237 InputGlue = N->getOperand(N->getNumOperands()-1);
Chris Lattner2a49d572010-02-28 22:37:22 +00002238 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002239
Chris Lattner2a49d572010-02-28 22:37:22 +00002240 case OPC_MoveChild: {
2241 unsigned ChildNo = MatcherTable[MatcherIndex++];
2242 if (ChildNo >= N.getNumOperands())
2243 break; // Match fails if out of range child #.
2244 N = N.getOperand(ChildNo);
2245 NodeStack.push_back(N);
2246 continue;
2247 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002248
Chris Lattner2a49d572010-02-28 22:37:22 +00002249 case OPC_MoveParent:
2250 // Pop the current node off the NodeStack.
2251 NodeStack.pop_back();
2252 assert(!NodeStack.empty() && "Node stack imbalance!");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002253 N = NodeStack.back();
Chris Lattner2a49d572010-02-28 22:37:22 +00002254 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002255
Chris Lattnerda828e32010-03-03 07:46:25 +00002256 case OPC_CheckSame:
2257 if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002258 continue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002259 case OPC_CheckPatternPredicate:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002260 if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002261 continue;
2262 case OPC_CheckPredicate:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002263 if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this,
2264 N.getNode()))
2265 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002266 continue;
Chris Lattner57bf8a42010-03-04 01:23:08 +00002267 case OPC_CheckComplexPat: {
2268 unsigned CPNum = MatcherTable[MatcherIndex++];
2269 unsigned RecNo = MatcherTable[MatcherIndex++];
2270 assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002271 if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo].second,
2272 RecordedNodes[RecNo].first, CPNum,
Chris Lattner57bf8a42010-03-04 01:23:08 +00002273 RecordedNodes))
Chris Lattner2a49d572010-02-28 22:37:22 +00002274 break;
2275 continue;
Chris Lattner57bf8a42010-03-04 01:23:08 +00002276 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002277 case OPC_CheckOpcode:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002278 if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break;
2279 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002280
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002281 case OPC_CheckType:
2282 if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002283 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002284
Chris Lattnereb669212010-03-01 06:59:22 +00002285 case OPC_SwitchOpcode: {
2286 unsigned CurNodeOpcode = N.getOpcode();
Chris Lattner7d892d62010-03-01 07:43:08 +00002287 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
Chris Lattnereb669212010-03-01 06:59:22 +00002288 unsigned CaseSize;
2289 while (1) {
2290 // Get the size of this case.
2291 CaseSize = MatcherTable[MatcherIndex++];
2292 if (CaseSize & 128)
2293 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2294 if (CaseSize == 0) break;
2295
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002296 uint16_t Opc = MatcherTable[MatcherIndex++];
2297 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2298
Chris Lattnereb669212010-03-01 06:59:22 +00002299 // If the opcode matches, then we will execute this case.
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002300 if (CurNodeOpcode == Opc)
Chris Lattnereb669212010-03-01 06:59:22 +00002301 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002302
Chris Lattnereb669212010-03-01 06:59:22 +00002303 // Otherwise, skip over this case.
2304 MatcherIndex += CaseSize;
2305 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002306
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002307 // If no cases matched, bail out.
Chris Lattnereb669212010-03-01 06:59:22 +00002308 if (CaseSize == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002309
Chris Lattnereb669212010-03-01 06:59:22 +00002310 // Otherwise, execute the case we found.
2311 DEBUG(errs() << " OpcodeSwitch from " << SwitchStart
2312 << " to " << MatcherIndex << "\n");
2313 continue;
2314 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002315
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002316 case OPC_SwitchType: {
Duncan Sandscdfad362010-11-03 12:17:33 +00002317 MVT CurNodeVT = N.getValueType().getSimpleVT();
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002318 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2319 unsigned CaseSize;
2320 while (1) {
2321 // Get the size of this case.
2322 CaseSize = MatcherTable[MatcherIndex++];
2323 if (CaseSize & 128)
2324 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2325 if (CaseSize == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002326
Duncan Sandscdfad362010-11-03 12:17:33 +00002327 MVT CaseVT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002328 if (CaseVT == MVT::iPTR)
Duncan Sandscdfad362010-11-03 12:17:33 +00002329 CaseVT = TLI.getPointerTy();
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002330
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002331 // If the VT matches, then we will execute this case.
2332 if (CurNodeVT == CaseVT)
2333 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002334
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002335 // Otherwise, skip over this case.
2336 MatcherIndex += CaseSize;
2337 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002338
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002339 // If no cases matched, bail out.
2340 if (CaseSize == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002341
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002342 // Otherwise, execute the case we found.
2343 DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString()
2344 << "] from " << SwitchStart << " to " << MatcherIndex<<'\n');
2345 continue;
2346 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002347 case OPC_CheckChild0Type: case OPC_CheckChild1Type:
2348 case OPC_CheckChild2Type: case OPC_CheckChild3Type:
2349 case OPC_CheckChild4Type: case OPC_CheckChild5Type:
Chris Lattnerda828e32010-03-03 07:46:25 +00002350 case OPC_CheckChild6Type: case OPC_CheckChild7Type:
2351 if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI,
2352 Opcode-OPC_CheckChild0Type))
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002353 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002354 continue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002355 case OPC_CheckCondCode:
Chris Lattnerda828e32010-03-03 07:46:25 +00002356 if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002357 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002358 case OPC_CheckValueType:
2359 if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002360 continue;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002361 case OPC_CheckInteger:
2362 if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002363 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002364 case OPC_CheckAndImm:
2365 if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002366 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002367 case OPC_CheckOrImm:
2368 if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002369 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002370
Chris Lattner2a49d572010-02-28 22:37:22 +00002371 case OPC_CheckFoldableChainNode: {
2372 assert(NodeStack.size() != 1 && "No parent node");
2373 // Verify that all intermediate nodes between the root and this one have
2374 // a single use.
2375 bool HasMultipleUses = false;
2376 for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)
2377 if (!NodeStack[i].hasOneUse()) {
2378 HasMultipleUses = true;
2379 break;
2380 }
2381 if (HasMultipleUses) break;
2382
2383 // Check to see that the target thinks this is profitable to fold and that
2384 // we can fold it without inducing cycles in the graph.
2385 if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2386 NodeToMatch) ||
2387 !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
Dan Gohmand858e902010-04-17 15:26:15 +00002388 NodeToMatch, OptLevel,
2389 true/*We validate our own chains*/))
Chris Lattner2a49d572010-02-28 22:37:22 +00002390 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002391
Chris Lattner2a49d572010-02-28 22:37:22 +00002392 continue;
2393 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002394 case OPC_EmitInteger: {
2395 MVT::SimpleValueType VT =
2396 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2397 int64_t Val = MatcherTable[MatcherIndex++];
2398 if (Val & 128)
2399 Val = GetVBR(Val, MatcherTable, MatcherIndex);
Chris Lattnerd847bc22010-09-21 22:00:25 +00002400 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002401 CurDAG->getTargetConstant(Val, VT), (SDNode*)0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002402 continue;
2403 }
2404 case OPC_EmitRegister: {
2405 MVT::SimpleValueType VT =
2406 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2407 unsigned RegNo = MatcherTable[MatcherIndex++];
Chris Lattnerd847bc22010-09-21 22:00:25 +00002408 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002409 CurDAG->getRegister(RegNo, VT), (SDNode*)0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002410 continue;
2411 }
Jim Grosbach2d76c842011-03-01 01:37:19 +00002412 case OPC_EmitRegister2: {
2413 // For targets w/ more than 256 register names, the register enum
2414 // values are stored in two bytes in the matcher table (just like
2415 // opcodes).
2416 MVT::SimpleValueType VT =
2417 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2418 unsigned RegNo = MatcherTable[MatcherIndex++];
2419 RegNo |= MatcherTable[MatcherIndex++] << 8;
2420 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
2421 CurDAG->getRegister(RegNo, VT), (SDNode*)0));
2422 continue;
2423 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002424
Chris Lattner2a49d572010-02-28 22:37:22 +00002425 case OPC_EmitConvertToTarget: {
2426 // Convert from IMM/FPIMM to target version.
2427 unsigned RecNo = MatcherTable[MatcherIndex++];
2428 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002429 SDValue Imm = RecordedNodes[RecNo].first;
Chris Lattner2a49d572010-02-28 22:37:22 +00002430
2431 if (Imm->getOpcode() == ISD::Constant) {
2432 int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue();
2433 Imm = CurDAG->getTargetConstant(Val, Imm.getValueType());
2434 } else if (Imm->getOpcode() == ISD::ConstantFP) {
2435 const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue();
2436 Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType());
2437 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002438
Chris Lattnerd847bc22010-09-21 22:00:25 +00002439 RecordedNodes.push_back(std::make_pair(Imm, RecordedNodes[RecNo].second));
Chris Lattner2a49d572010-02-28 22:37:22 +00002440 continue;
2441 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002442
Chris Lattneraa4e3392010-03-28 05:50:16 +00002443 case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0
2444 case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1
2445 // These are space-optimized forms of OPC_EmitMergeInputChains.
2446 assert(InputChain.getNode() == 0 &&
2447 "EmitMergeInputChains should be the first chain producing node");
2448 assert(ChainNodesMatched.empty() &&
2449 "Should only have one EmitMergeInputChains per match");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002450
Chris Lattneraa4e3392010-03-28 05:50:16 +00002451 // Read all of the chained nodes.
2452 unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1;
2453 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002454 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002455
Chris Lattneraa4e3392010-03-28 05:50:16 +00002456 // FIXME: What if other value results of the node have uses not matched
2457 // by this pattern?
2458 if (ChainNodesMatched.back() != NodeToMatch &&
Chris Lattnerd847bc22010-09-21 22:00:25 +00002459 !RecordedNodes[RecNo].first.hasOneUse()) {
Chris Lattneraa4e3392010-03-28 05:50:16 +00002460 ChainNodesMatched.clear();
2461 break;
2462 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002463
Chris Lattneraa4e3392010-03-28 05:50:16 +00002464 // Merge the input chains if they are not intra-pattern references.
2465 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002466
Chris Lattneraa4e3392010-03-28 05:50:16 +00002467 if (InputChain.getNode() == 0)
2468 break; // Failed to merge.
2469 continue;
2470 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002471
Chris Lattner2a49d572010-02-28 22:37:22 +00002472 case OPC_EmitMergeInputChains: {
2473 assert(InputChain.getNode() == 0 &&
2474 "EmitMergeInputChains should be the first chain producing node");
2475 // This node gets a list of nodes we matched in the input that have
2476 // chains. We want to token factor all of the input chains to these nodes
2477 // together. However, if any of the input chains is actually one of the
2478 // nodes matched in this pattern, then we have an intra-match reference.
2479 // Ignore these because the newly token factored chain should not refer to
2480 // the old nodes.
2481 unsigned NumChains = MatcherTable[MatcherIndex++];
2482 assert(NumChains != 0 && "Can't TF zero chains");
2483
2484 assert(ChainNodesMatched.empty() &&
2485 "Should only have one EmitMergeInputChains per match");
2486
Chris Lattner2a49d572010-02-28 22:37:22 +00002487 // Read all of the chained nodes.
Chris Lattner00592ec2010-03-02 19:34:59 +00002488 for (unsigned i = 0; i != NumChains; ++i) {
2489 unsigned RecNo = MatcherTable[MatcherIndex++];
Chris Lattner2a49d572010-02-28 22:37:22 +00002490 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002491 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002492
Chris Lattner2a49d572010-02-28 22:37:22 +00002493 // FIXME: What if other value results of the node have uses not matched
2494 // by this pattern?
2495 if (ChainNodesMatched.back() != NodeToMatch &&
Chris Lattnerd847bc22010-09-21 22:00:25 +00002496 !RecordedNodes[RecNo].first.hasOneUse()) {
Chris Lattner2a49d572010-02-28 22:37:22 +00002497 ChainNodesMatched.clear();
2498 break;
2499 }
2500 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002501
Chris Lattner6b307922010-03-02 00:00:03 +00002502 // If the inner loop broke out, the match fails.
2503 if (ChainNodesMatched.empty())
2504 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002505
Chris Lattner6b307922010-03-02 00:00:03 +00002506 // Merge the input chains if they are not intra-pattern references.
2507 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002508
Chris Lattner6b307922010-03-02 00:00:03 +00002509 if (InputChain.getNode() == 0)
2510 break; // Failed to merge.
Chris Lattner2a49d572010-02-28 22:37:22 +00002511
Chris Lattner2a49d572010-02-28 22:37:22 +00002512 continue;
2513 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002514
Chris Lattner2a49d572010-02-28 22:37:22 +00002515 case OPC_EmitCopyToReg: {
2516 unsigned RecNo = MatcherTable[MatcherIndex++];
2517 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2518 unsigned DestPhysReg = MatcherTable[MatcherIndex++];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002519
Chris Lattner2a49d572010-02-28 22:37:22 +00002520 if (InputChain.getNode() == 0)
2521 InputChain = CurDAG->getEntryNode();
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002522
Chris Lattner2a49d572010-02-28 22:37:22 +00002523 InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(),
Chris Lattnerd847bc22010-09-21 22:00:25 +00002524 DestPhysReg, RecordedNodes[RecNo].first,
Chris Lattnera4359be2010-12-23 17:13:18 +00002525 InputGlue);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002526
Chris Lattnera4359be2010-12-23 17:13:18 +00002527 InputGlue = InputChain.getValue(1);
Chris Lattner2a49d572010-02-28 22:37:22 +00002528 continue;
2529 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002530
Chris Lattner2a49d572010-02-28 22:37:22 +00002531 case OPC_EmitNodeXForm: {
2532 unsigned XFormNo = MatcherTable[MatcherIndex++];
2533 unsigned RecNo = MatcherTable[MatcherIndex++];
2534 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002535 SDValue Res = RunSDNodeXForm(RecordedNodes[RecNo].first, XFormNo);
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002536 RecordedNodes.push_back(std::pair<SDValue,SDNode*>(Res, (SDNode*) 0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002537 continue;
2538 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002539
Chris Lattner2a49d572010-02-28 22:37:22 +00002540 case OPC_EmitNode:
2541 case OPC_MorphNodeTo: {
Chris Lattner14df8dc2010-02-28 22:38:43 +00002542 uint16_t TargetOpc = MatcherTable[MatcherIndex++];
2543 TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
Chris Lattner2a49d572010-02-28 22:37:22 +00002544 unsigned EmitNodeInfo = MatcherTable[MatcherIndex++];
2545 // Get the result VT list.
2546 unsigned NumVTs = MatcherTable[MatcherIndex++];
2547 SmallVector<EVT, 4> VTs;
2548 for (unsigned i = 0; i != NumVTs; ++i) {
2549 MVT::SimpleValueType VT =
2550 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2551 if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy;
2552 VTs.push_back(VT);
2553 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002554
Chris Lattner2a49d572010-02-28 22:37:22 +00002555 if (EmitNodeInfo & OPFL_Chain)
2556 VTs.push_back(MVT::Other);
Chris Lattnera4359be2010-12-23 17:13:18 +00002557 if (EmitNodeInfo & OPFL_GlueOutput)
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002558 VTs.push_back(MVT::Glue);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002559
Chris Lattner7d892d62010-03-01 07:43:08 +00002560 // This is hot code, so optimize the two most common cases of 1 and 2
2561 // results.
2562 SDVTList VTList;
2563 if (VTs.size() == 1)
2564 VTList = CurDAG->getVTList(VTs[0]);
2565 else if (VTs.size() == 2)
2566 VTList = CurDAG->getVTList(VTs[0], VTs[1]);
2567 else
2568 VTList = CurDAG->getVTList(VTs.data(), VTs.size());
Chris Lattner2a49d572010-02-28 22:37:22 +00002569
2570 // Get the operand list.
2571 unsigned NumOps = MatcherTable[MatcherIndex++];
2572 SmallVector<SDValue, 8> Ops;
2573 for (unsigned i = 0; i != NumOps; ++i) {
2574 unsigned RecNo = MatcherTable[MatcherIndex++];
2575 if (RecNo & 128)
2576 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002577
Chris Lattner2a49d572010-02-28 22:37:22 +00002578 assert(RecNo < RecordedNodes.size() && "Invalid EmitNode");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002579 Ops.push_back(RecordedNodes[RecNo].first);
Chris Lattner2a49d572010-02-28 22:37:22 +00002580 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002581
Chris Lattner2a49d572010-02-28 22:37:22 +00002582 // If there are variadic operands to add, handle them now.
2583 if (EmitNodeInfo & OPFL_VariadicInfo) {
2584 // Determine the start index to copy from.
2585 unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo);
2586 FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0;
2587 assert(NodeToMatch->getNumOperands() >= FirstOpToCopy &&
2588 "Invalid variadic node");
Chris Lattnera4359be2010-12-23 17:13:18 +00002589 // Copy all of the variadic operands, not including a potential glue
Chris Lattner2a49d572010-02-28 22:37:22 +00002590 // input.
2591 for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands();
2592 i != e; ++i) {
2593 SDValue V = NodeToMatch->getOperand(i);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002594 if (V.getValueType() == MVT::Glue) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002595 Ops.push_back(V);
2596 }
2597 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002598
Chris Lattnera4359be2010-12-23 17:13:18 +00002599 // If this has chain/glue inputs, add them.
Chris Lattner2a49d572010-02-28 22:37:22 +00002600 if (EmitNodeInfo & OPFL_Chain)
2601 Ops.push_back(InputChain);
Chris Lattnera4359be2010-12-23 17:13:18 +00002602 if ((EmitNodeInfo & OPFL_GlueInput) && InputGlue.getNode() != 0)
2603 Ops.push_back(InputGlue);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002604
Chris Lattner2a49d572010-02-28 22:37:22 +00002605 // Create the node.
2606 SDNode *Res = 0;
2607 if (Opcode != OPC_MorphNodeTo) {
2608 // If this is a normal EmitNode command, just create the new node and
2609 // add the results to the RecordedNodes list.
2610 Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(),
2611 VTList, Ops.data(), Ops.size());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002612
Chris Lattnera4359be2010-12-23 17:13:18 +00002613 // Add all the non-glue/non-chain results to the RecordedNodes list.
Chris Lattner2a49d572010-02-28 22:37:22 +00002614 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002615 if (VTs[i] == MVT::Other || VTs[i] == MVT::Glue) break;
Chris Lattnerd847bc22010-09-21 22:00:25 +00002616 RecordedNodes.push_back(std::pair<SDValue,SDNode*>(SDValue(Res, i),
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002617 (SDNode*) 0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002618 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002619
Chris Lattner2a49d572010-02-28 22:37:22 +00002620 } else {
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00002621 Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(),
2622 EmitNodeInfo);
Chris Lattner2a49d572010-02-28 22:37:22 +00002623 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002624
Chris Lattnera4359be2010-12-23 17:13:18 +00002625 // If the node had chain/glue results, update our notion of the current
2626 // chain and glue.
2627 if (EmitNodeInfo & OPFL_GlueOutput) {
2628 InputGlue = SDValue(Res, VTs.size()-1);
Chris Lattner2a49d572010-02-28 22:37:22 +00002629 if (EmitNodeInfo & OPFL_Chain)
2630 InputChain = SDValue(Res, VTs.size()-2);
2631 } else if (EmitNodeInfo & OPFL_Chain)
2632 InputChain = SDValue(Res, VTs.size()-1);
2633
Chris Lattnera4359be2010-12-23 17:13:18 +00002634 // If the OPFL_MemRefs glue is set on this node, slap all of the
Chris Lattner2a49d572010-02-28 22:37:22 +00002635 // accumulated memrefs onto it.
2636 //
2637 // FIXME: This is vastly incorrect for patterns with multiple outputs
2638 // instructions that access memory and for ComplexPatterns that match
2639 // loads.
2640 if (EmitNodeInfo & OPFL_MemRefs) {
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002641 // Only attach load or store memory operands if the generated
2642 // instruction may load or store.
Evan Chenge837dea2011-06-28 19:10:37 +00002643 const MCInstrDesc &MCID = TM.getInstrInfo()->get(TargetOpc);
2644 bool mayLoad = MCID.mayLoad();
2645 bool mayStore = MCID.mayStore();
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002646
2647 unsigned NumMemRefs = 0;
2648 for (SmallVector<MachineMemOperand*, 2>::const_iterator I =
2649 MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
2650 if ((*I)->isLoad()) {
2651 if (mayLoad)
2652 ++NumMemRefs;
2653 } else if ((*I)->isStore()) {
2654 if (mayStore)
2655 ++NumMemRefs;
2656 } else {
2657 ++NumMemRefs;
2658 }
2659 }
2660
Chris Lattner2a49d572010-02-28 22:37:22 +00002661 MachineSDNode::mmo_iterator MemRefs =
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002662 MF->allocateMemRefsArray(NumMemRefs);
2663
2664 MachineSDNode::mmo_iterator MemRefsPos = MemRefs;
2665 for (SmallVector<MachineMemOperand*, 2>::const_iterator I =
2666 MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
2667 if ((*I)->isLoad()) {
2668 if (mayLoad)
2669 *MemRefsPos++ = *I;
2670 } else if ((*I)->isStore()) {
2671 if (mayStore)
2672 *MemRefsPos++ = *I;
2673 } else {
2674 *MemRefsPos++ = *I;
2675 }
2676 }
2677
Chris Lattner2a49d572010-02-28 22:37:22 +00002678 cast<MachineSDNode>(Res)
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002679 ->setMemRefs(MemRefs, MemRefs + NumMemRefs);
Chris Lattner2a49d572010-02-28 22:37:22 +00002680 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002681
Chris Lattner2a49d572010-02-28 22:37:22 +00002682 DEBUG(errs() << " "
2683 << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created")
2684 << " node: "; Res->dump(CurDAG); errs() << "\n");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002685
Chris Lattner2a49d572010-02-28 22:37:22 +00002686 // If this was a MorphNodeTo then we're completely done!
2687 if (Opcode == OPC_MorphNodeTo) {
Chris Lattnera4359be2010-12-23 17:13:18 +00002688 // Update chain and glue uses.
2689 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2690 InputGlue, GlueResultNodesMatched, true);
Chris Lattner82dd3d32010-03-02 07:50:03 +00002691 return Res;
Chris Lattner2a49d572010-02-28 22:37:22 +00002692 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002693
Chris Lattner2a49d572010-02-28 22:37:22 +00002694 continue;
2695 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002696
Chris Lattner29d8f0c2010-12-23 17:24:32 +00002697 case OPC_MarkGlueResults: {
Chris Lattner2a49d572010-02-28 22:37:22 +00002698 unsigned NumNodes = MatcherTable[MatcherIndex++];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002699
Chris Lattnera4359be2010-12-23 17:13:18 +00002700 // Read and remember all the glue-result nodes.
Chris Lattner2a49d572010-02-28 22:37:22 +00002701 for (unsigned i = 0; i != NumNodes; ++i) {
2702 unsigned RecNo = MatcherTable[MatcherIndex++];
2703 if (RecNo & 128)
2704 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
2705
2706 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnera4359be2010-12-23 17:13:18 +00002707 GlueResultNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
Chris Lattner2a49d572010-02-28 22:37:22 +00002708 }
2709 continue;
2710 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002711
Chris Lattner2a49d572010-02-28 22:37:22 +00002712 case OPC_CompleteMatch: {
2713 // The match has been completed, and any new nodes (if any) have been
2714 // created. Patch up references to the matched dag to use the newly
2715 // created nodes.
2716 unsigned NumResults = MatcherTable[MatcherIndex++];
2717
2718 for (unsigned i = 0; i != NumResults; ++i) {
2719 unsigned ResSlot = MatcherTable[MatcherIndex++];
2720 if (ResSlot & 128)
2721 ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002722
Chris Lattner2a49d572010-02-28 22:37:22 +00002723 assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002724 SDValue Res = RecordedNodes[ResSlot].first;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002725
Chris Lattnerb0e483e2010-03-28 05:54:03 +00002726 assert(i < NodeToMatch->getNumValues() &&
2727 NodeToMatch->getValueType(i) != MVT::Other &&
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002728 NodeToMatch->getValueType(i) != MVT::Glue &&
Chris Lattnerb0e483e2010-03-28 05:54:03 +00002729 "Invalid number of results to complete!");
Chris Lattner2a49d572010-02-28 22:37:22 +00002730 assert((NodeToMatch->getValueType(i) == Res.getValueType() ||
2731 NodeToMatch->getValueType(i) == MVT::iPTR ||
2732 Res.getValueType() == MVT::iPTR ||
2733 NodeToMatch->getValueType(i).getSizeInBits() ==
2734 Res.getValueType().getSizeInBits()) &&
2735 "invalid replacement");
2736 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res);
2737 }
2738
Chris Lattner29d8f0c2010-12-23 17:24:32 +00002739 // If the root node defines glue, add it to the glue nodes to update list.
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002740 if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Glue)
Chris Lattnera4359be2010-12-23 17:13:18 +00002741 GlueResultNodesMatched.push_back(NodeToMatch);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002742
Chris Lattnera4359be2010-12-23 17:13:18 +00002743 // Update chain and glue uses.
2744 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2745 InputGlue, GlueResultNodesMatched, false);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002746
Chris Lattner2a49d572010-02-28 22:37:22 +00002747 assert(NodeToMatch->use_empty() &&
2748 "Didn't replace all uses of the node?");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002749
Chris Lattner2a49d572010-02-28 22:37:22 +00002750 // FIXME: We just return here, which interacts correctly with SelectRoot
2751 // above. We should fix this to not return an SDNode* anymore.
2752 return 0;
2753 }
2754 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002755
Chris Lattner2a49d572010-02-28 22:37:22 +00002756 // If the code reached this point, then the match failed. See if there is
2757 // another child to try in the current 'Scope', otherwise pop it until we
2758 // find a case to check.
Dan Gohman19b38262010-03-09 02:15:05 +00002759 DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n");
Chris Lattnerbed993d2010-03-28 19:46:56 +00002760 ++NumDAGIselRetries;
Chris Lattner2a49d572010-02-28 22:37:22 +00002761 while (1) {
2762 if (MatchScopes.empty()) {
2763 CannotYetSelect(NodeToMatch);
2764 return 0;
2765 }
2766
2767 // Restore the interpreter state back to the point where the scope was
2768 // formed.
2769 MatchScope &LastScope = MatchScopes.back();
2770 RecordedNodes.resize(LastScope.NumRecordedNodes);
2771 NodeStack.clear();
2772 NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());
2773 N = NodeStack.back();
2774
Chris Lattner2a49d572010-02-28 22:37:22 +00002775 if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size())
2776 MatchedMemRefs.resize(LastScope.NumMatchedMemRefs);
2777 MatcherIndex = LastScope.FailIndex;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002778
Dan Gohman19b38262010-03-09 02:15:05 +00002779 DEBUG(errs() << " Continuing at " << MatcherIndex << "\n");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002780
Chris Lattner2a49d572010-02-28 22:37:22 +00002781 InputChain = LastScope.InputChain;
Chris Lattnera4359be2010-12-23 17:13:18 +00002782 InputGlue = LastScope.InputGlue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002783 if (!LastScope.HasChainNodesMatched)
2784 ChainNodesMatched.clear();
Chris Lattnera4359be2010-12-23 17:13:18 +00002785 if (!LastScope.HasGlueResultNodesMatched)
2786 GlueResultNodesMatched.clear();
Chris Lattner2a49d572010-02-28 22:37:22 +00002787
2788 // Check to see what the offset is at the new MatcherIndex. If it is zero
2789 // we have reached the end of this scope, otherwise we have another child
2790 // in the current scope to try.
2791 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2792 if (NumToSkip & 128)
2793 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2794
2795 // If we have another child in this scope to match, update FailIndex and
2796 // try it.
2797 if (NumToSkip != 0) {
2798 LastScope.FailIndex = MatcherIndex+NumToSkip;
2799 break;
2800 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002801
Chris Lattner2a49d572010-02-28 22:37:22 +00002802 // End of this scope, pop it and try the next child in the containing
2803 // scope.
2804 MatchScopes.pop_back();
2805 }
2806 }
2807}
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002808
Chris Lattner2a49d572010-02-28 22:37:22 +00002809
2810
Dan Gohmaneeb3a002010-01-05 01:24:18 +00002811void SelectionDAGISel::CannotYetSelect(SDNode *N) {
Dan Gohmane1f188f2009-10-29 22:30:23 +00002812 std::string msg;
2813 raw_string_ostream Msg(msg);
Chris Lattner5df15782010-12-21 02:07:03 +00002814 Msg << "Cannot select: ";
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002815
Chris Lattner2c4afd12010-03-04 00:21:16 +00002816 if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN &&
2817 N->getOpcode() != ISD::INTRINSIC_WO_CHAIN &&
2818 N->getOpcode() != ISD::INTRINSIC_VOID) {
2819 N->printrFull(Msg, CurDAG);
2820 } else {
2821 bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other;
2822 unsigned iid =
2823 cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue();
2824 if (iid < Intrinsic::num_intrinsics)
2825 Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid);
2826 else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo())
2827 Msg << "target intrinsic %" << TII->getName(iid);
2828 else
2829 Msg << "unknown intrinsic #" << iid;
2830 }
Chris Lattner75361b62010-04-07 22:58:41 +00002831 report_fatal_error(Msg.str());
Dan Gohmane1f188f2009-10-29 22:30:23 +00002832}
2833
Devang Patel19974732007-05-03 01:11:54 +00002834char SelectionDAGISel::ID = 0;