blob: bfb6dfa0b17917c66522e54cfe66cda872223a82 [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"
Owen Anderson243eb9e2011-12-08 22:15:21 +000044#include "llvm/Target/TargetLibraryInfo.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000045#include "llvm/Target/TargetLowering.h"
46#include "llvm/Target/TargetMachine.h"
Vladimir Prus12472912006-05-23 13:43:15 +000047#include "llvm/Target/TargetOptions.h"
Chris Lattner96ba57f2010-12-19 04:58:57 +000048#include "llvm/Transforms/Utils/BasicBlockUtils.h"
Chris Lattnera4f0b3a2006-08-27 12:54:02 +000049#include "llvm/Support/Compiler.h"
Evan Chengdb8d56b2008-06-30 20:45:06 +000050#include "llvm/Support/Debug.h"
Torok Edwin7d696d82009-07-11 13:10:19 +000051#include "llvm/Support/ErrorHandling.h"
Evan Chengdb8d56b2008-06-30 20:45:06 +000052#include "llvm/Support/Timer.h"
Daniel Dunbarce63ffb2009-07-25 00:23:56 +000053#include "llvm/Support/raw_ostream.h"
Cameron Zwarich2dbe2852011-02-24 10:00:04 +000054#include "llvm/ADT/PostOrderIterator.h"
Chris Lattnerc19ae9d2010-03-04 19:46:56 +000055#include "llvm/ADT/Statistic.h"
Jeff Cohen7e881032006-02-24 02:52:40 +000056#include <algorithm>
Chris Lattner1c08c712005-01-07 07:47:53 +000057using namespace llvm;
58
Chris Lattnerc19ae9d2010-03-04 19:46:56 +000059STATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on");
Jim Grosbach62427ae2011-05-16 21:51:07 +000060STATISTIC(NumFastIselSuccess, "Number of instructions fast isel selected");
Devang Patel948f7d02010-10-25 20:55:43 +000061STATISTIC(NumFastIselBlocks, "Number of blocks selected entirely by fast isel");
62STATISTIC(NumDAGBlocks, "Number of blocks selected using DAG");
Chris Lattnerbed993d2010-03-28 19:46:56 +000063STATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path");
Nick Lewyckya568d662010-10-26 00:51:57 +000064
Chad Rosier73e08d32011-12-08 21:37:10 +000065#ifndef NDEBUG
Chad Rosierf2a745e2011-12-13 00:05:11 +000066static cl::opt<bool>
67EnableFastISelVerbose2("fast-isel-verbose2", cl::Hidden,
68 cl::desc("Enable extra verbose messages in the \"fast\" "
69 "instruction selector"));
Chad Rosier73e08d32011-12-08 21:37:10 +000070 // Terminators
71STATISTIC(NumFastIselFailRet,"Fast isel fails on Ret");
72STATISTIC(NumFastIselFailBr,"Fast isel fails on Br");
73STATISTIC(NumFastIselFailSwitch,"Fast isel fails on Switch");
74STATISTIC(NumFastIselFailIndirectBr,"Fast isel fails on IndirectBr");
75STATISTIC(NumFastIselFailInvoke,"Fast isel fails on Invoke");
76STATISTIC(NumFastIselFailResume,"Fast isel fails on Resume");
77STATISTIC(NumFastIselFailUnwind,"Fast isel fails on Unwind");
78STATISTIC(NumFastIselFailUnreachable,"Fast isel fails on Unreachable");
79
80 // Standard binary operators...
81STATISTIC(NumFastIselFailAdd,"Fast isel fails on Add");
82STATISTIC(NumFastIselFailFAdd,"Fast isel fails on FAdd");
83STATISTIC(NumFastIselFailSub,"Fast isel fails on Sub");
84STATISTIC(NumFastIselFailFSub,"Fast isel fails on FSub");
85STATISTIC(NumFastIselFailMul,"Fast isel fails on Mul");
86STATISTIC(NumFastIselFailFMul,"Fast isel fails on FMul");
87STATISTIC(NumFastIselFailUDiv,"Fast isel fails on UDiv");
88STATISTIC(NumFastIselFailSDiv,"Fast isel fails on SDiv");
89STATISTIC(NumFastIselFailFDiv,"Fast isel fails on FDiv");
90STATISTIC(NumFastIselFailURem,"Fast isel fails on URem");
91STATISTIC(NumFastIselFailSRem,"Fast isel fails on SRem");
92STATISTIC(NumFastIselFailFRem,"Fast isel fails on FRem");
93
94 // Logical operators...
95STATISTIC(NumFastIselFailAnd,"Fast isel fails on And");
96STATISTIC(NumFastIselFailOr,"Fast isel fails on Or");
97STATISTIC(NumFastIselFailXor,"Fast isel fails on Xor");
98
99 // Memory instructions...
100STATISTIC(NumFastIselFailAlloca,"Fast isel fails on Alloca");
101STATISTIC(NumFastIselFailLoad,"Fast isel fails on Load");
102STATISTIC(NumFastIselFailStore,"Fast isel fails on Store");
103STATISTIC(NumFastIselFailAtomicCmpXchg,"Fast isel fails on AtomicCmpXchg");
104STATISTIC(NumFastIselFailAtomicRMW,"Fast isel fails on AtomicRWM");
105STATISTIC(NumFastIselFailFence,"Fast isel fails on Frence");
106STATISTIC(NumFastIselFailGetElementPtr,"Fast isel fails on GetElementPtr");
107
108 // Convert instructions...
109STATISTIC(NumFastIselFailTrunc,"Fast isel fails on Trunc");
110STATISTIC(NumFastIselFailZExt,"Fast isel fails on ZExt");
111STATISTIC(NumFastIselFailSExt,"Fast isel fails on SExt");
112STATISTIC(NumFastIselFailFPTrunc,"Fast isel fails on FPTrunc");
113STATISTIC(NumFastIselFailFPExt,"Fast isel fails on FPExt");
114STATISTIC(NumFastIselFailFPToUI,"Fast isel fails on FPToUI");
115STATISTIC(NumFastIselFailFPToSI,"Fast isel fails on FPToSI");
116STATISTIC(NumFastIselFailUIToFP,"Fast isel fails on UIToFP");
117STATISTIC(NumFastIselFailSIToFP,"Fast isel fails on SIToFP");
118STATISTIC(NumFastIselFailIntToPtr,"Fast isel fails on IntToPtr");
119STATISTIC(NumFastIselFailPtrToInt,"Fast isel fails on PtrToInt");
120STATISTIC(NumFastIselFailBitCast,"Fast isel fails on BitCast");
121
122 // Other instructions...
123STATISTIC(NumFastIselFailICmp,"Fast isel fails on ICmp");
124STATISTIC(NumFastIselFailFCmp,"Fast isel fails on FCmp");
125STATISTIC(NumFastIselFailPHI,"Fast isel fails on PHI");
126STATISTIC(NumFastIselFailSelect,"Fast isel fails on Select");
127STATISTIC(NumFastIselFailCall,"Fast isel fails on Call");
128STATISTIC(NumFastIselFailShl,"Fast isel fails on Shl");
129STATISTIC(NumFastIselFailLShr,"Fast isel fails on LShr");
130STATISTIC(NumFastIselFailAShr,"Fast isel fails on AShr");
131STATISTIC(NumFastIselFailVAArg,"Fast isel fails on VAArg");
132STATISTIC(NumFastIselFailExtractElement,"Fast isel fails on ExtractElement");
133STATISTIC(NumFastIselFailInsertElement,"Fast isel fails on InsertElement");
134STATISTIC(NumFastIselFailShuffleVector,"Fast isel fails on ShuffleVector");
135STATISTIC(NumFastIselFailExtractValue,"Fast isel fails on ExtractValue");
136STATISTIC(NumFastIselFailInsertValue,"Fast isel fails on InsertValue");
137STATISTIC(NumFastIselFailLandingPad,"Fast isel fails on LandingPad");
138#endif
139
Chris Lattneread0d882008-06-17 06:09:18 +0000140static cl::opt<bool>
Dan Gohman293d5f82008-09-09 22:06:46 +0000141EnableFastISelVerbose("fast-isel-verbose", cl::Hidden,
Dan Gohmand659d502008-10-20 21:30:12 +0000142 cl::desc("Enable verbose messages in the \"fast\" "
Dan Gohman293d5f82008-09-09 22:06:46 +0000143 "instruction selector"));
144static cl::opt<bool>
Dan Gohman4344a5d2008-09-09 23:05:00 +0000145EnableFastISelAbort("fast-isel-abort", cl::Hidden,
146 cl::desc("Enable abort calls when \"fast\" instruction fails"));
Chris Lattneread0d882008-06-17 06:09:18 +0000147
Jakub Staszak7cc2b072011-06-16 20:22:37 +0000148static cl::opt<bool>
149UseMBPI("use-mbpi",
150 cl::desc("use Machine Branch Probability Info"),
151 cl::init(true), cl::Hidden);
152
Chris Lattnerda8abb02005-09-01 18:44:10 +0000153#ifndef NDEBUG
Chris Lattner7944d9d2005-01-12 03:41:21 +0000154static cl::opt<bool>
Dan Gohman462dc7f2008-07-21 20:00:07 +0000155ViewDAGCombine1("view-dag-combine1-dags", cl::Hidden,
156 cl::desc("Pop up a window to show dags before the first "
157 "dag combine pass"));
158static cl::opt<bool>
159ViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden,
160 cl::desc("Pop up a window to show dags before legalize types"));
161static cl::opt<bool>
162ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
163 cl::desc("Pop up a window to show dags before legalize"));
164static cl::opt<bool>
165ViewDAGCombine2("view-dag-combine2-dags", cl::Hidden,
166 cl::desc("Pop up a window to show dags before the second "
167 "dag combine pass"));
168static cl::opt<bool>
Duncan Sands25cf2272008-11-24 14:53:14 +0000169ViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden,
170 cl::desc("Pop up a window to show dags before the post legalize types"
171 " dag combine pass"));
172static cl::opt<bool>
Evan Chenga9c20912006-01-21 02:32:06 +0000173ViewISelDAGs("view-isel-dags", cl::Hidden,
174 cl::desc("Pop up a window to show isel dags as they are selected"));
175static cl::opt<bool>
176ViewSchedDAGs("view-sched-dags", cl::Hidden,
177 cl::desc("Pop up a window to show sched dags as they are processed"));
Dan Gohman3e1a7ae2007-08-28 20:32:58 +0000178static cl::opt<bool>
179ViewSUnitDAGs("view-sunit-dags", cl::Hidden,
Chris Lattner5bab7852008-01-25 17:24:52 +0000180 cl::desc("Pop up a window to show SUnit dags after they are processed"));
Chris Lattner7944d9d2005-01-12 03:41:21 +0000181#else
Dan Gohman462dc7f2008-07-21 20:00:07 +0000182static const bool ViewDAGCombine1 = false,
183 ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false,
184 ViewDAGCombine2 = false,
Duncan Sands25cf2272008-11-24 14:53:14 +0000185 ViewDAGCombineLT = false,
Dan Gohman462dc7f2008-07-21 20:00:07 +0000186 ViewISelDAGs = false, ViewSchedDAGs = false,
187 ViewSUnitDAGs = false;
Chris Lattner7944d9d2005-01-12 03:41:21 +0000188#endif
189
Jim Laskeyeb577ba2006-08-02 12:30:23 +0000190//===---------------------------------------------------------------------===//
191///
192/// RegisterScheduler class - Track the registration of instruction schedulers.
193///
194//===---------------------------------------------------------------------===//
195MachinePassRegistry RegisterScheduler::Registry;
196
197//===---------------------------------------------------------------------===//
198///
199/// ISHeuristic command line option for instruction schedulers.
200///
201//===---------------------------------------------------------------------===//
Dan Gohman844731a2008-05-13 00:00:25 +0000202static cl::opt<RegisterScheduler::FunctionPassCtor, false,
203 RegisterPassParser<RegisterScheduler> >
204ISHeuristic("pre-RA-sched",
205 cl::init(&createDefaultScheduler),
206 cl::desc("Instruction schedulers available (before register"
207 " allocation):"));
Jim Laskey13ec7022006-08-01 14:21:23 +0000208
Dan Gohman844731a2008-05-13 00:00:25 +0000209static RegisterScheduler
Dan Gohmanb8cab922008-10-14 20:25:08 +0000210defaultListDAGScheduler("default", "Best scheduler for the target",
Dan Gohman844731a2008-05-13 00:00:25 +0000211 createDefaultScheduler);
Evan Cheng4ef10862006-01-23 07:01:07 +0000212
Chris Lattner1c08c712005-01-07 07:47:53 +0000213namespace llvm {
214 //===--------------------------------------------------------------------===//
Jim Laskey9373beb2006-08-01 19:14:14 +0000215 /// createDefaultScheduler - This creates an instruction scheduler appropriate
216 /// for the target.
Dan Gohman47ac0f02009-02-11 04:27:20 +0000217 ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS,
Bill Wendling98a366d2009-04-29 23:29:43 +0000218 CodeGenOpt::Level OptLevel) {
Dan Gohmane9530ec2009-01-15 16:58:17 +0000219 const TargetLowering &TLI = IS->getTargetLowering();
220
Bill Wendling98a366d2009-04-29 23:29:43 +0000221 if (OptLevel == CodeGenOpt::None)
Dan Gohmane667e012010-07-16 02:01:19 +0000222 return createSourceListDAGScheduler(IS, OptLevel);
Evan Cheng15a16de2010-05-20 06:13:19 +0000223 if (TLI.getSchedulingPreference() == Sched::RegPressure)
224 return createBURRListDAGScheduler(IS, OptLevel);
Evan Cheng70017e42010-07-24 00:39:05 +0000225 if (TLI.getSchedulingPreference() == Sched::Hybrid)
226 return createHybridListDAGScheduler(IS, OptLevel);
227 assert(TLI.getSchedulingPreference() == Sched::ILP &&
Evan Cheng211ffa12010-05-19 20:19:50 +0000228 "Unknown sched type!");
Evan Cheng70017e42010-07-24 00:39:05 +0000229 return createILPListDAGScheduler(IS, OptLevel);
Jim Laskey9373beb2006-08-01 19:14:14 +0000230 }
Chris Lattner1c08c712005-01-07 07:47:53 +0000231}
232
Evan Chengff9b3732008-01-30 18:18:23 +0000233// EmitInstrWithCustomInserter - This method should be implemented by targets
Dan Gohman533297b2009-10-29 18:10:34 +0000234// that mark instructions with the 'usesCustomInserter' flag. These
Chris Lattner025c39b2005-08-26 20:54:47 +0000235// instructions are special in various ways, which require special support to
236// insert. The specified MachineInstr is created but not inserted into any
Dan Gohman533297b2009-10-29 18:10:34 +0000237// basic blocks, and this method is called to expand it into a sequence of
238// instructions, potentially also creating new basic blocks and control flow.
239// When new basic blocks are inserted and the edges from MBB to its successors
240// are modified, the method should insert pairs of <OldSucc, NewSucc> into the
241// DenseMap.
Dan Gohmanaf1d8ca2010-05-01 00:01:06 +0000242MachineBasicBlock *
243TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
244 MachineBasicBlock *MBB) const {
Torok Edwinf3689232009-07-12 20:07:01 +0000245#ifndef NDEBUG
David Greene1a053232010-01-05 01:26:11 +0000246 dbgs() << "If a target marks an instruction with "
Dan Gohman533297b2009-10-29 18:10:34 +0000247 "'usesCustomInserter', it must implement "
Torok Edwinf3689232009-07-12 20:07:01 +0000248 "TargetLowering::EmitInstrWithCustomInserter!";
249#endif
Torok Edwinc23197a2009-07-14 16:55:14 +0000250 llvm_unreachable(0);
Daniel Dunbara279bc32009-09-20 02:20:51 +0000251 return 0;
Chris Lattner025c39b2005-08-26 20:54:47 +0000252}
253
Evan Cheng37fefc22011-08-30 19:09:48 +0000254void TargetLowering::AdjustInstrPostInstrSelection(MachineInstr *MI,
255 SDNode *Node) const {
Evan Cheng5a96b3d2011-12-07 07:15:52 +0000256 assert(!MI->hasPostISelHook() &&
Andrew Trick3be654f2011-09-21 02:20:46 +0000257 "If a target marks an instruction with 'hasPostISelHook', "
258 "it must implement TargetLowering::AdjustInstrPostInstrSelection!");
Evan Cheng37fefc22011-08-30 19:09:48 +0000259}
260
Chris Lattner7041ee32005-01-11 05:56:49 +0000261//===----------------------------------------------------------------------===//
262// SelectionDAGISel code
263//===----------------------------------------------------------------------===//
Chris Lattner1c08c712005-01-07 07:47:53 +0000264
David Blaikie2d24e2a2011-12-20 02:50:00 +0000265void SelectionDAGISel::ISelUpdater::anchor() { }
266
Eric Christopher762a17a2011-01-05 21:45:56 +0000267SelectionDAGISel::SelectionDAGISel(const TargetMachine &tm,
268 CodeGenOpt::Level OL) :
Owen Anderson90c579d2010-08-06 18:33:48 +0000269 MachineFunctionPass(ID), TM(tm), TLI(*tm.getTargetLowering()),
Dan Gohman7c3234c2008-08-27 23:52:12 +0000270 FuncInfo(new FunctionLoweringInfo(TLI)),
Devang Patel0508d042011-12-15 18:21:18 +0000271 CurDAG(new SelectionDAG(tm, OL)),
Dan Gohman55e59c12010-04-19 19:05:59 +0000272 SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)),
Dan Gohman7c3234c2008-08-27 23:52:12 +0000273 GFI(),
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +0000274 OptLevel(OL),
Owen Anderson081c34b2010-10-19 17:21:58 +0000275 DAGSize(0) {
276 initializeGCModuleInfoPass(*PassRegistry::getPassRegistry());
277 initializeAliasAnalysisAnalysisGroup(*PassRegistry::getPassRegistry());
Jakub Staszak7cc2b072011-06-16 20:22:37 +0000278 initializeBranchProbabilityInfoPass(*PassRegistry::getPassRegistry());
Owen Anderson243eb9e2011-12-08 22:15:21 +0000279 initializeTargetLibraryInfoPass(*PassRegistry::getPassRegistry());
Owen Anderson081c34b2010-10-19 17:21:58 +0000280 }
Dan Gohman7c3234c2008-08-27 23:52:12 +0000281
282SelectionDAGISel::~SelectionDAGISel() {
Dan Gohman2048b852009-11-23 18:04:58 +0000283 delete SDB;
Dan Gohman7c3234c2008-08-27 23:52:12 +0000284 delete CurDAG;
285 delete FuncInfo;
286}
287
Chris Lattner495a0b52005-08-17 06:37:43 +0000288void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
Jim Laskeyc7c3f112006-10-16 20:52:31 +0000289 AU.addRequired<AliasAnalysis>();
Dan Gohmana3477fe2009-07-31 23:36:22 +0000290 AU.addPreserved<AliasAnalysis>();
Gordon Henriksen5eca0752008-08-17 18:44:35 +0000291 AU.addRequired<GCModuleInfo>();
Dan Gohmana3477fe2009-07-31 23:36:22 +0000292 AU.addPreserved<GCModuleInfo>();
Owen Anderson243eb9e2011-12-08 22:15:21 +0000293 AU.addRequired<TargetLibraryInfo>();
Jakub Staszak7cc2b072011-06-16 20:22:37 +0000294 if (UseMBPI && OptLevel != CodeGenOpt::None)
295 AU.addRequired<BranchProbabilityInfo>();
Dan Gohmanad2afc22009-07-31 18:16:33 +0000296 MachineFunctionPass::getAnalysisUsage(AU);
Chris Lattner495a0b52005-08-17 06:37:43 +0000297}
Chris Lattner1c08c712005-01-07 07:47:53 +0000298
Chris Lattner96ba57f2010-12-19 04:58:57 +0000299/// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that
300/// may trap on it. In this case we have to split the edge so that the path
301/// through the predecessor block that doesn't go to the phi block doesn't
302/// execute the possibly trapping instruction.
303///
304/// This is required for correctness, so it must be done at -O0.
305///
306static void SplitCriticalSideEffectEdges(Function &Fn, Pass *SDISel) {
307 // Loop for blocks with phi nodes.
308 for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
309 PHINode *PN = dyn_cast<PHINode>(BB->begin());
310 if (PN == 0) continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000311
Chris Lattner96ba57f2010-12-19 04:58:57 +0000312 ReprocessBlock:
313 // For each block with a PHI node, check to see if any of the input values
314 // are potentially trapping constant expressions. Constant expressions are
315 // the only potentially trapping value that can occur as the argument to a
316 // PHI.
317 for (BasicBlock::iterator I = BB->begin(); (PN = dyn_cast<PHINode>(I)); ++I)
318 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
319 ConstantExpr *CE = dyn_cast<ConstantExpr>(PN->getIncomingValue(i));
320 if (CE == 0 || !CE->canTrap()) continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000321
Chris Lattner96ba57f2010-12-19 04:58:57 +0000322 // The only case we have to worry about is when the edge is critical.
323 // Since this block has a PHI Node, we assume it has multiple input
324 // edges: check to see if the pred has multiple successors.
325 BasicBlock *Pred = PN->getIncomingBlock(i);
326 if (Pred->getTerminator()->getNumSuccessors() == 1)
327 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000328
Chris Lattner96ba57f2010-12-19 04:58:57 +0000329 // Okay, we have to split this edge.
330 SplitCriticalEdge(Pred->getTerminator(),
331 GetSuccessorNumber(Pred, BB), SDISel, true);
332 goto ReprocessBlock;
333 }
334 }
335}
336
Dan Gohmanad2afc22009-07-31 18:16:33 +0000337bool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) {
Dan Gohman4344a5d2008-09-09 23:05:00 +0000338 // Do some sanity-checking on the command-line options.
Nick Lewycky8a8d4792011-12-02 22:16:29 +0000339 assert((!EnableFastISelVerbose || TM.Options.EnableFastISel) &&
Dan Gohman4344a5d2008-09-09 23:05:00 +0000340 "-fast-isel-verbose requires -fast-isel");
Nick Lewycky8a8d4792011-12-02 22:16:29 +0000341 assert((!EnableFastISelAbort || TM.Options.EnableFastISel) &&
Dan Gohman4344a5d2008-09-09 23:05:00 +0000342 "-fast-isel-abort requires -fast-isel");
343
Dan Gohmanae541aa2010-04-15 04:33:49 +0000344 const Function &Fn = *mf.getFunction();
Dan Gohman8a110532008-09-05 22:59:21 +0000345 const TargetInstrInfo &TII = *TM.getInstrInfo();
346 const TargetRegisterInfo &TRI = *TM.getRegisterInfo();
347
Dan Gohmanc0fb65d2010-04-14 17:02:07 +0000348 MF = &mf;
Dan Gohman79ce2762009-01-15 19:20:50 +0000349 RegInfo = &MF->getRegInfo();
Dan Gohmanc0fb65d2010-04-14 17:02:07 +0000350 AA = &getAnalysis<AliasAnalysis>();
Owen Anderson243eb9e2011-12-08 22:15:21 +0000351 LibInfo = &getAnalysis<TargetLibraryInfo>();
Dan Gohmanc0fb65d2010-04-14 17:02:07 +0000352 GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0;
353
David Greene1a053232010-01-05 01:26:11 +0000354 DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n");
Chris Lattner1c08c712005-01-07 07:47:53 +0000355
Chris Lattner96ba57f2010-12-19 04:58:57 +0000356 SplitCriticalSideEffectEdges(const_cast<Function&>(Fn), this);
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000357
Chris Lattnerde6e7832010-04-05 06:10:13 +0000358 CurDAG->init(*MF);
Dan Gohman7451d3e2010-05-29 17:03:36 +0000359 FuncInfo->set(Fn, *MF);
Jakub Staszak7cc2b072011-06-16 20:22:37 +0000360
361 if (UseMBPI && OptLevel != CodeGenOpt::None)
362 FuncInfo->BPI = &getAnalysis<BranchProbabilityInfo>();
363 else
364 FuncInfo->BPI = 0;
365
Owen Anderson243eb9e2011-12-08 22:15:21 +0000366 SDB->init(GFI, *AA, LibInfo);
Chris Lattner1c08c712005-01-07 07:47:53 +0000367
Dan Gohman6a732b52010-04-14 20:05:00 +0000368 SelectAllBasicBlocks(Fn);
Misha Brukmanedf128a2005-04-21 22:36:52 +0000369
Dan Gohman1b79a2f2010-05-01 00:33:28 +0000370 // If the first basic block in the function has live ins that need to be
Dan Gohman8a110532008-09-05 22:59:21 +0000371 // copied into vregs, emit the copies into the top of the block before
372 // emitting the code for the block.
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000373 MachineBasicBlock *EntryMBB = MF->begin();
374 RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII);
375
Devang Patel394427b2010-05-26 20:18:50 +0000376 DenseMap<unsigned, unsigned> LiveInMap;
377 if (!FuncInfo->ArgDbgValues.empty())
378 for (MachineRegisterInfo::livein_iterator LI = RegInfo->livein_begin(),
379 E = RegInfo->livein_end(); LI != E; ++LI)
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000380 if (LI->second)
Devang Patel394427b2010-05-26 20:18:50 +0000381 LiveInMap.insert(std::make_pair(LI->first, LI->second));
382
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000383 // Insert DBG_VALUE instructions for function arguments to the entry block.
384 for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) {
385 MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1];
386 unsigned Reg = MI->getOperand(0).getReg();
387 if (TargetRegisterInfo::isPhysicalRegister(Reg))
388 EntryMBB->insert(EntryMBB->begin(), MI);
389 else {
390 MachineInstr *Def = RegInfo->getVRegDef(Reg);
391 MachineBasicBlock::iterator InsertPos = Def;
Evan Chengf1ced252010-05-04 00:58:39 +0000392 // FIXME: VR def may not be in entry block.
393 Def->getParent()->insert(llvm::next(InsertPos), MI);
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000394 }
Devang Patel394427b2010-05-26 20:18:50 +0000395
396 // If Reg is live-in then update debug info to track its copy in a vreg.
397 DenseMap<unsigned, unsigned>::iterator LDI = LiveInMap.find(Reg);
398 if (LDI != LiveInMap.end()) {
399 MachineInstr *Def = RegInfo->getVRegDef(LDI->second);
400 MachineBasicBlock::iterator InsertPos = Def;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000401 const MDNode *Variable =
Devang Patel394427b2010-05-26 20:18:50 +0000402 MI->getOperand(MI->getNumOperands()-1).getMetadata();
403 unsigned Offset = MI->getOperand(1).getImm();
404 // Def is never a terminator here, so it is ok to increment InsertPos.
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000405 BuildMI(*EntryMBB, ++InsertPos, MI->getDebugLoc(),
Devang Patel394427b2010-05-26 20:18:50 +0000406 TII.get(TargetOpcode::DBG_VALUE))
407 .addReg(LDI->second, RegState::Debug)
408 .addImm(Offset).addMetadata(Variable);
Devang Patel44cfe142010-09-21 20:56:33 +0000409
410 // If this vreg is directly copied into an exported register then
411 // that COPY instructions also need DBG_VALUE, if it is the only
412 // user of LDI->second.
413 MachineInstr *CopyUseMI = NULL;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000414 for (MachineRegisterInfo::use_iterator
415 UI = RegInfo->use_begin(LDI->second);
Devang Patel44cfe142010-09-21 20:56:33 +0000416 MachineInstr *UseMI = UI.skipInstruction();) {
417 if (UseMI->isDebugValue()) continue;
418 if (UseMI->isCopy() && !CopyUseMI && UseMI->getParent() == EntryMBB) {
419 CopyUseMI = UseMI; continue;
420 }
421 // Otherwise this is another use or second copy use.
422 CopyUseMI = NULL; break;
423 }
424 if (CopyUseMI) {
425 MachineInstr *NewMI =
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000426 BuildMI(*MF, CopyUseMI->getDebugLoc(),
Devang Patel44cfe142010-09-21 20:56:33 +0000427 TII.get(TargetOpcode::DBG_VALUE))
428 .addReg(CopyUseMI->getOperand(0).getReg(), RegState::Debug)
429 .addImm(Offset).addMetadata(Variable);
Evan Cheng7c2a4a32011-12-06 22:12:01 +0000430 MachineBasicBlock::iterator Pos = CopyUseMI;
431 EntryMBB->insertAfter(Pos, NewMI);
Devang Patel44cfe142010-09-21 20:56:33 +0000432 }
Devang Patel394427b2010-05-26 20:18:50 +0000433 }
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000434 }
435
Bill Wendling53f76022010-05-17 23:09:50 +0000436 // Determine if there are any calls in this machine function.
437 MachineFrameInfo *MFI = MF->getFrameInfo();
438 if (!MFI->hasCalls()) {
439 for (MachineFunction::const_iterator
440 I = MF->begin(), E = MF->end(); I != E; ++I) {
441 const MachineBasicBlock *MBB = I;
442 for (MachineBasicBlock::const_iterator
443 II = MBB->begin(), IE = MBB->end(); II != IE; ++II) {
Evan Chenge837dea2011-06-28 19:10:37 +0000444 const MCInstrDesc &MCID = TM.getInstrInfo()->get(II->getOpcode());
Bill Wendling8886c492010-07-09 19:44:12 +0000445
Evan Chenge837dea2011-06-28 19:10:37 +0000446 if ((MCID.isCall() && !MCID.isReturn()) ||
Evan Chengc36b7062011-01-07 23:50:32 +0000447 II->isStackAligningInlineAsm()) {
Bill Wendling53f76022010-05-17 23:09:50 +0000448 MFI->setHasCalls(true);
449 goto done;
450 }
451 }
452 }
453 done:;
454 }
455
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000456 // Determine if there is a call to setjmp in the machine function.
Joerg Sonnenberger34706932011-12-18 20:35:43 +0000457 MF->setExposesReturnsTwice(Fn.callsFunctionThatReturnsTwice());
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000458
Dan Gohman84023e02010-07-10 09:00:22 +0000459 // Replace forward-declared registers with the registers containing
460 // the desired value.
461 MachineRegisterInfo &MRI = MF->getRegInfo();
462 for (DenseMap<unsigned, unsigned>::iterator
463 I = FuncInfo->RegFixups.begin(), E = FuncInfo->RegFixups.end();
464 I != E; ++I) {
465 unsigned From = I->first;
466 unsigned To = I->second;
467 // If To is also scheduled to be replaced, find what its ultimate
468 // replacement is.
469 for (;;) {
470 DenseMap<unsigned, unsigned>::iterator J =
471 FuncInfo->RegFixups.find(To);
472 if (J == E) break;
473 To = J->second;
474 }
475 // Replace it.
476 MRI.replaceRegWith(From, To);
477 }
478
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000479 // Release function-specific state. SDB and CurDAG are already cleared
480 // at this point.
481 FuncInfo->clear();
Dan Gohman8a110532008-09-05 22:59:21 +0000482
Chris Lattner1c08c712005-01-07 07:47:53 +0000483 return true;
484}
485
Chris Lattner685090f2011-04-17 17:12:08 +0000486void SelectionDAGISel::SelectBasicBlock(BasicBlock::const_iterator Begin,
487 BasicBlock::const_iterator End,
488 bool &HadTailCall) {
Dan Gohman98ca4f22009-08-05 01:29:28 +0000489 // Lower all of the non-terminator instructions. If a call is emitted
Dan Gohmanf89d1dc2010-04-16 05:06:56 +0000490 // as a tail call, cease emitting nodes for this block. Terminators
491 // are handled below.
Dan Gohmanc105a2b2010-04-22 20:55:53 +0000492 for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I)
Dan Gohmanf89d1dc2010-04-16 05:06:56 +0000493 SDB->visit(*I);
Dan Gohmanf350b272008-08-23 02:25:05 +0000494
Chris Lattnera651cf62005-01-17 19:43:36 +0000495 // Make sure the root of the DAG is up-to-date.
Dan Gohman2048b852009-11-23 18:04:58 +0000496 CurDAG->setRoot(SDB->getControlRoot());
Dan Gohman2048b852009-11-23 18:04:58 +0000497 HadTailCall = SDB->HasTailCall;
498 SDB->clear();
Dan Gohman95140a42010-05-01 00:25:44 +0000499
500 // Final step, emit the lowered DAG as machine code.
Dan Gohman84023e02010-07-10 09:00:22 +0000501 CodeGenAndEmitDAG();
Chris Lattner1c08c712005-01-07 07:47:53 +0000502}
503
Dan Gohmanf350b272008-08-23 02:25:05 +0000504void SelectionDAGISel::ComputeLiveOutVRegInfo() {
Chris Lattneread0d882008-06-17 06:09:18 +0000505 SmallPtrSet<SDNode*, 128> VisitedNodes;
506 SmallVector<SDNode*, 128> Worklist;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000507
Gabor Greifba36cb52008-08-28 21:40:38 +0000508 Worklist.push_back(CurDAG->getRoot().getNode());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000509
Chris Lattneread0d882008-06-17 06:09:18 +0000510 APInt Mask;
511 APInt KnownZero;
512 APInt KnownOne;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000513
Benjamin Kramer7b1e2a52010-01-07 17:27:56 +0000514 do {
515 SDNode *N = Worklist.pop_back_val();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000516
Chris Lattneread0d882008-06-17 06:09:18 +0000517 // If we've already seen this node, ignore it.
518 if (!VisitedNodes.insert(N))
519 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000520
Chris Lattneread0d882008-06-17 06:09:18 +0000521 // Otherwise, add all chain operands to the worklist.
522 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
Owen Anderson825b72b2009-08-11 20:47:22 +0000523 if (N->getOperand(i).getValueType() == MVT::Other)
Gabor Greifba36cb52008-08-28 21:40:38 +0000524 Worklist.push_back(N->getOperand(i).getNode());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000525
Chris Lattneread0d882008-06-17 06:09:18 +0000526 // If this is a CopyToReg with a vreg dest, process it.
527 if (N->getOpcode() != ISD::CopyToReg)
528 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000529
Chris Lattneread0d882008-06-17 06:09:18 +0000530 unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg();
531 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
532 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000533
Chris Lattneread0d882008-06-17 06:09:18 +0000534 // Ignore non-scalar or non-integer values.
Dan Gohman475871a2008-07-27 21:46:04 +0000535 SDValue Src = N->getOperand(2);
Owen Andersone50ed302009-08-10 22:56:29 +0000536 EVT SrcVT = Src.getValueType();
Chris Lattneread0d882008-06-17 06:09:18 +0000537 if (!SrcVT.isInteger() || SrcVT.isVector())
538 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000539
Dan Gohmanf350b272008-08-23 02:25:05 +0000540 unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src);
Chris Lattneread0d882008-06-17 06:09:18 +0000541 Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits());
Dan Gohmanf350b272008-08-23 02:25:05 +0000542 CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne);
Cameron Zwariche1497b92011-02-24 10:00:08 +0000543 FuncInfo->AddLiveOutRegInfo(DestReg, NumSignBits, KnownZero, KnownOne);
Benjamin Kramer7b1e2a52010-01-07 17:27:56 +0000544 } while (!Worklist.empty());
Chris Lattneread0d882008-06-17 06:09:18 +0000545}
546
Dan Gohman84023e02010-07-10 09:00:22 +0000547void SelectionDAGISel::CodeGenAndEmitDAG() {
Dan Gohman462dc7f2008-07-21 20:00:07 +0000548 std::string GroupName;
549 if (TimePassesIsEnabled)
550 GroupName = "Instruction Selection and Scheduling";
551 std::string BlockName;
Andrew Tricka2f45292011-03-23 01:38:28 +0000552 int BlockNumber = -1;
Duncan Sands1f6a3292011-08-12 14:54:45 +0000553 (void)BlockNumber;
Andrew Tricka2f45292011-03-23 01:38:28 +0000554#ifdef NDEBUG
Dan Gohman462dc7f2008-07-21 20:00:07 +0000555 if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs ||
Duncan Sands25cf2272008-11-24 14:53:14 +0000556 ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs ||
557 ViewSUnitDAGs)
Andrew Tricka2f45292011-03-23 01:38:28 +0000558#endif
559 {
560 BlockNumber = FuncInfo->MBB->getNumber();
Benjamin Kramera7b0cb72011-11-15 16:27:03 +0000561 BlockName = MF->getFunction()->getName().str() + ":" +
562 FuncInfo->MBB->getBasicBlock()->getName().str();
Andrew Tricka2f45292011-03-23 01:38:28 +0000563 }
564 DEBUG(dbgs() << "Initial selection DAG: BB#" << BlockNumber
565 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman462dc7f2008-07-21 20:00:07 +0000566
Dan Gohmanf350b272008-08-23 02:25:05 +0000567 if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName);
Dan Gohman417e11b2007-10-08 15:12:17 +0000568
Chris Lattneraf21d552005-10-10 16:47:10 +0000569 // Run the DAG combiner in pre-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000570 {
571 NamedRegionTimer T("DAG Combining 1", GroupName, TimePassesIsEnabled);
Eli Friedman50185242011-11-12 00:35:34 +0000572 CurDAG->Combine(BeforeLegalizeTypes, *AA, OptLevel);
Evan Chengebffb662008-07-01 17:59:20 +0000573 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000574
Andrew Tricka2f45292011-03-23 01:38:28 +0000575 DEBUG(dbgs() << "Optimized lowered selection DAG: BB#" << BlockNumber
576 << " '" << BlockName << "'\n"; CurDAG->dump());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000577
Chris Lattner1c08c712005-01-07 07:47:53 +0000578 // Second step, hack on the DAG until it only uses operations and types that
579 // the target supports.
Dan Gohman714efc62009-12-05 17:51:33 +0000580 if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " +
581 BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000582
Dan Gohman714efc62009-12-05 17:51:33 +0000583 bool Changed;
Dan Gohman03c3dc72010-06-18 15:56:31 +0000584 {
585 NamedRegionTimer T("Type Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000586 Changed = CurDAG->LegalizeTypes();
587 }
588
Andrew Tricka2f45292011-03-23 01:38:28 +0000589 DEBUG(dbgs() << "Type-legalized selection DAG: BB#" << BlockNumber
590 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman714efc62009-12-05 17:51:33 +0000591
592 if (Changed) {
593 if (ViewDAGCombineLT)
594 CurDAG->viewGraph("dag-combine-lt input for " + BlockName);
595
596 // Run the DAG combiner in post-type-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000597 {
598 NamedRegionTimer T("DAG Combining after legalize types", GroupName,
599 TimePassesIsEnabled);
Eli Friedman50185242011-11-12 00:35:34 +0000600 CurDAG->Combine(AfterLegalizeTypes, *AA, OptLevel);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000601 }
602
Andrew Tricka2f45292011-03-23 01:38:28 +0000603 DEBUG(dbgs() << "Optimized type-legalized selection DAG: BB#" << BlockNumber
604 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman714efc62009-12-05 17:51:33 +0000605 }
Dan Gohman462dc7f2008-07-21 20:00:07 +0000606
Dan Gohman03c3dc72010-06-18 15:56:31 +0000607 {
608 NamedRegionTimer T("Vector Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000609 Changed = CurDAG->LegalizeVectors();
610 }
Duncan Sands25cf2272008-11-24 14:53:14 +0000611
Dan Gohman714efc62009-12-05 17:51:33 +0000612 if (Changed) {
Dan Gohman03c3dc72010-06-18 15:56:31 +0000613 {
614 NamedRegionTimer T("Type Legalization 2", GroupName, TimePassesIsEnabled);
Bill Wendling98820072009-12-28 01:51:30 +0000615 CurDAG->LegalizeTypes();
Eli Friedman5c22c802009-05-23 12:35:30 +0000616 }
617
Dan Gohman714efc62009-12-05 17:51:33 +0000618 if (ViewDAGCombineLT)
619 CurDAG->viewGraph("dag-combine-lv input for " + BlockName);
Eli Friedman5c22c802009-05-23 12:35:30 +0000620
Dan Gohman714efc62009-12-05 17:51:33 +0000621 // Run the DAG combiner in post-type-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000622 {
623 NamedRegionTimer T("DAG Combining after legalize vectors", GroupName,
624 TimePassesIsEnabled);
Eli Friedman50185242011-11-12 00:35:34 +0000625 CurDAG->Combine(AfterLegalizeVectorOps, *AA, OptLevel);
Eli Friedman5c22c802009-05-23 12:35:30 +0000626 }
Dan Gohman714efc62009-12-05 17:51:33 +0000627
Andrew Tricka2f45292011-03-23 01:38:28 +0000628 DEBUG(dbgs() << "Optimized vector-legalized selection DAG: BB#"
629 << BlockNumber << " '" << BlockName << "'\n"; CurDAG->dump());
Chris Lattner70587ea2008-07-10 23:37:50 +0000630 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000631
Dan Gohmanf350b272008-08-23 02:25:05 +0000632 if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000633
Dan Gohman03c3dc72010-06-18 15:56:31 +0000634 {
635 NamedRegionTimer T("DAG Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman975716a2011-05-16 22:19:54 +0000636 CurDAG->Legalize();
Evan Chengebffb662008-07-01 17:59:20 +0000637 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000638
Andrew Tricka2f45292011-03-23 01:38:28 +0000639 DEBUG(dbgs() << "Legalized selection DAG: BB#" << BlockNumber
640 << " '" << BlockName << "'\n"; CurDAG->dump());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000641
Dan Gohmanf350b272008-08-23 02:25:05 +0000642 if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000643
Chris Lattneraf21d552005-10-10 16:47:10 +0000644 // Run the DAG combiner in post-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000645 {
646 NamedRegionTimer T("DAG Combining 2", GroupName, TimePassesIsEnabled);
Eli Friedman50185242011-11-12 00:35:34 +0000647 CurDAG->Combine(AfterLegalizeDAG, *AA, OptLevel);
Evan Chengebffb662008-07-01 17:59:20 +0000648 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000649
Andrew Tricka2f45292011-03-23 01:38:28 +0000650 DEBUG(dbgs() << "Optimized legalized selection DAG: BB#" << BlockNumber
651 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman417e11b2007-10-08 15:12:17 +0000652
Dan Gohman4e39e9d2010-06-24 14:30:44 +0000653 if (OptLevel != CodeGenOpt::None)
Dan Gohmanf350b272008-08-23 02:25:05 +0000654 ComputeLiveOutVRegInfo();
Evan Cheng552c4a82006-04-28 02:09:19 +0000655
Chris Lattner552186d2010-03-14 19:27:55 +0000656 if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName);
657
Chris Lattnera33ef482005-03-30 01:10:47 +0000658 // Third, instruction select all of the operations to machine code, adding the
659 // code to the MachineBasicBlock.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000660 {
661 NamedRegionTimer T("Instruction Selection", GroupName, TimePassesIsEnabled);
Chris Lattner7c306da2010-03-02 06:34:30 +0000662 DoInstructionSelection();
Evan Chengebffb662008-07-01 17:59:20 +0000663 }
Evan Chengdb8d56b2008-06-30 20:45:06 +0000664
Andrew Tricka2f45292011-03-23 01:38:28 +0000665 DEBUG(dbgs() << "Selected selection DAG: BB#" << BlockNumber
666 << " '" << BlockName << "'\n"; CurDAG->dump());
Dan Gohman462dc7f2008-07-21 20:00:07 +0000667
Dan Gohmanf350b272008-08-23 02:25:05 +0000668 if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000669
Dan Gohman5e843682008-07-14 18:19:29 +0000670 // Schedule machine code.
Dan Gohman47ac0f02009-02-11 04:27:20 +0000671 ScheduleDAGSDNodes *Scheduler = CreateScheduler();
Dan Gohman03c3dc72010-06-18 15:56:31 +0000672 {
673 NamedRegionTimer T("Instruction Scheduling", GroupName,
674 TimePassesIsEnabled);
Dan Gohman84023e02010-07-10 09:00:22 +0000675 Scheduler->Run(CurDAG, FuncInfo->MBB, FuncInfo->InsertPt);
Dan Gohman5e843682008-07-14 18:19:29 +0000676 }
677
Dan Gohman462dc7f2008-07-21 20:00:07 +0000678 if (ViewSUnitDAGs) Scheduler->viewGraph();
679
Daniel Dunbara279bc32009-09-20 02:20:51 +0000680 // Emit machine code to BB. This can change 'BB' to the last block being
Evan Chengdb8d56b2008-06-30 20:45:06 +0000681 // inserted into.
Jakob Stoklund Olesen2622f462010-09-30 19:44:31 +0000682 MachineBasicBlock *FirstMBB = FuncInfo->MBB, *LastMBB;
Dan Gohman03c3dc72010-06-18 15:56:31 +0000683 {
684 NamedRegionTimer T("Instruction Creation", GroupName, TimePassesIsEnabled);
Dan Gohman84023e02010-07-10 09:00:22 +0000685
Jakob Stoklund Olesen2622f462010-09-30 19:44:31 +0000686 LastMBB = FuncInfo->MBB = Scheduler->EmitSchedule();
Dan Gohman84023e02010-07-10 09:00:22 +0000687 FuncInfo->InsertPt = Scheduler->InsertPos;
Dan Gohman5e843682008-07-14 18:19:29 +0000688 }
689
Jakob Stoklund Olesen2622f462010-09-30 19:44:31 +0000690 // If the block was split, make sure we update any references that are used to
691 // update PHI nodes later on.
692 if (FirstMBB != LastMBB)
693 SDB->UpdateSplitBlock(FirstMBB, LastMBB);
694
Dan Gohman5e843682008-07-14 18:19:29 +0000695 // Free the scheduler state.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000696 {
697 NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName,
698 TimePassesIsEnabled);
Dan Gohman5e843682008-07-14 18:19:29 +0000699 delete Scheduler;
Evan Chengebffb662008-07-01 17:59:20 +0000700 }
Evan Chengdb8d56b2008-06-30 20:45:06 +0000701
Dan Gohman95140a42010-05-01 00:25:44 +0000702 // Free the SelectionDAG state, now that we're finished with it.
703 CurDAG->clear();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000704}
Chris Lattner1c08c712005-01-07 07:47:53 +0000705
Chris Lattner7c306da2010-03-02 06:34:30 +0000706void SelectionDAGISel::DoInstructionSelection() {
Andrew Tricka2f45292011-03-23 01:38:28 +0000707 DEBUG(errs() << "===== Instruction selection begins: BB#"
708 << FuncInfo->MBB->getNumber()
709 << " '" << FuncInfo->MBB->getName() << "'\n");
Chris Lattner7c306da2010-03-02 06:34:30 +0000710
711 PreprocessISelDAG();
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000712
Chris Lattner7c306da2010-03-02 06:34:30 +0000713 // Select target instructions for the DAG.
714 {
715 // Number all nodes with a topological order and set DAGSize.
716 DAGSize = CurDAG->AssignTopologicalOrder();
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000717
Chris Lattner7c306da2010-03-02 06:34:30 +0000718 // Create a dummy node (which is not added to allnodes), that adds
719 // a reference to the root node, preventing it from being deleted,
720 // and tracking any changes of the root.
721 HandleSDNode Dummy(CurDAG->getRoot());
722 ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode());
723 ++ISelPosition;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000724
Chris Lattner7c306da2010-03-02 06:34:30 +0000725 // The AllNodes list is now topological-sorted. Visit the
726 // nodes by starting at the end of the list (the root of the
727 // graph) and preceding back toward the beginning (the entry
728 // node).
729 while (ISelPosition != CurDAG->allnodes_begin()) {
730 SDNode *Node = --ISelPosition;
731 // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes,
732 // but there are currently some corner cases that it misses. Also, this
733 // makes it theoretically possible to disable the DAGCombiner.
734 if (Node->use_empty())
735 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000736
Chris Lattner7c306da2010-03-02 06:34:30 +0000737 SDNode *ResNode = Select(Node);
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000738
Chris Lattner82dd3d32010-03-02 07:50:03 +0000739 // FIXME: This is pretty gross. 'Select' should be changed to not return
740 // anything at all and this code should be nuked with a tactical strike.
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000741
Chris Lattner7c306da2010-03-02 06:34:30 +0000742 // If node should not be replaced, continue with the next one.
Chris Lattner82dd3d32010-03-02 07:50:03 +0000743 if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE)
Chris Lattner7c306da2010-03-02 06:34:30 +0000744 continue;
745 // Replace node.
746 if (ResNode)
747 ReplaceUses(Node, ResNode);
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000748
Chris Lattner7c306da2010-03-02 06:34:30 +0000749 // If after the replacement this node is not used any more,
750 // remove this dead node.
751 if (Node->use_empty()) { // Don't delete EntryToken, etc.
752 ISelUpdater ISU(ISelPosition);
753 CurDAG->RemoveDeadNode(Node, &ISU);
754 }
755 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000756
Chris Lattner7c306da2010-03-02 06:34:30 +0000757 CurDAG->setRoot(Dummy.getValue());
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000758 }
Bill Wendling53f76022010-05-17 23:09:50 +0000759
Chris Lattner7c306da2010-03-02 06:34:30 +0000760 DEBUG(errs() << "===== Instruction selection ends:\n");
761
762 PostprocessISelDAG();
Chris Lattner7c306da2010-03-02 06:34:30 +0000763}
764
Dan Gohman25208642010-04-14 19:53:31 +0000765/// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and
766/// do other setup for EH landing-pad blocks.
Dan Gohman84023e02010-07-10 09:00:22 +0000767void SelectionDAGISel::PrepareEHLandingPad() {
Bill Wendling6f500542011-10-05 22:16:11 +0000768 MachineBasicBlock *MBB = FuncInfo->MBB;
769
Dan Gohman25208642010-04-14 19:53:31 +0000770 // Add a label to mark the beginning of the landing pad. Deletion of the
771 // landing pad can thus be detected via the MachineModuleInfo.
Bill Wendling6f500542011-10-05 22:16:11 +0000772 MCSymbol *Label = MF->getMMI().addLandingPad(MBB);
Dan Gohman25208642010-04-14 19:53:31 +0000773
Bill Wendling30e67402011-10-05 22:24:35 +0000774 // Assign the call site to the landing pad's begin label.
775 MF->getMMI().setCallSiteLandingPad(Label, SDB->LPadToCallSiteMap[MBB]);
776
Evan Chenge837dea2011-06-28 19:10:37 +0000777 const MCInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL);
Bill Wendling6f500542011-10-05 22:16:11 +0000778 BuildMI(*MBB, FuncInfo->InsertPt, SDB->getCurDebugLoc(), II)
Dan Gohman84023e02010-07-10 09:00:22 +0000779 .addSym(Label);
Dan Gohman25208642010-04-14 19:53:31 +0000780
781 // Mark exception register as live in.
782 unsigned Reg = TLI.getExceptionAddressRegister();
Bill Wendling6f500542011-10-05 22:16:11 +0000783 if (Reg) MBB->addLiveIn(Reg);
Dan Gohman25208642010-04-14 19:53:31 +0000784
785 // Mark exception selector register as live in.
786 Reg = TLI.getExceptionSelectorRegister();
Bill Wendling6f500542011-10-05 22:16:11 +0000787 if (Reg) MBB->addLiveIn(Reg);
Dan Gohman25208642010-04-14 19:53:31 +0000788
789 // FIXME: Hack around an exception handling flaw (PR1508): the personality
790 // function and list of typeids logically belong to the invoke (or, if you
791 // like, the basic block containing the invoke), and need to be associated
792 // with it in the dwarf exception handling tables. Currently however the
793 // information is provided by an intrinsic (eh.selector) that can be moved
794 // to unexpected places by the optimizers: if the unwind edge is critical,
795 // then breaking it can result in the intrinsics being in the successor of
796 // the landing pad, not the landing pad itself. This results
797 // in exceptions not being caught because no typeids are associated with
798 // the invoke. This may not be the only way things can go wrong, but it
799 // is the only way we try to work around for the moment.
Bill Wendling6f500542011-10-05 22:16:11 +0000800 const BasicBlock *LLVMBB = MBB->getBasicBlock();
Dan Gohman25208642010-04-14 19:53:31 +0000801 const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator());
802
803 if (Br && Br->isUnconditional()) { // Critical edge?
804 BasicBlock::const_iterator I, E;
805 for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I)
806 if (isa<EHSelectorInst>(I))
807 break;
808
809 if (I == E)
810 // No catch info found - try to extract some from the successor.
811 CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo);
812 }
813}
Chris Lattner7c306da2010-03-02 06:34:30 +0000814
Chris Lattnerb686af02011-04-22 21:59:37 +0000815/// TryToFoldFastISelLoad - We're checking to see if we can fold the specified
816/// load into the specified FoldInst. Note that we could have a sequence where
817/// multiple LLVM IR instructions are folded into the same machineinstr. For
818/// example we could have:
819/// A: x = load i32 *P
820/// B: y = icmp A, 42
821/// C: br y, ...
822///
823/// In this scenario, LI is "A", and FoldInst is "C". We know about "B" (and
824/// any other folded instructions) because it is between A and C.
825///
826/// If we succeed in folding the load into the operation, return true.
827///
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000828bool SelectionDAGISel::TryToFoldFastISelLoad(const LoadInst *LI,
Chris Lattnerb686af02011-04-22 21:59:37 +0000829 const Instruction *FoldInst,
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000830 FastISel *FastIS) {
Chris Lattnerb686af02011-04-22 21:59:37 +0000831 // We know that the load has a single use, but don't know what it is. If it
832 // isn't one of the folded instructions, then we can't succeed here. Handle
833 // this by scanning the single-use users of the load until we get to FoldInst.
834 unsigned MaxUsers = 6; // Don't scan down huge single-use chains of instrs.
Andrew Trick3af7a672011-09-20 03:06:13 +0000835
Chris Lattnerb686af02011-04-22 21:59:37 +0000836 const Instruction *TheUser = LI->use_back();
837 while (TheUser != FoldInst && // Scan up until we find FoldInst.
838 // Stay in the right block.
839 TheUser->getParent() == FoldInst->getParent() &&
840 --MaxUsers) { // Don't scan too far.
841 // If there are multiple or no uses of this instruction, then bail out.
842 if (!TheUser->hasOneUse())
843 return false;
Andrew Trick3af7a672011-09-20 03:06:13 +0000844
Chris Lattnerb686af02011-04-22 21:59:37 +0000845 TheUser = TheUser->use_back();
846 }
Andrew Trick3af7a672011-09-20 03:06:13 +0000847
Chris Lattnerf4ea68f2011-08-11 06:26:54 +0000848 // If we didn't find the fold instruction, then we failed to collapse the
849 // sequence.
850 if (TheUser != FoldInst)
851 return false;
Andrew Trick3af7a672011-09-20 03:06:13 +0000852
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000853 // Don't try to fold volatile loads. Target has to deal with alignment
854 // constraints.
855 if (LI->isVolatile()) return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000856
Chris Lattnerb686af02011-04-22 21:59:37 +0000857 // Figure out which vreg this is going into. If there is no assigned vreg yet
858 // then there actually was no reference to it. Perhaps the load is referenced
859 // by a dead instruction.
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000860 unsigned LoadReg = FastIS->getRegForValue(LI);
Chris Lattnerb686af02011-04-22 21:59:37 +0000861 if (LoadReg == 0)
862 return false;
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000863
864 // Check to see what the uses of this vreg are. If it has no uses, or more
865 // than one use (at the machine instr level) then we can't fold it.
866 MachineRegisterInfo::reg_iterator RI = RegInfo->reg_begin(LoadReg);
867 if (RI == RegInfo->reg_end())
868 return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000869
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000870 // See if there is exactly one use of the vreg. If there are multiple uses,
871 // then the instruction got lowered to multiple machine instructions or the
872 // use of the loaded value ended up being multiple operands of the result, in
873 // either case, we can't fold this.
874 MachineRegisterInfo::reg_iterator PostRI = RI; ++PostRI;
875 if (PostRI != RegInfo->reg_end())
876 return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +0000877
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000878 assert(RI.getOperand().isUse() &&
879 "The only use of the vreg must be a use, we haven't emitted the def!");
880
Chris Lattnerb99fdee2011-01-16 02:27:38 +0000881 MachineInstr *User = &*RI;
Jim Grosbach9d401932011-03-01 01:39:05 +0000882
Chris Lattnerb99fdee2011-01-16 02:27:38 +0000883 // Set the insertion point properly. Folding the load can cause generation of
884 // other random instructions (like sign extends) for addressing modes, make
885 // sure they get inserted in a logical place before the new instruction.
886 FuncInfo->InsertPt = User;
887 FuncInfo->MBB = User->getParent();
888
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000889 // Ask the target to try folding the load.
Chris Lattnerb99fdee2011-01-16 02:27:38 +0000890 return FastIS->TryToFoldLoad(User, RI.getOperandNo(), LI);
Chris Lattnerbeac75d2010-09-05 02:18:34 +0000891}
892
Chris Lattner8bdc2512011-04-17 06:03:19 +0000893/// isFoldedOrDeadInstruction - Return true if the specified instruction is
894/// side-effect free and is either dead or folded into a generated instruction.
895/// Return false if it needs to be emitted.
896static bool isFoldedOrDeadInstruction(const Instruction *I,
897 FunctionLoweringInfo *FuncInfo) {
Chris Lattnerb686af02011-04-22 21:59:37 +0000898 return !I->mayWriteToMemory() && // Side-effecting instructions aren't folded.
899 !isa<TerminatorInst>(I) && // Terminators aren't folded.
900 !isa<DbgInfoIntrinsic>(I) && // Debug instructions aren't folded.
Bill Wendling4477d692011-08-23 21:33:05 +0000901 !isa<LandingPadInst>(I) && // Landingpad instructions aren't folded.
Chris Lattnerb686af02011-04-22 21:59:37 +0000902 !FuncInfo->isExportedInst(I); // Exported instrs must be computed.
Chris Lattner8bdc2512011-04-17 06:03:19 +0000903}
904
Chad Rosier73e08d32011-12-08 21:37:10 +0000905#ifndef NDEBUG
Chad Rosier4bf76e02012-01-06 23:45:47 +0000906// Collect per Instruction statistics for fast-isel misses. Only those
907// instructions that cause the bail are accounted for. It does not account for
908// instructions higher in the block. Thus, summing the per instructions stats
909// will not add up to what is reported by NumFastIselFailures.
Chad Rosier73e08d32011-12-08 21:37:10 +0000910static void collectFailStats(const Instruction *I) {
911 switch (I->getOpcode()) {
912 default: assert (0 && "<Invalid operator> ");
913
914 // Terminators
915 case Instruction::Ret: NumFastIselFailRet++; return;
916 case Instruction::Br: NumFastIselFailBr++; return;
917 case Instruction::Switch: NumFastIselFailSwitch++; return;
918 case Instruction::IndirectBr: NumFastIselFailIndirectBr++; return;
919 case Instruction::Invoke: NumFastIselFailInvoke++; return;
920 case Instruction::Resume: NumFastIselFailResume++; return;
921 case Instruction::Unwind: NumFastIselFailUnwind++; return;
922 case Instruction::Unreachable: NumFastIselFailUnreachable++; return;
923
924 // Standard binary operators...
925 case Instruction::Add: NumFastIselFailAdd++; return;
926 case Instruction::FAdd: NumFastIselFailFAdd++; return;
927 case Instruction::Sub: NumFastIselFailSub++; return;
928 case Instruction::FSub: NumFastIselFailFSub++; return;
929 case Instruction::Mul: NumFastIselFailMul++; return;
930 case Instruction::FMul: NumFastIselFailFMul++; return;
931 case Instruction::UDiv: NumFastIselFailUDiv++; return;
932 case Instruction::SDiv: NumFastIselFailSDiv++; return;
933 case Instruction::FDiv: NumFastIselFailFDiv++; return;
934 case Instruction::URem: NumFastIselFailURem++; return;
935 case Instruction::SRem: NumFastIselFailSRem++; return;
936 case Instruction::FRem: NumFastIselFailFRem++; return;
937
938 // Logical operators...
939 case Instruction::And: NumFastIselFailAnd++; return;
940 case Instruction::Or: NumFastIselFailOr++; return;
941 case Instruction::Xor: NumFastIselFailXor++; return;
942
943 // Memory instructions...
944 case Instruction::Alloca: NumFastIselFailAlloca++; return;
945 case Instruction::Load: NumFastIselFailLoad++; return;
946 case Instruction::Store: NumFastIselFailStore++; return;
947 case Instruction::AtomicCmpXchg: NumFastIselFailAtomicCmpXchg++; return;
948 case Instruction::AtomicRMW: NumFastIselFailAtomicRMW++; return;
949 case Instruction::Fence: NumFastIselFailFence++; return;
950 case Instruction::GetElementPtr: NumFastIselFailGetElementPtr++; return;
951
952 // Convert instructions...
953 case Instruction::Trunc: NumFastIselFailTrunc++; return;
954 case Instruction::ZExt: NumFastIselFailZExt++; return;
955 case Instruction::SExt: NumFastIselFailSExt++; return;
956 case Instruction::FPTrunc: NumFastIselFailFPTrunc++; return;
957 case Instruction::FPExt: NumFastIselFailFPExt++; return;
958 case Instruction::FPToUI: NumFastIselFailFPToUI++; return;
959 case Instruction::FPToSI: NumFastIselFailFPToSI++; return;
960 case Instruction::UIToFP: NumFastIselFailUIToFP++; return;
961 case Instruction::SIToFP: NumFastIselFailSIToFP++; return;
962 case Instruction::IntToPtr: NumFastIselFailIntToPtr++; return;
963 case Instruction::PtrToInt: NumFastIselFailPtrToInt++; return;
964 case Instruction::BitCast: NumFastIselFailBitCast++; return;
965
966 // Other instructions...
967 case Instruction::ICmp: NumFastIselFailICmp++; return;
968 case Instruction::FCmp: NumFastIselFailFCmp++; return;
969 case Instruction::PHI: NumFastIselFailPHI++; return;
970 case Instruction::Select: NumFastIselFailSelect++; return;
971 case Instruction::Call: NumFastIselFailCall++; return;
972 case Instruction::Shl: NumFastIselFailShl++; return;
973 case Instruction::LShr: NumFastIselFailLShr++; return;
974 case Instruction::AShr: NumFastIselFailAShr++; return;
975 case Instruction::VAArg: NumFastIselFailVAArg++; return;
976 case Instruction::ExtractElement: NumFastIselFailExtractElement++; return;
977 case Instruction::InsertElement: NumFastIselFailInsertElement++; return;
978 case Instruction::ShuffleVector: NumFastIselFailShuffleVector++; return;
979 case Instruction::ExtractValue: NumFastIselFailExtractValue++; return;
980 case Instruction::InsertValue: NumFastIselFailInsertValue++; return;
981 case Instruction::LandingPad: NumFastIselFailLandingPad++; return;
982 }
983 return;
984}
985#endif
986
Dan Gohman46510a72010-04-15 01:51:59 +0000987void SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) {
Dan Gohmana43abd12008-09-29 21:55:50 +0000988 // Initialize the Fast-ISel state, if needed.
989 FastISel *FastIS = 0;
Nick Lewycky8a8d4792011-12-02 22:16:29 +0000990 if (TM.Options.EnableFastISel)
Dan Gohmana4160c32010-07-07 16:29:44 +0000991 FastIS = TLI.createFastISel(*FuncInfo);
Dan Gohmana43abd12008-09-29 21:55:50 +0000992
993 // Iterate over all basic blocks in the function.
Cameron Zwarich2dbe2852011-02-24 10:00:04 +0000994 ReversePostOrderTraversal<const Function*> RPOT(&Fn);
995 for (ReversePostOrderTraversal<const Function*>::rpo_iterator
996 I = RPOT.begin(), E = RPOT.end(); I != E; ++I) {
997 const BasicBlock *LLVMBB = *I;
Cameron Zwaricha46cd972011-02-24 10:00:13 +0000998
Cameron Zwarich324a24f2011-02-24 10:00:16 +0000999 if (OptLevel != CodeGenOpt::None) {
1000 bool AllPredsVisited = true;
1001 for (const_pred_iterator PI = pred_begin(LLVMBB), PE = pred_end(LLVMBB);
1002 PI != PE; ++PI) {
1003 if (!FuncInfo->VisitedBBs.count(*PI)) {
1004 AllPredsVisited = false;
1005 break;
1006 }
1007 }
1008
Cameron Zwarich8ca814c2011-02-24 10:00:25 +00001009 if (AllPredsVisited) {
Chris Lattner8bdc2512011-04-17 06:03:19 +00001010 for (BasicBlock::const_iterator I = LLVMBB->begin();
1011 isa<PHINode>(I); ++I)
Cameron Zwarich8ca814c2011-02-24 10:00:25 +00001012 FuncInfo->ComputePHILiveOutRegInfo(cast<PHINode>(I));
Cameron Zwarich8ca814c2011-02-24 10:00:25 +00001013 } else {
Chris Lattner8bdc2512011-04-17 06:03:19 +00001014 for (BasicBlock::const_iterator I = LLVMBB->begin();
1015 isa<PHINode>(I); ++I)
Cameron Zwarich324a24f2011-02-24 10:00:16 +00001016 FuncInfo->InvalidatePHILiveOutRegInfo(cast<PHINode>(I));
Cameron Zwarich324a24f2011-02-24 10:00:16 +00001017 }
1018
Cameron Zwaricha46cd972011-02-24 10:00:13 +00001019 FuncInfo->VisitedBBs.insert(LLVMBB);
Cameron Zwarich324a24f2011-02-24 10:00:16 +00001020 }
Cameron Zwaricha46cd972011-02-24 10:00:13 +00001021
Dan Gohman84023e02010-07-10 09:00:22 +00001022 FuncInfo->MBB = FuncInfo->MBBMap[LLVMBB];
1023 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
Dan Gohmanf350b272008-08-23 02:25:05 +00001024
Dan Gohmanba5be5c2010-04-20 15:00:41 +00001025 BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI();
Dan Gohman46510a72010-04-15 01:51:59 +00001026 BasicBlock::const_iterator const End = LLVMBB->end();
Dan Gohman84023e02010-07-10 09:00:22 +00001027 BasicBlock::const_iterator BI = End;
Dan Gohman5edd3612008-08-28 20:28:56 +00001028
Dan Gohman84023e02010-07-10 09:00:22 +00001029 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
1030
1031 // Setup an EH landing-pad block.
1032 if (FuncInfo->MBB->isLandingPad())
1033 PrepareEHLandingPad();
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001034
Dan Gohmanf5951412010-07-08 01:00:56 +00001035 // Lower any arguments needed in this block if this is the entry block.
Devang Patel68e6bee2011-02-21 23:21:26 +00001036 if (LLVMBB == &Fn.getEntryBlock())
Dan Gohmanf5951412010-07-08 01:00:56 +00001037 LowerArguments(LLVMBB);
1038
Dan Gohmanf350b272008-08-23 02:25:05 +00001039 // Before doing SelectionDAG ISel, see if FastISel has been requested.
Dan Gohmand725f042010-05-01 02:44:23 +00001040 if (FastIS) {
Dan Gohman84023e02010-07-10 09:00:22 +00001041 FastIS->startNewBlock();
1042
Dan Gohmanf5951412010-07-08 01:00:56 +00001043 // Emit code for any incoming arguments. This must happen before
1044 // beginning FastISel on the entry block.
1045 if (LLVMBB == &Fn.getEntryBlock()) {
1046 CurDAG->setRoot(SDB->getControlRoot());
1047 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001048 CodeGenAndEmitDAG();
1049
1050 // If we inserted any instructions at the beginning, make a note of
1051 // where they are, so we can be sure to emit subsequent instructions
1052 // after them.
1053 if (FuncInfo->InsertPt != FuncInfo->MBB->begin())
1054 FastIS->setLastLocalValue(llvm::prior(FuncInfo->InsertPt));
1055 else
1056 FastIS->setLastLocalValue(0);
Dan Gohmanf5951412010-07-08 01:00:56 +00001057 }
Dan Gohman84023e02010-07-10 09:00:22 +00001058
Chad Rosierf91488c2011-11-16 21:02:08 +00001059 unsigned NumFastIselRemaining = std::distance(Begin, End);
Dan Gohmana43abd12008-09-29 21:55:50 +00001060 // Do FastISel on as many instructions as possible.
Dan Gohman84023e02010-07-10 09:00:22 +00001061 for (; BI != Begin; --BI) {
1062 const Instruction *Inst = llvm::prior(BI);
1063
1064 // If we no longer require this instruction, skip it.
Chad Rosierf91488c2011-11-16 21:02:08 +00001065 if (isFoldedOrDeadInstruction(Inst, FuncInfo)) {
1066 --NumFastIselRemaining;
Dan Gohman20d4be12010-07-01 02:58:57 +00001067 continue;
Chad Rosierf91488c2011-11-16 21:02:08 +00001068 }
Dan Gohman84023e02010-07-10 09:00:22 +00001069
1070 // Bottom-up: reset the insert pos at the top, after any local-value
1071 // instructions.
1072 FastIS->recomputeInsertPt();
Dan Gohman20d4be12010-07-01 02:58:57 +00001073
Dan Gohman21c14e32010-01-12 04:32:35 +00001074 // Try to select the instruction with FastISel.
Chris Lattnerbeac75d2010-09-05 02:18:34 +00001075 if (FastIS->SelectInstruction(Inst)) {
Chad Rosierf91488c2011-11-16 21:02:08 +00001076 --NumFastIselRemaining;
Jim Grosbach62427ae2011-05-16 21:51:07 +00001077 ++NumFastIselSuccess;
Chris Lattnerb686af02011-04-22 21:59:37 +00001078 // If fast isel succeeded, skip over all the folded instructions, and
1079 // then see if there is a load right before the selected instructions.
1080 // Try to fold the load if so.
1081 const Instruction *BeforeInst = Inst;
1082 while (BeforeInst != Begin) {
1083 BeforeInst = llvm::prior(BasicBlock::const_iterator(BeforeInst));
1084 if (!isFoldedOrDeadInstruction(BeforeInst, FuncInfo))
1085 break;
1086 }
1087 if (BeforeInst != Inst && isa<LoadInst>(BeforeInst) &&
1088 BeforeInst->hasOneUse() &&
Chad Rosierf91488c2011-11-16 21:02:08 +00001089 TryToFoldFastISelLoad(cast<LoadInst>(BeforeInst), Inst, FastIS)) {
Chris Lattnerb686af02011-04-22 21:59:37 +00001090 // If we succeeded, don't re-select the load.
1091 BI = llvm::next(BasicBlock::const_iterator(BeforeInst));
Chad Rosierf91488c2011-11-16 21:02:08 +00001092 --NumFastIselRemaining;
1093 ++NumFastIselSuccess;
1094 }
Dan Gohmana43abd12008-09-29 21:55:50 +00001095 continue;
Chris Lattnerbeac75d2010-09-05 02:18:34 +00001096 }
Dan Gohmana43abd12008-09-29 21:55:50 +00001097
Chad Rosier73e08d32011-12-08 21:37:10 +00001098#ifndef NDEBUG
Chad Rosierf2a745e2011-12-13 00:05:11 +00001099 if (EnableFastISelVerbose2)
1100 collectFailStats(Inst);
Chad Rosier73e08d32011-12-08 21:37:10 +00001101#endif
1102
Dan Gohmana43abd12008-09-29 21:55:50 +00001103 // Then handle certain instructions as single-LLVM-Instruction blocks.
Dan Gohman84023e02010-07-10 09:00:22 +00001104 if (isa<CallInst>(Inst)) {
Chad Rosierf91488c2011-11-16 21:02:08 +00001105
Dan Gohmana43abd12008-09-29 21:55:50 +00001106 if (EnableFastISelVerbose || EnableFastISelAbort) {
David Greene1a053232010-01-05 01:26:11 +00001107 dbgs() << "FastISel missed call: ";
Dan Gohman84023e02010-07-10 09:00:22 +00001108 Inst->dump();
Dan Gohmana43abd12008-09-29 21:55:50 +00001109 }
1110
Dan Gohman84023e02010-07-10 09:00:22 +00001111 if (!Inst->getType()->isVoidTy() && !Inst->use_empty()) {
1112 unsigned &R = FuncInfo->ValueMap[Inst];
Dan Gohmana43abd12008-09-29 21:55:50 +00001113 if (!R)
Dan Gohman84023e02010-07-10 09:00:22 +00001114 R = FuncInfo->CreateRegs(Inst->getType());
Dan Gohmana43abd12008-09-29 21:55:50 +00001115 }
1116
Dan Gohmanb4afb132009-11-20 02:51:26 +00001117 bool HadTailCall = false;
Devang Pateldf8370b2010-10-25 21:31:46 +00001118 SelectBasicBlock(Inst, BI, HadTailCall);
Dan Gohmanb4afb132009-11-20 02:51:26 +00001119
Chad Rosierf91488c2011-11-16 21:02:08 +00001120 // Recompute NumFastIselRemaining as Selection DAG instruction
1121 // selection may have handled the call, input args, etc.
1122 unsigned RemainingNow = std::distance(Begin, BI);
1123 NumFastIselFailures += NumFastIselRemaining - RemainingNow;
1124
Dan Gohmanb4afb132009-11-20 02:51:26 +00001125 // If the call was emitted as a tail call, we're done with the block.
1126 if (HadTailCall) {
Dan Gohman84023e02010-07-10 09:00:22 +00001127 --BI;
Dan Gohmanb4afb132009-11-20 02:51:26 +00001128 break;
1129 }
1130
Chad Rosierf91488c2011-11-16 21:02:08 +00001131 NumFastIselRemaining = RemainingNow;
Dan Gohmana43abd12008-09-29 21:55:50 +00001132 continue;
Dan Gohmanf350b272008-08-23 02:25:05 +00001133 }
Dan Gohmana43abd12008-09-29 21:55:50 +00001134
Eli Friedman9c4dae62011-05-17 23:02:10 +00001135 if (isa<TerminatorInst>(Inst) && !isa<BranchInst>(Inst)) {
1136 // Don't abort, and use a different message for terminator misses.
Chad Rosierf91488c2011-11-16 21:02:08 +00001137 NumFastIselFailures += NumFastIselRemaining;
Eli Friedman9c4dae62011-05-17 23:02:10 +00001138 if (EnableFastISelVerbose || EnableFastISelAbort) {
1139 dbgs() << "FastISel missed terminator: ";
1140 Inst->dump();
1141 }
1142 } else {
Chad Rosierf91488c2011-11-16 21:02:08 +00001143 NumFastIselFailures += NumFastIselRemaining;
Dan Gohmana43abd12008-09-29 21:55:50 +00001144 if (EnableFastISelVerbose || EnableFastISelAbort) {
David Greene1a053232010-01-05 01:26:11 +00001145 dbgs() << "FastISel miss: ";
Dan Gohman84023e02010-07-10 09:00:22 +00001146 Inst->dump();
Dan Gohmana43abd12008-09-29 21:55:50 +00001147 }
1148 if (EnableFastISelAbort)
1149 // The "fast" selector couldn't handle something and bailed.
1150 // For the purpose of debugging, just abort.
Torok Edwinc23197a2009-07-14 16:55:14 +00001151 llvm_unreachable("FastISel didn't select the entire block");
Dan Gohmana43abd12008-09-29 21:55:50 +00001152 }
1153 break;
Dan Gohmanf350b272008-08-23 02:25:05 +00001154 }
Dan Gohman84023e02010-07-10 09:00:22 +00001155
1156 FastIS->recomputeInsertPt();
Dan Gohmanf350b272008-08-23 02:25:05 +00001157 }
1158
Devang Pateldf8370b2010-10-25 21:31:46 +00001159 if (Begin != BI)
1160 ++NumDAGBlocks;
1161 else
1162 ++NumFastIselBlocks;
1163
Eli Friedman37d38bf2011-04-19 17:01:08 +00001164 if (Begin != BI) {
1165 // Run SelectionDAG instruction selection on the remainder of the block
1166 // not handled by FastISel. If FastISel is not run, this is the entire
1167 // block.
1168 bool HadTailCall;
1169 SelectBasicBlock(Begin, BI, HadTailCall);
1170 }
Dan Gohmanf350b272008-08-23 02:25:05 +00001171
Dan Gohman84023e02010-07-10 09:00:22 +00001172 FinishBasicBlock();
Dan Gohman620427d2010-04-22 19:55:20 +00001173 FuncInfo->PHINodesToUpdate.clear();
Evan Cheng39fd6e82008-08-07 00:43:25 +00001174 }
Dan Gohmana43abd12008-09-29 21:55:50 +00001175
1176 delete FastIS;
Devang Patel23385752011-05-23 17:44:13 +00001177 SDB->clearDanglingDebugInfo();
Dan Gohman0e5f1302008-07-07 23:02:41 +00001178}
1179
Dan Gohmanfed90b62008-07-28 21:51:04 +00001180void
Dan Gohman84023e02010-07-10 09:00:22 +00001181SelectionDAGISel::FinishBasicBlock() {
Dan Gohmanf350b272008-08-23 02:25:05 +00001182
David Greene1a053232010-01-05 01:26:11 +00001183 DEBUG(dbgs() << "Total amount of phi nodes to update: "
Dan Gohman927f8662010-06-18 16:00:29 +00001184 << FuncInfo->PHINodesToUpdate.size() << "\n";
1185 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i)
David Greene1a053232010-01-05 01:26:11 +00001186 dbgs() << "Node " << i << " : ("
Dan Gohman620427d2010-04-22 19:55:20 +00001187 << FuncInfo->PHINodesToUpdate[i].first
1188 << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n");
Daniel Dunbara279bc32009-09-20 02:20:51 +00001189
Chris Lattnera33ef482005-03-30 01:10:47 +00001190 // Next, now that we know what the last MBB the LLVM BB expanded is, update
Chris Lattner1c08c712005-01-07 07:47:53 +00001191 // PHI nodes in successors.
Dan Gohman2048b852009-11-23 18:04:58 +00001192 if (SDB->SwitchCases.empty() &&
1193 SDB->JTCases.empty() &&
1194 SDB->BitTestCases.empty()) {
Dan Gohman620427d2010-04-22 19:55:20 +00001195 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
1196 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
Chris Lattner518bb532010-02-09 19:54:29 +00001197 assert(PHI->isPHI() &&
Nate Begemanf15485a2006-03-27 01:32:24 +00001198 "This is not a machine PHI node that we are updating!");
Dan Gohman84023e02010-07-10 09:00:22 +00001199 if (!FuncInfo->MBB->isSuccessor(PHI->getParent()))
Jakob Stoklund Olesen580bba22010-03-05 21:49:10 +00001200 continue;
Dan Gohman620427d2010-04-22 19:55:20 +00001201 PHI->addOperand(
1202 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
Dan Gohman84023e02010-07-10 09:00:22 +00001203 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Nate Begemanf15485a2006-03-27 01:32:24 +00001204 }
1205 return;
Chris Lattner1c08c712005-01-07 07:47:53 +00001206 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001207
Dan Gohman2048b852009-11-23 18:04:58 +00001208 for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001209 // Lower header first, if it wasn't already lowered
Dan Gohman2048b852009-11-23 18:04:58 +00001210 if (!SDB->BitTestCases[i].Emitted) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001211 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001212 FuncInfo->MBB = SDB->BitTestCases[i].Parent;
1213 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001214 // Emit the code
Dan Gohman84023e02010-07-10 09:00:22 +00001215 SDB->visitBitTestHeader(SDB->BitTestCases[i], FuncInfo->MBB);
Dan Gohman2048b852009-11-23 18:04:58 +00001216 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +00001217 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001218 CodeGenAndEmitDAG();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001219 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001220
Dan Gohman2048b852009-11-23 18:04:58 +00001221 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001222 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001223 FuncInfo->MBB = SDB->BitTestCases[i].Cases[j].ThisBB;
1224 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001225 // Emit the code
1226 if (j+1 != ej)
Evan Chengd08e5b42011-01-06 01:02:44 +00001227 SDB->visitBitTestCase(SDB->BitTestCases[i],
1228 SDB->BitTestCases[i].Cases[j+1].ThisBB,
Dan Gohman2048b852009-11-23 18:04:58 +00001229 SDB->BitTestCases[i].Reg,
Dan Gohman99be8ae2010-04-19 22:41:47 +00001230 SDB->BitTestCases[i].Cases[j],
Dan Gohman84023e02010-07-10 09:00:22 +00001231 FuncInfo->MBB);
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001232 else
Evan Chengd08e5b42011-01-06 01:02:44 +00001233 SDB->visitBitTestCase(SDB->BitTestCases[i],
1234 SDB->BitTestCases[i].Default,
Dan Gohman2048b852009-11-23 18:04:58 +00001235 SDB->BitTestCases[i].Reg,
Dan Gohman99be8ae2010-04-19 22:41:47 +00001236 SDB->BitTestCases[i].Cases[j],
Dan Gohman84023e02010-07-10 09:00:22 +00001237 FuncInfo->MBB);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001238
1239
Dan Gohman2048b852009-11-23 18:04:58 +00001240 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +00001241 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001242 CodeGenAndEmitDAG();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001243 }
1244
1245 // Update PHI Nodes
Dan Gohman620427d2010-04-22 19:55:20 +00001246 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
1247 pi != pe; ++pi) {
1248 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001249 MachineBasicBlock *PHIBB = PHI->getParent();
Chris Lattner518bb532010-02-09 19:54:29 +00001250 assert(PHI->isPHI() &&
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001251 "This is not a machine PHI node that we are updating!");
1252 // This is "default" BB. We have two jumps to it. From "header" BB and
1253 // from last "case" BB.
Dan Gohman2048b852009-11-23 18:04:58 +00001254 if (PHIBB == SDB->BitTestCases[i].Default) {
Jim Grosbachf4549b02010-01-15 00:36:15 +00001255 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001256 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1257 false));
Dan Gohman2048b852009-11-23 18:04:58 +00001258 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent));
Jim Grosbachf4549b02010-01-15 00:36:15 +00001259 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001260 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1261 false));
Dan Gohman2048b852009-11-23 18:04:58 +00001262 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases.
Chris Lattner9ce2e9d2007-12-30 00:57:42 +00001263 back().ThisBB));
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001264 }
1265 // One of "cases" BB.
Dan Gohman2048b852009-11-23 18:04:58 +00001266 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size();
Dan Gohman7c3234c2008-08-27 23:52:12 +00001267 j != ej; ++j) {
Dan Gohman2048b852009-11-23 18:04:58 +00001268 MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB;
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001269 if (cBB->isSuccessor(PHIBB)) {
Jim Grosbachf4549b02010-01-15 00:36:15 +00001270 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001271 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1272 false));
Chris Lattner9ce2e9d2007-12-30 00:57:42 +00001273 PHI->addOperand(MachineOperand::CreateMBB(cBB));
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001274 }
1275 }
1276 }
1277 }
Dan Gohman2048b852009-11-23 18:04:58 +00001278 SDB->BitTestCases.clear();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001279
Nate Begeman9453eea2006-04-23 06:26:20 +00001280 // If the JumpTable record is filled in, then we need to emit a jump table.
1281 // Updating the PHI nodes is tricky in this case, since we need to determine
1282 // whether the PHI is a successor of the range check MBB or the jump table MBB
Dan Gohman2048b852009-11-23 18:04:58 +00001283 for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) {
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +00001284 // Lower header first, if it wasn't already lowered
Dan Gohman2048b852009-11-23 18:04:58 +00001285 if (!SDB->JTCases[i].first.Emitted) {
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +00001286 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001287 FuncInfo->MBB = SDB->JTCases[i].first.HeaderBB;
1288 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +00001289 // Emit the code
Dan Gohman99be8ae2010-04-19 22:41:47 +00001290 SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first,
Dan Gohman84023e02010-07-10 09:00:22 +00001291 FuncInfo->MBB);
Dan Gohman2048b852009-11-23 18:04:58 +00001292 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +00001293 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001294 CodeGenAndEmitDAG();
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001295 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001296
Nate Begeman37efe672006-04-22 18:53:45 +00001297 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohman84023e02010-07-10 09:00:22 +00001298 FuncInfo->MBB = SDB->JTCases[i].second.MBB;
1299 FuncInfo->InsertPt = FuncInfo->MBB->end();
Nate Begeman37efe672006-04-22 18:53:45 +00001300 // Emit the code
Dan Gohman2048b852009-11-23 18:04:58 +00001301 SDB->visitJumpTable(SDB->JTCases[i].second);
1302 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +00001303 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001304 CodeGenAndEmitDAG();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001305
Nate Begeman37efe672006-04-22 18:53:45 +00001306 // Update PHI Nodes
Dan Gohman620427d2010-04-22 19:55:20 +00001307 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
1308 pi != pe; ++pi) {
1309 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
Nate Begeman37efe672006-04-22 18:53:45 +00001310 MachineBasicBlock *PHIBB = PHI->getParent();
Chris Lattner518bb532010-02-09 19:54:29 +00001311 assert(PHI->isPHI() &&
Nate Begeman37efe672006-04-22 18:53:45 +00001312 "This is not a machine PHI node that we are updating!");
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001313 // "default" BB. We can go there only from header BB.
Dan Gohman2048b852009-11-23 18:04:58 +00001314 if (PHIBB == SDB->JTCases[i].second.Default) {
Evan Chengce319102009-09-19 09:51:03 +00001315 PHI->addOperand
Dan Gohman620427d2010-04-22 19:55:20 +00001316 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1317 false));
Evan Chengce319102009-09-19 09:51:03 +00001318 PHI->addOperand
Dan Gohman2048b852009-11-23 18:04:58 +00001319 (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB));
Nate Begemanf4360a42006-05-03 03:48:02 +00001320 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +00001321 // JT BB. Just iterate over successors here
Dan Gohman84023e02010-07-10 09:00:22 +00001322 if (FuncInfo->MBB->isSuccessor(PHIBB)) {
Evan Chengce319102009-09-19 09:51:03 +00001323 PHI->addOperand
Dan Gohman620427d2010-04-22 19:55:20 +00001324 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
1325 false));
Dan Gohman84023e02010-07-10 09:00:22 +00001326 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Nate Begeman37efe672006-04-22 18:53:45 +00001327 }
1328 }
Nate Begeman37efe672006-04-22 18:53:45 +00001329 }
Dan Gohman2048b852009-11-23 18:04:58 +00001330 SDB->JTCases.clear();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001331
Chris Lattnerb2e806e2006-10-22 23:00:53 +00001332 // If the switch block involved a branch to one of the actual successors, we
1333 // need to update PHI nodes in that block.
Dan Gohman620427d2010-04-22 19:55:20 +00001334 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
1335 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
Chris Lattner518bb532010-02-09 19:54:29 +00001336 assert(PHI->isPHI() &&
Chris Lattnerb2e806e2006-10-22 23:00:53 +00001337 "This is not a machine PHI node that we are updating!");
Dan Gohman84023e02010-07-10 09:00:22 +00001338 if (FuncInfo->MBB->isSuccessor(PHI->getParent())) {
Dan Gohman620427d2010-04-22 19:55:20 +00001339 PHI->addOperand(
1340 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
Dan Gohman84023e02010-07-10 09:00:22 +00001341 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Chris Lattnerb2e806e2006-10-22 23:00:53 +00001342 }
1343 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001344
Nate Begemanf15485a2006-03-27 01:32:24 +00001345 // If we generated any switch lowering information, build and codegen any
1346 // additional DAGs necessary.
Dan Gohman2048b852009-11-23 18:04:58 +00001347 for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) {
Nate Begemanf15485a2006-03-27 01:32:24 +00001348 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohmanca5f6162011-01-14 22:26:16 +00001349 FuncInfo->MBB = SDB->SwitchCases[i].ThisBB;
Dan Gohman84023e02010-07-10 09:00:22 +00001350 FuncInfo->InsertPt = FuncInfo->MBB->end();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001351
Dan Gohman95140a42010-05-01 00:25:44 +00001352 // Determine the unique successors.
1353 SmallVector<MachineBasicBlock *, 2> Succs;
1354 Succs.push_back(SDB->SwitchCases[i].TrueBB);
1355 if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB)
1356 Succs.push_back(SDB->SwitchCases[i].FalseBB);
1357
Dan Gohmanca5f6162011-01-14 22:26:16 +00001358 // Emit the code. Note that this could result in FuncInfo->MBB being split.
Dan Gohman84023e02010-07-10 09:00:22 +00001359 SDB->visitSwitchCase(SDB->SwitchCases[i], FuncInfo->MBB);
Dan Gohman2048b852009-11-23 18:04:58 +00001360 CurDAG->setRoot(SDB->getRoot());
Dan Gohman95140a42010-05-01 00:25:44 +00001361 SDB->clear();
Dan Gohman84023e02010-07-10 09:00:22 +00001362 CodeGenAndEmitDAG();
Dan Gohmanca5f6162011-01-14 22:26:16 +00001363
1364 // Remember the last block, now that any splitting is done, for use in
1365 // populating PHI nodes in successors.
1366 MachineBasicBlock *ThisBB = FuncInfo->MBB;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001367
Chris Lattnerd5e93c02006-09-07 01:59:34 +00001368 // Handle any PHI nodes in successors of this chunk, as if we were coming
1369 // from the original BB before switch expansion. Note that PHI nodes can
1370 // occur multiple times in PHINodesToUpdate. We have to be very careful to
1371 // handle them the right number of times.
Dan Gohman95140a42010-05-01 00:25:44 +00001372 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
Dan Gohman84023e02010-07-10 09:00:22 +00001373 FuncInfo->MBB = Succs[i];
1374 FuncInfo->InsertPt = FuncInfo->MBB->end();
1375 // FuncInfo->MBB may have been removed from the CFG if a branch was
1376 // constant folded.
1377 if (ThisBB->isSuccessor(FuncInfo->MBB)) {
1378 for (MachineBasicBlock::iterator Phi = FuncInfo->MBB->begin();
1379 Phi != FuncInfo->MBB->end() && Phi->isPHI();
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001380 ++Phi) {
1381 // This value for this PHI node is recorded in PHINodesToUpdate.
1382 for (unsigned pn = 0; ; ++pn) {
Dan Gohman620427d2010-04-22 19:55:20 +00001383 assert(pn != FuncInfo->PHINodesToUpdate.size() &&
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001384 "Didn't find PHI entry!");
Dan Gohman620427d2010-04-22 19:55:20 +00001385 if (FuncInfo->PHINodesToUpdate[pn].first == Phi) {
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001386 Phi->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +00001387 CreateReg(FuncInfo->PHINodesToUpdate[pn].second,
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +00001388 false));
1389 Phi->addOperand(MachineOperand::CreateMBB(ThisBB));
1390 break;
1391 }
Evan Cheng8be58a12009-09-18 08:26:06 +00001392 }
Chris Lattnerd5e93c02006-09-07 01:59:34 +00001393 }
Nate Begemanf15485a2006-03-27 01:32:24 +00001394 }
1395 }
Chris Lattnera33ef482005-03-30 01:10:47 +00001396 }
Dan Gohman2048b852009-11-23 18:04:58 +00001397 SDB->SwitchCases.clear();
Chris Lattner1c08c712005-01-07 07:47:53 +00001398}
Evan Chenga9c20912006-01-21 02:32:06 +00001399
Jim Laskey13ec7022006-08-01 14:21:23 +00001400
Dan Gohman0a3776d2009-02-06 18:26:51 +00001401/// Create the scheduler. If a specific scheduler was specified
1402/// via the SchedulerRegistry, use it, otherwise select the
1403/// one preferred by the target.
Dan Gohman5e843682008-07-14 18:19:29 +00001404///
Dan Gohman47ac0f02009-02-11 04:27:20 +00001405ScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() {
Jim Laskeyeb577ba2006-08-02 12:30:23 +00001406 RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001407
Jim Laskey13ec7022006-08-01 14:21:23 +00001408 if (!Ctor) {
Jim Laskeyeb577ba2006-08-02 12:30:23 +00001409 Ctor = ISHeuristic;
Jim Laskey9373beb2006-08-01 19:14:14 +00001410 RegisterScheduler::setDefault(Ctor);
Evan Cheng4ef10862006-01-23 07:01:07 +00001411 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001412
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +00001413 return Ctor(this, OptLevel);
Evan Chenga9c20912006-01-21 02:32:06 +00001414}
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001415
Chris Lattner75548062006-10-11 03:58:02 +00001416//===----------------------------------------------------------------------===//
1417// Helper functions used by the generated instruction selector.
1418//===----------------------------------------------------------------------===//
1419// Calls to these methods are generated by tblgen.
1420
1421/// CheckAndMask - The isel is trying to match something like (and X, 255). If
1422/// the dag combiner simplified the 255, we still want to match. RHS is the
1423/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
1424/// specified in the .td file (e.g. 255).
Daniel Dunbara279bc32009-09-20 02:20:51 +00001425bool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS,
Dan Gohmandc9b3d02007-07-24 23:00:27 +00001426 int64_t DesiredMaskS) const {
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001427 const APInt &ActualMask = RHS->getAPIntValue();
1428 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001429
Chris Lattner75548062006-10-11 03:58:02 +00001430 // If the actual mask exactly matches, success!
1431 if (ActualMask == DesiredMask)
1432 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001433
Chris Lattner75548062006-10-11 03:58:02 +00001434 // If the actual AND mask is allowing unallowed bits, this doesn't match.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001435 if (ActualMask.intersects(~DesiredMask))
Chris Lattner75548062006-10-11 03:58:02 +00001436 return false;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001437
Chris Lattner75548062006-10-11 03:58:02 +00001438 // Otherwise, the DAG Combiner may have proven that the value coming in is
1439 // either already zero or is not demanded. Check for known zero input bits.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001440 APInt NeededMask = DesiredMask & ~ActualMask;
Dan Gohmanea859be2007-06-22 14:59:07 +00001441 if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
Chris Lattner75548062006-10-11 03:58:02 +00001442 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001443
Chris Lattner75548062006-10-11 03:58:02 +00001444 // TODO: check to see if missing bits are just not demanded.
1445
1446 // Otherwise, this pattern doesn't match.
1447 return false;
1448}
1449
1450/// CheckOrMask - The isel is trying to match something like (or X, 255). If
1451/// the dag combiner simplified the 255, we still want to match. RHS is the
1452/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
1453/// specified in the .td file (e.g. 255).
Daniel Dunbara279bc32009-09-20 02:20:51 +00001454bool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS,
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001455 int64_t DesiredMaskS) const {
1456 const APInt &ActualMask = RHS->getAPIntValue();
1457 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001458
Chris Lattner75548062006-10-11 03:58:02 +00001459 // If the actual mask exactly matches, success!
1460 if (ActualMask == DesiredMask)
1461 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001462
Chris Lattner75548062006-10-11 03:58:02 +00001463 // If the actual AND mask is allowing unallowed bits, this doesn't match.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001464 if (ActualMask.intersects(~DesiredMask))
Chris Lattner75548062006-10-11 03:58:02 +00001465 return false;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001466
Chris Lattner75548062006-10-11 03:58:02 +00001467 // Otherwise, the DAG Combiner may have proven that the value coming in is
1468 // either already zero or is not demanded. Check for known zero input bits.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001469 APInt NeededMask = DesiredMask & ~ActualMask;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001470
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001471 APInt KnownZero, KnownOne;
Dan Gohmanea859be2007-06-22 14:59:07 +00001472 CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001473
Chris Lattner75548062006-10-11 03:58:02 +00001474 // If all the missing bits in the or are already known to be set, match!
1475 if ((NeededMask & KnownOne) == NeededMask)
1476 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001477
Chris Lattner75548062006-10-11 03:58:02 +00001478 // TODO: check to see if missing bits are just not demanded.
Daniel Dunbara279bc32009-09-20 02:20:51 +00001479
Chris Lattner75548062006-10-11 03:58:02 +00001480 // Otherwise, this pattern doesn't match.
1481 return false;
1482}
1483
Jim Laskey9ff542f2006-08-01 18:29:48 +00001484
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001485/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
1486/// by tblgen. Others should not call it.
1487void SelectionDAGISel::
Dan Gohmanf350b272008-08-23 02:25:05 +00001488SelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) {
Dan Gohman475871a2008-07-27 21:46:04 +00001489 std::vector<SDValue> InOps;
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001490 std::swap(InOps, Ops);
1491
Chris Lattnerdecc2672010-04-07 05:20:54 +00001492 Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0
1493 Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1
1494 Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc
Evan Chengc36b7062011-01-07 23:50:32 +00001495 Ops.push_back(InOps[InlineAsm::Op_ExtraInfo]); // 3 (SideEffect, AlignStack)
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001496
Chris Lattnerdecc2672010-04-07 05:20:54 +00001497 unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size();
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001498 if (InOps[e-1].getValueType() == MVT::Glue)
Chris Lattnera4359be2010-12-23 17:13:18 +00001499 --e; // Don't process a glue operand if it is here.
Daniel Dunbara279bc32009-09-20 02:20:51 +00001500
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001501 while (i != e) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00001502 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue();
Chris Lattnerdecc2672010-04-07 05:20:54 +00001503 if (!InlineAsm::isMemKind(Flags)) {
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001504 // Just skip over this operand, copying the operands verbatim.
Evan Cheng697cbbf2009-03-20 18:03:34 +00001505 Ops.insert(Ops.end(), InOps.begin()+i,
1506 InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1);
1507 i += InlineAsm::getNumOperandRegisters(Flags) + 1;
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001508 } else {
Evan Cheng697cbbf2009-03-20 18:03:34 +00001509 assert(InlineAsm::getNumOperandRegisters(Flags) == 1 &&
1510 "Memory operand with multiple values?");
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001511 // Otherwise, this is a memory operand. Ask the target to select it.
Dan Gohman475871a2008-07-27 21:46:04 +00001512 std::vector<SDValue> SelOps;
Chris Lattnerdecc2672010-04-07 05:20:54 +00001513 if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps))
Chris Lattner75361b62010-04-07 22:58:41 +00001514 report_fatal_error("Could not match memory address. Inline asm"
Chris Lattner87d677c2010-04-07 23:50:38 +00001515 " failure!");
Daniel Dunbara279bc32009-09-20 02:20:51 +00001516
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001517 // Add this to the output node.
Chris Lattnerdecc2672010-04-07 05:20:54 +00001518 unsigned NewFlags =
1519 InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size());
1520 Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32));
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001521 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
1522 i += 2;
1523 }
1524 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001525
Chris Lattnera4359be2010-12-23 17:13:18 +00001526 // Add the glue input back if present.
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001527 if (e != InOps.size())
1528 Ops.push_back(InOps.back());
1529}
Devang Patel794fd752007-05-01 21:15:47 +00001530
Chris Lattnera4359be2010-12-23 17:13:18 +00001531/// findGlueUse - Return use of MVT::Glue value produced by the specified
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001532/// SDNode.
1533///
Chris Lattnera4359be2010-12-23 17:13:18 +00001534static SDNode *findGlueUse(SDNode *N) {
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001535 unsigned FlagResNo = N->getNumValues()-1;
1536 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
1537 SDUse &Use = I.getUse();
1538 if (Use.getResNo() == FlagResNo)
1539 return Use.getUser();
1540 }
1541 return NULL;
1542}
1543
1544/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def".
1545/// This function recursively traverses up the operand chain, ignoring
1546/// certain nodes.
1547static bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse,
Chris Lattnerd1b73822010-03-02 22:20:06 +00001548 SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited,
1549 bool IgnoreChains) {
Chris Lattnerda244a02010-02-23 19:32:27 +00001550 // The NodeID's are given uniques ID's where a node ID is guaranteed to be
1551 // greater than all of its (recursive) operands. If we scan to a point where
1552 // 'use' is smaller than the node we're scanning for, then we know we will
1553 // never find it.
1554 //
1555 // The Use may be -1 (unassigned) if it is a newly allocated node. This can
Chris Lattnera4359be2010-12-23 17:13:18 +00001556 // happen because we scan down to newly selected nodes in the case of glue
Chris Lattnerda244a02010-02-23 19:32:27 +00001557 // uses.
1558 if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1))
1559 return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001560
Chris Lattnerda244a02010-02-23 19:32:27 +00001561 // Don't revisit nodes if we already scanned it and didn't fail, we know we
1562 // won't fail if we scan it again.
1563 if (!Visited.insert(Use))
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001564 return false;
1565
1566 for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {
Chris Lattnerd1b73822010-03-02 22:20:06 +00001567 // Ignore chain uses, they are validated by HandleMergeInputChains.
1568 if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains)
1569 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001570
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001571 SDNode *N = Use->getOperand(i).getNode();
1572 if (N == Def) {
1573 if (Use == ImmedUse || Use == Root)
1574 continue; // We are not looking for immediate use.
1575 assert(N != Root);
1576 return true;
1577 }
1578
1579 // Traverse up the operand chain.
Chris Lattnerd1b73822010-03-02 22:20:06 +00001580 if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001581 return true;
1582 }
1583 return false;
1584}
1585
Evan Cheng014bf212010-02-15 19:41:07 +00001586/// IsProfitableToFold - Returns true if it's profitable to fold the specific
1587/// operand node N of U during instruction selection that starts at Root.
1588bool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U,
1589 SDNode *Root) const {
1590 if (OptLevel == CodeGenOpt::None) return false;
1591 return N.hasOneUse();
1592}
1593
1594/// IsLegalToFold - Returns true if the specific operand node N of
1595/// U can be folded during instruction selection that starts at Root.
Chris Lattnerd1b73822010-03-02 22:20:06 +00001596bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
Dan Gohmand858e902010-04-17 15:26:15 +00001597 CodeGenOpt::Level OptLevel,
1598 bool IgnoreChains) {
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001599 if (OptLevel == CodeGenOpt::None) return false;
1600
1601 // If Root use can somehow reach N through a path that that doesn't contain
1602 // U then folding N would create a cycle. e.g. In the following
1603 // diagram, Root can reach N through X. If N is folded into into Root, then
1604 // X is both a predecessor and a successor of U.
1605 //
1606 // [N*] //
1607 // ^ ^ //
1608 // / \ //
1609 // [U*] [X]? //
1610 // ^ ^ //
1611 // \ / //
1612 // \ / //
1613 // [Root*] //
1614 //
1615 // * indicates nodes to be folded together.
1616 //
Chris Lattnera4359be2010-12-23 17:13:18 +00001617 // If Root produces glue, then it gets (even more) interesting. Since it
1618 // will be "glued" together with its glue use in the scheduler, we need to
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001619 // check if it might reach N.
1620 //
1621 // [N*] //
1622 // ^ ^ //
1623 // / \ //
1624 // [U*] [X]? //
1625 // ^ ^ //
1626 // \ \ //
1627 // \ | //
1628 // [Root*] | //
1629 // ^ | //
1630 // f | //
1631 // | / //
1632 // [Y] / //
1633 // ^ / //
1634 // f / //
1635 // | / //
Chris Lattnera4359be2010-12-23 17:13:18 +00001636 // [GU] //
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001637 //
Chris Lattnera4359be2010-12-23 17:13:18 +00001638 // If GU (glue use) indirectly reaches N (the load), and Root folds N
1639 // (call it Fold), then X is a predecessor of GU and a successor of
1640 // Fold. But since Fold and GU are glued together, this will create
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001641 // a cycle in the scheduling graph.
1642
Chris Lattnera4359be2010-12-23 17:13:18 +00001643 // If the node has glue, walk down the graph to the "lowest" node in the
1644 // glueged set.
Owen Andersone50ed302009-08-10 22:56:29 +00001645 EVT VT = Root->getValueType(Root->getNumValues()-1);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001646 while (VT == MVT::Glue) {
Chris Lattnera4359be2010-12-23 17:13:18 +00001647 SDNode *GU = findGlueUse(Root);
1648 if (GU == NULL)
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001649 break;
Chris Lattnera4359be2010-12-23 17:13:18 +00001650 Root = GU;
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001651 VT = Root->getValueType(Root->getNumValues()-1);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001652
Chris Lattnera4359be2010-12-23 17:13:18 +00001653 // If our query node has a glue result with a use, we've walked up it. If
Chris Lattner18fdaba2010-03-05 06:19:13 +00001654 // the user (which has already been selected) has a chain or indirectly uses
1655 // the chain, our WalkChainUsers predicate will not consider it. Because of
1656 // this, we cannot ignore chains in this predicate.
1657 IgnoreChains = false;
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001658 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001659
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001660
Chris Lattner9bbcd5e2010-03-05 05:49:45 +00001661 SmallPtrSet<SDNode*, 16> Visited;
1662 return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains);
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001663}
1664
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001665SDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) {
1666 std::vector<SDValue> Ops(N->op_begin(), N->op_end());
Dan Gohmane1f188f2009-10-29 22:30:23 +00001667 SelectInlineAsmMemoryOperands(Ops);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001668
Dan Gohmane1f188f2009-10-29 22:30:23 +00001669 std::vector<EVT> VTs;
1670 VTs.push_back(MVT::Other);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001671 VTs.push_back(MVT::Glue);
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001672 SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(),
Dan Gohmane1f188f2009-10-29 22:30:23 +00001673 VTs, &Ops[0], Ops.size());
Chris Lattnerd1b73822010-03-02 22:20:06 +00001674 New->setNodeId(-1);
Dan Gohmane1f188f2009-10-29 22:30:23 +00001675 return New.getNode();
1676}
1677
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001678SDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) {
Chris Lattner518bb532010-02-09 19:54:29 +00001679 return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0));
Dan Gohmane1f188f2009-10-29 22:30:23 +00001680}
1681
Chris Lattner2a49d572010-02-28 22:37:22 +00001682/// GetVBR - decode a vbr encoding whose top bit is set.
Chandler Carruth19e57022010-10-23 08:40:19 +00001683LLVM_ATTRIBUTE_ALWAYS_INLINE static uint64_t
Chris Lattner2a49d572010-02-28 22:37:22 +00001684GetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) {
1685 assert(Val >= 128 && "Not a VBR");
1686 Val &= 127; // Remove first vbr bit.
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001687
Chris Lattner2a49d572010-02-28 22:37:22 +00001688 unsigned Shift = 7;
1689 uint64_t NextBits;
1690 do {
Chris Lattner14df8dc2010-02-28 22:38:43 +00001691 NextBits = MatcherTable[Idx++];
Chris Lattner2a49d572010-02-28 22:37:22 +00001692 Val |= (NextBits&127) << Shift;
1693 Shift += 7;
1694 } while (NextBits & 128);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001695
Chris Lattner2a49d572010-02-28 22:37:22 +00001696 return Val;
1697}
1698
Chris Lattner2a49d572010-02-28 22:37:22 +00001699
Chris Lattnera4359be2010-12-23 17:13:18 +00001700/// UpdateChainsAndGlue - When a match is complete, this method updates uses of
1701/// interior glue and chain results to use the new glue and chain results.
Chris Lattner82dd3d32010-03-02 07:50:03 +00001702void SelectionDAGISel::
Chris Lattnera4359be2010-12-23 17:13:18 +00001703UpdateChainsAndGlue(SDNode *NodeToMatch, SDValue InputChain,
1704 const SmallVectorImpl<SDNode*> &ChainNodesMatched,
1705 SDValue InputGlue,
1706 const SmallVectorImpl<SDNode*> &GlueResultNodesMatched,
1707 bool isMorphNodeTo) {
Chris Lattner82dd3d32010-03-02 07:50:03 +00001708 SmallVector<SDNode*, 4> NowDeadNodes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001709
Chris Lattner82dd3d32010-03-02 07:50:03 +00001710 ISelUpdater ISU(ISelPosition);
1711
Chris Lattner2a49d572010-02-28 22:37:22 +00001712 // Now that all the normal results are replaced, we replace the chain and
Chris Lattnera4359be2010-12-23 17:13:18 +00001713 // glue results if present.
Chris Lattner2a49d572010-02-28 22:37:22 +00001714 if (!ChainNodesMatched.empty()) {
1715 assert(InputChain.getNode() != 0 &&
1716 "Matched input chains but didn't produce a chain");
1717 // Loop over all of the nodes we matched that produced a chain result.
1718 // Replace all the chain results with the final chain we ended up with.
1719 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1720 SDNode *ChainNode = ChainNodesMatched[i];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001721
Chris Lattner82dd3d32010-03-02 07:50:03 +00001722 // If this node was already deleted, don't look at it.
1723 if (ChainNode->getOpcode() == ISD::DELETED_NODE)
1724 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001725
Chris Lattner2a49d572010-02-28 22:37:22 +00001726 // Don't replace the results of the root node if we're doing a
1727 // MorphNodeTo.
1728 if (ChainNode == NodeToMatch && isMorphNodeTo)
1729 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001730
Chris Lattner2a49d572010-02-28 22:37:22 +00001731 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001732 if (ChainVal.getValueType() == MVT::Glue)
Chris Lattner2a49d572010-02-28 22:37:22 +00001733 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
1734 assert(ChainVal.getValueType() == MVT::Other && "Not a chain?");
Chris Lattner82dd3d32010-03-02 07:50:03 +00001735 CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001736
Chris Lattner856fb392010-03-28 05:28:31 +00001737 // If the node became dead and we haven't already seen it, delete it.
1738 if (ChainNode->use_empty() &&
1739 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode))
Chris Lattner82dd3d32010-03-02 07:50:03 +00001740 NowDeadNodes.push_back(ChainNode);
Chris Lattner2a49d572010-02-28 22:37:22 +00001741 }
1742 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001743
Chris Lattnera4359be2010-12-23 17:13:18 +00001744 // If the result produces glue, update any glue results in the matched
1745 // pattern with the glue result.
1746 if (InputGlue.getNode() != 0) {
Chris Lattner2a49d572010-02-28 22:37:22 +00001747 // Handle any interior nodes explicitly marked.
Chris Lattnera4359be2010-12-23 17:13:18 +00001748 for (unsigned i = 0, e = GlueResultNodesMatched.size(); i != e; ++i) {
1749 SDNode *FRN = GlueResultNodesMatched[i];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001750
Chris Lattner82dd3d32010-03-02 07:50:03 +00001751 // If this node was already deleted, don't look at it.
1752 if (FRN->getOpcode() == ISD::DELETED_NODE)
1753 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001754
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001755 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue &&
Chris Lattnera4359be2010-12-23 17:13:18 +00001756 "Doesn't have a glue result");
Chris Lattner2a49d572010-02-28 22:37:22 +00001757 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1),
Chris Lattnera4359be2010-12-23 17:13:18 +00001758 InputGlue, &ISU);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001759
Chris Lattner19e37cb2010-03-28 04:54:33 +00001760 // If the node became dead and we haven't already seen it, delete it.
1761 if (FRN->use_empty() &&
1762 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN))
Chris Lattner82dd3d32010-03-02 07:50:03 +00001763 NowDeadNodes.push_back(FRN);
Chris Lattner2a49d572010-02-28 22:37:22 +00001764 }
1765 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001766
Chris Lattner82dd3d32010-03-02 07:50:03 +00001767 if (!NowDeadNodes.empty())
1768 CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001769
Chris Lattner2a49d572010-02-28 22:37:22 +00001770 DEBUG(errs() << "ISEL: Match complete!\n");
1771}
1772
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001773enum ChainResult {
1774 CR_Simple,
1775 CR_InducesCycle,
1776 CR_LeadsToInteriorNode
1777};
1778
1779/// WalkChainUsers - Walk down the users of the specified chained node that is
1780/// part of the pattern we're matching, looking at all of the users we find.
1781/// This determines whether something is an interior node, whether we have a
1782/// non-pattern node in between two pattern nodes (which prevent folding because
1783/// it would induce a cycle) and whether we have a TokenFactor node sandwiched
1784/// between pattern nodes (in which case the TF becomes part of the pattern).
1785///
1786/// The walk we do here is guaranteed to be small because we quickly get down to
1787/// already selected nodes "below" us.
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001788static ChainResult
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001789WalkChainUsers(SDNode *ChainedNode,
1790 SmallVectorImpl<SDNode*> &ChainedNodesInPattern,
1791 SmallVectorImpl<SDNode*> &InteriorChainedNodes) {
1792 ChainResult Result = CR_Simple;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001793
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001794 for (SDNode::use_iterator UI = ChainedNode->use_begin(),
1795 E = ChainedNode->use_end(); UI != E; ++UI) {
1796 // Make sure the use is of the chain, not some other value we produce.
1797 if (UI.getUse().getValueType() != MVT::Other) continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001798
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001799 SDNode *User = *UI;
1800
1801 // If we see an already-selected machine node, then we've gone beyond the
1802 // pattern that we're selecting down into the already selected chunk of the
1803 // DAG.
1804 if (User->isMachineOpcode() ||
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001805 User->getOpcode() == ISD::HANDLENODE) // Root of the graph.
1806 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001807
Chris Lattnerd1b73822010-03-02 22:20:06 +00001808 if (User->getOpcode() == ISD::CopyToReg ||
1809 User->getOpcode() == ISD::CopyFromReg ||
Chris Lattner7561d482010-03-14 02:33:54 +00001810 User->getOpcode() == ISD::INLINEASM ||
1811 User->getOpcode() == ISD::EH_LABEL) {
Chris Lattnerd1b73822010-03-02 22:20:06 +00001812 // If their node ID got reset to -1 then they've already been selected.
1813 // Treat them like a MachineOpcode.
1814 if (User->getNodeId() == -1)
1815 continue;
1816 }
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001817
1818 // If we have a TokenFactor, we handle it specially.
1819 if (User->getOpcode() != ISD::TokenFactor) {
1820 // If the node isn't a token factor and isn't part of our pattern, then it
1821 // must be a random chained node in between two nodes we're selecting.
1822 // This happens when we have something like:
1823 // x = load ptr
1824 // call
1825 // y = x+4
1826 // store y -> ptr
1827 // Because we structurally match the load/store as a read/modify/write,
1828 // but the call is chained between them. We cannot fold in this case
1829 // because it would induce a cycle in the graph.
1830 if (!std::count(ChainedNodesInPattern.begin(),
1831 ChainedNodesInPattern.end(), User))
1832 return CR_InducesCycle;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001833
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001834 // Otherwise we found a node that is part of our pattern. For example in:
1835 // x = load ptr
1836 // y = x+4
1837 // store y -> ptr
1838 // This would happen when we're scanning down from the load and see the
1839 // store as a user. Record that there is a use of ChainedNode that is
1840 // part of the pattern and keep scanning uses.
1841 Result = CR_LeadsToInteriorNode;
1842 InteriorChainedNodes.push_back(User);
1843 continue;
1844 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001845
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001846 // If we found a TokenFactor, there are two cases to consider: first if the
1847 // TokenFactor is just hanging "below" the pattern we're matching (i.e. no
1848 // uses of the TF are in our pattern) we just want to ignore it. Second,
1849 // the TokenFactor can be sandwiched in between two chained nodes, like so:
1850 // [Load chain]
1851 // ^
1852 // |
1853 // [Load]
1854 // ^ ^
1855 // | \ DAG's like cheese
1856 // / \ do you?
1857 // / |
1858 // [TokenFactor] [Op]
1859 // ^ ^
1860 // | |
1861 // \ /
1862 // \ /
1863 // [Store]
1864 //
1865 // In this case, the TokenFactor becomes part of our match and we rewrite it
1866 // as a new TokenFactor.
1867 //
1868 // To distinguish these two cases, do a recursive walk down the uses.
1869 switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) {
1870 case CR_Simple:
1871 // If the uses of the TokenFactor are just already-selected nodes, ignore
1872 // it, it is "below" our pattern.
1873 continue;
1874 case CR_InducesCycle:
1875 // If the uses of the TokenFactor lead to nodes that are not part of our
1876 // pattern that are not selected, folding would turn this into a cycle,
1877 // bail out now.
1878 return CR_InducesCycle;
1879 case CR_LeadsToInteriorNode:
1880 break; // Otherwise, keep processing.
1881 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001882
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001883 // Okay, we know we're in the interesting interior case. The TokenFactor
1884 // is now going to be considered part of the pattern so that we rewrite its
1885 // uses (it may have uses that are not part of the pattern) with the
1886 // ultimate chain result of the generated code. We will also add its chain
1887 // inputs as inputs to the ultimate TokenFactor we create.
1888 Result = CR_LeadsToInteriorNode;
1889 ChainedNodesInPattern.push_back(User);
1890 InteriorChainedNodes.push_back(User);
1891 continue;
1892 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001893
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001894 return Result;
1895}
1896
Chris Lattner6b307922010-03-02 00:00:03 +00001897/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains
Chris Lattner00592ec2010-03-02 19:34:59 +00001898/// operation for when the pattern matched at least one node with a chains. The
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001899/// input vector contains a list of all of the chained nodes that we match. We
1900/// must determine if this is a valid thing to cover (i.e. matching it won't
1901/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will
1902/// be used as the input node chain for the generated nodes.
Chris Lattner6b307922010-03-02 00:00:03 +00001903static SDValue
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001904HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
Chris Lattner6b307922010-03-02 00:00:03 +00001905 SelectionDAG *CurDAG) {
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001906 // Walk all of the chained nodes we've matched, recursively scanning down the
1907 // users of the chain result. This adds any TokenFactor nodes that are caught
1908 // in between chained nodes to the chained and interior nodes list.
1909 SmallVector<SDNode*, 3> InteriorChainedNodes;
1910 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1911 if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
1912 InteriorChainedNodes) == CR_InducesCycle)
1913 return SDValue(); // Would induce a cycle.
1914 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001915
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001916 // Okay, we have walked all the matched nodes and collected TokenFactor nodes
1917 // that we are interested in. Form our input TokenFactor node.
Chris Lattner6b307922010-03-02 00:00:03 +00001918 SmallVector<SDValue, 3> InputChains;
1919 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001920 // Add the input chain of this node to the InputChains list (which will be
1921 // the operands of the generated TokenFactor) if it's not an interior node.
1922 SDNode *N = ChainNodesMatched[i];
1923 if (N->getOpcode() != ISD::TokenFactor) {
1924 if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N))
1925 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001926
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001927 // Otherwise, add the input chain.
1928 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
1929 assert(InChain.getValueType() == MVT::Other && "Not a chain");
Chris Lattner6b307922010-03-02 00:00:03 +00001930 InputChains.push_back(InChain);
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001931 continue;
1932 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001933
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001934 // If we have a token factor, we want to add all inputs of the token factor
1935 // that are not part of the pattern we're matching.
1936 for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) {
1937 if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
Chris Lattner6183fbd2010-03-02 02:37:23 +00001938 N->getOperand(op).getNode()))
1939 InputChains.push_back(N->getOperand(op));
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001940 }
Chris Lattner6b307922010-03-02 00:00:03 +00001941 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001942
Chris Lattner6b307922010-03-02 00:00:03 +00001943 SDValue Res;
1944 if (InputChains.size() == 1)
1945 return InputChains[0];
1946 return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(),
1947 MVT::Other, &InputChains[0], InputChains.size());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001948}
Chris Lattner2a49d572010-02-28 22:37:22 +00001949
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001950/// MorphNode - Handle morphing a node in place for the selector.
1951SDNode *SelectionDAGISel::
1952MorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList,
1953 const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) {
1954 // It is possible we're using MorphNodeTo to replace a node with no
1955 // normal results with one that has a normal result (or we could be
Chris Lattnera4359be2010-12-23 17:13:18 +00001956 // adding a chain) and the input could have glue and chains as well.
Chris Lattnercaa88702010-03-28 08:43:23 +00001957 // In this case we need to shift the operands down.
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001958 // FIXME: This is a horrible hack and broken in obscure cases, no worse
Chris Lattnera6f86932010-03-27 18:54:50 +00001959 // than the old isel though.
Chris Lattnera4359be2010-12-23 17:13:18 +00001960 int OldGlueResultNo = -1, OldChainResultNo = -1;
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001961
1962 unsigned NTMNumResults = Node->getNumValues();
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001963 if (Node->getValueType(NTMNumResults-1) == MVT::Glue) {
Chris Lattnera4359be2010-12-23 17:13:18 +00001964 OldGlueResultNo = NTMNumResults-1;
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001965 if (NTMNumResults != 1 &&
1966 Node->getValueType(NTMNumResults-2) == MVT::Other)
1967 OldChainResultNo = NTMNumResults-2;
1968 } else if (Node->getValueType(NTMNumResults-1) == MVT::Other)
1969 OldChainResultNo = NTMNumResults-1;
1970
Chris Lattner61c97f62010-03-02 07:14:49 +00001971 // Call the underlying SelectionDAG routine to do the transmogrification. Note
1972 // that this deletes operands of the old node that become dead.
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001973 SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps);
1974
1975 // MorphNodeTo can operate in two ways: if an existing node with the
1976 // specified operands exists, it can just return it. Otherwise, it
1977 // updates the node in place to have the requested operands.
1978 if (Res == Node) {
1979 // If we updated the node in place, reset the node ID. To the isel,
1980 // this should be just like a newly allocated machine node.
1981 Res->setNodeId(-1);
1982 }
1983
1984 unsigned ResNumResults = Res->getNumValues();
Chris Lattnera4359be2010-12-23 17:13:18 +00001985 // Move the glue if needed.
1986 if ((EmitNodeInfo & OPFL_GlueOutput) && OldGlueResultNo != -1 &&
1987 (unsigned)OldGlueResultNo != ResNumResults-1)
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001988 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldGlueResultNo),
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001989 SDValue(Res, ResNumResults-1));
1990
Chris Lattnera4359be2010-12-23 17:13:18 +00001991 if ((EmitNodeInfo & OPFL_GlueOutput) != 0)
Bill Wendlingd9cb7ca2010-07-04 08:58:43 +00001992 --ResNumResults;
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001993
1994 // Move the chain reference if needed.
1995 if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 &&
1996 (unsigned)OldChainResultNo != ResNumResults-1)
Andrew Trick6e8f4c42010-12-24 04:28:06 +00001997 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo),
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001998 SDValue(Res, ResNumResults-1));
1999
2000 // Otherwise, no replacement happened because the node already exists. Replace
2001 // Uses of the old node with the new one.
2002 if (Res != Node)
2003 CurDAG->ReplaceAllUsesWith(Node, Res);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002004
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00002005 return Res;
2006}
2007
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002008/// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
Chandler Carruth19e57022010-10-23 08:40:19 +00002009LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00002010CheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex,
Chris Lattnerd847bc22010-09-21 22:00:25 +00002011 SDValue N,
2012 const SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
Chris Lattnerda828e32010-03-03 07:46:25 +00002013 // Accept if it is exactly the same as a previously recorded node.
2014 unsigned RecNo = MatcherTable[MatcherIndex++];
2015 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002016 return N == RecordedNodes[RecNo].first;
Chris Lattnerda828e32010-03-03 07:46:25 +00002017}
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002018
Chris Lattnerda828e32010-03-03 07:46:25 +00002019/// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
Chandler Carruth19e57022010-10-23 08:40:19 +00002020LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002021CheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2022 SelectionDAGISel &SDISel) {
2023 return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]);
2024}
2025
2026/// CheckNodePredicate - Implements OP_CheckNodePredicate.
Chandler Carruth19e57022010-10-23 08:40:19 +00002027LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002028CheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2029 SelectionDAGISel &SDISel, SDNode *N) {
2030 return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]);
2031}
2032
Chandler Carruth19e57022010-10-23 08:40:19 +00002033LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002034CheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2035 SDNode *N) {
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002036 uint16_t Opc = MatcherTable[MatcherIndex++];
2037 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2038 return N->getOpcode() == Opc;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002039}
2040
Chandler Carruth19e57022010-10-23 08:40:19 +00002041LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002042CheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2043 SDValue N, const TargetLowering &TLI) {
2044 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2045 if (N.getValueType() == VT) return true;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002046
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002047 // Handle the case when VT is iPTR.
2048 return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy();
2049}
2050
Chandler Carruth19e57022010-10-23 08:40:19 +00002051LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00002052CheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2053 SDValue N, const TargetLowering &TLI,
2054 unsigned ChildNo) {
2055 if (ChildNo >= N.getNumOperands())
2056 return false; // Match fails if out of range child #.
2057 return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI);
2058}
2059
2060
Chandler Carruth19e57022010-10-23 08:40:19 +00002061LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00002062CheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2063 SDValue N) {
2064 return cast<CondCodeSDNode>(N)->get() ==
2065 (ISD::CondCode)MatcherTable[MatcherIndex++];
2066}
2067
Chandler Carruth19e57022010-10-23 08:40:19 +00002068LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00002069CheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2070 SDValue N, const TargetLowering &TLI) {
2071 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2072 if (cast<VTSDNode>(N)->getVT() == VT)
2073 return true;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002074
Chris Lattnerda828e32010-03-03 07:46:25 +00002075 // Handle the case when VT is iPTR.
2076 return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy();
2077}
2078
Chandler Carruth19e57022010-10-23 08:40:19 +00002079LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002080CheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2081 SDValue N) {
2082 int64_t Val = MatcherTable[MatcherIndex++];
2083 if (Val & 128)
2084 Val = GetVBR(Val, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002085
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002086 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N);
2087 return C != 0 && C->getSExtValue() == Val;
2088}
2089
Chandler Carruth19e57022010-10-23 08:40:19 +00002090LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00002091CheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2092 SDValue N, SelectionDAGISel &SDISel) {
2093 int64_t Val = MatcherTable[MatcherIndex++];
2094 if (Val & 128)
2095 Val = GetVBR(Val, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002096
Chris Lattnerda828e32010-03-03 07:46:25 +00002097 if (N->getOpcode() != ISD::AND) return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002098
Chris Lattnerda828e32010-03-03 07:46:25 +00002099 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
2100 return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val);
2101}
2102
Chandler Carruth19e57022010-10-23 08:40:19 +00002103LLVM_ATTRIBUTE_ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00002104CheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
2105 SDValue N, SelectionDAGISel &SDISel) {
2106 int64_t Val = MatcherTable[MatcherIndex++];
2107 if (Val & 128)
2108 Val = GetVBR(Val, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002109
Chris Lattnerda828e32010-03-03 07:46:25 +00002110 if (N->getOpcode() != ISD::OR) return false;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002111
Chris Lattnerda828e32010-03-03 07:46:25 +00002112 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
2113 return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val);
2114}
2115
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002116/// IsPredicateKnownToFail - If we know how and can do so without pushing a
2117/// scope, evaluate the current node. If the current predicate is known to
2118/// fail, set Result=true and return anything. If the current predicate is
2119/// known to pass, set Result=false and return the MatcherIndex to continue
2120/// with. If the current predicate is unknown, set Result=false and return the
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002121/// MatcherIndex to continue with.
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002122static unsigned IsPredicateKnownToFail(const unsigned char *Table,
2123 unsigned Index, SDValue N,
Chris Lattnerda828e32010-03-03 07:46:25 +00002124 bool &Result, SelectionDAGISel &SDISel,
Chris Lattnerd847bc22010-09-21 22:00:25 +00002125 SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) {
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002126 switch (Table[Index++]) {
2127 default:
2128 Result = false;
2129 return Index-1; // Could not evaluate this predicate.
Chris Lattnerda828e32010-03-03 07:46:25 +00002130 case SelectionDAGISel::OPC_CheckSame:
2131 Result = !::CheckSame(Table, Index, N, RecordedNodes);
2132 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002133 case SelectionDAGISel::OPC_CheckPatternPredicate:
Chris Lattnerda828e32010-03-03 07:46:25 +00002134 Result = !::CheckPatternPredicate(Table, Index, SDISel);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002135 return Index;
2136 case SelectionDAGISel::OPC_CheckPredicate:
Chris Lattnerda828e32010-03-03 07:46:25 +00002137 Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode());
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002138 return Index;
2139 case SelectionDAGISel::OPC_CheckOpcode:
2140 Result = !::CheckOpcode(Table, Index, N.getNode());
2141 return Index;
2142 case SelectionDAGISel::OPC_CheckType:
2143 Result = !::CheckType(Table, Index, N, SDISel.TLI);
2144 return Index;
2145 case SelectionDAGISel::OPC_CheckChild0Type:
2146 case SelectionDAGISel::OPC_CheckChild1Type:
2147 case SelectionDAGISel::OPC_CheckChild2Type:
2148 case SelectionDAGISel::OPC_CheckChild3Type:
2149 case SelectionDAGISel::OPC_CheckChild4Type:
2150 case SelectionDAGISel::OPC_CheckChild5Type:
2151 case SelectionDAGISel::OPC_CheckChild6Type:
Chris Lattnerda828e32010-03-03 07:46:25 +00002152 case SelectionDAGISel::OPC_CheckChild7Type:
2153 Result = !::CheckChildType(Table, Index, N, SDISel.TLI,
2154 Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002155 return Index;
Chris Lattnerda828e32010-03-03 07:46:25 +00002156 case SelectionDAGISel::OPC_CheckCondCode:
2157 Result = !::CheckCondCode(Table, Index, N);
2158 return Index;
2159 case SelectionDAGISel::OPC_CheckValueType:
2160 Result = !::CheckValueType(Table, Index, N, SDISel.TLI);
2161 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002162 case SelectionDAGISel::OPC_CheckInteger:
2163 Result = !::CheckInteger(Table, Index, N);
2164 return Index;
Chris Lattnerda828e32010-03-03 07:46:25 +00002165 case SelectionDAGISel::OPC_CheckAndImm:
2166 Result = !::CheckAndImm(Table, Index, N, SDISel);
2167 return Index;
2168 case SelectionDAGISel::OPC_CheckOrImm:
2169 Result = !::CheckOrImm(Table, Index, N, SDISel);
2170 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002171 }
2172}
2173
Dan Gohmanb3579832010-04-15 17:08:50 +00002174namespace {
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00002175
Chris Lattner2a49d572010-02-28 22:37:22 +00002176struct MatchScope {
2177 /// FailIndex - If this match fails, this is the index to continue with.
2178 unsigned FailIndex;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002179
Chris Lattner2a49d572010-02-28 22:37:22 +00002180 /// NodeStack - The node stack when the scope was formed.
2181 SmallVector<SDValue, 4> NodeStack;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002182
Chris Lattner2a49d572010-02-28 22:37:22 +00002183 /// NumRecordedNodes - The number of recorded nodes when the scope was formed.
2184 unsigned NumRecordedNodes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002185
Chris Lattner2a49d572010-02-28 22:37:22 +00002186 /// NumMatchedMemRefs - The number of matched memref entries.
2187 unsigned NumMatchedMemRefs;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002188
2189 /// InputChain/InputGlue - The current chain/glue
Chris Lattnera4359be2010-12-23 17:13:18 +00002190 SDValue InputChain, InputGlue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002191
2192 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
Chris Lattnera4359be2010-12-23 17:13:18 +00002193 bool HasChainNodesMatched, HasGlueResultNodesMatched;
Chris Lattner2a49d572010-02-28 22:37:22 +00002194};
2195
Dan Gohmanb3579832010-04-15 17:08:50 +00002196}
2197
Chris Lattner2a49d572010-02-28 22:37:22 +00002198SDNode *SelectionDAGISel::
2199SelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable,
2200 unsigned TableSize) {
2201 // FIXME: Should these even be selected? Handle these cases in the caller?
2202 switch (NodeToMatch->getOpcode()) {
2203 default:
2204 break;
2205 case ISD::EntryToken: // These nodes remain the same.
2206 case ISD::BasicBlock:
2207 case ISD::Register:
Chris Lattner3b9d6212010-03-14 17:53:23 +00002208 //case ISD::VALUETYPE:
2209 //case ISD::CONDCODE:
Chris Lattner2a49d572010-02-28 22:37:22 +00002210 case ISD::HANDLENODE:
Chris Lattnerdecc2672010-04-07 05:20:54 +00002211 case ISD::MDNODE_SDNODE:
Chris Lattner2a49d572010-02-28 22:37:22 +00002212 case ISD::TargetConstant:
2213 case ISD::TargetConstantFP:
2214 case ISD::TargetConstantPool:
2215 case ISD::TargetFrameIndex:
2216 case ISD::TargetExternalSymbol:
2217 case ISD::TargetBlockAddress:
2218 case ISD::TargetJumpTable:
2219 case ISD::TargetGlobalTLSAddress:
2220 case ISD::TargetGlobalAddress:
2221 case ISD::TokenFactor:
2222 case ISD::CopyFromReg:
2223 case ISD::CopyToReg:
Chris Lattner7561d482010-03-14 02:33:54 +00002224 case ISD::EH_LABEL:
Chris Lattnerd1b73822010-03-02 22:20:06 +00002225 NodeToMatch->setNodeId(-1); // Mark selected.
Chris Lattner2a49d572010-02-28 22:37:22 +00002226 return 0;
2227 case ISD::AssertSext:
2228 case ISD::AssertZext:
2229 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0),
2230 NodeToMatch->getOperand(0));
2231 return 0;
2232 case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch);
Chris Lattner2a49d572010-02-28 22:37:22 +00002233 case ISD::UNDEF: return Select_UNDEF(NodeToMatch);
2234 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002235
Chris Lattner2a49d572010-02-28 22:37:22 +00002236 assert(!NodeToMatch->isMachineOpcode() && "Node already selected!");
2237
2238 // Set up the node stack with NodeToMatch as the only node on the stack.
2239 SmallVector<SDValue, 8> NodeStack;
2240 SDValue N = SDValue(NodeToMatch, 0);
2241 NodeStack.push_back(N);
2242
2243 // MatchScopes - Scopes used when matching, if a match failure happens, this
2244 // indicates where to continue checking.
2245 SmallVector<MatchScope, 8> MatchScopes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002246
Chris Lattner2a49d572010-02-28 22:37:22 +00002247 // RecordedNodes - This is the set of nodes that have been recorded by the
Chris Lattnerd847bc22010-09-21 22:00:25 +00002248 // state machine. The second value is the parent of the node, or null if the
2249 // root is recorded.
2250 SmallVector<std::pair<SDValue, SDNode*>, 8> RecordedNodes;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002251
Chris Lattner2a49d572010-02-28 22:37:22 +00002252 // MatchedMemRefs - This is the set of MemRef's we've seen in the input
2253 // pattern.
2254 SmallVector<MachineMemOperand*, 2> MatchedMemRefs;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002255
Chris Lattnera4359be2010-12-23 17:13:18 +00002256 // These are the current input chain and glue for use when generating nodes.
Chris Lattner2a49d572010-02-28 22:37:22 +00002257 // Various Emit operations change these. For example, emitting a copytoreg
2258 // uses and updates these.
Chris Lattnera4359be2010-12-23 17:13:18 +00002259 SDValue InputChain, InputGlue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002260
Chris Lattner2a49d572010-02-28 22:37:22 +00002261 // ChainNodesMatched - If a pattern matches nodes that have input/output
2262 // chains, the OPC_EmitMergeInputChains operation is emitted which indicates
2263 // which ones they are. The result is captured into this list so that we can
2264 // update the chain results when the pattern is complete.
2265 SmallVector<SDNode*, 3> ChainNodesMatched;
Chris Lattnera4359be2010-12-23 17:13:18 +00002266 SmallVector<SDNode*, 3> GlueResultNodesMatched;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002267
Chris Lattner2a49d572010-02-28 22:37:22 +00002268 DEBUG(errs() << "ISEL: Starting pattern match on root node: ";
2269 NodeToMatch->dump(CurDAG);
2270 errs() << '\n');
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002271
Chris Lattner7390eeb2010-03-01 18:47:11 +00002272 // Determine where to start the interpreter. Normally we start at opcode #0,
2273 // but if the state machine starts with an OPC_SwitchOpcode, then we
2274 // accelerate the first lookup (which is guaranteed to be hot) with the
2275 // OpcodeOffset table.
Chris Lattner2a49d572010-02-28 22:37:22 +00002276 unsigned MatcherIndex = 0;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002277
Chris Lattner7390eeb2010-03-01 18:47:11 +00002278 if (!OpcodeOffset.empty()) {
2279 // Already computed the OpcodeOffset table, just index into it.
2280 if (N.getOpcode() < OpcodeOffset.size())
2281 MatcherIndex = OpcodeOffset[N.getOpcode()];
2282 DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n");
2283
2284 } else if (MatcherTable[0] == OPC_SwitchOpcode) {
2285 // Otherwise, the table isn't computed, but the state machine does start
2286 // with an OPC_SwitchOpcode instruction. Populate the table now, since this
2287 // is the first time we're selecting an instruction.
2288 unsigned Idx = 1;
2289 while (1) {
2290 // Get the size of this case.
2291 unsigned CaseSize = MatcherTable[Idx++];
2292 if (CaseSize & 128)
2293 CaseSize = GetVBR(CaseSize, MatcherTable, Idx);
2294 if (CaseSize == 0) break;
2295
2296 // Get the opcode, add the index to the table.
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002297 uint16_t Opc = MatcherTable[Idx++];
2298 Opc |= (unsigned short)MatcherTable[Idx++] << 8;
Chris Lattner7390eeb2010-03-01 18:47:11 +00002299 if (Opc >= OpcodeOffset.size())
2300 OpcodeOffset.resize((Opc+1)*2);
2301 OpcodeOffset[Opc] = Idx;
2302 Idx += CaseSize;
2303 }
2304
2305 // Okay, do the lookup for the first opcode.
2306 if (N.getOpcode() < OpcodeOffset.size())
2307 MatcherIndex = OpcodeOffset[N.getOpcode()];
2308 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002309
Chris Lattner2a49d572010-02-28 22:37:22 +00002310 while (1) {
2311 assert(MatcherIndex < TableSize && "Invalid index");
Dan Gohman19b38262010-03-09 02:15:05 +00002312#ifndef NDEBUG
2313 unsigned CurrentOpcodeIndex = MatcherIndex;
2314#endif
Chris Lattner2a49d572010-02-28 22:37:22 +00002315 BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++];
2316 switch (Opcode) {
2317 case OPC_Scope: {
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002318 // Okay, the semantics of this operation are that we should push a scope
2319 // then evaluate the first child. However, pushing a scope only to have
2320 // the first check fail (which then pops it) is inefficient. If we can
2321 // determine immediately that the first check (or first several) will
2322 // immediately fail, don't even bother pushing a scope for them.
2323 unsigned FailIndex;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002324
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002325 while (1) {
2326 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2327 if (NumToSkip & 128)
2328 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2329 // Found the end of the scope with no match.
2330 if (NumToSkip == 0) {
2331 FailIndex = 0;
2332 break;
2333 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002334
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002335 FailIndex = MatcherIndex+NumToSkip;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002336
Chris Lattnera6f86932010-03-27 18:54:50 +00002337 unsigned MatcherIndexOfPredicate = MatcherIndex;
2338 (void)MatcherIndexOfPredicate; // silence warning.
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002339
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002340 // If we can't evaluate this predicate without pushing a scope (e.g. if
2341 // it is a 'MoveParent') or if the predicate succeeds on this node, we
2342 // push the scope and evaluate the full predicate chain.
2343 bool Result;
2344 MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N,
Chris Lattnerda828e32010-03-03 07:46:25 +00002345 Result, *this, RecordedNodes);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002346 if (!Result)
2347 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002348
Chris Lattnera6f86932010-03-27 18:54:50 +00002349 DEBUG(errs() << " Skipped scope entry (due to false predicate) at "
2350 << "index " << MatcherIndexOfPredicate
2351 << ", continuing at " << FailIndex << "\n");
Chris Lattnerbed993d2010-03-28 19:46:56 +00002352 ++NumDAGIselRetries;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002353
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002354 // Otherwise, we know that this case of the Scope is guaranteed to fail,
2355 // move to the next case.
2356 MatcherIndex = FailIndex;
2357 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002358
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002359 // If the whole scope failed to match, bail.
2360 if (FailIndex == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002361
Chris Lattner2a49d572010-02-28 22:37:22 +00002362 // Push a MatchScope which indicates where to go if the first child fails
2363 // to match.
2364 MatchScope NewEntry;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002365 NewEntry.FailIndex = FailIndex;
Chris Lattner2a49d572010-02-28 22:37:22 +00002366 NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());
2367 NewEntry.NumRecordedNodes = RecordedNodes.size();
2368 NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
2369 NewEntry.InputChain = InputChain;
Chris Lattnera4359be2010-12-23 17:13:18 +00002370 NewEntry.InputGlue = InputGlue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002371 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
Chris Lattnera4359be2010-12-23 17:13:18 +00002372 NewEntry.HasGlueResultNodesMatched = !GlueResultNodesMatched.empty();
Chris Lattner2a49d572010-02-28 22:37:22 +00002373 MatchScopes.push_back(NewEntry);
2374 continue;
2375 }
Chris Lattnerd847bc22010-09-21 22:00:25 +00002376 case OPC_RecordNode: {
Chris Lattner2a49d572010-02-28 22:37:22 +00002377 // Remember this node, it may end up being an operand in the pattern.
Chris Lattnerd847bc22010-09-21 22:00:25 +00002378 SDNode *Parent = 0;
2379 if (NodeStack.size() > 1)
2380 Parent = NodeStack[NodeStack.size()-2].getNode();
2381 RecordedNodes.push_back(std::make_pair(N, Parent));
Chris Lattner2a49d572010-02-28 22:37:22 +00002382 continue;
Chris Lattnerd847bc22010-09-21 22:00:25 +00002383 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002384
Chris Lattner2a49d572010-02-28 22:37:22 +00002385 case OPC_RecordChild0: case OPC_RecordChild1:
2386 case OPC_RecordChild2: case OPC_RecordChild3:
2387 case OPC_RecordChild4: case OPC_RecordChild5:
2388 case OPC_RecordChild6: case OPC_RecordChild7: {
2389 unsigned ChildNo = Opcode-OPC_RecordChild0;
2390 if (ChildNo >= N.getNumOperands())
2391 break; // Match fails if out of range child #.
2392
Chris Lattnerd847bc22010-09-21 22:00:25 +00002393 RecordedNodes.push_back(std::make_pair(N->getOperand(ChildNo),
2394 N.getNode()));
Chris Lattner2a49d572010-02-28 22:37:22 +00002395 continue;
2396 }
2397 case OPC_RecordMemRef:
2398 MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand());
2399 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002400
Chris Lattner29d8f0c2010-12-23 17:24:32 +00002401 case OPC_CaptureGlueInput:
Chris Lattnera4359be2010-12-23 17:13:18 +00002402 // If the current node has an input glue, capture it in InputGlue.
Chris Lattner2a49d572010-02-28 22:37:22 +00002403 if (N->getNumOperands() != 0 &&
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002404 N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Glue)
Chris Lattnera4359be2010-12-23 17:13:18 +00002405 InputGlue = N->getOperand(N->getNumOperands()-1);
Chris Lattner2a49d572010-02-28 22:37:22 +00002406 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002407
Chris Lattner2a49d572010-02-28 22:37:22 +00002408 case OPC_MoveChild: {
2409 unsigned ChildNo = MatcherTable[MatcherIndex++];
2410 if (ChildNo >= N.getNumOperands())
2411 break; // Match fails if out of range child #.
2412 N = N.getOperand(ChildNo);
2413 NodeStack.push_back(N);
2414 continue;
2415 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002416
Chris Lattner2a49d572010-02-28 22:37:22 +00002417 case OPC_MoveParent:
2418 // Pop the current node off the NodeStack.
2419 NodeStack.pop_back();
2420 assert(!NodeStack.empty() && "Node stack imbalance!");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002421 N = NodeStack.back();
Chris Lattner2a49d572010-02-28 22:37:22 +00002422 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002423
Chris Lattnerda828e32010-03-03 07:46:25 +00002424 case OPC_CheckSame:
2425 if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002426 continue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002427 case OPC_CheckPatternPredicate:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002428 if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002429 continue;
2430 case OPC_CheckPredicate:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002431 if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this,
2432 N.getNode()))
2433 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002434 continue;
Chris Lattner57bf8a42010-03-04 01:23:08 +00002435 case OPC_CheckComplexPat: {
2436 unsigned CPNum = MatcherTable[MatcherIndex++];
2437 unsigned RecNo = MatcherTable[MatcherIndex++];
2438 assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002439 if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo].second,
2440 RecordedNodes[RecNo].first, CPNum,
Chris Lattner57bf8a42010-03-04 01:23:08 +00002441 RecordedNodes))
Chris Lattner2a49d572010-02-28 22:37:22 +00002442 break;
2443 continue;
Chris Lattner57bf8a42010-03-04 01:23:08 +00002444 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002445 case OPC_CheckOpcode:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002446 if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break;
2447 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002448
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002449 case OPC_CheckType:
2450 if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002451 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002452
Chris Lattnereb669212010-03-01 06:59:22 +00002453 case OPC_SwitchOpcode: {
2454 unsigned CurNodeOpcode = N.getOpcode();
Chris Lattner7d892d62010-03-01 07:43:08 +00002455 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
Chris Lattnereb669212010-03-01 06:59:22 +00002456 unsigned CaseSize;
2457 while (1) {
2458 // Get the size of this case.
2459 CaseSize = MatcherTable[MatcherIndex++];
2460 if (CaseSize & 128)
2461 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2462 if (CaseSize == 0) break;
2463
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002464 uint16_t Opc = MatcherTable[MatcherIndex++];
2465 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2466
Chris Lattnereb669212010-03-01 06:59:22 +00002467 // If the opcode matches, then we will execute this case.
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002468 if (CurNodeOpcode == Opc)
Chris Lattnereb669212010-03-01 06:59:22 +00002469 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002470
Chris Lattnereb669212010-03-01 06:59:22 +00002471 // Otherwise, skip over this case.
2472 MatcherIndex += CaseSize;
2473 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002474
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002475 // If no cases matched, bail out.
Chris Lattnereb669212010-03-01 06:59:22 +00002476 if (CaseSize == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002477
Chris Lattnereb669212010-03-01 06:59:22 +00002478 // Otherwise, execute the case we found.
2479 DEBUG(errs() << " OpcodeSwitch from " << SwitchStart
2480 << " to " << MatcherIndex << "\n");
2481 continue;
2482 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002483
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002484 case OPC_SwitchType: {
Duncan Sandscdfad362010-11-03 12:17:33 +00002485 MVT CurNodeVT = N.getValueType().getSimpleVT();
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002486 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2487 unsigned CaseSize;
2488 while (1) {
2489 // Get the size of this case.
2490 CaseSize = MatcherTable[MatcherIndex++];
2491 if (CaseSize & 128)
2492 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2493 if (CaseSize == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002494
Duncan Sandscdfad362010-11-03 12:17:33 +00002495 MVT CaseVT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002496 if (CaseVT == MVT::iPTR)
Duncan Sandscdfad362010-11-03 12:17:33 +00002497 CaseVT = TLI.getPointerTy();
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002498
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002499 // If the VT matches, then we will execute this case.
2500 if (CurNodeVT == CaseVT)
2501 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002502
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002503 // Otherwise, skip over this case.
2504 MatcherIndex += CaseSize;
2505 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002506
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002507 // If no cases matched, bail out.
2508 if (CaseSize == 0) break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002509
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002510 // Otherwise, execute the case we found.
2511 DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString()
2512 << "] from " << SwitchStart << " to " << MatcherIndex<<'\n');
2513 continue;
2514 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002515 case OPC_CheckChild0Type: case OPC_CheckChild1Type:
2516 case OPC_CheckChild2Type: case OPC_CheckChild3Type:
2517 case OPC_CheckChild4Type: case OPC_CheckChild5Type:
Chris Lattnerda828e32010-03-03 07:46:25 +00002518 case OPC_CheckChild6Type: case OPC_CheckChild7Type:
2519 if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI,
2520 Opcode-OPC_CheckChild0Type))
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002521 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002522 continue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002523 case OPC_CheckCondCode:
Chris Lattnerda828e32010-03-03 07:46:25 +00002524 if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002525 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002526 case OPC_CheckValueType:
2527 if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002528 continue;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002529 case OPC_CheckInteger:
2530 if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002531 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002532 case OPC_CheckAndImm:
2533 if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002534 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002535 case OPC_CheckOrImm:
2536 if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002537 continue;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002538
Chris Lattner2a49d572010-02-28 22:37:22 +00002539 case OPC_CheckFoldableChainNode: {
2540 assert(NodeStack.size() != 1 && "No parent node");
2541 // Verify that all intermediate nodes between the root and this one have
2542 // a single use.
2543 bool HasMultipleUses = false;
2544 for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)
2545 if (!NodeStack[i].hasOneUse()) {
2546 HasMultipleUses = true;
2547 break;
2548 }
2549 if (HasMultipleUses) break;
2550
2551 // Check to see that the target thinks this is profitable to fold and that
2552 // we can fold it without inducing cycles in the graph.
2553 if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2554 NodeToMatch) ||
2555 !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
Dan Gohmand858e902010-04-17 15:26:15 +00002556 NodeToMatch, OptLevel,
2557 true/*We validate our own chains*/))
Chris Lattner2a49d572010-02-28 22:37:22 +00002558 break;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002559
Chris Lattner2a49d572010-02-28 22:37:22 +00002560 continue;
2561 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002562 case OPC_EmitInteger: {
2563 MVT::SimpleValueType VT =
2564 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2565 int64_t Val = MatcherTable[MatcherIndex++];
2566 if (Val & 128)
2567 Val = GetVBR(Val, MatcherTable, MatcherIndex);
Chris Lattnerd847bc22010-09-21 22:00:25 +00002568 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002569 CurDAG->getTargetConstant(Val, VT), (SDNode*)0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002570 continue;
2571 }
2572 case OPC_EmitRegister: {
2573 MVT::SimpleValueType VT =
2574 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2575 unsigned RegNo = MatcherTable[MatcherIndex++];
Chris Lattnerd847bc22010-09-21 22:00:25 +00002576 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002577 CurDAG->getRegister(RegNo, VT), (SDNode*)0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002578 continue;
2579 }
Jim Grosbach2d76c842011-03-01 01:37:19 +00002580 case OPC_EmitRegister2: {
2581 // For targets w/ more than 256 register names, the register enum
2582 // values are stored in two bytes in the matcher table (just like
2583 // opcodes).
2584 MVT::SimpleValueType VT =
2585 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2586 unsigned RegNo = MatcherTable[MatcherIndex++];
2587 RegNo |= MatcherTable[MatcherIndex++] << 8;
2588 RecordedNodes.push_back(std::pair<SDValue, SDNode*>(
2589 CurDAG->getRegister(RegNo, VT), (SDNode*)0));
2590 continue;
2591 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002592
Chris Lattner2a49d572010-02-28 22:37:22 +00002593 case OPC_EmitConvertToTarget: {
2594 // Convert from IMM/FPIMM to target version.
2595 unsigned RecNo = MatcherTable[MatcherIndex++];
2596 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002597 SDValue Imm = RecordedNodes[RecNo].first;
Chris Lattner2a49d572010-02-28 22:37:22 +00002598
2599 if (Imm->getOpcode() == ISD::Constant) {
2600 int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue();
2601 Imm = CurDAG->getTargetConstant(Val, Imm.getValueType());
2602 } else if (Imm->getOpcode() == ISD::ConstantFP) {
2603 const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue();
2604 Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType());
2605 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002606
Chris Lattnerd847bc22010-09-21 22:00:25 +00002607 RecordedNodes.push_back(std::make_pair(Imm, RecordedNodes[RecNo].second));
Chris Lattner2a49d572010-02-28 22:37:22 +00002608 continue;
2609 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002610
Chris Lattneraa4e3392010-03-28 05:50:16 +00002611 case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0
2612 case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1
2613 // These are space-optimized forms of OPC_EmitMergeInputChains.
2614 assert(InputChain.getNode() == 0 &&
2615 "EmitMergeInputChains should be the first chain producing node");
2616 assert(ChainNodesMatched.empty() &&
2617 "Should only have one EmitMergeInputChains per match");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002618
Chris Lattneraa4e3392010-03-28 05:50:16 +00002619 // Read all of the chained nodes.
2620 unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1;
2621 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002622 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002623
Chris Lattneraa4e3392010-03-28 05:50:16 +00002624 // FIXME: What if other value results of the node have uses not matched
2625 // by this pattern?
2626 if (ChainNodesMatched.back() != NodeToMatch &&
Chris Lattnerd847bc22010-09-21 22:00:25 +00002627 !RecordedNodes[RecNo].first.hasOneUse()) {
Chris Lattneraa4e3392010-03-28 05:50:16 +00002628 ChainNodesMatched.clear();
2629 break;
2630 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002631
Chris Lattneraa4e3392010-03-28 05:50:16 +00002632 // Merge the input chains if they are not intra-pattern references.
2633 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002634
Chris Lattneraa4e3392010-03-28 05:50:16 +00002635 if (InputChain.getNode() == 0)
2636 break; // Failed to merge.
2637 continue;
2638 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002639
Chris Lattner2a49d572010-02-28 22:37:22 +00002640 case OPC_EmitMergeInputChains: {
2641 assert(InputChain.getNode() == 0 &&
2642 "EmitMergeInputChains should be the first chain producing node");
2643 // This node gets a list of nodes we matched in the input that have
2644 // chains. We want to token factor all of the input chains to these nodes
2645 // together. However, if any of the input chains is actually one of the
2646 // nodes matched in this pattern, then we have an intra-match reference.
2647 // Ignore these because the newly token factored chain should not refer to
2648 // the old nodes.
2649 unsigned NumChains = MatcherTable[MatcherIndex++];
2650 assert(NumChains != 0 && "Can't TF zero chains");
2651
2652 assert(ChainNodesMatched.empty() &&
2653 "Should only have one EmitMergeInputChains per match");
2654
Chris Lattner2a49d572010-02-28 22:37:22 +00002655 // Read all of the chained nodes.
Chris Lattner00592ec2010-03-02 19:34:59 +00002656 for (unsigned i = 0; i != NumChains; ++i) {
2657 unsigned RecNo = MatcherTable[MatcherIndex++];
Chris Lattner2a49d572010-02-28 22:37:22 +00002658 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002659 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002660
Chris Lattner2a49d572010-02-28 22:37:22 +00002661 // FIXME: What if other value results of the node have uses not matched
2662 // by this pattern?
2663 if (ChainNodesMatched.back() != NodeToMatch &&
Chris Lattnerd847bc22010-09-21 22:00:25 +00002664 !RecordedNodes[RecNo].first.hasOneUse()) {
Chris Lattner2a49d572010-02-28 22:37:22 +00002665 ChainNodesMatched.clear();
2666 break;
2667 }
2668 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002669
Chris Lattner6b307922010-03-02 00:00:03 +00002670 // If the inner loop broke out, the match fails.
2671 if (ChainNodesMatched.empty())
2672 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002673
Chris Lattner6b307922010-03-02 00:00:03 +00002674 // Merge the input chains if they are not intra-pattern references.
2675 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002676
Chris Lattner6b307922010-03-02 00:00:03 +00002677 if (InputChain.getNode() == 0)
2678 break; // Failed to merge.
Chris Lattner2a49d572010-02-28 22:37:22 +00002679
Chris Lattner2a49d572010-02-28 22:37:22 +00002680 continue;
2681 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002682
Chris Lattner2a49d572010-02-28 22:37:22 +00002683 case OPC_EmitCopyToReg: {
2684 unsigned RecNo = MatcherTable[MatcherIndex++];
2685 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2686 unsigned DestPhysReg = MatcherTable[MatcherIndex++];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002687
Chris Lattner2a49d572010-02-28 22:37:22 +00002688 if (InputChain.getNode() == 0)
2689 InputChain = CurDAG->getEntryNode();
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002690
Chris Lattner2a49d572010-02-28 22:37:22 +00002691 InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(),
Chris Lattnerd847bc22010-09-21 22:00:25 +00002692 DestPhysReg, RecordedNodes[RecNo].first,
Chris Lattnera4359be2010-12-23 17:13:18 +00002693 InputGlue);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002694
Chris Lattnera4359be2010-12-23 17:13:18 +00002695 InputGlue = InputChain.getValue(1);
Chris Lattner2a49d572010-02-28 22:37:22 +00002696 continue;
2697 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002698
Chris Lattner2a49d572010-02-28 22:37:22 +00002699 case OPC_EmitNodeXForm: {
2700 unsigned XFormNo = MatcherTable[MatcherIndex++];
2701 unsigned RecNo = MatcherTable[MatcherIndex++];
2702 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002703 SDValue Res = RunSDNodeXForm(RecordedNodes[RecNo].first, XFormNo);
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002704 RecordedNodes.push_back(std::pair<SDValue,SDNode*>(Res, (SDNode*) 0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002705 continue;
2706 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002707
Chris Lattner2a49d572010-02-28 22:37:22 +00002708 case OPC_EmitNode:
2709 case OPC_MorphNodeTo: {
Chris Lattner14df8dc2010-02-28 22:38:43 +00002710 uint16_t TargetOpc = MatcherTable[MatcherIndex++];
2711 TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
Chris Lattner2a49d572010-02-28 22:37:22 +00002712 unsigned EmitNodeInfo = MatcherTable[MatcherIndex++];
2713 // Get the result VT list.
2714 unsigned NumVTs = MatcherTable[MatcherIndex++];
2715 SmallVector<EVT, 4> VTs;
2716 for (unsigned i = 0; i != NumVTs; ++i) {
2717 MVT::SimpleValueType VT =
2718 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2719 if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy;
2720 VTs.push_back(VT);
2721 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002722
Chris Lattner2a49d572010-02-28 22:37:22 +00002723 if (EmitNodeInfo & OPFL_Chain)
2724 VTs.push_back(MVT::Other);
Chris Lattnera4359be2010-12-23 17:13:18 +00002725 if (EmitNodeInfo & OPFL_GlueOutput)
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002726 VTs.push_back(MVT::Glue);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002727
Chris Lattner7d892d62010-03-01 07:43:08 +00002728 // This is hot code, so optimize the two most common cases of 1 and 2
2729 // results.
2730 SDVTList VTList;
2731 if (VTs.size() == 1)
2732 VTList = CurDAG->getVTList(VTs[0]);
2733 else if (VTs.size() == 2)
2734 VTList = CurDAG->getVTList(VTs[0], VTs[1]);
2735 else
2736 VTList = CurDAG->getVTList(VTs.data(), VTs.size());
Chris Lattner2a49d572010-02-28 22:37:22 +00002737
2738 // Get the operand list.
2739 unsigned NumOps = MatcherTable[MatcherIndex++];
2740 SmallVector<SDValue, 8> Ops;
2741 for (unsigned i = 0; i != NumOps; ++i) {
2742 unsigned RecNo = MatcherTable[MatcherIndex++];
2743 if (RecNo & 128)
2744 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002745
Chris Lattner2a49d572010-02-28 22:37:22 +00002746 assert(RecNo < RecordedNodes.size() && "Invalid EmitNode");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002747 Ops.push_back(RecordedNodes[RecNo].first);
Chris Lattner2a49d572010-02-28 22:37:22 +00002748 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002749
Chris Lattner2a49d572010-02-28 22:37:22 +00002750 // If there are variadic operands to add, handle them now.
2751 if (EmitNodeInfo & OPFL_VariadicInfo) {
2752 // Determine the start index to copy from.
2753 unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo);
2754 FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0;
2755 assert(NodeToMatch->getNumOperands() >= FirstOpToCopy &&
2756 "Invalid variadic node");
Chris Lattnera4359be2010-12-23 17:13:18 +00002757 // Copy all of the variadic operands, not including a potential glue
Chris Lattner2a49d572010-02-28 22:37:22 +00002758 // input.
2759 for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands();
2760 i != e; ++i) {
2761 SDValue V = NodeToMatch->getOperand(i);
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002762 if (V.getValueType() == MVT::Glue) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002763 Ops.push_back(V);
2764 }
2765 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002766
Chris Lattnera4359be2010-12-23 17:13:18 +00002767 // If this has chain/glue inputs, add them.
Chris Lattner2a49d572010-02-28 22:37:22 +00002768 if (EmitNodeInfo & OPFL_Chain)
2769 Ops.push_back(InputChain);
Chris Lattnera4359be2010-12-23 17:13:18 +00002770 if ((EmitNodeInfo & OPFL_GlueInput) && InputGlue.getNode() != 0)
2771 Ops.push_back(InputGlue);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002772
Chris Lattner2a49d572010-02-28 22:37:22 +00002773 // Create the node.
2774 SDNode *Res = 0;
2775 if (Opcode != OPC_MorphNodeTo) {
2776 // If this is a normal EmitNode command, just create the new node and
2777 // add the results to the RecordedNodes list.
2778 Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(),
2779 VTList, Ops.data(), Ops.size());
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002780
Chris Lattnera4359be2010-12-23 17:13:18 +00002781 // Add all the non-glue/non-chain results to the RecordedNodes list.
Chris Lattner2a49d572010-02-28 22:37:22 +00002782 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002783 if (VTs[i] == MVT::Other || VTs[i] == MVT::Glue) break;
Chris Lattnerd847bc22010-09-21 22:00:25 +00002784 RecordedNodes.push_back(std::pair<SDValue,SDNode*>(SDValue(Res, i),
Oscar Fuentesdf30bdb2010-09-23 16:59:36 +00002785 (SDNode*) 0));
Chris Lattner2a49d572010-02-28 22:37:22 +00002786 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002787
Chris Lattner2a49d572010-02-28 22:37:22 +00002788 } else {
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00002789 Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(),
2790 EmitNodeInfo);
Chris Lattner2a49d572010-02-28 22:37:22 +00002791 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002792
Chris Lattnera4359be2010-12-23 17:13:18 +00002793 // If the node had chain/glue results, update our notion of the current
2794 // chain and glue.
2795 if (EmitNodeInfo & OPFL_GlueOutput) {
2796 InputGlue = SDValue(Res, VTs.size()-1);
Chris Lattner2a49d572010-02-28 22:37:22 +00002797 if (EmitNodeInfo & OPFL_Chain)
2798 InputChain = SDValue(Res, VTs.size()-2);
2799 } else if (EmitNodeInfo & OPFL_Chain)
2800 InputChain = SDValue(Res, VTs.size()-1);
2801
Chris Lattnera4359be2010-12-23 17:13:18 +00002802 // If the OPFL_MemRefs glue is set on this node, slap all of the
Chris Lattner2a49d572010-02-28 22:37:22 +00002803 // accumulated memrefs onto it.
2804 //
2805 // FIXME: This is vastly incorrect for patterns with multiple outputs
2806 // instructions that access memory and for ComplexPatterns that match
2807 // loads.
2808 if (EmitNodeInfo & OPFL_MemRefs) {
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002809 // Only attach load or store memory operands if the generated
2810 // instruction may load or store.
Evan Chenge837dea2011-06-28 19:10:37 +00002811 const MCInstrDesc &MCID = TM.getInstrInfo()->get(TargetOpc);
2812 bool mayLoad = MCID.mayLoad();
2813 bool mayStore = MCID.mayStore();
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002814
2815 unsigned NumMemRefs = 0;
2816 for (SmallVector<MachineMemOperand*, 2>::const_iterator I =
2817 MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
2818 if ((*I)->isLoad()) {
2819 if (mayLoad)
2820 ++NumMemRefs;
2821 } else if ((*I)->isStore()) {
2822 if (mayStore)
2823 ++NumMemRefs;
2824 } else {
2825 ++NumMemRefs;
2826 }
2827 }
2828
Chris Lattner2a49d572010-02-28 22:37:22 +00002829 MachineSDNode::mmo_iterator MemRefs =
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002830 MF->allocateMemRefsArray(NumMemRefs);
2831
2832 MachineSDNode::mmo_iterator MemRefsPos = MemRefs;
2833 for (SmallVector<MachineMemOperand*, 2>::const_iterator I =
2834 MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) {
2835 if ((*I)->isLoad()) {
2836 if (mayLoad)
2837 *MemRefsPos++ = *I;
2838 } else if ((*I)->isStore()) {
2839 if (mayStore)
2840 *MemRefsPos++ = *I;
2841 } else {
2842 *MemRefsPos++ = *I;
2843 }
2844 }
2845
Chris Lattner2a49d572010-02-28 22:37:22 +00002846 cast<MachineSDNode>(Res)
Cameron Zwarich5a4b3d82011-05-19 23:44:34 +00002847 ->setMemRefs(MemRefs, MemRefs + NumMemRefs);
Chris Lattner2a49d572010-02-28 22:37:22 +00002848 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002849
Chris Lattner2a49d572010-02-28 22:37:22 +00002850 DEBUG(errs() << " "
2851 << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created")
2852 << " node: "; Res->dump(CurDAG); errs() << "\n");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002853
Chris Lattner2a49d572010-02-28 22:37:22 +00002854 // If this was a MorphNodeTo then we're completely done!
2855 if (Opcode == OPC_MorphNodeTo) {
Chris Lattnera4359be2010-12-23 17:13:18 +00002856 // Update chain and glue uses.
2857 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2858 InputGlue, GlueResultNodesMatched, true);
Chris Lattner82dd3d32010-03-02 07:50:03 +00002859 return Res;
Chris Lattner2a49d572010-02-28 22:37:22 +00002860 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002861
Chris Lattner2a49d572010-02-28 22:37:22 +00002862 continue;
2863 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002864
Chris Lattner29d8f0c2010-12-23 17:24:32 +00002865 case OPC_MarkGlueResults: {
Chris Lattner2a49d572010-02-28 22:37:22 +00002866 unsigned NumNodes = MatcherTable[MatcherIndex++];
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002867
Chris Lattnera4359be2010-12-23 17:13:18 +00002868 // Read and remember all the glue-result nodes.
Chris Lattner2a49d572010-02-28 22:37:22 +00002869 for (unsigned i = 0; i != NumNodes; ++i) {
2870 unsigned RecNo = MatcherTable[MatcherIndex++];
2871 if (RecNo & 128)
2872 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
2873
2874 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnera4359be2010-12-23 17:13:18 +00002875 GlueResultNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
Chris Lattner2a49d572010-02-28 22:37:22 +00002876 }
2877 continue;
2878 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002879
Chris Lattner2a49d572010-02-28 22:37:22 +00002880 case OPC_CompleteMatch: {
2881 // The match has been completed, and any new nodes (if any) have been
2882 // created. Patch up references to the matched dag to use the newly
2883 // created nodes.
2884 unsigned NumResults = MatcherTable[MatcherIndex++];
2885
2886 for (unsigned i = 0; i != NumResults; ++i) {
2887 unsigned ResSlot = MatcherTable[MatcherIndex++];
2888 if (ResSlot & 128)
2889 ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002890
Chris Lattner2a49d572010-02-28 22:37:22 +00002891 assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame");
Chris Lattnerd847bc22010-09-21 22:00:25 +00002892 SDValue Res = RecordedNodes[ResSlot].first;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002893
Chris Lattnerb0e483e2010-03-28 05:54:03 +00002894 assert(i < NodeToMatch->getNumValues() &&
2895 NodeToMatch->getValueType(i) != MVT::Other &&
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002896 NodeToMatch->getValueType(i) != MVT::Glue &&
Chris Lattnerb0e483e2010-03-28 05:54:03 +00002897 "Invalid number of results to complete!");
Chris Lattner2a49d572010-02-28 22:37:22 +00002898 assert((NodeToMatch->getValueType(i) == Res.getValueType() ||
2899 NodeToMatch->getValueType(i) == MVT::iPTR ||
2900 Res.getValueType() == MVT::iPTR ||
2901 NodeToMatch->getValueType(i).getSizeInBits() ==
2902 Res.getValueType().getSizeInBits()) &&
2903 "invalid replacement");
2904 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res);
2905 }
2906
Chris Lattner29d8f0c2010-12-23 17:24:32 +00002907 // If the root node defines glue, add it to the glue nodes to update list.
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00002908 if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Glue)
Chris Lattnera4359be2010-12-23 17:13:18 +00002909 GlueResultNodesMatched.push_back(NodeToMatch);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002910
Chris Lattnera4359be2010-12-23 17:13:18 +00002911 // Update chain and glue uses.
2912 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2913 InputGlue, GlueResultNodesMatched, false);
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002914
Chris Lattner2a49d572010-02-28 22:37:22 +00002915 assert(NodeToMatch->use_empty() &&
2916 "Didn't replace all uses of the node?");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002917
Chris Lattner2a49d572010-02-28 22:37:22 +00002918 // FIXME: We just return here, which interacts correctly with SelectRoot
2919 // above. We should fix this to not return an SDNode* anymore.
2920 return 0;
2921 }
2922 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002923
Chris Lattner2a49d572010-02-28 22:37:22 +00002924 // If the code reached this point, then the match failed. See if there is
2925 // another child to try in the current 'Scope', otherwise pop it until we
2926 // find a case to check.
Dan Gohman19b38262010-03-09 02:15:05 +00002927 DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n");
Chris Lattnerbed993d2010-03-28 19:46:56 +00002928 ++NumDAGIselRetries;
Chris Lattner2a49d572010-02-28 22:37:22 +00002929 while (1) {
2930 if (MatchScopes.empty()) {
2931 CannotYetSelect(NodeToMatch);
2932 return 0;
2933 }
2934
2935 // Restore the interpreter state back to the point where the scope was
2936 // formed.
2937 MatchScope &LastScope = MatchScopes.back();
2938 RecordedNodes.resize(LastScope.NumRecordedNodes);
2939 NodeStack.clear();
2940 NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());
2941 N = NodeStack.back();
2942
Chris Lattner2a49d572010-02-28 22:37:22 +00002943 if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size())
2944 MatchedMemRefs.resize(LastScope.NumMatchedMemRefs);
2945 MatcherIndex = LastScope.FailIndex;
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002946
Dan Gohman19b38262010-03-09 02:15:05 +00002947 DEBUG(errs() << " Continuing at " << MatcherIndex << "\n");
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002948
Chris Lattner2a49d572010-02-28 22:37:22 +00002949 InputChain = LastScope.InputChain;
Chris Lattnera4359be2010-12-23 17:13:18 +00002950 InputGlue = LastScope.InputGlue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002951 if (!LastScope.HasChainNodesMatched)
2952 ChainNodesMatched.clear();
Chris Lattnera4359be2010-12-23 17:13:18 +00002953 if (!LastScope.HasGlueResultNodesMatched)
2954 GlueResultNodesMatched.clear();
Chris Lattner2a49d572010-02-28 22:37:22 +00002955
2956 // Check to see what the offset is at the new MatcherIndex. If it is zero
2957 // we have reached the end of this scope, otherwise we have another child
2958 // in the current scope to try.
2959 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2960 if (NumToSkip & 128)
2961 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2962
2963 // If we have another child in this scope to match, update FailIndex and
2964 // try it.
2965 if (NumToSkip != 0) {
2966 LastScope.FailIndex = MatcherIndex+NumToSkip;
2967 break;
2968 }
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002969
Chris Lattner2a49d572010-02-28 22:37:22 +00002970 // End of this scope, pop it and try the next child in the containing
2971 // scope.
2972 MatchScopes.pop_back();
2973 }
2974 }
2975}
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002976
Chris Lattner2a49d572010-02-28 22:37:22 +00002977
2978
Dan Gohmaneeb3a002010-01-05 01:24:18 +00002979void SelectionDAGISel::CannotYetSelect(SDNode *N) {
Dan Gohmane1f188f2009-10-29 22:30:23 +00002980 std::string msg;
2981 raw_string_ostream Msg(msg);
Chris Lattner5df15782010-12-21 02:07:03 +00002982 Msg << "Cannot select: ";
Andrew Trick6e8f4c42010-12-24 04:28:06 +00002983
Chris Lattner2c4afd12010-03-04 00:21:16 +00002984 if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN &&
2985 N->getOpcode() != ISD::INTRINSIC_WO_CHAIN &&
2986 N->getOpcode() != ISD::INTRINSIC_VOID) {
2987 N->printrFull(Msg, CurDAG);
2988 } else {
2989 bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other;
2990 unsigned iid =
2991 cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue();
2992 if (iid < Intrinsic::num_intrinsics)
2993 Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid);
2994 else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo())
2995 Msg << "target intrinsic %" << TII->getName(iid);
2996 else
2997 Msg << "unknown intrinsic #" << iid;
2998 }
Chris Lattner75361b62010-04-07 22:58:41 +00002999 report_fatal_error(Msg.str());
Dan Gohmane1f188f2009-10-29 22:30:23 +00003000}
3001
Devang Patel19974732007-05-03 01:11:54 +00003002char SelectionDAGISel::ID = 0;